/external/llvm/include/llvm/ADT/ |
H A D | ilist_node.h | 20 template<typename NodeTy> 25 template<typename NodeTy> 27 friend struct ilist_traits<NodeTy>; 28 NodeTy *Prev; 30 NodeTy *getPrev() { return Prev; } 31 const NodeTy *getPrev() const { return Prev; } 32 void setPrev(NodeTy *P) { Prev = P; } 36 template<typename NodeTy> 42 template<typename NodeTy> 43 class ilist_node : private ilist_half_node<NodeTy> { [all...] |
H A D | ilist.h | 49 template<typename NodeTy, typename Traits> class iplist; 50 template<typename NodeTy> class ilist_iterator; 55 template<typename NodeTy> 57 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); } 58 static NodeTy *getNext(NodeTy *N) { return N->getNext(); } 59 static const NodeTy *getPrev(const NodeTy *N) { return N->getPrev(); } 60 static const NodeTy *getNex [all...] |
/external/llvm/unittests/Analysis/ |
H A D | CallGraphTest.cpp | 20 typedef typename GraphTraits<Ty *>::NodeType NodeTy; typedef 27 static_assert(std::is_same<decltype(*I), NodeTy &>::value, 29 static_assert(std::is_same<decltype(*X), NodeTy &>::value, 31 static_assert(std::is_same<decltype(*E), NodeTy &>::value, 34 NodeTy *N = GraphTraits<Ty *>::getEntryNode(G); 36 auto S = GraphTraits<NodeTy *>::child_begin(N); 37 auto F = GraphTraits<NodeTy *>::child_end(N); 40 static_assert(std::is_same<decltype(*S), NodeTy *>::value, 42 static_assert(std::is_same<decltype(*F), NodeTy *>::value,
|
/external/llvm/include/llvm/IR/ |
H A D | SymbolTableListTraits.h | 33 template<typename NodeTy> class ilist_iterator; 34 template<typename NodeTy, typename Traits> class iplist;
|
H A D | DIBuilder.h | 678 template <class NodeTy> 679 NodeTy *replaceTemporary(TempMDNode &&N, NodeTy *Replacement) { 681 return cast<NodeTy>(MDNode::replaceWithUniqued(std::move(N)));
|
H A D | Metadata.h | 898 template <class NodeTy> struct HasCachedHash; 899 template <class NodeTy> 900 static void dispatchRecalculateHash(NodeTy *N, std::true_type) { 903 template <class NodeTy> 904 static void dispatchRecalculateHash(NodeTy *N, std::false_type) {} 905 template <class NodeTy> 906 static void dispatchResetHash(NodeTy *N, std::true_type) { 909 template <class NodeTy> 910 static void dispatchResetHash(NodeTy *N, std::false_type) {}
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | ExplodedGraph.cpp | 309 NodeTy::Profile(profile, L, State, IsSink); 310 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos); 319 V = (NodeTy*) getAllocator().Allocate<NodeTy>(); 322 new (V) NodeTy(L, State, IsSink); 340 ExplodedGraph::trim(ArrayRef<const NodeTy *> Sinks, 357 for (ArrayRef<const NodeTy *>::iterator I = Sinks.begin(), E = Sinks.end();
|
/external/llvm/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>, 89 class IGT = GraphTraits<Inverse<NodeTy*> > > 175 bool ProcessInterval(NodeTy *Node) { 200 void ProcessNode(Interval *Int, NodeTy *Node) {
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsISelLowering.h | 275 template <class NodeTy> 276 SDValue getAddrLocal(NodeTy *N, SDLoc DL, EVT Ty, SelectionDAG &DAG, 294 template <class NodeTy> 295 SDValue getAddrGlobal(NodeTy *N, SDLoc DL, EVT Ty, SelectionDAG &DAG, 307 template <class NodeTy> 308 SDValue getAddrGlobalLargeGOT(NodeTy *N, SDLoc DL, EVT Ty, 325 template <class NodeTy> 326 SDValue getAddrNonPIC(NodeTy *N, SDLoc DL, EVT Ty, 339 template <class NodeTy> 340 SDValue getAddrGPRel(NodeTy * [all...] |
H A D | Mips16ISelDAGToDAG.cpp | 252 EVT NodeTy = Node->getValueType(0); local 297 std::pair<SDNode*, SDNode*> LoHi = selectMULT(Node, MultOpc, DL, NodeTy, 311 SDNode *Result = selectMULT(Node, MultOpc, DL, NodeTy, false, true).second;
|
/external/llvm/lib/IR/ |
H A D | LLVMContextImpl.h | 181 template <class NodeTy> 182 MDNodeOpsKey(const NodeTy *N, unsigned Offset = 0) 185 template <class NodeTy> 186 bool compareOps(const NodeTy *RHS, unsigned Offset = 0) const { 211 template <class NodeTy> struct MDNodeKeyImpl; 212 template <class NodeTy> struct MDNodeInfo; 830 template <class NodeTy> struct MDNodeInfo { 831 typedef MDNodeKeyImpl<NodeTy> KeyTy; 832 static inline NodeTy *getEmptyKey() { 833 return DenseMapInfo<NodeTy *> [all...] |
H A D | Metadata.cpp | 641 template <class NodeTy> struct MDNode::HasCachedHash { 650 static const bool value = sizeof(check<NodeTy>(nullptr)) == sizeof(Yes);
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 325 typedef ExplodedNode NodeTy; typedef in class:clang::ento::ExplodedGraph 374 trim(ArrayRef<const NodeTy *> Nodes,
|
/external/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAGNodes.h | 1713 BlockAddressSDNode(unsigned NodeTy, EVT VT, const BlockAddress *ba, argument 1715 : SDNode(NodeTy, 0, DebugLoc(), getSDVTList(VT)), 1828 LSBaseSDNode(ISD::NodeType NodeTy, unsigned Order, DebugLoc dl, argument 1832 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) { 1925 MaskedLoadStoreSDNode(ISD::NodeType NodeTy, unsigned Order, DebugLoc dl, argument 1928 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {
|