/external/oj-libjdwp/src/share/back/ |
D | commonRef.c | 100 getLocalRef(JNIEnv *env, const RefNode* node) { in getLocalRef() 123 RefNode* node = (RefNode*)jlong_to_ptr(tag); in commonRef_handleFreedObject() 155 static RefNode * 158 RefNode *node; in createNode() 166 node = (RefNode*)jvmtiAllocate((int)sizeof(RefNode)); in createNode() 195 deleteNode(JNIEnv *env, RefNode *node) in deleteNode() 236 strengthenNode(JNIEnv *env, RefNode *node) in strengthenNode() 262 weakenNode(JNIEnv *env, RefNode *node) in weakenNode() 277 static RefNode * 286 RefNode *node; in findNodeByRef() [all …]
|
D | util.h | 63 typedef struct RefNode { struct 68 struct RefNode *next; /* next RefNode* in bucket chain */ argument 69 struct RefNode *prev; /* ANDROID-CHANGED: Previous RefNode* in bucket chain. Used to allow argument 73 } RefNode; argument 149 RefNode **objectsByID;
|
/external/llvm/lib/Target/Hexagon/ |
D | RDFGraph.h | 476 struct RefNode : public NodeBase { struct 477 RefNode() = default; 507 NodeAddr<RefNode*> getNextRef(RegisterRef RR, Predicate P, bool NextOnly, argument 512 struct DefNode : public RefNode { 529 struct UseNode : public RefNode { 689 NodeAddr<RefNode*> getNextRelated(NodeAddr<InstrNode*> IA, 690 NodeAddr<RefNode*> RA) const; 691 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA, 692 NodeAddr<RefNode*> RA, bool Create); 693 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA, [all …]
|
D | RDFDeadCode.cpp | 77 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { in scanInstr() 124 auto RA = DFG.addr<RefNode*>(N); in collect() 134 auto RA = DFG.addr<RefNode*>(N); in collect() 135 dbgs() << PrintNode<RefNode*>(RA, DFG) << "\n"; in collect() 148 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in collect() 180 DRNs.push_back(DFG.addr<RefNode*>(I)); in erase() 198 auto UsesFirst = [] (NodeAddr<RefNode*> A, NodeAddr<RefNode*> B) -> bool { in erase() 210 for (NodeAddr<RefNode*> RA : DRNs) { in erase() 212 dbgs() << " " << PrintNode<RefNode*>(RA, DFG) << '\n'; in erase()
|
D | RDFLiveness.h | 40 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA, 42 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA); 43 NodeSet getAllReachingDefsRec(RegisterRef RefRR, NodeAddr<RefNode*> RefA, 99 bool isRestricted(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA, 101 RegisterRef getRestrictedRegRef(NodeAddr<RefNode*> RA) const;
|
D | RDFGraph.cpp | 87 void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA, in printRefHeader() 143 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) { in operator <<() 204 << PrintListV<RefNode*>(P.Obj.Addr->members(P.G), P.G) << ']'; in operator <<() 213 << " [" << PrintListV<RefNode*>(P.Obj.Addr->members(P.G), P.G) << ']'; in operator <<() 379 RegisterRef RefNode::getRegRef() const { in getRegRef() 389 void RefNode::setRegRef(RegisterRef RR) { in setRegRef() 397 void RefNode::setRegRef(MachineOperand *Op) { in setRegRef() 404 NodeAddr<NodeBase*> RefNode::getOwner(const DataFlowGraph &G) { in getOwner() 855 NodeAddr<RefNode*> RA = NA; in cloneNode() 1056 NodeAddr<RefNode*> RA) const { in getRelatedRefs() [all …]
|
D | RDFLiveness.cpp | 88 NodeAddr<RefNode*> RefA, bool FullChain, const RegisterSet &DefRRs) { in getAllReachingDefs() 96 auto SNA = DFG.addr<RefNode*>(Start); in getAllReachingDefs() 120 if (auto RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs() 195 auto DefInSet = [&Defs] (NodeAddr<RefNode*> TA) -> bool { in getAllReachingDefs() 235 NodeList Liveness::getAllReachingDefs(NodeAddr<RefNode*> RefA) { in getAllReachingDefs() 241 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec() 533 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in computeLiveIns() 732 bool Liveness::isRestricted(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA, in isRestricted() 735 for (NodeAddr<RefNode*> TA = DFG.getNextShadow(IA, RA); in isRestricted() 747 RegisterRef Liveness::getRestrictedRegRef(NodeAddr<RefNode*> RA) const { in getRestrictedRegRef()
|
D | HexagonRDFOpt.cpp | 150 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) { in run() 186 for (NodeAddr<RefNode*> RA : Refs) in removeOperand() 191 for (NodeAddr<RefNode*> RA : Refs) { in removeOperand()
|
D | RDFCopy.cpp | 94 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in updateMap()
|
/external/llvm-project/llvm/lib/Target/Hexagon/ |
D | RDFDeadCode.cpp | 88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { in scanInstr() 135 auto RA = DFG.addr<RefNode*>(N); in collect() 145 auto RA = DFG.addr<RefNode*>(N); in collect() 146 dbgs() << PrintNode<RefNode*>(RA, DFG) << "\n"; in collect() 159 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in collect() 191 DRNs.push_back(DFG.addr<RefNode*>(I)); in erase() 209 auto UsesFirst = [] (NodeAddr<RefNode*> A, NodeAddr<RefNode*> B) -> bool { in erase() 221 for (NodeAddr<RefNode*> RA : DRNs) { in erase() 223 dbgs() << " " << PrintNode<RefNode*>(RA, DFG) << '\n'; in erase()
|
D | HexagonRDFOpt.cpp | 166 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) { in run() 201 for (NodeAddr<RefNode*> RA : Refs) in removeOperand() 206 for (NodeAddr<RefNode*> RA : Refs) { in removeOperand()
|
D | RDFCopy.cpp | 90 NodeAddr<RefNode*> RA = L.getNearestAliasedRef(RefRR, IA); in getLocalReachingDef()
|
D | HexagonOptAddrMode.cpp | 182 NodeAddr<RefNode*> AA = LV->getNearestAliasedRef(OffsetRR, IA); in canRemoveAddasl() 306 NodeAddr<RefNode*> AA = LV->getNearestAliasedRef(LRExtRR, IA); in isSafeToExtLR()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
D | RDFDeadCode.cpp | 88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) { in scanInstr() 135 auto RA = DFG.addr<RefNode*>(N); in collect() 145 auto RA = DFG.addr<RefNode*>(N); in collect() 146 dbgs() << PrintNode<RefNode*>(RA, DFG) << "\n"; in collect() 159 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) in collect() 191 DRNs.push_back(DFG.addr<RefNode*>(I)); in erase() 209 auto UsesFirst = [] (NodeAddr<RefNode*> A, NodeAddr<RefNode*> B) -> bool { in erase() 221 for (NodeAddr<RefNode*> RA : DRNs) { in erase() 223 dbgs() << " " << PrintNode<RefNode*>(RA, DFG) << '\n'; in erase()
|
D | RDFGraph.h | 515 struct RefNode : public NodeBase { struct 516 RefNode() = default; 553 NodeAddr<RefNode*> getNextRef(RegisterRef RR, Predicate P, bool NextOnly, argument 558 struct DefNode : public RefNode { 575 struct UseNode : public RefNode { 754 NodeAddr<RefNode*> getNextRelated(NodeAddr<InstrNode*> IA, 755 NodeAddr<RefNode*> RA) const; 756 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA, 757 NodeAddr<RefNode*> RA, bool Create); 758 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA, [all …]
|
D | RDFLiveness.h | 58 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA, 61 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) { in getAllReachingDefs() 66 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) { in getAllReachingDefs() 78 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs); 80 NodeAddr<RefNode*> getNearestAliasedRef(RegisterRef RefRR, 141 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
|
D | RDFGraph.cpp | 108 static void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA, in printRefHeader() 159 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) { in operator <<() 220 << PrintListV<RefNode*>(P.Obj.Addr->members(P.G), P.G) << ']'; in operator <<() 245 OS << " [" << PrintListV<RefNode*>(P.Obj.Addr->members(P.G), P.G) << ']'; in operator <<() 408 RegisterRef RefNode::getRegRef(const DataFlowGraph &G) const { in getRegRef() 418 void RefNode::setRegRef(RegisterRef RR, DataFlowGraph &G) { in setRegRef() 426 void RefNode::setRegRef(MachineOperand *Op, DataFlowGraph &G) { in setRegRef() 434 NodeAddr<NodeBase*> RefNode::getOwner(const DataFlowGraph &G) { in getOwner() 792 NodeAddr<RefNode*> RA = NA; in cloneNode() 890 for (NodeAddr<RefNode*> RA : IA.Addr->members(*this)) in build() [all …]
|
D | RDFLiveness.cpp | 107 NodeAddr<RefNode*> RefA, bool TopShadows, bool FullChain, in getAllReachingDefs() 125 auto SNA = DFG.addr<RefNode*>(Start); in getAllReachingDefs() 130 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs() 152 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs() 226 auto DefInSet = [&Defs] (NodeAddr<RefNode*> TA) -> bool { in getAllReachingDefs() 269 Liveness::getAllReachingDefsRec(RegisterRef RefRR, NodeAddr<RefNode*> RefA, in getAllReachingDefsRec() 275 Liveness::getAllReachingDefsRecImpl(RegisterRef RefRR, NodeAddr<RefNode*> RefA, in getAllReachingDefsRecImpl() 322 NodeAddr<RefNode*> Liveness::getNearestAliasedRef(RegisterRef RefRR, in getNearestAliasedRef() 340 NodeAddr<RefNode*> Clob, Use; in getNearestAliasedRef() 343 for (NodeAddr<RefNode*> R : Refs) { in getNearestAliasedRef() [all …]
|
D | HexagonRDFOpt.cpp | 166 for (NodeAddr<RefNode*> RA : SA.Addr->members(DFG)) { in run() 201 for (NodeAddr<RefNode*> RA : Refs) in removeOperand() 206 for (NodeAddr<RefNode*> RA : Refs) { in removeOperand()
|
D | RDFCopy.cpp | 90 NodeAddr<RefNode*> RA = L.getNearestAliasedRef(RefRR, IA); in getLocalReachingDef()
|
D | HexagonOptAddrMode.cpp | 182 NodeAddr<RefNode*> AA = LV->getNearestAliasedRef(OffsetRR, IA); in canRemoveAddasl() 306 NodeAddr<RefNode*> AA = LV->getNearestAliasedRef(LRExtRR, IA); in isSafeToExtLR()
|
/external/llvm-project/llvm/include/llvm/CodeGen/ |
D | RDFGraph.h | 515 struct RefNode : public NodeBase { struct 516 RefNode() = default; 553 NodeAddr<RefNode*> getNextRef(RegisterRef RR, Predicate P, bool NextOnly, argument 558 struct DefNode : public RefNode { 575 struct UseNode : public RefNode { 754 NodeAddr<RefNode*> getNextRelated(NodeAddr<InstrNode*> IA, 755 NodeAddr<RefNode*> RA) const; 756 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA, 757 NodeAddr<RefNode*> RA, bool Create); 758 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA, [all …]
|
D | RDFLiveness.h | 83 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA, 86 NodeList getAllReachingDefs(NodeAddr<RefNode*> RefA) { 91 NodeList getAllReachingDefs(RegisterRef RefRR, NodeAddr<RefNode*> RefA) { 103 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs); 105 NodeAddr<RefNode*> getNearestAliasedRef(RegisterRef RefRR, 165 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
|
/external/llvm-project/llvm/lib/CodeGen/ |
D | RDFGraph.cpp | 108 static void printRefHeader(raw_ostream &OS, const NodeAddr<RefNode*> RA, in printRefHeader() 159 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeAddr<RefNode*>> &P) { in operator <<() 220 << PrintListV<RefNode*>(P.Obj.Addr->members(P.G), P.G) << ']'; in operator <<() 245 OS << " [" << PrintListV<RefNode*>(P.Obj.Addr->members(P.G), P.G) << ']'; in operator <<() 408 RegisterRef RefNode::getRegRef(const DataFlowGraph &G) const { in getRegRef() 418 void RefNode::setRegRef(RegisterRef RR, DataFlowGraph &G) { in setRegRef() 426 void RefNode::setRegRef(MachineOperand *Op, DataFlowGraph &G) { in setRegRef() 434 NodeAddr<NodeBase*> RefNode::getOwner(const DataFlowGraph &G) { in getOwner() 794 NodeAddr<RefNode*> RA = NA; in cloneNode() 892 for (NodeAddr<RefNode*> RA : IA.Addr->members(*this)) in build() [all …]
|
D | RDFLiveness.cpp | 110 NodeAddr<RefNode*> RefA, bool TopShadows, bool FullChain, in getAllReachingDefs() 128 auto SNA = DFG.addr<RefNode*>(Start); in getAllReachingDefs() 133 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs() 155 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs() 265 auto DefInSet = [&Defs] (NodeAddr<RefNode*> TA) -> bool { in getAllReachingDefs() 309 Liveness::getAllReachingDefsRec(RegisterRef RefRR, NodeAddr<RefNode*> RefA, in getAllReachingDefsRec() 315 Liveness::getAllReachingDefsRecImpl(RegisterRef RefRR, NodeAddr<RefNode*> RefA, in getAllReachingDefsRecImpl() 362 NodeAddr<RefNode*> Liveness::getNearestAliasedRef(RegisterRef RefRR, in getNearestAliasedRef() 380 NodeAddr<RefNode*> Clob, Use; in getNearestAliasedRef() 383 for (NodeAddr<RefNode*> R : Refs) { in getNearestAliasedRef() [all …]
|