Searched refs:first_child (Results 1 – 7 of 7) sorted by relevance
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_tree.c | 278 int (*first_child)(struct cil_tree_node *node, void *extra_args), in cil_tree_walk_core()
300 rc = cil_tree_walk(node, process_node, first_child, last_child, extra_args); in cil_tree_walk_core()
314 int (*first_child)(struct cil_tree_node *node, void *extra_args), in cil_tree_walk()
324 if (first_child != NULL) { in cil_tree_walk()
325 rc = (*first_child)(node->cl_head, extra_args); in cil_tree_walk()
332 rc = cil_tree_walk_core(node->cl_head, process_node, first_child, last_child, extra_args); in cil_tree_walk()
|
| D | cil_tree.h | 72 …ruct cil_tree_node *node, uint32_t *finished, void *extra_args), int (*first_child)(struct cil_tre…
|
| /third_party/glib/gio/tests/ |
| D | gdbus-non-socket.c | 135 pid_t first_child; in test_non_socket() local
152 switch ((first_child = fork ())) in test_non_socket()
229 g_assert_cmpint (kill (first_child, SIGTERM), ==, 0); in test_non_socket()
|
| /third_party/boost/boost/heap/ |
| D | d_ary_heap.hpp | 320 const size_t first_child = first_child_index(index); in not_leaf() local
321 return first_child < q_.size(); in not_leaf()
331 const container_iterator first_child = q_.begin() + first_index; in top_child_index() local
334 const size_type max_elements = std::distance(first_child, end); in top_child_index()
336 const container_iterator last_child = (max_elements > D) ? first_child + D in top_child_index()
339 …const container_iterator min_element = std::max_element(first_child, last_child, static_cast<super… in top_child_index()
|
| D | pairing_heap.hpp | 685 node_pointer first_child = static_cast<node_pointer>(&children.front()); in merge_first_pair() local
688 return first_child; in merge_first_pair()
693 return merge_nodes(first_child, second_child); in merge_first_pair()
|
| /third_party/e2fsprogs/lib/support/ |
| D | profile.c | 144 struct profile_node *first_child; member
1062 for (child=node->first_child; child; child = next) { in profile_free_node()
1127 if (node->value && node->first_child) in profile_verify_node()
1131 for (p = node->first_child; p; last = p, p = p->next) { in profile_verify_node()
1167 for (p=section->first_child, last = 0; p; last = p, p = p->next) { in profile_add_node()
1186 section->first_child = new; in profile_add_node()
1217 p = section->first_child; in profile_find_node()
1396 for (p=section->first_child; p; p = p->next) { in profile_node_iterator()
1415 iter->node = section->first_child; in profile_node_iterator()
|
| /third_party/grpc/src/core/lib/surface/ |
| D | call.cc | 123 grpc_call* first_child = nullptr; member
444 if (pc->first_child == nullptr) { in grpc_call_create()
445 pc->first_child = call; in grpc_call_create()
448 cc->sibling_next = pc->first_child; in grpc_call_create()
449 cc->sibling_prev = pc->first_child->child->sibling_prev; in grpc_call_create()
591 if (c == pc->first_child) { in grpc_call_unref()
592 pc->first_child = cc->sibling_next; in grpc_call_unref()
593 if (c == pc->first_child) { in grpc_call_unref()
594 pc->first_child = nullptr; in grpc_call_unref()
1210 child = pc->first_child; in post_batch_completion()
[all …]
|