Home
last modified time | relevance | path

Searched refs:IfFalse (Results 1 - 25 of 29) sorted by relevance

12

/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
523 /// IfFalse. This VPBlockBase must have no successors.
524 void setTwoSuccessors(VPBlockBase *IfTrue, VPBlockBase *IfFalse,
530 appendSuccessor(IfFalse);
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, VPBlockBase *IfFalse,
[all...]
/third_party/node/deps/v8/src/compiler/
H A Ddiamond.h31 if_false = graph->NewNode(common->IfFalse(), branch); in Diamond()
H A Djs-typed-lowering.cc618 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceJSAdd()
1130 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceJSToObject()
1213 control = graph()->NewNode(common()->IfFalse(), branch0); in ReduceJSHasInPrototypeChain()
1241 control = graph()->NewNode(common()->IfFalse(), branch1); in ReduceJSHasInPrototypeChain()
1258 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch10); in ReduceJSHasInPrototypeChain()
1292 control = graph()->NewNode(common()->IfFalse(), branch2); in ReduceJSHasInPrototypeChain()
1303 control = graph()->NewNode(common()->IfFalse(), branch3); in ReduceJSHasInPrototypeChain()
1905 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceJSForInNext()
2027 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceJSForInPrepare()
2251 control = graph()->NewNode(common()->IfFalse(), contro in ReduceObjectIsArray()
[all...]
H A Dcontrol-flow-optimizer.cc95 if_false = matcher.IfFalse(); in TryBuildSwitch()
H A Djs-call-reducer.cc2628 control = graph()->NewNode(common()->IfFalse(), control);
2637 control = graph()->NewNode(common()->IfFalse(), control);
3158 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3229 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
3926 Node* check_fail = graph()->NewNode(common()->IfFalse(), check_branch);
4920 // IfTrue IfFalse
5375 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
5428 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
5523 Node* if_not_packed = graph()->NewNode(common()->IfFalse(), packed_branch);
5532 graph()->NewNode(common()->IfFalse(), holey_branc
[all...]
H A Dgraph-assembler.h726 control_ = graph()->NewNode(common()->IfFalse(), branch); in BranchImpl()
753 control_ = AddNode(graph()->NewNode(common()->IfFalse(), branch)); in GotoIf()
762 control_ = graph()->NewNode(common()->IfFalse(), branch); in GotoIfNot()
H A Dnode-matchers.h793 Node* IfFalse() const { return if_false_; } in IfFalse() function
811 Node* IfFalse() const { return if_false_; } in IfFalse() function
H A Djs-native-context-specialization.cc1184 Control if_false{graph()->NewNode(common()->IfFalse(), branch)}; in ReduceNamedAccess()
1242 control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
1289 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
1809 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in ReduceElementAccess()
2788 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
2859 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
3016 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
3075 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
3217 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in BuildElementAccess()
3276 Node* if_false = graph()->NewNode(common()->IfFalse(), branc in BuildIndexedStringLoad()
[all...]
H A Dsimplified-lowering.cc4409 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in DoJSToNumberOrNumericTruncatesToFloat64()
4448 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in DoJSToNumberOrNumericTruncatesToFloat64()
4508 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in DoJSToNumberOrNumericTruncatesToWord32()
4543 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in DoJSToNumberOrNumericTruncatesToWord32()
4670 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in Int32Div()
4679 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in Int32Div()
4688 Node* if_false2 = graph()->NewNode(common()->IfFalse(), branch2); in Int32Div()
4755 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in Int32Mod()
4769 Node* if_false2 = graph()->NewNode(common()->IfFalse(), branch2); in Int32Mod()
4780 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch in Int32Mod()
[all...]
H A Draw-machine-assembler.cc207 graph->NewNode(common->IfFalse(), branch_clone)); in OptimizeControlFlow()
553 false_block->AddNode(MakeNode(common()->IfFalse(), 1, &branch)); in Branch()
H A Dcommon-operator.h481 const Operator* IfFalse();
H A Dcommon-operator-reducer.cc95 // Swap IfTrue/IfFalse on {branch} if {cond} is a BooleanNot and use the input in ReduceBranch()
107 NodeProperties::ChangeOp(use, common()->IfFalse()); 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.cc254 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceIsInstanceType()
H A Djs-inlining.cc671 graph()->NewNode(common()->IfFalse(), branch_is_receiver); in ReduceJSCall()
H A Djs-inlining-heuristic.cc675 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch); in CreateOrReuseDispatch()
H A Dwasm-compiler.cc231 *false_node = graph()->NewNode(mcgraph()->common()->IfFalse(), branch); in Branch()
2817 Node* if_false1 = graph()->NewNode(c->IfFalse(), branch1); in BuildI32AsmjsRemS()
2830 Node* if_false2 = graph()->NewNode(c->IfFalse(), branch2); in BuildI32AsmjsRemS()
2841 Node* if_false0 = graph()->NewNode(c->IfFalse(), branch0); in BuildI32AsmjsRemS()
2851 Node* if_false1 = graph()->NewNode(c->IfFalse(), branch1); in BuildI32AsmjsRemS()
5765 SetControl(graph()->NewNode(mcgraph()->common()->IfFalse(), branch));
5774 SetControl(graph()->NewNode(mcgraph()->common()->IfFalse(), branch));
5781 graph()->NewNode(mcgraph()->common()->IfFalse(), branch));
7322 graph()->NewNode(mcgraph()->common()->IfFalse(), exception_branch));
H A Dopcodes.h19 V(IfFalse) \
H A Deffect-control-linearizer.cc467 // EffectPhi nodes whose uses have either the IfTrue or IfFalse as control in TryCloneBranch()
485 // IfTrue IfFalse in TryCloneBranch()
499 // IfTrue IfFalse ... IfTrue IfFalse in TryCloneBranch()
520 // Grab the IfTrue/IfFalse projections of the Branch. in TryCloneBranch()
533 // directly control-dependend on either the IfTrue or the IfFalse in TryCloneBranch()
540 if (control != matcher.IfTrue() && control != matcher.IfFalse()) return; in TryCloneBranch()
555 merge_false_inputs[index] = graph->NewNode(common->IfFalse(), branch1); in TryCloneBranch()
558 Node* const merge_false = matcher.IfFalse(); in TryCloneBranch()
567 NodeProperties::ChangeOp(matcher.IfFalse(), commo in TryCloneBranch()
[all...]
H A Dcommon-operator.cc448 V(IfFalse, Operator::kKontrol, 0, 0, 1, 0, 0, 1) \
H A Djs-generic-lowering.cc1209 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in LowerJSStackCheck()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp998 BasicBlock *&IfFalse) { in GetIfCondition()
1053 IfFalse = Pred2; in GetIfCondition()
1057 IfFalse = Pred1; in GetIfCondition()
1081 IfFalse = Pred2; in GetIfCondition()
1084 IfFalse = Pred1; in GetIfCondition()
997 GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue, BasicBlock *&IfFalse) GetIfCondition() argument
H A DSimplifyCFG.cpp2313 BasicBlock *IfTrue, *IfFalse; in FoldTwoEntryPHINode()
2314 Value *IfCond = GetIfCondition(BB, IfTrue, IfFalse); in FoldTwoEntryPHINode()
2414 << " F: " << IfFalse->getName() << "\n"); in FoldTwoEntryPHINode()
2435 Value *TrueVal = PN->getIncomingValue(PN->getIncomingBlock(0) == IfFalse); in FoldTwoEntryPHINode()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h340 BasicBlock *&IfFalse);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
H A DInstructions.h2995 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
2998 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
3042 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse, in Create() argument
3044 return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertBefore); in Create()
3051 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse, in Create() argument
3053 return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertAtEnd); in Create()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
H A DInstructions.cpp1139 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, in BranchInst() argument
1145 Op<-2>() = IfFalse; in BranchInst()
1159 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, in BranchInst() argument
1164 Op<-2>() = IfFalse; in BranchInst()

Completed in 90 milliseconds

12