Mercurial > hg > truffle

comparison src/share/vm/opto/node.hpp @ 7957:0d26ce8e9251

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge
author acorn
date Mon, 28 Jan 2013 10:34:07 -0500
parents a7114d3d712e
children 8b3da8d14c93
comparison
equal deleted inserted replaced
7956:16fb9f942703 7957:0d26ce8e9251
992 //----------------- Printing, etc 992 //----------------- Printing, etc
993 public: 993 public:
994 #ifndef PRODUCT 994 #ifndef PRODUCT
995 Node* find(int idx) const; // Search the graph for the given idx. 995 Node* find(int idx) const; // Search the graph for the given idx.
996 Node* find_ctrl(int idx) const; // Search control ancestors for the given idx. 996 Node* find_ctrl(int idx) const; // Search control ancestors for the given idx.
997 void dump() const; // Print this node, 997 void dump() const { dump("\n"); } // Print this node.
998 void dump(const char* suffix, outputStream *st = tty) const;// Print this node.
998 void dump(int depth) const; // Print this node, recursively to depth d 999 void dump(int depth) const; // Print this node, recursively to depth d
999 void dump_ctrl(int depth) const; // Print control nodes, to depth d 1000 void dump_ctrl(int depth) const; // Print control nodes, to depth d
1000 virtual void dump_req() const; // Print required-edge info 1001 virtual void dump_req(outputStream *st = tty) const; // Print required-edge info
1001 virtual void dump_prec() const; // Print precedence-edge info 1002 virtual void dump_prec(outputStream *st = tty) const; // Print precedence-edge info
1002 virtual void dump_out() const; // Print the output edge info 1003 virtual void dump_out(outputStream *st = tty) const; // Print the output edge info
1003 virtual void dump_spec(outputStream *st) const {}; // Print per-node info 1004 virtual void dump_spec(outputStream *st) const {}; // Print per-node info
1004 void verify_edges(Unique_Node_List &visited); // Verify bi-directional edges 1005 void verify_edges(Unique_Node_List &visited); // Verify bi-directional edges
1005 void verify() const; // Check Def-Use info for my subgraph 1006 void verify() const; // Check Def-Use info for my subgraph
1006 static void verify_recur(const Node *n, int verify_depth, VectorSet &old_space, VectorSet &new_space); 1007 static void verify_recur(const Node *n, int verify_depth, VectorSet &old_space, VectorSet &new_space);
1007 1008