Print this page
rev 6886 : 8058251: assert(_count > 0) failed: Negative counter when running runtime/NMT/MallocTrackingVerify.java
Summary: Fixed an issue when overflowing the MallocSite hash table bucket
Reviewed-by: coleenp, gtriantafill
Split |
Split |
Close |
Expand all |
Collapse all |
--- old/hotspot/src/share/vm/runtime/os.cpp
+++ new/hotspot/src/share/vm/runtime/os.cpp
1 1 /*
2 2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #include "precompiled.hpp"
26 26 #include "classfile/classLoader.hpp"
27 27 #include "classfile/javaClasses.hpp"
28 28 #include "classfile/systemDictionary.hpp"
29 29 #include "classfile/vmSymbols.hpp"
30 30 #include "code/icBuffer.hpp"
31 31 #include "code/vtableStubs.hpp"
32 32 #include "gc_implementation/shared/vmGCOperations.hpp"
33 33 #include "interpreter/interpreter.hpp"
34 34 #include "memory/allocation.inline.hpp"
35 35 #ifdef ASSERT
36 36 #include "memory/guardedMemory.hpp"
37 37 #endif
38 38 #include "oops/oop.inline.hpp"
39 39 #include "prims/jvm.h"
40 40 #include "prims/jvm_misc.hpp"
41 41 #include "prims/privilegedStack.hpp"
42 42 #include "runtime/arguments.hpp"
43 43 #include "runtime/frame.inline.hpp"
44 44 #include "runtime/interfaceSupport.hpp"
45 45 #include "runtime/java.hpp"
46 46 #include "runtime/javaCalls.hpp"
47 47 #include "runtime/mutexLocker.hpp"
48 48 #include "runtime/os.hpp"
49 49 #include "runtime/stubRoutines.hpp"
50 50 #include "runtime/thread.inline.hpp"
51 51 #include "services/attachListener.hpp"
52 52 #include "services/nmtCommon.hpp"
53 53 #include "services/mallocTracker.hpp"
54 54 #include "services/memTracker.hpp"
55 55 #include "services/threadService.hpp"
56 56 #include "utilities/defaultStream.hpp"
57 57 #include "utilities/events.hpp"
58 58 #ifdef TARGET_OS_FAMILY_linux
59 59 # include "os_linux.inline.hpp"
60 60 #endif
61 61 #ifdef TARGET_OS_FAMILY_solaris
62 62 # include "os_solaris.inline.hpp"
63 63 #endif
64 64 #ifdef TARGET_OS_FAMILY_windows
65 65 # include "os_windows.inline.hpp"
66 66 #endif
67 67 #ifdef TARGET_OS_FAMILY_bsd
68 68 # include "os_bsd.inline.hpp"
69 69 #endif
70 70
71 71 # include <signal.h>
72 72
73 73 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
74 74
75 75 OSThread* os::_starting_thread = NULL;
76 76 address os::_polling_page = NULL;
77 77 volatile int32_t* os::_mem_serialize_page = NULL;
78 78 uintptr_t os::_serialize_page_mask = 0;
79 79 long os::_rand_seed = 1;
80 80 int os::_processor_count = 0;
81 81 size_t os::_page_sizes[os::page_sizes_max];
82 82
83 83 #ifndef PRODUCT
84 84 julong os::num_mallocs = 0; // # of calls to malloc/realloc
85 85 julong os::alloc_bytes = 0; // # of bytes allocated
86 86 julong os::num_frees = 0; // # of calls to free
87 87 julong os::free_bytes = 0; // # of bytes freed
88 88 #endif
89 89
90 90 static juint cur_malloc_words = 0; // current size for MallocMaxTestWords
91 91
92 92 void os_init_globals() {
93 93 // Called from init_globals().
94 94 // See Threads::create_vm() in thread.cpp, and init.cpp.
95 95 os::init_globals();
96 96 }
97 97
98 98 // Fill in buffer with current local time as an ISO-8601 string.
99 99 // E.g., yyyy-mm-ddThh:mm:ss-zzzz.
100 100 // Returns buffer, or NULL if it failed.
101 101 // This would mostly be a call to
102 102 // strftime(...., "%Y-%m-%d" "T" "%H:%M:%S" "%z", ....)
103 103 // except that on Windows the %z behaves badly, so we do it ourselves.
104 104 // Also, people wanted milliseconds on there,
105 105 // and strftime doesn't do milliseconds.
106 106 char* os::iso8601_time(char* buffer, size_t buffer_length) {
107 107 // Output will be of the form "YYYY-MM-DDThh:mm:ss.mmm+zzzz\0"
108 108 // 1 2
109 109 // 12345678901234567890123456789
110 110 static const char* iso8601_format =
111 111 "%04d-%02d-%02dT%02d:%02d:%02d.%03d%c%02d%02d";
112 112 static const size_t needed_buffer = 29;
113 113
114 114 // Sanity check the arguments
115 115 if (buffer == NULL) {
116 116 assert(false, "NULL buffer");
117 117 return NULL;
118 118 }
119 119 if (buffer_length < needed_buffer) {
120 120 assert(false, "buffer_length too small");
121 121 return NULL;
122 122 }
123 123 // Get the current time
124 124 jlong milliseconds_since_19700101 = javaTimeMillis();
125 125 const int milliseconds_per_microsecond = 1000;
126 126 const time_t seconds_since_19700101 =
127 127 milliseconds_since_19700101 / milliseconds_per_microsecond;
128 128 const int milliseconds_after_second =
129 129 milliseconds_since_19700101 % milliseconds_per_microsecond;
130 130 // Convert the time value to a tm and timezone variable
131 131 struct tm time_struct;
132 132 if (localtime_pd(&seconds_since_19700101, &time_struct) == NULL) {
133 133 assert(false, "Failed localtime_pd");
134 134 return NULL;
135 135 }
136 136 #if defined(_ALLBSD_SOURCE)
137 137 const time_t zone = (time_t) time_struct.tm_gmtoff;
138 138 #else
139 139 const time_t zone = timezone;
140 140 #endif
141 141
142 142 // If daylight savings time is in effect,
143 143 // we are 1 hour East of our time zone
144 144 const time_t seconds_per_minute = 60;
145 145 const time_t minutes_per_hour = 60;
146 146 const time_t seconds_per_hour = seconds_per_minute * minutes_per_hour;
147 147 time_t UTC_to_local = zone;
148 148 if (time_struct.tm_isdst > 0) {
149 149 UTC_to_local = UTC_to_local - seconds_per_hour;
150 150 }
151 151 // Compute the time zone offset.
152 152 // localtime_pd() sets timezone to the difference (in seconds)
153 153 // between UTC and and local time.
154 154 // ISO 8601 says we need the difference between local time and UTC,
155 155 // we change the sign of the localtime_pd() result.
156 156 const time_t local_to_UTC = -(UTC_to_local);
157 157 // Then we have to figure out if if we are ahead (+) or behind (-) UTC.
158 158 char sign_local_to_UTC = '+';
159 159 time_t abs_local_to_UTC = local_to_UTC;
160 160 if (local_to_UTC < 0) {
161 161 sign_local_to_UTC = '-';
162 162 abs_local_to_UTC = -(abs_local_to_UTC);
163 163 }
164 164 // Convert time zone offset seconds to hours and minutes.
165 165 const time_t zone_hours = (abs_local_to_UTC / seconds_per_hour);
166 166 const time_t zone_min =
167 167 ((abs_local_to_UTC % seconds_per_hour) / seconds_per_minute);
168 168
169 169 // Print an ISO 8601 date and time stamp into the buffer
170 170 const int year = 1900 + time_struct.tm_year;
171 171 const int month = 1 + time_struct.tm_mon;
172 172 const int printed = jio_snprintf(buffer, buffer_length, iso8601_format,
173 173 year,
174 174 month,
175 175 time_struct.tm_mday,
176 176 time_struct.tm_hour,
177 177 time_struct.tm_min,
178 178 time_struct.tm_sec,
179 179 milliseconds_after_second,
180 180 sign_local_to_UTC,
181 181 zone_hours,
182 182 zone_min);
183 183 if (printed == 0) {
184 184 assert(false, "Failed jio_printf");
185 185 return NULL;
186 186 }
187 187 return buffer;
188 188 }
189 189
190 190 OSReturn os::set_priority(Thread* thread, ThreadPriority p) {
191 191 #ifdef ASSERT
192 192 if (!(!thread->is_Java_thread() ||
193 193 Thread::current() == thread ||
194 194 Threads_lock->owned_by_self()
195 195 || thread->is_Compiler_thread()
196 196 )) {
197 197 assert(false, "possibility of dangling Thread pointer");
198 198 }
199 199 #endif
200 200
201 201 if (p >= MinPriority && p <= MaxPriority) {
202 202 int priority = java_to_os_priority[p];
203 203 return set_native_priority(thread, priority);
204 204 } else {
205 205 assert(false, "Should not happen");
206 206 return OS_ERR;
207 207 }
208 208 }
209 209
210 210 // The mapping from OS priority back to Java priority may be inexact because
211 211 // Java priorities can map M:1 with native priorities. If you want the definite
212 212 // Java priority then use JavaThread::java_priority()
213 213 OSReturn os::get_priority(const Thread* const thread, ThreadPriority& priority) {
214 214 int p;
215 215 int os_prio;
216 216 OSReturn ret = get_native_priority(thread, &os_prio);
217 217 if (ret != OS_OK) return ret;
218 218
219 219 if (java_to_os_priority[MaxPriority] > java_to_os_priority[MinPriority]) {
220 220 for (p = MaxPriority; p > MinPriority && java_to_os_priority[p] > os_prio; p--) ;
221 221 } else {
222 222 // niceness values are in reverse order
223 223 for (p = MaxPriority; p > MinPriority && java_to_os_priority[p] < os_prio; p--) ;
224 224 }
225 225 priority = (ThreadPriority)p;
226 226 return OS_OK;
227 227 }
228 228
229 229
230 230 // --------------------- sun.misc.Signal (optional) ---------------------
231 231
232 232
233 233 // SIGBREAK is sent by the keyboard to query the VM state
234 234 #ifndef SIGBREAK
235 235 #define SIGBREAK SIGQUIT
236 236 #endif
237 237
238 238 // sigexitnum_pd is a platform-specific special signal used for terminating the Signal thread.
239 239
240 240
241 241 static void signal_thread_entry(JavaThread* thread, TRAPS) {
242 242 os::set_priority(thread, NearMaxPriority);
243 243 while (true) {
244 244 int sig;
245 245 {
246 246 // FIXME : Currently we have not decieded what should be the status
247 247 // for this java thread blocked here. Once we decide about
248 248 // that we should fix this.
249 249 sig = os::signal_wait();
250 250 }
251 251 if (sig == os::sigexitnum_pd()) {
252 252 // Terminate the signal thread
253 253 return;
254 254 }
255 255
256 256 switch (sig) {
257 257 case SIGBREAK: {
258 258 // Check if the signal is a trigger to start the Attach Listener - in that
259 259 // case don't print stack traces.
260 260 if (!DisableAttachMechanism && AttachListener::is_init_trigger()) {
261 261 continue;
262 262 }
263 263 // Print stack traces
264 264 // Any SIGBREAK operations added here should make sure to flush
265 265 // the output stream (e.g. tty->flush()) after output. See 4803766.
266 266 // Each module also prints an extra carriage return after its output.
267 267 VM_PrintThreads op;
268 268 VMThread::execute(&op);
269 269 VM_PrintJNI jni_op;
270 270 VMThread::execute(&jni_op);
271 271 VM_FindDeadlocks op1(tty);
272 272 VMThread::execute(&op1);
273 273 Universe::print_heap_at_SIGBREAK();
274 274 if (PrintClassHistogram) {
275 275 VM_GC_HeapInspection op1(gclog_or_tty, true /* force full GC before heap inspection */);
276 276 VMThread::execute(&op1);
277 277 }
278 278 if (JvmtiExport::should_post_data_dump()) {
279 279 JvmtiExport::post_data_dump();
280 280 }
281 281 break;
282 282 }
283 283 default: {
284 284 // Dispatch the signal to java
285 285 HandleMark hm(THREAD);
286 286 Klass* k = SystemDictionary::resolve_or_null(vmSymbols::sun_misc_Signal(), THREAD);
287 287 KlassHandle klass (THREAD, k);
288 288 if (klass.not_null()) {
289 289 JavaValue result(T_VOID);
290 290 JavaCallArguments args;
291 291 args.push_int(sig);
292 292 JavaCalls::call_static(
293 293 &result,
294 294 klass,
295 295 vmSymbols::dispatch_name(),
296 296 vmSymbols::int_void_signature(),
297 297 &args,
298 298 THREAD
299 299 );
300 300 }
301 301 if (HAS_PENDING_EXCEPTION) {
302 302 // tty is initialized early so we don't expect it to be null, but
303 303 // if it is we can't risk doing an initialization that might
304 304 // trigger additional out-of-memory conditions
305 305 if (tty != NULL) {
306 306 char klass_name[256];
307 307 char tmp_sig_name[16];
308 308 const char* sig_name = "UNKNOWN";
309 309 InstanceKlass::cast(PENDING_EXCEPTION->klass())->
310 310 name()->as_klass_external_name(klass_name, 256);
311 311 if (os::exception_name(sig, tmp_sig_name, 16) != NULL)
312 312 sig_name = tmp_sig_name;
313 313 warning("Exception %s occurred dispatching signal %s to handler"
314 314 "- the VM may need to be forcibly terminated",
315 315 klass_name, sig_name );
316 316 }
317 317 CLEAR_PENDING_EXCEPTION;
318 318 }
319 319 }
320 320 }
321 321 }
322 322 }
323 323
324 324 void os::init_before_ergo() {
325 325 // We need to initialize large page support here because ergonomics takes some
326 326 // decisions depending on large page support and the calculated large page size.
327 327 large_page_init();
328 328 }
329 329
330 330 void os::signal_init() {
331 331 if (!ReduceSignalUsage) {
332 332 // Setup JavaThread for processing signals
333 333 EXCEPTION_MARK;
334 334 Klass* k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_Thread(), true, CHECK);
335 335 instanceKlassHandle klass (THREAD, k);
336 336 instanceHandle thread_oop = klass->allocate_instance_handle(CHECK);
337 337
338 338 const char thread_name[] = "Signal Dispatcher";
339 339 Handle string = java_lang_String::create_from_str(thread_name, CHECK);
340 340
341 341 // Initialize thread_oop to put it into the system threadGroup
342 342 Handle thread_group (THREAD, Universe::system_thread_group());
343 343 JavaValue result(T_VOID);
344 344 JavaCalls::call_special(&result, thread_oop,
345 345 klass,
346 346 vmSymbols::object_initializer_name(),
347 347 vmSymbols::threadgroup_string_void_signature(),
348 348 thread_group,
349 349 string,
350 350 CHECK);
351 351
352 352 KlassHandle group(THREAD, SystemDictionary::ThreadGroup_klass());
353 353 JavaCalls::call_special(&result,
354 354 thread_group,
355 355 group,
356 356 vmSymbols::add_method_name(),
357 357 vmSymbols::thread_void_signature(),
358 358 thread_oop, // ARG 1
359 359 CHECK);
360 360
361 361 os::signal_init_pd();
362 362
363 363 { MutexLocker mu(Threads_lock);
364 364 JavaThread* signal_thread = new JavaThread(&signal_thread_entry);
365 365
366 366 // At this point it may be possible that no osthread was created for the
367 367 // JavaThread due to lack of memory. We would have to throw an exception
368 368 // in that case. However, since this must work and we do not allow
369 369 // exceptions anyway, check and abort if this fails.
370 370 if (signal_thread == NULL || signal_thread->osthread() == NULL) {
371 371 vm_exit_during_initialization("java.lang.OutOfMemoryError",
372 372 "unable to create new native thread");
373 373 }
374 374
375 375 java_lang_Thread::set_thread(thread_oop(), signal_thread);
376 376 java_lang_Thread::set_priority(thread_oop(), NearMaxPriority);
377 377 java_lang_Thread::set_daemon(thread_oop());
378 378
379 379 signal_thread->set_threadObj(thread_oop());
380 380 Threads::add(signal_thread);
381 381 Thread::start(signal_thread);
382 382 }
383 383 // Handle ^BREAK
384 384 os::signal(SIGBREAK, os::user_handler());
385 385 }
386 386 }
387 387
388 388
389 389 void os::terminate_signal_thread() {
390 390 if (!ReduceSignalUsage)
391 391 signal_notify(sigexitnum_pd());
392 392 }
393 393
394 394
395 395 // --------------------- loading libraries ---------------------
396 396
397 397 typedef jint (JNICALL *JNI_OnLoad_t)(JavaVM *, void *);
398 398 extern struct JavaVM_ main_vm;
399 399
400 400 static void* _native_java_library = NULL;
401 401
402 402 void* os::native_java_library() {
403 403 if (_native_java_library == NULL) {
404 404 char buffer[JVM_MAXPATHLEN];
405 405 char ebuf[1024];
406 406
407 407 // Try to load verify dll first. In 1.3 java dll depends on it and is not
408 408 // always able to find it when the loading executable is outside the JDK.
409 409 // In order to keep working with 1.2 we ignore any loading errors.
410 410 if (dll_build_name(buffer, sizeof(buffer), Arguments::get_dll_dir(),
411 411 "verify")) {
412 412 dll_load(buffer, ebuf, sizeof(ebuf));
413 413 }
414 414
415 415 // Load java dll
416 416 if (dll_build_name(buffer, sizeof(buffer), Arguments::get_dll_dir(),
417 417 "java")) {
418 418 _native_java_library = dll_load(buffer, ebuf, sizeof(ebuf));
419 419 }
420 420 if (_native_java_library == NULL) {
421 421 vm_exit_during_initialization("Unable to load native library", ebuf);
422 422 }
423 423
424 424 #if defined(__OpenBSD__)
425 425 // Work-around OpenBSD's lack of $ORIGIN support by pre-loading libnet.so
426 426 // ignore errors
427 427 if (dll_build_name(buffer, sizeof(buffer), Arguments::get_dll_dir(),
428 428 "net")) {
429 429 dll_load(buffer, ebuf, sizeof(ebuf));
430 430 }
431 431 #endif
432 432 }
433 433 static jboolean onLoaded = JNI_FALSE;
434 434 if (onLoaded) {
435 435 // We may have to wait to fire OnLoad until TLS is initialized.
436 436 if (ThreadLocalStorage::is_initialized()) {
437 437 // The JNI_OnLoad handling is normally done by method load in
438 438 // java.lang.ClassLoader$NativeLibrary, but the VM loads the base library
439 439 // explicitly so we have to check for JNI_OnLoad as well
440 440 const char *onLoadSymbols[] = JNI_ONLOAD_SYMBOLS;
441 441 JNI_OnLoad_t JNI_OnLoad = CAST_TO_FN_PTR(
442 442 JNI_OnLoad_t, dll_lookup(_native_java_library, onLoadSymbols[0]));
443 443 if (JNI_OnLoad != NULL) {
444 444 JavaThread* thread = JavaThread::current();
445 445 ThreadToNativeFromVM ttn(thread);
446 446 HandleMark hm(thread);
447 447 jint ver = (*JNI_OnLoad)(&main_vm, NULL);
448 448 onLoaded = JNI_TRUE;
449 449 if (!Threads::is_supported_jni_version_including_1_1(ver)) {
450 450 vm_exit_during_initialization("Unsupported JNI version");
451 451 }
452 452 }
453 453 }
454 454 }
455 455 return _native_java_library;
456 456 }
457 457
458 458 /*
459 459 * Support for finding Agent_On(Un)Load/Attach<_lib_name> if it exists.
460 460 * If check_lib == true then we are looking for an
461 461 * Agent_OnLoad_lib_name or Agent_OnAttach_lib_name function to determine if
462 462 * this library is statically linked into the image.
463 463 * If check_lib == false then we will look for the appropriate symbol in the
464 464 * executable if agent_lib->is_static_lib() == true or in the shared library
465 465 * referenced by 'handle'.
466 466 */
467 467 void* os::find_agent_function(AgentLibrary *agent_lib, bool check_lib,
468 468 const char *syms[], size_t syms_len) {
469 469 assert(agent_lib != NULL, "sanity check");
470 470 const char *lib_name;
471 471 void *handle = agent_lib->os_lib();
472 472 void *entryName = NULL;
473 473 char *agent_function_name;
474 474 size_t i;
475 475
476 476 // If checking then use the agent name otherwise test is_static_lib() to
477 477 // see how to process this lookup
478 478 lib_name = ((check_lib || agent_lib->is_static_lib()) ? agent_lib->name() : NULL);
479 479 for (i = 0; i < syms_len; i++) {
480 480 agent_function_name = build_agent_function_name(syms[i], lib_name, agent_lib->is_absolute_path());
481 481 if (agent_function_name == NULL) {
482 482 break;
483 483 }
484 484 entryName = dll_lookup(handle, agent_function_name);
485 485 FREE_C_HEAP_ARRAY(char, agent_function_name, mtThread);
486 486 if (entryName != NULL) {
487 487 break;
488 488 }
489 489 }
490 490 return entryName;
491 491 }
492 492
493 493 // See if the passed in agent is statically linked into the VM image.
494 494 bool os::find_builtin_agent(AgentLibrary *agent_lib, const char *syms[],
495 495 size_t syms_len) {
496 496 void *ret;
497 497 void *proc_handle;
498 498 void *save_handle;
499 499
500 500 assert(agent_lib != NULL, "sanity check");
501 501 if (agent_lib->name() == NULL) {
502 502 return false;
503 503 }
504 504 proc_handle = get_default_process_handle();
505 505 // Check for Agent_OnLoad/Attach_lib_name function
506 506 save_handle = agent_lib->os_lib();
507 507 // We want to look in this process' symbol table.
508 508 agent_lib->set_os_lib(proc_handle);
509 509 ret = find_agent_function(agent_lib, true, syms, syms_len);
510 510 if (ret != NULL) {
511 511 // Found an entry point like Agent_OnLoad_lib_name so we have a static agent
512 512 agent_lib->set_valid();
513 513 agent_lib->set_static_lib(true);
514 514 return true;
515 515 }
516 516 agent_lib->set_os_lib(save_handle);
517 517 return false;
518 518 }
519 519
520 520 // --------------------- heap allocation utilities ---------------------
521 521
522 522 char *os::strdup(const char *str, MEMFLAGS flags) {
523 523 size_t size = strlen(str);
524 524 char *dup_str = (char *)malloc(size + 1, flags);
525 525 if (dup_str == NULL) return NULL;
526 526 strcpy(dup_str, str);
527 527 return dup_str;
528 528 }
529 529
530 530
531 531
532 532 #define paranoid 0 /* only set to 1 if you suspect checking code has bug */
533 533
534 534 #ifdef ASSERT
535 535 static void verify_memory(void* ptr) {
536 536 GuardedMemory guarded(ptr);
537 537 if (!guarded.verify_guards()) {
538 538 tty->print_cr("## nof_mallocs = " UINT64_FORMAT ", nof_frees = " UINT64_FORMAT, os::num_mallocs, os::num_frees);
539 539 tty->print_cr("## memory stomp:");
540 540 guarded.print_on(tty);
541 541 fatal("memory stomping error");
542 542 }
543 543 }
544 544 #endif
545 545
546 546 //
547 547 // This function supports testing of the malloc out of memory
548 548 // condition without really running the system out of memory.
549 549 //
550 550 static u_char* testMalloc(size_t alloc_size) {
551 551 assert(MallocMaxTestWords > 0, "sanity check");
552 552
553 553 if ((cur_malloc_words + (alloc_size / BytesPerWord)) > MallocMaxTestWords) {
554 554 return NULL;
555 555 }
556 556
557 557 u_char* ptr = (u_char*)::malloc(alloc_size);
558 558
559 559 if (ptr != NULL) {
560 560 Atomic::add(((jint) (alloc_size / BytesPerWord)),
561 561 (volatile jint *) &cur_malloc_words);
562 562 }
563 563 return ptr;
↓ open down ↓ |
563 lines elided |
↑ open up ↑ |
564 564 }
565 565
566 566 void* os::malloc(size_t size, MEMFLAGS flags) {
567 567 return os::malloc(size, flags, CALLER_PC);
568 568 }
569 569
570 570 void* os::malloc(size_t size, MEMFLAGS memflags, const NativeCallStack& stack) {
571 571 NOT_PRODUCT(inc_stat_counter(&num_mallocs, 1));
572 572 NOT_PRODUCT(inc_stat_counter(&alloc_bytes, size));
573 573
574 -#if INCLUDE_NMT
575 - // NMT can not track malloc allocation size > MAX_MALLOC_SIZE, which is
576 - // (1GB - 1) on 32-bit system. It is not an issue on 64-bit system, where
577 - // MAX_MALLOC_SIZE = ((1 << 62) - 1).
578 - // VM code does not have such large malloc allocation. However, it can come
579 - // Unsafe call.
580 - if (MemTracker::tracking_level() >= NMT_summary && size > MAX_MALLOC_SIZE) {
581 - return NULL;
582 - }
583 -#endif
584 -
585 574 #ifdef ASSERT
586 575 // checking for the WatcherThread and crash_protection first
587 576 // since os::malloc can be called when the libjvm.{dll,so} is
588 577 // first loaded and we don't have a thread yet.
589 578 // try to find the thread after we see that the watcher thread
590 579 // exists and has crash protection.
591 580 WatcherThread *wt = WatcherThread::watcher_thread();
592 581 if (wt != NULL && wt->has_crash_protection()) {
593 582 Thread* thread = ThreadLocalStorage::get_thread_slow();
594 583 if (thread == wt) {
595 584 assert(!wt->has_crash_protection(),
596 585 "Can't malloc with crash protection from WatcherThread");
597 586 }
598 587 }
599 588 #endif
600 589
601 590 if (size == 0) {
602 591 // return a valid pointer if size is zero
603 592 // if NULL is returned the calling functions assume out of memory.
604 593 size = 1;
605 594 }
606 595
607 596 // NMT support
608 597 NMT_TrackingLevel level = MemTracker::tracking_level();
609 598 size_t nmt_header_size = MemTracker::malloc_header_size(level);
610 599
611 600 #ifndef ASSERT
612 601 const size_t alloc_size = size + nmt_header_size;
613 602 #else
614 603 const size_t alloc_size = GuardedMemory::get_total_size(size + nmt_header_size);
615 604 if (size + nmt_header_size > alloc_size) { // Check for rollover.
616 605 return NULL;
617 606 }
618 607 #endif
619 608
620 609 NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap());
621 610
622 611 u_char* ptr;
623 612 if (MallocMaxTestWords > 0) {
624 613 ptr = testMalloc(alloc_size);
625 614 } else {
626 615 ptr = (u_char*)::malloc(alloc_size);
627 616 }
628 617
629 618 #ifdef ASSERT
630 619 if (ptr == NULL) {
631 620 return NULL;
632 621 }
633 622 // Wrap memory with guard
634 623 GuardedMemory guarded(ptr, size + nmt_header_size);
635 624 ptr = guarded.get_user_ptr();
636 625 #endif
637 626 if ((intptr_t)ptr == (intptr_t)MallocCatchPtr) {
638 627 tty->print_cr("os::malloc caught, " SIZE_FORMAT " bytes --> " PTR_FORMAT, size, ptr);
639 628 breakpoint();
640 629 }
641 630 debug_only(if (paranoid) verify_memory(ptr));
642 631 if (PrintMalloc && tty != NULL) {
643 632 tty->print_cr("os::malloc " SIZE_FORMAT " bytes --> " PTR_FORMAT, size, ptr);
644 633 }
↓ open down ↓ |
50 lines elided |
↑ open up ↑ |
645 634
646 635 // we do not track guard memory
647 636 return MemTracker::record_malloc((address)ptr, size, memflags, stack, level);
648 637 }
649 638
650 639 void* os::realloc(void *memblock, size_t size, MEMFLAGS flags) {
651 640 return os::realloc(memblock, size, flags, CALLER_PC);
652 641 }
653 642
654 643 void* os::realloc(void *memblock, size_t size, MEMFLAGS memflags, const NativeCallStack& stack) {
655 -#if INCLUDE_NMT
656 - // See comments in os::malloc() above
657 - if (MemTracker::tracking_level() >= NMT_summary && size > MAX_MALLOC_SIZE) {
658 - return NULL;
659 - }
660 -#endif
661 644
662 645 #ifndef ASSERT
663 646 NOT_PRODUCT(inc_stat_counter(&num_mallocs, 1));
664 647 NOT_PRODUCT(inc_stat_counter(&alloc_bytes, size));
665 648 // NMT support
666 649 void* membase = MemTracker::record_free(memblock);
667 650 NMT_TrackingLevel level = MemTracker::tracking_level();
668 651 size_t nmt_header_size = MemTracker::malloc_header_size(level);
669 652 void* ptr = ::realloc(membase, size + nmt_header_size);
670 653 return MemTracker::record_malloc(ptr, size, memflags, stack, level);
671 654 #else
672 655 if (memblock == NULL) {
673 656 return os::malloc(size, memflags, stack);
674 657 }
675 658 if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) {
676 659 tty->print_cr("os::realloc caught " PTR_FORMAT, memblock);
677 660 breakpoint();
678 661 }
679 662 // NMT support
680 663 void* membase = MemTracker::malloc_base(memblock);
681 664 verify_memory(membase);
682 665 NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap());
683 666 if (size == 0) {
684 667 return NULL;
685 668 }
686 669 // always move the block
687 670 void* ptr = os::malloc(size, memflags, stack);
688 671 if (PrintMalloc) {
689 672 tty->print_cr("os::remalloc " SIZE_FORMAT " bytes, " PTR_FORMAT " --> " PTR_FORMAT, size, memblock, ptr);
690 673 }
691 674 // Copy to new memory if malloc didn't fail
692 675 if ( ptr != NULL ) {
693 676 GuardedMemory guarded(MemTracker::malloc_base(memblock));
694 677 // Guard's user data contains NMT header
695 678 size_t memblock_size = guarded.get_user_size() - MemTracker::malloc_header_size(memblock);
696 679 memcpy(ptr, memblock, MIN2(size, memblock_size));
697 680 if (paranoid) verify_memory(MemTracker::malloc_base(ptr));
698 681 if ((intptr_t)ptr == (intptr_t)MallocCatchPtr) {
699 682 tty->print_cr("os::realloc caught, " SIZE_FORMAT " bytes --> " PTR_FORMAT, size, ptr);
700 683 breakpoint();
701 684 }
702 685 os::free(memblock);
703 686 }
704 687 return ptr;
705 688 #endif
706 689 }
707 690
708 691
709 692 void os::free(void *memblock, MEMFLAGS memflags) {
710 693 NOT_PRODUCT(inc_stat_counter(&num_frees, 1));
711 694 #ifdef ASSERT
712 695 if (memblock == NULL) return;
713 696 if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) {
714 697 if (tty != NULL) tty->print_cr("os::free caught " PTR_FORMAT, memblock);
715 698 breakpoint();
716 699 }
717 700 void* membase = MemTracker::record_free(memblock);
718 701 verify_memory(membase);
719 702 NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap());
720 703
721 704 GuardedMemory guarded(membase);
722 705 size_t size = guarded.get_user_size();
723 706 inc_stat_counter(&free_bytes, size);
724 707 membase = guarded.release_for_freeing();
725 708 if (PrintMalloc && tty != NULL) {
726 709 fprintf(stderr, "os::free " SIZE_FORMAT " bytes --> " PTR_FORMAT "\n", size, (uintptr_t)membase);
727 710 }
728 711 ::free(membase);
729 712 #else
730 713 void* membase = MemTracker::record_free(memblock);
731 714 ::free(membase);
732 715 #endif
733 716 }
734 717
735 718 void os::init_random(long initval) {
736 719 _rand_seed = initval;
737 720 }
738 721
739 722
740 723 long os::random() {
741 724 /* standard, well-known linear congruential random generator with
742 725 * next_rand = (16807*seed) mod (2**31-1)
743 726 * see
744 727 * (1) "Random Number Generators: Good Ones Are Hard to Find",
745 728 * S.K. Park and K.W. Miller, Communications of the ACM 31:10 (Oct 1988),
746 729 * (2) "Two Fast Implementations of the 'Minimal Standard' Random
747 730 * Number Generator", David G. Carta, Comm. ACM 33, 1 (Jan 1990), pp. 87-88.
748 731 */
749 732 const long a = 16807;
750 733 const unsigned long m = 2147483647;
751 734 const long q = m / a; assert(q == 127773, "weird math");
752 735 const long r = m % a; assert(r == 2836, "weird math");
753 736
754 737 // compute az=2^31p+q
755 738 unsigned long lo = a * (long)(_rand_seed & 0xFFFF);
756 739 unsigned long hi = a * (long)((unsigned long)_rand_seed >> 16);
757 740 lo += (hi & 0x7FFF) << 16;
758 741
759 742 // if q overflowed, ignore the overflow and increment q
760 743 if (lo > m) {
761 744 lo &= m;
762 745 ++lo;
763 746 }
764 747 lo += hi >> 15;
765 748
766 749 // if (p+q) overflowed, ignore the overflow and increment (p+q)
767 750 if (lo > m) {
768 751 lo &= m;
769 752 ++lo;
770 753 }
771 754 return (_rand_seed = lo);
772 755 }
773 756
774 757 // The INITIALIZED state is distinguished from the SUSPENDED state because the
775 758 // conditions in which a thread is first started are different from those in which
776 759 // a suspension is resumed. These differences make it hard for us to apply the
777 760 // tougher checks when starting threads that we want to do when resuming them.
778 761 // However, when start_thread is called as a result of Thread.start, on a Java
779 762 // thread, the operation is synchronized on the Java Thread object. So there
780 763 // cannot be a race to start the thread and hence for the thread to exit while
781 764 // we are working on it. Non-Java threads that start Java threads either have
782 765 // to do so in a context in which races are impossible, or should do appropriate
783 766 // locking.
784 767
785 768 void os::start_thread(Thread* thread) {
786 769 // guard suspend/resume
787 770 MutexLockerEx ml(thread->SR_lock(), Mutex::_no_safepoint_check_flag);
788 771 OSThread* osthread = thread->osthread();
789 772 osthread->set_state(RUNNABLE);
790 773 pd_start_thread(thread);
791 774 }
792 775
793 776 //---------------------------------------------------------------------------
794 777 // Helper functions for fatal error handler
795 778
796 779 void os::print_hex_dump(outputStream* st, address start, address end, int unitsize) {
797 780 assert(unitsize == 1 || unitsize == 2 || unitsize == 4 || unitsize == 8, "just checking");
798 781
799 782 int cols = 0;
800 783 int cols_per_line = 0;
801 784 switch (unitsize) {
802 785 case 1: cols_per_line = 16; break;
803 786 case 2: cols_per_line = 8; break;
804 787 case 4: cols_per_line = 4; break;
805 788 case 8: cols_per_line = 2; break;
806 789 default: return;
807 790 }
808 791
809 792 address p = start;
810 793 st->print(PTR_FORMAT ": ", start);
811 794 while (p < end) {
812 795 switch (unitsize) {
813 796 case 1: st->print("%02x", *(u1*)p); break;
814 797 case 2: st->print("%04x", *(u2*)p); break;
815 798 case 4: st->print("%08x", *(u4*)p); break;
816 799 case 8: st->print("%016" FORMAT64_MODIFIER "x", *(u8*)p); break;
817 800 }
818 801 p += unitsize;
819 802 cols++;
820 803 if (cols >= cols_per_line && p < end) {
821 804 cols = 0;
822 805 st->cr();
823 806 st->print(PTR_FORMAT ": ", p);
824 807 } else {
825 808 st->print(" ");
826 809 }
827 810 }
828 811 st->cr();
829 812 }
830 813
831 814 void os::print_environment_variables(outputStream* st, const char** env_list,
832 815 char* buffer, int len) {
833 816 if (env_list) {
834 817 st->print_cr("Environment Variables:");
835 818
836 819 for (int i = 0; env_list[i] != NULL; i++) {
837 820 if (getenv(env_list[i], buffer, len)) {
838 821 st->print("%s", env_list[i]);
839 822 st->print("=");
840 823 st->print_cr("%s", buffer);
841 824 }
842 825 }
843 826 }
844 827 }
845 828
846 829 void os::print_cpu_info(outputStream* st) {
847 830 // cpu
848 831 st->print("CPU:");
849 832 st->print("total %d", os::processor_count());
850 833 // It's not safe to query number of active processors after crash
851 834 // st->print("(active %d)", os::active_processor_count());
852 835 st->print(" %s", VM_Version::cpu_features());
853 836 st->cr();
854 837 pd_print_cpu_info(st);
855 838 }
856 839
857 840 void os::print_date_and_time(outputStream *st) {
858 841 const int secs_per_day = 86400;
859 842 const int secs_per_hour = 3600;
860 843 const int secs_per_min = 60;
861 844
862 845 time_t tloc;
863 846 (void)time(&tloc);
864 847 st->print("time: %s", ctime(&tloc)); // ctime adds newline.
865 848
866 849 double t = os::elapsedTime();
867 850 // NOTE: It tends to crash after a SEGV if we want to printf("%f",...) in
868 851 // Linux. Must be a bug in glibc ? Workaround is to round "t" to int
869 852 // before printf. We lost some precision, but who cares?
870 853 int eltime = (int)t; // elapsed time in seconds
871 854
872 855 // print elapsed time in a human-readable format:
873 856 int eldays = eltime / secs_per_day;
874 857 int day_secs = eldays * secs_per_day;
875 858 int elhours = (eltime - day_secs) / secs_per_hour;
876 859 int hour_secs = elhours * secs_per_hour;
877 860 int elmins = (eltime - day_secs - hour_secs) / secs_per_min;
878 861 int minute_secs = elmins * secs_per_min;
879 862 int elsecs = (eltime - day_secs - hour_secs - minute_secs);
880 863 st->print_cr("elapsed time: %d seconds (%dd %dh %dm %ds)", eltime, eldays, elhours, elmins, elsecs);
881 864 }
882 865
883 866 // moved from debug.cpp (used to be find()) but still called from there
884 867 // The verbose parameter is only set by the debug code in one case
885 868 void os::print_location(outputStream* st, intptr_t x, bool verbose) {
886 869 address addr = (address)x;
887 870 CodeBlob* b = CodeCache::find_blob_unsafe(addr);
888 871 if (b != NULL) {
889 872 if (b->is_buffer_blob()) {
890 873 // the interpreter is generated into a buffer blob
891 874 InterpreterCodelet* i = Interpreter::codelet_containing(addr);
892 875 if (i != NULL) {
893 876 st->print_cr(INTPTR_FORMAT " is at code_begin+%d in an Interpreter codelet", addr, (int)(addr - i->code_begin()));
894 877 i->print_on(st);
895 878 return;
896 879 }
897 880 if (Interpreter::contains(addr)) {
898 881 st->print_cr(INTPTR_FORMAT " is pointing into interpreter code"
899 882 " (not bytecode specific)", addr);
900 883 return;
901 884 }
902 885 //
903 886 if (AdapterHandlerLibrary::contains(b)) {
904 887 st->print_cr(INTPTR_FORMAT " is at code_begin+%d in an AdapterHandler", addr, (int)(addr - b->code_begin()));
905 888 AdapterHandlerLibrary::print_handler_on(st, b);
906 889 }
907 890 // the stubroutines are generated into a buffer blob
908 891 StubCodeDesc* d = StubCodeDesc::desc_for(addr);
909 892 if (d != NULL) {
910 893 st->print_cr(INTPTR_FORMAT " is at begin+%d in a stub", addr, (int)(addr - d->begin()));
911 894 d->print_on(st);
912 895 st->cr();
913 896 return;
914 897 }
915 898 if (StubRoutines::contains(addr)) {
916 899 st->print_cr(INTPTR_FORMAT " is pointing to an (unnamed) "
917 900 "stub routine", addr);
918 901 return;
919 902 }
920 903 // the InlineCacheBuffer is using stubs generated into a buffer blob
921 904 if (InlineCacheBuffer::contains(addr)) {
922 905 st->print_cr(INTPTR_FORMAT " is pointing into InlineCacheBuffer", addr);
923 906 return;
924 907 }
925 908 VtableStub* v = VtableStubs::stub_containing(addr);
926 909 if (v != NULL) {
927 910 st->print_cr(INTPTR_FORMAT " is at entry_point+%d in a vtable stub", addr, (int)(addr - v->entry_point()));
928 911 v->print_on(st);
929 912 st->cr();
930 913 return;
931 914 }
932 915 }
933 916 nmethod* nm = b->as_nmethod_or_null();
934 917 if (nm != NULL) {
935 918 ResourceMark rm;
936 919 st->print(INTPTR_FORMAT " is at entry_point+%d in (nmethod*)" INTPTR_FORMAT,
937 920 addr, (int)(addr - nm->entry_point()), nm);
938 921 if (verbose) {
939 922 st->print(" for ");
940 923 nm->method()->print_value_on(st);
941 924 }
942 925 st->cr();
943 926 nm->print_nmethod(verbose);
944 927 return;
945 928 }
946 929 st->print_cr(INTPTR_FORMAT " is at code_begin+%d in ", addr, (int)(addr - b->code_begin()));
947 930 b->print_on(st);
948 931 return;
949 932 }
950 933
951 934 if (Universe::heap()->is_in(addr)) {
952 935 HeapWord* p = Universe::heap()->block_start(addr);
953 936 bool print = false;
954 937 // If we couldn't find it it just may mean that heap wasn't parseable
955 938 // See if we were just given an oop directly
956 939 if (p != NULL && Universe::heap()->block_is_obj(p)) {
957 940 print = true;
958 941 } else if (p == NULL && ((oopDesc*)addr)->is_oop()) {
959 942 p = (HeapWord*) addr;
960 943 print = true;
961 944 }
962 945 if (print) {
963 946 if (p == (HeapWord*) addr) {
964 947 st->print_cr(INTPTR_FORMAT " is an oop", addr);
965 948 } else {
966 949 st->print_cr(INTPTR_FORMAT " is pointing into object: " INTPTR_FORMAT, addr, p);
967 950 }
968 951 oop(p)->print_on(st);
969 952 return;
970 953 }
971 954 } else {
972 955 if (Universe::heap()->is_in_reserved(addr)) {
973 956 st->print_cr(INTPTR_FORMAT " is an unallocated location "
974 957 "in the heap", addr);
975 958 return;
976 959 }
977 960 }
978 961 if (JNIHandles::is_global_handle((jobject) addr)) {
979 962 st->print_cr(INTPTR_FORMAT " is a global jni handle", addr);
980 963 return;
981 964 }
982 965 if (JNIHandles::is_weak_global_handle((jobject) addr)) {
983 966 st->print_cr(INTPTR_FORMAT " is a weak global jni handle", addr);
984 967 return;
985 968 }
986 969 #ifndef PRODUCT
987 970 // we don't keep the block list in product mode
988 971 if (JNIHandleBlock::any_contains((jobject) addr)) {
989 972 st->print_cr(INTPTR_FORMAT " is a local jni handle", addr);
990 973 return;
991 974 }
992 975 #endif
993 976
994 977 for(JavaThread *thread = Threads::first(); thread; thread = thread->next()) {
995 978 // Check for privilege stack
996 979 if (thread->privileged_stack_top() != NULL &&
997 980 thread->privileged_stack_top()->contains(addr)) {
998 981 st->print_cr(INTPTR_FORMAT " is pointing into the privilege stack "
999 982 "for thread: " INTPTR_FORMAT, addr, thread);
1000 983 if (verbose) thread->print_on(st);
1001 984 return;
1002 985 }
1003 986 // If the addr is a java thread print information about that.
1004 987 if (addr == (address)thread) {
1005 988 if (verbose) {
1006 989 thread->print_on(st);
1007 990 } else {
1008 991 st->print_cr(INTPTR_FORMAT " is a thread", addr);
1009 992 }
1010 993 return;
1011 994 }
1012 995 // If the addr is in the stack region for this thread then report that
1013 996 // and print thread info
1014 997 if (thread->stack_base() >= addr &&
1015 998 addr > (thread->stack_base() - thread->stack_size())) {
1016 999 st->print_cr(INTPTR_FORMAT " is pointing into the stack for thread: "
1017 1000 INTPTR_FORMAT, addr, thread);
1018 1001 if (verbose) thread->print_on(st);
1019 1002 return;
1020 1003 }
1021 1004
1022 1005 }
1023 1006
1024 1007 // Check if in metaspace and print types that have vptrs (only method now)
1025 1008 if (Metaspace::contains(addr)) {
1026 1009 if (Method::has_method_vptr((const void*)addr)) {
1027 1010 ((Method*)addr)->print_value_on(st);
1028 1011 st->cr();
1029 1012 } else {
1030 1013 // Use addr->print() from the debugger instead (not here)
1031 1014 st->print_cr(INTPTR_FORMAT " is pointing into metadata", addr);
1032 1015 }
1033 1016 return;
1034 1017 }
1035 1018
1036 1019 // Try an OS specific find
1037 1020 if (os::find(addr, st)) {
1038 1021 return;
1039 1022 }
1040 1023
1041 1024 st->print_cr(INTPTR_FORMAT " is an unknown value", addr);
1042 1025 }
1043 1026
1044 1027 // Looks like all platforms except IA64 can use the same function to check
1045 1028 // if C stack is walkable beyond current frame. The check for fp() is not
1046 1029 // necessary on Sparc, but it's harmless.
1047 1030 bool os::is_first_C_frame(frame* fr) {
1048 1031 #if (defined(IA64) && !defined(AIX)) && !defined(_WIN32)
1049 1032 // On IA64 we have to check if the callers bsp is still valid
1050 1033 // (i.e. within the register stack bounds).
1051 1034 // Notice: this only works for threads created by the VM and only if
1052 1035 // we walk the current stack!!! If we want to be able to walk
1053 1036 // arbitrary other threads, we'll have to somehow store the thread
1054 1037 // object in the frame.
1055 1038 Thread *thread = Thread::current();
1056 1039 if ((address)fr->fp() <=
1057 1040 thread->register_stack_base() HPUX_ONLY(+ 0x0) LINUX_ONLY(+ 0x50)) {
1058 1041 // This check is a little hacky, because on Linux the first C
1059 1042 // frame's ('start_thread') register stack frame starts at
1060 1043 // "register_stack_base + 0x48" while on HPUX, the first C frame's
1061 1044 // ('__pthread_bound_body') register stack frame seems to really
1062 1045 // start at "register_stack_base".
1063 1046 return true;
1064 1047 } else {
1065 1048 return false;
1066 1049 }
1067 1050 #elif defined(IA64) && defined(_WIN32)
1068 1051 return true;
1069 1052 #else
1070 1053 // Load up sp, fp, sender sp and sender fp, check for reasonable values.
1071 1054 // Check usp first, because if that's bad the other accessors may fault
1072 1055 // on some architectures. Ditto ufp second, etc.
1073 1056 uintptr_t fp_align_mask = (uintptr_t)(sizeof(address)-1);
1074 1057 // sp on amd can be 32 bit aligned.
1075 1058 uintptr_t sp_align_mask = (uintptr_t)(sizeof(int)-1);
1076 1059
1077 1060 uintptr_t usp = (uintptr_t)fr->sp();
1078 1061 if ((usp & sp_align_mask) != 0) return true;
1079 1062
1080 1063 uintptr_t ufp = (uintptr_t)fr->fp();
1081 1064 if ((ufp & fp_align_mask) != 0) return true;
1082 1065
1083 1066 uintptr_t old_sp = (uintptr_t)fr->sender_sp();
1084 1067 if ((old_sp & sp_align_mask) != 0) return true;
1085 1068 if (old_sp == 0 || old_sp == (uintptr_t)-1) return true;
1086 1069
1087 1070 uintptr_t old_fp = (uintptr_t)fr->link();
1088 1071 if ((old_fp & fp_align_mask) != 0) return true;
1089 1072 if (old_fp == 0 || old_fp == (uintptr_t)-1 || old_fp == ufp) return true;
1090 1073
1091 1074 // stack grows downwards; if old_fp is below current fp or if the stack
1092 1075 // frame is too large, either the stack is corrupted or fp is not saved
1093 1076 // on stack (i.e. on x86, ebp may be used as general register). The stack
1094 1077 // is not walkable beyond current frame.
1095 1078 if (old_fp < ufp) return true;
1096 1079 if (old_fp - ufp > 64 * K) return true;
1097 1080
1098 1081 return false;
1099 1082 #endif
1100 1083 }
1101 1084
1102 1085 #ifdef ASSERT
1103 1086 extern "C" void test_random() {
1104 1087 const double m = 2147483647;
1105 1088 double mean = 0.0, variance = 0.0, t;
1106 1089 long reps = 10000;
1107 1090 unsigned long seed = 1;
1108 1091
1109 1092 tty->print_cr("seed %ld for %ld repeats...", seed, reps);
1110 1093 os::init_random(seed);
1111 1094 long num;
1112 1095 for (int k = 0; k < reps; k++) {
1113 1096 num = os::random();
1114 1097 double u = (double)num / m;
1115 1098 assert(u >= 0.0 && u <= 1.0, "bad random number!");
1116 1099
1117 1100 // calculate mean and variance of the random sequence
1118 1101 mean += u;
1119 1102 variance += (u*u);
1120 1103 }
1121 1104 mean /= reps;
1122 1105 variance /= (reps - 1);
1123 1106
1124 1107 assert(num == 1043618065, "bad seed");
1125 1108 tty->print_cr("mean of the 1st 10000 numbers: %f", mean);
1126 1109 tty->print_cr("variance of the 1st 10000 numbers: %f", variance);
1127 1110 const double eps = 0.0001;
1128 1111 t = fabsd(mean - 0.5018);
1129 1112 assert(t < eps, "bad mean");
1130 1113 t = (variance - 0.3355) < 0.0 ? -(variance - 0.3355) : variance - 0.3355;
1131 1114 assert(t < eps, "bad variance");
1132 1115 }
1133 1116 #endif
1134 1117
1135 1118
1136 1119 // Set up the boot classpath.
1137 1120
1138 1121 char* os::format_boot_path(const char* format_string,
1139 1122 const char* home,
1140 1123 int home_len,
1141 1124 char fileSep,
1142 1125 char pathSep) {
1143 1126 assert((fileSep == '/' && pathSep == ':') ||
1144 1127 (fileSep == '\\' && pathSep == ';'), "unexpected seperator chars");
1145 1128
1146 1129 // Scan the format string to determine the length of the actual
1147 1130 // boot classpath, and handle platform dependencies as well.
1148 1131 int formatted_path_len = 0;
1149 1132 const char* p;
1150 1133 for (p = format_string; *p != 0; ++p) {
1151 1134 if (*p == '%') formatted_path_len += home_len - 1;
1152 1135 ++formatted_path_len;
1153 1136 }
1154 1137
1155 1138 char* formatted_path = NEW_C_HEAP_ARRAY(char, formatted_path_len + 1, mtInternal);
1156 1139 if (formatted_path == NULL) {
1157 1140 return NULL;
1158 1141 }
1159 1142
1160 1143 // Create boot classpath from format, substituting separator chars and
1161 1144 // java home directory.
1162 1145 char* q = formatted_path;
1163 1146 for (p = format_string; *p != 0; ++p) {
1164 1147 switch (*p) {
1165 1148 case '%':
1166 1149 strcpy(q, home);
1167 1150 q += home_len;
1168 1151 break;
1169 1152 case '/':
1170 1153 *q++ = fileSep;
1171 1154 break;
1172 1155 case ':':
1173 1156 *q++ = pathSep;
1174 1157 break;
1175 1158 default:
1176 1159 *q++ = *p;
1177 1160 }
1178 1161 }
1179 1162 *q = '\0';
1180 1163
1181 1164 assert((q - formatted_path) == formatted_path_len, "formatted_path size botched");
1182 1165 return formatted_path;
1183 1166 }
1184 1167
1185 1168
1186 1169 bool os::set_boot_path(char fileSep, char pathSep) {
1187 1170 const char* home = Arguments::get_java_home();
1188 1171 int home_len = (int)strlen(home);
1189 1172
1190 1173 static const char* meta_index_dir_format = "%/lib/";
1191 1174 static const char* meta_index_format = "%/lib/meta-index";
1192 1175 char* meta_index = format_boot_path(meta_index_format, home, home_len, fileSep, pathSep);
1193 1176 if (meta_index == NULL) return false;
1194 1177 char* meta_index_dir = format_boot_path(meta_index_dir_format, home, home_len, fileSep, pathSep);
1195 1178 if (meta_index_dir == NULL) return false;
1196 1179 Arguments::set_meta_index_path(meta_index, meta_index_dir);
1197 1180
1198 1181 // Any modification to the JAR-file list, for the boot classpath must be
1199 1182 // aligned with install/install/make/common/Pack.gmk. Note: boot class
1200 1183 // path class JARs, are stripped for StackMapTable to reduce download size.
1201 1184 static const char classpath_format[] =
1202 1185 "%/lib/resources.jar:"
1203 1186 "%/lib/rt.jar:"
1204 1187 "%/lib/sunrsasign.jar:"
1205 1188 "%/lib/jsse.jar:"
1206 1189 "%/lib/jce.jar:"
1207 1190 "%/lib/charsets.jar:"
1208 1191 "%/lib/jfr.jar:"
1209 1192 "%/classes";
1210 1193 char* sysclasspath = format_boot_path(classpath_format, home, home_len, fileSep, pathSep);
1211 1194 if (sysclasspath == NULL) return false;
1212 1195 Arguments::set_sysclasspath(sysclasspath);
1213 1196
1214 1197 return true;
1215 1198 }
1216 1199
1217 1200 /*
1218 1201 * Splits a path, based on its separator, the number of
1219 1202 * elements is returned back in n.
1220 1203 * It is the callers responsibility to:
1221 1204 * a> check the value of n, and n may be 0.
1222 1205 * b> ignore any empty path elements
1223 1206 * c> free up the data.
1224 1207 */
1225 1208 char** os::split_path(const char* path, int* n) {
1226 1209 *n = 0;
1227 1210 if (path == NULL || strlen(path) == 0) {
1228 1211 return NULL;
1229 1212 }
1230 1213 const char psepchar = *os::path_separator();
1231 1214 char* inpath = (char*)NEW_C_HEAP_ARRAY(char, strlen(path) + 1, mtInternal);
1232 1215 if (inpath == NULL) {
1233 1216 return NULL;
1234 1217 }
1235 1218 strcpy(inpath, path);
1236 1219 int count = 1;
1237 1220 char* p = strchr(inpath, psepchar);
1238 1221 // Get a count of elements to allocate memory
1239 1222 while (p != NULL) {
1240 1223 count++;
1241 1224 p++;
1242 1225 p = strchr(p, psepchar);
1243 1226 }
1244 1227 char** opath = (char**) NEW_C_HEAP_ARRAY(char*, count, mtInternal);
1245 1228 if (opath == NULL) {
1246 1229 return NULL;
1247 1230 }
1248 1231
1249 1232 // do the actual splitting
1250 1233 p = inpath;
1251 1234 for (int i = 0 ; i < count ; i++) {
1252 1235 size_t len = strcspn(p, os::path_separator());
1253 1236 if (len > JVM_MAXPATHLEN) {
1254 1237 return NULL;
1255 1238 }
1256 1239 // allocate the string and add terminator storage
1257 1240 char* s = (char*)NEW_C_HEAP_ARRAY(char, len + 1, mtInternal);
1258 1241 if (s == NULL) {
1259 1242 return NULL;
1260 1243 }
1261 1244 strncpy(s, p, len);
1262 1245 s[len] = '\0';
1263 1246 opath[i] = s;
1264 1247 p += len + 1;
1265 1248 }
1266 1249 FREE_C_HEAP_ARRAY(char, inpath, mtInternal);
1267 1250 *n = count;
1268 1251 return opath;
1269 1252 }
1270 1253
1271 1254 void os::set_memory_serialize_page(address page) {
1272 1255 int count = log2_intptr(sizeof(class JavaThread)) - log2_intptr(64);
1273 1256 _mem_serialize_page = (volatile int32_t *)page;
1274 1257 // We initialize the serialization page shift count here
1275 1258 // We assume a cache line size of 64 bytes
1276 1259 assert(SerializePageShiftCount == count,
1277 1260 "thread size changed, fix SerializePageShiftCount constant");
1278 1261 set_serialize_page_mask((uintptr_t)(vm_page_size() - sizeof(int32_t)));
1279 1262 }
1280 1263
1281 1264 static volatile intptr_t SerializePageLock = 0;
1282 1265
1283 1266 // This method is called from signal handler when SIGSEGV occurs while the current
1284 1267 // thread tries to store to the "read-only" memory serialize page during state
1285 1268 // transition.
1286 1269 void os::block_on_serialize_page_trap() {
1287 1270 if (TraceSafepoint) {
1288 1271 tty->print_cr("Block until the serialize page permission restored");
1289 1272 }
1290 1273 // When VMThread is holding the SerializePageLock during modifying the
1291 1274 // access permission of the memory serialize page, the following call
1292 1275 // will block until the permission of that page is restored to rw.
1293 1276 // Generally, it is unsafe to manipulate locks in signal handlers, but in
1294 1277 // this case, it's OK as the signal is synchronous and we know precisely when
1295 1278 // it can occur.
1296 1279 Thread::muxAcquire(&SerializePageLock, "set_memory_serialize_page");
1297 1280 Thread::muxRelease(&SerializePageLock);
1298 1281 }
1299 1282
1300 1283 // Serialize all thread state variables
1301 1284 void os::serialize_thread_states() {
1302 1285 // On some platforms such as Solaris & Linux, the time duration of the page
1303 1286 // permission restoration is observed to be much longer than expected due to
1304 1287 // scheduler starvation problem etc. To avoid the long synchronization
1305 1288 // time and expensive page trap spinning, 'SerializePageLock' is used to block
1306 1289 // the mutator thread if such case is encountered. See bug 6546278 for details.
1307 1290 Thread::muxAcquire(&SerializePageLock, "serialize_thread_states");
1308 1291 os::protect_memory((char *)os::get_memory_serialize_page(),
1309 1292 os::vm_page_size(), MEM_PROT_READ);
1310 1293 os::protect_memory((char *)os::get_memory_serialize_page(),
1311 1294 os::vm_page_size(), MEM_PROT_RW);
1312 1295 Thread::muxRelease(&SerializePageLock);
1313 1296 }
1314 1297
1315 1298 // Returns true if the current stack pointer is above the stack shadow
1316 1299 // pages, false otherwise.
1317 1300
1318 1301 bool os::stack_shadow_pages_available(Thread *thread, methodHandle method) {
1319 1302 assert(StackRedPages > 0 && StackYellowPages > 0,"Sanity check");
1320 1303 address sp = current_stack_pointer();
1321 1304 // Check if we have StackShadowPages above the yellow zone. This parameter
1322 1305 // is dependent on the depth of the maximum VM call stack possible from
1323 1306 // the handler for stack overflow. 'instanceof' in the stack overflow
1324 1307 // handler or a println uses at least 8k stack of VM and native code
1325 1308 // respectively.
1326 1309 const int framesize_in_bytes =
1327 1310 Interpreter::size_top_interpreter_activation(method()) * wordSize;
1328 1311 int reserved_area = ((StackShadowPages + StackRedPages + StackYellowPages)
1329 1312 * vm_page_size()) + framesize_in_bytes;
1330 1313 // The very lower end of the stack
1331 1314 address stack_limit = thread->stack_base() - thread->stack_size();
1332 1315 return (sp > (stack_limit + reserved_area));
1333 1316 }
1334 1317
1335 1318 size_t os::page_size_for_region(size_t region_min_size, size_t region_max_size,
1336 1319 uint min_pages)
1337 1320 {
1338 1321 assert(min_pages > 0, "sanity");
1339 1322 if (UseLargePages) {
1340 1323 const size_t max_page_size = region_max_size / min_pages;
1341 1324
1342 1325 for (unsigned int i = 0; _page_sizes[i] != 0; ++i) {
1343 1326 const size_t sz = _page_sizes[i];
1344 1327 const size_t mask = sz - 1;
1345 1328 if ((region_min_size & mask) == 0 && (region_max_size & mask) == 0) {
1346 1329 // The largest page size with no fragmentation.
1347 1330 return sz;
1348 1331 }
1349 1332
1350 1333 if (sz <= max_page_size) {
1351 1334 // The largest page size that satisfies the min_pages requirement.
1352 1335 return sz;
1353 1336 }
1354 1337 }
1355 1338 }
1356 1339
1357 1340 return vm_page_size();
1358 1341 }
1359 1342
1360 1343 #ifndef PRODUCT
1361 1344 void os::trace_page_sizes(const char* str, const size_t* page_sizes, int count)
1362 1345 {
1363 1346 if (TracePageSizes) {
1364 1347 tty->print("%s: ", str);
1365 1348 for (int i = 0; i < count; ++i) {
1366 1349 tty->print(" " SIZE_FORMAT, page_sizes[i]);
1367 1350 }
1368 1351 tty->cr();
1369 1352 }
1370 1353 }
1371 1354
1372 1355 void os::trace_page_sizes(const char* str, const size_t region_min_size,
1373 1356 const size_t region_max_size, const size_t page_size,
1374 1357 const char* base, const size_t size)
1375 1358 {
1376 1359 if (TracePageSizes) {
1377 1360 tty->print_cr("%s: min=" SIZE_FORMAT " max=" SIZE_FORMAT
1378 1361 " pg_sz=" SIZE_FORMAT " base=" PTR_FORMAT
1379 1362 " size=" SIZE_FORMAT,
1380 1363 str, region_min_size, region_max_size,
1381 1364 page_size, base, size);
1382 1365 }
1383 1366 }
1384 1367 #endif // #ifndef PRODUCT
1385 1368
1386 1369 // This is the working definition of a server class machine:
1387 1370 // >= 2 physical CPU's and >=2GB of memory, with some fuzz
1388 1371 // because the graphics memory (?) sometimes masks physical memory.
1389 1372 // If you want to change the definition of a server class machine
1390 1373 // on some OS or platform, e.g., >=4GB on Windohs platforms,
1391 1374 // then you'll have to parameterize this method based on that state,
1392 1375 // as was done for logical processors here, or replicate and
1393 1376 // specialize this method for each platform. (Or fix os to have
1394 1377 // some inheritance structure and use subclassing. Sigh.)
1395 1378 // If you want some platform to always or never behave as a server
1396 1379 // class machine, change the setting of AlwaysActAsServerClassMachine
1397 1380 // and NeverActAsServerClassMachine in globals*.hpp.
1398 1381 bool os::is_server_class_machine() {
1399 1382 // First check for the early returns
1400 1383 if (NeverActAsServerClassMachine) {
1401 1384 return false;
1402 1385 }
1403 1386 if (AlwaysActAsServerClassMachine) {
1404 1387 return true;
1405 1388 }
1406 1389 // Then actually look at the machine
1407 1390 bool result = false;
1408 1391 const unsigned int server_processors = 2;
1409 1392 const julong server_memory = 2UL * G;
1410 1393 // We seem not to get our full complement of memory.
1411 1394 // We allow some part (1/8?) of the memory to be "missing",
1412 1395 // based on the sizes of DIMMs, and maybe graphics cards.
1413 1396 const julong missing_memory = 256UL * M;
1414 1397
1415 1398 /* Is this a server class machine? */
1416 1399 if ((os::active_processor_count() >= (int)server_processors) &&
1417 1400 (os::physical_memory() >= (server_memory - missing_memory))) {
1418 1401 const unsigned int logical_processors =
1419 1402 VM_Version::logical_processors_per_package();
1420 1403 if (logical_processors > 1) {
1421 1404 const unsigned int physical_packages =
1422 1405 os::active_processor_count() / logical_processors;
1423 1406 if (physical_packages > server_processors) {
1424 1407 result = true;
1425 1408 }
1426 1409 } else {
1427 1410 result = true;
1428 1411 }
1429 1412 }
1430 1413 return result;
1431 1414 }
1432 1415
1433 1416 void os::SuspendedThreadTask::run() {
1434 1417 assert(Threads_lock->owned_by_self() || (_thread == VMThread::vm_thread()), "must have threads lock to call this");
1435 1418 internal_do_task();
1436 1419 _done = true;
1437 1420 }
1438 1421
1439 1422 bool os::create_stack_guard_pages(char* addr, size_t bytes) {
1440 1423 return os::pd_create_stack_guard_pages(addr, bytes);
1441 1424 }
1442 1425
1443 1426 char* os::reserve_memory(size_t bytes, char* addr, size_t alignment_hint) {
1444 1427 char* result = pd_reserve_memory(bytes, addr, alignment_hint);
1445 1428 if (result != NULL) {
1446 1429 MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC);
1447 1430 }
1448 1431
1449 1432 return result;
1450 1433 }
1451 1434
1452 1435 char* os::reserve_memory(size_t bytes, char* addr, size_t alignment_hint,
1453 1436 MEMFLAGS flags) {
1454 1437 char* result = pd_reserve_memory(bytes, addr, alignment_hint);
1455 1438 if (result != NULL) {
1456 1439 MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC);
1457 1440 MemTracker::record_virtual_memory_type((address)result, flags);
1458 1441 }
1459 1442
1460 1443 return result;
1461 1444 }
1462 1445
1463 1446 char* os::attempt_reserve_memory_at(size_t bytes, char* addr) {
1464 1447 char* result = pd_attempt_reserve_memory_at(bytes, addr);
1465 1448 if (result != NULL) {
1466 1449 MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC);
1467 1450 }
1468 1451 return result;
1469 1452 }
1470 1453
1471 1454 void os::split_reserved_memory(char *base, size_t size,
1472 1455 size_t split, bool realloc) {
1473 1456 pd_split_reserved_memory(base, size, split, realloc);
1474 1457 }
1475 1458
1476 1459 bool os::commit_memory(char* addr, size_t bytes, bool executable) {
1477 1460 bool res = pd_commit_memory(addr, bytes, executable);
1478 1461 if (res) {
1479 1462 MemTracker::record_virtual_memory_commit((address)addr, bytes, CALLER_PC);
1480 1463 }
1481 1464 return res;
1482 1465 }
1483 1466
1484 1467 bool os::commit_memory(char* addr, size_t size, size_t alignment_hint,
1485 1468 bool executable) {
1486 1469 bool res = os::pd_commit_memory(addr, size, alignment_hint, executable);
1487 1470 if (res) {
1488 1471 MemTracker::record_virtual_memory_commit((address)addr, size, CALLER_PC);
1489 1472 }
1490 1473 return res;
1491 1474 }
1492 1475
1493 1476 void os::commit_memory_or_exit(char* addr, size_t bytes, bool executable,
1494 1477 const char* mesg) {
1495 1478 pd_commit_memory_or_exit(addr, bytes, executable, mesg);
1496 1479 MemTracker::record_virtual_memory_commit((address)addr, bytes, CALLER_PC);
1497 1480 }
1498 1481
1499 1482 void os::commit_memory_or_exit(char* addr, size_t size, size_t alignment_hint,
1500 1483 bool executable, const char* mesg) {
1501 1484 os::pd_commit_memory_or_exit(addr, size, alignment_hint, executable, mesg);
1502 1485 MemTracker::record_virtual_memory_commit((address)addr, size, CALLER_PC);
1503 1486 }
1504 1487
1505 1488 bool os::uncommit_memory(char* addr, size_t bytes) {
1506 1489 bool res;
1507 1490 if (MemTracker::tracking_level() > NMT_minimal) {
1508 1491 Tracker tkr = MemTracker::get_virtual_memory_uncommit_tracker();
1509 1492 res = pd_uncommit_memory(addr, bytes);
1510 1493 if (res) {
1511 1494 tkr.record((address)addr, bytes);
1512 1495 }
1513 1496 } else {
1514 1497 res = pd_uncommit_memory(addr, bytes);
1515 1498 }
1516 1499 return res;
1517 1500 }
1518 1501
1519 1502 bool os::release_memory(char* addr, size_t bytes) {
1520 1503 bool res;
1521 1504 if (MemTracker::tracking_level() > NMT_minimal) {
1522 1505 Tracker tkr = MemTracker::get_virtual_memory_release_tracker();
1523 1506 res = pd_release_memory(addr, bytes);
1524 1507 if (res) {
1525 1508 tkr.record((address)addr, bytes);
1526 1509 }
1527 1510 } else {
1528 1511 res = pd_release_memory(addr, bytes);
1529 1512 }
1530 1513 return res;
1531 1514 }
1532 1515
1533 1516
1534 1517 char* os::map_memory(int fd, const char* file_name, size_t file_offset,
1535 1518 char *addr, size_t bytes, bool read_only,
1536 1519 bool allow_exec) {
1537 1520 char* result = pd_map_memory(fd, file_name, file_offset, addr, bytes, read_only, allow_exec);
1538 1521 if (result != NULL) {
1539 1522 MemTracker::record_virtual_memory_reserve_and_commit((address)result, bytes, CALLER_PC);
1540 1523 }
1541 1524 return result;
1542 1525 }
1543 1526
1544 1527 char* os::remap_memory(int fd, const char* file_name, size_t file_offset,
1545 1528 char *addr, size_t bytes, bool read_only,
1546 1529 bool allow_exec) {
1547 1530 return pd_remap_memory(fd, file_name, file_offset, addr, bytes,
1548 1531 read_only, allow_exec);
1549 1532 }
1550 1533
1551 1534 bool os::unmap_memory(char *addr, size_t bytes) {
1552 1535 bool result;
1553 1536 if (MemTracker::tracking_level() > NMT_minimal) {
1554 1537 Tracker tkr = MemTracker::get_virtual_memory_release_tracker();
1555 1538 result = pd_unmap_memory(addr, bytes);
1556 1539 if (result) {
1557 1540 tkr.record((address)addr, bytes);
1558 1541 }
1559 1542 } else {
1560 1543 result = pd_unmap_memory(addr, bytes);
1561 1544 }
1562 1545 return result;
1563 1546 }
1564 1547
1565 1548 void os::free_memory(char *addr, size_t bytes, size_t alignment_hint) {
1566 1549 pd_free_memory(addr, bytes, alignment_hint);
1567 1550 }
1568 1551
1569 1552 void os::realign_memory(char *addr, size_t bytes, size_t alignment_hint) {
1570 1553 pd_realign_memory(addr, bytes, alignment_hint);
1571 1554 }
1572 1555
1573 1556 #ifndef TARGET_OS_FAMILY_windows
1574 1557 /* try to switch state from state "from" to state "to"
1575 1558 * returns the state set after the method is complete
1576 1559 */
1577 1560 os::SuspendResume::State os::SuspendResume::switch_state(os::SuspendResume::State from,
1578 1561 os::SuspendResume::State to)
1579 1562 {
1580 1563 os::SuspendResume::State result =
1581 1564 (os::SuspendResume::State) Atomic::cmpxchg((jint) to, (jint *) &_state, (jint) from);
1582 1565 if (result == from) {
1583 1566 // success
1584 1567 return to;
1585 1568 }
1586 1569 return result;
1587 1570 }
1588 1571 #endif
↓ open down ↓ |
918 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX