Home
last modified time | relevance | path

Searched refs:NodeId (Results 1 – 25 of 36) sorted by relevance

12

/llvm-project-15.0.7/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
81 bool identical(NodeId Id1, NodeId Id2) const;
84 bool isMatchingPossible(NodeId Id1, NodeId Id2) const;
98 NodeId findCandidate(const Mapping &M, NodeId Id1) const;
149 bool isInSubtree(NodeId Id, NodeId SubtreeRoot) const;
215 void PostTraverse(std::tuple<NodeId, NodeId> State) { in PostTraverse()
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder()
580 std::vector<std::pair<NodeId, NodeId>> Matches; in getMatchingNodes()
[all …]
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DCallGraph.h31 using NodeId = size_t;
54 Arc(NodeId S, NodeId D, double W = 0) : Src(S), Dst(D), Weight(W) {} in Src()
69 NodeId Src{InvalidId};
70 NodeId Dst{InvalidId};
98 std::vector<NodeId> Preds;
99 std::vector<NodeId> Succs;
116 const std::vector<NodeId> &successors(const NodeId Id) const { in successors()
120 const std::vector<NodeId> &predecessors(const NodeId Id) const { in predecessors()
125 const Arc &incArcWeight(NodeId Src, NodeId Dst, double W = 1.0,
127 ArcIterator findArc(NodeId Src, NodeId Dst) { in findArc()
[all …]
H A DBinaryFunctionCallGraph.h25 NodeId maybeGetNodeId(const BinaryFunction *BF) const { in maybeGetNodeId()
29 NodeId getNodeId(const BinaryFunction *BF) const { in getNodeId()
34 BinaryFunction *nodeIdToFunc(NodeId Id) { in nodeIdToFunc()
38 const BinaryFunction *nodeIdToFunc(NodeId Id) const { in nodeIdToFunc()
42 NodeId addNode(BinaryFunction *BF, uint32_t Size, uint64_t Samples = 0);
48 std::unordered_map<const BinaryFunction *, NodeId> FuncToNodeId;
H A DHFSort.h33 Cluster(CallGraph::NodeId Id, const CallGraph::Node &F);
34 Cluster(const std::vector<CallGraph::NodeId> &Nodes, const CallGraph &Cg);
44 const std::vector<CallGraph::NodeId> &Targets_);
47 const std::vector<CallGraph::NodeId> &targets() const { return Targets; } in targets()
48 CallGraph::NodeId target(size_t N) const { return Targets[N]; } in target()
62 std::vector<CallGraph::NodeId> Targets;
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h28 using NodeId = unsigned;
32 static NodeId invalidNodeId() { in invalidNodeId()
103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry()
156 NodeId NIds[2];
193 NodeId NId = 0; in addConstructedNode()
249 NodeId findNextInUse(NodeId NId) const { in findNextInUse()
256 NodeId CurNId, EndNId;
409 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { in addEdge()
434 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, in addEdgeBypassingCostAllocator()
560 NodeId getEdgeOtherNodeId(EdgeId EId, NodeId NId) { in getEdgeOtherNodeId()
[all …]
H A DReductionRules.h30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
31 using NodeId = typename GraphT::NodeId; in applyR1() local
41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
75 using NodeId = typename GraphT::NodeId; in applyR2() local
90 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId), in applyR2()
181 using NodeId = GraphBase::NodeId; in backpropagate() local
188 NodeId NId = stack.back(); in backpropagate()
205 NodeId mId = G.getEdgeNode2Id(EId); in backpropagate()
208 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
H A DSolution.h28 using SelectionsMap = std::map<GraphBase::NodeId, unsigned>;
38 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { in setSelection()
45 unsigned getSelection(GraphBase::NodeId nodeId) const { in getSelection()
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.h39 bool erase(const SetVector<NodeId> &Nodes);
43 SetVector<NodeId> getDeadNodes() { return DeadNodes; } in getDeadNodes()
44 SetVector<NodeId> getDeadInstrs() { return DeadInstrs; } in getDeadInstrs()
49 SetVector<NodeId> LiveNodes;
50 SetVector<NodeId> DeadNodes;
51 SetVector<NodeId> DeadInstrs;
59 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
60 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
61 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
H A DHexagonRDFOpt.cpp95 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
154 const SetVector<NodeId> &DeadNodes = getDeadNodes(); in run()
155 const SetVector<NodeId> &DeadInstrs = getDeadInstrs(); in run()
157 using RefToInstrMap = DenseMap<NodeId, NodeId>; in run()
160 SetVector<NodeId> PartlyDead; in run()
176 SetVector<NodeId> Remove = DeadInstrs; in run()
179 for (NodeId N : PartlyDead) { in run()
198 DenseMap<NodeId,unsigned> OpMap; in removeOperand()
215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
H A DRDFCopy.cpp88 NodeId CopyPropagation::getLocalReachingDef(RegisterRef RefRR, in getLocalReachingDef()
95 if (NodeId RD = RA.Addr->getReachingDef()) in getLocalReachingDef()
106 for (NodeId I : Copies) { in run()
133 for (NodeId C : Copies) { in run()
153 NodeId AtCopy = getLocalReachingDef(SR, SA); in run()
155 for (NodeId N = DA.Addr->getReachedUse(), NextN; N; N = NextN) { in run()
166 NodeId AtUse = getLocalReachingDef(SR, IA); in run()
H A DRDFDeadCode.cpp83 SetQueue<NodeId> &WorkQ) { in scanInstr()
95 SetQueue<NodeId> &WorkQ) { in processDef()
106 SetQueue<NodeId> &WorkQ) { in processUse()
127 SetQueue<NodeId> WorkQ; in collect()
133 NodeId N = WorkQ.pop_front(); in collect()
144 for (NodeId N : LiveNodes) { in collect()
179 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) { in erase()
H A DRDFCopy.h49 std::map<NodeId, EqualityMap> CopyMap;
50 std::vector<NodeId> Copies;
54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSort.cpp30 using NodeId = CallGraph::NodeId; typedef
53 Cluster::Cluster(NodeId Id, const Node &Func) in Cluster()
62 for (NodeId TargetId : Nodes) { in Cluster()
75 for (const NodeId &Target : Targets) { in toString()
96 LLVM_DEBUG(NodeId Fid = C.target(0); in freezeClusters()
132 std::vector<NodeId> SortedFuncs; in clusterize()
153 llvm::sort(SortedFuncs, [&](const NodeId F1, const NodeId F2) { in clusterize()
162 for (const NodeId Fid : SortedFuncs) { in clusterize()
168 NodeId BestPred = CallGraph::InvalidId; in clusterize()
216 for (NodeId F : Cluster->targets()) in clusterize()
[all …]
H A DCallGraph.cpp76 CallGraph::NodeId CallGraph::addNode(uint32_t Size, uint64_t Samples) { in addNode()
77 NodeId Id = Nodes.size(); in addNode()
82 const CallGraph::Arc &CallGraph::incArcWeight(NodeId Src, NodeId Dst, double W, in incArcWeight()
99 for (NodeId FuncId = 0; FuncId < numNodes(); ++FuncId) { in normalizeArcWeights()
101 for (NodeId Caller : Func.predecessors()) { in normalizeArcWeights()
113 for (NodeId FuncId = 0; FuncId < numNodes(); ++FuncId) { in adjustArcWeights()
116 for (NodeId Caller : Func.predecessors()) { in adjustArcWeights()
H A DPettisAndHansen.cpp25 using NodeId = CallGraph::NodeId; typedef
55 NodeId C1head = C1->targets().front(); in orderFuncs()
56 NodeId C1tail = C1->targets().back(); in orderFuncs()
57 NodeId C2head = C2->targets().front(); in orderFuncs()
58 NodeId C2tail = C2->targets().back(); in orderFuncs()
101 std::vector<NodeId> Funcs; in pettisAndHansen()
105 for (NodeId F = 0; F < Cg.numNodes(); F++) { in pettisAndHansen()
192 for (NodeId F : C2->targets()) in pettisAndHansen()
205 for (NodeId Fid : Funcs) in pettisAndHansen()
H A DBinaryFunctionCallGraph.cpp30 CallGraph::NodeId BinaryFunctionCallGraph::addNode(BinaryFunction *BF, in addNode()
33 NodeId Id = CallGraph::addNode(Size, Samples); in addNode()
47 std::stack<NodeId> Worklist; in buildTraversalOrder()
50 const NodeId Id = FuncToNodeId.at(Func); in buildTraversalOrder()
56 const NodeId FuncId = Worklist.top(); in buildTraversalOrder()
71 for (const NodeId Callee : successors(FuncId)) { in buildTraversalOrder()
101 const CallGraph::NodeId Id = Cg.maybeGetNodeId(Function); in buildCallGraph()
133 const CallGraph::NodeId SrcId = lookupNode(Function); in buildCallGraph()
150 const CallGraph::NodeId DstId = lookupNode(DstFunc); in buildCallGraph()
H A DHFSortPlus.cpp70 using NodeId = CallGraph::NodeId; typedef
86 explicit Chain(size_t Id_, NodeId Node, size_t Samples_, size_t Size_) in Chain()
133 std::vector<NodeId> Nodes;
271 for (NodeId F = 0; F < Cg.numNodes(); ++F) { in initialize()
276 for (NodeId Succ : Cg.successors(F)) { in initialize()
286 for (NodeId F = 0; F < Cg.numNodes(); ++F) { in initialize()
287 for (NodeId Succ : Cg.successors(F)) { in initialize()
427 NodeId F = ChainPred->Nodes.back(); in runPassOne()
428 for (NodeId Succ : Cg.successors(F)) { in runPassOne()
555 for (NodeId F : Into->Nodes) { in mergeChains()
/llvm-project-15.0.7/clang/include/clang/Tooling/ASTDiff/
H A DASTDiff.h38 NodeId Parent, LeftMostDescendant, RightMostDescendant;
41 SmallVector<NodeId, 4> Children;
68 NodeId getRootId() const;
69 using PreorderIterator = NodeId;
73 const Node &getNode(NodeId Id) const;
74 int findPositionInParent(NodeId Id) const;
82 std::string getNodeValue(NodeId Id) const;
115 NodeId getMapped(const SyntaxTree &SourceTree, NodeId Id) const;
H A DASTDiffInternal.h21 struct NodeId { struct
28 NodeId() : Id(InvalidNodeId) {} in NodeId() function
29 NodeId(int Id) : Id(Id) {} in NodeId() argument
32 NodeId &operator++() { return ++Id, *this; }
33 NodeId &operator--() { return --Id, *this; }
35 NodeId &operator*() { return *this; }
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h281 using NodeId = GraphBase::NodeId; variable
301 void handleAddNode(NodeId NId) { in handleAddNode()
307 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
329 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
431 using NodeId = GraphBase::NodeId; in reduce() local
432 std::vector<NodeId> NodeStack; in reduce()
438 NodeId NId = *NItr; in reduce()
460 NodeId NId = *NItr; in reduce()
469 NodeId NId = *NItr; in reduce()
484 bool operator()(NodeId N1Id, NodeId N2Id) { in operator()
[all …]
H A DRDFGraph.h260 using NodeId = uint32_t; variable
352 NodeId Id = 0;
535 NodeId getSibling() const { in getSibling()
538 void setSibling(NodeId Sib) { in setSibling()
559 NodeId getReachedDef() const { in getReachedDef()
562 void setReachedDef(NodeId D) { in setReachedDef()
565 NodeId getReachedUse() const { in getReachedUse()
568 void setReachedUse(NodeId U) { in setReachedUse()
649 NodeBase *ptr(NodeId N) const;
713 void start_block(NodeId N);
[all …]
H A DRDFLiveness.h39 using NodeRef = std::pair<NodeId, LaneBitmask>;
49 return std::hash<llvm::rdf::NodeId>{}(R.first) ^
111 const RefMap &getRealUses(NodeId P) const {
138 DenseMap<NodeId, MachineBasicBlock *> NBMap;
145 DenseMap<NodeId, RefMap> RealUseMap;
160 MachineBasicBlock *getBlockWithRef(NodeId RN) const;
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DRDFLiveness.cpp112 SetVector<NodeId> DefQ; in getAllReachingDefs()
126 NodeId Start = RefA.Id; in getAllReachingDefs()
171 SmallSet<NodeId,32> Defs; in getAllReachingDefs()
177 for (NodeId N : DefQ) { in getAllReachingDefs()
188 auto Precedes = [this,&OrdMap] (NodeId A, NodeId B) { in getAllReachingDefs()
239 std::vector<NodeId> TmpInst; in getAllReachingDefs()
269 for (NodeId T : TmpInst) { in getAllReachingDefs()
321 for (NodeId D : Defs) { in getAllReachingDefsRecImpl()
364 NodeId FindId = IA.Id; in getNearestAliasedRef()
475 std::map<NodeId,std::map<NodeId,RegisterAggr>> PhiUp; in computePhiInfo()
[all …]
H A DRDFGraph.cpp118 OS << Print<NodeId>(N, P.G); in operator <<()
121 OS << Print<NodeId>(N, P.G); in operator <<()
124 OS << Print<NodeId>(N, P.G); in operator <<()
127 OS << Print<NodeId>(N, P.G); in operator <<()
135 OS << Print<NodeId>(N, P.G); in operator <<()
138 OS << Print<NodeId>(N, P.G); in operator <<()
395 NodeId Nx = Next; in append()
478 NodeId Self = G.id(this); in addMember()
1116 NodeId Start = RA.Id; in getRelatedRefs()
1181 NodeId Start = RA.Id; in locateNextRef()
[all …]
H A DRegAllocPBQP.cpp220 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
224 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs()
239 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs()
257 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>;
267 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
364 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
366 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()
397 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
682 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph()
909 NodeId N1Id = getEdgeNode1Id(EId); in dump()
[all …]

12