/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/ASTDiff/ |
H A D | ASTDiffInternal.h | 25 struct NodeId { struct in namespace:clang::diff 32 NodeId() : Id(InvalidNodeId) {} function in struct:clang::diff::NodeId 33 NodeId(int Id) : Id(Id) {} function in struct:clang::diff::NodeId 36 NodeId &operator++() { return ++Id, *this; } 37 NodeId &operator--() { return --Id, *this; } 38 // Support defining iterators on NodeId. 39 NodeId &operator*() { return *this; }
|
H A D | ASTDiff.h | 38 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;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | RDFDeadCode.h | 39 bool erase(const SetVector<NodeId> &Nodes); 43 SetVector<NodeId> getDeadNodes() { return DeadNodes; } 44 SetVector<NodeId> getDeadInstrs() { return DeadInstrs; } 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 D | RDFCopy.h | 49 std::map<NodeId, EqualityMap> CopyMap; 50 std::vector<NodeId> Copies; 54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
|
H A D | HexagonRDFOpt.cpp | 95 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove); 154 const SetVector<NodeId> &DeadNodes = getDeadNodes(); 155 const SetVector<NodeId> &DeadInstrs = getDeadInstrs(); 157 using RefToInstrMap = DenseMap<NodeId, NodeId>; 160 SetVector<NodeId> PartlyDead; 176 SetVector<NodeId> Remove = DeadInstrs; 179 for (NodeId N : PartlyDead) { 198 DenseMap<NodeId,unsigned> OpMap; 215 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> [all...] |
H A D | RDFCopy.cpp | 88 NodeId CopyPropagation::getLocalReachingDef(RegisterRef RefRR, 95 if (NodeId RD = RA.Addr->getReachingDef()) 106 for (NodeId I : Copies) { 133 for (NodeId C : Copies) { 153 NodeId AtCopy = getLocalReachingDef(SR, SA); 155 for (NodeId N = DA.Addr->getReachedUse(), NextN; N; N = NextN) { 166 NodeId AtUse = getLocalReachingDef(SR, IA);
|
H A D | RDFDeadCode.cpp | 83 SetQueue<NodeId> &WorkQ) { 95 SetQueue<NodeId> &WorkQ) { 106 SetQueue<NodeId> &WorkQ) { 127 SetQueue<NodeId> WorkQ; 133 NodeId N = WorkQ.pop_front(); 144 for (NodeId N : LiveNodes) { 179 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) {
|
H A D | HexagonOptAddrMode.cpp | 168 NodeId OffsetRegRD = 0; 263 NodeId id = PA.Id; 288 NodeId LRExtRegRD = 0;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Solution.h | 28 using SelectionsMap = std::map<GraphBase::NodeId, unsigned>; 38 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { 45 unsigned getSelection(GraphBase::NodeId nodeId) const {
|
H A D | Graph.h | 28 using NodeId = unsigned; 32 static NodeId invalidNodeId() { 33 return std::numeric_limits<NodeId>::max(); 80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { 103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) 123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { 140 void disconnectFrom(Graph &G, NodeId NId) { 149 NodeId getN1Id() const { return NIds[0]; } 150 NodeId getN2I [all...] |
H A D | ReductionRules.h | 30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { 31 using NodeId = typename GraphT::NodeId; 41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); 74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { 75 using NodeId = typename GraphT::NodeId; 90 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId), 181 using NodeId = GraphBase::NodeId; [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/ASTDiff/ |
H A D | ASTDiff.cpp | 38 SrcToDst = std::make_unique<NodeId[]>(Size); 39 DstToSrc = std::make_unique<NodeId[]>(Size); 42 void link(NodeId Src, NodeId Dst) { 46 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } 47 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } 48 bool hasSrc(NodeId Src) const { return getDst(Src).isValid(); } 49 bool hasDst(NodeId Ds [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 146 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { 150 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { 162 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId; 278 using NodeId = GraphBase::NodeId; 298 void handleAddNode(NodeId NId) { 304 void handleRemoveNode(NodeId NId) {} 305 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} 312 void handleDisconnectEdge(EdgeId EId, NodeId NId) { 319 void handleReconnectEdge(EdgeId EId, NodeId NI [all...] |
H A D | RDFGraph.h | 38 // replaced with 32-bit identifiers: each node has an id of type NodeId. 260 using NodeId = uint32_t; 336 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} 352 NodeId Id = 0; 383 NodeBase *ptr(NodeId N) const { 390 NodeId id(const NodeBase *P) const; 457 NodeId getNext() const { return Next; } 469 void setNext(NodeId N) { Next = N; } 474 NodeId Next; // Id of the next node in the circular chain. 479 NodeId D [all...] |
H A D | RDFLiveness.h | 49 using NodeRef = std::pair<NodeId, LaneBitmask>; 86 const RefMap &getRealUses(NodeId P) const { 113 using NodeBlockMap = DenseMap<NodeId, MachineBasicBlock *>; 119 // map: NodeId -> (map: RegisterId -> NodeRefSet) 121 std::map<NodeId, RefMap> RealUseMap; 136 MachineBasicBlock *getBlockWithRef(NodeId RN) const;
|
H A D | SelectionDAGNodes.h | 619 int NodeId = -1; member in class:llvm::SDNode 741 int getNodeId() const { return NodeId; } 744 void setNodeId(int Id) { NodeId = Id; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | RDFLiveness.cpp | 65 OS << Print<NodeId>(J->first, P.G) << PrintLaneMaskOpt(J->second); 110 SetVector<NodeId> DefQ; 111 SetVector<NodeId> Owners; 124 NodeId Start = RefA.Id; 126 if (NodeId RD = SNA.Addr->getReachingDef()) 130 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) 152 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) 158 SetVector<NodeId> Defs; 159 for (NodeId N : DefQ) { 178 auto Less = [&Block,this] (NodeId [all...] |
H A D | RDFGraph.cpp | 67 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) { 110 OS << Print<NodeId>(RA.Id, G) << '<' 119 if (NodeId N = P.Obj.Addr->getReachingDef()) 120 OS << Print<NodeId>(N, P.G); 122 if (NodeId N = P.Obj.Addr->getReachedDef()) 123 OS << Print<NodeId>(N, P.G); 125 if (NodeId N = P.Obj.Addr->getReachedUse()) 126 OS << Print<NodeId>(N, P.G); 128 if (NodeId N = P.Obj.Addr->getSibling()) 129 OS << Print<NodeId>( [all...] |
H A D | RegAllocPBQP.cpp | 221 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>; 224 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, 225 PBQPRAGraph::NodeId MId, 239 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, 240 PBQPRAGraph::NodeId MId, 253 // Holds (Interval, CurrentSegmentID, and NodeId). The first two are required 258 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>; 268 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { 365 PBQP::GraphBase::NodeId NI [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64PBQPRegAlloc.cpp | 173 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); 174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); 260 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); 273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | ModuleSummaryIndex.cpp | 419 auto NodeId = [](uint64_t ModId, GlobalValue::GUID Id) { 447 OS << Pfx << NodeId(SrcMod, SrcId) << " -> " << NodeId(DstMod, DstId) 500 OS << " " << NodeId(ModId, SummaryIt.first) << " " << A.getAsString()
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypes.cpp | 202 // Walk all nodes in the graph, assigning them a NodeId of 'ReadyToProcess' 346 // Recompute the NodeId and correct processed operands, adding the node to 382 int NodeId = User->getNodeId(); local 386 if (NodeId > 0) { 387 User->setNodeId(NodeId-1); 390 if (NodeId-1 == ReadyToProcess) 398 if (NodeId == NewNode) 402 // became ready. Its new NodeId is the number of operands it has minus 1 404 assert(NodeId == Unanalyzed && "Unknown node ID!"); 475 /// NodeId [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86LoadValueInjectionLoadHardening.cpp | 357 DenseMap<NodeId, std::vector<NodeId>> Transmitters; 362 SmallSet<NodeId, 8> UsesVisited, DefsVisited;
|
/freebsd-11-stable/sys/contrib/dev/acpica/include/ |
H A D | actbl3.h | 576 UINT16 NodeId; member in struct:acpi_mpst_power_node
|
/freebsd-11-stable/sys/contrib/dev/acpica/common/ |
H A D | dmtbinfo.c | 2312 {ACPI_DMT_UINT16, ACPI_MPST0_OFFSET (NodeId), "Node ID", 0},
|