| /packages/apps/DocumentsUI/tests/common/com/android/documentsui/testing/ |
| Roots.java | 20 public final class Roots {
22 private Roots() {}
|
| /external/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| Float2Int.h | 33 void findRoots(Function &F, SmallPtrSet<Instruction *, 8> &Roots);
38 void walkBackwards(const SmallPtrSetImpl<Instruction *> &Roots);
45 SmallPtrSet<Instruction *, 8> Roots;
|
| /external/clang/include/clang/Serialization/ |
| ModuleManager.h | 42 // \brief The roots of the dependency DAG of AST files. This is used
44 SmallVector<ModuleFile *, 2> Roots;
|
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 66 std::vector<change_ty> Roots;
195 // Compute the roots.
199 Roots.push_back(*it);
202 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
247 llvm::errs() << "Roots: [";
248 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
249 ie = Roots.end(); it != ie; ++it) {
250 if (it != Roots.begin()) llvm::errs() << ", ";
303 // The current set of changes we are minimizing, starting at the roots
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| DominanceFrontier.h | 37 std::vector<BasicBlock*> Roots;
48 inline const std::vector<BasicBlock*> &getRoots() const { return Roots; }
165 assert(Roots.size() == 1 && "Should always have entry node!");
166 return Roots[0];
172 Roots = DT.getRoots();
173 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!");
174 calculate(DT, DT[Roots[0]]);
|
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 67 std::vector<change_ty> Roots;
201 // Compute the roots.
205 Roots.push_back(*it);
208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
253 llvm::errs() << "Roots: [";
254 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
255 ie = Roots.end(); it != ie; ++it) {
256 if (it != Roots.begin()) llvm::errs() << ", ";
309 // The current set of changes we are minimizing, starting at the roots
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 42 std::vector<BlockT *> Roots;
53 return Roots;
57 assert(Roots.size() == 1 && "Should always have entry node!");
58 return Roots[0];
128 this->Roots = DT.getRoots();
129 assert(this->Roots.size() == 1 &&
131 calculate(DT, DT[this->Roots[0]]);
|
| /external/llvm/include/llvm/CodeGen/ |
| GCMetadata.h | 19 // - Stack offsets for GC roots, as specified by calls to llvm.gcroot
21 // As a refinement, liveness analysis calculates the set of live roots at each
23 // generator, so all roots are assumed live.
84 std::vector<GCRoot> Roots;
94 // The bit vector is the more compact representation where >3.2% of roots
113 Roots.push_back(GCRoot(Num, Metadata));
118 return Roots.erase(position);
139 /// roots_begin/roots_end - Iterators for all roots in the function.
141 roots_iterator roots_begin() { return Roots.begin(); }
142 roots_iterator roots_end() { return Roots.end();
[all...] |
| /external/llvm/lib/Analysis/ |
| VectorUtils.cpp | 318 SmallPtrSet<Value *, 4> Roots;
324 // Determine the roots. We work bottom-up, from truncs or icmps.
344 Roots.insert(&I);
441 if (Roots.count(*MI))
|
