< prev index next >

src/share/vm/opto/escape.cpp

Print this page
rev 8979 : [mq]: vmerr_static

*** 980,990 **** strcmp(call->as_CallLeaf()->_name, "mulAdd") == 0 || strcmp(call->as_CallLeaf()->_name, "montgomery_multiply") == 0 || strcmp(call->as_CallLeaf()->_name, "montgomery_square") == 0) ))) { call->dump(); ! fatal(err_msg_res("EA unexpected CallLeaf %s", call->as_CallLeaf()->_name)); } #endif // Always process arraycopy's destination object since // we need to add all possible edges to references in // source object. --- 980,990 ---- strcmp(call->as_CallLeaf()->_name, "mulAdd") == 0 || strcmp(call->as_CallLeaf()->_name, "montgomery_multiply") == 0 || strcmp(call->as_CallLeaf()->_name, "montgomery_square") == 0) ))) { call->dump(); ! fatal("EA unexpected CallLeaf %s", call->as_CallLeaf()->_name); } #endif // Always process arraycopy's destination object since // we need to add all possible edges to references in // source object.
*** 1199,1210 **** if (C->log() != NULL) { C->log()->begin_elem("connectionGraph_bailout reason='reached "); C->log()->text("%s", timeout ? "time" : "iterations"); C->log()->end_elem(" limit'"); } ! assert(ExitEscapeAnalysisOnTimeout, err_msg_res("infinite EA connection graph build (%f sec, %d iterations) with %d nodes and worklist size %d", ! time.seconds(), iterations, nodes_size(), ptnodes_worklist.length())); // Possible infinite build_connection_graph loop, // bailout (no changes to ideal graph were made). return false; } #ifdef ASSERT --- 1199,1210 ---- if (C->log() != NULL) { C->log()->begin_elem("connectionGraph_bailout reason='reached "); C->log()->text("%s", timeout ? "time" : "iterations"); C->log()->end_elem(" limit'"); } ! assert(ExitEscapeAnalysisOnTimeout, "infinite EA connection graph build (%f sec, %d iterations) with %d nodes and worklist size %d", ! time.seconds(), iterations, nodes_size(), ptnodes_worklist.length()); // Possible infinite build_connection_graph loop, // bailout (no changes to ideal graph were made). return false; } #ifdef ASSERT
< prev index next >