Home
last modified time | relevance | path

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

/third_party/node/deps/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h44 its root is at invalid_pos_ and a node is a leaf if both its children
45 are at invalid_pos_. */
46 uint32_t invalid_pos_; member
64 self->invalid_pos_ = (uint32_t)(0 - self->window_mask_); in Initialize()
70 uint32_t invalid_pos = self->invalid_pos_; in Prepare()
148 forest[node_left] = self->invalid_pos_; in StoreAndFindMatches()
149 forest[node_right] = self->invalid_pos_; in StoreAndFindMatches()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h44 its root is at invalid_pos_ and a node is a leaf if both its children
45 are at invalid_pos_. */
46 uint32_t invalid_pos_; member
64 self->invalid_pos_ = (uint32_t)(0 - self->window_mask_); in Initialize()
70 uint32_t invalid_pos = self->invalid_pos_; in Prepare()
148 forest[node_left] = self->invalid_pos_; in StoreAndFindMatches()
149 forest[node_right] = self->invalid_pos_; in StoreAndFindMatches()

Completed in 2 milliseconds