< prev index next >

src/share/vm/opto/library_call.cpp

Print this page
rev 9080 : 8139040: Fix initializations before ShouldNotReachHere() etc. and enable -Wuninitialized on linux.
rev 9081 : imported patch more.patch

*** 2659,2669 **** // dependency which will confuse the scheduler. Node *mem = memory(alias_idx); // For now, we handle only those cases that actually exist: ints, // longs, and Object. Adding others should be straightforward. ! Node* load_store; switch(type) { case T_INT: if (kind == LS_xadd) { load_store = _gvn.transform(new GetAndAddINode(control(), mem, adr, newval, adr_type)); } else if (kind == LS_xchg) { --- 2659,2669 ---- // dependency which will confuse the scheduler. Node *mem = memory(alias_idx); // For now, we handle only those cases that actually exist: ints, // longs, and Object. Adding others should be straightforward. ! Node* load_store = NULL; switch(type) { case T_INT: if (kind == LS_xadd) { load_store = _gvn.transform(new GetAndAddINode(control(), mem, adr, newval, adr_type)); } else if (kind == LS_xchg) {
*** 3665,3675 **** Node* original = argument(0); Node* start = is_copyOfRange? argument(1): intcon(0); Node* end = is_copyOfRange? argument(2): argument(1); Node* array_type_mirror = is_copyOfRange? argument(3): argument(2); ! Node* newcopy; // Set the original stack and the reexecute bit for the interpreter to reexecute // the bytecode that invokes Arrays.copyOf if deoptimization happens. { PreserveReexecuteState preexecs(this); jvms()->set_should_reexecute(true); --- 3665,3675 ---- Node* original = argument(0); Node* start = is_copyOfRange? argument(1): intcon(0); Node* end = is_copyOfRange? argument(2): argument(1); Node* array_type_mirror = is_copyOfRange? argument(3): argument(2); ! Node* newcopy = NULL; // Set the original stack and the reexecute bit for the interpreter to reexecute // the bytecode that invokes Arrays.copyOf if deoptimization happens. { PreserveReexecuteState preexecs(this); jvms()->set_should_reexecute(true);
< prev index next >