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