Searched refs:NoBits (Results 1 - 8 of 8) sorted by relevance

/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/utilities/
H A DBits.java31 public static final int NoBits = 0; field in class:Bits
62 return maskBits(word, nthBit(n)) != NoBits;
H A DBitMap.java73 data[i] = Bits.NoBits;
80 for (int offset = index * bitsPerWord; rest != Bits.NoBits; offset++) {
/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.inline.hpp176 if (res != (uintptr_t)NoBits) {
192 // is a set bit in that map word above l_offset (i.e. res != NoBits).
200 // word (i.e. res == NoBits), or res_offset will be less than r_offset.
210 if (res != (uintptr_t)NoBits) {
281 if (res != (uintptr_t)NoBits) {
293 if (res != (uintptr_t)NoBits) {
H A DbitMap.cpp434 if (*word != (bm_word_t) NoBits) return false;
437 return rest == 0 || (*word & right_n_bits((int)rest)) == (bm_word_t) NoBits;
457 for (; offset < rightOffset && rest != (bm_word_t)NoBits; offset++) {
H A DglobalDefinitions.hpp920 const intptr_t NoBits = 0; // no bits set in a word variable
940 inline bool is_set_nth_bit(intptr_t x, int n) { return mask_bits (x, nth_bit(n)) != NoBits; }
980 return ((x != NoBits) && (mask_bits(x, x - 1) == NoBits));
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepThread.hpp64 CMS_nil = NoBits,
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1BlockOffsetTable.cpp96 return (delta & right_n_bits(LogN_words)) == (size_t)NoBits;
/openjdk7/hotspot/src/share/vm/memory/
H A DblockOffsetTable.cpp97 return (delta & right_n_bits(LogN_words)) == (size_t)NoBits;

Completed in 2803 milliseconds