Searched refs:child_i (Results 1 - 4 of 4) sorted by relevance

/freebsd-10.3-release/lib/libc/stdlib/
H A Dheapsort.c76 #define CREATE(initval, nmemb, par_i, child_i, par, child, size, count, tmp) { \
77 for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
78 par_i = child_i) { \
79 child = base + child_i * size; \
80 if (child_i < nmemb && compar(child, child + size) < 0) { \
82 ++child_i; \
108 #define SELECT(par_i, child_i, nmemb, par, child, size, k, count, tmp1, tmp2) { \
109 for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
110 child = base + child_i * siz
[all...]
/freebsd-10.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dtrace_fn_imps.hpp94 for (size_type child_i = 0; child_i < num_children; ++child_i)
98 std::advance(child_it, num_children - child_i - 1);
H A Dconstructors_destructor_fn_imps.hpp188 size_type child_i = 0; local
199 a_p_children[child_i++] = recursive_copy_node(*(child_it++));
204 while (child_i-- > 0)
205 clear_imp(a_p_children[child_i]);
212 --child_i;
213 _GLIBCXX_DEBUG_ASSERT(child_i > 1);
215 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]),
216 pref_end(a_p_children[child_i]), this);
217 while (child_i
[all...]
/freebsd-10.3-release/contrib/gcc/
H A Ddominance.c207 TBB child_i, my_i = 0; local
281 child_i = di->dfs_order[bn->index] = di->dfsnum++;
282 di->dfs_to_bb[child_i] = bn;
283 di->dfs_parent[child_i] = my_i;

Completed in 109 milliseconds