Home
last modified time | relevance | path

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

123

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
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 …]
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()
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()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
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);
DRDFGraph.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 …]
DRDFLiveness.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 …]
DRDFGraph.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 …]
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()
DRDFCopy.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()
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()
DRDFLiveness.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;
DRDFCopy.h49 std::map<NodeId, EqualityMap> CopyMap;
50 std::vector<NodeId> Copies;
54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DRegAllocPBQP.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 …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DRegAllocPBQP.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 …]
/third_party/node/deps/v8/src/compiler/
Dgraph.h32 using NodeId = uint32_t; variable
102 inline NodeId NextNodeId(); in NON_EXPORTED_BASE()
108 NodeId next_node_id_; in NON_EXPORTED_BASE()
Dnode.h31 using NodeId = uint32_t; variable
44 static Node* New(Zone* zone, NodeId id, const Operator* op, int input_count,
46 static Node* Clone(Zone* zone, NodeId id, const Node* node);
58 NodeId id() const { return IdField::decode(bit_field_); } in id()
157 inline static Node* NewImpl(Zone* zone, NodeId id, const Operator* op,
238 Node(NodeId id, const Operator* op, int inline_count, int inline_capacity);
290 using IdField = base::BitField<NodeId, 0, 24>;
Dgraph-reducer.cc175 NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1); in ReduceTop()
213 Replace(node, replacement, std::numeric_limits<NodeId>::max()); in Replace()
217 void GraphReducer::Replace(Node* node, Node* replacement, NodeId max_id) { in Replace()
Dgraph.cc74 NodeId Graph::NextNodeId() { in NextNodeId()
77 DCHECK_LT(next_node_id_, std::numeric_limits<NodeId>::max()); in NextNodeId()
Dmemory-optimizer.h24 using NodeId = uint32_t; variable
87 ZoneMap<NodeId, AllocationStates> pending_;
Dnode.cc58 Node* Node::NewImpl(Zone* zone, NodeId id, const Operator* op, int input_count, in NewImpl()
131 Node* Node::New(Zone* zone, NodeId id, const Operator* op, int input_count, in New()
136 Node* Node::Clone(Zone* zone, NodeId id, const Node* node) { in Clone()
385 Node::Node(NodeId id, const Operator* op, int inline_count, int inline_capacity) in Node()
392 STATIC_ASSERT(IdField::kMax < std::numeric_limits<NodeId>::max()); in Node()
Dgraph-reducer.h27 using NodeId = uint32_t; variable
183 void Replace(Node* node, Node* replacement, NodeId max_id); in NON_EXPORTED_BASE()
/third_party/node/deps/v8/src/compiler/backend/
Dinstruction-selector.h60 NodeId node_id, in ForDeoptimize()
67 FlagsCondition condition, DeoptimizeReason reason, NodeId node_id, in ForDeoptimizeForTesting()
105 NodeId node_id() const { in node_id()
202 DeoptimizeReason reason, NodeId node_id, in FlagsContinuation()
244 NodeId node_id_; // Only valid if mode_ == kFlags_deoptimize*
461 const std::map<NodeId, int> GetVirtualRegistersForTesting() const;
485 DeoptimizeReason reason, NodeId node_id,
621 void VisitDeoptimize(DeoptimizeReason reason, NodeId node_id,
Dcode-generator-impl.h193 NodeId node_id) in DeoptimizationExit()
225 NodeId node_id() const { return node_id_; } in node_id()
249 const NodeId node_id_;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
DAArch64PBQPRegAlloc.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()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
DModuleSummaryIndex.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()

123