| /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 | 41 std::vector<BlockT *> Roots;
52 return Roots;
56 assert(Roots.size() == 1 && "Should always have entry node!");
57 return Roots[0];
127 this->Roots = DT.getRoots();
128 assert(this->Roots.size() == 1 &&
130 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/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.
83 std::vector<GCRoot> Roots;
93 // The bit vector is the more compact representation where >3.2% of roots
112 Roots.push_back(GCRoot(Num, Metadata));
117 return Roots.erase(position);
138 /// roots_begin/roots_end - Iterators for all roots in the function.
140 roots_iterator roots_begin() { return Roots.begin(); }
141 roots_iterator roots_end() { return Roots.end();
[all...] |
| /external/llvm/lib/Analysis/ |
| VectorUtils.cpp | 451 SmallPtrSet<Value *, 4> Roots;
457 // Determine the roots. We work bottom-up, from truncs or icmps.
477 Roots.insert(&I);
559 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)
206 SmallVector<AllocaInst *, 32> Roots;
236 Roots.push_back(
249 if (Roots.size())
250 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size());
352 // Find the concrete stack offsets for all roots (stack slots
[all...] |
| ShadowStackGCLowering.cpp | 31 /// roots.
39 /// Roots - GC roots in the current function. Each is a pair of the
41 std::vector<std::pair<CallInst *, AllocaInst *>> Roots;
202 for (unsigned I = 0; I != Roots.size(); ++I) {
203 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
213 ConstantInt::get(Int32Ty, Roots.size(), false),
253 for (size_t I = 0; I != Roots.size(); I++)
254 EltTys.push_back(Roots[I].second->getAllocatedType());
273 // int32_t NumRoots; // Number of roots in stack frame
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| Float2Int.cpp | 68 void findRoots(Function &F, SmallPtrSet<Instruction*,8> &Roots);
73 void walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots);
80 SmallPtrSet<Instruction*,8> Roots;
130 // Find the roots - instructions that convert from the FP domain to
132 void Float2Int::findRoots(Function &F, SmallPtrSet<Instruction*,8> &Roots) {
140 Roots.insert(&I);
145 Roots.insert(&I);
179 // the roots. Populate "SeenInsts" with interesting
188 void Float2Int::walkBackwards(const SmallPtrSetImpl<Instruction*> &Roots) {
189 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end())
[all...] |
| LoopRerollPass.cpp | 329 // ST[y1] +1 +2 <-- Roots
347 SmallInstructionVector Roots;
352 // The set of all DAG roots, and state tracking of all roots
363 /// Stage 1: Find all the DAG roots for the induction variable.
365 /// Stage 2: Validate if the found roots are valid.
379 std::map<int64_t,Instruction*> &Roots);
382 void collectInLoopUserSet(const SmallInstructionVector &Roots,
419 // The roots themselves.
610 const SmallInstructionVector &Roots,
[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;
302 /// addRoot - Add an untyped node to the set of roots.
304 Roots.push_back(V);
318 unsigned num_roots() const { return Roots.size(); }
342 roots_iterator roots_begin() { return Roots.begin(); }
344 roots_iterator roots_end() { return Roots.end(); }
346 const_roots_iterator roots_begin() const { return Roots.begin(); }
348 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; }
243 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 | 753 /// 'roots': [
798 std::vector<std::unique_ptr<Entry>> Roots;
821 /// \brief Looks up \p Path in \c Roots.
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 415 NodeVect &Roots) {
420 Roots.push_back(N);
[all...] |
