| /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.
93 std::vector<GCRoot> Roots;
103 // The bit vector is the more compact representation where >3.2% of roots
122 Roots.push_back(GCRoot(Num, Metadata));
127 return Roots.erase(position);
148 /// roots_begin/roots_end - Iterators for all roots in the function.
150 roots_iterator roots_begin() { return Roots.begin(); }
151 roots_iterator roots_end () { return Roots.end();
[all...] |
| MachineDominators.h | 28 this->Roots.push_back(MBB);
|
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 37 std::vector<BasicBlock*> Roots;
48 inline const std::vector<BasicBlock*> &getRoots() const { return Roots; }
166 assert(Roots.size() == 1 && "Should always have entry node!");
167 return Roots[0];
173 Roots = DT.getRoots();
174 assert(Roots.size() == 1 && "Only one entry block for forward domfronts!");
175 calculate(DT, DT[Roots[0]]);
|
| DominatorInternals.h | 40 InfoRec &VInfo = DT.Info[DT.Roots[i]];
156 bool MultipleRoots = (DT.Roots.size() > 1);
168 for (unsigned i = 0, e = static_cast<unsigned>(DT.Roots.size());
170 N = DFSPass<GraphT>(DT, DT.Roots[i], N);
246 if (DT.Roots.empty()) return;
252 typename GraphT::NodeType* Root = !MultipleRoots ? DT.Roots[0] : 0;
|
| Dominators.h | 39 std::vector<NodeT*> Roots;
42 Roots(), IsPostDominators(isPostDom) {}
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; }
231 this->Roots.clear();
417 assert(this->Roots.size() == 1 && "Should always have entry node!");
418 return this->Roots[0];
643 this->Roots.push_back(BB);
657 this->Roots.push_back(entry);
663 // Initialize the roots list
|
| /external/llvm/lib/CodeGen/ |
| 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;
209 for (unsigned I = 0; I != Roots.size(); ++I) {
210 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
220 ConstantInt::get(Int32Ty, Roots.size(), false),
262 for (size_t I = 0; I != Roots.size(); I++
[all...] |
| TargetRegisterInfo.cpp | 69 MCRegUnitRootIterator Roots(Unit, TRI);
70 assert(Roots.isValid() && "Unit has no roots.");
71 OS << TRI->getName(*Roots);
72 for (++Roots; Roots.isValid(); ++Roots)
73 OS << '~' << TRI->getName(*Roots);
|
| GCStrategy.cpp | 14 // Roots are identified in SelectionDAGISel.
50 AllocaInst **Roots, unsigned Count);
181 bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **Roots,
198 for (AllocaInst **I = Roots, **E = Roots + Count; I != E; ++I)
212 // action. The default for roots is no action.
286 SmallVector<AllocaInst*, 32> Roots;
316 Roots.push_back(cast<AllocaInst>(
329 if (Roots.size())
330 MadeChange |= InsertRootInitializers(F, Roots.begin(), Roots.size())
[all...] |
| LiveIntervalAnalysis.cpp | 241 // The physregs aliasing Unit are the roots and their super-registers.
242 // Create all values as dead defs before extending to uses. Note that roots
244 // idempotent. It is very rare for a register unit to have multiple roots, so
246 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
247 for (MCSuperRegIterator Supers(*Roots, TRI, /*IncludeSelf=*/true);
256 for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenRegisters.h | 416 const CodeGenRegister *Roots[2];
422 RegUnit() : Weight(0), RegClassUnitSetsIdx(0) { Roots[0] = Roots[1] = 0; }
425 assert(!(Roots[1] && !Roots[0]) && "Invalid roots array");
426 return makeArrayRef(Roots, !!Roots[0] + !!Roots[1]);
582 RegUnits.back().Roots[0] = R0
[all...] |
| RegisterInfoEmitter.cpp | 832 // Emit the table of register unit roots. Each regunit has one or two root
836 ArrayRef<const CodeGenRegister*> Roots = RegBank.getRegUnit(i).getRoots();
837 assert(!Roots.empty() && "All regunits must have a root register.");
838 assert(Roots.size() <= 2 && "More than two roots not supported yet.");
839 OS << " { " << getQualifiedName(Roots.front()->TheDef);
840 for (unsigned r = 1; r != Roots.size(); ++r)
841 OS << ", " << getQualifiedName(Roots[r]->TheDef);
[all...] |
| CodeGenRegisters.cpp | [all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 256 /// The roots of the simulation graph. Usually there will be only
259 /// different roots reach the same state at the same program location.
260 NodeVector Roots;
304 /// addRoot - Add an untyped node to the set of roots.
306 Roots.push_back(V);
320 unsigned num_roots() const { return Roots.size(); }
344 roots_iterator roots_begin() { return Roots.begin(); }
346 roots_iterator roots_end() { return Roots.end(); }
348 const_roots_iterator roots_begin() const { return Roots.begin(); }
350 const_roots_iterator roots_end() const { return Roots.end();
[all...] |
| /external/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/eigen/bench/ |
| eig33.cpp | 48 template<typename Matrix, typename Roots>
49 inline void computeRoots(const Matrix& m, Roots& roots)
56 // eigenvalues are the roots to this equation, all guaranteed to be
62 // Construct the parameters used in classifying the roots of the equation
63 // and in solving the equation for the roots in closed form.
75 // Compute the eigenvalues by solving for the roots of the polynomial.
80 roots(0) = c2_over_3 + Scalar(2)*rho*cos_theta;
81 roots(1) = c2_over_3 - rho*(cos_theta + s_sqrt3*sin_theta);
82 roots(2) = c2_over_3 - rho*(cos_theta - s_sqrt3*sin_theta)
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| SLPVectorizer.cpp | 247 /// Construct a vectorizable tree that starts at \p Roots.
248 void buildTree(ArrayRef<Value *> Roots);
271 void buildTree_rec(ArrayRef<Value *> Roots, unsigned Depth);
297 /// roots. This method calculates the cost of extracting the values.
412 void BoUpSLP::buildTree(ArrayRef<Value *> Roots) {
414 if (!getSameType(Roots))
416 buildTree_rec(Roots, 0);
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | [all...] |
| /external/chromium_org/chrome/browser/resources/file_manager/js/ |
| directory_model.js | 19 * @param {function(Array.<Entry>)} callback Called when roots are resolved.
57 // Reads 'archives' and 'removables' roots.
75 * @param {boolean} showSpecialSearchRoots True if special-search roots are
214 * Sets whether DRIVE appears in the roots list and
279 // Special search roots are just showing a search results from DRIVE.
491 * @return {cr.ui.ArrayDataModel} The list of roots.
[all...] |
