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

1 2 3 4 5 6 7 8

  /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 76 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); variable
77 if (!predecessors.empty()) {
79 for (size_t i = 0; i < predecessors.size() -1; i++) {
80 PrintInt(predecessors[i]->GetBlockId());
83 PrintInt(predecessors.back()->GetBlockId());
ssa_liveness_analysis.cc 421 const ArenaVector<HBasicBlock*>& predecessors = defined_by_->GetBlock()->GetPredecessors(); local
424 size_t end = predecessors[i]->GetLifetimeEnd();
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/val/
basic_block.h 51 /// Returns the predecessors of the BasicBlock
52 const std::vector<BasicBlock*>* predecessors() const { function in class:libspirv::BasicBlock
56 /// Returns the predecessors of the BasicBlock
57 std::vector<BasicBlock*>* predecessors() { return &predecessors_; } function in class:libspirv::BasicBlock
200 /// The set of predecessors of the BasicBlock
  /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...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/
cfa.h 92 /// predecessors), and it is therefore at the end of the postorder vector.
105 /// without predecessors (such as the root node) is its own immediate dominator.
112 // predecessors, favour using the one that appears earlier on the input blocks
194 const vector<BB*>& predecessors = *predecessor_func(*b); local
197 auto res = find_if(begin(predecessors), end(predecessors),
202 if (res == end(predecessors)) continue;
206 // all other predecessors
207 for (const auto* p : predecessors) {
265 // First collect nodes without predecessors
    [all...]
  /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/llvm/lib/Target/WebAssembly/
WebAssemblyFixIrreducibleControlFlow.cpp 94 for (MachineBasicBlock *Pred : Block->predecessors())
101 const SmallVectorImpl<MachineBasicBlock *> &predecessors() const { function in class:__anon27886::MetaBlock
212 for (auto Pred : MBB->predecessors())
  /external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
AnalyzedInstruction.java 71 protected final TreeSet<AnalyzedInstruction> predecessors = new TreeSet<AnalyzedInstruction>(); field in class:AnalyzedInstruction
92 * This contains optional register type overrides for register types from predecessors
123 return predecessors.size();
127 return Collections.unmodifiableSortedSet(predecessors);
142 return predecessors.add(predecessor);
187 //if this instruction has no predecessors, it is either the fake "StartOfMethod" instruction or it is an
189 if (predecessors.size() == 0) {
192 return predecessors.first().instructionIndex == -1;
234 * Iterates over the predecessors of this instruction, and merges all the post-instruction register types for the
239 * @return The register type resulting from merging the post-instruction register types from all predecessors
    [all...]
  /external/tensorflow/tensorflow/compiler/xla/service/
hlo_computation_test.cc 445 auto predecessors = cloned_add->control_predecessors(); local
446 EXPECT_EQ(1, predecessors.size());
447 EXPECT_EQ(HloOpcode::kNegate, predecessors[0]->opcode());
448 auto successors = predecessors[0]->control_successors();
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/
CFG.h 110 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
113 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm

Completed in 1127 milliseconds

1 2 3 4 5 6 7 8