Lines Matching +defs:next +defs:depth
60 policy_set_t next = node->oid_next;
61 secdebug("policy-set", "%p -> %p", node, next);
63 node = next;
124 /* Walk the nodes in a tree at depth and invoke callback for each one. */
125 bool policy_tree_walk_depth(policy_tree_t root, int depth,
127 policy_tree_t stack[depth + 1];
137 if (!child_visited && stack_ix < depth && child ) {
139 required depth yet, we go depth first and proccess it. */
142 if (stack_ix == depth) {
187 /* Prune childless nodes at depth. */
188 void policy_tree_prune_childless(policy_tree_t *root, int depth) {
189 policy_tree_t *stack[depth + 1];
197 if (!child_visited && stack_ix < depth && *child) {
199 required depth yet, we go depth first and proccess it. */
204 printf("# prune /<%.08lx<\\ |%.08lx| >%.08lx> :%s: depth %d\n",
209 policy_tree_t next = (*node)->siblings;
212 *node = next;
213 if (next) {
214 /* stack[stack_ix] (node) already points to next now. */
279 policy_tree_t prev_sibling, int depth) {
283 printf("# %.*s/%.08lx\\ |%.08lx| <%.08lx< >%.08lx> depth %d\n",
284 depth * 11, spaces,
286 (intptr_t)sibling, depth);
288 policy_tree_dump4(child, node, NULL, depth + 1);
290 policy_tree_dump4(sibling, parent, node, depth);