Searched refs:word_idx (Results 1 - 7 of 7) sorted by relevance
| /third_party/node/deps/v8/src/heap/ |
| H A D | slot-set.h | 71 size_t word_idx = bucket_index / kBitsPerWord; in Contains() local
72 uintptr_t* word = BitmapArray() + word_idx; in Contains()
99 for (size_t word_idx = 1; word_idx < words; word_idx++) { in Allocate()
100 ptr[word_idx] = 0; in Allocate()
108 size_t word_idx = bucket_index / kBitsPerWord; in InsertAllocated() local
109 uintptr_t* word = BitmapArray() + word_idx; in InsertAllocated()
|
| /third_party/mesa3d/src/panfrost/bifrost/ |
| H A D | bi_pack.c | 408 unsigned word_idx, unsigned constant_words, bool ec0_packed, in bi_pack_constants()
411 unsigned index = (word_idx << 1) + ec0_packed; in bi_pack_constants()
414 bool more = (word_idx + 1) < constant_words; in bi_pack_constants()
431 assert(word_idx < 3); in bi_pack_constants()
432 unsigned pos = pos_lookup[tuple_count - 1][word_idx]; in bi_pack_constants()
433 assert(pos != 0 || (tuple_count == 1 && word_idx == 0)); in bi_pack_constants()
407 bi_pack_constants(unsigned tuple_count, uint64_t *constants, unsigned word_idx, unsigned constant_words, bool ec0_packed, struct util_dynarray *emission) bi_pack_constants() argument
|
| H A D | bi_schedule.c | 107 unsigned word_idx; member
1499 consts[t].word_idx = idx; in bi_merge_pairs()
1551 consts[t].word_idx = idx; in bi_merge_singles()
1583 if (consts[t].word_idx == i) in bi_swap_constants()
1584 consts[t].word_idx = (i + 1); in bi_swap_constants()
1585 else if (consts[t].word_idx == (i + 1)) in bi_swap_constants()
1586 consts[t].word_idx = i; in bi_swap_constants()
1856 unsigned word_idx = clause_state.consts[i].word_idx; in bi_schedule_clause() local
1857 assert(word_idx < in bi_schedule_clause()
[all...] |
| /third_party/node/deps/brotli/c/enc/ |
| H A D | hash.h | 137 const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx, in TestStaticDictionaryItem()
144 offset = dictionary->words->offsets_by_length[len] + len * word_idx; in TestStaticDictionaryItem()
158 backward = max_backward + 1 + word_idx + in TestStaticDictionaryItem()
136 TestStaticDictionaryItem( const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out) TestStaticDictionaryItem() argument
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | hash.h | 137 const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx, in TestStaticDictionaryItem()
144 offset = dictionary->words->offsets_by_length[len] + len * word_idx; in TestStaticDictionaryItem()
158 backward = max_backward + 1 + word_idx + in TestStaticDictionaryItem()
136 TestStaticDictionaryItem( const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out) TestStaticDictionaryItem() argument
|
| /third_party/node/deps/brotli/c/dec/ |
| H A D | decode.c | 1915 int word_idx = address & mask; in ProcessCommandsInternal() local
1919 offset += word_idx * i; in ProcessCommandsInternal()
|
| /third_party/skia/third_party/externals/brotli/c/dec/ |
| H A D | decode.c | 1915 int word_idx = address & mask; in ProcessCommandsInternal() local
1919 offset += word_idx * i; in ProcessCommandsInternal()
|
Completed in 16 milliseconds