duke@435: /* duke@435: * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * duke@435: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@435: * CA 95054 USA or visit www.sun.com if you need additional information or duke@435: * have any questions. duke@435: * duke@435: */ duke@435: duke@435: // do not include precompiled header file duke@435: # include "incls/_os_solaris.cpp.incl" duke@435: duke@435: // put OS-includes here duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include // for elf Sym structure used by dladdr1 duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: # include duke@435: duke@435: # define _STRUCTURED_PROC 1 // this gets us the new structured proc interfaces of 5.6 & later duke@435: # include // see comment in duke@435: duke@435: #define MAX_PATH (2 * K) duke@435: duke@435: // for timer info max values which include all bits duke@435: #define ALL_64_BITS CONST64(0xFFFFFFFFFFFFFFFF) duke@435: duke@435: #ifdef _GNU_SOURCE duke@435: // See bug #6514594 duke@435: extern "C" int madvise(caddr_t, size_t, int); duke@435: extern "C" int memcntl(caddr_t addr, size_t len, int cmd, caddr_t arg, duke@435: int attr, int mask); duke@435: #endif //_GNU_SOURCE duke@435: duke@435: /* duke@435: MPSS Changes Start. duke@435: The JVM binary needs to be built and run on pre-Solaris 9 duke@435: systems, but the constants needed by MPSS are only in Solaris 9 duke@435: header files. They are textually replicated here to allow duke@435: building on earlier systems. Once building on Solaris 8 is duke@435: no longer a requirement, these #defines can be replaced by ordinary duke@435: system .h inclusion. duke@435: duke@435: In earlier versions of the JDK and Solaris, we used ISM for large pages. duke@435: But ISM requires shared memory to achieve this and thus has many caveats. duke@435: MPSS is a fully transparent and is a cleaner way to get large pages. duke@435: Although we still require keeping ISM for backward compatiblitiy as well as duke@435: giving the opportunity to use large pages on older systems it is duke@435: recommended that MPSS be used for Solaris 9 and above. duke@435: duke@435: */ duke@435: duke@435: #ifndef MC_HAT_ADVISE duke@435: duke@435: struct memcntl_mha { duke@435: uint_t mha_cmd; /* command(s) */ duke@435: uint_t mha_flags; duke@435: size_t mha_pagesize; duke@435: }; duke@435: #define MC_HAT_ADVISE 7 /* advise hat map size */ duke@435: #define MHA_MAPSIZE_VA 0x1 /* set preferred page size */ duke@435: #define MAP_ALIGN 0x200 /* addr specifies alignment */ duke@435: duke@435: #endif duke@435: // MPSS Changes End. duke@435: duke@435: duke@435: // Here are some liblgrp types from sys/lgrp_user.h to be able to duke@435: // compile on older systems without this header file. duke@435: duke@435: #ifndef MADV_ACCESS_LWP duke@435: # define MADV_ACCESS_LWP 7 /* next LWP to access heavily */ duke@435: #endif duke@435: #ifndef MADV_ACCESS_MANY duke@435: # define MADV_ACCESS_MANY 8 /* many processes to access heavily */ duke@435: #endif duke@435: iveresov@579: #ifndef LGRP_RSRC_CPU iveresov@579: # define LGRP_RSRC_CPU 0 /* CPU resources */ iveresov@579: #endif iveresov@579: #ifndef LGRP_RSRC_MEM iveresov@579: # define LGRP_RSRC_MEM 1 /* memory resources */ iveresov@579: #endif iveresov@579: duke@435: // Some more macros from sys/mman.h that are not present in Solaris 8. duke@435: duke@435: #ifndef MAX_MEMINFO_CNT duke@435: /* duke@435: * info_req request type definitions for meminfo duke@435: * request types starting with MEMINFO_V are used for Virtual addresses duke@435: * and should not be mixed with MEMINFO_PLGRP which is targeted for Physical duke@435: * addresses duke@435: */ duke@435: # define MEMINFO_SHIFT 16 duke@435: # define MEMINFO_MASK (0xFF << MEMINFO_SHIFT) duke@435: # define MEMINFO_VPHYSICAL (0x01 << MEMINFO_SHIFT) /* get physical addr */ duke@435: # define MEMINFO_VLGRP (0x02 << MEMINFO_SHIFT) /* get lgroup */ duke@435: # define MEMINFO_VPAGESIZE (0x03 << MEMINFO_SHIFT) /* size of phys page */ duke@435: # define MEMINFO_VREPLCNT (0x04 << MEMINFO_SHIFT) /* no. of replica */ duke@435: # define MEMINFO_VREPL (0x05 << MEMINFO_SHIFT) /* physical replica */ duke@435: # define MEMINFO_VREPL_LGRP (0x06 << MEMINFO_SHIFT) /* lgrp of replica */ duke@435: # define MEMINFO_PLGRP (0x07 << MEMINFO_SHIFT) /* lgroup for paddr */ duke@435: duke@435: /* maximum number of addresses meminfo() can process at a time */ duke@435: # define MAX_MEMINFO_CNT 256 duke@435: duke@435: /* maximum number of request types */ duke@435: # define MAX_MEMINFO_REQ 31 duke@435: #endif duke@435: duke@435: // see thr_setprio(3T) for the basis of these numbers duke@435: #define MinimumPriority 0 duke@435: #define NormalPriority 64 duke@435: #define MaximumPriority 127 duke@435: duke@435: // Values for ThreadPriorityPolicy == 1 duke@435: int prio_policy1[MaxPriority+1] = { -99999, 0, 16, 32, 48, 64, duke@435: 80, 96, 112, 124, 127 }; duke@435: duke@435: // System parameters used internally duke@435: static clock_t clock_tics_per_sec = 100; duke@435: duke@435: // For diagnostics to print a message once. see run_periodic_checks duke@435: static bool check_addr0_done = false; duke@435: static sigset_t check_signal_done; duke@435: static bool check_signals = true; duke@435: duke@435: address os::Solaris::handler_start; // start pc of thr_sighndlrinfo duke@435: address os::Solaris::handler_end; // end pc of thr_sighndlrinfo duke@435: duke@435: address os::Solaris::_main_stack_base = NULL; // 4352906 workaround duke@435: duke@435: duke@435: // "default" initializers for missing libc APIs duke@435: extern "C" { duke@435: static int lwp_mutex_init(mutex_t *mx, int scope, void *arg) { memset(mx, 0, sizeof(mutex_t)); return 0; } duke@435: static int lwp_mutex_destroy(mutex_t *mx) { return 0; } duke@435: duke@435: static int lwp_cond_init(cond_t *cv, int scope, void *arg){ memset(cv, 0, sizeof(cond_t)); return 0; } duke@435: static int lwp_cond_destroy(cond_t *cv) { return 0; } duke@435: } duke@435: duke@435: // "default" initializers for pthread-based synchronization duke@435: extern "C" { duke@435: static int pthread_mutex_default_init(mutex_t *mx, int scope, void *arg) { memset(mx, 0, sizeof(mutex_t)); return 0; } duke@435: static int pthread_cond_default_init(cond_t *cv, int scope, void *arg){ memset(cv, 0, sizeof(cond_t)); return 0; } duke@435: } duke@435: duke@435: // Thread Local Storage duke@435: // This is common to all Solaris platforms so it is defined here, duke@435: // in this common file. duke@435: // The declarations are in the os_cpu threadLS*.hpp files. duke@435: // duke@435: // Static member initialization for TLS duke@435: Thread* ThreadLocalStorage::_get_thread_cache[ThreadLocalStorage::_pd_cache_size] = {NULL}; duke@435: duke@435: #ifndef PRODUCT duke@435: #define _PCT(n,d) ((100.0*(double)(n))/(double)(d)) duke@435: duke@435: int ThreadLocalStorage::_tcacheHit = 0; duke@435: int ThreadLocalStorage::_tcacheMiss = 0; duke@435: duke@435: void ThreadLocalStorage::print_statistics() { duke@435: int total = _tcacheMiss+_tcacheHit; duke@435: tty->print_cr("Thread cache hits %d misses %d total %d percent %f\n", duke@435: _tcacheHit, _tcacheMiss, total, _PCT(_tcacheHit, total)); duke@435: } duke@435: #undef _PCT duke@435: #endif // PRODUCT duke@435: duke@435: Thread* ThreadLocalStorage::get_thread_via_cache_slowly(uintptr_t raw_id, duke@435: int index) { duke@435: Thread *thread = get_thread_slow(); duke@435: if (thread != NULL) { duke@435: address sp = os::current_stack_pointer(); duke@435: guarantee(thread->_stack_base == NULL || duke@435: (sp <= thread->_stack_base && duke@435: sp >= thread->_stack_base - thread->_stack_size) || duke@435: is_error_reported(), duke@435: "sp must be inside of selected thread stack"); duke@435: duke@435: thread->_self_raw_id = raw_id; // mark for quick retrieval duke@435: _get_thread_cache[ index ] = thread; duke@435: } duke@435: return thread; duke@435: } duke@435: duke@435: duke@435: static const double all_zero[ sizeof(Thread) / sizeof(double) + 1 ] = {0}; duke@435: #define NO_CACHED_THREAD ((Thread*)all_zero) duke@435: duke@435: void ThreadLocalStorage::pd_set_thread(Thread* thread) { duke@435: duke@435: // Store the new value before updating the cache to prevent a race duke@435: // between get_thread_via_cache_slowly() and this store operation. duke@435: os::thread_local_storage_at_put(ThreadLocalStorage::thread_index(), thread); duke@435: duke@435: // Update thread cache with new thread if setting on thread create, duke@435: // or NO_CACHED_THREAD (zeroed) thread if resetting thread on exit. duke@435: uintptr_t raw = pd_raw_thread_id(); duke@435: int ix = pd_cache_index(raw); duke@435: _get_thread_cache[ix] = thread == NULL ? NO_CACHED_THREAD : thread; duke@435: } duke@435: duke@435: void ThreadLocalStorage::pd_init() { duke@435: for (int i = 0; i < _pd_cache_size; i++) { duke@435: _get_thread_cache[i] = NO_CACHED_THREAD; duke@435: } duke@435: } duke@435: duke@435: // Invalidate all the caches (happens to be the same as pd_init). duke@435: void ThreadLocalStorage::pd_invalidate_all() { pd_init(); } duke@435: duke@435: #undef NO_CACHED_THREAD duke@435: duke@435: // END Thread Local Storage duke@435: duke@435: static inline size_t adjust_stack_size(address base, size_t size) { duke@435: if ((ssize_t)size < 0) { duke@435: // 4759953: Compensate for ridiculous stack size. duke@435: size = max_intx; duke@435: } duke@435: if (size > (size_t)base) { duke@435: // 4812466: Make sure size doesn't allow the stack to wrap the address space. duke@435: size = (size_t)base; duke@435: } duke@435: return size; duke@435: } duke@435: duke@435: static inline stack_t get_stack_info() { duke@435: stack_t st; duke@435: int retval = thr_stksegment(&st); duke@435: st.ss_size = adjust_stack_size((address)st.ss_sp, st.ss_size); duke@435: assert(retval == 0, "incorrect return value from thr_stksegment"); duke@435: assert((address)&st < (address)st.ss_sp, "Invalid stack base returned"); duke@435: assert((address)&st > (address)st.ss_sp-st.ss_size, "Invalid stack size returned"); duke@435: return st; duke@435: } duke@435: duke@435: address os::current_stack_base() { duke@435: int r = thr_main() ; duke@435: guarantee (r == 0 || r == 1, "CR6501650 or CR6493689") ; duke@435: bool is_primordial_thread = r; duke@435: duke@435: // Workaround 4352906, avoid calls to thr_stksegment by duke@435: // thr_main after the first one (it looks like we trash duke@435: // some data, causing the value for ss_sp to be incorrect). duke@435: if (!is_primordial_thread || os::Solaris::_main_stack_base == NULL) { duke@435: stack_t st = get_stack_info(); duke@435: if (is_primordial_thread) { duke@435: // cache initial value of stack base duke@435: os::Solaris::_main_stack_base = (address)st.ss_sp; duke@435: } duke@435: return (address)st.ss_sp; duke@435: } else { duke@435: guarantee(os::Solaris::_main_stack_base != NULL, "Attempt to use null cached stack base"); duke@435: return os::Solaris::_main_stack_base; duke@435: } duke@435: } duke@435: duke@435: size_t os::current_stack_size() { duke@435: size_t size; duke@435: duke@435: int r = thr_main() ; duke@435: guarantee (r == 0 || r == 1, "CR6501650 or CR6493689") ; duke@435: if(!r) { duke@435: size = get_stack_info().ss_size; duke@435: } else { duke@435: struct rlimit limits; duke@435: getrlimit(RLIMIT_STACK, &limits); duke@435: size = adjust_stack_size(os::Solaris::_main_stack_base, (size_t)limits.rlim_cur); duke@435: } duke@435: // base may not be page aligned duke@435: address base = current_stack_base(); duke@435: address bottom = (address)align_size_up((intptr_t)(base - size), os::vm_page_size());; duke@435: return (size_t)(base - bottom); duke@435: } duke@435: duke@435: // interruptible infrastructure duke@435: duke@435: // setup_interruptible saves the thread state before going into an duke@435: // interruptible system call. duke@435: // The saved state is used to restore the thread to duke@435: // its former state whether or not an interrupt is received. duke@435: // Used by classloader os::read duke@435: // hpi calls skip this layer and stay in _thread_in_native duke@435: duke@435: void os::Solaris::setup_interruptible(JavaThread* thread) { duke@435: duke@435: JavaThreadState thread_state = thread->thread_state(); duke@435: duke@435: assert(thread_state != _thread_blocked, "Coming from the wrong thread"); duke@435: assert(thread_state != _thread_in_native, "Native threads skip setup_interruptible"); duke@435: OSThread* osthread = thread->osthread(); duke@435: osthread->set_saved_interrupt_thread_state(thread_state); duke@435: thread->frame_anchor()->make_walkable(thread); duke@435: ThreadStateTransition::transition(thread, thread_state, _thread_blocked); duke@435: } duke@435: duke@435: // Version of setup_interruptible() for threads that are already in duke@435: // _thread_blocked. Used by os_sleep(). duke@435: void os::Solaris::setup_interruptible_already_blocked(JavaThread* thread) { duke@435: thread->frame_anchor()->make_walkable(thread); duke@435: } duke@435: duke@435: JavaThread* os::Solaris::setup_interruptible() { duke@435: JavaThread* thread = (JavaThread*)ThreadLocalStorage::thread(); duke@435: setup_interruptible(thread); duke@435: return thread; duke@435: } duke@435: duke@435: void os::Solaris::try_enable_extended_io() { duke@435: typedef int (*enable_extended_FILE_stdio_t)(int, int); duke@435: duke@435: if (!UseExtendedFileIO) { duke@435: return; duke@435: } duke@435: duke@435: enable_extended_FILE_stdio_t enabler = duke@435: (enable_extended_FILE_stdio_t) dlsym(RTLD_DEFAULT, duke@435: "enable_extended_FILE_stdio"); duke@435: if (enabler) { duke@435: enabler(-1, -1); duke@435: } duke@435: } duke@435: duke@435: duke@435: #ifdef ASSERT duke@435: duke@435: JavaThread* os::Solaris::setup_interruptible_native() { duke@435: JavaThread* thread = (JavaThread*)ThreadLocalStorage::thread(); duke@435: JavaThreadState thread_state = thread->thread_state(); duke@435: assert(thread_state == _thread_in_native, "Assumed thread_in_native"); duke@435: return thread; duke@435: } duke@435: duke@435: void os::Solaris::cleanup_interruptible_native(JavaThread* thread) { duke@435: JavaThreadState thread_state = thread->thread_state(); duke@435: assert(thread_state == _thread_in_native, "Assumed thread_in_native"); duke@435: } duke@435: #endif duke@435: duke@435: // cleanup_interruptible reverses the effects of setup_interruptible duke@435: // setup_interruptible_already_blocked() does not need any cleanup. duke@435: duke@435: void os::Solaris::cleanup_interruptible(JavaThread* thread) { duke@435: OSThread* osthread = thread->osthread(); duke@435: duke@435: ThreadStateTransition::transition(thread, _thread_blocked, osthread->saved_interrupt_thread_state()); duke@435: } duke@435: duke@435: // I/O interruption related counters called in _INTERRUPTIBLE duke@435: duke@435: void os::Solaris::bump_interrupted_before_count() { duke@435: RuntimeService::record_interrupted_before_count(); duke@435: } duke@435: duke@435: void os::Solaris::bump_interrupted_during_count() { duke@435: RuntimeService::record_interrupted_during_count(); duke@435: } duke@435: duke@435: static int _processors_online = 0; duke@435: duke@435: jint os::Solaris::_os_thread_limit = 0; duke@435: volatile jint os::Solaris::_os_thread_count = 0; duke@435: duke@435: julong os::available_memory() { duke@435: return Solaris::available_memory(); duke@435: } duke@435: duke@435: julong os::Solaris::available_memory() { duke@435: return (julong)sysconf(_SC_AVPHYS_PAGES) * os::vm_page_size(); duke@435: } duke@435: duke@435: julong os::Solaris::_physical_memory = 0; duke@435: duke@435: julong os::physical_memory() { duke@435: return Solaris::physical_memory(); duke@435: } duke@435: duke@435: julong os::allocatable_physical_memory(julong size) { duke@435: #ifdef _LP64 duke@435: return size; duke@435: #else duke@435: julong result = MIN2(size, (julong)3835*M); duke@435: if (!is_allocatable(result)) { duke@435: // Memory allocations will be aligned but the alignment duke@435: // is not known at this point. Alignments will duke@435: // be at most to LargePageSizeInBytes. Protect duke@435: // allocations from alignments up to illegal duke@435: // values. If at this point 2G is illegal. duke@435: julong reasonable_size = (julong)2*G - 2 * LargePageSizeInBytes; duke@435: result = MIN2(size, reasonable_size); duke@435: } duke@435: return result; duke@435: #endif duke@435: } duke@435: duke@435: static hrtime_t first_hrtime = 0; duke@435: static const hrtime_t hrtime_hz = 1000*1000*1000; duke@435: const int LOCK_BUSY = 1; duke@435: const int LOCK_FREE = 0; duke@435: const int LOCK_INVALID = -1; duke@435: static volatile hrtime_t max_hrtime = 0; duke@435: static volatile int max_hrtime_lock = LOCK_FREE; // Update counter with LSB as lock-in-progress duke@435: duke@435: duke@435: void os::Solaris::initialize_system_info() { duke@435: _processor_count = sysconf(_SC_NPROCESSORS_CONF); duke@435: _processors_online = sysconf (_SC_NPROCESSORS_ONLN); duke@435: _physical_memory = (julong)sysconf(_SC_PHYS_PAGES) * (julong)sysconf(_SC_PAGESIZE); duke@435: } duke@435: duke@435: int os::active_processor_count() { duke@435: int online_cpus = sysconf(_SC_NPROCESSORS_ONLN); duke@435: pid_t pid = getpid(); duke@435: psetid_t pset = PS_NONE; duke@435: // Are we running in a processor set? duke@435: if (pset_bind(PS_QUERY, P_PID, pid, &pset) == 0) { duke@435: if (pset != PS_NONE) { duke@435: uint_t pset_cpus; duke@435: // Query number of cpus in processor set duke@435: if (pset_info(pset, NULL, &pset_cpus, NULL) == 0) { duke@435: assert(pset_cpus > 0 && pset_cpus <= online_cpus, "sanity check"); duke@435: _processors_online = pset_cpus; duke@435: return pset_cpus; duke@435: } duke@435: } duke@435: } duke@435: // Otherwise return number of online cpus duke@435: return online_cpus; duke@435: } duke@435: duke@435: static bool find_processors_in_pset(psetid_t pset, duke@435: processorid_t** id_array, duke@435: uint_t* id_length) { duke@435: bool result = false; duke@435: // Find the number of processors in the processor set. duke@435: if (pset_info(pset, NULL, id_length, NULL) == 0) { duke@435: // Make up an array to hold their ids. duke@435: *id_array = NEW_C_HEAP_ARRAY(processorid_t, *id_length); duke@435: // Fill in the array with their processor ids. duke@435: if (pset_info(pset, NULL, id_length, *id_array) == 0) { duke@435: result = true; duke@435: } duke@435: } duke@435: return result; duke@435: } duke@435: duke@435: // Callers of find_processors_online() must tolerate imprecise results -- duke@435: // the system configuration can change asynchronously because of DR duke@435: // or explicit psradm operations. duke@435: // duke@435: // We also need to take care that the loop (below) terminates as the duke@435: // number of processors online can change between the _SC_NPROCESSORS_ONLN duke@435: // request and the loop that builds the list of processor ids. Unfortunately duke@435: // there's no reliable way to determine the maximum valid processor id, duke@435: // so we use a manifest constant, MAX_PROCESSOR_ID, instead. See p_online duke@435: // man pages, which claim the processor id set is "sparse, but duke@435: // not too sparse". MAX_PROCESSOR_ID is used to ensure that we eventually duke@435: // exit the loop. duke@435: // duke@435: // In the future we'll be able to use sysconf(_SC_CPUID_MAX), but that's duke@435: // not available on S8.0. duke@435: duke@435: static bool find_processors_online(processorid_t** id_array, duke@435: uint* id_length) { duke@435: const processorid_t MAX_PROCESSOR_ID = 100000 ; duke@435: // Find the number of processors online. duke@435: *id_length = sysconf(_SC_NPROCESSORS_ONLN); duke@435: // Make up an array to hold their ids. duke@435: *id_array = NEW_C_HEAP_ARRAY(processorid_t, *id_length); duke@435: // Processors need not be numbered consecutively. duke@435: long found = 0; duke@435: processorid_t next = 0; duke@435: while (found < *id_length && next < MAX_PROCESSOR_ID) { duke@435: processor_info_t info; duke@435: if (processor_info(next, &info) == 0) { duke@435: // NB, PI_NOINTR processors are effectively online ... duke@435: if (info.pi_state == P_ONLINE || info.pi_state == P_NOINTR) { duke@435: (*id_array)[found] = next; duke@435: found += 1; duke@435: } duke@435: } duke@435: next += 1; duke@435: } duke@435: if (found < *id_length) { duke@435: // The loop above didn't identify the expected number of processors. duke@435: // We could always retry the operation, calling sysconf(_SC_NPROCESSORS_ONLN) duke@435: // and re-running the loop, above, but there's no guarantee of progress duke@435: // if the system configuration is in flux. Instead, we just return what duke@435: // we've got. Note that in the worst case find_processors_online() could duke@435: // return an empty set. (As a fall-back in the case of the empty set we duke@435: // could just return the ID of the current processor). duke@435: *id_length = found ; duke@435: } duke@435: duke@435: return true; duke@435: } duke@435: duke@435: static bool assign_distribution(processorid_t* id_array, duke@435: uint id_length, duke@435: uint* distribution, duke@435: uint distribution_length) { duke@435: // We assume we can assign processorid_t's to uint's. duke@435: assert(sizeof(processorid_t) == sizeof(uint), duke@435: "can't convert processorid_t to uint"); duke@435: // Quick check to see if we won't succeed. duke@435: if (id_length < distribution_length) { duke@435: return false; duke@435: } duke@435: // Assign processor ids to the distribution. duke@435: // Try to shuffle processors to distribute work across boards, duke@435: // assuming 4 processors per board. duke@435: const uint processors_per_board = ProcessDistributionStride; duke@435: // Find the maximum processor id. duke@435: processorid_t max_id = 0; duke@435: for (uint m = 0; m < id_length; m += 1) { duke@435: max_id = MAX2(max_id, id_array[m]); duke@435: } duke@435: // The next id, to limit loops. duke@435: const processorid_t limit_id = max_id + 1; duke@435: // Make up markers for available processors. duke@435: bool* available_id = NEW_C_HEAP_ARRAY(bool, limit_id); duke@435: for (uint c = 0; c < limit_id; c += 1) { duke@435: available_id[c] = false; duke@435: } duke@435: for (uint a = 0; a < id_length; a += 1) { duke@435: available_id[id_array[a]] = true; duke@435: } duke@435: // Step by "boards", then by "slot", copying to "assigned". duke@435: // NEEDS_CLEANUP: The assignment of processors should be stateful, duke@435: // remembering which processors have been assigned by duke@435: // previous calls, etc., so as to distribute several duke@435: // independent calls of this method. What we'd like is duke@435: // It would be nice to have an API that let us ask duke@435: // how many processes are bound to a processor, duke@435: // but we don't have that, either. duke@435: // In the short term, "board" is static so that duke@435: // subsequent distributions don't all start at board 0. duke@435: static uint board = 0; duke@435: uint assigned = 0; duke@435: // Until we've found enough processors .... duke@435: while (assigned < distribution_length) { duke@435: // ... find the next available processor in the board. duke@435: for (uint slot = 0; slot < processors_per_board; slot += 1) { duke@435: uint try_id = board * processors_per_board + slot; duke@435: if ((try_id < limit_id) && (available_id[try_id] == true)) { duke@435: distribution[assigned] = try_id; duke@435: available_id[try_id] = false; duke@435: assigned += 1; duke@435: break; duke@435: } duke@435: } duke@435: board += 1; duke@435: if (board * processors_per_board + 0 >= limit_id) { duke@435: board = 0; duke@435: } duke@435: } duke@435: if (available_id != NULL) { duke@435: FREE_C_HEAP_ARRAY(bool, available_id); duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: bool os::distribute_processes(uint length, uint* distribution) { duke@435: bool result = false; duke@435: // Find the processor id's of all the available CPUs. duke@435: processorid_t* id_array = NULL; duke@435: uint id_length = 0; duke@435: // There are some races between querying information and using it, duke@435: // since processor sets can change dynamically. duke@435: psetid_t pset = PS_NONE; duke@435: // Are we running in a processor set? duke@435: if ((pset_bind(PS_QUERY, P_PID, P_MYID, &pset) == 0) && pset != PS_NONE) { duke@435: result = find_processors_in_pset(pset, &id_array, &id_length); duke@435: } else { duke@435: result = find_processors_online(&id_array, &id_length); duke@435: } duke@435: if (result == true) { duke@435: if (id_length >= length) { duke@435: result = assign_distribution(id_array, id_length, distribution, length); duke@435: } else { duke@435: result = false; duke@435: } duke@435: } duke@435: if (id_array != NULL) { duke@435: FREE_C_HEAP_ARRAY(processorid_t, id_array); duke@435: } duke@435: return result; duke@435: } duke@435: duke@435: bool os::bind_to_processor(uint processor_id) { duke@435: // We assume that a processorid_t can be stored in a uint. duke@435: assert(sizeof(uint) == sizeof(processorid_t), duke@435: "can't convert uint to processorid_t"); duke@435: int bind_result = duke@435: processor_bind(P_LWPID, // bind LWP. duke@435: P_MYID, // bind current LWP. duke@435: (processorid_t) processor_id, // id. duke@435: NULL); // don't return old binding. duke@435: return (bind_result == 0); duke@435: } duke@435: duke@435: bool os::getenv(const char* name, char* buffer, int len) { duke@435: char* val = ::getenv( name ); duke@435: if ( val == NULL duke@435: || strlen(val) + 1 > len ) { duke@435: if (len > 0) buffer[0] = 0; // return a null string duke@435: return false; duke@435: } duke@435: strcpy( buffer, val ); duke@435: return true; duke@435: } duke@435: duke@435: duke@435: // Return true if user is running as root. duke@435: duke@435: bool os::have_special_privileges() { duke@435: static bool init = false; duke@435: static bool privileges = false; duke@435: if (!init) { duke@435: privileges = (getuid() != geteuid()) || (getgid() != getegid()); duke@435: init = true; duke@435: } duke@435: return privileges; duke@435: } duke@435: duke@435: duke@435: static char* get_property(char* name, char* buffer, int buffer_size) { duke@435: if (os::getenv(name, buffer, buffer_size)) { duke@435: return buffer; duke@435: } duke@435: static char empty[] = ""; duke@435: return empty; duke@435: } duke@435: duke@435: duke@435: void os::init_system_properties_values() { duke@435: char arch[12]; duke@435: sysinfo(SI_ARCHITECTURE, arch, sizeof(arch)); duke@435: duke@435: // The next steps are taken in the product version: duke@435: // duke@435: // Obtain the JAVA_HOME value from the location of libjvm[_g].so. duke@435: // This library should be located at: duke@435: // /jre/lib//{client|server}/libjvm[_g].so. duke@435: // duke@435: // If "/jre/lib/" appears at the right place in the path, then we duke@435: // assume libjvm[_g].so is installed in a JDK and we use this path. duke@435: // duke@435: // Otherwise exit with message: "Could not create the Java virtual machine." duke@435: // duke@435: // The following extra steps are taken in the debugging version: duke@435: // duke@435: // If "/jre/lib/" does NOT appear at the right place in the path duke@435: // instead of exit check for $JAVA_HOME environment variable. duke@435: // duke@435: // If it is defined and we are able to locate $JAVA_HOME/jre/lib/, duke@435: // then we append a fake suffix "hotspot/libjvm[_g].so" to this path so duke@435: // it looks like libjvm[_g].so is installed there duke@435: // /jre/lib//hotspot/libjvm[_g].so. duke@435: // duke@435: // Otherwise exit. duke@435: // duke@435: // Important note: if the location of libjvm.so changes this duke@435: // code needs to be changed accordingly. duke@435: duke@435: // The next few definitions allow the code to be verbatim: duke@435: #define malloc(n) (char*)NEW_C_HEAP_ARRAY(char, (n)) duke@435: #define free(p) FREE_C_HEAP_ARRAY(char, p) duke@435: #define getenv(n) ::getenv(n) duke@435: duke@435: #define EXTENSIONS_DIR "/lib/ext" duke@435: #define ENDORSED_DIR "/lib/endorsed" duke@435: #define COMMON_DIR "/usr/jdk/packages" duke@435: duke@435: { duke@435: /* sysclasspath, java_home, dll_dir */ duke@435: { duke@435: char *home_path; duke@435: char *dll_path; duke@435: char *pslash; duke@435: char buf[MAXPATHLEN]; duke@435: os::jvm_path(buf, sizeof(buf)); duke@435: duke@435: // Found the full path to libjvm.so. duke@435: // Now cut the path to /jre if we can. duke@435: *(strrchr(buf, '/')) = '\0'; /* get rid of /libjvm.so */ duke@435: pslash = strrchr(buf, '/'); duke@435: if (pslash != NULL) duke@435: *pslash = '\0'; /* get rid of /{client|server|hotspot} */ duke@435: dll_path = malloc(strlen(buf) + 1); duke@435: if (dll_path == NULL) duke@435: return; duke@435: strcpy(dll_path, buf); duke@435: Arguments::set_dll_dir(dll_path); duke@435: duke@435: if (pslash != NULL) { duke@435: pslash = strrchr(buf, '/'); duke@435: if (pslash != NULL) { duke@435: *pslash = '\0'; /* get rid of / */ duke@435: pslash = strrchr(buf, '/'); duke@435: if (pslash != NULL) duke@435: *pslash = '\0'; /* get rid of /lib */ duke@435: } duke@435: } duke@435: duke@435: home_path = malloc(strlen(buf) + 1); duke@435: if (home_path == NULL) duke@435: return; duke@435: strcpy(home_path, buf); duke@435: Arguments::set_java_home(home_path); duke@435: duke@435: if (!set_boot_path('/', ':')) duke@435: return; duke@435: } duke@435: duke@435: /* duke@435: * Where to look for native libraries duke@435: */ duke@435: { duke@435: // Use dlinfo() to determine the correct java.library.path. duke@435: // duke@435: // If we're launched by the Java launcher, and the user duke@435: // does not set java.library.path explicitly on the commandline, duke@435: // the Java launcher sets LD_LIBRARY_PATH for us and unsets duke@435: // LD_LIBRARY_PATH_32 and LD_LIBRARY_PATH_64. In this case duke@435: // dlinfo returns LD_LIBRARY_PATH + crle settings (including duke@435: // /usr/lib), which is exactly what we want. duke@435: // duke@435: // If the user does set java.library.path, it completely duke@435: // overwrites this setting, and always has. duke@435: // duke@435: // If we're not launched by the Java launcher, we may duke@435: // get here with any/all of the LD_LIBRARY_PATH[_32|64] duke@435: // settings. Again, dlinfo does exactly what we want. duke@435: duke@435: Dl_serinfo _info, *info = &_info; duke@435: Dl_serpath *path; duke@435: char* library_path; duke@435: char *common_path; duke@435: int i; duke@435: duke@435: // determine search path count and required buffer size duke@435: if (dlinfo(RTLD_SELF, RTLD_DI_SERINFOSIZE, (void *)info) == -1) { duke@435: vm_exit_during_initialization("dlinfo SERINFOSIZE request", dlerror()); duke@435: } duke@435: duke@435: // allocate new buffer and initialize duke@435: info = (Dl_serinfo*)malloc(_info.dls_size); duke@435: if (info == NULL) { duke@435: vm_exit_out_of_memory(_info.dls_size, duke@435: "init_system_properties_values info"); duke@435: } duke@435: info->dls_size = _info.dls_size; duke@435: info->dls_cnt = _info.dls_cnt; duke@435: duke@435: // obtain search path information duke@435: if (dlinfo(RTLD_SELF, RTLD_DI_SERINFO, (void *)info) == -1) { duke@435: free(info); duke@435: vm_exit_during_initialization("dlinfo SERINFO request", dlerror()); duke@435: } duke@435: duke@435: path = &info->dls_serpath[0]; duke@435: duke@435: // Note: Due to a legacy implementation, most of the library path duke@435: // is set in the launcher. This was to accomodate linking restrictions duke@435: // on legacy Solaris implementations (which are no longer supported). duke@435: // Eventually, all the library path setting will be done here. duke@435: // duke@435: // However, to prevent the proliferation of improperly built native duke@435: // libraries, the new path component /usr/jdk/packages is added here. duke@435: duke@435: // Determine the actual CPU architecture. duke@435: char cpu_arch[12]; duke@435: sysinfo(SI_ARCHITECTURE, cpu_arch, sizeof(cpu_arch)); duke@435: #ifdef _LP64 duke@435: // If we are a 64-bit vm, perform the following translations: duke@435: // sparc -> sparcv9 duke@435: // i386 -> amd64 duke@435: if (strcmp(cpu_arch, "sparc") == 0) duke@435: strcat(cpu_arch, "v9"); duke@435: else if (strcmp(cpu_arch, "i386") == 0) duke@435: strcpy(cpu_arch, "amd64"); duke@435: #endif duke@435: duke@435: // Construct the invariant part of ld_library_path. Note that the duke@435: // space for the colon and the trailing null are provided by the duke@435: // nulls included by the sizeof operator. duke@435: size_t bufsize = sizeof(COMMON_DIR) + sizeof("/lib/") + strlen(cpu_arch); duke@435: common_path = malloc(bufsize); duke@435: if (common_path == NULL) { duke@435: free(info); duke@435: vm_exit_out_of_memory(bufsize, duke@435: "init_system_properties_values common_path"); duke@435: } duke@435: sprintf(common_path, COMMON_DIR "/lib/%s", cpu_arch); duke@435: duke@435: // struct size is more than sufficient for the path components obtained duke@435: // through the dlinfo() call, so only add additional space for the path duke@435: // components explicitly added here. duke@435: bufsize = info->dls_size + strlen(common_path); duke@435: library_path = malloc(bufsize); duke@435: if (library_path == NULL) { duke@435: free(info); duke@435: free(common_path); duke@435: vm_exit_out_of_memory(bufsize, duke@435: "init_system_properties_values library_path"); duke@435: } duke@435: library_path[0] = '\0'; duke@435: duke@435: // Construct the desired Java library path from the linker's library duke@435: // search path. duke@435: // duke@435: // For compatibility, it is optimal that we insert the additional path duke@435: // components specific to the Java VM after those components specified duke@435: // in LD_LIBRARY_PATH (if any) but before those added by the ld.so duke@435: // infrastructure. duke@435: if (info->dls_cnt == 0) { // Not sure this can happen, but allow for it duke@435: strcpy(library_path, common_path); duke@435: } else { duke@435: int inserted = 0; duke@435: for (i = 0; i < info->dls_cnt; i++, path++) { duke@435: uint_t flags = path->dls_flags & LA_SER_MASK; duke@435: if (((flags & LA_SER_LIBPATH) == 0) && !inserted) { duke@435: strcat(library_path, common_path); duke@435: strcat(library_path, os::path_separator()); duke@435: inserted = 1; duke@435: } duke@435: strcat(library_path, path->dls_name); duke@435: strcat(library_path, os::path_separator()); duke@435: } duke@435: // eliminate trailing path separator duke@435: library_path[strlen(library_path)-1] = '\0'; duke@435: } duke@435: duke@435: // happens before argument parsing - can't use a trace flag duke@435: // tty->print_raw("init_system_properties_values: native lib path: "); duke@435: // tty->print_raw_cr(library_path); duke@435: duke@435: // callee copies into its own buffer duke@435: Arguments::set_library_path(library_path); duke@435: duke@435: free(common_path); duke@435: free(library_path); duke@435: free(info); duke@435: } duke@435: duke@435: /* duke@435: * Extensions directories. duke@435: * duke@435: * Note that the space for the colon and the trailing null are provided duke@435: * by the nulls included by the sizeof operator (so actually one byte more duke@435: * than necessary is allocated). duke@435: */ duke@435: { duke@435: char *buf = (char *) malloc(strlen(Arguments::get_java_home()) + duke@435: sizeof(EXTENSIONS_DIR) + sizeof(COMMON_DIR) + duke@435: sizeof(EXTENSIONS_DIR)); duke@435: sprintf(buf, "%s" EXTENSIONS_DIR ":" COMMON_DIR EXTENSIONS_DIR, duke@435: Arguments::get_java_home()); duke@435: Arguments::set_ext_dirs(buf); duke@435: } duke@435: duke@435: /* Endorsed standards default directory. */ duke@435: { duke@435: char * buf = malloc(strlen(Arguments::get_java_home()) + sizeof(ENDORSED_DIR)); duke@435: sprintf(buf, "%s" ENDORSED_DIR, Arguments::get_java_home()); duke@435: Arguments::set_endorsed_dirs(buf); duke@435: } duke@435: } duke@435: duke@435: #undef malloc duke@435: #undef free duke@435: #undef getenv duke@435: #undef EXTENSIONS_DIR duke@435: #undef ENDORSED_DIR duke@435: #undef COMMON_DIR duke@435: duke@435: } duke@435: duke@435: void os::breakpoint() { duke@435: BREAKPOINT; duke@435: } duke@435: duke@435: bool os::obsolete_option(const JavaVMOption *option) duke@435: { duke@435: if (!strncmp(option->optionString, "-Xt", 3)) { duke@435: return true; duke@435: } else if (!strncmp(option->optionString, "-Xtm", 4)) { duke@435: return true; duke@435: } else if (!strncmp(option->optionString, "-Xverifyheap", 12)) { duke@435: return true; duke@435: } else if (!strncmp(option->optionString, "-Xmaxjitcodesize", 16)) { duke@435: return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: bool os::Solaris::valid_stack_address(Thread* thread, address sp) { duke@435: address stackStart = (address)thread->stack_base(); duke@435: address stackEnd = (address)(stackStart - (address)thread->stack_size()); duke@435: if (sp < stackStart && sp >= stackEnd ) return true; duke@435: return false; duke@435: } duke@435: duke@435: extern "C" void breakpoint() { duke@435: // use debugger to set breakpoint here duke@435: } duke@435: duke@435: // Returns an estimate of the current stack pointer. Result must be guaranteed to duke@435: // point into the calling threads stack, and be no lower than the current stack duke@435: // pointer. duke@435: address os::current_stack_pointer() { duke@435: volatile int dummy; duke@435: address sp = (address)&dummy + 8; // %%%% need to confirm if this is right duke@435: return sp; duke@435: } duke@435: duke@435: static thread_t main_thread; duke@435: duke@435: // Thread start routine for all new Java threads duke@435: extern "C" void* java_start(void* thread_addr) { duke@435: // Try to randomize the cache line index of hot stack frames. duke@435: // This helps when threads of the same stack traces evict each other's duke@435: // cache lines. The threads can be either from the same JVM instance, or duke@435: // from different JVM instances. The benefit is especially true for duke@435: // processors with hyperthreading technology. duke@435: static int counter = 0; duke@435: int pid = os::current_process_id(); duke@435: alloca(((pid ^ counter++) & 7) * 128); duke@435: duke@435: int prio; duke@435: Thread* thread = (Thread*)thread_addr; duke@435: OSThread* osthr = thread->osthread(); duke@435: duke@435: osthr->set_lwp_id( _lwp_self() ); // Store lwp in case we are bound duke@435: thread->_schedctl = (void *) schedctl_init () ; duke@435: duke@435: if (UseNUMA) { duke@435: int lgrp_id = os::numa_get_group_id(); duke@435: if (lgrp_id != -1) { duke@435: thread->set_lgrp_id(lgrp_id); duke@435: } duke@435: } duke@435: duke@435: // If the creator called set priority before we started, duke@435: // we need to call set priority now that we have an lwp. duke@435: // Get the priority from libthread and set the priority duke@435: // for the new Solaris lwp. duke@435: if ( osthr->thread_id() != -1 ) { duke@435: if ( UseThreadPriorities ) { duke@435: thr_getprio(osthr->thread_id(), &prio); duke@435: if (ThreadPriorityVerbose) { duke@435: tty->print_cr("Starting Thread " INTPTR_FORMAT ", LWP is " INTPTR_FORMAT ", setting priority: %d\n", duke@435: osthr->thread_id(), osthr->lwp_id(), prio ); duke@435: } duke@435: os::set_native_priority(thread, prio); duke@435: } duke@435: } else if (ThreadPriorityVerbose) { duke@435: warning("Can't set priority in _start routine, thread id hasn't been set\n"); duke@435: } duke@435: duke@435: assert(osthr->get_state() == RUNNABLE, "invalid os thread state"); duke@435: duke@435: // initialize signal mask for this thread duke@435: os::Solaris::hotspot_sigmask(thread); duke@435: duke@435: thread->run(); duke@435: duke@435: // One less thread is executing duke@435: // When the VMThread gets here, the main thread may have already exited duke@435: // which frees the CodeHeap containing the Atomic::dec code duke@435: if (thread != VMThread::vm_thread() && VMThread::vm_thread() != NULL) { duke@435: Atomic::dec(&os::Solaris::_os_thread_count); duke@435: } duke@435: duke@435: if (UseDetachedThreads) { duke@435: thr_exit(NULL); duke@435: ShouldNotReachHere(); duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: static OSThread* create_os_thread(Thread* thread, thread_t thread_id) { duke@435: // Allocate the OSThread object duke@435: OSThread* osthread = new OSThread(NULL, NULL); duke@435: if (osthread == NULL) return NULL; duke@435: duke@435: // Store info on the Solaris thread into the OSThread duke@435: osthread->set_thread_id(thread_id); duke@435: osthread->set_lwp_id(_lwp_self()); duke@435: thread->_schedctl = (void *) schedctl_init () ; duke@435: duke@435: if (UseNUMA) { duke@435: int lgrp_id = os::numa_get_group_id(); duke@435: if (lgrp_id != -1) { duke@435: thread->set_lgrp_id(lgrp_id); duke@435: } duke@435: } duke@435: duke@435: if ( ThreadPriorityVerbose ) { duke@435: tty->print_cr("In create_os_thread, Thread " INTPTR_FORMAT ", LWP is " INTPTR_FORMAT "\n", duke@435: osthread->thread_id(), osthread->lwp_id() ); duke@435: } duke@435: duke@435: // Initial thread state is INITIALIZED, not SUSPENDED duke@435: osthread->set_state(INITIALIZED); duke@435: duke@435: return osthread; duke@435: } duke@435: duke@435: void os::Solaris::hotspot_sigmask(Thread* thread) { duke@435: duke@435: //Save caller's signal mask duke@435: sigset_t sigmask; duke@435: thr_sigsetmask(SIG_SETMASK, NULL, &sigmask); duke@435: OSThread *osthread = thread->osthread(); duke@435: osthread->set_caller_sigmask(sigmask); duke@435: duke@435: thr_sigsetmask(SIG_UNBLOCK, os::Solaris::unblocked_signals(), NULL); duke@435: if (!ReduceSignalUsage) { duke@435: if (thread->is_VM_thread()) { duke@435: // Only the VM thread handles BREAK_SIGNAL ... duke@435: thr_sigsetmask(SIG_UNBLOCK, vm_signals(), NULL); duke@435: } else { duke@435: // ... all other threads block BREAK_SIGNAL duke@435: assert(!sigismember(vm_signals(), SIGINT), "SIGINT should not be blocked"); duke@435: thr_sigsetmask(SIG_BLOCK, vm_signals(), NULL); duke@435: } duke@435: } duke@435: } duke@435: duke@435: bool os::create_attached_thread(JavaThread* thread) { duke@435: #ifdef ASSERT duke@435: thread->verify_not_published(); duke@435: #endif duke@435: OSThread* osthread = create_os_thread(thread, thr_self()); duke@435: if (osthread == NULL) { duke@435: return false; duke@435: } duke@435: duke@435: // Initial thread state is RUNNABLE duke@435: osthread->set_state(RUNNABLE); duke@435: thread->set_osthread(osthread); duke@435: duke@435: // initialize signal mask for this thread duke@435: // and save the caller's signal mask duke@435: os::Solaris::hotspot_sigmask(thread); duke@435: duke@435: return true; duke@435: } duke@435: duke@435: bool os::create_main_thread(JavaThread* thread) { duke@435: #ifdef ASSERT duke@435: thread->verify_not_published(); duke@435: #endif duke@435: if (_starting_thread == NULL) { duke@435: _starting_thread = create_os_thread(thread, main_thread); duke@435: if (_starting_thread == NULL) { duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: // The primodial thread is runnable from the start duke@435: _starting_thread->set_state(RUNNABLE); duke@435: duke@435: thread->set_osthread(_starting_thread); duke@435: duke@435: // initialize signal mask for this thread duke@435: // and save the caller's signal mask duke@435: os::Solaris::hotspot_sigmask(thread); duke@435: duke@435: return true; duke@435: } duke@435: duke@435: // _T2_libthread is true if we believe we are running with the newer duke@435: // SunSoft lwp/libthread.so (2.8 patch, 2.9 default) duke@435: bool os::Solaris::_T2_libthread = false; duke@435: duke@435: bool os::create_thread(Thread* thread, ThreadType thr_type, size_t stack_size) { duke@435: // Allocate the OSThread object duke@435: OSThread* osthread = new OSThread(NULL, NULL); duke@435: if (osthread == NULL) { duke@435: return false; duke@435: } duke@435: duke@435: if ( ThreadPriorityVerbose ) { duke@435: char *thrtyp; duke@435: switch ( thr_type ) { duke@435: case vm_thread: duke@435: thrtyp = (char *)"vm"; duke@435: break; duke@435: case cgc_thread: duke@435: thrtyp = (char *)"cgc"; duke@435: break; duke@435: case pgc_thread: duke@435: thrtyp = (char *)"pgc"; duke@435: break; duke@435: case java_thread: duke@435: thrtyp = (char *)"java"; duke@435: break; duke@435: case compiler_thread: duke@435: thrtyp = (char *)"compiler"; duke@435: break; duke@435: case watcher_thread: duke@435: thrtyp = (char *)"watcher"; duke@435: break; duke@435: default: duke@435: thrtyp = (char *)"unknown"; duke@435: break; duke@435: } duke@435: tty->print_cr("In create_thread, creating a %s thread\n", thrtyp); duke@435: } duke@435: duke@435: // Calculate stack size if it's not specified by caller. duke@435: if (stack_size == 0) { duke@435: // The default stack size 1M (2M for LP64). duke@435: stack_size = (BytesPerWord >> 2) * K * K; duke@435: duke@435: switch (thr_type) { duke@435: case os::java_thread: duke@435: // Java threads use ThreadStackSize which default value can be changed with the flag -Xss duke@435: if (JavaThread::stack_size_at_create() > 0) stack_size = JavaThread::stack_size_at_create(); duke@435: break; duke@435: case os::compiler_thread: duke@435: if (CompilerThreadStackSize > 0) { duke@435: stack_size = (size_t)(CompilerThreadStackSize * K); duke@435: break; duke@435: } // else fall through: duke@435: // use VMThreadStackSize if CompilerThreadStackSize is not defined duke@435: case os::vm_thread: duke@435: case os::pgc_thread: duke@435: case os::cgc_thread: duke@435: case os::watcher_thread: duke@435: if (VMThreadStackSize > 0) stack_size = (size_t)(VMThreadStackSize * K); duke@435: break; duke@435: } duke@435: } duke@435: stack_size = MAX2(stack_size, os::Solaris::min_stack_allowed); duke@435: duke@435: // Initial state is ALLOCATED but not INITIALIZED duke@435: osthread->set_state(ALLOCATED); duke@435: duke@435: if (os::Solaris::_os_thread_count > os::Solaris::_os_thread_limit) { duke@435: // We got lots of threads. Check if we still have some address space left. duke@435: // Need to be at least 5Mb of unreserved address space. We do check by duke@435: // trying to reserve some. duke@435: const size_t VirtualMemoryBangSize = 20*K*K; duke@435: char* mem = os::reserve_memory(VirtualMemoryBangSize); duke@435: if (mem == NULL) { duke@435: delete osthread; duke@435: return false; duke@435: } else { duke@435: // Release the memory again duke@435: os::release_memory(mem, VirtualMemoryBangSize); duke@435: } duke@435: } duke@435: duke@435: // Setup osthread because the child thread may need it. duke@435: thread->set_osthread(osthread); duke@435: duke@435: // Create the Solaris thread duke@435: // explicit THR_BOUND for T2_libthread case in case duke@435: // that assumption is not accurate, but our alternate signal stack duke@435: // handling is based on it which must have bound threads duke@435: thread_t tid = 0; duke@435: long flags = (UseDetachedThreads ? THR_DETACHED : 0) | THR_SUSPENDED duke@435: | ((UseBoundThreads || os::Solaris::T2_libthread() || duke@435: (thr_type == vm_thread) || duke@435: (thr_type == cgc_thread) || duke@435: (thr_type == pgc_thread) || duke@435: (thr_type == compiler_thread && BackgroundCompilation)) ? duke@435: THR_BOUND : 0); duke@435: int status; duke@435: duke@435: // 4376845 -- libthread/kernel don't provide enough LWPs to utilize all CPUs. duke@435: // duke@435: // On multiprocessors systems, libthread sometimes under-provisions our duke@435: // process with LWPs. On a 30-way systems, for instance, we could have duke@435: // 50 user-level threads in ready state and only 2 or 3 LWPs assigned duke@435: // to our process. This can result in under utilization of PEs. duke@435: // I suspect the problem is related to libthread's LWP duke@435: // pool management and to the kernel's SIGBLOCKING "last LWP parked" duke@435: // upcall policy. duke@435: // duke@435: // The following code is palliative -- it attempts to ensure that our duke@435: // process has sufficient LWPs to take advantage of multiple PEs. duke@435: // Proper long-term cures include using user-level threads bound to LWPs duke@435: // (THR_BOUND) or using LWP-based synchronization. Note that there is a duke@435: // slight timing window with respect to sampling _os_thread_count, but duke@435: // the race is benign. Also, we should periodically recompute duke@435: // _processors_online as the min of SC_NPROCESSORS_ONLN and the duke@435: // the number of PEs in our partition. You might be tempted to use duke@435: // THR_NEW_LWP here, but I'd recommend against it as that could duke@435: // result in undesirable growth of the libthread's LWP pool. duke@435: // The fix below isn't sufficient; for instance, it doesn't take into count duke@435: // LWPs parked on IO. It does, however, help certain CPU-bound benchmarks. duke@435: // duke@435: // Some pathologies this scheme doesn't handle: duke@435: // * Threads can block, releasing the LWPs. The LWPs can age out. duke@435: // When a large number of threads become ready again there aren't duke@435: // enough LWPs available to service them. This can occur when the duke@435: // number of ready threads oscillates. duke@435: // * LWPs/Threads park on IO, thus taking the LWP out of circulation. duke@435: // duke@435: // Finally, we should call thr_setconcurrency() periodically to refresh duke@435: // the LWP pool and thwart the LWP age-out mechanism. duke@435: // The "+3" term provides a little slop -- we want to slightly overprovision. duke@435: duke@435: if (AdjustConcurrency && os::Solaris::_os_thread_count < (_processors_online+3)) { duke@435: if (!(flags & THR_BOUND)) { duke@435: thr_setconcurrency (os::Solaris::_os_thread_count); // avoid starvation duke@435: } duke@435: } duke@435: // Although this doesn't hurt, we should warn of undefined behavior duke@435: // when using unbound T1 threads with schedctl(). This should never duke@435: // happen, as the compiler and VM threads are always created bound duke@435: DEBUG_ONLY( duke@435: if ((VMThreadHintNoPreempt || CompilerThreadHintNoPreempt) && duke@435: (!os::Solaris::T2_libthread() && (!(flags & THR_BOUND))) && duke@435: ((thr_type == vm_thread) || (thr_type == cgc_thread) || duke@435: (thr_type == pgc_thread) || (thr_type == compiler_thread && BackgroundCompilation))) { duke@435: warning("schedctl behavior undefined when Compiler/VM/GC Threads are Unbound"); duke@435: } duke@435: ); duke@435: duke@435: duke@435: // Mark that we don't have an lwp or thread id yet. duke@435: // In case we attempt to set the priority before the thread starts. duke@435: osthread->set_lwp_id(-1); duke@435: osthread->set_thread_id(-1); duke@435: duke@435: status = thr_create(NULL, stack_size, java_start, thread, flags, &tid); duke@435: if (status != 0) { duke@435: if (PrintMiscellaneous && (Verbose || WizardMode)) { duke@435: perror("os::create_thread"); duke@435: } duke@435: thread->set_osthread(NULL); duke@435: // Need to clean up stuff we've allocated so far duke@435: delete osthread; duke@435: return false; duke@435: } duke@435: duke@435: Atomic::inc(&os::Solaris::_os_thread_count); duke@435: duke@435: // Store info on the Solaris thread into the OSThread duke@435: osthread->set_thread_id(tid); duke@435: duke@435: // Remember that we created this thread so we can set priority on it duke@435: osthread->set_vm_created(); duke@435: duke@435: // Set the default thread priority otherwise use NormalPriority duke@435: duke@435: if ( UseThreadPriorities ) { duke@435: thr_setprio(tid, (DefaultThreadPriority == -1) ? duke@435: java_to_os_priority[NormPriority] : duke@435: DefaultThreadPriority); duke@435: } duke@435: duke@435: // Initial thread state is INITIALIZED, not SUSPENDED duke@435: osthread->set_state(INITIALIZED); duke@435: duke@435: // The thread is returned suspended (in state INITIALIZED), and is started higher up in the call chain duke@435: return true; duke@435: } duke@435: duke@435: /* defined for >= Solaris 10. This allows builds on earlier versions duke@435: * of Solaris to take advantage of the newly reserved Solaris JVM signals duke@435: * With SIGJVM1, SIGJVM2, INTERRUPT_SIGNAL is SIGJVM1, ASYNC_SIGNAL is SIGJVM2 duke@435: * and -XX:+UseAltSigs does nothing since these should have no conflict duke@435: */ duke@435: #if !defined(SIGJVM1) duke@435: #define SIGJVM1 39 duke@435: #define SIGJVM2 40 duke@435: #endif duke@435: duke@435: debug_only(static bool signal_sets_initialized = false); duke@435: static sigset_t unblocked_sigs, vm_sigs, allowdebug_blocked_sigs; duke@435: int os::Solaris::_SIGinterrupt = INTERRUPT_SIGNAL; duke@435: int os::Solaris::_SIGasync = ASYNC_SIGNAL; duke@435: duke@435: bool os::Solaris::is_sig_ignored(int sig) { duke@435: struct sigaction oact; duke@435: sigaction(sig, (struct sigaction*)NULL, &oact); duke@435: void* ohlr = oact.sa_sigaction ? CAST_FROM_FN_PTR(void*, oact.sa_sigaction) duke@435: : CAST_FROM_FN_PTR(void*, oact.sa_handler); duke@435: if (ohlr == CAST_FROM_FN_PTR(void*, SIG_IGN)) duke@435: return true; duke@435: else duke@435: return false; duke@435: } duke@435: duke@435: // Note: SIGRTMIN is a macro that calls sysconf() so it will duke@435: // dynamically detect SIGRTMIN value for the system at runtime, not buildtime duke@435: static bool isJVM1available() { duke@435: return SIGJVM1 < SIGRTMIN; duke@435: } duke@435: duke@435: void os::Solaris::signal_sets_init() { duke@435: // Should also have an assertion stating we are still single-threaded. duke@435: assert(!signal_sets_initialized, "Already initialized"); duke@435: // Fill in signals that are necessarily unblocked for all threads in duke@435: // the VM. Currently, we unblock the following signals: duke@435: // SHUTDOWN{1,2,3}_SIGNAL: for shutdown hooks support (unless over-ridden duke@435: // by -Xrs (=ReduceSignalUsage)); duke@435: // BREAK_SIGNAL which is unblocked only by the VM thread and blocked by all duke@435: // other threads. The "ReduceSignalUsage" boolean tells us not to alter duke@435: // the dispositions or masks wrt these signals. duke@435: // Programs embedding the VM that want to use the above signals for their duke@435: // own purposes must, at this time, use the "-Xrs" option to prevent duke@435: // interference with shutdown hooks and BREAK_SIGNAL thread dumping. duke@435: // (See bug 4345157, and other related bugs). duke@435: // In reality, though, unblocking these signals is really a nop, since duke@435: // these signals are not blocked by default. duke@435: sigemptyset(&unblocked_sigs); duke@435: sigemptyset(&allowdebug_blocked_sigs); duke@435: sigaddset(&unblocked_sigs, SIGILL); duke@435: sigaddset(&unblocked_sigs, SIGSEGV); duke@435: sigaddset(&unblocked_sigs, SIGBUS); duke@435: sigaddset(&unblocked_sigs, SIGFPE); duke@435: duke@435: if (isJVM1available) { duke@435: os::Solaris::set_SIGinterrupt(SIGJVM1); duke@435: os::Solaris::set_SIGasync(SIGJVM2); duke@435: } else if (UseAltSigs) { duke@435: os::Solaris::set_SIGinterrupt(ALT_INTERRUPT_SIGNAL); duke@435: os::Solaris::set_SIGasync(ALT_ASYNC_SIGNAL); duke@435: } else { duke@435: os::Solaris::set_SIGinterrupt(INTERRUPT_SIGNAL); duke@435: os::Solaris::set_SIGasync(ASYNC_SIGNAL); duke@435: } duke@435: duke@435: sigaddset(&unblocked_sigs, os::Solaris::SIGinterrupt()); duke@435: sigaddset(&unblocked_sigs, os::Solaris::SIGasync()); duke@435: duke@435: if (!ReduceSignalUsage) { duke@435: if (!os::Solaris::is_sig_ignored(SHUTDOWN1_SIGNAL)) { duke@435: sigaddset(&unblocked_sigs, SHUTDOWN1_SIGNAL); duke@435: sigaddset(&allowdebug_blocked_sigs, SHUTDOWN1_SIGNAL); duke@435: } duke@435: if (!os::Solaris::is_sig_ignored(SHUTDOWN2_SIGNAL)) { duke@435: sigaddset(&unblocked_sigs, SHUTDOWN2_SIGNAL); duke@435: sigaddset(&allowdebug_blocked_sigs, SHUTDOWN2_SIGNAL); duke@435: } duke@435: if (!os::Solaris::is_sig_ignored(SHUTDOWN3_SIGNAL)) { duke@435: sigaddset(&unblocked_sigs, SHUTDOWN3_SIGNAL); duke@435: sigaddset(&allowdebug_blocked_sigs, SHUTDOWN3_SIGNAL); duke@435: } duke@435: } duke@435: // Fill in signals that are blocked by all but the VM thread. duke@435: sigemptyset(&vm_sigs); duke@435: if (!ReduceSignalUsage) duke@435: sigaddset(&vm_sigs, BREAK_SIGNAL); duke@435: debug_only(signal_sets_initialized = true); duke@435: duke@435: // For diagnostics only used in run_periodic_checks duke@435: sigemptyset(&check_signal_done); duke@435: } duke@435: duke@435: // These are signals that are unblocked while a thread is running Java. duke@435: // (For some reason, they get blocked by default.) duke@435: sigset_t* os::Solaris::unblocked_signals() { duke@435: assert(signal_sets_initialized, "Not initialized"); duke@435: return &unblocked_sigs; duke@435: } duke@435: duke@435: // These are the signals that are blocked while a (non-VM) thread is duke@435: // running Java. Only the VM thread handles these signals. duke@435: sigset_t* os::Solaris::vm_signals() { duke@435: assert(signal_sets_initialized, "Not initialized"); duke@435: return &vm_sigs; duke@435: } duke@435: duke@435: // These are signals that are blocked during cond_wait to allow debugger in duke@435: sigset_t* os::Solaris::allowdebug_blocked_signals() { duke@435: assert(signal_sets_initialized, "Not initialized"); duke@435: return &allowdebug_blocked_sigs; duke@435: } duke@435: duke@435: // First crack at OS-specific initialization, from inside the new thread. duke@435: void os::initialize_thread() { duke@435: int r = thr_main() ; duke@435: guarantee (r == 0 || r == 1, "CR6501650 or CR6493689") ; duke@435: if (r) { duke@435: JavaThread* jt = (JavaThread *)Thread::current(); duke@435: assert(jt != NULL,"Sanity check"); duke@435: size_t stack_size; duke@435: address base = jt->stack_base(); duke@435: if (Arguments::created_by_java_launcher()) { duke@435: // Use 2MB to allow for Solaris 7 64 bit mode. duke@435: stack_size = JavaThread::stack_size_at_create() == 0 duke@435: ? 2048*K : JavaThread::stack_size_at_create(); duke@435: duke@435: // There are rare cases when we may have already used more than duke@435: // the basic stack size allotment before this method is invoked. duke@435: // Attempt to allow for a normally sized java_stack. duke@435: size_t current_stack_offset = (size_t)(base - (address)&stack_size); duke@435: stack_size += ReservedSpace::page_align_size_down(current_stack_offset); duke@435: } else { duke@435: // 6269555: If we were not created by a Java launcher, i.e. if we are duke@435: // running embedded in a native application, treat the primordial thread duke@435: // as much like a native attached thread as possible. This means using duke@435: // the current stack size from thr_stksegment(), unless it is too large duke@435: // to reliably setup guard pages. A reasonable max size is 8MB. duke@435: size_t current_size = current_stack_size(); duke@435: // This should never happen, but just in case.... duke@435: if (current_size == 0) current_size = 2 * K * K; duke@435: stack_size = current_size > (8 * K * K) ? (8 * K * K) : current_size; duke@435: } duke@435: address bottom = (address)align_size_up((intptr_t)(base - stack_size), os::vm_page_size());; duke@435: stack_size = (size_t)(base - bottom); duke@435: duke@435: assert(stack_size > 0, "Stack size calculation problem"); duke@435: duke@435: if (stack_size > jt->stack_size()) { duke@435: NOT_PRODUCT( duke@435: struct rlimit limits; duke@435: getrlimit(RLIMIT_STACK, &limits); duke@435: size_t size = adjust_stack_size(base, (size_t)limits.rlim_cur); duke@435: assert(size >= jt->stack_size(), "Stack size problem in main thread"); duke@435: ) duke@435: tty->print_cr( duke@435: "Stack size of %d Kb exceeds current limit of %d Kb.\n" duke@435: "(Stack sizes are rounded up to a multiple of the system page size.)\n" duke@435: "See limit(1) to increase the stack size limit.", duke@435: stack_size / K, jt->stack_size() / K); duke@435: vm_exit(1); duke@435: } duke@435: assert(jt->stack_size() >= stack_size, duke@435: "Attempt to map more stack than was allocated"); duke@435: jt->set_stack_size(stack_size); duke@435: } duke@435: duke@435: // 5/22/01: Right now alternate signal stacks do not handle duke@435: // throwing stack overflow exceptions, see bug 4463178 duke@435: // Until a fix is found for this, T2 will NOT imply alternate signal duke@435: // stacks. duke@435: // If using T2 libthread threads, install an alternate signal stack. duke@435: // Because alternate stacks associate with LWPs on Solaris, duke@435: // see sigaltstack(2), if using UNBOUND threads, or if UseBoundThreads duke@435: // we prefer to explicitly stack bang. duke@435: // If not using T2 libthread, but using UseBoundThreads any threads duke@435: // (primordial thread, jni_attachCurrentThread) we do not create, duke@435: // probably are not bound, therefore they can not have an alternate duke@435: // signal stack. Since our stack banging code is generated and duke@435: // is shared across threads, all threads must be bound to allow duke@435: // using alternate signal stacks. The alternative is to interpose duke@435: // on _lwp_create to associate an alt sig stack with each LWP, duke@435: // and this could be a problem when the JVM is embedded. duke@435: // We would prefer to use alternate signal stacks with T2 duke@435: // Since there is currently no accurate way to detect T2 duke@435: // we do not. Assuming T2 when running T1 causes sig 11s or assertions duke@435: // on installing alternate signal stacks duke@435: duke@435: duke@435: // 05/09/03: removed alternate signal stack support for Solaris duke@435: // The alternate signal stack mechanism is no longer needed to duke@435: // handle stack overflow. This is now handled by allocating duke@435: // guard pages (red zone) and stackbanging. duke@435: // Initially the alternate signal stack mechanism was removed because duke@435: // it did not work with T1 llibthread. Alternate duke@435: // signal stacks MUST have all threads bound to lwps. Applications duke@435: // can create their own threads and attach them without their being duke@435: // bound under T1. This is frequently the case for the primordial thread. duke@435: // If we were ever to reenable this mechanism we would need to duke@435: // use the dynamic check for T2 libthread. duke@435: duke@435: os::Solaris::init_thread_fpu_state(); duke@435: } duke@435: duke@435: duke@435: duke@435: // Free Solaris resources related to the OSThread duke@435: void os::free_thread(OSThread* osthread) { duke@435: assert(osthread != NULL, "os::free_thread but osthread not set"); duke@435: duke@435: duke@435: // We are told to free resources of the argument thread, duke@435: // but we can only really operate on the current thread. duke@435: // The main thread must take the VMThread down synchronously duke@435: // before the main thread exits and frees up CodeHeap duke@435: guarantee((Thread::current()->osthread() == osthread duke@435: || (osthread == VMThread::vm_thread()->osthread())), "os::free_thread but not current thread"); duke@435: if (Thread::current()->osthread() == osthread) { duke@435: // Restore caller's signal mask duke@435: sigset_t sigmask = osthread->caller_sigmask(); duke@435: thr_sigsetmask(SIG_SETMASK, &sigmask, NULL); duke@435: } duke@435: delete osthread; duke@435: } duke@435: duke@435: void os::pd_start_thread(Thread* thread) { duke@435: int status = thr_continue(thread->osthread()->thread_id()); duke@435: assert_status(status == 0, status, "thr_continue failed"); duke@435: } duke@435: duke@435: duke@435: intx os::current_thread_id() { duke@435: return (intx)thr_self(); duke@435: } duke@435: duke@435: static pid_t _initial_pid = 0; duke@435: duke@435: int os::current_process_id() { duke@435: return (int)(_initial_pid ? _initial_pid : getpid()); duke@435: } duke@435: duke@435: int os::allocate_thread_local_storage() { duke@435: // %%% in Win32 this allocates a memory segment pointed to by a duke@435: // register. Dan Stein can implement a similar feature in duke@435: // Solaris. Alternatively, the VM can do the same thing duke@435: // explicitly: malloc some storage and keep the pointer in a duke@435: // register (which is part of the thread's context) (or keep it duke@435: // in TLS). duke@435: // %%% In current versions of Solaris, thr_self and TSD can duke@435: // be accessed via short sequences of displaced indirections. duke@435: // The value of thr_self is available as %g7(36). duke@435: // The value of thr_getspecific(k) is stored in %g7(12)(4)(k*4-4), duke@435: // assuming that the current thread already has a value bound to k. duke@435: // It may be worth experimenting with such access patterns, duke@435: // and later having the parameters formally exported from a Solaris duke@435: // interface. I think, however, that it will be faster to duke@435: // maintain the invariant that %g2 always contains the duke@435: // JavaThread in Java code, and have stubs simply duke@435: // treat %g2 as a caller-save register, preserving it in a %lN. duke@435: thread_key_t tk; duke@435: if (thr_keycreate( &tk, NULL ) ) duke@435: fatal1("os::allocate_thread_local_storage: thr_keycreate failed (%s)", strerror(errno)); duke@435: return int(tk); duke@435: } duke@435: duke@435: void os::free_thread_local_storage(int index) { duke@435: // %%% don't think we need anything here duke@435: // if ( pthread_key_delete((pthread_key_t) tk) ) duke@435: // fatal("os::free_thread_local_storage: pthread_key_delete failed"); duke@435: } duke@435: duke@435: #define SMALLINT 32 // libthread allocate for tsd_common is a version specific duke@435: // small number - point is NO swap space available duke@435: void os::thread_local_storage_at_put(int index, void* value) { duke@435: // %%% this is used only in threadLocalStorage.cpp duke@435: if (thr_setspecific((thread_key_t)index, value)) { duke@435: if (errno == ENOMEM) { duke@435: vm_exit_out_of_memory(SMALLINT, "thr_setspecific: out of swap space"); duke@435: } else { duke@435: fatal1("os::thread_local_storage_at_put: thr_setspecific failed (%s)", strerror(errno)); duke@435: } duke@435: } else { duke@435: ThreadLocalStorage::set_thread_in_slot ((Thread *) value) ; duke@435: } duke@435: } duke@435: duke@435: // This function could be called before TLS is initialized, for example, when duke@435: // VM receives an async signal or when VM causes a fatal error during duke@435: // initialization. Return NULL if thr_getspecific() fails. duke@435: void* os::thread_local_storage_at(int index) { duke@435: // %%% this is used only in threadLocalStorage.cpp duke@435: void* r = NULL; duke@435: return thr_getspecific((thread_key_t)index, &r) != 0 ? NULL : r; duke@435: } duke@435: duke@435: duke@435: const int NANOSECS_PER_MILLISECS = 1000000; duke@435: // gethrtime can move backwards if read from one cpu and then a different cpu duke@435: // getTimeNanos is guaranteed to not move backward on Solaris duke@435: // local spinloop created as faster for a CAS on an int than duke@435: // a CAS on a 64bit jlong. Also Atomic::cmpxchg for jlong is not duke@435: // supported on sparc v8 or pre supports_cx8 intel boxes. duke@435: // oldgetTimeNanos for systems which do not support CAS on 64bit jlong duke@435: // i.e. sparc v8 and pre supports_cx8 (i486) intel boxes duke@435: inline hrtime_t oldgetTimeNanos() { duke@435: int gotlock = LOCK_INVALID; duke@435: hrtime_t newtime = gethrtime(); duke@435: duke@435: for (;;) { duke@435: // grab lock for max_hrtime duke@435: int curlock = max_hrtime_lock; duke@435: if (curlock & LOCK_BUSY) continue; duke@435: if (gotlock = Atomic::cmpxchg(LOCK_BUSY, &max_hrtime_lock, LOCK_FREE) != LOCK_FREE) continue; duke@435: if (newtime > max_hrtime) { duke@435: max_hrtime = newtime; duke@435: } else { duke@435: newtime = max_hrtime; duke@435: } duke@435: // release lock duke@435: max_hrtime_lock = LOCK_FREE; duke@435: return newtime; duke@435: } duke@435: } duke@435: // gethrtime can move backwards if read from one cpu and then a different cpu duke@435: // getTimeNanos is guaranteed to not move backward on Solaris duke@435: inline hrtime_t getTimeNanos() { duke@435: if (VM_Version::supports_cx8()) { duke@435: bool retry = false; duke@435: hrtime_t newtime = gethrtime(); duke@435: hrtime_t oldmaxtime = max_hrtime; duke@435: hrtime_t retmaxtime = oldmaxtime; duke@435: while ((newtime > retmaxtime) && (retry == false || retmaxtime != oldmaxtime)) { duke@435: oldmaxtime = retmaxtime; duke@435: retmaxtime = Atomic::cmpxchg(newtime, (volatile jlong *)&max_hrtime, oldmaxtime); duke@435: retry = true; duke@435: } duke@435: return (newtime > retmaxtime) ? newtime : retmaxtime; duke@435: } else { duke@435: return oldgetTimeNanos(); duke@435: } duke@435: } duke@435: duke@435: // Time since start-up in seconds to a fine granularity. duke@435: // Used by VMSelfDestructTimer and the MemProfiler. duke@435: double os::elapsedTime() { duke@435: return (double)(getTimeNanos() - first_hrtime) / (double)hrtime_hz; duke@435: } duke@435: duke@435: jlong os::elapsed_counter() { duke@435: return (jlong)(getTimeNanos() - first_hrtime); duke@435: } duke@435: duke@435: jlong os::elapsed_frequency() { duke@435: return hrtime_hz; duke@435: } duke@435: duke@435: // Return the real, user, and system times in seconds from an duke@435: // arbitrary fixed point in the past. duke@435: bool os::getTimesSecs(double* process_real_time, duke@435: double* process_user_time, duke@435: double* process_system_time) { duke@435: struct tms ticks; duke@435: clock_t real_ticks = times(&ticks); duke@435: duke@435: if (real_ticks == (clock_t) (-1)) { duke@435: return false; duke@435: } else { duke@435: double ticks_per_second = (double) clock_tics_per_sec; duke@435: *process_user_time = ((double) ticks.tms_utime) / ticks_per_second; duke@435: *process_system_time = ((double) ticks.tms_stime) / ticks_per_second; duke@435: // For consistency return the real time from getTimeNanos() duke@435: // converted to seconds. duke@435: *process_real_time = ((double) getTimeNanos()) / ((double) NANOUNITS); duke@435: duke@435: return true; duke@435: } duke@435: } duke@435: duke@435: // Used internally for comparisons only duke@435: // getTimeMillis guaranteed to not move backwards on Solaris duke@435: jlong getTimeMillis() { duke@435: jlong nanotime = getTimeNanos(); duke@435: return (jlong)(nanotime / NANOSECS_PER_MILLISECS); duke@435: } duke@435: sbohne@496: // Must return millis since Jan 1 1970 for JVM_CurrentTimeMillis sbohne@496: jlong os::javaTimeMillis() { duke@435: timeval t; duke@435: if (gettimeofday( &t, NULL) == -1) sbohne@496: fatal1("os::javaTimeMillis: gettimeofday (%s)", strerror(errno)); duke@435: return jlong(t.tv_sec) * 1000 + jlong(t.tv_usec) / 1000; duke@435: } duke@435: duke@435: jlong os::javaTimeNanos() { duke@435: return (jlong)getTimeNanos(); duke@435: } duke@435: duke@435: void os::javaTimeNanos_info(jvmtiTimerInfo *info_ptr) { duke@435: info_ptr->max_value = ALL_64_BITS; // gethrtime() uses all 64 bits duke@435: info_ptr->may_skip_backward = false; // not subject to resetting or drifting duke@435: info_ptr->may_skip_forward = false; // not subject to resetting or drifting duke@435: info_ptr->kind = JVMTI_TIMER_ELAPSED; // elapsed not CPU time duke@435: } duke@435: duke@435: char * os::local_time_string(char *buf, size_t buflen) { duke@435: struct tm t; duke@435: time_t long_time; duke@435: time(&long_time); duke@435: localtime_r(&long_time, &t); duke@435: jio_snprintf(buf, buflen, "%d-%02d-%02d %02d:%02d:%02d", duke@435: t.tm_year + 1900, t.tm_mon + 1, t.tm_mday, duke@435: t.tm_hour, t.tm_min, t.tm_sec); duke@435: return buf; duke@435: } duke@435: duke@435: // Note: os::shutdown() might be called very early during initialization, or duke@435: // called from signal handler. Before adding something to os::shutdown(), make duke@435: // sure it is async-safe and can handle partially initialized VM. duke@435: void os::shutdown() { duke@435: duke@435: // allow PerfMemory to attempt cleanup of any persistent resources duke@435: perfMemory_exit(); duke@435: duke@435: // needs to remove object in file system duke@435: AttachListener::abort(); duke@435: duke@435: // flush buffered output, finish log files duke@435: ostream_abort(); duke@435: duke@435: // Check for abort hook duke@435: abort_hook_t abort_hook = Arguments::abort_hook(); duke@435: if (abort_hook != NULL) { duke@435: abort_hook(); duke@435: } duke@435: } duke@435: duke@435: // Note: os::abort() might be called very early during initialization, or duke@435: // called from signal handler. Before adding something to os::abort(), make duke@435: // sure it is async-safe and can handle partially initialized VM. duke@435: void os::abort(bool dump_core) { duke@435: os::shutdown(); duke@435: if (dump_core) { duke@435: #ifndef PRODUCT duke@435: fdStream out(defaultStream::output_fd()); duke@435: out.print_raw("Current thread is "); duke@435: char buf[16]; duke@435: jio_snprintf(buf, sizeof(buf), UINTX_FORMAT, os::current_thread_id()); duke@435: out.print_raw_cr(buf); duke@435: out.print_raw_cr("Dumping core ..."); duke@435: #endif duke@435: ::abort(); // dump core (for debugging) duke@435: } duke@435: duke@435: ::exit(1); duke@435: } duke@435: duke@435: // Die immediately, no exit hook, no abort hook, no cleanup. duke@435: void os::die() { duke@435: _exit(-1); duke@435: } duke@435: duke@435: // unused duke@435: void os::set_error_file(const char *logfile) {} duke@435: duke@435: // DLL functions duke@435: duke@435: const char* os::dll_file_extension() { return ".so"; } duke@435: duke@435: const char* os::get_temp_directory() { return "/tmp/"; } duke@435: duke@435: const char* os::get_current_directory(char *buf, int buflen) { duke@435: return getcwd(buf, buflen); duke@435: } duke@435: duke@435: // check if addr is inside libjvm[_g].so duke@435: bool os::address_is_in_vm(address addr) { duke@435: static address libjvm_base_addr; duke@435: Dl_info dlinfo; duke@435: duke@435: if (libjvm_base_addr == NULL) { duke@435: dladdr(CAST_FROM_FN_PTR(void *, os::address_is_in_vm), &dlinfo); duke@435: libjvm_base_addr = (address)dlinfo.dli_fbase; duke@435: assert(libjvm_base_addr !=NULL, "Cannot obtain base address for libjvm"); duke@435: } duke@435: duke@435: if (dladdr((void *)addr, &dlinfo)) { duke@435: if (libjvm_base_addr == (address)dlinfo.dli_fbase) return true; duke@435: } duke@435: duke@435: return false; duke@435: } duke@435: duke@435: typedef int (*dladdr1_func_type) (void *, Dl_info *, void **, int); duke@435: static dladdr1_func_type dladdr1_func = NULL; duke@435: duke@435: bool os::dll_address_to_function_name(address addr, char *buf, duke@435: int buflen, int * offset) { duke@435: Dl_info dlinfo; duke@435: duke@435: // dladdr1_func was initialized in os::init() duke@435: if (dladdr1_func){ duke@435: // yes, we have dladdr1 duke@435: duke@435: // Support for dladdr1 is checked at runtime; it may be duke@435: // available even if the vm is built on a machine that does duke@435: // not have dladdr1 support. Make sure there is a value for duke@435: // RTLD_DL_SYMENT. duke@435: #ifndef RTLD_DL_SYMENT duke@435: #define RTLD_DL_SYMENT 1 duke@435: #endif duke@435: Sym * info; duke@435: if (dladdr1_func((void *)addr, &dlinfo, (void **)&info, duke@435: RTLD_DL_SYMENT)) { duke@435: if (buf) jio_snprintf(buf, buflen, "%s", dlinfo.dli_sname); duke@435: if (offset) *offset = addr - (address)dlinfo.dli_saddr; duke@435: duke@435: // check if the returned symbol really covers addr duke@435: return ((char *)dlinfo.dli_saddr + info->st_size > (char *)addr); duke@435: } else { duke@435: if (buf) buf[0] = '\0'; duke@435: if (offset) *offset = -1; duke@435: return false; duke@435: } duke@435: } else { duke@435: // no, only dladdr is available duke@435: if(dladdr((void *)addr, &dlinfo)) { duke@435: if (buf) jio_snprintf(buf, buflen, dlinfo.dli_sname); duke@435: if (offset) *offset = addr - (address)dlinfo.dli_saddr; duke@435: return true; duke@435: } else { duke@435: if (buf) buf[0] = '\0'; duke@435: if (offset) *offset = -1; duke@435: return false; duke@435: } duke@435: } duke@435: } duke@435: duke@435: bool os::dll_address_to_library_name(address addr, char* buf, duke@435: int buflen, int* offset) { duke@435: Dl_info dlinfo; duke@435: duke@435: if (dladdr((void*)addr, &dlinfo)){ duke@435: if (buf) jio_snprintf(buf, buflen, "%s", dlinfo.dli_fname); duke@435: if (offset) *offset = addr - (address)dlinfo.dli_fbase; duke@435: return true; duke@435: } else { duke@435: if (buf) buf[0] = '\0'; duke@435: if (offset) *offset = -1; duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: // Prints the names and full paths of all opened dynamic libraries duke@435: // for current process duke@435: void os::print_dll_info(outputStream * st) { duke@435: Dl_info dli; duke@435: void *handle; duke@435: Link_map *map; duke@435: Link_map *p; duke@435: duke@435: st->print_cr("Dynamic libraries:"); st->flush(); duke@435: duke@435: if (!dladdr(CAST_FROM_FN_PTR(void *, os::print_dll_info), &dli)) { duke@435: st->print_cr("Error: Cannot print dynamic libraries."); duke@435: return; duke@435: } duke@435: handle = dlopen(dli.dli_fname, RTLD_LAZY); duke@435: if (handle == NULL) { duke@435: st->print_cr("Error: Cannot print dynamic libraries."); duke@435: return; duke@435: } duke@435: dlinfo(handle, RTLD_DI_LINKMAP, &map); duke@435: if (map == NULL) { duke@435: st->print_cr("Error: Cannot print dynamic libraries."); duke@435: return; duke@435: } duke@435: duke@435: while (map->l_prev != NULL) duke@435: map = map->l_prev; duke@435: duke@435: while (map != NULL) { duke@435: st->print_cr(PTR_FORMAT " \t%s", map->l_addr, map->l_name); duke@435: map = map->l_next; duke@435: } duke@435: duke@435: dlclose(handle); duke@435: } duke@435: duke@435: // Loads .dll/.so and duke@435: // in case of error it checks if .dll/.so was built for the duke@435: // same architecture as Hotspot is running on duke@435: duke@435: void * os::dll_load(const char *filename, char *ebuf, int ebuflen) duke@435: { duke@435: void * result= ::dlopen(filename, RTLD_LAZY); duke@435: if (result != NULL) { duke@435: // Successful loading duke@435: return result; duke@435: } duke@435: duke@435: Elf32_Ehdr elf_head; duke@435: duke@435: // Read system error message into ebuf duke@435: // It may or may not be overwritten below duke@435: ::strncpy(ebuf, ::dlerror(), ebuflen-1); duke@435: ebuf[ebuflen-1]='\0'; duke@435: int diag_msg_max_length=ebuflen-strlen(ebuf); duke@435: char* diag_msg_buf=ebuf+strlen(ebuf); duke@435: duke@435: if (diag_msg_max_length==0) { duke@435: // No more space in ebuf for additional diagnostics message duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: int file_descriptor= ::open(filename, O_RDONLY | O_NONBLOCK); duke@435: duke@435: if (file_descriptor < 0) { duke@435: // Can't open library, report dlerror() message duke@435: return NULL; duke@435: } duke@435: duke@435: bool failed_to_read_elf_head= duke@435: (sizeof(elf_head)!= duke@435: (::read(file_descriptor, &elf_head,sizeof(elf_head)))) ; duke@435: duke@435: ::close(file_descriptor); duke@435: if (failed_to_read_elf_head) { duke@435: // file i/o error - report dlerror() msg duke@435: return NULL; duke@435: } duke@435: duke@435: typedef struct { duke@435: Elf32_Half code; // Actual value as defined in elf.h duke@435: Elf32_Half compat_class; // Compatibility of archs at VM's sense duke@435: char elf_class; // 32 or 64 bit duke@435: char endianess; // MSB or LSB duke@435: char* name; // String representation duke@435: } arch_t; duke@435: duke@435: static const arch_t arch_array[]={ duke@435: {EM_386, EM_386, ELFCLASS32, ELFDATA2LSB, (char*)"IA 32"}, duke@435: {EM_486, EM_386, ELFCLASS32, ELFDATA2LSB, (char*)"IA 32"}, duke@435: {EM_IA_64, EM_IA_64, ELFCLASS64, ELFDATA2LSB, (char*)"IA 64"}, duke@435: {EM_X86_64, EM_X86_64, ELFCLASS64, ELFDATA2LSB, (char*)"AMD 64"}, duke@435: {EM_SPARC, EM_SPARC, ELFCLASS32, ELFDATA2MSB, (char*)"Sparc 32"}, duke@435: {EM_SPARC32PLUS, EM_SPARC, ELFCLASS32, ELFDATA2MSB, (char*)"Sparc 32"}, duke@435: {EM_SPARCV9, EM_SPARCV9, ELFCLASS64, ELFDATA2MSB, (char*)"Sparc v9 64"}, duke@435: {EM_PPC, EM_PPC, ELFCLASS32, ELFDATA2MSB, (char*)"Power PC 32"}, duke@435: {EM_PPC64, EM_PPC64, ELFCLASS64, ELFDATA2MSB, (char*)"Power PC 64"} duke@435: }; duke@435: duke@435: #if (defined IA32) duke@435: static Elf32_Half running_arch_code=EM_386; duke@435: #elif (defined AMD64) duke@435: static Elf32_Half running_arch_code=EM_X86_64; duke@435: #elif (defined IA64) duke@435: static Elf32_Half running_arch_code=EM_IA_64; duke@435: #elif (defined __sparc) && (defined _LP64) duke@435: static Elf32_Half running_arch_code=EM_SPARCV9; duke@435: #elif (defined __sparc) && (!defined _LP64) duke@435: static Elf32_Half running_arch_code=EM_SPARC; duke@435: #elif (defined __powerpc64__) duke@435: static Elf32_Half running_arch_code=EM_PPC64; duke@435: #elif (defined __powerpc__) duke@435: static Elf32_Half running_arch_code=EM_PPC; duke@435: #else duke@435: #error Method os::dll_load requires that one of following is defined:\ duke@435: IA32, AMD64, IA64, __sparc, __powerpc__ duke@435: #endif duke@435: duke@435: // Identify compatability class for VM's architecture and library's architecture duke@435: // Obtain string descriptions for architectures duke@435: duke@435: arch_t lib_arch={elf_head.e_machine,0,elf_head.e_ident[EI_CLASS], elf_head.e_ident[EI_DATA], NULL}; duke@435: int running_arch_index=-1; duke@435: duke@435: for (unsigned int i=0 ; i < ARRAY_SIZE(arch_array) ; i++ ) { duke@435: if (running_arch_code == arch_array[i].code) { duke@435: running_arch_index = i; duke@435: } duke@435: if (lib_arch.code == arch_array[i].code) { duke@435: lib_arch.compat_class = arch_array[i].compat_class; duke@435: lib_arch.name = arch_array[i].name; duke@435: } duke@435: } duke@435: duke@435: assert(running_arch_index != -1, duke@435: "Didn't find running architecture code (running_arch_code) in arch_array"); duke@435: if (running_arch_index == -1) { duke@435: // Even though running architecture detection failed duke@435: // we may still continue with reporting dlerror() message duke@435: return NULL; duke@435: } duke@435: duke@435: if (lib_arch.endianess != arch_array[running_arch_index].endianess) { duke@435: ::snprintf(diag_msg_buf, diag_msg_max_length-1," (Possible cause: endianness mismatch)"); duke@435: return NULL; duke@435: } duke@435: duke@435: if (lib_arch.elf_class != arch_array[running_arch_index].elf_class) { duke@435: ::snprintf(diag_msg_buf, diag_msg_max_length-1," (Possible cause: architecture word width mismatch)"); duke@435: return NULL; duke@435: } duke@435: duke@435: if (lib_arch.compat_class != arch_array[running_arch_index].compat_class) { duke@435: if ( lib_arch.name!=NULL ) { duke@435: ::snprintf(diag_msg_buf, diag_msg_max_length-1, duke@435: " (Possible cause: can't load %s-bit .so on a %s-bit platform)", duke@435: lib_arch.name, arch_array[running_arch_index].name); duke@435: } else { duke@435: ::snprintf(diag_msg_buf, diag_msg_max_length-1, duke@435: " (Possible cause: can't load this .so (machine code=0x%x) on a %s-bit platform)", duke@435: lib_arch.code, duke@435: arch_array[running_arch_index].name); duke@435: } duke@435: } duke@435: duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: duke@435: bool _print_ascii_file(const char* filename, outputStream* st) { duke@435: int fd = open(filename, O_RDONLY); duke@435: if (fd == -1) { duke@435: return false; duke@435: } duke@435: duke@435: char buf[32]; duke@435: int bytes; duke@435: while ((bytes = read(fd, buf, sizeof(buf))) > 0) { duke@435: st->print_raw(buf, bytes); duke@435: } duke@435: duke@435: close(fd); duke@435: duke@435: return true; duke@435: } duke@435: duke@435: void os::print_os_info(outputStream* st) { duke@435: st->print("OS:"); duke@435: duke@435: if (!_print_ascii_file("/etc/release", st)) { duke@435: st->print("Solaris"); duke@435: } duke@435: st->cr(); duke@435: duke@435: // kernel duke@435: st->print("uname:"); duke@435: struct utsname name; duke@435: uname(&name); duke@435: st->print(name.sysname); st->print(" "); duke@435: st->print(name.release); st->print(" "); duke@435: st->print(name.version); st->print(" "); duke@435: st->print(name.machine); duke@435: duke@435: // libthread duke@435: if (os::Solaris::T2_libthread()) st->print(" (T2 libthread)"); duke@435: else st->print(" (T1 libthread)"); duke@435: st->cr(); duke@435: duke@435: // rlimit duke@435: st->print("rlimit:"); duke@435: struct rlimit rlim; duke@435: duke@435: st->print(" STACK "); duke@435: getrlimit(RLIMIT_STACK, &rlim); duke@435: if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); duke@435: else st->print("%uk", rlim.rlim_cur >> 10); duke@435: duke@435: st->print(", CORE "); duke@435: getrlimit(RLIMIT_CORE, &rlim); duke@435: if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); duke@435: else st->print("%uk", rlim.rlim_cur >> 10); duke@435: duke@435: st->print(", NOFILE "); duke@435: getrlimit(RLIMIT_NOFILE, &rlim); duke@435: if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); duke@435: else st->print("%d", rlim.rlim_cur); duke@435: duke@435: st->print(", AS "); duke@435: getrlimit(RLIMIT_AS, &rlim); duke@435: if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); duke@435: else st->print("%uk", rlim.rlim_cur >> 10); duke@435: st->cr(); duke@435: duke@435: // load average duke@435: st->print("load average:"); duke@435: double loadavg[3]; duke@435: os::loadavg(loadavg, 3); duke@435: st->print("%0.02f %0.02f %0.02f", loadavg[0], loadavg[1], loadavg[2]); duke@435: st->cr(); duke@435: } duke@435: duke@435: duke@435: static bool check_addr0(outputStream* st) { duke@435: jboolean status = false; duke@435: int fd = open("/proc/self/map",O_RDONLY); duke@435: if (fd >= 0) { duke@435: prmap_t p; duke@435: while(read(fd, &p, sizeof(p)) > 0) { duke@435: if (p.pr_vaddr == 0x0) { duke@435: st->print("Warning: Address: 0x%x, Size: %dK, ",p.pr_vaddr, p.pr_size/1024, p.pr_mapname); duke@435: st->print("Mapped file: %s, ", p.pr_mapname[0] == '\0' ? "None" : p.pr_mapname); duke@435: st->print("Access:"); duke@435: st->print("%s",(p.pr_mflags & MA_READ) ? "r" : "-"); duke@435: st->print("%s",(p.pr_mflags & MA_WRITE) ? "w" : "-"); duke@435: st->print("%s",(p.pr_mflags & MA_EXEC) ? "x" : "-"); duke@435: st->cr(); duke@435: status = true; duke@435: } duke@435: close(fd); duke@435: } duke@435: } duke@435: return status; duke@435: } duke@435: duke@435: void os::print_memory_info(outputStream* st) { duke@435: st->print("Memory:"); duke@435: st->print(" %dk page", os::vm_page_size()>>10); duke@435: st->print(", physical " UINT64_FORMAT "k", os::physical_memory()>>10); duke@435: st->print("(" UINT64_FORMAT "k free)", os::available_memory() >> 10); duke@435: st->cr(); duke@435: (void) check_addr0(st); duke@435: } duke@435: duke@435: // Taken from /usr/include/sys/machsig.h Supposed to be architecture specific duke@435: // but they're the same for all the solaris architectures that we support. duke@435: const char *ill_names[] = { "ILL0", "ILL_ILLOPC", "ILL_ILLOPN", "ILL_ILLADR", duke@435: "ILL_ILLTRP", "ILL_PRVOPC", "ILL_PRVREG", duke@435: "ILL_COPROC", "ILL_BADSTK" }; duke@435: duke@435: const char *fpe_names[] = { "FPE0", "FPE_INTDIV", "FPE_INTOVF", "FPE_FLTDIV", duke@435: "FPE_FLTOVF", "FPE_FLTUND", "FPE_FLTRES", duke@435: "FPE_FLTINV", "FPE_FLTSUB" }; duke@435: duke@435: const char *segv_names[] = { "SEGV0", "SEGV_MAPERR", "SEGV_ACCERR" }; duke@435: duke@435: const char *bus_names[] = { "BUS0", "BUS_ADRALN", "BUS_ADRERR", "BUS_OBJERR" }; duke@435: duke@435: void os::print_siginfo(outputStream* st, void* siginfo) { duke@435: st->print("siginfo:"); duke@435: duke@435: const int buflen = 100; duke@435: char buf[buflen]; duke@435: siginfo_t *si = (siginfo_t*)siginfo; duke@435: st->print("si_signo=%s: ", os::exception_name(si->si_signo, buf, buflen)); duke@435: char *err = strerror(si->si_errno); duke@435: if (si->si_errno != 0 && err != NULL) { duke@435: st->print("si_errno=%s", err); duke@435: } else { duke@435: st->print("si_errno=%d", si->si_errno); duke@435: } duke@435: const int c = si->si_code; duke@435: assert(c > 0, "unexpected si_code"); duke@435: switch (si->si_signo) { duke@435: case SIGILL: duke@435: st->print(", si_code=%d (%s)", c, c > 8 ? "" : ill_names[c]); duke@435: st->print(", si_addr=" PTR_FORMAT, si->si_addr); duke@435: break; duke@435: case SIGFPE: duke@435: st->print(", si_code=%d (%s)", c, c > 9 ? "" : fpe_names[c]); duke@435: st->print(", si_addr=" PTR_FORMAT, si->si_addr); duke@435: break; duke@435: case SIGSEGV: duke@435: st->print(", si_code=%d (%s)", c, c > 2 ? "" : segv_names[c]); duke@435: st->print(", si_addr=" PTR_FORMAT, si->si_addr); duke@435: break; duke@435: case SIGBUS: duke@435: st->print(", si_code=%d (%s)", c, c > 3 ? "" : bus_names[c]); duke@435: st->print(", si_addr=" PTR_FORMAT, si->si_addr); duke@435: break; duke@435: default: duke@435: st->print(", si_code=%d", si->si_code); duke@435: // no si_addr duke@435: } duke@435: duke@435: if ((si->si_signo == SIGBUS || si->si_signo == SIGSEGV) && duke@435: UseSharedSpaces) { duke@435: FileMapInfo* mapinfo = FileMapInfo::current_info(); duke@435: if (mapinfo->is_in_shared_space(si->si_addr)) { duke@435: st->print("\n\nError accessing class data sharing archive." \ duke@435: " Mapped file inaccessible during execution, " \ duke@435: " possible disk/network problem."); duke@435: } duke@435: } duke@435: st->cr(); duke@435: } duke@435: duke@435: // Moved from whole group, because we need them here for diagnostic duke@435: // prints. duke@435: #define OLDMAXSIGNUM 32 duke@435: static int Maxsignum = 0; duke@435: static int *ourSigFlags = NULL; duke@435: duke@435: extern "C" void sigINTRHandler(int, siginfo_t*, void*); duke@435: duke@435: int os::Solaris::get_our_sigflags(int sig) { duke@435: assert(ourSigFlags!=NULL, "signal data structure not initialized"); duke@435: assert(sig > 0 && sig < Maxsignum, "vm signal out of expected range"); duke@435: return ourSigFlags[sig]; duke@435: } duke@435: duke@435: void os::Solaris::set_our_sigflags(int sig, int flags) { duke@435: assert(ourSigFlags!=NULL, "signal data structure not initialized"); duke@435: assert(sig > 0 && sig < Maxsignum, "vm signal out of expected range"); duke@435: ourSigFlags[sig] = flags; duke@435: } duke@435: duke@435: duke@435: static const char* get_signal_handler_name(address handler, duke@435: char* buf, int buflen) { duke@435: int offset; duke@435: bool found = os::dll_address_to_library_name(handler, buf, buflen, &offset); duke@435: if (found) { duke@435: // skip directory names duke@435: const char *p1, *p2; duke@435: p1 = buf; duke@435: size_t len = strlen(os::file_separator()); duke@435: while ((p2 = strstr(p1, os::file_separator())) != NULL) p1 = p2 + len; duke@435: jio_snprintf(buf, buflen, "%s+0x%x", p1, offset); duke@435: } else { duke@435: jio_snprintf(buf, buflen, PTR_FORMAT, handler); duke@435: } duke@435: return buf; duke@435: } duke@435: duke@435: static void print_signal_handler(outputStream* st, int sig, duke@435: char* buf, size_t buflen) { duke@435: struct sigaction sa; duke@435: duke@435: sigaction(sig, NULL, &sa); duke@435: duke@435: st->print("%s: ", os::exception_name(sig, buf, buflen)); duke@435: duke@435: address handler = (sa.sa_flags & SA_SIGINFO) duke@435: ? CAST_FROM_FN_PTR(address, sa.sa_sigaction) duke@435: : CAST_FROM_FN_PTR(address, sa.sa_handler); duke@435: duke@435: if (handler == CAST_FROM_FN_PTR(address, SIG_DFL)) { duke@435: st->print("SIG_DFL"); duke@435: } else if (handler == CAST_FROM_FN_PTR(address, SIG_IGN)) { duke@435: st->print("SIG_IGN"); duke@435: } else { duke@435: st->print("[%s]", get_signal_handler_name(handler, buf, buflen)); duke@435: } duke@435: duke@435: st->print(", sa_mask[0]=" PTR32_FORMAT, *(uint32_t*)&sa.sa_mask); duke@435: duke@435: address rh = VMError::get_resetted_sighandler(sig); duke@435: // May be, handler was resetted by VMError? duke@435: if(rh != NULL) { duke@435: handler = rh; duke@435: sa.sa_flags = VMError::get_resetted_sigflags(sig); duke@435: } duke@435: duke@435: st->print(", sa_flags=" PTR32_FORMAT, sa.sa_flags); duke@435: duke@435: // Check: is it our handler? duke@435: if(handler == CAST_FROM_FN_PTR(address, signalHandler) || duke@435: handler == CAST_FROM_FN_PTR(address, sigINTRHandler)) { duke@435: // It is our signal handler duke@435: // check for flags duke@435: if(sa.sa_flags != os::Solaris::get_our_sigflags(sig)) { duke@435: st->print( duke@435: ", flags was changed from " PTR32_FORMAT ", consider using jsig library", duke@435: os::Solaris::get_our_sigflags(sig)); duke@435: } duke@435: } duke@435: st->cr(); duke@435: } duke@435: duke@435: void os::print_signal_handlers(outputStream* st, char* buf, size_t buflen) { duke@435: st->print_cr("Signal Handlers:"); duke@435: print_signal_handler(st, SIGSEGV, buf, buflen); duke@435: print_signal_handler(st, SIGBUS , buf, buflen); duke@435: print_signal_handler(st, SIGFPE , buf, buflen); duke@435: print_signal_handler(st, SIGPIPE, buf, buflen); duke@435: print_signal_handler(st, SIGXFSZ, buf, buflen); duke@435: print_signal_handler(st, SIGILL , buf, buflen); duke@435: print_signal_handler(st, INTERRUPT_SIGNAL, buf, buflen); duke@435: print_signal_handler(st, ASYNC_SIGNAL, buf, buflen); duke@435: print_signal_handler(st, BREAK_SIGNAL, buf, buflen); duke@435: print_signal_handler(st, SHUTDOWN1_SIGNAL , buf, buflen); duke@435: print_signal_handler(st, SHUTDOWN2_SIGNAL , buf, buflen); duke@435: print_signal_handler(st, SHUTDOWN3_SIGNAL, buf, buflen); duke@435: print_signal_handler(st, os::Solaris::SIGinterrupt(), buf, buflen); duke@435: print_signal_handler(st, os::Solaris::SIGasync(), buf, buflen); duke@435: } duke@435: duke@435: static char saved_jvm_path[MAXPATHLEN] = { 0 }; duke@435: duke@435: // Find the full path to the current module, libjvm.so or libjvm_g.so duke@435: void os::jvm_path(char *buf, jint buflen) { duke@435: // Error checking. duke@435: if (buflen < MAXPATHLEN) { duke@435: assert(false, "must use a large-enough buffer"); duke@435: buf[0] = '\0'; duke@435: return; duke@435: } duke@435: // Lazy resolve the path to current module. duke@435: if (saved_jvm_path[0] != 0) { duke@435: strcpy(buf, saved_jvm_path); duke@435: return; duke@435: } duke@435: duke@435: Dl_info dlinfo; duke@435: int ret = dladdr(CAST_FROM_FN_PTR(void *, os::jvm_path), &dlinfo); duke@435: assert(ret != 0, "cannot locate libjvm"); duke@435: realpath((char *)dlinfo.dli_fname, buf); duke@435: duke@435: if (strcmp(Arguments::sun_java_launcher(), "gamma") == 0) { duke@435: // Support for the gamma launcher. Typical value for buf is duke@435: // "/jre/lib///libjvm.so". If "/jre/lib/" appears at duke@435: // the right place in the string, then assume we are installed in a JDK and duke@435: // we're done. Otherwise, check for a JAVA_HOME environment variable and fix duke@435: // up the path so it looks like libjvm.so is installed there (append a duke@435: // fake suffix hotspot/libjvm.so). duke@435: const char *p = buf + strlen(buf) - 1; duke@435: for (int count = 0; p > buf && count < 5; ++count) { duke@435: for (--p; p > buf && *p != '/'; --p) duke@435: /* empty */ ; duke@435: } duke@435: duke@435: if (strncmp(p, "/jre/lib/", 9) != 0) { duke@435: // Look for JAVA_HOME in the environment. duke@435: char* java_home_var = ::getenv("JAVA_HOME"); duke@435: if (java_home_var != NULL && java_home_var[0] != 0) { duke@435: char cpu_arch[12]; duke@435: sysinfo(SI_ARCHITECTURE, cpu_arch, sizeof(cpu_arch)); duke@435: #ifdef _LP64 duke@435: // If we are on sparc running a 64-bit vm, look in jre/lib/sparcv9. duke@435: if (strcmp(cpu_arch, "sparc") == 0) { duke@435: strcat(cpu_arch, "v9"); duke@435: } else if (strcmp(cpu_arch, "i386") == 0) { duke@435: strcpy(cpu_arch, "amd64"); duke@435: } duke@435: #endif duke@435: // Check the current module name "libjvm.so" or "libjvm_g.so". duke@435: p = strrchr(buf, '/'); duke@435: assert(strstr(p, "/libjvm") == p, "invalid library name"); duke@435: p = strstr(p, "_g") ? "_g" : ""; duke@435: duke@435: realpath(java_home_var, buf); duke@435: sprintf(buf + strlen(buf), "/jre/lib/%s", cpu_arch); duke@435: if (0 == access(buf, F_OK)) { duke@435: // Use current module name "libjvm[_g].so" instead of duke@435: // "libjvm"debug_only("_g")".so" since for fastdebug version duke@435: // we should have "libjvm.so" but debug_only("_g") adds "_g"! duke@435: // It is used when we are choosing the HPI library's name duke@435: // "libhpi[_g].so" in hpi::initialize_get_interface(). duke@435: sprintf(buf + strlen(buf), "/hotspot/libjvm%s.so", p); duke@435: } else { duke@435: // Go back to path of .so duke@435: realpath((char *)dlinfo.dli_fname, buf); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: strcpy(saved_jvm_path, buf); duke@435: } duke@435: duke@435: duke@435: void os::print_jni_name_prefix_on(outputStream* st, int args_size) { duke@435: // no prefix required, not even "_" duke@435: } duke@435: duke@435: duke@435: void os::print_jni_name_suffix_on(outputStream* st, int args_size) { duke@435: // no suffix required duke@435: } duke@435: duke@435: duke@435: // sun.misc.Signal duke@435: duke@435: extern "C" { duke@435: static void UserHandler(int sig, void *siginfo, void *context) { duke@435: // Ctrl-C is pressed during error reporting, likely because the error duke@435: // handler fails to abort. Let VM die immediately. duke@435: if (sig == SIGINT && is_error_reported()) { duke@435: os::die(); duke@435: } duke@435: duke@435: os::signal_notify(sig); duke@435: // We do not need to reinstate the signal handler each time... duke@435: } duke@435: } duke@435: duke@435: void* os::user_handler() { duke@435: return CAST_FROM_FN_PTR(void*, UserHandler); duke@435: } duke@435: duke@435: extern "C" { duke@435: typedef void (*sa_handler_t)(int); duke@435: typedef void (*sa_sigaction_t)(int, siginfo_t *, void *); duke@435: } duke@435: duke@435: void* os::signal(int signal_number, void* handler) { duke@435: struct sigaction sigAct, oldSigAct; duke@435: sigfillset(&(sigAct.sa_mask)); duke@435: sigAct.sa_flags = SA_RESTART & ~SA_RESETHAND; duke@435: sigAct.sa_handler = CAST_TO_FN_PTR(sa_handler_t, handler); duke@435: duke@435: if (sigaction(signal_number, &sigAct, &oldSigAct)) duke@435: // -1 means registration failed duke@435: return (void *)-1; duke@435: duke@435: return CAST_FROM_FN_PTR(void*, oldSigAct.sa_handler); duke@435: } duke@435: duke@435: void os::signal_raise(int signal_number) { duke@435: raise(signal_number); duke@435: } duke@435: duke@435: /* duke@435: * The following code is moved from os.cpp for making this duke@435: * code platform specific, which it is by its very nature. duke@435: */ duke@435: duke@435: // a counter for each possible signal value duke@435: static int Sigexit = 0; duke@435: static int Maxlibjsigsigs; duke@435: static jint *pending_signals = NULL; duke@435: static int *preinstalled_sigs = NULL; duke@435: static struct sigaction *chainedsigactions = NULL; duke@435: static sema_t sig_sem; duke@435: typedef int (*version_getting_t)(); duke@435: version_getting_t os::Solaris::get_libjsig_version = NULL; duke@435: static int libjsigversion = NULL; duke@435: duke@435: int os::sigexitnum_pd() { duke@435: assert(Sigexit > 0, "signal memory not yet initialized"); duke@435: return Sigexit; duke@435: } duke@435: duke@435: void os::Solaris::init_signal_mem() { duke@435: // Initialize signal structures duke@435: Maxsignum = SIGRTMAX; duke@435: Sigexit = Maxsignum+1; duke@435: assert(Maxsignum >0, "Unable to obtain max signal number"); duke@435: duke@435: Maxlibjsigsigs = Maxsignum; duke@435: duke@435: // pending_signals has one int per signal duke@435: // The additional signal is for SIGEXIT - exit signal to signal_thread duke@435: pending_signals = (jint *)os::malloc(sizeof(jint) * (Sigexit+1)); duke@435: memset(pending_signals, 0, (sizeof(jint) * (Sigexit+1))); duke@435: duke@435: if (UseSignalChaining) { duke@435: chainedsigactions = (struct sigaction *)malloc(sizeof(struct sigaction) duke@435: * (Maxsignum + 1)); duke@435: memset(chainedsigactions, 0, (sizeof(struct sigaction) * (Maxsignum + 1))); duke@435: preinstalled_sigs = (int *)os::malloc(sizeof(int) * (Maxsignum + 1)); duke@435: memset(preinstalled_sigs, 0, (sizeof(int) * (Maxsignum + 1))); duke@435: } duke@435: ourSigFlags = (int*)malloc(sizeof(int) * (Maxsignum + 1 )); duke@435: memset(ourSigFlags, 0, sizeof(int) * (Maxsignum + 1)); duke@435: } duke@435: duke@435: void os::signal_init_pd() { duke@435: int ret; duke@435: duke@435: ret = ::sema_init(&sig_sem, 0, NULL, NULL); duke@435: assert(ret == 0, "sema_init() failed"); duke@435: } duke@435: duke@435: void os::signal_notify(int signal_number) { duke@435: int ret; duke@435: duke@435: Atomic::inc(&pending_signals[signal_number]); duke@435: ret = ::sema_post(&sig_sem); duke@435: assert(ret == 0, "sema_post() failed"); duke@435: } duke@435: duke@435: static int check_pending_signals(bool wait_for_signal) { duke@435: int ret; duke@435: while (true) { duke@435: for (int i = 0; i < Sigexit + 1; i++) { duke@435: jint n = pending_signals[i]; duke@435: if (n > 0 && n == Atomic::cmpxchg(n - 1, &pending_signals[i], n)) { duke@435: return i; duke@435: } duke@435: } duke@435: if (!wait_for_signal) { duke@435: return -1; duke@435: } duke@435: JavaThread *thread = JavaThread::current(); duke@435: ThreadBlockInVM tbivm(thread); duke@435: duke@435: bool threadIsSuspended; duke@435: do { duke@435: thread->set_suspend_equivalent(); duke@435: // cleared by handle_special_suspend_equivalent_condition() or java_suspend_self() duke@435: while((ret = ::sema_wait(&sig_sem)) == EINTR) duke@435: ; duke@435: assert(ret == 0, "sema_wait() failed"); duke@435: duke@435: // were we externally suspended while we were waiting? duke@435: threadIsSuspended = thread->handle_special_suspend_equivalent_condition(); duke@435: if (threadIsSuspended) { duke@435: // duke@435: // The semaphore has been incremented, but while we were waiting duke@435: // another thread suspended us. We don't want to continue running duke@435: // while suspended because that would surprise the thread that duke@435: // suspended us. duke@435: // duke@435: ret = ::sema_post(&sig_sem); duke@435: assert(ret == 0, "sema_post() failed"); duke@435: duke@435: thread->java_suspend_self(); duke@435: } duke@435: } while (threadIsSuspended); duke@435: } duke@435: } duke@435: duke@435: int os::signal_lookup() { duke@435: return check_pending_signals(false); duke@435: } duke@435: duke@435: int os::signal_wait() { duke@435: return check_pending_signals(true); duke@435: } duke@435: duke@435: //////////////////////////////////////////////////////////////////////////////// duke@435: // Virtual Memory duke@435: duke@435: static int page_size = -1; duke@435: duke@435: // The mmap MAP_ALIGN flag is supported on Solaris 9 and later. init_2() will duke@435: // clear this var if support is not available. duke@435: static bool has_map_align = true; duke@435: duke@435: int os::vm_page_size() { duke@435: assert(page_size != -1, "must call os::init"); duke@435: return page_size; duke@435: } duke@435: duke@435: // Solaris allocates memory by pages. duke@435: int os::vm_allocation_granularity() { duke@435: assert(page_size != -1, "must call os::init"); duke@435: return page_size; duke@435: } duke@435: duke@435: bool os::commit_memory(char* addr, size_t bytes) { duke@435: size_t size = bytes; duke@435: return duke@435: NULL != Solaris::mmap_chunk(addr, size, MAP_PRIVATE|MAP_FIXED, duke@435: PROT_READ | PROT_WRITE | PROT_EXEC); duke@435: } duke@435: duke@435: bool os::commit_memory(char* addr, size_t bytes, size_t alignment_hint) { duke@435: if (commit_memory(addr, bytes)) { duke@435: if (UseMPSS && alignment_hint > (size_t)vm_page_size()) { duke@435: // If the large page size has been set and the VM duke@435: // is using large pages, use the large page size duke@435: // if it is smaller than the alignment hint. This is duke@435: // a case where the VM wants to use a larger alignment size duke@435: // for its own reasons but still want to use large pages duke@435: // (which is what matters to setting the mpss range. duke@435: size_t page_size = 0; duke@435: if (large_page_size() < alignment_hint) { duke@435: assert(UseLargePages, "Expected to be here for large page use only"); duke@435: page_size = large_page_size(); duke@435: } else { duke@435: // If the alignment hint is less than the large page duke@435: // size, the VM wants a particular alignment (thus the hint) duke@435: // for internal reasons. Try to set the mpss range using duke@435: // the alignment_hint. duke@435: page_size = alignment_hint; duke@435: } duke@435: // Since this is a hint, ignore any failures. duke@435: (void)Solaris::set_mpss_range(addr, bytes, page_size); duke@435: } duke@435: return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: // Uncommit the pages in a specified region. duke@435: void os::free_memory(char* addr, size_t bytes) { duke@435: if (madvise(addr, bytes, MADV_FREE) < 0) { duke@435: debug_only(warning("MADV_FREE failed.")); duke@435: return; duke@435: } duke@435: } duke@435: duke@435: // Change the page size in a given range. duke@435: void os::realign_memory(char *addr, size_t bytes, size_t alignment_hint) { duke@435: assert((intptr_t)addr % alignment_hint == 0, "Address should be aligned."); duke@435: assert((intptr_t)(addr + bytes) % alignment_hint == 0, "End should be aligned."); duke@435: Solaris::set_mpss_range(addr, bytes, alignment_hint); duke@435: } duke@435: duke@435: // Tell the OS to make the range local to the first-touching LWP iveresov@576: void os::numa_make_local(char *addr, size_t bytes, int lgrp_hint) { duke@435: assert((intptr_t)addr % os::vm_page_size() == 0, "Address should be page-aligned."); duke@435: if (madvise(addr, bytes, MADV_ACCESS_LWP) < 0) { duke@435: debug_only(warning("MADV_ACCESS_LWP failed.")); duke@435: } duke@435: } duke@435: duke@435: // Tell the OS that this range would be accessed from different LWPs. duke@435: void os::numa_make_global(char *addr, size_t bytes) { duke@435: assert((intptr_t)addr % os::vm_page_size() == 0, "Address should be page-aligned."); duke@435: if (madvise(addr, bytes, MADV_ACCESS_MANY) < 0) { duke@435: debug_only(warning("MADV_ACCESS_MANY failed.")); duke@435: } duke@435: } duke@435: duke@435: // Get the number of the locality groups. duke@435: size_t os::numa_get_groups_num() { duke@435: size_t n = Solaris::lgrp_nlgrps(Solaris::lgrp_cookie()); duke@435: return n != -1 ? n : 1; duke@435: } duke@435: duke@435: // Get a list of leaf locality groups. A leaf lgroup is group that duke@435: // doesn't have any children. Typical leaf group is a CPU or a CPU/memory duke@435: // board. An LWP is assigned to one of these groups upon creation. duke@435: size_t os::numa_get_leaf_groups(int *ids, size_t size) { duke@435: if ((ids[0] = Solaris::lgrp_root(Solaris::lgrp_cookie())) == -1) { duke@435: ids[0] = 0; duke@435: return 1; duke@435: } duke@435: int result_size = 0, top = 1, bottom = 0, cur = 0; duke@435: for (int k = 0; k < size; k++) { duke@435: int r = Solaris::lgrp_children(Solaris::lgrp_cookie(), ids[cur], duke@435: (Solaris::lgrp_id_t*)&ids[top], size - top); duke@435: if (r == -1) { duke@435: ids[0] = 0; duke@435: return 1; duke@435: } duke@435: if (!r) { iveresov@579: // That's a leaf node. duke@435: assert (bottom <= cur, "Sanity check"); iveresov@579: // Check if the node has memory iveresov@579: if (Solaris::lgrp_resources(Solaris::lgrp_cookie(), ids[cur], iveresov@579: NULL, 0, LGRP_RSRC_MEM) > 0) { iveresov@579: ids[bottom++] = ids[cur]; iveresov@579: } duke@435: } duke@435: top += r; duke@435: cur++; duke@435: } duke@435: return bottom; duke@435: } duke@435: duke@435: // Detect the topology change. Typically happens during CPU pluggin-unplugging. duke@435: bool os::numa_topology_changed() { duke@435: int is_stale = Solaris::lgrp_cookie_stale(Solaris::lgrp_cookie()); duke@435: if (is_stale != -1 && is_stale) { duke@435: Solaris::lgrp_fini(Solaris::lgrp_cookie()); duke@435: Solaris::lgrp_cookie_t c = Solaris::lgrp_init(Solaris::LGRP_VIEW_CALLER); duke@435: assert(c != 0, "Failure to initialize LGRP API"); duke@435: Solaris::set_lgrp_cookie(c); duke@435: return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: // Get the group id of the current LWP. duke@435: int os::numa_get_group_id() { iveresov@579: int lgrp_id = Solaris::lgrp_home(P_LWPID, P_MYID); duke@435: if (lgrp_id == -1) { duke@435: return 0; duke@435: } iveresov@579: const int size = os::numa_get_groups_num(); iveresov@579: int *ids = (int*)alloca(size * sizeof(int)); iveresov@579: iveresov@579: // Get the ids of all lgroups with memory; r is the count. iveresov@579: int r = Solaris::lgrp_resources(Solaris::lgrp_cookie(), lgrp_id, iveresov@579: (Solaris::lgrp_id_t*)ids, size, LGRP_RSRC_MEM); iveresov@579: if (r <= 0) { iveresov@579: return 0; iveresov@579: } iveresov@579: return ids[os::random() % r]; duke@435: } duke@435: duke@435: // Request information about the page. duke@435: bool os::get_page_info(char *start, page_info* info) { duke@435: const uint_t info_types[] = { MEMINFO_VLGRP, MEMINFO_VPAGESIZE }; duke@435: uint64_t addr = (uintptr_t)start; duke@435: uint64_t outdata[2]; duke@435: uint_t validity = 0; duke@435: duke@435: if (os::Solaris::meminfo(&addr, 1, info_types, 2, outdata, &validity) < 0) { duke@435: return false; duke@435: } duke@435: duke@435: info->size = 0; duke@435: info->lgrp_id = -1; duke@435: duke@435: if ((validity & 1) != 0) { duke@435: if ((validity & 2) != 0) { duke@435: info->lgrp_id = outdata[0]; duke@435: } duke@435: if ((validity & 4) != 0) { duke@435: info->size = outdata[1]; duke@435: } duke@435: return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: // Scan the pages from start to end until a page different than duke@435: // the one described in the info parameter is encountered. duke@435: char *os::scan_pages(char *start, char* end, page_info* page_expected, page_info* page_found) { duke@435: const uint_t info_types[] = { MEMINFO_VLGRP, MEMINFO_VPAGESIZE }; duke@435: const size_t types = sizeof(info_types) / sizeof(info_types[0]); duke@435: uint64_t addrs[MAX_MEMINFO_CNT], outdata[types * MAX_MEMINFO_CNT]; duke@435: uint_t validity[MAX_MEMINFO_CNT]; duke@435: duke@435: size_t page_size = MAX2((size_t)os::vm_page_size(), page_expected->size); duke@435: uint64_t p = (uint64_t)start; duke@435: while (p < (uint64_t)end) { duke@435: addrs[0] = p; duke@435: size_t addrs_count = 1; duke@435: while (addrs_count < MAX_MEMINFO_CNT && addrs[addrs_count - 1] < (uint64_t)end) { duke@435: addrs[addrs_count] = addrs[addrs_count - 1] + page_size; duke@435: addrs_count++; duke@435: } duke@435: duke@435: if (os::Solaris::meminfo(addrs, addrs_count, info_types, types, outdata, validity) < 0) { duke@435: return NULL; duke@435: } duke@435: duke@435: size_t i = 0; duke@435: for (; i < addrs_count; i++) { duke@435: if ((validity[i] & 1) != 0) { duke@435: if ((validity[i] & 4) != 0) { duke@435: if (outdata[types * i + 1] != page_expected->size) { duke@435: break; duke@435: } duke@435: } else duke@435: if (page_expected->size != 0) { duke@435: break; duke@435: } duke@435: duke@435: if ((validity[i] & 2) != 0 && page_expected->lgrp_id > 0) { duke@435: if (outdata[types * i] != page_expected->lgrp_id) { duke@435: break; duke@435: } duke@435: } duke@435: } else { duke@435: return NULL; duke@435: } duke@435: } duke@435: duke@435: if (i != addrs_count) { duke@435: if ((validity[i] & 2) != 0) { duke@435: page_found->lgrp_id = outdata[types * i]; duke@435: } else { duke@435: page_found->lgrp_id = -1; duke@435: } duke@435: if ((validity[i] & 4) != 0) { duke@435: page_found->size = outdata[types * i + 1]; duke@435: } else { duke@435: page_found->size = 0; duke@435: } duke@435: return (char*)addrs[i]; duke@435: } duke@435: duke@435: p = addrs[addrs_count - 1] + page_size; duke@435: } duke@435: return end; duke@435: } duke@435: duke@435: bool os::uncommit_memory(char* addr, size_t bytes) { duke@435: size_t size = bytes; duke@435: // Map uncommitted pages PROT_NONE so we fail early if we touch an duke@435: // uncommitted page. Otherwise, the read/write might succeed if we duke@435: // have enough swap space to back the physical page. duke@435: return duke@435: NULL != Solaris::mmap_chunk(addr, size, duke@435: MAP_PRIVATE|MAP_FIXED|MAP_NORESERVE, duke@435: PROT_NONE); duke@435: } duke@435: duke@435: char* os::Solaris::mmap_chunk(char *addr, size_t size, int flags, int prot) { duke@435: char *b = (char *)mmap(addr, size, prot, flags, os::Solaris::_dev_zero_fd, 0); duke@435: duke@435: if (b == MAP_FAILED) { duke@435: return NULL; duke@435: } duke@435: return b; duke@435: } duke@435: sbohne@495: char* os::Solaris::anon_mmap(char* requested_addr, size_t bytes, size_t alignment_hint, bool fixed) { sbohne@495: char* addr = requested_addr; sbohne@495: int flags = MAP_PRIVATE | MAP_NORESERVE; sbohne@495: sbohne@495: assert(!(fixed && (alignment_hint > 0)), "alignment hint meaningless with fixed mmap"); sbohne@495: sbohne@495: if (fixed) { sbohne@495: flags |= MAP_FIXED; sbohne@495: } else if (has_map_align && (alignment_hint > (size_t) vm_page_size())) { duke@435: flags |= MAP_ALIGN; duke@435: addr = (char*) alignment_hint; duke@435: } duke@435: duke@435: // Map uncommitted pages PROT_NONE so we fail early if we touch an duke@435: // uncommitted page. Otherwise, the read/write might succeed if we duke@435: // have enough swap space to back the physical page. sbohne@495: return mmap_chunk(addr, bytes, flags, PROT_NONE); sbohne@495: } sbohne@495: sbohne@495: char* os::reserve_memory(size_t bytes, char* requested_addr, size_t alignment_hint) { sbohne@495: char* addr = Solaris::anon_mmap(requested_addr, bytes, alignment_hint, (requested_addr != NULL)); duke@435: duke@435: guarantee(requested_addr == NULL || requested_addr == addr, duke@435: "OS failed to return requested mmap address."); duke@435: return addr; duke@435: } duke@435: duke@435: // Reserve memory at an arbitrary address, only if that area is duke@435: // available (and not reserved for something else). duke@435: duke@435: char* os::attempt_reserve_memory_at(size_t bytes, char* requested_addr) { duke@435: const int max_tries = 10; duke@435: char* base[max_tries]; duke@435: size_t size[max_tries]; duke@435: duke@435: // Solaris adds a gap between mmap'ed regions. The size of the gap duke@435: // is dependent on the requested size and the MMU. Our initial gap duke@435: // value here is just a guess and will be corrected later. duke@435: bool had_top_overlap = false; duke@435: bool have_adjusted_gap = false; duke@435: size_t gap = 0x400000; duke@435: duke@435: // Assert only that the size is a multiple of the page size, since duke@435: // that's all that mmap requires, and since that's all we really know duke@435: // about at this low abstraction level. If we need higher alignment, duke@435: // we can either pass an alignment to this method or verify alignment duke@435: // in one of the methods further up the call chain. See bug 5044738. duke@435: assert(bytes % os::vm_page_size() == 0, "reserving unexpected size block"); duke@435: sbohne@495: // Since snv_84, Solaris attempts to honor the address hint - see 5003415. sbohne@495: // Give it a try, if the kernel honors the hint we can return immediately. sbohne@495: char* addr = Solaris::anon_mmap(requested_addr, bytes, 0, false); sbohne@495: volatile int err = errno; sbohne@495: if (addr == requested_addr) { sbohne@495: return addr; sbohne@495: } else if (addr != NULL) { sbohne@495: unmap_memory(addr, bytes); sbohne@495: } sbohne@495: sbohne@495: if (PrintMiscellaneous && Verbose) { sbohne@495: char buf[256]; sbohne@495: buf[0] = '\0'; sbohne@495: if (addr == NULL) { sbohne@495: jio_snprintf(buf, sizeof(buf), ": %s", strerror(err)); sbohne@495: } sbohne@495: warning("attempt_reserve_memory_at: couldn't reserve %d bytes at " sbohne@495: PTR_FORMAT ": reserve_memory_helper returned " PTR_FORMAT sbohne@495: "%s", bytes, requested_addr, addr, buf); sbohne@495: } sbohne@495: sbohne@495: // Address hint method didn't work. Fall back to the old method. sbohne@495: // In theory, once SNV becomes our oldest supported platform, this sbohne@495: // code will no longer be needed. sbohne@495: // duke@435: // Repeatedly allocate blocks until the block is allocated at the duke@435: // right spot. Give up after max_tries. duke@435: int i; duke@435: for (i = 0; i < max_tries; ++i) { duke@435: base[i] = reserve_memory(bytes); duke@435: duke@435: if (base[i] != NULL) { duke@435: // Is this the block we wanted? duke@435: if (base[i] == requested_addr) { duke@435: size[i] = bytes; duke@435: break; duke@435: } duke@435: duke@435: // check that the gap value is right duke@435: if (had_top_overlap && !have_adjusted_gap) { duke@435: size_t actual_gap = base[i-1] - base[i] - bytes; duke@435: if (gap != actual_gap) { duke@435: // adjust the gap value and retry the last 2 allocations duke@435: assert(i > 0, "gap adjustment code problem"); duke@435: have_adjusted_gap = true; // adjust the gap only once, just in case duke@435: gap = actual_gap; duke@435: if (PrintMiscellaneous && Verbose) { duke@435: warning("attempt_reserve_memory_at: adjusted gap to 0x%lx", gap); duke@435: } duke@435: unmap_memory(base[i], bytes); duke@435: unmap_memory(base[i-1], size[i-1]); duke@435: i-=2; duke@435: continue; duke@435: } duke@435: } duke@435: duke@435: // Does this overlap the block we wanted? Give back the overlapped duke@435: // parts and try again. duke@435: // duke@435: // There is still a bug in this code: if top_overlap == bytes, duke@435: // the overlap is offset from requested region by the value of gap. duke@435: // In this case giving back the overlapped part will not work, duke@435: // because we'll give back the entire block at base[i] and duke@435: // therefore the subsequent allocation will not generate a new gap. duke@435: // This could be fixed with a new algorithm that used larger duke@435: // or variable size chunks to find the requested region - duke@435: // but such a change would introduce additional complications. duke@435: // It's rare enough that the planets align for this bug, duke@435: // so we'll just wait for a fix for 6204603/5003415 which duke@435: // will provide a mmap flag to allow us to avoid this business. duke@435: duke@435: size_t top_overlap = requested_addr + (bytes + gap) - base[i]; duke@435: if (top_overlap >= 0 && top_overlap < bytes) { duke@435: had_top_overlap = true; duke@435: unmap_memory(base[i], top_overlap); duke@435: base[i] += top_overlap; duke@435: size[i] = bytes - top_overlap; duke@435: } else { duke@435: size_t bottom_overlap = base[i] + bytes - requested_addr; duke@435: if (bottom_overlap >= 0 && bottom_overlap < bytes) { duke@435: if (PrintMiscellaneous && Verbose && bottom_overlap == 0) { duke@435: warning("attempt_reserve_memory_at: possible alignment bug"); duke@435: } duke@435: unmap_memory(requested_addr, bottom_overlap); duke@435: size[i] = bytes - bottom_overlap; duke@435: } else { duke@435: size[i] = bytes; duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Give back the unused reserved pieces. duke@435: duke@435: for (int j = 0; j < i; ++j) { duke@435: if (base[j] != NULL) { duke@435: unmap_memory(base[j], size[j]); duke@435: } duke@435: } duke@435: duke@435: return (i < max_tries) ? requested_addr : NULL; duke@435: } duke@435: duke@435: bool os::release_memory(char* addr, size_t bytes) { duke@435: size_t size = bytes; duke@435: return munmap(addr, size) == 0; duke@435: } duke@435: duke@435: static bool solaris_mprotect(char* addr, size_t bytes, int prot) { duke@435: assert(addr == (char*)align_size_down((uintptr_t)addr, os::vm_page_size()), duke@435: "addr must be page aligned"); duke@435: int retVal = mprotect(addr, bytes, prot); duke@435: return retVal == 0; duke@435: } duke@435: duke@435: // Protect memory (make it read-only. (Used to pass readonly pages through duke@435: // JNI GetArrayElements with empty arrays.) duke@435: bool os::protect_memory(char* addr, size_t bytes) { duke@435: return solaris_mprotect(addr, bytes, PROT_READ); duke@435: } duke@435: duke@435: // guard_memory and unguard_memory only happens within stack guard pages. duke@435: // Since ISM pertains only to the heap, guard and unguard memory should not duke@435: /// happen with an ISM region. duke@435: bool os::guard_memory(char* addr, size_t bytes) { duke@435: return solaris_mprotect(addr, bytes, PROT_NONE); duke@435: } duke@435: duke@435: bool os::unguard_memory(char* addr, size_t bytes) { duke@435: return solaris_mprotect(addr, bytes, PROT_READ|PROT_WRITE|PROT_EXEC); duke@435: } duke@435: duke@435: // Large page support duke@435: duke@435: // UseLargePages is the master flag to enable/disable large page memory. duke@435: // UseMPSS and UseISM are supported for compatibility reasons. Their combined duke@435: // effects can be described in the following table: duke@435: // duke@435: // UseLargePages UseMPSS UseISM duke@435: // false * * => UseLargePages is the master switch, turning duke@435: // it off will turn off both UseMPSS and duke@435: // UseISM. VM will not use large page memory duke@435: // regardless the settings of UseMPSS/UseISM. duke@435: // true false false => Unless future Solaris provides other duke@435: // mechanism to use large page memory, this duke@435: // combination is equivalent to -UseLargePages, duke@435: // VM will not use large page memory duke@435: // true true false => JVM will use MPSS for large page memory. duke@435: // This is the default behavior. duke@435: // true false true => JVM will use ISM for large page memory. duke@435: // true true true => JVM will use ISM if it is available. duke@435: // Otherwise, JVM will fall back to MPSS. duke@435: // Becaues ISM is now available on all duke@435: // supported Solaris versions, this combination duke@435: // is equivalent to +UseISM -UseMPSS. duke@435: duke@435: typedef int (*getpagesizes_func_type) (size_t[], int); duke@435: static size_t _large_page_size = 0; duke@435: duke@435: bool os::Solaris::ism_sanity_check(bool warn, size_t * page_size) { duke@435: // x86 uses either 2M or 4M page, depending on whether PAE (Physical Address duke@435: // Extensions) mode is enabled. AMD64/EM64T uses 2M page in 64bit mode. Sparc duke@435: // can support multiple page sizes. duke@435: duke@435: // Don't bother to probe page size because getpagesizes() comes with MPSS. duke@435: // ISM is only recommended on old Solaris where there is no MPSS support. duke@435: // Simply choose a conservative value as default. duke@435: *page_size = LargePageSizeInBytes ? LargePageSizeInBytes : duke@435: SPARC_ONLY(4 * M) IA32_ONLY(4 * M) AMD64_ONLY(2 * M); duke@435: duke@435: // ISM is available on all supported Solaris versions duke@435: return true; duke@435: } duke@435: duke@435: // Insertion sort for small arrays (descending order). duke@435: static void insertion_sort_descending(size_t* array, int len) { duke@435: for (int i = 0; i < len; i++) { duke@435: size_t val = array[i]; duke@435: for (size_t key = i; key > 0 && array[key - 1] < val; --key) { duke@435: size_t tmp = array[key]; duke@435: array[key] = array[key - 1]; duke@435: array[key - 1] = tmp; duke@435: } duke@435: } duke@435: } duke@435: duke@435: bool os::Solaris::mpss_sanity_check(bool warn, size_t * page_size) { duke@435: getpagesizes_func_type getpagesizes_func = duke@435: CAST_TO_FN_PTR(getpagesizes_func_type, dlsym(RTLD_DEFAULT, "getpagesizes")); duke@435: if (getpagesizes_func == NULL) { duke@435: if (warn) { duke@435: warning("MPSS is not supported by the operating system."); duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: const unsigned int usable_count = VM_Version::page_size_count(); duke@435: if (usable_count == 1) { duke@435: return false; duke@435: } duke@435: duke@435: // Fill the array of page sizes. duke@435: int n = getpagesizes_func(_page_sizes, page_sizes_max); duke@435: assert(n > 0, "Solaris bug?"); duke@435: if (n == page_sizes_max) { duke@435: // Add a sentinel value (necessary only if the array was completely filled duke@435: // since it is static (zeroed at initialization)). duke@435: _page_sizes[--n] = 0; duke@435: DEBUG_ONLY(warning("increase the size of the os::_page_sizes array.");) duke@435: } duke@435: assert(_page_sizes[n] == 0, "missing sentinel"); duke@435: duke@435: if (n == 1) return false; // Only one page size available. duke@435: duke@435: // Skip sizes larger than 4M (or LargePageSizeInBytes if it was set) and duke@435: // select up to usable_count elements. First sort the array, find the first duke@435: // acceptable value, then copy the usable sizes to the top of the array and duke@435: // trim the rest. Make sure to include the default page size :-). duke@435: // duke@435: // A better policy could get rid of the 4M limit by taking the sizes of the duke@435: // important VM memory regions (java heap and possibly the code cache) into duke@435: // account. duke@435: insertion_sort_descending(_page_sizes, n); duke@435: const size_t size_limit = duke@435: FLAG_IS_DEFAULT(LargePageSizeInBytes) ? 4 * M : LargePageSizeInBytes; duke@435: int beg; duke@435: for (beg = 0; beg < n && _page_sizes[beg] > size_limit; ++beg) /* empty */ ; duke@435: const int end = MIN2((int)usable_count, n) - 1; duke@435: for (int cur = 0; cur < end; ++cur, ++beg) { duke@435: _page_sizes[cur] = _page_sizes[beg]; duke@435: } duke@435: _page_sizes[end] = vm_page_size(); duke@435: _page_sizes[end + 1] = 0; duke@435: duke@435: if (_page_sizes[end] > _page_sizes[end - 1]) { duke@435: // Default page size is not the smallest; sort again. duke@435: insertion_sort_descending(_page_sizes, end + 1); duke@435: } duke@435: *page_size = _page_sizes[0]; duke@435: duke@435: return true; duke@435: } duke@435: duke@435: bool os::large_page_init() { duke@435: if (!UseLargePages) { duke@435: UseISM = false; duke@435: UseMPSS = false; duke@435: return false; duke@435: } duke@435: duke@435: // print a warning if any large page related flag is specified on command line duke@435: bool warn_on_failure = !FLAG_IS_DEFAULT(UseLargePages) || duke@435: !FLAG_IS_DEFAULT(UseISM) || duke@435: !FLAG_IS_DEFAULT(UseMPSS) || duke@435: !FLAG_IS_DEFAULT(LargePageSizeInBytes); duke@435: UseISM = UseISM && duke@435: Solaris::ism_sanity_check(warn_on_failure, &_large_page_size); duke@435: if (UseISM) { duke@435: // ISM disables MPSS to be compatible with old JDK behavior duke@435: UseMPSS = false; jcoomes@514: _page_sizes[0] = _large_page_size; jcoomes@514: _page_sizes[1] = vm_page_size(); duke@435: } duke@435: duke@435: UseMPSS = UseMPSS && duke@435: Solaris::mpss_sanity_check(warn_on_failure, &_large_page_size); duke@435: duke@435: UseLargePages = UseISM || UseMPSS; duke@435: return UseLargePages; duke@435: } duke@435: duke@435: bool os::Solaris::set_mpss_range(caddr_t start, size_t bytes, size_t align) { duke@435: // Signal to OS that we want large pages for addresses duke@435: // from addr, addr + bytes duke@435: struct memcntl_mha mpss_struct; duke@435: mpss_struct.mha_cmd = MHA_MAPSIZE_VA; duke@435: mpss_struct.mha_pagesize = align; duke@435: mpss_struct.mha_flags = 0; duke@435: if (memcntl(start, bytes, MC_HAT_ADVISE, duke@435: (caddr_t) &mpss_struct, 0, 0) < 0) { duke@435: debug_only(warning("Attempt to use MPSS failed.")); duke@435: return false; duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: char* os::reserve_memory_special(size_t bytes) { duke@435: assert(UseLargePages && UseISM, "only for ISM large pages"); duke@435: duke@435: size_t size = bytes; duke@435: char* retAddr = NULL; duke@435: int shmid; duke@435: key_t ismKey; duke@435: duke@435: bool warn_on_failure = UseISM && duke@435: (!FLAG_IS_DEFAULT(UseLargePages) || duke@435: !FLAG_IS_DEFAULT(UseISM) || duke@435: !FLAG_IS_DEFAULT(LargePageSizeInBytes) duke@435: ); duke@435: char msg[128]; duke@435: duke@435: ismKey = IPC_PRIVATE; duke@435: duke@435: // Create a large shared memory region to attach to based on size. duke@435: // Currently, size is the total size of the heap duke@435: shmid = shmget(ismKey, size, SHM_R | SHM_W | IPC_CREAT); duke@435: if (shmid == -1){ duke@435: if (warn_on_failure) { duke@435: jio_snprintf(msg, sizeof(msg), "Failed to reserve shared memory (errno = %d).", errno); duke@435: warning(msg); duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: // Attach to the region duke@435: retAddr = (char *) shmat(shmid, 0, SHM_SHARE_MMU | SHM_R | SHM_W); duke@435: int err = errno; duke@435: duke@435: // Remove shmid. If shmat() is successful, the actual shared memory segment duke@435: // will be deleted when it's detached by shmdt() or when the process duke@435: // terminates. If shmat() is not successful this will remove the shared duke@435: // segment immediately. duke@435: shmctl(shmid, IPC_RMID, NULL); duke@435: duke@435: if (retAddr == (char *) -1) { duke@435: if (warn_on_failure) { duke@435: jio_snprintf(msg, sizeof(msg), "Failed to attach shared memory (errno = %d).", err); duke@435: warning(msg); duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: return retAddr; duke@435: } duke@435: duke@435: bool os::release_memory_special(char* base, size_t bytes) { duke@435: // detaching the SHM segment will also delete it, see reserve_memory_special() duke@435: int rslt = shmdt(base); duke@435: return rslt == 0; duke@435: } duke@435: duke@435: size_t os::large_page_size() { duke@435: return _large_page_size; duke@435: } duke@435: duke@435: // MPSS allows application to commit large page memory on demand; with ISM duke@435: // the entire memory region must be allocated as shared memory. duke@435: bool os::can_commit_large_page_memory() { duke@435: return UseISM ? false : true; duke@435: } duke@435: jcoomes@514: bool os::can_execute_large_page_memory() { jcoomes@514: return UseISM ? false : true; jcoomes@514: } jcoomes@514: duke@435: static int os_sleep(jlong millis, bool interruptible) { duke@435: const jlong limit = INT_MAX; duke@435: jlong prevtime; duke@435: int res; duke@435: duke@435: while (millis > limit) { duke@435: if ((res = os_sleep(limit, interruptible)) != OS_OK) duke@435: return res; duke@435: millis -= limit; duke@435: } duke@435: duke@435: // Restart interrupted polls with new parameters until the proper delay duke@435: // has been completed. duke@435: duke@435: prevtime = getTimeMillis(); duke@435: duke@435: while (millis > 0) { duke@435: jlong newtime; duke@435: duke@435: if (!interruptible) { duke@435: // Following assert fails for os::yield_all: duke@435: // assert(!thread->is_Java_thread(), "must not be java thread"); duke@435: res = poll(NULL, 0, millis); duke@435: } else { duke@435: JavaThread *jt = JavaThread::current(); duke@435: duke@435: INTERRUPTIBLE_NORESTART_VM_ALWAYS(poll(NULL, 0, millis), res, jt, duke@435: os::Solaris::clear_interrupted); duke@435: } duke@435: duke@435: // INTERRUPTIBLE_NORESTART_VM_ALWAYS returns res == OS_INTRPT for duke@435: // thread.Interrupt. duke@435: duke@435: if((res == OS_ERR) && (errno == EINTR)) { duke@435: newtime = getTimeMillis(); duke@435: assert(newtime >= prevtime, "time moving backwards"); duke@435: /* Doing prevtime and newtime in microseconds doesn't help precision, duke@435: and trying to round up to avoid lost milliseconds can result in a duke@435: too-short delay. */ duke@435: millis -= newtime - prevtime; duke@435: if(millis <= 0) duke@435: return OS_OK; duke@435: prevtime = newtime; duke@435: } else duke@435: return res; duke@435: } duke@435: duke@435: return OS_OK; duke@435: } duke@435: duke@435: // Read calls from inside the vm need to perform state transitions duke@435: size_t os::read(int fd, void *buf, unsigned int nBytes) { duke@435: INTERRUPTIBLE_RETURN_INT_VM(::read(fd, buf, nBytes), os::Solaris::clear_interrupted); duke@435: } duke@435: duke@435: int os::sleep(Thread* thread, jlong millis, bool interruptible) { duke@435: assert(thread == Thread::current(), "thread consistency check"); duke@435: duke@435: // TODO-FIXME: this should be removed. duke@435: // On Solaris machines (especially 2.5.1) we found that sometimes the VM gets into a live lock duke@435: // situation with a JavaThread being starved out of a lwp. The kernel doesn't seem to generate duke@435: // a SIGWAITING signal which would enable the threads library to create a new lwp for the starving duke@435: // thread. We suspect that because the Watcher thread keeps waking up at periodic intervals the kernel duke@435: // is fooled into believing that the system is making progress. In the code below we block the duke@435: // the watcher thread while safepoint is in progress so that it would not appear as though the duke@435: // system is making progress. duke@435: if (!Solaris::T2_libthread() && duke@435: thread->is_Watcher_thread() && SafepointSynchronize::is_synchronizing() && !Arguments::has_profile()) { duke@435: // We now try to acquire the threads lock. Since this lock is held by the VM thread during duke@435: // the entire safepoint, the watcher thread will line up here during the safepoint. duke@435: Threads_lock->lock_without_safepoint_check(); duke@435: Threads_lock->unlock(); duke@435: } duke@435: duke@435: if (thread->is_Java_thread()) { duke@435: // This is a JavaThread so we honor the _thread_blocked protocol duke@435: // even for sleeps of 0 milliseconds. This was originally done duke@435: // as a workaround for bug 4338139. However, now we also do it duke@435: // to honor the suspend-equivalent protocol. duke@435: duke@435: JavaThread *jt = (JavaThread *) thread; duke@435: ThreadBlockInVM tbivm(jt); duke@435: duke@435: jt->set_suspend_equivalent(); duke@435: // cleared by handle_special_suspend_equivalent_condition() or duke@435: // java_suspend_self() via check_and_wait_while_suspended() duke@435: duke@435: int ret_code; duke@435: if (millis <= 0) { duke@435: thr_yield(); duke@435: ret_code = 0; duke@435: } else { duke@435: // The original sleep() implementation did not create an duke@435: // OSThreadWaitState helper for sleeps of 0 milliseconds. duke@435: // I'm preserving that decision for now. duke@435: OSThreadWaitState osts(jt->osthread(), false /* not Object.wait() */); duke@435: duke@435: ret_code = os_sleep(millis, interruptible); duke@435: } duke@435: duke@435: // were we externally suspended while we were waiting? duke@435: jt->check_and_wait_while_suspended(); duke@435: duke@435: return ret_code; duke@435: } duke@435: duke@435: // non-JavaThread from this point on: duke@435: duke@435: if (millis <= 0) { duke@435: thr_yield(); duke@435: return 0; duke@435: } duke@435: duke@435: OSThreadWaitState osts(thread->osthread(), false /* not Object.wait() */); duke@435: duke@435: return os_sleep(millis, interruptible); duke@435: } duke@435: duke@435: int os::naked_sleep() { duke@435: // %% make the sleep time an integer flag. for now use 1 millisec. duke@435: return os_sleep(1, false); duke@435: } duke@435: duke@435: // Sleep forever; naked call to OS-specific sleep; use with CAUTION duke@435: void os::infinite_sleep() { duke@435: while (true) { // sleep forever ... duke@435: ::sleep(100); // ... 100 seconds at a time duke@435: } duke@435: } duke@435: duke@435: // Used to convert frequent JVM_Yield() to nops duke@435: bool os::dont_yield() { duke@435: if (DontYieldALot) { duke@435: static hrtime_t last_time = 0; duke@435: hrtime_t diff = getTimeNanos() - last_time; duke@435: duke@435: if (diff < DontYieldALotInterval * 1000000) duke@435: return true; duke@435: duke@435: last_time += diff; duke@435: duke@435: return false; duke@435: } duke@435: else { duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: // Caveat: Solaris os::yield() causes a thread-state transition whereas duke@435: // the linux and win32 implementations do not. This should be checked. duke@435: duke@435: void os::yield() { duke@435: // Yields to all threads with same or greater priority duke@435: os::sleep(Thread::current(), 0, false); duke@435: } duke@435: duke@435: // Note that yield semantics are defined by the scheduling class to which duke@435: // the thread currently belongs. Typically, yield will _not yield to duke@435: // other equal or higher priority threads that reside on the dispatch queues duke@435: // of other CPUs. duke@435: duke@435: os::YieldResult os::NakedYield() { thr_yield(); return os::YIELD_UNKNOWN; } duke@435: duke@435: duke@435: // On Solaris we found that yield_all doesn't always yield to all other threads. duke@435: // There have been cases where there is a thread ready to execute but it doesn't duke@435: // get an lwp as the VM thread continues to spin with sleeps of 1 millisecond. duke@435: // The 1 millisecond wait doesn't seem long enough for the kernel to issue a duke@435: // SIGWAITING signal which will cause a new lwp to be created. So we count the duke@435: // number of times yield_all is called in the one loop and increase the sleep duke@435: // time after 8 attempts. If this fails too we increase the concurrency level duke@435: // so that the starving thread would get an lwp duke@435: duke@435: void os::yield_all(int attempts) { duke@435: // Yields to all threads, including threads with lower priorities duke@435: if (attempts == 0) { duke@435: os::sleep(Thread::current(), 1, false); duke@435: } else { duke@435: int iterations = attempts % 30; duke@435: if (iterations == 0 && !os::Solaris::T2_libthread()) { duke@435: // thr_setconcurrency and _getconcurrency make sense only under T1. duke@435: int noofLWPS = thr_getconcurrency(); duke@435: if (noofLWPS < (Threads::number_of_threads() + 2)) { duke@435: thr_setconcurrency(thr_getconcurrency() + 1); duke@435: } duke@435: } else if (iterations < 25) { duke@435: os::sleep(Thread::current(), 1, false); duke@435: } else { duke@435: os::sleep(Thread::current(), 10, false); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Called from the tight loops to possibly influence time-sharing heuristics duke@435: void os::loop_breaker(int attempts) { duke@435: os::yield_all(attempts); duke@435: } duke@435: duke@435: duke@435: // Interface for setting lwp priorities. If we are using T2 libthread, duke@435: // which forces the use of BoundThreads or we manually set UseBoundThreads, duke@435: // all of our threads will be assigned to real lwp's. Using the thr_setprio duke@435: // function is meaningless in this mode so we must adjust the real lwp's priority duke@435: // The routines below implement the getting and setting of lwp priorities. duke@435: // duke@435: // Note: There are three priority scales used on Solaris. Java priotities duke@435: // which range from 1 to 10, libthread "thr_setprio" scale which range duke@435: // from 0 to 127, and the current scheduling class of the process we duke@435: // are running in. This is typically from -60 to +60. duke@435: // The setting of the lwp priorities in done after a call to thr_setprio duke@435: // so Java priorities are mapped to libthread priorities and we map from duke@435: // the latter to lwp priorities. We don't keep priorities stored in duke@435: // Java priorities since some of our worker threads want to set priorities duke@435: // higher than all Java threads. duke@435: // duke@435: // For related information: duke@435: // (1) man -s 2 priocntl duke@435: // (2) man -s 4 priocntl duke@435: // (3) man dispadmin duke@435: // = librt.so duke@435: // = libthread/common/rtsched.c - thrp_setlwpprio(). duke@435: // = ps -cL ... to validate priority. duke@435: // = sched_get_priority_min and _max duke@435: // pthread_create duke@435: // sched_setparam duke@435: // pthread_setschedparam duke@435: // duke@435: // Assumptions: duke@435: // + We assume that all threads in the process belong to the same duke@435: // scheduling class. IE. an homogenous process. duke@435: // + Must be root or in IA group to change change "interactive" attribute. duke@435: // Priocntl() will fail silently. The only indication of failure is when duke@435: // we read-back the value and notice that it hasn't changed. duke@435: // + Interactive threads enter the runq at the head, non-interactive at the tail. duke@435: // + For RT, change timeslice as well. Invariant: duke@435: // constant "priority integral" duke@435: // Konst == TimeSlice * (60-Priority) duke@435: // Given a priority, compute appropriate timeslice. duke@435: // + Higher numerical values have higher priority. duke@435: duke@435: // sched class attributes duke@435: typedef struct { duke@435: int schedPolicy; // classID duke@435: int maxPrio; duke@435: int minPrio; duke@435: } SchedInfo; duke@435: duke@435: duke@435: static SchedInfo tsLimits, iaLimits, rtLimits; duke@435: duke@435: #ifdef ASSERT duke@435: static int ReadBackValidate = 1; duke@435: #endif duke@435: static int myClass = 0; duke@435: static int myMin = 0; duke@435: static int myMax = 0; duke@435: static int myCur = 0; duke@435: static bool priocntl_enable = false; duke@435: duke@435: duke@435: // Call the version of priocntl suitable for all supported versions duke@435: // of Solaris. We need to call through this wrapper so that we can duke@435: // build on Solaris 9 and run on Solaris 8, 9 and 10. duke@435: // duke@435: // This code should be removed if we ever stop supporting Solaris 8 duke@435: // and earlier releases. duke@435: duke@435: static long priocntl_stub(int pcver, idtype_t idtype, id_t id, int cmd, caddr_t arg); duke@435: typedef long (*priocntl_type)(int pcver, idtype_t idtype, id_t id, int cmd, caddr_t arg); duke@435: static priocntl_type priocntl_ptr = priocntl_stub; duke@435: duke@435: // Stub to set the value of the real pointer, and then call the real duke@435: // function. duke@435: duke@435: static long priocntl_stub(int pcver, idtype_t idtype, id_t id, int cmd, caddr_t arg) { duke@435: // Try Solaris 8- name only. duke@435: priocntl_type tmp = (priocntl_type)dlsym(RTLD_DEFAULT, "__priocntl"); duke@435: guarantee(tmp != NULL, "priocntl function not found."); duke@435: priocntl_ptr = tmp; duke@435: return (*priocntl_ptr)(PC_VERSION, idtype, id, cmd, arg); duke@435: } duke@435: duke@435: duke@435: // lwp_priocntl_init duke@435: // duke@435: // Try to determine the priority scale for our process. duke@435: // duke@435: // Return errno or 0 if OK. duke@435: // duke@435: static duke@435: int lwp_priocntl_init () duke@435: { duke@435: int rslt; duke@435: pcinfo_t ClassInfo; duke@435: pcparms_t ParmInfo; duke@435: int i; duke@435: duke@435: if (!UseThreadPriorities) return 0; duke@435: duke@435: // We are using Bound threads, we need to determine our priority ranges duke@435: if (os::Solaris::T2_libthread() || UseBoundThreads) { duke@435: // If ThreadPriorityPolicy is 1, switch tables duke@435: if (ThreadPriorityPolicy == 1) { duke@435: for (i = 0 ; i < MaxPriority+1; i++) duke@435: os::java_to_os_priority[i] = prio_policy1[i]; duke@435: } duke@435: } duke@435: // Not using Bound Threads, set to ThreadPolicy 1 duke@435: else { duke@435: for ( i = 0 ; i < MaxPriority+1; i++ ) { duke@435: os::java_to_os_priority[i] = prio_policy1[i]; duke@435: } duke@435: return 0; duke@435: } duke@435: duke@435: duke@435: // Get IDs for a set of well-known scheduling classes. duke@435: // TODO-FIXME: GETCLINFO returns the current # of classes in the duke@435: // the system. We should have a loop that iterates over the duke@435: // classID values, which are known to be "small" integers. duke@435: duke@435: strcpy(ClassInfo.pc_clname, "TS"); duke@435: ClassInfo.pc_cid = -1; duke@435: rslt = (*priocntl_ptr)(PC_VERSION, P_ALL, 0, PC_GETCID, (caddr_t)&ClassInfo); duke@435: if (rslt < 0) return errno; duke@435: assert(ClassInfo.pc_cid != -1, "cid for TS class is -1"); duke@435: tsLimits.schedPolicy = ClassInfo.pc_cid; duke@435: tsLimits.maxPrio = ((tsinfo_t*)ClassInfo.pc_clinfo)->ts_maxupri; duke@435: tsLimits.minPrio = -tsLimits.maxPrio; duke@435: duke@435: strcpy(ClassInfo.pc_clname, "IA"); duke@435: ClassInfo.pc_cid = -1; duke@435: rslt = (*priocntl_ptr)(PC_VERSION, P_ALL, 0, PC_GETCID, (caddr_t)&ClassInfo); duke@435: if (rslt < 0) return errno; duke@435: assert(ClassInfo.pc_cid != -1, "cid for IA class is -1"); duke@435: iaLimits.schedPolicy = ClassInfo.pc_cid; duke@435: iaLimits.maxPrio = ((iainfo_t*)ClassInfo.pc_clinfo)->ia_maxupri; duke@435: iaLimits.minPrio = -iaLimits.maxPrio; duke@435: duke@435: strcpy(ClassInfo.pc_clname, "RT"); duke@435: ClassInfo.pc_cid = -1; duke@435: rslt = (*priocntl_ptr)(PC_VERSION, P_ALL, 0, PC_GETCID, (caddr_t)&ClassInfo); duke@435: if (rslt < 0) return errno; duke@435: assert(ClassInfo.pc_cid != -1, "cid for RT class is -1"); duke@435: rtLimits.schedPolicy = ClassInfo.pc_cid; duke@435: rtLimits.maxPrio = ((rtinfo_t*)ClassInfo.pc_clinfo)->rt_maxpri; duke@435: rtLimits.minPrio = 0; duke@435: duke@435: duke@435: // Query our "current" scheduling class. duke@435: // This will normally be IA,TS or, rarely, RT. duke@435: memset (&ParmInfo, 0, sizeof(ParmInfo)); duke@435: ParmInfo.pc_cid = PC_CLNULL; duke@435: rslt = (*priocntl_ptr) (PC_VERSION, P_PID, P_MYID, PC_GETPARMS, (caddr_t)&ParmInfo ); duke@435: if ( rslt < 0 ) return errno; duke@435: myClass = ParmInfo.pc_cid; duke@435: duke@435: // We now know our scheduling classId, get specific information duke@435: // the class. duke@435: ClassInfo.pc_cid = myClass; duke@435: ClassInfo.pc_clname[0] = 0; duke@435: rslt = (*priocntl_ptr) (PC_VERSION, (idtype)0, 0, PC_GETCLINFO, (caddr_t)&ClassInfo ); duke@435: if ( rslt < 0 ) return errno; duke@435: duke@435: if (ThreadPriorityVerbose) duke@435: tty->print_cr ("lwp_priocntl_init: Class=%d(%s)...", myClass, ClassInfo.pc_clname); duke@435: duke@435: memset(&ParmInfo, 0, sizeof(pcparms_t)); duke@435: ParmInfo.pc_cid = PC_CLNULL; duke@435: rslt = (*priocntl_ptr)(PC_VERSION, P_PID, P_MYID, PC_GETPARMS, (caddr_t)&ParmInfo); duke@435: if (rslt < 0) return errno; duke@435: duke@435: if (ParmInfo.pc_cid == rtLimits.schedPolicy) { duke@435: myMin = rtLimits.minPrio; duke@435: myMax = rtLimits.maxPrio; duke@435: } else if (ParmInfo.pc_cid == iaLimits.schedPolicy) { duke@435: iaparms_t *iaInfo = (iaparms_t*)ParmInfo.pc_clparms; duke@435: myMin = iaLimits.minPrio; duke@435: myMax = iaLimits.maxPrio; duke@435: myMax = MIN2(myMax, (int)iaInfo->ia_uprilim); // clamp - restrict duke@435: } else if (ParmInfo.pc_cid == tsLimits.schedPolicy) { duke@435: tsparms_t *tsInfo = (tsparms_t*)ParmInfo.pc_clparms; duke@435: myMin = tsLimits.minPrio; duke@435: myMax = tsLimits.maxPrio; duke@435: myMax = MIN2(myMax, (int)tsInfo->ts_uprilim); // clamp - restrict duke@435: } else { duke@435: // No clue - punt duke@435: if (ThreadPriorityVerbose) duke@435: tty->print_cr ("Unknown scheduling class: %s ... \n", ClassInfo.pc_clname); duke@435: return EINVAL; // no clue, punt duke@435: } duke@435: duke@435: if (ThreadPriorityVerbose) duke@435: tty->print_cr ("Thread priority Range: [%d..%d]\n", myMin, myMax); duke@435: duke@435: priocntl_enable = true; // Enable changing priorities duke@435: return 0; duke@435: } duke@435: duke@435: #define IAPRI(x) ((iaparms_t *)((x).pc_clparms)) duke@435: #define RTPRI(x) ((rtparms_t *)((x).pc_clparms)) duke@435: #define TSPRI(x) ((tsparms_t *)((x).pc_clparms)) duke@435: duke@435: duke@435: // scale_to_lwp_priority duke@435: // duke@435: // Convert from the libthread "thr_setprio" scale to our current duke@435: // lwp scheduling class scale. duke@435: // duke@435: static duke@435: int scale_to_lwp_priority (int rMin, int rMax, int x) duke@435: { duke@435: int v; duke@435: duke@435: if (x == 127) return rMax; // avoid round-down duke@435: v = (((x*(rMax-rMin)))/128)+rMin; duke@435: return v; duke@435: } duke@435: duke@435: duke@435: // set_lwp_priority duke@435: // duke@435: // Set the priority of the lwp. This call should only be made duke@435: // when using bound threads (T2 threads are bound by default). duke@435: // duke@435: int set_lwp_priority (int ThreadID, int lwpid, int newPrio ) duke@435: { duke@435: int rslt; duke@435: int Actual, Expected, prv; duke@435: pcparms_t ParmInfo; // for GET-SET duke@435: #ifdef ASSERT duke@435: pcparms_t ReadBack; // for readback duke@435: #endif duke@435: duke@435: // Set priority via PC_GETPARMS, update, PC_SETPARMS duke@435: // Query current values. duke@435: // TODO: accelerate this by eliminating the PC_GETPARMS call. duke@435: // Cache "pcparms_t" in global ParmCache. duke@435: // TODO: elide set-to-same-value duke@435: duke@435: // If something went wrong on init, don't change priorities. duke@435: if ( !priocntl_enable ) { duke@435: if (ThreadPriorityVerbose) duke@435: tty->print_cr("Trying to set priority but init failed, ignoring"); duke@435: return EINVAL; duke@435: } duke@435: duke@435: duke@435: // If lwp hasn't started yet, just return duke@435: // the _start routine will call us again. duke@435: if ( lwpid <= 0 ) { duke@435: if (ThreadPriorityVerbose) { duke@435: tty->print_cr ("deferring the set_lwp_priority of thread " INTPTR_FORMAT " to %d, lwpid not set", duke@435: ThreadID, newPrio); duke@435: } duke@435: return 0; duke@435: } duke@435: duke@435: if (ThreadPriorityVerbose) { duke@435: tty->print_cr ("set_lwp_priority(" INTPTR_FORMAT "@" INTPTR_FORMAT " %d) ", duke@435: ThreadID, lwpid, newPrio); duke@435: } duke@435: duke@435: memset(&ParmInfo, 0, sizeof(pcparms_t)); duke@435: ParmInfo.pc_cid = PC_CLNULL; duke@435: rslt = (*priocntl_ptr)(PC_VERSION, P_LWPID, lwpid, PC_GETPARMS, (caddr_t)&ParmInfo); duke@435: if (rslt < 0) return errno; duke@435: duke@435: if (ParmInfo.pc_cid == rtLimits.schedPolicy) { duke@435: rtparms_t *rtInfo = (rtparms_t*)ParmInfo.pc_clparms; duke@435: rtInfo->rt_pri = scale_to_lwp_priority (rtLimits.minPrio, rtLimits.maxPrio, newPrio); duke@435: rtInfo->rt_tqsecs = RT_NOCHANGE; duke@435: rtInfo->rt_tqnsecs = RT_NOCHANGE; duke@435: if (ThreadPriorityVerbose) { duke@435: tty->print_cr("RT: %d->%d\n", newPrio, rtInfo->rt_pri); duke@435: } duke@435: } else if (ParmInfo.pc_cid == iaLimits.schedPolicy) { duke@435: iaparms_t *iaInfo = (iaparms_t*)ParmInfo.pc_clparms; duke@435: int maxClamped = MIN2(iaLimits.maxPrio, (int)iaInfo->ia_uprilim); duke@435: iaInfo->ia_upri = scale_to_lwp_priority(iaLimits.minPrio, maxClamped, newPrio); duke@435: iaInfo->ia_uprilim = IA_NOCHANGE; duke@435: iaInfo->ia_nice = IA_NOCHANGE; duke@435: iaInfo->ia_mode = IA_NOCHANGE; duke@435: if (ThreadPriorityVerbose) { duke@435: tty->print_cr ("IA: [%d...%d] %d->%d\n", duke@435: iaLimits.minPrio, maxClamped, newPrio, iaInfo->ia_upri); duke@435: } duke@435: } else if (ParmInfo.pc_cid == tsLimits.schedPolicy) { duke@435: tsparms_t *tsInfo = (tsparms_t*)ParmInfo.pc_clparms; duke@435: int maxClamped = MIN2(tsLimits.maxPrio, (int)tsInfo->ts_uprilim); duke@435: prv = tsInfo->ts_upri; duke@435: tsInfo->ts_upri = scale_to_lwp_priority(tsLimits.minPrio, maxClamped, newPrio); duke@435: tsInfo->ts_uprilim = IA_NOCHANGE; duke@435: if (ThreadPriorityVerbose) { duke@435: tty->print_cr ("TS: %d [%d...%d] %d->%d\n", duke@435: prv, tsLimits.minPrio, maxClamped, newPrio, tsInfo->ts_upri); duke@435: } duke@435: if (prv == tsInfo->ts_upri) return 0; duke@435: } else { duke@435: if ( ThreadPriorityVerbose ) { duke@435: tty->print_cr ("Unknown scheduling class\n"); duke@435: } duke@435: return EINVAL; // no clue, punt duke@435: } duke@435: duke@435: rslt = (*priocntl_ptr)(PC_VERSION, P_LWPID, lwpid, PC_SETPARMS, (caddr_t)&ParmInfo); duke@435: if (ThreadPriorityVerbose && rslt) { duke@435: tty->print_cr ("PC_SETPARMS ->%d %d\n", rslt, errno); duke@435: } duke@435: if (rslt < 0) return errno; duke@435: duke@435: #ifdef ASSERT duke@435: // Sanity check: read back what we just attempted to set. duke@435: // In theory it could have changed in the interim ... duke@435: // duke@435: // The priocntl system call is tricky. duke@435: // Sometimes it'll validate the priority value argument and duke@435: // return EINVAL if unhappy. At other times it fails silently. duke@435: // Readbacks are prudent. duke@435: duke@435: if (!ReadBackValidate) return 0; duke@435: duke@435: memset(&ReadBack, 0, sizeof(pcparms_t)); duke@435: ReadBack.pc_cid = PC_CLNULL; duke@435: rslt = (*priocntl_ptr)(PC_VERSION, P_LWPID, lwpid, PC_GETPARMS, (caddr_t)&ReadBack); duke@435: assert(rslt >= 0, "priocntl failed"); duke@435: Actual = Expected = 0xBAD; duke@435: assert(ParmInfo.pc_cid == ReadBack.pc_cid, "cid's don't match"); duke@435: if (ParmInfo.pc_cid == rtLimits.schedPolicy) { duke@435: Actual = RTPRI(ReadBack)->rt_pri; duke@435: Expected = RTPRI(ParmInfo)->rt_pri; duke@435: } else if (ParmInfo.pc_cid == iaLimits.schedPolicy) { duke@435: Actual = IAPRI(ReadBack)->ia_upri; duke@435: Expected = IAPRI(ParmInfo)->ia_upri; duke@435: } else if (ParmInfo.pc_cid == tsLimits.schedPolicy) { duke@435: Actual = TSPRI(ReadBack)->ts_upri; duke@435: Expected = TSPRI(ParmInfo)->ts_upri; duke@435: } else { duke@435: if ( ThreadPriorityVerbose ) { duke@435: tty->print_cr("set_lwp_priority: unexpected class in readback: %d\n", ParmInfo.pc_cid); duke@435: } duke@435: } duke@435: duke@435: if (Actual != Expected) { duke@435: if ( ThreadPriorityVerbose ) { duke@435: tty->print_cr ("set_lwp_priority(%d %d) Class=%d: actual=%d vs expected=%d\n", duke@435: lwpid, newPrio, ReadBack.pc_cid, Actual, Expected); duke@435: } duke@435: } duke@435: #endif duke@435: duke@435: return 0; duke@435: } duke@435: duke@435: duke@435: duke@435: // Solaris only gives access to 128 real priorities at a time, duke@435: // so we expand Java's ten to fill this range. This would be better duke@435: // if we dynamically adjusted relative priorities. duke@435: // duke@435: // The ThreadPriorityPolicy option allows us to select 2 different duke@435: // priority scales. duke@435: // duke@435: // ThreadPriorityPolicy=0 duke@435: // Since the Solaris' default priority is MaximumPriority, we do not duke@435: // set a priority lower than Max unless a priority lower than duke@435: // NormPriority is requested. duke@435: // duke@435: // ThreadPriorityPolicy=1 duke@435: // This mode causes the priority table to get filled with duke@435: // linear values. NormPriority get's mapped to 50% of the duke@435: // Maximum priority an so on. This will cause VM threads duke@435: // to get unfair treatment against other Solaris processes duke@435: // which do not explicitly alter their thread priorities. duke@435: // duke@435: duke@435: duke@435: int os::java_to_os_priority[MaxPriority + 1] = { duke@435: -99999, // 0 Entry should never be used duke@435: duke@435: 0, // 1 MinPriority duke@435: 32, // 2 duke@435: 64, // 3 duke@435: duke@435: 96, // 4 duke@435: 127, // 5 NormPriority duke@435: 127, // 6 duke@435: duke@435: 127, // 7 duke@435: 127, // 8 duke@435: 127, // 9 NearMaxPriority duke@435: duke@435: 127 // 10 MaxPriority duke@435: }; duke@435: duke@435: duke@435: OSReturn os::set_native_priority(Thread* thread, int newpri) { duke@435: assert(newpri >= MinimumPriority && newpri <= MaximumPriority, "bad priority mapping"); duke@435: if ( !UseThreadPriorities ) return OS_OK; duke@435: int status = thr_setprio(thread->osthread()->thread_id(), newpri); duke@435: if ( os::Solaris::T2_libthread() || (UseBoundThreads && thread->osthread()->is_vm_created()) ) duke@435: status |= (set_lwp_priority (thread->osthread()->thread_id(), duke@435: thread->osthread()->lwp_id(), newpri )); duke@435: return (status == 0) ? OS_OK : OS_ERR; duke@435: } duke@435: duke@435: duke@435: OSReturn os::get_native_priority(const Thread* const thread, int *priority_ptr) { duke@435: int p; duke@435: if ( !UseThreadPriorities ) { duke@435: *priority_ptr = NormalPriority; duke@435: return OS_OK; duke@435: } duke@435: int status = thr_getprio(thread->osthread()->thread_id(), &p); duke@435: if (status != 0) { duke@435: return OS_ERR; duke@435: } duke@435: *priority_ptr = p; duke@435: return OS_OK; duke@435: } duke@435: duke@435: duke@435: // Hint to the underlying OS that a task switch would not be good. duke@435: // Void return because it's a hint and can fail. duke@435: void os::hint_no_preempt() { duke@435: schedctl_start(schedctl_init()); duke@435: } duke@435: duke@435: void os::interrupt(Thread* thread) { duke@435: assert(Thread::current() == thread || Threads_lock->owned_by_self(), "possibility of dangling Thread pointer"); duke@435: duke@435: OSThread* osthread = thread->osthread(); duke@435: duke@435: int isInterrupted = osthread->interrupted(); duke@435: if (!isInterrupted) { duke@435: osthread->set_interrupted(true); duke@435: OrderAccess::fence(); duke@435: // os::sleep() is implemented with either poll (NULL,0,timeout) or duke@435: // by parking on _SleepEvent. If the former, thr_kill will unwedge duke@435: // the sleeper by SIGINTR, otherwise the unpark() will wake the sleeper. duke@435: ParkEvent * const slp = thread->_SleepEvent ; duke@435: if (slp != NULL) slp->unpark() ; duke@435: } duke@435: duke@435: // For JSR166: unpark after setting status but before thr_kill -dl duke@435: if (thread->is_Java_thread()) { duke@435: ((JavaThread*)thread)->parker()->unpark(); duke@435: } duke@435: duke@435: // Handle interruptible wait() ... duke@435: ParkEvent * const ev = thread->_ParkEvent ; duke@435: if (ev != NULL) ev->unpark() ; duke@435: duke@435: // When events are used everywhere for os::sleep, then this thr_kill duke@435: // will only be needed if UseVMInterruptibleIO is true. duke@435: duke@435: if (!isInterrupted) { duke@435: int status = thr_kill(osthread->thread_id(), os::Solaris::SIGinterrupt()); duke@435: assert_status(status == 0, status, "thr_kill"); duke@435: duke@435: // Bump thread interruption counter duke@435: RuntimeService::record_thread_interrupt_signaled_count(); duke@435: } duke@435: } duke@435: duke@435: duke@435: bool os::is_interrupted(Thread* thread, bool clear_interrupted) { duke@435: assert(Thread::current() == thread || Threads_lock->owned_by_self(), "possibility of dangling Thread pointer"); duke@435: duke@435: OSThread* osthread = thread->osthread(); duke@435: duke@435: bool res = osthread->interrupted(); duke@435: duke@435: // NOTE that since there is no "lock" around these two operations, duke@435: // there is the possibility that the interrupted flag will be duke@435: // "false" but that the interrupt event will be set. This is duke@435: // intentional. The effect of this is that Object.wait() will appear duke@435: // to have a spurious wakeup, which is not harmful, and the duke@435: // possibility is so rare that it is not worth the added complexity duke@435: // to add yet another lock. It has also been recommended not to put duke@435: // the interrupted flag into the os::Solaris::Event structure, duke@435: // because it hides the issue. duke@435: if (res && clear_interrupted) { duke@435: osthread->set_interrupted(false); duke@435: } duke@435: return res; duke@435: } duke@435: duke@435: duke@435: void os::print_statistics() { duke@435: } duke@435: duke@435: int os::message_box(const char* title, const char* message) { duke@435: int i; duke@435: fdStream err(defaultStream::error_fd()); duke@435: for (i = 0; i < 78; i++) err.print_raw("="); duke@435: err.cr(); duke@435: err.print_raw_cr(title); duke@435: for (i = 0; i < 78; i++) err.print_raw("-"); duke@435: err.cr(); duke@435: err.print_raw_cr(message); duke@435: for (i = 0; i < 78; i++) err.print_raw("="); duke@435: err.cr(); duke@435: duke@435: char buf[16]; duke@435: // Prevent process from exiting upon "read error" without consuming all CPU duke@435: while (::read(0, buf, sizeof(buf)) <= 0) { ::sleep(100); } duke@435: duke@435: return buf[0] == 'y' || buf[0] == 'Y'; duke@435: } duke@435: duke@435: // A lightweight implementation that does not suspend the target thread and duke@435: // thus returns only a hint. Used for profiling only! duke@435: ExtendedPC os::get_thread_pc(Thread* thread) { duke@435: // Make sure that it is called by the watcher and the Threads lock is owned. duke@435: assert(Thread::current()->is_Watcher_thread(), "Must be watcher and own Threads_lock"); duke@435: // For now, is only used to profile the VM Thread duke@435: assert(thread->is_VM_thread(), "Can only be called for VMThread"); duke@435: ExtendedPC epc; duke@435: duke@435: GetThreadPC_Callback cb(ProfileVM_lock); duke@435: OSThread *osthread = thread->osthread(); duke@435: const int time_to_wait = 400; // 400ms wait for initial response duke@435: int status = cb.interrupt(thread, time_to_wait); duke@435: duke@435: if (cb.is_done() ) { duke@435: epc = cb.addr(); duke@435: } else { duke@435: DEBUG_ONLY(tty->print_cr("Failed to get pc for thread: %d got %d status", duke@435: osthread->thread_id(), status);); duke@435: // epc is already NULL duke@435: } duke@435: return epc; duke@435: } duke@435: duke@435: duke@435: // This does not do anything on Solaris. This is basically a hook for being duke@435: // able to use structured exception handling (thread-local exception filters) on, e.g., Win32. duke@435: void os::os_exception_wrapper(java_call_t f, JavaValue* value, methodHandle* method, JavaCallArguments* args, Thread* thread) { duke@435: f(value, method, args, thread); duke@435: } duke@435: duke@435: // This routine may be used by user applications as a "hook" to catch signals. duke@435: // The user-defined signal handler must pass unrecognized signals to this duke@435: // routine, and if it returns true (non-zero), then the signal handler must duke@435: // return immediately. If the flag "abort_if_unrecognized" is true, then this duke@435: // routine will never retun false (zero), but instead will execute a VM panic duke@435: // routine kill the process. duke@435: // duke@435: // If this routine returns false, it is OK to call it again. This allows duke@435: // the user-defined signal handler to perform checks either before or after duke@435: // the VM performs its own checks. Naturally, the user code would be making duke@435: // a serious error if it tried to handle an exception (such as a null check duke@435: // or breakpoint) that the VM was generating for its own correct operation. duke@435: // duke@435: // This routine may recognize any of the following kinds of signals: duke@435: // SIGBUS, SIGSEGV, SIGILL, SIGFPE, BREAK_SIGNAL, SIGPIPE, SIGXFSZ, duke@435: // os::Solaris::SIGasync duke@435: // It should be consulted by handlers for any of those signals. duke@435: // It explicitly does not recognize os::Solaris::SIGinterrupt duke@435: // duke@435: // The caller of this routine must pass in the three arguments supplied duke@435: // to the function referred to in the "sa_sigaction" (not the "sa_handler") duke@435: // field of the structure passed to sigaction(). This routine assumes that duke@435: // the sa_flags field passed to sigaction() includes SA_SIGINFO and SA_RESTART. duke@435: // duke@435: // Note that the VM will print warnings if it detects conflicting signal duke@435: // handlers, unless invoked with the option "-XX:+AllowUserSignalHandlers". duke@435: // duke@435: extern "C" int JVM_handle_solaris_signal(int signo, siginfo_t* siginfo, void* ucontext, int abort_if_unrecognized); duke@435: duke@435: duke@435: void signalHandler(int sig, siginfo_t* info, void* ucVoid) { duke@435: JVM_handle_solaris_signal(sig, info, ucVoid, true); duke@435: } duke@435: duke@435: /* Do not delete - if guarantee is ever removed, a signal handler (even empty) duke@435: is needed to provoke threads blocked on IO to return an EINTR duke@435: Note: this explicitly does NOT call JVM_handle_solaris_signal and duke@435: does NOT participate in signal chaining due to requirement for duke@435: NOT setting SA_RESTART to make EINTR work. */ duke@435: extern "C" void sigINTRHandler(int sig, siginfo_t* info, void* ucVoid) { duke@435: if (UseSignalChaining) { duke@435: struct sigaction *actp = os::Solaris::get_chained_signal_action(sig); duke@435: if (actp && actp->sa_handler) { duke@435: vm_exit_during_initialization("Signal chaining detected for VM interrupt signal, try -XX:+UseAltSigs"); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // This boolean allows users to forward their own non-matching signals duke@435: // to JVM_handle_solaris_signal, harmlessly. duke@435: bool os::Solaris::signal_handlers_are_installed = false; duke@435: duke@435: // For signal-chaining duke@435: bool os::Solaris::libjsig_is_loaded = false; duke@435: typedef struct sigaction *(*get_signal_t)(int); duke@435: get_signal_t os::Solaris::get_signal_action = NULL; duke@435: duke@435: struct sigaction* os::Solaris::get_chained_signal_action(int sig) { duke@435: struct sigaction *actp = NULL; duke@435: duke@435: if ((libjsig_is_loaded) && (sig <= Maxlibjsigsigs)) { duke@435: // Retrieve the old signal handler from libjsig duke@435: actp = (*get_signal_action)(sig); duke@435: } duke@435: if (actp == NULL) { duke@435: // Retrieve the preinstalled signal handler from jvm duke@435: actp = get_preinstalled_handler(sig); duke@435: } duke@435: duke@435: return actp; duke@435: } duke@435: duke@435: static bool call_chained_handler(struct sigaction *actp, int sig, duke@435: siginfo_t *siginfo, void *context) { duke@435: // Call the old signal handler duke@435: if (actp->sa_handler == SIG_DFL) { duke@435: // It's more reasonable to let jvm treat it as an unexpected exception duke@435: // instead of taking the default action. duke@435: return false; duke@435: } else if (actp->sa_handler != SIG_IGN) { duke@435: if ((actp->sa_flags & SA_NODEFER) == 0) { duke@435: // automaticlly block the signal duke@435: sigaddset(&(actp->sa_mask), sig); duke@435: } duke@435: duke@435: sa_handler_t hand; duke@435: sa_sigaction_t sa; duke@435: bool siginfo_flag_set = (actp->sa_flags & SA_SIGINFO) != 0; duke@435: // retrieve the chained handler duke@435: if (siginfo_flag_set) { duke@435: sa = actp->sa_sigaction; duke@435: } else { duke@435: hand = actp->sa_handler; duke@435: } duke@435: duke@435: if ((actp->sa_flags & SA_RESETHAND) != 0) { duke@435: actp->sa_handler = SIG_DFL; duke@435: } duke@435: duke@435: // try to honor the signal mask duke@435: sigset_t oset; duke@435: thr_sigsetmask(SIG_SETMASK, &(actp->sa_mask), &oset); duke@435: duke@435: // call into the chained handler duke@435: if (siginfo_flag_set) { duke@435: (*sa)(sig, siginfo, context); duke@435: } else { duke@435: (*hand)(sig); duke@435: } duke@435: duke@435: // restore the signal mask duke@435: thr_sigsetmask(SIG_SETMASK, &oset, 0); duke@435: } duke@435: // Tell jvm's signal handler the signal is taken care of. duke@435: return true; duke@435: } duke@435: duke@435: bool os::Solaris::chained_handler(int sig, siginfo_t* siginfo, void* context) { duke@435: bool chained = false; duke@435: // signal-chaining duke@435: if (UseSignalChaining) { duke@435: struct sigaction *actp = get_chained_signal_action(sig); duke@435: if (actp != NULL) { duke@435: chained = call_chained_handler(actp, sig, siginfo, context); duke@435: } duke@435: } duke@435: return chained; duke@435: } duke@435: duke@435: struct sigaction* os::Solaris::get_preinstalled_handler(int sig) { duke@435: assert((chainedsigactions != (struct sigaction *)NULL) && (preinstalled_sigs != (int *)NULL) , "signals not yet initialized"); duke@435: if (preinstalled_sigs[sig] != 0) { duke@435: return &chainedsigactions[sig]; duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: void os::Solaris::save_preinstalled_handler(int sig, struct sigaction& oldAct) { duke@435: duke@435: assert(sig > 0 && sig <= Maxsignum, "vm signal out of expected range"); duke@435: assert((chainedsigactions != (struct sigaction *)NULL) && (preinstalled_sigs != (int *)NULL) , "signals not yet initialized"); duke@435: chainedsigactions[sig] = oldAct; duke@435: preinstalled_sigs[sig] = 1; duke@435: } duke@435: duke@435: void os::Solaris::set_signal_handler(int sig, bool set_installed, bool oktochain) { duke@435: // Check for overwrite. duke@435: struct sigaction oldAct; duke@435: sigaction(sig, (struct sigaction*)NULL, &oldAct); duke@435: void* oldhand = oldAct.sa_sigaction ? CAST_FROM_FN_PTR(void*, oldAct.sa_sigaction) duke@435: : CAST_FROM_FN_PTR(void*, oldAct.sa_handler); duke@435: if (oldhand != CAST_FROM_FN_PTR(void*, SIG_DFL) && duke@435: oldhand != CAST_FROM_FN_PTR(void*, SIG_IGN) && duke@435: oldhand != CAST_FROM_FN_PTR(void*, signalHandler)) { duke@435: if (AllowUserSignalHandlers || !set_installed) { duke@435: // Do not overwrite; user takes responsibility to forward to us. duke@435: return; duke@435: } else if (UseSignalChaining) { duke@435: if (oktochain) { duke@435: // save the old handler in jvm duke@435: save_preinstalled_handler(sig, oldAct); duke@435: } else { duke@435: vm_exit_during_initialization("Signal chaining not allowed for VM interrupt signal, try -XX:+UseAltSigs."); duke@435: } duke@435: // libjsig also interposes the sigaction() call below and saves the duke@435: // old sigaction on it own. duke@435: } else { duke@435: fatal2("Encountered unexpected pre-existing sigaction handler %#lx for signal %d.", (long)oldhand, sig); duke@435: } duke@435: } duke@435: duke@435: struct sigaction sigAct; duke@435: sigfillset(&(sigAct.sa_mask)); duke@435: sigAct.sa_handler = SIG_DFL; duke@435: duke@435: sigAct.sa_sigaction = signalHandler; duke@435: // Handle SIGSEGV on alternate signal stack if duke@435: // not using stack banging duke@435: if (!UseStackBanging && sig == SIGSEGV) { duke@435: sigAct.sa_flags = SA_SIGINFO | SA_RESTART | SA_ONSTACK; duke@435: // Interruptible i/o requires SA_RESTART cleared so EINTR duke@435: // is returned instead of restarting system calls duke@435: } else if (sig == os::Solaris::SIGinterrupt()) { duke@435: sigemptyset(&sigAct.sa_mask); duke@435: sigAct.sa_handler = NULL; duke@435: sigAct.sa_flags = SA_SIGINFO; duke@435: sigAct.sa_sigaction = sigINTRHandler; duke@435: } else { duke@435: sigAct.sa_flags = SA_SIGINFO | SA_RESTART; duke@435: } duke@435: os::Solaris::set_our_sigflags(sig, sigAct.sa_flags); duke@435: duke@435: sigaction(sig, &sigAct, &oldAct); duke@435: duke@435: void* oldhand2 = oldAct.sa_sigaction ? CAST_FROM_FN_PTR(void*, oldAct.sa_sigaction) duke@435: : CAST_FROM_FN_PTR(void*, oldAct.sa_handler); duke@435: assert(oldhand2 == oldhand, "no concurrent signal handler installation"); duke@435: } duke@435: duke@435: duke@435: #define DO_SIGNAL_CHECK(sig) \ duke@435: if (!sigismember(&check_signal_done, sig)) \ duke@435: os::Solaris::check_signal_handler(sig) duke@435: duke@435: // This method is a periodic task to check for misbehaving JNI applications duke@435: // under CheckJNI, we can add any periodic checks here duke@435: duke@435: void os::run_periodic_checks() { duke@435: // A big source of grief is hijacking virt. addr 0x0 on Solaris, duke@435: // thereby preventing a NULL checks. duke@435: if(!check_addr0_done) check_addr0_done = check_addr0(tty); duke@435: duke@435: if (check_signals == false) return; duke@435: duke@435: // SEGV and BUS if overridden could potentially prevent duke@435: // generation of hs*.log in the event of a crash, debugging duke@435: // such a case can be very challenging, so we absolutely duke@435: // check for the following for a good measure: duke@435: DO_SIGNAL_CHECK(SIGSEGV); duke@435: DO_SIGNAL_CHECK(SIGILL); duke@435: DO_SIGNAL_CHECK(SIGFPE); duke@435: DO_SIGNAL_CHECK(SIGBUS); duke@435: DO_SIGNAL_CHECK(SIGPIPE); duke@435: DO_SIGNAL_CHECK(SIGXFSZ); duke@435: duke@435: // ReduceSignalUsage allows the user to override these handlers duke@435: // see comments at the very top and jvm_solaris.h duke@435: if (!ReduceSignalUsage) { duke@435: DO_SIGNAL_CHECK(SHUTDOWN1_SIGNAL); duke@435: DO_SIGNAL_CHECK(SHUTDOWN2_SIGNAL); duke@435: DO_SIGNAL_CHECK(SHUTDOWN3_SIGNAL); duke@435: DO_SIGNAL_CHECK(BREAK_SIGNAL); duke@435: } duke@435: duke@435: // See comments above for using JVM1/JVM2 and UseAltSigs duke@435: DO_SIGNAL_CHECK(os::Solaris::SIGinterrupt()); duke@435: DO_SIGNAL_CHECK(os::Solaris::SIGasync()); duke@435: duke@435: } duke@435: duke@435: typedef int (*os_sigaction_t)(int, const struct sigaction *, struct sigaction *); duke@435: duke@435: static os_sigaction_t os_sigaction = NULL; duke@435: duke@435: void os::Solaris::check_signal_handler(int sig) { duke@435: char buf[O_BUFLEN]; duke@435: address jvmHandler = NULL; duke@435: duke@435: struct sigaction act; duke@435: if (os_sigaction == NULL) { duke@435: // only trust the default sigaction, in case it has been interposed duke@435: os_sigaction = (os_sigaction_t)dlsym(RTLD_DEFAULT, "sigaction"); duke@435: if (os_sigaction == NULL) return; duke@435: } duke@435: duke@435: os_sigaction(sig, (struct sigaction*)NULL, &act); duke@435: duke@435: address thisHandler = (act.sa_flags & SA_SIGINFO) duke@435: ? CAST_FROM_FN_PTR(address, act.sa_sigaction) duke@435: : CAST_FROM_FN_PTR(address, act.sa_handler) ; duke@435: duke@435: duke@435: switch(sig) { duke@435: case SIGSEGV: duke@435: case SIGBUS: duke@435: case SIGFPE: duke@435: case SIGPIPE: duke@435: case SIGXFSZ: duke@435: case SIGILL: duke@435: jvmHandler = CAST_FROM_FN_PTR(address, signalHandler); duke@435: break; duke@435: duke@435: case SHUTDOWN1_SIGNAL: duke@435: case SHUTDOWN2_SIGNAL: duke@435: case SHUTDOWN3_SIGNAL: duke@435: case BREAK_SIGNAL: duke@435: jvmHandler = (address)user_handler(); duke@435: break; duke@435: duke@435: default: duke@435: int intrsig = os::Solaris::SIGinterrupt(); duke@435: int asynsig = os::Solaris::SIGasync(); duke@435: duke@435: if (sig == intrsig) { duke@435: jvmHandler = CAST_FROM_FN_PTR(address, sigINTRHandler); duke@435: } else if (sig == asynsig) { duke@435: jvmHandler = CAST_FROM_FN_PTR(address, signalHandler); duke@435: } else { duke@435: return; duke@435: } duke@435: break; duke@435: } duke@435: duke@435: duke@435: if (thisHandler != jvmHandler) { duke@435: tty->print("Warning: %s handler ", exception_name(sig, buf, O_BUFLEN)); duke@435: tty->print("expected:%s", get_signal_handler_name(jvmHandler, buf, O_BUFLEN)); duke@435: tty->print_cr(" found:%s", get_signal_handler_name(thisHandler, buf, O_BUFLEN)); duke@435: // No need to check this sig any longer duke@435: sigaddset(&check_signal_done, sig); duke@435: } else if(os::Solaris::get_our_sigflags(sig) != 0 && act.sa_flags != os::Solaris::get_our_sigflags(sig)) { duke@435: tty->print("Warning: %s handler flags ", exception_name(sig, buf, O_BUFLEN)); duke@435: tty->print("expected:" PTR32_FORMAT, os::Solaris::get_our_sigflags(sig)); duke@435: tty->print_cr(" found:" PTR32_FORMAT, act.sa_flags); duke@435: // No need to check this sig any longer duke@435: sigaddset(&check_signal_done, sig); duke@435: } duke@435: duke@435: // Print all the signal handler state duke@435: if (sigismember(&check_signal_done, sig)) { duke@435: print_signal_handlers(tty, buf, O_BUFLEN); duke@435: } duke@435: duke@435: } duke@435: duke@435: void os::Solaris::install_signal_handlers() { duke@435: bool libjsigdone = false; duke@435: signal_handlers_are_installed = true; duke@435: duke@435: // signal-chaining duke@435: typedef void (*signal_setting_t)(); duke@435: signal_setting_t begin_signal_setting = NULL; duke@435: signal_setting_t end_signal_setting = NULL; duke@435: begin_signal_setting = CAST_TO_FN_PTR(signal_setting_t, duke@435: dlsym(RTLD_DEFAULT, "JVM_begin_signal_setting")); duke@435: if (begin_signal_setting != NULL) { duke@435: end_signal_setting = CAST_TO_FN_PTR(signal_setting_t, duke@435: dlsym(RTLD_DEFAULT, "JVM_end_signal_setting")); duke@435: get_signal_action = CAST_TO_FN_PTR(get_signal_t, duke@435: dlsym(RTLD_DEFAULT, "JVM_get_signal_action")); duke@435: get_libjsig_version = CAST_TO_FN_PTR(version_getting_t, duke@435: dlsym(RTLD_DEFAULT, "JVM_get_libjsig_version")); duke@435: libjsig_is_loaded = true; duke@435: if (os::Solaris::get_libjsig_version != NULL) { duke@435: libjsigversion = (*os::Solaris::get_libjsig_version)(); duke@435: } duke@435: assert(UseSignalChaining, "should enable signal-chaining"); duke@435: } duke@435: if (libjsig_is_loaded) { duke@435: // Tell libjsig jvm is setting signal handlers duke@435: (*begin_signal_setting)(); duke@435: } duke@435: duke@435: set_signal_handler(SIGSEGV, true, true); duke@435: set_signal_handler(SIGPIPE, true, true); duke@435: set_signal_handler(SIGXFSZ, true, true); duke@435: set_signal_handler(SIGBUS, true, true); duke@435: set_signal_handler(SIGILL, true, true); duke@435: set_signal_handler(SIGFPE, true, true); duke@435: duke@435: duke@435: if (os::Solaris::SIGinterrupt() > OLDMAXSIGNUM || os::Solaris::SIGasync() > OLDMAXSIGNUM) { duke@435: duke@435: // Pre-1.4.1 Libjsig limited to signal chaining signals <= 32 so duke@435: // can not register overridable signals which might be > 32 duke@435: if (libjsig_is_loaded && libjsigversion <= JSIG_VERSION_1_4_1) { duke@435: // Tell libjsig jvm has finished setting signal handlers duke@435: (*end_signal_setting)(); duke@435: libjsigdone = true; duke@435: } duke@435: } duke@435: duke@435: // Never ok to chain our SIGinterrupt duke@435: set_signal_handler(os::Solaris::SIGinterrupt(), true, false); duke@435: set_signal_handler(os::Solaris::SIGasync(), true, true); duke@435: duke@435: if (libjsig_is_loaded && !libjsigdone) { duke@435: // Tell libjsig jvm finishes setting signal handlers duke@435: (*end_signal_setting)(); duke@435: } duke@435: duke@435: // We don't activate signal checker if libjsig is in place, we trust ourselves duke@435: // and if UserSignalHandler is installed all bets are off duke@435: if (CheckJNICalls) { duke@435: if (libjsig_is_loaded) { duke@435: tty->print_cr("Info: libjsig is activated, all active signal checking is disabled"); duke@435: check_signals = false; duke@435: } duke@435: if (AllowUserSignalHandlers) { duke@435: tty->print_cr("Info: AllowUserSignalHandlers is activated, all active signal checking is disabled"); duke@435: check_signals = false; duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: void report_error(const char* file_name, int line_no, const char* title, const char* format, ...); duke@435: duke@435: const char * signames[] = { duke@435: "SIG0", duke@435: "SIGHUP", "SIGINT", "SIGQUIT", "SIGILL", "SIGTRAP", duke@435: "SIGABRT", "SIGEMT", "SIGFPE", "SIGKILL", "SIGBUS", duke@435: "SIGSEGV", "SIGSYS", "SIGPIPE", "SIGALRM", "SIGTERM", duke@435: "SIGUSR1", "SIGUSR2", "SIGCLD", "SIGPWR", "SIGWINCH", duke@435: "SIGURG", "SIGPOLL", "SIGSTOP", "SIGTSTP", "SIGCONT", duke@435: "SIGTTIN", "SIGTTOU", "SIGVTALRM", "SIGPROF", "SIGXCPU", duke@435: "SIGXFSZ", "SIGWAITING", "SIGLWP", "SIGFREEZE", "SIGTHAW", duke@435: "SIGCANCEL", "SIGLOST" duke@435: }; duke@435: duke@435: const char* os::exception_name(int exception_code, char* buf, size_t size) { duke@435: if (0 < exception_code && exception_code <= SIGRTMAX) { duke@435: // signal duke@435: if (exception_code < sizeof(signames)/sizeof(const char*)) { duke@435: jio_snprintf(buf, size, "%s", signames[exception_code]); duke@435: } else { duke@435: jio_snprintf(buf, size, "SIG%d", exception_code); duke@435: } duke@435: return buf; duke@435: } else { duke@435: return NULL; duke@435: } duke@435: } duke@435: duke@435: // (Static) wrappers for the new libthread API duke@435: int_fnP_thread_t_iP_uP_stack_tP_gregset_t os::Solaris::_thr_getstate; duke@435: int_fnP_thread_t_i_gregset_t os::Solaris::_thr_setstate; duke@435: int_fnP_thread_t_i os::Solaris::_thr_setmutator; duke@435: int_fnP_thread_t os::Solaris::_thr_suspend_mutator; duke@435: int_fnP_thread_t os::Solaris::_thr_continue_mutator; duke@435: duke@435: // (Static) wrappers for the liblgrp API duke@435: os::Solaris::lgrp_home_func_t os::Solaris::_lgrp_home; duke@435: os::Solaris::lgrp_init_func_t os::Solaris::_lgrp_init; duke@435: os::Solaris::lgrp_fini_func_t os::Solaris::_lgrp_fini; duke@435: os::Solaris::lgrp_root_func_t os::Solaris::_lgrp_root; duke@435: os::Solaris::lgrp_children_func_t os::Solaris::_lgrp_children; iveresov@579: os::Solaris::lgrp_resources_func_t os::Solaris::_lgrp_resources; duke@435: os::Solaris::lgrp_nlgrps_func_t os::Solaris::_lgrp_nlgrps; duke@435: os::Solaris::lgrp_cookie_stale_func_t os::Solaris::_lgrp_cookie_stale; duke@435: os::Solaris::lgrp_cookie_t os::Solaris::_lgrp_cookie = 0; duke@435: duke@435: // (Static) wrapper for meminfo() call. duke@435: os::Solaris::meminfo_func_t os::Solaris::_meminfo = 0; duke@435: duke@435: static address resolve_symbol(const char *name) { duke@435: address addr; duke@435: duke@435: addr = (address) dlsym(RTLD_DEFAULT, name); duke@435: if(addr == NULL) { duke@435: // RTLD_DEFAULT was not defined on some early versions of 2.5.1 duke@435: addr = (address) dlsym(RTLD_NEXT, name); duke@435: if(addr == NULL) { duke@435: fatal(dlerror()); duke@435: } duke@435: } duke@435: return addr; duke@435: } duke@435: duke@435: duke@435: duke@435: // isT2_libthread() duke@435: // duke@435: // Routine to determine if we are currently using the new T2 libthread. duke@435: // duke@435: // We determine if we are using T2 by reading /proc/self/lstatus and duke@435: // looking for a thread with the ASLWP bit set. If we find this status duke@435: // bit set, we must assume that we are NOT using T2. The T2 team duke@435: // has approved this algorithm. duke@435: // duke@435: // We need to determine if we are running with the new T2 libthread duke@435: // since setting native thread priorities is handled differently duke@435: // when using this library. All threads created using T2 are bound duke@435: // threads. Calling thr_setprio is meaningless in this case. duke@435: // duke@435: bool isT2_libthread() { duke@435: static prheader_t * lwpArray = NULL; duke@435: static int lwpSize = 0; duke@435: static int lwpFile = -1; duke@435: lwpstatus_t * that; duke@435: char lwpName [128]; duke@435: bool isT2 = false; duke@435: duke@435: #define ADR(x) ((uintptr_t)(x)) duke@435: #define LWPINDEX(ary,ix) ((lwpstatus_t *)(((ary)->pr_entsize * (ix)) + (ADR((ary) + 1)))) duke@435: xlu@524: lwpFile = open("/proc/self/lstatus", O_RDONLY, 0); xlu@524: if (lwpFile < 0) { xlu@524: if (ThreadPriorityVerbose) warning ("Couldn't open /proc/self/lstatus\n"); xlu@524: return false; xlu@524: } duke@435: lwpSize = 16*1024; duke@435: for (;;) { duke@435: lseek (lwpFile, 0, SEEK_SET); xlu@524: lwpArray = (prheader_t *)NEW_C_HEAP_ARRAY(char, lwpSize); xlu@524: if (read(lwpFile, lwpArray, lwpSize) < 0) { xlu@524: if (ThreadPriorityVerbose) warning("Error reading /proc/self/lstatus\n"); duke@435: break; duke@435: } xlu@524: if ((lwpArray->pr_nent * lwpArray->pr_entsize) <= lwpSize) { xlu@524: // We got a good snapshot - now iterate over the list. xlu@524: int aslwpcount = 0; xlu@524: for (int i = 0; i < lwpArray->pr_nent; i++ ) { xlu@524: that = LWPINDEX(lwpArray,i); xlu@524: if (that->pr_flags & PR_ASLWP) { xlu@524: aslwpcount++; xlu@524: } xlu@524: } xlu@524: if (aslwpcount == 0) isT2 = true; xlu@524: break; xlu@524: } duke@435: lwpSize = lwpArray->pr_nent * lwpArray->pr_entsize; xlu@524: FREE_C_HEAP_ARRAY(char, lwpArray); // retry. xlu@524: } duke@435: duke@435: FREE_C_HEAP_ARRAY(char, lwpArray); duke@435: close (lwpFile); xlu@524: if (ThreadPriorityVerbose) { xlu@524: if (isT2) tty->print_cr("We are running with a T2 libthread\n"); duke@435: else tty->print_cr("We are not running with a T2 libthread\n"); duke@435: } xlu@524: return isT2; duke@435: } duke@435: duke@435: duke@435: void os::Solaris::libthread_init() { duke@435: address func = (address)dlsym(RTLD_DEFAULT, "_thr_suspend_allmutators"); duke@435: duke@435: // Determine if we are running with the new T2 libthread duke@435: os::Solaris::set_T2_libthread(isT2_libthread()); duke@435: duke@435: lwp_priocntl_init(); duke@435: duke@435: // RTLD_DEFAULT was not defined on some early versions of 5.5.1 duke@435: if(func == NULL) { duke@435: func = (address) dlsym(RTLD_NEXT, "_thr_suspend_allmutators"); duke@435: // Guarantee that this VM is running on an new enough OS (5.6 or duke@435: // later) that it will have a new enough libthread.so. duke@435: guarantee(func != NULL, "libthread.so is too old."); duke@435: } duke@435: duke@435: // Initialize the new libthread getstate API wrappers duke@435: func = resolve_symbol("thr_getstate"); duke@435: os::Solaris::set_thr_getstate(CAST_TO_FN_PTR(int_fnP_thread_t_iP_uP_stack_tP_gregset_t, func)); duke@435: duke@435: func = resolve_symbol("thr_setstate"); duke@435: os::Solaris::set_thr_setstate(CAST_TO_FN_PTR(int_fnP_thread_t_i_gregset_t, func)); duke@435: duke@435: func = resolve_symbol("thr_setmutator"); duke@435: os::Solaris::set_thr_setmutator(CAST_TO_FN_PTR(int_fnP_thread_t_i, func)); duke@435: duke@435: func = resolve_symbol("thr_suspend_mutator"); duke@435: os::Solaris::set_thr_suspend_mutator(CAST_TO_FN_PTR(int_fnP_thread_t, func)); duke@435: duke@435: func = resolve_symbol("thr_continue_mutator"); duke@435: os::Solaris::set_thr_continue_mutator(CAST_TO_FN_PTR(int_fnP_thread_t, func)); duke@435: duke@435: int size; duke@435: void (*handler_info_func)(address *, int *); duke@435: handler_info_func = CAST_TO_FN_PTR(void (*)(address *, int *), resolve_symbol("thr_sighndlrinfo")); duke@435: handler_info_func(&handler_start, &size); duke@435: handler_end = handler_start + size; duke@435: } duke@435: duke@435: duke@435: int_fnP_mutex_tP os::Solaris::_mutex_lock; duke@435: int_fnP_mutex_tP os::Solaris::_mutex_trylock; duke@435: int_fnP_mutex_tP os::Solaris::_mutex_unlock; duke@435: int_fnP_mutex_tP_i_vP os::Solaris::_mutex_init; duke@435: int_fnP_mutex_tP os::Solaris::_mutex_destroy; duke@435: int os::Solaris::_mutex_scope = USYNC_THREAD; duke@435: duke@435: int_fnP_cond_tP_mutex_tP_timestruc_tP os::Solaris::_cond_timedwait; duke@435: int_fnP_cond_tP_mutex_tP os::Solaris::_cond_wait; duke@435: int_fnP_cond_tP os::Solaris::_cond_signal; duke@435: int_fnP_cond_tP os::Solaris::_cond_broadcast; duke@435: int_fnP_cond_tP_i_vP os::Solaris::_cond_init; duke@435: int_fnP_cond_tP os::Solaris::_cond_destroy; duke@435: int os::Solaris::_cond_scope = USYNC_THREAD; duke@435: duke@435: void os::Solaris::synchronization_init() { duke@435: if(UseLWPSynchronization) { duke@435: os::Solaris::set_mutex_lock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("_lwp_mutex_lock"))); duke@435: os::Solaris::set_mutex_trylock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("_lwp_mutex_trylock"))); duke@435: os::Solaris::set_mutex_unlock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("_lwp_mutex_unlock"))); duke@435: os::Solaris::set_mutex_init(lwp_mutex_init); duke@435: os::Solaris::set_mutex_destroy(lwp_mutex_destroy); duke@435: os::Solaris::set_mutex_scope(USYNC_THREAD); duke@435: duke@435: os::Solaris::set_cond_timedwait(CAST_TO_FN_PTR(int_fnP_cond_tP_mutex_tP_timestruc_tP, resolve_symbol("_lwp_cond_timedwait"))); duke@435: os::Solaris::set_cond_wait(CAST_TO_FN_PTR(int_fnP_cond_tP_mutex_tP, resolve_symbol("_lwp_cond_wait"))); duke@435: os::Solaris::set_cond_signal(CAST_TO_FN_PTR(int_fnP_cond_tP, resolve_symbol("_lwp_cond_signal"))); duke@435: os::Solaris::set_cond_broadcast(CAST_TO_FN_PTR(int_fnP_cond_tP, resolve_symbol("_lwp_cond_broadcast"))); duke@435: os::Solaris::set_cond_init(lwp_cond_init); duke@435: os::Solaris::set_cond_destroy(lwp_cond_destroy); duke@435: os::Solaris::set_cond_scope(USYNC_THREAD); duke@435: } duke@435: else { duke@435: os::Solaris::set_mutex_scope(USYNC_THREAD); duke@435: os::Solaris::set_cond_scope(USYNC_THREAD); duke@435: duke@435: if(UsePthreads) { duke@435: os::Solaris::set_mutex_lock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("pthread_mutex_lock"))); duke@435: os::Solaris::set_mutex_trylock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("pthread_mutex_trylock"))); duke@435: os::Solaris::set_mutex_unlock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("pthread_mutex_unlock"))); duke@435: os::Solaris::set_mutex_init(pthread_mutex_default_init); duke@435: os::Solaris::set_mutex_destroy(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("pthread_mutex_destroy"))); duke@435: duke@435: os::Solaris::set_cond_timedwait(CAST_TO_FN_PTR(int_fnP_cond_tP_mutex_tP_timestruc_tP, resolve_symbol("pthread_cond_timedwait"))); duke@435: os::Solaris::set_cond_wait(CAST_TO_FN_PTR(int_fnP_cond_tP_mutex_tP, resolve_symbol("pthread_cond_wait"))); duke@435: os::Solaris::set_cond_signal(CAST_TO_FN_PTR(int_fnP_cond_tP, resolve_symbol("pthread_cond_signal"))); duke@435: os::Solaris::set_cond_broadcast(CAST_TO_FN_PTR(int_fnP_cond_tP, resolve_symbol("pthread_cond_broadcast"))); duke@435: os::Solaris::set_cond_init(pthread_cond_default_init); duke@435: os::Solaris::set_cond_destroy(CAST_TO_FN_PTR(int_fnP_cond_tP, resolve_symbol("pthread_cond_destroy"))); duke@435: } duke@435: else { duke@435: os::Solaris::set_mutex_lock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("mutex_lock"))); duke@435: os::Solaris::set_mutex_trylock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("mutex_trylock"))); duke@435: os::Solaris::set_mutex_unlock(CAST_TO_FN_PTR(int_fnP_mutex_tP, resolve_symbol("mutex_unlock"))); duke@435: os::Solaris::set_mutex_init(::mutex_init); duke@435: os::Solaris::set_mutex_destroy(::mutex_destroy); duke@435: duke@435: os::Solaris::set_cond_timedwait(CAST_TO_FN_PTR(int_fnP_cond_tP_mutex_tP_timestruc_tP, resolve_symbol("cond_timedwait"))); duke@435: os::Solaris::set_cond_wait(CAST_TO_FN_PTR(int_fnP_cond_tP_mutex_tP, resolve_symbol("cond_wait"))); duke@435: os::Solaris::set_cond_signal(CAST_TO_FN_PTR(int_fnP_cond_tP, resolve_symbol("cond_signal"))); duke@435: os::Solaris::set_cond_broadcast(CAST_TO_FN_PTR(int_fnP_cond_tP, resolve_symbol("cond_broadcast"))); duke@435: os::Solaris::set_cond_init(::cond_init); duke@435: os::Solaris::set_cond_destroy(::cond_destroy); duke@435: } duke@435: } duke@435: } duke@435: duke@435: void os::Solaris::liblgrp_init() { duke@435: void *handle = dlopen("liblgrp.so", RTLD_LAZY); duke@435: if (handle != NULL) { duke@435: os::Solaris::set_lgrp_home(CAST_TO_FN_PTR(lgrp_home_func_t, dlsym(handle, "lgrp_home"))); duke@435: os::Solaris::set_lgrp_init(CAST_TO_FN_PTR(lgrp_init_func_t, dlsym(handle, "lgrp_init"))); duke@435: os::Solaris::set_lgrp_fini(CAST_TO_FN_PTR(lgrp_fini_func_t, dlsym(handle, "lgrp_fini"))); duke@435: os::Solaris::set_lgrp_root(CAST_TO_FN_PTR(lgrp_root_func_t, dlsym(handle, "lgrp_root"))); duke@435: os::Solaris::set_lgrp_children(CAST_TO_FN_PTR(lgrp_children_func_t, dlsym(handle, "lgrp_children"))); iveresov@579: os::Solaris::set_lgrp_resources(CAST_TO_FN_PTR(lgrp_resources_func_t, dlsym(handle, "lgrp_resources"))); duke@435: os::Solaris::set_lgrp_nlgrps(CAST_TO_FN_PTR(lgrp_nlgrps_func_t, dlsym(handle, "lgrp_nlgrps"))); duke@435: os::Solaris::set_lgrp_cookie_stale(CAST_TO_FN_PTR(lgrp_cookie_stale_func_t, duke@435: dlsym(handle, "lgrp_cookie_stale"))); duke@435: duke@435: lgrp_cookie_t c = lgrp_init(LGRP_VIEW_CALLER); duke@435: set_lgrp_cookie(c); duke@435: } else { duke@435: warning("your OS does not support NUMA"); duke@435: } duke@435: } duke@435: duke@435: void os::Solaris::misc_sym_init() { duke@435: address func = (address)dlsym(RTLD_DEFAULT, "meminfo"); duke@435: if(func == NULL) { duke@435: func = (address) dlsym(RTLD_NEXT, "meminfo"); duke@435: } duke@435: if (func != NULL) { duke@435: os::Solaris::set_meminfo(CAST_TO_FN_PTR(meminfo_func_t, func)); duke@435: } duke@435: } duke@435: duke@435: // Symbol doesn't exist in Solaris 8 pset.h duke@435: #ifndef PS_MYID duke@435: #define PS_MYID -3 duke@435: #endif duke@435: duke@435: // int pset_getloadavg(psetid_t pset, double loadavg[], int nelem); duke@435: typedef long (*pset_getloadavg_type)(psetid_t pset, double loadavg[], int nelem); duke@435: static pset_getloadavg_type pset_getloadavg_ptr = NULL; duke@435: duke@435: void init_pset_getloadavg_ptr(void) { duke@435: pset_getloadavg_ptr = duke@435: (pset_getloadavg_type)dlsym(RTLD_DEFAULT, "pset_getloadavg"); duke@435: if (PrintMiscellaneous && Verbose && pset_getloadavg_ptr == NULL) { duke@435: warning("pset_getloadavg function not found"); duke@435: } duke@435: } duke@435: duke@435: int os::Solaris::_dev_zero_fd = -1; duke@435: duke@435: // this is called _before_ the global arguments have been parsed duke@435: void os::init(void) { duke@435: _initial_pid = getpid(); duke@435: duke@435: max_hrtime = first_hrtime = gethrtime(); duke@435: duke@435: init_random(1234567); duke@435: duke@435: page_size = sysconf(_SC_PAGESIZE); duke@435: if (page_size == -1) duke@435: fatal1("os_solaris.cpp: os::init: sysconf failed (%s)", strerror(errno)); duke@435: init_page_sizes((size_t) page_size); duke@435: duke@435: Solaris::initialize_system_info(); duke@435: duke@435: int fd = open("/dev/zero", O_RDWR); duke@435: if (fd < 0) { duke@435: fatal1("os::init: cannot open /dev/zero (%s)", strerror(errno)); duke@435: } else { duke@435: Solaris::set_dev_zero_fd(fd); duke@435: duke@435: // Close on exec, child won't inherit. duke@435: fcntl(fd, F_SETFD, FD_CLOEXEC); duke@435: } duke@435: duke@435: clock_tics_per_sec = CLK_TCK; duke@435: duke@435: // check if dladdr1() exists; dladdr1 can provide more information than duke@435: // dladdr for os::dll_address_to_function_name. It comes with SunOS 5.9 duke@435: // and is available on linker patches for 5.7 and 5.8. duke@435: // libdl.so must have been loaded, this call is just an entry lookup duke@435: void * hdl = dlopen("libdl.so", RTLD_NOW); duke@435: if (hdl) duke@435: dladdr1_func = CAST_TO_FN_PTR(dladdr1_func_type, dlsym(hdl, "dladdr1")); duke@435: duke@435: // (Solaris only) this switches to calls that actually do locking. duke@435: ThreadCritical::initialize(); duke@435: duke@435: main_thread = thr_self(); duke@435: duke@435: // Constant minimum stack size allowed. It must be at least duke@435: // the minimum of what the OS supports (thr_min_stack()), and duke@435: // enough to allow the thread to get to user bytecode execution. duke@435: Solaris::min_stack_allowed = MAX2(thr_min_stack(), Solaris::min_stack_allowed); duke@435: // If the pagesize of the VM is greater than 8K determine the appropriate duke@435: // number of initial guard pages. The user can change this with the duke@435: // command line arguments, if needed. duke@435: if (vm_page_size() > 8*K) { duke@435: StackYellowPages = 1; duke@435: StackRedPages = 1; duke@435: StackShadowPages = round_to((StackShadowPages*8*K), vm_page_size()) / vm_page_size(); duke@435: } duke@435: } duke@435: duke@435: // To install functions for atexit system call duke@435: extern "C" { duke@435: static void perfMemory_exit_helper() { duke@435: perfMemory_exit(); duke@435: } duke@435: } duke@435: duke@435: // this is called _after_ the global arguments have been parsed duke@435: jint os::init_2(void) { duke@435: // try to enable extended file IO ASAP, see 6431278 duke@435: os::Solaris::try_enable_extended_io(); duke@435: duke@435: // Allocate a single page and mark it as readable for safepoint polling. Also duke@435: // use this first mmap call to check support for MAP_ALIGN. duke@435: address polling_page = (address)Solaris::mmap_chunk((char*)page_size, duke@435: page_size, duke@435: MAP_PRIVATE | MAP_ALIGN, duke@435: PROT_READ); duke@435: if (polling_page == NULL) { duke@435: has_map_align = false; duke@435: polling_page = (address)Solaris::mmap_chunk(NULL, page_size, MAP_PRIVATE, duke@435: PROT_READ); duke@435: } duke@435: duke@435: os::set_polling_page(polling_page); duke@435: duke@435: #ifndef PRODUCT duke@435: if( Verbose && PrintMiscellaneous ) duke@435: tty->print("[SafePoint Polling address: " INTPTR_FORMAT "]\n", (intptr_t)polling_page); duke@435: #endif duke@435: duke@435: if (!UseMembar) { duke@435: address mem_serialize_page = (address)Solaris::mmap_chunk( NULL, page_size, MAP_PRIVATE, PROT_READ | PROT_WRITE ); duke@435: guarantee( mem_serialize_page != NULL, "mmap Failed for memory serialize page"); duke@435: os::set_memory_serialize_page( mem_serialize_page ); duke@435: duke@435: #ifndef PRODUCT duke@435: if(Verbose && PrintMiscellaneous) duke@435: tty->print("[Memory Serialize Page address: " INTPTR_FORMAT "]\n", (intptr_t)mem_serialize_page); duke@435: #endif duke@435: } duke@435: duke@435: FLAG_SET_DEFAULT(UseLargePages, os::large_page_init()); duke@435: duke@435: // Check minimum allowable stack size for thread creation and to initialize duke@435: // the java system classes, including StackOverflowError - depends on page duke@435: // size. Add a page for compiler2 recursion in main thread. duke@435: // Add in BytesPerWord times page size to account for VM stack during duke@435: // class initialization depending on 32 or 64 bit VM. duke@435: guarantee((Solaris::min_stack_allowed >= duke@435: (StackYellowPages+StackRedPages+StackShadowPages+BytesPerWord duke@435: COMPILER2_PRESENT(+1)) * page_size), duke@435: "need to increase Solaris::min_stack_allowed on this platform"); duke@435: duke@435: size_t threadStackSizeInBytes = ThreadStackSize * K; duke@435: if (threadStackSizeInBytes != 0 && duke@435: threadStackSizeInBytes < Solaris::min_stack_allowed) { duke@435: tty->print_cr("\nThe stack size specified is too small, Specify at least %dk", duke@435: Solaris::min_stack_allowed/K); duke@435: return JNI_ERR; duke@435: } duke@435: duke@435: // For 64kbps there will be a 64kb page size, which makes duke@435: // the usable default stack size quite a bit less. Increase the duke@435: // stack for 64kb (or any > than 8kb) pages, this increases duke@435: // virtual memory fragmentation (since we're not creating the duke@435: // stack on a power of 2 boundary. The real fix for this duke@435: // should be to fix the guard page mechanism. duke@435: duke@435: if (vm_page_size() > 8*K) { duke@435: threadStackSizeInBytes = (threadStackSizeInBytes != 0) duke@435: ? threadStackSizeInBytes + duke@435: ((StackYellowPages + StackRedPages) * vm_page_size()) duke@435: : 0; duke@435: ThreadStackSize = threadStackSizeInBytes/K; duke@435: } duke@435: duke@435: // Make the stack size a multiple of the page size so that duke@435: // the yellow/red zones can be guarded. duke@435: JavaThread::set_stack_size_at_create(round_to(threadStackSizeInBytes, duke@435: vm_page_size())); duke@435: duke@435: Solaris::libthread_init(); duke@435: if (UseNUMA) { duke@435: Solaris::liblgrp_init(); duke@435: } duke@435: Solaris::misc_sym_init(); duke@435: Solaris::signal_sets_init(); duke@435: Solaris::init_signal_mem(); duke@435: Solaris::install_signal_handlers(); duke@435: duke@435: if (libjsigversion < JSIG_VERSION_1_4_1) { duke@435: Maxlibjsigsigs = OLDMAXSIGNUM; duke@435: } duke@435: duke@435: // initialize synchronization primitives to use either thread or duke@435: // lwp synchronization (controlled by UseLWPSynchronization) duke@435: Solaris::synchronization_init(); duke@435: duke@435: if (MaxFDLimit) { duke@435: // set the number of file descriptors to max. print out error duke@435: // if getrlimit/setrlimit fails but continue regardless. duke@435: struct rlimit nbr_files; duke@435: int status = getrlimit(RLIMIT_NOFILE, &nbr_files); duke@435: if (status != 0) { duke@435: if (PrintMiscellaneous && (Verbose || WizardMode)) duke@435: perror("os::init_2 getrlimit failed"); duke@435: } else { duke@435: nbr_files.rlim_cur = nbr_files.rlim_max; duke@435: status = setrlimit(RLIMIT_NOFILE, &nbr_files); duke@435: if (status != 0) { duke@435: if (PrintMiscellaneous && (Verbose || WizardMode)) duke@435: perror("os::init_2 setrlimit failed"); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Initialize HPI. duke@435: jint hpi_result = hpi::initialize(); duke@435: if (hpi_result != JNI_OK) { duke@435: tty->print_cr("There was an error trying to initialize the HPI library."); duke@435: return hpi_result; duke@435: } duke@435: duke@435: // Calculate theoretical max. size of Threads to guard gainst duke@435: // artifical out-of-memory situations, where all available address- duke@435: // space has been reserved by thread stacks. Default stack size is 1Mb. duke@435: size_t pre_thread_stack_size = (JavaThread::stack_size_at_create()) ? duke@435: JavaThread::stack_size_at_create() : (1*K*K); duke@435: assert(pre_thread_stack_size != 0, "Must have a stack"); duke@435: // Solaris has a maximum of 4Gb of user programs. Calculate the thread limit when duke@435: // we should start doing Virtual Memory banging. Currently when the threads will duke@435: // have used all but 200Mb of space. duke@435: size_t max_address_space = ((unsigned int)4 * K * K * K) - (200 * K * K); duke@435: Solaris::_os_thread_limit = max_address_space / pre_thread_stack_size; duke@435: duke@435: // at-exit methods are called in the reverse order of their registration. duke@435: // In Solaris 7 and earlier, atexit functions are called on return from duke@435: // main or as a result of a call to exit(3C). There can be only 32 of duke@435: // these functions registered and atexit() does not set errno. In Solaris duke@435: // 8 and later, there is no limit to the number of functions registered duke@435: // and atexit() sets errno. In addition, in Solaris 8 and later, atexit duke@435: // functions are called upon dlclose(3DL) in addition to return from main duke@435: // and exit(3C). duke@435: duke@435: if (PerfAllowAtExitRegistration) { duke@435: // only register atexit functions if PerfAllowAtExitRegistration is set. duke@435: // atexit functions can be delayed until process exit time, which duke@435: // can be problematic for embedded VM situations. Embedded VMs should duke@435: // call DestroyJavaVM() to assure that VM resources are released. duke@435: duke@435: // note: perfMemory_exit_helper atexit function may be removed in duke@435: // the future if the appropriate cleanup code can be added to the duke@435: // VM_Exit VMOperation's doit method. duke@435: if (atexit(perfMemory_exit_helper) != 0) { duke@435: warning("os::init2 atexit(perfMemory_exit_helper) failed"); duke@435: } duke@435: } duke@435: duke@435: // Init pset_loadavg function pointer duke@435: init_pset_getloadavg_ptr(); duke@435: duke@435: return JNI_OK; duke@435: } duke@435: duke@435: duke@435: // Mark the polling page as unreadable duke@435: void os::make_polling_page_unreadable(void) { duke@435: if( mprotect((char *)_polling_page, page_size, PROT_NONE) != 0 ) duke@435: fatal("Could not disable polling page"); duke@435: }; duke@435: duke@435: // Mark the polling page as readable duke@435: void os::make_polling_page_readable(void) { duke@435: if( mprotect((char *)_polling_page, page_size, PROT_READ) != 0 ) duke@435: fatal("Could not enable polling page"); duke@435: }; duke@435: duke@435: // OS interface. duke@435: duke@435: int os::stat(const char *path, struct stat *sbuf) { duke@435: char pathbuf[MAX_PATH]; duke@435: if (strlen(path) > MAX_PATH - 1) { duke@435: errno = ENAMETOOLONG; duke@435: return -1; duke@435: } duke@435: hpi::native_path(strcpy(pathbuf, path)); duke@435: return ::stat(pathbuf, sbuf); duke@435: } duke@435: duke@435: duke@435: bool os::check_heap(bool force) { return true; } duke@435: duke@435: typedef int (*vsnprintf_t)(char* buf, size_t count, const char* fmt, va_list argptr); duke@435: static vsnprintf_t sol_vsnprintf = NULL; duke@435: duke@435: int local_vsnprintf(char* buf, size_t count, const char* fmt, va_list argptr) { duke@435: if (!sol_vsnprintf) { duke@435: //search for the named symbol in the objects that were loaded after libjvm duke@435: void* where = RTLD_NEXT; duke@435: if ((sol_vsnprintf = CAST_TO_FN_PTR(vsnprintf_t, dlsym(where, "__vsnprintf"))) == NULL) duke@435: sol_vsnprintf = CAST_TO_FN_PTR(vsnprintf_t, dlsym(where, "vsnprintf")); duke@435: if (!sol_vsnprintf){ duke@435: //search for the named symbol in the objects that were loaded before libjvm duke@435: where = RTLD_DEFAULT; duke@435: if ((sol_vsnprintf = CAST_TO_FN_PTR(vsnprintf_t, dlsym(where, "__vsnprintf"))) == NULL) duke@435: sol_vsnprintf = CAST_TO_FN_PTR(vsnprintf_t, dlsym(where, "vsnprintf")); duke@435: assert(sol_vsnprintf != NULL, "vsnprintf not found"); duke@435: } duke@435: } duke@435: return (*sol_vsnprintf)(buf, count, fmt, argptr); duke@435: } duke@435: duke@435: duke@435: // Is a (classpath) directory empty? duke@435: bool os::dir_is_empty(const char* path) { duke@435: DIR *dir = NULL; duke@435: struct dirent *ptr; duke@435: duke@435: dir = opendir(path); duke@435: if (dir == NULL) return true; duke@435: duke@435: /* Scan the directory */ duke@435: bool result = true; duke@435: char buf[sizeof(struct dirent) + MAX_PATH]; duke@435: struct dirent *dbuf = (struct dirent *) buf; duke@435: while (result && (ptr = readdir(dir, dbuf)) != NULL) { duke@435: if (strcmp(ptr->d_name, ".") != 0 && strcmp(ptr->d_name, "..") != 0) { duke@435: result = false; duke@435: } duke@435: } duke@435: closedir(dir); duke@435: return result; duke@435: } duke@435: duke@435: // create binary file, rewriting existing file if required duke@435: int os::create_binary_file(const char* path, bool rewrite_existing) { duke@435: int oflags = O_WRONLY | O_CREAT; duke@435: if (!rewrite_existing) { duke@435: oflags |= O_EXCL; duke@435: } duke@435: return ::open64(path, oflags, S_IREAD | S_IWRITE); duke@435: } duke@435: duke@435: // return current position of file pointer duke@435: jlong os::current_file_offset(int fd) { duke@435: return (jlong)::lseek64(fd, (off64_t)0, SEEK_CUR); duke@435: } duke@435: duke@435: // move file pointer to the specified offset duke@435: jlong os::seek_to_file_offset(int fd, jlong offset) { duke@435: return (jlong)::lseek64(fd, (off64_t)offset, SEEK_SET); duke@435: } duke@435: duke@435: // Map a block of memory. duke@435: char* os::map_memory(int fd, const char* file_name, size_t file_offset, duke@435: char *addr, size_t bytes, bool read_only, duke@435: bool allow_exec) { duke@435: int prot; duke@435: int flags; duke@435: duke@435: if (read_only) { duke@435: prot = PROT_READ; duke@435: flags = MAP_SHARED; duke@435: } else { duke@435: prot = PROT_READ | PROT_WRITE; duke@435: flags = MAP_PRIVATE; duke@435: } duke@435: duke@435: if (allow_exec) { duke@435: prot |= PROT_EXEC; duke@435: } duke@435: duke@435: if (addr != NULL) { duke@435: flags |= MAP_FIXED; duke@435: } duke@435: duke@435: char* mapped_address = (char*)mmap(addr, (size_t)bytes, prot, flags, duke@435: fd, file_offset); duke@435: if (mapped_address == MAP_FAILED) { duke@435: return NULL; duke@435: } duke@435: return mapped_address; duke@435: } duke@435: duke@435: duke@435: // Remap a block of memory. duke@435: char* os::remap_memory(int fd, const char* file_name, size_t file_offset, duke@435: char *addr, size_t bytes, bool read_only, duke@435: bool allow_exec) { duke@435: // same as map_memory() on this OS duke@435: return os::map_memory(fd, file_name, file_offset, addr, bytes, read_only, duke@435: allow_exec); duke@435: } duke@435: duke@435: duke@435: // Unmap a block of memory. duke@435: bool os::unmap_memory(char* addr, size_t bytes) { duke@435: return munmap(addr, bytes) == 0; duke@435: } duke@435: duke@435: void os::pause() { duke@435: char filename[MAX_PATH]; duke@435: if (PauseAtStartupFile && PauseAtStartupFile[0]) { duke@435: jio_snprintf(filename, MAX_PATH, PauseAtStartupFile); duke@435: } else { duke@435: jio_snprintf(filename, MAX_PATH, "./vm.paused.%d", current_process_id()); duke@435: } duke@435: duke@435: int fd = ::open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0666); duke@435: if (fd != -1) { duke@435: struct stat buf; duke@435: close(fd); duke@435: while (::stat(filename, &buf) == 0) { duke@435: (void)::poll(NULL, 0, 100); duke@435: } duke@435: } else { duke@435: jio_fprintf(stderr, duke@435: "Could not open pause file '%s', continuing immediately.\n", filename); duke@435: } duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: #ifdef INTERPOSE_ON_SYSTEM_SYNCH_FUNCTIONS duke@435: // Turn this on if you need to trace synch operations. duke@435: // Set RECORD_SYNCH_LIMIT to a large-enough value, duke@435: // and call record_synch_enable and record_synch_disable duke@435: // around the computation of interest. duke@435: duke@435: void record_synch(char* name, bool returning); // defined below duke@435: duke@435: class RecordSynch { duke@435: char* _name; duke@435: public: duke@435: RecordSynch(char* name) :_name(name) duke@435: { record_synch(_name, false); } duke@435: ~RecordSynch() { record_synch(_name, true); } duke@435: }; duke@435: duke@435: #define CHECK_SYNCH_OP(ret, name, params, args, inner) \ duke@435: extern "C" ret name params { \ duke@435: typedef ret name##_t params; \ duke@435: static name##_t* implem = NULL; \ duke@435: static int callcount = 0; \ duke@435: if (implem == NULL) { \ duke@435: implem = (name##_t*) dlsym(RTLD_NEXT, #name); \ duke@435: if (implem == NULL) fatal(dlerror()); \ duke@435: } \ duke@435: ++callcount; \ duke@435: RecordSynch _rs(#name); \ duke@435: inner; \ duke@435: return implem args; \ duke@435: } duke@435: // in dbx, examine callcounts this way: duke@435: // for n in $(eval whereis callcount | awk '{print $2}'); do print $n; done duke@435: duke@435: #define CHECK_POINTER_OK(p) \ duke@435: (Universe::perm_gen() == NULL || !Universe::is_reserved_heap((oop)(p))) duke@435: #define CHECK_MU \ duke@435: if (!CHECK_POINTER_OK(mu)) fatal("Mutex must be in C heap only."); duke@435: #define CHECK_CV \ duke@435: if (!CHECK_POINTER_OK(cv)) fatal("Condvar must be in C heap only."); duke@435: #define CHECK_P(p) \ duke@435: if (!CHECK_POINTER_OK(p)) fatal(false, "Pointer must be in C heap only."); duke@435: duke@435: #define CHECK_MUTEX(mutex_op) \ duke@435: CHECK_SYNCH_OP(int, mutex_op, (mutex_t *mu), (mu), CHECK_MU); duke@435: duke@435: CHECK_MUTEX( mutex_lock) duke@435: CHECK_MUTEX( _mutex_lock) duke@435: CHECK_MUTEX( mutex_unlock) duke@435: CHECK_MUTEX(_mutex_unlock) duke@435: CHECK_MUTEX( mutex_trylock) duke@435: CHECK_MUTEX(_mutex_trylock) duke@435: duke@435: #define CHECK_COND(cond_op) \ duke@435: CHECK_SYNCH_OP(int, cond_op, (cond_t *cv, mutex_t *mu), (cv, mu), CHECK_MU;CHECK_CV); duke@435: duke@435: CHECK_COND( cond_wait); duke@435: CHECK_COND(_cond_wait); duke@435: CHECK_COND(_cond_wait_cancel); duke@435: duke@435: #define CHECK_COND2(cond_op) \ duke@435: CHECK_SYNCH_OP(int, cond_op, (cond_t *cv, mutex_t *mu, timestruc_t* ts), (cv, mu, ts), CHECK_MU;CHECK_CV); duke@435: duke@435: CHECK_COND2( cond_timedwait); duke@435: CHECK_COND2(_cond_timedwait); duke@435: CHECK_COND2(_cond_timedwait_cancel); duke@435: duke@435: // do the _lwp_* versions too duke@435: #define mutex_t lwp_mutex_t duke@435: #define cond_t lwp_cond_t duke@435: CHECK_MUTEX( _lwp_mutex_lock) duke@435: CHECK_MUTEX( _lwp_mutex_unlock) duke@435: CHECK_MUTEX( _lwp_mutex_trylock) duke@435: CHECK_MUTEX( __lwp_mutex_lock) duke@435: CHECK_MUTEX( __lwp_mutex_unlock) duke@435: CHECK_MUTEX( __lwp_mutex_trylock) duke@435: CHECK_MUTEX(___lwp_mutex_lock) duke@435: CHECK_MUTEX(___lwp_mutex_unlock) duke@435: duke@435: CHECK_COND( _lwp_cond_wait); duke@435: CHECK_COND( __lwp_cond_wait); duke@435: CHECK_COND(___lwp_cond_wait); duke@435: duke@435: CHECK_COND2( _lwp_cond_timedwait); duke@435: CHECK_COND2( __lwp_cond_timedwait); duke@435: #undef mutex_t duke@435: #undef cond_t duke@435: duke@435: CHECK_SYNCH_OP(int, _lwp_suspend2, (int lwp, int *n), (lwp, n), 0); duke@435: CHECK_SYNCH_OP(int,__lwp_suspend2, (int lwp, int *n), (lwp, n), 0); duke@435: CHECK_SYNCH_OP(int, _lwp_kill, (int lwp, int n), (lwp, n), 0); duke@435: CHECK_SYNCH_OP(int,__lwp_kill, (int lwp, int n), (lwp, n), 0); duke@435: CHECK_SYNCH_OP(int, _lwp_sema_wait, (lwp_sema_t* p), (p), CHECK_P(p)); duke@435: CHECK_SYNCH_OP(int,__lwp_sema_wait, (lwp_sema_t* p), (p), CHECK_P(p)); duke@435: CHECK_SYNCH_OP(int, _lwp_cond_broadcast, (lwp_cond_t* cv), (cv), CHECK_CV); duke@435: CHECK_SYNCH_OP(int,__lwp_cond_broadcast, (lwp_cond_t* cv), (cv), CHECK_CV); duke@435: duke@435: duke@435: // recording machinery: duke@435: duke@435: enum { RECORD_SYNCH_LIMIT = 200 }; duke@435: char* record_synch_name[RECORD_SYNCH_LIMIT]; duke@435: void* record_synch_arg0ptr[RECORD_SYNCH_LIMIT]; duke@435: bool record_synch_returning[RECORD_SYNCH_LIMIT]; duke@435: thread_t record_synch_thread[RECORD_SYNCH_LIMIT]; duke@435: int record_synch_count = 0; duke@435: bool record_synch_enabled = false; duke@435: duke@435: // in dbx, examine recorded data this way: duke@435: // for n in name arg0ptr returning thread; do print record_synch_$n[0..record_synch_count-1]; done duke@435: duke@435: void record_synch(char* name, bool returning) { duke@435: if (record_synch_enabled) { duke@435: if (record_synch_count < RECORD_SYNCH_LIMIT) { duke@435: record_synch_name[record_synch_count] = name; duke@435: record_synch_returning[record_synch_count] = returning; duke@435: record_synch_thread[record_synch_count] = thr_self(); duke@435: record_synch_arg0ptr[record_synch_count] = &name; duke@435: record_synch_count++; duke@435: } duke@435: // put more checking code here: duke@435: // ... duke@435: } duke@435: } duke@435: duke@435: void record_synch_enable() { duke@435: // start collecting trace data, if not already doing so duke@435: if (!record_synch_enabled) record_synch_count = 0; duke@435: record_synch_enabled = true; duke@435: } duke@435: duke@435: void record_synch_disable() { duke@435: // stop collecting trace data duke@435: record_synch_enabled = false; duke@435: } duke@435: duke@435: #endif // INTERPOSE_ON_SYSTEM_SYNCH_FUNCTIONS duke@435: #endif // PRODUCT duke@435: duke@435: const intptr_t thr_time_off = (intptr_t)(&((prusage_t *)(NULL))->pr_utime); duke@435: const intptr_t thr_time_size = (intptr_t)(&((prusage_t *)(NULL))->pr_ttime) - duke@435: (intptr_t)(&((prusage_t *)(NULL))->pr_utime); duke@435: duke@435: duke@435: // JVMTI & JVM monitoring and management support duke@435: // The thread_cpu_time() and current_thread_cpu_time() are only duke@435: // supported if is_thread_cpu_time_supported() returns true. duke@435: // They are not supported on Solaris T1. duke@435: duke@435: // current_thread_cpu_time(bool) and thread_cpu_time(Thread*, bool) duke@435: // are used by JVM M&M and JVMTI to get user+sys or user CPU time duke@435: // of a thread. duke@435: // duke@435: // current_thread_cpu_time() and thread_cpu_time(Thread *) duke@435: // returns the fast estimate available on the platform. duke@435: duke@435: // hrtime_t gethrvtime() return value includes duke@435: // user time but does not include system time duke@435: jlong os::current_thread_cpu_time() { duke@435: return (jlong) gethrvtime(); duke@435: } duke@435: duke@435: jlong os::thread_cpu_time(Thread *thread) { duke@435: // return user level CPU time only to be consistent with duke@435: // what current_thread_cpu_time returns. duke@435: // thread_cpu_time_info() must be changed if this changes duke@435: return os::thread_cpu_time(thread, false /* user time only */); duke@435: } duke@435: duke@435: jlong os::current_thread_cpu_time(bool user_sys_cpu_time) { duke@435: if (user_sys_cpu_time) { duke@435: return os::thread_cpu_time(Thread::current(), user_sys_cpu_time); duke@435: } else { duke@435: return os::current_thread_cpu_time(); duke@435: } duke@435: } duke@435: duke@435: jlong os::thread_cpu_time(Thread *thread, bool user_sys_cpu_time) { duke@435: char proc_name[64]; duke@435: int count; duke@435: prusage_t prusage; duke@435: jlong lwp_time; duke@435: int fd; duke@435: duke@435: sprintf(proc_name, "/proc/%d/lwp/%d/lwpusage", duke@435: getpid(), duke@435: thread->osthread()->lwp_id()); duke@435: fd = open(proc_name, O_RDONLY); duke@435: if ( fd == -1 ) return -1; duke@435: duke@435: do { duke@435: count = pread(fd, duke@435: (void *)&prusage.pr_utime, duke@435: thr_time_size, duke@435: thr_time_off); duke@435: } while (count < 0 && errno == EINTR); duke@435: close(fd); duke@435: if ( count < 0 ) return -1; duke@435: duke@435: if (user_sys_cpu_time) { duke@435: // user + system CPU time duke@435: lwp_time = (((jlong)prusage.pr_stime.tv_sec + duke@435: (jlong)prusage.pr_utime.tv_sec) * (jlong)1000000000) + duke@435: (jlong)prusage.pr_stime.tv_nsec + duke@435: (jlong)prusage.pr_utime.tv_nsec; duke@435: } else { duke@435: // user level CPU time only duke@435: lwp_time = ((jlong)prusage.pr_utime.tv_sec * (jlong)1000000000) + duke@435: (jlong)prusage.pr_utime.tv_nsec; duke@435: } duke@435: duke@435: return(lwp_time); duke@435: } duke@435: duke@435: void os::current_thread_cpu_time_info(jvmtiTimerInfo *info_ptr) { duke@435: info_ptr->max_value = ALL_64_BITS; // will not wrap in less than 64 bits duke@435: info_ptr->may_skip_backward = false; // elapsed time not wall time duke@435: info_ptr->may_skip_forward = false; // elapsed time not wall time duke@435: info_ptr->kind = JVMTI_TIMER_USER_CPU; // only user time is returned duke@435: } duke@435: duke@435: void os::thread_cpu_time_info(jvmtiTimerInfo *info_ptr) { duke@435: info_ptr->max_value = ALL_64_BITS; // will not wrap in less than 64 bits duke@435: info_ptr->may_skip_backward = false; // elapsed time not wall time duke@435: info_ptr->may_skip_forward = false; // elapsed time not wall time duke@435: info_ptr->kind = JVMTI_TIMER_USER_CPU; // only user time is returned duke@435: } duke@435: duke@435: bool os::is_thread_cpu_time_supported() { duke@435: if ( os::Solaris::T2_libthread() || UseBoundThreads ) { duke@435: return true; duke@435: } else { duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: // System loadavg support. Returns -1 if load average cannot be obtained. duke@435: // Return the load average for our processor set if the primitive exists duke@435: // (Solaris 9 and later). Otherwise just return system wide loadavg. duke@435: int os::loadavg(double loadavg[], int nelem) { duke@435: if (pset_getloadavg_ptr != NULL) { duke@435: return (*pset_getloadavg_ptr)(PS_MYID, loadavg, nelem); duke@435: } else { duke@435: return ::getloadavg(loadavg, nelem); duke@435: } duke@435: } duke@435: duke@435: //--------------------------------------------------------------------------------- duke@435: #ifndef PRODUCT duke@435: duke@435: static address same_page(address x, address y) { duke@435: intptr_t page_bits = -os::vm_page_size(); duke@435: if ((intptr_t(x) & page_bits) == (intptr_t(y) & page_bits)) duke@435: return x; duke@435: else if (x > y) duke@435: return (address)(intptr_t(y) | ~page_bits) + 1; duke@435: else duke@435: return (address)(intptr_t(y) & page_bits); duke@435: } duke@435: duke@435: bool os::find(address addr) { duke@435: Dl_info dlinfo; duke@435: memset(&dlinfo, 0, sizeof(dlinfo)); duke@435: if (dladdr(addr, &dlinfo)) { duke@435: #ifdef _LP64 duke@435: tty->print("0x%016lx: ", addr); duke@435: #else duke@435: tty->print("0x%08x: ", addr); duke@435: #endif duke@435: if (dlinfo.dli_sname != NULL) duke@435: tty->print("%s+%#lx", dlinfo.dli_sname, addr-(intptr_t)dlinfo.dli_saddr); duke@435: else if (dlinfo.dli_fname) duke@435: tty->print("", addr-(intptr_t)dlinfo.dli_fbase); duke@435: else duke@435: tty->print(""); duke@435: if (dlinfo.dli_fname) tty->print(" in %s", dlinfo.dli_fname); duke@435: #ifdef _LP64 duke@435: if (dlinfo.dli_fbase) tty->print(" at 0x%016lx", dlinfo.dli_fbase); duke@435: #else duke@435: if (dlinfo.dli_fbase) tty->print(" at 0x%08x", dlinfo.dli_fbase); duke@435: #endif duke@435: tty->cr(); duke@435: duke@435: if (Verbose) { duke@435: // decode some bytes around the PC duke@435: address begin = same_page(addr-40, addr); duke@435: address end = same_page(addr+40, addr); duke@435: address lowest = (address) dlinfo.dli_sname; duke@435: if (!lowest) lowest = (address) dlinfo.dli_fbase; duke@435: if (begin < lowest) begin = lowest; duke@435: Dl_info dlinfo2; duke@435: if (dladdr(end, &dlinfo2) && dlinfo2.dli_saddr != dlinfo.dli_saddr duke@435: && end > dlinfo2.dli_saddr && dlinfo2.dli_saddr > begin) duke@435: end = (address) dlinfo2.dli_saddr; duke@435: Disassembler::decode(begin, end); duke@435: } duke@435: return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: #endif duke@435: duke@435: duke@435: // Following function has been added to support HotSparc's libjvm.so running duke@435: // under Solaris production JDK 1.2.2 / 1.3.0. These came from duke@435: // src/solaris/hpi/native_threads in the EVM codebase. duke@435: // duke@435: // NOTE: This is no longer needed in the 1.3.1 and 1.4 production release duke@435: // libraries and should thus be removed. We will leave it behind for a while duke@435: // until we no longer want to able to run on top of 1.3.0 Solaris production duke@435: // JDK. See 4341971. duke@435: duke@435: #define STACK_SLACK 0x800 duke@435: duke@435: extern "C" { duke@435: intptr_t sysThreadAvailableStackWithSlack() { duke@435: stack_t st; duke@435: intptr_t retval, stack_top; duke@435: retval = thr_stksegment(&st); duke@435: assert(retval == 0, "incorrect return value from thr_stksegment"); duke@435: assert((address)&st < (address)st.ss_sp, "Invalid stack base returned"); duke@435: assert((address)&st > (address)st.ss_sp-st.ss_size, "Invalid stack size returned"); duke@435: stack_top=(intptr_t)st.ss_sp-st.ss_size; duke@435: return ((intptr_t)&stack_top - stack_top - STACK_SLACK); duke@435: } duke@435: } duke@435: duke@435: // Just to get the Kernel build to link on solaris for testing. duke@435: duke@435: extern "C" { duke@435: class ASGCT_CallTrace; duke@435: void AsyncGetCallTrace(ASGCT_CallTrace *trace, jint depth, void* ucontext) duke@435: KERNEL_RETURN; duke@435: } duke@435: duke@435: duke@435: // ObjectMonitor park-unpark infrastructure ... duke@435: // duke@435: // We implement Solaris and Linux PlatformEvents with the duke@435: // obvious condvar-mutex-flag triple. duke@435: // Another alternative that works quite well is pipes: duke@435: // Each PlatformEvent consists of a pipe-pair. duke@435: // The thread associated with the PlatformEvent duke@435: // calls park(), which reads from the input end of the pipe. duke@435: // Unpark() writes into the other end of the pipe. duke@435: // The write-side of the pipe must be set NDELAY. duke@435: // Unfortunately pipes consume a large # of handles. duke@435: // Native solaris lwp_park() and lwp_unpark() work nicely, too. duke@435: // Using pipes for the 1st few threads might be workable, however. duke@435: // duke@435: // park() is permitted to return spuriously. duke@435: // Callers of park() should wrap the call to park() in duke@435: // an appropriate loop. A litmus test for the correct duke@435: // usage of park is the following: if park() were modified duke@435: // to immediately return 0 your code should still work, duke@435: // albeit degenerating to a spin loop. duke@435: // duke@435: // An interesting optimization for park() is to use a trylock() duke@435: // to attempt to acquire the mutex. If the trylock() fails duke@435: // then we know that a concurrent unpark() operation is in-progress. duke@435: // in that case the park() code could simply set _count to 0 duke@435: // and return immediately. The subsequent park() operation *might* duke@435: // return immediately. That's harmless as the caller of park() is duke@435: // expected to loop. By using trylock() we will have avoided a duke@435: // avoided a context switch caused by contention on the per-thread mutex. duke@435: // duke@435: // TODO-FIXME: duke@435: // 1. Reconcile Doug's JSR166 j.u.c park-unpark with the duke@435: // objectmonitor implementation. duke@435: // 2. Collapse the JSR166 parker event, and the duke@435: // objectmonitor ParkEvent into a single "Event" construct. duke@435: // 3. In park() and unpark() add: duke@435: // assert (Thread::current() == AssociatedWith). duke@435: // 4. add spurious wakeup injection on a -XX:EarlyParkReturn=N switch. duke@435: // 1-out-of-N park() operations will return immediately. duke@435: // duke@435: // _Event transitions in park() duke@435: // -1 => -1 : illegal duke@435: // 1 => 0 : pass - return immediately duke@435: // 0 => -1 : block duke@435: // duke@435: // _Event serves as a restricted-range semaphore. duke@435: // duke@435: // Another possible encoding of _Event would be with duke@435: // explicit "PARKED" == 01b and "SIGNALED" == 10b bits. duke@435: // duke@435: // TODO-FIXME: add DTRACE probes for: duke@435: // 1. Tx parks duke@435: // 2. Ty unparks Tx duke@435: // 3. Tx resumes from park duke@435: duke@435: duke@435: // value determined through experimentation duke@435: #define ROUNDINGFIX 11 duke@435: duke@435: // utility to compute the abstime argument to timedwait. duke@435: // TODO-FIXME: switch from compute_abstime() to unpackTime(). duke@435: duke@435: static timestruc_t* compute_abstime(timestruc_t* abstime, jlong millis) { duke@435: // millis is the relative timeout time duke@435: // abstime will be the absolute timeout time duke@435: if (millis < 0) millis = 0; duke@435: struct timeval now; duke@435: int status = gettimeofday(&now, NULL); duke@435: assert(status == 0, "gettimeofday"); duke@435: jlong seconds = millis / 1000; duke@435: jlong max_wait_period; duke@435: duke@435: if (UseLWPSynchronization) { duke@435: // forward port of fix for 4275818 (not sleeping long enough) duke@435: // There was a bug in Solaris 6, 7 and pre-patch 5 of 8 where duke@435: // _lwp_cond_timedwait() used a round_down algorithm rather duke@435: // than a round_up. For millis less than our roundfactor duke@435: // it rounded down to 0 which doesn't meet the spec. duke@435: // For millis > roundfactor we may return a bit sooner, but duke@435: // since we can not accurately identify the patch level and duke@435: // this has already been fixed in Solaris 9 and 8 we will duke@435: // leave it alone rather than always rounding down. duke@435: duke@435: if (millis > 0 && millis < ROUNDINGFIX) millis = ROUNDINGFIX; duke@435: // It appears that when we go directly through Solaris _lwp_cond_timedwait() duke@435: // the acceptable max time threshold is smaller than for libthread on 2.5.1 and 2.6 duke@435: max_wait_period = 21000000; duke@435: } else { duke@435: max_wait_period = 50000000; duke@435: } duke@435: millis %= 1000; duke@435: if (seconds > max_wait_period) { // see man cond_timedwait(3T) duke@435: seconds = max_wait_period; duke@435: } duke@435: abstime->tv_sec = now.tv_sec + seconds; duke@435: long usec = now.tv_usec + millis * 1000; duke@435: if (usec >= 1000000) { duke@435: abstime->tv_sec += 1; duke@435: usec -= 1000000; duke@435: } duke@435: abstime->tv_nsec = usec * 1000; duke@435: return abstime; duke@435: } duke@435: duke@435: // Test-and-clear _Event, always leaves _Event set to 0, returns immediately. duke@435: // Conceptually TryPark() should be equivalent to park(0). duke@435: duke@435: int os::PlatformEvent::TryPark() { duke@435: for (;;) { duke@435: const int v = _Event ; duke@435: guarantee ((v == 0) || (v == 1), "invariant") ; duke@435: if (Atomic::cmpxchg (0, &_Event, v) == v) return v ; duke@435: } duke@435: } duke@435: duke@435: void os::PlatformEvent::park() { // AKA: down() duke@435: // Invariant: Only the thread associated with the Event/PlatformEvent duke@435: // may call park(). duke@435: int v ; duke@435: for (;;) { duke@435: v = _Event ; duke@435: if (Atomic::cmpxchg (v-1, &_Event, v) == v) break ; duke@435: } duke@435: guarantee (v >= 0, "invariant") ; duke@435: if (v == 0) { duke@435: // Do this the hard way by blocking ... duke@435: // See http://monaco.sfbay/detail.jsf?cr=5094058. duke@435: // TODO-FIXME: for Solaris SPARC set fprs.FEF=0 prior to parking. duke@435: // Only for SPARC >= V8PlusA duke@435: #if defined(__sparc) && defined(COMPILER2) duke@435: if (ClearFPUAtPark) { _mark_fpu_nosave() ; } duke@435: #endif duke@435: int status = os::Solaris::mutex_lock(_mutex); duke@435: assert_status(status == 0, status, "mutex_lock"); duke@435: guarantee (_nParked == 0, "invariant") ; duke@435: ++ _nParked ; duke@435: while (_Event < 0) { duke@435: // for some reason, under 2.7 lwp_cond_wait() may return ETIME ... duke@435: // Treat this the same as if the wait was interrupted duke@435: // With usr/lib/lwp going to kernel, always handle ETIME duke@435: status = os::Solaris::cond_wait(_cond, _mutex); duke@435: if (status == ETIME) status = EINTR ; duke@435: assert_status(status == 0 || status == EINTR, status, "cond_wait"); duke@435: } duke@435: -- _nParked ; duke@435: _Event = 0 ; duke@435: status = os::Solaris::mutex_unlock(_mutex); duke@435: assert_status(status == 0, status, "mutex_unlock"); duke@435: } duke@435: } duke@435: duke@435: int os::PlatformEvent::park(jlong millis) { duke@435: guarantee (_nParked == 0, "invariant") ; duke@435: int v ; duke@435: for (;;) { duke@435: v = _Event ; duke@435: if (Atomic::cmpxchg (v-1, &_Event, v) == v) break ; duke@435: } duke@435: guarantee (v >= 0, "invariant") ; duke@435: if (v != 0) return OS_OK ; duke@435: duke@435: int ret = OS_TIMEOUT; duke@435: timestruc_t abst; duke@435: compute_abstime (&abst, millis); duke@435: duke@435: // See http://monaco.sfbay/detail.jsf?cr=5094058. duke@435: // For Solaris SPARC set fprs.FEF=0 prior to parking. duke@435: // Only for SPARC >= V8PlusA duke@435: #if defined(__sparc) && defined(COMPILER2) duke@435: if (ClearFPUAtPark) { _mark_fpu_nosave() ; } duke@435: #endif duke@435: int status = os::Solaris::mutex_lock(_mutex); duke@435: assert_status(status == 0, status, "mutex_lock"); duke@435: guarantee (_nParked == 0, "invariant") ; duke@435: ++ _nParked ; duke@435: while (_Event < 0) { duke@435: int status = os::Solaris::cond_timedwait(_cond, _mutex, &abst); duke@435: assert_status(status == 0 || status == EINTR || duke@435: status == ETIME || status == ETIMEDOUT, duke@435: status, "cond_timedwait"); duke@435: if (!FilterSpuriousWakeups) break ; // previous semantics duke@435: if (status == ETIME || status == ETIMEDOUT) break ; duke@435: // We consume and ignore EINTR and spurious wakeups. duke@435: } duke@435: -- _nParked ; duke@435: if (_Event >= 0) ret = OS_OK ; duke@435: _Event = 0 ; duke@435: status = os::Solaris::mutex_unlock(_mutex); duke@435: assert_status(status == 0, status, "mutex_unlock"); duke@435: return ret; duke@435: } duke@435: duke@435: void os::PlatformEvent::unpark() { duke@435: int v, AnyWaiters; duke@435: duke@435: // Increment _Event. duke@435: // Another acceptable implementation would be to simply swap 1 duke@435: // into _Event: duke@435: // if (Swap (&_Event, 1) < 0) { duke@435: // mutex_lock (_mutex) ; AnyWaiters = nParked; mutex_unlock (_mutex) ; duke@435: // if (AnyWaiters) cond_signal (_cond) ; duke@435: // } duke@435: duke@435: for (;;) { duke@435: v = _Event ; duke@435: if (v > 0) { duke@435: // The LD of _Event could have reordered or be satisfied duke@435: // by a read-aside from this processor's write buffer. duke@435: // To avoid problems execute a barrier and then duke@435: // ratify the value. A degenerate CAS() would also work. duke@435: // Viz., CAS (v+0, &_Event, v) == v). duke@435: OrderAccess::fence() ; duke@435: if (_Event == v) return ; duke@435: continue ; duke@435: } duke@435: if (Atomic::cmpxchg (v+1, &_Event, v) == v) break ; duke@435: } duke@435: duke@435: // If the thread associated with the event was parked, wake it. duke@435: if (v < 0) { duke@435: int status ; duke@435: // Wait for the thread assoc with the PlatformEvent to vacate. duke@435: status = os::Solaris::mutex_lock(_mutex); duke@435: assert_status(status == 0, status, "mutex_lock"); duke@435: AnyWaiters = _nParked ; duke@435: status = os::Solaris::mutex_unlock(_mutex); duke@435: assert_status(status == 0, status, "mutex_unlock"); duke@435: guarantee (AnyWaiters == 0 || AnyWaiters == 1, "invariant") ; duke@435: if (AnyWaiters != 0) { duke@435: // We intentional signal *after* dropping the lock duke@435: // to avoid a common class of futile wakeups. duke@435: status = os::Solaris::cond_signal(_cond); duke@435: assert_status(status == 0, status, "cond_signal"); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // JSR166 duke@435: // ------------------------------------------------------- duke@435: duke@435: /* duke@435: * The solaris and linux implementations of park/unpark are fairly duke@435: * conservative for now, but can be improved. They currently use a duke@435: * mutex/condvar pair, plus _counter. duke@435: * Park decrements _counter if > 0, else does a condvar wait. Unpark duke@435: * sets count to 1 and signals condvar. Only one thread ever waits duke@435: * on the condvar. Contention seen when trying to park implies that someone duke@435: * is unparking you, so don't wait. And spurious returns are fine, so there duke@435: * is no need to track notifications. duke@435: */ duke@435: duke@435: #define NANOSECS_PER_SEC 1000000000 duke@435: #define NANOSECS_PER_MILLISEC 1000000 duke@435: #define MAX_SECS 100000000 duke@435: duke@435: /* duke@435: * This code is common to linux and solaris and will be moved to a duke@435: * common place in dolphin. duke@435: * duke@435: * The passed in time value is either a relative time in nanoseconds duke@435: * or an absolute time in milliseconds. Either way it has to be unpacked duke@435: * into suitable seconds and nanoseconds components and stored in the duke@435: * given timespec structure. duke@435: * Given time is a 64-bit value and the time_t used in the timespec is only duke@435: * a signed-32-bit value (except on 64-bit Linux) we have to watch for duke@435: * overflow if times way in the future are given. Further on Solaris versions duke@435: * prior to 10 there is a restriction (see cond_timedwait) that the specified duke@435: * number of seconds, in abstime, is less than current_time + 100,000,000. duke@435: * As it will be 28 years before "now + 100000000" will overflow we can duke@435: * ignore overflow and just impose a hard-limit on seconds using the value duke@435: * of "now + 100,000,000". This places a limit on the timeout of about 3.17 duke@435: * years from "now". duke@435: */ duke@435: static void unpackTime(timespec* absTime, bool isAbsolute, jlong time) { duke@435: assert (time > 0, "convertTime"); duke@435: duke@435: struct timeval now; duke@435: int status = gettimeofday(&now, NULL); duke@435: assert(status == 0, "gettimeofday"); duke@435: duke@435: time_t max_secs = now.tv_sec + MAX_SECS; duke@435: duke@435: if (isAbsolute) { duke@435: jlong secs = time / 1000; duke@435: if (secs > max_secs) { duke@435: absTime->tv_sec = max_secs; duke@435: } duke@435: else { duke@435: absTime->tv_sec = secs; duke@435: } duke@435: absTime->tv_nsec = (time % 1000) * NANOSECS_PER_MILLISEC; duke@435: } duke@435: else { duke@435: jlong secs = time / NANOSECS_PER_SEC; duke@435: if (secs >= MAX_SECS) { duke@435: absTime->tv_sec = max_secs; duke@435: absTime->tv_nsec = 0; duke@435: } duke@435: else { duke@435: absTime->tv_sec = now.tv_sec + secs; duke@435: absTime->tv_nsec = (time % NANOSECS_PER_SEC) + now.tv_usec*1000; duke@435: if (absTime->tv_nsec >= NANOSECS_PER_SEC) { duke@435: absTime->tv_nsec -= NANOSECS_PER_SEC; duke@435: ++absTime->tv_sec; // note: this must be <= max_secs duke@435: } duke@435: } duke@435: } duke@435: assert(absTime->tv_sec >= 0, "tv_sec < 0"); duke@435: assert(absTime->tv_sec <= max_secs, "tv_sec > max_secs"); duke@435: assert(absTime->tv_nsec >= 0, "tv_nsec < 0"); duke@435: assert(absTime->tv_nsec < NANOSECS_PER_SEC, "tv_nsec >= nanos_per_sec"); duke@435: } duke@435: duke@435: void Parker::park(bool isAbsolute, jlong time) { duke@435: duke@435: // Optional fast-path check: duke@435: // Return immediately if a permit is available. duke@435: if (_counter > 0) { duke@435: _counter = 0 ; duke@435: return ; duke@435: } duke@435: duke@435: // Optional fast-exit: Check interrupt before trying to wait duke@435: Thread* thread = Thread::current(); duke@435: assert(thread->is_Java_thread(), "Must be JavaThread"); duke@435: JavaThread *jt = (JavaThread *)thread; duke@435: if (Thread::is_interrupted(thread, false)) { duke@435: return; duke@435: } duke@435: duke@435: // First, demultiplex/decode time arguments duke@435: timespec absTime; duke@435: if (time < 0) { // don't wait at all duke@435: return; duke@435: } duke@435: if (time > 0) { duke@435: // Warning: this code might be exposed to the old Solaris time duke@435: // round-down bugs. Grep "roundingFix" for details. duke@435: unpackTime(&absTime, isAbsolute, time); duke@435: } duke@435: duke@435: // Enter safepoint region duke@435: // Beware of deadlocks such as 6317397. duke@435: // The per-thread Parker:: _mutex is a classic leaf-lock. duke@435: // In particular a thread must never block on the Threads_lock while duke@435: // holding the Parker:: mutex. If safepoints are pending both the duke@435: // the ThreadBlockInVM() CTOR and DTOR may grab Threads_lock. duke@435: ThreadBlockInVM tbivm(jt); duke@435: duke@435: // Don't wait if cannot get lock since interference arises from duke@435: // unblocking. Also. check interrupt before trying wait duke@435: if (Thread::is_interrupted(thread, false) || duke@435: os::Solaris::mutex_trylock(_mutex) != 0) { duke@435: return; duke@435: } duke@435: duke@435: int status ; duke@435: duke@435: if (_counter > 0) { // no wait needed duke@435: _counter = 0; duke@435: status = os::Solaris::mutex_unlock(_mutex); duke@435: assert (status == 0, "invariant") ; duke@435: return; duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: // Don't catch signals while blocked; let the running threads have the signals. duke@435: // (This allows a debugger to break into the running thread.) duke@435: sigset_t oldsigs; duke@435: sigset_t* allowdebug_blocked = os::Solaris::allowdebug_blocked_signals(); duke@435: thr_sigsetmask(SIG_BLOCK, allowdebug_blocked, &oldsigs); duke@435: #endif duke@435: duke@435: OSThreadWaitState osts(thread->osthread(), false /* not Object.wait() */); duke@435: jt->set_suspend_equivalent(); duke@435: // cleared by handle_special_suspend_equivalent_condition() or java_suspend_self() duke@435: duke@435: // Do this the hard way by blocking ... duke@435: // See http://monaco.sfbay/detail.jsf?cr=5094058. duke@435: // TODO-FIXME: for Solaris SPARC set fprs.FEF=0 prior to parking. duke@435: // Only for SPARC >= V8PlusA duke@435: #if defined(__sparc) && defined(COMPILER2) duke@435: if (ClearFPUAtPark) { _mark_fpu_nosave() ; } duke@435: #endif duke@435: duke@435: if (time == 0) { duke@435: status = os::Solaris::cond_wait (_cond, _mutex) ; duke@435: } else { duke@435: status = os::Solaris::cond_timedwait (_cond, _mutex, &absTime); duke@435: } duke@435: // Note that an untimed cond_wait() can sometimes return ETIME on older duke@435: // versions of the Solaris. duke@435: assert_status(status == 0 || status == EINTR || duke@435: status == ETIME || status == ETIMEDOUT, duke@435: status, "cond_timedwait"); duke@435: duke@435: #ifdef ASSERT duke@435: thr_sigsetmask(SIG_SETMASK, &oldsigs, NULL); duke@435: #endif duke@435: _counter = 0 ; duke@435: status = os::Solaris::mutex_unlock(_mutex); duke@435: assert_status(status == 0, status, "mutex_unlock") ; duke@435: duke@435: // If externally suspended while waiting, re-suspend duke@435: if (jt->handle_special_suspend_equivalent_condition()) { duke@435: jt->java_suspend_self(); duke@435: } duke@435: duke@435: } duke@435: duke@435: void Parker::unpark() { duke@435: int s, status ; duke@435: status = os::Solaris::mutex_lock (_mutex) ; duke@435: assert (status == 0, "invariant") ; duke@435: s = _counter; duke@435: _counter = 1; duke@435: status = os::Solaris::mutex_unlock (_mutex) ; duke@435: assert (status == 0, "invariant") ; duke@435: duke@435: if (s < 1) { duke@435: status = os::Solaris::cond_signal (_cond) ; duke@435: assert (status == 0, "invariant") ; duke@435: } duke@435: } duke@435: duke@435: extern char** environ; duke@435: duke@435: // Run the specified command in a separate process. Return its exit value, duke@435: // or -1 on failure (e.g. can't fork a new process). duke@435: // Unlike system(), this function can be called from signal handler. It duke@435: // doesn't block SIGINT et al. duke@435: int os::fork_and_exec(char* cmd) { duke@435: char * argv[4]; duke@435: argv[0] = (char *)"sh"; duke@435: argv[1] = (char *)"-c"; duke@435: argv[2] = cmd; duke@435: argv[3] = NULL; duke@435: duke@435: // fork is async-safe, fork1 is not so can't use in signal handler duke@435: pid_t pid; duke@435: Thread* t = ThreadLocalStorage::get_thread_slow(); duke@435: if (t != NULL && t->is_inside_signal_handler()) { duke@435: pid = fork(); duke@435: } else { duke@435: pid = fork1(); duke@435: } duke@435: duke@435: if (pid < 0) { duke@435: // fork failed duke@435: warning("fork failed: %s", strerror(errno)); duke@435: return -1; duke@435: duke@435: } else if (pid == 0) { duke@435: // child process duke@435: duke@435: // try to be consistent with system(), which uses "/usr/bin/sh" on Solaris duke@435: execve("/usr/bin/sh", argv, environ); duke@435: duke@435: // execve failed duke@435: _exit(-1); duke@435: duke@435: } else { duke@435: // copied from J2SE ..._waitForProcessExit() in UNIXProcess_md.c; we don't duke@435: // care about the actual exit code, for now. duke@435: duke@435: int status; duke@435: duke@435: // Wait for the child process to exit. This returns immediately if duke@435: // the child has already exited. */ duke@435: while (waitpid(pid, &status, 0) < 0) { duke@435: switch (errno) { duke@435: case ECHILD: return 0; duke@435: case EINTR: break; duke@435: default: return -1; duke@435: } duke@435: } duke@435: duke@435: if (WIFEXITED(status)) { duke@435: // The child exited normally; get its exit code. duke@435: return WEXITSTATUS(status); duke@435: } else if (WIFSIGNALED(status)) { duke@435: // The child exited because of a signal duke@435: // The best value to return is 0x80 + signal number, duke@435: // because that is what all Unix shells do, and because duke@435: // it allows callers to distinguish between process exit and duke@435: // process death by signal. duke@435: return 0x80 + WTERMSIG(status); duke@435: } else { duke@435: // Unknown exit code; pass it through duke@435: return status; duke@435: } duke@435: } duke@435: }