Searched refs:BitsPerWord (Results 1 - 18 of 18) sorted by relevance

/openjdk7/hotspot/src/share/vm/interpreter/
H A DoopMapCache.hpp71 small_mask_limit = N * BitsPerWord, // the maximum number of bits
116 return (mask_size() + BitsPerWord - 1) / BitsPerWord;
119 uintptr_t entry_at(int offset) { int i = offset * bits_per_entry; return bit_mask()[i / BitsPerWord] >> (i % BitsPerWord); }
H A DoopMapCache.cpp284 _mask[i / BitsPerWord] |= (((uintptr_t) 1 << InterpreterOopMap::oop_bit_number) << (i % BitsPerWord));
298 int i = (size + BitsPerWord - 1) / BitsPerWord;
/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.hpp62 static idx_t bit_in_word(idx_t bit) { return bit & (BitsPerWord - 1); }
143 return word_index(size() + BitsPerWord - 1);
154 return align_size_up(bit, BitsPerWord);
157 return align_size_down(bit, BitsPerWord);
H A DbitMap.cpp422 for (; rest >= (idx_t) BitsPerWord; rest -= BitsPerWord) {
433 for (; rest >= (idx_t) BitsPerWord; rest -= BitsPerWord) {
456 idx_t rest = map(index) >> (offset & (BitsPerWord - 1));
462 rest = map(index) >> (offset & (BitsPerWord -1));
H A DbitMap.inline.hpp237 idx_t pos = res_offset & (BitsPerWord - 1);
332 idx_t bit_rounded_up = bit + (BitsPerWord - 1);
H A DglobalDefinitions.cpp173 BitsPerHeapOop = BitsPerWord;
H A DglobalDefinitions.hpp73 const int BitsPerWord = 1 << LogBitsPerWord; variable
926 #define nth_bit(n) (n >= BitsPerWord ? 0 : OneBit << (n))
928 #define left_n_bits(n) (right_n_bits(n) << (n >= BitsPerWord ? 0 : (BitsPerWord - n)))
/openjdk7/hotspot/src/share/vm/runtime/
H A DjfieldIDWorkaround.hpp53 address_bits = BitsPerWord - checked_bits - instance_bits,
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.cpp52 assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
54 const size_t words = bits / BitsPerWord;
H A DparMarkBitMap.hpp244 return bits_required(covered_region) / BitsPerWord;
/openjdk7/hotspot/src/cpu/zero/vm/
H A DcppInterpreter_zero.cpp410 result[0] <<= (BitsPerWord - BitsPerByte);
417 result[0] <<= (BitsPerWord - BitsPerShort);
424 result[0] <<= (BitsPerWord - BitsPerByte);
431 result[0] <<= (BitsPerWord - BitsPerShort);
438 result[0] <<= (BitsPerWord - BitsPerInt);
/openjdk7/hotspot/src/share/vm/oops/
H A DgenerateOopMap.hpp456 int binsToHold (int no) { return ((no+(BitsPerWord-1))/BitsPerWord); }
H A DmarkOop.hpp114 max_hash_bits = BitsPerWord - age_bits - lock_bits - biased_lock_bits,
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LinearScan.hpp185 int live_set_size() const { return round_to(_num_virtual_regs, BitsPerWord); }
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DcompactibleFreeListSpace.cpp87 _rescan_task_size(CardTableModRefBS::card_size_in_words * BitsPerWord *
89 _marking_task_size(CardTableModRefBS::card_size_in_words * BitsPerWord *
H A DconcurrentMarkSweepGeneration.cpp5357 const int alignment = CardTableModRefBS::card_size * BitsPerWord;
5703 CardTableModRefBS::card_size * BitsPerWord;
/openjdk7/hotspot/src/os/windows/vm/
H A Dos_windows.cpp3889 size_t max_address_space = ((size_t)1 << (BitsPerWord - 1)) - (200 * K * K);
/openjdk7/hotspot/src/cpu/x86/vm/
H A Dassembler_x86.cpp5878 const int n = BitsPerWord;
5898 const int n = BitsPerWord;

Completed in 1668 milliseconds