Searched refs:bit_mask (Results 1 - 4 of 4) sorted by relevance

/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.inline.hpp45 *word_addr(bit) |= bit_mask(bit);
50 *word_addr(bit) &= ~bit_mask(bit);
56 const idx_t mask = bit_mask(bit);
77 const idx_t mask = ~bit_mask(bit);
316 bm_word_t mask = bit_mask(beg) - 1; // low (right) bits
318 mask |= ~(bit_mask(end) - 1); // high (left) bits
H A DbitMap.hpp66 static bm_word_t bit_mask(idx_t bit) { return (bm_word_t)1 << bit_in_word(bit); } function in class:VALUE_OBJ_CLASS_SPEC
148 return (*word_addr(index) & bit_mask(index)) != 0;
/openjdk7/hotspot/src/share/vm/interpreter/
H A DoopMapCache.hpp38 // bit_mask can fit into two words it is stored in
40 // For OopMapCacheEntry the bit_mask is allocated in the C heap
42 // For InterpreterOopMap the bit_mask is allocated in
74 // for testing bit_mask allocation
97 // methd bit_mask().
112 uintptr_t* bit_mask() { return (uintptr_t*)(mask_size() <= small_mask_limit ? (intptr_t)_bit_mask : _bit_mask[0]); } function in class:InterpreterOopMap
119 uintptr_t entry_at(int offset) { int i = offset * bits_per_entry; return bit_mask()[i / BitsPerWord] >> (i % BitsPerWord); }
H A DoopMapCache.cpp172 // bit_mask effective (see how FREE_RESOURCE_ARRAY does a free).
174 // but the space for the bit_mask is not freed.
221 value = bit_mask()[word_index++];
248 value = bit_mask()[word_index++];
370 MaskFillerForNative mf(mh, bit_mask(), mask_size());
413 bit_mask()[word_index++] = value;
438 bit_mask()[word_index] = value;
486 // Allocate the bit_mask from a Resource area for performance. Allocating

Completed in 76 milliseconds