/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | Edge.java | 66 * The successor block of the basic block from which this edge originates.
68 Label successor;
field in class:Edge
|
H A D | Label.java | 213 * The successor of this label, in the order they are visited. This linked
219 Label successor;
field in class:Label 471 * null it is added to the successor of the RET blocks found in the
488 e.successor = JSR.successors.successor;
501 // calls this method recursively on each successor, except JSR targets
508 e.successor.visitSubroutine(JSR, id, nbSubroutines);
|
H A D | MethodWriter.java | 359 * {@link Label#successor} field, in the order they are visited by
650 // if opcode == ATHROW or xRETURN, ends current block (no successor)
690 // no stack change, but end of current block (no successor)
864 // adds 'label' as a successor of this basic block
936 // is also a successor of this instruction. Calling visitLabel
937 // adds the label of this next instruction as a successor of the
962 // ends current block (with one new successor)
979 previousBlock.successor = label;
984 // ends current block (with one new successor)
995 previousBlock.successor 1484 addSuccessor(final int info, final Label successor) argument [all...] |
/external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
H A D | LabelFlowAnalyzer.java | 23 * within a class. It calculates the properties "multitarget" and "successor" 45 * <code>true</code> if the current instruction is a potential successor of 48 boolean successor = false; field in class:LabelFlowAnalyzer 72 // the block already is successor of some other code, adding a target 87 successor = opcode != Opcodes.GOTO; 96 if (successor) { 125 successor = false; 148 successor = false; 151 successor = true; 159 successor [all...] |
H A D | LabelInfo.java | 32 private boolean successor = false; field in class:LabelInfo 56 if (info.target || info.successor) { 64 * Defines that the given label is the possible successor of the previous 72 info.successor = true; 95 * Checks whether this label is the possible successor of the previous 102 * successor 106 return info == null ? false : info.successor; 142 return info != null && info.successor
|
/external/e2fsprogs/intl/ |
H A D | finddomain.c | 102 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) 104 if (retval->successor[cnt]->decided == 0) 105 _nl_load_domain (retval->successor[cnt], domainbinding); 107 if (retval->successor[cnt]->data != NULL) 156 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) 158 if (retval->successor[cnt]->decided == 0) 159 _nl_load_domain (retval->successor[cnt], domainbinding); 160 if (retval->successor[cnt]->data != NULL)
|
H A D | loadinfo.h | 76 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile 99 furthermore its ->successor[] field contains a list of other lookup
|
H A D | l10nflist.c | 346 retval->successor[entries++] 353 retval->successor[entries++] 359 retval->successor[entries] = NULL;
|
/external/v8/src/compiler/ |
H A D | instruction-scheduler.cc | 67 // as successor of every instruction. 153 for (auto successor : (*candidate)->successors()) { 154 successor->DropUnscheduledPredecessor(); 155 successor->set_start_cycle( 156 std::max(successor->start_cycle(), 159 if (!successor->HasUnscheduledPredecessor()) { 160 ready_list.push_back(successor); 267 for (auto successor : node->successors()) { 268 DCHECK(successor->total_latency() != -1); 269 if (successor [all...] |
H A D | schedule.cc | 43 void BasicBlock::AddSuccessor(BasicBlock* successor) { argument 44 successors_.push_back(successor); 309 for (BasicBlock* const successor : from->successors()) { 310 to->AddSuccessor(successor); 311 for (BasicBlock*& predecessor : successor->predecessors()) { 364 for (BasicBlock const* successor : block->successors()) { 367 os << "B" << successor->rpo_number();
|
H A D | graph-visualizer.cc | 389 for (BasicBlock* successor : current->successors()) { 390 os_ << " \"B" << successor->rpo_number() << "\""; 477 for (BasicBlock* successor : current->successors()) { 478 os_ << " B" << successor->rpo_number();
|
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/flow/ |
H A D | LabelFlowAnalyzerTest.java | 42 assertFalse(analyzer.successor); 258 analyzer.successor = !expected; 261 assertTrue(expected == analyzer.successor); 273 assertTrue(analyzer.successor); 280 assertTrue(analyzer.successor); 287 assertTrue(analyzer.successor); 293 analyzer.successor = false; 295 assertTrue(analyzer.successor); 309 assertTrue(analyzer.successor); 318 assertTrue(analyzer.successor); [all...] |
H A D | LabelInfoTest.java | 112 boolean methodinvocationline, boolean successor, boolean expected) { 120 if (successor) { 111 testNeedsProbe(boolean multitarget, boolean methodinvocationline, boolean successor, boolean expected) argument
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_cfg.h | 56 void add_successor(void *mem_ctx, fs_bblock *successor);
|
H A D | brw_fs_cfg.cpp | 34 * blocks with successor/predecessor edges connecting them. 57 fs_bblock::add_successor(void *mem_ctx, fs_bblock *successor) argument 59 successor->parents.push_tail(this->make_list(mem_ctx)); 60 children.push_tail(successor->make_list(mem_ctx));
|
/external/v8/src/crankshaft/ |
H A D | hydrogen-bch.cc | 137 Element* successor = at(current->end()->SuccessorAt(i)); local 139 if (!successor->is_in_loop()) { 140 if (!successor->is_proper_exit()) { 148 if (successor->is_start()) {
|
H A D | hydrogen-environment-liveness.cc | 49 // When a value is live in successor A but dead in B, we must 52 HBasicBlock* successor = it.Current(); local 53 int successor_id = successor->block_id();
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | TreeMultiset.java | 126 successor(header, header); 255 successor(header, newRoot, header); 557 successor(this, right, succ); 566 successor(pred, left, this); 783 successor(pred, succ); 937 private static <T> void successor(AvlNode<T> a, AvlNode<T> b) { method in class:TreeMultiset 942 private static <T> void successor(AvlNode<T> a, AvlNode<T> b, AvlNode<T> c) { method in class:TreeMultiset 943 successor(a, b); 944 successor(b, c); 979 successor(heade [all...] |
/external/lzma/C/ |
H A D | Ppmd7.c | 356 CPpmd_Void_Ref successor;
local 365 successor = SUCCESSOR(s);
366 if (successor != upBranch)
368 c = CTX(successor);
425 CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState);
local 472 successor = REF(p->Text);
481 if (fSuccessor <= successor)
493 successor = fSuccessor;
499 SetSuccessor(p->FoundState, successor);
563 SetSuccessor(s, successor);
[all...] |
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/ |
H A D | MethodAnalyzer.java | 182 for (AnalyzedInstruction successor: startOfMethod.successors) { 183 instructionsToAnalyze.set(successor.instructionIndex); 225 for (AnalyzedInstruction successor: instructionToAnalyze.successors) { 226 instructionsToAnalyze.set(successor.getInstructionIndex()); 407 for (AnalyzedInstruction successor: instruction.successors) { 408 if (successor.mergeRegister(registerNumber, postRegisterType, analyzedState, override)) { 409 changedInstructions.set(successor.instructionIndex); 476 //and no reachable code will have an unreachable predessor or successor 530 @Nonnull AnalyzedInstruction successor, 533 addPredecessorSuccessor(predecessor, successor, exceptionHandler 529 addPredecessorSuccessor(@onnull AnalyzedInstruction predecessor, @Nonnull AnalyzedInstruction successor, @Nonnull AnalyzedInstruction[][] exceptionHandlers, @Nonnull BitSet instructionsToProcess) argument 536 addPredecessorSuccessor(@onnull AnalyzedInstruction predecessor, @Nonnull AnalyzedInstruction successor, @Nonnull AnalyzedInstruction[][] exceptionHandlers, @Nonnull BitSet instructionsToProcess, boolean allowMoveException) argument [all...] |
H A D | AnalyzedInstruction.java | 128 protected void addSuccessor(AnalyzedInstruction successor) { argument 129 successors.add(successor);
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | TreeMultiset.java | 122 successor(header, header); 251 successor(header, newRoot, header); 553 successor(this, right, succ); 562 successor(pred, left, this); 779 successor(pred, succ); 933 private static <T> void successor(AvlNode<T> a, AvlNode<T> b) { method in class:TreeMultiset 938 private static <T> void successor(AvlNode<T> a, AvlNode<T> b, AvlNode<T> c) { method in class:TreeMultiset 939 successor(a, b); 940 successor(b, c);
|
/external/chromium-trace/catapult/third_party/beautifulsoup4/bs4/ |
H A D | __init__.py | 236 def insert_before(self, successor): 239 def insert_after(self, successor):
|
/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
H A D | SsaRenamer.java | 364 * phis in successor blocks. 625 * Updates the phi insns in successor blocks with operands based 657 SsaBasicBlock successor = ssaMeth.getBlocks().get(i); 658 successor.forEachPhiInsn(visitor);
|
/external/opencv3/modules/imgproc/src/ |
H A D | min_enclosing_triangle.cpp | 267 static unsigned int successor(unsigned int index, unsigned int nrOfPoints); 475 while (greaterOrEqual(height(successor(b, nrOfPoints), polygon, nrOfPoints, c), 836 double anglePointSuccessor = angleOfLineWrtOxAxis(polygon[successor(polygonPointIndex, nrOfPoints)], 848 return intersectsAboveOrBelow(successor(polygonPointIndex, nrOfPoints), 872 * @param succPredIndex Index of the successor or predecessor 922 if (areOnTheSameSideOfLine(intersectionPoint1, polygon[successor(c, nrOfPoints)], 968 if (areOnTheSameSideOfLine(intersectionPoint1, polygon[successor(c, nrOfPoints)], 1124 index = successor(index, nrOfPoints); 1135 static unsigned int successor(unsigned int index, unsigned int nrOfPoints) { function in namespace:minEnclosingTriangle 1152 //! Check if the flush edge angle/opposite angle lie between the predecessor and successor angl [all...] |