Searched refs:depth (Results 1 – 13 of 13) sorted by relevance
| /glibc-2.36/misc/ |
| D | tst-tsearch.c | 83 int depth; member
123 int depth; member
134 closure->action (nodep, which, closure->depth); in twalk_with_twalk_r_action()
137 closure->action (nodep, which, closure->depth); in twalk_with_twalk_r_action()
138 ++closure->depth; in twalk_with_twalk_r_action()
142 closure->action (nodep, which, closure->depth - 1); in twalk_with_twalk_r_action()
145 --closure->depth; in twalk_with_twalk_r_action()
146 closure->action (nodep, which, closure->depth); in twalk_with_twalk_r_action()
157 TEST_COMPARE (closure.depth, 0); in twalk_with_twalk_r()
161 walk_action (const void *nodep, const VISIT which, const int depth) in walk_action() argument
[all …]
|
| /glibc-2.36/manual/examples/ |
| D | twalk.c | 23 int depth; member
34 closure->action (nodep, which, closure->depth); in twalk_with_twalk_r_action()
37 closure->action (nodep, which, closure->depth); in twalk_with_twalk_r_action()
38 ++closure->depth; in twalk_with_twalk_r_action()
42 closure->action (nodep, which, closure->depth - 1); in twalk_with_twalk_r_action()
45 --closure->depth; in twalk_with_twalk_r_action()
46 closure->action (nodep, which, closure->depth); in twalk_with_twalk_r_action()
|
| /glibc-2.36/argp/ |
| D | argp-help.c | 407 int depth; member
520 cl->depth = parent ? parent->depth + 1 : 0; in hol_add_cluster()
731 if (cl1->depth > cl2->depth) in hol_cluster_cmp()
735 while (cl1->depth > cl2->depth); in hol_cluster_cmp()
742 else if (cl1->depth < cl2->depth) in hol_cluster_cmp()
746 while (cl1->depth < cl2->depth); in hol_cluster_cmp()
|
| /glibc-2.36/posix/ |
| D | wordexp.c | 1199 int depth = 0; in parse_param() local
1322 ++depth; in parse_param()
1328 if (depth == 0) in parse_param()
1330 --depth; in parse_param()
2020 int depth = 0; in parse_dollars() local
2021 while (words[i] && !(depth == 0 && words[i] == ')')) in parse_dollars()
2024 ++depth; in parse_dollars()
2026 --depth; in parse_dollars()
|
| D | glob.c | 268 size_t depth = 0; in next_brace_sub() local
278 if ((*cp == '}' && depth-- == 0) || (*cp == ',' && depth == 0)) in next_brace_sub()
282 depth++; in next_brace_sub()
|
| /glibc-2.36/io/ |
| D | ftwtest-sh | 87 $testprogram --depth $tmpdir |
|
| /glibc-2.36/nss/ |
| D | makedb.c | 577 copy_valstr (const void *nodep, const VISIT which, const int depth) in copy_valstr() argument
|
| /glibc-2.36/manual/ |
| D | search.texi | 580 which corresponds to the depth of the current node in the tree. The
581 root node has the depth @math{0} and its children have a depth of
|
| D | tunables.texi | 335 topological sort through depth-first search, and does not exhibit the
|
| D | texinfo.tex | 656 % The \vtop produces a box with normal height and large depth; thus, TeX puts
1821 depth \strutdepthpercent \baselineskip
2732 % Count depth in font-changes, for error checks
4519 % A count to remember the depth of nesting.
|
| D | filesys.texi | 1121 (depth-first processing). This also means the type flag given to the
|
| /glibc-2.36/ChangeLog.old/ |
| D | ChangeLog.7 | 9107 * argp/argp-help.c (hol_add_cluster): Initialize CL->depth.
11166 * posix/glob.c (next_brace_sub): Decrement depth counter when '}'
|
| /glibc-2.36/ |
| D | NEWS | 246 topological sorting by depth-first search (DFS), solving performance issues
|