| /openbsd-src/gnu/llvm/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 | 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()
414 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
1218 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot() local
1221 unsigned size[Nodes]; in branchRoot()
1225 if (Nodes == 1) in branchRoot()
[all …]
|
| H A D | SCCIterator.h | 295 NodesType Nodes; variable
300 NodesType &operator*() { return Nodes; }
307 Nodes = InputNodes; in scc_member_iterator()
363 Nodes.push_back(Node); in scc_member_iterator()
372 assert(InputNodes.size() == Nodes.size() && "missing nodes in MST"); in scc_member_iterator()
373 std::reverse(Nodes.begin(), Nodes.end()); in scc_member_iterator()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 94 Nodes = std::vector<Node>(NodeCount); in initialize()
103 LLVM_DEBUG(dbgs() << "Starting profi for " << Nodes.size() << " nodes\n"); in run()
112 for (uint64_t Src = 0; Src < Nodes.size(); Src++) { in run()
219 uint64_t Pred = Nodes[Now].ParentNode; in computeAugmentingPathCapacity()
220 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; in computeAugmentingPathCapacity()
234 for (auto &Node : Nodes) { in findAugmentingPath()
243 Nodes[Source].Distance = 0; in findAugmentingPath()
244 Nodes[Source].Taken = true; in findAugmentingPath()
248 Nodes[Src].Taken = false; in findAugmentingPath()
263 if (!Params.EvenFlowDistribution && Nodes[Target].Distance == 0) in findAugmentingPath()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Support/ |
| 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()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | CallGraphSCCPass.h | 90 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 D | BlockFrequencyInfoImpl.h | 232 NodeList Nodes; ///< Header and the members of the loop. member
238 : Parent(Parent), Nodes(1, Header), BackedgeMass(1) {} in LoopData()
243 : Parent(Parent), Nodes(FirstHeader, LastHeader) { in LoopData()
244 NumHeaders = Nodes.size(); in LoopData()
245 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()
256 BlockNode getHeader() const { return Nodes[0]; } in getHeader()
262 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - in getHeaderIndex()
263 Nodes.begin(); in getHeaderIndex()
[all …]
|
| H A D | Interval.h | 48 Nodes.push_back(Header); in Interval()
54 std::vector<BasicBlock*> Nodes; variable
67 for (BasicBlock *Node : Nodes) in contains()
|
| /openbsd-src/gnu/llvm/clang/include/clang/AST/ |
| H A D | ASTImporter.h | 152 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 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()
|
| /openbsd-src/gnu/llvm/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 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()
|
| /openbsd-src/gnu/llvm/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()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | MachinePipeliner.h | 323 SetVector<SUnit *> Nodes; variable
336 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet()
338 for (const SUnit *Node : Nodes) { in NodeSet()
342 if (!Nodes.count(SuccSUnit)) in NodeSet()
356 bool insert(SUnit *SU) { return Nodes.insert(SU); } in insert()
358 void insert(iterator S, iterator E) { Nodes.insert(S, E); } in insert()
361 return Nodes.remove_if(P); in remove_if()
364 unsigned count(SUnit *SU) const { return Nodes.count(SU); } in count()
368 unsigned size() const { return Nodes.size(); } in size()
370 bool empty() const { return Nodes.empty(); } in empty()
[all …]
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/xray/ |
| H A D | xray_function_call_trie.h | 322 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 …]
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.cpp | 170 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 Nodes.begin(), Nodes.end(), 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 …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/Tooling/Syntax/ |
| H A D | CMakeLists.txt | 1 clang_tablegen(Nodes.inc -gen-clang-syntax-node-list
2 SOURCE Nodes.td
6 SOURCE Nodes.td
|
| /openbsd-src/gnu/llvm/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 …]
|
| /openbsd-src/gnu/llvm/clang/lib/Tooling/Transformer/ |
| H A D | RewriteRule.cpp | 213 ast_matchers::BoundNodes Nodes; member in __anon895ebc380611::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 D | RangeSelector.cpp | 54 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 ()()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| H A D | HexagonISelDAGToDAG.h | 138 void ppSimplifyOrSelect0(std::vector<SDNode*> &&Nodes);
139 void ppAddrReorderAddShl(std::vector<SDNode*> &&Nodes);
140 void ppAddrRewriteAndSrl(std::vector<SDNode*> &&Nodes);
141 void ppHoistZextI1(std::vector<SDNode*> &&Nodes);
142 void ppHvxShuffleOfShuffle(std::vector<SDNode*> &&Nodes);
|
| H A D | HexagonCommonGEP.cpp | 151 NodeVect Nodes; member in __anon16873bc50111::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 …]
|
| /openbsd-src/gnu/llvm/llvm/utils/gn/secondary/clang/include/clang/Tooling/Syntax/ |
| H A D | BUILD.gn | 3 clang_tablegen("Nodes") {
7 td_file = "Nodes.td"
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 242 assert(!Nodes.empty() && "Can't have an empty SCC!"); in verify()
244 for (Node *N : Nodes) { in verify()
267 for (Node *NodeToVisit : Nodes) { in verify()
375 SmallVector<Node *> Nodes; in verify() local
378 Nodes.push_back(&N); in verify()
380 for (Node *N : Nodes) { in verify()
391 for (Node *NodeToVisit : Nodes) { in verify()
702 TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end()); in switchInternalEdgeToCall()
703 for (Node *N : C->Nodes) in switchInternalEdgeToCall()
780 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef()
[all …]
|
| /openbsd-src/gnu/llvm/clang/lib/Analysis/ |
| H A D | UnsafeBufferUsage.cpp | 222 Op(Result.Nodes.getNodeAs<UnaryOperator>(OpTag)) {} in IncrementGadget()
257 Op(Result.Nodes.getNodeAs<UnaryOperator>(OpTag)) {} in DecrementGadget()
291 ASE(Result.Nodes.getNodeAs<ArraySubscriptExpr>(ArraySubscrTag)) {} in ArraySubscriptGadget()
334 PA(Result.Nodes.getNodeAs<BinaryOperator>(PointerArithmeticTag)), in PointerArithmeticGadget()
335 Ptr(Result.Nodes.getNodeAs<Expr>(PointerArithmeticPointerTag)) {} in PointerArithmeticGadget()
485 if (const auto *DRE = Result.Nodes.getNodeAs<DeclRefExpr>("any_dre")) { in findGadgets()
490 if (const auto *DS = Result.Nodes.getNodeAs<DeclStmt>("any_ds")) { in findGadgets()
499 if (Result.Nodes.getNodeAs<Stmt>(#name)) { \ in findGadgets()
505 if (Result.Nodes.getNodeAs<Stmt>(#name)) { \ in findGadgets()
|