Home
last modified time | relevance | path

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

1234

/freebsd-12.1/contrib/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-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DNumberObjectConversionChecker.cpp67 (Result.Nodes.getNodeAs<Stmt>("pedantic") != nullptr); in run()
74 Result.Nodes.getNodeAs<Expr>("check_if_null")) { in run()
103 const Stmt *Conv = Result.Nodes.getNodeAs<Stmt>("conv"); in run()
106 const Expr *ConvertedCObject = Result.Nodes.getNodeAs<Expr>("c_object"); in run()
107 const Expr *ConvertedCppObject = Result.Nodes.getNodeAs<Expr>("cpp_object"); in run()
108 const Expr *ConvertedObjCObject = Result.Nodes.getNodeAs<Expr>("objc_object"); in run()
117 (Result.Nodes.getNodeAs<Stmt>("comparison") != nullptr); in run()
120 (Result.Nodes.getNodeAs<Decl>("osnumber") != nullptr); in run()
123 (Result.Nodes.getNodeAs<QualType>("int_type") != nullptr); in run()
125 (Result.Nodes.getNodeAs<QualType>("objc_bool_type") != nullptr); in run()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; variable
97 Nodes.assign(NewNodes.begin(), NewNodes.end()); in initialize()
100 bool isSingular() const { return Nodes.size() == 1; } in isSingular()
101 unsigned size() const { return Nodes.size(); } in size()
109 iterator begin() const { return Nodes.begin(); } in begin()
110 iterator end() const { return Nodes.end(); } in end()
H A DBlockFrequencyInfoImpl.h241 Nodes.insert(Nodes.end(), FirstOther, LastOther);
247 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders,
249 return Node == Nodes[0];
258 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) -
259 Nodes.begin();
619 std::vector<IrrNode> Nodes;
644 Nodes.emplace_back(Node);
1030 Nodes.clear();
1049 if (Nodes.count(BB))
1056 Nodes[BB] = NewNode;
[all …]
H A DIntervalIterator.h74 Int->Nodes.push_back(BB); in addNodeToInterval()
85 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end()); in addNodeToInterval()
H A DLazyCallGraph.h436 SmallVector<Node *, 1> Nodes; variable
439 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() argument
440 : OuterRefSCC(&OuterRefSCC), Nodes(std::forward<NodeRangeT>(Nodes)) {} in SCC()
444 Nodes.clear(); in clear()
462 OS << "..., " << *C.Nodes.back();
488 iterator begin() const { return Nodes.begin(); } in begin()
489 iterator end() const { return Nodes.end(); } in end()
491 int size() const { return Nodes.size(); } in size()
1181 void buildSCCs(RefSCC &RC, node_stack_range Nodes);
H A DInterval.h49 Nodes.push_back(Header); in Interval()
55 std::vector<BasicBlock*> Nodes; variable
68 for (BasicBlock *Node : Nodes) in contains()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h354 SetVector<SUnit *> Nodes; variable
370 for (const SDep &Succ : Nodes[i]->Succs) in NodeSet()
371 if (Nodes.count(Succ.getSUnit())) in NodeSet()
375 bool insert(SUnit *SU) { return Nodes.insert(SU); } in insert()
380 return Nodes.remove_if(P); in remove_if()
387 unsigned size() const { return Nodes.size(); } in size()
389 bool empty() const { return Nodes.empty(); } in empty()
418 Nodes.clear(); in clear()
427 operator SetVector<SUnit *> &() { return Nodes; }
451 iterator begin() { return Nodes.begin(); } in begin()
[all …]
/freebsd-12.1/contrib/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h323 NodeArray Nodes;
331 : Nodes(*A.NodeAllocator), in FunctionCallTrie()
342 : Nodes(std::move(O.Nodes)), in FunctionCallTrie()
349 Nodes = std::move(O.Nodes);
373 auto *NewRoot = Nodes.AppendEmplace( in enterFunction()
378 Nodes.trim(1); in enterFunction()
382 Nodes.trim(1); in enterFunction()
407 auto* NewNode = Nodes.AppendEmplace( in enterFunction()
498 auto NewRoot = O.Nodes.AppendEmplace( in deepCopyInto()
519 auto NewNode = O.Nodes.AppendEmplace( in deepCopyInto()
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h76 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
81 const BoundNodes Nodes; member
280 Nodes.push_back(Result.Nodes); in run()
282 SmallVector<BoundNodes, 1> Nodes; variable
294 return std::move(Callback.Nodes); in match()
310 return std::move(Callback.Nodes); in match()
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DIntervalMap.h355 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()
1971 unsigned Nodes = 0; in overflow() local
1997 NewNode = Nodes == 1 ? 1 : Nodes - 1; in overflow()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h169 NodeVector Nodes; variable
182 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
183 return Nodes[NId]; in getNode()
186 assert(NId < Nodes.size() && "Out of bound NodeId"); in getNode()
187 return Nodes[NId]; in getNode()
198 Nodes[NId] = std::move(N); in addConstructedNode()
200 NId = Nodes.size(); in addConstructedNode()
201 Nodes.push_back(std::move(N)); in addConstructedNode()
292 bool empty() const { return G.Nodes.empty(); } in empty()
295 return G.Nodes.size() - G.FreeNodeIds.size(); in size()
[all …]
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp150 NodeVect Nodes; member in __anon833ff9130111::HexagonCommonGEP
376 Nodes.push_back(N); in processGepInst()
391 Nodes.push_back(Nx); in processGepInst()
436 for (const_iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in invert_find_roots()
451 Nodes.insert(Root); in nodes_for_root()
541 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
630 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
649 for (NodeVect::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) { in common()
663 Nodes.resize(std::distance(Nodes.begin(), NewE)); in common()
964 Nodes.push_back(NewN); in separateChainForNode()
[all …]
H A DHexagonISelDAGToDAG.h143 void ppSimplifyOrSelect0(std::vector<SDNode*> &&Nodes);
144 void ppAddrReorderAddShl(std::vector<SDNode*> &&Nodes);
145 void ppAddrRewriteAndSrl(std::vector<SDNode*> &&Nodes);
146 void ppHoistZextI1(std::vector<SDNode*> &&Nodes);
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h282 llvm::FoldingSet<ExplodedNode> Nodes; variable
347 void reserve(unsigned NodeCount) { Nodes.reserve(NodeCount); } in reserve()
359 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin()
361 node_iterator nodes_end() { return Nodes.end(); } in nodes_end()
363 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin()
365 const_node_iterator nodes_end() const { return Nodes.end(); } in nodes_end()
399 trim(ArrayRef<const NodeTy *> Nodes,
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp405 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
511 for (const BlockNode &N : Loop.Nodes) { in unwrapLoop()
630 Nodes.reserve(OuterLoop.Nodes.size()); in addNodesInLoop()
631 for (auto N : OuterLoop.Nodes) in addNodesInLoop()
645 for (auto &I : Nodes) in indexNodes()
764 for (const auto &N : Loop->Nodes) in createIrreducibleLoop()
796 auto O = OuterLoop.Nodes.begin() + 1; in updateLoopWithIrreducible()
797 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I) in updateLoopWithIrreducible()
800 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); in updateLoopWithIrreducible()
817 auto &HeaderNode = Loop.Nodes[H]; in adjustLoopHeaderMass()
H A DLazyCallGraph.cpp223 for (Node *N : Nodes) { in verify()
644 TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end()); in switchInternalEdgeToCall()
645 for (Node *N : C->Nodes) in switchInternalEdgeToCall()
730 Worklist.swap(OldSCC.Nodes); in switchInternalEdgeToRef()
745 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
795 OldSCC.Nodes.push_back(N); in switchInternalEdgeToRef()
1171 Worklist.append(C->Nodes.begin(), C->Nodes.end()); in removeInternalRefEdge()
1657 for (Node *N : Nodes) { in buildSCCs()
1674 [this, &RC](node_stack_range Nodes) { in buildSCCs() argument
1711 [this](node_stack_range Nodes) { in buildRefSCCs() argument
[all …]
H A DCallGraph.cpp94 SmallVector<CallGraphNode *, 16> Nodes; in print() local
95 Nodes.reserve(FunctionMap.size()); in print()
98 Nodes.push_back(I.second.get()); in print()
100 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
108 for (CallGraphNode *CN : Nodes) in print()
H A DIntervalPartition.cpp54 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); in addIntervalToPartition()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Tooling/
H A DRefactoringCallbacks.cpp91 if (const Stmt *FromMatch = Result.Nodes.getNodeAs<Stmt>(FromId)) { in run()
109 const Stmt *FromMatch = Result.Nodes.getNodeAs<Stmt>(FromId); in run()
110 const Stmt *ToMatch = Result.Nodes.getNodeAs<Stmt>(ToId); in run()
129 if (const IfStmt *Node = Result.Nodes.getNodeAs<IfStmt>(Id)) { in run()
201 const auto &NodeMap = Result.Nodes.getMap(); in run()
/freebsd-12.1/contrib/llvm/tools/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp73 BoundNodesTreeBuilder Nodes; member
411 *Builder = I->second.Nodes; in memoizedMatchesRecursively()
416 Result.Nodes = *Builder; in memoizedMatchesRecursively()
417 Result.ResultOfMatch = matchesRecursively(Node, Matcher, &Result.Nodes, in memoizedMatchesRecursively()
423 *Builder = CachedResult.Nodes; in memoizedMatchesRecursively()
651 *Builder = I->second.Nodes; in memoizedMatchesAncestorOfRecursively()
656 Result.Nodes = *Builder; in memoizedMatchesAncestorOfRecursively()
658 matchesAncestorOfRecursively(Node, Matcher, &Result.Nodes, MatchMode); in memoizedMatchesAncestorOfRecursively()
663 *Builder = CachedResult.Nodes; in memoizedMatchesAncestorOfRecursively()
940 MatchFinder::MatchResult::MatchResult(const BoundNodes &Nodes, in MatchResult() argument
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/
H A DCGProfile.cpp88 std::vector<Metadata *> Nodes; in addModuleFlags() local
95 Nodes.push_back(MDNode::get(Context, Vals)); in addModuleFlags()
98 M.addModuleFlag(Module::Append, "CG Profile", MDNode::get(Context, Nodes)); in addModuleFlags()
/freebsd-12.1/contrib/compiler-rt/lib/profile/
H A DInstrProfilingValue.c315 ValueProfNode **Nodes = (ValueProfNode **)Data->Values; in initializeValueProfRuntimeRecord() local
325 RTRecord.NodesKind[I] = Nodes ? &Nodes[S] : INSTR_PROF_NULLPTR; in initializeValueProfRuntimeRecord()
330 Nodes ? RTRecord.NodesKind[I][J] : INSTR_PROF_NULLPTR; in initializeValueProfRuntimeRecord()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DExprMutationAnalyzer.cpp77 for (const auto &Nodes : Matches) { in tryEachMatch() local
78 if (const Stmt *S = (Analyzer->*Finder)(Nodes.getNodeAs<T>(ID))) in tryEachMatch()
379 for (const auto &Nodes : Matches) { in findFunctionArgMutation() local
380 const auto *Exp = Nodes.getNodeAs<Expr>(NodeID<Expr>::value); in findFunctionArgMutation()
381 const auto *Func = Nodes.getNodeAs<FunctionDecl>("func"); in findFunctionArgMutation()
385 const auto *Parm = Nodes.getNodeAs<ParmVarDecl>("parm"); in findFunctionArgMutation()
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp166 Nodes.RemoveNode(node); in collectNode()
305 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos); in getNode()
323 Nodes.InsertNode(V, InsertPos); in getNode()
346 if (Nodes.empty()) in trim()

1234