Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/tools/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 …]
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h29 using NodeId = unsigned;
33 static NodeId invalidNodeId() { in invalidNodeId()
104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry()
157 NodeId NIds[2];
194 NodeId NId = 0; in addConstructedNode()
250 NodeId findNextInUse(NodeId NId) const { in findNextInUse()
257 NodeId CurNId, EndNId;
410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { in addEdge()
435 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, in addEdgeBypassingCostAllocator()
561 NodeId getEdgeOtherNodeId(EdgeId EId, NodeId NId) { in getEdgeOtherNodeId()
[all …]
H A DReductionRules.h31 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
32 using NodeId = typename GraphT::NodeId; in applyR1() local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
75 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
76 using NodeId = typename GraphT::NodeId; in applyR2() local
91 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId), in applyR2()
182 using NodeId = GraphBase::NodeId; in backpropagate() local
189 NodeId NId = stack.back(); in backpropagate()
206 NodeId mId = G.getEdgeNode2Id(EId); in backpropagate()
209 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
H A DSolution.h29 using SelectionsMap = std::map<GraphBase::NodeId, unsigned>;
39 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { in setSelection()
46 unsigned getSelection(GraphBase::NodeId nodeId) const { in getSelection()
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.h40 bool erase(const SetVector<NodeId> &Nodes);
44 SetVector<NodeId> getDeadNodes() { return DeadNodes; } in getDeadNodes()
45 SetVector<NodeId> getDeadInstrs() { return DeadInstrs; } in getDeadInstrs()
50 SetVector<NodeId> LiveNodes;
51 SetVector<NodeId> DeadNodes;
52 SetVector<NodeId> DeadInstrs;
60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
61 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
62 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
H A DRDFGraph.h261 using NodeId = uint32_t; variable
353 NodeId Id = 0;
536 NodeId getSibling() const { in getSibling()
539 void setSibling(NodeId Sib) { in setSibling()
560 NodeId getReachedDef() const { in getReachedDef()
563 void setReachedDef(NodeId D) { in setReachedDef()
566 NodeId getReachedUse() const { in getReachedUse()
569 void setReachedUse(NodeId U) { in setReachedUse()
650 NodeBase *ptr(NodeId N) const;
714 void start_block(NodeId N);
[all …]
H A DRDFLiveness.cpp112 SetVector<NodeId> DefQ; in getAllReachingDefs()
113 SetVector<NodeId> Owners; in getAllReachingDefs()
126 NodeId Start = RefA.Id; in getAllReachingDefs()
160 SetVector<NodeId> Defs; in getAllReachingDefs()
161 for (NodeId N : DefQ) { in getAllReachingDefs()
180 auto Less = [&Block,this] (NodeId A, NodeId B) -> bool { in getAllReachingDefs()
232 for (NodeId T : Tmp) { in getAllReachingDefs()
284 for (NodeId D : Defs) { in getAllReachingDefsRecImpl()
328 NodeId FindId = IA.Id; in getNearestAliasedRef()
439 std::map<NodeId,std::map<NodeId,RegisterAggr>> PhiUp; in computePhiInfo()
[all …]
H A DRDFGraph.cpp124 OS << Print<NodeId>(N, P.G); in operator <<()
127 OS << Print<NodeId>(N, P.G); in operator <<()
130 OS << Print<NodeId>(N, P.G); in operator <<()
133 OS << Print<NodeId>(N, P.G); in operator <<()
142 OS << Print<NodeId>(N, P.G); in operator <<()
145 OS << Print<NodeId>(N, P.G); in operator <<()
416 NodeId Nx = Next; in append()
499 NodeId Self = G.id(this); in addMember()
1152 NodeId Start = RA.Id; in getRelatedRefs()
1217 NodeId Start = RA.Id; in locateNextRef()
[all …]
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.cpp89 NodeId CopyPropagation::getLocalReachingDef(RegisterRef RefRR, in getLocalReachingDef()
96 if (NodeId RD = RA.Addr->getReachingDef()) in getLocalReachingDef()
107 for (NodeId I : Copies) { in run()
134 for (NodeId C : Copies) { in run()
154 NodeId AtCopy = getLocalReachingDef(SR, SA); in run()
156 for (NodeId N = DA.Addr->getReachedUse(), NextN; N; N = NextN) { in run()
167 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 DRDFLiveness.h50 using NodeRef = std::pair<NodeId, LaneBitmask>;
87 const RefMap &getRealUses(NodeId P) const { in getRealUses()
114 using NodeBlockMap = DenseMap<NodeId, MachineBasicBlock *>;
122 std::map<NodeId, RefMap> RealUseMap;
137 MachineBasicBlock *getBlockWithRef(NodeId RN) const;
H A DRDFCopy.h50 std::map<NodeId, EqualityMap> CopyMap;
51 std::vector<NodeId> Copies;
55 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
H A DHexagonOptAddrMode.cpp168 NodeId OffsetRegRD = 0; in canRemoveAddasl()
263 NodeId id = PA.Id; in getAllRealUses()
288 NodeId LRExtRegRD = 0; in isSafeToExtLR()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h279 using NodeId = GraphBase::NodeId; variable
299 void handleAddNode(NodeId NId) { in handleAddNode()
305 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
327 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
429 using NodeId = GraphBase::NodeId; in reduce() local
430 std::vector<NodeId> NodeStack; in reduce()
436 NodeId NId = *NItr; in reduce()
458 NodeId NId = *NItr; in reduce()
467 NodeId NId = *NItr; in reduce()
482 bool operator()(NodeId N1Id, NodeId N2Id) { in operator()
[all …]
H A DSelectionDAGNodes.h581 int NodeId = -1;
715 int getNodeId() const { return NodeId; }
718 void setNodeId(int Id) { NodeId = Id; }
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Tooling/ASTDiff/
H A DASTDiff.h39 NodeId Parent, LeftMostDescendant, RightMostDescendant;
42 SmallVector<NodeId, 4> Children;
58 NodeId getMapped(const SyntaxTree &SourceTree, NodeId Id) const;
83 NodeId getRootId() const;
84 using PreorderIterator = NodeId;
88 const Node &getNode(NodeId Id) const;
89 int findPositionInParent(NodeId Id) const;
97 std::string getNodeValue(NodeId Id) const;
H A DASTDiffInternal.h26 struct NodeId { struct
33 NodeId() : Id(InvalidNodeId) {} in NodeId() argument
34 NodeId(int Id) : Id(Id) {} in NodeId() function
37 NodeId &operator++() { return ++Id, *this; }
38 NodeId &operator--() { return --Id, *this; }
40 NodeId &operator*() { return *this; }
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp222 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
226 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs()
241 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs()
259 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>;
269 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
366 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
368 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()
399 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
669 PBQPRAGraph::NodeId NId = G.addNode(std::move(NodeCosts)); in initializeGraph()
898 NodeId N1Id = getEdgeNode1Id(EId); in dump()
[all …]
/freebsd-12.1/contrib/llvm/lib/IR/
H A DModuleSummaryIndex.cpp350 auto NodeId = [](uint64_t ModId, GlobalValue::GUID Id) { in exportToDot() local
376 OS << Pfx << NodeId(SrcMod, SrcId) << " -> " << NodeId(DstMod, DstId) in exportToDot()
421 OS << " " << NodeId(ModId, SummaryIt.first) << " " << A.getAsString() in exportToDot()
/freebsd-12.1/contrib/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp174 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint()
175 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint()
261 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint()
274 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint()
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp391 int NodeId = User->getNodeId(); in run() local
395 if (NodeId > 0) { in run()
396 User->setNodeId(NodeId-1); in run()
399 if (NodeId-1 == ReadyToProcess) in run()
407 if (NodeId == NewNode) in run()
413 assert(NodeId == Unanalyzed && "Unknown node ID!"); in run()
/freebsd-12.1/sys/contrib/dev/acpica/include/
H A Dactbl2.h1100 UINT16 NodeId; member
/freebsd-12.1/sys/contrib/dev/acpica/common/
H A Ddmtbinfo2.c813 {ACPI_DMT_UINT16, ACPI_MPST0_OFFSET (NodeId), "Node ID", 0},