| /third_party/FreeBSD/sys/dev/usb/implementation/ |
| H A D | usb_btree.c | 228 usbd_bt_node *parent_node;
in usbd_insert_bt_node() local
233 parent_node = usbd_pre_order_bt_node(tree, parent_info);
in usbd_insert_bt_node()
234 if (parent_node == NULL) {
in usbd_insert_bt_node()
239 if (parent_node->info.nameunit == node->info.nameunit) { /* The same hub node. */
in usbd_insert_bt_node()
240 parent_node->rbt_node = node;
in usbd_insert_bt_node()
242 parent_node->lbt_node = node;
in usbd_insert_bt_node()
247 parent_node, parent_node->info.nameunit, parent_node->info.port_no,
in usbd_insert_bt_node()
248 (parent_node in usbd_insert_bt_node()
[all...] |
| /third_party/libabigail/tests/ |
| H A D | test-dot.cc | 15 parent_node p("base"); in main()
25 parent_node p("base"); in main()
36 parent_node p("base"); in main()
47 parent_node p("base"); in main()
|
| /third_party/libabigail/include/ |
| H A D | abg-viz-dot.h | 52 struct parent_node : public node_base struct
54 parent_node(const std::string& __id) in parent_node() function
128 add_parent(const parent_node&);
|
| H A D | abg-comparison.h | 976 parent_node() const;
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | control-equivalence.cc | 61 void ControlEquivalence::VisitPost(Node* node, Node* parent_node, in VisitPost() argument
70 if (parent_node != nullptr) { in VisitPost()
71 BracketList& parent_blist = GetBracketList(parent_node); in VisitPost()
108 if (input != entry.parent_node) { in RunUndirectedDFS()
138 if (use != entry.parent_node) { in RunUndirectedDFS()
161 VisitPost(node, entry.parent_node, entry.direction); in RunUndirectedDFS()
|
| H A D | control-equivalence.h | 76 Node* parent_node; // Parent node of entry during DFS walk. member
106 void VisitPost(Node* node, Node* parent_node, DFSDirection direction);
|
| /third_party/NuttX/fs/nfs/ |
| H A D | nfs_adapter.c | 2538 struct nfsnode *parent_node = NULL; in vfs_nfs_unlink() local
2553 parent_node = (struct nfsnode*)(parent->data); in vfs_nfs_unlink()
2570 *ptr++ = txdr_unsigned(parent_node->n_fhsize); in vfs_nfs_unlink()
2573 (void)memcpy_s(ptr, parent_node->n_fhsize, &parent_node->n_fhandle, parent_node->n_fhsize); in vfs_nfs_unlink()
2574 reqlen += (int)parent_node->n_fhsize; in vfs_nfs_unlink()
2575 ptr += uint32_increment(parent_node->n_fhsize); in vfs_nfs_unlink()
2602 struct nfsnode *parent_node = NULL; in vfs_nfs_rmdir() local
2616 parent_node in vfs_nfs_rmdir()
[all...] |
| /third_party/selinux/libsepol/cil/test/unit/ |
| H A D | test_cil_copy_ast.c | 1449 struct cil_tree_node *parent_node; in test_cil_copy_node_helper_perm() local
1450 cil_tree_node_init(&parent_node); in test_cil_copy_node_helper_perm()
1451 parent_node->flavor = CIL_CLASS; in test_cil_copy_node_helper_perm()
1452 parent_node->data = test_class; in test_cil_copy_node_helper_perm()
1456 parent_node->parent = root; in test_cil_copy_node_helper_perm()
1458 struct cil_args_copy *extra_args = gen_copy_args(parent_node, test_db2); in test_cil_copy_node_helper_perm()
2184 struct cil_tree_node *parent_node; in test_cil_copy_node_helper_senscat() local
2185 cil_tree_node_init(&parent_node); in test_cil_copy_node_helper_senscat()
2186 parent_node->flavor = CIL_SENSCAT; in test_cil_copy_node_helper_senscat()
2187 parent_node in test_cil_copy_node_helper_senscat()
2217 struct cil_tree_node *parent_node; test_cil_copy_node_helper_catorder() local
2251 struct cil_tree_node *parent_node; test_cil_copy_node_helper_dominance() local
[all...] |
| /third_party/mesa3d/src/compiler/nir/ |
| H A D | nir_validate.c | 80 nir_cf_node *parent_node; member
1249 validate_assert(state, block->cf_node.parent == state->parent_node); in validate_block()
1272 switch (state->parent_node->type) { in validate_block()
1284 nir_cf_node_as_block(nir_cf_node_next(state->parent_node)); in validate_block()
1352 nir_cf_node *old_parent = state->parent_node; in validate_if()
1353 state->parent_node = &if_stmt->cf_node; in validate_if()
1363 state->parent_node = old_parent; in validate_if()
1382 nir_cf_node *old_parent = state->parent_node; in validate_loop()
1383 state->parent_node = &loop->cf_node; in validate_loop()
1391 state->parent_node in validate_loop()
[all...] |
| H A D | nir_lower_shader_calls.c | 814 nir_cf_node *parent_node, in flatten_resume_if_ladder()
1022 assert(wrapper_if->cf_node.parent == parent_node); in flatten_resume_if_ladder()
1026 assert(parent_node->type == nir_cf_node_function || in flatten_resume_if_ladder()
1027 (parent_node->type == nir_cf_node_if && in flatten_resume_if_ladder()
1028 parent_node->parent->type == nir_cf_node_loop)); in flatten_resume_if_ladder()
813 flatten_resume_if_ladder(nir_builder *b, nir_cf_node *parent_node, struct exec_list *child_list, bool child_list_contains_cursor, nir_instr *resume_instr, struct brw_bitset *remat) flatten_resume_if_ladder() argument
|
| /third_party/libabigail/src/ |
| H A D | abg-viz-dot.cc | 112 dot::add_parent(const parent_node& __p) in add_parent()
|
| H A D | abg-comparison.cc | 883 {return diff && is_fn_parm_diff(diff->parent_node());} in is_child_node_of_function_parm_diff()
892 {return diff && is_base_diff(diff->parent_node());} in is_child_node_of_base_diff()
1964 diff::parent_node() const in parent_node() function in abigail::comparison::diff
11952 const diff* p = d->parent_node(); in visit_begin()
11957 p = p->parent_node(); in visit_begin()
|