Home
last modified time | relevance | path

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

1234567

/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DBalancedPartitioning.cpp78 void BalancedPartitioning::run(std::vector<BPFunctionNode> &Nodes) const { in run()
82 Nodes.size(), Config.SplitDepth, Config.IterationsPerSplit)); in run()
91 for (unsigned I = 0; I < Nodes.size(); I++) in run()
92 Nodes[I].InputOrderIndex = I; in run()
94 auto NodesRange = llvm::make_range(Nodes.begin(), Nodes.end()); in run()
112 void BalancedPartitioning::bisect(const FunctionNodeRange Nodes, in bisect() argument
116 unsigned NumNodes = std::distance(Nodes.begin(), Nodes.end()); in bisect()
120 llvm::sort(Nodes, [](const auto &L, const auto &R) { in bisect()
123 for (auto &N : Nodes) in bisect()
137 split(Nodes, LeftBucket); in bisect()
[all …]
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/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h183 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); } in DirectedGraph()
184 DirectedGraph(const DGraphType &G) : Nodes(G.Nodes) {} in DirectedGraph()
185 DirectedGraph(DGraphType &&RHS) : Nodes(std::move(RHS.Nodes)) {} in DirectedGraph()
187 Nodes = G.Nodes;
191 Nodes = std::move(G.Nodes);
195 const_iterator begin() const { return Nodes.begin(); } in begin()
196 const_iterator end() const { return Nodes.end(); } in end()
197 iterator begin() { return Nodes.begin(); } in begin()
198 iterator end() { return Nodes.end(); } in end()
199 const NodeType &front() const { return *Nodes.front(); } in front()
[all …]
H A DIntervalMap.h336 /// @param Nodes Number of nodes.
340 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes() argument
343 for (int n = Nodes - 1; n; --n) { in adjustSiblingSizes()
357 if (Nodes == 0) in adjustSiblingSizes()
361 for (unsigned n = 0; n != Nodes - 1; ++n) { in adjustSiblingSizes()
364 for (unsigned m = n + 1; m != Nodes; ++m) { in adjustSiblingSizes()
376 for (unsigned n = 0; n != Nodes; n++) in adjustSiblingSizes()
389 /// Elements + Grow <= Nodes * Capacity.
406 /// @param Nodes The number of nodes.
409 /// @param CurSize Array[Nodes] o
1218 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; branchRoot() local
1259 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; splitRoot() local
2022 unsigned Nodes = 0; overflow() local
[all...]
H A DSCCIterator.h297 NodesType Nodes; variable
302 NodesType &operator*() { return Nodes; }
309 Nodes = InputNodes; in scc_member_iterator()
367 Nodes.push_back(Node); in scc_member_iterator()
377 assert(InputNodes.size() == Nodes.size() && "missing nodes in MST"); in scc_member_iterator()
378 std::reverse(Nodes.begin(), Nodes.end()); in scc_member_iterator()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp95 Nodes = std::vector<Node>(NodeCount); in initialize()
104 LLVM_DEBUG(dbgs() << "Starting profi for " << Nodes.size() << " nodes\n"); in run()
113 for (uint64_t Src = 0; Src < Nodes.size(); Src++) { in run()
220 uint64_t Pred = Nodes[Now].ParentNode; in computeAugmentingPathCapacity()
221 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; in computeAugmentingPathCapacity()
235 for (auto &Node : Nodes) { in findAugmentingPath()
244 Nodes[Source].Distance = 0; in findAugmentingPath()
245 Nodes[Source].Taken = true; in findAugmentingPath()
249 Nodes[Src].Taken = false; in findAugmentingPath()
264 if (!Params.EvenFlowDistribution && Nodes[Target].Distance == 0) in findAugmentingPath()
[all …]
H A DCodeLayout.cpp290 Nodes(1, Node) {} in removeEdge()
292 size_t numBlocks() const { return Nodes.size(); } in removeEdge()
296 bool isEntry() const { return Nodes[0]->Index == 0; } in removeEdge()
299 for (NodeT *Node : Nodes) { in removeEdge()
330 Nodes = std::move(MergedBlocks);
334 Id = Nodes[0]->Index;
336 for (size_t Idx = 0; Idx < Nodes.size(); Idx++) { member
337 Nodes[Idx]->CurChain = this;
338 Nodes[Idx]->CurIndex = Idx;
345 Nodes
[all...]
/freebsd/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.h233 NodeList Nodes; ///< Header and the members of the loop. member
239 : Parent(Parent), Nodes(1, Header), BackedgeMass(1) {} in LoopData()
244 : Parent(Parent), Nodes(FirstHeader, LastHeader) { in LoopData()
245 NumHeaders = Nodes.size(); in LoopData()
246 Nodes.insert(Nodes.end(), FirstOther, LastOther); in LoopData()
252 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders, in isHeader()
254 return Node == Nodes[0]; in isHeader()
257 BlockNode getHeader() const { return Nodes[0]; } in getHeader()
263 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - in getHeaderIndex()
264 Nodes.begin(); in getHeaderIndex()
[all …]
/freebsd/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/contrib/llvm-project/clang/include/clang/AST/
H A DASTImporter.h152 Nodes.push_back(D); in push()
157 if (Nodes.empty()) in pop()
159 --Aux[Nodes.back()]; in pop()
160 Nodes.pop_back(); in pop()
165 auto Pos = Aux.find(Nodes.back()); in hasCycleAtBack()
171 assert(Nodes.size() >= 2); in getCycleAtBack()
172 return Cycle(Nodes.rbegin(), in getCycleAtBack()
173 std::find(Nodes.rbegin() + 1, Nodes.rend(), Nodes.back()) + in getCycleAtBack()
185 VecTy Nodes;
H A DParentMapContext.h95 ArrayRef<DynTypedNode> Nodes; member
105 new (&Nodes) ArrayRef<DynTypedNode>(A); in DynTypedNodeList()
109 return !IsSingleNode ? Nodes.begin() : &SingleNode; in begin()
113 return !IsSingleNode ? Nodes.end() : &SingleNode + 1; in end()
/freebsd/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h76 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
81 const BoundNodes Nodes; member
290 Nodes.push_back(Result.Nodes); in run()
297 SmallVector<BoundNodes, 1> Nodes; variable
308 return std::move(Callback.Nodes); in match()
324 return std::move(Callback.Nodes); in match()
334 return std::move(Callback.Nodes); in matchDynamic()
350 return std::move(Callback.Nodes); in matchDynamic()
/freebsd/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h318 NodeArray Nodes;
326 : Nodes(*A.NodeAllocator), in FunctionCallTrie()
337 : Nodes(std::move(O.Nodes)), in FunctionCallTrie()
344 Nodes = std::move(O.Nodes);
368 auto *NewRoot = Nodes.AppendEmplace( in enterFunction()
373 Nodes.trim(1); in enterFunction()
377 Nodes.trim(1); in enterFunction()
402 auto* NewNode = Nodes.AppendEmplace( in enterFunction()
493 auto NewRoot = O.Nodes.AppendEmplace( in deepCopyInto()
514 auto NewNode = O.Nodes.AppendEmplace( in deepCopyInto()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DBalancedPartitioning.h105 void run(std::vector<BPFunctionNode> &Nodes) const;
140 void bisect(const FunctionNodeRange Nodes, unsigned RecDepth,
145 void runIterations(const FunctionNodeRange Nodes, unsigned LeftBucket,
150 unsigned runIteration(const FunctionNodeRange Nodes, unsigned LeftBucket,
162 void split(const FunctionNodeRange Nodes, unsigned StartBucket) const;
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h329 SetVector<SUnit *> Nodes; variable
342 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet()
344 for (const SUnit *Node : Nodes) { in NodeSet()
348 if (!Nodes.count(SuccSUnit)) in NodeSet()
362 bool insert(SUnit *SU) { return Nodes.insert(SU); } in insert()
364 void insert(iterator S, iterator E) { Nodes.insert(S, E); } in insert()
367 return Nodes.remove_if(P); in remove_if()
370 unsigned count(SUnit *SU) const { return Nodes.count(SU); } in count()
374 unsigned size() const { return Nodes.size(); } in size()
376 bool empty() const { return Nodes.empty(); } in empty()
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp170 for (DGNode &N : Nodes) { in pruneEdges()
181 Nodes[Edge.ToIID].NumPredecessors--; in pruneEdges()
194 for (unsigned I = 0, E = Nodes.size(); I < E; ++I) { in initializeRootSet()
195 const DGNode &N = Nodes[I]; in initializeRootSet()
237 const DGNode &N = Nodes[IID]; in propagateThroughEdges()
240 DGNode &To = Nodes[ToIID]; in propagateThroughEdges()
274 llvm::max_element(Nodes, [](const DGNode &Lhs, const DGNode &Rhs) { 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 …]
/freebsd/contrib/llvm-project/clang/lib/Tooling/Transformer/
H A DRewriteRule.cpp213 ast_matchers::BoundNodes Nodes; member in __anonefb0af210611::BindingsMatcher
217 explicit BindingsMatcher(ast_matchers::BoundNodes Nodes, in BindingsMatcher() argument
219 : Nodes(std::move(Nodes)), InnerMatcher(std::move(InnerMatcher)) {} in BindingsMatcher()
225 for (const auto &N : Nodes.getMap()) in matches()
260 forEachDescendantDynamically(ast_matchers::BoundNodes Nodes, in forEachDescendantDynamically() argument
263 std::move(Nodes), in forEachDescendantDynamically()
273 void registerMatchers(const ast_matchers::BoundNodes &Nodes, in registerMatchers() argument
276 MF->addMatcher(forEachDescendantDynamically<T>(Nodes, Matcher), this); in registerMatchers()
304 Callback.registerMatchers<T>(Result.Nodes, &Finder); in rewriteDescendantsImpl()
350 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()
136 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in node()
149 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in statement()
183 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID); in member()
195 Expected<DynTypedNode> N = getNode(Result.Nodes, ID); in name()
255 Expected<DynTypedNode> N = getNode(Result.Nodes, ID); in operator ()()
/freebsd/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()
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 …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAG.h139 void ppSimplifyOrSelect0(std::vector<SDNode*> &&Nodes);
140 void ppAddrReorderAddShl(std::vector<SDNode*> &&Nodes);
141 void ppAddrRewriteAndSrl(std::vector<SDNode*> &&Nodes);
142 void ppHoistZextI1(std::vector<SDNode*> &&Nodes);
143 void ppHvxShuffleOfShuffle(std::vector<SDNode*> &&Nodes);
H A DHexagonCommonGEP.cpp151 NodeVect Nodes; member in __anon9d81f58e0111::HexagonCommonGEP
379 Nodes.push_back(N); in processGepInst()
393 Nodes.push_back(Nx); in processGepInst()
428 LLVM_DEBUG(dbgs() << "Gep nodes after initial collection:\n" << Nodes); in collect()
431 static void invert_find_roots(const NodeVect &Nodes, NodeChildrenMap &NCM, in invert_find_roots() argument
433 for (GepNode *N : Nodes) { in invert_find_roots()
444 NodeSet &Nodes) { in nodes_for_root() argument
447 Nodes.insert(Root); in nodes_for_root()
456 Nodes.insert(CF->second.begin(), CF->second.end()); in nodes_for_root()
540 for (GepNode *N : Nodes) { in common()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp250 assert(!Nodes.empty() && "Can't have an empty SCC!"); in verify()
252 for (Node *N : Nodes) { in verify()
275 for (Node *NodeToVisit : Nodes) { in verify()
383 SmallVector<Node *> Nodes; in verify() local
386 Nodes.push_back(&N); in verify()
388 for (Node *N : Nodes) { in verify()
399 for (Node *NodeToVisit : Nodes) { in verify()
710 TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end()); in switchInternalEdgeToCall()
711 for (Node *N : C->Nodes) in switchInternalEdgeToCall()
788 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef()
[all …]
H A DBlockFrequencyInfoImpl.cpp426 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
526 for (const BlockNode &N : Loop.Nodes) { in unwrapLoop()
639 Nodes.reserve(OuterLoop.Nodes.size()); in addNodesInLoop()
640 for (auto N : OuterLoop.Nodes) in addNodesInLoop()
654 for (auto &I : Nodes) in indexNodes()
773 for (const auto &N : Loop->Nodes) in createIrreducibleLoop()
805 auto O = OuterLoop.Nodes.begin() + 1; in updateLoopWithIrreducible()
806 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I) in updateLoopWithIrreducible()
809 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); in updateLoopWithIrreducible()
826 auto &HeaderNode = Loop.Nodes[H]; in adjustLoopHeaderMass()

1234567