/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | BalancedPartitioning.cpp | 94 auto NodesRange = llvm::make_range(Nodes.begin(), Nodes.end()); in run() 116 unsigned NumNodes = std::distance(Nodes.begin(), Nodes.end()); in bisect() 123 for (auto &N : Nodes) in bisect() 169 unsigned NumNodes = std::distance(Nodes.begin(), Nodes.end()); in runIterations() 171 for (auto &N : Nodes) in runIterations() 176 for (auto &N : Nodes) in runIterations() 183 for (auto &N : Nodes) in runIterations() 189 for (auto &N : Nodes) { in runIterations() 233 for (auto &N : Nodes) { in runIteration() 303 unsigned NumNodes = std::distance(Nodes.begin(), Nodes.end()); in split() [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 | 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); 208 return llvm::find_if(Nodes, in findNode() 220 Nodes.push_back(&N); in addNode() 229 for (auto *Node : Nodes) { in findIncomingEdgesToNode() 245 if (IT == Nodes.end()) in removeNode() 249 for (auto *Node : Nodes) { in removeNode() 258 Nodes.erase(IT); in removeNode() [all …]
|
H A D | IntervalMap.h | 357 if (Nodes == 0) in adjustSiblingSizes() 1221 unsigned size[Nodes]; in branchRoot() 1225 if (Nodes == 1) in branchRoot() 1233 NodeRef node[Nodes]; in branchRoot() 1248 rootSize = Nodes; in branchRoot() 1266 if (Nodes == 1) in splitRoot() 1274 NodeRef Node[Nodes]; in splitRoot() 1286 rootSize = Nodes; in splitRoot() 2022 unsigned Nodes = 0; in overflow() local 2048 NewNode = Nodes == 1 ? 1 : Nodes - 1; in overflow() [all …]
|
H A D | SCCIterator.h | 297 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/clang/lib/Analysis/ |
H A D | IntervalPartition.cpp | 28 std::vector<const Node *> Nodes; member 43 Interval.Nodes.push_back(Header); in buildInterval() 82 Interval.Nodes.push_back(B); in buildInterval() 126 Interval.Nodes = std::move(Result.Nodes); in fillIntervalNode() 131 for (auto &N : Result.Nodes) in fillIntervalNode() 132 Count += N->Nodes.size(); in fillIntervalNode() 133 Nodes.reserve(Count); in fillIntervalNode() 134 for (auto &N : Result.Nodes) in fillIntervalNode() 135 Nodes.insert(Nodes.end(), N->Nodes.begin(), N->Nodes.end()); in fillIntervalNode() 136 Interval.Nodes = std::move(Nodes); in fillIntervalNode() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SampleProfileInference.cpp | 235 for (auto &Node : Nodes) { in findAugmentingPath() 266 if (Nodes[Src].Distance > Nodes[Target].Distance) in findAugmentingPath() 327 for (auto &Node : Nodes) { in findAugmentingDAG() 389 if (Edge.OnShortestPath && Nodes[Src].Taken && Nodes[Dst].Taken && in findAugmentingDAG() 390 Nodes[Dst].Finish < Nodes[Src].Finish) { in findAugmentingDAG() 408 Nodes[Src].FracFlow = 0; in augmentFlowAlongDAG() 409 Nodes[Src].IntFlow = 0; in augmentFlowAlongDAG() 508 if (Nodes[Src].Distance > Nodes[Target].Distance) in identifyShortestEdges() 515 Nodes[Dst].Distance <= Nodes[Target].Distance && in identifyShortestEdges() 516 Nodes[Dst].Distance == Nodes[Src].Distance + Edge.Cost && in identifyShortestEdges() [all …]
|
H A D | CodeLayout.cpp | 290 Nodes(1, Node) {} in ChainT() 299 for (NodeT *Node : Nodes) { in isCold() 334 Id = Nodes[0]->Index; in merge() 345 Nodes.clear(); in clear() 346 Nodes.shrink_to_fit(); in clear() 361 std::vector<NodeT *> Nodes; member 935 mergeNodes(ChainPred->Nodes, ChainSucc->Nodes, MergeOffset, MergeType); in computeMergeGain() 956 mergeNodes(Into->Nodes, From->Nodes, MergeOffset, MergeType); in mergeChains() 966 MergedNodes = MergedNodesT(Into->Nodes.begin(), Into->Nodes.end()); in mergeChains() 1259 mergeNodes(ChainPred->Nodes, ChainSucc->Nodes, MergeOffset, MergeType); in computeMergeGain() [all …]
|
/freebsd/contrib/llvm-project/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 | 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() 263 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - in getHeaderIndex() 264 Nodes.begin(); in getHeaderIndex() 624 std::vector<IrrNode> Nodes; 649 Nodes.emplace_back(Node); 1047 Nodes.erase(BB); 1116 Nodes.clear(); 1141 if (!Nodes.count(&BB)) [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 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 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()
|
/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/include/llvm/Support/ |
H A D | BalancedPartitioning.h | 105 void run(std::vector<BPFunctionNode> &Nodes) const; 139 void bisect(const FunctionNodeRange Nodes, unsigned RecDepth, 144 void runIterations(const FunctionNodeRange Nodes, unsigned RecDepth, 150 unsigned runIteration(const FunctionNodeRange Nodes, unsigned LeftBucket, 162 void split(const FunctionNodeRange Nodes, unsigned StartBucket) const;
|
/freebsd/contrib/llvm-project/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 …]
|
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | IntervalPartition.h | 79 CFGIntervalNode(unsigned ID, std::vector<const CFGBlock *> Nodes) in CFGIntervalNode() 80 : ID(ID), Nodes(std::move(Nodes)) {} in CFGIntervalNode() 93 std::vector<const CFGBlock *> Nodes; member
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachinePipeliner.h | 324 SetVector<SUnit *> Nodes; variable 339 for (const SUnit *Node : Nodes) { in NodeSet() 343 if (!Nodes.count(SuccSUnit)) in NodeSet() 357 bool insert(SUnit *SU) { return Nodes.insert(SU); } in insert() 362 return Nodes.remove_if(P); in remove_if() 369 unsigned size() const { return Nodes.size(); } in size() 371 bool empty() const { return Nodes.empty(); } in empty() 400 Nodes.clear(); in clear() 409 operator SetVector<SUnit *> &() { return Nodes; } 433 iterator begin() { return Nodes.begin(); } in begin() [all …]
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
H A D | BottleneckAnalysis.cpp | 170 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/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() 291 bool empty() const { return G.Nodes.empty(); } in empty() 294 return G.Nodes.size() - G.FreeNodeIds.size(); in size() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/Tooling/Transformer/ |
H A D | RewriteRule.cpp | 213 ast_matchers::BoundNodes Nodes; member in __anon18ef03e90611::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 304 Callback.registerMatchers<T>(Result.Nodes, &Finder); in rewriteDescendantsImpl() 350 Result.Nodes.getMap(); in rewriteDescendants() 449 auto &NodesMap = Result.Nodes.getMap(); in getRuleMatchLoc() [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() 262 Expected<DynTypedNode> N = getNode(Result.Nodes, ID); in operator ()()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.h | 137 void ppSimplifyOrSelect0(std::vector<SDNode*> &&Nodes); 138 void ppAddrReorderAddShl(std::vector<SDNode*> &&Nodes); 139 void ppAddrRewriteAndSrl(std::vector<SDNode*> &&Nodes); 140 void ppHoistZextI1(std::vector<SDNode*> &&Nodes); 141 void ppHvxShuffleOfShuffle(std::vector<SDNode*> &&Nodes);
|
H A D | HexagonCommonGEP.cpp | 151 NodeVect Nodes; member in __anon2a64d1560111::HexagonCommonGEP 379 Nodes.push_back(N); in processGepInst() 393 Nodes.push_back(Nx); in processGepInst() 433 for (GepNode *N : Nodes) { in invert_find_roots() 447 Nodes.insert(Root); in nodes_for_root() 540 for (GepNode *N : Nodes) { in common() 624 for (GepNode *N : Nodes) { in common() 642 for (GepNode *N : Nodes) { in common() 654 erase_if(Nodes, in_set(Erase)); in common() 954 Nodes.push_back(NewN); in separateChainForNode() [all …]
|