Home
last modified time | relevance | path

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

12

/openbsd-src/gnu/llvm/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp40 SrcToDst = std::make_unique<NodeId[]>(Size); in Mapping()
41 DstToSrc = std::make_unique<NodeId[]>(Size); in Mapping()
44 void link(NodeId Src, NodeId Dst) { in link()
48 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
49 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
50 bool hasSrc(NodeId Src) const { return getDst(Src).isValid(); } in hasSrc()
51 bool hasDst(NodeId Dst) const { return getSrc(Dst).isValid(); } in hasDst()
54 std::unique_ptr<NodeId[]> SrcToDst, DstToSrc;
72 NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree, in getMapped()
73 NodeId Id) const { in getMapped()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h28 using NodeId = unsigned;
32 static NodeId invalidNodeId() { in invalidNodeId()
33 return std::numeric_limits<NodeId>::max(); in invalidNodeId()
80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry()
123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
149 NodeId getN1Id() const { return NIds[0]; } in getN1Id()
150 NodeId getN2Id() const { return NIds[1]; } in getN2Id()
156 NodeId NIds[2];
[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()
/openbsd-src/gnu/llvm/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);
H A DHexagonOptAddrMode.cpp170 NodeId OffsetRegRD = 0; in canRemoveAddasl()
265 NodeId id = PA.Id; in getAllRealUses()
290 NodeId LRExtRegRD = 0; in isSafeToExtLR()
454 NodeId LRExtRegRD = 0; in processAddUses()
/openbsd-src/gnu/llvm/clang/include/clang/Tooling/ASTDiff/
H A DASTDiff.h39 NodeId Parent, LeftMostDescendant, RightMostDescendant;
42 SmallVector<NodeId, 4> Children;
69 NodeId getRootId() const;
70 using PreorderIterator = NodeId;
74 const Node &getNode(NodeId Id) const;
75 int findPositionInParent(NodeId Id) const;
83 std::string getNodeValue(NodeId Id) const;
116 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; }
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h148 void setNodeIdForVReg(Register VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
152 GraphBase::NodeId getNodeIdForVReg(Register VReg) const { in getNodeIdForVReg()
164 DenseMap<Register, GraphBase::NodeId> VRegToNodeId;
281 using NodeId = GraphBase::NodeId; variable
301 void handleAddNode(NodeId NId) { in handleAddNode()
307 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
308 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
315 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
322 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
329 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
[all …]
H A DRDFGraph.h261 using NodeId = uint32_t; variable
337 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr()
353 NodeId Id = 0;
384 NodeBase *ptr(NodeId N) const { in ptr()
391 NodeId id(const NodeBase *P) const;
458 NodeId getNext() const { return Next; } in getNext()
470 void setNext(NodeId N) { Next = N; } in setNext()
475 NodeId Next; // Id of the next node in the circular chain.
480 NodeId DD, DU; // Ids of the first reached def and use.
483 NodeId PredB; // Id of the predecessor block for a phi use.
[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;
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DRDFLiveness.cpp112 SetVector<NodeId> DefQ; in getAllReachingDefs()
126 NodeId Start = RefA.Id; in getAllReachingDefs()
128 if (NodeId RD = SNA.Addr->getReachingDef()) in getAllReachingDefs()
132 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
154 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
171 SmallSet<NodeId,32> Defs; in getAllReachingDefs()
175 std::map<NodeId, NodeAddr<InstrNode*>> Owners; in getAllReachingDefs()
176 std::map<MachineBasicBlock*, SmallVector<NodeId,32>> Blocks; in getAllReachingDefs()
177 for (NodeId N : DefQ) { in getAllReachingDefs()
188 auto Precedes = [this,&OrdMap] (NodeId A, NodeId B) { in getAllReachingDefs()
[all …]
H A DRegAllocPBQP.cpp220 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
223 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
224 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs()
238 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
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()
[all …]
H A DRDFGraph.cpp65 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) { in operator <<()
117 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
120 if (NodeId N = P.Obj.Addr->getReachedDef()) in operator <<()
123 if (NodeId N = P.Obj.Addr->getReachedUse()) in operator <<()
126 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
134 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
137 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
146 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
149 if (NodeId N = P.Obj.Addr->getPredecessor()) in operator <<()
152 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
[all …]
/openbsd-src/gnu/llvm/clang/tools/clang-diff/
H A DClangDiff.cpp268 diff::NodeId Id, unsigned Offset) { in printHtmlForNode()
271 diff::NodeId LeftId, RightId; in printHtmlForNode()
272 diff::NodeId TargetId = Diff.getMapped(Tree, Id); in printHtmlForNode()
305 for (diff::NodeId Child : Node.Children) in printHtmlForNode()
345 diff::NodeId Id) {
/openbsd-src/gnu/llvm/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp173 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint()
174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint()
260 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint()
273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint()
/openbsd-src/gnu/llvm/clang/lib/Tooling/Transformer/
H A DRewriteRule.cpp344 EditGenerator transformer::rewriteDescendants(std::string NodeId, in rewriteDescendants() argument
346 return [NodeId = std::move(NodeId), in rewriteDescendants()
351 auto It = NodesMap.find(NodeId); in rewriteDescendants()
354 "ID not bound: " + NodeId); in rewriteDescendants()
/openbsd-src/gnu/llvm/llvm/lib/IR/
H A DModuleSummaryIndex.cpp547 auto NodeId = [](uint64_t ModId, GlobalValue::GUID Id) { in exportToDot() local
574 OS << Pfx << NodeId(SrcMod, SrcId) << " -> " << NodeId(DstMod, DstId) in exportToDot()
631 OS << " " << NodeId(ModId, SummaryIt.first) << " " << A.getAsString() in exportToDot()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp406 int NodeId = User->getNodeId(); in run() local
410 if (NodeId > 0) { in run()
411 User->setNodeId(NodeId-1); in run()
414 if (NodeId-1 == ReadyToProcess) in run()
422 if (NodeId == NewNode) in run()
428 assert(NodeId == Unanalyzed && "Unknown node ID!"); in run()
/openbsd-src/gnu/llvm/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp357 DenseMap<NodeId, std::vector<NodeId>> Transmitters; in getGadgetGraph()
362 SmallSet<NodeId, 8> UsesVisited, DefsVisited; in getGadgetGraph()
/openbsd-src/gnu/llvm/clang/include/clang/Tooling/Transformer/
H A DRewriteRule.h466 EditGenerator rewriteDescendants(std::string NodeId, RewriteRule Rule);

12