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