Home
last modified time | relevance | path

Searched refs:false_node (Results 1 – 8 of 8) sorted by relevance

/external/tensorflow/tensorflow/compiler/xla/service/
Dcall_graph_test.cc291 const CallGraphNode& false_node = call_graph->GetNode(false_computation); in TEST_F() local
292 EXPECT_EQ(false_node.depth(), 1); in TEST_F()
293 EXPECT_TRUE(false_node.callees().empty()); in TEST_F()
294 EXPECT_EQ(1, false_node.callers().size()); in TEST_F()
295 EXPECT_EQ(entry_computation, false_node.callers()[0]); in TEST_F()
/external/v8/src/compiler/
Dwasm-compiler.h186 Node* BranchNoHint(Node* cond, Node** true_node, Node** false_node);
187 Node* BranchExpectTrue(Node* cond, Node** true_node, Node** false_node);
188 Node* BranchExpectFalse(Node* cond, Node** true_node, Node** false_node);
Descape-analysis.cc521 Node* false_node = jsgraph->FalseConstant(); in LowerCompareMapsWithoutLoad() local
522 Node* replacement = false_node; in LowerCompareMapsWithoutLoad()
530 if (replacement == false_node) { in LowerCompareMapsWithoutLoad()
Dsimd-scalar-lowering.cc1363 Node* false_node = mcgraph_->Int32Constant(0); in LowerNode() local
1364 Node* tmp_result = false_node; in LowerNode()
1373 graph()->NewNode(machine()->Word32Equal(), rep[i], false_node)); in LowerNode()
1377 tmp_result = is_false.Phi(MachineRepresentation::kWord32, false_node, in LowerNode()
Dwasm-compiler.cc881 Node** false_node, Node* control, BranchHint hint) { in Branch() argument
887 *false_node = mcgraph->graph()->NewNode(mcgraph->common()->IfFalse(), branch); in Branch()
893 Node** false_node) { in BranchNoHint() argument
894 return Branch(mcgraph(), cond, true_node, false_node, Control(), in BranchNoHint()
899 Node** false_node) { in BranchExpectTrue() argument
900 return Branch(mcgraph(), cond, true_node, false_node, Control(), in BranchExpectTrue()
905 Node** false_node) { in BranchExpectFalse() argument
906 return Branch(mcgraph(), cond, true_node, false_node, Control(), in BranchExpectFalse()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dconstant_folding.cc2411 NodeDef* false_node = optimized_graph->add_node(); in SimplifySwitch() local
2412 false_node->set_name(OptimizedNodeName(*node, "_const_false")); in SimplifySwitch()
2413 if (!CreateNodeDef(false_node->name(), TensorValue(&false_t), false_node) in SimplifySwitch()
2417 false_node->set_device(node->device()); in SimplifySwitch()
2433 false_node->add_input(false_ctrl_dep); in SimplifySwitch()
2438 node_map_->AddNode(false_node->name(), false_node); in SimplifySwitch()
2440 node_map_->AddOutput(NodeName(false_ctrl_dep), false_node->name()); in SimplifySwitch()
2447 consumer->set_input(i, false_node->name()); in SimplifySwitch()
2449 false_node->name()); in SimplifySwitch()
/external/selinux/libsepol/cil/src/
Dcil_binary.c2245 struct cil_tree_node *false_node = NULL; in cil_booleanif_to_policydb() local
2299 false_node = cb_node; in cil_booleanif_to_policydb()
2306 true_node = false_node; in cil_booleanif_to_policydb()
2307 false_node = tmp_node; in cil_booleanif_to_policydb()
2324 if (false_node != NULL) { in cil_booleanif_to_policydb()
2326 rc = cil_tree_walk(false_node, __cil_cond_to_policydb_helper, NULL, NULL, &bool_args); in cil_booleanif_to_policydb()
2328 cil_tree_log(false_node, CIL_ERR, "Failure while walking false conditional block"); in cil_booleanif_to_policydb()
Dcil_resolve_ast.c3305 struct cil_tree_node *false_node = NULL; in cil_resolve_tunif() local
3324 false_node = current->cl_head; in cil_resolve_tunif()
3333 false_node = current->cl_head->next; in cil_resolve_tunif()
3345 if (false_node != NULL) { in cil_resolve_tunif()
3346 rc = cil_copy_ast(db, false_node, current->parent); in cil_resolve_tunif()