| /external/mesa3d/src/compiler/glsl/ |
| ir_function.cpp | 47 const exec_node *node_b = list_b->get_head_raw(); local
55 ; node_a = node_a->next, node_b = node_b->next) {
60 if (node_b->is_tail_sentinel())
65 const ir_rvalue *const actual = (ir_rvalue *) node_b;
112 if (!node_b->is_tail_sentinel())
226 const exec_node *node_b = (*other)->parameters.get_head_raw(); local
234 node_b = node_b->next,
240 (const ir_variable *)node_b,
372 const exec_node *node_b = list_b->get_head_raw(); local
[all...] |
| /external/tensorflow/tensorflow/contrib/framework/python/framework/ |
| graph_util_test.py | 44 node_b = GetNewNode('B', 'Op1', ['A'])
48 graph_def.node.extend([node_a, node_b, node_c, node_d, node_e])
66 node_b = GetNewNode('B', 'Op1', ['A'])
70 graph_def.node.extend([node_a, node_a1, node_b, node_c, node_d, node_e])
|
| /system/libufdt/ |
| ufdt_node.c | 205 static int merge_children(struct ufdt_node *node_a, struct ufdt_node *node_b,
209 for (it = ((struct ufdt_node_fdt_node *)node_b)->child; it;) {
230 * The ufdt_node* in node_b will be copied to node_a.
233 * ufdt_apply_overlay(), set this node in node_b
236 ((struct ufdt_node_fdt_node *)node_b)->child = NULL;
241 int ufdt_node_merge_into(struct ufdt_node *node_a, struct ufdt_node *node_b,
244 node_a->fdt_tag_ptr = node_b->fdt_tag_ptr;
249 err = merge_children(node_a, node_b, pool);
|
| /external/jemalloc/test/unit/ |
| rtree.c | 35 extent_node_t node_a, node_b; local
47 assert_false(rtree_set(&rtree, ~((uintptr_t)0), &node_b),
49 assert_ptr_eq(rtree_get(&rtree, ~((uintptr_t)0), true), &node_b, local
|
| /system/libufdt/include/ |
| libufdt.h | 269 int ufdt_node_merge_into(struct ufdt_node *node_a, struct ufdt_node *node_b,
|
| /external/mesa3d/src/compiler/glsl/glcpp/ |
| glcpp-parse.y | 850 string_node_t *node_a, *node_b;
858 for (node_a = a->head, node_b = b->head;
859 node_a && node_b;
860 node_a = node_a->next, node_b = node_b->next)
862 if (strcmp (node_a->str, node_b->str))
869 return node_a == node_b;
1060 token_node_t *node_a, *node_b;
1069 node_b = b->head;
1073 if (node_a == NULL && node_b == NULL
[all...] |
| /system/libufdt/tests/libufdt_verify/ |
| ufdt_test_overlay.cpp | 31 static bool ufdt_node_compare(struct ufdt_node *node_a, struct ufdt_node *node_b,
35 * Helper method to check if the tree rooted at node_b is a subset of the tree rooted
38 static bool compare_child_nodes(struct ufdt_node *node_a, struct ufdt_node *node_b,
43 for (it = ((struct ufdt_node_fdt_node *)node_b)->child; it; it = it->sibling) {
124 * Checks if the ufdt tree rooted at node_b is a subtree of the tree rooted at
|
| /external/tensorflow/tensorflow/core/kernels/ |
| remote_fused_graph_execute_op_test.cc | 185 const NodeDef& node_b = *node_def_map_.at(NAME_B); variable
187 TF_CHECK_OK(GetNodeAttr(node_b, "value", &proto));
|
| /external/python/cpython3/Objects/ |
| odictobject.c | 797 _ODictNode *node_a, *node_b; local
800 node_b = _odict_FIRST(b);
802 if (node_a == NULL && node_b == NULL)
805 else if (node_a == NULL || node_b == NULL)
811 (PyObject *)_odictnode_KEY(node_b),
820 node_b = _odictnode_NEXT(node_b);
[all...] |
| /external/tensorflow/tensorflow/core/kernels/hexagon/ |
| graph_transferer_test.cc | 147 Output node_b = ops::Const(root.WithOpName(NAME_B), NODE_B_VAL); local
148 Output node_add = BuildAddOps(root.WithOpName(NAME_A_PLUS_B), node_a, node_b);
|
| /art/compiler/optimizing/ |
| register_allocator_graph_color.cc | 125 node_b(b),
137 InterferenceNode* const node_b; member in struct:art::CoalesceOpportunity
[all...] |
