| /external/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchFinder.h | 26 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
69 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
74 const BoundNodes Nodes; member in struct:clang::ast_matchers::MatchFinder::MatchResult
|
| /external/llvm/include/llvm/ |
| H A D | CallGraphSCCPass.h | 82 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
87 Nodes.assign(I, E);
90 bool isSingular() const { return Nodes.size() == 1; }
91 unsigned size() const { return Nodes.size(); }
98 iterator begin() const { return Nodes.begin(); }
99 iterator end() const { return Nodes.end(); }
|
| /external/llvm/lib/Support/ |
| H A D | IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, argument
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
125 if (!Nodes)
129 const unsigned PerNode = (Elements + Grow) / Nodes;
130 const unsigned Extra = (Elements + Grow) % Nodes;
131 IdxPair PosPair = IdxPair(Nodes, 0);
133 for (unsigned n = 0; n != Nodes; ++n) {
135 if (PosPair.first == Nodes && Sum > Position)
142 assert(PosPair.first < Nodes && "Bad algebra");
149 for (unsigned n = 0; n != Nodes;
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| H A D | Interval.h | 48 Nodes.push_back(Header);
52 : HeaderNode(I.HeaderNode), Nodes(I.Nodes), Successors(I.Successors) {}
56 /// Nodes - The basic blocks in this interval.
58 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
73 for (unsigned i = 0; i < Nodes.size(); ++i)
74 if (Nodes[i] == BB) return true;
77 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes
[all...] |
| /external/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 306 /// @param Nodes Number of nodes.
310 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, argument
313 for (int n = Nodes - 1; n; --n) {
327 if (Nodes == 0)
331 for (unsigned n = 0; n != Nodes - 1; ++n) {
334 for (unsigned m = n + 1; m != Nodes; ++m) {
346 for (unsigned n = 0; n != Nodes; n++)
359 /// Elements + Grow <= Nodes * Capacity.
376 /// @param Nodes The number of nodes.
379 /// @param CurSize Array[Nodes] o
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 269 /// Nodes - The nodes in the graph.
270 llvm::FoldingSet<ExplodedNode> Nodes; member in class:clang::ento::ExplodedGraph
337 node_iterator nodes_begin() { return Nodes.begin(); }
339 node_iterator nodes_end() { return Nodes.end(); }
341 const_node_iterator nodes_begin() const { return Nodes.begin(); }
343 const_node_iterator nodes_end() const { return Nodes.end(); }
|
| /external/clang/lib/ASTMatchers/ |
| H A D | ASTMatchFinder.cpp | 104 BoundNodesTree Nodes; member in struct:clang::ast_matchers::internal::__anon3534::MemoizedMatchResult
332 InsertResult.first->second.Nodes =
335 InsertResult.first->second.Nodes.copyTo(Builder);
585 MatchFinder::MatchResult::MatchResult(const BoundNodes &Nodes, argument
587 : Nodes(Nodes), Context(Context),
|
| /external/clang/unittests/ASTMatchers/ |
| H A D | ASTMatchersTest.cpp | 635 virtual bool run(const BoundNodes *Nodes) { argument
636 if (const Decl *Node = Nodes->getDeclAs<T>(Id)) {
657 virtual bool run(const BoundNodes *Nodes) { argument
658 const T *Node = Nodes->getStmtAs<T>(Id);
|
| /external/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 488 void push_all(const std::vector<SUnit *> &Nodes) { argument
489 for (std::vector<SUnit *>::const_iterator I = Nodes.begin(),
490 E = Nodes.end(); I != E; ++I)
|
| /external/llvm/lib/VMCore/ |
| H A D | AsmWriter.cpp | 2063 SmallVector<const MDNode *, 16> Nodes; local
2064 Nodes.resize(Machine.mdn_size());
2067 Nodes[I->second] = cast<MDNode>(I->first);
2069 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2071 printMDNodeBody(Nodes[i]);
|
| /external/llvm/utils/TableGen/ |
| H A D | CodeGenDAGPatterns.cpp | 1925 SmallVectorImpl<TreePatternNode*> &Nodes = I->second; local
1938 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
1944 if (Nodes[i] == Trees[0] && Nodes[i]->isLeaf()) {
1945 DefInit *DI = dynamic_cast<DefInit*>(Nodes[i]->getLeafValue());
1951 assert(Nodes[i]->getNumTypes() == 1 &&
1954 MadeChange |= Nodes[i]->UpdateNodeType(0, InNodes[0]->getExtType(0),
1962 for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {
1963 TreePatternNode *N1 = Nodes[i], *N2 = Nodes[
2052 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode"); local
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.apache.jasper_5.5.17.v201004212143.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |