Home
last modified time | relevance | path

Searched refs:node_left (Results 1 - 2 of 2) sorted by relevance

/third_party/node/deps/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h129 size_t node_left = FN(LeftChildIndex)(self, cur_ix); in StoreAndFindMatches() local
148 forest[node_left] = self->invalid_pos_; in StoreAndFindMatches()
169 forest[node_left] = forest[FN(LeftChildIndex)(self, prev_ix)]; in StoreAndFindMatches()
177 forest[node_left] = (uint32_t)prev_ix; in StoreAndFindMatches()
179 node_left = FN(RightChildIndex)(self, prev_ix); in StoreAndFindMatches()
180 prev_ix = forest[node_left]; in StoreAndFindMatches()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h129 size_t node_left = FN(LeftChildIndex)(self, cur_ix); in StoreAndFindMatches() local
148 forest[node_left] = self->invalid_pos_; in StoreAndFindMatches()
169 forest[node_left] = forest[FN(LeftChildIndex)(self, prev_ix)]; in StoreAndFindMatches()
177 forest[node_left] = (uint32_t)prev_ix; in StoreAndFindMatches()
179 node_left = FN(RightChildIndex)(self, prev_ix); in StoreAndFindMatches()
180 prev_ix = forest[node_left]; in StoreAndFindMatches()

Completed in 3 milliseconds