| /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;
|
| /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]]);
|
| Dominators.h | 39 std::vector<NodeT*> Roots;
42 Roots(), IsPostDominators(isPostDom) {}
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; }
219 this->Roots.clear();
421 assert(this->Roots.size() == 1 && "Should always have entry node!");
422 return this->Roots[0];
649 this->Roots.push_back(BB);
661 this->Roots.push_back(&F.front());
667 // Initialize the roots list
|
| /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...] |
| /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))
|
| /external/llvm/lib/CodeGen/ |
| GCRootLowering.cpp | 108 // action. The default for roots is no action.
152 static bool InsertRootInitializers(Function &F, AllocaInst **Roots,
170 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I)
205 SmallVector<AllocaInst *, 32> Roots;
235 Roots.push_back(
248 if (Roots.size())
249 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size());
351 // Find the concrete stack offsets for all roots (stack slots
[all...] |
| ShadowStackGCLowering.cpp | 35 /// roots.
43 /// Roots - GC roots in the current function. Each is a pair of the
45 std::vector<std::pair<CallInst *, AllocaInst *>> Roots;
206 for (unsigned I = 0; I != Roots.size(); ++I) {
207 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
217 ConstantInt::get(Int32Ty, Roots.size(), false),
257 for (size_t I = 0; I != Roots.size(); I++)
258 EltTys.push_back(Roots[I].second->getAllocatedType());
277 // int32_t NumRoots; // Number of roots in stack frame
[all...] |
| /external/swiftshader/third_party/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.
92 std::vector<GCRoot> Roots;
102 // The bit vector is the more compact representation where >3.2% of roots
121 Roots.push_back(GCRoot(Num, Metadata));
142 /// roots_begin/roots_end - Iterators for all roots in the function.
144 roots_iterator roots_begin() { return Roots.begin(); }
145 roots_iterator roots_end () { return Roots.end(); }
146 size_t roots_size() const { return Roots.size();
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| GCStrategy.cpp | 13 // MachineCodeAnalysis identifies the GC safe points in the machine code. Roots
49 AllocaInst **Roots, unsigned Count);
174 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots,
191 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I)
205 // action. The default for roots is no action.
279 SmallVector<AllocaInst*, 32> Roots;
309 Roots.push_back(cast<AllocaInst>(
322 if (Roots.size())
323 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size())
[all...] |
| ShadowStackGC.cpp | 13 // to identify roots.
22 // In order to support this particular transformation, all stack roots are
43 /// roots.
51 /// Roots - GC roots in the current function. Each is a pair of the
53 std::vector<std::pair<CallInst*,AllocaInst*> > Roots;
210 for (unsigned I = 0; I != Roots.size(); ++I) {
211 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
221 ConstantInt::get(Int32Ty, Roots.size(), false),
263 for (size_t I = 0; I != Roots.size(); I++
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 254 /// The roots of the simulation graph. Usually there will be only
257 /// different roots reach the same state at the same program location.
258 NodeVector Roots;
310 /// addRoot - Add an untyped node to the set of roots.
312 Roots.push_back(V);
326 unsigned num_roots() const { return Roots.size(); }
352 roots_iterator roots_begin() { return Roots.begin(); }
354 roots_iterator roots_end() { return Roots.end(); }
356 const_roots_iterator roots_begin() const { return Roots.begin(); }
358 const_roots_iterator roots_end() const { return Roots.end();
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 37 std::vector<NodeT *> Roots;
40 : Roots(), IsPostDominators(isPostDom) {}
42 : Roots(std::move(Arg.Roots)),
44 Arg.Roots.clear();
47 Roots = std::move(RHS.Roots);
49 RHS.Roots.clear();
58 const std::vector<NodeT *> &getRoots() const { return Roots; }
244 this->Roots.clear()
[all...] |
| /external/llvm/utils/TableGen/ |
| RegisterInfoEmitter.cpp | [all...] |
| CodeGenRegisters.h | 444 const CodeGenRegister *Roots[2];
451 Roots[0] = Roots[1] = nullptr;
455 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array");
456 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]);
622 RegUnits.back().Roots[0] = R0
[all...] |
| /external/clang/lib/Basic/ |
| VirtualFileSystem.cpp | 794 /// 'roots': [
840 std::vector<std::unique_ptr<Entry>> Roots;
881 /// \brief Looks up \p Path in \c Roots.
942 for (const std::unique_ptr<Entry> &Root : Roots)
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 414 NodeVect &Roots) {
419 Roots.push_back(N);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopRerollPass.cpp | 326 // ST[y1] +1 +2 <-- Roots
344 SmallInstructionVector Roots;
349 // The set of all DAG roots, and state tracking of all roots
362 /// Stage 1: Find all the DAG roots for the induction variable.
364 /// Stage 2: Validate if the found roots are valid.
378 std::map<int64_t,Instruction*> &Roots);
381 void collectInLoopUserSet(const SmallInstructionVector &Roots,
420 // The roots themselves.
734 const SmallInstructionVector &Roots,
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| SLPVectorizer.cpp | 337 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
339 void buildTree(ArrayRef<Value *> Roots,
398 void buildTree_rec(ArrayRef<Value *> Roots, unsigned Depth);
420 /// roots. This method calculates the cost of extracting the values.
[all...] |
