Home
last modified time | relevance | path

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

12

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonEarlyIfConv.cpp195 unsigned getCondStoreOpcode(unsigned Opc, bool IfTrue) const;
197 MachineInstr *MI, unsigned PredR, bool IfTrue);
200 unsigned PredR, bool IfTrue);
705 bool IfTrue) const { in getCondStoreOpcode()
706 return HII->getCondOpcode(Opc, !IfTrue); in getCondStoreOpcode()
711 unsigned PredR, bool IfTrue) { in predicateInstr()
721 unsigned COpc = getCondStoreOpcode(Opc, IfTrue); in predicateInstr()
742 const MCInstrDesc &D = HII->get(IfTrue ? Hexagon::J2_jumpt in predicateInstr()
762 unsigned PredR, bool IfTrue) { in predicateBlockNB()
773 predicateInstr(ToB, At, &*I, PredR, IfTrue); in predicateBlockNB()
709 predicateInstr(MachineBasicBlock *ToB, MachineBasicBlock::iterator At, MachineInstr *MI, unsigned PredR, bool IfTrue) predicateInstr() argument
760 predicateBlockNB(MachineBasicBlock *ToB, MachineBasicBlock::iterator At, MachineBasicBlock *FromB, unsigned PredR, bool IfTrue) predicateBlockNB() argument
[all...]
H A DHexagonGenMux.cpp252 bool IfTrue = HII->isPredicatedTrue(Opc); in genMuxInBlock() local
266 if (IfTrue) in genMuxInBlock()
H A DHexagonExpandCondsets.cpp579 bool IfTrue) { in getCondTfrOpcode()
597 return IfTrue ? A2_tfrt : A2_tfrf; in getCondTfrOpcode()
599 return IfTrue ? A2_tfrpt : A2_tfrpf; in getCondTfrOpcode()
612 return IfTrue ? C2_cmoveit : C2_cmoveif; in getCondTfrOpcode()
578 getCondTfrOpcode(const MachineOperand &SO, bool IfTrue) getCondTfrOpcode() argument
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
H A DVPlan.h520 /// Set two given VPBlockBases \p IfTrue and \p IfFalse to be the two
522 /// selector. This VPBlockBase is not added as predecessor of \p IfTrue or \p
524 void setTwoSuccessors(VPBlockBase *IfTrue, VPBlockBase *IfFalse,
529 appendSuccessor(IfTrue);
1561 /// Insert disconnected VPBlockBases \p IfTrue and \p IfFalse after \p
1562 /// BlockPtr. Add \p IfTrue and \p IfFalse as succesors of \p BlockPtr and \p
1563 /// BlockPtr as predecessor of \p IfTrue and \p IfFalse. Propagate \p BlockPtr
1564 /// parent to \p IfTrue and \p IfFalse. \p Condition is set as the successor
1565 /// selector. \p BlockPtr must have no successors and \p IfTrue and \p IfFalse
1567 static void insertTwoBlocksAfter(VPBlockBase *IfTrue, VPBlockBas
[all...]
/third_party/node/deps/v8/src/compiler/
H A Ddiamond.h30 if_true = graph->NewNode(common->IfTrue(), branch); in Diamond()
H A Djs-typed-lowering.cc644 control = graph()->NewNode(common()->IfTrue(), branch); in ReduceJSAdd()
1126 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceJSToObject()
1209 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in ReduceJSHasInPrototypeChain()
1243 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceJSHasInPrototypeChain()
1255 if_true1 = graph()->NewNode(common()->IfTrue(), branch10); in ReduceJSHasInPrototypeChain()
1288 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in ReduceJSHasInPrototypeChain()
1299 Node* if_true3 = graph()->NewNode(common()->IfTrue(), branch3); in ReduceJSHasInPrototypeChain()
1895 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceJSForInNext()
2000 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceJSForInPrepare()
2246 controls[count] = graph()->NewNode(common()->IfTrue(), contro in ReduceObjectIsArray()
[all...]
H A Dcontrol-flow-optimizer.cc94 if_true = matcher.IfTrue(); in TryBuildSwitch()
H A Dgraph-assembler.h723 control_ = graph()->NewNode(common()->IfTrue(), branch); in BranchImpl()
750 control_ = graph()->NewNode(common()->IfTrue(), branch); in GotoIf()
765 control_ = AddNode(graph()->NewNode(common()->IfTrue(), branch)); in GotoIfNot()
H A Djs-call-reducer.cc2627 Node* if_null = graph()->NewNode(common()->IfTrue(), control);
2636 Node* if_undefined = graph()->NewNode(common()->IfTrue(), control);
3170 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3241 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
3931 control = graph()->NewNode(common()->IfTrue(), check_branch);
4920 // IfTrue IfFalse
5371 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
5422 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
5520 Node* if_packed = graph()->NewNode(common()->IfTrue(), packed_branch);
5529 Node* if_holey = graph()->NewNode(common()->IfTrue(), holey_branc
[all...]
H A Dnode-matchers.h792 Node* IfTrue() const { return if_true_; } in IfTrue() function
810 Node* IfTrue() const { return if_true_; } in IfTrue() function
H A Djs-native-context-specialization.cc1181 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
1243 receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
1290 this_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
1810 this_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceElementAccess()
2767 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
2839 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
2979 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
3087 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
3210 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in BuildElementAccess()
3263 Node* if_true = graph()->NewNode(common()->IfTrue(), branc in BuildIndexedStringLoad()
[all...]
H A Dsimplified-lowering.cc4401 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in DoJSToNumberOrNumericTruncatesToFloat64()
4439 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberOrNumericTruncatesToFloat64()
4503 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in DoJSToNumberOrNumericTruncatesToWord32()
4538 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberOrNumericTruncatesToWord32()
4667 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in Int32Div()
4676 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Div()
4685 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); in Int32Div()
4744 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in Int32Mod()
4752 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Mod()
4762 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch in Int32Mod()
[all...]
H A Draw-machine-assembler.cc205 graph->NewNode(common->IfTrue(), branch_clone)); in OptimizeControlFlow()
550 true_block->AddNode(MakeNode(common()->IfTrue(), 1, &branch)); in Branch()
H A Dcommon-operator.h480 const Operator* IfTrue();
H A Dcommon-operator-reducer.cc95 // Swap IfTrue/IfFalse on {branch} if {cond} is a BooleanNot and use the input in ReduceBranch()
110 NodeProperties::ChangeOp(use, common()->IfTrue()); in ReduceBranch()
185 // b) the {Merge} has two inputs, one {IfTrue} and one {IfFalse}, which are in ReduceMerge()
187 // c) and the {IfTrue} and {IfFalse} nodes point to the same {Branch}. in ReduceMerge()
H A Djs-intrinsic-lowering.cc250 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceIsInstanceType()
H A Djs-inlining.cc669 graph()->NewNode(common()->IfTrue(), branch_is_receiver); in ReduceJSCall()
H A Djs-inlining-heuristic.cc676 if_successes[i] = graph()->NewNode(common()->IfTrue(), branch); in CreateOrReuseDispatch()
H A Dwasm-compiler.cc230 *true_node = graph()->NewNode(mcgraph()->common()->IfTrue(), branch); in Branch()
2806 Node* if_true0 = graph()->NewNode(c->IfTrue(), branch0); in BuildI32AsmjsRemS()
2814 Node* if_true1 = graph()->NewNode(c->IfTrue(), branch1); in BuildI32AsmjsRemS()
2824 Node* if_true2 = graph()->NewNode(c->IfTrue(), branch2); in BuildI32AsmjsRemS()
2848 Node* if_true1 = graph()->NewNode(c->IfTrue(), branch1); in BuildI32AsmjsRemS()
5763 graph()->NewNode(mcgraph()->common()->IfTrue(), branch));
5772 graph()->NewNode(mcgraph()->common()->IfTrue(), branch));
5783 SetControl(graph()->NewNode(mcgraph()->common()->IfTrue(), branch));
7336 SetEffectControl(old_effect, graph()->NewNode(mcgraph()->common()->IfTrue(),
H A Dopcodes.h18 V(IfTrue) \
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp997 Value *llvm::GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue, in GetIfCondition() argument
1052 IfTrue = Pred1; in GetIfCondition()
1056 IfTrue = Pred2; in GetIfCondition()
1080 IfTrue = Pred1; in GetIfCondition()
1083 IfTrue = Pred2; in GetIfCondition()
H A DSimplifyCFG.cpp2313 BasicBlock *IfTrue, *IfFalse; in FoldTwoEntryPHINode()
2314 Value *IfCond = GetIfCondition(BB, IfTrue, IfFalse); in FoldTwoEntryPHINode()
2413 << " T: " << IfTrue->getName() in FoldTwoEntryPHINode()
2436 Value *FalseVal = PN->getIncomingValue(PN->getIncomingBlock(0) == IfTrue); in FoldTwoEntryPHINode()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h339 Value *GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
H A DInstructions.cpp1131 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore) in BranchInst() argument
1132 : Instruction(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
1135 assert(IfTrue && "Branch destination may not be null!"); in BranchInst()
1136 Op<-1>() = IfTrue; in BranchInst()
1139 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, in BranchInst() argument
1141 : Instruction(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
1144 Op<-1>() = IfTrue; in BranchInst()
1152 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) in BranchInst() argument
1153 : Instruction(Type::getVoidTy(IfTrue->getContext()), Instruction::Br, in BranchInst()
1155 assert(IfTrue in BranchInst()
1159 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, BasicBlock *InsertAtEnd) BranchInst() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
H A DInstructions.h2994 explicit BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore = nullptr);
2995 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
2997 BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd);
2998 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
3037 static BranchInst *Create(BasicBlock *IfTrue, in Create() argument
3039 return new(1) BranchInst(IfTrue, InsertBefore); in Create()
3042 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse, in Create() argument
3044 return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertBefore); in Create()
3047 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) { in Create() argument
3048 return new(1) BranchInst(IfTrue, InsertAtEn in Create()
3051 Create(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, BasicBlock *InsertAtEnd) Create() argument
[all...]

Completed in 75 milliseconds

12