| /external/v8/src/full-codegen/mips/ |
| full-codegen-mips.cc | 148 __ Branch(&ok, hs, t5, Operand(a2));
166 __ Branch(&loop_header, ne, a2, Operand(zero_reg));
328 __ Branch(&ok, hs, sp, Operand(at));
381 // to make sure it is constant. Branch may emit a skip-or-jump sequence
382 // instead of the normal Branch. It seems that the "skip" part of that
383 // sequence is about as long as this Branch would be so it is safe to ignore
423 __ Branch(&ok, ge, a3, Operand(zero_reg));
439 __ Branch(&return_label_);
502 if (false_label_ != fall_through_) __ Branch(false_label_);
504 if (true_label_ != fall_through_) __ Branch(true_label_)
[all...] |
| /external/v8/src/full-codegen/mips64/ |
| full-codegen-mips64.cc | 147 __ Branch(&ok, hs, t1, Operand(a2));
165 __ Branch(&loop_header, ne, a2, Operand(zero_reg));
325 __ Branch(&ok, hs, sp, Operand(at));
380 // to make sure it is constant. Branch may emit a skip-or-jump sequence
381 // instead of the normal Branch. It seems that the "skip" part of that
382 // sequence is about as long as this Branch would be so it is safe to ignore
422 __ Branch(&ok, ge, a3, Operand(zero_reg));
438 __ Branch(&return_label_);
501 if (false_label_ != fall_through_) __ Branch(false_label_);
503 if (true_label_ != fall_through_) __ Branch(true_label_)
[all...] |
| /external/v8/src/ic/mips/ |
| handler-compiler-mips.cc | 146 __ Branch(miss_label, ne, scratch0, Operand(zero_reg));
150 __ Branch(miss_label, lt, scratch0, Operand(FIRST_JS_RECEIVER_TYPE));
159 __ Branch(miss_label, ne, map, Operand(tmp));
205 __ Branch(miss, ne, scratch, Operand(at));
380 __ Branch(miss, ne, at, Operand(zero_reg));
396 __ Branch(miss_label, ne, value_reg, Operand(scratch));
409 // Compare map directly within the Branch() functions.
411 __ Branch(miss_label, ne, map_reg, Operand(scratch));
433 __ Branch(miss, ne, scratch1,
445 __ Branch(miss, ne, scratch1, Operand(scratch2))
[all...] |
| stub-cache-mips.cc | 52 __ Branch(&miss, ne, name, Operand(at));
57 __ Branch(&miss, ne, at, Operand(scratch2));
69 __ Branch(&miss, ne, flags_reg, Operand(flags));
|
| /external/v8/src/ic/mips64/ |
| handler-compiler-mips64.cc | 146 __ Branch(miss_label, ne, scratch0, Operand(zero_reg));
150 __ Branch(miss_label, lt, scratch0, Operand(FIRST_JS_RECEIVER_TYPE));
159 __ Branch(miss_label, ne, map, Operand(tmp));
205 __ Branch(miss, ne, scratch, Operand(at));
380 __ Branch(miss, ne, at, Operand(zero_reg));
396 __ Branch(miss_label, ne, value_reg, Operand(scratch));
409 // Compare map directly within the Branch() functions.
411 __ Branch(miss_label, ne, map_reg, Operand(scratch));
433 __ Branch(miss, ne, scratch1,
445 __ Branch(miss, ne, scratch1, Operand(scratch2))
[all...] |
| stub-cache-mips64.cc | 52 __ Branch(&miss, ne, name, Operand(at));
58 __ Branch(&miss, ne, at, Operand(scratch2));
71 __ Branch(&miss, ne, flags_reg, Operand(flags));
|
| /external/v8/test/unittests/compiler/ |
| loop-peeling-unittest.cc | 29 Node* branch; member in struct:v8::internal::compiler::While
36 struct Branch {
37 Node* branch; member in struct:v8::internal::compiler::Branch
109 Node* branch = graph()->NewNode(common()->Branch(), cond, loop); local
110 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
111 Node* exit = graph()->NewNode(common()->IfFalse(), branch);
113 return {loop, branch, if_true, exit};
126 Branch NewBranch(Node* cond, Node* control = nullptr) {
128 Node* branch = graph()->NewNode(common()->Branch(), cond, control) local
[all...] |
| escape-analysis-unittest.cc | 134 Node* Branch() {
136 graph()->NewNode(common()->Branch(), Constant(0), control_);
314 Branch();
348 Branch();
383 Branch();
439 Branch();
479 Branch();
|
| effect-control-linearizer-unittest.cc | 89 Node* branch = local
90 graph()->NewNode(common()->Branch(), Int32Constant(0), graph()->start());
92 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
98 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
119 schedule.AddBranch(start, branch, tblock, fblock);
153 // b1: Branch(const0, s1)
165 // b2: Branch(const0 , s1)
196 graph()->NewNode(common()->Branch(), const0, graph()->start());
203 graph()->NewNode(common()->Branch(), const0, graph()->start());
274 Node* branch = graph()->NewNode(common()->Branch(), cond, loop) local
[all...] |
| move-optimizer-unittest.cc | 155 EndBlock(Branch(Imm(), 1, 2));
180 EndBlock(Branch(Imm(), 1, 2));
250 EndBlock(Branch(Imm(), 1, 2));
287 EndBlock(Branch(Imm(), 1, 2));
|
| /external/v8/src/mips64/ |
| macro-assembler-mips64.cc | 95 Branch(2, NegateCondition(cond), src1, src2);
112 Branch(2, NegateCondition(cond), src1, src2);
201 Label* branch) {
205 CheckPageFlag(object, scratch, mask, cc, branch);
240 Branch(&ok, eq, t8, Operand(zero_reg));
308 Branch(&ok, eq, at, Operand(zero_reg));
502 Branch(&done, ne, t8, Operand(zero_reg));
542 Branch(&load_context);
567 Branch(&same_contexts, eq, scratch, Operand(at));
595 Branch(miss, ne, scratch, Operand(at))
[all...] |
| /external/llvm/lib/Target/SystemZ/ |
| SystemZInstrInfo.h | 67 // Classifies a branch.
96 // Information about a branch instruction.
97 struct Branch {
98 // The type of the branch.
104 // CCMASK_<N> is set if the branch should be taken when CC == N.
107 // The target of the branch.
110 Branch(BranchType type, unsigned ccValid, unsigned ccMask,
204 // Return true if MI is a conditional or unconditional branch.
206 // values on which the instruction will branch, and set Target
207 // to the operand that contains the branch target. This targe
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-jump-threading.cc | 41 int Branch(int ttarget, int ftarget) {
431 code.Branch(1, 2);
454 code.Branch(1, 2);
483 code.Branch(1, 2);
491 code.Branch(4, 5);
585 code.Branch(1 + find(1, permutation, size),
732 int b1 = code.Branch(2, 3);
|
| test-code-assembler.cc | 220 m.Branch(m.Int32Constant(1), &l1, &l2);
239 m.Branch(m.Int32Constant(1), &l1, &l2);
262 m.Branch(m.Int32Constant(1), &l1, &l2);
285 m.Branch(m.Int32Constant(1), &l1, &l2);
330 m.Branch(m.Int32Constant(1), &l1, &merge);
344 m.Branch(m.Int32Constant(1), &l3, &l1);
417 m.Branch(m.WordEqual(m.Parameter(0), m.IntPtrConstant(0)), &block1, &block4);
421 m.Branch(m.WordEqual(m.Parameter(0), m.IntPtrConstant(0)), &block2,
|
| /external/v8/src/ |
| code-stub-assembler.cc | 111 Branch(Float64GreaterThan(x, zero), &if_xgreaterthanzero,
164 Branch(Float64GreaterThan(x, zero), &if_xgreaterthanzero,
217 Branch(Float64GreaterThan(x, zero), &if_xgreaterthanzero,
355 Branch(UintPtrGreaterThanOrEqual(new_top, limit), &runtime_call,
401 Branch(WordAnd(top, IntPtrConstant(kDoubleAlignmentMask)), ¬_aligned,
421 Branch(IntPtrEqual(adjusted_size.value(), size_in_bytes), &doesnt_need_filler,
729 Branch(IntPtrLessThanOrEqual(size,
782 Branch(IntPtrLessThanOrEqual(size,
[all...] |
| /external/v8/test/cctest/ |
| test-macro-assembler-mips.cc | 247 // Similar to test-assembler-mips jump_tables1, with extra test for branch
249 // blocked), and proper transition to long-branch mode.
267 __ Branch(&end);
271 // trampoline for branch distance fixup.
282 __ Branch(&done);
291 __ Branch(&near_start);
314 // compact branch instruction before emission of the dd table.
339 __ nop(); // Branch delay slot nop.
673 __ Branch(&end);
676 __ Branch(&end)
[all...] |
| test-code-stub-assembler.cc | 143 m.Branch(m.Word32Equal(m.SmiToWord32(expected_arg), var_index.value()),
150 m.Branch(m.WordEqual(expected_arg, key), &passed, &failed);
153 m.Branch(
243 m.Branch(m.Word32Equal(m.SmiToWord32(expected_arg), var_name_index.value()),
247 m.Branch(
349 m.Branch(m.Word32Equal(m.SmiToWord32(expected_arg), var_entry.value()),
353 m.Branch(
485 m.Branch(m.WordEqual(expected_result, m.SmiConstant(Smi::FromInt(kFound))),
489 m.Branch(
494 m.Branch(
[all...] |
| /external/v8/src/compiler/ |
| effect-control-linearizer.cc | 525 Node* branch_same = graph()->NewNode(common()->Branch(), check_same, control);
534 Node* branch_zero = graph()->NewNode(common()->Branch(BranchHint::kFalse),
545 Node* branch_negative = graph()->NewNode(common()->Branch(BranchHint::kFalse),
565 Node* branch_ovf = graph()->NewNode(common()->Branch(BranchHint::kFalse),
591 Node* branch = graph()->NewNode(common()->Branch(), value, control); local
593 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
596 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
628 Node* branch = local
629 graph()->NewNode(common()->Branch(BranchHint::kFalse), ovf, control)
654 Node* branch = local
697 Node* branch = local
729 Node* branch = local
767 Node* branch = local
962 Node* branch = local
1012 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), local
1050 Node* branch = local
1084 Node* branch = local
1116 Node* branch = local
1156 Node* branch = graph()->NewNode(common()->Branch(), check, control); local
1187 Node* branch = local
1232 Node* branch = local
1267 Node* branch = local
[all...] |
| /external/clang/lib/Analysis/ |
| UninitializedValues.cpp | 657 UninitUse::Branch Branch;
658 Branch.Terminator = Label;
659 Branch.Output = 0; // Ignored.
660 Use.addUninitBranch(Branch);
662 UninitUse::Branch Branch;
663 Branch.Terminator = Term;
664 Branch.Output = I - Block->succ_begin();
665 Use.addUninitBranch(Branch);
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 201 Iter Branch, DebugLoc DL);
307 // Add all implicit register operands of branch instructions except
507 // Replace Branch with the compact branch instruction.
509 Iter Branch, DebugLoc DL) {
514 (((unsigned) Branch->getOpcode()) == Mips::BEQ) ? Mips::BEQZC_MM
518 MachineInstrBuilder MIB = BuildMI(MBB, Branch, DL, NewDesc);
520 MIB.addReg(Branch->getOperand(0).getReg());
521 MIB.addMBB(Branch->getOperand(2).getMBB());
523 Iter tmpIter = Branch;
[all...] |
| /external/v8/src/compiler/mips64/ |
| code-generator-mips64.cc | 368 __ Branch(USE_DELAY_SLOT, ool->entry(), hs, offset, i.InputOperand(1)); \
374 __ Branch(ool->entry(), ls, i.InputRegister(1), Operand(offset)); \
386 __ Branch(USE_DELAY_SLOT, ool->entry(), hs, offset, i.InputOperand(1)); \
392 __ Branch(ool->entry(), ls, i.InputRegister(1), Operand(offset)); \
404 __ Branch(USE_DELAY_SLOT, &done, hs, offset, i.InputOperand(1)); \
411 __ Branch(&done, ls, i.InputRegister(1), Operand(offset)); \
423 __ Branch(USE_DELAY_SLOT, &done, hs, offset, i.InputOperand(1)); \
430 __ Branch(&done, ls, i.InputRegister(1), Operand(offset)); \
449 __ Branch(USE_DELAY_SLOT, &done, hs, at, \
454 __ Branch(USE_DELAY_SLOT, ool->entry(), eq, at, Operand(zero_reg));
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 190 // Both leaf and branch nodes store vectors of pairs.
205 // 4 4 24 0 Branch<4> (32-bit pointers)
206 // 8 4 16 0 Leaf<4,4>, Branch<4>
207 // 8 8 12 0 Leaf<4,8>, Branch<8>
451 // Determine the branching factor for branch nodes.
456 /// Allocator - The recycling allocator used for both branch and leaf nodes.
479 // A NodeRef doesn't know whether it references a leaf node or a branch node.
514 /// subtree - Access the i'th subtree reference in a branch node.
515 /// This depends on branch nodes storing the NodeRef array as their first
682 // A branch node stores references to 1--N subtrees all of the same height
[all...] |
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-m68hc11/ |
| adj-jump.s | 11 ;; The branch offset must then be adjusted by consecutive relax.
15 bne L1 ; Branch not adjusted
17 beq L1 ; Backward branch, adjust -1
19 jbne L1 ; Backward branch, adjust -2
57 bne L2 ; Backward branch, adjust -1
58 beq L3 ; Forward branch, adjust -2
60 beq L3 ; Forward branch, adjust -1
|
| /external/v8/src/compiler/mips/ |
| code-generator-mips.cc | 355 __ Branch(USE_DELAY_SLOT, ool->entry(), hs, offset, i.InputOperand(1)); \
360 __ Branch(ool->entry(), ls, i.InputRegister(1), Operand(offset)); \
373 __ Branch(USE_DELAY_SLOT, ool->entry(), hs, offset, i.InputOperand(1)); \
378 __ Branch(ool->entry(), ls, i.InputRegister(1), Operand(offset)); \
391 __ Branch(USE_DELAY_SLOT, &done, hs, offset, i.InputOperand(1)); \
397 __ Branch(&done, ls, i.InputRegister(1), Operand(offset)); \
410 __ Branch(USE_DELAY_SLOT, &done, hs, offset, i.InputOperand(1)); \
416 __ Branch(&done, ls, i.InputRegister(1), Operand(offset)); \
436 __ Branch(USE_DELAY_SLOT, &done, hs, at, \
442 __ Branch(USE_DELAY_SLOT, ool->entry(), eq, at, Operand(zero_reg));
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCInstrDesc.h | 105 Branch,
222 /// a basic block. Typically this is things like return and branch
230 /// indirect branch. Predicates below can be used to discriminate between
233 bool isBranch() const { return Flags & (1 << MCID::Branch); }
235 /// \brief Return true if this is an indirect branch, such as a
236 /// branch through a register.
239 /// \brief Return true if this is a branch which may fall
242 /// information about this branch.
247 /// \brief Return true if this is a branch which always
250 /// about this branch
[all...] |
