| /external/u-boot/fs/jffs2/ |
| jffs2_private.h | 7 struct b_node { struct
9 struct b_node *next;
14 struct b_node *listTail;
15 struct b_node *listHead;
17 struct b_node *listLast;
18 int (*listCompare)(struct b_node *new, struct b_node *node);
|
| jffs2_nand_private.h | 6 struct b_node { struct
7 struct b_node *next;
31 struct b_node *listTail;
32 struct b_node *listHead;
|
| mergesort.c | 15 struct b_node *p, *q, *e, **tail;
|
| jffs2_nand_1pass.c | 62 static struct b_node *
67 struct b_node *b;
84 b = (struct b_node *)&memBase->nodes[size * index];
93 static struct b_node *
94 insert_node(struct b_list *list, struct b_node *new)
97 struct b_node *b, *prev;
123 new->next = (struct b_node *) NULL;
135 static struct b_node *
150 return insert_node(list, (struct b_node *)new);
153 static struct b_node *
[all...] |
| jffs2_1pass.c | 497 struct b_node nodes[NODE_CHUNK];
511 static struct b_node *
516 struct b_node *b;
550 static struct b_node *
553 struct b_node *new;
575 static int compare_inodes(struct b_node *new, struct b_node *old)
596 static int compare_dirents(struct b_node *new, struct b_node *old)
677 struct b_node *b
[all...] |
| /external/tensorflow/tensorflow/tools/graph_transforms/ |
| strip_unused_nodes_test.cc | 45 add_node->add_input("b_node");
51 NodeDef* b_node = graph_def.add_node(); local
52 b_node->set_name("b_node");
53 b_node->set_op("Const");
66 EXPECT_EQ(1, node_lookup.count("b_node"));
141 mul_node->add_input("b_node");
148 NodeDef* b_node = graph_def.add_node(); local
149 b_node->set_name("b_node");
191 NodeDef* b_node = graph_def.add_node(); local
237 NodeDef* b_node = graph_def.add_node(); local
[all...] |
| sort_by_execution_order_test.cc | 46 add_node->add_input("b_node");
48 NodeDef* b_node = graph_def.add_node(); local
49 b_node->set_name("b_node");
50 b_node->set_op("Const");
63 EXPECT_GT(2, order["b_node"]);
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 59 Node<T> b_node = getNode(b); local
60 a_node.addEdge(b_node);
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| dominator_tree.cpp | 236 const DominatorTreeNode* b_node = GetTreeNode(b); local
237 if (!a_node || !b_node) return false;
239 return Dominates(a_node, b_node);
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| dominator_tree.cpp | 236 const DominatorTreeNode* b_node = GetTreeNode(b); local
237 if (!a_node || !b_node) return false;
239 return Dominates(a_node, b_node);
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| call_graph.cc | 150 const CallGraphNode& b_node = GetNode(b); local
151 if (b_node.callers().empty()) {
158 for (const HloComputation* b_caller : b_node.callers()) {
|
| flatten_call_graph_test.cc | 223 const CallGraphNode& b_node = call_graph->GetNode(b_computation); local
224 EXPECT_EQ(1, b_node.caller_callsites().size());
|
| call_graph_test.cc | 347 const CallGraphNode& b_node = call_graph->GetNode(b_computation); local
354 EXPECT_EQ(b_node.depth(), 2);
|
| /external/mesa3d/src/compiler/nir/ |
| nir_from_ssa.c | 157 merge_node *b_node = exec_node_data(merge_node, bn, node); local
160 a_node->def->live_index > b_node->def->live_index) {
203 merge_node *b_node = exec_node_data(merge_node, bn, node); local
205 if (a_node->def->live_index <= b_node->def->live_index) {
209 current = b_node;
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| tf2xla_util_test.cc | 227 Node* b_node = nullptr; local
231 if (n->name() == "B") b_node = n;
249 b_node->set_assigned_device_name("/device:TPU_REPLICATED_CORE:1");
|
| /external/tensorflow/tensorflow/core/grappler/ |
| graph_view_test.cc | 277 const NodeDef* b_node = graph.GetNode("b"); local
278 EXPECT_NE(b_node, nullptr);
285 EXPECT_EQ(d_output_0, GraphView::OutputPort(b_node, 0));
|
| /external/mesa3d/src/compiler/glsl/ |
| ir.cpp | [all...] |
