| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | BalancedPartitioning.cpp | 79 void BalancedPartitioning::run(std::vector<BPFunctionNode> &Nodes) const { in run()
83 Nodes.size(), Config.SplitDepth, Config.IterationsPerSplit)); in run()
92 for (unsigned I = 0; I < Nodes.size(); I++) in run()
93 Nodes[I].InputOrderIndex = I; in run()
95 auto NodesRange = llvm::make_range(Nodes.begin(), Nodes.end()); in run()
113 void BalancedPartitioning::bisect(const FunctionNodeRange Nodes, in bisect() argument
117 unsigned NumNodes = std::distance(Nodes.begin(), Nodes.end()); in bisect()
121 llvm::sort(Nodes, [](const auto &L, const auto &R) { in bisect()
124 for (auto &N : Nodes) in bisect()
138 split(Nodes, LeftBucket); in bisect()
[all …]
|
| H A D | IntervalMap.cpp | 120 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 D | DirectedGraph.h | 183 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 D | IntervalMap.h | 341 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes() argument
344 for (int n = Nodes - 1; n; --n) { in adjustSiblingSizes()
358 if (Nodes == 0) in adjustSiblingSizes()
362 for (unsigned n = 0; n != Nodes - 1; ++n) { in adjustSiblingSizes()
365 for (unsigned m = n + 1; m != Nodes; ++m) { in adjustSiblingSizes()
377 for (unsigned n = 0; n != Nodes; n++) in adjustSiblingSizes()
415 LLVM_ABI IdxPair distribute(unsigned Nodes, unsigned Elements,
1219 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1222 unsigned size[Nodes]; in branchRoot()
1226 if (Nodes == 1) in branchRoot()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | IntervalPartition.cpp | 28 std::vector<const Node *> Nodes; member
43 Interval.Nodes.push_back(Header); in buildInterval()
79 return llvm::is_contained(Interval.Nodes, P); in buildInterval()
82 Interval.Nodes.push_back(B); in buildInterval()
98 if (!llvm::is_contained(Interval.Nodes, B)) in buildInterval()
119 for (const auto *N : Result.Nodes) { in fillIntervalNode()
126 Interval.Nodes = std::move(Result.Nodes); in fillIntervalNode()
128 std::vector<const CFGBlock *> Nodes; in fillIntervalNode() local
131 for (auto &N : Result.Nodes) in fillIntervalNode()
132 Count += N->Nodes.size(); in fillIntervalNode()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Scheduler.h | 113 ContainerTy Nodes;
116 void eraseFromBundle(DGNode *N) { llvm::erase(Nodes, N); } in eraseFromBundle()
122 SchedBundle(ContainerTy &&Nodes) : Nodes(std::move(Nodes)) { in SchedBundle() argument
123 for (auto *N : this->Nodes) in SchedBundle()
131 for (auto *N : this->Nodes) in ~SchedBundle()
134 bool empty() const { return Nodes.empty(); } in empty()
138 bool isSingleton() const { return Nodes.size() == 1u; } in isSingleton()
139 DGNode *back() const { return Nodes.back(); } in back()
142 iterator begin() { return Nodes.begin(); } in begin()
143 iterator end() { return Nodes.end(); } in end()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 95 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 D | CodeLayout.cpp | 290 Nodes(1, Node) {} in ChainT()
292 size_t numBlocks() const { return Nodes.size(); } in numBlocks()
296 bool isEntry() const { return Nodes[0]->Index == 0; } in isEntry()
299 for (NodeT *Node : Nodes) { in isCold()
330 Nodes = std::move(MergedBlocks); in merge()
334 Id = Nodes[0]->Index; in merge()
336 for (size_t Idx = 0; Idx < Nodes.size(); Idx++) { in merge()
337 Nodes[Idx]->CurChain = this; in merge()
338 Nodes[Idx]->CurIndex = Idx; in merge()
345 Nodes.clear(); in clear()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | CallGraphSCCPass.h | 86 std::vector<CallGraphNode *> Nodes; variable
92 Nodes.assign(NewNodes.begin(), NewNodes.end()); in initialize()
95 bool isSingular() const { return Nodes.size() == 1; } in isSingular()
96 unsigned size() const { return Nodes.size(); } in size()
108 iterator begin() const { return Nodes.begin(); } in begin()
109 iterator end() const { return Nodes.end(); } in end()
|
| H A D | BlockFrequencyInfoImpl.h | 230 NodeList Nodes; ///< Header and the members of the loop. member
236 : Parent(Parent), Nodes(1, Header), BackedgeMass(1) {} in LoopData()
241 : Parent(Parent), Nodes(FirstHeader, LastHeader) { in LoopData()
242 NumHeaders = Nodes.size(); in LoopData()
243 Nodes.insert(Nodes.end(), FirstOther, LastOther); in LoopData()
249 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders, in isHeader()
251 return Node == Nodes[0]; in isHeader()
254 BlockNode getHeader() const { return Nodes[0]; } in getHeader()
260 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - in getHeaderIndex()
261 Nodes.begin(); in getHeaderIndex()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | NumberObjectConversionChecker.cpp | 66 (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 D | OSObjectCStyleCast.cpp | 40 return Builder->removeBindings([this, &Node](const BoundNodesMap &Nodes) { in AST_MATCHER_P() argument
41 const DynTypedNode &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/lib/StaticAnalyzer/Checkers/WebKit/ |
| H A D | MemoryUnsafeCastChecker.cpp | 40 static void emitDiagnostics(const BoundNodes &Nodes, BugReporter &BR, in emitDiagnostics() argument
44 const auto *CE = Nodes.getNodeAs<CastExpr>(WarnRecordDecl); in emitDiagnostics()
45 const NamedDecl *Base = Nodes.getNodeAs<NamedDecl>(BaseNode); in emitDiagnostics()
46 const NamedDecl *Derived = Nodes.getNodeAs<NamedDecl>(DerivedNode); in emitDiagnostics()
60 static void emitDiagnosticsUnrelated(const BoundNodes &Nodes, BugReporter &BR, in emitDiagnosticsUnrelated() argument
64 const auto *CE = Nodes.getNodeAs<CastExpr>(WarnRecordDecl); in emitDiagnosticsUnrelated()
65 const NamedDecl *FromCast = Nodes.getNodeAs<NamedDecl>(FromCastNode); in emitDiagnosticsUnrelated()
66 const NamedDecl *ToCast = Nodes.getNodeAs<NamedDecl>(ToCastNode); in emitDiagnosticsUnrelated()
83 return Builder->removeBindings([this, &Node](const BoundNodesMap &Nodes) { in AST_MATCHER_P() argument
84 const auto &BN = Nodes.getNode(this->BindingID); in AST_MATCHER_P()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachinePipeliner.h | 482 SetVector<SUnit *> Nodes; variable
496 : Nodes(S, E), HasRecurrence(true) { in NodeSet()
513 for (auto *Node : Nodes) in NodeSet()
516 for (unsigned I = 1, E = Nodes.size(); I <= E; ++I) { in NodeSet()
517 SUnit *U = Nodes[I - 1]; in NodeSet()
518 SUnit *V = Nodes[I % Nodes.size()]; in NodeSet()
530 SUnit *FirstNode = Nodes[0]; in NodeSet()
531 SUnit *LastNode = Nodes[Nodes.size() - 1]; in NodeSet()
547 Latency = SUnitToDistance[Nodes.front()]; in NodeSet()
550 bool insert(SUnit *SU) { return Nodes.insert(SU); } in insert()
[all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/AST/ |
| H A D | ASTImporter.h | 153 Nodes.push_back(D); in push()
158 if (Nodes.empty()) in pop()
160 --Aux[Nodes.back()]; in pop()
161 Nodes.pop_back(); in pop()
166 auto Pos = Aux.find(Nodes.back()); in hasCycleAtBack()
172 assert(Nodes.size() >= 2); in getCycleAtBack()
173 return Cycle(Nodes.rbegin(), in getCycleAtBack()
174 std::find(Nodes.rbegin() + 1, Nodes.rend(), Nodes.back()) + in getCycleAtBack()
186 VecTy Nodes;
|
| H A D | ParentMapContext.h | 95 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/llvm/utils/TableGen/ |
| H A D | SDNodeInfoEmitter.cpp | 75 static bool haveCompatibleDescriptions(ArrayRef<SDNodeInfo> Nodes) { in haveCompatibleDescriptions() argument
76 const SDNodeInfo &N = Nodes.front(); in haveCompatibleDescriptions()
77 return all_of(drop_begin(Nodes), [&](const SDNodeInfo &Other) { in haveCompatibleDescriptions()
244 for (const auto &[EnumName, Nodes] : NodesByName) { in emitTypeConstraints()
245 ArrayRef<SDTypeConstraint> Constraints = Nodes.front().getTypeConstraints(); in emitTypeConstraints()
247 bool IsAmbiguous = any_of(drop_begin(Nodes), [&](const SDNodeInfo &Other) { in emitTypeConstraints()
277 for (const auto &[EnumName, Nodes] : NodesByName) { in emitTypeConstraints()
278 ArrayRef<SDTypeConstraint> Constraints = Nodes.front().getTypeConstraints(); in emitTypeConstraints()
295 ArrayRef<SDNodeInfo> Nodes, unsigned NameOffset, in emitDesc() argument
297 assert(haveCompatibleDescriptions(Nodes)); in emitDesc()
[all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchFinder.h | 76 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/llvm/lib/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Scheduler.cpp | 16 DGNode *TopN = Nodes.front(); in getTop()
17 for (auto *N : drop_begin(Nodes)) { in getTop()
25 DGNode *BotN = Nodes.front(); in getBot()
26 for (auto *N : drop_begin(Nodes)) { in getBot()
34 for (auto *N : Nodes) { in cluster()
44 for (auto *N : Nodes) in dump()
115 SchedBundle::ContainerTy Nodes; in createBundle() local
116 Nodes.reserve(Instrs.size()); in createBundle()
118 Nodes.push_back(DAG.getNode(I)); in createBundle()
119 auto BndlPtr = std::make_unique<SchedBundle>(std::move(Nodes)); in createBundle()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/xray/ |
| H A D | xray_function_call_trie.h | 318 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 D | BalancedPartitioning.h | 106 LLVM_ABI void run(std::vector<BPFunctionNode> &Nodes) const;
141 void bisect(const FunctionNodeRange Nodes, unsigned RecDepth,
146 void runIterations(const FunctionNodeRange Nodes, unsigned LeftBucket,
151 unsigned runIteration(const FunctionNodeRange Nodes, unsigned LeftBucket,
163 void split(const FunctionNodeRange Nodes, unsigned StartBucket) const;
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 168 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/clang/lib/Tooling/Transformer/ |
| H A D | RewriteRule.cpp | 212 ast_matchers::BoundNodes Nodes; member in __anonefb0af210611::BindingsMatcher
216 explicit BindingsMatcher(ast_matchers::BoundNodes Nodes, in BindingsMatcher() argument
218 : Nodes(std::move(Nodes)), InnerMatcher(std::move(InnerMatcher)) {} in BindingsMatcher()
224 for (const auto &N : Nodes.getMap()) in matches()
259 forEachDescendantDynamically(ast_matchers::BoundNodes Nodes, in forEachDescendantDynamically() argument
262 std::move(Nodes), in forEachDescendantDynamically()
272 void registerMatchers(const ast_matchers::BoundNodes &Nodes, in registerMatchers() argument
275 MF->addMatcher(forEachDescendantDynamically<T>(Nodes, Matcher), this); in registerMatchers()
303 Callback.registerMatchers<T>(Result.Nodes, &Finder); in rewriteDescendantsImpl()
349 Result.Nodes.getMap(); in rewriteDescendants()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/ProfileData/ |
| H A D | PGOCtxProfWriter.cpp | 189 createNode(std::vector<std::unique_ptr<char[]>> &Nodes,
195 createNode(std::vector<std::unique_ptr<char[]>> &Nodes, in createNode() argument
200 auto *Mem = Nodes.emplace_back(std::make_unique<char[]>(AllocSize)).get(); in createNode()
207 Ret->subContexts()[I] = createNode(Nodes, DCList); in createNode()
214 createNode(std::vector<std::unique_ptr<char[]>> &Nodes, in createNode() argument
218 List = createNode(Nodes, DC, List); in createNode()
264 std::vector<std::unique_ptr<char[]>> Nodes; in createCtxProfFromYAML() local
273 auto *TopList = createNode(Nodes, DC); in createCtxProfFromYAML()
283 FirstUnhandled = createNode(Nodes, Unhandled, FirstUnhandled); in createCtxProfFromYAML()
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.cpp | 169 for (DGNode &N : Nodes) { in pruneEdges()
180 Nodes[Edge.ToIID].NumPredecessors--; in pruneEdges()
193 for (unsigned I = 0, E = Nodes.size(); I < E; ++I) { in initializeRootSet()
194 const DGNode &N = Nodes[I]; in initializeRootSet()
236 const DGNode &N = Nodes[IID]; in propagateThroughEdges()
239 DGNode &To = Nodes[ToIID]; in propagateThroughEdges()
273 llvm::max_element(Nodes, [](const DGNode &Lhs, const DGNode &Rhs) { in getCriticalSequence()
276 unsigned IID = std::distance(Nodes.begin(), It); in getCriticalSequence()
277 Seq.resize(Nodes[IID].Depth); in getCriticalSequence()
279 const DGNode &N = Nodes[IID]; in getCriticalSequence()
[all …]
|