Home
last modified time | relevance | path

Searched refs:IfTrue (Results 1 – 25 of 37) sorted by relevance

12

/external/llvm/lib/Target/Hexagon/
DHexagonEarlyIfConv.cpp172 unsigned getCondStoreOpcode(unsigned Opc, bool IfTrue) const;
174 MachineInstr *MI, unsigned PredR, bool IfTrue);
177 unsigned PredR, bool IfTrue);
655 bool IfTrue) const { in getCondStoreOpcode()
660 return IfTrue ? S2_pstorerbt_io : S2_pstorerbf_io; in getCondStoreOpcode()
662 return IfTrue ? S4_pstorerbt_rr : S4_pstorerbf_rr; in getCondStoreOpcode()
665 return IfTrue ? S4_pstorerbt_abs : S4_pstorerbf_abs; in getCondStoreOpcode()
667 return IfTrue ? S4_storeirbt_io : S4_storeirbf_io; in getCondStoreOpcode()
669 return IfTrue ? S2_pstorerht_io : S2_pstorerhf_io; in getCondStoreOpcode()
671 return IfTrue ? S4_pstorerht_rr : S4_pstorerhf_rr; in getCondStoreOpcode()
[all …]
DHexagonInstrInfoV3.td43 class T_CallPred<bit CSR, bit IfTrue, string ExtStr>
45 CondStr<"$Pu", IfTrue, 0>.S # "call " # ExtStr # "$dst",
48 let isPredicatedFalse = !if(IfTrue,0,1);
56 let Inst{21} = !if(IfTrue,0,1);
DHexagonGenMux.cpp216 bool IfTrue = HII->isPredicatedTrue(Opc); in genMuxInBlock() local
230 if (IfTrue) in genMuxInBlock()
DHexagonExpandCondsets.cpp578 bool IfTrue) { in getCondTfrOpcode() argument
595 return IfTrue ? A2_tfrt : A2_tfrf; in getCondTfrOpcode()
597 return IfTrue ? A2_tfrpt : A2_tfrpf; in getCondTfrOpcode()
602 return IfTrue ? C2_cmoveit : C2_cmoveif; in getCondTfrOpcode()
/external/clang/unittests/ASTMatchers/Dynamic/
DVariantValueTest.cpp108 bool IfTrue = false; in TEST() local
110 IfTrue = true; in TEST()
112 EXPECT_FALSE(IfTrue); in TEST()
116 IfTrue = false; in TEST()
118 IfTrue = true; in TEST()
120 EXPECT_TRUE(IfTrue); in TEST()
/external/v8/src/compiler/
Deffect-control-linearizer.cc234 if (control != matcher.IfTrue() && control != matcher.IfFalse()) return; in TryCloneBranch()
248 merge_true_inputs[index] = graph->NewNode(common->IfTrue(), branch1); in TryCloneBranch()
251 Node* const merge_true = matcher.IfTrue(); in TryCloneBranch()
260 NodeProperties::ChangeOp(matcher.IfTrue(), common->Merge(input_count)); in TryCloneBranch()
263 block->SuccessorAt(0)->NodeAt(0) == matcher.IfTrue() ? 0 : 1; in TryCloneBranch()
284 DCHECK(control == matcher.IfTrue() || control == matcher.IfFalse()); in TryCloneBranch()
285 edge.UpdateTo((control == matcher.IfTrue()) ? phi_true : phi_false); in TryCloneBranch()
830 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in LowerChangeBitToTagged()
868 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in LowerChangeInt32ToTagged()
894 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in LowerChangeUint32ToTagged()
[all …]
Ddiamond.h30 if_true = graph->NewNode(common->IfTrue(), branch);
Djs-builtin-reducer.cc397 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceFastArrayIteratorNext()
482 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceFastArrayIteratorNext()
557 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in ReduceTypedArrayIteratorNext()
641 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceTypedArrayIteratorNext()
754 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceArrayPop()
1547 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceStringCharAt()
1599 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceStringCharCodeAt()
1684 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceStringIteratorNext()
1700 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceStringIteratorNext()
1710 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in ReduceStringIteratorNext()
[all …]
Djs-typed-lowering.cc665 control = graph()->NewNode(common()->IfTrue(), branch); in ReduceCreateConsString()
1137 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceJSToObject()
1350 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceJSOrdinaryHasInstance()
1386 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceJSOrdinaryHasInstance()
1398 if_true1 = graph()->NewNode(common()->IfTrue(), branch10); in ReduceJSOrdinaryHasInstance()
1431 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in ReduceJSOrdinaryHasInstance()
1442 Node* if_true3 = graph()->NewNode(common()->IfTrue(), branch3); in ReduceJSOrdinaryHasInstance()
1633 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceJSConvertReceiver()
1669 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceJSConvertReceiver()
1677 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceJSConvertReceiver()
[all …]
Dcontrol-flow-optimizer.cc90 if_true = matcher.IfTrue(); in TryBuildSwitch()
Dsimplified-lowering.cc2725 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in DoJSToNumberTruncatesToFloat64()
2745 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberTruncatesToFloat64()
2809 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in DoJSToNumberTruncatesToWord32()
2826 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberTruncatesToWord32()
2893 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in DoLoadBuffer()
3026 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in Int32Div()
3035 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Div()
3044 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in Int32Div()
3104 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in Int32Mod()
3112 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Mod()
[all …]
Dmemory-optimizer.cc216 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in VisitAllocate()
284 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in VisitAllocate()
Dbytecode-graph-builder.h91 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } in NewIfTrue()
Dwasm-compiler.cc182 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in AddTrapIf()
1003 *true_node = jsgraph->graph()->NewNode(jsgraph->common()->IfTrue(), branch); in Branch()
2264 Node* if_true = graph()->NewNode(common->IfTrue(), branch); in BuildChangeInt32ToTagged()
2288 Node* if_smi = graph()->NewNode(common->IfTrue(), branch_same); in BuildChangeFloat64ToTagged()
2299 Node* if_zero = graph()->NewNode(common->IfTrue(), branch_zero); in BuildChangeFloat64ToTagged()
2310 Node* if_negative = graph()->NewNode(common->IfTrue(), branch_negative); in BuildChangeFloat64ToTagged()
2329 Node* if_ovf = graph()->NewNode(common->IfTrue(), branch_ovf); in BuildChangeFloat64ToTagged()
2423 Node* if_true1 = graph()->NewNode(common->IfTrue(), branch1); in BuildChangeTaggedToFloat64()
2431 Node* if_true2 = graph()->NewNode(common->IfTrue(), branch2); in BuildChangeTaggedToFloat64()
2466 Node* if_not_smi = graph()->NewNode(common->IfTrue(), branch); in BuildChangeTaggedToFloat64()
[all …]
Dnode-matchers.h665 Node* IfTrue() const { return if_true_; } in IfTrue() function
683 Node* IfTrue() const { return if_true_; } in IfTrue() function
Dcommon-operator.h197 const Operator* IfTrue(); in NON_EXPORTED_BASE()
Djs-inlining-heuristic.cc202 if_successes[i] = graph()->NewNode(common()->IfTrue(), branch); in InlineCandidate()
/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp678 Value *llvm::GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue, in GetIfCondition() argument
733 IfTrue = Pred1; in GetIfCondition()
737 IfTrue = Pred2; in GetIfCondition()
761 IfTrue = Pred1; in GetIfCondition()
764 IfTrue = Pred2; in GetIfCondition()
/external/llvm/test/CodeGen/AArch64/
Dregress-fp128-livein.ll3 ; Regression test for NZCV reg live-in not being added to fp128csel IfTrue BB,
/external/swiftshader/third_party/LLVM/include/llvm/
DInstructions.h2318 explicit BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore = 0);
2319 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
2321 BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd);
2322 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
2327 static BranchInst *Create(BasicBlock *IfTrue, Instruction *InsertBefore = 0) {
2328 return new(1) BranchInst(IfTrue, InsertBefore);
2330 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse,
2332 return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertBefore);
2334 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) {
2335 return new(1) BranchInst(IfTrue, InsertAtEnd);
[all …]
/external/swiftshader/third_party/LLVM/lib/VMCore/
DInstructions.cpp733 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore) in BranchInst() argument
734 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
737 assert(IfTrue != 0 && "Branch destination may not be null!"); in BranchInst()
738 Op<-1>() = IfTrue; in BranchInst()
740 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, in BranchInst() argument
742 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
745 Op<-1>() = IfTrue; in BranchInst()
753 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) in BranchInst() argument
754 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
757 assert(IfTrue != 0 && "Branch destination may not be null!"); in BranchInst()
[all …]
/external/llvm/include/llvm/Transforms/Utils/
DBasicBlockUtils.h283 Value *GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue,
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
DSimplifyCFG.cpp131 static Value *GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue, in GetIfCondition() argument
171 IfTrue = Pred1; in GetIfCondition()
175 IfTrue = Pred2; in GetIfCondition()
199 IfTrue = Pred1; in GetIfCondition()
202 IfTrue = Pred2; in GetIfCondition()
1250 BasicBlock *IfTrue, *IfFalse; in FoldTwoEntryPHINode() local
1251 Value *IfCond = GetIfCondition(BB, IfTrue, IfFalse); in FoldTwoEntryPHINode()
1336 << IfTrue->getName() << " F: " << IfFalse->getName() << "\n"); in FoldTwoEntryPHINode()
1357 Value *FalseVal = PN->getIncomingValue(PN->getIncomingBlock(0) == IfTrue); in FoldTwoEntryPHINode()
/external/llvm/lib/IR/
DInstructions.cpp1150 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore) in BranchInst() argument
1151 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
1154 assert(IfTrue && "Branch destination may not be null!"); in BranchInst()
1155 Op<-1>() = IfTrue; in BranchInst()
1157 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, in BranchInst() argument
1159 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
1162 Op<-1>() = IfTrue; in BranchInst()
1170 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) in BranchInst() argument
1171 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
1174 assert(IfTrue && "Branch destination may not be null!"); in BranchInst()
[all …]
/external/llvm/include/llvm/IR/
DInstructions.h2893 explicit BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore = nullptr);
2894 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
2896 BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd);
2897 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
2906 static BranchInst *Create(BasicBlock *IfTrue,
2908 return new(1) BranchInst(IfTrue, InsertBefore);
2910 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse,
2912 return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertBefore);
2914 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) {
2915 return new(1) BranchInst(IfTrue, InsertAtEnd);
[all …]

12