Searched defs:b_node (Results 1 – 13 of 13) sorted by relevance
51 NodeDef* b_node = graph_def.add_node(); in TestSimpleAdd() local148 NodeDef* b_node = graph_def.add_node(); in TestSimplePlaceholder() local191 NodeDef* b_node = graph_def.add_node(); in TestPlaceholderDefaultArgs() local237 NodeDef* b_node = graph_def.add_node(); in TestPlaceholderNamedArgs() local
48 NodeDef* b_node = graph_def.add_node(); in TestSimpleAdd() local
215 const auto* b_node = graph_view.GetNode("b"); in TEST() local273 const auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local301 const auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local334 auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local362 auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local447 auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local488 auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local529 auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local570 auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local592 auto* b_node = graph_view.GetNode("b"); in TYPED_TEST() local[all …]
59 Node<T> b_node = getNode(b); in addEdge() local
173 merge_node *b_node = exec_node_data(merge_node, bn, node); in merge_merge_sets() local219 merge_node *b_node = exec_node_data(merge_node, bn, node); in merge_sets_interfere() local
223 const CallGraphNode& b_node = call_graph->GetNode(b_computation); in TEST_F() local
157 const CallGraphNode& b_node = GetNode(b); in DominatesHelper() local
352 const CallGraphNode& b_node = call_graph->GetNode(b_computation); in TEST_F() local
226 const DominatorTreeNode* b_node = GetTreeNode(b); in Dominates() local
227 const DominatorTreeNode* b_node = GetTreeNode(b); in Dominates() local
278 const NodeDef* b_node = graph.GetNode("b"); in TEST_F() local
229 Node* b_node = nullptr; in TEST() local