Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:if_false (Results 1 - 25 of 34) sorted by null

1 2

/external/protobuf/src/google/protobuf/stubs/
template_util_unittest.cc	67 typedef if_<false, true_type, false_type>::type if_false; typedef 68 EXPECT_FALSE(if_false::value);
/external/v8/src/compiler/
diamond.h	22 Node* if_false; member in struct:v8::internal::compiler::Diamond 31 if_false = graph->NewNode(common->IfFalse(), branch); 32 merge = graph->NewNode(common->Merge(2), if_true, if_false); 41 // Nest {this} into either the if_true or if_false branch of {that}. 47 branch->ReplaceInput(1, that.if_false);
common-operator-reducer.cc	143 Node* if_false = node->InputAt(1); local 144 if (if_true->opcode() != IrOpcode::kIfTrue) std::swap(if_true, if_false); 146 if_false->opcode() == IrOpcode::kIfFalse && 147 if_true->InputAt(0) == if_false->InputAt(0) && if_true->OwnedBy(node) && 148 if_false->OwnedBy(node)) { 151 DCHECK(branch->OwnedBy(if_true, if_false)); 198 Node* if_false = merge->InputAt(1); local 200 std::swap(if_true, if_false); 204 if_false->opcode() == IrOpcode::kIfFalse && 205 if_true->InputAt(0) == if_false->InputAt(0))     [all...]
control-flow-optimizer.cc	220 Node* if_false; local 227 if_false = matcher.IfFalse(); 229 auto it = if_false->uses().begin(); 230 if (it == if_false->uses().end()) break; 234 if (it != if_false->uses().end()) break; 249 if_false->NullAllInputs(); 269 if_false->ReplaceInput(0, node); 270 NodeProperties::ChangeOp(if_false, common()->IfDefault()); 271 Enqueue(if_false);
js-global-object-specialization.cc	190 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 193 frame_state, effect, if_false); 231 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 234 frame_state, effect, if_false);
js-call-reducer.cc	333 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 336 frame_state, effect, if_false); 358 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 361 frame_state, effect, if_false); 476 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 479 frame_state, effect, if_false); 507 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 510 frame_state, effect, if_false);
change-lowering.cc	258 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 261 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); 290 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 293 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); 387 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 390 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); 411 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 413 AllocateHeapNumberWithValue(ChangeUint32ToFloat64(value), if_false); 415 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
js-intrinsic-lowering.cc	211 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 215 effect, if_false), 216 effect, if_false); 220 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); 254 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 258 value, effect, if_false), 259 effect, if_false); 264 control = graph()->NewNode(common()->Merge(2), if_true, if_false); 298 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 302 value, effect, if_false),     [all...]
js-native-context-specialization.cc	744 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local     [all...]
js-generic-lowering.cc	835 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local     [all...]
simplified-lowering.cc	1541 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 1593 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local     [all...]
wasm-compiler.cc	160 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 162 *control_ptr = iftrue ? if_true : if_false; 164 *control_ptr = iftrue ? if_false : if_true; 418 Node* rem = graph()->NewNode(m->Int32Mod(), left, right, d.if_false); 519 Node* rem = graph()->NewNode(m->Int64Mod(), left, right, d.if_false);     [all...]
/art/compiler/optimizing/
graph_test.cc	114 HBasicBlock* if_false = createGotoBlock(graph, &allocator); local 120 if_false->AddSuccessor(return_block); 121 if_block->AddSuccessor(if_false); 125 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfFalseSuccessor(), if_false); 130 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfFalseSuccessor(), if_false);
induction_var_analysis.cc	576 HBasicBlock* if_false = ifs->IfFalseSuccessor(); local 590 } else if (if_true->GetLoopInformation() != loop && if_false->GetLoopInformation() == loop) { 592 } else if (if_true->GetLoopInformation() == loop && if_false->GetLoopInformation() != loop) {     [all...]
/external/v8/test/unittests/compiler/
js-intrinsic-lowering-unittest.cc	148 Capture<Node*> branch, if_false; local 155 effect, CaptureEq(&if_false)), 160 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); 179 Capture<Node*> branch, if_false; local 186 effect, CaptureEq(&if_false)), 191 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); 210 Capture<Node*> branch, if_false; local 217 effect, CaptureEq(&if_false)), 222 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); 241 Capture<Node*> branch, if_false; local 273 Capture<Node*> branch, if_false; local 304 Capture<Node *> branch, if_false; local     [all...]
control-flow-optimizer-unittest.cc	112 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 113 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
node-properties-unittest.cc	90 Node* if_false = NewMockNode(common.IfFalse(), branch); local 94 EXPECT_EQ(if_false, result[1]);
change-lowering-unittest.cc	473 Capture<Node*> branch, heap_number, if_false; local 481 IsAllocateHeapNumber(_, CaptureEq(&if_false))), 488 CaptureEq(&if_false))), 494 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); 601 Capture<Node*> branch, heap_number, if_false; local 610 IsAllocateHeapNumber(_, CaptureEq(&if_false))), 617 CaptureEq(&if_false))), 623 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch))))));
common-operator-reducer-unittest.cc	80 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 83 EXPECT_CALL(editor, Replace(if_false, control)); 97 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 100 EXPECT_CALL(editor, Replace(if_false, IsDead())); 114 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 117 EXPECT_CALL(editor, Replace(if_false, control)); 131 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 134 EXPECT_CALL(editor, Replace(if_false, IsDead())); 148 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 151 EXPECT_CALL(editor, Replace(if_false, control)) 165 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 184 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 205 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 219 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local 328 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 348 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 367 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 385 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 403 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 421 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 443 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local     [all...]
node-matchers-unittest.cc	738 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 743 EXPECT_EQ(if_false, matcher.IfFalse()); 748 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 754 EXPECT_EQ(if_false, matcher.IfFalse()); 759 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 766 EXPECT_EQ(if_false, matcher.IfFalse()); 785 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 788 USE(if_false); 799 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 802 EXPECT_FALSE(BranchMatcher(if_false).Matched()) 808 Node* if_false = graph()->NewNode(common()->IfFalse(), sw); local 832 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 844 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 858 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 884 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 894 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 911 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 921 Node* if_false = graph()->start(); local 930 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 942 Node* if_false = graph()->NewNode(common()->IfFalse(), branch2); local     [all...]
loop-peeling-unittest.cc	39 Node* if_false; member in struct:v8::internal::compiler::Branch 130 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local 131 return {branch, if_true, if_false}; 319 loop->ReplaceInput(2, b2.if_false); 321 Node* r = InsertReturn(p0, start(), b1.if_false); 327 Node* b1f = ExpectPeeled(b1.if_false, peeled); 335 Node* b2f = ExpectPeeled(b2.if_false, peeled); 341 EXPECT_THAT(loop, IsLoop(IsMerge(b2t, b2f), b2.if_true, b2.if_false)); 342 EXPECT_THAT(r, IsReturn(p0, start(), IsMerge(b1.if_false, b1f))); 356 loop->ReplaceInput(2, b2.if_false);     [all...]
/external/v8/test/cctest/compiler/
test-osr.cc	186 CHECK(!nodes.IsLive(d.if_false)); 198 Node* if_false = T.graph.NewNode(T.common.IfFalse(), branch); local 204 Node* ret = T.graph.NewNode(T.common.Return(), osr_phi, T.start, if_false); 212 CheckInputs(if_false, branch); 214 CheckInputs(ret, osr_phi, T.start, if_false); 520 Node* if_false = T.graph.NewNode(T.common.IfFalse(), branch); local 523 loop1->AppendInput(T.graph.zone(), if_false); 542 CheckInputs(if_false, branch); 545 Node* new_loop1_loop = FindSuccessor(if_false, IrOpcode::kLoop);
test-loop-analysis.cc	662 Node* if_false = t.graph.NewNode(t.common.IfFalse(), branch); local 663 exit = if_false; 667 if (b != (i - 1)) body[body_count++] = if_false;
/external/v8/src/wasm/
ast-decoder.cc	724 TFNode* if_false = nullptr; local 725 BUILD(Branch, p->last()->node, &if_true, &if_false); 728 false_env->control = if_false;     [all...]
/external/v8/src/full-codegen/arm/
full-codegen-arm.cc	687 Label* if_false, 692 Split(eq, if_true, if_false, fall_through); 698 Label* if_false, 700 if (if_false == fall_through) { 703 __ b(NegateCondition(cond), if_false); local 706 __ b(if_false); 770 Label* if_false) { 782 Split(eq, if_true, if_false, NULL); 3092 Label* if_false = NULL; local 3113 Label* if_false = NULL; local 3135 Label* if_false = NULL; local 3157 Label* if_false = NULL; local 3179 Label* if_false = NULL; local 3205 Label* if_false = NULL; local 3227 Label* if_false = NULL; local 3249 Label* if_false = NULL; local 3271 Label* if_false = NULL; local 3295 Label* if_false = NULL; local 3419 Label* if_false = nullptr; local 3702 Label* if_false = NULL; local 4461 Label* if_false = NULL; local 4549 Label* if_false = NULL; local 4613 Label* if_false = NULL; local     [all...]

Completed in 467 milliseconds

1 2