Searched defs:b_node (Results 1 – 13 of 13) sorted by relevance
7 struct b_node { struct9 struct b_node *next; argument14 struct b_node *listTail; argument
6 struct b_node { struct7 struct b_node *next; argument
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
59 Node<T> b_node = getNode(b); in addEdge() local
157 merge_node *b_node = exec_node_data(merge_node, bn, node); in merge_merge_sets() local203 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
150 const CallGraphNode& b_node = GetNode(b); in DominatesHelper() local
347 const CallGraphNode& b_node = call_graph->GetNode(b_computation); in TEST_F() local
236 const DominatorTreeNode* b_node = GetTreeNode(b); in Dominates() local
227 Node* b_node = nullptr; in TEST() local
277 const NodeDef* b_node = graph.GetNode("b"); in TEST_F() local