7009828: Fix for 6938627 breaks visualvm monitoring when -Djava.io.tmpdir is defined
Summary: Change get_temp_directory() back to /tmp and %TEMP% like it always was and where the tools expect it to be.
Reviewed-by: phh, dcubed, kamg, alanb
2 * Copyright (c) 1999, 2009, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
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.
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).
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.
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
25 # define __STDC_FORMAT_MACROS
27 // do not include precompiled header file
28 # include "incls/_os_linux.cpp.incl"
30 // put OS-includes here
31 # include <sys/types.h>
32 # include <sys/mman.h>
33 # include <sys/stat.h>
34 # include <sys/select.h>
41 # include <sys/resource.h>
43 # include <sys/stat.h>
44 # include <sys/time.h>
45 # include <sys/times.h>
46 # include <sys/utsname.h>
47 # include <sys/socket.h>
48 # include <sys/wait.h>
51 # include <semaphore.h>
55 # include <sys/sysinfo.h>
56 # include <gnu/libc-version.h>
61 # include <inttypes.h>
63 #define MAX_PATH (2 * K)
65 // for timer info max values which include all bits
66 #define ALL_64_BITS CONST64(0xFFFFFFFFFFFFFFFF)
67 #define SEC_IN_NANOSECS 1000000000LL
69 ////////////////////////////////////////////////////////////////////////////////
71 julong os::Linux::_physical_memory = 0;
73 address os::Linux::_initial_thread_stack_bottom = NULL;
74 uintptr_t os::Linux::_initial_thread_stack_size = 0;
76 int (*os::Linux::_clock_gettime)(clockid_t, struct timespec *) = NULL;
77 int (*os::Linux::_pthread_getcpuclockid)(pthread_t, clockid_t *) = NULL;
78 Mutex* os::Linux::_createThread_lock = NULL;
79 pthread_t os::Linux::_main_thread;
80 int os::Linux::_page_size = -1;
81 bool os::Linux::_is_floating_stack = false;
82 bool os::Linux::_is_NPTL = false;
83 bool os::Linux::_supports_fast_thread_cpu_time = false;
84 const char * os::Linux::_glibc_version = NULL;
85 const char * os::Linux::_libpthread_version = NULL;
87 static jlong initial_time_count=0;
89 static int clock_tics_per_sec = 100;
91 // For diagnostics to print a message once. see run_periodic_checks
92 static sigset_t check_signal_done;
93 static bool check_signals = true;;
95 static pid_t _initial_pid = 0;
97 /* Signal number used to suspend/resume a thread */
99 /* do not use any signal number less than SIGSEGV, see 4355769 */
100 static int SR_signum = SIGUSR2;
103 /* Used to protect dlsym() calls */
104 static pthread_mutex_t dl_mutex;
106 ////////////////////////////////////////////////////////////////////////////////
109 static int SR_initialize();
110 static int SR_finalize();
112 julong os::available_memory() {
113 return Linux::available_memory();
116 julong os::Linux::available_memory() {
117 // values in struct sysinfo are "unsigned long"
121 return (julong)si.freeram * si.mem_unit;
124 julong os::physical_memory() {
125 return Linux::physical_memory();
128 julong os::allocatable_physical_memory(julong size) {
132 julong result = MIN2(size, (julong)3800*M);
133 if (!is_allocatable(result)) {
134 // See comments under solaris for alignment considerations
135 julong reasonable_size = (julong)2*G - 2 * os::vm_page_size();
136 result = MIN2(size, reasonable_size);
142 ////////////////////////////////////////////////////////////////////////////////
143 // environment support
145 bool os::getenv(const char* name, char* buf, int len) {
146 const char* val = ::getenv(name);
147 if (val != NULL && strlen(val) < (size_t)len) {
151 if (len > 0) buf[0] = 0; // return a null string
156 // Return true if user is running as root.
158 bool os::have_special_privileges() {
159 static bool init = false;
160 static bool privileges = false;
162 privileges = (getuid() != geteuid()) || (getgid() != getegid());
170 // i386: 224, ia64: 1105, amd64: 186, sparc 143
172 #define SYS_gettid 1105
174 #define SYS_gettid 224
176 #define SYS_gettid 186
178 #define SYS_gettid 143
180 #error define gettid for the arch
184 // Cpu architecture string
186 static char cpu_arch[] = ZERO_LIBARCH;
188 static char cpu_arch[] = "ia64";
190 static char cpu_arch[] = "i386";
192 static char cpu_arch[] = "amd64";
194 static char cpu_arch[] = "arm";
196 static char cpu_arch[] = "ppc";
199 static char cpu_arch[] = "sparcv9";
201 static char cpu_arch[] = "sparc";
204 #error Add appropriate cpu_arch setting
210 // Returns the kernel thread id of the currently running thread. Kernel
211 // thread id is used to access /proc.
213 // (Note that getpid() on LinuxThreads returns kernel thread id too; but
214 // on NPTL, it returns the same pid for all threads, as required by POSIX.)
216 pid_t os::Linux::gettid() {
217 int rslt = syscall(SYS_gettid);
219 // old kernel, no NPTL support
226 // Most versions of linux have a bug where the number of processors are
227 // determined by looking at the /proc file system. In a chroot environment,
228 // the system call returns 1. This causes the VM to act as if it is
229 // a single processor and elide locking (see is_MP() call).
230 static bool unsafe_chroot_detected = false;
231 static const char *unstable_chroot_error = "/proc file system not found.\n"
232 "Java may be unstable running multithreaded in a chroot "
233 "environment on Linux when /proc filesystem is not mounted.";
235 void os::Linux::initialize_system_info() {
236 set_processor_count(sysconf(_SC_NPROCESSORS_CONF));
237 if (processor_count() == 1) {
238 pid_t pid = os::Linux::gettid();
240 jio_snprintf(fname, sizeof(fname), "/proc/%d", pid);
241 FILE *fp = fopen(fname, "r");
243 unsafe_chroot_detected = true;
248 _physical_memory = (julong)sysconf(_SC_PHYS_PAGES) * (julong)sysconf(_SC_PAGESIZE);
249 assert(processor_count() > 0, "linux error");
252 void os::init_system_properties_values() {
254 // sysinfo(SI_ARCHITECTURE, arch, sizeof(arch));
256 // The next steps are taken in the product version:
258 // Obtain the JAVA_HOME value from the location of libjvm[_g].so.
259 // This library should be located at:
260 // <JAVA_HOME>/jre/lib/<arch>/{client|server}/libjvm[_g].so.
262 // If "/jre/lib/" appears at the right place in the path, then we
263 // assume libjvm[_g].so is installed in a JDK and we use this path.
265 // Otherwise exit with message: "Could not create the Java virtual machine."
267 // The following extra steps are taken in the debugging version:
269 // If "/jre/lib/" does NOT appear at the right place in the path
270 // instead of exit check for $JAVA_HOME environment variable.
272 // If it is defined and we are able to locate $JAVA_HOME/jre/lib/<arch>,
273 // then we append a fake suffix "hotspot/libjvm[_g].so" to this path so
274 // it looks like libjvm[_g].so is installed there
275 // <JAVA_HOME>/jre/lib/<arch>/hotspot/libjvm[_g].so.
279 // Important note: if the location of libjvm.so changes this
280 // code needs to be changed accordingly.
282 // The next few definitions allow the code to be verbatim:
283 #define malloc(n) (char*)NEW_C_HEAP_ARRAY(char, (n))
284 #define getenv(n) ::getenv(n)
288 * The linker uses the following search paths to locate required
292 * 7: The default directories, normally /lib and /usr/lib.
294 #if defined(AMD64) || defined(_LP64) && (defined(SPARC) || defined(PPC) || defined(S390))
295 #define DEFAULT_LIBPATH "/usr/lib64:/lib64:/lib:/usr/lib"
297 #define DEFAULT_LIBPATH "/lib:/usr/lib"
300 #define EXTENSIONS_DIR "/lib/ext"
301 #define ENDORSED_DIR "/lib/endorsed"
302 #define REG_DIR "/usr/java/packages"
305 /* sysclasspath, java_home, dll_dir */
310 char buf[MAXPATHLEN];
311 os::jvm_path(buf, sizeof(buf));
313 // Found the full path to libjvm.so.
314 // Now cut the path to <java_home>/jre if we can.
315 *(strrchr(buf, '/')) = '\0'; /* get rid of /libjvm.so */
316 pslash = strrchr(buf, '/');
318 *pslash = '\0'; /* get rid of /{client|server|hotspot} */
319 dll_path = malloc(strlen(buf) + 1);
320 if (dll_path == NULL)
322 strcpy(dll_path, buf);
323 Arguments::set_dll_dir(dll_path);
325 if (pslash != NULL) {
326 pslash = strrchr(buf, '/');
327 if (pslash != NULL) {
328 *pslash = '\0'; /* get rid of /<arch> */
329 pslash = strrchr(buf, '/');
331 *pslash = '\0'; /* get rid of /lib */
335 home_path = malloc(strlen(buf) + 1);
336 if (home_path == NULL)
338 strcpy(home_path, buf);
339 Arguments::set_java_home(home_path);
341 if (!set_boot_path('/', ':'))
346 * Where to look for native libraries
348 * Note: Due to a legacy implementation, most of the library path
349 * is set in the launcher. This was to accomodate linking restrictions
350 * on legacy Linux implementations (which are no longer supported).
351 * Eventually, all the library path setting will be done here.
353 * However, to prevent the proliferation of improperly built native
354 * libraries, the new path component /usr/java/packages is added here.
355 * Eventually, all the library path setting will be done here.
358 char *ld_library_path;
361 * Construct the invariant part of ld_library_path. Note that the
362 * space for the colon and the trailing null are provided by the
363 * nulls included by the sizeof operator (so actually we allocate
364 * a byte more than necessary).
366 ld_library_path = (char *) malloc(sizeof(REG_DIR) + sizeof("/lib/") +
367 strlen(cpu_arch) + sizeof(DEFAULT_LIBPATH));
368 sprintf(ld_library_path, REG_DIR "/lib/%s:" DEFAULT_LIBPATH, cpu_arch);
371 * Get the user setting of LD_LIBRARY_PATH, and prepended it. It
372 * should always exist (until the legacy problem cited above is
375 char *v = getenv("LD_LIBRARY_PATH");
377 char *t = ld_library_path;
378 /* That's +1 for the colon and +1 for the trailing '\0' */
379 ld_library_path = (char *) malloc(strlen(v) + 1 + strlen(t) + 1);
380 sprintf(ld_library_path, "%s:%s", v, t);
382 Arguments::set_library_path(ld_library_path);
386 * Extensions directories.
388 * Note that the space for the colon and the trailing null are provided
389 * by the nulls included by the sizeof operator (so actually one byte more
390 * than necessary is allocated).
393 char *buf = malloc(strlen(Arguments::get_java_home()) +
394 sizeof(EXTENSIONS_DIR) + sizeof(REG_DIR) + sizeof(EXTENSIONS_DIR));
395 sprintf(buf, "%s" EXTENSIONS_DIR ":" REG_DIR EXTENSIONS_DIR,
396 Arguments::get_java_home());
397 Arguments::set_ext_dirs(buf);
400 /* Endorsed standards default directory. */
403 buf = malloc(strlen(Arguments::get_java_home()) + sizeof(ENDORSED_DIR));
404 sprintf(buf, "%s" ENDORSED_DIR, Arguments::get_java_home());
405 Arguments::set_endorsed_dirs(buf);
411 #undef EXTENSIONS_DIR
418 ////////////////////////////////////////////////////////////////////////////////
419 // breakpoint support
421 void os::breakpoint() {
425 extern "C" void breakpoint() {
426 // use debugger to set breakpoint here
429 ////////////////////////////////////////////////////////////////////////////////
432 debug_only(static bool signal_sets_initialized = false);
433 static sigset_t unblocked_sigs, vm_sigs, allowdebug_blocked_sigs;
435 bool os::Linux::is_sig_ignored(int sig) {
436 struct sigaction oact;
437 sigaction(sig, (struct sigaction*)NULL, &oact);
438 void* ohlr = oact.sa_sigaction ? CAST_FROM_FN_PTR(void*, oact.sa_sigaction)
439 : CAST_FROM_FN_PTR(void*, oact.sa_handler);
440 if (ohlr == CAST_FROM_FN_PTR(void*, SIG_IGN))
446 void os::Linux::signal_sets_init() {
447 // Should also have an assertion stating we are still single-threaded.
448 assert(!signal_sets_initialized, "Already initialized");
449 // Fill in signals that are necessarily unblocked for all threads in
450 // the VM. Currently, we unblock the following signals:
451 // SHUTDOWN{1,2,3}_SIGNAL: for shutdown hooks support (unless over-ridden
452 // by -Xrs (=ReduceSignalUsage));
453 // BREAK_SIGNAL which is unblocked only by the VM thread and blocked by all
454 // other threads. The "ReduceSignalUsage" boolean tells us not to alter
455 // the dispositions or masks wrt these signals.
456 // Programs embedding the VM that want to use the above signals for their
457 // own purposes must, at this time, use the "-Xrs" option to prevent
458 // interference with shutdown hooks and BREAK_SIGNAL thread dumping.
459 // (See bug 4345157, and other related bugs).
460 // In reality, though, unblocking these signals is really a nop, since
461 // these signals are not blocked by default.
462 sigemptyset(&unblocked_sigs);
463 sigemptyset(&allowdebug_blocked_sigs);
464 sigaddset(&unblocked_sigs, SIGILL);
465 sigaddset(&unblocked_sigs, SIGSEGV);
466 sigaddset(&unblocked_sigs, SIGBUS);
467 sigaddset(&unblocked_sigs, SIGFPE);
468 sigaddset(&unblocked_sigs, SR_signum);
470 if (!ReduceSignalUsage) {
471 if (!os::Linux::is_sig_ignored(SHUTDOWN1_SIGNAL)) {
472 sigaddset(&unblocked_sigs, SHUTDOWN1_SIGNAL);
473 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN1_SIGNAL);
475 if (!os::Linux::is_sig_ignored(SHUTDOWN2_SIGNAL)) {
476 sigaddset(&unblocked_sigs, SHUTDOWN2_SIGNAL);
477 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN2_SIGNAL);
479 if (!os::Linux::is_sig_ignored(SHUTDOWN3_SIGNAL)) {
480 sigaddset(&unblocked_sigs, SHUTDOWN3_SIGNAL);
481 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN3_SIGNAL);
484 // Fill in signals that are blocked by all but the VM thread.
485 sigemptyset(&vm_sigs);
486 if (!ReduceSignalUsage)
487 sigaddset(&vm_sigs, BREAK_SIGNAL);
488 debug_only(signal_sets_initialized = true);
492 // These are signals that are unblocked while a thread is running Java.
493 // (For some reason, they get blocked by default.)
494 sigset_t* os::Linux::unblocked_signals() {
495 assert(signal_sets_initialized, "Not initialized");
496 return &unblocked_sigs;
499 // These are the signals that are blocked while a (non-VM) thread is
500 // running Java. Only the VM thread handles these signals.
501 sigset_t* os::Linux::vm_signals() {
502 assert(signal_sets_initialized, "Not initialized");
506 // These are signals that are blocked during cond_wait to allow debugger in
507 sigset_t* os::Linux::allowdebug_blocked_signals() {
508 assert(signal_sets_initialized, "Not initialized");
509 return &allowdebug_blocked_sigs;
512 void os::Linux::hotspot_sigmask(Thread* thread) {
514 //Save caller's signal mask before setting VM signal mask
515 sigset_t caller_sigmask;
516 pthread_sigmask(SIG_BLOCK, NULL, &caller_sigmask);
518 OSThread* osthread = thread->osthread();
519 osthread->set_caller_sigmask(caller_sigmask);
521 pthread_sigmask(SIG_UNBLOCK, os::Linux::unblocked_signals(), NULL);
523 if (!ReduceSignalUsage) {
524 if (thread->is_VM_thread()) {
525 // Only the VM thread handles BREAK_SIGNAL ...
526 pthread_sigmask(SIG_UNBLOCK, vm_signals(), NULL);
528 // ... all other threads block BREAK_SIGNAL
529 pthread_sigmask(SIG_BLOCK, vm_signals(), NULL);
534 //////////////////////////////////////////////////////////////////////////////
535 // detecting pthread library
537 void os::Linux::libpthread_init() {
538 // Save glibc and pthread version strings. Note that _CS_GNU_LIBC_VERSION
539 // and _CS_GNU_LIBPTHREAD_VERSION are supported in glibc >= 2.3.2. Use a
540 // generic name for earlier versions.
541 // Define macros here so we can build HotSpot on old systems.
542 # ifndef _CS_GNU_LIBC_VERSION
543 # define _CS_GNU_LIBC_VERSION 2
545 # ifndef _CS_GNU_LIBPTHREAD_VERSION
546 # define _CS_GNU_LIBPTHREAD_VERSION 3
549 size_t n = confstr(_CS_GNU_LIBC_VERSION, NULL, 0);
551 char *str = (char *)malloc(n);
552 confstr(_CS_GNU_LIBC_VERSION, str, n);
553 os::Linux::set_glibc_version(str);
555 // _CS_GNU_LIBC_VERSION is not supported, try gnu_get_libc_version()
556 static char _gnu_libc_version[32];
557 jio_snprintf(_gnu_libc_version, sizeof(_gnu_libc_version),
558 "glibc %s %s", gnu_get_libc_version(), gnu_get_libc_release());
559 os::Linux::set_glibc_version(_gnu_libc_version);
562 n = confstr(_CS_GNU_LIBPTHREAD_VERSION, NULL, 0);
564 char *str = (char *)malloc(n);
565 confstr(_CS_GNU_LIBPTHREAD_VERSION, str, n);
566 // Vanilla RH-9 (glibc 2.3.2) has a bug that confstr() always tells
567 // us "NPTL-0.29" even we are running with LinuxThreads. Check if this
568 // is the case. LinuxThreads has a hard limit on max number of threads.
569 // So sysconf(_SC_THREAD_THREADS_MAX) will return a positive value.
570 // On the other hand, NPTL does not have such a limit, sysconf()
571 // will return -1 and errno is not changed. Check if it is really NPTL.
572 if (strcmp(os::Linux::glibc_version(), "glibc 2.3.2") == 0 &&
573 strstr(str, "NPTL") &&
574 sysconf(_SC_THREAD_THREADS_MAX) > 0) {
576 os::Linux::set_libpthread_version("linuxthreads");
578 os::Linux::set_libpthread_version(str);
581 // glibc before 2.3.2 only has LinuxThreads.
582 os::Linux::set_libpthread_version("linuxthreads");
585 if (strstr(libpthread_version(), "NPTL")) {
586 os::Linux::set_is_NPTL();
588 os::Linux::set_is_LinuxThreads();
591 // LinuxThreads have two flavors: floating-stack mode, which allows variable
592 // stack size; and fixed-stack mode. NPTL is always floating-stack.
593 if (os::Linux::is_NPTL() || os::Linux::supports_variable_stack_size()) {
594 os::Linux::set_is_floating_stack();
598 /////////////////////////////////////////////////////////////////////////////
601 // Force Linux kernel to expand current thread stack. If "bottom" is close
602 // to the stack guard, caller should block all signals.
605 // A special mmap() flag that is used to implement thread stacks. It tells
606 // kernel that the memory region should extend downwards when needed. This
607 // allows early versions of LinuxThreads to only mmap the first few pages
608 // when creating a new thread. Linux kernel will automatically expand thread
609 // stack as needed (on page faults).
611 // However, because the memory region of a MAP_GROWSDOWN stack can grow on
612 // demand, if a page fault happens outside an already mapped MAP_GROWSDOWN
613 // region, it's hard to tell if the fault is due to a legitimate stack
614 // access or because of reading/writing non-exist memory (e.g. buffer
615 // overrun). As a rule, if the fault happens below current stack pointer,
616 // Linux kernel does not expand stack, instead a SIGSEGV is sent to the
617 // application (see Linux kernel fault.c).
619 // This Linux feature can cause SIGSEGV when VM bangs thread stack for
620 // stack overflow detection.
622 // Newer version of LinuxThreads (since glibc-2.2, or, RH-7.x) and NPTL do
623 // not use this flag. However, the stack of initial thread is not created
624 // by pthread, it is still MAP_GROWSDOWN. Also it's possible (though
625 // unlikely) that user code can create a thread with MAP_GROWSDOWN stack
626 // and then attach the thread to JVM.
628 // To get around the problem and allow stack banging on Linux, we need to
629 // manually expand thread stack after receiving the SIGSEGV.
631 // There are two ways to expand thread stack to address "bottom", we used
632 // both of them in JVM before 1.5:
633 // 1. adjust stack pointer first so that it is below "bottom", and then
635 // 2. mmap() the page in question
637 // Now alternate signal stack is gone, it's harder to use 2. For instance,
638 // if current sp is already near the lower end of page 101, and we need to
639 // call mmap() to map page 100, it is possible that part of the mmap() frame
640 // will be placed in page 100. When page 100 is mapped, it is zero-filled.
641 // That will destroy the mmap() frame and cause VM to crash.
643 // The following code works by adjusting sp first, then accessing the "bottom"
644 // page to force a page fault. Linux kernel will then automatically expand the
647 // _expand_stack_to() assumes its frame size is less than page size, which
648 // should always be true if the function is not inlined.
650 #if __GNUC__ < 3 // gcc 2.x does not support noinline attribute
653 #define NOINLINE __attribute__ ((noinline))
656 static void _expand_stack_to(address bottom) NOINLINE;
658 static void _expand_stack_to(address bottom) {
663 // Adjust bottom to point to the largest address within the same page, it
664 // gives us a one-page buffer if alloca() allocates slightly more memory.
665 bottom = (address)align_size_down((uintptr_t)bottom, os::Linux::page_size());
666 bottom += os::Linux::page_size() - 1;
668 // sp might be slightly above current stack pointer; if that's the case, we
669 // will alloca() a little more space than necessary, which is OK. Don't use
670 // os::current_stack_pointer(), as its result can be slightly below current
671 // stack pointer, causing us to not alloca enough to reach "bottom".
676 p = (volatile char *)alloca(size);
677 assert(p != NULL && p <= (volatile char *)bottom, "alloca problem?");
682 bool os::Linux::manually_expand_stack(JavaThread * t, address addr) {
683 assert(t!=NULL, "just checking");
684 assert(t->osthread()->expanding_stack(), "expand should be set");
685 assert(t->stack_base() != NULL, "stack_base was not initialized");
687 if (addr < t->stack_base() && addr >= t->stack_yellow_zone_base()) {
688 sigset_t mask_all, old_sigset;
689 sigfillset(&mask_all);
690 pthread_sigmask(SIG_SETMASK, &mask_all, &old_sigset);
691 _expand_stack_to(addr);
692 pthread_sigmask(SIG_SETMASK, &old_sigset, NULL);
698 //////////////////////////////////////////////////////////////////////////////
701 static address highest_vm_reserved_address();
703 // check if it's safe to start a new thread
704 static bool _thread_safety_check(Thread* thread) {
705 if (os::Linux::is_LinuxThreads() && !os::Linux::is_floating_stack()) {
706 // Fixed stack LinuxThreads (SuSE Linux/x86, and some versions of Redhat)
707 // Heap is mmap'ed at lower end of memory space. Thread stacks are
708 // allocated (MAP_FIXED) from high address space. Every thread stack
709 // occupies a fixed size slot (usually 2Mbytes, but user can change
710 // it to other values if they rebuild LinuxThreads).
712 // Problem with MAP_FIXED is that mmap() can still succeed even part of
713 // the memory region has already been mmap'ed. That means if we have too
714 // many threads and/or very large heap, eventually thread stack will
715 // collide with heap.
717 // Here we try to prevent heap/stack collision by comparing current
718 // stack bottom with the highest address that has been mmap'ed by JVM
719 // plus a safety margin for memory maps created by native code.
721 // This feature can be disabled by setting ThreadSafetyMargin to 0
723 if (ThreadSafetyMargin > 0) {
724 address stack_bottom = os::current_stack_base() - os::current_stack_size();
726 // not safe if our stack extends below the safety margin
727 return stack_bottom - ThreadSafetyMargin >= highest_vm_reserved_address();
732 // Floating stack LinuxThreads or NPTL:
733 // Unlike fixed stack LinuxThreads, thread stacks are not MAP_FIXED. When
734 // there's not enough space left, pthread_create() will fail. If we come
735 // here, that means enough space has been reserved for stack.
740 // Thread start routine for all newly created threads
741 static void *java_start(Thread *thread) {
742 // Try to randomize the cache line index of hot stack frames.
743 // This helps when threads of the same stack traces evict each other's
744 // cache lines. The threads can be either from the same JVM instance, or
745 // from different JVM instances. The benefit is especially true for
746 // processors with hyperthreading technology.
747 static int counter = 0;
748 int pid = os::current_process_id();
749 alloca(((pid ^ counter++) & 7) * 128);
751 ThreadLocalStorage::set_thread(thread);
753 OSThread* osthread = thread->osthread();
754 Monitor* sync = osthread->startThread_lock();
756 // non floating stack LinuxThreads needs extra check, see above
757 if (!_thread_safety_check(thread)) {
758 // notify parent thread
759 MutexLockerEx ml(sync, Mutex::_no_safepoint_check_flag);
760 osthread->set_state(ZOMBIE);
765 // thread_id is kernel thread id (similar to Solaris LWP id)
766 osthread->set_thread_id(os::Linux::gettid());
769 int lgrp_id = os::numa_get_group_id();
771 thread->set_lgrp_id(lgrp_id);
774 // initialize signal mask for this thread
775 os::Linux::hotspot_sigmask(thread);
777 // initialize floating point control register
778 os::Linux::init_thread_fpu_state();
780 // handshaking with parent thread
782 MutexLockerEx ml(sync, Mutex::_no_safepoint_check_flag);
784 // notify parent thread
785 osthread->set_state(INITIALIZED);
788 // wait until os::start_thread()
789 while (osthread->get_state() == INITIALIZED) {
790 sync->wait(Mutex::_no_safepoint_check_flag);
794 // call one more level start routine
800 bool os::create_thread(Thread* thread, ThreadType thr_type, size_t stack_size) {
801 assert(thread->osthread() == NULL, "caller responsible");
803 // Allocate the OSThread object
804 OSThread* osthread = new OSThread(NULL, NULL);
805 if (osthread == NULL) {
809 // set the correct thread state
810 osthread->set_thread_type(thr_type);
812 // Initial state is ALLOCATED but not INITIALIZED
813 osthread->set_state(ALLOCATED);
815 thread->set_osthread(osthread);
817 // init thread attributes
819 pthread_attr_init(&attr);
820 pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
823 if (os::Linux::supports_variable_stack_size()) {
824 // calculate stack size if it's not specified by caller
825 if (stack_size == 0) {
826 stack_size = os::Linux::default_stack_size(thr_type);
829 case os::java_thread:
830 // Java threads use ThreadStackSize which default value can be changed with the flag -Xss
831 if (JavaThread::stack_size_at_create() > 0) stack_size = JavaThread::stack_size_at_create();
833 case os::compiler_thread:
834 if (CompilerThreadStackSize > 0) {
835 stack_size = (size_t)(CompilerThreadStackSize * K);
837 } // else fall through:
838 // use VMThreadStackSize if CompilerThreadStackSize is not defined
842 case os::watcher_thread:
843 if (VMThreadStackSize > 0) stack_size = (size_t)(VMThreadStackSize * K);
848 stack_size = MAX2(stack_size, os::Linux::min_stack_allowed);
849 pthread_attr_setstacksize(&attr, stack_size);
851 // let pthread_create() pick the default value.
855 pthread_attr_setguardsize(&attr, os::Linux::default_guard_size(thr_type));
860 // Serialize thread creation if we are running with fixed stack LinuxThreads
861 bool lock = os::Linux::is_LinuxThreads() && !os::Linux::is_floating_stack();
863 os::Linux::createThread_lock()->lock_without_safepoint_check();
867 int ret = pthread_create(&tid, &attr, (void* (*)(void*)) java_start, thread);
869 pthread_attr_destroy(&attr);
872 if (PrintMiscellaneous && (Verbose || WizardMode)) {
873 perror("pthread_create()");
875 // Need to clean up stuff we've allocated so far
876 thread->set_osthread(NULL);
878 if (lock) os::Linux::createThread_lock()->unlock();
882 // Store pthread info into the OSThread
883 osthread->set_pthread_id(tid);
885 // Wait until child thread is either initialized or aborted
887 Monitor* sync_with_child = osthread->startThread_lock();
888 MutexLockerEx ml(sync_with_child, Mutex::_no_safepoint_check_flag);
889 while ((state = osthread->get_state()) == ALLOCATED) {
890 sync_with_child->wait(Mutex::_no_safepoint_check_flag);
895 os::Linux::createThread_lock()->unlock();
899 // Aborted due to thread limit being reached
900 if (state == ZOMBIE) {
901 thread->set_osthread(NULL);
906 // The thread is returned suspended (in state INITIALIZED),
907 // and is started higher up in the call chain
908 assert(state == INITIALIZED, "race condition");
912 /////////////////////////////////////////////////////////////////////////////
913 // attach existing thread
915 // bootstrap the main thread
916 bool os::create_main_thread(JavaThread* thread) {
917 assert(os::Linux::_main_thread == pthread_self(), "should be called inside main thread");
918 return create_attached_thread(thread);
921 bool os::create_attached_thread(JavaThread* thread) {
923 thread->verify_not_published();
926 // Allocate the OSThread object
927 OSThread* osthread = new OSThread(NULL, NULL);
929 if (osthread == NULL) {
933 // Store pthread info into the OSThread
934 osthread->set_thread_id(os::Linux::gettid());
935 osthread->set_pthread_id(::pthread_self());
937 // initialize floating point control register
938 os::Linux::init_thread_fpu_state();
940 // Initial thread state is RUNNABLE
941 osthread->set_state(RUNNABLE);
943 thread->set_osthread(osthread);
946 int lgrp_id = os::numa_get_group_id();
948 thread->set_lgrp_id(lgrp_id);
952 if (os::Linux::is_initial_thread()) {
953 // If current thread is initial thread, its stack is mapped on demand,
954 // see notes about MAP_GROWSDOWN. Here we try to force kernel to map
955 // the entire stack region to avoid SEGV in stack banging.
956 // It is also useful to get around the heap-stack-gap problem on SuSE
957 // kernel (see 4821821 for details). We first expand stack to the top
958 // of yellow zone, then enable stack yellow zone (order is significant,
959 // enabling yellow zone first will crash JVM on SuSE Linux), so there
960 // is no gap between the last two virtual memory regions.
962 JavaThread *jt = (JavaThread *)thread;
963 address addr = jt->stack_yellow_zone_base();
964 assert(addr != NULL, "initialization problem?");
965 assert(jt->stack_available(addr) > 0, "stack guard should not be enabled");
967 osthread->set_expanding_stack();
968 os::Linux::manually_expand_stack(jt, addr);
969 osthread->clear_expanding_stack();
972 // initialize signal mask for this thread
973 // and save the caller's signal mask
974 os::Linux::hotspot_sigmask(thread);
979 void os::pd_start_thread(Thread* thread) {
980 OSThread * osthread = thread->osthread();
981 assert(osthread->get_state() != INITIALIZED, "just checking");
982 Monitor* sync_with_child = osthread->startThread_lock();
983 MutexLockerEx ml(sync_with_child, Mutex::_no_safepoint_check_flag);
984 sync_with_child->notify();
987 // Free Linux resources related to the OSThread
988 void os::free_thread(OSThread* osthread) {
989 assert(osthread != NULL, "osthread not set");
991 if (Thread::current()->osthread() == osthread) {
992 // Restore caller's signal mask
993 sigset_t sigmask = osthread->caller_sigmask();
994 pthread_sigmask(SIG_SETMASK, &sigmask, NULL);
1000 //////////////////////////////////////////////////////////////////////////////
1001 // thread local storage
1003 int os::allocate_thread_local_storage() {
1005 int rslt = pthread_key_create(&key, NULL);
1006 assert(rslt == 0, "cannot allocate thread local storage");
1010 // Note: This is currently not used by VM, as we don't destroy TLS key
1012 void os::free_thread_local_storage(int index) {
1013 int rslt = pthread_key_delete((pthread_key_t)index);
1014 assert(rslt == 0, "invalid index");
1017 void os::thread_local_storage_at_put(int index, void* value) {
1018 int rslt = pthread_setspecific((pthread_key_t)index, value);
1019 assert(rslt == 0, "pthread_setspecific failed");
1022 extern "C" Thread* get_thread() {
1023 return ThreadLocalStorage::thread();
1026 //////////////////////////////////////////////////////////////////////////////
1029 // Check if current thread is the initial thread, similar to Solaris thr_main.
1030 bool os::Linux::is_initial_thread(void) {
1032 // If called before init complete, thread stack bottom will be null.
1033 // Can be called if fatal error occurs before initialization.
1034 if (initial_thread_stack_bottom() == NULL) return false;
1035 assert(initial_thread_stack_bottom() != NULL &&
1036 initial_thread_stack_size() != 0,
1037 "os::init did not locate initial thread's stack region");
1038 if ((address)&dummy >= initial_thread_stack_bottom() &&
1039 (address)&dummy < initial_thread_stack_bottom() + initial_thread_stack_size())
1044 // Find the virtual memory area that contains addr
1045 static bool find_vma(address addr, address* vma_low, address* vma_high) {
1046 FILE *fp = fopen("/proc/self/maps", "r");
1050 if (fscanf(fp, "%p-%p", &low, &high) == 2) {
1051 if (low <= addr && addr < high) {
1052 if (vma_low) *vma_low = low;
1053 if (vma_high) *vma_high = high;
1060 if (ch == EOF || ch == (int)'\n') break;
1068 // Locate initial thread stack. This special handling of initial thread stack
1069 // is needed because pthread_getattr_np() on most (all?) Linux distros returns
1070 // bogus value for initial thread.
1071 void os::Linux::capture_initial_stack(size_t max_size) {
1072 // stack size is the easy part, get it from RLIMIT_STACK
1075 getrlimit(RLIMIT_STACK, &rlim);
1076 stack_size = rlim.rlim_cur;
1078 // 6308388: a bug in ld.so will relocate its own .data section to the
1079 // lower end of primordial stack; reduce ulimit -s value a little bit
1080 // so we won't install guard page on ld.so's data section.
1081 stack_size -= 2 * page_size();
1083 // 4441425: avoid crash with "unlimited" stack size on SuSE 7.1 or Redhat
1084 // 7.1, in both cases we will get 2G in return value.
1085 // 4466587: glibc 2.2.x compiled w/o "--enable-kernel=2.4.0" (RH 7.0,
1086 // SuSE 7.2, Debian) can not handle alternate signal stack correctly
1087 // for initial thread if its stack size exceeds 6M. Cap it at 2M,
1088 // in case other parts in glibc still assumes 2M max stack size.
1089 // FIXME: alt signal stack is gone, maybe we can relax this constraint?
1091 if (stack_size > 2 * K * K) stack_size = 2 * K * K;
1093 // Problem still exists RH7.2 (IA64 anyway) but 2MB is a little small
1094 if (stack_size > 4 * K * K) stack_size = 4 * K * K;
1097 // Try to figure out where the stack base (top) is. This is harder.
1099 // When an application is started, glibc saves the initial stack pointer in
1100 // a global variable "__libc_stack_end", which is then used by system
1101 // libraries. __libc_stack_end should be pretty close to stack top. The
1102 // variable is available since the very early days. However, because it is
1103 // a private interface, it could disappear in the future.
1105 // Linux kernel saves start_stack information in /proc/<pid>/stat. Similar
1106 // to __libc_stack_end, it is very close to stack top, but isn't the real
1107 // stack top. Note that /proc may not exist if VM is running as a chroot
1108 // program, so reading /proc/<pid>/stat could fail. Also the contents of
1109 // /proc/<pid>/stat could change in the future (though unlikely).
1111 // We try __libc_stack_end first. If that doesn't work, look for
1112 // /proc/<pid>/stat. If neither of them works, we use current stack pointer
1113 // as a hint, which should work well in most cases.
1115 uintptr_t stack_start;
1117 // try __libc_stack_end first
1118 uintptr_t *p = (uintptr_t *)dlsym(RTLD_DEFAULT, "__libc_stack_end");
1122 // see if we can get the start_stack field from /proc/self/stat
1131 unsigned long flags;
1132 unsigned long minflt;
1133 unsigned long cminflt;
1134 unsigned long majflt;
1135 unsigned long cmajflt;
1136 unsigned long utime;
1137 unsigned long stime;
1152 // Figure what the primordial thread stack base is. Code is inspired
1153 // by email from Hans Boehm. /proc/self/stat begins with current pid,
1154 // followed by command name surrounded by parentheses, state, etc.
1158 fp = fopen("/proc/self/stat", "r");
1160 statlen = fread(stat, 1, 2047, fp);
1161 stat[statlen] = '\0';
1164 // Skip pid and the command string. Note that we could be dealing with
1165 // weird command names, e.g. user could decide to rename java launcher
1166 // to "java 1.4.2 :)", then the stat file would look like
1167 // 1234 (java 1.4.2 :)) R ... ...
1168 // We don't really need to know the command string, just find the last
1169 // occurrence of ")" and then start parsing from there. See bug 4726580.
1170 char * s = strrchr(stat, ')');
1175 do s++; while (isspace(*s));
1177 #define _UFM UINTX_FORMAT
1178 #define _DFM INTX_FORMAT
1180 /* 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 */
1181 /* 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 */
1182 i = sscanf(s, "%c %d %d %d %d %d %lu %lu %lu %lu %lu %lu %lu %ld %ld %ld %ld %ld %ld " _UFM _UFM _DFM _UFM _UFM _UFM _UFM,
1186 &session, /* 6 %d */
1190 &minflt, /* 10 %lu */
1191 &cminflt, /* 11 %lu */
1192 &majflt, /* 12 %lu */
1193 &cmajflt, /* 13 %lu */
1194 &utime, /* 14 %lu */
1195 &stime, /* 15 %lu */
1196 &cutime, /* 16 %ld */
1197 &cstime, /* 17 %ld */
1201 &it_real, /* 21 %ld */
1202 &start, /* 22 UINTX_FORMAT */
1203 &vsize, /* 23 UINTX_FORMAT */
1204 &rss, /* 24 INTX_FORMAT */
1205 &rsslim, /* 25 UINTX_FORMAT */
1206 &scodes, /* 26 UINTX_FORMAT */
1207 &ecode, /* 27 UINTX_FORMAT */
1208 &stack_start); /* 28 UINTX_FORMAT */
1215 assert(false, "Bad conversion from /proc/self/stat");
1216 // product mode - assume we are the initial thread, good luck in the
1218 warning("Can't detect initial thread stack location - bad conversion");
1219 stack_start = (uintptr_t) &rlim;
1222 // For some reason we can't open /proc/self/stat (for example, running on
1223 // FreeBSD with a Linux emulator, or inside chroot), this should work for
1224 // most cases, so don't abort:
1225 warning("Can't detect initial thread stack location - no /proc/self/stat");
1226 stack_start = (uintptr_t) &rlim;
1230 // Now we have a pointer (stack_start) very close to the stack top, the
1231 // next thing to do is to figure out the exact location of stack top. We
1232 // can find out the virtual memory area that contains stack_start by
1233 // reading /proc/self/maps, it should be the last vma in /proc/self/maps,
1234 // and its upper limit is the real stack top. (again, this would fail if
1235 // running inside chroot, because /proc may not exist.)
1237 uintptr_t stack_top;
1239 if (find_vma((address)stack_start, &low, &high)) {
1240 // success, "high" is the true stack top. (ignore "low", because initial
1241 // thread stack grows on demand, its real bottom is high - RLIMIT_STACK.)
1242 stack_top = (uintptr_t)high;
1244 // failed, likely because /proc/self/maps does not exist
1245 warning("Can't detect initial thread stack location - find_vma failed");
1246 // best effort: stack_start is normally within a few pages below the real
1247 // stack top, use it as stack top, and reduce stack size so we won't put
1248 // guard page outside stack.
1249 stack_top = stack_start;
1250 stack_size -= 16 * page_size();
1253 // stack_top could be partially down the page so align it
1254 stack_top = align_size_up(stack_top, page_size());
1256 if (max_size && stack_size > max_size) {
1257 _initial_thread_stack_size = max_size;
1259 _initial_thread_stack_size = stack_size;
1262 _initial_thread_stack_size = align_size_down(_initial_thread_stack_size, page_size());
1263 _initial_thread_stack_bottom = (address)stack_top - _initial_thread_stack_size;
1266 ////////////////////////////////////////////////////////////////////////////////
1269 // Time since start-up in seconds to a fine granularity.
1270 // Used by VMSelfDestructTimer and the MemProfiler.
1271 double os::elapsedTime() {
1273 return (double)(os::elapsed_counter()) * 0.000001;
1276 jlong os::elapsed_counter() {
1278 int status = gettimeofday(&time, NULL);
1279 return jlong(time.tv_sec) * 1000 * 1000 + jlong(time.tv_usec) - initial_time_count;
1282 jlong os::elapsed_frequency() {
1283 return (1000 * 1000);
1286 // For now, we say that linux does not support vtime. I have no idea
1287 // whether it can actually be made to (DLD, 9/13/05).
1289 bool os::supports_vtime() { return false; }
1290 bool os::enable_vtime() { return false; }
1291 bool os::vtime_enabled() { return false; }
1292 double os::elapsedVTime() {
1293 // better than nothing, but not much
1294 return elapsedTime();
1297 jlong os::javaTimeMillis() {
1299 int status = gettimeofday(&time, NULL);
1300 assert(status != -1, "linux error");
1301 return jlong(time.tv_sec) * 1000 + jlong(time.tv_usec / 1000);
1304 #ifndef CLOCK_MONOTONIC
1305 #define CLOCK_MONOTONIC (1)
1308 void os::Linux::clock_init() {
1309 // we do dlopen's in this particular order due to bug in linux
1310 // dynamical loader (see 6348968) leading to crash on exit
1311 void* handle = dlopen("librt.so.1", RTLD_LAZY);
1312 if (handle == NULL) {
1313 handle = dlopen("librt.so", RTLD_LAZY);
1317 int (*clock_getres_func)(clockid_t, struct timespec*) =
1318 (int(*)(clockid_t, struct timespec*))dlsym(handle, "clock_getres");
1319 int (*clock_gettime_func)(clockid_t, struct timespec*) =
1320 (int(*)(clockid_t, struct timespec*))dlsym(handle, "clock_gettime");
1321 if (clock_getres_func && clock_gettime_func) {
1322 // See if monotonic clock is supported by the kernel. Note that some
1323 // early implementations simply return kernel jiffies (updated every
1324 // 1/100 or 1/1000 second). It would be bad to use such a low res clock
1325 // for nano time (though the monotonic property is still nice to have).
1326 // It's fixed in newer kernels, however clock_getres() still returns
1327 // 1/HZ. We check if clock_getres() works, but will ignore its reported
1328 // resolution for now. Hopefully as people move to new kernels, this
1329 // won't be a problem.
1330 struct timespec res;
1332 if (clock_getres_func (CLOCK_MONOTONIC, &res) == 0 &&
1333 clock_gettime_func(CLOCK_MONOTONIC, &tp) == 0) {
1334 // yes, monotonic clock is supported
1335 _clock_gettime = clock_gettime_func;
1337 // close librt if there is no monotonic clock
1344 #ifndef SYS_clock_getres
1346 #if defined(IA32) || defined(AMD64)
1347 #define SYS_clock_getres IA32_ONLY(266) AMD64_ONLY(229)
1348 #define sys_clock_getres(x,y) ::syscall(SYS_clock_getres, x, y)
1350 #warning "SYS_clock_getres not defined for this platform, disabling fast_thread_cpu_time"
1351 #define sys_clock_getres(x,y) -1
1355 #define sys_clock_getres(x,y) ::syscall(SYS_clock_getres, x, y)
1358 void os::Linux::fast_thread_clock_init() {
1359 if (!UseLinuxPosixThreadCPUClocks) {
1364 int (*pthread_getcpuclockid_func)(pthread_t, clockid_t *) =
1365 (int(*)(pthread_t, clockid_t *)) dlsym(RTLD_DEFAULT, "pthread_getcpuclockid");
1367 // Switch to using fast clocks for thread cpu time if
1368 // the sys_clock_getres() returns 0 error code.
1369 // Note, that some kernels may support the current thread
1370 // clock (CLOCK_THREAD_CPUTIME_ID) but not the clocks
1371 // returned by the pthread_getcpuclockid().
1372 // If the fast Posix clocks are supported then the sys_clock_getres()
1373 // must return at least tp.tv_sec == 0 which means a resolution
1374 // better than 1 sec. This is extra check for reliability.
1376 if(pthread_getcpuclockid_func &&
1377 pthread_getcpuclockid_func(_main_thread, &clockid) == 0 &&
1378 sys_clock_getres(clockid, &tp) == 0 && tp.tv_sec == 0) {
1380 _supports_fast_thread_cpu_time = true;
1381 _pthread_getcpuclockid = pthread_getcpuclockid_func;
1385 jlong os::javaTimeNanos() {
1386 if (Linux::supports_monotonic_clock()) {
1388 int status = Linux::clock_gettime(CLOCK_MONOTONIC, &tp);
1389 assert(status == 0, "gettime error");
1390 jlong result = jlong(tp.tv_sec) * (1000 * 1000 * 1000) + jlong(tp.tv_nsec);
1394 int status = gettimeofday(&time, NULL);
1395 assert(status != -1, "linux error");
1396 jlong usecs = jlong(time.tv_sec) * (1000 * 1000) + jlong(time.tv_usec);
1397 return 1000 * usecs;
1401 void os::javaTimeNanos_info(jvmtiTimerInfo *info_ptr) {
1402 if (Linux::supports_monotonic_clock()) {
1403 info_ptr->max_value = ALL_64_BITS;
1405 // CLOCK_MONOTONIC - amount of time since some arbitrary point in the past
1406 info_ptr->may_skip_backward = false; // not subject to resetting or drifting
1407 info_ptr->may_skip_forward = false; // not subject to resetting or drifting
1409 // gettimeofday - based on time in seconds since the Epoch thus does not wrap
1410 info_ptr->max_value = ALL_64_BITS;
1412 // gettimeofday is a real time clock so it skips
1413 info_ptr->may_skip_backward = true;
1414 info_ptr->may_skip_forward = true;
1417 info_ptr->kind = JVMTI_TIMER_ELAPSED; // elapsed not CPU time
1420 // Return the real, user, and system times in seconds from an
1421 // arbitrary fixed point in the past.
1422 bool os::getTimesSecs(double* process_real_time,
1423 double* process_user_time,
1424 double* process_system_time) {
1426 clock_t real_ticks = times(&ticks);
1428 if (real_ticks == (clock_t) (-1)) {
1431 double ticks_per_second = (double) clock_tics_per_sec;
1432 *process_user_time = ((double) ticks.tms_utime) / ticks_per_second;
1433 *process_system_time = ((double) ticks.tms_stime) / ticks_per_second;
1434 *process_real_time = ((double) real_ticks) / ticks_per_second;
1441 char * os::local_time_string(char *buf, size_t buflen) {
1445 localtime_r(&long_time, &t);
1446 jio_snprintf(buf, buflen, "%d-%02d-%02d %02d:%02d:%02d",
1447 t.tm_year + 1900, t.tm_mon + 1, t.tm_mday,
1448 t.tm_hour, t.tm_min, t.tm_sec);
1452 struct tm* os::localtime_pd(const time_t* clock, struct tm* res) {
1453 return localtime_r(clock, res);
1456 ////////////////////////////////////////////////////////////////////////////////
1457 // runtime exit support
1459 // Note: os::shutdown() might be called very early during initialization, or
1460 // called from signal handler. Before adding something to os::shutdown(), make
1461 // sure it is async-safe and can handle partially initialized VM.
1462 void os::shutdown() {
1464 // allow PerfMemory to attempt cleanup of any persistent resources
1467 // needs to remove object in file system
1468 AttachListener::abort();
1470 // flush buffered output, finish log files
1473 // Check for abort hook
1474 abort_hook_t abort_hook = Arguments::abort_hook();
1475 if (abort_hook != NULL) {
1481 // Note: os::abort() might be called very early during initialization, or
1482 // called from signal handler. Before adding something to os::abort(), make
1483 // sure it is async-safe and can handle partially initialized VM.
1484 void os::abort(bool dump_core) {
1488 fdStream out(defaultStream::output_fd());
1489 out.print_raw("Current thread is ");
1491 jio_snprintf(buf, sizeof(buf), UINTX_FORMAT, os::current_thread_id());
1492 out.print_raw_cr(buf);
1493 out.print_raw_cr("Dumping core ...");
1495 ::abort(); // dump core
1501 // Die immediately, no exit hook, no abort hook, no cleanup.
1503 // _exit() on LinuxThreads only kills current thread
1507 // unused on linux for now.
1508 void os::set_error_file(const char *logfile) {}
1510 intx os::current_thread_id() { return (intx)pthread_self(); }
1511 int os::current_process_id() {
1513 // Under the old linux thread library, linux gives each thread
1514 // its own process id. Because of this each thread will return
1515 // a different pid if this method were to return the result
1516 // of getpid(2). Linux provides no api that returns the pid
1517 // of the launcher thread for the vm. This implementation
1518 // returns a unique pid, the pid of the launcher thread
1519 // that starts the vm 'process'.
1521 // Under the NPTL, getpid() returns the same pid as the
1522 // launcher thread rather than a unique pid per thread.
1523 // Use gettid() if you want the old pre NPTL behaviour.
1525 // if you are looking for the result of a call to getpid() that
1526 // returns a unique pid for the calling thread, then look at the
1527 // OSThread::thread_id() method in osThread_linux.hpp file
1529 return (int)(_initial_pid ? _initial_pid : getpid());
1534 const char* os::dll_file_extension() { return ".so"; }
1536 // This must be hard coded because it's the system's temporary
1537 // directory not the java application's temp directory, ala java.io.tmpdir.
1538 const char* os::get_temp_directory() { return "/tmp"; }
1540 static bool file_exists(const char* filename) {
1541 struct stat statbuf;
1542 if (filename == NULL || strlen(filename) == 0) {
1545 return os::stat(filename, &statbuf) == 0;
1548 void os::dll_build_name(char* buffer, size_t buflen,
1549 const char* pname, const char* fname) {
1550 // Copied from libhpi
1551 const size_t pnamelen = pname ? strlen(pname) : 0;
1553 // Quietly truncate on buffer overflow. Should be an error.
1554 if (pnamelen + strlen(fname) + 10 > (size_t) buflen) {
1559 if (pnamelen == 0) {
1560 snprintf(buffer, buflen, "lib%s.so", fname);
1561 } else if (strchr(pname, *os::path_separator()) != NULL) {
1563 char** pelements = split_path(pname, &n);
1564 for (int i = 0 ; i < n ; i++) {
1565 // Really shouldn't be NULL, but check can't hurt
1566 if (pelements[i] == NULL || strlen(pelements[i]) == 0) {
1567 continue; // skip the empty path values
1569 snprintf(buffer, buflen, "%s/lib%s.so", pelements[i], fname);
1570 if (file_exists(buffer)) {
1574 // release the storage
1575 for (int i = 0 ; i < n ; i++) {
1576 if (pelements[i] != NULL) {
1577 FREE_C_HEAP_ARRAY(char, pelements[i]);
1580 if (pelements != NULL) {
1581 FREE_C_HEAP_ARRAY(char*, pelements);
1584 snprintf(buffer, buflen, "%s/lib%s.so", pname, fname);
1588 const char* os::get_current_directory(char *buf, int buflen) {
1589 return getcwd(buf, buflen);
1592 // check if addr is inside libjvm[_g].so
1593 bool os::address_is_in_vm(address addr) {
1594 static address libjvm_base_addr;
1597 if (libjvm_base_addr == NULL) {
1598 dladdr(CAST_FROM_FN_PTR(void *, os::address_is_in_vm), &dlinfo);
1599 libjvm_base_addr = (address)dlinfo.dli_fbase;
1600 assert(libjvm_base_addr !=NULL, "Cannot obtain base address for libjvm");
1603 if (dladdr((void *)addr, &dlinfo)) {
1604 if (libjvm_base_addr == (address)dlinfo.dli_fbase) return true;
1610 bool os::dll_address_to_function_name(address addr, char *buf,
1611 int buflen, int *offset) {
1614 if (dladdr((void*)addr, &dlinfo) && dlinfo.dli_sname != NULL) {
1615 if (buf) jio_snprintf(buf, buflen, "%s", dlinfo.dli_sname);
1616 if (offset) *offset = addr - (address)dlinfo.dli_saddr;
1619 if (buf) buf[0] = '\0';
1620 if (offset) *offset = -1;
1625 struct _address_to_library_name {
1626 address addr; // input : memory address
1627 size_t buflen; // size of fname
1628 char* fname; // output: library name
1629 address base; // library base addr
1632 static int address_to_library_name_callback(struct dl_phdr_info *info,
1633 size_t size, void *data) {
1636 address libbase = NULL;
1637 struct _address_to_library_name * d = (struct _address_to_library_name *)data;
1639 // iterate through all loadable segments
1640 for (i = 0; i < info->dlpi_phnum; i++) {
1641 address segbase = (address)(info->dlpi_addr + info->dlpi_phdr[i].p_vaddr);
1642 if (info->dlpi_phdr[i].p_type == PT_LOAD) {
1643 // base address of a library is the lowest address of its loaded
1645 if (libbase == NULL || libbase > segbase) {
1648 // see if 'addr' is within current segment
1649 if (segbase <= d->addr &&
1650 d->addr < segbase + info->dlpi_phdr[i].p_memsz) {
1656 // dlpi_name is NULL or empty if the ELF file is executable, return 0
1657 // so dll_address_to_library_name() can fall through to use dladdr() which
1658 // can figure out executable name from argv[0].
1659 if (found && info->dlpi_name && info->dlpi_name[0]) {
1662 jio_snprintf(d->fname, d->buflen, "%s", info->dlpi_name);
1669 bool os::dll_address_to_library_name(address addr, char* buf,
1670 int buflen, int* offset) {
1672 struct _address_to_library_name data;
1674 // There is a bug in old glibc dladdr() implementation that it could resolve
1675 // to wrong library name if the .so file has a base address != NULL. Here
1676 // we iterate through the program headers of all loaded libraries to find
1677 // out which library 'addr' really belongs to. This workaround can be
1678 // removed once the minimum requirement for glibc is moved to 2.3.x.
1681 data.buflen = buflen;
1683 int rslt = dl_iterate_phdr(address_to_library_name_callback, (void *)&data);
1686 // buf already contains library name
1687 if (offset) *offset = addr - data.base;
1689 } else if (dladdr((void*)addr, &dlinfo)){
1690 if (buf) jio_snprintf(buf, buflen, "%s", dlinfo.dli_fname);
1691 if (offset) *offset = addr - (address)dlinfo.dli_fbase;
1694 if (buf) buf[0] = '\0';
1695 if (offset) *offset = -1;
1700 // Loads .dll/.so and
1701 // in case of error it checks if .dll/.so was built for the
1702 // same architecture as Hotspot is running on
1704 void * os::dll_load(const char *filename, char *ebuf, int ebuflen)
1706 void * result= ::dlopen(filename, RTLD_LAZY);
1707 if (result != NULL) {
1708 // Successful loading
1712 Elf32_Ehdr elf_head;
1714 // Read system error message into ebuf
1715 // It may or may not be overwritten below
1716 ::strncpy(ebuf, ::dlerror(), ebuflen-1);
1717 ebuf[ebuflen-1]='\0';
1718 int diag_msg_max_length=ebuflen-strlen(ebuf);
1719 char* diag_msg_buf=ebuf+strlen(ebuf);
1721 if (diag_msg_max_length==0) {
1722 // No more space in ebuf for additional diagnostics message
1727 int file_descriptor= ::open(filename, O_RDONLY | O_NONBLOCK);
1729 if (file_descriptor < 0) {
1730 // Can't open library, report dlerror() message
1734 bool failed_to_read_elf_head=
1736 (::read(file_descriptor, &elf_head,sizeof(elf_head)))) ;
1738 ::close(file_descriptor);
1739 if (failed_to_read_elf_head) {
1740 // file i/o error - report dlerror() msg
1745 Elf32_Half code; // Actual value as defined in elf.h
1746 Elf32_Half compat_class; // Compatibility of archs at VM's sense
1747 char elf_class; // 32 or 64 bit
1748 char endianess; // MSB or LSB
1749 char* name; // String representation
1753 #define EM_486 6 /* Intel 80486 */
1756 static const arch_t arch_array[]={
1757 {EM_386, EM_386, ELFCLASS32, ELFDATA2LSB, (char*)"IA 32"},
1758 {EM_486, EM_386, ELFCLASS32, ELFDATA2LSB, (char*)"IA 32"},
1759 {EM_IA_64, EM_IA_64, ELFCLASS64, ELFDATA2LSB, (char*)"IA 64"},
1760 {EM_X86_64, EM_X86_64, ELFCLASS64, ELFDATA2LSB, (char*)"AMD 64"},
1761 {EM_SPARC, EM_SPARC, ELFCLASS32, ELFDATA2MSB, (char*)"Sparc 32"},
1762 {EM_SPARC32PLUS, EM_SPARC, ELFCLASS32, ELFDATA2MSB, (char*)"Sparc 32"},
1763 {EM_SPARCV9, EM_SPARCV9, ELFCLASS64, ELFDATA2MSB, (char*)"Sparc v9 64"},
1764 {EM_PPC, EM_PPC, ELFCLASS32, ELFDATA2MSB, (char*)"Power PC 32"},
1765 {EM_PPC64, EM_PPC64, ELFCLASS64, ELFDATA2MSB, (char*)"Power PC 64"},
1766 {EM_ARM, EM_ARM, ELFCLASS32, ELFDATA2LSB, (char*)"ARM"},
1767 {EM_S390, EM_S390, ELFCLASSNONE, ELFDATA2MSB, (char*)"IBM System/390"},
1768 {EM_ALPHA, EM_ALPHA, ELFCLASS64, ELFDATA2LSB, (char*)"Alpha"},
1769 {EM_MIPS_RS3_LE, EM_MIPS_RS3_LE, ELFCLASS32, ELFDATA2LSB, (char*)"MIPSel"},
1770 {EM_MIPS, EM_MIPS, ELFCLASS32, ELFDATA2MSB, (char*)"MIPS"},
1771 {EM_PARISC, EM_PARISC, ELFCLASS32, ELFDATA2MSB, (char*)"PARISC"},
1772 {EM_68K, EM_68K, ELFCLASS32, ELFDATA2MSB, (char*)"M68k"}
1776 static Elf32_Half running_arch_code=EM_386;
1777 #elif (defined AMD64)
1778 static Elf32_Half running_arch_code=EM_X86_64;
1779 #elif (defined IA64)
1780 static Elf32_Half running_arch_code=EM_IA_64;
1781 #elif (defined __sparc) && (defined _LP64)
1782 static Elf32_Half running_arch_code=EM_SPARCV9;
1783 #elif (defined __sparc) && (!defined _LP64)
1784 static Elf32_Half running_arch_code=EM_SPARC;
1785 #elif (defined __powerpc64__)
1786 static Elf32_Half running_arch_code=EM_PPC64;
1787 #elif (defined __powerpc__)
1788 static Elf32_Half running_arch_code=EM_PPC;
1790 static Elf32_Half running_arch_code=EM_ARM;
1791 #elif (defined S390)
1792 static Elf32_Half running_arch_code=EM_S390;
1793 #elif (defined ALPHA)
1794 static Elf32_Half running_arch_code=EM_ALPHA;
1795 #elif (defined MIPSEL)
1796 static Elf32_Half running_arch_code=EM_MIPS_RS3_LE;
1797 #elif (defined PARISC)
1798 static Elf32_Half running_arch_code=EM_PARISC;
1799 #elif (defined MIPS)
1800 static Elf32_Half running_arch_code=EM_MIPS;
1801 #elif (defined M68K)
1802 static Elf32_Half running_arch_code=EM_68K;
1804 #error Method os::dll_load requires that one of following is defined:\
1805 IA32, AMD64, IA64, __sparc, __powerpc__, ARM, S390, ALPHA, MIPS, MIPSEL, PARISC, M68K
1808 // Identify compatability class for VM's architecture and library's architecture
1809 // Obtain string descriptions for architectures
1811 arch_t lib_arch={elf_head.e_machine,0,elf_head.e_ident[EI_CLASS], elf_head.e_ident[EI_DATA], NULL};
1812 int running_arch_index=-1;
1814 for (unsigned int i=0 ; i < ARRAY_SIZE(arch_array) ; i++ ) {
1815 if (running_arch_code == arch_array[i].code) {
1816 running_arch_index = i;
1818 if (lib_arch.code == arch_array[i].code) {
1819 lib_arch.compat_class = arch_array[i].compat_class;
1820 lib_arch.name = arch_array[i].name;
1824 assert(running_arch_index != -1,
1825 "Didn't find running architecture code (running_arch_code) in arch_array");
1826 if (running_arch_index == -1) {
1827 // Even though running architecture detection failed
1828 // we may still continue with reporting dlerror() message
1832 if (lib_arch.endianess != arch_array[running_arch_index].endianess) {
1833 ::snprintf(diag_msg_buf, diag_msg_max_length-1," (Possible cause: endianness mismatch)");
1838 if (lib_arch.elf_class != arch_array[running_arch_index].elf_class) {
1839 ::snprintf(diag_msg_buf, diag_msg_max_length-1," (Possible cause: architecture word width mismatch)");
1844 if (lib_arch.compat_class != arch_array[running_arch_index].compat_class) {
1845 if ( lib_arch.name!=NULL ) {
1846 ::snprintf(diag_msg_buf, diag_msg_max_length-1,
1847 " (Possible cause: can't load %s-bit .so on a %s-bit platform)",
1848 lib_arch.name, arch_array[running_arch_index].name);
1850 ::snprintf(diag_msg_buf, diag_msg_max_length-1,
1851 " (Possible cause: can't load this .so (machine code=0x%x) on a %s-bit platform)",
1853 arch_array[running_arch_index].name);
1861 * glibc-2.0 libdl is not MT safe. If you are building with any glibc,
1862 * chances are you might want to run the generated bits against glibc-2.0
1863 * libdl.so, so always use locking for any version of glibc.
1865 void* os::dll_lookup(void* handle, const char* name) {
1866 pthread_mutex_lock(&dl_mutex);
1867 void* res = dlsym(handle, name);
1868 pthread_mutex_unlock(&dl_mutex);
1873 bool _print_ascii_file(const char* filename, outputStream* st) {
1874 int fd = open(filename, O_RDONLY);
1881 while ((bytes = read(fd, buf, sizeof(buf))) > 0) {
1882 st->print_raw(buf, bytes);
1890 void os::print_dll_info(outputStream *st) {
1891 st->print_cr("Dynamic libraries:");
1894 pid_t pid = os::Linux::gettid();
1896 jio_snprintf(fname, sizeof(fname), "/proc/%d/maps", pid);
1898 if (!_print_ascii_file(fname, st)) {
1899 st->print("Can not get library information for pid = %d\n", pid);
1904 void os::print_os_info(outputStream* st) {
1907 // Try to identify popular distros.
1908 // Most Linux distributions have /etc/XXX-release file, which contains
1909 // the OS version string. Some have more than one /etc/XXX-release file
1910 // (e.g. Mandrake has both /etc/mandrake-release and /etc/redhat-release.),
1911 // so the order is important.
1912 if (!_print_ascii_file("/etc/mandrake-release", st) &&
1913 !_print_ascii_file("/etc/sun-release", st) &&
1914 !_print_ascii_file("/etc/redhat-release", st) &&
1915 !_print_ascii_file("/etc/SuSE-release", st) &&
1916 !_print_ascii_file("/etc/turbolinux-release", st) &&
1917 !_print_ascii_file("/etc/gentoo-release", st) &&
1918 !_print_ascii_file("/etc/debian_version", st) &&
1919 !_print_ascii_file("/etc/ltib-release", st) &&
1920 !_print_ascii_file("/etc/angstrom-version", st)) {
1926 st->print("uname:");
1927 struct utsname name;
1929 st->print(name.sysname); st->print(" ");
1930 st->print(name.release); st->print(" ");
1931 st->print(name.version); st->print(" ");
1932 st->print(name.machine);
1935 // Print warning if unsafe chroot environment detected
1936 if (unsafe_chroot_detected) {
1937 st->print("WARNING!! ");
1938 st->print_cr(unstable_chroot_error);
1943 st->print(os::Linux::glibc_version()); st->print(" ");
1944 st->print(os::Linux::libpthread_version()); st->print(" ");
1945 if (os::Linux::is_LinuxThreads()) {
1946 st->print("(%s stack)", os::Linux::is_floating_stack() ? "floating" : "fixed");
1951 st->print("rlimit:");
1954 st->print(" STACK ");
1955 getrlimit(RLIMIT_STACK, &rlim);
1956 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity");
1957 else st->print("%uk", rlim.rlim_cur >> 10);
1959 st->print(", CORE ");
1960 getrlimit(RLIMIT_CORE, &rlim);
1961 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity");
1962 else st->print("%uk", rlim.rlim_cur >> 10);
1964 st->print(", NPROC ");
1965 getrlimit(RLIMIT_NPROC, &rlim);
1966 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity");
1967 else st->print("%d", rlim.rlim_cur);
1969 st->print(", NOFILE ");
1970 getrlimit(RLIMIT_NOFILE, &rlim);
1971 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity");
1972 else st->print("%d", rlim.rlim_cur);
1975 getrlimit(RLIMIT_AS, &rlim);
1976 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity");
1977 else st->print("%uk", rlim.rlim_cur >> 10);
1981 st->print("load average:");
1983 os::loadavg(loadavg, 3);
1984 st->print("%0.02f %0.02f %0.02f", loadavg[0], loadavg[1], loadavg[2]);
1988 st->print("\n/proc/meminfo:\n");
1989 _print_ascii_file("/proc/meminfo", st);
1993 void os::print_memory_info(outputStream* st) {
1995 st->print("Memory:");
1996 st->print(" %dk page", os::vm_page_size()>>10);
1998 // values in struct sysinfo are "unsigned long"
2002 st->print(", physical " UINT64_FORMAT "k",
2003 os::physical_memory() >> 10);
2004 st->print("(" UINT64_FORMAT "k free)",
2005 os::available_memory() >> 10);
2006 st->print(", swap " UINT64_FORMAT "k",
2007 ((jlong)si.totalswap * si.mem_unit) >> 10);
2008 st->print("(" UINT64_FORMAT "k free)",
2009 ((jlong)si.freeswap * si.mem_unit) >> 10);
2013 // Taken from /usr/include/bits/siginfo.h Supposed to be architecture specific
2014 // but they're the same for all the linux arch that we support
2015 // and they're the same for solaris but there's no common place to put this.
2016 const char *ill_names[] = { "ILL0", "ILL_ILLOPC", "ILL_ILLOPN", "ILL_ILLADR",
2017 "ILL_ILLTRP", "ILL_PRVOPC", "ILL_PRVREG",
2018 "ILL_COPROC", "ILL_BADSTK" };
2020 const char *fpe_names[] = { "FPE0", "FPE_INTDIV", "FPE_INTOVF", "FPE_FLTDIV",
2021 "FPE_FLTOVF", "FPE_FLTUND", "FPE_FLTRES",
2022 "FPE_FLTINV", "FPE_FLTSUB", "FPE_FLTDEN" };
2024 const char *segv_names[] = { "SEGV0", "SEGV_MAPERR", "SEGV_ACCERR" };
2026 const char *bus_names[] = { "BUS0", "BUS_ADRALN", "BUS_ADRERR", "BUS_OBJERR" };
2028 void os::print_siginfo(outputStream* st, void* siginfo) {
2029 st->print("siginfo:");
2031 const int buflen = 100;
2033 siginfo_t *si = (siginfo_t*)siginfo;
2034 st->print("si_signo=%s: ", os::exception_name(si->si_signo, buf, buflen));
2035 if (si->si_errno != 0 && strerror_r(si->si_errno, buf, buflen) == 0) {
2036 st->print("si_errno=%s", buf);
2038 st->print("si_errno=%d", si->si_errno);
2040 const int c = si->si_code;
2041 assert(c > 0, "unexpected si_code");
2042 switch (si->si_signo) {
2044 st->print(", si_code=%d (%s)", c, c > 8 ? "" : ill_names[c]);
2045 st->print(", si_addr=" PTR_FORMAT, si->si_addr);
2048 st->print(", si_code=%d (%s)", c, c > 9 ? "" : fpe_names[c]);
2049 st->print(", si_addr=" PTR_FORMAT, si->si_addr);
2052 st->print(", si_code=%d (%s)", c, c > 2 ? "" : segv_names[c]);
2053 st->print(", si_addr=" PTR_FORMAT, si->si_addr);
2056 st->print(", si_code=%d (%s)", c, c > 3 ? "" : bus_names[c]);
2057 st->print(", si_addr=" PTR_FORMAT, si->si_addr);
2060 st->print(", si_code=%d", si->si_code);
2064 if ((si->si_signo == SIGBUS || si->si_signo == SIGSEGV) &&
2066 FileMapInfo* mapinfo = FileMapInfo::current_info();
2067 if (mapinfo->is_in_shared_space(si->si_addr)) {
2068 st->print("\n\nError accessing class data sharing archive." \
2069 " Mapped file inaccessible during execution, " \
2070 " possible disk/network problem.");
2077 static void print_signal_handler(outputStream* st, int sig,
2078 char* buf, size_t buflen);
2080 void os::print_signal_handlers(outputStream* st, char* buf, size_t buflen) {
2081 st->print_cr("Signal Handlers:");
2082 print_signal_handler(st, SIGSEGV, buf, buflen);
2083 print_signal_handler(st, SIGBUS , buf, buflen);
2084 print_signal_handler(st, SIGFPE , buf, buflen);
2085 print_signal_handler(st, SIGPIPE, buf, buflen);
2086 print_signal_handler(st, SIGXFSZ, buf, buflen);
2087 print_signal_handler(st, SIGILL , buf, buflen);
2088 print_signal_handler(st, INTERRUPT_SIGNAL, buf, buflen);
2089 print_signal_handler(st, SR_signum, buf, buflen);
2090 print_signal_handler(st, SHUTDOWN1_SIGNAL, buf, buflen);
2091 print_signal_handler(st, SHUTDOWN2_SIGNAL , buf, buflen);
2092 print_signal_handler(st, SHUTDOWN3_SIGNAL , buf, buflen);
2093 print_signal_handler(st, BREAK_SIGNAL, buf, buflen);
2096 static char saved_jvm_path[MAXPATHLEN] = {0};
2098 // Find the full path to the current module, libjvm.so or libjvm_g.so
2099 void os::jvm_path(char *buf, jint buflen) {
2101 if (buflen < MAXPATHLEN) {
2102 assert(false, "must use a large-enough buffer");
2106 // Lazy resolve the path to current module.
2107 if (saved_jvm_path[0] != 0) {
2108 strcpy(buf, saved_jvm_path);
2112 char dli_fname[MAXPATHLEN];
2113 bool ret = dll_address_to_library_name(
2114 CAST_FROM_FN_PTR(address, os::jvm_path),
2115 dli_fname, sizeof(dli_fname), NULL);
2116 assert(ret != 0, "cannot locate libjvm");
2117 char *rp = realpath(dli_fname, buf);
2121 if (strcmp(Arguments::sun_java_launcher(), "gamma") == 0) {
2122 // Support for the gamma launcher. Typical value for buf is
2123 // "<JAVA_HOME>/jre/lib/<arch>/<vmtype>/libjvm.so". If "/jre/lib/" appears at
2124 // the right place in the string, then assume we are installed in a JDK and
2125 // we're done. Otherwise, check for a JAVA_HOME environment variable and fix
2126 // up the path so it looks like libjvm.so is installed there (append a
2127 // fake suffix hotspot/libjvm.so).
2128 const char *p = buf + strlen(buf) - 1;
2129 for (int count = 0; p > buf && count < 5; ++count) {
2130 for (--p; p > buf && *p != '/'; --p)
2134 if (strncmp(p, "/jre/lib/", 9) != 0) {
2135 // Look for JAVA_HOME in the environment.
2136 char* java_home_var = ::getenv("JAVA_HOME");
2137 if (java_home_var != NULL && java_home_var[0] != 0) {
2141 // Check the current module name "libjvm.so" or "libjvm_g.so".
2142 p = strrchr(buf, '/');
2143 assert(strstr(p, "/libjvm") == p, "invalid library name");
2144 p = strstr(p, "_g") ? "_g" : "";
2146 rp = realpath(java_home_var, buf);
2150 // determine if this is a legacy image or modules image
2151 // modules image doesn't have "jre" subdirectory
2153 jrelib_p = buf + len;
2154 snprintf(jrelib_p, buflen-len, "/jre/lib/%s", cpu_arch);
2155 if (0 != access(buf, F_OK)) {
2156 snprintf(jrelib_p, buflen-len, "/lib/%s", cpu_arch);
2159 if (0 == access(buf, F_OK)) {
2160 // Use current module name "libjvm[_g].so" instead of
2161 // "libjvm"debug_only("_g")".so" since for fastdebug version
2162 // we should have "libjvm.so" but debug_only("_g") adds "_g"!
2163 // It is used when we are choosing the HPI library's name
2164 // "libhpi[_g].so" in hpi::initialize_get_interface().
2166 snprintf(buf + len, buflen-len, "/hotspot/libjvm%s.so", p);
2168 // Go back to path of .so
2169 rp = realpath(dli_fname, buf);
2177 strcpy(saved_jvm_path, buf);
2180 void os::print_jni_name_prefix_on(outputStream* st, int args_size) {
2181 // no prefix required, not even "_"
2184 void os::print_jni_name_suffix_on(outputStream* st, int args_size) {
2185 // no suffix required
2188 ////////////////////////////////////////////////////////////////////////////////
2189 // sun.misc.Signal support
2191 static volatile jint sigint_count = 0;
2194 UserHandler(int sig, void *siginfo, void *context) {
2195 // 4511530 - sem_post is serialized and handled by the manager thread. When
2196 // the program is interrupted by Ctrl-C, SIGINT is sent to every thread. We
2197 // don't want to flood the manager thread with sem_post requests.
2198 if (sig == SIGINT && Atomic::add(1, &sigint_count) > 1)
2201 // Ctrl-C is pressed during error reporting, likely because the error
2202 // handler fails to abort. Let VM die immediately.
2203 if (sig == SIGINT && is_error_reported()) {
2207 os::signal_notify(sig);
2210 void* os::user_handler() {
2211 return CAST_FROM_FN_PTR(void*, UserHandler);
2215 typedef void (*sa_handler_t)(int);
2216 typedef void (*sa_sigaction_t)(int, siginfo_t *, void *);
2219 void* os::signal(int signal_number, void* handler) {
2220 struct sigaction sigAct, oldSigAct;
2222 sigfillset(&(sigAct.sa_mask));
2223 sigAct.sa_flags = SA_RESTART|SA_SIGINFO;
2224 sigAct.sa_handler = CAST_TO_FN_PTR(sa_handler_t, handler);
2226 if (sigaction(signal_number, &sigAct, &oldSigAct)) {
2227 // -1 means registration failed
2231 return CAST_FROM_FN_PTR(void*, oldSigAct.sa_handler);
2234 void os::signal_raise(int signal_number) {
2235 ::raise(signal_number);
2239 * The following code is moved from os.cpp for making this
2240 * code platform specific, which it is by its very nature.
2243 // Will be modified when max signal is changed to be dynamic
2244 int os::sigexitnum_pd() {
2248 // a counter for each possible signal value
2249 static volatile jint pending_signals[NSIG+1] = { 0 };
2251 // Linux(POSIX) specific hand shaking semaphore.
2252 static sem_t sig_sem;
2254 void os::signal_init_pd() {
2255 // Initialize signal structures
2256 ::memset((void*)pending_signals, 0, sizeof(pending_signals));
2258 // Initialize signal semaphore
2259 ::sem_init(&sig_sem, 0, 0);
2262 void os::signal_notify(int sig) {
2263 Atomic::inc(&pending_signals[sig]);
2264 ::sem_post(&sig_sem);
2267 static int check_pending_signals(bool wait) {
2268 Atomic::store(0, &sigint_count);
2270 for (int i = 0; i < NSIG + 1; i++) {
2271 jint n = pending_signals[i];
2272 if (n > 0 && n == Atomic::cmpxchg(n - 1, &pending_signals[i], n)) {
2279 JavaThread *thread = JavaThread::current();
2280 ThreadBlockInVM tbivm(thread);
2282 bool threadIsSuspended;
2284 thread->set_suspend_equivalent();
2285 // cleared by handle_special_suspend_equivalent_condition() or java_suspend_self()
2286 ::sem_wait(&sig_sem);
2288 // were we externally suspended while we were waiting?
2289 threadIsSuspended = thread->handle_special_suspend_equivalent_condition();
2290 if (threadIsSuspended) {
2292 // The semaphore has been incremented, but while we were waiting
2293 // another thread suspended us. We don't want to continue running
2294 // while suspended because that would surprise the thread that
2297 ::sem_post(&sig_sem);
2299 thread->java_suspend_self();
2301 } while (threadIsSuspended);
2305 int os::signal_lookup() {
2306 return check_pending_signals(false);
2309 int os::signal_wait() {
2310 return check_pending_signals(true);
2313 ////////////////////////////////////////////////////////////////////////////////
2316 int os::vm_page_size() {
2317 // Seems redundant as all get out
2318 assert(os::Linux::page_size() != -1, "must call os::init");
2319 return os::Linux::page_size();
2322 // Solaris allocates memory by pages.
2323 int os::vm_allocation_granularity() {
2324 assert(os::Linux::page_size() != -1, "must call os::init");
2325 return os::Linux::page_size();
2328 // Rationale behind this function:
2329 // current (Mon Apr 25 20:12:18 MSD 2005) oprofile drops samples without executable
2330 // mapping for address (see lookup_dcookie() in the kernel module), thus we cannot get
2331 // samples for JITted code. Here we create private executable mapping over the code cache
2332 // and then we can use standard (well, almost, as mapping can change) way to provide
2333 // info for the reporting script by storing timestamp and location of symbol
2334 void linux_wrap_code(char* base, size_t size) {
2335 static volatile jint cnt = 0;
2341 char buf[PATH_MAX+1];
2342 int num = Atomic::add(1, &cnt);
2344 snprintf(buf, sizeof(buf), "%s/hs-vm-%d-%d",
2345 os::get_temp_directory(), os::current_process_id(), num);
2348 int fd = open(buf, O_CREAT | O_RDWR, S_IRWXU);
2351 off_t rv = lseek(fd, size-2, SEEK_SET);
2352 if (rv != (off_t)-1) {
2353 if (write(fd, "", 1) == 1) {
2355 PROT_READ|PROT_WRITE|PROT_EXEC,
2356 MAP_PRIVATE|MAP_FIXED|MAP_NORESERVE, fd, 0);
2364 // NOTE: Linux kernel does not really reserve the pages for us.
2365 // All it does is to check if there are enough free pages
2366 // left at the time of mmap(). This could be a potential
2368 bool os::commit_memory(char* addr, size_t size, bool exec) {
2369 int prot = exec ? PROT_READ|PROT_WRITE|PROT_EXEC : PROT_READ|PROT_WRITE;
2370 uintptr_t res = (uintptr_t) ::mmap(addr, size, prot,
2371 MAP_PRIVATE|MAP_FIXED|MAP_ANONYMOUS, -1, 0);
2372 return res != (uintptr_t) MAP_FAILED;
2375 bool os::commit_memory(char* addr, size_t size, size_t alignment_hint,
2377 return commit_memory(addr, size, exec);
2380 void os::realign_memory(char *addr, size_t bytes, size_t alignment_hint) { }
2382 void os::free_memory(char *addr, size_t bytes) {
2383 ::mmap(addr, bytes, PROT_READ | PROT_WRITE,
2384 MAP_PRIVATE|MAP_FIXED|MAP_ANONYMOUS, -1, 0);
2387 void os::numa_make_global(char *addr, size_t bytes) {
2388 Linux::numa_interleave_memory(addr, bytes);
2391 void os::numa_make_local(char *addr, size_t bytes, int lgrp_hint) {
2392 Linux::numa_tonode_memory(addr, bytes, lgrp_hint);
2395 bool os::numa_topology_changed() { return false; }
2397 size_t os::numa_get_groups_num() {
2398 int max_node = Linux::numa_max_node();
2399 return max_node > 0 ? max_node + 1 : 1;
2402 int os::numa_get_group_id() {
2403 int cpu_id = Linux::sched_getcpu();
2405 int lgrp_id = Linux::get_node_by_cpu(cpu_id);
2406 if (lgrp_id != -1) {
2413 size_t os::numa_get_leaf_groups(int *ids, size_t size) {
2414 for (size_t i = 0; i < size; i++) {
2420 bool os::get_page_info(char *start, page_info* info) {
2424 char *os::scan_pages(char *start, char* end, page_info* page_expected, page_info* page_found) {
2428 extern "C" void numa_warn(int number, char *where, ...) { }
2429 extern "C" void numa_error(char *where) { }
2432 // If we are running with libnuma version > 2, then we should
2433 // be trying to use symbols with versions 1.1
2434 // If we are running with earlier version, which did not have symbol versions,
2435 // we should use the base version.
2436 void* os::Linux::libnuma_dlsym(void* handle, const char *name) {
2437 void *f = dlvsym(handle, name, "libnuma_1.1");
2439 f = dlsym(handle, name);
2444 bool os::Linux::libnuma_init() {
2445 // sched_getcpu() should be in libc.
2446 set_sched_getcpu(CAST_TO_FN_PTR(sched_getcpu_func_t,
2447 dlsym(RTLD_DEFAULT, "sched_getcpu")));
2449 if (sched_getcpu() != -1) { // Does it work?
2450 void *handle = dlopen("libnuma.so.1", RTLD_LAZY);
2451 if (handle != NULL) {
2452 set_numa_node_to_cpus(CAST_TO_FN_PTR(numa_node_to_cpus_func_t,
2453 libnuma_dlsym(handle, "numa_node_to_cpus")));
2454 set_numa_max_node(CAST_TO_FN_PTR(numa_max_node_func_t,
2455 libnuma_dlsym(handle, "numa_max_node")));
2456 set_numa_available(CAST_TO_FN_PTR(numa_available_func_t,
2457 libnuma_dlsym(handle, "numa_available")));
2458 set_numa_tonode_memory(CAST_TO_FN_PTR(numa_tonode_memory_func_t,
2459 libnuma_dlsym(handle, "numa_tonode_memory")));
2460 set_numa_interleave_memory(CAST_TO_FN_PTR(numa_interleave_memory_func_t,
2461 libnuma_dlsym(handle, "numa_interleave_memory")));
2464 if (numa_available() != -1) {
2465 set_numa_all_nodes((unsigned long*)libnuma_dlsym(handle, "numa_all_nodes"));
2466 // Create a cpu -> node mapping
2467 _cpu_to_node = new (ResourceObj::C_HEAP) GrowableArray<int>(0, true);
2468 rebuild_cpu_to_node_map();
2476 // rebuild_cpu_to_node_map() constructs a table mapping cpud id to node id.
2477 // The table is later used in get_node_by_cpu().
2478 void os::Linux::rebuild_cpu_to_node_map() {
2479 const size_t NCPUS = 32768; // Since the buffer size computation is very obscure
2480 // in libnuma (possible values are starting from 16,
2481 // and continuing up with every other power of 2, but less
2482 // than the maximum number of CPUs supported by kernel), and
2483 // is a subject to change (in libnuma version 2 the requirements
2484 // are more reasonable) we'll just hardcode the number they use
2486 const size_t BitsPerCLong = sizeof(long) * CHAR_BIT;
2488 size_t cpu_num = os::active_processor_count();
2489 size_t cpu_map_size = NCPUS / BitsPerCLong;
2490 size_t cpu_map_valid_size =
2491 MIN2((cpu_num + BitsPerCLong - 1) / BitsPerCLong, cpu_map_size);
2493 cpu_to_node()->clear();
2494 cpu_to_node()->at_grow(cpu_num - 1);
2495 size_t node_num = numa_get_groups_num();
2497 unsigned long *cpu_map = NEW_C_HEAP_ARRAY(unsigned long, cpu_map_size);
2498 for (size_t i = 0; i < node_num; i++) {
2499 if (numa_node_to_cpus(i, cpu_map, cpu_map_size * sizeof(unsigned long)) != -1) {
2500 for (size_t j = 0; j < cpu_map_valid_size; j++) {
2501 if (cpu_map[j] != 0) {
2502 for (size_t k = 0; k < BitsPerCLong; k++) {
2503 if (cpu_map[j] & (1UL << k)) {
2504 cpu_to_node()->at_put(j * BitsPerCLong + k, i);
2511 FREE_C_HEAP_ARRAY(unsigned long, cpu_map);
2514 int os::Linux::get_node_by_cpu(int cpu_id) {
2515 if (cpu_to_node() != NULL && cpu_id >= 0 && cpu_id < cpu_to_node()->length()) {
2516 return cpu_to_node()->at(cpu_id);
2521 GrowableArray<int>* os::Linux::_cpu_to_node;
2522 os::Linux::sched_getcpu_func_t os::Linux::_sched_getcpu;
2523 os::Linux::numa_node_to_cpus_func_t os::Linux::_numa_node_to_cpus;
2524 os::Linux::numa_max_node_func_t os::Linux::_numa_max_node;
2525 os::Linux::numa_available_func_t os::Linux::_numa_available;
2526 os::Linux::numa_tonode_memory_func_t os::Linux::_numa_tonode_memory;
2527 os::Linux::numa_interleave_memory_func_t os::Linux::_numa_interleave_memory;
2528 unsigned long* os::Linux::_numa_all_nodes;
2530 bool os::uncommit_memory(char* addr, size_t size) {
2531 uintptr_t res = (uintptr_t) ::mmap(addr, size, PROT_NONE,
2532 MAP_PRIVATE|MAP_FIXED|MAP_NORESERVE|MAP_ANONYMOUS, -1, 0);
2533 return res != (uintptr_t) MAP_FAILED;
2536 // Linux uses a growable mapping for the stack, and if the mapping for
2537 // the stack guard pages is not removed when we detach a thread the
2538 // stack cannot grow beyond the pages where the stack guard was
2539 // mapped. If at some point later in the process the stack expands to
2540 // that point, the Linux kernel cannot expand the stack any further
2541 // because the guard pages are in the way, and a segfault occurs.
2543 // However, it's essential not to split the stack region by unmapping
2544 // a region (leaving a hole) that's already part of the stack mapping,
2545 // so if the stack mapping has already grown beyond the guard pages at
2546 // the time we create them, we have to truncate the stack mapping.
2547 // So, we need to know the extent of the stack mapping when
2548 // create_stack_guard_pages() is called.
2550 // Find the bounds of the stack mapping. Return true for success.
2552 // We only need this for stacks that are growable: at the time of
2553 // writing thread stacks don't use growable mappings (i.e. those
2554 // creeated with MAP_GROWSDOWN), and aren't marked "[stack]", so this
2555 // only applies to the main thread.
2557 get_stack_bounds(uintptr_t *bottom, uintptr_t *top)
2559 FILE *f = fopen("/proc/self/maps", "r");
2566 ssize_t len = getline(&str, &dummy, f);
2572 if (len > 0 && str[len-1] == '\n') {
2577 static const char *stack_str = "[stack]";
2578 if (len > (ssize_t)strlen(stack_str)
2579 && (strcmp(str + len - strlen(stack_str), stack_str) == 0)) {
2580 if (sscanf(str, "%" SCNxPTR "-%" SCNxPTR, bottom, top) == 2) {
2581 uintptr_t sp = (uintptr_t)__builtin_frame_address(0);
2582 if (sp >= *bottom && sp <= *top) {
2595 // If the (growable) stack mapping already extends beyond the point
2596 // where we're going to put our guard pages, truncate the mapping at
2597 // that point by munmap()ping it. This ensures that when we later
2598 // munmap() the guard pages we don't leave a hole in the stack
2599 // mapping. This only affects the main/initial thread, but guard
2600 // against future OS changes
2601 bool os::create_stack_guard_pages(char* addr, size_t size) {
2602 uintptr_t stack_extent, stack_base;
2603 bool chk_bounds = NOT_DEBUG(os::Linux::is_initial_thread()) DEBUG_ONLY(true);
2604 if (chk_bounds && get_stack_bounds(&stack_extent, &stack_base)) {
2605 assert(os::Linux::is_initial_thread(),
2606 "growable stack in non-initial thread");
2607 if (stack_extent < (uintptr_t)addr)
2608 ::munmap((void*)stack_extent, (uintptr_t)addr - stack_extent);
2611 return os::commit_memory(addr, size);
2614 // If this is a growable mapping, remove the guard pages entirely by
2615 // munmap()ping them. If not, just call uncommit_memory(). This only
2616 // affects the main/initial thread, but guard against future OS changes
2617 bool os::remove_stack_guard_pages(char* addr, size_t size) {
2618 uintptr_t stack_extent, stack_base;
2619 bool chk_bounds = NOT_DEBUG(os::Linux::is_initial_thread()) DEBUG_ONLY(true);
2620 if (chk_bounds && get_stack_bounds(&stack_extent, &stack_base)) {
2621 assert(os::Linux::is_initial_thread(),
2622 "growable stack in non-initial thread");
2624 return ::munmap(addr, size) == 0;
2627 return os::uncommit_memory(addr, size);
2630 static address _highest_vm_reserved_address = NULL;
2632 // If 'fixed' is true, anon_mmap() will attempt to reserve anonymous memory
2633 // at 'requested_addr'. If there are existing memory mappings at the same
2634 // location, however, they will be overwritten. If 'fixed' is false,
2635 // 'requested_addr' is only treated as a hint, the return value may or
2636 // may not start from the requested address. Unlike Linux mmap(), this
2637 // function returns NULL to indicate failure.
2638 static char* anon_mmap(char* requested_addr, size_t bytes, bool fixed) {
2642 flags = MAP_PRIVATE | MAP_NORESERVE | MAP_ANONYMOUS;
2644 assert((uintptr_t)requested_addr % os::Linux::page_size() == 0, "unaligned address");
2648 // Map uncommitted pages PROT_READ and PROT_WRITE, change access
2649 // to PROT_EXEC if executable when we commit the page.
2650 addr = (char*)::mmap(requested_addr, bytes, PROT_READ|PROT_WRITE,
2653 if (addr != MAP_FAILED) {
2654 // anon_mmap() should only get called during VM initialization,
2655 // don't need lock (actually we can skip locking even it can be called
2656 // from multiple threads, because _highest_vm_reserved_address is just a
2657 // hint about the upper limit of non-stack memory regions.)
2658 if ((address)addr + bytes > _highest_vm_reserved_address) {
2659 _highest_vm_reserved_address = (address)addr + bytes;
2663 return addr == MAP_FAILED ? NULL : addr;
2666 // Don't update _highest_vm_reserved_address, because there might be memory
2667 // regions above addr + size. If so, releasing a memory region only creates
2668 // a hole in the address space, it doesn't help prevent heap-stack collision.
2670 static int anon_munmap(char * addr, size_t size) {
2671 return ::munmap(addr, size) == 0;
2674 char* os::reserve_memory(size_t bytes, char* requested_addr,
2675 size_t alignment_hint) {
2676 return anon_mmap(requested_addr, bytes, (requested_addr != NULL));
2679 bool os::release_memory(char* addr, size_t size) {
2680 return anon_munmap(addr, size);
2683 static address highest_vm_reserved_address() {
2684 return _highest_vm_reserved_address;
2687 static bool linux_mprotect(char* addr, size_t size, int prot) {
2688 // Linux wants the mprotect address argument to be page aligned.
2689 char* bottom = (char*)align_size_down((intptr_t)addr, os::Linux::page_size());
2691 // According to SUSv3, mprotect() should only be used with mappings
2692 // established by mmap(), and mmap() always maps whole pages. Unaligned
2693 // 'addr' likely indicates problem in the VM (e.g. trying to change
2694 // protection of malloc'ed or statically allocated memory). Check the
2695 // caller if you hit this assert.
2696 assert(addr == bottom, "sanity check");
2698 size = align_size_up(pointer_delta(addr, bottom, 1) + size, os::Linux::page_size());
2699 return ::mprotect(bottom, size, prot) == 0;
2702 // Set protections specified
2703 bool os::protect_memory(char* addr, size_t bytes, ProtType prot,
2704 bool is_committed) {
2707 case MEM_PROT_NONE: p = PROT_NONE; break;
2708 case MEM_PROT_READ: p = PROT_READ; break;
2709 case MEM_PROT_RW: p = PROT_READ|PROT_WRITE; break;
2710 case MEM_PROT_RWX: p = PROT_READ|PROT_WRITE|PROT_EXEC; break;
2712 ShouldNotReachHere();
2714 // is_committed is unused.
2715 return linux_mprotect(addr, bytes, p);
2718 bool os::guard_memory(char* addr, size_t size) {
2719 return linux_mprotect(addr, size, PROT_NONE);
2722 bool os::unguard_memory(char* addr, size_t size) {
2723 return linux_mprotect(addr, size, PROT_READ|PROT_WRITE);
2726 // Large page support
2728 static size_t _large_page_size = 0;
2730 bool os::large_page_init() {
2731 if (!UseLargePages) return false;
2733 if (LargePageSizeInBytes) {
2734 _large_page_size = LargePageSizeInBytes;
2736 // large_page_size on Linux is used to round up heap size. x86 uses either
2737 // 2M or 4M page, depending on whether PAE (Physical Address Extensions)
2738 // mode is enabled. AMD64/EM64T uses 2M page in 64bit mode. IA64 can use
2739 // page as large as 256M.
2741 // Here we try to figure out page size by parsing /proc/meminfo and looking
2742 // for a line with the following format:
2743 // Hugepagesize: 2048 kB
2745 // If we can't determine the value (e.g. /proc is not mounted, or the text
2746 // format has been changed), we'll use the largest page size supported by
2750 _large_page_size = IA32_ONLY(4 * M) AMD64_ONLY(2 * M) IA64_ONLY(256 * M) SPARC_ONLY(4 * M)
2751 ARM_ONLY(2 * M) PPC_ONLY(4 * M);
2754 FILE *fp = fopen("/proc/meminfo", "r");
2759 if (fscanf(fp, "Hugepagesize: %d", &x) == 1) {
2760 if (x && fgets(buf, sizeof(buf), fp) && strcmp(buf, " kB\n") == 0) {
2761 _large_page_size = x * K;
2765 // skip to next line
2768 if (ch == EOF || ch == (int)'\n') break;
2776 const size_t default_page_size = (size_t)Linux::page_size();
2777 if (_large_page_size > default_page_size) {
2778 _page_sizes[0] = _large_page_size;
2779 _page_sizes[1] = default_page_size;
2783 // Large page support is available on 2.6 or newer kernel, some vendors
2784 // (e.g. Redhat) have backported it to their 2.4 based distributions.
2785 // We optimistically assume the support is available. If later it turns out
2786 // not true, VM will automatically switch to use regular page size.
2791 #define SHM_HUGETLB 04000
2794 char* os::reserve_memory_special(size_t bytes, char* req_addr, bool exec) {
2795 // "exec" is passed in but not used. Creating the shared image for
2796 // the code cache doesn't have an SHM_X executable permission to check.
2797 assert(UseLargePages, "only for large pages");
2799 key_t key = IPC_PRIVATE;
2802 bool warn_on_failure = UseLargePages &&
2803 (!FLAG_IS_DEFAULT(UseLargePages) ||
2804 !FLAG_IS_DEFAULT(LargePageSizeInBytes)
2808 // Create a large shared memory region to attach to based on size.
2809 // Currently, size is the total size of the heap
2810 int shmid = shmget(key, bytes, SHM_HUGETLB|IPC_CREAT|SHM_R|SHM_W);
2812 // Possible reasons for shmget failure:
2813 // 1. shmmax is too small for Java heap.
2814 // > check shmmax value: cat /proc/sys/kernel/shmmax
2815 // > increase shmmax value: echo "0xffffffff" > /proc/sys/kernel/shmmax
2816 // 2. not enough large page memory.
2817 // > check available large pages: cat /proc/meminfo
2818 // > increase amount of large pages:
2819 // echo new_value > /proc/sys/vm/nr_hugepages
2820 // Note 1: different Linux may use different name for this property,
2821 // e.g. on Redhat AS-3 it is "hugetlb_pool".
2822 // Note 2: it's possible there's enough physical memory available but
2823 // they are so fragmented after a long run that they can't
2824 // coalesce into large pages. Try to reserve large pages when
2825 // the system is still "fresh".
2826 if (warn_on_failure) {
2827 jio_snprintf(msg, sizeof(msg), "Failed to reserve shared memory (errno = %d).", errno);
2833 // attach to the region
2834 addr = (char*)shmat(shmid, req_addr, 0);
2837 // Remove shmid. If shmat() is successful, the actual shared memory segment
2838 // will be deleted when it's detached by shmdt() or when the process
2839 // terminates. If shmat() is not successful this will remove the shared
2840 // segment immediately.
2841 shmctl(shmid, IPC_RMID, NULL);
2843 if ((intptr_t)addr == -1) {
2844 if (warn_on_failure) {
2845 jio_snprintf(msg, sizeof(msg), "Failed to attach shared memory (errno = %d).", err);
2854 bool os::release_memory_special(char* base, size_t bytes) {
2855 // detaching the SHM segment will also delete it, see reserve_memory_special()
2856 int rslt = shmdt(base);
2860 size_t os::large_page_size() {
2861 return _large_page_size;
2864 // Linux does not support anonymous mmap with large page memory. The only way
2865 // to reserve large page memory without file backing is through SysV shared
2866 // memory API. The entire memory region is committed and pinned upfront.
2867 // Hopefully this will change in the future...
2868 bool os::can_commit_large_page_memory() {
2872 bool os::can_execute_large_page_memory() {
2876 // Reserve memory at an arbitrary address, only if that area is
2877 // available (and not reserved for something else).
2879 char* os::attempt_reserve_memory_at(size_t bytes, char* requested_addr) {
2880 const int max_tries = 10;
2881 char* base[max_tries];
2882 size_t size[max_tries];
2883 const size_t gap = 0x000000;
2885 // Assert only that the size is a multiple of the page size, since
2886 // that's all that mmap requires, and since that's all we really know
2887 // about at this low abstraction level. If we need higher alignment,
2888 // we can either pass an alignment to this method or verify alignment
2889 // in one of the methods further up the call chain. See bug 5044738.
2890 assert(bytes % os::vm_page_size() == 0, "reserving unexpected size block");
2892 // Repeatedly allocate blocks until the block is allocated at the
2893 // right spot. Give up after max_tries. Note that reserve_memory() will
2894 // automatically update _highest_vm_reserved_address if the call is
2895 // successful. The variable tracks the highest memory address every reserved
2896 // by JVM. It is used to detect heap-stack collision if running with
2897 // fixed-stack LinuxThreads. Because here we may attempt to reserve more
2898 // space than needed, it could confuse the collision detecting code. To
2899 // solve the problem, save current _highest_vm_reserved_address and
2900 // calculate the correct value before return.
2901 address old_highest = _highest_vm_reserved_address;
2903 // Linux mmap allows caller to pass an address as hint; give it a try first,
2904 // if kernel honors the hint then we can return immediately.
2905 char * addr = anon_mmap(requested_addr, bytes, false);
2906 if (addr == requested_addr) {
2907 return requested_addr;
2911 // mmap() is successful but it fails to reserve at the requested address
2912 anon_munmap(addr, bytes);
2916 for (i = 0; i < max_tries; ++i) {
2917 base[i] = reserve_memory(bytes);
2919 if (base[i] != NULL) {
2920 // Is this the block we wanted?
2921 if (base[i] == requested_addr) {
2926 // Does this overlap the block we wanted? Give back the overlapped
2927 // parts and try again.
2929 size_t top_overlap = requested_addr + (bytes + gap) - base[i];
2930 if (top_overlap >= 0 && top_overlap < bytes) {
2931 unmap_memory(base[i], top_overlap);
2932 base[i] += top_overlap;
2933 size[i] = bytes - top_overlap;
2935 size_t bottom_overlap = base[i] + bytes - requested_addr;
2936 if (bottom_overlap >= 0 && bottom_overlap < bytes) {
2937 unmap_memory(requested_addr, bottom_overlap);
2938 size[i] = bytes - bottom_overlap;
2946 // Give back the unused reserved pieces.
2948 for (int j = 0; j < i; ++j) {
2949 if (base[j] != NULL) {
2950 unmap_memory(base[j], size[j]);
2954 if (i < max_tries) {
2955 _highest_vm_reserved_address = MAX2(old_highest, (address)requested_addr + bytes);
2956 return requested_addr;
2958 _highest_vm_reserved_address = old_highest;
2963 size_t os::read(int fd, void *buf, unsigned int nBytes) {
2964 return ::read(fd, buf, nBytes);
2967 // TODO-FIXME: reconcile Solaris' os::sleep with the linux variation.
2968 // Solaris uses poll(), linux uses park().
2969 // Poll() is likely a better choice, assuming that Thread.interrupt()
2970 // generates a SIGUSRx signal. Note that SIGUSR1 can interfere with
2971 // SIGSEGV, see 4355769.
2973 const int NANOSECS_PER_MILLISECS = 1000000;
2975 int os::sleep(Thread* thread, jlong millis, bool interruptible) {
2976 assert(thread == Thread::current(), "thread consistency check");
2978 ParkEvent * const slp = thread->_SleepEvent ;
2980 OrderAccess::fence() ;
2982 if (interruptible) {
2983 jlong prevtime = javaTimeNanos();
2986 if (os::is_interrupted(thread, true)) {
2990 jlong newtime = javaTimeNanos();
2992 if (newtime - prevtime < 0) {
2993 // time moving backwards, should only happen if no monotonic clock
2994 // not a guarantee() because JVM should not abort on kernel/glibc bugs
2995 assert(!Linux::supports_monotonic_clock(), "time moving backwards");
2997 millis -= (newtime - prevtime) / NANOSECS_PER_MILLISECS;
3007 assert(thread->is_Java_thread(), "sanity check");
3008 JavaThread *jt = (JavaThread *) thread;
3009 ThreadBlockInVM tbivm(jt);
3010 OSThreadWaitState osts(jt->osthread(), false /* not Object.wait() */);
3012 jt->set_suspend_equivalent();
3013 // cleared by handle_special_suspend_equivalent_condition() or
3014 // java_suspend_self() via check_and_wait_while_suspended()
3018 // were we externally suspended while we were waiting?
3019 jt->check_and_wait_while_suspended();
3023 OSThreadWaitState osts(thread->osthread(), false /* not Object.wait() */);
3024 jlong prevtime = javaTimeNanos();
3027 // It'd be nice to avoid the back-to-back javaTimeNanos() calls on
3028 // the 1st iteration ...
3029 jlong newtime = javaTimeNanos();
3031 if (newtime - prevtime < 0) {
3032 // time moving backwards, should only happen if no monotonic clock
3033 // not a guarantee() because JVM should not abort on kernel/glibc bugs
3034 assert(!Linux::supports_monotonic_clock(), "time moving backwards");
3036 millis -= (newtime - prevtime) / NANOSECS_PER_MILLISECS;
3039 if(millis <= 0) break ;
3048 int os::naked_sleep() {
3049 // %% make the sleep time an integer flag. for now use 1 millisec.
3050 return os::sleep(Thread::current(), 1, false);
3053 // Sleep forever; naked call to OS-specific sleep; use with CAUTION
3054 void os::infinite_sleep() {
3055 while (true) { // sleep forever ...
3056 ::sleep(100); // ... 100 seconds at a time
3060 // Used to convert frequent JVM_Yield() to nops
3061 bool os::dont_yield() {
3062 return DontYieldALot;
3069 os::YieldResult os::NakedYield() { sched_yield(); return os::YIELD_UNKNOWN ;}
3071 void os::yield_all(int attempts) {
3072 // Yields to all threads, including threads with lower priorities
3073 // Threads on Linux are all with same priority. The Solaris style
3074 // os::yield_all() with nanosleep(1ms) is not necessary.
3078 // Called from the tight loops to possibly influence time-sharing heuristics
3079 void os::loop_breaker(int attempts) {
3080 os::yield_all(attempts);
3083 ////////////////////////////////////////////////////////////////////////////////
3084 // thread priority support
3086 // Note: Normal Linux applications are run with SCHED_OTHER policy. SCHED_OTHER
3087 // only supports dynamic priority, static priority must be zero. For real-time
3088 // applications, Linux supports SCHED_RR which allows static priority (1-99).
3089 // However, for large multi-threaded applications, SCHED_RR is not only slower
3090 // than SCHED_OTHER, but also very unstable (my volano tests hang hard 4 out
3091 // of 5 runs - Sep 2005).
3093 // The following code actually changes the niceness of kernel-thread/LWP. It
3094 // has an assumption that setpriority() only modifies one kernel-thread/LWP,
3095 // not the entire user process, and user level threads are 1:1 mapped to kernel
3096 // threads. It has always been the case, but could change in the future. For
3097 // this reason, the code should not be used as default (ThreadPriorityPolicy=0).
3098 // It is only used when ThreadPriorityPolicy=1 and requires root privilege.
3100 int os::java_to_os_priority[MaxPriority + 1] = {
3101 19, // 0 Entry should never be used
3108 0, // 5 NormPriority
3113 -4, // 9 NearMaxPriority
3115 -5 // 10 MaxPriority
3118 static int prio_init() {
3119 if (ThreadPriorityPolicy == 1) {
3120 // Only root can raise thread priority. Don't allow ThreadPriorityPolicy=1
3121 // if effective uid is not root. Perhaps, a more elegant way of doing
3122 // this is to test CAP_SYS_NICE capability, but that will require libcap.so
3123 if (geteuid() != 0) {
3124 if (!FLAG_IS_DEFAULT(ThreadPriorityPolicy)) {
3125 warning("-XX:ThreadPriorityPolicy requires root privilege on Linux");
3127 ThreadPriorityPolicy = 0;
3133 OSReturn os::set_native_priority(Thread* thread, int newpri) {
3134 if ( !UseThreadPriorities || ThreadPriorityPolicy == 0 ) return OS_OK;
3136 int ret = setpriority(PRIO_PROCESS, thread->osthread()->thread_id(), newpri);
3137 return (ret == 0) ? OS_OK : OS_ERR;
3140 OSReturn os::get_native_priority(const Thread* const thread, int *priority_ptr) {
3141 if ( !UseThreadPriorities || ThreadPriorityPolicy == 0 ) {
3142 *priority_ptr = java_to_os_priority[NormPriority];
3147 *priority_ptr = getpriority(PRIO_PROCESS, thread->osthread()->thread_id());
3148 return (*priority_ptr != -1 || errno == 0 ? OS_OK : OS_ERR);
3151 // Hint to the underlying OS that a task switch would not be good.
3152 // Void return because it's a hint and can fail.
3153 void os::hint_no_preempt() {}
3155 ////////////////////////////////////////////////////////////////////////////////
3156 // suspend/resume support
3158 // the low-level signal-based suspend/resume support is a remnant from the
3159 // old VM-suspension that used to be for java-suspension, safepoints etc,
3160 // within hotspot. Now there is a single use-case for this:
3161 // - calling get_thread_pc() on the VMThread by the flat-profiler task
3162 // that runs in the watcher thread.
3163 // The remaining code is greatly simplified from the more general suspension
3164 // code that used to be used.
3166 // The protocol is quite simple:
3168 // - sends a signal to the target thread
3169 // - polls the suspend state of the osthread using a yield loop
3170 // - target thread signal handler (SR_handler) sets suspend state
3171 // and blocks in sigsuspend until continued
3173 // - sets target osthread state to continue
3174 // - sends signal to end the sigsuspend loop in the SR_handler
3176 // Note that the SR_lock plays no role in this suspend/resume protocol.
3179 static void resume_clear_context(OSThread *osthread) {
3180 osthread->set_ucontext(NULL);
3181 osthread->set_siginfo(NULL);
3183 // notify the suspend action is completed, we have now resumed
3184 osthread->sr.clear_suspended();
3187 static void suspend_save_context(OSThread *osthread, siginfo_t* siginfo, ucontext_t* context) {
3188 osthread->set_ucontext(context);
3189 osthread->set_siginfo(siginfo);
3193 // Handler function invoked when a thread's execution is suspended or
3194 // resumed. We have to be careful that only async-safe functions are
3195 // called here (Note: most pthread functions are not async safe and
3196 // should be avoided.)
3198 // Note: sigwait() is a more natural fit than sigsuspend() from an
3199 // interface point of view, but sigwait() prevents the signal hander
3200 // from being run. libpthread would get very confused by not having
3201 // its signal handlers run and prevents sigwait()'s use with the
3202 // mutex granting granting signal.
3204 // Currently only ever called on the VMThread
3206 static void SR_handler(int sig, siginfo_t* siginfo, ucontext_t* context) {
3207 // Save and restore errno to avoid confusing native code with EINTR
3208 // after sigsuspend.
3209 int old_errno = errno;
3211 Thread* thread = Thread::current();
3212 OSThread* osthread = thread->osthread();
3213 assert(thread->is_VM_thread(), "Must be VMThread");
3214 // read current suspend action
3215 int action = osthread->sr.suspend_action();
3216 if (action == SR_SUSPEND) {
3217 suspend_save_context(osthread, siginfo, context);
3219 // Notify the suspend action is about to be completed. do_suspend()
3220 // waits until SR_SUSPENDED is set and then returns. We will wait
3221 // here for a resume signal and that completes the suspend-other
3222 // action. do_suspend/do_resume is always called as a pair from
3223 // the same thread - so there are no races
3225 // notify the caller
3226 osthread->sr.set_suspended();
3228 sigset_t suspend_set; // signals for sigsuspend()
3230 // get current set of blocked signals and unblock resume signal
3231 pthread_sigmask(SIG_BLOCK, NULL, &suspend_set);
3232 sigdelset(&suspend_set, SR_signum);
3234 // wait here until we are resumed
3236 sigsuspend(&suspend_set);
3237 // ignore all returns until we get a resume signal
3238 } while (osthread->sr.suspend_action() != SR_CONTINUE);
3240 resume_clear_context(osthread);
3243 assert(action == SR_CONTINUE, "unexpected sr action");
3244 // nothing special to do - just leave the handler
3251 static int SR_initialize() {
3252 struct sigaction act;
3254 /* Get signal number to use for suspend/resume */
3255 if ((s = ::getenv("_JAVA_SR_SIGNUM")) != 0) {
3256 int sig = ::strtol(s, 0, 10);
3257 if (sig > 0 || sig < _NSIG) {
3262 assert(SR_signum > SIGSEGV && SR_signum > SIGBUS,
3263 "SR_signum must be greater than max(SIGSEGV, SIGBUS), see 4355769");
3265 sigemptyset(&SR_sigset);
3266 sigaddset(&SR_sigset, SR_signum);
3268 /* Set up signal handler for suspend/resume */
3269 act.sa_flags = SA_RESTART|SA_SIGINFO;
3270 act.sa_handler = (void (*)(int)) SR_handler;
3272 // SR_signum is blocked by default.
3273 // 4528190 - We also need to block pthread restart signal (32 on all
3274 // supported Linux platforms). Note that LinuxThreads need to block
3275 // this signal for all threads to work properly. So we don't have
3276 // to use hard-coded signal number when setting up the mask.
3277 pthread_sigmask(SIG_BLOCK, NULL, &act.sa_mask);
3279 if (sigaction(SR_signum, &act, 0) == -1) {
3284 os::Linux::set_our_sigflags(SR_signum, act.sa_flags);
3288 static int SR_finalize() {
3293 // returns true on success and false on error - really an error is fatal
3294 // but this seems the normal response to library errors
3295 static bool do_suspend(OSThread* osthread) {
3296 // mark as suspended and send signal
3297 osthread->sr.set_suspend_action(SR_SUSPEND);
3298 int status = pthread_kill(osthread->pthread_id(), SR_signum);
3299 assert_status(status == 0, status, "pthread_kill");
3301 // check status and wait until notified of suspension
3303 for (int i = 0; !osthread->sr.is_suspended(); i++) {
3306 osthread->sr.set_suspend_action(SR_NONE);
3310 osthread->sr.set_suspend_action(SR_NONE);
3315 static void do_resume(OSThread* osthread) {
3316 assert(osthread->sr.is_suspended(), "thread should be suspended");
3317 osthread->sr.set_suspend_action(SR_CONTINUE);
3319 int status = pthread_kill(osthread->pthread_id(), SR_signum);
3320 assert_status(status == 0, status, "pthread_kill");
3321 // check status and wait unit notified of resumption
3323 for (int i = 0; osthread->sr.is_suspended(); i++) {
3327 osthread->sr.set_suspend_action(SR_NONE);
3330 ////////////////////////////////////////////////////////////////////////////////
3331 // interrupt support
3333 void os::interrupt(Thread* thread) {
3334 assert(Thread::current() == thread || Threads_lock->owned_by_self(),
3335 "possibility of dangling Thread pointer");
3337 OSThread* osthread = thread->osthread();
3339 if (!osthread->interrupted()) {
3340 osthread->set_interrupted(true);
3341 // More than one thread can get here with the same value of osthread,
3342 // resulting in multiple notifications. We do, however, want the store
3343 // to interrupted() to be visible to other threads before we execute unpark().
3344 OrderAccess::fence();
3345 ParkEvent * const slp = thread->_SleepEvent ;
3346 if (slp != NULL) slp->unpark() ;
3349 // For JSR166. Unpark even if interrupt status already was set
3350 if (thread->is_Java_thread())
3351 ((JavaThread*)thread)->parker()->unpark();
3353 ParkEvent * ev = thread->_ParkEvent ;
3354 if (ev != NULL) ev->unpark() ;
3358 bool os::is_interrupted(Thread* thread, bool clear_interrupted) {
3359 assert(Thread::current() == thread || Threads_lock->owned_by_self(),
3360 "possibility of dangling Thread pointer");
3362 OSThread* osthread = thread->osthread();
3364 bool interrupted = osthread->interrupted();
3366 if (interrupted && clear_interrupted) {
3367 osthread->set_interrupted(false);
3368 // consider thread->_SleepEvent->reset() ... optional optimization
3374 ///////////////////////////////////////////////////////////////////////////////////
3375 // signal handling (except suspend/resume)
3377 // This routine may be used by user applications as a "hook" to catch signals.
3378 // The user-defined signal handler must pass unrecognized signals to this
3379 // routine, and if it returns true (non-zero), then the signal handler must
3380 // return immediately. If the flag "abort_if_unrecognized" is true, then this
3381 // routine will never retun false (zero), but instead will execute a VM panic
3382 // routine kill the process.
3384 // If this routine returns false, it is OK to call it again. This allows
3385 // the user-defined signal handler to perform checks either before or after
3386 // the VM performs its own checks. Naturally, the user code would be making
3387 // a serious error if it tried to handle an exception (such as a null check
3388 // or breakpoint) that the VM was generating for its own correct operation.
3390 // This routine may recognize any of the following kinds of signals:
3391 // SIGBUS, SIGSEGV, SIGILL, SIGFPE, SIGQUIT, SIGPIPE, SIGXFSZ, SIGUSR1.
3392 // It should be consulted by handlers for any of those signals.
3394 // The caller of this routine must pass in the three arguments supplied
3395 // to the function referred to in the "sa_sigaction" (not the "sa_handler")
3396 // field of the structure passed to sigaction(). This routine assumes that
3397 // the sa_flags field passed to sigaction() includes SA_SIGINFO and SA_RESTART.
3399 // Note that the VM will print warnings if it detects conflicting signal
3400 // handlers, unless invoked with the option "-XX:+AllowUserSignalHandlers".
3403 JVM_handle_linux_signal(int signo, siginfo_t* siginfo,
3404 void* ucontext, int abort_if_unrecognized);
3406 void signalHandler(int sig, siginfo_t* info, void* uc) {
3407 assert(info != NULL && uc != NULL, "it must be old kernel");
3408 JVM_handle_linux_signal(sig, info, uc, true);
3412 // This boolean allows users to forward their own non-matching signals
3413 // to JVM_handle_linux_signal, harmlessly.
3414 bool os::Linux::signal_handlers_are_installed = false;
3416 // For signal-chaining
3417 struct sigaction os::Linux::sigact[MAXSIGNUM];
3418 unsigned int os::Linux::sigs = 0;
3419 bool os::Linux::libjsig_is_loaded = false;
3420 typedef struct sigaction *(*get_signal_t)(int);
3421 get_signal_t os::Linux::get_signal_action = NULL;
3423 struct sigaction* os::Linux::get_chained_signal_action(int sig) {
3424 struct sigaction *actp = NULL;
3426 if (libjsig_is_loaded) {
3427 // Retrieve the old signal handler from libjsig
3428 actp = (*get_signal_action)(sig);
3431 // Retrieve the preinstalled signal handler from jvm
3432 actp = get_preinstalled_handler(sig);
3438 static bool call_chained_handler(struct sigaction *actp, int sig,
3439 siginfo_t *siginfo, void *context) {
3440 // Call the old signal handler
3441 if (actp->sa_handler == SIG_DFL) {
3442 // It's more reasonable to let jvm treat it as an unexpected exception
3443 // instead of taking the default action.
3445 } else if (actp->sa_handler != SIG_IGN) {
3446 if ((actp->sa_flags & SA_NODEFER) == 0) {
3447 // automaticlly block the signal
3448 sigaddset(&(actp->sa_mask), sig);
3453 bool siginfo_flag_set = (actp->sa_flags & SA_SIGINFO) != 0;
3454 // retrieve the chained handler
3455 if (siginfo_flag_set) {
3456 sa = actp->sa_sigaction;
3458 hand = actp->sa_handler;
3461 if ((actp->sa_flags & SA_RESETHAND) != 0) {
3462 actp->sa_handler = SIG_DFL;
3465 // try to honor the signal mask
3467 pthread_sigmask(SIG_SETMASK, &(actp->sa_mask), &oset);
3469 // call into the chained handler
3470 if (siginfo_flag_set) {
3471 (*sa)(sig, siginfo, context);
3476 // restore the signal mask
3477 pthread_sigmask(SIG_SETMASK, &oset, 0);
3479 // Tell jvm's signal handler the signal is taken care of.
3483 bool os::Linux::chained_handler(int sig, siginfo_t* siginfo, void* context) {
3484 bool chained = false;
3486 if (UseSignalChaining) {
3487 struct sigaction *actp = get_chained_signal_action(sig);
3489 chained = call_chained_handler(actp, sig, siginfo, context);
3495 struct sigaction* os::Linux::get_preinstalled_handler(int sig) {
3496 if ((( (unsigned int)1 << sig ) & sigs) != 0) {
3497 return &sigact[sig];
3502 void os::Linux::save_preinstalled_handler(int sig, struct sigaction& oldAct) {
3503 assert(sig > 0 && sig < MAXSIGNUM, "vm signal out of expected range");
3504 sigact[sig] = oldAct;
3505 sigs |= (unsigned int)1 << sig;
3509 int os::Linux::sigflags[MAXSIGNUM];
3511 int os::Linux::get_our_sigflags(int sig) {
3512 assert(sig > 0 && sig < MAXSIGNUM, "vm signal out of expected range");
3513 return sigflags[sig];
3516 void os::Linux::set_our_sigflags(int sig, int flags) {
3517 assert(sig > 0 && sig < MAXSIGNUM, "vm signal out of expected range");
3518 sigflags[sig] = flags;
3521 void os::Linux::set_signal_handler(int sig, bool set_installed) {
3522 // Check for overwrite.
3523 struct sigaction oldAct;
3524 sigaction(sig, (struct sigaction*)NULL, &oldAct);
3526 void* oldhand = oldAct.sa_sigaction
3527 ? CAST_FROM_FN_PTR(void*, oldAct.sa_sigaction)
3528 : CAST_FROM_FN_PTR(void*, oldAct.sa_handler);
3529 if (oldhand != CAST_FROM_FN_PTR(void*, SIG_DFL) &&
3530 oldhand != CAST_FROM_FN_PTR(void*, SIG_IGN) &&
3531 oldhand != CAST_FROM_FN_PTR(void*, (sa_sigaction_t)signalHandler)) {
3532 if (AllowUserSignalHandlers || !set_installed) {
3533 // Do not overwrite; user takes responsibility to forward to us.
3535 } else if (UseSignalChaining) {
3536 // save the old handler in jvm
3537 save_preinstalled_handler(sig, oldAct);
3538 // libjsig also interposes the sigaction() call below and saves the
3539 // old sigaction on it own.
3541 fatal(err_msg("Encountered unexpected pre-existing sigaction handler "
3542 "%#lx for signal %d.", (long)oldhand, sig));
3546 struct sigaction sigAct;
3547 sigfillset(&(sigAct.sa_mask));
3548 sigAct.sa_handler = SIG_DFL;
3549 if (!set_installed) {
3550 sigAct.sa_flags = SA_SIGINFO|SA_RESTART;
3552 sigAct.sa_sigaction = signalHandler;
3553 sigAct.sa_flags = SA_SIGINFO|SA_RESTART;
3555 // Save flags, which are set by ours
3556 assert(sig > 0 && sig < MAXSIGNUM, "vm signal out of expected range");
3557 sigflags[sig] = sigAct.sa_flags;
3559 int ret = sigaction(sig, &sigAct, &oldAct);
3560 assert(ret == 0, "check");
3562 void* oldhand2 = oldAct.sa_sigaction
3563 ? CAST_FROM_FN_PTR(void*, oldAct.sa_sigaction)
3564 : CAST_FROM_FN_PTR(void*, oldAct.sa_handler);
3565 assert(oldhand2 == oldhand, "no concurrent signal handler installation");
3568 // install signal handlers for signals that HotSpot needs to
3569 // handle in order to support Java-level exception handling.
3571 void os::Linux::install_signal_handlers() {
3572 if (!signal_handlers_are_installed) {
3573 signal_handlers_are_installed = true;
3576 typedef void (*signal_setting_t)();
3577 signal_setting_t begin_signal_setting = NULL;
3578 signal_setting_t end_signal_setting = NULL;
3579 begin_signal_setting = CAST_TO_FN_PTR(signal_setting_t,
3580 dlsym(RTLD_DEFAULT, "JVM_begin_signal_setting"));
3581 if (begin_signal_setting != NULL) {
3582 end_signal_setting = CAST_TO_FN_PTR(signal_setting_t,
3583 dlsym(RTLD_DEFAULT, "JVM_end_signal_setting"));
3584 get_signal_action = CAST_TO_FN_PTR(get_signal_t,
3585 dlsym(RTLD_DEFAULT, "JVM_get_signal_action"));
3586 libjsig_is_loaded = true;
3587 assert(UseSignalChaining, "should enable signal-chaining");
3589 if (libjsig_is_loaded) {
3590 // Tell libjsig jvm is setting signal handlers
3591 (*begin_signal_setting)();
3594 set_signal_handler(SIGSEGV, true);
3595 set_signal_handler(SIGPIPE, true);
3596 set_signal_handler(SIGBUS, true);
3597 set_signal_handler(SIGILL, true);
3598 set_signal_handler(SIGFPE, true);
3599 set_signal_handler(SIGXFSZ, true);
3601 if (libjsig_is_loaded) {
3602 // Tell libjsig jvm finishes setting signal handlers
3603 (*end_signal_setting)();
3606 // We don't activate signal checker if libjsig is in place, we trust ourselves
3607 // and if UserSignalHandler is installed all bets are off
3608 if (CheckJNICalls) {
3609 if (libjsig_is_loaded) {
3610 tty->print_cr("Info: libjsig is activated, all active signal checking is disabled");
3611 check_signals = false;
3613 if (AllowUserSignalHandlers) {
3614 tty->print_cr("Info: AllowUserSignalHandlers is activated, all active signal checking is disabled");
3615 check_signals = false;
3621 // This is the fastest way to get thread cpu time on Linux.
3622 // Returns cpu time (user+sys) for any thread, not only for current.
3623 // POSIX compliant clocks are implemented in the kernels 2.6.16+.
3624 // It might work on 2.6.10+ with a special kernel/glibc patch.
3625 // For reference, please, see IEEE Std 1003.1-2004:
3626 // http://www.unix.org/single_unix_specification
3628 jlong os::Linux::fast_thread_cpu_time(clockid_t clockid) {
3630 int rc = os::Linux::clock_gettime(clockid, &tp);
3631 assert(rc == 0, "clock_gettime is expected to return 0 code");
3633 return (tp.tv_sec * SEC_IN_NANOSECS) + tp.tv_nsec;
3637 // glibc on Linux platform uses non-documented flag
3638 // to indicate, that some special sort of signal
3639 // trampoline is used.
3640 // We will never set this flag, and we should
3641 // ignore this flag in our diagnostic
3642 #ifdef SIGNIFICANT_SIGNAL_MASK
3643 #undef SIGNIFICANT_SIGNAL_MASK
3645 #define SIGNIFICANT_SIGNAL_MASK (~0x04000000)
3647 static const char* get_signal_handler_name(address handler,
3648 char* buf, int buflen) {
3650 bool found = os::dll_address_to_library_name(handler, buf, buflen, &offset);
3652 // skip directory names
3653 const char *p1, *p2;
3655 size_t len = strlen(os::file_separator());
3656 while ((p2 = strstr(p1, os::file_separator())) != NULL) p1 = p2 + len;
3657 jio_snprintf(buf, buflen, "%s+0x%x", p1, offset);
3659 jio_snprintf(buf, buflen, PTR_FORMAT, handler);
3664 static void print_signal_handler(outputStream* st, int sig,
3665 char* buf, size_t buflen) {
3666 struct sigaction sa;
3668 sigaction(sig, NULL, &sa);
3670 // See comment for SIGNIFICANT_SIGNAL_MASK define
3671 sa.sa_flags &= SIGNIFICANT_SIGNAL_MASK;
3673 st->print("%s: ", os::exception_name(sig, buf, buflen));
3675 address handler = (sa.sa_flags & SA_SIGINFO)
3676 ? CAST_FROM_FN_PTR(address, sa.sa_sigaction)
3677 : CAST_FROM_FN_PTR(address, sa.sa_handler);
3679 if (handler == CAST_FROM_FN_PTR(address, SIG_DFL)) {
3680 st->print("SIG_DFL");
3681 } else if (handler == CAST_FROM_FN_PTR(address, SIG_IGN)) {
3682 st->print("SIG_IGN");
3684 st->print("[%s]", get_signal_handler_name(handler, buf, buflen));
3687 st->print(", sa_mask[0]=" PTR32_FORMAT, *(uint32_t*)&sa.sa_mask);
3689 address rh = VMError::get_resetted_sighandler(sig);
3690 // May be, handler was resetted by VMError?
3693 sa.sa_flags = VMError::get_resetted_sigflags(sig) & SIGNIFICANT_SIGNAL_MASK;
3696 st->print(", sa_flags=" PTR32_FORMAT, sa.sa_flags);
3698 // Check: is it our handler?
3699 if(handler == CAST_FROM_FN_PTR(address, (sa_sigaction_t)signalHandler) ||
3700 handler == CAST_FROM_FN_PTR(address, (sa_sigaction_t)SR_handler)) {
3701 // It is our signal handler
3702 // check for flags, reset system-used one!
3703 if((int)sa.sa_flags != os::Linux::get_our_sigflags(sig)) {
3705 ", flags was changed from " PTR32_FORMAT ", consider using jsig library",
3706 os::Linux::get_our_sigflags(sig));
3713 #define DO_SIGNAL_CHECK(sig) \
3714 if (!sigismember(&check_signal_done, sig)) \
3715 os::Linux::check_signal_handler(sig)
3717 // This method is a periodic task to check for misbehaving JNI applications
3718 // under CheckJNI, we can add any periodic checks here
3720 void os::run_periodic_checks() {
3722 if (check_signals == false) return;
3724 // SEGV and BUS if overridden could potentially prevent
3725 // generation of hs*.log in the event of a crash, debugging
3726 // such a case can be very challenging, so we absolutely
3727 // check the following for a good measure:
3728 DO_SIGNAL_CHECK(SIGSEGV);
3729 DO_SIGNAL_CHECK(SIGILL);
3730 DO_SIGNAL_CHECK(SIGFPE);
3731 DO_SIGNAL_CHECK(SIGBUS);
3732 DO_SIGNAL_CHECK(SIGPIPE);
3733 DO_SIGNAL_CHECK(SIGXFSZ);
3736 // ReduceSignalUsage allows the user to override these handlers
3737 // see comments at the very top and jvm_solaris.h
3738 if (!ReduceSignalUsage) {
3739 DO_SIGNAL_CHECK(SHUTDOWN1_SIGNAL);
3740 DO_SIGNAL_CHECK(SHUTDOWN2_SIGNAL);
3741 DO_SIGNAL_CHECK(SHUTDOWN3_SIGNAL);
3742 DO_SIGNAL_CHECK(BREAK_SIGNAL);
3745 DO_SIGNAL_CHECK(SR_signum);
3746 DO_SIGNAL_CHECK(INTERRUPT_SIGNAL);
3749 typedef int (*os_sigaction_t)(int, const struct sigaction *, struct sigaction *);
3751 static os_sigaction_t os_sigaction = NULL;
3753 void os::Linux::check_signal_handler(int sig) {
3755 address jvmHandler = NULL;
3758 struct sigaction act;
3759 if (os_sigaction == NULL) {
3760 // only trust the default sigaction, in case it has been interposed
3761 os_sigaction = (os_sigaction_t)dlsym(RTLD_DEFAULT, "sigaction");
3762 if (os_sigaction == NULL) return;
3765 os_sigaction(sig, (struct sigaction*)NULL, &act);
3768 act.sa_flags &= SIGNIFICANT_SIGNAL_MASK;
3770 address thisHandler = (act.sa_flags & SA_SIGINFO)
3771 ? CAST_FROM_FN_PTR(address, act.sa_sigaction)
3772 : CAST_FROM_FN_PTR(address, act.sa_handler) ;
3782 jvmHandler = CAST_FROM_FN_PTR(address, (sa_sigaction_t)signalHandler);
3785 case SHUTDOWN1_SIGNAL:
3786 case SHUTDOWN2_SIGNAL:
3787 case SHUTDOWN3_SIGNAL:
3789 jvmHandler = (address)user_handler();
3792 case INTERRUPT_SIGNAL:
3793 jvmHandler = CAST_FROM_FN_PTR(address, SIG_DFL);
3797 if (sig == SR_signum) {
3798 jvmHandler = CAST_FROM_FN_PTR(address, (sa_sigaction_t)SR_handler);
3805 if (thisHandler != jvmHandler) {
3806 tty->print("Warning: %s handler ", exception_name(sig, buf, O_BUFLEN));
3807 tty->print("expected:%s", get_signal_handler_name(jvmHandler, buf, O_BUFLEN));
3808 tty->print_cr(" found:%s", get_signal_handler_name(thisHandler, buf, O_BUFLEN));
3809 // No need to check this sig any longer
3810 sigaddset(&check_signal_done, sig);
3811 } else if(os::Linux::get_our_sigflags(sig) != 0 && (int)act.sa_flags != os::Linux::get_our_sigflags(sig)) {
3812 tty->print("Warning: %s handler flags ", exception_name(sig, buf, O_BUFLEN));
3813 tty->print("expected:" PTR32_FORMAT, os::Linux::get_our_sigflags(sig));
3814 tty->print_cr(" found:" PTR32_FORMAT, act.sa_flags);
3815 // No need to check this sig any longer
3816 sigaddset(&check_signal_done, sig);
3819 // Dump all the signal
3820 if (sigismember(&check_signal_done, sig)) {
3821 print_signal_handlers(tty, buf, O_BUFLEN);
3825 extern void report_error(char* file_name, int line_no, char* title, char* format, ...);
3827 extern bool signal_name(int signo, char* buf, size_t len);
3829 const char* os::exception_name(int exception_code, char* buf, size_t size) {
3830 if (0 < exception_code && exception_code <= SIGRTMAX) {
3832 if (!signal_name(exception_code, buf, size)) {
3833 jio_snprintf(buf, size, "SIG%d", exception_code);
3841 // this is called _before_ the most of global arguments have been parsed
3842 void os::init(void) {
3843 char dummy; /* used to get a guess on initial stack address */
3844 // first_hrtime = gethrtime();
3846 // With LinuxThreads the JavaMain thread pid (primordial thread)
3847 // is different than the pid of the java launcher thread.
3848 // So, on Linux, the launcher thread pid is passed to the VM
3849 // via the sun.java.launcher.pid property.
3850 // Use this property instead of getpid() if it was correctly passed.
3852 pid_t java_launcher_pid = (pid_t) Arguments::sun_java_launcher_pid();
3854 _initial_pid = (java_launcher_pid > 0) ? java_launcher_pid : getpid();
3856 clock_tics_per_sec = sysconf(_SC_CLK_TCK);
3858 init_random(1234567);
3860 ThreadCritical::initialize();
3862 Linux::set_page_size(sysconf(_SC_PAGESIZE));
3863 if (Linux::page_size() == -1) {
3864 fatal(err_msg("os_linux.cpp: os::init: sysconf failed (%s)",
3867 init_page_sizes((size_t) Linux::page_size());
3869 Linux::initialize_system_info();
3871 // main_thread points to the aboriginal thread
3872 Linux::_main_thread = pthread_self();
3874 Linux::clock_init();
3875 initial_time_count = os::elapsed_counter();
3876 pthread_mutex_init(&dl_mutex, NULL);
3879 // To install functions for atexit system call
3881 static void perfMemory_exit_helper() {
3886 // this is called _after_ the global arguments have been parsed
3887 jint os::init_2(void)
3889 Linux::fast_thread_clock_init();
3891 // Allocate a single page and mark it as readable for safepoint polling
3892 address polling_page = (address) ::mmap(NULL, Linux::page_size(), PROT_READ, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
3893 guarantee( polling_page != MAP_FAILED, "os::init_2: failed to allocate polling page" );
3895 os::set_polling_page( polling_page );
3898 if(Verbose && PrintMiscellaneous)
3899 tty->print("[SafePoint Polling address: " INTPTR_FORMAT "]\n", (intptr_t)polling_page);
3903 address mem_serialize_page = (address) ::mmap(NULL, Linux::page_size(), PROT_READ | PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
3904 guarantee( mem_serialize_page != NULL, "mmap Failed for memory serialize page");
3905 os::set_memory_serialize_page( mem_serialize_page );
3908 if(Verbose && PrintMiscellaneous)
3909 tty->print("[Memory Serialize Page address: " INTPTR_FORMAT "]\n", (intptr_t)mem_serialize_page);
3913 FLAG_SET_DEFAULT(UseLargePages, os::large_page_init());
3915 // initialize suspend/resume support - must do this before signal_sets_init()
3916 if (SR_initialize() != 0) {
3917 perror("SR_initialize failed");
3921 Linux::signal_sets_init();
3922 Linux::install_signal_handlers();
3924 size_t threadStackSizeInBytes = ThreadStackSize * K;
3925 if (threadStackSizeInBytes != 0 &&
3926 threadStackSizeInBytes < Linux::min_stack_allowed) {
3927 tty->print_cr("\nThe stack size specified is too small, "
3928 "Specify at least %dk",
3929 Linux::min_stack_allowed / K);
3933 // Make the stack size a multiple of the page size so that
3934 // the yellow/red zones can be guarded.
3935 JavaThread::set_stack_size_at_create(round_to(threadStackSizeInBytes,
3938 Linux::capture_initial_stack(JavaThread::stack_size_at_create());
3940 Linux::libpthread_init();
3941 if (PrintMiscellaneous && (Verbose || WizardMode)) {
3942 tty->print_cr("[HotSpot is running with %s, %s(%s)]\n",
3943 Linux::glibc_version(), Linux::libpthread_version(),
3944 Linux::is_floating_stack() ? "floating stack" : "fixed stack");
3948 if (!Linux::libnuma_init()) {
3951 if ((Linux::numa_max_node() < 1)) {
3952 // There's only one node(they start from 0), disable NUMA.
3956 if (!UseNUMA && ForceNUMA) {
3962 // set the number of file descriptors to max. print out error
3963 // if getrlimit/setrlimit fails but continue regardless.
3964 struct rlimit nbr_files;
3965 int status = getrlimit(RLIMIT_NOFILE, &nbr_files);
3967 if (PrintMiscellaneous && (Verbose || WizardMode))
3968 perror("os::init_2 getrlimit failed");
3970 nbr_files.rlim_cur = nbr_files.rlim_max;
3971 status = setrlimit(RLIMIT_NOFILE, &nbr_files);
3973 if (PrintMiscellaneous && (Verbose || WizardMode))
3974 perror("os::init_2 setrlimit failed");
3979 // Initialize lock used to serialize thread creation (see os::create_thread)
3980 Linux::set_createThread_lock(new Mutex(Mutex::leaf, "createThread_lock", false));
3983 jint hpi_result = hpi::initialize();
3984 if (hpi_result != JNI_OK) {
3985 tty->print_cr("There was an error trying to initialize the HPI library.");
3989 // at-exit methods are called in the reverse order of their registration.
3990 // atexit functions are called on return from main or as a result of a
3991 // call to exit(3C). There can be only 32 of these functions registered
3992 // and atexit() does not set errno.
3994 if (PerfAllowAtExitRegistration) {
3995 // only register atexit functions if PerfAllowAtExitRegistration is set.
3996 // atexit functions can be delayed until process exit time, which
3997 // can be problematic for embedded VM situations. Embedded VMs should
3998 // call DestroyJavaVM() to assure that VM resources are released.
4000 // note: perfMemory_exit_helper atexit function may be removed in
4001 // the future if the appropriate cleanup code can be added to the
4002 // VM_Exit VMOperation's doit method.
4003 if (atexit(perfMemory_exit_helper) != 0) {
4004 warning("os::init2 atexit(perfMemory_exit_helper) failed");
4008 // initialize thread priority policy
4014 // this is called at the end of vm_initialization
4015 void os::init_3(void) { }
4017 // Mark the polling page as unreadable
4018 void os::make_polling_page_unreadable(void) {
4019 if( !guard_memory((char*)_polling_page, Linux::page_size()) )
4020 fatal("Could not disable polling page");
4023 // Mark the polling page as readable
4024 void os::make_polling_page_readable(void) {
4025 if( !linux_mprotect((char *)_polling_page, Linux::page_size(), PROT_READ)) {
4026 fatal("Could not enable polling page");
4030 int os::active_processor_count() {
4031 // Linux doesn't yet have a (official) notion of processor sets,
4032 // so just return the number of online processors.
4033 int online_cpus = ::sysconf(_SC_NPROCESSORS_ONLN);
4034 assert(online_cpus > 0 && online_cpus <= processor_count(), "sanity check");
4038 bool os::distribute_processes(uint length, uint* distribution) {
4039 // Not yet implemented.
4043 bool os::bind_to_processor(uint processor_id) {
4044 // Not yet implemented.
4050 // Suspends the target using the signal mechanism and then grabs the PC before
4051 // resuming the target. Used by the flat-profiler only
4052 ExtendedPC os::get_thread_pc(Thread* thread) {
4053 // Make sure that it is called by the watcher for the VMThread
4054 assert(Thread::current()->is_Watcher_thread(), "Must be watcher");
4055 assert(thread->is_VM_thread(), "Can only be called for VMThread");
4059 OSThread* osthread = thread->osthread();
4060 if (do_suspend(osthread)) {
4061 if (osthread->ucontext() != NULL) {
4062 epc = os::Linux::ucontext_get_pc(osthread->ucontext());
4064 // NULL context is unexpected, double-check this is the VMThread
4065 guarantee(thread->is_VM_thread(), "can only be called for VMThread");
4067 do_resume(osthread);
4069 // failure means pthread_kill failed for some reason - arguably this is
4070 // a fatal problem, but such problems are ignored elsewhere
4075 int os::Linux::safe_cond_timedwait(pthread_cond_t *_cond, pthread_mutex_t *_mutex, const struct timespec *_abstime)
4078 return pthread_cond_timedwait(_cond, _mutex, _abstime);
4081 // 6292965: LinuxThreads pthread_cond_timedwait() resets FPU control
4082 // word back to default 64bit precision if condvar is signaled. Java
4083 // wants 53bit precision. Save and restore current value.
4084 int fpu = get_fpu_control_word();
4086 int status = pthread_cond_timedwait(_cond, _mutex, _abstime);
4088 set_fpu_control_word(fpu);
4094 ////////////////////////////////////////////////////////////////////////////////
4097 static address same_page(address x, address y) {
4098 int page_bits = -os::vm_page_size();
4099 if ((intptr_t(x) & page_bits) == (intptr_t(y) & page_bits))
4102 return (address)(intptr_t(y) | ~page_bits) + 1;
4104 return (address)(intptr_t(y) & page_bits);
4107 bool os::find(address addr, outputStream* st) {
4109 memset(&dlinfo, 0, sizeof(dlinfo));
4110 if (dladdr(addr, &dlinfo)) {
4111 st->print(PTR_FORMAT ": ", addr);
4112 if (dlinfo.dli_sname != NULL) {
4113 st->print("%s+%#x", dlinfo.dli_sname,
4114 addr - (intptr_t)dlinfo.dli_saddr);
4115 } else if (dlinfo.dli_fname) {
4116 st->print("<offset %#x>", addr - (intptr_t)dlinfo.dli_fbase);
4118 st->print("<absolute address>");
4120 if (dlinfo.dli_fname) {
4121 st->print(" in %s", dlinfo.dli_fname);
4123 if (dlinfo.dli_fbase) {
4124 st->print(" at " PTR_FORMAT, dlinfo.dli_fbase);
4129 // decode some bytes around the PC
4130 address begin = same_page(addr-40, addr);
4131 address end = same_page(addr+40, addr);
4132 address lowest = (address) dlinfo.dli_sname;
4133 if (!lowest) lowest = (address) dlinfo.dli_fbase;
4134 if (begin < lowest) begin = lowest;
4136 if (dladdr(end, &dlinfo2) && dlinfo2.dli_saddr != dlinfo.dli_saddr
4137 && end > dlinfo2.dli_saddr && dlinfo2.dli_saddr > begin)
4138 end = (address) dlinfo2.dli_saddr;
4139 Disassembler::decode(begin, end, st);
4146 ////////////////////////////////////////////////////////////////////////////////
4149 // This does not do anything on Linux. This is basically a hook for being
4150 // able to use structured exception handling (thread-local exception filters)
4153 os::os_exception_wrapper(java_call_t f, JavaValue* value, methodHandle* method,
4154 JavaCallArguments* args, Thread* thread) {
4155 f(value, method, args, thread);
4158 void os::print_statistics() {
4161 int os::message_box(const char* title, const char* message) {
4163 fdStream err(defaultStream::error_fd());
4164 for (i = 0; i < 78; i++) err.print_raw("=");
4166 err.print_raw_cr(title);
4167 for (i = 0; i < 78; i++) err.print_raw("-");
4169 err.print_raw_cr(message);
4170 for (i = 0; i < 78; i++) err.print_raw("=");
4174 // Prevent process from exiting upon "read error" without consuming all CPU
4175 while (::read(0, buf, sizeof(buf)) <= 0) { ::sleep(100); }
4177 return buf[0] == 'y' || buf[0] == 'Y';
4180 int os::stat(const char *path, struct stat *sbuf) {
4181 char pathbuf[MAX_PATH];
4182 if (strlen(path) > MAX_PATH - 1) {
4183 errno = ENAMETOOLONG;
4186 hpi::native_path(strcpy(pathbuf, path));
4187 return ::stat(pathbuf, sbuf);
4190 bool os::check_heap(bool force) {
4194 int local_vsnprintf(char* buf, size_t count, const char* format, va_list args) {
4195 return ::vsnprintf(buf, count, format, args);
4198 // Is a (classpath) directory empty?
4199 bool os::dir_is_empty(const char* path) {
4203 dir = opendir(path);
4204 if (dir == NULL) return true;
4206 /* Scan the directory */
4208 char buf[sizeof(struct dirent) + MAX_PATH];
4209 while (result && (ptr = ::readdir(dir)) != NULL) {
4210 if (strcmp(ptr->d_name, ".") != 0 && strcmp(ptr->d_name, "..") != 0) {
4218 // create binary file, rewriting existing file if required
4219 int os::create_binary_file(const char* path, bool rewrite_existing) {
4220 int oflags = O_WRONLY | O_CREAT;
4221 if (!rewrite_existing) {
4224 return ::open64(path, oflags, S_IREAD | S_IWRITE);
4227 // return current position of file pointer
4228 jlong os::current_file_offset(int fd) {
4229 return (jlong)::lseek64(fd, (off64_t)0, SEEK_CUR);
4232 // move file pointer to the specified offset
4233 jlong os::seek_to_file_offset(int fd, jlong offset) {
4234 return (jlong)::lseek64(fd, (off64_t)offset, SEEK_SET);
4237 // Map a block of memory.
4238 char* os::map_memory(int fd, const char* file_name, size_t file_offset,
4239 char *addr, size_t bytes, bool read_only,
4248 prot = PROT_READ | PROT_WRITE;
4249 flags = MAP_PRIVATE;
4260 char* mapped_address = (char*)mmap(addr, (size_t)bytes, prot, flags,
4262 if (mapped_address == MAP_FAILED) {
4265 return mapped_address;
4269 // Remap a block of memory.
4270 char* os::remap_memory(int fd, const char* file_name, size_t file_offset,
4271 char *addr, size_t bytes, bool read_only,
4273 // same as map_memory() on this OS
4274 return os::map_memory(fd, file_name, file_offset, addr, bytes, read_only,
4279 // Unmap a block of memory.
4280 bool os::unmap_memory(char* addr, size_t bytes) {
4281 return munmap(addr, bytes) == 0;
4284 static jlong slow_thread_cpu_time(Thread *thread, bool user_sys_cpu_time);
4286 static clockid_t thread_cpu_clockid(Thread* thread) {
4287 pthread_t tid = thread->osthread()->pthread_id();
4290 // Get thread clockid
4291 int rc = os::Linux::pthread_getcpuclockid(tid, &clockid);
4292 assert(rc == 0, "pthread_getcpuclockid is expected to return 0 code");
4296 // current_thread_cpu_time(bool) and thread_cpu_time(Thread*, bool)
4297 // are used by JVM M&M and JVMTI to get user+sys or user CPU time
4300 // current_thread_cpu_time() and thread_cpu_time(Thread*) returns
4301 // the fast estimate available on the platform.
4303 jlong os::current_thread_cpu_time() {
4304 if (os::Linux::supports_fast_thread_cpu_time()) {
4305 return os::Linux::fast_thread_cpu_time(CLOCK_THREAD_CPUTIME_ID);
4307 // return user + sys since the cost is the same
4308 return slow_thread_cpu_time(Thread::current(), true /* user + sys */);
4312 jlong os::thread_cpu_time(Thread* thread) {
4313 // consistent with what current_thread_cpu_time() returns
4314 if (os::Linux::supports_fast_thread_cpu_time()) {
4315 return os::Linux::fast_thread_cpu_time(thread_cpu_clockid(thread));
4317 return slow_thread_cpu_time(thread, true /* user + sys */);
4321 jlong os::current_thread_cpu_time(bool user_sys_cpu_time) {
4322 if (user_sys_cpu_time && os::Linux::supports_fast_thread_cpu_time()) {
4323 return os::Linux::fast_thread_cpu_time(CLOCK_THREAD_CPUTIME_ID);
4325 return slow_thread_cpu_time(Thread::current(), user_sys_cpu_time);
4329 jlong os::thread_cpu_time(Thread *thread, bool user_sys_cpu_time) {
4330 if (user_sys_cpu_time && os::Linux::supports_fast_thread_cpu_time()) {
4331 return os::Linux::fast_thread_cpu_time(thread_cpu_clockid(thread));
4333 return slow_thread_cpu_time(thread, user_sys_cpu_time);
4341 static jlong slow_thread_cpu_time(Thread *thread, bool user_sys_cpu_time) {
4342 static bool proc_pid_cpu_avail = true;
4343 static bool proc_task_unchecked = true;
4344 static const char *proc_stat_path = "/proc/%d/stat";
4345 pid_t tid = thread->osthread()->thread_id();
4352 long sys_time, user_time;
4359 // We first try accessing /proc/<pid>/cpu since this is faster to
4360 // process. If this file is not present (linux kernels 2.5 and above)
4361 // then we open /proc/<pid>/stat.
4362 if ( proc_pid_cpu_avail ) {
4363 sprintf(proc_name, "/proc/%d/cpu", tid);
4364 fp = fopen(proc_name, "r");
4366 count = fscanf( fp, "%s %lu %lu\n", string, &user_time, &sys_time);
4368 if ( count != 3 ) return -1;
4370 if (user_sys_cpu_time) {
4371 return ((jlong)sys_time + (jlong)user_time) * (1000000000 / clock_tics_per_sec);
4373 return (jlong)user_time * (1000000000 / clock_tics_per_sec);
4376 else proc_pid_cpu_avail = false;
4379 // The /proc/<tid>/stat aggregates per-process usage on
4380 // new Linux kernels 2.6+ where NPTL is supported.
4381 // The /proc/self/task/<tid>/stat still has the per-thread usage.
4383 // There can be no directory /proc/self/task on kernels 2.4 with NPTL
4384 // and possibly in some other cases, so we check its availability.
4385 if (proc_task_unchecked && os::Linux::is_NPTL()) {
4386 // This is executed only once
4387 proc_task_unchecked = false;
4388 fp = fopen("/proc/self/task", "r");
4390 proc_stat_path = "/proc/self/task/%d/stat";
4395 sprintf(proc_name, proc_stat_path, tid);
4396 fp = fopen(proc_name, "r");
4397 if ( fp == NULL ) return -1;
4398 statlen = fread(stat, 1, 2047, fp);
4399 stat[statlen] = '\0';
4402 // Skip pid and the command string. Note that we could be dealing with
4403 // weird command names, e.g. user could decide to rename java launcher
4404 // to "java 1.4.2 :)", then the stat file would look like
4405 // 1234 (java 1.4.2 :)) R ... ...
4406 // We don't really need to know the command string, just find the last
4407 // occurrence of ")" and then start parsing from there. See bug 4726580.
4408 s = strrchr(stat, ')');
4410 if (s == NULL ) return -1;
4413 do s++; while (isspace(*s));
4415 count = sscanf(s,"%c %d %d %d %d %d %lu %lu %lu %lu %lu %lu %lu",
4416 &cdummy, &idummy, &idummy, &idummy, &idummy, &idummy,
4417 &ldummy, &ldummy, &ldummy, &ldummy, &ldummy,
4418 &user_time, &sys_time);
4419 if ( count != 13 ) return -1;
4420 if (user_sys_cpu_time) {
4421 return ((jlong)sys_time + (jlong)user_time) * (1000000000 / clock_tics_per_sec);
4423 return (jlong)user_time * (1000000000 / clock_tics_per_sec);
4427 void os::current_thread_cpu_time_info(jvmtiTimerInfo *info_ptr) {
4428 info_ptr->max_value = ALL_64_BITS; // will not wrap in less than 64 bits
4429 info_ptr->may_skip_backward = false; // elapsed time not wall time
4430 info_ptr->may_skip_forward = false; // elapsed time not wall time
4431 info_ptr->kind = JVMTI_TIMER_TOTAL_CPU; // user+system time is returned
4434 void os::thread_cpu_time_info(jvmtiTimerInfo *info_ptr) {
4435 info_ptr->max_value = ALL_64_BITS; // will not wrap in less than 64 bits
4436 info_ptr->may_skip_backward = false; // elapsed time not wall time
4437 info_ptr->may_skip_forward = false; // elapsed time not wall time
4438 info_ptr->kind = JVMTI_TIMER_TOTAL_CPU; // user+system time is returned
4441 bool os::is_thread_cpu_time_supported() {
4445 // System loadavg support. Returns -1 if load average cannot be obtained.
4446 // Linux doesn't yet have a (official) notion of processor sets,
4447 // so just return the system wide load average.
4448 int os::loadavg(double loadavg[], int nelem) {
4449 return ::getloadavg(loadavg, nelem);
4453 char filename[MAX_PATH];
4454 if (PauseAtStartupFile && PauseAtStartupFile[0]) {
4455 jio_snprintf(filename, MAX_PATH, PauseAtStartupFile);
4457 jio_snprintf(filename, MAX_PATH, "./vm.paused.%d", current_process_id());
4460 int fd = ::open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0666);
4464 while (::stat(filename, &buf) == 0) {
4465 (void)::poll(NULL, 0, 100);
4469 "Could not open pause file '%s', continuing immediately.\n", filename);
4476 * NOTE: the following code is to keep the green threads code
4477 * in the libjava.so happy. Once the green threads is removed,
4478 * these code will no longer be needed.
4481 jdk_waitpid(pid_t pid, int* status, int options) {
4482 return waitpid(pid, status, options);
4491 jdk_sem_init(sem_t *sem, int pshared, unsigned int value) {
4492 return sem_init(sem, pshared, value);
4496 jdk_sem_post(sem_t *sem) {
4497 return sem_post(sem);
4501 jdk_sem_wait(sem_t *sem) {
4502 return sem_wait(sem);
4506 jdk_pthread_sigmask(int how , const sigset_t* newmask, sigset_t* oldmask) {
4507 return pthread_sigmask(how , newmask, oldmask);
4512 // Refer to the comments in os_solaris.cpp park-unpark.
4514 // Beware -- Some versions of NPTL embody a flaw where pthread_cond_timedwait() can
4515 // hang indefinitely. For instance NPTL 0.60 on 2.4.21-4ELsmp is vulnerable.
4516 // For specifics regarding the bug see GLIBC BUGID 261237 :
4517 // http://www.mail-archive.com/debian-glibc@lists.debian.org/msg10837.html.
4518 // Briefly, pthread_cond_timedwait() calls with an expiry time that's not in the future
4519 // will either hang or corrupt the condvar, resulting in subsequent hangs if the condvar
4520 // is used. (The simple C test-case provided in the GLIBC bug report manifests the
4521 // hang). The JVM is vulernable via sleep(), Object.wait(timo), LockSupport.parkNanos()
4522 // and monitorenter when we're using 1-0 locking. All those operations may result in
4523 // calls to pthread_cond_timedwait(). Using LD_ASSUME_KERNEL to use an older version
4524 // of libpthread avoids the problem, but isn't practical.
4526 // Possible remedies:
4528 // 1. Establish a minimum relative wait time. 50 to 100 msecs seems to work.
4529 // This is palliative and probabilistic, however. If the thread is preempted
4530 // between the call to compute_abstime() and pthread_cond_timedwait(), more
4531 // than the minimum period may have passed, and the abstime may be stale (in the
4532 // past) resultin in a hang. Using this technique reduces the odds of a hang
4533 // but the JVM is still vulnerable, particularly on heavily loaded systems.
4535 // 2. Modify park-unpark to use per-thread (per ParkEvent) pipe-pairs instead
4536 // of the usual flag-condvar-mutex idiom. The write side of the pipe is set
4537 // NDELAY. unpark() reduces to write(), park() reduces to read() and park(timo)
4538 // reduces to poll()+read(). This works well, but consumes 2 FDs per extant
4541 // 3. Embargo pthread_cond_timedwait() and implement a native "chron" thread
4542 // that manages timeouts. We'd emulate pthread_cond_timedwait() by enqueuing
4543 // a timeout request to the chron thread and then blocking via pthread_cond_wait().
4544 // This also works well. In fact it avoids kernel-level scalability impediments
4545 // on certain platforms that don't handle lots of active pthread_cond_timedwait()
4546 // timers in a graceful fashion.
4548 // 4. When the abstime value is in the past it appears that control returns
4549 // correctly from pthread_cond_timedwait(), but the condvar is left corrupt.
4550 // Subsequent timedwait/wait calls may hang indefinitely. Given that, we
4551 // can avoid the problem by reinitializing the condvar -- by cond_destroy()
4552 // followed by cond_init() -- after all calls to pthread_cond_timedwait().
4553 // It may be possible to avoid reinitialization by checking the return
4554 // value from pthread_cond_timedwait(). In addition to reinitializing the
4555 // condvar we must establish the invariant that cond_signal() is only called
4556 // within critical sections protected by the adjunct mutex. This prevents
4557 // cond_signal() from "seeing" a condvar that's in the midst of being
4558 // reinitialized or that is corrupt. Sadly, this invariant obviates the
4559 // desirable signal-after-unlock optimization that avoids futile context switching.
4561 // I'm also concerned that some versions of NTPL might allocate an auxilliary
4562 // structure when a condvar is used or initialized. cond_destroy() would
4563 // release the helper structure. Our reinitialize-after-timedwait fix
4564 // put excessive stress on malloc/free and locks protecting the c-heap.
4566 // We currently use (4). See the WorkAroundNTPLTimedWaitHang flag.
4567 // It may be possible to refine (4) by checking the kernel and NTPL verisons
4568 // and only enabling the work-around for vulnerable environments.
4570 // utility to compute the abstime argument to timedwait:
4571 // millis is the relative timeout time
4572 // abstime will be the absolute timeout time
4573 // TODO: replace compute_abstime() with unpackTime()
4575 static struct timespec* compute_abstime(timespec* abstime, jlong millis) {
4576 if (millis < 0) millis = 0;
4578 int status = gettimeofday(&now, NULL);
4579 assert(status == 0, "gettimeofday");
4580 jlong seconds = millis / 1000;
4582 if (seconds > 50000000) { // see man cond_timedwait(3T)
4585 abstime->tv_sec = now.tv_sec + seconds;
4586 long usec = now.tv_usec + millis * 1000;
4587 if (usec >= 1000000) {
4588 abstime->tv_sec += 1;
4591 abstime->tv_nsec = usec * 1000;
4596 // Test-and-clear _Event, always leaves _Event set to 0, returns immediately.
4597 // Conceptually TryPark() should be equivalent to park(0).
4599 int os::PlatformEvent::TryPark() {
4601 const int v = _Event ;
4602 guarantee ((v == 0) || (v == 1), "invariant") ;
4603 if (Atomic::cmpxchg (0, &_Event, v) == v) return v ;
4607 void os::PlatformEvent::park() { // AKA "down()"
4608 // Invariant: Only the thread associated with the Event/PlatformEvent
4610 // TODO: assert that _Assoc != NULL or _Assoc == Self
4614 if (Atomic::cmpxchg (v-1, &_Event, v) == v) break ;
4616 guarantee (v >= 0, "invariant") ;
4618 // Do this the hard way by blocking ...
4619 int status = pthread_mutex_lock(_mutex);
4620 assert_status(status == 0, status, "mutex_lock");
4621 guarantee (_nParked == 0, "invariant") ;
4623 while (_Event < 0) {
4624 status = pthread_cond_wait(_cond, _mutex);
4625 // for some reason, under 2.7 lwp_cond_wait() may return ETIME ...
4626 // Treat this the same as if the wait was interrupted
4627 if (status == ETIME) { status = EINTR; }
4628 assert_status(status == 0 || status == EINTR, status, "cond_wait");
4632 // In theory we could move the ST of 0 into _Event past the unlock(),
4633 // but then we'd need a MEMBAR after the ST.
4635 status = pthread_mutex_unlock(_mutex);
4636 assert_status(status == 0, status, "mutex_unlock");
4638 guarantee (_Event >= 0, "invariant") ;
4641 int os::PlatformEvent::park(jlong millis) {
4642 guarantee (_nParked == 0, "invariant") ;
4647 if (Atomic::cmpxchg (v-1, &_Event, v) == v) break ;
4649 guarantee (v >= 0, "invariant") ;
4650 if (v != 0) return OS_OK ;
4652 // We do this the hard way, by blocking the thread.
4653 // Consider enforcing a minimum timeout value.
4654 struct timespec abst;
4655 compute_abstime(&abst, millis);
4657 int ret = OS_TIMEOUT;
4658 int status = pthread_mutex_lock(_mutex);
4659 assert_status(status == 0, status, "mutex_lock");
4660 guarantee (_nParked == 0, "invariant") ;
4663 // Object.wait(timo) will return because of
4666 // (c) thread.interrupt
4668 // Thread.interrupt and object.notify{All} both call Event::set.
4669 // That is, we treat thread.interrupt as a special case of notification.
4670 // The underlying Solaris implementation, cond_timedwait, admits
4671 // spurious/premature wakeups, but the JLS/JVM spec prevents the
4672 // JVM from making those visible to Java code. As such, we must
4673 // filter out spurious wakeups. We assume all ETIME returns are valid.
4675 // TODO: properly differentiate simultaneous notify+interrupt.
4676 // In that case, we should propagate the notify to another waiter.
4678 while (_Event < 0) {
4679 status = os::Linux::safe_cond_timedwait(_cond, _mutex, &abst);
4680 if (status != 0 && WorkAroundNPTLTimedWaitHang) {
4681 pthread_cond_destroy (_cond);
4682 pthread_cond_init (_cond, NULL) ;
4684 assert_status(status == 0 || status == EINTR ||
4685 status == ETIME || status == ETIMEDOUT,
4686 status, "cond_timedwait");
4687 if (!FilterSpuriousWakeups) break ; // previous semantics
4688 if (status == ETIME || status == ETIMEDOUT) break ;
4689 // We consume and ignore EINTR and spurious wakeups.
4696 status = pthread_mutex_unlock(_mutex);
4697 assert_status(status == 0, status, "mutex_unlock");
4698 assert (_nParked == 0, "invariant") ;
4702 void os::PlatformEvent::unpark() {
4707 // The LD of _Event could have reordered or be satisfied
4708 // by a read-aside from this processor's write buffer.
4709 // To avoid problems execute a barrier and then
4710 // ratify the value.
4711 OrderAccess::fence() ;
4712 if (_Event == v) return ;
4715 if (Atomic::cmpxchg (v+1, &_Event, v) == v) break ;
4718 // Wait for the thread associated with the event to vacate
4719 int status = pthread_mutex_lock(_mutex);
4720 assert_status(status == 0, status, "mutex_lock");
4721 AnyWaiters = _nParked ;
4722 assert (AnyWaiters == 0 || AnyWaiters == 1, "invariant") ;
4723 if (AnyWaiters != 0 && WorkAroundNPTLTimedWaitHang) {
4725 pthread_cond_signal (_cond);
4727 status = pthread_mutex_unlock(_mutex);
4728 assert_status(status == 0, status, "mutex_unlock");
4729 if (AnyWaiters != 0) {
4730 status = pthread_cond_signal(_cond);
4731 assert_status(status == 0, status, "cond_signal");
4735 // Note that we signal() _after dropping the lock for "immortal" Events.
4736 // This is safe and avoids a common class of futile wakeups. In rare
4737 // circumstances this can cause a thread to return prematurely from
4738 // cond_{timed}wait() but the spurious wakeup is benign and the victim will
4739 // simply re-test the condition and re-park itself.
4744 // -------------------------------------------------------
4747 * The solaris and linux implementations of park/unpark are fairly
4748 * conservative for now, but can be improved. They currently use a
4749 * mutex/condvar pair, plus a a count.
4750 * Park decrements count if > 0, else does a condvar wait. Unpark
4751 * sets count to 1 and signals condvar. Only one thread ever waits
4752 * on the condvar. Contention seen when trying to park implies that someone
4753 * is unparking you, so don't wait. And spurious returns are fine, so there
4754 * is no need to track notifications.
4758 #define NANOSECS_PER_SEC 1000000000
4759 #define NANOSECS_PER_MILLISEC 1000000
4760 #define MAX_SECS 100000000
4762 * This code is common to linux and solaris and will be moved to a
4763 * common place in dolphin.
4765 * The passed in time value is either a relative time in nanoseconds
4766 * or an absolute time in milliseconds. Either way it has to be unpacked
4767 * into suitable seconds and nanoseconds components and stored in the
4768 * given timespec structure.
4769 * Given time is a 64-bit value and the time_t used in the timespec is only
4770 * a signed-32-bit value (except on 64-bit Linux) we have to watch for
4771 * overflow if times way in the future are given. Further on Solaris versions
4772 * prior to 10 there is a restriction (see cond_timedwait) that the specified
4773 * number of seconds, in abstime, is less than current_time + 100,000,000.
4774 * As it will be 28 years before "now + 100000000" will overflow we can
4775 * ignore overflow and just impose a hard-limit on seconds using the value
4776 * of "now + 100,000,000". This places a limit on the timeout of about 3.17
4780 static void unpackTime(timespec* absTime, bool isAbsolute, jlong time) {
4781 assert (time > 0, "convertTime");
4784 int status = gettimeofday(&now, NULL);
4785 assert(status == 0, "gettimeofday");
4787 time_t max_secs = now.tv_sec + MAX_SECS;
4790 jlong secs = time / 1000;
4791 if (secs > max_secs) {
4792 absTime->tv_sec = max_secs;
4795 absTime->tv_sec = secs;
4797 absTime->tv_nsec = (time % 1000) * NANOSECS_PER_MILLISEC;
4800 jlong secs = time / NANOSECS_PER_SEC;
4801 if (secs >= MAX_SECS) {
4802 absTime->tv_sec = max_secs;
4803 absTime->tv_nsec = 0;
4806 absTime->tv_sec = now.tv_sec + secs;
4807 absTime->tv_nsec = (time % NANOSECS_PER_SEC) + now.tv_usec*1000;
4808 if (absTime->tv_nsec >= NANOSECS_PER_SEC) {
4809 absTime->tv_nsec -= NANOSECS_PER_SEC;
4810 ++absTime->tv_sec; // note: this must be <= max_secs
4814 assert(absTime->tv_sec >= 0, "tv_sec < 0");
4815 assert(absTime->tv_sec <= max_secs, "tv_sec > max_secs");
4816 assert(absTime->tv_nsec >= 0, "tv_nsec < 0");
4817 assert(absTime->tv_nsec < NANOSECS_PER_SEC, "tv_nsec >= nanos_per_sec");
4820 void Parker::park(bool isAbsolute, jlong time) {
4821 // Optional fast-path check:
4822 // Return immediately if a permit is available.
4825 OrderAccess::fence();
4829 Thread* thread = Thread::current();
4830 assert(thread->is_Java_thread(), "Must be JavaThread");
4831 JavaThread *jt = (JavaThread *)thread;
4833 // Optional optimization -- avoid state transitions if there's an interrupt pending.
4834 // Check interrupt before trying to wait
4835 if (Thread::is_interrupted(thread, false)) {
4839 // Next, demultiplex/decode time arguments
4841 if (time < 0) { // don't wait at all
4845 unpackTime(&absTime, isAbsolute, time);
4849 // Enter safepoint region
4850 // Beware of deadlocks such as 6317397.
4851 // The per-thread Parker:: mutex is a classic leaf-lock.
4852 // In particular a thread must never block on the Threads_lock while
4853 // holding the Parker:: mutex. If safepoints are pending both the
4854 // the ThreadBlockInVM() CTOR and DTOR may grab Threads_lock.
4855 ThreadBlockInVM tbivm(jt);
4857 // Don't wait if cannot get lock since interference arises from
4858 // unblocking. Also. check interrupt before trying wait
4859 if (Thread::is_interrupted(thread, false) || pthread_mutex_trylock(_mutex) != 0) {
4864 if (_counter > 0) { // no wait needed
4866 status = pthread_mutex_unlock(_mutex);
4867 assert (status == 0, "invariant") ;
4868 OrderAccess::fence();
4873 // Don't catch signals while blocked; let the running threads have the signals.
4874 // (This allows a debugger to break into the running thread.)
4876 sigset_t* allowdebug_blocked = os::Linux::allowdebug_blocked_signals();
4877 pthread_sigmask(SIG_BLOCK, allowdebug_blocked, &oldsigs);
4880 OSThreadWaitState osts(thread->osthread(), false /* not Object.wait() */);
4881 jt->set_suspend_equivalent();
4882 // cleared by handle_special_suspend_equivalent_condition() or java_suspend_self()
4885 status = pthread_cond_wait (_cond, _mutex) ;
4887 status = os::Linux::safe_cond_timedwait (_cond, _mutex, &absTime) ;
4888 if (status != 0 && WorkAroundNPTLTimedWaitHang) {
4889 pthread_cond_destroy (_cond) ;
4890 pthread_cond_init (_cond, NULL);
4893 assert_status(status == 0 || status == EINTR ||
4894 status == ETIME || status == ETIMEDOUT,
4895 status, "cond_timedwait");
4898 pthread_sigmask(SIG_SETMASK, &oldsigs, NULL);
4902 status = pthread_mutex_unlock(_mutex) ;
4903 assert_status(status == 0, status, "invariant") ;
4904 // If externally suspended while waiting, re-suspend
4905 if (jt->handle_special_suspend_equivalent_condition()) {
4906 jt->java_suspend_self();
4909 OrderAccess::fence();
4912 void Parker::unpark() {
4914 status = pthread_mutex_lock(_mutex);
4915 assert (status == 0, "invariant") ;
4919 if (WorkAroundNPTLTimedWaitHang) {
4920 status = pthread_cond_signal (_cond) ;
4921 assert (status == 0, "invariant") ;
4922 status = pthread_mutex_unlock(_mutex);
4923 assert (status == 0, "invariant") ;
4925 status = pthread_mutex_unlock(_mutex);
4926 assert (status == 0, "invariant") ;
4927 status = pthread_cond_signal (_cond) ;
4928 assert (status == 0, "invariant") ;
4931 pthread_mutex_unlock(_mutex);
4932 assert (status == 0, "invariant") ;
4937 extern char** environ;
4940 #define __NR_fork IA32_ONLY(2) IA64_ONLY(not defined) AMD64_ONLY(57)
4944 #define __NR_execve IA32_ONLY(11) IA64_ONLY(1033) AMD64_ONLY(59)
4947 // Run the specified command in a separate process. Return its exit value,
4948 // or -1 on failure (e.g. can't fork a new process).
4949 // Unlike system(), this function can be called from signal handler. It
4950 // doesn't block SIGINT et al.
4951 int os::fork_and_exec(char* cmd) {
4952 const char * argv[4] = {"sh", "-c", cmd, NULL};
4954 // fork() in LinuxThreads/NPTL is not async-safe. It needs to run
4955 // pthread_atfork handlers and reset pthread library. All we need is a
4956 // separate process to execve. Make a direct syscall to fork process.
4957 // On IA64 there's no fork syscall, we have to use fork() and hope for
4959 pid_t pid = NOT_IA64(syscall(__NR_fork);)
4966 } else if (pid == 0) {
4969 // execve() in LinuxThreads will call pthread_kill_other_threads_np()
4970 // first to kill every thread on the thread list. Because this list is
4971 // not reset by fork() (see notes above), execve() will instead kill
4972 // every thread in the parent process. We know this is the only thread
4973 // in the new process, so make a system call directly.
4974 // IA64 should use normal execve() from glibc to match the glibc fork()
4976 NOT_IA64(syscall(__NR_execve, "/bin/sh", argv, environ);)
4977 IA64_ONLY(execve("/bin/sh", (char* const*)argv, environ);)
4983 // copied from J2SE ..._waitForProcessExit() in UNIXProcess_md.c; we don't
4984 // care about the actual exit code, for now.
4988 // Wait for the child process to exit. This returns immediately if
4989 // the child has already exited. */
4990 while (waitpid(pid, &status, 0) < 0) {
4992 case ECHILD: return 0;
4998 if (WIFEXITED(status)) {
4999 // The child exited normally; get its exit code.
5000 return WEXITSTATUS(status);
5001 } else if (WIFSIGNALED(status)) {
5002 // The child exited because of a signal
5003 // The best value to return is 0x80 + signal number,
5004 // because that is what all Unix shells do, and because
5005 // it allows callers to distinguish between process exit and
5006 // process death by signal.
5007 return 0x80 + WTERMSIG(status);
5009 // Unknown exit code; pass it through
5015 // is_headless_jre()
5017 // Test for the existence of libmawt in motif21 or xawt directories
5018 // in order to report if we are running in a headless jre
5020 bool os::is_headless_jre() {
5021 struct stat statbuf;
5022 char buf[MAXPATHLEN];
5023 char libmawtpath[MAXPATHLEN];
5024 const char *xawtstr = "/xawt/libmawt.so";
5025 const char *motifstr = "/motif21/libmawt.so";
5028 // Get path to libjvm.so
5029 os::jvm_path(buf, sizeof(buf));
5031 // Get rid of libjvm.so
5032 p = strrchr(buf, '/');
5033 if (p == NULL) return false;
5036 // Get rid of client or server
5037 p = strrchr(buf, '/');
5038 if (p == NULL) return false;
5041 // check xawt/libmawt.so
5042 strcpy(libmawtpath, buf);
5043 strcat(libmawtpath, xawtstr);
5044 if (::stat(libmawtpath, &statbuf) == 0) return false;
5046 // check motif21/libmawt.so
5047 strcpy(libmawtpath, buf);
5048 strcat(libmawtpath, motifstr);
5049 if (::stat(libmawtpath, &statbuf) == 0) return false;