/external/clang/include/clang/Analysis/Analyses/ |
H A D | UninitializedValues.h | 31 struct Branch { struct in class:clang::UninitUse 45 llvm::SmallVector<Branch, 2> UninitBranches; 51 void addUninitBranch(Branch B) { 74 typedef llvm::SmallVectorImpl<Branch>::const_iterator branch_iterator;
|
/external/v8/src/mips/ |
H A D | ic-mips.cc | 56 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_OBJECT_TYPE)); 57 __ Branch(global_object, eq, type, Operand(JS_BUILTINS_OBJECT_TYPE)); 58 __ Branch(global_object, eq, type, Operand(JS_GLOBAL_PROXY_TYPE)); 83 __ Branch(miss, lt, scratch1, Operand(FIRST_SPEC_OBJECT_TYPE)); 94 __ Branch(miss, ne, scratch1, Operand(zero_reg)); 99 __ Branch(miss, ne, scratch1, Operand(scratch0)); 150 __ Branch(miss, ne, at, Operand(zero_reg)); 204 __ Branch(miss, ne, at, Operand(zero_reg)); 280 __ Branch(slow, ne, at, Operand(zero_reg)); 287 __ Branch(slo [all...] |
H A D | builtins-mips.cc | 187 __ Branch(&entry); 192 __ Branch(&loop, lt, scratch1, Operand(scratch2)); 297 __ Branch(&entry); 303 __ Branch(&loop, lt, elements_array_storage, Operand(elements_array_end)); 329 __ Branch(&argc_one_or_more, ne, a0, Operand(zero_reg)); 348 __ Branch(&argc_two_or_more, ne, a0, Operand(1)); 352 __ Branch(¬_empty_array, ne, a2, Operand(zero_reg)); 355 __ Branch(&empty_array); 359 __ Branch(call_generic_code, eq, a3, Operand(zero_reg)); 364 __ Branch(call_generic_cod [all...] |
H A D | codegen-mips.cc | 117 __ Branch(&only_change_map, eq, at, Operand(t0)); 171 __ Branch(&entry); 183 __ Branch(&done); 188 __ Branch(fail); 217 __ Branch(&entry); 233 __ Branch(&loop, lt, t3, Operand(t2)); 257 __ Branch(&only_change_map, eq, at, Operand(t0)); 290 __ Branch(&entry); 296 __ Branch(fail); 303 __ Branch( [all...] |
H A D | code-stubs-mips.cc | 65 __ Branch(not_a_heap_number, ne, scratch1, Operand(scratch2)); 317 __ Branch(&slow_case, eq, a3, Operand(t1)); 325 __ Branch(&check_fast_elements, ne, v0, Operand(t1)); 333 __ Branch(&double_elements, ne, v0, Operand(t1)); 394 __ Branch(&slow_case, eq, a3, Operand(t0)); 401 __ Branch(&slow_case, ne, a0, Operand(size >> kPointerSizeLog2)); 481 __ Branch(¬_special, gt, source_, Operand(1)); 608 __ Branch(&done); 654 __ Branch(not_number, ne, scratch1, Operand(heap_number_map)); 706 __ Branch( [all...] |
H A D | full-codegen-mips.cc | 87 __ Branch(target, eq, at, Operand(zero_reg)); 98 __ Branch(target, ne, at, Operand(zero_reg)); 166 __ Branch(&ok, eq, t1, Operand(zero_reg)); 298 __ Branch(&ok, hs, sp, Operand(t0)); 357 // to make sure it is constant. Branch may emit a skip-or-jump sequence 358 // instead of the normal Branch. It seems that the "skip" part of that 359 // sequence is about as long as this Branch would be so it is safe to ignore 406 __ Branch(&return_label_); 427 __ Branch(&ok, ge, a3, Operand(zero_reg)); 522 if (false_label_ != fall_through_) __ Branch(false_label [all...] |
H A D | stub-cache-mips.cc | 84 __ Branch(&miss, ne, name, Operand(at)); 89 __ Branch(&miss, ne, at, Operand(scratch2)); 101 __ Branch(&miss, ne, flags_reg, Operand(flags)); 146 __ Branch(miss_label, ne, scratch0, Operand(zero_reg)); 150 __ Branch(miss_label, lt, scratch0, Operand(FIRST_SPEC_OBJECT_TYPE)); 159 __ Branch(miss_label, ne, map, Operand(tmp)); 297 __ Branch(miss, ne, prototype, Operand(at)); 340 __ Branch(miss_label, ne, scratch, Operand(JS_ARRAY_TYPE)); 365 __ Branch(non_string_object, 396 __ Branch(mis [all...] |
H A D | macro-assembler-mips.cc | 64 Branch(2, NegateCondition(cond), src1, src2); 79 Branch(2, NegateCondition(cond), src1, src2); 182 Branch(branch, cc, scratch, 214 Branch(&ok, eq, t8, Operand(zero_reg)); 326 Branch(&done, eq, t8, Operand(zero_reg)); 383 Branch(&same_contexts, eq, scratch, Operand(at)); 412 Branch(miss, ne, scratch, Operand(at)); 518 Branch(&done, eq, key, Operand(at)); 520 Branch(miss, ne, key, Operand(at)); 531 Branch(mis [all...] |
H A D | regexp-macro-assembler-mips.cc | 283 __ Branch(&backtrack_non_equal, ne, current_input_offset(), Operand(a0)); 302 __ Branch(&fallthrough, eq, a1, Operand(zero_reg)); 330 __ Branch(&loop_check, eq, t0, Operand(a3)); 335 __ Branch(&fail, ne, t0, Operand(a3)); 337 __ Branch(&fail, hi, a3, Operand('z' - 'a')); // Is a3 a lowercase letter? 340 __ Branch(&loop, lt, a0, Operand(a1)); 413 __ Branch(&fallthrough, eq, a1, Operand(zero_reg)); 439 __ Branch(&loop, lt, a0, Operand(a1)); 495 __ Branch(&success, eq, current_character(), Operand(' ')); 573 __ Branch( [all...] |
H A D | lithium-codegen-mips.cc | 146 __ Branch(&ok, eq, t1, Operand(zero_reg)); 167 __ Branch(&loop, ne, a0, Operand(zero_reg)); 631 __ Branch(&skip, NegateCondition(cc), src1, src2); 881 __ Branch(USE_DELAY_SLOT, &positive_dividend, ge, left, Operand(zero_reg)); 887 __ Branch(USE_DELAY_SLOT, &done); 901 __ Branch(USE_DELAY_SLOT, &done, ge, left, Operand(zero_reg)); 929 __ Branch(&left_not_zero, ne, left, Operand(zero_reg)); 937 __ Branch(&left_not_min_int, ne, left, Operand(kMinInt)); 1040 __ Branch(&done, ne, result, Operand(zero_reg)); 1252 __ Branch( [all...] |
/external/javassist/src/main/javassist/bytecode/ |
H A D | CodeIterator.java | 303 * Branch offsets and the exception table are also updated. 325 * Branch offsets and the exception table are also updated. 350 * Branch offsets and the exception table are also updated. 376 * Branch offsets and the exception table are also updated. 398 * Branch offsets and the exception table are also updated. 423 * Branch offsets and the exception table are also updated. 470 * Branch offsets and the exception table are also updated. 487 * Branch offsets and the exception table are also updated. 509 * Branch offsets and the exception table are also updated. 526 * Branch offset 1267 static abstract class Branch { class in class:CodeIterator 1269 Branch(int p) { pos = orgPos = p; } method in class:CodeIterator.Branch [all...] |
/external/skia/src/animator/ |
H A D | SkScript2.h | 187 struct Branch { struct in class:SkScriptEngine2 188 Branch() { function in struct:SkScriptEngine2::Branch 191 Branch(Op op, int depth, unsigned offset) : fOffset(offset), fOpStackDepth(depth), fOperator(op), function in struct:SkScriptEngine2::Branch 249 void resolveBranch(Branch& ); 254 SkTDStack<Branch> fBranchStack; // logical operators, slot to store forward branch
|
/external/llvm/include/llvm/MC/ |
H A D | MCInstrDesc.h | 105 Branch, enumerator in enum:llvm::MCID::__anon8474 236 return Flags & (1 << MCID::Branch);
|
/external/oprofile/events/mips/vr5432/ |
H A D | events | 8 event:0x4 counters:0,1 um:zero minimum:500 name:BRANCHES : Branch execution (no jumps or jump registers)
|
/external/oprofile/events/mips/vr5500/ |
H A D | events | 16 event:0xa counters:0,1 um:zero minimum:500 name:BRANCHES_MISPREDICTED : Branch prediction miss
|
/external/clang/lib/Analysis/ |
H A D | UninitializedValues.cpp | 555 UninitUse::Branch Branch; local 556 Branch.Terminator = Label; 557 Branch.Output = 0; // Ignored. 558 Use.addUninitBranch(Branch); 560 UninitUse::Branch Branch; local 561 Branch.Terminator = Term; 562 Branch.Output = I - Block->succ_begin(); 563 Use.addUninitBranch(Branch); [all...] |
/external/webkit/Source/JavaScriptCore/dfg/ |
H A D | DFGByteCodeParser.cpp | 888 addToGraph(Branch, OpInfo(m_currentIndex + relativeOffset), OpInfo(m_currentIndex + OPCODE_LENGTH(op_jtrue)), condition); 895 addToGraph(Branch, OpInfo(m_currentIndex + OPCODE_LENGTH(op_jfalse)), OpInfo(m_currentIndex + relativeOffset), condition); 902 addToGraph(Branch, OpInfo(m_currentIndex + relativeOffset), OpInfo(m_currentIndex + OPCODE_LENGTH(op_loop_if_true)), condition); 909 addToGraph(Branch, OpInfo(m_currentIndex + OPCODE_LENGTH(op_loop_if_false)), OpInfo(m_currentIndex + relativeOffset), condition); 917 addToGraph(Branch, OpInfo(m_currentIndex + relativeOffset), OpInfo(m_currentIndex + OPCODE_LENGTH(op_jeq_null)), condition); 925 addToGraph(Branch, OpInfo(m_currentIndex + OPCODE_LENGTH(op_jneq_null)), OpInfo(m_currentIndex + relativeOffset), condition); 934 addToGraph(Branch, OpInfo(m_currentIndex + OPCODE_LENGTH(op_jnless)), OpInfo(m_currentIndex + relativeOffset), condition); 943 addToGraph(Branch, OpInfo(m_currentIndex + OPCODE_LENGTH(op_jnlesseq)), OpInfo(m_currentIndex + relativeOffset), condition); 952 addToGraph(Branch, OpInfo(m_currentIndex + relativeOffset), OpInfo(m_currentIndex + OPCODE_LENGTH(op_jless)), condition); 961 addToGraph(Branch, OpInf [all...] |
/external/oprofile/events/mips/rm9000/ |
H A D | events | 11 event:0x07 counters:0,1 um:zero minimum:500 name:BRANCH_MISSPREDICTS : Branch mispredictions 21 event:0x12 counters:0,1 um:zero minimum:500 name:BRANCHES_ISSUED : Branch instructions issued
|
/external/v8/test/cctest/ |
H A D | test-assembler-mips.cc | 106 __ Branch(&L, ne, v1, Operand(0)); 164 __ Branch(&error, ne, v0, Operand(0x0f234560)); 169 __ Branch(&error, ne, v0, Operand(0x00001234)); 172 __ Branch(&error, ne, v1, Operand(0x80000003)); 175 __ Branch(&error, ne, v1, Operand(0x7ffffffc)); 182 __ Branch(&error, ne, v0, Operand(0xedcba983)); 186 __ Branch(&error, ne, v0, Operand(0x1)); 189 __ Branch(&error, ne, v0, Operand(0x0)); 196 __ Branch(&error, ne, v0, Operand(0x00007400)); 199 __ Branch( [all...] |
/external/oprofile/events/mips/5K/ |
H A D | events | 33 event:0x8 counters:1 um:zero minimum:500 name:BRANCHES_MISSPREDICTED : Branch mispredicted
|
/external/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 184 // 4 4 24 0 Branch<4> (32-bit pointers) 185 // 8 4 16 0 Leaf<4,4>, Branch<4> 186 // 8 8 12 0 Leaf<4,8>, Branch<8> 915 Branch; 1138 NR = NR.get<Branch>().safeLookup(x); 1184 // splitRoot - Split the current BranchRoot into multiple Branch nodes. 1191 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; 1208 Branch *B = newNode<Branch>(); 1215 rootBranch().stop(n) = Node[n].template get<Branch>() [all...] |
/external/llvm/test/MC/Mips/ |
H A D | mips-jump-instructions.s | 6 # Branch instructions
|
/external/oprofile/events/mips/sb1/ |
H A D | events | 14 event:0x2f counters:1,2,3 um:zero minimum:500 name:BRANCH_MISSPREDICTS :Branch mispredicts 34 # Branch information 35 event:0x2c counters:1,2,3 um:zero minimum:500 name:BRANCH_STAGE4 :Branch survived stage 4
|
/external/emma/core/java12/com/vladium/emma/instr/ |
H A D | InstrVisitor.java | 1007 block.m_branch = (Branch) branches.get (next_branch_location); 1456 public Branch m_branch; // falling through is implied by this being null 1481 * A Branch does not add any maxlocals/maxstack requirements. 1483 static abstract class Branch class in class:InstrVisitor 1485 protected Branch (final int opcode, final int [] targets) method in class:InstrVisitor.Branch 1560 static final class TERMINATE extends Branch // _[x]return, _athrow 1577 static final class RET extends Branch // [wide] ret 1610 static final class JUMP2 extends Branch // _goto, _jsr 1634 static final class JUMP4 extends Branch // _goto_w, _jsr_w 1656 static final class IFJUMP2 extends Branch // _ifxx [all...] |
/external/oprofile/events/i386/nehalem/ |
H A D | unit_masks | 321 0x01 clear Counts the number of times the front end is resteered, mainly when the Branch Prediction Unit cannot provide a correct prediction and this is corrected by the Branch Address Calculator at the front end 322 0x02 bad_target Counts number of Branch Address Calculator clears (BACLEAR) asserted due to conditional branch instructions in which there was a target hit but the direction was wrong 324 0x01 early Counts early (normal) Branch Prediction Unit clears: BPU predicted a taken branch after incorrectly assuming that it was not taken 325 0x02 late Counts late Branch Prediction Unit clears due to Most Recently Used conflicts
|