Searched refs:successor (Results 1 - 25 of 68) sorted by relevance

123

/external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/
H A DLabelFlowAnalyzer.java23 * 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 DLabelInfo.java32 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 Dfinddomain.c102 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 Dloadinfo.h76 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
99 furthermore its ->successor[] field contains a list of other lookup
H A Dl10nflist.c346 retval->successor[entries++]
353 retval->successor[entries++]
359 retval->successor[entries] = NULL;
/external/v8/src/compiler/
H A Dinstruction-scheduler.cc125 // as successor of every instruction.
223 for (ScheduleGraphNode* successor : candidate->successors()) {
224 successor->DropUnscheduledPredecessor();
225 successor->set_start_cycle(
226 std::max(successor->start_cycle(),
229 if (!successor->HasUnscheduledPredecessor()) {
230 ready_list.AddNode(successor);
350 for (ScheduleGraphNode* successor : node->successors()) {
351 DCHECK(successor->total_latency() != -1);
352 if (successor
[all...]
H A Dschedule.cc43 void BasicBlock::AddSuccessor(BasicBlock* successor) { argument
44 successors_.push_back(successor);
349 // Find a corresponding successor in the previous block, replace it
352 for (auto successor = pred->successors().begin();
353 successor != pred->successors().end(); ++successor) {
354 if (*successor == block) {
355 *successor = split_edge_block;
430 for (BasicBlock* const successor : from->successors()) {
431 to->AddSuccessor(successor);
[all...]
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/flow/
H A DLabelFlowAnalyzerTest.java42 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 DLabelInfoTest.java114 boolean methodinvocationline, boolean successor, boolean expected) {
122 if (successor) {
113 testNeedsProbe(boolean multitarget, boolean methodinvocationline, boolean successor, boolean expected) argument
/external/v8/src/compiler/arm/
H A Dunwinding-info-writer-arm.cc44 for (const RpoNumber& successor : block->successors()) {
45 int successor_index = successor.ToInt();
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_cfg.cpp33 * blocks with successor/predecessor edges connecting them.
62 bblock_t::add_successor(void *mem_ctx, bblock_t *successor) argument
64 successor->parents.push_tail(::link(mem_ctx, this));
65 children.push_tail(::link(mem_ctx, successor));
335 /* Remove block from all of its predecessors' successor lists. */
336 foreach_list_typed_safe (bblock_link, successor, link,
338 if (block == successor->block) {
339 successor->link.remove();
340 ralloc_free(successor);
344 /* Add removed-block's successors to its predecessors' successor list
[all...]
/external/v8/src/compiler/arm64/
H A Dunwinding-info-writer-arm64.cc44 for (const RpoNumber& successor : block->successors()) {
45 int successor_index = successor.ToInt();
/external/v8/src/compiler/x64/
H A Dunwinding-info-writer-x64.cc49 for (const RpoNumber& successor : block->successors()) {
50 int successor_index = successor.ToInt();
/external/r8/src/main/java/com/android/tools/r8/ir/code/
H A DBasicBlock.java145 assert index >= 0 : "removeSuccessor did not find the successor to remove";
189 assert successors.contains(block) : "attempt to replace non-existent successor";
253 // Remove the replaced successor.
257 // If the new block is not a successor we don't have to rewrite indices or instructions
258 // and we can just replace the old successor with the new one.
460 for (BasicBlock successor : successors) {
461 successor.filledPredecessor(builder);
465 public void link(BasicBlock successor) { argument
466 assert !successors.contains(successor);
467 assert !successor
528 unlink(BasicBlock successor, DominatorTree dominator) argument
671 getEdgeType(BasicBlock successor) argument
[all...]
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DPathNumbering.cpp97 // Returns an iterator over successor edges. Includes phony and
103 // Returns the end sentinel for the successor iterator.
108 // Returns the number of successor edges. Includes phony and
124 // Add an edge to the successor list.
129 // Remove an edge from the successor list.
290 // Iterate through each successor edge, adding phony edges
400 for(succ_iterator successor = succ_begin(currentBlock),
401 succEnd = succ_end(currentBlock); successor != succEnd;
402 oldSuccessor = *successor, ++successor ) {
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DTreeMultiset.java126 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 DPpmd7.c356 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 DMethodAnalyzer.java177 for (AnalyzedInstruction successor: startOfMethod.successors) {
178 instructionsToAnalyze.set(successor.instructionIndex);
220 for (AnalyzedInstruction successor: instructionToAnalyze.successors) {
221 instructionsToAnalyze.set(successor.getInstructionIndex());
425 for (AnalyzedInstruction successor: instruction.successors) {
426 if (successor.mergeRegister(registerNumber, postRegisterType, analyzedState, override)) {
427 changedInstructions.set(successor.instructionIndex);
495 //and no reachable code will have an unreachable predessor or successor
549 @Nonnull AnalyzedInstruction successor,
552 addPredecessorSuccessor(predecessor, successor, exceptionHandler
548 addPredecessorSuccessor(@onnull AnalyzedInstruction predecessor, @Nonnull AnalyzedInstruction successor, @Nonnull AnalyzedInstruction[][] exceptionHandlers, @Nonnull BitSet instructionsToProcess) argument
555 addPredecessorSuccessor(@onnull AnalyzedInstruction predecessor, @Nonnull AnalyzedInstruction successor, @Nonnull AnalyzedInstruction[][] exceptionHandlers, @Nonnull BitSet instructionsToProcess, boolean allowMoveException) argument
[all...]
H A DAnalyzedInstruction.java145 protected void addSuccessor(AnalyzedInstruction successor) { argument
146 successors.add(successor);
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DTreeMultiset.java122 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/v8/src/crankshaft/
H A Dhydrogen-environment-liveness.cc49 // 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/mesa3d/src/gallium/drivers/vc4/
H A Dvc4_qir.c631 qir_link_blocks(struct qblock *predecessor, struct qblock *successor) argument
633 _mesa_set_add(successor->predecessors, predecessor);
636 predecessor->successors[1] = successor;
638 predecessor->successors[0] = successor;
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
H A DInlineFunction.cpp94 // Okay, if that failed, look for one in an obvious successor. If
124 BasicBlock *successor = branch->getSuccessor(0);
127 if (!visited.insert(successor)) return 0;
129 // If the successor isn't dominated by exnBlock:
130 if (!successor->getSinglePredecessor()) {
138 nonDominated = successor;
142 exnBlock = successor;
/external/r8/src/main/java/com/android/tools/r8/ir/regalloc/
H A DLinearScanRegisterAllocator.java1631 for (BasicBlock successor : block.getSuccessors()) {
1635 boolean isCatch = block.hasCatchSuccessor(successor);
1644 int toInstruction = successor.entry().getNumber();
1647 Set<Value> liveAtEntry = liveAtEntrySets.get(successor);
1655 } else if (successor.entry().isMoveException()) {
1664 int predIndex = successor.getPredecessors().indexOf(block);
1665 for (Phi phi : successor.getPhis()) {
1669 if (operand.isPhi() && operand != phi && successor.getPhis().contains(operand)) {
1804 for (BasicBlock successor : successors) {
1805 live.addAll(liveAtEntrySets.get(successor));
[all...]
/external/r8/src/main/java/com/android/tools/r8/ir/optimize/
H A DCodeRewriter.java126 // Mark the block as not-throwing if no successor implies otherwise.
185 for (BasicBlock successor : block.getNormalSucessors()) {
186 if (successor.hasColor(CAN_THROW)) {
189 if (successor.hasColor(UNKNOWN_CAN_THROW)) {
1494 BasicBlock successor = block.unlinkSingleSuccessor();
1496 eol.link(successor);
1503 successor = block.unlinkSingleSuccessor();
1517 isNotNullBlock.link(successor);
1518 isNullBlock.link(successor);

Completed in 639 milliseconds

123