| /external/swiftshader/third_party/subzero/tests_lit/llvm2ice_tests/ |
| D | cond-branch.ll | 18 br i1 %cmp1, label %branch1, label %branch2
19 branch1:
26 ; MIPS32-NEXT: .Lcond_br_eq$branch1
30 ; MIPS32-OM1-NEXT: b .Lcond_br_eq$branch1
35 br i1 %cmp1, label %branch1, label %branch2
36 branch1:
43 ; MIPS32-NEXT: .Lcond_br_ne$branch1
47 ; MIPS32-OM1-NEXT: b .Lcond_br_ne$branch1
52 br i1 %cmp1, label %branch1, label %branch2
53 branch1:
[all …]
|
| D | bool-folding.ll | 20 br i1 %cmp1, label %branch1, label %branch2
21 branch1:
44 br i1 %cmp1, label %branch1, label %branch2
45 branch1:
73 br i1 %cmp1, label %branch1, label %branch2
74 branch1:
97 br i1 %cmp1, label %branch1, label %branch2
98 branch1:
279 br i1 %cmp1, label %branch1, label %branch2
280 branch1:
|
| D | nacl-atomic-fence-all.ll | 187 br i1 %cmp, label %branch1, label %branch2
188 branch1:
|
| D | 64bit.pnacl.ll | 2478 br i1 %cond, label %branch1, label %branch2
2479 branch1:
2484 %merge = phi i64 [ %tmp, %branch1 ], [ 20014547621496, %entry ]
2500 br i1 %cond, label %branch1, label %branch2
2501 branch1:
2506 %merge = phi i64 [ %tmp, %branch1 ], [ undef, %entry ]
|
| /external/llvm/test/Transforms/RewriteStatepointsForGC/ |
| D | call-gc-result.ll | 13 br i1 %cond, label %branch1, label %branch2
15 branch1:
23 ;; CHECK: %phi = phi i32 [ %a, %branch2 ], [ %b, %branch1 ]
26 %phi = phi i32 [ %a, %branch2 ], [ %b, %branch1 ]
|
| /external/v8/src/compiler/ |
| D | control-flow-optimizer.cc | 95 Node* branch1 = *it++; in TryBuildSwitch() local
96 if (branch1->opcode() != IrOpcode::kBranch) break; in TryBuildSwitch()
97 if (BranchHintOf(branch1->op()) != BranchHint::kNone) break; in TryBuildSwitch()
99 Node* cond1 = branch1->InputAt(0); in TryBuildSwitch()
116 branch = branch1; in TryBuildSwitch()
|
| D | simplified-lowering.cc | 2869 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0); in DoJSToNumberTruncatesToFloat64() local
2871 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberTruncatesToFloat64()
2880 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in DoJSToNumberTruncatesToFloat64()
2950 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0); in DoJSToNumberTruncatesToWord32() local
2952 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in DoJSToNumberTruncatesToWord32()
2957 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in DoJSToNumberTruncatesToWord32()
3159 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0); in Int32Div() local
3161 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in Int32Div()
3164 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in Int32Div()
3236 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_true0); in Int32Mod() local
[all …]
|
| D | js-builtin-reducer.cc | 379 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), in ReduceFastArrayIteratorNext() local
385 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceFastArrayIteratorNext()
452 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in ReduceFastArrayIteratorNext()
1839 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceStringIteratorNext() local
1841 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceStringIteratorNext()
1897 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in ReduceStringIteratorNext()
|
| D | js-typed-lowering.cc | 1514 Node* branch1 = in ReduceJSOrdinaryHasInstance() local
1517 control = graph()->NewNode(common()->IfFalse(), branch1); in ReduceJSOrdinaryHasInstance()
1519 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceJSOrdinaryHasInstance()
1811 Node* branch1 = in ReduceJSConvertReceiver() local
1813 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in ReduceJSConvertReceiver()
1814 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in ReduceJSConvertReceiver()
|
| D | wasm-compiler.cc | 2023 Node* branch1 = graph()->NewNode(c->Branch(), check1, if_true0); in BuildI32AsmjsRemS() local
2025 Node* if_true1 = graph()->NewNode(c->IfTrue(), branch1); in BuildI32AsmjsRemS()
2028 Node* if_false1 = graph()->NewNode(c->IfFalse(), branch1); in BuildI32AsmjsRemS()
2056 Node* branch1 = in BuildI32AsmjsRemS() local
2059 Node* if_true1 = graph()->NewNode(c->IfTrue(), branch1); in BuildI32AsmjsRemS()
2062 Node* if_false1 = graph()->NewNode(c->IfFalse(), branch1); in BuildI32AsmjsRemS()
2545 Node* branch1 = in BuildChangeTaggedToFloat64() local
2548 Node* if_true1 = graph()->NewNode(common->IfTrue(), branch1); in BuildChangeTaggedToFloat64()
2565 Node* if_false1 = graph()->NewNode(common->IfFalse(), branch1); in BuildChangeTaggedToFloat64()
|
| D | effect-control-linearizer.cc | 249 Node* branch1 = graph->NewNode(common->Branch(hint), cond1, control1); in TryCloneBranch() local
250 merge_true_inputs[index] = graph->NewNode(common->IfTrue(), branch1); in TryCloneBranch()
251 merge_false_inputs[index] = graph->NewNode(common->IfFalse(), branch1); in TryCloneBranch()
|
| /external/llvm/test/Transforms/NaryReassociate/ |
| D | nary-add.ll | 78 br i1 %p1, label %then1, label %branch1
84 br label %branch1
86 branch1:
|
| /external/pdfium/core/fpdfapi/parser/ |
| D | cpdf_document_unittest.cpp | 58 CPDF_Dictionary* branch1 = in CPDF_TestDocumentForPages() local
62 zeroToThree->AddNew<CPDF_Reference>(this, branch1->GetObjNum()); in CPDF_TestDocumentForPages()
|
| /external/llvm/test/Transforms/PGOProfile/ |
| D | branch1.ll | 8 ; RUN: llvm-profdata merge %S/Inputs/branch1.proftext -o %t.profdata
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | arm64-fast-isel-br.ll | 3 define void @branch1() nounwind uwtable ssp {
|