HomeSort by relevance Sort by last modified time
    Searched refs:predecessors (Results 1 - 25 of 115) sorted by null

1 2 3 4 5

  /dalvik/dexgen/src/com/android/dexgen/rop/code/
RopMethod.java 34 * {@code null-ok;} array of predecessors for each block, indexed by block
37 private IntList[] predecessors; field in class:RopMethod
40 * {@code null-ok;} the predecessors for the implicit "exit" block, that is
63 this.predecessors = null;
87 * Gets the predecessors associated with the given block. This throws
91 * @return {@code non-null;} the predecessors of that block
98 IntList result = predecessors[label];
108 * Gets the exit predecessors for this instance.
110 * @return {@code non-null;} the exit predecessors
135 * The predecessors have been calculated. It's safe t
153 IntList[] predecessors = new IntList[maxLabel]; local
    [all...]
  /dalvik/dx/src/com/android/dx/rop/code/
RopMethod.java 33 * {@code null-ok;} array of predecessors for each block, indexed by block
36 private IntList[] predecessors; field in class:RopMethod
39 * {@code null-ok;} the predecessors for the implicit "exit" block, that is
62 this.predecessors = null;
86 * Gets the predecessors associated with the given block. This throws
90 * @return {@code non-null;} the predecessors of that block
97 IntList result = predecessors[label];
107 * Gets the exit predecessors for this instance.
109 * @return {@code non-null;} the exit predecessors
134 * The predecessors have been calculated. It's safe t
152 IntList[] predecessors = new IntList[maxLabel]; local
    [all...]
  /external/dexmaker/src/dx/java/com/android/dx/rop/code/
RopMethod.java 34 * {@code null-ok;} array of predecessors for each block, indexed by block
37 private IntList[] predecessors; field in class:RopMethod
40 * {@code null-ok;} the predecessors for the implicit "exit" block, that is
63 this.predecessors = null;
87 * Gets the predecessors associated with the given block. This throws
91 * @return {@code non-null;} the predecessors of that block
98 IntList result = predecessors[label];
108 * Gets the exit predecessors for this instance.
110 * @return {@code non-null;} the exit predecessors
135 * The predecessors have been calculated. It's safe t
153 IntList[] predecessors = new IntList[maxLabel]; local
    [all...]
  /external/bison/src/
ielr.h 43 symbol_number lookahead, state ***predecessors,
AnnotationList.h 81 * - \c follow_kernel_items, \c always_follows, and \c predecessors were
111 state ***predecessors, bitset **item_lookahead_sets,
AnnotationList.c 196 state ***predecessors,
211 predecessors, item_lookahead_sets))
221 state ***predecessors,
231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor)
287 follow_kernel_items, always_follows, predecessors,
320 predecessors,
396 follow_kernel_items, always_follows, predecessors,
412 state ***predecessors, bitset **item_lookahead_sets,
496 always_follows, predecessors, item_lookahead_sets,
558 follow_kernel_items, always_follows, predecessors,
    [all...]
ielr.c 379 symbol_number lookahead, state ***predecessors,
423 check all predecessors' goto follows for the LHS. */
428 for (predecessor = predecessors[s->number];
441 for (predecessor = predecessors[s->number];
455 predecessors, item_lookahead_sets);
469 * - \c follow_kernel_items, \c always_follows, and \c predecessors
484 bitsetv always_follows, state ***predecessors,
511 states[i], follow_kernel_items, always_follows, predecessors,
1133 state ***predecessors; local
    [all...]
  /external/testng/src/test/java/test/
GraphTest.java 110 List<String> predecessors = g.findPredecessors("2"); local
111 Assert.assertTrue(predecessors.size() == 1);
112 Assert.assertTrue(predecessors.get(0).equals("1"));
116 List<String> predecessors = g.findPredecessors("3"); local
118 Assert.assertTrue(predecessors.size() == 4);
119 Assert.assertTrue(predecessors.get(0).equals("1"));
120 Assert.assertTrue(predecessors.get(1).equals("2.1")
121 || predecessors.get(1).equals("2.2")
122 || predecessors.get(1).equals("2"));
123 Assert.assertTrue(predecessors.get(2).equals("2.1"
193 List<String> predecessors = g.findPredecessors(rootNode); local
    [all...]
  /art/compiler/optimizing/
pretty_printer.h 74 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); variable
75 if (!predecessors.empty()) {
77 for (size_t i = 0; i < predecessors.size() -1; i++) {
78 PrintInt(predecessors[i]->GetBlockId());
81 PrintInt(predecessors.back()->GetBlockId());
gvn.cc 412 // Use the reverse post order to ensure the non back-edge predecessors of a block are
422 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); local
423 if (predecessors.size() == 0 || predecessors[0]->IsEntryBlock()) {
470 } else if (predecessors.size() > 1) {
471 for (HBasicBlock* predecessor : predecessors) {
load_store_elimination.cc 641 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); local
642 if (predecessors.size() == 0) {
647 HInstruction* pred0_value = heap_values_for_[predecessors[0]->GetBlockId()][i];
650 for (size_t j = 1; j < predecessors.size(); j++) {
651 HInstruction* pred_value = heap_values_for_[predecessors[j]->GetBlockId()][i];
661 for (size_t j = 0; j < predecessors.size(); j++) {
662 ArenaVector<HInstruction*>& pred_values = heap_values_for_[predecessors[j]->GetBlockId()];
    [all...]
  /external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
AnalyzedInstruction.java 59 protected final TreeSet<AnalyzedInstruction> predecessors = new TreeSet<AnalyzedInstruction>(); field in class:AnalyzedInstruction
77 * This contains optional register type overrides for register types from predecessors
106 return predecessors.size();
110 return Collections.unmodifiableSortedSet(predecessors);
125 return predecessors.add(predecessor);
171 //if this instruction has no predecessors, it is either the fake "StartOfMethod" instruction or it is an
173 if (predecessors.size() == 0) {
177 if (predecessors.first().instructionIndex == -1) {
222 * Iterates over the predecessors of this instruction, and merges all the post-instruction register types for the
227 * @return The register type resulting from merging the post-instruction register types from all predecessors
    [all...]
  /dalvik/dx/src/com/android/dx/ssa/
SsaBasicBlock.java 54 private BitSet predecessors; field in class:SsaBasicBlock
127 this.predecessors = new BitSet(parent.getBlocks().size());
157 result.predecessors = SsaMethod.bitSetFromLabelList(
340 * @return {@code non-null;} predecessors set, indexed by block index
343 return predecessors;
411 * All previous predecessors will be predecessors to the new block.
419 newPred.predecessors = predecessors;
426 predecessors = new BitSet(parent.getBlocks().size())
    [all...]
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
SsaBasicBlock.java 55 private BitSet predecessors; field in class:SsaBasicBlock
128 this.predecessors = new BitSet(parent.getBlocks().size());
158 result.predecessors = SsaMethod.bitSetFromLabelList(
341 * @return {@code non-null;} predecessors set, indexed by block index
344 return predecessors;
412 * All previous predecessors will be predecessors to the new block.
420 newPred.predecessors = predecessors;
427 predecessors = new BitSet(parent.getBlocks().size())
    [all...]
  /external/v8/src/compiler/
frame-elider.cc 45 if (block->predecessors().empty()) {
97 for (auto pred : block->predecessors()) {
move-optimizer.cc 100 for (RpoNumber& pred_id : block->predecessors()) {
212 for (RpoNumber& pred_index : block->predecessors()) {
228 for (RpoNumber& pred_index : block->predecessors()) {
270 // Delete relevant entries in predecessors and move everything to block.
272 for (RpoNumber& pred_index : block->predecessors()) {
schedule.h 61 // Predecessors.
62 BasicBlockVector& predecessors() { return predecessors_; } function in class:v8::internal::compiler::final
63 const BasicBlockVector& predecessors() const { return predecessors_; } function in class:v8::internal::compiler::final
  /external/v8/test/unittests/compiler/
schedule-unittest.cc 133 EXPECT_THAT(block->predecessors(), ElementsAre(start));
160 EXPECT_THAT(sblock->predecessors(), ElementsAre(start));
165 EXPECT_THAT(eblock->predecessors(), ElementsAre(start));
189 EXPECT_THAT(tblock->predecessors(), ElementsAre(start));
194 EXPECT_THAT(fblock->predecessors(), ElementsAre(start));
238 EXPECT_THAT(mblock->predecessors(), ElementsAre(tblock, fblock));
244 EXPECT_THAT(end->predecessors(), ElementsAre(mblock));
  /external/llvm/lib/CodeGen/
MachineDominators.cpp 83 for (MachineBasicBlock *PredBB : Succ->predecessors()) {
118 // If all the other predecessors of "Succ" are dominated by "Succ" itself
  /external/llvm/lib/Target/WebAssembly/
WebAssemblyCFGStackify.cpp 86 for (MachineBasicBlock *Pred : MBB->predecessors()) {
230 // predecessors should be backedges below.
231 for (auto Pred : MBB.predecessors())
234 "Loop header predecessors must be loop predecessors or backedges");
237 // Not a loop header. All predecessors should be sorted above.
238 for (auto Pred : MBB.predecessors())
240 "Non-loop-header predecessors should be topologically sorted");
274 // predecessors so that we minimize the time that the BLOCK is on the stack,
279 for (MachineBasicBlock *Pred : MBB.predecessors())
    [all...]
  /external/testng/src/main/java/org/testng/internal/
MethodHelper.java 205 List<ITestNGMethod> predecessors = Lists.newArrayList(); local
213 predecessors.add(pred);
221 predecessors.add(pred);
226 for (ITestNGMethod predecessor : predecessors) {
  /external/llvm/include/llvm/IR/
CFG.h 102 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
105 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /external/v8/src/crankshaft/
hydrogen-environment-liveness.cc 187 // store computed information for this block and add predecessors
193 for (int i = 0; i < block->predecessors()->length(); ++i) {
194 worklist.Add(block->predecessors()->at(i)->block_id());
hydrogen-flow-engine.h 110 // Must have visited all predecessors before this block.
126 if (max == 1 && succ->predecessors()->length() == 1) {
198 DCHECK(block->predecessors()->length() == pred_counts_[block->block_id()]);
210 ZoneList<int> pred_counts_; // Finished predecessors (by block id).
  /external/llvm/lib/Target/AArch64/
AArch64A53Fix835769.cpp 135 for (MachineBasicBlock *S : MBB->predecessors())

Completed in 909 milliseconds

1 2 3 4 5