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

/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h85 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
90 Nodes.assign(I, E);
93 bool isSingular() const { return Nodes.size() == 1; }
94 unsigned size() const { return Nodes.size(); }
101 iterator begin() const { return Nodes.begin(); }
102 iterator end() const { return Nodes.end(); }
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));
/freebsd-10.0-release/contrib/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...]
/freebsd-10.0-release/contrib/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();
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Tooling/
H A DRefactoringCallbacks.cpp42 if (const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId)) {
55 const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId);
56 const Stmt *ToMatch = Result.Nodes.getStmtAs<Stmt>(ToId);
68 if (const IfStmt *Node = Result.Nodes.getStmtAs<IfStmt>(Id)) {
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h26 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
73 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
78 const BoundNodes Nodes; member in struct:clang::ast_matchers::MatchFinder::MatchResult
213 Nodes.push_back(Result.Nodes);
215 SmallVector<BoundNodes, 1> Nodes; member in class:clang::ast_matchers::internal::CollectMatchesCallback
227 return Callback.Nodes;
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h266 /// Nodes - The nodes in the graph.
267 llvm::FoldingSet<ExplodedNode> Nodes; member in class:clang::ento::ExplodedGraph
336 node_iterator nodes_begin() { return Nodes.begin(); }
338 node_iterator nodes_end() { return Nodes.end(); }
340 const_node_iterator nodes_begin() const { return Nodes.begin(); }
342 const_node_iterator nodes_end() const { return Nodes.end(); }
368 /// \param Nodes The nodes which must appear in the final graph. Presumably
375 ExplodedGraph *trim(ArrayRef<const NodeTy *> Nodes,
H A DExprEngine.h113 /// Execute the work list with an initial state. Nodes that reaches the exit
154 void ViewGraph(ArrayRef<const ExplodedNode*> Nodes);
/freebsd-10.0-release/contrib/llvm/lib/IR/
H A DAttributeImpl.h265 ArrayRef<std::pair<unsigned, AttributeSetNode*> > Nodes) {
266 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
267 ID.AddInteger(Nodes[i].first);
268 ID.AddPointer(Nodes[i].second);
264 Profile(FoldingSetNodeID &ID, ArrayRef<std::pair<unsigned, AttributeSetNode*> > Nodes) argument
H A DAsmWriter.cpp2133 SmallVector<const MDNode *, 16> Nodes; local
2134 Nodes.resize(Machine.mdn_size());
2137 Nodes[I->second] = cast<MDNode>(I->first);
2139 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2141 printMDNodeBody(Nodes[i]);
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/
H A DIntervalMap.h326 /// @param Nodes Number of nodes.
330 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, argument
333 for (int n = Nodes - 1; n; --n) {
347 if (Nodes == 0)
351 for (unsigned n = 0; n != Nodes - 1; ++n) {
354 for (unsigned m = n + 1; m != Nodes; ++m) {
366 for (unsigned n = 0; n != Nodes; n++)
379 /// Elements + Grow <= Nodes * Capacity.
396 /// @param Nodes The number of nodes.
399 /// @param CurSize Array[Nodes] o
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp49 BoundNodesTree Nodes; member in struct:clang::ast_matchers::internal::__anon3001::MemoizedMatchResult
349 InsertResult.first->second.Nodes =
352 InsertResult.first->second.Nodes.copyTo(Builder);
497 I->second.Nodes = AncestorBoundNodesBuilder.build();
500 I->second.Nodes.copyTo(Builder);
692 MatchFinder::MatchResult::MatchResult(const BoundNodes &Nodes, argument
694 : Nodes(Nodes), Context(Context),
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp170 Nodes.RemoveNode(node);
305 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos);
323 Nodes.InsertNode(V, InsertPos);
339 if (Nodes.empty())
H A DBugReporter.cpp2322 ArrayRef<const ExplodedNode *> Nodes);
2329 ArrayRef<const ExplodedNode *> Nodes) {
2333 G.reset(OriginalGraph->trim(Nodes, &ForwardMap, &InverseMap));
2340 for (unsigned i = 0, count = Nodes.size(); i < count; ++i) {
2341 if (const ExplodedNode *NewNode = ForwardMap.lookup(Nodes[i])) {
2736 // to 'Nodes'. Any of the reports will serve as a "representative" report.
2328 TrimmedGraph(const ExplodedGraph *OriginalGraph, ArrayRef<const ExplodedNode *> Nodes) argument
H A DExprEngine.cpp2438 void ExprEngine::ViewGraph(ArrayRef<const ExplodedNode*> Nodes) { argument
2443 OwningPtr<ExplodedGraph> TrimmedG(G.trim(Nodes));
/freebsd-10.0-release/contrib/llvm/lib/Analysis/IPA/
H A DCallGraphSCCPass.cpp515 assert(i != Nodes.size() && "Node not in SCC");
516 if (Nodes[i] != Old) continue;
517 Nodes[i] = New;
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h528 void push_all(const std::vector<SUnit *> &Nodes) { argument
529 for (std::vector<SUnit *>::const_iterator I = Nodes.begin(),
530 E = Nodes.end(); I != E; ++I)
/freebsd-10.0-release/sys/contrib/dev/acpica/components/debugger/
H A Ddbnames.c673 Info->Nodes++;
750 Info.Nodes, Info.Objects);
/freebsd-10.0-release/contrib/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.cpp2043 SmallVectorImpl<TreePatternNode*> &Nodes = I->second; local
2056 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2062 if (Nodes[i] == Trees[0] && Nodes[i]->isLeaf()) {
2063 DefInit *DI = dyn_cast<DefInit>(Nodes[i]->getLeafValue());
2069 assert(Nodes[i]->getNumTypes() == 1 &&
2072 MadeChange |= Nodes[i]->UpdateNodeType(0, InNodes[0]->getExtType(0),
2080 for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {
2081 TreePatternNode *N1 = Nodes[i], *N2 = Nodes[
2170 std::vector<Record*> Nodes = Records.getAllDerivedDefinitions("SDNode"); local
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DAMDGPUStructurizeCFG.cpp287 std::vector<RegionNode *> &Nodes = *I; local
288 Order.append(Nodes.begin(), Nodes.end());
/freebsd-10.0-release/sys/contrib/dev/acpica/include/
H A Daclocal.h1283 UINT32 Nodes; member in struct:acpi_integrity_info
/freebsd-10.0-release/contrib/dtc/Documentation/
H A Ddtc-paper.tex444 Nodes of the tree are introduced with the node name, followed by a

Completed in 189 milliseconds