Home
last modified time | relevance | path

Searched refs:Nodes (Results 1 – 25 of 181) sorted by relevance

12345678

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DDirectedGraph.h182 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); } in DirectedGraph()
183 DirectedGraph(const DGraphType &G) : Nodes(G.Nodes) {} in DirectedGraph()
184 DirectedGraph(DGraphType &&RHS) : Nodes(std::move(RHS.Nodes)) {} in DirectedGraph()
186 Nodes = G.Nodes;
190 Nodes = std::move(G.Nodes);
194 const_iterator begin() const { return Nodes.begin(); } in begin()
195 const_iterator end() const { return Nodes.end(); } in end()
196 iterator begin() { return Nodes.begin(); } in begin()
197 iterator end() { return Nodes.end(); } in end()
198 const NodeType &front() const { return *Nodes.front(); } in front()
[all …]
H A DIntervalMap.h342 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes() argument
345 for (int n = Nodes - 1; n; --n) { in adjustSiblingSizes()
359 if (Nodes == 0) in adjustSiblingSizes()
363 for (unsigned n = 0; n != Nodes - 1; ++n) { in adjustSiblingSizes()
366 for (unsigned m = n + 1; m != Nodes; ++m) { in adjustSiblingSizes()
378 for (unsigned n = 0; n != Nodes; n++) in adjustSiblingSizes()
416 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
1172 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1175 unsigned size[Nodes]; in branchRoot()
1179 if (Nodes == 1) in branchRoot()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/
H A DIntervalMap.cpp120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, in distribute() argument
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); in distribute()
125 if (!Nodes) in distribute()
129 const unsigned PerNode = (Elements + Grow) / Nodes; in distribute()
130 const unsigned Extra = (Elements + Grow) % Nodes; in distribute()
131 IdxPair PosPair = IdxPair(Nodes, 0); in distribute()
133 for (unsigned n = 0; n != Nodes; ++n) { in distribute()
135 if (PosPair.first == Nodes && Sum > Position) in distribute()
142 assert(PosPair.first < Nodes && "Bad algebra"); in distribute()
149 for (unsigned n = 0; n != Nodes; ++n) { in distribute()
/netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
H A DNumberObjectConversionChecker.cpp66 (Result.Nodes.getNodeAs<Stmt>("pedantic") != nullptr); in run()
73 Result.Nodes.getNodeAs<Expr>("check_if_null")) { in run()
102 const Stmt *Conv = Result.Nodes.getNodeAs<Stmt>("conv"); in run()
105 const Expr *ConvertedCObject = Result.Nodes.getNodeAs<Expr>("c_object"); in run()
106 const Expr *ConvertedCppObject = Result.Nodes.getNodeAs<Expr>("cpp_object"); in run()
107 const Expr *ConvertedObjCObject = Result.Nodes.getNodeAs<Expr>("objc_object"); in run()
116 (Result.Nodes.getNodeAs<Stmt>("comparison") != nullptr); in run()
119 (Result.Nodes.getNodeAs<Decl>("osnumber") != nullptr); in run()
122 (Result.Nodes.getNodeAs<QualType>("int_type") != nullptr); in run()
124 (Result.Nodes.getNodeAs<QualType>("objc_bool_type") != nullptr); in run()
[all …]
H A DOSObjectCStyleCast.cpp40 return Builder->removeBindings([this, &Node](const BoundNodesMap &Nodes) { in AST_MATCHER_P() argument
41 const auto &BN = Nodes.getNode(this->BindingID); in AST_MATCHER_P()
51 static void emitDiagnostics(const BoundNodes &Nodes, in emitDiagnostics() argument
55 const auto *CE = Nodes.getNodeAs<CastExpr>(WarnAtNode); in emitDiagnostics()
56 const CXXRecordDecl *RD = Nodes.getNodeAs<CXXRecordDecl>(WarnRecordDecl); in emitDiagnostics()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h312 SetVector<SUnit *> Nodes; variable
325 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet()
327 for (unsigned i = 0, e = Nodes.size(); i < e; ++i) { in NodeSet()
329 for (const SDep &Succ : Nodes[i]->Succs) { in NodeSet()
331 if (!Nodes.count(SuccSUnit)) in NodeSet()
345 bool insert(SUnit *SU) { return Nodes.insert(SU); } in insert()
347 void insert(iterator S, iterator E) { Nodes.insert(S, E); } in insert()
350 return Nodes.remove_if(P); in remove_if()
353 unsigned count(SUnit *SU) const { return Nodes.count(SU); } in count()
357 unsigned size() const { return Nodes.size(); } in size()
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/AST/
H A DASTImporter.h180 Nodes.push_back(D); in push()
185 if (Nodes.empty()) in pop()
187 --Aux[Nodes.back()]; in pop()
188 Nodes.pop_back(); in pop()
193 auto Pos = Aux.find(Nodes.back()); in hasCycleAtBack()
199 assert(Nodes.size() >= 2); in getCycleAtBack()
200 return Cycle(Nodes.rbegin(), in getCycleAtBack()
201 std::find(Nodes.rbegin() + 1, Nodes.rend(), Nodes.back()) + in getCycleAtBack()
213 VecTy Nodes;
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h90 std::vector<CallGraphNode *> Nodes; variable
96 Nodes.assign(NewNodes.begin(), NewNodes.end()); in initialize()
99 bool isSingular() const { return Nodes.size() == 1; } in isSingular()
100 unsigned size() const { return Nodes.size(); } in size()
112 iterator begin() const { return Nodes.begin(); } in begin()
113 iterator end() const { return Nodes.end(); } in end()
H A DBlockFrequencyInfoImpl.h226 NodeList Nodes; ///< Header and the members of the loop. member
232 : Parent(Parent), Nodes(1, Header), BackedgeMass(1) {} in LoopData()
237 : Parent(Parent), Nodes(FirstHeader, LastHeader) { in LoopData()
238 NumHeaders = Nodes.size(); in LoopData()
239 Nodes.insert(Nodes.end(), FirstOther, LastOther); in LoopData()
245 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders, in isHeader()
247 return Node == Nodes[0]; in isHeader()
250 BlockNode getHeader() const { return Nodes[0]; } in getHeader()
256 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - in getHeaderIndex()
257 Nodes.begin(); in getHeaderIndex()
[all …]
H A DInterval.h48 Nodes.push_back(Header); in Interval()
54 std::vector<BasicBlock*> Nodes; variable
67 for (BasicBlock *Node : Nodes) in contains()
H A DLazyCallGraph.h426 SmallVector<Node *, 1> Nodes; variable
429 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() argument
430 : OuterRefSCC(&OuterRefSCC), Nodes(std::forward<NodeRangeT>(Nodes)) {} in SCC()
434 Nodes.clear(); in clear()
452 OS << "..., " << *C.Nodes.back();
478 iterator begin() const { return Nodes.begin(); } in begin()
479 iterator end() const { return Nodes.end(); } in end()
481 int size() const { return Nodes.size(); } in size()
1214 void buildSCCs(RefSCC &RC, node_stack_range Nodes);
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h75 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
80 const BoundNodes Nodes; member
287 Nodes.push_back(Result.Nodes); in run()
294 SmallVector<BoundNodes, 1> Nodes; variable
305 return std::move(Callback.Nodes); in match()
321 return std::move(Callback.Nodes); in match()
331 return std::move(Callback.Nodes); in matchDynamic()
347 return std::move(Callback.Nodes); in matchDynamic()
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/xray/
H A Dxray_function_call_trie.h323 NodeArray Nodes;
331 : Nodes(*A.NodeAllocator), in FunctionCallTrie()
342 : Nodes(std::move(O.Nodes)), in FunctionCallTrie()
349 Nodes = std::move(O.Nodes);
373 auto *NewRoot = Nodes.AppendEmplace( in enterFunction()
378 Nodes.trim(1); in enterFunction()
382 Nodes.trim(1); in enterFunction()
407 auto* NewNode = Nodes.AppendEmplace( in enterFunction()
498 auto NewRoot = O.Nodes.AppendEmplace( in deepCopyInto()
519 auto NewNode = O.Nodes.AppendEmplace( in deepCopyInto()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp172 for (DGNode &N : Nodes) { in pruneEdges()
183 Nodes[Edge.ToIID].NumPredecessors--; in pruneEdges()
196 for (unsigned I = 0, E = Nodes.size(); I < E; ++I) { in initializeRootSet()
197 const DGNode &N = Nodes[I]; in initializeRootSet()
239 const DGNode &N = Nodes[IID]; in propagateThroughEdges()
242 DGNode &To = Nodes[ToIID]; in propagateThroughEdges()
275 Nodes.begin(), Nodes.end(), in getCriticalSequence()
277 unsigned IID = std::distance(Nodes.begin(), It); in getCriticalSequence()
278 Seq.resize(Nodes[IID].Depth); in getCriticalSequence()
280 const DGNode &N = Nodes[IID]; in getCriticalSequence()
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/Transformer/
H A DRewriteRule.cpp181 ast_matchers::BoundNodes Nodes; member in __anone2291d6c0611::BindingsMatcher
185 explicit BindingsMatcher(ast_matchers::BoundNodes Nodes, in BindingsMatcher() argument
187 : Nodes(std::move(Nodes)), InnerMatcher(std::move(InnerMatcher)) {} in BindingsMatcher()
193 for (const auto &N : Nodes.getMap()) in matches()
228 forEachDescendantDynamically(ast_matchers::BoundNodes Nodes, in forEachDescendantDynamically() argument
231 std::move(Nodes), in forEachDescendantDynamically()
241 void registerMatchers(const ast_matchers::BoundNodes &Nodes, in registerMatchers() argument
244 MF->addMatcher(forEachDescendantDynamically<T>(Nodes, Matcher), this); in registerMatchers()
273 Callback.registerMatchers<T>(Result.Nodes, &Finder); in rewriteDescendantsImpl()
319 Result.Nodes.getMap(); in rewriteDescendants()
[all …]
H A DRangeSelector.cpp54 static Expected<DynTypedNode> getNode(const ast_matchers::BoundNodes &Nodes, in getNode() argument
56 auto &NodesMap = Nodes.getMap(); in getNode()
143 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in node()
156 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in statement()
190 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in member()
202 Expected<DynTypedNode> N = getNode(Result.Nodes, ID); in name()
260 Expected<DynTypedNode> N = getNode(Result.Nodes, ID); in operator ()()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h168 NodeVector Nodes; variable
181 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
182 return Nodes[NId]; in getNode()
185 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
186 return Nodes[NId]; in getNode()
197 Nodes[NId] = std::move(N); in addConstructedNode()
199 NId = Nodes.size(); in addConstructedNode()
200 Nodes.push_back(std::move(N)); in addConstructedNode()
239 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) { in NodeItr()
289 NodeItr end() const { return NodeItr(G.Nodes.size(), G); } in end()
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Tooling/Syntax/
H A DCMakeLists.txt1 clang_tablegen(Nodes.inc -gen-clang-syntax-node-list
2 SOURCE Nodes.td
6 SOURCE Nodes.td
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DLazyCallGraph.cpp247 assert(!Nodes.empty() && "Can't have an empty SCC!"); in verify()
249 for (Node *N : Nodes) { in verify()
272 for (Node *NodeToVisit : Nodes) { in verify()
382 SmallVector<Node *> Nodes; in verify() local
385 Nodes.push_back(&N); in verify()
387 for (Node *N : Nodes) { in verify()
398 for (Node *NodeToVisit : Nodes) { in verify()
711 TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end()); in switchInternalEdgeToCall()
712 for (Node *N : C->Nodes) in switchInternalEdgeToCall()
793 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef()
[all …]
H A DBlockFrequencyInfoImpl.cpp412 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
518 for (const BlockNode &N : Loop.Nodes) { in unwrapLoop()
649 Nodes.reserve(OuterLoop.Nodes.size()); in addNodesInLoop()
650 for (auto N : OuterLoop.Nodes) in addNodesInLoop()
664 for (auto &I : Nodes) in indexNodes()
783 for (const auto &N : Loop->Nodes) in createIrreducibleLoop()
815 auto O = OuterLoop.Nodes.begin() + 1; in updateLoopWithIrreducible()
816 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I) in updateLoopWithIrreducible()
819 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); in updateLoopWithIrreducible()
836 auto &HeaderNode = Loop.Nodes[H]; in adjustLoopHeaderMass()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp151 NodeVect Nodes; member in __anonfa3046790111::HexagonCommonGEP
367 Nodes.push_back(N); in processGepInst()
382 Nodes.push_back(Nx); in processGepInst()
420 LLVM_DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes); in collect()
423 static void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots() argument
427 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in invert_find_roots()
439 NodeSet &Nodes) { in nodes_for_root() argument
442 Nodes.insert(Root); in nodes_for_root()
451 Nodes.insert(CF->second.begin(), CF->second.end()); in nodes_for_root()
533 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
[all …]
H A DHexagonISelDAGToDAG.h141 void ppSimplifyOrSelect0(std::vector<SDNode*> &&Nodes);
142 void ppAddrReorderAddShl(std::vector<SDNode*> &&Nodes);
143 void ppAddrRewriteAndSrl(std::vector<SDNode*> &&Nodes);
144 void ppHoistZextI1(std::vector<SDNode*> &&Nodes);
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h322 llvm::FoldingSet<ExplodedNode> Nodes; variable
388 void reserve(unsigned NodeCount) { Nodes.reserve(NodeCount); } in reserve()
400 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin()
402 node_iterator nodes_end() { return Nodes.end(); } in nodes_end()
404 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin()
406 const_node_iterator nodes_end() const { return Nodes.end(); } in nodes_end()
440 trim(ArrayRef<const NodeTy *> Nodes,
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp1587 SCCNodesResult Nodes = createSCCNodeSet(Functions); in deriveAttrsInPostOrder() local
1591 if (Nodes.SCCNodes.empty()) in deriveAttrsInPostOrder()
1594 Changed |= addArgumentReturnedAttrs(Nodes.SCCNodes); in deriveAttrsInPostOrder()
1595 Changed |= addReadAttrs(Nodes.SCCNodes, AARGetter); in deriveAttrsInPostOrder()
1596 Changed |= addArgumentAttrs(Nodes.SCCNodes); in deriveAttrsInPostOrder()
1597 Changed |= inferConvergent(Nodes.SCCNodes); in deriveAttrsInPostOrder()
1598 Changed |= addNoReturnAttrs(Nodes.SCCNodes); in deriveAttrsInPostOrder()
1599 Changed |= addWillReturn(Nodes.SCCNodes); in deriveAttrsInPostOrder()
1603 if (!Nodes.HasUnknownCall) { in deriveAttrsInPostOrder()
1604 Changed |= addNoAliasAttrs(Nodes.SCCNodes); in deriveAttrsInPostOrder()
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/
H A DRefactoringCallbacks.cpp90 if (const Stmt *FromMatch = Result.Nodes.getNodeAs<Stmt>(FromId)) { in run()
108 const Stmt *FromMatch = Result.Nodes.getNodeAs<Stmt>(FromId); in run()
109 const Stmt *ToMatch = Result.Nodes.getNodeAs<Stmt>(ToId); in run()
128 if (const IfStmt *Node = Result.Nodes.getNodeAs<IfStmt>(Id)) { in run()
200 const auto &NodeMap = Result.Nodes.getMap(); in run()

12345678