| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/ASTDiff/ |
| ASTDiffInternal.h | 25 struct NodeId {
32 NodeId() : Id(InvalidNodeId) {}
33 NodeId(int Id) : Id(Id) {}
36 NodeId &operator++() { return ++Id, *this; }
37 NodeId &operator--() { return --Id, *this; }
38 // Support defining iterators on NodeId.
39 NodeId &operator*() { return *this; }
|
| 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;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| 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);
|
| RDFCopy.h | 49 std::map<NodeId, EqualityMap> CopyMap;
50 std::vector<NodeId> Copies;
54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
|
| 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> &Remove)
[all...] |
| 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);
|
| 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) {
|
| HexagonOptAddrMode.cpp | 168 NodeId OffsetRegRD = 0;
263 NodeId id = PA.Id;
288 NodeId LRExtRegRD = 0;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/ |
| Solution.h | 28 using SelectionsMap = std::map<GraphBase::NodeId, unsigned>;
36 /// @param nodeId Node id.
37 /// @param selection Selection for nodeId.
38 void setSelection(GraphBase::NodeId nodeId, unsigned selection) {
39 selections[nodeId] = selection;
43 /// @param nodeId Node id.
44 /// @return The selection for nodeId;
45 unsigned getSelection(GraphBase::NodeId nodeId) const
[all...] |
| 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 getN2Id() const { return NIds[1];
[all...] |
| 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...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/ |
| ASTDiff.cpp | 39 SrcToDst = std::make_unique<NodeId[]>(Size);
40 DstToSrc = std::make_unique<NodeId[]>(Size);
43 void link(NodeId Src, NodeId Dst) {
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; }
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; }
49 bool hasSrc(NodeId Src) const { return getDst(Src).isValid(); }
50 bool hasDst(NodeId Dst) const { return getSrc(Dst).isValid();
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 148 void setNodeIdForVReg(Register VReg, GraphBase::NodeId NId) {
152 GraphBase::NodeId getNodeIdForVReg(Register VReg) const {
164 DenseMap<Register, GraphBase::NodeId> VRegToNodeId;
280 using NodeId = GraphBase::NodeId;
300 void handleAddNode(NodeId NId) {
306 void handleRemoveNode(NodeId NId) {}
307 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
314 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
321 void handleReconnectEdge(EdgeId EId, NodeId NId)
[all...] |
| RDFLiveness.h | 39 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;
143 // map: NodeId -> (map: RegisterId -> NodeRefSet)
145 DenseMap<NodeId, RefMap> RealUseMap;
160 MachineBasicBlock *getBlockWithRef(NodeId RN) const;
|
| 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 DD, DU; // Ids of the first reached def and use
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| RDFLiveness.cpp | 68 OS << Print<NodeId>(J->first, P.G) << PrintLaneMaskOpt(J->second);
113 SetVector<NodeId> DefQ;
127 NodeId Start = RefA.Id;
129 if (NodeId RD = SNA.Addr->getReachingDef())
133 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef())
155 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef())
172 SmallSet<NodeId,32> Defs;
176 std::map<NodeId, NodeAddr<InstrNode*>> Owners;
177 std::map<MachineBasicBlock*, SmallVector<NodeId,32>> Blocks;
178 for (NodeId N : DefQ)
[all...] |
| 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>(N, P.G)
[all...] |
| RegAllocPBQP.cpp | 220 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
223 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId,
224 PBQPRAGraph::NodeId MId,
238 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId,
239 PBQPRAGraph::NodeId MId,
252 // Holds (Interval, CurrentSegmentID, and NodeId). The first two are required
257 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>;
267 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) {
364 PBQP::GraphBase::NodeId NId = getNodeId(Cur)
[all...] |
| /src/external/apache2/llvm/dist/clang/tools/clang-diff/ |
| ClangDiff.cpp | 268 diff::NodeId Id, unsigned Offset) {
271 diff::NodeId LeftId, RightId;
272 diff::NodeId TargetId = Diff.getMapped(Tree, Id);
305 for (diff::NodeId Child : Node.Children)
345 diff::NodeId Id) {
361 diff::NodeId Id) {
389 diff::NodeId Id) {
402 for (diff::NodeId Id : Tree) {
412 diff::NodeId Dst) {
414 diff::NodeId Src = Diff.getMapped(DstTree, Dst)
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/amdkfd/ |
| kfd_dbgmgr.h | 182 uint32_t NodeId; /* F-NUMA node that contains the device */
217 uint32_t NodeId;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| 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);
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Transformer/ |
| RewriteRule.cpp | 313 EditGenerator transformer::rewriteDescendants(std::string NodeId,
315 return [NodeId = std::move(NodeId),
320 auto It = NodesMap.find(NodeId);
323 "ID not bound: " + NodeId);
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| ModuleSummaryIndex.cpp | 533 auto NodeId = [](uint64_t ModId, GlobalValue::GUID Id) {
561 OS << Pfx << NodeId(SrcMod, SrcId) << " -> " << NodeId(DstMod, DstId)
618 OS << " " << NodeId(ModId, SummaryIt.first) << " " << A.getAsString()
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeTypes.cpp | 207 // Walk all nodes in the graph, assigning them a NodeId of 'ReadyToProcess'
365 // Recompute the NodeId and correct processed operands, adding the node to
399 int NodeId = User->getNodeId();
403 if (NodeId > 0) {
404 User->setNodeId(NodeId-1);
407 if (NodeId-1 == ReadyToProcess)
415 if (NodeId == NewNode)
419 // became ready. Its new NodeId is the number of operands it has minus 1
421 assert(NodeId == Unanalyzed && "Unknown node ID!");
492 /// NodeId. If the node itself changes to a processed node, it is not remapped
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Transformer/ |
| RewriteRule.h | 364 /// Applies `Rule` to all descendants of the node bound to `NodeId`. `Rule` can
379 EditGenerator rewriteDescendants(std::string NodeId, RewriteRule Rule);
|
