Searched refs:successor (Results 1 - 25 of 65) 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...]
H A Dgraph-visualizer.cc428 for (BasicBlock* successor : current->successors()) {
429 os_ << " \"B" << successor->rpo_number() << "\"";
516 for (BasicBlock* successor : current->successors()) {
517 os_ << " B" << successor->rpo_number();
H A Dinstruction.cc656 for (BasicBlock* successor : block->successors()) {
657 instr_block->successors().push_back(GetRpo(successor));
736 // has an edge to a block (== a successor) with more than one predecessors.
740 const InstructionBlock* successor = InstructionBlockAt(successor_id); local
742 CHECK(successor->PredecessorCount() == 1 &&
743 successor->predecessors()[0] == block->rpo_number());
750 // A deferred block with more than one successor must have all its successors
H A Dregister-allocator.cc1040 // First is in order before its successor (or second), so advance first.
1671 const InstructionBlock* successor = code()->InstructionBlockAt(succ); local
1672 DCHECK(successor->PredecessorCount() == 1);
1673 int gap_index = successor->first_instruction_index();
1683 const InstructionBlock* successor = code()->InstructionBlockAt(succ); local
1684 DCHECK(successor->PredecessorCount() == 1);
1685 int gap_index = successor->first_instruction_index();
1847 // successor edges.
1853 // Process all successor blocks.
1855 // Add values live on entry to the successor
1862 const InstructionBlock* successor = code->InstructionBlockAt(succ); local
3749 const LiveRange* successor = current->next(); local
[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.java112 boolean methodinvocationline, boolean successor, boolean expected) {
120 if (successor) {
111 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/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/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_fs_cfg.h56 void add_successor(void *mem_ctx, fs_bblock *successor);
H A Dbrw_fs_cfg.cpp34 * 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/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.java186 for (AnalyzedInstruction successor: startOfMethod.successors) {
187 instructionsToAnalyze.set(successor.instructionIndex);
229 for (AnalyzedInstruction successor: instructionToAnalyze.successors) {
230 instructionsToAnalyze.set(successor.getInstructionIndex());
411 for (AnalyzedInstruction successor: instruction.successors) {
412 if (successor.mergeRegister(registerNumber, postRegisterType, analyzedState, override)) {
413 changedInstructions.set(successor.instructionIndex);
481 //and no reachable code will have an unreachable predessor or successor
535 @Nonnull AnalyzedInstruction successor,
538 addPredecessorSuccessor(predecessor, successor, exceptionHandler
534 addPredecessorSuccessor(@onnull AnalyzedInstruction predecessor, @Nonnull AnalyzedInstruction successor, @Nonnull AnalyzedInstruction[][] exceptionHandlers, @Nonnull BitSet instructionsToProcess) argument
541 addPredecessorSuccessor(@onnull AnalyzedInstruction predecessor, @Nonnull AnalyzedInstruction successor, @Nonnull AnalyzedInstruction[][] exceptionHandlers, @Nonnull BitSet instructionsToProcess, boolean allowMoveException) argument
[all...]
H A DAnalyzedInstruction.java139 protected void addSuccessor(AnalyzedInstruction successor) { argument
140 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/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;

Completed in 6509 milliseconds

123