| /external/llvm/include/llvm/ |
| CallGraphSCCPass.h | 82 std::vector<CallGraphNode*> Nodes;
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/ |
| IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
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; ++n)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 11 // represents a set of CFG nodes and is a portion of an interval partition.
33 /// Interval Class - An Interval is a set of nodes defined such that every node
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;
60 /// Successors - List of BasicBlocks that are reachable directly from nodes in
62 /// These nodes necessarily must be header nodes for other intervals
[all...] |
| IntervalIterator.h | 14 // 1. A Function* object, composed of BasicBlock nodes.
15 // 2. An IntervalPartition& object, composed of Interval nodes.
69 Int->Nodes.push_back(BB);
80 // Add all of the nodes in I as new nodes in Int.
81 copy(I->Nodes.begin(), I->Nodes.end(), back_inserter(Int->Nodes));
161 // the ProcessNode method to add all of the nodes to the interval.
182 // ProcessNode - This method is called by ProcessInterval to add nodes to th
[all...] |
| /external/llvm/lib/Analysis/ |
| Interval.cpp | 45 for (std::vector<BasicBlock*>::const_iterator I = Nodes.begin(),
46 E = Nodes.end(); I != E; ++I)
|
| IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
32 /// NodeSubset - A subset of the graph's nodes.
101 /// 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])
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 169 // Both leaf and branch nodes store vectors of pairs.
176 // The nodes don't know how many elements they contain - that information is
181 // wasted space when nodes are sized to fit in three cache lines (192 bytes):
304 /// IntervalMapImpl::adjustSiblingSizes - Move elements between sibling nodes.
305 /// @param Node Array of pointers to sibling nodes.
306 /// @param Nodes Number of nodes.
310 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes,
313 for (int n = Nodes - 1; n; --n) {
327 if (Nodes == 0
[all...] |
| Trie.h | 156 std::vector<Node*> Nodes;
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();
|
| /external/clang/include/clang/Sema/ |
| Ownership.h | 10 // This file contains classes for managing ownership of Stmt and Expr nodes.
303 /// ASTMultiPtr - A moveable smart pointer to multiple AST nodes. Only owns
309 PtrTy *Nodes;
314 ASTMultiPtr() : Nodes(0), Count(0) {}
315 explicit ASTMultiPtr(Sema &) : Nodes(0), Count(0) {}
316 ASTMultiPtr(Sema &, PtrTy *nodes, unsigned count)
317 : Nodes(nodes), Count(count) {}
319 ASTMultiPtr(PtrTy *nodes, unsigned count) : Nodes(nodes), Count(count) {
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 257 /// The nodes in the simulation graph which have been
261 /// Nodes - The nodes in the graph.
262 llvm::FoldingSet<ExplodedNode> Nodes;
264 /// BVC - Allocator and context for allocating nodes and their predecessor
268 /// NumNodes - The number of nodes in the graph.
271 /// A list of recently allocated nodes that can potentially be recycled.
274 /// A list of nodes that can be reused.
277 /// A flag that indicates whether nodes should be recycled.
280 /// Counter to determine when to reclaim nodes
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 60 // Reclaimn all nodes that match *all* the following criteria:
125 Nodes.RemoveNode(node);
134 // Only periodically relcaim nodes so that we can build up a set of
135 // nodes that meet the reclamation criteria. Freshly created nodes
245 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos);
263 Nodes.InsertNode(V, InsertPos);
367 // nodes in the new graph (if any) to the freshly created node.
378 // the new nodes from the original graph that should have nodes create
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 279 /// an SDNode and any nodes flagged to it.
379 /// recursively marks successor nodes dirty.
384 /// recursively marks predecessor nodes dirty.
432 /// the interface of a standard priority queue, where nodes are inserted in
465 void push_all(const std::vector<SUnit *> &Nodes) {
466 for (std::vector<SUnit *>::const_iterator I = Nodes.begin(),
467 E = Nodes.end(); I != E; ++I)
479 /// unscheduled nodes, for example.
584 assert(I.Node==Node && "Cannot assign iterators to two different nodes!");
657 /// Visited - a set of nodes visited during a DFS traversal
[all...] |
| /external/llvm/lib/Analysis/IPA/ |
| CallGraphSCCPass.cpp | 175 << " nodes:\n";
510 assert(i != Nodes.size() && "Node not in SCC");
511 if (Nodes[i] != Old) continue;
512 Nodes[i] = New;
|
| /external/webkit/LayoutTests/dom/html/level2/html/ |
| HTMLCollection08.js | 78 Nodes in a HTMLCollection object are numbered in tree order.
|
| HTMLOptionsCollection02.js | 78 An HTMLOptionsCollection is a list of nodes representing HTML option
83 Nodes are numbered in tree order. The index origin is 0.
|
| HTMLOptionsCollection07.js | 78 An HTMLOptionsCollection is a list of nodes representing HTML option
82 The item() method retrieves a node specified by ordinal index. Nodes
|
| /external/webkit/LayoutTests/dom/xhtml/level2/html/ |
| HTMLCollection08.js | 78 Nodes in a HTMLCollection object are numbered in tree order.
|
| HTMLOptionsCollection02.js | 78 An HTMLOptionsCollection is a list of nodes representing HTML option
83 Nodes are numbered in tree order. The index origin is 0.
|
| HTMLOptionsCollection07.js | 78 An HTMLOptionsCollection is a list of nodes representing HTML option
82 The item() method retrieves a node specified by ordinal index. Nodes
|
| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| documentadoptnode24.js | 80 attached attribute nodes if there are any. If the node has a parent it is first removed
82 For Element Nodes, specified attribute nodes of the source element are adopted, Default
|
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.cpp | 353 // handle nodes which have multiple types, where some types are
715 // Count children in the count if they are also nodes.
735 /// corresponds to the number of nodes that are covered.
835 /// constraint to the nodes operands. This returns true if it makes a
[all...] |
| /external/llvm/lib/VMCore/ |
| AsmWriter.cpp | [all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm_ocaml.c | 596 CAMLlocal1(Nodes);
597 Nodes = alloc(LLVMGetNamedMetadataNumOperands(M, String_val(name)), 0);
598 LLVMGetNamedMetadataOperands(M, String_val(name), (LLVMValueRef *) Nodes);
599 CAMLreturn(Nodes);
[all...] |
| /external/oprofile/events/x86-64/family10/ |
| unit_masks | 325 0x08 Node group select: 0=Nodes 0-3, 1=Nodes 4-7
|
