< prev index next >

src/hotspot/cpu/aarch64/c1_MacroAssembler_aarch64.cpp

Print this page

 11  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 12  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 13  * version 2 for more details (a copy is included in the LICENSE file that
 14  * accompanied this code).
 15  *
 16  * You should have received a copy of the GNU General Public License version
 17  * 2 along with this work; if not, write to the Free Software Foundation,
 18  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 19  *
 20  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 21  * or visit www.oracle.com if you need additional information or have any
 22  * questions.
 23  *
 24  */
 25 
 26 #include "precompiled.hpp"
 27 #include "c1/c1_MacroAssembler.hpp"
 28 #include "c1/c1_Runtime1.hpp"
 29 #include "gc/shared/barrierSetAssembler.hpp"
 30 #include "gc/shared/collectedHeap.hpp"


 31 #include "gc/shared/tlab_globals.hpp"
 32 #include "interpreter/interpreter.hpp"
 33 #include "oops/arrayOop.hpp"
 34 #include "oops/markWord.hpp"
 35 #include "runtime/basicLock.hpp"
 36 #include "runtime/os.hpp"
 37 #include "runtime/sharedRuntime.hpp"
 38 #include "runtime/stubRoutines.hpp"
 39 
 40 void C1_MacroAssembler::float_cmp(bool is_float, int unordered_result,
 41                                   FloatRegister f0, FloatRegister f1,
 42                                   Register result)
 43 {
 44   Label done;
 45   if (is_float) {
 46     fcmps(f0, f1);
 47   } else {
 48     fcmpd(f0, f1);
 49   }
 50   if (unordered_result < 0) {

 68   int null_check_offset = -1;
 69 
 70   verify_oop(obj);
 71 
 72   // save object being locked into the BasicObjectLock
 73   str(obj, Address(disp_hdr, BasicObjectLock::obj_offset_in_bytes()));
 74 
 75   null_check_offset = offset();
 76 
 77   if (DiagnoseSyncOnValueBasedClasses != 0) {
 78     load_klass(hdr, obj);
 79     ldrw(hdr, Address(hdr, Klass::access_flags_offset()));
 80     tstw(hdr, JVM_ACC_IS_VALUE_BASED_CLASS);
 81     br(Assembler::NE, slow_case);
 82   }
 83 
 84   // Load object header
 85   ldr(hdr, Address(obj, hdr_offset));
 86   // and mark it as unlocked
 87   orr(hdr, hdr, markWord::unlocked_value);






 88   // save unlocked object header into the displaced header location on the stack
 89   str(hdr, Address(disp_hdr, 0));
 90   // test if object header is still the same (i.e. unlocked), and if so, store the
 91   // displaced header address in the object header - if it is not the same, get the
 92   // object header instead
 93   lea(rscratch2, Address(obj, hdr_offset));
 94   cmpxchgptr(hdr, disp_hdr, rscratch2, rscratch1, done, /*fallthough*/NULL);
 95   // if the object header was the same, we're done
 96   // if the object header was not the same, it is now in the hdr register
 97   // => test if it is a stack pointer into the same stack (recursive locking), i.e.:
 98   //
 99   // 1) (hdr & aligned_mask) == 0
100   // 2) sp <= hdr
101   // 3) hdr <= sp + page_size
102   //
103   // these 3 tests can be done by evaluating the following expression:
104   //
105   // (hdr - sp) & (aligned_mask - page_size)
106   //
107   // assuming both the stack pointer and page_size have their least

144     cmpxchgptr(disp_hdr, hdr, rscratch1, rscratch2, done, &slow_case);
145   } else {
146     cmpxchgptr(disp_hdr, hdr, obj, rscratch2, done, &slow_case);
147   }
148   // done
149   bind(done);
150 }
151 
152 
153 // Defines obj, preserves var_size_in_bytes
154 void C1_MacroAssembler::try_allocate(Register obj, Register var_size_in_bytes, int con_size_in_bytes, Register t1, Register t2, Label& slow_case) {
155   if (UseTLAB) {
156     tlab_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, t2, slow_case);
157   } else {
158     eden_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, slow_case);
159   }
160 }
161 
162 void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register len, Register t1, Register t2) {
163   assert_different_registers(obj, klass, len);
164   // This assumes that all prototype bits fit in an int32_t
165   mov(t1, (int32_t)(intptr_t)markWord::prototype().value());






166   str(t1, Address(obj, oopDesc::mark_offset_in_bytes()));
167 
168   if (UseCompressedClassPointers) { // Take care not to kill klass
169     encode_klass_not_null(t1, klass);
170     strw(t1, Address(obj, oopDesc::klass_offset_in_bytes()));
171   } else {
172     str(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
173   }
174 
175   if (len->is_valid()) {
176     strw(len, Address(obj, arrayOopDesc::length_offset_in_bytes()));
177   } else if (UseCompressedClassPointers) {
178     store_klass_gap(obj, zr);
179   }
180 }
181 
182 // preserves obj, destroys len_in_bytes
183 //
184 // Scratch registers: t1 = r10, t2 = r11
185 //

225      const Register index = t2;
226      if (var_size_in_bytes != noreg) {
227        mov(index, var_size_in_bytes);
228        initialize_body(obj, index, hdr_size_in_bytes, t1, t2);
229      } else if (con_size_in_bytes > hdr_size_in_bytes) {
230        con_size_in_bytes -= hdr_size_in_bytes;
231        lea(t1, Address(obj, hdr_size_in_bytes));
232        zero_words(t1, con_size_in_bytes / BytesPerWord);
233      }
234   }
235 
236   membar(StoreStore);
237 
238   if (CURRENT_ENV->dtrace_alloc_probes()) {
239     assert(obj == r0, "must be");
240     far_call(RuntimeAddress(Runtime1::entry_for(Runtime1::dtrace_object_alloc_id)));
241   }
242 
243   verify_oop(obj);
244 }

245 void C1_MacroAssembler::allocate_array(Register obj, Register len, Register t1, Register t2, int header_size, int f, Register klass, Label& slow_case) {
246   assert_different_registers(obj, len, t1, t2, klass);
247 
248   // determine alignment mask
249   assert(!(BytesPerWord & 1), "must be a multiple of 2 for masking code to work");
250 
251   // check for negative or excessive length
252   mov(rscratch1, (int32_t)max_array_allocation_length);
253   cmp(len, rscratch1);
254   br(Assembler::HS, slow_case);
255 
256   const Register arr_size = t2; // okay to be the same
257   // align object end
258   mov(arr_size, (int32_t)header_size * BytesPerWord + MinObjAlignmentInBytesMask);
259   add(arr_size, arr_size, len, ext::uxtw, f);
260   andr(arr_size, arr_size, ~MinObjAlignmentInBytesMask);
261 
262   try_allocate(obj, arr_size, 0, t1, t2, slow_case);
263 
264   initialize_header(obj, klass, len, t1, t2);

269   membar(StoreStore);
270 
271   if (CURRENT_ENV->dtrace_alloc_probes()) {
272     assert(obj == r0, "must be");
273     far_call(RuntimeAddress(Runtime1::entry_for(Runtime1::dtrace_object_alloc_id)));
274   }
275 
276   verify_oop(obj);
277 }
278 
279 
280 void C1_MacroAssembler::inline_cache_check(Register receiver, Register iCache) {
281   verify_oop(receiver);
282   // explicit NULL check not needed since load from [klass_offset] causes a trap
283   // check against inline cache
284   assert(!MacroAssembler::needs_explicit_null_check(oopDesc::klass_offset_in_bytes()), "must add explicit null check");
285 
286   cmp_klass(receiver, iCache, rscratch1);
287 }
288 
















289 
290 void C1_MacroAssembler::build_frame(int framesize, int bang_size_in_bytes) {
291   assert(bang_size_in_bytes >= framesize, "stack bang size incorrect");
292   // Make sure there is enough stack space for this method's activation.
293   // Note that we do this before creating a frame.

294   generate_stack_overflow_check(bang_size_in_bytes);
295   MacroAssembler::build_frame(framesize);

296 
297   // Insert nmethod entry barrier into frame.
298   BarrierSetAssembler* bs = BarrierSet::barrier_set()->barrier_set_assembler();
299   bs->nmethod_entry_barrier(this);
300 }
301 
302 void C1_MacroAssembler::remove_frame(int framesize) {
303   MacroAssembler::remove_frame(framesize);



304 }
305 
306 
307 void C1_MacroAssembler::verified_entry() {
308   // If we have to make this method not-entrant we'll overwrite its
309   // first instruction with a jump.  For this action to be legal we
310   // must ensure that this first instruction is a B, BL, NOP, BKPT,
311   // SVC, HVC, or SMC.  Make it a NOP.
312   nop();


































































313 }
314 

315 void C1_MacroAssembler::load_parameter(int offset_in_words, Register reg) {
316   // rbp, + 0: link
317   //     + 1: return address
318   //     + 2: argument with offset 0
319   //     + 3: argument with offset 1
320   //     + 4: ...
321 
322   ldr(reg, Address(rfp, (offset_in_words + 2) * BytesPerWord));
323 }
324 
325 #ifndef PRODUCT
326 
327 void C1_MacroAssembler::verify_stack_oop(int stack_offset) {
328   if (!VerifyOops) return;
329   verify_oop_addr(Address(sp, stack_offset), "oop");
330 }
331 
332 void C1_MacroAssembler::verify_not_null_oop(Register r) {
333   if (!VerifyOops) return;
334   Label not_null;

 11  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 12  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 13  * version 2 for more details (a copy is included in the LICENSE file that
 14  * accompanied this code).
 15  *
 16  * You should have received a copy of the GNU General Public License version
 17  * 2 along with this work; if not, write to the Free Software Foundation,
 18  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 19  *
 20  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 21  * or visit www.oracle.com if you need additional information or have any
 22  * questions.
 23  *
 24  */
 25 
 26 #include "precompiled.hpp"
 27 #include "c1/c1_MacroAssembler.hpp"
 28 #include "c1/c1_Runtime1.hpp"
 29 #include "gc/shared/barrierSetAssembler.hpp"
 30 #include "gc/shared/collectedHeap.hpp"
 31 #include "gc/shared/barrierSet.hpp"
 32 #include "gc/shared/barrierSetAssembler.hpp"
 33 #include "gc/shared/tlab_globals.hpp"
 34 #include "interpreter/interpreter.hpp"
 35 #include "oops/arrayOop.hpp"
 36 #include "oops/markWord.hpp"
 37 #include "runtime/basicLock.hpp"
 38 #include "runtime/os.hpp"
 39 #include "runtime/sharedRuntime.hpp"
 40 #include "runtime/stubRoutines.hpp"
 41 
 42 void C1_MacroAssembler::float_cmp(bool is_float, int unordered_result,
 43                                   FloatRegister f0, FloatRegister f1,
 44                                   Register result)
 45 {
 46   Label done;
 47   if (is_float) {
 48     fcmps(f0, f1);
 49   } else {
 50     fcmpd(f0, f1);
 51   }
 52   if (unordered_result < 0) {

 70   int null_check_offset = -1;
 71 
 72   verify_oop(obj);
 73 
 74   // save object being locked into the BasicObjectLock
 75   str(obj, Address(disp_hdr, BasicObjectLock::obj_offset_in_bytes()));
 76 
 77   null_check_offset = offset();
 78 
 79   if (DiagnoseSyncOnValueBasedClasses != 0) {
 80     load_klass(hdr, obj);
 81     ldrw(hdr, Address(hdr, Klass::access_flags_offset()));
 82     tstw(hdr, JVM_ACC_IS_VALUE_BASED_CLASS);
 83     br(Assembler::NE, slow_case);
 84   }
 85 
 86   // Load object header
 87   ldr(hdr, Address(obj, hdr_offset));
 88   // and mark it as unlocked
 89   orr(hdr, hdr, markWord::unlocked_value);
 90 
 91   if (EnableValhalla) {
 92     // Mask always_locked bit such that we go to the slow path if object is an inline type
 93     andr(hdr, hdr, ~markWord::inline_type_bit_in_place);
 94   }
 95 
 96   // save unlocked object header into the displaced header location on the stack
 97   str(hdr, Address(disp_hdr, 0));
 98   // test if object header is still the same (i.e. unlocked), and if so, store the
 99   // displaced header address in the object header - if it is not the same, get the
100   // object header instead
101   lea(rscratch2, Address(obj, hdr_offset));
102   cmpxchgptr(hdr, disp_hdr, rscratch2, rscratch1, done, /*fallthough*/NULL);
103   // if the object header was the same, we're done
104   // if the object header was not the same, it is now in the hdr register
105   // => test if it is a stack pointer into the same stack (recursive locking), i.e.:
106   //
107   // 1) (hdr & aligned_mask) == 0
108   // 2) sp <= hdr
109   // 3) hdr <= sp + page_size
110   //
111   // these 3 tests can be done by evaluating the following expression:
112   //
113   // (hdr - sp) & (aligned_mask - page_size)
114   //
115   // assuming both the stack pointer and page_size have their least

152     cmpxchgptr(disp_hdr, hdr, rscratch1, rscratch2, done, &slow_case);
153   } else {
154     cmpxchgptr(disp_hdr, hdr, obj, rscratch2, done, &slow_case);
155   }
156   // done
157   bind(done);
158 }
159 
160 
161 // Defines obj, preserves var_size_in_bytes
162 void C1_MacroAssembler::try_allocate(Register obj, Register var_size_in_bytes, int con_size_in_bytes, Register t1, Register t2, Label& slow_case) {
163   if (UseTLAB) {
164     tlab_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, t2, slow_case);
165   } else {
166     eden_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, slow_case);
167   }
168 }
169 
170 void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register len, Register t1, Register t2) {
171   assert_different_registers(obj, klass, len);
172   if (EnableValhalla) {
173     // Need to copy markWord::prototype header for klass
174     assert_different_registers(obj, klass, len, t1, t2);
175     ldr(t1, Address(klass, Klass::prototype_header_offset()));
176   } else {
177     // This assumes that all prototype bits fit in an int32_t
178     mov(t1, (int32_t)(intptr_t)markWord::prototype().value());
179   }
180   str(t1, Address(obj, oopDesc::mark_offset_in_bytes()));
181 
182   if (UseCompressedClassPointers) { // Take care not to kill klass
183     encode_klass_not_null(t1, klass);
184     strw(t1, Address(obj, oopDesc::klass_offset_in_bytes()));
185   } else {
186     str(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
187   }
188 
189   if (len->is_valid()) {
190     strw(len, Address(obj, arrayOopDesc::length_offset_in_bytes()));
191   } else if (UseCompressedClassPointers) {
192     store_klass_gap(obj, zr);
193   }
194 }
195 
196 // preserves obj, destroys len_in_bytes
197 //
198 // Scratch registers: t1 = r10, t2 = r11
199 //

239      const Register index = t2;
240      if (var_size_in_bytes != noreg) {
241        mov(index, var_size_in_bytes);
242        initialize_body(obj, index, hdr_size_in_bytes, t1, t2);
243      } else if (con_size_in_bytes > hdr_size_in_bytes) {
244        con_size_in_bytes -= hdr_size_in_bytes;
245        lea(t1, Address(obj, hdr_size_in_bytes));
246        zero_words(t1, con_size_in_bytes / BytesPerWord);
247      }
248   }
249 
250   membar(StoreStore);
251 
252   if (CURRENT_ENV->dtrace_alloc_probes()) {
253     assert(obj == r0, "must be");
254     far_call(RuntimeAddress(Runtime1::entry_for(Runtime1::dtrace_object_alloc_id)));
255   }
256 
257   verify_oop(obj);
258 }
259 
260 void C1_MacroAssembler::allocate_array(Register obj, Register len, Register t1, Register t2, int header_size, int f, Register klass, Label& slow_case) {
261   assert_different_registers(obj, len, t1, t2, klass);
262 
263   // determine alignment mask
264   assert(!(BytesPerWord & 1), "must be a multiple of 2 for masking code to work");
265 
266   // check for negative or excessive length
267   mov(rscratch1, (int32_t)max_array_allocation_length);
268   cmp(len, rscratch1);
269   br(Assembler::HS, slow_case);
270 
271   const Register arr_size = t2; // okay to be the same
272   // align object end
273   mov(arr_size, (int32_t)header_size * BytesPerWord + MinObjAlignmentInBytesMask);
274   add(arr_size, arr_size, len, ext::uxtw, f);
275   andr(arr_size, arr_size, ~MinObjAlignmentInBytesMask);
276 
277   try_allocate(obj, arr_size, 0, t1, t2, slow_case);
278 
279   initialize_header(obj, klass, len, t1, t2);

284   membar(StoreStore);
285 
286   if (CURRENT_ENV->dtrace_alloc_probes()) {
287     assert(obj == r0, "must be");
288     far_call(RuntimeAddress(Runtime1::entry_for(Runtime1::dtrace_object_alloc_id)));
289   }
290 
291   verify_oop(obj);
292 }
293 
294 
295 void C1_MacroAssembler::inline_cache_check(Register receiver, Register iCache) {
296   verify_oop(receiver);
297   // explicit NULL check not needed since load from [klass_offset] causes a trap
298   // check against inline cache
299   assert(!MacroAssembler::needs_explicit_null_check(oopDesc::klass_offset_in_bytes()), "must add explicit null check");
300 
301   cmp_klass(receiver, iCache, rscratch1);
302 }
303 
304 void C1_MacroAssembler::build_frame_helper(int frame_size_in_bytes, int sp_inc, bool needs_stack_repair) {
305   MacroAssembler::build_frame(frame_size_in_bytes);
306 
307   if (needs_stack_repair) {
308     save_stack_increment(sp_inc, frame_size_in_bytes);
309   }
310 }
311 
312 void C1_MacroAssembler::build_frame(int frame_size_in_bytes, int bang_size_in_bytes, int sp_offset_for_orig_pc, bool needs_stack_repair, bool has_scalarized_args, Label* verified_inline_entry_label) {
313   if (has_scalarized_args) {
314     // Initialize orig_pc to detect deoptimization during buffering in the entry points
315     str(zr, Address(sp, sp_offset_for_orig_pc - frame_size_in_bytes));
316   }
317   if (!needs_stack_repair && verified_inline_entry_label != NULL) {
318     bind(*verified_inline_entry_label);
319   }
320 


321   // Make sure there is enough stack space for this method's activation.
322   // Note that we do this before creating a frame.
323   assert(bang_size_in_bytes >= frame_size_in_bytes, "stack bang size incorrect");
324   generate_stack_overflow_check(bang_size_in_bytes);
325 
326   build_frame_helper(frame_size_in_bytes, 0, needs_stack_repair);
327 
328   // Insert nmethod entry barrier into frame.
329   BarrierSetAssembler* bs = BarrierSet::barrier_set()->barrier_set_assembler();
330   bs->nmethod_entry_barrier(this);

331 
332   if (needs_stack_repair && verified_inline_entry_label != NULL) {
333     // Jump here from the scalarized entry points that require additional stack space
334     // for packing scalarized arguments and therefore already created the frame.
335     bind(*verified_inline_entry_label);
336   }
337 }
338 

339 void C1_MacroAssembler::verified_entry() {
340   // If we have to make this method not-entrant we'll overwrite its
341   // first instruction with a jump.  For this action to be legal we
342   // must ensure that this first instruction is a B, BL, NOP, BKPT,
343   // SVC, HVC, or SMC.  Make it a NOP.
344   nop();
345   if (C1Breakpoint) brk(1);
346 }
347 
348 int C1_MacroAssembler::scalarized_entry(const CompiledEntrySignature* ces, int frame_size_in_bytes, int bang_size_in_bytes, int sp_offset_for_orig_pc, Label& verified_inline_entry_label, bool is_inline_ro_entry) {
349   assert(InlineTypePassFieldsAsArgs, "sanity");
350   // Make sure there is enough stack space for this method's activation.
351   assert(bang_size_in_bytes >= frame_size_in_bytes, "stack bang size incorrect");
352   generate_stack_overflow_check(bang_size_in_bytes);
353 
354   GrowableArray<SigEntry>* sig    = &ces->sig();
355   GrowableArray<SigEntry>* sig_cc = is_inline_ro_entry ? &ces->sig_cc_ro() : &ces->sig_cc();
356   VMRegPair* regs      = ces->regs();
357   VMRegPair* regs_cc   = is_inline_ro_entry ? ces->regs_cc_ro() : ces->regs_cc();
358   int args_on_stack    = ces->args_on_stack();
359   int args_on_stack_cc = is_inline_ro_entry ? ces->args_on_stack_cc_ro() : ces->args_on_stack_cc();
360 
361   assert(sig->length() <= sig_cc->length(), "Zero-sized inline class not allowed!");
362   BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sig_cc->length());
363   int args_passed = sig->length();
364   int args_passed_cc = SigEntry::fill_sig_bt(sig_cc, sig_bt);
365 
366   // Check if we need to extend the stack for packing
367   int sp_inc = 0;
368   if (args_on_stack > args_on_stack_cc) {
369     sp_inc = extend_stack_for_inline_args(args_on_stack);
370   }
371 
372   // Create a temp frame so we can call into the runtime. It must be properly set up to accommodate GC.
373   build_frame_helper(frame_size_in_bytes, sp_inc, ces->c1_needs_stack_repair());
374 
375   // Initialize orig_pc to detect deoptimization during buffering in below runtime call
376   str(zr, Address(sp, sp_offset_for_orig_pc));
377 
378   // The runtime call might safepoint, make sure nmethod entry barrier is executed
379   BarrierSetAssembler* bs = BarrierSet::barrier_set()->barrier_set_assembler();
380   bs->nmethod_entry_barrier(this);
381 
382   // FIXME -- call runtime only if we cannot in-line allocate all the incoming inline type args.
383   mov(r19, (intptr_t) ces->method());
384   if (is_inline_ro_entry) {
385     far_call(RuntimeAddress(Runtime1::entry_for(Runtime1::buffer_inline_args_no_receiver_id)));
386   } else {
387     far_call(RuntimeAddress(Runtime1::entry_for(Runtime1::buffer_inline_args_id)));
388   }
389   int rt_call_offset = offset();
390 
391   // The runtime call returns the new array in r20 instead of the usual r0
392   // because r0 is also j_rarg7 which may be holding a live argument here.
393   Register val_array = r20;
394 
395   // Remove the temp frame
396   MacroAssembler::remove_frame(frame_size_in_bytes);
397 
398   shuffle_inline_args(true, is_inline_ro_entry, sig_cc,
399                       args_passed_cc, args_on_stack_cc, regs_cc, // from
400                       args_passed, args_on_stack, regs,          // to
401                       sp_inc, val_array);
402 
403   if (ces->c1_needs_stack_repair()) {
404     // Create the real frame. Below jump will then skip over the stack banging and frame
405     // setup code in the verified_inline_entry (which has a different real_frame_size).
406     build_frame_helper(frame_size_in_bytes, sp_inc, true);
407   }
408 
409   b(verified_inline_entry_label);
410   return rt_call_offset;
411 }
412 
413 
414 void C1_MacroAssembler::load_parameter(int offset_in_words, Register reg) {
415   // rbp, + 0: link
416   //     + 1: return address
417   //     + 2: argument with offset 0
418   //     + 3: argument with offset 1
419   //     + 4: ...
420 
421   ldr(reg, Address(rfp, (offset_in_words + 2) * BytesPerWord));
422 }
423 
424 #ifndef PRODUCT
425 
426 void C1_MacroAssembler::verify_stack_oop(int stack_offset) {
427   if (!VerifyOops) return;
428   verify_oop_addr(Address(sp, stack_offset), "oop");
429 }
430 
431 void C1_MacroAssembler::verify_not_null_oop(Register r) {
432   if (!VerifyOops) return;
433   Label not_null;
< prev index next >