| /external/v8/test/cctest/compiler/ |
| test-osr.cc | 184 CHECK(!nodes.IsLive(d.branch));
196 Node* branch = T.graph.NewNode(T.common.Branch(), T.p0, loop); local
197 Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch);
198 Node* if_false = T.graph.NewNode(T.common.IfFalse(), branch);
210 CheckInputs(branch, T.p0, loop);
211 CheckInputs(if_true, branch);
212 CheckInputs(if_false, branch);
224 Node* branch1 = T.graph.NewNode(T.common.Branch(), T.p0, loop);
228 Node* branch2 = T.graph.NewNode(T.common.Branch(), T.p0, if_true1)
297 Node* branch; member in struct:v8::internal::compiler::While
518 Node* branch = T.graph.NewNode(T.common.Branch(), loop2_cntr, loop2.exit); local
[all...] |
| test-loop-analysis.cc | 188 Node* branch; member in struct:v8::internal::compiler::While
195 branch = t.graph.NewNode(t.common.Branch(), cond, loop);
196 if_true = t.graph.NewNode(t.common.IfTrue(), branch);
197 exit = t.graph.NewNode(t.common.IfFalse(), branch);
261 Node* body[] = {w.branch, w.if_true};
278 Node* body[] = {w.branch, w.if_true};
294 Node* body[] = {w.branch, w.if_true, c.add};
310 Node* body[] = {w.branch, w.if_true, c.store};
327 Node* body[] = {w.branch, w.if_true, c1.add, c2.add}
623 Node* branch = t.graph.NewNode(t.common.Branch(), cond, last); local
660 Node* branch = t.graph.NewNode(t.common.Branch(), cond, exit); local
695 Node* branch = t.graph.NewNode(t.common.Branch(), cond, loop); local
933 Node* branch = t.graph.NewNode(t.common.Branch(), phi, loop); local
969 Node* branch = t.graph.NewNode(t.common.Branch(), phi, loop); local
[all...] |
| test-run-machops.cc | 562 m.Branch(ovf, &blocka, &blockb);
654 m.Branch(ovf, &blocka, &blockb);
743 m.Branch(m.Int32Constant(0), &blocka, &blockb);
759 m.Branch(m.Int32Constant(0), &blocka, &blockb);
778 m.Branch(m.Int32Constant(0), &body, &exit);
793 m->Branch(cond_node, &blocka, &blockb);
873 m.Branch(cond_node, &body, &end);
896 m.Branch(cond, &blockb, &end);
926 m.Branch(m.Int32Constant(0), &body, &end);
[all...] |
| test-run-wasm-machops.cc | 156 m.Branch(cond, &within_bounds, &out_of_bounds);
|
| /external/v8/test/cctest/ |
| test-code-stubs-mips.cc | 130 __ Branch(&ok, eq, v0, Operand(zero_reg));
140 __ Branch(&ok1, eq, v0, Operand(zero_reg));
|
| test-code-stubs-mips64.cc | 125 __ Branch(&ok, eq, v0, Operand(zero_reg));
135 __ Branch(&ok1, eq, v0, Operand(zero_reg));
|
| /external/v8/test/webkit/ |
| dfg-branch-logical-not-peephole-around-osr-exit.js | 25 "Tests that our attempts to do peephole Branch(LogicalNot) optimization doesn't break OSR exit's ability to recover the value of LogicalNot."
|
| dfg-branch-not-fail.js | 25 "Check that short-circuiting Branch(LogicalNot(@a)) and then failing speculation does not result in the branch being taken the wrong way."
|
| dfg-mispredict-variable-but-prove-int.js | 25 "Tests that a variable predicted to be either int or double but proven to be an int does confuse the Branch logic."
|
| /art/compiler/utils/mips/ |
| assembler_mips.h | 76 uint32_t prev_branch_id_plus_one_; // To get distance from preceding branch, if any.
118 for (auto& branch : branches_) {
119 CHECK(branch.IsResolved());
556 // and branch to a ExceptionSlowPath if it is.
595 class Branch {
630 // Branch length as a number of 4-byte-long instructions.
632 // Ordinal number (0-based) of the first (or the only) instruction that contains the branch's
639 // How large (in bits) a PC-relative offset can be for a given type of branch (kR6CondBranch
648 // Unconditional branch.
649 Branch(bool is_r6, uint32_t location, uint32_t target)
[all...] |
| /art/compiler/utils/mips64/ |
| assembler_mips64.h | 76 uint32_t prev_branch_id_plus_one_; // To get distance from preceding branch, if any.
116 for (auto& branch : branches_) {
117 CHECK(branch.IsResolved());
478 // and branch to a ExceptionSlowPath if it is.
517 class Branch {
545 // Branch length as a number of 4-byte-long instructions.
547 // Ordinal number (0-based) of the first (or the only) instruction that contains the branch's
554 // How large (in bits) a PC-relative offset can be for a given type of branch (kCondBranch is
563 // Unconditional branch.
564 Branch(uint32_t location, uint32_t target)
[all...] |
| /external/v8/src/interpreter/ |
| interpreter-intrinsics.cc | 131 __ Branch(condition, &return_true, &return_false);
162 __ Branch(condition, &return_true, &return_false);
205 __ Branch(__ WordIsSmi(arg), &if_smi, &if_not_smi);
|
| /external/v8/src/compiler/ |
| simplified-lowering.cc | 2367 Node* branch = local
[all...] |
| js-intrinsic-lowering.cc | 192 Node* branch = graph()->NewNode(common()->Branch(), check, control); local
194 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
198 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
247 Node* branch0 = graph()->NewNode(common()->Branch(), check0, control);
265 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0);
|
| bytecode-graph-builder.h | 9 #include "src/compiler/bytecode-branch-analysis.h"
85 return NewNode(common()->Branch(hint), condition);
|
| common-operator.h | 164 const Operator* Branch(BranchHint = BranchHint::kNone);
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyIndVar.cpp | 422 // Find a branch guarded by the overflow check.
423 BranchInst *Branch = nullptr;
432 Branch = dyn_cast<BranchInst>(ExtractInst->user_back());
435 if (!AddVal || !Branch)
438 BasicBlock *ContinueBB = Branch->getSuccessor(1);
|
| /external/emma/core/java12/com/vladium/emma/instr/ |
| InstrVisitor.java | 737 boolean branch = false;
755 if (branch)
757 // previous instruction was a branch: this one is a leader
759 branch = false;
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SILowerControlFlow.cpp | 37 /// // branch if all the bits of
39 /// %VGPR0 = V_ADD_F32 %VGPR0, %VGPR0 // Do the IF block of the branch
44 /// S_BRANCH_EXECZ label1 // Use our branch optimization
89 void Branch(MachineInstr &MI);
292 void SILowerControlFlowPass::Branch(MachineInstr &MI) {
539 Branch(MI);
|
| /external/llvm/utils/release/ |
| build_llvm_package.bat | 21 set branch=trunk
variable
26 echo Branch: %branch%
37 echo Checking out %branch% at r%revision%...
38 svn.exe export -r %revision% http://llvm.org/svn/llvm-project/llvm/%branch% llvm || exit /b
39 svn.exe export -r %revision% http://llvm.org/svn/llvm-project/cfe/%branch% llvm/tools/clang || exit /b
40 svn.exe export -r %revision% http://llvm.org/svn/llvm-project/clang-tools-extra/%branch% llvm/tools/clang/tools/extra || exit /b
41 svn.exe export -r %revision% http://llvm.org/svn/llvm-project/lld/%branch% llvm/tools/lld || exit /b
42 svn.exe export -r %revision% http://llvm.org/svn/llvm-project/compiler-rt/%branch% llvm/projects/compiler-rt || exit /b
|
| /external/v8/test/unittests/compiler/ |
| common-operator-unittest.cc | 206 TEST_F(CommonOperatorTest, Branch) {
208 const Operator* const op = common()->Branch(hint);
|
| node-properties-unittest.cc | 89 Node* branch = NewMockNode(common.Branch()); local
90 Node* if_false = NewMockNode(common.IfFalse(), branch);
91 Node* if_true = NewMockNode(common.IfTrue(), branch);
92 NodeProperties::CollectControlProjections(branch, result, arraysize(result));
|
| /external/v8/test/unittests/compiler/arm64/ |
| instruction-selector-arm64-unittest.cc | [all...] |
| /external/llvm/test/MC/Mips/ |
| micromips-branch-instructions.s | 8 # Branch Instructions
|
| /external/skia/src/animator/ |
| SkScriptTokenizer.cpp | 127 Branch branch(kUnassigned, 0, 0);
128 fBranchStack.push(branch);
142 Branch& branch = fBranchStack.index(index); local
143 if (branch.fPrimed == Branch::kIsPrimed)
144 resolveBranch(branch);
147 while (fBranchStack.top().fDone == Branch::kIsDone)
698 Branch& branch = fBranchStack.index(branchIndex++) local
954 Branch& branch = fBranchStack.index(branchIndex++); local
1021 Branch& branch = fBranchStack.top(); local
[all...] |
