Searched refs:tree_next (Results 1 – 2 of 2) sorted by relevance
202 node_t *ret = tree_next(tree, node); in remove_iterate_cb()289 tree_next(&tree, &nodes[k]); in TEST_BEGIN()
749 int tree_next, tree_cur; tinfl_huff_table *pTable; in tinfl_decompress() local758 for (tree_next = -1, sym_index = 0; sym_index < r->m_table_sizes[r->m_type]; ++sym_index) in tinfl_decompress()763 …p[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next; tree_cur = tree_next; tree_next … in tinfl_decompress()768 …_cur - 1]) { pTable->m_tree[-tree_cur - 1] = (mz_int16)tree_next; tree_cur = tree_next; tree_next … in tinfl_decompress()