equal
deleted
inserted
replaced
980 strcmp(call->as_CallLeaf()->_name, "mulAdd") == 0 || |
980 strcmp(call->as_CallLeaf()->_name, "mulAdd") == 0 || |
981 strcmp(call->as_CallLeaf()->_name, "montgomery_multiply") == 0 || |
981 strcmp(call->as_CallLeaf()->_name, "montgomery_multiply") == 0 || |
982 strcmp(call->as_CallLeaf()->_name, "montgomery_square") == 0) |
982 strcmp(call->as_CallLeaf()->_name, "montgomery_square") == 0) |
983 ))) { |
983 ))) { |
984 call->dump(); |
984 call->dump(); |
985 fatal(err_msg_res("EA unexpected CallLeaf %s", call->as_CallLeaf()->_name)); |
985 fatal("EA unexpected CallLeaf %s", call->as_CallLeaf()->_name); |
986 } |
986 } |
987 #endif |
987 #endif |
988 // Always process arraycopy's destination object since |
988 // Always process arraycopy's destination object since |
989 // we need to add all possible edges to references in |
989 // we need to add all possible edges to references in |
990 // source object. |
990 // source object. |
1199 if (C->log() != NULL) { |
1199 if (C->log() != NULL) { |
1200 C->log()->begin_elem("connectionGraph_bailout reason='reached "); |
1200 C->log()->begin_elem("connectionGraph_bailout reason='reached "); |
1201 C->log()->text("%s", timeout ? "time" : "iterations"); |
1201 C->log()->text("%s", timeout ? "time" : "iterations"); |
1202 C->log()->end_elem(" limit'"); |
1202 C->log()->end_elem(" limit'"); |
1203 } |
1203 } |
1204 assert(ExitEscapeAnalysisOnTimeout, err_msg_res("infinite EA connection graph build (%f sec, %d iterations) with %d nodes and worklist size %d", |
1204 assert(ExitEscapeAnalysisOnTimeout, "infinite EA connection graph build (%f sec, %d iterations) with %d nodes and worklist size %d", |
1205 time.seconds(), iterations, nodes_size(), ptnodes_worklist.length())); |
1205 time.seconds(), iterations, nodes_size(), ptnodes_worklist.length()); |
1206 // Possible infinite build_connection_graph loop, |
1206 // Possible infinite build_connection_graph loop, |
1207 // bailout (no changes to ideal graph were made). |
1207 // bailout (no changes to ideal graph were made). |
1208 return false; |
1208 return false; |
1209 } |
1209 } |
1210 #ifdef ASSERT |
1210 #ifdef ASSERT |