duke@435: /*
duke@435:  * Copyright 2007 Sun Microsystems, Inc.  All Rights Reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
duke@435:  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435:  * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435:  * have any questions.
duke@435:  *
duke@435:  */
duke@435: 
duke@435: #include "incls/_precompiled.incl"
duke@435: #include "incls/_idealGraphPrinter.cpp.incl"
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: 
duke@435: // Constants
duke@435: // Keep consistent with Java constants
duke@435: const char *IdealGraphPrinter::INDENT = "  ";
duke@435: const char *IdealGraphPrinter::TOP_ELEMENT = "graphDocument";
duke@435: const char *IdealGraphPrinter::GROUP_ELEMENT = "group";
duke@435: const char *IdealGraphPrinter::GRAPH_ELEMENT = "graph";
duke@435: const char *IdealGraphPrinter::PROPERTIES_ELEMENT = "properties";
duke@435: const char *IdealGraphPrinter::EDGES_ELEMENT = "edges";
duke@435: const char *IdealGraphPrinter::PROPERTY_ELEMENT = "p";
duke@435: const char *IdealGraphPrinter::EDGE_ELEMENT = "edge";
duke@435: const char *IdealGraphPrinter::NODE_ELEMENT = "node";
duke@435: const char *IdealGraphPrinter::NODES_ELEMENT = "nodes";
duke@435: const char *IdealGraphPrinter::REMOVE_EDGE_ELEMENT = "removeEdge";
duke@435: const char *IdealGraphPrinter::REMOVE_NODE_ELEMENT = "removeNode";
duke@435: const char *IdealGraphPrinter::METHOD_NAME_PROPERTY = "name";
duke@435: const char *IdealGraphPrinter::METHOD_IS_PUBLIC_PROPERTY = "public";
duke@435: const char *IdealGraphPrinter::METHOD_IS_STATIC_PROPERTY = "static";
duke@435: const char *IdealGraphPrinter::TRUE_VALUE = "true";
duke@435: const char *IdealGraphPrinter::NODE_NAME_PROPERTY = "name";
duke@435: const char *IdealGraphPrinter::EDGE_NAME_PROPERTY = "name";
duke@435: const char *IdealGraphPrinter::NODE_ID_PROPERTY = "id";
duke@435: const char *IdealGraphPrinter::FROM_PROPERTY = "from";
duke@435: const char *IdealGraphPrinter::TO_PROPERTY = "to";
duke@435: const char *IdealGraphPrinter::PROPERTY_NAME_PROPERTY = "name";
duke@435: const char *IdealGraphPrinter::GRAPH_NAME_PROPERTY = "name";
duke@435: const char *IdealGraphPrinter::INDEX_PROPERTY = "index";
duke@435: const char *IdealGraphPrinter::METHOD_ELEMENT = "method";
duke@435: const char *IdealGraphPrinter::INLINE_ELEMENT = "inline";
duke@435: const char *IdealGraphPrinter::BYTECODES_ELEMENT = "bytecodes";
duke@435: const char *IdealGraphPrinter::METHOD_BCI_PROPERTY = "bci";
duke@435: const char *IdealGraphPrinter::METHOD_SHORT_NAME_PROPERTY = "shortName";
duke@435: const char *IdealGraphPrinter::CONTROL_FLOW_ELEMENT = "controlFlow";
duke@435: const char *IdealGraphPrinter::BLOCK_NAME_PROPERTY = "name";
duke@435: const char *IdealGraphPrinter::BLOCK_DOMINATOR_PROPERTY = "dom";
duke@435: const char *IdealGraphPrinter::BLOCK_ELEMENT = "block";
duke@435: const char *IdealGraphPrinter::SUCCESSORS_ELEMENT = "successors";
duke@435: const char *IdealGraphPrinter::SUCCESSOR_ELEMENT = "successor";
duke@435: const char *IdealGraphPrinter::ASSEMBLY_ELEMENT = "assembly";
duke@435: 
duke@435: int IdealGraphPrinter::_file_count = 0;
duke@435: 
duke@435: IdealGraphPrinter *IdealGraphPrinter::printer() {
duke@435:   if (PrintIdealGraphLevel == 0) return NULL;
duke@435: 
duke@435:   JavaThread *thread = JavaThread::current();
duke@435:   if (!thread->is_Compiler_thread()) return NULL;
duke@435: 
duke@435:   CompilerThread *compiler_thread = (CompilerThread *)thread;
duke@435:   if (compiler_thread->ideal_graph_printer() == NULL) {
duke@435:     IdealGraphPrinter *printer = new IdealGraphPrinter();
duke@435:     compiler_thread->set_ideal_graph_printer(printer);
duke@435:   }
duke@435: 
duke@435:   return compiler_thread->ideal_graph_printer();
duke@435: }
duke@435: 
duke@435: void IdealGraphPrinter::clean_up() {
duke@435:   JavaThread *p;
duke@435:   for (p = Threads::first(); p; p = p->next()) {
duke@435:     if (p->is_Compiler_thread()) {
duke@435:       CompilerThread *c = (CompilerThread *)p;
duke@435:       IdealGraphPrinter *printer = c->ideal_graph_printer();
duke@435:       if (printer) {
duke@435:         delete printer;
duke@435:       }
duke@435:       c->set_ideal_graph_printer(NULL);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: // Constructor, either file or network output
duke@435: IdealGraphPrinter::IdealGraphPrinter() {
duke@435: 
never@657:   // By default dump both ins and outs since dead or unreachable code
never@657:   // needs to appear in the graph.  There are also some special cases
never@657:   // in the mach where kill projections have no users but should
never@657:   // appear in the dump.
never@657:   _traverse_outs = true;
duke@435:   _should_send_method = true;
duke@435:   _output = NULL;
duke@435:   buffer[0] = 0;
duke@435:   _depth = 0;
duke@435:   _current_method = NULL;
duke@435:   assert(!_current_method, "current method must be initialized to NULL");
never@657:   _stream = NULL;
duke@435: 
duke@435:   if (PrintIdealGraphFile != NULL) {
duke@435:     ThreadCritical tc;
duke@435:     // User wants all output to go to files
duke@435:     if (_file_count != 0) {
duke@435:       ResourceMark rm;
duke@435:       stringStream st;
duke@435:       const char* dot = strrchr(PrintIdealGraphFile, '.');
duke@435:       if (dot) {
duke@435:         st.write(PrintIdealGraphFile, dot - PrintIdealGraphFile);
duke@435:         st.print("%d%s", _file_count, dot);
duke@435:       } else {
duke@435:         st.print("%s%d", PrintIdealGraphFile, _file_count);
duke@435:       }
never@657:       fileStream *stream = new (ResourceObj::C_HEAP) fileStream(st.as_string());
never@657:       _output = stream;
duke@435:     } else {
never@657:       fileStream *stream = new (ResourceObj::C_HEAP) fileStream(PrintIdealGraphFile);
never@657:       _output = stream;
duke@435:     }
duke@435:     _file_count++;
duke@435:   } else {
never@657:     _stream = new (ResourceObj::C_HEAP) networkStream();
never@657: 
duke@435:     // Try to connect to visualizer
duke@435:     if (_stream->connect(PrintIdealGraphAddress, PrintIdealGraphPort)) {
duke@435:       char c = 0;
duke@435:       _stream->read(&c, 1);
duke@435:       if (c != 'y') {
duke@435:         tty->print_cr("Client available, but does not want to receive data!");
duke@435:         _stream->close();
duke@435:         delete _stream;
duke@435:         _stream = NULL;
duke@435:         return;
duke@435:       }
duke@435:       _output = _stream;
duke@435:     } else {
duke@435:       // It would be nice if we could shut down cleanly but it should
duke@435:       // be an error if we can't connect to the visualizer.
duke@435:       fatal2("Couldn't connect to visualizer at %s:%d", PrintIdealGraphAddress, PrintIdealGraphPort);
duke@435:     }
duke@435:   }
duke@435: 
never@657:   _xml = new (ResourceObj::C_HEAP) xmlStream(_output);
never@657: 
never@657:   head(TOP_ELEMENT);
duke@435: }
duke@435: 
duke@435: // Destructor, close file or network stream
duke@435: IdealGraphPrinter::~IdealGraphPrinter() {
duke@435: 
never@657:   tail(TOP_ELEMENT);
never@657: 
never@657:   // tty->print_cr("Walk time: %d", (int)_walk_time.milliseconds());
never@657:   // tty->print_cr("Output time: %d", (int)_output_time.milliseconds());
never@657:   // tty->print_cr("Build blocks time: %d", (int)_build_blocks_time.milliseconds());
never@657: 
never@657:   if(_xml) {
never@657:     delete _xml;
never@657:     _xml = NULL;
never@657:   }
duke@435: 
duke@435:   if (_stream) {
duke@435:     delete _stream;
duke@435:     if (_stream == _output) {
duke@435:       _output = NULL;
duke@435:     }
duke@435:     _stream = NULL;
duke@435:   }
duke@435: 
duke@435:   if (_output) {
duke@435:     delete _output;
duke@435:     _output = NULL;
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
never@657: void IdealGraphPrinter::begin_elem(const char *s) {
never@657:   _xml->begin_elem(s);
never@657: }
duke@435: 
never@657: void IdealGraphPrinter::end_elem() {
never@657:   _xml->end_elem();
never@657: }
duke@435: 
never@657: void IdealGraphPrinter::begin_head(const char *s) {
never@657:   _xml->begin_head(s);
never@657: }
duke@435: 
never@657: void IdealGraphPrinter::end_head() {
never@657:   _xml->end_head();
never@657: }
duke@435: 
never@657: void IdealGraphPrinter::print_attr(const char *name, intptr_t val) {
never@657:   stringStream stream;
never@657:   stream.print(INTX_FORMAT, val);
never@657:   print_attr(name, stream.as_string());
never@657: }
duke@435: 
never@657: void IdealGraphPrinter::print_attr(const char *name, const char *val) {
never@657:   _xml->print(" %s='", name);
never@657:   text(val);
never@657:   _xml->print("'");
never@657: }
duke@435: 
never@657: void IdealGraphPrinter::head(const char *name) {
never@657:   _xml->head(name);
never@657: }
duke@435: 
never@657: void IdealGraphPrinter::tail(const char *name) {
never@657:   _xml->tail(name);
never@657: }
duke@435: 
never@657: void IdealGraphPrinter::text(const char *s) {
never@657:   _xml->text(s);
never@657: }
never@657: 
never@657: void IdealGraphPrinter::print_prop(const char *name, int val) {
never@657: 
never@657:   stringStream stream;
never@657:   stream.print("%d", val);
never@657:   print_prop(name, stream.as_string());
never@657: }
never@657: 
never@657: void IdealGraphPrinter::print_prop(const char *name, const char *val) {
never@657:   begin_head(PROPERTY_ELEMENT);
never@657:   print_attr(PROPERTY_NAME_PROPERTY, name);
never@657:   end_head();
never@657:   text(val);
never@657:   tail(PROPERTY_ELEMENT);
duke@435: }
duke@435: 
duke@435: void IdealGraphPrinter::print_method(ciMethod *method, int bci, InlineTree *tree) {
never@657:   begin_head(METHOD_ELEMENT);
duke@435: 
duke@435:   stringStream str;
duke@435:   method->print_name(&str);
duke@435: 
duke@435:   stringStream shortStr;
duke@435:   method->print_short_name(&shortStr);
duke@435: 
never@657:   print_attr(METHOD_NAME_PROPERTY, str.as_string());
never@657:   print_attr(METHOD_SHORT_NAME_PROPERTY, shortStr.as_string());
never@657:   print_attr(METHOD_BCI_PROPERTY, bci);
duke@435: 
never@657:   end_head();
duke@435: 
never@657:   head(BYTECODES_ELEMENT);
duke@435:   output()->print_cr("<![CDATA[");
duke@435:   method->print_codes_on(output());
duke@435:   output()->print_cr("]]>");
never@657:   tail(BYTECODES_ELEMENT);
duke@435: 
never@657:   head(INLINE_ELEMENT);
duke@435:   if (tree != NULL) {
duke@435:     GrowableArray<InlineTree *> subtrees = tree->subtrees();
duke@435:     for (int i = 0; i < subtrees.length(); i++) {
duke@435:       print_inline_tree(subtrees.at(i));
duke@435:     }
duke@435:   }
never@657:   tail(INLINE_ELEMENT);
duke@435: 
never@657:   tail(METHOD_ELEMENT);
duke@435:   output()->flush();
duke@435: }
duke@435: 
duke@435: void IdealGraphPrinter::print_inline_tree(InlineTree *tree) {
duke@435: 
duke@435:   if (tree == NULL) return;
duke@435: 
duke@435:   ciMethod *method = tree->method();
duke@435:   print_method(tree->method(), tree->caller_bci(), tree);
duke@435: 
duke@435: }
duke@435: 
duke@435: void IdealGraphPrinter::print_inlining(Compile* compile) {
duke@435: 
duke@435:   // Print inline tree
duke@435:   if (_should_send_method) {
duke@435:     InlineTree *inlineTree = compile->ilt();
duke@435:     if (inlineTree != NULL) {
duke@435:       print_inline_tree(inlineTree);
duke@435:     } else {
duke@435:       // print this method only
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: // Has to be called whenever a method is compiled
duke@435: void IdealGraphPrinter::begin_method(Compile* compile) {
duke@435: 
duke@435:   ciMethod *method = compile->method();
duke@435:   assert(_output, "output stream must exist!");
duke@435:   assert(method, "null methods are not allowed!");
duke@435:   assert(!_current_method, "current method must be null!");
duke@435: 
never@657:   head(GROUP_ELEMENT);
duke@435: 
never@657:   head(PROPERTIES_ELEMENT);
duke@435: 
duke@435:   // Print properties
duke@435:   // Add method name
duke@435:   stringStream strStream;
duke@435:   method->print_name(&strStream);
never@657:   print_prop(METHOD_NAME_PROPERTY, strStream.as_string());
duke@435: 
duke@435:   if (method->flags().is_public()) {
never@657:     print_prop(METHOD_IS_PUBLIC_PROPERTY, TRUE_VALUE);
duke@435:   }
duke@435: 
duke@435:   if (method->flags().is_static()) {
never@657:     print_prop(METHOD_IS_STATIC_PROPERTY, TRUE_VALUE);
duke@435:   }
duke@435: 
never@657:   tail(PROPERTIES_ELEMENT);
duke@435: 
duke@435:   if (_stream) {
duke@435:     char answer = 0;
never@657:     _xml->flush();
duke@435:     int result = _stream->read(&answer, 1);
duke@435:     _should_send_method = (answer == 'y');
duke@435:   }
duke@435: 
duke@435:   this->_current_method = method;
duke@435: 
never@657:   _xml->flush();
duke@435: }
duke@435: 
duke@435: // Has to be called whenever a method has finished compilation
duke@435: void IdealGraphPrinter::end_method() {
duke@435: 
duke@435:   nmethod* method = (nmethod*)this->_current_method->code();
duke@435: 
never@657:   tail(GROUP_ELEMENT);
duke@435:   _current_method = NULL;
never@657:   _xml->flush();
duke@435: }
duke@435: 
duke@435: // Print indent
duke@435: void IdealGraphPrinter::print_indent() {
never@657:   tty->print_cr("printing ident %d", _depth);
duke@435:   for (int i = 0; i < _depth; i++) {
never@657:     _xml->print(INDENT);
duke@435:   }
duke@435: }
duke@435: 
duke@435: bool IdealGraphPrinter::traverse_outs() {
duke@435:   return _traverse_outs;
duke@435: }
duke@435: 
duke@435: void IdealGraphPrinter::set_traverse_outs(bool b) {
duke@435:   _traverse_outs = b;
duke@435: }
duke@435: 
never@657: intptr_t IdealGraphPrinter::get_node_id(Node *n) {
never@657:   return (intptr_t)(n);
never@657: }
never@657: 
never@657: void IdealGraphPrinter::visit_node(Node *n, void *param) {
never@657: 
never@657:   if(param) {
never@657: 
never@657:     // Output edge
never@657:     intptr_t dest_id = get_node_id(n);
never@657:     for ( uint i = 0; i < n->len(); i++ ) {
never@657:       if ( n->in(i) ) {
never@657:         Node *source = n->in(i);
never@657:         begin_elem(EDGE_ELEMENT);
never@657:         intptr_t source_id = get_node_id(source);
never@657:         print_attr(FROM_PROPERTY, source_id);
never@657:         print_attr(TO_PROPERTY, dest_id);
never@657:         print_attr(INDEX_PROPERTY, i);
never@657:         end_elem();
never@657:       }
never@657:     }
never@657: 
never@657:   } else {
never@657: 
never@657:     // Output node
never@657:     begin_head(NODE_ELEMENT);
never@657:     print_attr(NODE_ID_PROPERTY, get_node_id(n));
never@657:     end_head();
never@657: 
never@657:     head(PROPERTIES_ELEMENT);
never@657: 
never@657:     Node *node = n;
never@657: #ifndef PRODUCT
never@657:     node->_in_dump_cnt++;
never@657:     print_prop(NODE_NAME_PROPERTY, (const char *)node->Name());
never@657:     const Type *t = node->bottom_type();
never@657:     print_prop("type", (const char *)Type::msg[t->base()]);
never@657:     print_prop("idx", node->_idx);
never@657: #ifdef ASSERT
never@657:     print_prop("debug_idx", node->_debug_idx);
never@657: #endif
never@657: 
never@657:     if(C->cfg() != NULL) {
never@657:       Block *block = C->cfg()->_bbs[node->_idx];
never@657:       if(block == NULL) {
never@657:         print_prop("block", C->cfg()->_blocks[0]->_pre_order);
never@657:       } else {
never@657:         print_prop("block", block->_pre_order);
never@657:       }
never@657:     }
never@657: 
never@657:     const jushort flags = node->flags();
never@657:     if (flags & Node::Flag_is_Copy) {
never@657:       print_prop("is_copy", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_Call) {
never@657:       print_prop("is_call", "true");
never@657:     }
never@657:     if (flags & Node::Flag_rematerialize) {
never@657:       print_prop("rematerialize", "true");
never@657:     }
never@657:     if (flags & Node::Flag_needs_anti_dependence_check) {
never@657:       print_prop("needs_anti_dependence_check", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_macro) {
never@657:       print_prop("is_macro", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_Con) {
never@657:       print_prop("is_con", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_cisc_alternate) {
never@657:       print_prop("is_cisc_alternate", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_Branch) {
never@657:       print_prop("is_branch", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_block_start) {
never@657:       print_prop("is_block_start", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_Goto) {
never@657:       print_prop("is_goto", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_dead_loop_safe) {
never@657:       print_prop("is_dead_loop_safe", "true");
never@657:     }
never@657:     if (flags & Node::Flag_may_be_short_branch) {
never@657:       print_prop("may_be_short_branch", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_safepoint_node) {
never@657:       print_prop("is_safepoint_node", "true");
never@657:     }
never@657:     if (flags & Node::Flag_is_pc_relative) {
never@657:       print_prop("is_pc_relative", "true");
never@657:     }
never@657: 
never@657:     if (C->matcher() != NULL) {
never@657:       if (C->matcher()->is_shared(node)) {
never@657:         print_prop("is_shared", "true");
never@657:       } else {
never@657:         print_prop("is_shared", "false");
never@657:       }
never@657:       if (C->matcher()->is_dontcare(node)) {
never@657:         print_prop("is_dontcare", "true");
never@657:       } else {
never@657:         print_prop("is_dontcare", "false");
never@657:       }
never@657: 
never@657:       Node* old = C->matcher()->find_old_node(node);
never@657:       if (old != NULL) {
never@657:         print_prop("old_node_idx", old->_idx);
never@657:       }
never@657:     }
never@657: 
never@657:     if (node->is_Proj()) {
never@657:       print_prop("con", (int)node->as_Proj()->_con);
never@657:     }
never@657: 
never@657:     if (node->is_Mach()) {
never@657:       print_prop("idealOpcode", (const char *)NodeClassNames[node->as_Mach()->ideal_Opcode()]);
never@657:     }
never@657: 
never@657:     buffer[0] = 0;
never@657:     stringStream s2(buffer, sizeof(buffer) - 1);
never@657: 
never@657:     node->dump_spec(&s2);
never@657:     if (t != NULL && (t->isa_instptr() || t->isa_klassptr())) {
never@657:       const TypeInstPtr  *toop = t->isa_instptr();
never@657:       const TypeKlassPtr *tkls = t->isa_klassptr();
never@657:       ciKlass*           klass = toop ? toop->klass() : (tkls ? tkls->klass() : NULL );
never@657:       if( klass && klass->is_loaded() && klass->is_interface() ) {
never@657:         s2.print("  Interface:");
never@657:       } else if( toop ) {
never@657:         s2.print("  Oop:");
never@657:       } else if( tkls ) {
never@657:         s2.print("  Klass:");
never@657:       }
never@657:       t->dump_on(&s2);
never@657:     } else if( t == Type::MEMORY ) {
never@657:       s2.print("  Memory:");
never@657:       MemNode::dump_adr_type(node, node->adr_type(), &s2);
never@657:     }
never@657: 
never@657:     assert(s2.size() < sizeof(buffer), "size in range");
never@657:     print_prop("dump_spec", buffer);
never@657: 
never@657:     if (node->is_block_proj()) {
never@657:       print_prop("is_block_proj", "true");
never@657:     }
never@657: 
never@657:     if (node->is_block_start()) {
never@657:       print_prop("is_block_start", "true");
never@657:     }
never@657: 
never@657:     const char *short_name = "short_name";
never@657:     if (strcmp(node->Name(), "Parm") == 0 && node->as_Proj()->_con >= TypeFunc::Parms) {
never@657:       int index = node->as_Proj()->_con - TypeFunc::Parms;
never@657:       if (index >= 10) {
never@657:         print_prop(short_name, "PA");
never@657:       } else {
never@657:         sprintf(buffer, "P%d", index);
never@657:         print_prop(short_name, buffer);
never@657:       }
never@657:     } else if (strcmp(node->Name(), "IfTrue") == 0) {
never@657:       print_prop(short_name, "T");
never@657:     } else if (strcmp(node->Name(), "IfFalse") == 0) {
never@657:       print_prop(short_name, "F");
never@657:     } else if ((node->is_Con() && node->is_Type()) || node->is_Proj()) {
never@657: 
never@657:       if (t->base() == Type::Int && t->is_int()->is_con()) {
never@657:         const TypeInt *typeInt = t->is_int();
never@657:         assert(typeInt->is_con(), "must be constant");
never@657:         jint value = typeInt->get_con();
never@657: 
never@657:         // max. 2 chars allowed
never@657:         if (value >= -9 && value <= 99) {
never@657:           sprintf(buffer, "%d", value);
never@657:           print_prop(short_name, buffer);
never@657:         } else {
never@657:           print_prop(short_name, "I");
never@657:         }
never@657:       } else if (t == Type::TOP) {
never@657:         print_prop(short_name, "^");
never@657:       } else if (t->base() == Type::Long && t->is_long()->is_con()) {
never@657:         const TypeLong *typeLong = t->is_long();
never@657:         assert(typeLong->is_con(), "must be constant");
never@657:         jlong value = typeLong->get_con();
never@657: 
never@657:         // max. 2 chars allowed
never@657:         if (value >= -9 && value <= 99) {
never@657:           sprintf(buffer, "%d", value);
never@657:           print_prop(short_name, buffer);
never@657:         } else {
never@657:           print_prop(short_name, "L");
never@657:         }
never@657:       } else if (t->base() == Type::KlassPtr) {
never@657:         const TypeKlassPtr *typeKlass = t->is_klassptr();
never@657:         print_prop(short_name, "CP");
never@657:       } else if (t->base() == Type::Control) {
never@657:         print_prop(short_name, "C");
never@657:       } else if (t->base() == Type::Memory) {
never@657:         print_prop(short_name, "M");
never@657:       } else if (t->base() == Type::Abio) {
never@657:         print_prop(short_name, "IO");
never@657:       } else if (t->base() == Type::Return_Address) {
never@657:         print_prop(short_name, "RA");
never@657:       } else if (t->base() == Type::AnyPtr) {
never@657:         print_prop(short_name, "P");
never@657:       } else if (t->base() == Type::RawPtr) {
never@657:         print_prop(short_name, "RP");
never@657:       } else if (t->base() == Type::AryPtr) {
never@657:         print_prop(short_name, "AP");
never@657:       }
never@657:     }
never@657: 
never@657:     JVMState* caller = NULL;
never@657:     if (node->is_SafePoint()) {
never@657:       caller = node->as_SafePoint()->jvms();
never@657:     } else {
never@657:       Node_Notes* notes = C->node_notes_at(node->_idx);
never@657:       if (notes != NULL) {
never@657:         caller = notes->jvms();
never@657:       }
never@657:     }
never@657: 
never@657:     if (caller != NULL) {
never@657:       stringStream bciStream;
never@657:       while(caller) {
never@657:         bciStream.print("%d ", caller->bci());
never@657:         caller = caller->caller();
never@657:       }
never@657:       print_prop("bci", bciStream.as_string());
never@657:     }
never@657: 
never@657:     if (_chaitin && _chaitin != (PhaseChaitin *)0xdeadbeef) {
never@657:       buffer[0] = 0;
never@657:       _chaitin->dump_register(node, buffer);
never@657:       print_prop("reg", buffer);
never@657:       print_prop("lrg", _chaitin->n2lidx(node));
never@657:     }
never@657: 
never@657:     node->_in_dump_cnt--;
never@657: #endif
never@657: 
never@657:     tail(PROPERTIES_ELEMENT);
never@657:     tail(NODE_ELEMENT);
never@657:   }
never@657: }
never@657: 
never@657: void IdealGraphPrinter::walk_nodes(Node *start, void *param) {
duke@435: 
duke@435: 
duke@435:   VectorSet visited(Thread::current()->resource_area());
duke@435:   GrowableArray<Node *> nodeStack(Thread::current()->resource_area(), 0, 0, NULL);
duke@435:   nodeStack.push(start);
duke@435:   visited.test_set(start->_idx);
duke@435:   while(nodeStack.length() > 0) {
duke@435: 
duke@435:     Node *n = nodeStack.pop();
never@657:     visit_node(n, param);
duke@435: 
duke@435:     if (_traverse_outs) {
duke@435:       for (DUIterator i = n->outs(); n->has_out(i); i++) {
duke@435:         Node* p = n->out(i);
duke@435:         if (!visited.test_set(p->_idx)) {
duke@435:           nodeStack.push(p);
duke@435:         }
duke@435:       }
duke@435:     }
duke@435: 
duke@435:     for ( uint i = 0; i < n->len(); i++ ) {
duke@435:       if ( n->in(i) ) {
duke@435:         if (!visited.test_set(n->in(i)->_idx)) {
duke@435:           nodeStack.push(n->in(i));
duke@435:         }
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: void IdealGraphPrinter::print_method(Compile* compile, const char *name, int level, bool clear_nodes) {
duke@435:   print(compile, name, (Node *)compile->root(), level, clear_nodes);
duke@435: }
duke@435: 
duke@435: // Print current ideal graph
duke@435: void IdealGraphPrinter::print(Compile* compile, const char *name, Node *node, int level, bool clear_nodes) {
duke@435: 
duke@435:   if (!_current_method || !_should_send_method || level > PrintIdealGraphLevel) return;
duke@435: 
never@657:   this->C = compile;
duke@435: 
duke@435:   // Warning, unsafe cast?
never@657:   _chaitin = (PhaseChaitin *)C->regalloc();
duke@435: 
never@657:   begin_head(GRAPH_ELEMENT);
never@657:   print_attr(GRAPH_NAME_PROPERTY, (const char *)name);
never@657:   end_head();
duke@435: 
never@657:   head(NODES_ELEMENT);
never@657:   walk_nodes(node, NULL);
never@657:   tail(NODES_ELEMENT);
never@657: 
never@657:   head(EDGES_ELEMENT);
never@657:   walk_nodes(node, (void *)1);
never@657:   tail(EDGES_ELEMENT);
never@657:   if (C->cfg() != NULL) {
never@657:     head(CONTROL_FLOW_ELEMENT);
never@657:     for (uint i = 0; i < C->cfg()->_blocks.size(); i++) {
never@657:       Block *b = C->cfg()->_blocks[i];
never@657:       begin_head(BLOCK_ELEMENT);
never@657:       print_attr(BLOCK_NAME_PROPERTY, b->_pre_order);
never@657:       end_head();
never@657: 
never@657:       head(SUCCESSORS_ELEMENT);
never@657:       for (uint s = 0; s < C->cfg()->_blocks[i]->_num_succs; s++) {
never@657:         begin_elem(SUCCESSOR_ELEMENT);
never@657:         print_attr(BLOCK_NAME_PROPERTY, b->_succs[s]->_pre_order);
never@657:         end_elem();
never@657:       }
never@657:       tail(SUCCESSORS_ELEMENT);
never@657: 
never@657:       tail(BLOCK_ELEMENT);
duke@435:     }
never@657: 
never@657:     tail(CONTROL_FLOW_ELEMENT);
duke@435:   }
never@657:   tail(GRAPH_ELEMENT);
never@657:   output()->flush();
duke@435: }
duke@435: 
duke@435: extern const char *NodeClassNames[];
duke@435: 
duke@435: outputStream *IdealGraphPrinter::output() {
never@657:   return _xml;
duke@435: }
duke@435: 
duke@435: #endif