Searched refs:Nodes (Results 1 - 22 of 22) sorted by relevance

/external/llvm/include/llvm/
H A DCallGraphSCCPass.h82 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 DIntervalMap.cpp120 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 DInterval.h48 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...]
H A DIntervalIterator.h69 Int->Nodes.push_back(BB);
81 copy(I->Nodes.begin(), I->Nodes.end(), back_inserter(Int->Nodes));
/external/llvm/lib/Analysis/
H A DInterval.cpp45 for (std::vector<BasicBlock*>::const_iterator I = Nodes.begin(),
46 E = Nodes.end(); I != E; ++I)
H A DIntervalPartition.cpp48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp101 /// Nodes - The list of nodes for this graph.
102 NodeType Nodes[N];
108 // the Nodes array given a pointer to any element of it.
110 Nodes[i].first = i;
117 Nodes[FromIdx].second.AddNode(ToIdx);
124 Nodes[FromIdx].second.DeleteNode(ToIdx);
132 return const_cast<NodeType *>(&Nodes[Idx]);
150 Reachable = Reachable.Join(Nodes[i].second);
164 /// FirstNode - Pointer to first node in the graph's Nodes array.
/external/clang/include/clang/Sema/
H A DOwnership.h309 PtrTy *Nodes; member in class:clang::ASTMultiPtr
314 ASTMultiPtr() : Nodes(0), Count(0) {}
315 explicit ASTMultiPtr(Sema &) : Nodes(0), Count(0) {}
317 : Nodes(nodes), Count(count) {}
319 ASTMultiPtr(PtrTy *nodes, unsigned count) : Nodes(nodes), Count(count) {}
322 PtrTy *get() const { return Nodes; }
328 return Nodes;
/external/llvm/include/llvm/ADT/
H A DTrie.h156 std::vector<Node*> Nodes; member in class:llvm::Trie
161 Nodes.push_back(N);
192 for (unsigned i = 0, e = Nodes.size(); i != e; ++i)
193 delete Nodes[i];
196 inline Node* getRoot() const { return Nodes[0]; }
293 return G.Nodes.begin();
296 return G.Nodes.end();
H A DIntervalMap.h306 /// @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 DExplodedGraph.h261 /// Nodes - The nodes in the graph.
262 llvm::FoldingSet<ExplodedNode> Nodes; member in class:clang::ento::ExplodedGraph
329 node_iterator nodes_begin() { return Nodes.begin(); }
331 node_iterator nodes_end() { return Nodes.end(); }
333 const_node_iterator nodes_begin() const { return Nodes.begin(); }
335 const_node_iterator nodes_end() const { return Nodes.end(); }
/external/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp125 Nodes.RemoveNode(node);
245 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos);
263 Nodes.InsertNode(V, InsertPos);
/external/llvm/lib/Analysis/IPA/
H A DCallGraphSCCPass.cpp510 assert(i != Nodes.size() && "Node not in SCC");
511 if (Nodes[i] != Old) continue;
512 Nodes[i] = New;
/external/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h465 void push_all(const std::vector<SUnit *> &Nodes) { argument
466 for (std::vector<SUnit *>::const_iterator I = Nodes.begin(),
467 E = Nodes.end(); I != E; ++I)
/external/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.cpp1932 SmallVectorImpl<TreePatternNode*> &Nodes = I->second; local
1945 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
1951 if (Nodes[i] == Trees[0] && Nodes[i]->isLeaf()) {
1952 DefInit *DI = dynamic_cast<DefInit*>(Nodes[i]->getLeafValue());
1958 assert(Nodes[i]->getNumTypes() == 1 &&
1961 MadeChange |= Nodes[i]->UpdateNodeType(0, InNodes[0]->getExtType(0),
1969 for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {
1970 TreePatternNode *N1 = Nodes[i], *N2 = Nodes[
2056 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode"); local
[all...]
/external/llvm/lib/VMCore/
H A DAsmWriter.cpp2024 SmallVector<const MDNode *, 16> Nodes; local
2025 Nodes.resize(Machine.mdn_size());
2028 Nodes[I->second] = cast<MDNode>(I->first);
2030 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2032 printMDNodeBody(Nodes[i]);
/external/llvm/bindings/ocaml/llvm/
H A Dllvm_ocaml.c596 CAMLlocal1(Nodes);
597 Nodes = alloc(LLVMGetNamedMetadataNumOperands(M, String_val(name)), 0);
598 LLVMGetNamedMetadataOperands(M, String_val(name), (LLVMValueRef *) Nodes);
599 CAMLreturn(Nodes);
/external/oprofile/events/x86-64/family10/
H A Dunit_masks325 0x08 Node group select: 0=Nodes 0-3, 1=Nodes 4-7
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
H A DAntlr.Runtime.Tree.Tests.pas60 const Nodes: ITreeNodeStream): String;
618 const Nodes: ITreeNodeStream): String;
626 for I := 0 to Nodes.Size - 1 do
628 T := Nodes.LT(I + 1);
629 TokenType := Nodes.TreeAdaptor.GetNodeType(T);
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.pas2876 Nodes: ITreeNodeStream;
2885 Nodes := Input as ITreeNodeStream;
2886 FNode := Nodes.LT(1);
2887 Adaptor := Nodes.TreeAdaptor;
2897 PriorNode := Nodes.LT(I);
2910 PriorNode := Nodes.LT(I)
2937 Nodes: ITreeNodeStream;
2943 if Supports(FInput, ITreeNodeStream, Nodes) then
2945 Adaptor := Nodes.TreeAdaptor;
H A DAntlr.Runtime.Tree.pas688 /// A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.apache.jasper_5.5.17.v201004212143.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 317 milliseconds