HomeSort by relevance Sort by last modified time
    Searched refs:if_false (Results 1 - 25 of 51) sorted by null

1 2 3

  /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);
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);
effect-control-linearizer.cc 596 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
599 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
635 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
636 Node* vfalse = graph()->NewNode(common()->Projection(0), add, if_false);
638 Node* merge = graph()->NewNode(common()->Merge(2), alloc.control, if_false);
660 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
662 ChangeUint32ToFloat64(value), effect, if_false);
704 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
711 efalse, if_false);
715 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
736 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
778 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
972 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
1018 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
1060 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
1091 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
1123 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
1162 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
1194 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
1239 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
1274 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
    [all...]
common-operator-reducer.cc 170 Node* if_false = node->InputAt(1); local
171 if (if_true->opcode() != IrOpcode::kIfTrue) std::swap(if_true, if_false);
173 if_false->opcode() == IrOpcode::kIfFalse &&
174 if_true->InputAt(0) == if_false->InputAt(0) && if_true->OwnedBy(node) &&
175 if_false->OwnedBy(node)) {
178 DCHECK(branch->OwnedBy(if_true, if_false));
225 Node* if_false = merge->InputAt(1); local
227 std::swap(if_true, if_false);
231 if_false->opcode() == IrOpcode::kIfFalse &&
232 if_true->InputAt(0) == if_false->InputAt(0))
    [all...]
memory-optimizer.cc 187 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
200 size, efalse, if_false);
205 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
265 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
278 efalse, if_false);
281 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
  /external/v8/test/unittests/compiler/
diamond-unittest.cc 30 EXPECT_THAT(d.if_false, IsIfFalse(d.branch));
31 EXPECT_THAT(d.merge, IsMerge(d.if_true, d.if_false));
81 EXPECT_THAT(d0.if_false, IsIfFalse(d0.branch));
82 EXPECT_THAT(d0.merge, IsMerge(d1.merge, d0.if_false));
86 EXPECT_THAT(d1.if_false, IsIfFalse(d1.branch));
87 EXPECT_THAT(d1.merge, IsMerge(d1.if_true, d1.if_false));
101 EXPECT_THAT(d0.if_false, IsIfFalse(d0.branch));
104 EXPECT_THAT(d1.branch, IsBranch(p1, d0.if_false));
106 EXPECT_THAT(d1.if_false, IsIfFalse(d1.branch));
107 EXPECT_THAT(d1.merge, IsMerge(d1.if_true, d1.if_false));
    [all...]
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()));
150 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local
155 EXPECT_THAT(if_false, IsIfTrue(branch))
171 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local
185 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); local
294 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
314 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
333 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
351 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
369 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
387 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
409 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
    [all...]
js-intrinsic-lowering-unittest.cc 121 Capture<Node*> branch, if_false; local
128 effect, CaptureEq(&if_false)),
133 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch))))));
152 Capture<Node*> branch, if_false; local
159 effect, CaptureEq(&if_false)),
164 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch))))));
183 Capture<Node*> branch, if_false; local
190 effect, CaptureEq(&if_false)),
195 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch))))));
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...]
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...]
effect-control-linearizer-unittest.cc 98 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
101 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
126 schedule.AddNode(fblock, if_false);
278 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); local
280 loop->AppendInput(zone(), if_false); local
313 schedule.AddNode(fblock, if_false);
  /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/full-codegen/arm64/
full-codegen-arm64.cc 644 Label* if_false,
649 Split(eq, if_true, if_false, fall_through);
654 // If (!cond), branch to if_false.
659 Label* if_false,
661 if (if_false == fall_through) {
664 DCHECK(if_false != fall_through);
665 __ B(NegateCondition(cond), if_false); local
668 __ B(if_false);
726 Label* if_false) {
740 Split(eq, if_true, if_false, NULL)
2602 Label* if_false = NULL; local
2622 Label* if_false = NULL; local
2644 Label* if_false = NULL; local
2666 Label* if_false = NULL; local
2688 Label* if_false = NULL; local
2710 Label* if_false = NULL; local
2887 Label* if_false = NULL; local
3369 Label* if_false = NULL; local
3463 Label* if_false = NULL; local
3529 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/ia32/
full-codegen-ia32.cc 601 Label* if_false,
606 Split(equal, if_true, if_false, fall_through);
612 Label* if_false,
614 if (if_false == fall_through) {
617 __ j(NegateCondition(cc), if_false); local
620 __ jmp(if_false);
681 Label* if_false) {
692 Split(equal, if_true, if_false, NULL);
2584 Label* if_false = NULL; local
2605 Label* if_false = NULL; local
2627 Label* if_false = NULL; local
2649 Label* if_false = NULL; local
2671 Label* if_false = NULL; local
2693 Label* if_false = NULL; local
2867 Label* if_false = NULL; local
3346 Label* if_false = NULL; local
3431 Label* if_false = NULL; local
3499 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/x64/
full-codegen-x64.cc 613 Label* if_false,
618 Split(equal, if_true, if_false, fall_through);
624 Label* if_false,
626 if (if_false == fall_through) {
629 __ j(NegateCondition(cc), if_false); local
632 __ jmp(if_false);
693 Label* if_false) {
704 Split(equal, if_true, if_false, NULL);
2576 Label* if_false = NULL; local
2597 Label* if_false = NULL; local
2619 Label* if_false = NULL; local
2641 Label* if_false = NULL; local
2663 Label* if_false = NULL; local
2685 Label* if_false = NULL; local
2858 Label* if_false = NULL; local
3336 Label* if_false = NULL; local
3422 Label* if_false = NULL; local
3490 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/x87/
full-codegen-x87.cc 598 Label* if_false,
603 Split(equal, if_true, if_false, fall_through);
609 Label* if_false,
611 if (if_false == fall_through) {
614 __ j(NegateCondition(cc), if_false); local
617 __ jmp(if_false);
678 Label* if_false) {
689 Split(equal, if_true, if_false, NULL);
2576 Label* if_false = NULL; local
2597 Label* if_false = NULL; local
2619 Label* if_false = NULL; local
2641 Label* if_false = NULL; local
2663 Label* if_false = NULL; local
2685 Label* if_false = NULL; local
2859 Label* if_false = NULL; local
3338 Label* if_false = NULL; local
3423 Label* if_false = NULL; local
3491 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/arm/
full-codegen-arm.cc 649 Label* if_false,
654 Split(eq, if_true, if_false, fall_through);
660 Label* if_false,
662 if (if_false == fall_through) {
665 __ b(NegateCondition(cond), if_false); local
668 __ b(if_false);
732 Label* if_false) {
744 Split(eq, if_true, if_false, NULL);
2698 Label* if_false = NULL; local
2719 Label* if_false = NULL; local
2741 Label* if_false = NULL; local
2763 Label* if_false = NULL; local
2785 Label* if_false = NULL; local
2807 Label* if_false = NULL; local
2975 Label* if_false = NULL; local
3446 Label* if_false = NULL; local
3533 Label* if_false = NULL; local
3599 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/mips/
full-codegen-mips.cc 643 Label* if_false,
649 Split(eq, result_register(), Operand(at), if_true, if_false, fall_through);
657 Label* if_false,
659 if (if_false == fall_through) {
662 __ Branch(if_false, NegateCondition(cc), lhs, rhs);
665 __ Branch(if_false);
728 Label* if_false) {
739 Split(eq, a0, Operand(t0), if_true, if_false, NULL);
2701 Label* if_false = NULL; local
2722 Label* if_false = NULL; local
2745 Label* if_false = NULL; local
2768 Label* if_false = NULL; local
2790 Label* if_false = NULL; local
2812 Label* if_false = NULL; local
2984 Label* if_false = NULL; local
3456 Label* if_false = NULL; local
3543 Label* if_false = NULL; local
3609 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/mips64/
full-codegen-mips64.cc 642 Label* if_false,
648 Split(eq, result_register(), Operand(at), if_true, if_false, fall_through);
656 Label* if_false,
658 if (if_false == fall_through) {
661 __ Branch(if_false, NegateCondition(cc), lhs, rhs);
664 __ Branch(if_false);
727 Label* if_false) {
738 Split(eq, a0, Operand(a4), if_true, if_false, NULL);
2700 Label* if_false = NULL; local
2721 Label* if_false = NULL; local
2744 Label* if_false = NULL; local
2767 Label* if_false = NULL; local
2789 Label* if_false = NULL; local
2811 Label* if_false = NULL; local
2983 Label* if_false = NULL; local
3456 Label* if_false = NULL; local
3543 Label* if_false = NULL; local
3609 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/ppc/
full-codegen-ppc.cc 620 Label* if_false, Label* fall_through) {
624 Split(eq, if_true, if_false, fall_through);
628 void FullCodeGenerator::Split(Condition cond, Label* if_true, Label* if_false,
630 if (if_false == fall_through) {
633 __ b(NegateCondition(cond), if_false, cr); local
636 __ b(if_false);
694 Label* if_false) {
706 Split(eq, if_true, if_false, NULL);
2693 Label* if_false = NULL; local
2714 Label* if_false = NULL; local
2736 Label* if_false = NULL; local
2758 Label* if_false = NULL; local
2780 Label* if_false = NULL; local
2802 Label* if_false = NULL; local
2972 Label* if_false = NULL; local
3441 Label* if_false = NULL; local
3530 Label* if_false = NULL; local
3596 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/s390/
full-codegen-s390.cc 607 Label* if_false, Label* fall_through) {
611 Split(eq, if_true, if_false, fall_through);
614 void FullCodeGenerator::Split(Condition cond, Label* if_true, Label* if_false,
616 if (if_false == fall_through) {
619 __ b(NegateCondition(cond), if_false); local
622 __ b(if_false);
675 Label* if_false) {
686 Split(eq, if_true, if_false, NULL);
2632 Label* if_false = NULL; local
2652 Label* if_false = NULL; local
2673 Label* if_false = NULL; local
2694 Label* if_false = NULL; local
2715 Label* if_false = NULL; local
2736 Label* if_false = NULL; local
2900 Label* if_false = NULL; local
3359 Label* if_false = NULL; local
3444 Label* if_false = NULL; local
3510 Label* if_false = NULL; local
    [all...]
  /external/v8/src/full-codegen/
full-codegen.h 300 Label* if_false,
311 Label* if_false,
318 Label* if_false,
321 void Split(Condition cc, Label* if_true, Label* if_false, Label* fall_through,
326 Label* if_false,
377 Label* if_false,
380 TestContext context(this, expr, if_true, if_false, fall_through);
466 Label* if_false);
822 Label** if_false,
861 Label** if_true, Label** 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);
  /external/v8/src/
code-stub-assembler.h 93 Label* if_false) {
94 BranchIf(SmiLessThan(a, b), if_true, if_false); local
98 Label* if_true, Label* if_false) {
99 BranchIf(SmiLessThanOrEqual(a, b), if_true, if_false); local
103 Label* if_false) {
104 BranchIfFloat64Equal(value, value, if_false, if_true);
  /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);

Completed in 829 milliseconds

1 2 3