Wed, 09 Dec 2009 16:40:45 -0800
6895383: JCK test throws NPE for method compiled with Escape Analysis
Summary: Add missing checks for MemBar nodes in EA.
Reviewed-by: never
duke@435 | 1 | /* |
xdono@1014 | 2 | * Copyright 2007-2009 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_idealGraphPrinter.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | #ifndef PRODUCT |
duke@435 | 29 | |
duke@435 | 30 | // Constants |
duke@435 | 31 | // Keep consistent with Java constants |
duke@435 | 32 | const char *IdealGraphPrinter::INDENT = " "; |
duke@435 | 33 | const char *IdealGraphPrinter::TOP_ELEMENT = "graphDocument"; |
duke@435 | 34 | const char *IdealGraphPrinter::GROUP_ELEMENT = "group"; |
duke@435 | 35 | const char *IdealGraphPrinter::GRAPH_ELEMENT = "graph"; |
duke@435 | 36 | const char *IdealGraphPrinter::PROPERTIES_ELEMENT = "properties"; |
duke@435 | 37 | const char *IdealGraphPrinter::EDGES_ELEMENT = "edges"; |
duke@435 | 38 | const char *IdealGraphPrinter::PROPERTY_ELEMENT = "p"; |
duke@435 | 39 | const char *IdealGraphPrinter::EDGE_ELEMENT = "edge"; |
duke@435 | 40 | const char *IdealGraphPrinter::NODE_ELEMENT = "node"; |
duke@435 | 41 | const char *IdealGraphPrinter::NODES_ELEMENT = "nodes"; |
duke@435 | 42 | const char *IdealGraphPrinter::REMOVE_EDGE_ELEMENT = "removeEdge"; |
duke@435 | 43 | const char *IdealGraphPrinter::REMOVE_NODE_ELEMENT = "removeNode"; |
duke@435 | 44 | const char *IdealGraphPrinter::METHOD_NAME_PROPERTY = "name"; |
duke@435 | 45 | const char *IdealGraphPrinter::METHOD_IS_PUBLIC_PROPERTY = "public"; |
duke@435 | 46 | const char *IdealGraphPrinter::METHOD_IS_STATIC_PROPERTY = "static"; |
duke@435 | 47 | const char *IdealGraphPrinter::TRUE_VALUE = "true"; |
duke@435 | 48 | const char *IdealGraphPrinter::NODE_NAME_PROPERTY = "name"; |
duke@435 | 49 | const char *IdealGraphPrinter::EDGE_NAME_PROPERTY = "name"; |
duke@435 | 50 | const char *IdealGraphPrinter::NODE_ID_PROPERTY = "id"; |
duke@435 | 51 | const char *IdealGraphPrinter::FROM_PROPERTY = "from"; |
duke@435 | 52 | const char *IdealGraphPrinter::TO_PROPERTY = "to"; |
duke@435 | 53 | const char *IdealGraphPrinter::PROPERTY_NAME_PROPERTY = "name"; |
duke@435 | 54 | const char *IdealGraphPrinter::GRAPH_NAME_PROPERTY = "name"; |
duke@435 | 55 | const char *IdealGraphPrinter::INDEX_PROPERTY = "index"; |
duke@435 | 56 | const char *IdealGraphPrinter::METHOD_ELEMENT = "method"; |
duke@435 | 57 | const char *IdealGraphPrinter::INLINE_ELEMENT = "inline"; |
duke@435 | 58 | const char *IdealGraphPrinter::BYTECODES_ELEMENT = "bytecodes"; |
duke@435 | 59 | const char *IdealGraphPrinter::METHOD_BCI_PROPERTY = "bci"; |
duke@435 | 60 | const char *IdealGraphPrinter::METHOD_SHORT_NAME_PROPERTY = "shortName"; |
duke@435 | 61 | const char *IdealGraphPrinter::CONTROL_FLOW_ELEMENT = "controlFlow"; |
duke@435 | 62 | const char *IdealGraphPrinter::BLOCK_NAME_PROPERTY = "name"; |
duke@435 | 63 | const char *IdealGraphPrinter::BLOCK_DOMINATOR_PROPERTY = "dom"; |
duke@435 | 64 | const char *IdealGraphPrinter::BLOCK_ELEMENT = "block"; |
duke@435 | 65 | const char *IdealGraphPrinter::SUCCESSORS_ELEMENT = "successors"; |
duke@435 | 66 | const char *IdealGraphPrinter::SUCCESSOR_ELEMENT = "successor"; |
duke@435 | 67 | const char *IdealGraphPrinter::ASSEMBLY_ELEMENT = "assembly"; |
duke@435 | 68 | |
duke@435 | 69 | int IdealGraphPrinter::_file_count = 0; |
duke@435 | 70 | |
duke@435 | 71 | IdealGraphPrinter *IdealGraphPrinter::printer() { |
duke@435 | 72 | if (PrintIdealGraphLevel == 0) return NULL; |
duke@435 | 73 | |
duke@435 | 74 | JavaThread *thread = JavaThread::current(); |
duke@435 | 75 | if (!thread->is_Compiler_thread()) return NULL; |
duke@435 | 76 | |
duke@435 | 77 | CompilerThread *compiler_thread = (CompilerThread *)thread; |
duke@435 | 78 | if (compiler_thread->ideal_graph_printer() == NULL) { |
duke@435 | 79 | IdealGraphPrinter *printer = new IdealGraphPrinter(); |
duke@435 | 80 | compiler_thread->set_ideal_graph_printer(printer); |
duke@435 | 81 | } |
duke@435 | 82 | |
duke@435 | 83 | return compiler_thread->ideal_graph_printer(); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | void IdealGraphPrinter::clean_up() { |
duke@435 | 87 | JavaThread *p; |
duke@435 | 88 | for (p = Threads::first(); p; p = p->next()) { |
duke@435 | 89 | if (p->is_Compiler_thread()) { |
duke@435 | 90 | CompilerThread *c = (CompilerThread *)p; |
duke@435 | 91 | IdealGraphPrinter *printer = c->ideal_graph_printer(); |
duke@435 | 92 | if (printer) { |
duke@435 | 93 | delete printer; |
duke@435 | 94 | } |
duke@435 | 95 | c->set_ideal_graph_printer(NULL); |
duke@435 | 96 | } |
duke@435 | 97 | } |
duke@435 | 98 | } |
duke@435 | 99 | |
duke@435 | 100 | // Constructor, either file or network output |
duke@435 | 101 | IdealGraphPrinter::IdealGraphPrinter() { |
duke@435 | 102 | |
never@657 | 103 | // By default dump both ins and outs since dead or unreachable code |
never@657 | 104 | // needs to appear in the graph. There are also some special cases |
never@657 | 105 | // in the mach where kill projections have no users but should |
never@657 | 106 | // appear in the dump. |
never@657 | 107 | _traverse_outs = true; |
duke@435 | 108 | _should_send_method = true; |
duke@435 | 109 | _output = NULL; |
duke@435 | 110 | buffer[0] = 0; |
duke@435 | 111 | _depth = 0; |
duke@435 | 112 | _current_method = NULL; |
duke@435 | 113 | assert(!_current_method, "current method must be initialized to NULL"); |
never@657 | 114 | _stream = NULL; |
duke@435 | 115 | |
duke@435 | 116 | if (PrintIdealGraphFile != NULL) { |
duke@435 | 117 | ThreadCritical tc; |
duke@435 | 118 | // User wants all output to go to files |
duke@435 | 119 | if (_file_count != 0) { |
duke@435 | 120 | ResourceMark rm; |
duke@435 | 121 | stringStream st; |
duke@435 | 122 | const char* dot = strrchr(PrintIdealGraphFile, '.'); |
duke@435 | 123 | if (dot) { |
duke@435 | 124 | st.write(PrintIdealGraphFile, dot - PrintIdealGraphFile); |
duke@435 | 125 | st.print("%d%s", _file_count, dot); |
duke@435 | 126 | } else { |
duke@435 | 127 | st.print("%s%d", PrintIdealGraphFile, _file_count); |
duke@435 | 128 | } |
never@657 | 129 | fileStream *stream = new (ResourceObj::C_HEAP) fileStream(st.as_string()); |
never@657 | 130 | _output = stream; |
duke@435 | 131 | } else { |
never@657 | 132 | fileStream *stream = new (ResourceObj::C_HEAP) fileStream(PrintIdealGraphFile); |
never@657 | 133 | _output = stream; |
duke@435 | 134 | } |
duke@435 | 135 | _file_count++; |
duke@435 | 136 | } else { |
never@657 | 137 | _stream = new (ResourceObj::C_HEAP) networkStream(); |
never@657 | 138 | |
duke@435 | 139 | // Try to connect to visualizer |
duke@435 | 140 | if (_stream->connect(PrintIdealGraphAddress, PrintIdealGraphPort)) { |
duke@435 | 141 | char c = 0; |
duke@435 | 142 | _stream->read(&c, 1); |
duke@435 | 143 | if (c != 'y') { |
duke@435 | 144 | tty->print_cr("Client available, but does not want to receive data!"); |
duke@435 | 145 | _stream->close(); |
duke@435 | 146 | delete _stream; |
duke@435 | 147 | _stream = NULL; |
duke@435 | 148 | return; |
duke@435 | 149 | } |
duke@435 | 150 | _output = _stream; |
duke@435 | 151 | } else { |
duke@435 | 152 | // It would be nice if we could shut down cleanly but it should |
duke@435 | 153 | // be an error if we can't connect to the visualizer. |
duke@435 | 154 | fatal2("Couldn't connect to visualizer at %s:%d", PrintIdealGraphAddress, PrintIdealGraphPort); |
duke@435 | 155 | } |
duke@435 | 156 | } |
duke@435 | 157 | |
never@657 | 158 | _xml = new (ResourceObj::C_HEAP) xmlStream(_output); |
never@657 | 159 | |
never@657 | 160 | head(TOP_ELEMENT); |
duke@435 | 161 | } |
duke@435 | 162 | |
duke@435 | 163 | // Destructor, close file or network stream |
duke@435 | 164 | IdealGraphPrinter::~IdealGraphPrinter() { |
duke@435 | 165 | |
never@657 | 166 | tail(TOP_ELEMENT); |
never@657 | 167 | |
never@657 | 168 | // tty->print_cr("Walk time: %d", (int)_walk_time.milliseconds()); |
never@657 | 169 | // tty->print_cr("Output time: %d", (int)_output_time.milliseconds()); |
never@657 | 170 | // tty->print_cr("Build blocks time: %d", (int)_build_blocks_time.milliseconds()); |
never@657 | 171 | |
never@657 | 172 | if(_xml) { |
never@657 | 173 | delete _xml; |
never@657 | 174 | _xml = NULL; |
never@657 | 175 | } |
duke@435 | 176 | |
duke@435 | 177 | if (_stream) { |
duke@435 | 178 | delete _stream; |
duke@435 | 179 | if (_stream == _output) { |
duke@435 | 180 | _output = NULL; |
duke@435 | 181 | } |
duke@435 | 182 | _stream = NULL; |
duke@435 | 183 | } |
duke@435 | 184 | |
duke@435 | 185 | if (_output) { |
duke@435 | 186 | delete _output; |
duke@435 | 187 | _output = NULL; |
duke@435 | 188 | } |
duke@435 | 189 | } |
duke@435 | 190 | |
duke@435 | 191 | |
never@657 | 192 | void IdealGraphPrinter::begin_elem(const char *s) { |
never@657 | 193 | _xml->begin_elem(s); |
never@657 | 194 | } |
duke@435 | 195 | |
never@657 | 196 | void IdealGraphPrinter::end_elem() { |
never@657 | 197 | _xml->end_elem(); |
never@657 | 198 | } |
duke@435 | 199 | |
never@657 | 200 | void IdealGraphPrinter::begin_head(const char *s) { |
never@657 | 201 | _xml->begin_head(s); |
never@657 | 202 | } |
duke@435 | 203 | |
never@657 | 204 | void IdealGraphPrinter::end_head() { |
never@657 | 205 | _xml->end_head(); |
never@657 | 206 | } |
duke@435 | 207 | |
never@657 | 208 | void IdealGraphPrinter::print_attr(const char *name, intptr_t val) { |
never@657 | 209 | stringStream stream; |
never@657 | 210 | stream.print(INTX_FORMAT, val); |
never@657 | 211 | print_attr(name, stream.as_string()); |
never@657 | 212 | } |
duke@435 | 213 | |
never@657 | 214 | void IdealGraphPrinter::print_attr(const char *name, const char *val) { |
never@657 | 215 | _xml->print(" %s='", name); |
never@657 | 216 | text(val); |
never@657 | 217 | _xml->print("'"); |
never@657 | 218 | } |
duke@435 | 219 | |
never@657 | 220 | void IdealGraphPrinter::head(const char *name) { |
never@657 | 221 | _xml->head(name); |
never@657 | 222 | } |
duke@435 | 223 | |
never@657 | 224 | void IdealGraphPrinter::tail(const char *name) { |
never@657 | 225 | _xml->tail(name); |
never@657 | 226 | } |
duke@435 | 227 | |
never@657 | 228 | void IdealGraphPrinter::text(const char *s) { |
never@657 | 229 | _xml->text(s); |
never@657 | 230 | } |
never@657 | 231 | |
never@657 | 232 | void IdealGraphPrinter::print_prop(const char *name, int val) { |
never@657 | 233 | |
never@657 | 234 | stringStream stream; |
never@657 | 235 | stream.print("%d", val); |
never@657 | 236 | print_prop(name, stream.as_string()); |
never@657 | 237 | } |
never@657 | 238 | |
never@657 | 239 | void IdealGraphPrinter::print_prop(const char *name, const char *val) { |
never@657 | 240 | begin_head(PROPERTY_ELEMENT); |
never@657 | 241 | print_attr(PROPERTY_NAME_PROPERTY, name); |
never@657 | 242 | end_head(); |
never@657 | 243 | text(val); |
never@657 | 244 | tail(PROPERTY_ELEMENT); |
duke@435 | 245 | } |
duke@435 | 246 | |
duke@435 | 247 | void IdealGraphPrinter::print_method(ciMethod *method, int bci, InlineTree *tree) { |
never@657 | 248 | begin_head(METHOD_ELEMENT); |
duke@435 | 249 | |
duke@435 | 250 | stringStream str; |
duke@435 | 251 | method->print_name(&str); |
duke@435 | 252 | |
duke@435 | 253 | stringStream shortStr; |
duke@435 | 254 | method->print_short_name(&shortStr); |
duke@435 | 255 | |
never@657 | 256 | print_attr(METHOD_NAME_PROPERTY, str.as_string()); |
never@657 | 257 | print_attr(METHOD_SHORT_NAME_PROPERTY, shortStr.as_string()); |
never@657 | 258 | print_attr(METHOD_BCI_PROPERTY, bci); |
duke@435 | 259 | |
never@657 | 260 | end_head(); |
duke@435 | 261 | |
never@657 | 262 | head(BYTECODES_ELEMENT); |
duke@435 | 263 | output()->print_cr("<![CDATA["); |
duke@435 | 264 | method->print_codes_on(output()); |
duke@435 | 265 | output()->print_cr("]]>"); |
never@657 | 266 | tail(BYTECODES_ELEMENT); |
duke@435 | 267 | |
never@657 | 268 | head(INLINE_ELEMENT); |
duke@435 | 269 | if (tree != NULL) { |
duke@435 | 270 | GrowableArray<InlineTree *> subtrees = tree->subtrees(); |
duke@435 | 271 | for (int i = 0; i < subtrees.length(); i++) { |
duke@435 | 272 | print_inline_tree(subtrees.at(i)); |
duke@435 | 273 | } |
duke@435 | 274 | } |
never@657 | 275 | tail(INLINE_ELEMENT); |
duke@435 | 276 | |
never@657 | 277 | tail(METHOD_ELEMENT); |
duke@435 | 278 | output()->flush(); |
duke@435 | 279 | } |
duke@435 | 280 | |
duke@435 | 281 | void IdealGraphPrinter::print_inline_tree(InlineTree *tree) { |
duke@435 | 282 | |
duke@435 | 283 | if (tree == NULL) return; |
duke@435 | 284 | |
duke@435 | 285 | ciMethod *method = tree->method(); |
duke@435 | 286 | print_method(tree->method(), tree->caller_bci(), tree); |
duke@435 | 287 | |
duke@435 | 288 | } |
duke@435 | 289 | |
duke@435 | 290 | void IdealGraphPrinter::print_inlining(Compile* compile) { |
duke@435 | 291 | |
duke@435 | 292 | // Print inline tree |
duke@435 | 293 | if (_should_send_method) { |
duke@435 | 294 | InlineTree *inlineTree = compile->ilt(); |
duke@435 | 295 | if (inlineTree != NULL) { |
duke@435 | 296 | print_inline_tree(inlineTree); |
duke@435 | 297 | } else { |
duke@435 | 298 | // print this method only |
duke@435 | 299 | } |
duke@435 | 300 | } |
duke@435 | 301 | } |
duke@435 | 302 | |
duke@435 | 303 | // Has to be called whenever a method is compiled |
duke@435 | 304 | void IdealGraphPrinter::begin_method(Compile* compile) { |
duke@435 | 305 | |
duke@435 | 306 | ciMethod *method = compile->method(); |
duke@435 | 307 | assert(_output, "output stream must exist!"); |
duke@435 | 308 | assert(method, "null methods are not allowed!"); |
duke@435 | 309 | assert(!_current_method, "current method must be null!"); |
duke@435 | 310 | |
never@657 | 311 | head(GROUP_ELEMENT); |
duke@435 | 312 | |
never@657 | 313 | head(PROPERTIES_ELEMENT); |
duke@435 | 314 | |
duke@435 | 315 | // Print properties |
duke@435 | 316 | // Add method name |
duke@435 | 317 | stringStream strStream; |
duke@435 | 318 | method->print_name(&strStream); |
never@657 | 319 | print_prop(METHOD_NAME_PROPERTY, strStream.as_string()); |
duke@435 | 320 | |
duke@435 | 321 | if (method->flags().is_public()) { |
never@657 | 322 | print_prop(METHOD_IS_PUBLIC_PROPERTY, TRUE_VALUE); |
duke@435 | 323 | } |
duke@435 | 324 | |
duke@435 | 325 | if (method->flags().is_static()) { |
never@657 | 326 | print_prop(METHOD_IS_STATIC_PROPERTY, TRUE_VALUE); |
duke@435 | 327 | } |
duke@435 | 328 | |
never@657 | 329 | tail(PROPERTIES_ELEMENT); |
duke@435 | 330 | |
duke@435 | 331 | if (_stream) { |
duke@435 | 332 | char answer = 0; |
never@657 | 333 | _xml->flush(); |
duke@435 | 334 | int result = _stream->read(&answer, 1); |
duke@435 | 335 | _should_send_method = (answer == 'y'); |
duke@435 | 336 | } |
duke@435 | 337 | |
duke@435 | 338 | this->_current_method = method; |
duke@435 | 339 | |
never@657 | 340 | _xml->flush(); |
duke@435 | 341 | } |
duke@435 | 342 | |
duke@435 | 343 | // Has to be called whenever a method has finished compilation |
duke@435 | 344 | void IdealGraphPrinter::end_method() { |
duke@435 | 345 | |
duke@435 | 346 | nmethod* method = (nmethod*)this->_current_method->code(); |
duke@435 | 347 | |
never@657 | 348 | tail(GROUP_ELEMENT); |
duke@435 | 349 | _current_method = NULL; |
never@657 | 350 | _xml->flush(); |
duke@435 | 351 | } |
duke@435 | 352 | |
duke@435 | 353 | // Print indent |
duke@435 | 354 | void IdealGraphPrinter::print_indent() { |
never@657 | 355 | tty->print_cr("printing ident %d", _depth); |
duke@435 | 356 | for (int i = 0; i < _depth; i++) { |
never@657 | 357 | _xml->print(INDENT); |
duke@435 | 358 | } |
duke@435 | 359 | } |
duke@435 | 360 | |
duke@435 | 361 | bool IdealGraphPrinter::traverse_outs() { |
duke@435 | 362 | return _traverse_outs; |
duke@435 | 363 | } |
duke@435 | 364 | |
duke@435 | 365 | void IdealGraphPrinter::set_traverse_outs(bool b) { |
duke@435 | 366 | _traverse_outs = b; |
duke@435 | 367 | } |
duke@435 | 368 | |
never@657 | 369 | intptr_t IdealGraphPrinter::get_node_id(Node *n) { |
never@657 | 370 | return (intptr_t)(n); |
never@657 | 371 | } |
never@657 | 372 | |
never@657 | 373 | void IdealGraphPrinter::visit_node(Node *n, void *param) { |
never@657 | 374 | |
never@657 | 375 | if(param) { |
never@657 | 376 | |
never@657 | 377 | // Output edge |
never@657 | 378 | intptr_t dest_id = get_node_id(n); |
never@657 | 379 | for ( uint i = 0; i < n->len(); i++ ) { |
never@657 | 380 | if ( n->in(i) ) { |
never@657 | 381 | Node *source = n->in(i); |
never@657 | 382 | begin_elem(EDGE_ELEMENT); |
never@657 | 383 | intptr_t source_id = get_node_id(source); |
never@657 | 384 | print_attr(FROM_PROPERTY, source_id); |
never@657 | 385 | print_attr(TO_PROPERTY, dest_id); |
never@657 | 386 | print_attr(INDEX_PROPERTY, i); |
never@657 | 387 | end_elem(); |
never@657 | 388 | } |
never@657 | 389 | } |
never@657 | 390 | |
never@657 | 391 | } else { |
never@657 | 392 | |
never@657 | 393 | // Output node |
never@657 | 394 | begin_head(NODE_ELEMENT); |
never@657 | 395 | print_attr(NODE_ID_PROPERTY, get_node_id(n)); |
never@657 | 396 | end_head(); |
never@657 | 397 | |
never@657 | 398 | head(PROPERTIES_ELEMENT); |
never@657 | 399 | |
never@657 | 400 | Node *node = n; |
never@657 | 401 | #ifndef PRODUCT |
never@657 | 402 | node->_in_dump_cnt++; |
never@657 | 403 | print_prop(NODE_NAME_PROPERTY, (const char *)node->Name()); |
never@657 | 404 | const Type *t = node->bottom_type(); |
never@657 | 405 | print_prop("type", (const char *)Type::msg[t->base()]); |
never@657 | 406 | print_prop("idx", node->_idx); |
never@657 | 407 | #ifdef ASSERT |
never@657 | 408 | print_prop("debug_idx", node->_debug_idx); |
never@657 | 409 | #endif |
never@657 | 410 | |
never@657 | 411 | if(C->cfg() != NULL) { |
never@657 | 412 | Block *block = C->cfg()->_bbs[node->_idx]; |
never@657 | 413 | if(block == NULL) { |
never@657 | 414 | print_prop("block", C->cfg()->_blocks[0]->_pre_order); |
never@657 | 415 | } else { |
never@657 | 416 | print_prop("block", block->_pre_order); |
never@657 | 417 | } |
never@657 | 418 | } |
never@657 | 419 | |
never@657 | 420 | const jushort flags = node->flags(); |
never@657 | 421 | if (flags & Node::Flag_is_Copy) { |
never@657 | 422 | print_prop("is_copy", "true"); |
never@657 | 423 | } |
never@657 | 424 | if (flags & Node::Flag_is_Call) { |
never@657 | 425 | print_prop("is_call", "true"); |
never@657 | 426 | } |
never@657 | 427 | if (flags & Node::Flag_rematerialize) { |
never@657 | 428 | print_prop("rematerialize", "true"); |
never@657 | 429 | } |
never@657 | 430 | if (flags & Node::Flag_needs_anti_dependence_check) { |
never@657 | 431 | print_prop("needs_anti_dependence_check", "true"); |
never@657 | 432 | } |
never@657 | 433 | if (flags & Node::Flag_is_macro) { |
never@657 | 434 | print_prop("is_macro", "true"); |
never@657 | 435 | } |
never@657 | 436 | if (flags & Node::Flag_is_Con) { |
never@657 | 437 | print_prop("is_con", "true"); |
never@657 | 438 | } |
never@657 | 439 | if (flags & Node::Flag_is_cisc_alternate) { |
never@657 | 440 | print_prop("is_cisc_alternate", "true"); |
never@657 | 441 | } |
never@657 | 442 | if (flags & Node::Flag_is_Branch) { |
never@657 | 443 | print_prop("is_branch", "true"); |
never@657 | 444 | } |
never@657 | 445 | if (flags & Node::Flag_is_block_start) { |
never@657 | 446 | print_prop("is_block_start", "true"); |
never@657 | 447 | } |
never@657 | 448 | if (flags & Node::Flag_is_Goto) { |
never@657 | 449 | print_prop("is_goto", "true"); |
never@657 | 450 | } |
never@657 | 451 | if (flags & Node::Flag_is_dead_loop_safe) { |
never@657 | 452 | print_prop("is_dead_loop_safe", "true"); |
never@657 | 453 | } |
never@657 | 454 | if (flags & Node::Flag_may_be_short_branch) { |
never@657 | 455 | print_prop("may_be_short_branch", "true"); |
never@657 | 456 | } |
never@657 | 457 | if (flags & Node::Flag_is_safepoint_node) { |
never@657 | 458 | print_prop("is_safepoint_node", "true"); |
never@657 | 459 | } |
never@657 | 460 | if (flags & Node::Flag_is_pc_relative) { |
never@657 | 461 | print_prop("is_pc_relative", "true"); |
never@657 | 462 | } |
never@657 | 463 | |
never@657 | 464 | if (C->matcher() != NULL) { |
never@657 | 465 | if (C->matcher()->is_shared(node)) { |
never@657 | 466 | print_prop("is_shared", "true"); |
never@657 | 467 | } else { |
never@657 | 468 | print_prop("is_shared", "false"); |
never@657 | 469 | } |
never@657 | 470 | if (C->matcher()->is_dontcare(node)) { |
never@657 | 471 | print_prop("is_dontcare", "true"); |
never@657 | 472 | } else { |
never@657 | 473 | print_prop("is_dontcare", "false"); |
never@657 | 474 | } |
never@657 | 475 | |
never@685 | 476 | #ifdef ASSERT |
never@657 | 477 | Node* old = C->matcher()->find_old_node(node); |
never@657 | 478 | if (old != NULL) { |
never@657 | 479 | print_prop("old_node_idx", old->_idx); |
never@657 | 480 | } |
never@685 | 481 | #endif |
never@657 | 482 | } |
never@657 | 483 | |
never@657 | 484 | if (node->is_Proj()) { |
never@657 | 485 | print_prop("con", (int)node->as_Proj()->_con); |
never@657 | 486 | } |
never@657 | 487 | |
never@657 | 488 | if (node->is_Mach()) { |
never@657 | 489 | print_prop("idealOpcode", (const char *)NodeClassNames[node->as_Mach()->ideal_Opcode()]); |
never@657 | 490 | } |
never@657 | 491 | |
never@657 | 492 | buffer[0] = 0; |
never@657 | 493 | stringStream s2(buffer, sizeof(buffer) - 1); |
never@657 | 494 | |
never@657 | 495 | node->dump_spec(&s2); |
never@657 | 496 | if (t != NULL && (t->isa_instptr() || t->isa_klassptr())) { |
never@657 | 497 | const TypeInstPtr *toop = t->isa_instptr(); |
never@657 | 498 | const TypeKlassPtr *tkls = t->isa_klassptr(); |
never@657 | 499 | ciKlass* klass = toop ? toop->klass() : (tkls ? tkls->klass() : NULL ); |
never@657 | 500 | if( klass && klass->is_loaded() && klass->is_interface() ) { |
never@657 | 501 | s2.print(" Interface:"); |
never@657 | 502 | } else if( toop ) { |
never@657 | 503 | s2.print(" Oop:"); |
never@657 | 504 | } else if( tkls ) { |
never@657 | 505 | s2.print(" Klass:"); |
never@657 | 506 | } |
never@657 | 507 | t->dump_on(&s2); |
never@657 | 508 | } else if( t == Type::MEMORY ) { |
never@657 | 509 | s2.print(" Memory:"); |
never@657 | 510 | MemNode::dump_adr_type(node, node->adr_type(), &s2); |
never@657 | 511 | } |
never@657 | 512 | |
never@657 | 513 | assert(s2.size() < sizeof(buffer), "size in range"); |
never@657 | 514 | print_prop("dump_spec", buffer); |
never@657 | 515 | |
never@657 | 516 | if (node->is_block_proj()) { |
never@657 | 517 | print_prop("is_block_proj", "true"); |
never@657 | 518 | } |
never@657 | 519 | |
never@657 | 520 | if (node->is_block_start()) { |
never@657 | 521 | print_prop("is_block_start", "true"); |
never@657 | 522 | } |
never@657 | 523 | |
never@657 | 524 | const char *short_name = "short_name"; |
never@657 | 525 | if (strcmp(node->Name(), "Parm") == 0 && node->as_Proj()->_con >= TypeFunc::Parms) { |
never@657 | 526 | int index = node->as_Proj()->_con - TypeFunc::Parms; |
never@657 | 527 | if (index >= 10) { |
never@657 | 528 | print_prop(short_name, "PA"); |
never@657 | 529 | } else { |
never@657 | 530 | sprintf(buffer, "P%d", index); |
never@657 | 531 | print_prop(short_name, buffer); |
never@657 | 532 | } |
never@657 | 533 | } else if (strcmp(node->Name(), "IfTrue") == 0) { |
never@657 | 534 | print_prop(short_name, "T"); |
never@657 | 535 | } else if (strcmp(node->Name(), "IfFalse") == 0) { |
never@657 | 536 | print_prop(short_name, "F"); |
never@657 | 537 | } else if ((node->is_Con() && node->is_Type()) || node->is_Proj()) { |
never@657 | 538 | |
never@657 | 539 | if (t->base() == Type::Int && t->is_int()->is_con()) { |
never@657 | 540 | const TypeInt *typeInt = t->is_int(); |
never@657 | 541 | assert(typeInt->is_con(), "must be constant"); |
never@657 | 542 | jint value = typeInt->get_con(); |
never@657 | 543 | |
never@657 | 544 | // max. 2 chars allowed |
never@657 | 545 | if (value >= -9 && value <= 99) { |
never@657 | 546 | sprintf(buffer, "%d", value); |
never@657 | 547 | print_prop(short_name, buffer); |
never@657 | 548 | } else { |
never@657 | 549 | print_prop(short_name, "I"); |
never@657 | 550 | } |
never@657 | 551 | } else if (t == Type::TOP) { |
never@657 | 552 | print_prop(short_name, "^"); |
never@657 | 553 | } else if (t->base() == Type::Long && t->is_long()->is_con()) { |
never@657 | 554 | const TypeLong *typeLong = t->is_long(); |
never@657 | 555 | assert(typeLong->is_con(), "must be constant"); |
never@657 | 556 | jlong value = typeLong->get_con(); |
never@657 | 557 | |
never@657 | 558 | // max. 2 chars allowed |
never@657 | 559 | if (value >= -9 && value <= 99) { |
xlu@948 | 560 | sprintf(buffer, INT64_FORMAT, value); |
never@657 | 561 | print_prop(short_name, buffer); |
never@657 | 562 | } else { |
never@657 | 563 | print_prop(short_name, "L"); |
never@657 | 564 | } |
never@657 | 565 | } else if (t->base() == Type::KlassPtr) { |
never@657 | 566 | const TypeKlassPtr *typeKlass = t->is_klassptr(); |
never@657 | 567 | print_prop(short_name, "CP"); |
never@657 | 568 | } else if (t->base() == Type::Control) { |
never@657 | 569 | print_prop(short_name, "C"); |
never@657 | 570 | } else if (t->base() == Type::Memory) { |
never@657 | 571 | print_prop(short_name, "M"); |
never@657 | 572 | } else if (t->base() == Type::Abio) { |
never@657 | 573 | print_prop(short_name, "IO"); |
never@657 | 574 | } else if (t->base() == Type::Return_Address) { |
never@657 | 575 | print_prop(short_name, "RA"); |
never@657 | 576 | } else if (t->base() == Type::AnyPtr) { |
never@657 | 577 | print_prop(short_name, "P"); |
never@657 | 578 | } else if (t->base() == Type::RawPtr) { |
never@657 | 579 | print_prop(short_name, "RP"); |
never@657 | 580 | } else if (t->base() == Type::AryPtr) { |
never@657 | 581 | print_prop(short_name, "AP"); |
never@657 | 582 | } |
never@657 | 583 | } |
never@657 | 584 | |
never@657 | 585 | JVMState* caller = NULL; |
never@657 | 586 | if (node->is_SafePoint()) { |
never@657 | 587 | caller = node->as_SafePoint()->jvms(); |
never@657 | 588 | } else { |
never@657 | 589 | Node_Notes* notes = C->node_notes_at(node->_idx); |
never@657 | 590 | if (notes != NULL) { |
never@657 | 591 | caller = notes->jvms(); |
never@657 | 592 | } |
never@657 | 593 | } |
never@657 | 594 | |
never@657 | 595 | if (caller != NULL) { |
never@657 | 596 | stringStream bciStream; |
never@657 | 597 | while(caller) { |
never@657 | 598 | bciStream.print("%d ", caller->bci()); |
never@657 | 599 | caller = caller->caller(); |
never@657 | 600 | } |
never@657 | 601 | print_prop("bci", bciStream.as_string()); |
never@657 | 602 | } |
never@657 | 603 | |
never@657 | 604 | if (_chaitin && _chaitin != (PhaseChaitin *)0xdeadbeef) { |
never@657 | 605 | buffer[0] = 0; |
never@657 | 606 | _chaitin->dump_register(node, buffer); |
never@657 | 607 | print_prop("reg", buffer); |
never@657 | 608 | print_prop("lrg", _chaitin->n2lidx(node)); |
never@657 | 609 | } |
never@657 | 610 | |
never@657 | 611 | node->_in_dump_cnt--; |
never@657 | 612 | #endif |
never@657 | 613 | |
never@657 | 614 | tail(PROPERTIES_ELEMENT); |
never@657 | 615 | tail(NODE_ELEMENT); |
never@657 | 616 | } |
never@657 | 617 | } |
never@657 | 618 | |
never@657 | 619 | void IdealGraphPrinter::walk_nodes(Node *start, void *param) { |
duke@435 | 620 | |
duke@435 | 621 | |
duke@435 | 622 | VectorSet visited(Thread::current()->resource_area()); |
duke@435 | 623 | GrowableArray<Node *> nodeStack(Thread::current()->resource_area(), 0, 0, NULL); |
duke@435 | 624 | nodeStack.push(start); |
duke@435 | 625 | visited.test_set(start->_idx); |
duke@435 | 626 | while(nodeStack.length() > 0) { |
duke@435 | 627 | |
duke@435 | 628 | Node *n = nodeStack.pop(); |
never@657 | 629 | visit_node(n, param); |
duke@435 | 630 | |
duke@435 | 631 | if (_traverse_outs) { |
duke@435 | 632 | for (DUIterator i = n->outs(); n->has_out(i); i++) { |
duke@435 | 633 | Node* p = n->out(i); |
duke@435 | 634 | if (!visited.test_set(p->_idx)) { |
duke@435 | 635 | nodeStack.push(p); |
duke@435 | 636 | } |
duke@435 | 637 | } |
duke@435 | 638 | } |
duke@435 | 639 | |
duke@435 | 640 | for ( uint i = 0; i < n->len(); i++ ) { |
duke@435 | 641 | if ( n->in(i) ) { |
duke@435 | 642 | if (!visited.test_set(n->in(i)->_idx)) { |
duke@435 | 643 | nodeStack.push(n->in(i)); |
duke@435 | 644 | } |
duke@435 | 645 | } |
duke@435 | 646 | } |
duke@435 | 647 | } |
duke@435 | 648 | } |
duke@435 | 649 | |
duke@435 | 650 | void IdealGraphPrinter::print_method(Compile* compile, const char *name, int level, bool clear_nodes) { |
duke@435 | 651 | print(compile, name, (Node *)compile->root(), level, clear_nodes); |
duke@435 | 652 | } |
duke@435 | 653 | |
duke@435 | 654 | // Print current ideal graph |
duke@435 | 655 | void IdealGraphPrinter::print(Compile* compile, const char *name, Node *node, int level, bool clear_nodes) { |
duke@435 | 656 | |
duke@435 | 657 | if (!_current_method || !_should_send_method || level > PrintIdealGraphLevel) return; |
duke@435 | 658 | |
never@657 | 659 | this->C = compile; |
duke@435 | 660 | |
duke@435 | 661 | // Warning, unsafe cast? |
never@657 | 662 | _chaitin = (PhaseChaitin *)C->regalloc(); |
duke@435 | 663 | |
never@657 | 664 | begin_head(GRAPH_ELEMENT); |
never@657 | 665 | print_attr(GRAPH_NAME_PROPERTY, (const char *)name); |
never@657 | 666 | end_head(); |
duke@435 | 667 | |
never@657 | 668 | head(NODES_ELEMENT); |
never@657 | 669 | walk_nodes(node, NULL); |
never@657 | 670 | tail(NODES_ELEMENT); |
never@657 | 671 | |
never@657 | 672 | head(EDGES_ELEMENT); |
never@657 | 673 | walk_nodes(node, (void *)1); |
never@657 | 674 | tail(EDGES_ELEMENT); |
never@657 | 675 | if (C->cfg() != NULL) { |
never@657 | 676 | head(CONTROL_FLOW_ELEMENT); |
never@657 | 677 | for (uint i = 0; i < C->cfg()->_blocks.size(); i++) { |
never@657 | 678 | Block *b = C->cfg()->_blocks[i]; |
never@657 | 679 | begin_head(BLOCK_ELEMENT); |
never@657 | 680 | print_attr(BLOCK_NAME_PROPERTY, b->_pre_order); |
never@657 | 681 | end_head(); |
never@657 | 682 | |
never@657 | 683 | head(SUCCESSORS_ELEMENT); |
never@657 | 684 | for (uint s = 0; s < C->cfg()->_blocks[i]->_num_succs; s++) { |
never@657 | 685 | begin_elem(SUCCESSOR_ELEMENT); |
never@657 | 686 | print_attr(BLOCK_NAME_PROPERTY, b->_succs[s]->_pre_order); |
never@657 | 687 | end_elem(); |
never@657 | 688 | } |
never@657 | 689 | tail(SUCCESSORS_ELEMENT); |
never@657 | 690 | |
never@657 | 691 | tail(BLOCK_ELEMENT); |
duke@435 | 692 | } |
never@657 | 693 | |
never@657 | 694 | tail(CONTROL_FLOW_ELEMENT); |
duke@435 | 695 | } |
never@657 | 696 | tail(GRAPH_ELEMENT); |
never@657 | 697 | output()->flush(); |
duke@435 | 698 | } |
duke@435 | 699 | |
duke@435 | 700 | extern const char *NodeClassNames[]; |
duke@435 | 701 | |
duke@435 | 702 | outputStream *IdealGraphPrinter::output() { |
never@657 | 703 | return _xml; |
duke@435 | 704 | } |
duke@435 | 705 | |
duke@435 | 706 | #endif |