Home
last modified time | relevance | path

Searched refs:NodeTy (Results 1 – 9 of 9) sorted by relevance

/external/llvm/include/llvm/ADT/
Dilist.h49 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(); } in getPrev()
58 static NodeTy *getNext(NodeTy *N) { return N->getNext(); } in getNext()
59 static const NodeTy *getPrev(const NodeTy *N) { return N->getPrev(); } in getPrev()
60 static const NodeTy *getNext(const NodeTy *N) { return N->getNext(); } in getNext()
62 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); } in setPrev()
63 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); } in setNext()
66 template<typename NodeTy>
[all …]
Dilist_node.h20 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 …]
/external/llvm/include/llvm/Analysis/
DIntervalIterator.h88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>,
89 class IGT = GraphTraits<Inverse<NodeTy*> > >
97 typedef IntervalIterator<NodeTy, OrigContainer_t> _Self;
166 bool ProcessInterval(NodeTy *Node) { in ProcessInterval()
191 void ProcessNode(Interval *Int, NodeTy *Node) { in ProcessNode()
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp309 NodeTy::Profile(profile, L, State, IsSink); in getNode()
310 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos); in getNode()
319 V = (NodeTy*) getAllocator().Allocate<NodeTy>(); in getNode()
322 new (V) NodeTy(L, State, IsSink); in getNode()
340 ExplodedGraph::trim(ArrayRef<const NodeTy *> Sinks, in trim()
357 for (ArrayRef<const NodeTy *>::iterator I = Sinks.begin(), E = Sinks.end(); in trim()
/external/llvm/lib/Target/Mips/
DMipsISelLowering.h267 template <class NodeTy>
268 SDValue getAddrLocal(NodeTy *N, EVT Ty, SelectionDAG &DAG, in getAddrLocal()
287 template<class NodeTy>
288 SDValue getAddrGlobal(NodeTy *N, EVT Ty, SelectionDAG &DAG, in getAddrGlobal()
301 template<class NodeTy>
302 SDValue getAddrGlobalLargeGOT(NodeTy *N, EVT Ty, SelectionDAG &DAG, in getAddrGlobalLargeGOT()
320 template<class NodeTy>
321 SDValue getAddrNonPIC(NodeTy *N, EVT Ty, SelectionDAG &DAG) const { in getAddrNonPIC()
DMips16ISelDAGToDAG.cpp250 EVT NodeTy = Node->getValueType(0); in selectNode() local
295 std::pair<SDNode*, SDNode*> LoHi = selectMULT(Node, MultOpc, DL, NodeTy, in selectNode()
309 SDNode *Result = selectMULT(Node, MultOpc, DL, NodeTy, false, true).second; in selectNode()
/external/llvm/include/llvm/IR/
DSymbolTableListTraits.h33 template<typename NodeTy> class ilist_iterator;
34 template<typename NodeTy, typename Traits> class iplist;
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h327 typedef ExplodedNode NodeTy; typedef
375 ExplodedGraph *trim(ArrayRef<const NodeTy *> Nodes,
/external/llvm/include/llvm/CodeGen/
DSelectionDAGNodes.h1687 BlockAddressSDNode(unsigned NodeTy, EVT VT, const BlockAddress *ba,
1689 : SDNode(NodeTy, 0, DebugLoc(), getSDVTList(VT)),
1803 LSBaseSDNode(ISD::NodeType NodeTy, unsigned Order, DebugLoc dl,
1807 : MemSDNode(NodeTy, Order, dl, VTs, MemVT, MMO) {