Home
last modified time | relevance | path

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

/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/ASTDiff/
HDASTDiff.cpp38 SrcToDst = std::make_unique<NodeId[]>(Size); in Mapping()
39 DstToSrc = std::make_unique<NodeId[]>(Size); in Mapping()
42 void link(NodeId Src, NodeId Dst) { in link()
46 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
47 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
48 bool hasSrc(NodeId Src) const { return getDst(Src).isValid(); } in hasSrc()
49 bool hasDst(NodeId Dst) const { return getSrc(Dst).isValid(); } in hasDst()
52 std::unique_ptr<NodeId[]> SrcToDst, DstToSrc;
70 NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree, in getMapped()
71 NodeId Id) const { in getMapped()
[all …]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
HDGraph.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 …]
HDReductionRules.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()
HDSolution.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-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
HDRDFDeadCode.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);
HDHexagonRDFOpt.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()
HDRDFCopy.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()
HDRDFDeadCode.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()
HDRDFCopy.h49 std::map<NodeId, EqualityMap> CopyMap;
50 std::vector<NodeId> Copies;
54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
HDHexagonOptAddrMode.cpp168 NodeId OffsetRegRD = 0; in canRemoveAddasl()
263 NodeId id = PA.Id; in getAllRealUses()
288 NodeId LRExtRegRD = 0; in isSafeToExtLR()
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
HDRegAllocPBQP.h146 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
150 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { in getNodeIdForVReg()
162 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
278 using NodeId = GraphBase::NodeId; variable
298 void handleAddNode(NodeId NId) { in handleAddNode()
304 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
305 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
312 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
319 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
326 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
[all …]
HDRDFGraph.h260 using NodeId = uint32_t; variable
336 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr()
352 NodeId Id = 0;
383 NodeBase *ptr(NodeId N) const { in ptr()
390 NodeId id(const NodeBase *P) const;
457 NodeId getNext() const { return Next; } in getNext()
469 void setNext(NodeId N) { Next = N; } in setNext()
474 NodeId Next; // Id of the next node in the circular chain.
479 NodeId DD, DU; // Ids of the first reached def and use.
482 NodeId PredB; // Id of the predecessor block for a phi use.
[all …]
HDRDFLiveness.h49 using NodeRef = std::pair<NodeId, LaneBitmask>;
86 const RefMap &getRealUses(NodeId P) const { in getRealUses()
113 using NodeBlockMap = DenseMap<NodeId, MachineBasicBlock *>;
121 std::map<NodeId, RefMap> RealUseMap;
136 MachineBasicBlock *getBlockWithRef(NodeId RN) const;
HDSelectionDAGNodes.h619 int NodeId = -1;
741 int getNodeId() const { return NodeId; }
744 void setNodeId(int Id) { NodeId = Id; }
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/ASTDiff/
HDASTDiff.h38 NodeId Parent, LeftMostDescendant, RightMostDescendant;
41 SmallVector<NodeId, 4> Children;
57 NodeId getMapped(const SyntaxTree &SourceTree, NodeId Id) const;
82 NodeId getRootId() const;
83 using PreorderIterator = NodeId;
87 const Node &getNode(NodeId Id) const;
88 int findPositionInParent(NodeId Id) const;
96 std::string getNodeValue(NodeId Id) const;
HDASTDiffInternal.h25 struct NodeId { struct
32 NodeId() : Id(InvalidNodeId) {} in NodeId() function
33 NodeId(int Id) : Id(Id) {} in NodeId() argument
36 NodeId &operator++() { return ++Id, *this; }
37 NodeId &operator--() { return --Id, *this; }
39 NodeId &operator*() { return *this; }
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
HDRDFLiveness.cpp65 OS << Print<NodeId>(J->first, P.G) << PrintLaneMaskOpt(J->second); in operator <<()
110 SetVector<NodeId> DefQ; in getAllReachingDefs()
111 SetVector<NodeId> Owners; in getAllReachingDefs()
124 NodeId Start = RefA.Id; in getAllReachingDefs()
126 if (NodeId RD = SNA.Addr->getReachingDef()) in getAllReachingDefs()
130 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
152 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
158 SetVector<NodeId> Defs; in getAllReachingDefs()
159 for (NodeId N : DefQ) { in getAllReachingDefs()
178 auto Less = [&Block,this] (NodeId A, NodeId B) -> bool { in getAllReachingDefs()
[all …]
HDRDFGraph.cpp67 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) { in operator <<()
110 OS << Print<NodeId>(RA.Id, G) << '<' in printRefHeader()
119 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
120 OS << Print<NodeId>(N, P.G); in operator <<()
122 if (NodeId N = P.Obj.Addr->getReachedDef()) in operator <<()
123 OS << Print<NodeId>(N, P.G); in operator <<()
125 if (NodeId N = P.Obj.Addr->getReachedUse()) in operator <<()
126 OS << Print<NodeId>(N, P.G); in operator <<()
128 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
129 OS << Print<NodeId>(N, P.G); in operator <<()
[all …]
HDRegAllocPBQP.cpp221 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
224 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
225 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs()
239 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
240 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs()
258 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>;
268 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
365 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
367 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()
398 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
[all …]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
HDAArch64PBQPRegAlloc.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()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
HDModuleSummaryIndex.cpp419 auto NodeId = [](uint64_t ModId, GlobalValue::GUID Id) { in exportToDot() local
447 OS << Pfx << NodeId(SrcMod, SrcId) << " -> " << NodeId(DstMod, DstId) in exportToDot()
500 OS << " " << NodeId(ModId, SummaryIt.first) << " " << A.getAsString() in exportToDot()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
HDLegalizeTypes.cpp382 int NodeId = User->getNodeId(); in run() local
386 if (NodeId > 0) { in run()
387 User->setNodeId(NodeId-1); in run()
390 if (NodeId-1 == ReadyToProcess) in run()
398 if (NodeId == NewNode) in run()
404 assert(NodeId == Unanalyzed && "Unknown node ID!"); in run()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
HDX86LoadValueInjectionLoadHardening.cpp357 DenseMap<NodeId, std::vector<NodeId>> Transmitters; in getGadgetGraph()
362 SmallSet<NodeId, 8> UsesVisited, DefsVisited; in getGadgetGraph()
/freebsd-11-stable/sys/contrib/dev/acpica/include/
HDactbl3.h576 UINT16 NodeId; member
/freebsd-11-stable/sys/contrib/dev/acpica/common/
HDdmtbinfo.c2312 {ACPI_DMT_UINT16, ACPI_MPST0_OFFSET (NodeId), "Node ID", 0},