Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/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 DRDFCopy.h48 std::map<RegisterRef,std::map<NodeId,NodeId>> RDefMap;
50 std::map<NodeId, EqualityMap> CopyMap;
51 std::vector<NodeId> Copies;
H A DHexagonRDFOpt.cpp100 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
159 const SetVector<NodeId> &DeadNodes = getDeadNodes(); in run()
160 const SetVector<NodeId> &DeadInstrs = getDeadInstrs(); in run()
162 using RefToInstrMap = DenseMap<NodeId, NodeId>; in run()
165 SetVector<NodeId> PartlyDead; in run()
181 SetVector<NodeId> Remove = DeadInstrs; in run()
184 for (NodeId N : PartlyDead) { in run()
203 DenseMap<NodeId,unsigned> OpMap; in removeOperand()
220 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
H A DRDFDeadCode.cpp84 SetQueue<NodeId> &WorkQ) { in scanInstr()
96 SetQueue<NodeId> &WorkQ) { in processDef()
107 SetQueue<NodeId> &WorkQ) { in processUse()
128 SetQueue<NodeId> WorkQ; in collect()
134 NodeId N = WorkQ.pop_front(); in collect()
145 for (NodeId N : LiveNodes) { in collect()
180 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) { in erase()
H A DRDFCopy.cpp134 for (NodeId I : Copies) { in run()
148 dbgs() << ' ' << Print<NodeId>(M.first, DFG) << ':' in run()
149 << Print<NodeId>(M.second, DFG); in run()
173 for (NodeId C : Copies) { in run()
194 NodeId RDefSR_SA = RDefSR[SA.Id]; in run()
196 for (NodeId N = DA.Addr->getReachedUse(), NextN; N; N = NextN) { in run()
H A DHexagonOptAddrMode.cpp172 NodeId OffsetRegRD = 0; in canRemoveAddasl()
267 NodeId id = PA.Id; in getAllRealUses()
292 NodeId LRExtRegRD = 0; in isSafeToExtLR()
456 NodeId LRExtRegRD = 0; in processAddUses()
/freebsd/contrib/llvm-project/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.h262 using NodeId = uint32_t; variable
346 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr()
362 NodeId Id = 0;
421 NodeBase *ptr(NodeId N) const { in ptr()
428 NodeId id(const NodeBase *P) const;
495 NodeId getNext() const { return Next; } in getNext()
507 void setNext(NodeId N) { Next = N; } in setNext()
512 NodeId Next; // Id of the next node in the circular chain.
517 NodeId DD, DU; // Ids of the first reached def and use.
520 NodeId PredB; // Id of the predecessor block for a phi use.
[all …]
H A DRDFLiveness.h36 using NodeRef = std::pair<NodeId, LaneBitmask>;
46 return std::hash<llvm::rdf::NodeId>{}(R.first) ^
97 const RefMap &getRealUses(NodeId P) const {
124 DenseMap<NodeId, MachineBasicBlock *> NBMap;
131 DenseMap<NodeId, RefMap> RealUseMap;
146 MachineBasicBlock *getBlockWithRef(NodeId RN) const;
H A DSelectionDAGNodes.h623 int NodeId = -1;
751 int getNodeId() const { return NodeId; }
754 void setNodeId(int Id) { NodeId = Id; }
/freebsd/contrib/llvm-project/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() function
32 NodeId &operator++() { return ++Id, *this; }
33 NodeId &operator--() { return --Id, *this; }
35 NodeId &operator*() { return *this; }
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRDFLiveness.cpp109 SetVector<NodeId> DefQ; in getAllReachingDefs()
123 NodeId Start = RefA.Id; in getAllReachingDefs()
125 if (NodeId RD = SNA.Addr->getReachingDef()) in getAllReachingDefs()
129 if (NodeId RD = NodeAddr<RefNode *>(S).Addr->getReachingDef()) in getAllReachingDefs()
151 if (NodeId RD = NodeAddr<RefNode *>(S).Addr->getReachingDef()) in getAllReachingDefs()
168 SmallSet<NodeId, 32> Defs; in getAllReachingDefs()
172 std::map<NodeId, NodeAddr<InstrNode *>> Owners; in getAllReachingDefs()
173 std::map<MachineBasicBlock *, SmallVector<NodeId, 32>> Blocks; in getAllReachingDefs()
174 for (NodeId N : DefQ) { in getAllReachingDefs()
185 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.cpp50 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeId> &P) { in operator <<()
121 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
124 if (NodeId N = P.Obj.Addr->getReachedDef()) in operator <<()
127 if (NodeId N = P.Obj.Addr->getReachedUse()) in operator <<()
130 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
138 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
141 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
149 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
152 if (NodeId N = P.Obj.Addr->getPredecessor()) in operator <<()
155 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp168 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint()
169 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint()
255 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint()
268 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint()
/freebsd/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp403 int NodeId = User->getNodeId(); in run() local
407 if (NodeId > 0) { in run()
408 User->setNodeId(NodeId-1); in run()
411 if (NodeId-1 == ReadyToProcess) in run()
419 if (NodeId == NewNode) in run()
425 assert(NodeId == Unanalyzed && "Unknown node ID!"); in run()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DModuleSummaryIndex.cpp570 auto NodeId = [](uint64_t ModId, GlobalValue::GUID Id) { in exportToDot() local
597 OS << Pfx << NodeId(SrcMod, SrcId) << " -> " << NodeId(DstMod, DstId) in exportToDot()
661 OS << " " << NodeId(ModId, SummaryIt.first) << " " << A.getAsString() in exportToDot()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp356 DenseMap<NodeId, std::vector<NodeId>> Transmitters; in getGadgetGraph()
361 SmallSet<NodeId, 8> UsesVisited, DefsVisited; in getGadgetGraph()
/freebsd/contrib/llvm-project/clang/include/clang/Tooling/Transformer/
H A DRewriteRule.h466 EditGenerator rewriteDescendants(std::string NodeId, RewriteRule Rule);
/freebsd/sys/contrib/dev/acpica/include/
H A Dactbl2.h1981 UINT16 NodeId; member

12