HomeSort by relevance Sort by last modified time
    Searched full:tree_next (Results 1 - 2 of 2) sorted by null

  /external/jemalloc/test/unit/
rb.c 201 node_t *ret = tree_next(tree, node);
288 tree_next(&tree, &nodes[k]);
  /external/valgrind/coregrind/m_debuginfo/
tinfl.c 345 int tree_next, tree_cur; tinfl_huff_table *pTable; local
354 for (tree_next = -1, sym_index = 0; sym_index < r->m_table_sizes[r->m_type]; ++sym_index)
359 if (0 == (tree_cur = pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)])) { pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next; tree_cur = tree_next; tree_next -= 2; }
364 if (!pTable->m_tree[-tree_cur - 1]) { pTable->m_tree[-tree_cur - 1] = (mz_int16)tree_next; tree_cur = tree_next; tree_next -= 2; } else tree_cur = pTable->m_tree[-tree_cur - 1];

Completed in 549 milliseconds