Mercurial > hg > truffle
annotate src/cpu/x86/vm/c1_MacroAssembler_x86.cpp @ 3096:8073f5ad1d87
IdealGraphVisualizer: Rename predecessors to "Nodes Above" and successors to "Nodes Below" and actions "Expand Predecessors" and "Expand Successors" to "Expand Above" and "Expand Below" to avoid ambiguity with the Graal concept of successors and predecessors
author | Peter Hofer <peter.hofer@jku.at> |
---|---|
date | Wed, 29 Jun 2011 18:27:14 +0200 |
parents | 8b0236cbed14 |
children | b648304ba4ff |
rev | line source |
---|---|
0 | 1 /* |
2100
b1a2afa37ec4
7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis
phh
parents:
2002
diff
changeset
|
2 * Copyright (c) 1999, 2011, Oracle and/or its affiliates. All rights reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1295
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1295
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1295
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "c1/c1_MacroAssembler.hpp" | |
27 #include "c1/c1_Runtime1.hpp" | |
28 #include "classfile/systemDictionary.hpp" | |
29 #include "gc_interface/collectedHeap.hpp" | |
30 #include "interpreter/interpreter.hpp" | |
31 #include "oops/arrayOop.hpp" | |
32 #include "oops/markOop.hpp" | |
33 #include "runtime/basicLock.hpp" | |
34 #include "runtime/biasedLocking.hpp" | |
35 #include "runtime/os.hpp" | |
36 #include "runtime/stubRoutines.hpp" | |
0 | 37 |
38 int C1_MacroAssembler::lock_object(Register hdr, Register obj, Register disp_hdr, Register scratch, Label& slow_case) { | |
304 | 39 const int aligned_mask = BytesPerWord -1; |
0 | 40 const int hdr_offset = oopDesc::mark_offset_in_bytes(); |
41 assert(hdr == rax, "hdr must be rax, for the cmpxchg instruction"); | |
42 assert(hdr != obj && hdr != disp_hdr && obj != disp_hdr, "registers must be different"); | |
43 Label done; | |
44 int null_check_offset = -1; | |
45 | |
46 verify_oop(obj); | |
47 | |
48 // save object being locked into the BasicObjectLock | |
304 | 49 movptr(Address(disp_hdr, BasicObjectLock::obj_offset_in_bytes()), obj); |
0 | 50 |
51 if (UseBiasedLocking) { | |
52 assert(scratch != noreg, "should have scratch register at this point"); | |
53 null_check_offset = biased_locking_enter(disp_hdr, obj, hdr, scratch, false, done, &slow_case); | |
54 } else { | |
55 null_check_offset = offset(); | |
56 } | |
57 | |
58 // Load object header | |
304 | 59 movptr(hdr, Address(obj, hdr_offset)); |
0 | 60 // and mark it as unlocked |
304 | 61 orptr(hdr, markOopDesc::unlocked_value); |
0 | 62 // save unlocked object header into the displaced header location on the stack |
304 | 63 movptr(Address(disp_hdr, 0), hdr); |
0 | 64 // test if object header is still the same (i.e. unlocked), and if so, store the |
65 // displaced header address in the object header - if it is not the same, get the | |
66 // object header instead | |
67 if (os::is_MP()) MacroAssembler::lock(); // must be immediately before cmpxchg! | |
304 | 68 cmpxchgptr(disp_hdr, Address(obj, hdr_offset)); |
0 | 69 // if the object header was the same, we're done |
70 if (PrintBiasedLockingStatistics) { | |
71 cond_inc32(Assembler::equal, | |
72 ExternalAddress((address)BiasedLocking::fast_path_entry_count_addr())); | |
73 } | |
74 jcc(Assembler::equal, done); | |
75 // if the object header was not the same, it is now in the hdr register | |
76 // => test if it is a stack pointer into the same stack (recursive locking), i.e.: | |
77 // | |
78 // 1) (hdr & aligned_mask) == 0 | |
79 // 2) rsp <= hdr | |
80 // 3) hdr <= rsp + page_size | |
81 // | |
82 // these 3 tests can be done by evaluating the following expression: | |
83 // | |
84 // (hdr - rsp) & (aligned_mask - page_size) | |
85 // | |
86 // assuming both the stack pointer and page_size have their least | |
87 // significant 2 bits cleared and page_size is a power of 2 | |
304 | 88 subptr(hdr, rsp); |
89 andptr(hdr, aligned_mask - os::vm_page_size()); | |
0 | 90 // for recursive locking, the result is zero => save it in the displaced header |
91 // location (NULL in the displaced hdr location indicates recursive locking) | |
304 | 92 movptr(Address(disp_hdr, 0), hdr); |
0 | 93 // otherwise we don't care about the result and handle locking via runtime call |
94 jcc(Assembler::notZero, slow_case); | |
95 // done | |
96 bind(done); | |
97 return null_check_offset; | |
98 } | |
99 | |
100 | |
101 void C1_MacroAssembler::unlock_object(Register hdr, Register obj, Register disp_hdr, Label& slow_case) { | |
304 | 102 const int aligned_mask = BytesPerWord -1; |
0 | 103 const int hdr_offset = oopDesc::mark_offset_in_bytes(); |
104 assert(disp_hdr == rax, "disp_hdr must be rax, for the cmpxchg instruction"); | |
105 assert(hdr != obj && hdr != disp_hdr && obj != disp_hdr, "registers must be different"); | |
106 Label done; | |
107 | |
108 if (UseBiasedLocking) { | |
109 // load object | |
304 | 110 movptr(obj, Address(disp_hdr, BasicObjectLock::obj_offset_in_bytes())); |
0 | 111 biased_locking_exit(obj, hdr, done); |
112 } | |
113 | |
114 // load displaced header | |
304 | 115 movptr(hdr, Address(disp_hdr, 0)); |
0 | 116 // if the loaded hdr is NULL we had recursive locking |
304 | 117 testptr(hdr, hdr); |
0 | 118 // if we had recursive locking, we are done |
119 jcc(Assembler::zero, done); | |
120 if (!UseBiasedLocking) { | |
121 // load object | |
304 | 122 movptr(obj, Address(disp_hdr, BasicObjectLock::obj_offset_in_bytes())); |
0 | 123 } |
124 verify_oop(obj); | |
125 // test if object header is pointing to the displaced header, and if so, restore | |
126 // the displaced header in the object - if the object header is not pointing to | |
127 // the displaced header, get the object header instead | |
128 if (os::is_MP()) MacroAssembler::lock(); // must be immediately before cmpxchg! | |
304 | 129 cmpxchgptr(hdr, Address(obj, hdr_offset)); |
0 | 130 // if the object header was not pointing to the displaced header, |
131 // we do unlocking via runtime call | |
132 jcc(Assembler::notEqual, slow_case); | |
133 // done | |
134 bind(done); | |
135 } | |
136 | |
137 | |
138 // Defines obj, preserves var_size_in_bytes | |
139 void C1_MacroAssembler::try_allocate(Register obj, Register var_size_in_bytes, int con_size_in_bytes, Register t1, Register t2, Label& slow_case) { | |
140 if (UseTLAB) { | |
141 tlab_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, t2, slow_case); | |
142 } else { | |
143 eden_allocate(obj, var_size_in_bytes, con_size_in_bytes, t1, slow_case); | |
2100
b1a2afa37ec4
7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis
phh
parents:
2002
diff
changeset
|
144 incr_allocated_bytes(noreg, var_size_in_bytes, con_size_in_bytes, t1); |
0 | 145 } |
146 } | |
147 | |
148 | |
149 void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register len, Register t1, Register t2) { | |
150 assert_different_registers(obj, klass, len); | |
151 if (UseBiasedLocking && !len->is_valid()) { | |
152 assert_different_registers(obj, klass, len, t1, t2); | |
304 | 153 movptr(t1, Address(klass, Klass::prototype_header_offset_in_bytes() + klassOopDesc::klass_part_offset_in_bytes())); |
154 movptr(Address(obj, oopDesc::mark_offset_in_bytes()), t1); | |
0 | 155 } else { |
304 | 156 // This assumes that all prototype bits fit in an int32_t |
157 movptr(Address(obj, oopDesc::mark_offset_in_bytes ()), (int32_t)(intptr_t)markOopDesc::prototype()); | |
0 | 158 } |
2002 | 159 #ifdef _LP64 |
160 if (UseCompressedOops) { // Take care not to kill klass | |
161 movptr(t1, klass); | |
162 encode_heap_oop_not_null(t1); | |
163 movl(Address(obj, oopDesc::klass_offset_in_bytes()), t1); | |
164 } else | |
165 #endif | |
166 { | |
167 movptr(Address(obj, oopDesc::klass_offset_in_bytes()), klass); | |
168 } | |
0 | 169 |
170 if (len->is_valid()) { | |
171 movl(Address(obj, arrayOopDesc::length_offset_in_bytes()), len); | |
172 } | |
2002 | 173 #ifdef _LP64 |
174 else if (UseCompressedOops) { | |
175 xorptr(t1, t1); | |
176 store_klass_gap(obj, t1); | |
177 } | |
178 #endif | |
0 | 179 } |
180 | |
181 | |
182 // preserves obj, destroys len_in_bytes | |
183 void C1_MacroAssembler::initialize_body(Register obj, Register len_in_bytes, int hdr_size_in_bytes, Register t1) { | |
184 Label done; | |
185 assert(obj != len_in_bytes && obj != t1 && t1 != len_in_bytes, "registers must be different"); | |
186 assert((hdr_size_in_bytes & (BytesPerWord - 1)) == 0, "header size is not a multiple of BytesPerWord"); | |
187 Register index = len_in_bytes; | |
304 | 188 // index is positive and ptr sized |
189 subptr(index, hdr_size_in_bytes); | |
0 | 190 jcc(Assembler::zero, done); |
191 // initialize topmost word, divide index by 2, check if odd and test if zero | |
192 // note: for the remaining code to work, index must be a multiple of BytesPerWord | |
193 #ifdef ASSERT | |
194 { Label L; | |
304 | 195 testptr(index, BytesPerWord - 1); |
0 | 196 jcc(Assembler::zero, L); |
197 stop("index is not a multiple of BytesPerWord"); | |
198 bind(L); | |
199 } | |
200 #endif | |
304 | 201 xorptr(t1, t1); // use _zero reg to clear memory (shorter code) |
0 | 202 if (UseIncDec) { |
304 | 203 shrptr(index, 3); // divide by 8/16 and set carry flag if bit 2 was set |
0 | 204 } else { |
304 | 205 shrptr(index, 2); // use 2 instructions to avoid partial flag stall |
206 shrptr(index, 1); | |
0 | 207 } |
304 | 208 #ifndef _LP64 |
0 | 209 // index could have been not a multiple of 8 (i.e., bit 2 was set) |
210 { Label even; | |
211 // note: if index was a multiple of 8, than it cannot | |
212 // be 0 now otherwise it must have been 0 before | |
213 // => if it is even, we don't need to check for 0 again | |
214 jcc(Assembler::carryClear, even); | |
215 // clear topmost word (no jump needed if conditional assignment would work here) | |
304 | 216 movptr(Address(obj, index, Address::times_8, hdr_size_in_bytes - 0*BytesPerWord), t1); |
0 | 217 // index could be 0 now, need to check again |
218 jcc(Assembler::zero, done); | |
219 bind(even); | |
220 } | |
304 | 221 #endif // !_LP64 |
0 | 222 // initialize remaining object fields: rdx is a multiple of 2 now |
223 { Label loop; | |
224 bind(loop); | |
304 | 225 movptr(Address(obj, index, Address::times_8, hdr_size_in_bytes - 1*BytesPerWord), t1); |
226 NOT_LP64(movptr(Address(obj, index, Address::times_8, hdr_size_in_bytes - 2*BytesPerWord), t1);) | |
0 | 227 decrement(index); |
228 jcc(Assembler::notZero, loop); | |
229 } | |
230 | |
231 // done | |
232 bind(done); | |
233 } | |
234 | |
235 | |
236 void C1_MacroAssembler::allocate_object(Register obj, Register t1, Register t2, int header_size, int object_size, Register klass, Label& slow_case) { | |
237 assert(obj == rax, "obj must be in rax, for cmpxchg"); | |
2100
b1a2afa37ec4
7003271: Hotspot should track cumulative Java heap bytes allocated on a per-thread basis
phh
parents:
2002
diff
changeset
|
238 assert_different_registers(obj, t1, t2); // XXX really? |
0 | 239 assert(header_size >= 0 && object_size >= header_size, "illegal sizes"); |
240 | |
241 try_allocate(obj, noreg, object_size * BytesPerWord, t1, t2, slow_case); | |
242 | |
243 initialize_object(obj, klass, noreg, object_size * HeapWordSize, t1, t2); | |
244 } | |
245 | |
246 void C1_MacroAssembler::initialize_object(Register obj, Register klass, Register var_size_in_bytes, int con_size_in_bytes, Register t1, Register t2) { | |
247 assert((con_size_in_bytes & MinObjAlignmentInBytesMask) == 0, | |
248 "con_size_in_bytes is not multiple of alignment"); | |
2002 | 249 const int hdr_size_in_bytes = instanceOopDesc::header_size() * HeapWordSize; |
0 | 250 |
251 initialize_header(obj, klass, noreg, t1, t2); | |
252 | |
253 // clear rest of allocated space | |
254 const Register t1_zero = t1; | |
255 const Register index = t2; | |
256 const int threshold = 6 * BytesPerWord; // approximate break even point for code size (see comments below) | |
257 if (var_size_in_bytes != noreg) { | |
304 | 258 mov(index, var_size_in_bytes); |
0 | 259 initialize_body(obj, index, hdr_size_in_bytes, t1_zero); |
260 } else if (con_size_in_bytes <= threshold) { | |
261 // use explicit null stores | |
262 // code size = 2 + 3*n bytes (n = number of fields to clear) | |
304 | 263 xorptr(t1_zero, t1_zero); // use t1_zero reg to clear memory (shorter code) |
0 | 264 for (int i = hdr_size_in_bytes; i < con_size_in_bytes; i += BytesPerWord) |
304 | 265 movptr(Address(obj, i), t1_zero); |
0 | 266 } else if (con_size_in_bytes > hdr_size_in_bytes) { |
267 // use loop to null out the fields | |
268 // code size = 16 bytes for even n (n = number of fields to clear) | |
269 // initialize last object field first if odd number of fields | |
304 | 270 xorptr(t1_zero, t1_zero); // use t1_zero reg to clear memory (shorter code) |
271 movptr(index, (con_size_in_bytes - hdr_size_in_bytes) >> 3); | |
0 | 272 // initialize last object field if constant size is odd |
273 if (((con_size_in_bytes - hdr_size_in_bytes) & 4) != 0) | |
304 | 274 movptr(Address(obj, con_size_in_bytes - (1*BytesPerWord)), t1_zero); |
0 | 275 // initialize remaining object fields: rdx is a multiple of 2 |
276 { Label loop; | |
277 bind(loop); | |
304 | 278 movptr(Address(obj, index, Address::times_8, hdr_size_in_bytes - (1*BytesPerWord)), |
279 t1_zero); | |
280 NOT_LP64(movptr(Address(obj, index, Address::times_8, hdr_size_in_bytes - (2*BytesPerWord)), | |
281 t1_zero);) | |
0 | 282 decrement(index); |
283 jcc(Assembler::notZero, loop); | |
284 } | |
285 } | |
3064
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
286 |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
287 // (tw) fix me |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
288 // if (CURRENT_ENV->dtrace_alloc_probes()) { |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
289 // assert(obj == rax, "must be"); |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
290 // call(RuntimeAddress(Runtime1::entry_for(Runtime1::dtrace_object_alloc_id))); |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
291 // } |
0 | 292 |
293 verify_oop(obj); | |
294 } | |
295 | |
296 void C1_MacroAssembler::allocate_array(Register obj, Register len, Register t1, Register t2, int header_size, Address::ScaleFactor f, Register klass, Label& slow_case) { | |
297 assert(obj == rax, "obj must be in rax, for cmpxchg"); | |
298 assert_different_registers(obj, len, t1, t2, klass); | |
299 | |
300 // determine alignment mask | |
304 | 301 assert(!(BytesPerWord & 1), "must be a multiple of 2 for masking code to work"); |
0 | 302 |
303 // check for negative or excessive length | |
304 | 304 cmpptr(len, (int32_t)max_array_allocation_length); |
0 | 305 jcc(Assembler::above, slow_case); |
306 | |
307 const Register arr_size = t2; // okay to be the same | |
308 // align object end | |
304 | 309 movptr(arr_size, (int32_t)header_size * BytesPerWord + MinObjAlignmentInBytesMask); |
310 lea(arr_size, Address(arr_size, len, f)); | |
311 andptr(arr_size, ~MinObjAlignmentInBytesMask); | |
0 | 312 |
313 try_allocate(obj, arr_size, 0, t1, t2, slow_case); | |
314 | |
315 initialize_header(obj, klass, len, t1, t2); | |
316 | |
317 // clear rest of allocated space | |
318 const Register len_zero = len; | |
319 initialize_body(obj, arr_size, header_size * BytesPerWord, len_zero); | |
320 | |
3064
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
321 // (tw) fix me |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
322 // if (CURRENT_ENV->dtrace_alloc_probes()) { |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
323 // assert(obj == rax, "must be"); |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
324 // call(RuntimeAddress(Runtime1::entry_for(Runtime1::dtrace_object_alloc_id))); |
8b0236cbed14
Make sure that the compiler is initialized at startup (and not on the first compiled method).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2100
diff
changeset
|
325 // } |
0 | 326 |
327 verify_oop(obj); | |
328 } | |
329 | |
330 | |
331 | |
332 void C1_MacroAssembler::inline_cache_check(Register receiver, Register iCache) { | |
333 verify_oop(receiver); | |
334 // explicit NULL check not needed since load from [klass_offset] causes a trap | |
335 // check against inline cache | |
336 assert(!MacroAssembler::needs_explicit_null_check(oopDesc::klass_offset_in_bytes()), "must add explicit null check"); | |
337 int start_offset = offset(); | |
2002 | 338 |
339 if (UseCompressedOops) { | |
340 load_klass(rscratch1, receiver); | |
341 cmpptr(rscratch1, iCache); | |
342 } else { | |
343 cmpptr(iCache, Address(receiver, oopDesc::klass_offset_in_bytes())); | |
344 } | |
0 | 345 // if icache check fails, then jump to runtime routine |
346 // Note: RECEIVER must still contain the receiver! | |
347 jump_cc(Assembler::notEqual, | |
348 RuntimeAddress(SharedRuntime::get_ic_miss_stub())); | |
304 | 349 const int ic_cmp_size = LP64_ONLY(10) NOT_LP64(9); |
2002 | 350 assert(UseCompressedOops || offset() - start_offset == ic_cmp_size, "check alignment in emit_method_entry"); |
0 | 351 } |
352 | |
353 | |
354 void C1_MacroAssembler::build_frame(int frame_size_in_bytes) { | |
355 // Make sure there is enough stack space for this method's activation. | |
356 // Note that we do this before doing an enter(). This matches the | |
357 // ordering of C2's stack overflow check / rsp decrement and allows | |
358 // the SharedRuntime stack overflow handling to be consistent | |
359 // between the two compilers. | |
360 generate_stack_overflow_check(frame_size_in_bytes); | |
361 | |
1295 | 362 push(rbp); |
0 | 363 #ifdef TIERED |
364 // c2 leaves fpu stack dirty. Clean it on entry | |
365 if (UseSSE < 2 ) { | |
366 empty_FPU_stack(); | |
367 } | |
368 #endif // TIERED | |
369 decrement(rsp, frame_size_in_bytes); // does not emit code for frame_size == 0 | |
370 } | |
371 | |
372 | |
1295 | 373 void C1_MacroAssembler::remove_frame(int frame_size_in_bytes) { |
374 increment(rsp, frame_size_in_bytes); // Does not emit code for frame_size == 0 | |
375 pop(rbp); | |
376 } | |
377 | |
378 | |
0 | 379 void C1_MacroAssembler::unverified_entry(Register receiver, Register ic_klass) { |
380 if (C1Breakpoint) int3(); | |
381 inline_cache_check(receiver, ic_klass); | |
382 } | |
383 | |
384 | |
385 void C1_MacroAssembler::verified_entry() { | |
386 if (C1Breakpoint)int3(); | |
387 // build frame | |
388 verify_FPU(0, "method_entry"); | |
389 } | |
390 | |
391 | |
392 #ifndef PRODUCT | |
393 | |
394 void C1_MacroAssembler::verify_stack_oop(int stack_offset) { | |
395 if (!VerifyOops) return; | |
396 verify_oop_addr(Address(rsp, stack_offset)); | |
397 } | |
398 | |
399 void C1_MacroAssembler::verify_not_null_oop(Register r) { | |
400 if (!VerifyOops) return; | |
401 Label not_null; | |
304 | 402 testptr(r, r); |
0 | 403 jcc(Assembler::notZero, not_null); |
404 stop("non-null oop required"); | |
405 bind(not_null); | |
406 verify_oop(r); | |
407 } | |
408 | |
409 void C1_MacroAssembler::invalidate_registers(bool inv_rax, bool inv_rbx, bool inv_rcx, bool inv_rdx, bool inv_rsi, bool inv_rdi) { | |
410 #ifdef ASSERT | |
304 | 411 if (inv_rax) movptr(rax, 0xDEAD); |
412 if (inv_rbx) movptr(rbx, 0xDEAD); | |
413 if (inv_rcx) movptr(rcx, 0xDEAD); | |
414 if (inv_rdx) movptr(rdx, 0xDEAD); | |
415 if (inv_rsi) movptr(rsi, 0xDEAD); | |
416 if (inv_rdi) movptr(rdi, 0xDEAD); | |
0 | 417 #endif |
418 } | |
419 | |
420 #endif // ifndef PRODUCT |