Searched refs:child_i (Results 1 – 5 of 5) sorted by relevance
| /netbsd/src/common/lib/libc/stdlib/ |
| D | heapsort.c | 111 #define CREATE(initval, nmemb, par_i, child_i, par, child, size, count, tmp) { \ argument
112 for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
113 par_i = child_i) { \
114 child = base + child_i * size; \
115 if (child_i < nmemb && \
118 ++child_i; \
144 #define SELECT(par_i, child_i, nmemb, par, child, size, k, count, tmp1, tmp2) { \ argument
145 for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
146 child = base + child_i * size; \
147 if (child_i < nmemb && \
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
| D | constructors_destructor_fn_imps.hpp | 183 size_type child_i = 0; in recursive_copy_node() local
193 a_p_children[child_i] = recursive_copy_node(*(child_it)); in recursive_copy_node()
194 child_i++; in recursive_copy_node()
201 while (child_i-- > 0) in recursive_copy_node()
202 clear_imp(a_p_children[child_i]); in recursive_copy_node()
208 --child_i; in recursive_copy_node()
209 _GLIBCXX_DEBUG_ASSERT(child_i >= 1); in recursive_copy_node()
211 p_ret->add_child(a_p_children[child_i], pref_begin(a_p_children[child_i]), in recursive_copy_node()
212 pref_end(a_p_children[child_i]), this); in recursive_copy_node()
213 while (child_i-- > 0); in recursive_copy_node()
|
| D | trace_fn_imps.hpp | 89 for (size_type child_i = 0; child_i < num_children; ++child_i) in trace_node() local
92 std::advance(child_it, num_children - child_i - 1); in trace_node()
|
| /netbsd/src/external/gpl3/gdb/dist/gdb/ |
| D | gdb-gdb.py.in | 390 child_i = 0
398 yield (str(child_i), entry)
399 child_i += 1
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | dominance.cc | 364 TBB child_i = m_dfs_order[bn->index] = m_dfsnum++; in calc_dfs_tree_nonrec() local
365 m_dfs_to_bb[child_i] = bn; in calc_dfs_tree_nonrec()
366 m_dfs_parent[child_i] = my_i; in calc_dfs_tree_nonrec()
|