Searched refs:Nodes (Results 1 - 25 of 78) sorted by relevance

1234

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h176 explicit DirectedGraph(NodeType &N) : Nodes() { addNode(N); }
177 DirectedGraph(const DGraphType &G) : Nodes(G.Nodes) {}
178 DirectedGraph(DGraphType &&RHS) : Nodes(std::move(RHS.Nodes)) {}
180 Nodes = G.Nodes;
184 Nodes = std::move(G.Nodes);
188 const_iterator begin() const { return Nodes
268 NodeListTy Nodes; variable
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h90 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
96 Nodes.assign(NewNodes.begin(), NewNodes.end());
99 bool isSingular() const { return Nodes.size() == 1; }
100 unsigned size() const { return Nodes.size(); }
108 iterator begin() const { return Nodes.begin(); }
109 iterator end() const { return Nodes.end(); }
H A DInterval.h48 Nodes.push_back(Header);
53 /// Nodes - The basic blocks in this interval.
54 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
67 for (BasicBlock *Node : Nodes)
72 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
H A DBlockFrequencyInfoImpl.h223 NodeList Nodes; ///< Header and the members of the loop. member in struct:llvm::BlockFrequencyInfoImplBase::LoopData
229 : Parent(Parent), Nodes(1, Header), BackedgeMass(1) {}
234 : Parent(Parent), Nodes(FirstHeader, LastHeader) {
235 NumHeaders = Nodes.size();
236 Nodes.insert(Nodes.end(), FirstOther, LastOther);
242 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders,
244 return Node == Nodes[0];
247 BlockNode getHeader() const { return Nodes[
616 std::vector<IrrNode> Nodes; member in struct:llvm::bfi_detail::IrreducibleGraph
859 DenseMap<const BlockT *, BlockNode> Nodes; member in class:llvm::BlockFrequencyInfoImpl
[all...]
H A DIntervalIterator.h73 Int->Nodes.push_back(BB);
84 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DIntervalMap.cpp119 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, argument
122 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
124 if (!Nodes)
128 const unsigned PerNode = (Elements + Grow) / Nodes;
129 const unsigned Extra = (Elements + Grow) % Nodes;
130 IdxPair PosPair = IdxPair(Nodes, 0);
132 for (unsigned n = 0; n != Nodes; ++n) {
134 if (PosPair.first == Nodes && Sum > Position)
141 assert(PosPair.first < Nodes && "Bad algebra");
148 for (unsigned n = 0; n != Nodes;
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DInterval.cpp41 for (const BasicBlock *Node : Nodes)
H A DIntervalPartition.cpp58 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
H A DCallGraph.cpp93 SmallVector<CallGraphNode *, 16> Nodes; local
94 Nodes.reserve(FunctionMap.size());
97 Nodes.push_back(I.second.get());
99 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) {
107 for (CallGraphNode *CN : Nodes)
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DNumberObjectConversionChecker.cpp66 (Result.Nodes.getNodeAs<Stmt>("pedantic") != nullptr);
73 Result.Nodes.getNodeAs<Expr>("check_if_null")) {
102 const Stmt *Conv = Result.Nodes.getNodeAs<Stmt>("conv");
105 const Expr *ConvertedCObject = Result.Nodes.getNodeAs<Expr>("c_object");
106 const Expr *ConvertedCppObject = Result.Nodes.getNodeAs<Expr>("cpp_object");
107 const Expr *ConvertedObjCObject = Result.Nodes.getNodeAs<Expr>("objc_object");
116 (Result.Nodes.getNodeAs<Stmt>("comparison") != nullptr);
119 (Result.Nodes.getNodeAs<Decl>("osnumber") != nullptr);
122 (Result.Nodes.getNodeAs<QualType>("int_type") != nullptr);
124 (Result.Nodes
[all...]
H A DOSObjectCStyleCast.cpp37 static void emitDiagnostics(const BoundNodes &Nodes, argument
41 const auto *CE = Nodes.getNodeAs<CastExpr>(WarnAtNode);
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h25 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
75 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
80 const BoundNodes Nodes; member in struct:clang::ast_matchers::MatchFinder::MatchResult
279 Nodes.push_back(Result.Nodes);
281 SmallVector<BoundNodes, 1> Nodes; member in class:clang::ast_matchers::internal::CollectMatchesCallback
293 return std::move(Callback.Nodes);
309 return std::move(Callback.Nodes);
319 return std::move(Callback.Nodes);
336 return std::move(Callback.Nodes);
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/
H A DASTImporter.h180 Nodes.push_back(D);
185 if (Nodes.empty())
187 --Aux[Nodes.back()];
188 Nodes.pop_back();
193 auto Pos = Aux.find(Nodes.back());
199 assert(Nodes.size() >= 2);
200 return Cycle(Nodes.rbegin(),
201 std::find(Nodes.rbegin() + 1, Nodes.rend(), Nodes
213 VecTy Nodes; member in class:clang::ASTImporter::ImportPathTy
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DCGProfile.cpp87 std::vector<Metadata *> Nodes; local
94 Nodes.push_back(MDNode::get(Context, Vals));
97 M.addModuleFlag(Module::Append, "CG Profile", MDNode::get(Context, Nodes));
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h318 SetVector<SUnit *> Nodes; member in class:llvm::NodeSet
331 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) {
333 for (unsigned i = 0, e = Nodes.size(); i < e; ++i)
334 for (const SDep &Succ : Nodes[i]->Succs)
335 if (Nodes.count(Succ.getSUnit()))
339 bool insert(SUnit *SU) { return Nodes.insert(SU); }
341 void insert(iterator S, iterator E) { Nodes.insert(S, E); }
344 return Nodes.remove_if(P);
347 unsigned count(SUnit *SU) const { return Nodes.count(SU); }
351 unsigned size() const { return Nodes
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp173 for (DGNode &N : Nodes) {
184 Nodes[Edge.ToIID].NumPredecessors--;
197 for (unsigned I = 0, E = Nodes.size(); I < E; ++I) {
198 const DGNode &N = Nodes[I];
240 const DGNode &N = Nodes[IID];
243 DGNode &To = Nodes[ToIID];
276 Nodes.begin(), Nodes.end(),
278 unsigned IID = std::distance(Nodes.begin(), It);
279 Seq.resize(Nodes[II
[all...]
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h322 NodeArray Nodes; member in class:__xray::FunctionCallTrie
330 : Nodes(*A.NodeAllocator), member in class:__xray::FunctionCallTrie
341 : Nodes(std::move(O.Nodes)),
348 Nodes = std::move(O.Nodes);
372 auto *NewRoot = Nodes.AppendEmplace(
377 Nodes.trim(1);
381 Nodes.trim(1);
406 auto* NewNode = Nodes
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h168 NodeVector Nodes;
181 assert(NId < Nodes.size() && "Out of bound NodeId");
182 return Nodes[NId];
185 assert(NId < Nodes.size() && "Out of bound NodeId");
186 return Nodes[NId];
197 Nodes[NId] = std::move(N);
199 NId = Nodes.size();
200 Nodes.push_back(std::move(N));
239 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) {
289 NodeItr end() const { return NodeItr(G.Nodes
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/
H A DRefactoringCallbacks.cpp90 if (const Stmt *FromMatch = Result.Nodes.getNodeAs<Stmt>(FromId)) {
108 const Stmt *FromMatch = Result.Nodes.getNodeAs<Stmt>(FromId);
109 const Stmt *ToMatch = Result.Nodes.getNodeAs<Stmt>(ToId);
128 if (const IfStmt *Node = Result.Nodes.getNodeAs<IfStmt>(Id)) {
200 const auto &NodeMap = Result.Nodes.getMap();
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/Transformer/
H A DMatchConsumer.h50 auto &Map = Result.Nodes.getMap();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
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);
H A DRDFDeadCode.h39 bool erase(const SetVector<NodeId> &Nodes);
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/profile/
H A DInstrProfilingValue.c314 ValueProfNode **Nodes = (ValueProfNode **)Data->Values; local
324 RTRecord.NodesKind[I] = Nodes ? &Nodes[S] : INSTR_PROF_NULLPTR;
329 Nodes ? RTRecord.NodesKind[I][J] : INSTR_PROF_NULLPTR;
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/Transformer/
H A DRangeSelector.cpp55 static Expected<DynTypedNode> getNode(const ast_matchers::BoundNodes &Nodes, argument
57 auto &NodesMap = Nodes.getMap();
131 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID);
143 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID);
176 Expected<DynTypedNode> Node = getNode(Result.Nodes, ID);
188 Expected<DynTypedNode> N = getNode(Result.Nodes, ID);
238 Expected<DynTypedNode> N = getNode(Result.Nodes, ID);
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h321 /// Nodes - The nodes in the graph.
322 llvm::FoldingSet<ExplodedNode> Nodes; member in class:clang::ento::ExplodedGraph
388 void reserve(unsigned NodeCount) { Nodes.reserve(NodeCount); }
400 node_iterator nodes_begin() { return Nodes.begin(); }
402 node_iterator nodes_end() { return Nodes.end(); }
404 const_node_iterator nodes_begin() const { return Nodes.begin(); }
406 const_node_iterator nodes_end() const { return Nodes.end(); }
432 /// \param Nodes The nodes which must appear in the final graph. Presumably
440 trim(ArrayRef<const NodeTy *> Nodes,

Completed in 164 milliseconds

1234