Searched refs:word (Results 1 - 12 of 12) sorted by relevance

/art/runtime/
H A Dglobals.h26 typedef intptr_t word; typedef in namespace:art
33 const int kWordSize = sizeof(word);
H A Dutils.h73 static inline bool IsInt(int N, word value) {
76 word limit = static_cast<word>(1) << (N - 1);
80 static inline bool IsUint(int N, word value) {
83 word limit = static_cast<word>(1) << N;
87 static inline bool IsAbsoluteUint(int N, word value) {
H A Dstack.cc272 const size_t kMaxExpectedFrameSize = 256 * sizeof(word) + 16;
/art/compiler/dex/
H A Darena_bit_vector.h50 uint32_t word = bit_storage_[word_index]; local
51 // Mask out any bits in the first word we've already considered.
52 word >>= bit_index_ & 0x1f;
53 if (word == 0) {
61 word = bit_storage_[word_index];
63 } while (word == 0);
65 bit_index_ += CTZ(word) + 1;
H A Darena_bit_vector.cc67 /* Round up to word boundaries for "num+1" bits */
120 for (unsigned int word = 0; word < storage_size_; word++) {
121 count += __builtin_popcount(storage_[word]);
/art/runtime/gc/accounting/
H A Dspace_bitmap-inl.h33 const word mask = OffsetToMask(offset);
34 word* const address = &bitmap_begin_[index];
36 word old_word;
101 // Handle the right edge, and also the left edge if both edges are on the same word.
104 // If word_start == word_end then we need to use the word which we removed the left bits.
125 const word mask = OffsetToMask(offset);
127 word* address = &bitmap_begin_[index];
128 word old_word = *address;
H A Dspace_bitmap.cc56 word* bitmap_begin = reinterpret_cast<word*>(mem_map->Begin());
108 word* bitmap_begin = bitmap_begin_;
110 word w = bitmap_begin[i];
151 word* live = live_bitmap.bitmap_begin_;
152 word* mark = mark_bitmap.bitmap_begin_;
154 word garbage = live[i] & ~mark[i];
163 // entire word of one bits.
255 word w = bitmap_begin_[i];
H A Dspace_bitmap.h75 static word OffsetToMask(uintptr_t offset_) {
144 word* Begin() {
185 SpaceBitmap(const std::string& name, MemMap* mem_map, word* bitmap_begin, size_t bitmap_size,
196 // This bitmap itself, word sized for efficiency in scanning.
197 word* const bitmap_begin_;
202 // The base address of the heap, which corresponds to the word containing the first bit in the
H A Dcard_table-inl.h56 while (!IsAligned<sizeof(word)>(card_cur) && card_cur < card_end) {
87 << "card " << static_cast<size_t>(*card) << " word " << (start_word & 0xFF);
128 while (!IsAligned<sizeof(word)>(card_cur) && card_cur < card_end) {
141 while (!IsAligned<sizeof(word)>(card_end) && card_end > card_cur) {
/art/runtime/arch/arm/
H A Dportable_entrypoints_arm.S83 sub sp, #8 @ 2 words of space, bottom word will hold Method*
115 sub sp, #8 @ 2 words of space, bottom word will hold Method*
157 sub sp, #8 @ 2 words of space, bottom word will hold Method*
H A Dquick_entrypoints_arm.S44 sub sp, #12 @ 3 words of space, bottom word will hold Method*
64 sub sp, #4 @ bottom word will hold Method*
100 sub sp, #8 @ 2 words of space, bottom word will hold Method*
958 * The low word of the result holds ZX, the high word holds
990 * r0: low word
991 * r1: high word
1012 * r0: low word
1013 * r1: high word
1034 * r0: low word
[all...]
/art/runtime/arch/mips/
H A Dquick_entrypoints_mips.S30 * callee-save: $s0-$s8 + $gp + $ra, 11 total + 1 word padding + 4 open words for args
57 # 1 word for alignment, 4 open words for args $a0-$a3, bottom will hold Method*
1007 * $a0: low word
1008 * $a1: high word
1031 * $a0: low word
1032 * $a1: high word
1056 * r0: low word
1057 * r1: high word

Completed in 611 milliseconds