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