Searched refs:IfTrue (Results 1 - 25 of 43) sorted by relevance

12

/external/v8/test/unittests/compiler/
H A Dcontrol-equivalence-unittest.cc67 Node* IfTrue(Node* control) { function in class:v8::internal::compiler::ControlEquivalenceTest
68 return Store(graph()->NewNode(common()->IfTrue(), control));
126 Node* t = IfTrue(b);
140 Node* t1 = IfTrue(b1);
143 Node* t2 = IfTrue(b2);
160 Node* t1 = IfTrue(b1);
164 Node* t2 = IfTrue(b2);
180 Node* t1 = IfTrue(b1);
183 Node* t2 = IfTrue(b2);
186 Node* t3 = IfTrue(b
[all...]
H A Dbranch-elimination-unittest.cc50 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch);
53 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch);
90 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch);
95 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch);
130 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
138 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2);
169 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch);
178 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch);
H A Dcontrol-flow-optimizer-unittest.cc47 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
53 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
78 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
84 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
105 Node* control1 = graph()->NewNode(common()->IfTrue(), branch0);
111 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
H A Dscheduler-unittest.cc114 Node* t = graph->NewNode(common->IfTrue(), br);
162 Node* n3 = g->NewNode(common()->IfTrue(), n2);
172 Node* n11 = g->NewNode(common()->IfTrue(), n10);
230 Node* t = graph()->NewNode(common()->IfTrue(), br);
237 Node* t1 = graph()->NewNode(common()->IfTrue(), br1);
269 Node* tA1 = graph()->NewNode(common()->IfTrue(), brA1);
276 Node* tB1 = graph()->NewNode(common()->IfTrue(), brB1);
283 Node* tA2 = graph()->NewNode(common()->IfTrue(), brA2);
290 Node* tB2 = graph()->NewNode(common()->IfTrue(), brB2);
314 Node* t = graph()->NewNode(common()->IfTrue(), b
[all...]
H A Dcommon-operator-reducer-unittest.cc79 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
96 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
113 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
130 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
149 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
170 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
184 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
292 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
312 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
332 Node* if_true = graph()->NewNode(common()->IfTrue(), branc
[all...]
H A Dnode-matchers-unittest.cc737 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
742 EXPECT_EQ(if_true, matcher.IfTrue());
749 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
753 EXPECT_EQ(if_true, matcher.IfTrue());
760 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
765 EXPECT_EQ(if_true, matcher.IfTrue());
777 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
798 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
807 Node* if_true = graph()->NewNode(common()->IfTrue(), sw);
816 Node* if_true = graph()->NewNode(common()->IfTrue(), branc
[all...]
H A Descape-analysis-unittest.cc139 Node* IfTrue() { function in class:v8::internal::compiler::EscapeAnalysisTest
140 return control_ = graph()->NewNode(common()->IfTrue(), control_);
316 Node* ifTrue = IfTrue();
350 Node* ifTrue = IfTrue();
385 Node* ifTrue = IfTrue();
451 Node* ifTrue = IfTrue();
491 Node* ifTrue = IfTrue();
H A Deffect-control-linearizer-unittest.cc92 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
158 // t1: IfTrue(b1) f1: IfFalse(b1)
170 // t2: IfTrue(b2) f2:IfFalse(b2)
197 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
204 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2);
276 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
H A Dnode-properties-unittest.cc91 Node* if_true = NewMockNode(common.IfTrue(), branch);
/external/clang/unittests/ASTMatchers/Dynamic/
H A DVariantValueTest.cpp111 bool IfTrue = false; local
113 IfTrue = true;
115 EXPECT_FALSE(IfTrue);
119 IfTrue = false;
121 IfTrue = true;
123 EXPECT_TRUE(IfTrue);
/external/llvm/lib/Target/Hexagon/
H A DHexagonEarlyIfConv.cpp174 unsigned getCondStoreOpcode(unsigned Opc, bool IfTrue) const;
176 MachineInstr *MI, unsigned PredR, bool IfTrue);
179 unsigned PredR, bool IfTrue);
657 bool IfTrue) const {
662 return IfTrue ? S2_pstorerbt_io : S2_pstorerbf_io;
664 return IfTrue ? S4_pstorerbt_rr : S4_pstorerbf_rr;
667 return IfTrue ? S4_pstorerbt_abs : S4_pstorerbf_abs;
669 return IfTrue ? S4_storeirbt_io : S4_storeirbf_io;
671 return IfTrue ? S2_pstorerht_io : S2_pstorerhf_io;
673 return IfTrue
708 predicateInstr(MachineBasicBlock *ToB, MachineBasicBlock::iterator At, MachineInstr *MI, unsigned PredR, bool IfTrue) argument
757 predicateBlockNB(MachineBasicBlock *ToB, MachineBasicBlock::iterator At, MachineBasicBlock *FromB, unsigned PredR, bool IfTrue) argument
[all...]
H A DHexagonGenMux.cpp212 bool IfTrue = HII->isPredicatedTrue(Opc); local
226 if (IfTrue)
/external/v8/src/compiler/
H A Dcontrol-flow-optimizer.cc81 // EffectPhi nodes whose uses have either the IfTrue or IfFalse as control
99 // IfTrue IfFalse
113 // IfTrue IfFalse ... IfTrue IfFalse
131 // Grab the IfTrue/IfFalse projections of the Branch.
144 // directly control-dependend on either the IfTrue or the IfFalse
153 if (control != matcher.IfTrue() && control != matcher.IfFalse())
168 merge_true_inputs[index] = graph()->NewNode(common()->IfTrue(), branch1);
189 DCHECK(control == matcher.IfTrue() || control == matcher.IfFalse());
190 edge.UpdateTo((control == matcher.IfTrue())
[all...]
H A Ddiamond.h30 if_true = graph->NewNode(common->IfTrue(), branch);
H A Deffect-control-linearizer.cc527 Node* if_smi = graph()->NewNode(common()->IfTrue(), branch_same);
537 Node* if_zero = graph()->NewNode(common()->IfTrue(), branch_zero);
548 Node* if_negative = graph()->NewNode(common()->IfTrue(), branch_negative);
568 Node* if_ovf = graph()->NewNode(common()->IfTrue(), branch_ovf);
593 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
631 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
657 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
700 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
732 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
770 Node* if_true = graph()->NewNode(common()->IfTrue(), branc
[all...]
H A Dsimplified-lowering.cc2202 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
2222 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
2286 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
2303 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
2370 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
2462 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
2469 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
2496 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
2507 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2);
2588 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch
[all...]
H A Djs-intrinsic-lowering.cc194 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
249 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
267 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
H A Dbytecode-graph-builder.h80 Node* NewIfTrue() { return NewNode(common()->IfTrue()); }
H A Dcommon-operator.h165 const Operator* IfTrue();
H A Djs-native-context-specialization.cc134 receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch);
169 this_control = graph()->NewNode(common()->IfTrue(), branch);
194 this_controls.push_back(graph()->NewNode(common()->IfTrue(), branch));
590 this_controls.push_back(graph()->NewNode(common()->IfTrue(), branch));
618 transition_control = graph()->NewNode(common()->IfTrue(), branch);
/external/v8/test/cctest/compiler/
H A Dtest-osr.cc197 Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch);
225 Node* if_true1 = T.graph.NewNode(T.common.IfTrue(), branch1);
229 Node* if_true2 = T.graph.NewNode(T.common.IfTrue(), branch2);
263 Node* if_true1 = T.graph.NewNode(T.common.IfTrue(), branch1);
267 Node* if_true2 = T.graph.NewNode(T.common.IfTrue(), branch2);
306 if_true = t.graph.NewNode(t.common.IfTrue(), branch);
413 Node* x_true = T.graph.NewNode(T.common.IfTrue(), x_branch);
519 Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch);
H A Dtest-loop-analysis.cc196 if_true = t.graph.NewNode(t.common.IfTrue(), branch);
624 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
661 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
696 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
732 Node* if_true1 = t.graph.NewNode(t.common.IfTrue(), branch1);
741 Node* if_true2 = t.graph.NewNode(t.common.IfTrue(), branch2);
808 Node* if_true1 = t.graph.NewNode(t.common.IfTrue(), branch1);
817 Node* if_true2 = t.graph.NewNode(t.common.IfTrue(), branch2);
826 Node* if_true3 = t.graph.NewNode(t.common.IfTrue(), branch3);
934 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branc
[all...]
/external/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h293 Value *GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue,
/external/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp787 Value *llvm::GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue, argument
842 IfTrue = Pred1;
846 IfTrue = Pred2;
870 IfTrue = Pred1;
873 IfTrue = Pred2;
/external/llvm/lib/IR/
H A DInstructions.cpp1021 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
1022 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
1025 assert(IfTrue && "Branch destination may not be null!");
1026 Op<-1>() = IfTrue;
1028 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
1030 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
1033 Op<-1>() = IfTrue;
1041 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
1042 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
1045 assert(IfTrue
[all...]

Completed in 239 milliseconds

12