Home
last modified time | relevance | path

Searched refs:if_true (Results 1 – 25 of 45) sorted by relevance

12

/external/v8/test/unittests/compiler/
Dloop-peeling-unittest.cc30 Node* if_true; member
38 Node* if_true; member
110 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in NewWhile() local
112 loop->ReplaceInput(1, if_true); in NewWhile()
113 return {loop, branch, if_true, exit}; in NewWhile()
119 a->loop->ReplaceInput(0, b->if_true); in Nest()
129 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in NewBranch() local
131 return {branch, if_true, if_false}; in NewBranch()
154 Node* if_true1 = ExpectPeeled(w.if_true, peeled); in TEST_F()
161 EXPECT_THAT(w.loop, IsLoop(if_true1, w.if_true)); in TEST_F()
[all …]
Ddiamond-unittest.cc29 EXPECT_THAT(d.if_true, IsIfTrue(d.branch)); in TEST_F()
31 EXPECT_THAT(d.merge, IsMerge(d.if_true, d.if_false)); in TEST_F()
80 EXPECT_THAT(d0.if_true, IsIfTrue(d0.branch)); in TEST_F()
84 EXPECT_THAT(d1.branch, IsBranch(p1, d0.if_true)); in TEST_F()
85 EXPECT_THAT(d1.if_true, IsIfTrue(d1.branch)); in TEST_F()
87 EXPECT_THAT(d1.merge, IsMerge(d1.if_true, d1.if_false)); in TEST_F()
100 EXPECT_THAT(d0.if_true, IsIfTrue(d0.branch)); in TEST_F()
102 EXPECT_THAT(d0.merge, IsMerge(d0.if_true, d1.merge)); in TEST_F()
105 EXPECT_THAT(d1.if_true, IsIfTrue(d1.branch)); in TEST_F()
107 EXPECT_THAT(d1.merge, IsMerge(d1.if_true, d1.if_false)); in TEST_F()
[all …]
Dcommon-operator-reducer-unittest.cc79 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
82 EXPECT_CALL(editor, Replace(if_true, IsDead())); in TEST_F()
96 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
99 EXPECT_CALL(editor, Replace(if_true, control)); in TEST_F()
113 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
116 EXPECT_CALL(editor, Replace(if_true, IsDead())); in TEST_F()
130 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
133 EXPECT_CALL(editor, Replace(if_true, control)); in TEST_F()
147 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
150 EXPECT_CALL(editor, Replace(if_true, IsDead())); in TEST_F()
[all …]
Dchange-lowering-unittest.cc371 Capture<Node*> add, branch, heap_number, if_true; in TARGET_TEST_F() local
377 IsAllocateHeapNumber(_, CaptureEq(&if_true))), in TARGET_TEST_F()
384 CaptureEq(&if_true))), in TARGET_TEST_F()
387 IsMerge(AllOf(CaptureEq(&if_true), IsIfTrue(CaptureEq(&branch))), in TARGET_TEST_F()
402 Capture<Node*> branch, if_true; in TARGET_TEST_F() local
406 IsLoadHeapNumber(value, CaptureEq(&if_true)), in TARGET_TEST_F()
409 IsMerge(AllOf(CaptureEq(&if_true), in TARGET_TEST_F()
427 Capture<Node*> branch, if_true; in TARGET_TEST_F() local
432 IsChangeFloat64ToInt32(IsLoadHeapNumber(value, CaptureEq(&if_true))), in TARGET_TEST_F()
434 IsMerge(AllOf(CaptureEq(&if_true), IsIfTrue(CaptureEq(&branch))), in TARGET_TEST_F()
[all …]
Dnode-matchers-unittest.cc737 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
742 EXPECT_EQ(if_true, matcher.IfTrue()); in TEST_F()
749 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
753 EXPECT_EQ(if_true, matcher.IfTrue()); in TEST_F()
760 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
765 EXPECT_EQ(if_true, matcher.IfTrue()); in TEST_F()
777 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
780 USE(if_true); in TEST_F()
798 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
801 EXPECT_FALSE(BranchMatcher(if_true).Matched()); in TEST_F()
[all …]
Dnode-properties-unittest.cc91 Node* if_true = NewMockNode(common.IfTrue(), branch); in TEST_F() local
93 EXPECT_EQ(if_true, result[0]); in TEST_F()
Dcontrol-flow-optimizer-unittest.cc111 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F() local
113 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
/external/llvm/test/Transforms/CodeGenPrepare/X86/
Dx86-shuffle-sink.ll9 ; CHECK: if_true:
16 br i1 %tst, label %if_true, label %if_false
18 if_true:
28 ; CHECK: if_true:
35 br i1 %tst, label %if_true, label %if_false
37 if_true:
47 ; CHECK: if_true:
54 br i1 %tst, label %if_true, label %if_false
56 if_true:
75 br i1 %tst, label %if_true, label %if_false
[all …]
/external/v8/test/cctest/compiler/
Dtest-loop-analysis.cc189 Node* if_true; member
196 if_true = t.graph.NewNode(t.common.IfTrue(), branch); in While()
198 loop->ReplaceInput(1, if_true); in While()
204 this->loop->ReplaceInput(0, that.if_true); in nest()
261 Node* body[] = {w.branch, w.if_true}; in TEST()
278 Node* body[] = {w.branch, w.if_true}; in TEST()
294 Node* body[] = {w.branch, w.if_true, c.add}; in TEST()
310 Node* body[] = {w.branch, w.if_true, c.store}; in TEST()
327 Node* body[] = {w.branch, w.if_true, c1.add, c2.add}; in TEST()
345 Node* body[] = {w1.branch, w1.if_true}; in TEST()
[all …]
Dtest-osr.cc185 CHECK(!nodes.IsLive(d.if_true)); in TEST()
197 Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch); in TEST() local
199 loop->ReplaceInput(2, if_true); in TEST()
209 CheckInputs(loop, T.start, if_true); in TEST()
211 CheckInputs(if_true, branch); in TEST()
298 Node* if_true; member
306 if_true = t.graph.NewNode(t.common.IfTrue(), branch); in While()
308 loop->ReplaceInput(loop->InputCount() - 1, if_true); in While()
313 this->loop->ReplaceInput(0, that.if_true); in Nest()
361 CheckInputs(inner.loop, T.start, inner.if_true); in TEST()
[all …]
/external/v8/src/compiler/
Ddiamond.h21 Node* if_true; member
30 if_true = graph->NewNode(common->IfTrue(), branch);
32 merge = graph->NewNode(common->Merge(2), if_true, if_false);
42 void Nest(Diamond& that, bool if_true) { in Nest()
43 if (if_true) { in Nest()
44 branch->ReplaceInput(1, that.if_true); in Nest()
Dcommon-operator-reducer.cc142 Node* if_true = node->InputAt(0); in ReduceMerge() local
144 if (if_true->opcode() != IrOpcode::kIfTrue) std::swap(if_true, if_false); in ReduceMerge()
145 if (if_true->opcode() == IrOpcode::kIfTrue && in ReduceMerge()
147 if_true->InputAt(0) == if_false->InputAt(0) && if_true->OwnedBy(node) && in ReduceMerge()
149 Node* const branch = if_true->InputAt(0); in ReduceMerge()
151 DCHECK(branch->OwnedBy(if_true, if_false)); in ReduceMerge()
197 Node* if_true = merge->InputAt(0); in ReducePhi() local
199 if (if_true->opcode() != IrOpcode::kIfTrue) { in ReducePhi()
200 std::swap(if_true, if_false); in ReducePhi()
203 if (if_true->opcode() == IrOpcode::kIfTrue && in ReducePhi()
[all …]
Dcontrol-flow-optimizer.cc221 Node* if_true; in TryBuildSwitch() local
226 if_true = matcher.IfTrue(); in TryBuildSwitch()
246 if_true->ReplaceInput(0, node); in TryBuildSwitch()
248 NodeProperties::ChangeOp(if_true, common()->IfValue(value)); in TryBuildSwitch()
250 Enqueue(if_true); in TryBuildSwitch()
266 if_true->ReplaceInput(0, node); in TryBuildSwitch()
267 NodeProperties::ChangeOp(if_true, common()->IfValue(value)); in TryBuildSwitch()
268 Enqueue(if_true); in TryBuildSwitch()
Dchange-lowering.cc254 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ChangeInt32ToTagged() local
256 AllocateHeapNumberWithValue(ChangeInt32ToFloat64(value), if_true); in ChangeInt32ToTagged()
261 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ChangeInt32ToTagged()
287 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ChangeTaggedToUI32() local
288 Node* vtrue = graph()->NewNode(op, LoadHeapNumberValue(value, if_true)); in ChangeTaggedToUI32()
293 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ChangeTaggedToUI32()
384 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ChangeTaggedToFloat64() local
385 Node* vtrue = LoadHeapNumberValue(value, if_true); in ChangeTaggedToFloat64()
390 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ChangeTaggedToFloat64()
408 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ChangeUint32ToTagged() local
[all …]
Djs-intrinsic-lowering.cc207 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceIsInstanceType() local
220 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceIsInstanceType()
250 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceIsFunction() local
264 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceIsFunction()
294 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceIsJSReceiver() local
308 control = graph()->NewNode(common()->Merge(2), if_true, if_false); in ReduceIsJSReceiver()
/external/v8/src/full-codegen/arm64/
Dfull-codegen-arm64.cc683 Label* if_true, in DoTest() argument
689 Split(eq, if_true, if_false, fall_through); in DoTest()
698 Label* if_true, in Split() argument
702 __ B(cond, if_true); in Split()
703 } else if (if_true == fall_through) { in Split()
707 __ B(cond, if_true); in Split()
765 Label* if_true, in PrepareForBailoutBeforeSplit() argument
780 Split(eq, if_true, if_false, NULL); in PrepareForBailoutBeforeSplit()
2808 Label* if_true = NULL; in EmitIsSmi() local
2812 &if_true, &if_false, &fall_through); in EmitIsSmi()
[all …]
/external/v8/src/full-codegen/x87/
Dfull-codegen-x87.cc630 Label* if_true, in DoTest() argument
636 Split(equal, if_true, if_false, fall_through); in DoTest()
641 Label* if_true, in Split() argument
645 __ j(cc, if_true); in Split()
646 } else if (if_true == fall_through) { in Split()
649 __ j(cc, if_true); in Split()
710 Label* if_true, in PrepareForBailoutBeforeSplit() argument
722 Split(equal, if_true, if_false, NULL); in PrepareForBailoutBeforeSplit()
2958 Label* if_true = NULL; in EmitIsSmi() local
2962 &if_true, &if_false, &fall_through); in EmitIsSmi()
[all …]
/external/v8/src/full-codegen/mips/
Dfull-codegen-mips.cc679 Label* if_true, in DoTest() argument
686 Split(eq, result_register(), Operand(at), if_true, if_false, fall_through); in DoTest()
693 Label* if_true, in Split() argument
697 __ Branch(if_true, cc, lhs, rhs); in Split()
698 } else if (if_true == fall_through) { in Split()
701 __ Branch(if_true, cc, lhs, rhs); in Split()
764 Label* if_true, in PrepareForBailoutBeforeSplit() argument
776 Split(eq, a0, Operand(t0), if_true, if_false, NULL); in PrepareForBailoutBeforeSplit()
3078 Label* if_true = NULL; in EmitIsSmi() local
3082 &if_true, &if_false, &fall_through); in EmitIsSmi()
[all …]
/external/v8/src/full-codegen/ia32/
Dfull-codegen-ia32.cc633 Label* if_true, in DoTest() argument
639 Split(equal, if_true, if_false, fall_through); in DoTest()
644 Label* if_true, in Split() argument
648 __ j(cc, if_true); in Split()
649 } else if (if_true == fall_through) { in Split()
652 __ j(cc, if_true); in Split()
713 Label* if_true, in PrepareForBailoutBeforeSplit() argument
725 Split(equal, if_true, if_false, NULL); in PrepareForBailoutBeforeSplit()
2966 Label* if_true = NULL; in EmitIsSmi() local
2970 &if_true, &if_false, &fall_through); in EmitIsSmi()
[all …]
/external/v8/src/full-codegen/x64/
Dfull-codegen-x64.cc645 Label* if_true, in DoTest() argument
651 Split(equal, if_true, if_false, fall_through); in DoTest()
656 Label* if_true, in Split() argument
660 __ j(cc, if_true); in Split()
661 } else if (if_true == fall_through) { in Split()
664 __ j(cc, if_true); in Split()
725 Label* if_true, in PrepareForBailoutBeforeSplit() argument
737 Split(equal, if_true, if_false, NULL); in PrepareForBailoutBeforeSplit()
2953 Label* if_true = NULL; in EmitIsSmi() local
2957 &if_true, &if_false, &fall_through); in EmitIsSmi()
[all …]
/external/v8/src/full-codegen/arm/
Dfull-codegen-arm.cc686 Label* if_true, in DoTest() argument
692 Split(eq, if_true, if_false, fall_through); in DoTest()
697 Label* if_true, in Split() argument
701 __ b(cond, if_true); in Split()
702 } else if (if_true == fall_through) { in Split()
705 __ b(cond, if_true); in Split()
769 Label* if_true, in PrepareForBailoutBeforeSplit() argument
782 Split(eq, if_true, if_false, NULL); in PrepareForBailoutBeforeSplit()
3091 Label* if_true = NULL; in EmitIsSmi() local
3095 &if_true, &if_false, &fall_through); in EmitIsSmi()
[all …]
/external/v8/src/full-codegen/mips64/
Dfull-codegen-mips64.cc678 Label* if_true, in DoTest() argument
685 Split(eq, result_register(), Operand(at), if_true, if_false, fall_through); in DoTest()
692 Label* if_true, in Split() argument
696 __ Branch(if_true, cc, lhs, rhs); in Split()
697 } else if (if_true == fall_through) { in Split()
700 __ Branch(if_true, cc, lhs, rhs); in Split()
763 Label* if_true, in PrepareForBailoutBeforeSplit() argument
775 Split(eq, a0, Operand(a4), if_true, if_false, NULL); in PrepareForBailoutBeforeSplit()
3083 Label* if_true = NULL; in EmitIsSmi() local
3087 &if_true, &if_false, &fall_through); in EmitIsSmi()
[all …]
/external/v8/src/full-codegen/ppc/
Dfull-codegen-ppc.cc656 void FullCodeGenerator::DoTest(Expression* condition, Label* if_true, in DoTest() argument
661 Split(eq, if_true, if_false, fall_through); in DoTest()
665 void FullCodeGenerator::Split(Condition cond, Label* if_true, Label* if_false, in Split() argument
668 __ b(cond, if_true, cr); in Split()
669 } else if (if_true == fall_through) { in Split()
672 __ b(cond, if_true, cr); in Split()
730 Label* if_true, in PrepareForBailoutBeforeSplit() argument
743 Split(eq, if_true, if_false, NULL); in PrepareForBailoutBeforeSplit()
3077 Label* if_true = NULL; in EmitIsSmi() local
3080 context()->PrepareTest(&materialize_true, &materialize_false, &if_true, in EmitIsSmi()
[all …]
/external/v8/src/full-codegen/
Dfull-codegen.h301 Label* if_true,
312 Label* if_true,
319 Label* if_true,
323 void Split(Condition cc, Label* if_true, Label* if_false, Label* fall_through,
327 Label* if_true,
375 Label* if_true, in VisitForControl() argument
378 TestContext context(this, expr, if_true, if_false, fall_through); in VisitForControl()
435 Label* if_true,
797 Label** if_true,
837 Label** if_true, Label** if_false,
[all …]
/external/protobuf/src/google/protobuf/stubs/
Dtemplate_util_unittest.cc64 typedef if_<true, true_type, false_type>::type if_true; in TEST() typedef
65 EXPECT_TRUE(if_true::value); in TEST()

12