226   typedef uint32_t NodeId;  typedef
296     NodeAddr(T A, NodeId I) : Addr(A), Id(I) {}  in NodeAddr()
313     NodeId Id;
342     NodeBase *ptr(NodeId N) const {  in ptr()
348     NodeId id(const NodeBase *P) const;
420     NodeId   getNext()  const { return Next; }  in getNext()
430     void setNext(NodeId N) { Next = N; }  in setNext()
435     NodeId Next;                // Id of the next node in the circular chain.
440       NodeId DD, DU;          // Ids of the first reached def and use.
443       NodeId PredB;           // Id of the predecessor block for a phi use.
447       NodeId FirstM, LastM;   // Id of the first member and last.
450       NodeId RD, Sib;         // Ids of the reaching def and the sibling.
474   typedef std::set<NodeId> NodeSet;
485     NodeId getReachingDef() const {  in getReachingDef()
488     void setReachingDef(NodeId RD) {  in setReachingDef()
491     NodeId getSibling() const {  in getSibling()
494     void setSibling(NodeId Sib) {  in setSibling()
513     NodeId getReachedDef() const {  in getReachedDef()
516     void setReachedDef(NodeId D) {  in setReachedDef()
519     NodeId getReachedUse() const {  in getReachedUse()
522     void setReachedUse(NodeId U) {  in setReachedUse()
526     void linkToDef(NodeId Self, NodeAddr<DefNode*> DA);
530     void linkToDef(NodeId Self, NodeAddr<DefNode*> DA);
534     NodeId getPredecessor() const {  in getPredecessor()
538     void setPredecessor(NodeId B) {  in setPredecessor()
602     NodeBase *ptr(NodeId N) const;
603     template <typename T> T ptr(NodeId N) const {  in ptr()
606     NodeId id(const NodeBase *P) const;
608     template <typename T> NodeAddr<T> addr(NodeId N) const {  in addr()
669       void start_block(NodeId N);
670       void clear_block(NodeId N);
674       bool isDelimiter(const StorageType::value_type &P, NodeId N = 0) const {
686     void markBlock(NodeId B, DefStackMap &DefM);
687     void releaseBlock(NodeId B, DefStackMap &DefM);
764     typedef std::map<NodeId,RegisterSet> BlockRefsMap;