Home
last modified time | relevance | path

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

123456

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h183 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);
207 return llvm::find_if(Nodes, in findNode()
219 Nodes.push_back(&N); in addNode()
228 for (auto *Node : Nodes) { in findIncomingEdgesToNode()
244 if (IT == Nodes.end()) in removeNode()
248 for (auto *Node : Nodes) { in removeNode()
257 Nodes.erase(IT); in removeNode()
[all …]
H A DIntervalMap.h359 if (Nodes == 0) in adjustSiblingSizes()
1175 unsigned size[Nodes]; in branchRoot()
1179 if (Nodes == 1) in branchRoot()
1187 NodeRef node[Nodes]; in branchRoot()
1202 rootSize = Nodes; in branchRoot()
1220 if (Nodes == 1) in splitRoot()
1228 NodeRef Node[Nodes]; in splitRoot()
1240 rootSize = Nodes; in splitRoot()
1976 unsigned Nodes = 0; in overflow() local
2002 NewNode = Nodes == 1 ? 1 : Nodes - 1; in overflow()
[all …]
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/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.h245 Nodes.insert(Nodes.end(), FirstOther, LastOther); in LoopData()
251 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders, in isHeader()
253 return Node == Nodes[0]; in isHeader()
262 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - in getHeaderIndex()
263 Nodes.begin(); in getHeaderIndex()
624 std::vector<IrrNode> Nodes;
649 Nodes.emplace_back(Node);
1047 Nodes.erase(BB);
1121 Nodes.clear();
1146 if (!Nodes.count(&BB))
[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.h427 SmallVector<Node *, 1> Nodes; variable
430 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() argument
431 : OuterRefSCC(&OuterRefSCC), Nodes(std::forward<NodeRangeT>(Nodes)) {} in SCC()
435 Nodes.clear(); in clear()
453 OS << "..., " << *C.Nodes.back();
479 iterator begin() const { return Nodes.begin(); } in begin()
480 iterator end() const { return Nodes.end(); } in end()
482 int size() const { return Nodes.size(); } in size()
1197 void buildSCCs(RefSCC &RC, node_stack_range Nodes);
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/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;
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h312 SetVector<SUnit *> Nodes; variable
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()
350 return Nodes.remove_if(P); in remove_if()
357 unsigned size() const { return Nodes.size(); } in size()
359 bool empty() const { return Nodes.empty(); } in empty()
388 Nodes.clear(); in clear()
397 operator SetVector<SUnit *> &() { return Nodes; }
421 iterator begin() { return Nodes.begin(); } in begin()
[all …]
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h322 NodeArray Nodes;
330 : Nodes(*A.NodeAllocator), in FunctionCallTrie()
341 : Nodes(std::move(O.Nodes)), in FunctionCallTrie()
348 Nodes = std::move(O.Nodes);
372 auto *NewRoot = Nodes.AppendEmplace( in enterFunction()
377 Nodes.trim(1); in enterFunction()
381 Nodes.trim(1); in enterFunction()
406 auto* NewNode = Nodes.AppendEmplace( in enterFunction()
497 auto NewRoot = O.Nodes.AppendEmplace( in deepCopyInto()
518 auto NewNode = O.Nodes.AppendEmplace( in deepCopyInto()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp170 for (DGNode &N : Nodes) { in pruneEdges()
195 const DGNode &N = Nodes[I]; in initializeRootSet()
240 DGNode &To = Nodes[ToIID]; in propagateThroughEdges()
274 Nodes.begin(), Nodes.end(), in getCriticalSequence()
277 Seq.resize(Nodes[IID].Depth); in getCriticalSequence()
279 const DGNode &N = Nodes[IID]; in getCriticalSequence()
402 for (const DGNode &Node : Nodes) in dump()
408 for (const DGNode &Node : Nodes) in dump()
414 for (const DGNode &Node : Nodes) in dump()
423 DGNode &NodeFrom = Nodes[From]; in addDependency()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/lib/Tooling/Transformer/
H A DRewriteRule.cpp181 ast_matchers::BoundNodes Nodes; member in __anon528620d50611::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
273 Callback.registerMatchers<T>(Result.Nodes, &Finder); in rewriteDescendantsImpl()
319 Result.Nodes.getMap(); in rewriteDescendants()
415 auto &NodesMap = Result.Nodes.getMap(); in getRuleMatchLoc()
[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 ()()
/freebsd-13.1/contrib/llvm-project/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()
291 bool empty() const { return G.Nodes.empty(); } in empty()
294 return G.Nodes.size() - G.FreeNodeIds.size(); in size()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp249 for (Node *N : Nodes) { in verify()
382 SmallVector<Node *> Nodes; in verify() local
385 Nodes.push_back(&N); in verify()
387 for (Node *N : 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()
808 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
1226 Worklist.append(C->Nodes.begin(), C->Nodes.end()); in removeInternalRefEdge()
1897 for (Node *N : Nodes) { in buildSCCs()
[all …]
H A DBlockFrequencyInfoImpl.cpp426 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
532 for (const BlockNode &N : Loop.Nodes) { in unwrapLoop()
663 Nodes.reserve(OuterLoop.Nodes.size()); in addNodesInLoop()
664 for (auto N : OuterLoop.Nodes) in addNodesInLoop()
678 for (auto &I : Nodes) in indexNodes()
797 for (const auto &N : Loop->Nodes) in createIrreducibleLoop()
829 auto O = OuterLoop.Nodes.begin() + 1; in updateLoopWithIrreducible()
830 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I) in updateLoopWithIrreducible()
833 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); in updateLoopWithIrreducible()
850 auto &HeaderNode = Loop.Nodes[H]; in adjustLoopHeaderMass()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp152 NodeVect Nodes; member in __anonf5d600c20111::HexagonCommonGEP
382 Nodes.push_back(N); in processGepInst()
397 Nodes.push_back(Nx); in processGepInst()
442 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in invert_find_roots()
457 Nodes.insert(Root); in nodes_for_root()
550 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
639 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
658 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
671 erase_if(Nodes, in_set(Erase)); in common()
974 Nodes.push_back(NewN); in separateChainForNode()
[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);
/freebsd-13.1/contrib/llvm-project/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,
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp1591 if (Nodes.SCCNodes.empty()) 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()
1605 Changed |= addNonNullAttrs(Nodes.SCCNodes); in deriveAttrsInPostOrder()
1607 Changed |= addNoRecurseAttrs(Nodes.SCCNodes); in deriveAttrsInPostOrder()
1610 Changed |= addNoSyncAttr(Nodes.SCCNodes); in deriveAttrsInPostOrder()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DCGProfile.cpp35 std::vector<Metadata *> Nodes; in addModuleFlags() local
42 Nodes.push_back(MDNode::get(Context, Vals)); in addModuleFlags()
45 M.addModuleFlag(Module::Append, "CG Profile", MDNode::get(Context, Nodes)); in addModuleFlags()

123456