1 /*
2 * Copyright (c) 1999, 2016, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 // no precompiled headers
26 #include "classfile/classLoader.hpp"
27 #include "classfile/systemDictionary.hpp"
28 #include "classfile/vmSymbols.hpp"
29 #include "code/icBuffer.hpp"
30 #include "code/vtableStubs.hpp"
31 #include "compiler/compileBroker.hpp"
32 #include "compiler/disassembler.hpp"
33 #include "interpreter/interpreter.hpp"
34 #include "jvm_linux.h"
35 #include "logging/log.hpp"
36 #include "memory/allocation.inline.hpp"
37 #include "memory/filemap.hpp"
38 #include "oops/oop.inline.hpp"
39 #include "os_linux.inline.hpp"
40 #include "os_share_linux.hpp"
41 #include "prims/jniFastGetField.hpp"
42 #include "prims/jvm.h"
43 #include "prims/jvm_misc.hpp"
44 #include "runtime/arguments.hpp"
45 #include "runtime/atomic.hpp"
46 #include "runtime/extendedPC.hpp"
47 #include "runtime/globals.hpp"
48 #include "runtime/interfaceSupport.hpp"
49 #include "runtime/init.hpp"
50 #include "runtime/java.hpp"
51 #include "runtime/javaCalls.hpp"
52 #include "runtime/mutexLocker.hpp"
53 #include "runtime/objectMonitor.hpp"
54 #include "runtime/orderAccess.inline.hpp"
55 #include "runtime/osThread.hpp"
56 #include "runtime/perfMemory.hpp"
57 #include "runtime/sharedRuntime.hpp"
58 #include "runtime/statSampler.hpp"
59 #include "runtime/stubRoutines.hpp"
60 #include "runtime/thread.inline.hpp"
61 #include "runtime/threadCritical.hpp"
62 #include "runtime/timer.hpp"
63 #include "semaphore_posix.hpp"
64 #include "services/attachListener.hpp"
65 #include "services/memTracker.hpp"
66 #include "services/runtimeService.hpp"
67 #include "utilities/decoder.hpp"
68 #include "utilities/defaultStream.hpp"
69 #include "utilities/events.hpp"
70 #include "utilities/elfFile.hpp"
71 #include "utilities/growableArray.hpp"
72 #include "utilities/macros.hpp"
73 #include "utilities/vmError.hpp"
74
75 // put OS-includes here
76 # include <sys/types.h>
77 # include <sys/mman.h>
78 # include <sys/stat.h>
79 # include <sys/select.h>
80 # include <pthread.h>
81 # include <signal.h>
82 # include <errno.h>
83 # include <dlfcn.h>
84 # include <stdio.h>
85 # include <unistd.h>
86 # include <sys/resource.h>
87 # include <pthread.h>
88 # include <sys/stat.h>
89 # include <sys/time.h>
90 # include <sys/times.h>
91 # include <sys/utsname.h>
92 # include <sys/socket.h>
93 # include <sys/wait.h>
94 # include <pwd.h>
95 # include <poll.h>
96 # include <semaphore.h>
97 # include <fcntl.h>
98 # include <string.h>
99 # include <syscall.h>
100 # include <sys/sysinfo.h>
101 # include <gnu/libc-version.h>
102 # include <sys/ipc.h>
103 # include <sys/shm.h>
104 # include <link.h>
105 # include <stdint.h>
106 # include <inttypes.h>
107 # include <sys/ioctl.h>
108
109 #ifndef _GNU_SOURCE
110 #define _GNU_SOURCE
111 #include <sched.h>
112 #undef _GNU_SOURCE
113 #else
114 #include <sched.h>
115 #endif
116
117 // if RUSAGE_THREAD for getrusage() has not been defined, do it here. The code calling
118 // getrusage() is prepared to handle the associated failure.
119 #ifndef RUSAGE_THREAD
120 #define RUSAGE_THREAD (1) /* only the calling thread */
121 #endif
122
123 #define MAX_PATH (2 * K)
124
125 #define MAX_SECS 100000000
126
127 // for timer info max values which include all bits
128 #define ALL_64_BITS CONST64(0xFFFFFFFFFFFFFFFF)
129
130 #define LARGEPAGES_BIT (1 << 6)
131 ////////////////////////////////////////////////////////////////////////////////
132 // global variables
133 julong os::Linux::_physical_memory = 0;
134
135 address os::Linux::_initial_thread_stack_bottom = NULL;
136 uintptr_t os::Linux::_initial_thread_stack_size = 0;
137
138 int (*os::Linux::_clock_gettime)(clockid_t, struct timespec *) = NULL;
139 int (*os::Linux::_pthread_getcpuclockid)(pthread_t, clockid_t *) = NULL;
140 int (*os::Linux::_pthread_setname_np)(pthread_t, const char*) = NULL;
141 Mutex* os::Linux::_createThread_lock = NULL;
142 pthread_t os::Linux::_main_thread;
143 int os::Linux::_page_size = -1;
144 bool os::Linux::_supports_fast_thread_cpu_time = false;
145 uint32_t os::Linux::_os_version = 0;
146 const char * os::Linux::_glibc_version = NULL;
147 const char * os::Linux::_libpthread_version = NULL;
148 pthread_condattr_t os::Linux::_condattr[1];
149
150 static jlong initial_time_count=0;
151
152 static int clock_tics_per_sec = 100;
153
154 // For diagnostics to print a message once. see run_periodic_checks
155 static sigset_t check_signal_done;
156 static bool check_signals = true;
157
158 // Signal number used to suspend/resume a thread
159
160 // do not use any signal number less than SIGSEGV, see 4355769
161 static int SR_signum = SIGUSR2;
162 sigset_t SR_sigset;
163
164 // Declarations
165 static void unpackTime(timespec* absTime, bool isAbsolute, jlong time);
166
167 // utility functions
168
169 static int SR_initialize();
170
171 julong os::available_memory() {
172 return Linux::available_memory();
173 }
174
175 julong os::Linux::available_memory() {
176 // values in struct sysinfo are "unsigned long"
177 struct sysinfo si;
178 sysinfo(&si);
179
180 return (julong)si.freeram * si.mem_unit;
181 }
182
183 julong os::physical_memory() {
184 return Linux::physical_memory();
185 }
186
187 // Return true if user is running as root.
188
189 bool os::have_special_privileges() {
190 static bool init = false;
191 static bool privileges = false;
192 if (!init) {
193 privileges = (getuid() != geteuid()) || (getgid() != getegid());
194 init = true;
195 }
196 return privileges;
197 }
198
199
200 #ifndef SYS_gettid
201 // i386: 224, ia64: 1105, amd64: 186, sparc 143
202 #ifdef __ia64__
203 #define SYS_gettid 1105
204 #else
205 #ifdef __i386__
206 #define SYS_gettid 224
207 #else
208 #ifdef __amd64__
209 #define SYS_gettid 186
210 #else
211 #ifdef __sparc__
212 #define SYS_gettid 143
213 #else
214 #error define gettid for the arch
215 #endif
216 #endif
217 #endif
218 #endif
219 #endif
220
221 // Cpu architecture string
222 static char cpu_arch[] = HOTSPOT_LIB_ARCH;
223
224
225 // pid_t gettid()
226 //
227 // Returns the kernel thread id of the currently running thread. Kernel
228 // thread id is used to access /proc.
229 pid_t os::Linux::gettid() {
230 int rslt = syscall(SYS_gettid);
231 assert(rslt != -1, "must be."); // old linuxthreads implementation?
232 return (pid_t)rslt;
233 }
234
235 // Most versions of linux have a bug where the number of processors are
236 // determined by looking at the /proc file system. In a chroot environment,
237 // the system call returns 1. This causes the VM to act as if it is
238 // a single processor and elide locking (see is_MP() call).
239 static bool unsafe_chroot_detected = false;
240 static const char *unstable_chroot_error = "/proc file system not found.\n"
241 "Java may be unstable running multithreaded in a chroot "
242 "environment on Linux when /proc filesystem is not mounted.";
243
244 void os::Linux::initialize_system_info() {
245 set_processor_count(sysconf(_SC_NPROCESSORS_CONF));
246 if (processor_count() == 1) {
247 pid_t pid = os::Linux::gettid();
248 char fname[32];
249 jio_snprintf(fname, sizeof(fname), "/proc/%d", pid);
250 FILE *fp = fopen(fname, "r");
251 if (fp == NULL) {
252 unsafe_chroot_detected = true;
253 } else {
254 fclose(fp);
255 }
256 }
257 _physical_memory = (julong)sysconf(_SC_PHYS_PAGES) * (julong)sysconf(_SC_PAGESIZE);
258 assert(processor_count() > 0, "linux error");
259 }
260
261 void os::init_system_properties_values() {
262 // The next steps are taken in the product version:
263 //
264 // Obtain the JAVA_HOME value from the location of libjvm.so.
265 // This library should be located at:
266 // <JAVA_HOME>/jre/lib/<arch>/{client|server}/libjvm.so.
267 //
268 // If "/jre/lib/" appears at the right place in the path, then we
269 // assume libjvm.so is installed in a JDK and we use this path.
270 //
271 // Otherwise exit with message: "Could not create the Java virtual machine."
272 //
273 // The following extra steps are taken in the debugging version:
274 //
275 // If "/jre/lib/" does NOT appear at the right place in the path
276 // instead of exit check for $JAVA_HOME environment variable.
277 //
278 // If it is defined and we are able to locate $JAVA_HOME/jre/lib/<arch>,
279 // then we append a fake suffix "hotspot/libjvm.so" to this path so
280 // it looks like libjvm.so is installed there
281 // <JAVA_HOME>/jre/lib/<arch>/hotspot/libjvm.so.
282 //
283 // Otherwise exit.
284 //
285 // Important note: if the location of libjvm.so changes this
286 // code needs to be changed accordingly.
287
288 // See ld(1):
289 // The linker uses the following search paths to locate required
290 // shared libraries:
291 // 1: ...
292 // ...
293 // 7: The default directories, normally /lib and /usr/lib.
294 #if defined(AMD64) || (defined(_LP64) && defined(SPARC)) || defined(PPC64) || defined(S390)
295 #define DEFAULT_LIBPATH "/usr/lib64:/lib64:/lib:/usr/lib"
296 #else
297 #define DEFAULT_LIBPATH "/lib:/usr/lib"
298 #endif
299
300 // Base path of extensions installed on the system.
301 #define SYS_EXT_DIR "/usr/java/packages"
302 #define EXTENSIONS_DIR "/lib/ext"
303
304 // Buffer that fits several sprintfs.
305 // Note that the space for the colon and the trailing null are provided
306 // by the nulls included by the sizeof operator.
307 const size_t bufsize =
308 MAX2((size_t)MAXPATHLEN, // For dll_dir & friends.
309 (size_t)MAXPATHLEN + sizeof(EXTENSIONS_DIR) + sizeof(SYS_EXT_DIR) + sizeof(EXTENSIONS_DIR)); // extensions dir
310 char *buf = (char *)NEW_C_HEAP_ARRAY(char, bufsize, mtInternal);
311
312 // sysclasspath, java_home, dll_dir
313 {
314 char *pslash;
315 os::jvm_path(buf, bufsize);
316
317 // Found the full path to libjvm.so.
318 // Now cut the path to <java_home>/jre if we can.
319 pslash = strrchr(buf, '/');
320 if (pslash != NULL) {
321 *pslash = '\0'; // Get rid of /libjvm.so.
322 }
323 pslash = strrchr(buf, '/');
324 if (pslash != NULL) {
325 *pslash = '\0'; // Get rid of /{client|server|hotspot}.
326 }
327 Arguments::set_dll_dir(buf);
328
329 if (pslash != NULL) {
330 pslash = strrchr(buf, '/');
331 if (pslash != NULL) {
332 *pslash = '\0'; // Get rid of /<arch>.
333 pslash = strrchr(buf, '/');
334 if (pslash != NULL) {
335 *pslash = '\0'; // Get rid of /lib.
336 }
337 }
338 }
339 Arguments::set_java_home(buf);
340 set_boot_path('/', ':');
341 }
342
343 // Where to look for native libraries.
344 //
345 // Note: Due to a legacy implementation, most of the library path
346 // is set in the launcher. This was to accomodate linking restrictions
347 // on legacy Linux implementations (which are no longer supported).
348 // Eventually, all the library path setting will be done here.
349 //
350 // However, to prevent the proliferation of improperly built native
351 // libraries, the new path component /usr/java/packages is added here.
352 // Eventually, all the library path setting will be done here.
353 {
354 // Get the user setting of LD_LIBRARY_PATH, and prepended it. It
355 // should always exist (until the legacy problem cited above is
356 // addressed).
357 const char *v = ::getenv("LD_LIBRARY_PATH");
358 const char *v_colon = ":";
359 if (v == NULL) { v = ""; v_colon = ""; }
360 // That's +1 for the colon and +1 for the trailing '\0'.
361 char *ld_library_path = (char *)NEW_C_HEAP_ARRAY(char,
362 strlen(v) + 1 +
363 sizeof(SYS_EXT_DIR) + sizeof("/lib/") + strlen(cpu_arch) + sizeof(DEFAULT_LIBPATH) + 1,
364 mtInternal);
365 sprintf(ld_library_path, "%s%s" SYS_EXT_DIR "/lib/%s:" DEFAULT_LIBPATH, v, v_colon, cpu_arch);
366 Arguments::set_library_path(ld_library_path);
367 FREE_C_HEAP_ARRAY(char, ld_library_path);
368 }
369
370 // Extensions directories.
371 sprintf(buf, "%s" EXTENSIONS_DIR ":" SYS_EXT_DIR EXTENSIONS_DIR, Arguments::get_java_home());
372 Arguments::set_ext_dirs(buf);
373
374 FREE_C_HEAP_ARRAY(char, buf);
375
376 #undef DEFAULT_LIBPATH
377 #undef SYS_EXT_DIR
378 #undef EXTENSIONS_DIR
379 }
380
381 ////////////////////////////////////////////////////////////////////////////////
382 // breakpoint support
383
384 void os::breakpoint() {
385 BREAKPOINT;
386 }
387
388 extern "C" void breakpoint() {
389 // use debugger to set breakpoint here
390 }
391
392 ////////////////////////////////////////////////////////////////////////////////
393 // signal support
394
395 debug_only(static bool signal_sets_initialized = false);
396 static sigset_t unblocked_sigs, vm_sigs, allowdebug_blocked_sigs;
397
398 bool os::Linux::is_sig_ignored(int sig) {
399 struct sigaction oact;
400 sigaction(sig, (struct sigaction*)NULL, &oact);
401 void* ohlr = oact.sa_sigaction ? CAST_FROM_FN_PTR(void*, oact.sa_sigaction)
402 : CAST_FROM_FN_PTR(void*, oact.sa_handler);
403 if (ohlr == CAST_FROM_FN_PTR(void*, SIG_IGN)) {
404 return true;
405 } else {
406 return false;
407 }
408 }
409
410 void os::Linux::signal_sets_init() {
411 // Should also have an assertion stating we are still single-threaded.
412 assert(!signal_sets_initialized, "Already initialized");
413 // Fill in signals that are necessarily unblocked for all threads in
414 // the VM. Currently, we unblock the following signals:
415 // SHUTDOWN{1,2,3}_SIGNAL: for shutdown hooks support (unless over-ridden
416 // by -Xrs (=ReduceSignalUsage));
417 // BREAK_SIGNAL which is unblocked only by the VM thread and blocked by all
418 // other threads. The "ReduceSignalUsage" boolean tells us not to alter
419 // the dispositions or masks wrt these signals.
420 // Programs embedding the VM that want to use the above signals for their
421 // own purposes must, at this time, use the "-Xrs" option to prevent
422 // interference with shutdown hooks and BREAK_SIGNAL thread dumping.
423 // (See bug 4345157, and other related bugs).
424 // In reality, though, unblocking these signals is really a nop, since
425 // these signals are not blocked by default.
426 sigemptyset(&unblocked_sigs);
427 sigemptyset(&allowdebug_blocked_sigs);
428 sigaddset(&unblocked_sigs, SIGILL);
429 sigaddset(&unblocked_sigs, SIGSEGV);
430 sigaddset(&unblocked_sigs, SIGBUS);
431 sigaddset(&unblocked_sigs, SIGFPE);
432 #if defined(PPC64)
433 sigaddset(&unblocked_sigs, SIGTRAP);
434 #endif
435 sigaddset(&unblocked_sigs, SR_signum);
436
437 if (!ReduceSignalUsage) {
438 if (!os::Linux::is_sig_ignored(SHUTDOWN1_SIGNAL)) {
439 sigaddset(&unblocked_sigs, SHUTDOWN1_SIGNAL);
440 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN1_SIGNAL);
441 }
442 if (!os::Linux::is_sig_ignored(SHUTDOWN2_SIGNAL)) {
443 sigaddset(&unblocked_sigs, SHUTDOWN2_SIGNAL);
444 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN2_SIGNAL);
445 }
446 if (!os::Linux::is_sig_ignored(SHUTDOWN3_SIGNAL)) {
447 sigaddset(&unblocked_sigs, SHUTDOWN3_SIGNAL);
448 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN3_SIGNAL);
449 }
450 }
451 // Fill in signals that are blocked by all but the VM thread.
452 sigemptyset(&vm_sigs);
453 if (!ReduceSignalUsage) {
454 sigaddset(&vm_sigs, BREAK_SIGNAL);
455 }
456 debug_only(signal_sets_initialized = true);
457
458 }
459
460 // These are signals that are unblocked while a thread is running Java.
461 // (For some reason, they get blocked by default.)
462 sigset_t* os::Linux::unblocked_signals() {
463 assert(signal_sets_initialized, "Not initialized");
464 return &unblocked_sigs;
465 }
466
467 // These are the signals that are blocked while a (non-VM) thread is
468 // running Java. Only the VM thread handles these signals.
469 sigset_t* os::Linux::vm_signals() {
470 assert(signal_sets_initialized, "Not initialized");
471 return &vm_sigs;
472 }
473
474 // These are signals that are blocked during cond_wait to allow debugger in
475 sigset_t* os::Linux::allowdebug_blocked_signals() {
476 assert(signal_sets_initialized, "Not initialized");
477 return &allowdebug_blocked_sigs;
478 }
479
480 void os::Linux::hotspot_sigmask(Thread* thread) {
481
482 //Save caller's signal mask before setting VM signal mask
483 sigset_t caller_sigmask;
484 pthread_sigmask(SIG_BLOCK, NULL, &caller_sigmask);
485
486 OSThread* osthread = thread->osthread();
487 osthread->set_caller_sigmask(caller_sigmask);
488
489 pthread_sigmask(SIG_UNBLOCK, os::Linux::unblocked_signals(), NULL);
490
491 if (!ReduceSignalUsage) {
492 if (thread->is_VM_thread()) {
493 // Only the VM thread handles BREAK_SIGNAL ...
494 pthread_sigmask(SIG_UNBLOCK, vm_signals(), NULL);
495 } else {
496 // ... all other threads block BREAK_SIGNAL
497 pthread_sigmask(SIG_BLOCK, vm_signals(), NULL);
498 }
499 }
500 }
501
502 //////////////////////////////////////////////////////////////////////////////
503 // detecting pthread library
504
505 void os::Linux::libpthread_init() {
506 // Save glibc and pthread version strings.
507 #if !defined(_CS_GNU_LIBC_VERSION) || \
508 !defined(_CS_GNU_LIBPTHREAD_VERSION)
509 #error "glibc too old (< 2.3.2)"
510 #endif
511
512 size_t n = confstr(_CS_GNU_LIBC_VERSION, NULL, 0);
513 assert(n > 0, "cannot retrieve glibc version");
514 char *str = (char *)malloc(n, mtInternal);
515 confstr(_CS_GNU_LIBC_VERSION, str, n);
516 os::Linux::set_glibc_version(str);
517
518 n = confstr(_CS_GNU_LIBPTHREAD_VERSION, NULL, 0);
519 assert(n > 0, "cannot retrieve pthread version");
520 str = (char *)malloc(n, mtInternal);
521 confstr(_CS_GNU_LIBPTHREAD_VERSION, str, n);
522 os::Linux::set_libpthread_version(str);
523 }
524
525 /////////////////////////////////////////////////////////////////////////////
526 // thread stack expansion
527
528 // os::Linux::manually_expand_stack() takes care of expanding the thread
529 // stack. Note that this is normally not needed: pthread stacks allocate
530 // thread stack using mmap() without MAP_NORESERVE, so the stack is already
531 // committed. Therefore it is not necessary to expand the stack manually.
532 //
533 // Manually expanding the stack was historically needed on LinuxThreads
534 // thread stacks, which were allocated with mmap(MAP_GROWSDOWN). Nowadays
535 // it is kept to deal with very rare corner cases:
536 //
537 // For one, user may run the VM on an own implementation of threads
538 // whose stacks are - like the old LinuxThreads - implemented using
539 // mmap(MAP_GROWSDOWN).
540 //
541 // Also, this coding may be needed if the VM is running on the primordial
542 // thread. Normally we avoid running on the primordial thread; however,
543 // user may still invoke the VM on the primordial thread.
544 //
545 // The following historical comment describes the details about running
546 // on a thread stack allocated with mmap(MAP_GROWSDOWN):
547
548
549 // Force Linux kernel to expand current thread stack. If "bottom" is close
550 // to the stack guard, caller should block all signals.
551 //
552 // MAP_GROWSDOWN:
553 // A special mmap() flag that is used to implement thread stacks. It tells
554 // kernel that the memory region should extend downwards when needed. This
555 // allows early versions of LinuxThreads to only mmap the first few pages
556 // when creating a new thread. Linux kernel will automatically expand thread
557 // stack as needed (on page faults).
558 //
559 // However, because the memory region of a MAP_GROWSDOWN stack can grow on
560 // demand, if a page fault happens outside an already mapped MAP_GROWSDOWN
561 // region, it's hard to tell if the fault is due to a legitimate stack
562 // access or because of reading/writing non-exist memory (e.g. buffer
563 // overrun). As a rule, if the fault happens below current stack pointer,
564 // Linux kernel does not expand stack, instead a SIGSEGV is sent to the
565 // application (see Linux kernel fault.c).
566 //
567 // This Linux feature can cause SIGSEGV when VM bangs thread stack for
568 // stack overflow detection.
569 //
570 // Newer version of LinuxThreads (since glibc-2.2, or, RH-7.x) and NPTL do
571 // not use MAP_GROWSDOWN.
572 //
573 // To get around the problem and allow stack banging on Linux, we need to
574 // manually expand thread stack after receiving the SIGSEGV.
575 //
576 // There are two ways to expand thread stack to address "bottom", we used
577 // both of them in JVM before 1.5:
578 // 1. adjust stack pointer first so that it is below "bottom", and then
579 // touch "bottom"
580 // 2. mmap() the page in question
581 //
582 // Now alternate signal stack is gone, it's harder to use 2. For instance,
583 // if current sp is already near the lower end of page 101, and we need to
584 // call mmap() to map page 100, it is possible that part of the mmap() frame
585 // will be placed in page 100. When page 100 is mapped, it is zero-filled.
586 // That will destroy the mmap() frame and cause VM to crash.
587 //
588 // The following code works by adjusting sp first, then accessing the "bottom"
589 // page to force a page fault. Linux kernel will then automatically expand the
590 // stack mapping.
591 //
592 // _expand_stack_to() assumes its frame size is less than page size, which
593 // should always be true if the function is not inlined.
594
595 static void NOINLINE _expand_stack_to(address bottom) {
596 address sp;
597 size_t size;
598 volatile char *p;
599
600 // Adjust bottom to point to the largest address within the same page, it
601 // gives us a one-page buffer if alloca() allocates slightly more memory.
602 bottom = (address)align_size_down((uintptr_t)bottom, os::Linux::page_size());
603 bottom += os::Linux::page_size() - 1;
604
605 // sp might be slightly above current stack pointer; if that's the case, we
606 // will alloca() a little more space than necessary, which is OK. Don't use
607 // os::current_stack_pointer(), as its result can be slightly below current
608 // stack pointer, causing us to not alloca enough to reach "bottom".
609 sp = (address)&sp;
610
611 if (sp > bottom) {
612 size = sp - bottom;
613 p = (volatile char *)alloca(size);
614 assert(p != NULL && p <= (volatile char *)bottom, "alloca problem?");
615 p[0] = '\0';
616 }
617 }
618
619 bool os::Linux::manually_expand_stack(JavaThread * t, address addr) {
620 assert(t!=NULL, "just checking");
621 assert(t->osthread()->expanding_stack(), "expand should be set");
622 assert(t->stack_base() != NULL, "stack_base was not initialized");
623
624 if (addr < t->stack_base() && addr >= t->stack_reserved_zone_base()) {
625 sigset_t mask_all, old_sigset;
626 sigfillset(&mask_all);
627 pthread_sigmask(SIG_SETMASK, &mask_all, &old_sigset);
628 _expand_stack_to(addr);
629 pthread_sigmask(SIG_SETMASK, &old_sigset, NULL);
630 return true;
631 }
632 return false;
633 }
634
635 //////////////////////////////////////////////////////////////////////////////
636 // create new thread
637
638 // Thread start routine for all newly created threads
639 static void *thread_native_entry(Thread *thread) {
640 // Try to randomize the cache line index of hot stack frames.
641 // This helps when threads of the same stack traces evict each other's
642 // cache lines. The threads can be either from the same JVM instance, or
643 // from different JVM instances. The benefit is especially true for
644 // processors with hyperthreading technology.
645 static int counter = 0;
646 int pid = os::current_process_id();
647 alloca(((pid ^ counter++) & 7) * 128);
648
649 thread->initialize_thread_current();
650
651 OSThread* osthread = thread->osthread();
652 Monitor* sync = osthread->startThread_lock();
653
654 osthread->set_thread_id(os::current_thread_id());
655
656 log_info(os, thread)("Thread is alive (tid: " UINTX_FORMAT ", pthread id: " UINTX_FORMAT ").",
657 os::current_thread_id(), (uintx) pthread_self());
658
659 if (UseNUMA) {
660 int lgrp_id = os::numa_get_group_id();
661 if (lgrp_id != -1) {
662 thread->set_lgrp_id(lgrp_id);
663 }
664 }
665 // initialize signal mask for this thread
666 os::Linux::hotspot_sigmask(thread);
667
668 // initialize floating point control register
669 os::Linux::init_thread_fpu_state();
670
671 // handshaking with parent thread
672 {
673 MutexLockerEx ml(sync, Mutex::_no_safepoint_check_flag);
674
675 // notify parent thread
676 osthread->set_state(INITIALIZED);
677 sync->notify_all();
678
679 // wait until os::start_thread()
680 while (osthread->get_state() == INITIALIZED) {
681 sync->wait(Mutex::_no_safepoint_check_flag);
682 }
683 }
684
685 // call one more level start routine
686 thread->run();
687
688 log_info(os, thread)("Thread finished (tid: " UINTX_FORMAT ", pthread id: " UINTX_FORMAT ").",
689 os::current_thread_id(), (uintx) pthread_self());
690
691 // If a thread has not deleted itself ("delete this") as part of its
692 // termination sequence, we have to ensure thread-local-storage is
693 // cleared before we actually terminate. No threads should ever be
694 // deleted asynchronously with respect to their termination.
695 if (Thread::current_or_null_safe() != NULL) {
696 assert(Thread::current_or_null_safe() == thread, "current thread is wrong");
697 thread->clear_thread_current();
698 }
699
700 return 0;
701 }
702
703 bool os::create_thread(Thread* thread, ThreadType thr_type,
704 size_t req_stack_size) {
705 assert(thread->osthread() == NULL, "caller responsible");
706
707 // Allocate the OSThread object
708 OSThread* osthread = new OSThread(NULL, NULL);
709 if (osthread == NULL) {
710 return false;
711 }
712
713 // set the correct thread state
714 osthread->set_thread_type(thr_type);
715
716 // Initial state is ALLOCATED but not INITIALIZED
717 osthread->set_state(ALLOCATED);
718
719 thread->set_osthread(osthread);
720
721 // init thread attributes
722 pthread_attr_t attr;
723 pthread_attr_init(&attr);
724 pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
725
726 // calculate stack size if it's not specified by caller
727 size_t stack_size = os::Posix::get_initial_stack_size(thr_type, req_stack_size);
728 pthread_attr_setstacksize(&attr, stack_size);
729
730 // glibc guard page
731 pthread_attr_setguardsize(&attr, os::Linux::default_guard_size(thr_type));
732
733 ThreadState state;
734
735 {
736 pthread_t tid;
737 int ret = pthread_create(&tid, &attr, (void* (*)(void*)) thread_native_entry, thread);
738
739 char buf[64];
740 if (ret == 0) {
741 log_info(os, thread)("Thread started (pthread id: " UINTX_FORMAT ", attributes: %s). ",
742 (uintx) tid, os::Posix::describe_pthread_attr(buf, sizeof(buf), &attr));
743 } else {
744 log_warning(os, thread)("Failed to start thread - pthread_create failed (%s) for attributes: %s.",
745 os::errno_name(ret), os::Posix::describe_pthread_attr(buf, sizeof(buf), &attr));
746 }
747
748 pthread_attr_destroy(&attr);
749
750 if (ret != 0) {
751 // Need to clean up stuff we've allocated so far
752 thread->set_osthread(NULL);
753 delete osthread;
754 return false;
755 }
756
757 // Store pthread info into the OSThread
758 osthread->set_pthread_id(tid);
759
760 // Wait until child thread is either initialized or aborted
761 {
762 Monitor* sync_with_child = osthread->startThread_lock();
763 MutexLockerEx ml(sync_with_child, Mutex::_no_safepoint_check_flag);
764 while ((state = osthread->get_state()) == ALLOCATED) {
765 sync_with_child->wait(Mutex::_no_safepoint_check_flag);
766 }
767 }
768 }
769
770 // Aborted due to thread limit being reached
771 if (state == ZOMBIE) {
772 thread->set_osthread(NULL);
773 delete osthread;
774 return false;
775 }
776
777 // The thread is returned suspended (in state INITIALIZED),
778 // and is started higher up in the call chain
779 assert(state == INITIALIZED, "race condition");
780 return true;
781 }
782
783 /////////////////////////////////////////////////////////////////////////////
784 // attach existing thread
785
786 // bootstrap the main thread
787 bool os::create_main_thread(JavaThread* thread) {
788 assert(os::Linux::_main_thread == pthread_self(), "should be called inside main thread");
789 return create_attached_thread(thread);
790 }
791
792 bool os::create_attached_thread(JavaThread* thread) {
793 #ifdef ASSERT
794 thread->verify_not_published();
795 #endif
796
797 // Allocate the OSThread object
798 OSThread* osthread = new OSThread(NULL, NULL);
799
800 if (osthread == NULL) {
801 return false;
802 }
803
804 // Store pthread info into the OSThread
805 osthread->set_thread_id(os::Linux::gettid());
806 osthread->set_pthread_id(::pthread_self());
807
808 // initialize floating point control register
809 os::Linux::init_thread_fpu_state();
810
811 // Initial thread state is RUNNABLE
812 osthread->set_state(RUNNABLE);
813
814 thread->set_osthread(osthread);
815
816 if (UseNUMA) {
817 int lgrp_id = os::numa_get_group_id();
818 if (lgrp_id != -1) {
819 thread->set_lgrp_id(lgrp_id);
820 }
821 }
822
823 if (os::Linux::is_initial_thread()) {
824 // If current thread is initial thread, its stack is mapped on demand,
825 // see notes about MAP_GROWSDOWN. Here we try to force kernel to map
826 // the entire stack region to avoid SEGV in stack banging.
827 // It is also useful to get around the heap-stack-gap problem on SuSE
828 // kernel (see 4821821 for details). We first expand stack to the top
829 // of yellow zone, then enable stack yellow zone (order is significant,
830 // enabling yellow zone first will crash JVM on SuSE Linux), so there
831 // is no gap between the last two virtual memory regions.
832
833 JavaThread *jt = (JavaThread *)thread;
834 address addr = jt->stack_reserved_zone_base();
835 assert(addr != NULL, "initialization problem?");
836 assert(jt->stack_available(addr) > 0, "stack guard should not be enabled");
837
838 osthread->set_expanding_stack();
839 os::Linux::manually_expand_stack(jt, addr);
840 osthread->clear_expanding_stack();
841 }
842
843 // initialize signal mask for this thread
844 // and save the caller's signal mask
845 os::Linux::hotspot_sigmask(thread);
846
847 log_info(os, thread)("Thread attached (tid: " UINTX_FORMAT ", pthread id: " UINTX_FORMAT ").",
848 os::current_thread_id(), (uintx) pthread_self());
849
850 return true;
851 }
852
853 void os::pd_start_thread(Thread* thread) {
854 OSThread * osthread = thread->osthread();
855 assert(osthread->get_state() != INITIALIZED, "just checking");
856 Monitor* sync_with_child = osthread->startThread_lock();
857 MutexLockerEx ml(sync_with_child, Mutex::_no_safepoint_check_flag);
858 sync_with_child->notify();
859 }
860
861 // Free Linux resources related to the OSThread
862 void os::free_thread(OSThread* osthread) {
863 assert(osthread != NULL, "osthread not set");
864
865 // We are told to free resources of the argument thread,
866 // but we can only really operate on the current thread.
867 assert(Thread::current()->osthread() == osthread,
868 "os::free_thread but not current thread");
869
870 #ifdef ASSERT
871 sigset_t current;
872 sigemptyset(¤t);
873 pthread_sigmask(SIG_SETMASK, NULL, ¤t);
874 assert(!sigismember(¤t, SR_signum), "SR signal should not be blocked!");
875 #endif
876
877 // Restore caller's signal mask
878 sigset_t sigmask = osthread->caller_sigmask();
879 pthread_sigmask(SIG_SETMASK, &sigmask, NULL);
880
881 delete osthread;
882 }
883
884 //////////////////////////////////////////////////////////////////////////////
885 // initial thread
886
887 // Check if current thread is the initial thread, similar to Solaris thr_main.
888 bool os::Linux::is_initial_thread(void) {
889 char dummy;
890 // If called before init complete, thread stack bottom will be null.
891 // Can be called if fatal error occurs before initialization.
892 if (initial_thread_stack_bottom() == NULL) return false;
893 assert(initial_thread_stack_bottom() != NULL &&
894 initial_thread_stack_size() != 0,
895 "os::init did not locate initial thread's stack region");
896 if ((address)&dummy >= initial_thread_stack_bottom() &&
897 (address)&dummy < initial_thread_stack_bottom() + initial_thread_stack_size()) {
898 return true;
899 } else {
900 return false;
901 }
902 }
903
904 // Find the virtual memory area that contains addr
905 static bool find_vma(address addr, address* vma_low, address* vma_high) {
906 FILE *fp = fopen("/proc/self/maps", "r");
907 if (fp) {
908 address low, high;
909 while (!feof(fp)) {
910 if (fscanf(fp, "%p-%p", &low, &high) == 2) {
911 if (low <= addr && addr < high) {
912 if (vma_low) *vma_low = low;
913 if (vma_high) *vma_high = high;
914 fclose(fp);
915 return true;
916 }
917 }
918 for (;;) {
919 int ch = fgetc(fp);
920 if (ch == EOF || ch == (int)'\n') break;
921 }
922 }
923 fclose(fp);
924 }
925 return false;
926 }
927
928 // Locate initial thread stack. This special handling of initial thread stack
929 // is needed because pthread_getattr_np() on most (all?) Linux distros returns
930 // bogus value for initial thread.
931 void os::Linux::capture_initial_stack(size_t max_size) {
932 // stack size is the easy part, get it from RLIMIT_STACK
933 struct rlimit rlim;
934 getrlimit(RLIMIT_STACK, &rlim);
935 size_t stack_size = rlim.rlim_cur;
936
937 // 6308388: a bug in ld.so will relocate its own .data section to the
938 // lower end of primordial stack; reduce ulimit -s value a little bit
939 // so we won't install guard page on ld.so's data section.
940 stack_size -= 2 * page_size();
941
942 // 4441425: avoid crash with "unlimited" stack size on SuSE 7.1 or Redhat
943 // 7.1, in both cases we will get 2G in return value.
944 // 4466587: glibc 2.2.x compiled w/o "--enable-kernel=2.4.0" (RH 7.0,
945 // SuSE 7.2, Debian) can not handle alternate signal stack correctly
946 // for initial thread if its stack size exceeds 6M. Cap it at 2M,
947 // in case other parts in glibc still assumes 2M max stack size.
948 // FIXME: alt signal stack is gone, maybe we can relax this constraint?
949 // Problem still exists RH7.2 (IA64 anyway) but 2MB is a little small
950 if (stack_size > 2 * K * K IA64_ONLY(*2)) {
951 stack_size = 2 * K * K IA64_ONLY(*2);
952 }
953 // Try to figure out where the stack base (top) is. This is harder.
954 //
955 // When an application is started, glibc saves the initial stack pointer in
956 // a global variable "__libc_stack_end", which is then used by system
957 // libraries. __libc_stack_end should be pretty close to stack top. The
958 // variable is available since the very early days. However, because it is
959 // a private interface, it could disappear in the future.
960 //
961 // Linux kernel saves start_stack information in /proc/<pid>/stat. Similar
962 // to __libc_stack_end, it is very close to stack top, but isn't the real
963 // stack top. Note that /proc may not exist if VM is running as a chroot
964 // program, so reading /proc/<pid>/stat could fail. Also the contents of
965 // /proc/<pid>/stat could change in the future (though unlikely).
966 //
967 // We try __libc_stack_end first. If that doesn't work, look for
968 // /proc/<pid>/stat. If neither of them works, we use current stack pointer
969 // as a hint, which should work well in most cases.
970
971 uintptr_t stack_start;
972
973 // try __libc_stack_end first
974 uintptr_t *p = (uintptr_t *)dlsym(RTLD_DEFAULT, "__libc_stack_end");
975 if (p && *p) {
976 stack_start = *p;
977 } else {
978 // see if we can get the start_stack field from /proc/self/stat
979 FILE *fp;
980 int pid;
981 char state;
982 int ppid;
983 int pgrp;
984 int session;
985 int nr;
986 int tpgrp;
987 unsigned long flags;
988 unsigned long minflt;
989 unsigned long cminflt;
990 unsigned long majflt;
991 unsigned long cmajflt;
992 unsigned long utime;
993 unsigned long stime;
994 long cutime;
995 long cstime;
996 long prio;
997 long nice;
998 long junk;
999 long it_real;
1000 uintptr_t start;
1001 uintptr_t vsize;
1002 intptr_t rss;
1003 uintptr_t rsslim;
1004 uintptr_t scodes;
1005 uintptr_t ecode;
1006 int i;
1007
1008 // Figure what the primordial thread stack base is. Code is inspired
1009 // by email from Hans Boehm. /proc/self/stat begins with current pid,
1010 // followed by command name surrounded by parentheses, state, etc.
1011 char stat[2048];
1012 int statlen;
1013
1014 fp = fopen("/proc/self/stat", "r");
1015 if (fp) {
1016 statlen = fread(stat, 1, 2047, fp);
1017 stat[statlen] = '\0';
1018 fclose(fp);
1019
1020 // Skip pid and the command string. Note that we could be dealing with
1021 // weird command names, e.g. user could decide to rename java launcher
1022 // to "java 1.4.2 :)", then the stat file would look like
1023 // 1234 (java 1.4.2 :)) R ... ...
1024 // We don't really need to know the command string, just find the last
1025 // occurrence of ")" and then start parsing from there. See bug 4726580.
1026 char * s = strrchr(stat, ')');
1027
1028 i = 0;
1029 if (s) {
1030 // Skip blank chars
1031 do { s++; } while (s && isspace(*s));
1032
1033 #define _UFM UINTX_FORMAT
1034 #define _DFM INTX_FORMAT
1035
1036 // 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2
1037 // 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8
1038 i = sscanf(s, "%c %d %d %d %d %d %lu %lu %lu %lu %lu %lu %lu %ld %ld %ld %ld %ld %ld " _UFM _UFM _DFM _UFM _UFM _UFM _UFM,
1039 &state, // 3 %c
1040 &ppid, // 4 %d
1041 &pgrp, // 5 %d
1042 &session, // 6 %d
1043 &nr, // 7 %d
1044 &tpgrp, // 8 %d
1045 &flags, // 9 %lu
1046 &minflt, // 10 %lu
1047 &cminflt, // 11 %lu
1048 &majflt, // 12 %lu
1049 &cmajflt, // 13 %lu
1050 &utime, // 14 %lu
1051 &stime, // 15 %lu
1052 &cutime, // 16 %ld
1053 &cstime, // 17 %ld
1054 &prio, // 18 %ld
1055 &nice, // 19 %ld
1056 &junk, // 20 %ld
1057 &it_real, // 21 %ld
1058 &start, // 22 UINTX_FORMAT
1059 &vsize, // 23 UINTX_FORMAT
1060 &rss, // 24 INTX_FORMAT
1061 &rsslim, // 25 UINTX_FORMAT
1062 &scodes, // 26 UINTX_FORMAT
1063 &ecode, // 27 UINTX_FORMAT
1064 &stack_start); // 28 UINTX_FORMAT
1065 }
1066
1067 #undef _UFM
1068 #undef _DFM
1069
1070 if (i != 28 - 2) {
1071 assert(false, "Bad conversion from /proc/self/stat");
1072 // product mode - assume we are the initial thread, good luck in the
1073 // embedded case.
1074 warning("Can't detect initial thread stack location - bad conversion");
1075 stack_start = (uintptr_t) &rlim;
1076 }
1077 } else {
1078 // For some reason we can't open /proc/self/stat (for example, running on
1079 // FreeBSD with a Linux emulator, or inside chroot), this should work for
1080 // most cases, so don't abort:
1081 warning("Can't detect initial thread stack location - no /proc/self/stat");
1082 stack_start = (uintptr_t) &rlim;
1083 }
1084 }
1085
1086 // Now we have a pointer (stack_start) very close to the stack top, the
1087 // next thing to do is to figure out the exact location of stack top. We
1088 // can find out the virtual memory area that contains stack_start by
1089 // reading /proc/self/maps, it should be the last vma in /proc/self/maps,
1090 // and its upper limit is the real stack top. (again, this would fail if
1091 // running inside chroot, because /proc may not exist.)
1092
1093 uintptr_t stack_top;
1094 address low, high;
1095 if (find_vma((address)stack_start, &low, &high)) {
1096 // success, "high" is the true stack top. (ignore "low", because initial
1097 // thread stack grows on demand, its real bottom is high - RLIMIT_STACK.)
1098 stack_top = (uintptr_t)high;
1099 } else {
1100 // failed, likely because /proc/self/maps does not exist
1101 warning("Can't detect initial thread stack location - find_vma failed");
1102 // best effort: stack_start is normally within a few pages below the real
1103 // stack top, use it as stack top, and reduce stack size so we won't put
1104 // guard page outside stack.
1105 stack_top = stack_start;
1106 stack_size -= 16 * page_size();
1107 }
1108
1109 // stack_top could be partially down the page so align it
1110 stack_top = align_size_up(stack_top, page_size());
1111
1112 if (max_size && stack_size > max_size) {
1113 _initial_thread_stack_size = max_size;
1114 } else {
1115 _initial_thread_stack_size = stack_size;
1116 }
1117
1118 _initial_thread_stack_size = align_size_down(_initial_thread_stack_size, page_size());
1119 _initial_thread_stack_bottom = (address)stack_top - _initial_thread_stack_size;
1120 }
1121
1122 ////////////////////////////////////////////////////////////////////////////////
1123 // time support
1124
1125 // Time since start-up in seconds to a fine granularity.
1126 // Used by VMSelfDestructTimer and the MemProfiler.
1127 double os::elapsedTime() {
1128
1129 return ((double)os::elapsed_counter()) / os::elapsed_frequency(); // nanosecond resolution
1130 }
1131
1132 jlong os::elapsed_counter() {
1133 return javaTimeNanos() - initial_time_count;
1134 }
1135
1136 jlong os::elapsed_frequency() {
1137 return NANOSECS_PER_SEC; // nanosecond resolution
1138 }
1139
1140 bool os::supports_vtime() { return true; }
1141 bool os::enable_vtime() { return false; }
1142 bool os::vtime_enabled() { return false; }
1143
1144 double os::elapsedVTime() {
1145 struct rusage usage;
1146 int retval = getrusage(RUSAGE_THREAD, &usage);
1147 if (retval == 0) {
1148 return (double) (usage.ru_utime.tv_sec + usage.ru_stime.tv_sec) + (double) (usage.ru_utime.tv_usec + usage.ru_stime.tv_usec) / (1000 * 1000);
1149 } else {
1150 // better than nothing, but not much
1151 return elapsedTime();
1152 }
1153 }
1154
1155 jlong os::javaTimeMillis() {
1156 timeval time;
1157 int status = gettimeofday(&time, NULL);
1158 assert(status != -1, "linux error");
1159 return jlong(time.tv_sec) * 1000 + jlong(time.tv_usec / 1000);
1160 }
1161
1162 void os::javaTimeSystemUTC(jlong &seconds, jlong &nanos) {
1163 timeval time;
1164 int status = gettimeofday(&time, NULL);
1165 assert(status != -1, "linux error");
1166 seconds = jlong(time.tv_sec);
1167 nanos = jlong(time.tv_usec) * 1000;
1168 }
1169
1170
1171 #ifndef CLOCK_MONOTONIC
1172 #define CLOCK_MONOTONIC (1)
1173 #endif
1174
1175 void os::Linux::clock_init() {
1176 // we do dlopen's in this particular order due to bug in linux
1177 // dynamical loader (see 6348968) leading to crash on exit
1178 void* handle = dlopen("librt.so.1", RTLD_LAZY);
1179 if (handle == NULL) {
1180 handle = dlopen("librt.so", RTLD_LAZY);
1181 }
1182
1183 if (handle) {
1184 int (*clock_getres_func)(clockid_t, struct timespec*) =
1185 (int(*)(clockid_t, struct timespec*))dlsym(handle, "clock_getres");
1186 int (*clock_gettime_func)(clockid_t, struct timespec*) =
1187 (int(*)(clockid_t, struct timespec*))dlsym(handle, "clock_gettime");
1188 if (clock_getres_func && clock_gettime_func) {
1189 // See if monotonic clock is supported by the kernel. Note that some
1190 // early implementations simply return kernel jiffies (updated every
1191 // 1/100 or 1/1000 second). It would be bad to use such a low res clock
1192 // for nano time (though the monotonic property is still nice to have).
1193 // It's fixed in newer kernels, however clock_getres() still returns
1194 // 1/HZ. We check if clock_getres() works, but will ignore its reported
1195 // resolution for now. Hopefully as people move to new kernels, this
1196 // won't be a problem.
1197 struct timespec res;
1198 struct timespec tp;
1199 if (clock_getres_func (CLOCK_MONOTONIC, &res) == 0 &&
1200 clock_gettime_func(CLOCK_MONOTONIC, &tp) == 0) {
1201 // yes, monotonic clock is supported
1202 _clock_gettime = clock_gettime_func;
1203 return;
1204 } else {
1205 // close librt if there is no monotonic clock
1206 dlclose(handle);
1207 }
1208 }
1209 }
1210 warning("No monotonic clock was available - timed services may " \
1211 "be adversely affected if the time-of-day clock changes");
1212 }
1213
1214 #ifndef SYS_clock_getres
1215 #if defined(X86) || defined(PPC64) || defined(S390)
1216 #define SYS_clock_getres AMD64_ONLY(229) IA32_ONLY(266) PPC64_ONLY(247) S390_ONLY(261)
1217 #define sys_clock_getres(x,y) ::syscall(SYS_clock_getres, x, y)
1218 #else
1219 #warning "SYS_clock_getres not defined for this platform, disabling fast_thread_cpu_time"
1220 #define sys_clock_getres(x,y) -1
1221 #endif
1222 #else
1223 #define sys_clock_getres(x,y) ::syscall(SYS_clock_getres, x, y)
1224 #endif
1225
1226 void os::Linux::fast_thread_clock_init() {
1227 if (!UseLinuxPosixThreadCPUClocks) {
1228 return;
1229 }
1230 clockid_t clockid;
1231 struct timespec tp;
1232 int (*pthread_getcpuclockid_func)(pthread_t, clockid_t *) =
1233 (int(*)(pthread_t, clockid_t *)) dlsym(RTLD_DEFAULT, "pthread_getcpuclockid");
1234
1235 // Switch to using fast clocks for thread cpu time if
1236 // the sys_clock_getres() returns 0 error code.
1237 // Note, that some kernels may support the current thread
1238 // clock (CLOCK_THREAD_CPUTIME_ID) but not the clocks
1239 // returned by the pthread_getcpuclockid().
1240 // If the fast Posix clocks are supported then the sys_clock_getres()
1241 // must return at least tp.tv_sec == 0 which means a resolution
1242 // better than 1 sec. This is extra check for reliability.
1243
1244 if (pthread_getcpuclockid_func &&
1245 pthread_getcpuclockid_func(_main_thread, &clockid) == 0 &&
1246 sys_clock_getres(clockid, &tp) == 0 && tp.tv_sec == 0) {
1247 _supports_fast_thread_cpu_time = true;
1248 _pthread_getcpuclockid = pthread_getcpuclockid_func;
1249 }
1250 }
1251
1252 jlong os::javaTimeNanos() {
1253 if (os::supports_monotonic_clock()) {
1254 struct timespec tp;
1255 int status = Linux::clock_gettime(CLOCK_MONOTONIC, &tp);
1256 assert(status == 0, "gettime error");
1257 jlong result = jlong(tp.tv_sec) * (1000 * 1000 * 1000) + jlong(tp.tv_nsec);
1258 return result;
1259 } else {
1260 timeval time;
1261 int status = gettimeofday(&time, NULL);
1262 assert(status != -1, "linux error");
1263 jlong usecs = jlong(time.tv_sec) * (1000 * 1000) + jlong(time.tv_usec);
1264 return 1000 * usecs;
1265 }
1266 }
1267
1268 void os::javaTimeNanos_info(jvmtiTimerInfo *info_ptr) {
1269 if (os::supports_monotonic_clock()) {
1270 info_ptr->max_value = ALL_64_BITS;
1271
1272 // CLOCK_MONOTONIC - amount of time since some arbitrary point in the past
1273 info_ptr->may_skip_backward = false; // not subject to resetting or drifting
1274 info_ptr->may_skip_forward = false; // not subject to resetting or drifting
1275 } else {
1276 // gettimeofday - based on time in seconds since the Epoch thus does not wrap
1277 info_ptr->max_value = ALL_64_BITS;
1278
1279 // gettimeofday is a real time clock so it skips
1280 info_ptr->may_skip_backward = true;
1281 info_ptr->may_skip_forward = true;
1282 }
1283
1284 info_ptr->kind = JVMTI_TIMER_ELAPSED; // elapsed not CPU time
1285 }
1286
1287 // Return the real, user, and system times in seconds from an
1288 // arbitrary fixed point in the past.
1289 bool os::getTimesSecs(double* process_real_time,
1290 double* process_user_time,
1291 double* process_system_time) {
1292 struct tms ticks;
1293 clock_t real_ticks = times(&ticks);
1294
1295 if (real_ticks == (clock_t) (-1)) {
1296 return false;
1297 } else {
1298 double ticks_per_second = (double) clock_tics_per_sec;
1299 *process_user_time = ((double) ticks.tms_utime) / ticks_per_second;
1300 *process_system_time = ((double) ticks.tms_stime) / ticks_per_second;
1301 *process_real_time = ((double) real_ticks) / ticks_per_second;
1302
1303 return true;
1304 }
1305 }
1306
1307
1308 char * os::local_time_string(char *buf, size_t buflen) {
1309 struct tm t;
1310 time_t long_time;
1311 time(&long_time);
1312 localtime_r(&long_time, &t);
1313 jio_snprintf(buf, buflen, "%d-%02d-%02d %02d:%02d:%02d",
1314 t.tm_year + 1900, t.tm_mon + 1, t.tm_mday,
1315 t.tm_hour, t.tm_min, t.tm_sec);
1316 return buf;
1317 }
1318
1319 struct tm* os::localtime_pd(const time_t* clock, struct tm* res) {
1320 return localtime_r(clock, res);
1321 }
1322
1323 ////////////////////////////////////////////////////////////////////////////////
1324 // runtime exit support
1325
1326 // Note: os::shutdown() might be called very early during initialization, or
1327 // called from signal handler. Before adding something to os::shutdown(), make
1328 // sure it is async-safe and can handle partially initialized VM.
1329 void os::shutdown() {
1330
1331 // allow PerfMemory to attempt cleanup of any persistent resources
1332 perfMemory_exit();
1333
1334 // needs to remove object in file system
1335 AttachListener::abort();
1336
1337 // flush buffered output, finish log files
1338 ostream_abort();
1339
1340 // Check for abort hook
1341 abort_hook_t abort_hook = Arguments::abort_hook();
1342 if (abort_hook != NULL) {
1343 abort_hook();
1344 }
1345
1346 }
1347
1348 // Note: os::abort() might be called very early during initialization, or
1349 // called from signal handler. Before adding something to os::abort(), make
1350 // sure it is async-safe and can handle partially initialized VM.
1351 void os::abort(bool dump_core, void* siginfo, const void* context) {
1352 os::shutdown();
1353 if (dump_core) {
1354 #ifndef PRODUCT
1355 fdStream out(defaultStream::output_fd());
1356 out.print_raw("Current thread is ");
1357 char buf[16];
1358 jio_snprintf(buf, sizeof(buf), UINTX_FORMAT, os::current_thread_id());
1359 out.print_raw_cr(buf);
1360 out.print_raw_cr("Dumping core ...");
1361 #endif
1362 ::abort(); // dump core
1363 }
1364
1365 ::exit(1);
1366 }
1367
1368 // Die immediately, no exit hook, no abort hook, no cleanup.
1369 void os::die() {
1370 ::abort();
1371 }
1372
1373
1374 // This method is a copy of JDK's sysGetLastErrorString
1375 // from src/solaris/hpi/src/system_md.c
1376
1377 size_t os::lasterror(char *buf, size_t len) {
1378 if (errno == 0) return 0;
1379
1380 const char *s = os::strerror(errno);
1381 size_t n = ::strlen(s);
1382 if (n >= len) {
1383 n = len - 1;
1384 }
1385 ::strncpy(buf, s, n);
1386 buf[n] = '\0';
1387 return n;
1388 }
1389
1390 // thread_id is kernel thread id (similar to Solaris LWP id)
1391 intx os::current_thread_id() { return os::Linux::gettid(); }
1392 int os::current_process_id() {
1393 return ::getpid();
1394 }
1395
1396 // DLL functions
1397
1398 const char* os::dll_file_extension() { return ".so"; }
1399
1400 // This must be hard coded because it's the system's temporary
1401 // directory not the java application's temp directory, ala java.io.tmpdir.
1402 const char* os::get_temp_directory() { return "/tmp"; }
1403
1404 static bool file_exists(const char* filename) {
1405 struct stat statbuf;
1406 if (filename == NULL || strlen(filename) == 0) {
1407 return false;
1408 }
1409 return os::stat(filename, &statbuf) == 0;
1410 }
1411
1412 bool os::dll_build_name(char* buffer, size_t buflen,
1413 const char* pname, const char* fname) {
1414 bool retval = false;
1415 // Copied from libhpi
1416 const size_t pnamelen = pname ? strlen(pname) : 0;
1417
1418 // Return error on buffer overflow.
1419 if (pnamelen + strlen(fname) + 10 > (size_t) buflen) {
1420 return retval;
1421 }
1422
1423 if (pnamelen == 0) {
1424 snprintf(buffer, buflen, "lib%s.so", fname);
1425 retval = true;
1426 } else if (strchr(pname, *os::path_separator()) != NULL) {
1427 int n;
1428 char** pelements = split_path(pname, &n);
1429 if (pelements == NULL) {
1430 return false;
1431 }
1432 for (int i = 0; i < n; i++) {
1433 // Really shouldn't be NULL, but check can't hurt
1434 if (pelements[i] == NULL || strlen(pelements[i]) == 0) {
1435 continue; // skip the empty path values
1436 }
1437 snprintf(buffer, buflen, "%s/lib%s.so", pelements[i], fname);
1438 if (file_exists(buffer)) {
1439 retval = true;
1440 break;
1441 }
1442 }
1443 // release the storage
1444 for (int i = 0; i < n; i++) {
1445 if (pelements[i] != NULL) {
1446 FREE_C_HEAP_ARRAY(char, pelements[i]);
1447 }
1448 }
1449 if (pelements != NULL) {
1450 FREE_C_HEAP_ARRAY(char*, pelements);
1451 }
1452 } else {
1453 snprintf(buffer, buflen, "%s/lib%s.so", pname, fname);
1454 retval = true;
1455 }
1456 return retval;
1457 }
1458
1459 // check if addr is inside libjvm.so
1460 bool os::address_is_in_vm(address addr) {
1461 static address libjvm_base_addr;
1462 Dl_info dlinfo;
1463
1464 if (libjvm_base_addr == NULL) {
1465 if (dladdr(CAST_FROM_FN_PTR(void *, os::address_is_in_vm), &dlinfo) != 0) {
1466 libjvm_base_addr = (address)dlinfo.dli_fbase;
1467 }
1468 assert(libjvm_base_addr !=NULL, "Cannot obtain base address for libjvm");
1469 }
1470
1471 if (dladdr((void *)addr, &dlinfo) != 0) {
1472 if (libjvm_base_addr == (address)dlinfo.dli_fbase) return true;
1473 }
1474
1475 return false;
1476 }
1477
1478 bool os::dll_address_to_function_name(address addr, char *buf,
1479 int buflen, int *offset,
1480 bool demangle) {
1481 // buf is not optional, but offset is optional
1482 assert(buf != NULL, "sanity check");
1483
1484 Dl_info dlinfo;
1485
1486 if (dladdr((void*)addr, &dlinfo) != 0) {
1487 // see if we have a matching symbol
1488 if (dlinfo.dli_saddr != NULL && dlinfo.dli_sname != NULL) {
1489 if (!(demangle && Decoder::demangle(dlinfo.dli_sname, buf, buflen))) {
1490 jio_snprintf(buf, buflen, "%s", dlinfo.dli_sname);
1491 }
1492 if (offset != NULL) *offset = addr - (address)dlinfo.dli_saddr;
1493 return true;
1494 }
1495 // no matching symbol so try for just file info
1496 if (dlinfo.dli_fname != NULL && dlinfo.dli_fbase != NULL) {
1497 if (Decoder::decode((address)(addr - (address)dlinfo.dli_fbase),
1498 buf, buflen, offset, dlinfo.dli_fname, demangle)) {
1499 return true;
1500 }
1501 }
1502 }
1503
1504 buf[0] = '\0';
1505 if (offset != NULL) *offset = -1;
1506 return false;
1507 }
1508
1509 struct _address_to_library_name {
1510 address addr; // input : memory address
1511 size_t buflen; // size of fname
1512 char* fname; // output: library name
1513 address base; // library base addr
1514 };
1515
1516 static int address_to_library_name_callback(struct dl_phdr_info *info,
1517 size_t size, void *data) {
1518 int i;
1519 bool found = false;
1520 address libbase = NULL;
1521 struct _address_to_library_name * d = (struct _address_to_library_name *)data;
1522
1523 // iterate through all loadable segments
1524 for (i = 0; i < info->dlpi_phnum; i++) {
1525 address segbase = (address)(info->dlpi_addr + info->dlpi_phdr[i].p_vaddr);
1526 if (info->dlpi_phdr[i].p_type == PT_LOAD) {
1527 // base address of a library is the lowest address of its loaded
1528 // segments.
1529 if (libbase == NULL || libbase > segbase) {
1530 libbase = segbase;
1531 }
1532 // see if 'addr' is within current segment
1533 if (segbase <= d->addr &&
1534 d->addr < segbase + info->dlpi_phdr[i].p_memsz) {
1535 found = true;
1536 }
1537 }
1538 }
1539
1540 // dlpi_name is NULL or empty if the ELF file is executable, return 0
1541 // so dll_address_to_library_name() can fall through to use dladdr() which
1542 // can figure out executable name from argv[0].
1543 if (found && info->dlpi_name && info->dlpi_name[0]) {
1544 d->base = libbase;
1545 if (d->fname) {
1546 jio_snprintf(d->fname, d->buflen, "%s", info->dlpi_name);
1547 }
1548 return 1;
1549 }
1550 return 0;
1551 }
1552
1553 bool os::dll_address_to_library_name(address addr, char* buf,
1554 int buflen, int* offset) {
1555 // buf is not optional, but offset is optional
1556 assert(buf != NULL, "sanity check");
1557
1558 Dl_info dlinfo;
1559 struct _address_to_library_name data;
1560
1561 // There is a bug in old glibc dladdr() implementation that it could resolve
1562 // to wrong library name if the .so file has a base address != NULL. Here
1563 // we iterate through the program headers of all loaded libraries to find
1564 // out which library 'addr' really belongs to. This workaround can be
1565 // removed once the minimum requirement for glibc is moved to 2.3.x.
1566 data.addr = addr;
1567 data.fname = buf;
1568 data.buflen = buflen;
1569 data.base = NULL;
1570 int rslt = dl_iterate_phdr(address_to_library_name_callback, (void *)&data);
1571
1572 if (rslt) {
1573 // buf already contains library name
1574 if (offset) *offset = addr - data.base;
1575 return true;
1576 }
1577 if (dladdr((void*)addr, &dlinfo) != 0) {
1578 if (dlinfo.dli_fname != NULL) {
1579 jio_snprintf(buf, buflen, "%s", dlinfo.dli_fname);
1580 }
1581 if (dlinfo.dli_fbase != NULL && offset != NULL) {
1582 *offset = addr - (address)dlinfo.dli_fbase;
1583 }
1584 return true;
1585 }
1586
1587 buf[0] = '\0';
1588 if (offset) *offset = -1;
1589 return false;
1590 }
1591
1592 // Loads .dll/.so and
1593 // in case of error it checks if .dll/.so was built for the
1594 // same architecture as Hotspot is running on
1595
1596
1597 // Remember the stack's state. The Linux dynamic linker will change
1598 // the stack to 'executable' at most once, so we must safepoint only once.
1599 bool os::Linux::_stack_is_executable = false;
1600
1601 // VM operation that loads a library. This is necessary if stack protection
1602 // of the Java stacks can be lost during loading the library. If we
1603 // do not stop the Java threads, they can stack overflow before the stacks
1604 // are protected again.
1605 class VM_LinuxDllLoad: public VM_Operation {
1606 private:
1607 const char *_filename;
1608 char *_ebuf;
1609 int _ebuflen;
1610 void *_lib;
1611 public:
1612 VM_LinuxDllLoad(const char *fn, char *ebuf, int ebuflen) :
1613 _filename(fn), _ebuf(ebuf), _ebuflen(ebuflen), _lib(NULL) {}
1614 VMOp_Type type() const { return VMOp_LinuxDllLoad; }
1615 void doit() {
1616 _lib = os::Linux::dll_load_in_vmthread(_filename, _ebuf, _ebuflen);
1617 os::Linux::_stack_is_executable = true;
1618 }
1619 void* loaded_library() { return _lib; }
1620 };
1621
1622 void * os::dll_load(const char *filename, char *ebuf, int ebuflen) {
1623 void * result = NULL;
1624 bool load_attempted = false;
1625
1626 // Check whether the library to load might change execution rights
1627 // of the stack. If they are changed, the protection of the stack
1628 // guard pages will be lost. We need a safepoint to fix this.
1629 //
1630 // See Linux man page execstack(8) for more info.
1631 if (os::uses_stack_guard_pages() && !os::Linux::_stack_is_executable) {
1632 ElfFile ef(filename);
1633 if (!ef.specifies_noexecstack()) {
1634 if (!is_init_completed()) {
1635 os::Linux::_stack_is_executable = true;
1636 // This is OK - No Java threads have been created yet, and hence no
1637 // stack guard pages to fix.
1638 //
1639 // This should happen only when you are building JDK7 using a very
1640 // old version of JDK6 (e.g., with JPRT) and running test_gamma.
1641 //
1642 // Dynamic loader will make all stacks executable after
1643 // this function returns, and will not do that again.
1644 assert(Threads::first() == NULL, "no Java threads should exist yet.");
1645 } else {
1646 warning("You have loaded library %s which might have disabled stack guard. "
1647 "The VM will try to fix the stack guard now.\n"
1648 "It's highly recommended that you fix the library with "
1649 "'execstack -c <libfile>', or link it with '-z noexecstack'.",
1650 filename);
1651
1652 assert(Thread::current()->is_Java_thread(), "must be Java thread");
1653 JavaThread *jt = JavaThread::current();
1654 if (jt->thread_state() != _thread_in_native) {
1655 // This happens when a compiler thread tries to load a hsdis-<arch>.so file
1656 // that requires ExecStack. Cannot enter safe point. Let's give up.
1657 warning("Unable to fix stack guard. Giving up.");
1658 } else {
1659 if (!LoadExecStackDllInVMThread) {
1660 // This is for the case where the DLL has an static
1661 // constructor function that executes JNI code. We cannot
1662 // load such DLLs in the VMThread.
1663 result = os::Linux::dlopen_helper(filename, ebuf, ebuflen);
1664 }
1665
1666 ThreadInVMfromNative tiv(jt);
1667 debug_only(VMNativeEntryWrapper vew;)
1668
1669 VM_LinuxDllLoad op(filename, ebuf, ebuflen);
1670 VMThread::execute(&op);
1671 if (LoadExecStackDllInVMThread) {
1672 result = op.loaded_library();
1673 }
1674 load_attempted = true;
1675 }
1676 }
1677 }
1678 }
1679
1680 if (!load_attempted) {
1681 result = os::Linux::dlopen_helper(filename, ebuf, ebuflen);
1682 }
1683
1684 if (result != NULL) {
1685 // Successful loading
1686 return result;
1687 }
1688
1689 Elf32_Ehdr elf_head;
1690 int diag_msg_max_length=ebuflen-strlen(ebuf);
1691 char* diag_msg_buf=ebuf+strlen(ebuf);
1692
1693 if (diag_msg_max_length==0) {
1694 // No more space in ebuf for additional diagnostics message
1695 return NULL;
1696 }
1697
1698
1699 int file_descriptor= ::open(filename, O_RDONLY | O_NONBLOCK);
1700
1701 if (file_descriptor < 0) {
1702 // Can't open library, report dlerror() message
1703 return NULL;
1704 }
1705
1706 bool failed_to_read_elf_head=
1707 (sizeof(elf_head)!=
1708 (::read(file_descriptor, &elf_head,sizeof(elf_head))));
1709
1710 ::close(file_descriptor);
1711 if (failed_to_read_elf_head) {
1712 // file i/o error - report dlerror() msg
1713 return NULL;
1714 }
1715
1716 typedef struct {
1717 Elf32_Half code; // Actual value as defined in elf.h
1718 Elf32_Half compat_class; // Compatibility of archs at VM's sense
1719 unsigned char elf_class; // 32 or 64 bit
1720 unsigned char endianess; // MSB or LSB
1721 char* name; // String representation
1722 } arch_t;
1723
1724 #ifndef EM_486
1725 #define EM_486 6 /* Intel 80486 */
1726 #endif
1727 #ifndef EM_AARCH64
1728 #define EM_AARCH64 183 /* ARM AARCH64 */
1729 #endif
1730
1731 static const arch_t arch_array[]={
1732 {EM_386, EM_386, ELFCLASS32, ELFDATA2LSB, (char*)"IA 32"},
1733 {EM_486, EM_386, ELFCLASS32, ELFDATA2LSB, (char*)"IA 32"},
1734 {EM_IA_64, EM_IA_64, ELFCLASS64, ELFDATA2LSB, (char*)"IA 64"},
1735 {EM_X86_64, EM_X86_64, ELFCLASS64, ELFDATA2LSB, (char*)"AMD 64"},
1736 {EM_SPARC, EM_SPARC, ELFCLASS32, ELFDATA2MSB, (char*)"Sparc 32"},
1737 {EM_SPARC32PLUS, EM_SPARC, ELFCLASS32, ELFDATA2MSB, (char*)"Sparc 32"},
1738 {EM_SPARCV9, EM_SPARCV9, ELFCLASS64, ELFDATA2MSB, (char*)"Sparc v9 64"},
1739 {EM_PPC, EM_PPC, ELFCLASS32, ELFDATA2MSB, (char*)"Power PC 32"},
1740 #if defined(VM_LITTLE_ENDIAN)
1741 {EM_PPC64, EM_PPC64, ELFCLASS64, ELFDATA2LSB, (char*)"Power PC 64"},
1742 #else
1743 {EM_PPC64, EM_PPC64, ELFCLASS64, ELFDATA2MSB, (char*)"Power PC 64 LE"},
1744 #endif
1745 {EM_ARM, EM_ARM, ELFCLASS32, ELFDATA2LSB, (char*)"ARM"},
1746 {EM_S390, EM_S390, ELFCLASSNONE, ELFDATA2MSB, (char*)"IBM System/390"},
1747 {EM_ALPHA, EM_ALPHA, ELFCLASS64, ELFDATA2LSB, (char*)"Alpha"},
1748 {EM_MIPS_RS3_LE, EM_MIPS_RS3_LE, ELFCLASS32, ELFDATA2LSB, (char*)"MIPSel"},
1749 {EM_MIPS, EM_MIPS, ELFCLASS32, ELFDATA2MSB, (char*)"MIPS"},
1750 {EM_PARISC, EM_PARISC, ELFCLASS32, ELFDATA2MSB, (char*)"PARISC"},
1751 {EM_68K, EM_68K, ELFCLASS32, ELFDATA2MSB, (char*)"M68k"},
1752 {EM_AARCH64, EM_AARCH64, ELFCLASS64, ELFDATA2LSB, (char*)"AARCH64"},
1753 };
1754
1755 #if (defined IA32)
1756 static Elf32_Half running_arch_code=EM_386;
1757 #elif (defined AMD64)
1758 static Elf32_Half running_arch_code=EM_X86_64;
1759 #elif (defined IA64)
1760 static Elf32_Half running_arch_code=EM_IA_64;
1761 #elif (defined __sparc) && (defined _LP64)
1762 static Elf32_Half running_arch_code=EM_SPARCV9;
1763 #elif (defined __sparc) && (!defined _LP64)
1764 static Elf32_Half running_arch_code=EM_SPARC;
1765 #elif (defined __powerpc64__)
1766 static Elf32_Half running_arch_code=EM_PPC64;
1767 #elif (defined __powerpc__)
1768 static Elf32_Half running_arch_code=EM_PPC;
1769 #elif (defined AARCH64)
1770 static Elf32_Half running_arch_code=EM_AARCH64;
1771 #elif (defined ARM)
1772 static Elf32_Half running_arch_code=EM_ARM;
1773 #elif (defined S390)
1774 static Elf32_Half running_arch_code=EM_S390;
1775 #elif (defined ALPHA)
1776 static Elf32_Half running_arch_code=EM_ALPHA;
1777 #elif (defined MIPSEL)
1778 static Elf32_Half running_arch_code=EM_MIPS_RS3_LE;
1779 #elif (defined PARISC)
1780 static Elf32_Half running_arch_code=EM_PARISC;
1781 #elif (defined MIPS)
1782 static Elf32_Half running_arch_code=EM_MIPS;
1783 #elif (defined M68K)
1784 static Elf32_Half running_arch_code=EM_68K;
1785 #else
1786 #error Method os::dll_load requires that one of following is defined:\
1787 AARCH64, ALPHA, ARM, AMD64, IA32, IA64, M68K, MIPS, MIPSEL, PARISC, __powerpc__, __powerpc64__, S390, __sparc
1788 #endif
1789
1790 // Identify compatability class for VM's architecture and library's architecture
1791 // Obtain string descriptions for architectures
1792
1793 arch_t lib_arch={elf_head.e_machine,0,elf_head.e_ident[EI_CLASS], elf_head.e_ident[EI_DATA], NULL};
1794 int running_arch_index=-1;
1795
1796 for (unsigned int i=0; i < ARRAY_SIZE(arch_array); i++) {
1797 if (running_arch_code == arch_array[i].code) {
1798 running_arch_index = i;
1799 }
1800 if (lib_arch.code == arch_array[i].code) {
1801 lib_arch.compat_class = arch_array[i].compat_class;
1802 lib_arch.name = arch_array[i].name;
1803 }
1804 }
1805
1806 assert(running_arch_index != -1,
1807 "Didn't find running architecture code (running_arch_code) in arch_array");
1808 if (running_arch_index == -1) {
1809 // Even though running architecture detection failed
1810 // we may still continue with reporting dlerror() message
1811 return NULL;
1812 }
1813
1814 if (lib_arch.endianess != arch_array[running_arch_index].endianess) {
1815 ::snprintf(diag_msg_buf, diag_msg_max_length-1," (Possible cause: endianness mismatch)");
1816 return NULL;
1817 }
1818
1819 #ifndef S390
1820 if (lib_arch.elf_class != arch_array[running_arch_index].elf_class) {
1821 ::snprintf(diag_msg_buf, diag_msg_max_length-1," (Possible cause: architecture word width mismatch)");
1822 return NULL;
1823 }
1824 #endif // !S390
1825
1826 if (lib_arch.compat_class != arch_array[running_arch_index].compat_class) {
1827 if (lib_arch.name!=NULL) {
1828 ::snprintf(diag_msg_buf, diag_msg_max_length-1,
1829 " (Possible cause: can't load %s-bit .so on a %s-bit platform)",
1830 lib_arch.name, arch_array[running_arch_index].name);
1831 } else {
1832 ::snprintf(diag_msg_buf, diag_msg_max_length-1,
1833 " (Possible cause: can't load this .so (machine code=0x%x) on a %s-bit platform)",
1834 lib_arch.code,
1835 arch_array[running_arch_index].name);
1836 }
1837 }
1838
1839 return NULL;
1840 }
1841
1842 void * os::Linux::dlopen_helper(const char *filename, char *ebuf,
1843 int ebuflen) {
1844 void * result = ::dlopen(filename, RTLD_LAZY);
1845 if (result == NULL) {
1846 ::strncpy(ebuf, ::dlerror(), ebuflen - 1);
1847 ebuf[ebuflen-1] = '\0';
1848 }
1849 return result;
1850 }
1851
1852 void * os::Linux::dll_load_in_vmthread(const char *filename, char *ebuf,
1853 int ebuflen) {
1854 void * result = NULL;
1855 if (LoadExecStackDllInVMThread) {
1856 result = dlopen_helper(filename, ebuf, ebuflen);
1857 }
1858
1859 // Since 7019808, libjvm.so is linked with -noexecstack. If the VM loads a
1860 // library that requires an executable stack, or which does not have this
1861 // stack attribute set, dlopen changes the stack attribute to executable. The
1862 // read protection of the guard pages gets lost.
1863 //
1864 // Need to check _stack_is_executable again as multiple VM_LinuxDllLoad
1865 // may have been queued at the same time.
1866
1867 if (!_stack_is_executable) {
1868 JavaThread *jt = Threads::first();
1869
1870 while (jt) {
1871 if (!jt->stack_guard_zone_unused() && // Stack not yet fully initialized
1872 jt->stack_guards_enabled()) { // No pending stack overflow exceptions
1873 if (!os::guard_memory((char *)jt->stack_end(), jt->stack_guard_zone_size())) {
1874 warning("Attempt to reguard stack yellow zone failed.");
1875 }
1876 }
1877 jt = jt->next();
1878 }
1879 }
1880
1881 return result;
1882 }
1883
1884 void* os::dll_lookup(void* handle, const char* name) {
1885 void* res = dlsym(handle, name);
1886 return res;
1887 }
1888
1889 void* os::get_default_process_handle() {
1890 return (void*)::dlopen(NULL, RTLD_LAZY);
1891 }
1892
1893 static bool _print_ascii_file(const char* filename, outputStream* st) {
1894 int fd = ::open(filename, O_RDONLY);
1895 if (fd == -1) {
1896 return false;
1897 }
1898
1899 char buf[33];
1900 int bytes;
1901 buf[32] = '\0';
1902 while ((bytes = ::read(fd, buf, sizeof(buf)-1)) > 0) {
1903 st->print_raw(buf, bytes);
1904 }
1905
1906 ::close(fd);
1907
1908 return true;
1909 }
1910
1911 void os::print_dll_info(outputStream *st) {
1912 st->print_cr("Dynamic libraries:");
1913
1914 char fname[32];
1915 pid_t pid = os::Linux::gettid();
1916
1917 jio_snprintf(fname, sizeof(fname), "/proc/%d/maps", pid);
1918
1919 if (!_print_ascii_file(fname, st)) {
1920 st->print("Can not get library information for pid = %d\n", pid);
1921 }
1922 }
1923
1924 int os::get_loaded_modules_info(os::LoadedModulesCallbackFunc callback, void *param) {
1925 FILE *procmapsFile = NULL;
1926
1927 // Open the procfs maps file for the current process
1928 if ((procmapsFile = fopen("/proc/self/maps", "r")) != NULL) {
1929 // Allocate PATH_MAX for file name plus a reasonable size for other fields.
1930 char line[PATH_MAX + 100];
1931
1932 // Read line by line from 'file'
1933 while (fgets(line, sizeof(line), procmapsFile) != NULL) {
1934 u8 base, top, offset, inode;
1935 char permissions[5];
1936 char device[6];
1937 char name[PATH_MAX + 1];
1938
1939 // Parse fields from line
1940 sscanf(line, UINT64_FORMAT_X "-" UINT64_FORMAT_X " %4s " UINT64_FORMAT_X " %5s " INT64_FORMAT " %s",
1941 &base, &top, permissions, &offset, device, &inode, name);
1942
1943 // Filter by device id '00:00' so that we only get file system mapped files.
1944 if (strcmp(device, "00:00") != 0) {
1945
1946 // Call callback with the fields of interest
1947 if(callback(name, (address)base, (address)top, param)) {
1948 // Oops abort, callback aborted
1949 fclose(procmapsFile);
1950 return 1;
1951 }
1952 }
1953 }
1954 fclose(procmapsFile);
1955 }
1956 return 0;
1957 }
1958
1959 void os::print_os_info_brief(outputStream* st) {
1960 os::Linux::print_distro_info(st);
1961
1962 os::Posix::print_uname_info(st);
1963
1964 os::Linux::print_libversion_info(st);
1965
1966 }
1967
1968 void os::print_os_info(outputStream* st) {
1969 st->print("OS:");
1970
1971 os::Linux::print_distro_info(st);
1972
1973 os::Posix::print_uname_info(st);
1974
1975 // Print warning if unsafe chroot environment detected
1976 if (unsafe_chroot_detected) {
1977 st->print("WARNING!! ");
1978 st->print_cr("%s", unstable_chroot_error);
1979 }
1980
1981 os::Linux::print_libversion_info(st);
1982
1983 os::Posix::print_rlimit_info(st);
1984
1985 os::Posix::print_load_average(st);
1986
1987 os::Linux::print_full_memory_info(st);
1988 }
1989
1990 // Try to identify popular distros.
1991 // Most Linux distributions have a /etc/XXX-release file, which contains
1992 // the OS version string. Newer Linux distributions have a /etc/lsb-release
1993 // file that also contains the OS version string. Some have more than one
1994 // /etc/XXX-release file (e.g. Mandrake has both /etc/mandrake-release and
1995 // /etc/redhat-release.), so the order is important.
1996 // Any Linux that is based on Redhat (i.e. Oracle, Mandrake, Sun JDS...) have
1997 // their own specific XXX-release file as well as a redhat-release file.
1998 // Because of this the XXX-release file needs to be searched for before the
1999 // redhat-release file.
2000 // Since Red Hat and SuSE have an lsb-release file that is not very descriptive the
2001 // search for redhat-release / SuSE-release needs to be before lsb-release.
2002 // Since the lsb-release file is the new standard it needs to be searched
2003 // before the older style release files.
2004 // Searching system-release (Red Hat) and os-release (other Linuxes) are a
2005 // next to last resort. The os-release file is a new standard that contains
2006 // distribution information and the system-release file seems to be an old
2007 // standard that has been replaced by the lsb-release and os-release files.
2008 // Searching for the debian_version file is the last resort. It contains
2009 // an informative string like "6.0.6" or "wheezy/sid". Because of this
2010 // "Debian " is printed before the contents of the debian_version file.
2011
2012 const char* distro_files[] = {
2013 "/etc/oracle-release",
2014 "/etc/mandriva-release",
2015 "/etc/mandrake-release",
2016 "/etc/sun-release",
2017 "/etc/redhat-release",
2018 "/etc/SuSE-release",
2019 "/etc/lsb-release",
2020 "/etc/turbolinux-release",
2021 "/etc/gentoo-release",
2022 "/etc/ltib-release",
2023 "/etc/angstrom-version",
2024 "/etc/system-release",
2025 "/etc/os-release",
2026 NULL };
2027
2028 void os::Linux::print_distro_info(outputStream* st) {
2029 for (int i = 0;; i++) {
2030 const char* file = distro_files[i];
2031 if (file == NULL) {
2032 break; // done
2033 }
2034 // If file prints, we found it.
2035 if (_print_ascii_file(file, st)) {
2036 return;
2037 }
2038 }
2039
2040 if (file_exists("/etc/debian_version")) {
2041 st->print("Debian ");
2042 _print_ascii_file("/etc/debian_version", st);
2043 } else {
2044 st->print("Linux");
2045 }
2046 st->cr();
2047 }
2048
2049 static void parse_os_info_helper(FILE* fp, char* distro, size_t length, bool get_first_line) {
2050 char buf[256];
2051 while (fgets(buf, sizeof(buf), fp)) {
2052 // Edit out extra stuff in expected format
2053 if (strstr(buf, "DISTRIB_DESCRIPTION=") != NULL || strstr(buf, "PRETTY_NAME=") != NULL) {
2054 char* ptr = strstr(buf, "\""); // the name is in quotes
2055 if (ptr != NULL) {
2056 ptr++; // go beyond first quote
2057 char* nl = strchr(ptr, '\"');
2058 if (nl != NULL) *nl = '\0';
2059 strncpy(distro, ptr, length);
2060 } else {
2061 ptr = strstr(buf, "=");
2062 ptr++; // go beyond equals then
2063 char* nl = strchr(ptr, '\n');
2064 if (nl != NULL) *nl = '\0';
2065 strncpy(distro, ptr, length);
2066 }
2067 return;
2068 } else if (get_first_line) {
2069 char* nl = strchr(buf, '\n');
2070 if (nl != NULL) *nl = '\0';
2071 strncpy(distro, buf, length);
2072 return;
2073 }
2074 }
2075 // print last line and close
2076 char* nl = strchr(buf, '\n');
2077 if (nl != NULL) *nl = '\0';
2078 strncpy(distro, buf, length);
2079 }
2080
2081 static void parse_os_info(char* distro, size_t length, const char* file) {
2082 FILE* fp = fopen(file, "r");
2083 if (fp != NULL) {
2084 // if suse format, print out first line
2085 bool get_first_line = (strcmp(file, "/etc/SuSE-release") == 0);
2086 parse_os_info_helper(fp, distro, length, get_first_line);
2087 fclose(fp);
2088 }
2089 }
2090
2091 void os::get_summary_os_info(char* buf, size_t buflen) {
2092 for (int i = 0;; i++) {
2093 const char* file = distro_files[i];
2094 if (file == NULL) {
2095 break; // ran out of distro_files
2096 }
2097 if (file_exists(file)) {
2098 parse_os_info(buf, buflen, file);
2099 return;
2100 }
2101 }
2102 // special case for debian
2103 if (file_exists("/etc/debian_version")) {
2104 strncpy(buf, "Debian ", buflen);
2105 parse_os_info(&buf[7], buflen-7, "/etc/debian_version");
2106 } else {
2107 strncpy(buf, "Linux", buflen);
2108 }
2109 }
2110
2111 void os::Linux::print_libversion_info(outputStream* st) {
2112 // libc, pthread
2113 st->print("libc:");
2114 st->print("%s ", os::Linux::glibc_version());
2115 st->print("%s ", os::Linux::libpthread_version());
2116 st->cr();
2117 }
2118
2119 void os::Linux::print_full_memory_info(outputStream* st) {
2120 st->print("\n/proc/meminfo:\n");
2121 _print_ascii_file("/proc/meminfo", st);
2122 st->cr();
2123 }
2124
2125 void os::print_memory_info(outputStream* st) {
2126
2127 st->print("Memory:");
2128 st->print(" %dk page", os::vm_page_size()>>10);
2129
2130 // values in struct sysinfo are "unsigned long"
2131 struct sysinfo si;
2132 sysinfo(&si);
2133
2134 st->print(", physical " UINT64_FORMAT "k",
2135 os::physical_memory() >> 10);
2136 st->print("(" UINT64_FORMAT "k free)",
2137 os::available_memory() >> 10);
2138 st->print(", swap " UINT64_FORMAT "k",
2139 ((jlong)si.totalswap * si.mem_unit) >> 10);
2140 st->print("(" UINT64_FORMAT "k free)",
2141 ((jlong)si.freeswap * si.mem_unit) >> 10);
2142 st->cr();
2143 }
2144
2145 // Print the first "model name" line and the first "flags" line
2146 // that we find and nothing more. We assume "model name" comes
2147 // before "flags" so if we find a second "model name", then the
2148 // "flags" field is considered missing.
2149 static bool print_model_name_and_flags(outputStream* st, char* buf, size_t buflen) {
2150 #if defined(IA32) || defined(AMD64)
2151 // Other platforms have less repetitive cpuinfo files
2152 FILE *fp = fopen("/proc/cpuinfo", "r");
2153 if (fp) {
2154 while (!feof(fp)) {
2155 if (fgets(buf, buflen, fp)) {
2156 // Assume model name comes before flags
2157 bool model_name_printed = false;
2158 if (strstr(buf, "model name") != NULL) {
2159 if (!model_name_printed) {
2160 st->print_raw("CPU Model and flags from /proc/cpuinfo:\n");
2161 st->print_raw(buf);
2162 model_name_printed = true;
2163 } else {
2164 // model name printed but not flags? Odd, just return
2165 fclose(fp);
2166 return true;
2167 }
2168 }
2169 // print the flags line too
2170 if (strstr(buf, "flags") != NULL) {
2171 st->print_raw(buf);
2172 fclose(fp);
2173 return true;
2174 }
2175 }
2176 }
2177 fclose(fp);
2178 }
2179 #endif // x86 platforms
2180 return false;
2181 }
2182
2183 void os::pd_print_cpu_info(outputStream* st, char* buf, size_t buflen) {
2184 // Only print the model name if the platform provides this as a summary
2185 if (!print_model_name_and_flags(st, buf, buflen)) {
2186 st->print("\n/proc/cpuinfo:\n");
2187 if (!_print_ascii_file("/proc/cpuinfo", st)) {
2188 st->print_cr(" <Not Available>");
2189 }
2190 }
2191 }
2192
2193 #if defined(AMD64) || defined(IA32) || defined(X32)
2194 const char* search_string = "model name";
2195 #elif defined(PPC64)
2196 const char* search_string = "cpu";
2197 #elif defined(S390)
2198 const char* search_string = "processor";
2199 #elif defined(SPARC)
2200 const char* search_string = "cpu";
2201 #else
2202 const char* search_string = "Processor";
2203 #endif
2204
2205 // Parses the cpuinfo file for string representing the model name.
2206 void os::get_summary_cpu_info(char* cpuinfo, size_t length) {
2207 FILE* fp = fopen("/proc/cpuinfo", "r");
2208 if (fp != NULL) {
2209 while (!feof(fp)) {
2210 char buf[256];
2211 if (fgets(buf, sizeof(buf), fp)) {
2212 char* start = strstr(buf, search_string);
2213 if (start != NULL) {
2214 char *ptr = start + strlen(search_string);
2215 char *end = buf + strlen(buf);
2216 while (ptr != end) {
2217 // skip whitespace and colon for the rest of the name.
2218 if (*ptr != ' ' && *ptr != '\t' && *ptr != ':') {
2219 break;
2220 }
2221 ptr++;
2222 }
2223 if (ptr != end) {
2224 // reasonable string, get rid of newline and keep the rest
2225 char* nl = strchr(buf, '\n');
2226 if (nl != NULL) *nl = '\0';
2227 strncpy(cpuinfo, ptr, length);
2228 fclose(fp);
2229 return;
2230 }
2231 }
2232 }
2233 }
2234 fclose(fp);
2235 }
2236 // cpuinfo not found or parsing failed, just print generic string. The entire
2237 // /proc/cpuinfo file will be printed later in the file (or enough of it for x86)
2238 #if defined(AARCH64)
2239 strncpy(cpuinfo, "AArch64", length);
2240 #elif defined(AMD64)
2241 strncpy(cpuinfo, "x86_64", length);
2242 #elif defined(ARM) // Order wrt. AARCH64 is relevant!
2243 strncpy(cpuinfo, "ARM", length);
2244 #elif defined(IA32)
2245 strncpy(cpuinfo, "x86_32", length);
2246 #elif defined(IA64)
2247 strncpy(cpuinfo, "IA64", length);
2248 #elif defined(PPC)
2249 strncpy(cpuinfo, "PPC64", length);
2250 #elif defined(S390)
2251 strncpy(cpuinfo, "S390", length);
2252 #elif defined(SPARC)
2253 strncpy(cpuinfo, "sparcv9", length);
2254 #elif defined(ZERO_LIBARCH)
2255 strncpy(cpuinfo, ZERO_LIBARCH, length);
2256 #else
2257 strncpy(cpuinfo, "unknown", length);
2258 #endif
2259 }
2260
2261 static void print_signal_handler(outputStream* st, int sig,
2262 char* buf, size_t buflen);
2263
2264 void os::print_signal_handlers(outputStream* st, char* buf, size_t buflen) {
2265 st->print_cr("Signal Handlers:");
2266 print_signal_handler(st, SIGSEGV, buf, buflen);
2267 print_signal_handler(st, SIGBUS , buf, buflen);
2268 print_signal_handler(st, SIGFPE , buf, buflen);
2269 print_signal_handler(st, SIGPIPE, buf, buflen);
2270 print_signal_handler(st, SIGXFSZ, buf, buflen);
2271 print_signal_handler(st, SIGILL , buf, buflen);
2272 print_signal_handler(st, SR_signum, buf, buflen);
2273 print_signal_handler(st, SHUTDOWN1_SIGNAL, buf, buflen);
2274 print_signal_handler(st, SHUTDOWN2_SIGNAL , buf, buflen);
2275 print_signal_handler(st, SHUTDOWN3_SIGNAL , buf, buflen);
2276 print_signal_handler(st, BREAK_SIGNAL, buf, buflen);
2277 #if defined(PPC64)
2278 print_signal_handler(st, SIGTRAP, buf, buflen);
2279 #endif
2280 }
2281
2282 static char saved_jvm_path[MAXPATHLEN] = {0};
2283
2284 // Find the full path to the current module, libjvm.so
2285 void os::jvm_path(char *buf, jint buflen) {
2286 // Error checking.
2287 if (buflen < MAXPATHLEN) {
2288 assert(false, "must use a large-enough buffer");
2289 buf[0] = '\0';
2290 return;
2291 }
2292 // Lazy resolve the path to current module.
2293 if (saved_jvm_path[0] != 0) {
2294 strcpy(buf, saved_jvm_path);
2295 return;
2296 }
2297
2298 char dli_fname[MAXPATHLEN];
2299 bool ret = dll_address_to_library_name(
2300 CAST_FROM_FN_PTR(address, os::jvm_path),
2301 dli_fname, sizeof(dli_fname), NULL);
2302 assert(ret, "cannot locate libjvm");
2303 char *rp = NULL;
2304 if (ret && dli_fname[0] != '\0') {
2305 rp = realpath(dli_fname, buf);
2306 }
2307 if (rp == NULL) {
2308 return;
2309 }
2310
2311 if (Arguments::sun_java_launcher_is_altjvm()) {
2312 // Support for the java launcher's '-XXaltjvm=<path>' option. Typical
2313 // value for buf is "<JAVA_HOME>/jre/lib/<arch>/<vmtype>/libjvm.so".
2314 // If "/jre/lib/" appears at the right place in the string, then
2315 // assume we are installed in a JDK and we're done. Otherwise, check
2316 // for a JAVA_HOME environment variable and fix up the path so it
2317 // looks like libjvm.so is installed there (append a fake suffix
2318 // hotspot/libjvm.so).
2319 const char *p = buf + strlen(buf) - 1;
2320 for (int count = 0; p > buf && count < 5; ++count) {
2321 for (--p; p > buf && *p != '/'; --p)
2322 /* empty */ ;
2323 }
2324
2325 if (strncmp(p, "/jre/lib/", 9) != 0) {
2326 // Look for JAVA_HOME in the environment.
2327 char* java_home_var = ::getenv("JAVA_HOME");
2328 if (java_home_var != NULL && java_home_var[0] != 0) {
2329 char* jrelib_p;
2330 int len;
2331
2332 // Check the current module name "libjvm.so".
2333 p = strrchr(buf, '/');
2334 if (p == NULL) {
2335 return;
2336 }
2337 assert(strstr(p, "/libjvm") == p, "invalid library name");
2338
2339 rp = realpath(java_home_var, buf);
2340 if (rp == NULL) {
2341 return;
2342 }
2343
2344 // determine if this is a legacy image or modules image
2345 // modules image doesn't have "jre" subdirectory
2346 len = strlen(buf);
2347 assert(len < buflen, "Ran out of buffer room");
2348 jrelib_p = buf + len;
2349 snprintf(jrelib_p, buflen-len, "/jre/lib/%s", cpu_arch);
2350 if (0 != access(buf, F_OK)) {
2351 snprintf(jrelib_p, buflen-len, "/lib/%s", cpu_arch);
2352 }
2353
2354 if (0 == access(buf, F_OK)) {
2355 // Use current module name "libjvm.so"
2356 len = strlen(buf);
2357 snprintf(buf + len, buflen-len, "/hotspot/libjvm.so");
2358 } else {
2359 // Go back to path of .so
2360 rp = realpath(dli_fname, buf);
2361 if (rp == NULL) {
2362 return;
2363 }
2364 }
2365 }
2366 }
2367 }
2368
2369 strncpy(saved_jvm_path, buf, MAXPATHLEN);
2370 saved_jvm_path[MAXPATHLEN - 1] = '\0';
2371 }
2372
2373 void os::print_jni_name_prefix_on(outputStream* st, int args_size) {
2374 // no prefix required, not even "_"
2375 }
2376
2377 void os::print_jni_name_suffix_on(outputStream* st, int args_size) {
2378 // no suffix required
2379 }
2380
2381 ////////////////////////////////////////////////////////////////////////////////
2382 // sun.misc.Signal support
2383
2384 static volatile jint sigint_count = 0;
2385
2386 static void UserHandler(int sig, void *siginfo, void *context) {
2387 // 4511530 - sem_post is serialized and handled by the manager thread. When
2388 // the program is interrupted by Ctrl-C, SIGINT is sent to every thread. We
2389 // don't want to flood the manager thread with sem_post requests.
2390 if (sig == SIGINT && Atomic::add(1, &sigint_count) > 1) {
2391 return;
2392 }
2393
2394 // Ctrl-C is pressed during error reporting, likely because the error
2395 // handler fails to abort. Let VM die immediately.
2396 if (sig == SIGINT && is_error_reported()) {
2397 os::die();
2398 }
2399
2400 os::signal_notify(sig);
2401 }
2402
2403 void* os::user_handler() {
2404 return CAST_FROM_FN_PTR(void*, UserHandler);
2405 }
2406
2407 struct timespec PosixSemaphore::create_timespec(unsigned int sec, int nsec) {
2408 struct timespec ts;
2409 // Semaphore's are always associated with CLOCK_REALTIME
2410 os::Linux::clock_gettime(CLOCK_REALTIME, &ts);
2411 // see unpackTime for discussion on overflow checking
2412 if (sec >= MAX_SECS) {
2413 ts.tv_sec += MAX_SECS;
2414 ts.tv_nsec = 0;
2415 } else {
2416 ts.tv_sec += sec;
2417 ts.tv_nsec += nsec;
2418 if (ts.tv_nsec >= NANOSECS_PER_SEC) {
2419 ts.tv_nsec -= NANOSECS_PER_SEC;
2420 ++ts.tv_sec; // note: this must be <= max_secs
2421 }
2422 }
2423
2424 return ts;
2425 }
2426
2427 extern "C" {
2428 typedef void (*sa_handler_t)(int);
2429 typedef void (*sa_sigaction_t)(int, siginfo_t *, void *);
2430 }
2431
2432 void* os::signal(int signal_number, void* handler) {
2433 struct sigaction sigAct, oldSigAct;
2434
2435 sigfillset(&(sigAct.sa_mask));
2436 sigAct.sa_flags = SA_RESTART|SA_SIGINFO;
2437 sigAct.sa_handler = CAST_TO_FN_PTR(sa_handler_t, handler);
2438
2439 if (sigaction(signal_number, &sigAct, &oldSigAct)) {
2440 // -1 means registration failed
2441 return (void *)-1;
2442 }
2443
2444 return CAST_FROM_FN_PTR(void*, oldSigAct.sa_handler);
2445 }
2446
2447 void os::signal_raise(int signal_number) {
2448 ::raise(signal_number);
2449 }
2450
2451 // The following code is moved from os.cpp for making this
2452 // code platform specific, which it is by its very nature.
2453
2454 // Will be modified when max signal is changed to be dynamic
2455 int os::sigexitnum_pd() {
2456 return NSIG;
2457 }
2458
2459 // a counter for each possible signal value
2460 static volatile jint pending_signals[NSIG+1] = { 0 };
2461
2462 // Linux(POSIX) specific hand shaking semaphore.
2463 static sem_t sig_sem;
2464 static PosixSemaphore sr_semaphore;
2465
2466 void os::signal_init_pd() {
2467 // Initialize signal structures
2468 ::memset((void*)pending_signals, 0, sizeof(pending_signals));
2469
2470 // Initialize signal semaphore
2471 ::sem_init(&sig_sem, 0, 0);
2472 }
2473
2474 void os::signal_notify(int sig) {
2475 Atomic::inc(&pending_signals[sig]);
2476 ::sem_post(&sig_sem);
2477 }
2478
2479 static int check_pending_signals(bool wait) {
2480 Atomic::store(0, &sigint_count);
2481 for (;;) {
2482 for (int i = 0; i < NSIG + 1; i++) {
2483 jint n = pending_signals[i];
2484 if (n > 0 && n == Atomic::cmpxchg(n - 1, &pending_signals[i], n)) {
2485 return i;
2486 }
2487 }
2488 if (!wait) {
2489 return -1;
2490 }
2491 JavaThread *thread = JavaThread::current();
2492 ThreadBlockInVM tbivm(thread);
2493
2494 bool threadIsSuspended;
2495 do {
2496 thread->set_suspend_equivalent();
2497 // cleared by handle_special_suspend_equivalent_condition() or java_suspend_self()
2498 ::sem_wait(&sig_sem);
2499
2500 // were we externally suspended while we were waiting?
2501 threadIsSuspended = thread->handle_special_suspend_equivalent_condition();
2502 if (threadIsSuspended) {
2503 // The semaphore has been incremented, but while we were waiting
2504 // another thread suspended us. We don't want to continue running
2505 // while suspended because that would surprise the thread that
2506 // suspended us.
2507 ::sem_post(&sig_sem);
2508
2509 thread->java_suspend_self();
2510 }
2511 } while (threadIsSuspended);
2512 }
2513 }
2514
2515 int os::signal_lookup() {
2516 return check_pending_signals(false);
2517 }
2518
2519 int os::signal_wait() {
2520 return check_pending_signals(true);
2521 }
2522
2523 ////////////////////////////////////////////////////////////////////////////////
2524 // Virtual Memory
2525
2526 int os::vm_page_size() {
2527 // Seems redundant as all get out
2528 assert(os::Linux::page_size() != -1, "must call os::init");
2529 return os::Linux::page_size();
2530 }
2531
2532 // Solaris allocates memory by pages.
2533 int os::vm_allocation_granularity() {
2534 assert(os::Linux::page_size() != -1, "must call os::init");
2535 return os::Linux::page_size();
2536 }
2537
2538 // Rationale behind this function:
2539 // current (Mon Apr 25 20:12:18 MSD 2005) oprofile drops samples without executable
2540 // mapping for address (see lookup_dcookie() in the kernel module), thus we cannot get
2541 // samples for JITted code. Here we create private executable mapping over the code cache
2542 // and then we can use standard (well, almost, as mapping can change) way to provide
2543 // info for the reporting script by storing timestamp and location of symbol
2544 void linux_wrap_code(char* base, size_t size) {
2545 static volatile jint cnt = 0;
2546
2547 if (!UseOprofile) {
2548 return;
2549 }
2550
2551 char buf[PATH_MAX+1];
2552 int num = Atomic::add(1, &cnt);
2553
2554 snprintf(buf, sizeof(buf), "%s/hs-vm-%d-%d",
2555 os::get_temp_directory(), os::current_process_id(), num);
2556 unlink(buf);
2557
2558 int fd = ::open(buf, O_CREAT | O_RDWR, S_IRWXU);
2559
2560 if (fd != -1) {
2561 off_t rv = ::lseek(fd, size-2, SEEK_SET);
2562 if (rv != (off_t)-1) {
2563 if (::write(fd, "", 1) == 1) {
2564 mmap(base, size,
2565 PROT_READ|PROT_WRITE|PROT_EXEC,
2566 MAP_PRIVATE|MAP_FIXED|MAP_NORESERVE, fd, 0);
2567 }
2568 }
2569 ::close(fd);
2570 unlink(buf);
2571 }
2572 }
2573
2574 static bool recoverable_mmap_error(int err) {
2575 // See if the error is one we can let the caller handle. This
2576 // list of errno values comes from JBS-6843484. I can't find a
2577 // Linux man page that documents this specific set of errno
2578 // values so while this list currently matches Solaris, it may
2579 // change as we gain experience with this failure mode.
2580 switch (err) {
2581 case EBADF:
2582 case EINVAL:
2583 case ENOTSUP:
2584 // let the caller deal with these errors
2585 return true;
2586
2587 default:
2588 // Any remaining errors on this OS can cause our reserved mapping
2589 // to be lost. That can cause confusion where different data
2590 // structures think they have the same memory mapped. The worst
2591 // scenario is if both the VM and a library think they have the
2592 // same memory mapped.
2593 return false;
2594 }
2595 }
2596
2597 static void warn_fail_commit_memory(char* addr, size_t size, bool exec,
2598 int err) {
2599 warning("INFO: os::commit_memory(" PTR_FORMAT ", " SIZE_FORMAT
2600 ", %d) failed; error='%s' (errno=%d)", p2i(addr), size, exec,
2601 os::strerror(err), err);
2602 }
2603
2604 static void warn_fail_commit_memory(char* addr, size_t size,
2605 size_t alignment_hint, bool exec,
2606 int err) {
2607 warning("INFO: os::commit_memory(" PTR_FORMAT ", " SIZE_FORMAT
2608 ", " SIZE_FORMAT ", %d) failed; error='%s' (errno=%d)", p2i(addr), size,
2609 alignment_hint, exec, os::strerror(err), err);
2610 }
2611
2612 // NOTE: Linux kernel does not really reserve the pages for us.
2613 // All it does is to check if there are enough free pages
2614 // left at the time of mmap(). This could be a potential
2615 // problem.
2616 int os::Linux::commit_memory_impl(char* addr, size_t size, bool exec) {
2617 int prot = exec ? PROT_READ|PROT_WRITE|PROT_EXEC : PROT_READ|PROT_WRITE;
2618 uintptr_t res = (uintptr_t) ::mmap(addr, size, prot,
2619 MAP_PRIVATE|MAP_FIXED|MAP_ANONYMOUS, -1, 0);
2620 if (res != (uintptr_t) MAP_FAILED) {
2621 if (UseNUMAInterleaving) {
2622 numa_make_global(addr, size);
2623 }
2624 return 0;
2625 }
2626
2627 int err = errno; // save errno from mmap() call above
2628
2629 if (!recoverable_mmap_error(err)) {
2630 warn_fail_commit_memory(addr, size, exec, err);
2631 vm_exit_out_of_memory(size, OOM_MMAP_ERROR, "committing reserved memory.");
2632 }
2633
2634 return err;
2635 }
2636
2637 bool os::pd_commit_memory(char* addr, size_t size, bool exec) {
2638 return os::Linux::commit_memory_impl(addr, size, exec) == 0;
2639 }
2640
2641 void os::pd_commit_memory_or_exit(char* addr, size_t size, bool exec,
2642 const char* mesg) {
2643 assert(mesg != NULL, "mesg must be specified");
2644 int err = os::Linux::commit_memory_impl(addr, size, exec);
2645 if (err != 0) {
2646 // the caller wants all commit errors to exit with the specified mesg:
2647 warn_fail_commit_memory(addr, size, exec, err);
2648 vm_exit_out_of_memory(size, OOM_MMAP_ERROR, "%s", mesg);
2649 }
2650 }
2651
2652 // Define MAP_HUGETLB here so we can build HotSpot on old systems.
2653 #ifndef MAP_HUGETLB
2654 #define MAP_HUGETLB 0x40000
2655 #endif
2656
2657 // Define MADV_HUGEPAGE here so we can build HotSpot on old systems.
2658 #ifndef MADV_HUGEPAGE
2659 #define MADV_HUGEPAGE 14
2660 #endif
2661
2662 int os::Linux::commit_memory_impl(char* addr, size_t size,
2663 size_t alignment_hint, bool exec) {
2664 int err = os::Linux::commit_memory_impl(addr, size, exec);
2665 if (err == 0) {
2666 realign_memory(addr, size, alignment_hint);
2667 }
2668 return err;
2669 }
2670
2671 bool os::pd_commit_memory(char* addr, size_t size, size_t alignment_hint,
2672 bool exec) {
2673 return os::Linux::commit_memory_impl(addr, size, alignment_hint, exec) == 0;
2674 }
2675
2676 void os::pd_commit_memory_or_exit(char* addr, size_t size,
2677 size_t alignment_hint, bool exec,
2678 const char* mesg) {
2679 assert(mesg != NULL, "mesg must be specified");
2680 int err = os::Linux::commit_memory_impl(addr, size, alignment_hint, exec);
2681 if (err != 0) {
2682 // the caller wants all commit errors to exit with the specified mesg:
2683 warn_fail_commit_memory(addr, size, alignment_hint, exec, err);
2684 vm_exit_out_of_memory(size, OOM_MMAP_ERROR, "%s", mesg);
2685 }
2686 }
2687
2688 void os::pd_realign_memory(char *addr, size_t bytes, size_t alignment_hint) {
2689 if (UseTransparentHugePages && alignment_hint > (size_t)vm_page_size()) {
2690 // We don't check the return value: madvise(MADV_HUGEPAGE) may not
2691 // be supported or the memory may already be backed by huge pages.
2692 ::madvise(addr, bytes, MADV_HUGEPAGE);
2693 }
2694 }
2695
2696 void os::pd_free_memory(char *addr, size_t bytes, size_t alignment_hint) {
2697 // This method works by doing an mmap over an existing mmaping and effectively discarding
2698 // the existing pages. However it won't work for SHM-based large pages that cannot be
2699 // uncommitted at all. We don't do anything in this case to avoid creating a segment with
2700 // small pages on top of the SHM segment. This method always works for small pages, so we
2701 // allow that in any case.
2702 if (alignment_hint <= (size_t)os::vm_page_size() || can_commit_large_page_memory()) {
2703 commit_memory(addr, bytes, alignment_hint, !ExecMem);
2704 }
2705 }
2706
2707 void os::numa_make_global(char *addr, size_t bytes) {
2708 Linux::numa_interleave_memory(addr, bytes);
2709 }
2710
2711 // Define for numa_set_bind_policy(int). Setting the argument to 0 will set the
2712 // bind policy to MPOL_PREFERRED for the current thread.
2713 #define USE_MPOL_PREFERRED 0
2714
2715 void os::numa_make_local(char *addr, size_t bytes, int lgrp_hint) {
2716 // To make NUMA and large pages more robust when both enabled, we need to ease
2717 // the requirements on where the memory should be allocated. MPOL_BIND is the
2718 // default policy and it will force memory to be allocated on the specified
2719 // node. Changing this to MPOL_PREFERRED will prefer to allocate the memory on
2720 // the specified node, but will not force it. Using this policy will prevent
2721 // getting SIGBUS when trying to allocate large pages on NUMA nodes with no
2722 // free large pages.
2723 Linux::numa_set_bind_policy(USE_MPOL_PREFERRED);
2724 Linux::numa_tonode_memory(addr, bytes, lgrp_hint);
2725 }
2726
2727 bool os::numa_topology_changed() { return false; }
2728
2729 size_t os::numa_get_groups_num() {
2730 int max_node = Linux::numa_max_node();
2731 return max_node > 0 ? max_node + 1 : 1;
2732 }
2733
2734 int os::numa_get_group_id() {
2735 int cpu_id = Linux::sched_getcpu();
2736 if (cpu_id != -1) {
2737 int lgrp_id = Linux::get_node_by_cpu(cpu_id);
2738 if (lgrp_id != -1) {
2739 return lgrp_id;
2740 }
2741 }
2742 return 0;
2743 }
2744
2745 size_t os::numa_get_leaf_groups(int *ids, size_t size) {
2746 for (size_t i = 0; i < size; i++) {
2747 ids[i] = i;
2748 }
2749 return size;
2750 }
2751
2752 bool os::get_page_info(char *start, page_info* info) {
2753 return false;
2754 }
2755
2756 char *os::scan_pages(char *start, char* end, page_info* page_expected,
2757 page_info* page_found) {
2758 return end;
2759 }
2760
2761
2762 int os::Linux::sched_getcpu_syscall(void) {
2763 unsigned int cpu = 0;
2764 int retval = -1;
2765
2766 #if defined(IA32)
2767 #ifndef SYS_getcpu
2768 #define SYS_getcpu 318
2769 #endif
2770 retval = syscall(SYS_getcpu, &cpu, NULL, NULL);
2771 #elif defined(AMD64)
2772 // Unfortunately we have to bring all these macros here from vsyscall.h
2773 // to be able to compile on old linuxes.
2774 #define __NR_vgetcpu 2
2775 #define VSYSCALL_START (-10UL << 20)
2776 #define VSYSCALL_SIZE 1024
2777 #define VSYSCALL_ADDR(vsyscall_nr) (VSYSCALL_START+VSYSCALL_SIZE*(vsyscall_nr))
2778 typedef long (*vgetcpu_t)(unsigned int *cpu, unsigned int *node, unsigned long *tcache);
2779 vgetcpu_t vgetcpu = (vgetcpu_t)VSYSCALL_ADDR(__NR_vgetcpu);
2780 retval = vgetcpu(&cpu, NULL, NULL);
2781 #endif
2782
2783 return (retval == -1) ? retval : cpu;
2784 }
2785
2786 // Something to do with the numa-aware allocator needs these symbols
2787 extern "C" JNIEXPORT void numa_warn(int number, char *where, ...) { }
2788 extern "C" JNIEXPORT void numa_error(char *where) { }
2789
2790
2791 // If we are running with libnuma version > 2, then we should
2792 // be trying to use symbols with versions 1.1
2793 // If we are running with earlier version, which did not have symbol versions,
2794 // we should use the base version.
2795 void* os::Linux::libnuma_dlsym(void* handle, const char *name) {
2796 void *f = dlvsym(handle, name, "libnuma_1.1");
2797 if (f == NULL) {
2798 f = dlsym(handle, name);
2799 }
2800 return f;
2801 }
2802
2803 bool os::Linux::libnuma_init() {
2804 // sched_getcpu() should be in libc.
2805 set_sched_getcpu(CAST_TO_FN_PTR(sched_getcpu_func_t,
2806 dlsym(RTLD_DEFAULT, "sched_getcpu")));
2807
2808 // If it's not, try a direct syscall.
2809 if (sched_getcpu() == -1) {
2810 set_sched_getcpu(CAST_TO_FN_PTR(sched_getcpu_func_t,
2811 (void*)&sched_getcpu_syscall));
2812 }
2813
2814 if (sched_getcpu() != -1) { // Does it work?
2815 void *handle = dlopen("libnuma.so.1", RTLD_LAZY);
2816 if (handle != NULL) {
2817 set_numa_node_to_cpus(CAST_TO_FN_PTR(numa_node_to_cpus_func_t,
2818 libnuma_dlsym(handle, "numa_node_to_cpus")));
2819 set_numa_max_node(CAST_TO_FN_PTR(numa_max_node_func_t,
2820 libnuma_dlsym(handle, "numa_max_node")));
2821 set_numa_available(CAST_TO_FN_PTR(numa_available_func_t,
2822 libnuma_dlsym(handle, "numa_available")));
2823 set_numa_tonode_memory(CAST_TO_FN_PTR(numa_tonode_memory_func_t,
2824 libnuma_dlsym(handle, "numa_tonode_memory")));
2825 set_numa_interleave_memory(CAST_TO_FN_PTR(numa_interleave_memory_func_t,
2826 libnuma_dlsym(handle, "numa_interleave_memory")));
2827 set_numa_set_bind_policy(CAST_TO_FN_PTR(numa_set_bind_policy_func_t,
2828 libnuma_dlsym(handle, "numa_set_bind_policy")));
2829
2830
2831 if (numa_available() != -1) {
2832 set_numa_all_nodes((unsigned long*)libnuma_dlsym(handle, "numa_all_nodes"));
2833 // Create a cpu -> node mapping
2834 _cpu_to_node = new (ResourceObj::C_HEAP, mtInternal) GrowableArray<int>(0, true);
2835 rebuild_cpu_to_node_map();
2836 return true;
2837 }
2838 }
2839 }
2840 return false;
2841 }
2842
2843 // rebuild_cpu_to_node_map() constructs a table mapping cpud id to node id.
2844 // The table is later used in get_node_by_cpu().
2845 void os::Linux::rebuild_cpu_to_node_map() {
2846 const size_t NCPUS = 32768; // Since the buffer size computation is very obscure
2847 // in libnuma (possible values are starting from 16,
2848 // and continuing up with every other power of 2, but less
2849 // than the maximum number of CPUs supported by kernel), and
2850 // is a subject to change (in libnuma version 2 the requirements
2851 // are more reasonable) we'll just hardcode the number they use
2852 // in the library.
2853 const size_t BitsPerCLong = sizeof(long) * CHAR_BIT;
2854
2855 size_t cpu_num = processor_count();
2856 size_t cpu_map_size = NCPUS / BitsPerCLong;
2857 size_t cpu_map_valid_size =
2858 MIN2((cpu_num + BitsPerCLong - 1) / BitsPerCLong, cpu_map_size);
2859
2860 cpu_to_node()->clear();
2861 cpu_to_node()->at_grow(cpu_num - 1);
2862 size_t node_num = numa_get_groups_num();
2863
2864 unsigned long *cpu_map = NEW_C_HEAP_ARRAY(unsigned long, cpu_map_size, mtInternal);
2865 for (size_t i = 0; i < node_num; i++) {
2866 if (numa_node_to_cpus(i, cpu_map, cpu_map_size * sizeof(unsigned long)) != -1) {
2867 for (size_t j = 0; j < cpu_map_valid_size; j++) {
2868 if (cpu_map[j] != 0) {
2869 for (size_t k = 0; k < BitsPerCLong; k++) {
2870 if (cpu_map[j] & (1UL << k)) {
2871 cpu_to_node()->at_put(j * BitsPerCLong + k, i);
2872 }
2873 }
2874 }
2875 }
2876 }
2877 }
2878 FREE_C_HEAP_ARRAY(unsigned long, cpu_map);
2879 }
2880
2881 int os::Linux::get_node_by_cpu(int cpu_id) {
2882 if (cpu_to_node() != NULL && cpu_id >= 0 && cpu_id < cpu_to_node()->length()) {
2883 return cpu_to_node()->at(cpu_id);
2884 }
2885 return -1;
2886 }
2887
2888 GrowableArray<int>* os::Linux::_cpu_to_node;
2889 os::Linux::sched_getcpu_func_t os::Linux::_sched_getcpu;
2890 os::Linux::numa_node_to_cpus_func_t os::Linux::_numa_node_to_cpus;
2891 os::Linux::numa_max_node_func_t os::Linux::_numa_max_node;
2892 os::Linux::numa_available_func_t os::Linux::_numa_available;
2893 os::Linux::numa_tonode_memory_func_t os::Linux::_numa_tonode_memory;
2894 os::Linux::numa_interleave_memory_func_t os::Linux::_numa_interleave_memory;
2895 os::Linux::numa_set_bind_policy_func_t os::Linux::_numa_set_bind_policy;
2896 unsigned long* os::Linux::_numa_all_nodes;
2897
2898 bool os::pd_uncommit_memory(char* addr, size_t size) {
2899 uintptr_t res = (uintptr_t) ::mmap(addr, size, PROT_NONE,
2900 MAP_PRIVATE|MAP_FIXED|MAP_NORESERVE|MAP_ANONYMOUS, -1, 0);
2901 return res != (uintptr_t) MAP_FAILED;
2902 }
2903
2904 static address get_stack_commited_bottom(address bottom, size_t size) {
2905 address nbot = bottom;
2906 address ntop = bottom + size;
2907
2908 size_t page_sz = os::vm_page_size();
2909 unsigned pages = size / page_sz;
2910
2911 unsigned char vec[1];
2912 unsigned imin = 1, imax = pages + 1, imid;
2913 int mincore_return_value = 0;
2914
2915 assert(imin <= imax, "Unexpected page size");
2916
2917 while (imin < imax) {
2918 imid = (imax + imin) / 2;
2919 nbot = ntop - (imid * page_sz);
2920
2921 // Use a trick with mincore to check whether the page is mapped or not.
2922 // mincore sets vec to 1 if page resides in memory and to 0 if page
2923 // is swapped output but if page we are asking for is unmapped
2924 // it returns -1,ENOMEM
2925 mincore_return_value = mincore(nbot, page_sz, vec);
2926
2927 if (mincore_return_value == -1) {
2928 // Page is not mapped go up
2929 // to find first mapped page
2930 if (errno != EAGAIN) {
2931 assert(errno == ENOMEM, "Unexpected mincore errno");
2932 imax = imid;
2933 }
2934 } else {
2935 // Page is mapped go down
2936 // to find first not mapped page
2937 imin = imid + 1;
2938 }
2939 }
2940
2941 nbot = nbot + page_sz;
2942
2943 // Adjust stack bottom one page up if last checked page is not mapped
2944 if (mincore_return_value == -1) {
2945 nbot = nbot + page_sz;
2946 }
2947
2948 return nbot;
2949 }
2950
2951
2952 // Linux uses a growable mapping for the stack, and if the mapping for
2953 // the stack guard pages is not removed when we detach a thread the
2954 // stack cannot grow beyond the pages where the stack guard was
2955 // mapped. If at some point later in the process the stack expands to
2956 // that point, the Linux kernel cannot expand the stack any further
2957 // because the guard pages are in the way, and a segfault occurs.
2958 //
2959 // However, it's essential not to split the stack region by unmapping
2960 // a region (leaving a hole) that's already part of the stack mapping,
2961 // so if the stack mapping has already grown beyond the guard pages at
2962 // the time we create them, we have to truncate the stack mapping.
2963 // So, we need to know the extent of the stack mapping when
2964 // create_stack_guard_pages() is called.
2965
2966 // We only need this for stacks that are growable: at the time of
2967 // writing thread stacks don't use growable mappings (i.e. those
2968 // creeated with MAP_GROWSDOWN), and aren't marked "[stack]", so this
2969 // only applies to the main thread.
2970
2971 // If the (growable) stack mapping already extends beyond the point
2972 // where we're going to put our guard pages, truncate the mapping at
2973 // that point by munmap()ping it. This ensures that when we later
2974 // munmap() the guard pages we don't leave a hole in the stack
2975 // mapping. This only affects the main/initial thread
2976
2977 bool os::pd_create_stack_guard_pages(char* addr, size_t size) {
2978 if (os::Linux::is_initial_thread()) {
2979 // As we manually grow stack up to bottom inside create_attached_thread(),
2980 // it's likely that os::Linux::initial_thread_stack_bottom is mapped and
2981 // we don't need to do anything special.
2982 // Check it first, before calling heavy function.
2983 uintptr_t stack_extent = (uintptr_t) os::Linux::initial_thread_stack_bottom();
2984 unsigned char vec[1];
2985
2986 if (mincore((address)stack_extent, os::vm_page_size(), vec) == -1) {
2987 // Fallback to slow path on all errors, including EAGAIN
2988 stack_extent = (uintptr_t) get_stack_commited_bottom(
2989 os::Linux::initial_thread_stack_bottom(),
2990 (size_t)addr - stack_extent);
2991 }
2992
2993 if (stack_extent < (uintptr_t)addr) {
2994 ::munmap((void*)stack_extent, (uintptr_t)(addr - stack_extent));
2995 }
2996 }
2997
2998 return os::commit_memory(addr, size, !ExecMem);
2999 }
3000
3001 // If this is a growable mapping, remove the guard pages entirely by
3002 // munmap()ping them. If not, just call uncommit_memory(). This only
3003 // affects the main/initial thread, but guard against future OS changes
3004 // It's safe to always unmap guard pages for initial thread because we
3005 // always place it right after end of the mapped region
3006
3007 bool os::remove_stack_guard_pages(char* addr, size_t size) {
3008 uintptr_t stack_extent, stack_base;
3009
3010 if (os::Linux::is_initial_thread()) {
3011 return ::munmap(addr, size) == 0;
3012 }
3013
3014 return os::uncommit_memory(addr, size);
3015 }
3016
3017 // If 'fixed' is true, anon_mmap() will attempt to reserve anonymous memory
3018 // at 'requested_addr'. If there are existing memory mappings at the same
3019 // location, however, they will be overwritten. If 'fixed' is false,
3020 // 'requested_addr' is only treated as a hint, the return value may or
3021 // may not start from the requested address. Unlike Linux mmap(), this
3022 // function returns NULL to indicate failure.
3023 static char* anon_mmap(char* requested_addr, size_t bytes, bool fixed) {
3024 char * addr;
3025 int flags;
3026
3027 flags = MAP_PRIVATE | MAP_NORESERVE | MAP_ANONYMOUS;
3028 if (fixed) {
3029 assert((uintptr_t)requested_addr % os::Linux::page_size() == 0, "unaligned address");
3030 flags |= MAP_FIXED;
3031 }
3032
3033 // Map reserved/uncommitted pages PROT_NONE so we fail early if we
3034 // touch an uncommitted page. Otherwise, the read/write might
3035 // succeed if we have enough swap space to back the physical page.
3036 addr = (char*)::mmap(requested_addr, bytes, PROT_NONE,
3037 flags, -1, 0);
3038
3039 return addr == MAP_FAILED ? NULL : addr;
3040 }
3041
3042 // Allocate (using mmap, NO_RESERVE, with small pages) at either a given request address
3043 // (req_addr != NULL) or with a given alignment.
3044 // - bytes shall be a multiple of alignment.
3045 // - req_addr can be NULL. If not NULL, it must be a multiple of alignment.
3046 // - alignment sets the alignment at which memory shall be allocated.
3047 // It must be a multiple of allocation granularity.
3048 // Returns address of memory or NULL. If req_addr was not NULL, will only return
3049 // req_addr or NULL.
3050 static char* anon_mmap_aligned(size_t bytes, size_t alignment, char* req_addr) {
3051
3052 size_t extra_size = bytes;
3053 if (req_addr == NULL && alignment > 0) {
3054 extra_size += alignment;
3055 }
3056
3057 char* start = (char*) ::mmap(req_addr, extra_size, PROT_NONE,
3058 MAP_PRIVATE|MAP_ANONYMOUS|MAP_NORESERVE,
3059 -1, 0);
3060 if (start == MAP_FAILED) {
3061 start = NULL;
3062 } else {
3063 if (req_addr != NULL) {
3064 if (start != req_addr) {
3065 ::munmap(start, extra_size);
3066 start = NULL;
3067 }
3068 } else {
3069 char* const start_aligned = (char*) align_ptr_up(start, alignment);
3070 char* const end_aligned = start_aligned + bytes;
3071 char* const end = start + extra_size;
3072 if (start_aligned > start) {
3073 ::munmap(start, start_aligned - start);
3074 }
3075 if (end_aligned < end) {
3076 ::munmap(end_aligned, end - end_aligned);
3077 }
3078 start = start_aligned;
3079 }
3080 }
3081 return start;
3082 }
3083
3084 static int anon_munmap(char * addr, size_t size) {
3085 return ::munmap(addr, size) == 0;
3086 }
3087
3088 char* os::pd_reserve_memory(size_t bytes, char* requested_addr,
3089 size_t alignment_hint, int file_desc) {
3090 if (file_desc != -1) {
3091 return map_memory_to_file(requested_addr, bytes, file_desc);
3092 }
3093 return anon_mmap(requested_addr, bytes, (requested_addr != NULL));
3094 }
3095
3096 bool os::pd_release_memory(char* addr, size_t size) {
3097 return anon_munmap(addr, size);
3098 }
3099
3100 static bool linux_mprotect(char* addr, size_t size, int prot) {
3101 // Linux wants the mprotect address argument to be page aligned.
3102 char* bottom = (char*)align_size_down((intptr_t)addr, os::Linux::page_size());
3103
3104 // According to SUSv3, mprotect() should only be used with mappings
3105 // established by mmap(), and mmap() always maps whole pages. Unaligned
3106 // 'addr' likely indicates problem in the VM (e.g. trying to change
3107 // protection of malloc'ed or statically allocated memory). Check the
3108 // caller if you hit this assert.
3109 assert(addr == bottom, "sanity check");
3110
3111 size = align_size_up(pointer_delta(addr, bottom, 1) + size, os::Linux::page_size());
3112 return ::mprotect(bottom, size, prot) == 0;
3113 }
3114
3115 // Set protections specified
3116 bool os::protect_memory(char* addr, size_t bytes, ProtType prot,
3117 bool is_committed) {
3118 unsigned int p = 0;
3119 switch (prot) {
3120 case MEM_PROT_NONE: p = PROT_NONE; break;
3121 case MEM_PROT_READ: p = PROT_READ; break;
3122 case MEM_PROT_RW: p = PROT_READ|PROT_WRITE; break;
3123 case MEM_PROT_RWX: p = PROT_READ|PROT_WRITE|PROT_EXEC; break;
3124 default:
3125 ShouldNotReachHere();
3126 }
3127 // is_committed is unused.
3128 return linux_mprotect(addr, bytes, p);
3129 }
3130
3131 bool os::guard_memory(char* addr, size_t size) {
3132 return linux_mprotect(addr, size, PROT_NONE);
3133 }
3134
3135 bool os::unguard_memory(char* addr, size_t size) {
3136 return linux_mprotect(addr, size, PROT_READ|PROT_WRITE);
3137 }
3138
3139 bool os::Linux::transparent_huge_pages_sanity_check(bool warn,
3140 size_t page_size) {
3141 bool result = false;
3142 void *p = mmap(NULL, page_size * 2, PROT_READ|PROT_WRITE,
3143 MAP_ANONYMOUS|MAP_PRIVATE,
3144 -1, 0);
3145 if (p != MAP_FAILED) {
3146 void *aligned_p = align_ptr_up(p, page_size);
3147
3148 result = madvise(aligned_p, page_size, MADV_HUGEPAGE) == 0;
3149
3150 munmap(p, page_size * 2);
3151 }
3152
3153 if (warn && !result) {
3154 warning("TransparentHugePages is not supported by the operating system.");
3155 }
3156
3157 return result;
3158 }
3159
3160 bool os::Linux::hugetlbfs_sanity_check(bool warn, size_t page_size) {
3161 bool result = false;
3162 void *p = mmap(NULL, page_size, PROT_READ|PROT_WRITE,
3163 MAP_ANONYMOUS|MAP_PRIVATE|MAP_HUGETLB,
3164 -1, 0);
3165
3166 if (p != MAP_FAILED) {
3167 // We don't know if this really is a huge page or not.
3168 FILE *fp = fopen("/proc/self/maps", "r");
3169 if (fp) {
3170 while (!feof(fp)) {
3171 char chars[257];
3172 long x = 0;
3173 if (fgets(chars, sizeof(chars), fp)) {
3174 if (sscanf(chars, "%lx-%*x", &x) == 1
3175 && x == (long)p) {
3176 if (strstr (chars, "hugepage")) {
3177 result = true;
3178 break;
3179 }
3180 }
3181 }
3182 }
3183 fclose(fp);
3184 }
3185 munmap(p, page_size);
3186 }
3187
3188 if (warn && !result) {
3189 warning("HugeTLBFS is not supported by the operating system.");
3190 }
3191
3192 return result;
3193 }
3194
3195 // Set the coredump_filter bits to include largepages in core dump (bit 6)
3196 //
3197 // From the coredump_filter documentation:
3198 //
3199 // - (bit 0) anonymous private memory
3200 // - (bit 1) anonymous shared memory
3201 // - (bit 2) file-backed private memory
3202 // - (bit 3) file-backed shared memory
3203 // - (bit 4) ELF header pages in file-backed private memory areas (it is
3204 // effective only if the bit 2 is cleared)
3205 // - (bit 5) hugetlb private memory
3206 // - (bit 6) hugetlb shared memory
3207 //
3208 static void set_coredump_filter(void) {
3209 FILE *f;
3210 long cdm;
3211
3212 if ((f = fopen("/proc/self/coredump_filter", "r+")) == NULL) {
3213 return;
3214 }
3215
3216 if (fscanf(f, "%lx", &cdm) != 1) {
3217 fclose(f);
3218 return;
3219 }
3220
3221 rewind(f);
3222
3223 if ((cdm & LARGEPAGES_BIT) == 0) {
3224 cdm |= LARGEPAGES_BIT;
3225 fprintf(f, "%#lx", cdm);
3226 }
3227
3228 fclose(f);
3229 }
3230
3231 // Large page support
3232
3233 static size_t _large_page_size = 0;
3234
3235 size_t os::Linux::find_large_page_size() {
3236 size_t large_page_size = 0;
3237
3238 // large_page_size on Linux is used to round up heap size. x86 uses either
3239 // 2M or 4M page, depending on whether PAE (Physical Address Extensions)
3240 // mode is enabled. AMD64/EM64T uses 2M page in 64bit mode. IA64 can use
3241 // page as large as 256M.
3242 //
3243 // Here we try to figure out page size by parsing /proc/meminfo and looking
3244 // for a line with the following format:
3245 // Hugepagesize: 2048 kB
3246 //
3247 // If we can't determine the value (e.g. /proc is not mounted, or the text
3248 // format has been changed), we'll use the largest page size supported by
3249 // the processor.
3250
3251 #ifndef ZERO
3252 large_page_size =
3253 AARCH64_ONLY(2 * M)
3254 AMD64_ONLY(2 * M)
3255 ARM32_ONLY(2 * M)
3256 IA32_ONLY(4 * M)
3257 IA64_ONLY(256 * M)
3258 PPC_ONLY(4 * M)
3259 S390_ONLY(1 * M)
3260 SPARC_ONLY(4 * M);
3261 #endif // ZERO
3262
3263 FILE *fp = fopen("/proc/meminfo", "r");
3264 if (fp) {
3265 while (!feof(fp)) {
3266 int x = 0;
3267 char buf[16];
3268 if (fscanf(fp, "Hugepagesize: %d", &x) == 1) {
3269 if (x && fgets(buf, sizeof(buf), fp) && strcmp(buf, " kB\n") == 0) {
3270 large_page_size = x * K;
3271 break;
3272 }
3273 } else {
3274 // skip to next line
3275 for (;;) {
3276 int ch = fgetc(fp);
3277 if (ch == EOF || ch == (int)'\n') break;
3278 }
3279 }
3280 }
3281 fclose(fp);
3282 }
3283
3284 if (!FLAG_IS_DEFAULT(LargePageSizeInBytes) && LargePageSizeInBytes != large_page_size) {
3285 warning("Setting LargePageSizeInBytes has no effect on this OS. Large page size is "
3286 SIZE_FORMAT "%s.", byte_size_in_proper_unit(large_page_size),
3287 proper_unit_for_byte_size(large_page_size));
3288 }
3289
3290 return large_page_size;
3291 }
3292
3293 size_t os::Linux::setup_large_page_size() {
3294 _large_page_size = Linux::find_large_page_size();
3295 const size_t default_page_size = (size_t)Linux::page_size();
3296 if (_large_page_size > default_page_size) {
3297 _page_sizes[0] = _large_page_size;
3298 _page_sizes[1] = default_page_size;
3299 _page_sizes[2] = 0;
3300 }
3301
3302 return _large_page_size;
3303 }
3304
3305 bool os::Linux::setup_large_page_type(size_t page_size) {
3306 if (FLAG_IS_DEFAULT(UseHugeTLBFS) &&
3307 FLAG_IS_DEFAULT(UseSHM) &&
3308 FLAG_IS_DEFAULT(UseTransparentHugePages)) {
3309
3310 // The type of large pages has not been specified by the user.
3311
3312 // Try UseHugeTLBFS and then UseSHM.
3313 UseHugeTLBFS = UseSHM = true;
3314
3315 // Don't try UseTransparentHugePages since there are known
3316 // performance issues with it turned on. This might change in the future.
3317 UseTransparentHugePages = false;
3318 }
3319
3320 if (UseTransparentHugePages) {
3321 bool warn_on_failure = !FLAG_IS_DEFAULT(UseTransparentHugePages);
3322 if (transparent_huge_pages_sanity_check(warn_on_failure, page_size)) {
3323 UseHugeTLBFS = false;
3324 UseSHM = false;
3325 return true;
3326 }
3327 UseTransparentHugePages = false;
3328 }
3329
3330 if (UseHugeTLBFS) {
3331 bool warn_on_failure = !FLAG_IS_DEFAULT(UseHugeTLBFS);
3332 if (hugetlbfs_sanity_check(warn_on_failure, page_size)) {
3333 UseSHM = false;
3334 return true;
3335 }
3336 UseHugeTLBFS = false;
3337 }
3338
3339 return UseSHM;
3340 }
3341
3342 void os::large_page_init() {
3343 if (!UseLargePages &&
3344 !UseTransparentHugePages &&
3345 !UseHugeTLBFS &&
3346 !UseSHM) {
3347 // Not using large pages.
3348 return;
3349 }
3350
3351 if (!FLAG_IS_DEFAULT(UseLargePages) && !UseLargePages) {
3352 // The user explicitly turned off large pages.
3353 // Ignore the rest of the large pages flags.
3354 UseTransparentHugePages = false;
3355 UseHugeTLBFS = false;
3356 UseSHM = false;
3357 return;
3358 }
3359
3360 size_t large_page_size = Linux::setup_large_page_size();
3361 UseLargePages = Linux::setup_large_page_type(large_page_size);
3362
3363 set_coredump_filter();
3364 }
3365
3366 #ifndef SHM_HUGETLB
3367 #define SHM_HUGETLB 04000
3368 #endif
3369
3370 #define shm_warning_format(format, ...) \
3371 do { \
3372 if (UseLargePages && \
3373 (!FLAG_IS_DEFAULT(UseLargePages) || \
3374 !FLAG_IS_DEFAULT(UseSHM) || \
3375 !FLAG_IS_DEFAULT(LargePageSizeInBytes))) { \
3376 warning(format, __VA_ARGS__); \
3377 } \
3378 } while (0)
3379
3380 #define shm_warning(str) shm_warning_format("%s", str)
3381
3382 #define shm_warning_with_errno(str) \
3383 do { \
3384 int err = errno; \
3385 shm_warning_format(str " (error = %d)", err); \
3386 } while (0)
3387
3388 static char* shmat_with_alignment(int shmid, size_t bytes, size_t alignment) {
3389 assert(is_size_aligned(bytes, alignment), "Must be divisible by the alignment");
3390
3391 if (!is_size_aligned(alignment, SHMLBA)) {
3392 assert(false, "Code below assumes that alignment is at least SHMLBA aligned");
3393 return NULL;
3394 }
3395
3396 // To ensure that we get 'alignment' aligned memory from shmat,
3397 // we pre-reserve aligned virtual memory and then attach to that.
3398
3399 char* pre_reserved_addr = anon_mmap_aligned(bytes, alignment, NULL);
3400 if (pre_reserved_addr == NULL) {
3401 // Couldn't pre-reserve aligned memory.
3402 shm_warning("Failed to pre-reserve aligned memory for shmat.");
3403 return NULL;
3404 }
3405
3406 // SHM_REMAP is needed to allow shmat to map over an existing mapping.
3407 char* addr = (char*)shmat(shmid, pre_reserved_addr, SHM_REMAP);
3408
3409 if ((intptr_t)addr == -1) {
3410 int err = errno;
3411 shm_warning_with_errno("Failed to attach shared memory.");
3412
3413 assert(err != EACCES, "Unexpected error");
3414 assert(err != EIDRM, "Unexpected error");
3415 assert(err != EINVAL, "Unexpected error");
3416
3417 // Since we don't know if the kernel unmapped the pre-reserved memory area
3418 // we can't unmap it, since that would potentially unmap memory that was
3419 // mapped from other threads.
3420 return NULL;
3421 }
3422
3423 return addr;
3424 }
3425
3426 static char* shmat_at_address(int shmid, char* req_addr) {
3427 if (!is_ptr_aligned(req_addr, SHMLBA)) {
3428 assert(false, "Requested address needs to be SHMLBA aligned");
3429 return NULL;
3430 }
3431
3432 char* addr = (char*)shmat(shmid, req_addr, 0);
3433
3434 if ((intptr_t)addr == -1) {
3435 shm_warning_with_errno("Failed to attach shared memory.");
3436 return NULL;
3437 }
3438
3439 return addr;
3440 }
3441
3442 static char* shmat_large_pages(int shmid, size_t bytes, size_t alignment, char* req_addr) {
3443 // If a req_addr has been provided, we assume that the caller has already aligned the address.
3444 if (req_addr != NULL) {
3445 assert(is_ptr_aligned(req_addr, os::large_page_size()), "Must be divisible by the large page size");
3446 assert(is_ptr_aligned(req_addr, alignment), "Must be divisible by given alignment");
3447 return shmat_at_address(shmid, req_addr);
3448 }
3449
3450 // Since shmid has been setup with SHM_HUGETLB, shmat will automatically
3451 // return large page size aligned memory addresses when req_addr == NULL.
3452 // However, if the alignment is larger than the large page size, we have
3453 // to manually ensure that the memory returned is 'alignment' aligned.
3454 if (alignment > os::large_page_size()) {
3455 assert(is_size_aligned(alignment, os::large_page_size()), "Must be divisible by the large page size");
3456 return shmat_with_alignment(shmid, bytes, alignment);
3457 } else {
3458 return shmat_at_address(shmid, NULL);
3459 }
3460 }
3461
3462 char* os::Linux::reserve_memory_special_shm(size_t bytes, size_t alignment,
3463 char* req_addr, bool exec) {
3464 // "exec" is passed in but not used. Creating the shared image for
3465 // the code cache doesn't have an SHM_X executable permission to check.
3466 assert(UseLargePages && UseSHM, "only for SHM large pages");
3467 assert(is_ptr_aligned(req_addr, os::large_page_size()), "Unaligned address");
3468 assert(is_ptr_aligned(req_addr, alignment), "Unaligned address");
3469
3470 if (!is_size_aligned(bytes, os::large_page_size())) {
3471 return NULL; // Fallback to small pages.
3472 }
3473
3474 // Create a large shared memory region to attach to based on size.
3475 // Currently, size is the total size of the heap.
3476 int shmid = shmget(IPC_PRIVATE, bytes, SHM_HUGETLB|IPC_CREAT|SHM_R|SHM_W);
3477 if (shmid == -1) {
3478 // Possible reasons for shmget failure:
3479 // 1. shmmax is too small for Java heap.
3480 // > check shmmax value: cat /proc/sys/kernel/shmmax
3481 // > increase shmmax value: echo "0xffffffff" > /proc/sys/kernel/shmmax
3482 // 2. not enough large page memory.
3483 // > check available large pages: cat /proc/meminfo
3484 // > increase amount of large pages:
3485 // echo new_value > /proc/sys/vm/nr_hugepages
3486 // Note 1: different Linux may use different name for this property,
3487 // e.g. on Redhat AS-3 it is "hugetlb_pool".
3488 // Note 2: it's possible there's enough physical memory available but
3489 // they are so fragmented after a long run that they can't
3490 // coalesce into large pages. Try to reserve large pages when
3491 // the system is still "fresh".
3492 shm_warning_with_errno("Failed to reserve shared memory.");
3493 return NULL;
3494 }
3495
3496 // Attach to the region.
3497 char* addr = shmat_large_pages(shmid, bytes, alignment, req_addr);
3498
3499 // Remove shmid. If shmat() is successful, the actual shared memory segment
3500 // will be deleted when it's detached by shmdt() or when the process
3501 // terminates. If shmat() is not successful this will remove the shared
3502 // segment immediately.
3503 shmctl(shmid, IPC_RMID, NULL);
3504
3505 return addr;
3506 }
3507
3508 static void warn_on_large_pages_failure(char* req_addr, size_t bytes,
3509 int error) {
3510 assert(error == ENOMEM, "Only expect to fail if no memory is available");
3511
3512 bool warn_on_failure = UseLargePages &&
3513 (!FLAG_IS_DEFAULT(UseLargePages) ||
3514 !FLAG_IS_DEFAULT(UseHugeTLBFS) ||
3515 !FLAG_IS_DEFAULT(LargePageSizeInBytes));
3516
3517 if (warn_on_failure) {
3518 char msg[128];
3519 jio_snprintf(msg, sizeof(msg), "Failed to reserve large pages memory req_addr: "
3520 PTR_FORMAT " bytes: " SIZE_FORMAT " (errno = %d).", req_addr, bytes, error);
3521 warning("%s", msg);
3522 }
3523 }
3524
3525 char* os::Linux::reserve_memory_special_huge_tlbfs_only(size_t bytes,
3526 char* req_addr,
3527 bool exec) {
3528 assert(UseLargePages && UseHugeTLBFS, "only for Huge TLBFS large pages");
3529 assert(is_size_aligned(bytes, os::large_page_size()), "Unaligned size");
3530 assert(is_ptr_aligned(req_addr, os::large_page_size()), "Unaligned address");
3531
3532 int prot = exec ? PROT_READ|PROT_WRITE|PROT_EXEC : PROT_READ|PROT_WRITE;
3533 char* addr = (char*)::mmap(req_addr, bytes, prot,
3534 MAP_PRIVATE|MAP_ANONYMOUS|MAP_HUGETLB,
3535 -1, 0);
3536
3537 if (addr == MAP_FAILED) {
3538 warn_on_large_pages_failure(req_addr, bytes, errno);
3539 return NULL;
3540 }
3541
3542 assert(is_ptr_aligned(addr, os::large_page_size()), "Must be");
3543
3544 return addr;
3545 }
3546
3547 // Helper function to create a temp file in the given directory.
3548 int os::create_file_for_heap(const char* dir, size_t size) {
3549
3550 const char name_template[] = "/jvmheap.XXXXXX";
3551
3552 char *fullname = (char*)alloca(strlen(dir) + sizeof(name_template));
3553 (void)strcpy(fullname, dir);
3554 (void)strcat(fullname, name_template);
3555
3556 sigset_t set, oldset;
3557 sigfillset(&set);
3558
3559 // block all signals while we do the file operation.
3560 (void)sigprocmask(SIG_BLOCK, &set, &oldset);
3561
3562 // set the file creation mask.
3563 mode_t new_mask = S_IRUSR | S_IWUSR;
3564 mode_t prev_umask = umask(new_mask);
3565
3566 // create a new file.
3567 int fd = mkstemp(fullname);
3568
3569 // reset the file creation mask.
3570 umask(prev_umask);
3571
3572 if (fd < 0) {
3573 warning("Failure to create file %s for heap", fullname);
3574 return -1;
3575 }
3576
3577 // delete the name from the filesystem. When 'fd' is closed, the file (and space) will be deleted.
3578 (void)unlink(fullname);
3579
3580 // reset the signal mask.
3581 (void)sigprocmask(SIG_SETMASK, &oldset, NULL);
3582
3583 return fd;
3584 }
3585
3586 // Map the given address range to the provided file descriptor.
3587 char* os::map_memory_to_file(char* base, size_t size, int fd) {
3588 assert(fd != -1, "File descriptor is not valid");
3589
3590 // allocate space for the file
3591 if ((errno = posix_fallocate(fd, 0, (off_t)size)) != 0) {
3592 vm_exit_during_initialization(err_msg("Error in mapping Java heap at the given filesystem directory"));
3593 return NULL;
3594 }
3595
3596 int prot = PROT_READ | PROT_WRITE;
3597 int flags = MAP_SHARED;
3598 if( base != NULL) {
3599 flags |= MAP_FIXED;
3600 }
3601 char* addr = (char*)mmap(base, size, prot, flags, fd, 0);
3602
3603 if (addr == MAP_FAILED || (base != NULL && addr != base)) {
3604 if (addr != MAP_FAILED) {
3605 if (!pd_release_memory(addr, size)) {
3606 warning("Could not release memory on unsuccessful file mapping");
3607 }
3608 }
3609 return NULL;
3610 }
3611
3612 return addr;
3613 }
3614
3615 // Reserve memory using mmap(MAP_HUGETLB).
3616 // - bytes shall be a multiple of alignment.
3617 // - req_addr can be NULL. If not NULL, it must be a multiple of alignment.
3618 // - alignment sets the alignment at which memory shall be allocated.
3619 // It must be a multiple of allocation granularity.
3620 // Returns address of memory or NULL. If req_addr was not NULL, will only return
3621 // req_addr or NULL.
3622 char* os::Linux::reserve_memory_special_huge_tlbfs_mixed(size_t bytes,
3623 size_t alignment,
3624 char* req_addr,
3625 bool exec) {
3626 size_t large_page_size = os::large_page_size();
3627 assert(bytes >= large_page_size, "Shouldn't allocate large pages for small sizes");
3628
3629 assert(is_ptr_aligned(req_addr, alignment), "Must be");
3630 assert(is_size_aligned(bytes, alignment), "Must be");
3631
3632 // First reserve - but not commit - the address range in small pages.
3633 char* const start = anon_mmap_aligned(bytes, alignment, req_addr);
3634
3635 if (start == NULL) {
3636 return NULL;
3637 }
3638
3639 assert(is_ptr_aligned(start, alignment), "Must be");
3640
3641 char* end = start + bytes;
3642
3643 // Find the regions of the allocated chunk that can be promoted to large pages.
3644 char* lp_start = (char*)align_ptr_up(start, large_page_size);
3645 char* lp_end = (char*)align_ptr_down(end, large_page_size);
3646
3647 size_t lp_bytes = lp_end - lp_start;
3648
3649 assert(is_size_aligned(lp_bytes, large_page_size), "Must be");
3650
3651 if (lp_bytes == 0) {
3652 // The mapped region doesn't even span the start and the end of a large page.
3653 // Fall back to allocate a non-special area.
3654 ::munmap(start, end - start);
3655 return NULL;
3656 }
3657
3658 int prot = exec ? PROT_READ|PROT_WRITE|PROT_EXEC : PROT_READ|PROT_WRITE;
3659
3660 void* result;
3661
3662 // Commit small-paged leading area.
3663 if (start != lp_start) {
3664 result = ::mmap(start, lp_start - start, prot,
3665 MAP_PRIVATE|MAP_ANONYMOUS|MAP_FIXED,
3666 -1, 0);
3667 if (result == MAP_FAILED) {
3668 ::munmap(lp_start, end - lp_start);
3669 return NULL;
3670 }
3671 }
3672
3673 // Commit large-paged area.
3674 result = ::mmap(lp_start, lp_bytes, prot,
3675 MAP_PRIVATE|MAP_ANONYMOUS|MAP_FIXED|MAP_HUGETLB,
3676 -1, 0);
3677 if (result == MAP_FAILED) {
3678 warn_on_large_pages_failure(lp_start, lp_bytes, errno);
3679 // If the mmap above fails, the large pages region will be unmapped and we
3680 // have regions before and after with small pages. Release these regions.
3681 //
3682 // | mapped | unmapped | mapped |
3683 // ^ ^ ^ ^
3684 // start lp_start lp_end end
3685 //
3686 ::munmap(start, lp_start - start);
3687 ::munmap(lp_end, end - lp_end);
3688 return NULL;
3689 }
3690
3691 // Commit small-paged trailing area.
3692 if (lp_end != end) {
3693 result = ::mmap(lp_end, end - lp_end, prot,
3694 MAP_PRIVATE|MAP_ANONYMOUS|MAP_FIXED,
3695 -1, 0);
3696 if (result == MAP_FAILED) {
3697 ::munmap(start, lp_end - start);
3698 return NULL;
3699 }
3700 }
3701
3702 return start;
3703 }
3704
3705 char* os::Linux::reserve_memory_special_huge_tlbfs(size_t bytes,
3706 size_t alignment,
3707 char* req_addr,
3708 bool exec) {
3709 assert(UseLargePages && UseHugeTLBFS, "only for Huge TLBFS large pages");
3710 assert(is_ptr_aligned(req_addr, alignment), "Must be");
3711 assert(is_size_aligned(alignment, os::vm_allocation_granularity()), "Must be");
3712 assert(is_power_of_2(os::large_page_size()), "Must be");
3713 assert(bytes >= os::large_page_size(), "Shouldn't allocate large pages for small sizes");
3714
3715 if (is_size_aligned(bytes, os::large_page_size()) && alignment <= os::large_page_size()) {
3716 return reserve_memory_special_huge_tlbfs_only(bytes, req_addr, exec);
3717 } else {
3718 return reserve_memory_special_huge_tlbfs_mixed(bytes, alignment, req_addr, exec);
3719 }
3720 }
3721
3722 char* os::reserve_memory_special(size_t bytes, size_t alignment,
3723 char* req_addr, bool exec) {
3724 assert(UseLargePages, "only for large pages");
3725
3726 char* addr;
3727 if (UseSHM) {
3728 addr = os::Linux::reserve_memory_special_shm(bytes, alignment, req_addr, exec);
3729 } else {
3730 assert(UseHugeTLBFS, "must be");
3731 addr = os::Linux::reserve_memory_special_huge_tlbfs(bytes, alignment, req_addr, exec);
3732 }
3733
3734 if (addr != NULL) {
3735 if (UseNUMAInterleaving) {
3736 numa_make_global(addr, bytes);
3737 }
3738
3739 // The memory is committed
3740 MemTracker::record_virtual_memory_reserve_and_commit((address)addr, bytes, CALLER_PC);
3741 }
3742
3743 return addr;
3744 }
3745
3746 bool os::Linux::release_memory_special_shm(char* base, size_t bytes) {
3747 // detaching the SHM segment will also delete it, see reserve_memory_special_shm()
3748 return shmdt(base) == 0;
3749 }
3750
3751 bool os::Linux::release_memory_special_huge_tlbfs(char* base, size_t bytes) {
3752 return pd_release_memory(base, bytes);
3753 }
3754
3755 bool os::release_memory_special(char* base, size_t bytes) {
3756 bool res;
3757 if (MemTracker::tracking_level() > NMT_minimal) {
3758 Tracker tkr = MemTracker::get_virtual_memory_release_tracker();
3759 res = os::Linux::release_memory_special_impl(base, bytes);
3760 if (res) {
3761 tkr.record((address)base, bytes);
3762 }
3763
3764 } else {
3765 res = os::Linux::release_memory_special_impl(base, bytes);
3766 }
3767 return res;
3768 }
3769
3770 bool os::Linux::release_memory_special_impl(char* base, size_t bytes) {
3771 assert(UseLargePages, "only for large pages");
3772 bool res;
3773
3774 if (UseSHM) {
3775 res = os::Linux::release_memory_special_shm(base, bytes);
3776 } else {
3777 assert(UseHugeTLBFS, "must be");
3778 res = os::Linux::release_memory_special_huge_tlbfs(base, bytes);
3779 }
3780 return res;
3781 }
3782
3783 size_t os::large_page_size() {
3784 return _large_page_size;
3785 }
3786
3787 // With SysV SHM the entire memory region must be allocated as shared
3788 // memory.
3789 // HugeTLBFS allows application to commit large page memory on demand.
3790 // However, when committing memory with HugeTLBFS fails, the region
3791 // that was supposed to be committed will lose the old reservation
3792 // and allow other threads to steal that memory region. Because of this
3793 // behavior we can't commit HugeTLBFS memory.
3794 bool os::can_commit_large_page_memory() {
3795 return UseTransparentHugePages;
3796 }
3797
3798 bool os::can_execute_large_page_memory() {
3799 return UseTransparentHugePages || UseHugeTLBFS;
3800 }
3801
3802 // Reserve memory at an arbitrary address, only if that area is
3803 // available (and not reserved for something else).
3804
3805 char* os::pd_attempt_reserve_memory_at(size_t bytes, char* requested_addr, int file_desc) {
3806 const int max_tries = 10;
3807 char* base[max_tries];
3808 size_t size[max_tries];
3809 const size_t gap = 0x000000;
3810
3811 // Assert only that the size is a multiple of the page size, since
3812 // that's all that mmap requires, and since that's all we really know
3813 // about at this low abstraction level. If we need higher alignment,
3814 // we can either pass an alignment to this method or verify alignment
3815 // in one of the methods further up the call chain. See bug 5044738.
3816 assert(bytes % os::vm_page_size() == 0, "reserving unexpected size block");
3817
3818 // Repeatedly allocate blocks until the block is allocated at the
3819 // right spot.
3820
3821 // Linux mmap allows caller to pass an address as hint; give it a try first,
3822 // if kernel honors the hint then we can return immediately.
3823 char * addr = anon_mmap(requested_addr, bytes, false);
3824 if (addr == requested_addr) {
3825 if (file_desc == -1 || map_memory_to_file(requested_addr, bytes, file_desc) != NULL) {
3826 return requested_addr;
3827 }
3828 }
3829
3830 if (addr != NULL) {
3831 // mmap() is successful but it fails to reserve at the requested address
3832 anon_munmap(addr, bytes);
3833 }
3834
3835 int i;
3836 for (i = 0; i < max_tries; ++i) {
3837 base[i] = reserve_memory(bytes);
3838
3839 if (base[i] != NULL) {
3840 // Is this the block we wanted?
3841 if (base[i] == requested_addr) {
3842 size[i] = bytes;
3843 break;
3844 }
3845
3846 // Does this overlap the block we wanted? Give back the overlapped
3847 // parts and try again.
3848
3849 ptrdiff_t top_overlap = requested_addr + (bytes + gap) - base[i];
3850 if (top_overlap >= 0 && (size_t)top_overlap < bytes) {
3851 unmap_memory(base[i], top_overlap);
3852 base[i] += top_overlap;
3853 size[i] = bytes - top_overlap;
3854 } else {
3855 ptrdiff_t bottom_overlap = base[i] + bytes - requested_addr;
3856 if (bottom_overlap >= 0 && (size_t)bottom_overlap < bytes) {
3857 unmap_memory(requested_addr, bottom_overlap);
3858 size[i] = bytes - bottom_overlap;
3859 } else {
3860 size[i] = bytes;
3861 }
3862 }
3863 }
3864 }
3865
3866 // Give back the unused reserved pieces.
3867
3868 for (int j = 0; j < i; ++j) {
3869 if (base[j] != NULL) {
3870 unmap_memory(base[j], size[j]);
3871 }
3872 }
3873
3874 if (i < max_tries) {
3875 if (file_desc != -1 && map_memory_to_file(requested_addr, bytes, file_desc) == NULL) {
3876 vm_exit_during_initialization(err_msg("Error in mapping Java heap at the given filesystem directory"));
3877 }
3878 return requested_addr;
3879 } else {
3880 return NULL;
3881 }
3882 }
3883
3884 size_t os::read(int fd, void *buf, unsigned int nBytes) {
3885 return ::read(fd, buf, nBytes);
3886 }
3887
3888 size_t os::read_at(int fd, void *buf, unsigned int nBytes, jlong offset) {
3889 return ::pread(fd, buf, nBytes, offset);
3890 }
3891
3892 // Short sleep, direct OS call.
3893 //
3894 // Note: certain versions of Linux CFS scheduler (since 2.6.23) do not guarantee
3895 // sched_yield(2) will actually give up the CPU:
3896 //
3897 // * Alone on this pariticular CPU, keeps running.
3898 // * Before the introduction of "skip_buddy" with "compat_yield" disabled
3899 // (pre 2.6.39).
3900 //
3901 // So calling this with 0 is an alternative.
3902 //
3903 void os::naked_short_sleep(jlong ms) {
3904 struct timespec req;
3905
3906 assert(ms < 1000, "Un-interruptable sleep, short time use only");
3907 req.tv_sec = 0;
3908 if (ms > 0) {
3909 req.tv_nsec = (ms % 1000) * 1000000;
3910 } else {
3911 req.tv_nsec = 1;
3912 }
3913
3914 nanosleep(&req, NULL);
3915
3916 return;
3917 }
3918
3919 // Sleep forever; naked call to OS-specific sleep; use with CAUTION
3920 void os::infinite_sleep() {
3921 while (true) { // sleep forever ...
3922 ::sleep(100); // ... 100 seconds at a time
3923 }
3924 }
3925
3926 // Used to convert frequent JVM_Yield() to nops
3927 bool os::dont_yield() {
3928 return DontYieldALot;
3929 }
3930
3931 void os::naked_yield() {
3932 sched_yield();
3933 }
3934
3935 ////////////////////////////////////////////////////////////////////////////////
3936 // thread priority support
3937
3938 // Note: Normal Linux applications are run with SCHED_OTHER policy. SCHED_OTHER
3939 // only supports dynamic priority, static priority must be zero. For real-time
3940 // applications, Linux supports SCHED_RR which allows static priority (1-99).
3941 // However, for large multi-threaded applications, SCHED_RR is not only slower
3942 // than SCHED_OTHER, but also very unstable (my volano tests hang hard 4 out
3943 // of 5 runs - Sep 2005).
3944 //
3945 // The following code actually changes the niceness of kernel-thread/LWP. It
3946 // has an assumption that setpriority() only modifies one kernel-thread/LWP,
3947 // not the entire user process, and user level threads are 1:1 mapped to kernel
3948 // threads. It has always been the case, but could change in the future. For
3949 // this reason, the code should not be used as default (ThreadPriorityPolicy=0).
3950 // It is only used when ThreadPriorityPolicy=1 and requires root privilege.
3951
3952 int os::java_to_os_priority[CriticalPriority + 1] = {
3953 19, // 0 Entry should never be used
3954
3955 4, // 1 MinPriority
3956 3, // 2
3957 2, // 3
3958
3959 1, // 4
3960 0, // 5 NormPriority
3961 -1, // 6
3962
3963 -2, // 7
3964 -3, // 8
3965 -4, // 9 NearMaxPriority
3966
3967 -5, // 10 MaxPriority
3968
3969 -5 // 11 CriticalPriority
3970 };
3971
3972 static int prio_init() {
3973 if (ThreadPriorityPolicy == 1) {
3974 // Only root can raise thread priority. Don't allow ThreadPriorityPolicy=1
3975 // if effective uid is not root. Perhaps, a more elegant way of doing
3976 // this is to test CAP_SYS_NICE capability, but that will require libcap.so
3977 if (geteuid() != 0) {
3978 if (!FLAG_IS_DEFAULT(ThreadPriorityPolicy)) {
3979 warning("-XX:ThreadPriorityPolicy requires root privilege on Linux");
3980 }
3981 ThreadPriorityPolicy = 0;
3982 }
3983 }
3984 if (UseCriticalJavaThreadPriority) {
3985 os::java_to_os_priority[MaxPriority] = os::java_to_os_priority[CriticalPriority];
3986 }
3987 return 0;
3988 }
3989
3990 OSReturn os::set_native_priority(Thread* thread, int newpri) {
3991 if (!UseThreadPriorities || ThreadPriorityPolicy == 0) return OS_OK;
3992
3993 int ret = setpriority(PRIO_PROCESS, thread->osthread()->thread_id(), newpri);
3994 return (ret == 0) ? OS_OK : OS_ERR;
3995 }
3996
3997 OSReturn os::get_native_priority(const Thread* const thread,
3998 int *priority_ptr) {
3999 if (!UseThreadPriorities || ThreadPriorityPolicy == 0) {
4000 *priority_ptr = java_to_os_priority[NormPriority];
4001 return OS_OK;
4002 }
4003
4004 errno = 0;
4005 *priority_ptr = getpriority(PRIO_PROCESS, thread->osthread()->thread_id());
4006 return (*priority_ptr != -1 || errno == 0 ? OS_OK : OS_ERR);
4007 }
4008
4009 // Hint to the underlying OS that a task switch would not be good.
4010 // Void return because it's a hint and can fail.
4011 void os::hint_no_preempt() {}
4012
4013 ////////////////////////////////////////////////////////////////////////////////
4014 // suspend/resume support
4015
4016 // the low-level signal-based suspend/resume support is a remnant from the
4017 // old VM-suspension that used to be for java-suspension, safepoints etc,
4018 // within hotspot. Now there is a single use-case for this:
4019 // - calling get_thread_pc() on the VMThread by the flat-profiler task
4020 // that runs in the watcher thread.
4021 // The remaining code is greatly simplified from the more general suspension
4022 // code that used to be used.
4023 //
4024 // The protocol is quite simple:
4025 // - suspend:
4026 // - sends a signal to the target thread
4027 // - polls the suspend state of the osthread using a yield loop
4028 // - target thread signal handler (SR_handler) sets suspend state
4029 // and blocks in sigsuspend until continued
4030 // - resume:
4031 // - sets target osthread state to continue
4032 // - sends signal to end the sigsuspend loop in the SR_handler
4033 //
4034 // Note that the SR_lock plays no role in this suspend/resume protocol,
4035 // but is checked for NULL in SR_handler as a thread termination indicator.
4036
4037 static void resume_clear_context(OSThread *osthread) {
4038 osthread->set_ucontext(NULL);
4039 osthread->set_siginfo(NULL);
4040 }
4041
4042 static void suspend_save_context(OSThread *osthread, siginfo_t* siginfo,
4043 ucontext_t* context) {
4044 osthread->set_ucontext(context);
4045 osthread->set_siginfo(siginfo);
4046 }
4047
4048 // Handler function invoked when a thread's execution is suspended or
4049 // resumed. We have to be careful that only async-safe functions are
4050 // called here (Note: most pthread functions are not async safe and
4051 // should be avoided.)
4052 //
4053 // Note: sigwait() is a more natural fit than sigsuspend() from an
4054 // interface point of view, but sigwait() prevents the signal hander
4055 // from being run. libpthread would get very confused by not having
4056 // its signal handlers run and prevents sigwait()'s use with the
4057 // mutex granting granting signal.
4058 //
4059 // Currently only ever called on the VMThread and JavaThreads (PC sampling)
4060 //
4061 static void SR_handler(int sig, siginfo_t* siginfo, ucontext_t* context) {
4062 // Save and restore errno to avoid confusing native code with EINTR
4063 // after sigsuspend.
4064 int old_errno = errno;
4065
4066 Thread* thread = Thread::current_or_null_safe();
4067 assert(thread != NULL, "Missing current thread in SR_handler");
4068
4069 // On some systems we have seen signal delivery get "stuck" until the signal
4070 // mask is changed as part of thread termination. Check that the current thread
4071 // has not already terminated (via SR_lock()) - else the following assertion
4072 // will fail because the thread is no longer a JavaThread as the ~JavaThread
4073 // destructor has completed.
4074
4075 if (thread->SR_lock() == NULL) {
4076 return;
4077 }
4078
4079 assert(thread->is_VM_thread() || thread->is_Java_thread(), "Must be VMThread or JavaThread");
4080
4081 OSThread* osthread = thread->osthread();
4082
4083 os::SuspendResume::State current = osthread->sr.state();
4084 if (current == os::SuspendResume::SR_SUSPEND_REQUEST) {
4085 suspend_save_context(osthread, siginfo, context);
4086
4087 // attempt to switch the state, we assume we had a SUSPEND_REQUEST
4088 os::SuspendResume::State state = osthread->sr.suspended();
4089 if (state == os::SuspendResume::SR_SUSPENDED) {
4090 sigset_t suspend_set; // signals for sigsuspend()
4091 sigemptyset(&suspend_set);
4092 // get current set of blocked signals and unblock resume signal
4093 pthread_sigmask(SIG_BLOCK, NULL, &suspend_set);
4094 sigdelset(&suspend_set, SR_signum);
4095
4096 sr_semaphore.signal();
4097 // wait here until we are resumed
4098 while (1) {
4099 sigsuspend(&suspend_set);
4100
4101 os::SuspendResume::State result = osthread->sr.running();
4102 if (result == os::SuspendResume::SR_RUNNING) {
4103 sr_semaphore.signal();
4104 break;
4105 }
4106 }
4107
4108 } else if (state == os::SuspendResume::SR_RUNNING) {
4109 // request was cancelled, continue
4110 } else {
4111 ShouldNotReachHere();
4112 }
4113
4114 resume_clear_context(osthread);
4115 } else if (current == os::SuspendResume::SR_RUNNING) {
4116 // request was cancelled, continue
4117 } else if (current == os::SuspendResume::SR_WAKEUP_REQUEST) {
4118 // ignore
4119 } else {
4120 // ignore
4121 }
4122
4123 errno = old_errno;
4124 }
4125
4126 static int SR_initialize() {
4127 struct sigaction act;
4128 char *s;
4129
4130 // Get signal number to use for suspend/resume
4131 if ((s = ::getenv("_JAVA_SR_SIGNUM")) != 0) {
4132 int sig = ::strtol(s, 0, 10);
4133 if (sig > MAX2(SIGSEGV, SIGBUS) && // See 4355769.
4134 sig < NSIG) { // Must be legal signal and fit into sigflags[].
4135 SR_signum = sig;
4136 } else {
4137 warning("You set _JAVA_SR_SIGNUM=%d. It must be in range [%d, %d]. Using %d instead.",
4138 sig, MAX2(SIGSEGV, SIGBUS)+1, NSIG-1, SR_signum);
4139 }
4140 }
4141
4142 assert(SR_signum > SIGSEGV && SR_signum > SIGBUS,
4143 "SR_signum must be greater than max(SIGSEGV, SIGBUS), see 4355769");
4144
4145 sigemptyset(&SR_sigset);
4146 sigaddset(&SR_sigset, SR_signum);
4147
4148 // Set up signal handler for suspend/resume
4149 act.sa_flags = SA_RESTART|SA_SIGINFO;
4150 act.sa_handler = (void (*)(int)) SR_handler;
4151
4152 // SR_signum is blocked by default.
4153 // 4528190 - We also need to block pthread restart signal (32 on all
4154 // supported Linux platforms). Note that LinuxThreads need to block
4155 // this signal for all threads to work properly. So we don't have
4156 // to use hard-coded signal number when setting up the mask.
4157 pthread_sigmask(SIG_BLOCK, NULL, &act.sa_mask);
4158
4159 if (sigaction(SR_signum, &act, 0) == -1) {
4160 return -1;
4161 }
4162
4163 // Save signal flag
4164 os::Linux::set_our_sigflags(SR_signum, act.sa_flags);
4165 return 0;
4166 }
4167
4168 static int sr_notify(OSThread* osthread) {
4169 int status = pthread_kill(osthread->pthread_id(), SR_signum);
4170 assert_status(status == 0, status, "pthread_kill");
4171 return status;
4172 }
4173
4174 // "Randomly" selected value for how long we want to spin
4175 // before bailing out on suspending a thread, also how often
4176 // we send a signal to a thread we want to resume
4177 static const int RANDOMLY_LARGE_INTEGER = 1000000;
4178 static const int RANDOMLY_LARGE_INTEGER2 = 100;
4179
4180 // returns true on success and false on error - really an error is fatal
4181 // but this seems the normal response to library errors
4182 static bool do_suspend(OSThread* osthread) {
4183 assert(osthread->sr.is_running(), "thread should be running");
4184 assert(!sr_semaphore.trywait(), "semaphore has invalid state");
4185
4186 // mark as suspended and send signal
4187 if (osthread->sr.request_suspend() != os::SuspendResume::SR_SUSPEND_REQUEST) {
4188 // failed to switch, state wasn't running?
4189 ShouldNotReachHere();
4190 return false;
4191 }
4192
4193 if (sr_notify(osthread) != 0) {
4194 ShouldNotReachHere();
4195 }
4196
4197 // managed to send the signal and switch to SUSPEND_REQUEST, now wait for SUSPENDED
4198 while (true) {
4199 if (sr_semaphore.timedwait(0, 2 * NANOSECS_PER_MILLISEC)) {
4200 break;
4201 } else {
4202 // timeout
4203 os::SuspendResume::State cancelled = osthread->sr.cancel_suspend();
4204 if (cancelled == os::SuspendResume::SR_RUNNING) {
4205 return false;
4206 } else if (cancelled == os::SuspendResume::SR_SUSPENDED) {
4207 // make sure that we consume the signal on the semaphore as well
4208 sr_semaphore.wait();
4209 break;
4210 } else {
4211 ShouldNotReachHere();
4212 return false;
4213 }
4214 }
4215 }
4216
4217 guarantee(osthread->sr.is_suspended(), "Must be suspended");
4218 return true;
4219 }
4220
4221 static void do_resume(OSThread* osthread) {
4222 assert(osthread->sr.is_suspended(), "thread should be suspended");
4223 assert(!sr_semaphore.trywait(), "invalid semaphore state");
4224
4225 if (osthread->sr.request_wakeup() != os::SuspendResume::SR_WAKEUP_REQUEST) {
4226 // failed to switch to WAKEUP_REQUEST
4227 ShouldNotReachHere();
4228 return;
4229 }
4230
4231 while (true) {
4232 if (sr_notify(osthread) == 0) {
4233 if (sr_semaphore.timedwait(0, 2 * NANOSECS_PER_MILLISEC)) {
4234 if (osthread->sr.is_running()) {
4235 return;
4236 }
4237 }
4238 } else {
4239 ShouldNotReachHere();
4240 }
4241 }
4242
4243 guarantee(osthread->sr.is_running(), "Must be running!");
4244 }
4245
4246 ///////////////////////////////////////////////////////////////////////////////////
4247 // signal handling (except suspend/resume)
4248
4249 // This routine may be used by user applications as a "hook" to catch signals.
4250 // The user-defined signal handler must pass unrecognized signals to this
4251 // routine, and if it returns true (non-zero), then the signal handler must
4252 // return immediately. If the flag "abort_if_unrecognized" is true, then this
4253 // routine will never retun false (zero), but instead will execute a VM panic
4254 // routine kill the process.
4255 //
4256 // If this routine returns false, it is OK to call it again. This allows
4257 // the user-defined signal handler to perform checks either before or after
4258 // the VM performs its own checks. Naturally, the user code would be making
4259 // a serious error if it tried to handle an exception (such as a null check
4260 // or breakpoint) that the VM was generating for its own correct operation.
4261 //
4262 // This routine may recognize any of the following kinds of signals:
4263 // SIGBUS, SIGSEGV, SIGILL, SIGFPE, SIGQUIT, SIGPIPE, SIGXFSZ, SIGUSR1.
4264 // It should be consulted by handlers for any of those signals.
4265 //
4266 // The caller of this routine must pass in the three arguments supplied
4267 // to the function referred to in the "sa_sigaction" (not the "sa_handler")
4268 // field of the structure passed to sigaction(). This routine assumes that
4269 // the sa_flags field passed to sigaction() includes SA_SIGINFO and SA_RESTART.
4270 //
4271 // Note that the VM will print warnings if it detects conflicting signal
4272 // handlers, unless invoked with the option "-XX:+AllowUserSignalHandlers".
4273 //
4274 extern "C" JNIEXPORT int JVM_handle_linux_signal(int signo,
4275 siginfo_t* siginfo,
4276 void* ucontext,
4277 int abort_if_unrecognized);
4278
4279 void signalHandler(int sig, siginfo_t* info, void* uc) {
4280 assert(info != NULL && uc != NULL, "it must be old kernel");
4281 int orig_errno = errno; // Preserve errno value over signal handler.
4282 JVM_handle_linux_signal(sig, info, uc, true);
4283 errno = orig_errno;
4284 }
4285
4286
4287 // This boolean allows users to forward their own non-matching signals
4288 // to JVM_handle_linux_signal, harmlessly.
4289 bool os::Linux::signal_handlers_are_installed = false;
4290
4291 // For signal-chaining
4292 struct sigaction sigact[NSIG];
4293 uint64_t sigs = 0;
4294 #if (64 < NSIG-1)
4295 #error "Not all signals can be encoded in sigs. Adapt its type!"
4296 #endif
4297 bool os::Linux::libjsig_is_loaded = false;
4298 typedef struct sigaction *(*get_signal_t)(int);
4299 get_signal_t os::Linux::get_signal_action = NULL;
4300
4301 struct sigaction* os::Linux::get_chained_signal_action(int sig) {
4302 struct sigaction *actp = NULL;
4303
4304 if (libjsig_is_loaded) {
4305 // Retrieve the old signal handler from libjsig
4306 actp = (*get_signal_action)(sig);
4307 }
4308 if (actp == NULL) {
4309 // Retrieve the preinstalled signal handler from jvm
4310 actp = get_preinstalled_handler(sig);
4311 }
4312
4313 return actp;
4314 }
4315
4316 static bool call_chained_handler(struct sigaction *actp, int sig,
4317 siginfo_t *siginfo, void *context) {
4318 // Call the old signal handler
4319 if (actp->sa_handler == SIG_DFL) {
4320 // It's more reasonable to let jvm treat it as an unexpected exception
4321 // instead of taking the default action.
4322 return false;
4323 } else if (actp->sa_handler != SIG_IGN) {
4324 if ((actp->sa_flags & SA_NODEFER) == 0) {
4325 // automaticlly block the signal
4326 sigaddset(&(actp->sa_mask), sig);
4327 }
4328
4329 sa_handler_t hand = NULL;
4330 sa_sigaction_t sa = NULL;
4331 bool siginfo_flag_set = (actp->sa_flags & SA_SIGINFO) != 0;
4332 // retrieve the chained handler
4333 if (siginfo_flag_set) {
4334 sa = actp->sa_sigaction;
4335 } else {
4336 hand = actp->sa_handler;
4337 }
4338
4339 if ((actp->sa_flags & SA_RESETHAND) != 0) {
4340 actp->sa_handler = SIG_DFL;
4341 }
4342
4343 // try to honor the signal mask
4344 sigset_t oset;
4345 sigemptyset(&oset);
4346 pthread_sigmask(SIG_SETMASK, &(actp->sa_mask), &oset);
4347
4348 // call into the chained handler
4349 if (siginfo_flag_set) {
4350 (*sa)(sig, siginfo, context);
4351 } else {
4352 (*hand)(sig);
4353 }
4354
4355 // restore the signal mask
4356 pthread_sigmask(SIG_SETMASK, &oset, NULL);
4357 }
4358 // Tell jvm's signal handler the signal is taken care of.
4359 return true;
4360 }
4361
4362 bool os::Linux::chained_handler(int sig, siginfo_t* siginfo, void* context) {
4363 bool chained = false;
4364 // signal-chaining
4365 if (UseSignalChaining) {
4366 struct sigaction *actp = get_chained_signal_action(sig);
4367 if (actp != NULL) {
4368 chained = call_chained_handler(actp, sig, siginfo, context);
4369 }
4370 }
4371 return chained;
4372 }
4373
4374 struct sigaction* os::Linux::get_preinstalled_handler(int sig) {
4375 if ((((uint64_t)1 << (sig-1)) & sigs) != 0) {
4376 return &sigact[sig];
4377 }
4378 return NULL;
4379 }
4380
4381 void os::Linux::save_preinstalled_handler(int sig, struct sigaction& oldAct) {
4382 assert(sig > 0 && sig < NSIG, "vm signal out of expected range");
4383 sigact[sig] = oldAct;
4384 sigs |= (uint64_t)1 << (sig-1);
4385 }
4386
4387 // for diagnostic
4388 int sigflags[NSIG];
4389
4390 int os::Linux::get_our_sigflags(int sig) {
4391 assert(sig > 0 && sig < NSIG, "vm signal out of expected range");
4392 return sigflags[sig];
4393 }
4394
4395 void os::Linux::set_our_sigflags(int sig, int flags) {
4396 assert(sig > 0 && sig < NSIG, "vm signal out of expected range");
4397 if (sig > 0 && sig < NSIG) {
4398 sigflags[sig] = flags;
4399 }
4400 }
4401
4402 void os::Linux::set_signal_handler(int sig, bool set_installed) {
4403 // Check for overwrite.
4404 struct sigaction oldAct;
4405 sigaction(sig, (struct sigaction*)NULL, &oldAct);
4406
4407 void* oldhand = oldAct.sa_sigaction
4408 ? CAST_FROM_FN_PTR(void*, oldAct.sa_sigaction)
4409 : CAST_FROM_FN_PTR(void*, oldAct.sa_handler);
4410 if (oldhand != CAST_FROM_FN_PTR(void*, SIG_DFL) &&
4411 oldhand != CAST_FROM_FN_PTR(void*, SIG_IGN) &&
4412 oldhand != CAST_FROM_FN_PTR(void*, (sa_sigaction_t)signalHandler)) {
4413 if (AllowUserSignalHandlers || !set_installed) {
4414 // Do not overwrite; user takes responsibility to forward to us.
4415 return;
4416 } else if (UseSignalChaining) {
4417 // save the old handler in jvm
4418 save_preinstalled_handler(sig, oldAct);
4419 // libjsig also interposes the sigaction() call below and saves the
4420 // old sigaction on it own.
4421 } else {
4422 fatal("Encountered unexpected pre-existing sigaction handler "
4423 "%#lx for signal %d.", (long)oldhand, sig);
4424 }
4425 }
4426
4427 struct sigaction sigAct;
4428 sigfillset(&(sigAct.sa_mask));
4429 sigAct.sa_handler = SIG_DFL;
4430 if (!set_installed) {
4431 sigAct.sa_flags = SA_SIGINFO|SA_RESTART;
4432 } else {
4433 sigAct.sa_sigaction = signalHandler;
4434 sigAct.sa_flags = SA_SIGINFO|SA_RESTART;
4435 }
4436 // Save flags, which are set by ours
4437 assert(sig > 0 && sig < NSIG, "vm signal out of expected range");
4438 sigflags[sig] = sigAct.sa_flags;
4439
4440 int ret = sigaction(sig, &sigAct, &oldAct);
4441 assert(ret == 0, "check");
4442
4443 void* oldhand2 = oldAct.sa_sigaction
4444 ? CAST_FROM_FN_PTR(void*, oldAct.sa_sigaction)
4445 : CAST_FROM_FN_PTR(void*, oldAct.sa_handler);
4446 assert(oldhand2 == oldhand, "no concurrent signal handler installation");
4447 }
4448
4449 // install signal handlers for signals that HotSpot needs to
4450 // handle in order to support Java-level exception handling.
4451
4452 void os::Linux::install_signal_handlers() {
4453 if (!signal_handlers_are_installed) {
4454 signal_handlers_are_installed = true;
4455
4456 // signal-chaining
4457 typedef void (*signal_setting_t)();
4458 signal_setting_t begin_signal_setting = NULL;
4459 signal_setting_t end_signal_setting = NULL;
4460 begin_signal_setting = CAST_TO_FN_PTR(signal_setting_t,
4461 dlsym(RTLD_DEFAULT, "JVM_begin_signal_setting"));
4462 if (begin_signal_setting != NULL) {
4463 end_signal_setting = CAST_TO_FN_PTR(signal_setting_t,
4464 dlsym(RTLD_DEFAULT, "JVM_end_signal_setting"));
4465 get_signal_action = CAST_TO_FN_PTR(get_signal_t,
4466 dlsym(RTLD_DEFAULT, "JVM_get_signal_action"));
4467 libjsig_is_loaded = true;
4468 assert(UseSignalChaining, "should enable signal-chaining");
4469 }
4470 if (libjsig_is_loaded) {
4471 // Tell libjsig jvm is setting signal handlers
4472 (*begin_signal_setting)();
4473 }
4474
4475 set_signal_handler(SIGSEGV, true);
4476 set_signal_handler(SIGPIPE, true);
4477 set_signal_handler(SIGBUS, true);
4478 set_signal_handler(SIGILL, true);
4479 set_signal_handler(SIGFPE, true);
4480 #if defined(PPC64)
4481 set_signal_handler(SIGTRAP, true);
4482 #endif
4483 set_signal_handler(SIGXFSZ, true);
4484
4485 if (libjsig_is_loaded) {
4486 // Tell libjsig jvm finishes setting signal handlers
4487 (*end_signal_setting)();
4488 }
4489
4490 // We don't activate signal checker if libjsig is in place, we trust ourselves
4491 // and if UserSignalHandler is installed all bets are off.
4492 // Log that signal checking is off only if -verbose:jni is specified.
4493 if (CheckJNICalls) {
4494 if (libjsig_is_loaded) {
4495 if (PrintJNIResolving) {
4496 tty->print_cr("Info: libjsig is activated, all active signal checking is disabled");
4497 }
4498 check_signals = false;
4499 }
4500 if (AllowUserSignalHandlers) {
4501 if (PrintJNIResolving) {
4502 tty->print_cr("Info: AllowUserSignalHandlers is activated, all active signal checking is disabled");
4503 }
4504 check_signals = false;
4505 }
4506 }
4507 }
4508 }
4509
4510 // This is the fastest way to get thread cpu time on Linux.
4511 // Returns cpu time (user+sys) for any thread, not only for current.
4512 // POSIX compliant clocks are implemented in the kernels 2.6.16+.
4513 // It might work on 2.6.10+ with a special kernel/glibc patch.
4514 // For reference, please, see IEEE Std 1003.1-2004:
4515 // http://www.unix.org/single_unix_specification
4516
4517 jlong os::Linux::fast_thread_cpu_time(clockid_t clockid) {
4518 struct timespec tp;
4519 int rc = os::Linux::clock_gettime(clockid, &tp);
4520 assert(rc == 0, "clock_gettime is expected to return 0 code");
4521
4522 return (tp.tv_sec * NANOSECS_PER_SEC) + tp.tv_nsec;
4523 }
4524
4525 void os::Linux::initialize_os_info() {
4526 assert(_os_version == 0, "OS info already initialized");
4527
4528 struct utsname _uname;
4529
4530 uint32_t major;
4531 uint32_t minor;
4532 uint32_t fix;
4533
4534 int rc;
4535
4536 // Kernel version is unknown if
4537 // verification below fails.
4538 _os_version = 0x01000000;
4539
4540 rc = uname(&_uname);
4541 if (rc != -1) {
4542
4543 rc = sscanf(_uname.release,"%d.%d.%d", &major, &minor, &fix);
4544 if (rc == 3) {
4545
4546 if (major < 256 && minor < 256 && fix < 256) {
4547 // Kernel version format is as expected,
4548 // set it overriding unknown state.
4549 _os_version = (major << 16) |
4550 (minor << 8 ) |
4551 (fix << 0 ) ;
4552 }
4553 }
4554 }
4555 }
4556
4557 uint32_t os::Linux::os_version() {
4558 assert(_os_version != 0, "not initialized");
4559 return _os_version & 0x00FFFFFF;
4560 }
4561
4562 bool os::Linux::os_version_is_known() {
4563 assert(_os_version != 0, "not initialized");
4564 return _os_version & 0x01000000 ? false : true;
4565 }
4566
4567 /////
4568 // glibc on Linux platform uses non-documented flag
4569 // to indicate, that some special sort of signal
4570 // trampoline is used.
4571 // We will never set this flag, and we should
4572 // ignore this flag in our diagnostic
4573 #ifdef SIGNIFICANT_SIGNAL_MASK
4574 #undef SIGNIFICANT_SIGNAL_MASK
4575 #endif
4576 #define SIGNIFICANT_SIGNAL_MASK (~0x04000000)
4577
4578 static const char* get_signal_handler_name(address handler,
4579 char* buf, int buflen) {
4580 int offset = 0;
4581 bool found = os::dll_address_to_library_name(handler, buf, buflen, &offset);
4582 if (found) {
4583 // skip directory names
4584 const char *p1, *p2;
4585 p1 = buf;
4586 size_t len = strlen(os::file_separator());
4587 while ((p2 = strstr(p1, os::file_separator())) != NULL) p1 = p2 + len;
4588 jio_snprintf(buf, buflen, "%s+0x%x", p1, offset);
4589 } else {
4590 jio_snprintf(buf, buflen, PTR_FORMAT, handler);
4591 }
4592 return buf;
4593 }
4594
4595 static void print_signal_handler(outputStream* st, int sig,
4596 char* buf, size_t buflen) {
4597 struct sigaction sa;
4598
4599 sigaction(sig, NULL, &sa);
4600
4601 // See comment for SIGNIFICANT_SIGNAL_MASK define
4602 sa.sa_flags &= SIGNIFICANT_SIGNAL_MASK;
4603
4604 st->print("%s: ", os::exception_name(sig, buf, buflen));
4605
4606 address handler = (sa.sa_flags & SA_SIGINFO)
4607 ? CAST_FROM_FN_PTR(address, sa.sa_sigaction)
4608 : CAST_FROM_FN_PTR(address, sa.sa_handler);
4609
4610 if (handler == CAST_FROM_FN_PTR(address, SIG_DFL)) {
4611 st->print("SIG_DFL");
4612 } else if (handler == CAST_FROM_FN_PTR(address, SIG_IGN)) {
4613 st->print("SIG_IGN");
4614 } else {
4615 st->print("[%s]", get_signal_handler_name(handler, buf, buflen));
4616 }
4617
4618 st->print(", sa_mask[0]=");
4619 os::Posix::print_signal_set_short(st, &sa.sa_mask);
4620
4621 address rh = VMError::get_resetted_sighandler(sig);
4622 // May be, handler was resetted by VMError?
4623 if (rh != NULL) {
4624 handler = rh;
4625 sa.sa_flags = VMError::get_resetted_sigflags(sig) & SIGNIFICANT_SIGNAL_MASK;
4626 }
4627
4628 st->print(", sa_flags=");
4629 os::Posix::print_sa_flags(st, sa.sa_flags);
4630
4631 // Check: is it our handler?
4632 if (handler == CAST_FROM_FN_PTR(address, (sa_sigaction_t)signalHandler) ||
4633 handler == CAST_FROM_FN_PTR(address, (sa_sigaction_t)SR_handler)) {
4634 // It is our signal handler
4635 // check for flags, reset system-used one!
4636 if ((int)sa.sa_flags != os::Linux::get_our_sigflags(sig)) {
4637 st->print(
4638 ", flags was changed from " PTR32_FORMAT ", consider using jsig library",
4639 os::Linux::get_our_sigflags(sig));
4640 }
4641 }
4642 st->cr();
4643 }
4644
4645
4646 #define DO_SIGNAL_CHECK(sig) \
4647 do { \
4648 if (!sigismember(&check_signal_done, sig)) { \
4649 os::Linux::check_signal_handler(sig); \
4650 } \
4651 } while (0)
4652
4653 // This method is a periodic task to check for misbehaving JNI applications
4654 // under CheckJNI, we can add any periodic checks here
4655
4656 void os::run_periodic_checks() {
4657 if (check_signals == false) return;
4658
4659 // SEGV and BUS if overridden could potentially prevent
4660 // generation of hs*.log in the event of a crash, debugging
4661 // such a case can be very challenging, so we absolutely
4662 // check the following for a good measure:
4663 DO_SIGNAL_CHECK(SIGSEGV);
4664 DO_SIGNAL_CHECK(SIGILL);
4665 DO_SIGNAL_CHECK(SIGFPE);
4666 DO_SIGNAL_CHECK(SIGBUS);
4667 DO_SIGNAL_CHECK(SIGPIPE);
4668 DO_SIGNAL_CHECK(SIGXFSZ);
4669 #if defined(PPC64)
4670 DO_SIGNAL_CHECK(SIGTRAP);
4671 #endif
4672
4673 // ReduceSignalUsage allows the user to override these handlers
4674 // see comments at the very top and jvm_solaris.h
4675 if (!ReduceSignalUsage) {
4676 DO_SIGNAL_CHECK(SHUTDOWN1_SIGNAL);
4677 DO_SIGNAL_CHECK(SHUTDOWN2_SIGNAL);
4678 DO_SIGNAL_CHECK(SHUTDOWN3_SIGNAL);
4679 DO_SIGNAL_CHECK(BREAK_SIGNAL);
4680 }
4681
4682 DO_SIGNAL_CHECK(SR_signum);
4683 }
4684
4685 typedef int (*os_sigaction_t)(int, const struct sigaction *, struct sigaction *);
4686
4687 static os_sigaction_t os_sigaction = NULL;
4688
4689 void os::Linux::check_signal_handler(int sig) {
4690 char buf[O_BUFLEN];
4691 address jvmHandler = NULL;
4692
4693
4694 struct sigaction act;
4695 if (os_sigaction == NULL) {
4696 // only trust the default sigaction, in case it has been interposed
4697 os_sigaction = (os_sigaction_t)dlsym(RTLD_DEFAULT, "sigaction");
4698 if (os_sigaction == NULL) return;
4699 }
4700
4701 os_sigaction(sig, (struct sigaction*)NULL, &act);
4702
4703
4704 act.sa_flags &= SIGNIFICANT_SIGNAL_MASK;
4705
4706 address thisHandler = (act.sa_flags & SA_SIGINFO)
4707 ? CAST_FROM_FN_PTR(address, act.sa_sigaction)
4708 : CAST_FROM_FN_PTR(address, act.sa_handler);
4709
4710
4711 switch (sig) {
4712 case SIGSEGV:
4713 case SIGBUS:
4714 case SIGFPE:
4715 case SIGPIPE:
4716 case SIGILL:
4717 case SIGXFSZ:
4718 jvmHandler = CAST_FROM_FN_PTR(address, (sa_sigaction_t)signalHandler);
4719 break;
4720
4721 case SHUTDOWN1_SIGNAL:
4722 case SHUTDOWN2_SIGNAL:
4723 case SHUTDOWN3_SIGNAL:
4724 case BREAK_SIGNAL:
4725 jvmHandler = (address)user_handler();
4726 break;
4727
4728 default:
4729 if (sig == SR_signum) {
4730 jvmHandler = CAST_FROM_FN_PTR(address, (sa_sigaction_t)SR_handler);
4731 } else {
4732 return;
4733 }
4734 break;
4735 }
4736
4737 if (thisHandler != jvmHandler) {
4738 tty->print("Warning: %s handler ", exception_name(sig, buf, O_BUFLEN));
4739 tty->print("expected:%s", get_signal_handler_name(jvmHandler, buf, O_BUFLEN));
4740 tty->print_cr(" found:%s", get_signal_handler_name(thisHandler, buf, O_BUFLEN));
4741 // No need to check this sig any longer
4742 sigaddset(&check_signal_done, sig);
4743 // Running under non-interactive shell, SHUTDOWN2_SIGNAL will be reassigned SIG_IGN
4744 if (sig == SHUTDOWN2_SIGNAL && !isatty(fileno(stdin))) {
4745 tty->print_cr("Running in non-interactive shell, %s handler is replaced by shell",
4746 exception_name(sig, buf, O_BUFLEN));
4747 }
4748 } else if(os::Linux::get_our_sigflags(sig) != 0 && (int)act.sa_flags != os::Linux::get_our_sigflags(sig)) {
4749 tty->print("Warning: %s handler flags ", exception_name(sig, buf, O_BUFLEN));
4750 tty->print("expected:");
4751 os::Posix::print_sa_flags(tty, os::Linux::get_our_sigflags(sig));
4752 tty->cr();
4753 tty->print(" found:");
4754 os::Posix::print_sa_flags(tty, act.sa_flags);
4755 tty->cr();
4756 // No need to check this sig any longer
4757 sigaddset(&check_signal_done, sig);
4758 }
4759
4760 // Dump all the signal
4761 if (sigismember(&check_signal_done, sig)) {
4762 print_signal_handlers(tty, buf, O_BUFLEN);
4763 }
4764 }
4765
4766 extern void report_error(char* file_name, int line_no, char* title,
4767 char* format, ...);
4768
4769 // this is called _before_ the most of global arguments have been parsed
4770 void os::init(void) {
4771 char dummy; // used to get a guess on initial stack address
4772 // first_hrtime = gethrtime();
4773
4774 clock_tics_per_sec = sysconf(_SC_CLK_TCK);
4775
4776 init_random(1234567);
4777
4778 ThreadCritical::initialize();
4779
4780 Linux::set_page_size(sysconf(_SC_PAGESIZE));
4781 if (Linux::page_size() == -1) {
4782 fatal("os_linux.cpp: os::init: sysconf failed (%s)",
4783 os::strerror(errno));
4784 }
4785 init_page_sizes((size_t) Linux::page_size());
4786
4787 Linux::initialize_system_info();
4788
4789 Linux::initialize_os_info();
4790
4791 // main_thread points to the aboriginal thread
4792 Linux::_main_thread = pthread_self();
4793
4794 Linux::clock_init();
4795 initial_time_count = javaTimeNanos();
4796
4797 // pthread_condattr initialization for monotonic clock
4798 int status;
4799 pthread_condattr_t* _condattr = os::Linux::condAttr();
4800 if ((status = pthread_condattr_init(_condattr)) != 0) {
4801 fatal("pthread_condattr_init: %s", os::strerror(status));
4802 }
4803 // Only set the clock if CLOCK_MONOTONIC is available
4804 if (os::supports_monotonic_clock()) {
4805 if ((status = pthread_condattr_setclock(_condattr, CLOCK_MONOTONIC)) != 0) {
4806 if (status == EINVAL) {
4807 warning("Unable to use monotonic clock with relative timed-waits" \
4808 " - changes to the time-of-day clock may have adverse affects");
4809 } else {
4810 fatal("pthread_condattr_setclock: %s", os::strerror(status));
4811 }
4812 }
4813 }
4814 // else it defaults to CLOCK_REALTIME
4815
4816 // retrieve entry point for pthread_setname_np
4817 Linux::_pthread_setname_np =
4818 (int(*)(pthread_t, const char*))dlsym(RTLD_DEFAULT, "pthread_setname_np");
4819
4820 }
4821
4822 // To install functions for atexit system call
4823 extern "C" {
4824 static void perfMemory_exit_helper() {
4825 perfMemory_exit();
4826 }
4827 }
4828
4829 // this is called _after_ the global arguments have been parsed
4830 jint os::init_2(void) {
4831 Linux::fast_thread_clock_init();
4832
4833 // Allocate a single page and mark it as readable for safepoint polling
4834 address polling_page = (address) ::mmap(NULL, Linux::page_size(), PROT_READ, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
4835 guarantee(polling_page != MAP_FAILED, "os::init_2: failed to allocate polling page");
4836
4837 os::set_polling_page(polling_page);
4838 log_info(os)("SafePoint Polling address: " INTPTR_FORMAT, p2i(polling_page));
4839
4840 if (!UseMembar) {
4841 address mem_serialize_page = (address) ::mmap(NULL, Linux::page_size(), PROT_READ | PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
4842 guarantee(mem_serialize_page != MAP_FAILED, "mmap Failed for memory serialize page");
4843 os::set_memory_serialize_page(mem_serialize_page);
4844 log_info(os)("Memory Serialize Page address: " INTPTR_FORMAT, p2i(mem_serialize_page));
4845 }
4846
4847 // initialize suspend/resume support - must do this before signal_sets_init()
4848 if (SR_initialize() != 0) {
4849 perror("SR_initialize failed");
4850 return JNI_ERR;
4851 }
4852
4853 Linux::signal_sets_init();
4854 Linux::install_signal_handlers();
4855
4856 // Check and sets minimum stack sizes against command line options
4857 if (Posix::set_minimum_stack_sizes() == JNI_ERR) {
4858 return JNI_ERR;
4859 }
4860 Linux::capture_initial_stack(JavaThread::stack_size_at_create());
4861
4862 #if defined(IA32)
4863 workaround_expand_exec_shield_cs_limit();
4864 #endif
4865
4866 Linux::libpthread_init();
4867 log_info(os)("HotSpot is running with %s, %s",
4868 Linux::glibc_version(), Linux::libpthread_version());
4869
4870 if (UseNUMA) {
4871 if (!Linux::libnuma_init()) {
4872 UseNUMA = false;
4873 } else {
4874 if ((Linux::numa_max_node() < 1)) {
4875 // There's only one node(they start from 0), disable NUMA.
4876 UseNUMA = false;
4877 }
4878 }
4879 // With SHM and HugeTLBFS large pages we cannot uncommit a page, so there's no way
4880 // we can make the adaptive lgrp chunk resizing work. If the user specified
4881 // both UseNUMA and UseLargePages (or UseSHM/UseHugeTLBFS) on the command line - warn and
4882 // disable adaptive resizing.
4883 if (UseNUMA && UseLargePages && !can_commit_large_page_memory()) {
4884 if (FLAG_IS_DEFAULT(UseNUMA)) {
4885 UseNUMA = false;
4886 } else {
4887 if (FLAG_IS_DEFAULT(UseLargePages) &&
4888 FLAG_IS_DEFAULT(UseSHM) &&
4889 FLAG_IS_DEFAULT(UseHugeTLBFS)) {
4890 UseLargePages = false;
4891 } else if (UseAdaptiveSizePolicy || UseAdaptiveNUMAChunkSizing) {
4892 warning("UseNUMA is not fully compatible with SHM/HugeTLBFS large pages, disabling adaptive resizing (-XX:-UseAdaptiveSizePolicy -XX:-UseAdaptiveNUMAChunkSizing)");
4893 UseAdaptiveSizePolicy = false;
4894 UseAdaptiveNUMAChunkSizing = false;
4895 }
4896 }
4897 }
4898 if (!UseNUMA && ForceNUMA) {
4899 UseNUMA = true;
4900 }
4901 }
4902
4903 if (MaxFDLimit) {
4904 // set the number of file descriptors to max. print out error
4905 // if getrlimit/setrlimit fails but continue regardless.
4906 struct rlimit nbr_files;
4907 int status = getrlimit(RLIMIT_NOFILE, &nbr_files);
4908 if (status != 0) {
4909 log_info(os)("os::init_2 getrlimit failed: %s", os::strerror(errno));
4910 } else {
4911 nbr_files.rlim_cur = nbr_files.rlim_max;
4912 status = setrlimit(RLIMIT_NOFILE, &nbr_files);
4913 if (status != 0) {
4914 log_info(os)("os::init_2 setrlimit failed: %s", os::strerror(errno));
4915 }
4916 }
4917 }
4918
4919 // Initialize lock used to serialize thread creation (see os::create_thread)
4920 Linux::set_createThread_lock(new Mutex(Mutex::leaf, "createThread_lock", false));
4921
4922 // at-exit methods are called in the reverse order of their registration.
4923 // atexit functions are called on return from main or as a result of a
4924 // call to exit(3C). There can be only 32 of these functions registered
4925 // and atexit() does not set errno.
4926
4927 if (PerfAllowAtExitRegistration) {
4928 // only register atexit functions if PerfAllowAtExitRegistration is set.
4929 // atexit functions can be delayed until process exit time, which
4930 // can be problematic for embedded VM situations. Embedded VMs should
4931 // call DestroyJavaVM() to assure that VM resources are released.
4932
4933 // note: perfMemory_exit_helper atexit function may be removed in
4934 // the future if the appropriate cleanup code can be added to the
4935 // VM_Exit VMOperation's doit method.
4936 if (atexit(perfMemory_exit_helper) != 0) {
4937 warning("os::init_2 atexit(perfMemory_exit_helper) failed");
4938 }
4939 }
4940
4941 // initialize thread priority policy
4942 prio_init();
4943
4944 return JNI_OK;
4945 }
4946
4947 // Mark the polling page as unreadable
4948 void os::make_polling_page_unreadable(void) {
4949 if (!guard_memory((char*)_polling_page, Linux::page_size())) {
4950 fatal("Could not disable polling page");
4951 }
4952 }
4953
4954 // Mark the polling page as readable
4955 void os::make_polling_page_readable(void) {
4956 if (!linux_mprotect((char *)_polling_page, Linux::page_size(), PROT_READ)) {
4957 fatal("Could not enable polling page");
4958 }
4959 }
4960
4961 // older glibc versions don't have this macro (which expands to
4962 // an optimized bit-counting function) so we have to roll our own
4963 #ifndef CPU_COUNT
4964
4965 static int _cpu_count(const cpu_set_t* cpus) {
4966 int count = 0;
4967 // only look up to the number of configured processors
4968 for (int i = 0; i < os::processor_count(); i++) {
4969 if (CPU_ISSET(i, cpus)) {
4970 count++;
4971 }
4972 }
4973 return count;
4974 }
4975
4976 #define CPU_COUNT(cpus) _cpu_count(cpus)
4977
4978 #endif // CPU_COUNT
4979
4980 // Get the current number of available processors for this process.
4981 // This value can change at any time during a process's lifetime.
4982 // sched_getaffinity gives an accurate answer as it accounts for cpusets.
4983 // If it appears there may be more than 1024 processors then we do a
4984 // dynamic check - see 6515172 for details.
4985 // If anything goes wrong we fallback to returning the number of online
4986 // processors - which can be greater than the number available to the process.
4987 int os::active_processor_count() {
4988 cpu_set_t cpus; // can represent at most 1024 (CPU_SETSIZE) processors
4989 cpu_set_t* cpus_p = &cpus;
4990 int cpus_size = sizeof(cpu_set_t);
4991
4992 int configured_cpus = processor_count(); // upper bound on available cpus
4993 int cpu_count = 0;
4994
4995 // old build platforms may not support dynamic cpu sets
4996 #ifdef CPU_ALLOC
4997
4998 // To enable easy testing of the dynamic path on different platforms we
4999 // introduce a diagnostic flag: UseCpuAllocPath
5000 if (configured_cpus >= CPU_SETSIZE || UseCpuAllocPath) {
5001 // kernel may use a mask bigger than cpu_set_t
5002 log_trace(os)("active_processor_count: using dynamic path %s"
5003 "- configured processors: %d",
5004 UseCpuAllocPath ? "(forced) " : "",
5005 configured_cpus);
5006 cpus_p = CPU_ALLOC(configured_cpus);
5007 if (cpus_p != NULL) {
5008 cpus_size = CPU_ALLOC_SIZE(configured_cpus);
5009 // zero it just to be safe
5010 CPU_ZERO_S(cpus_size, cpus_p);
5011 }
5012 else {
5013 // failed to allocate so fallback to online cpus
5014 int online_cpus = ::sysconf(_SC_NPROCESSORS_ONLN);
5015 log_trace(os)("active_processor_count: "
5016 "CPU_ALLOC failed (%s) - using "
5017 "online processor count: %d",
5018 os::strerror(errno), online_cpus);
5019 return online_cpus;
5020 }
5021 }
5022 else {
5023 log_trace(os)("active_processor_count: using static path - configured processors: %d",
5024 configured_cpus);
5025 }
5026 #else // CPU_ALLOC
5027 // these stubs won't be executed
5028 #define CPU_COUNT_S(size, cpus) -1
5029 #define CPU_FREE(cpus)
5030
5031 log_trace(os)("active_processor_count: only static path available - configured processors: %d",
5032 configured_cpus);
5033 #endif // CPU_ALLOC
5034
5035 // pid 0 means the current thread - which we have to assume represents the process
5036 if (sched_getaffinity(0, cpus_size, cpus_p) == 0) {
5037 if (cpus_p != &cpus) { // can only be true when CPU_ALLOC used
5038 cpu_count = CPU_COUNT_S(cpus_size, cpus_p);
5039 }
5040 else {
5041 cpu_count = CPU_COUNT(cpus_p);
5042 }
5043 log_trace(os)("active_processor_count: sched_getaffinity processor count: %d", cpu_count);
5044 }
5045 else {
5046 cpu_count = ::sysconf(_SC_NPROCESSORS_ONLN);
5047 warning("sched_getaffinity failed (%s)- using online processor count (%d) "
5048 "which may exceed available processors", os::strerror(errno), cpu_count);
5049 }
5050
5051 if (cpus_p != &cpus) { // can only be true when CPU_ALLOC used
5052 CPU_FREE(cpus_p);
5053 }
5054
5055 assert(cpu_count > 0 && cpu_count <= processor_count(), "sanity check");
5056 return cpu_count;
5057 }
5058
5059 void os::set_native_thread_name(const char *name) {
5060 if (Linux::_pthread_setname_np) {
5061 char buf [16]; // according to glibc manpage, 16 chars incl. '/0'
5062 snprintf(buf, sizeof(buf), "%s", name);
5063 buf[sizeof(buf) - 1] = '\0';
5064 const int rc = Linux::_pthread_setname_np(pthread_self(), buf);
5065 // ERANGE should not happen; all other errors should just be ignored.
5066 assert(rc != ERANGE, "pthread_setname_np failed");
5067 }
5068 }
5069
5070 bool os::distribute_processes(uint length, uint* distribution) {
5071 // Not yet implemented.
5072 return false;
5073 }
5074
5075 bool os::bind_to_processor(uint processor_id) {
5076 // Not yet implemented.
5077 return false;
5078 }
5079
5080 ///
5081
5082 void os::SuspendedThreadTask::internal_do_task() {
5083 if (do_suspend(_thread->osthread())) {
5084 SuspendedThreadTaskContext context(_thread, _thread->osthread()->ucontext());
5085 do_task(context);
5086 do_resume(_thread->osthread());
5087 }
5088 }
5089
5090 class PcFetcher : public os::SuspendedThreadTask {
5091 public:
5092 PcFetcher(Thread* thread) : os::SuspendedThreadTask(thread) {}
5093 ExtendedPC result();
5094 protected:
5095 void do_task(const os::SuspendedThreadTaskContext& context);
5096 private:
5097 ExtendedPC _epc;
5098 };
5099
5100 ExtendedPC PcFetcher::result() {
5101 guarantee(is_done(), "task is not done yet.");
5102 return _epc;
5103 }
5104
5105 void PcFetcher::do_task(const os::SuspendedThreadTaskContext& context) {
5106 Thread* thread = context.thread();
5107 OSThread* osthread = thread->osthread();
5108 if (osthread->ucontext() != NULL) {
5109 _epc = os::Linux::ucontext_get_pc((const ucontext_t *) context.ucontext());
5110 } else {
5111 // NULL context is unexpected, double-check this is the VMThread
5112 guarantee(thread->is_VM_thread(), "can only be called for VMThread");
5113 }
5114 }
5115
5116 // Suspends the target using the signal mechanism and then grabs the PC before
5117 // resuming the target. Used by the flat-profiler only
5118 ExtendedPC os::get_thread_pc(Thread* thread) {
5119 // Make sure that it is called by the watcher for the VMThread
5120 assert(Thread::current()->is_Watcher_thread(), "Must be watcher");
5121 assert(thread->is_VM_thread(), "Can only be called for VMThread");
5122
5123 PcFetcher fetcher(thread);
5124 fetcher.run();
5125 return fetcher.result();
5126 }
5127
5128 ////////////////////////////////////////////////////////////////////////////////
5129 // debug support
5130
5131 bool os::find(address addr, outputStream* st) {
5132 Dl_info dlinfo;
5133 memset(&dlinfo, 0, sizeof(dlinfo));
5134 if (dladdr(addr, &dlinfo) != 0) {
5135 st->print(PTR_FORMAT ": ", p2i(addr));
5136 if (dlinfo.dli_sname != NULL && dlinfo.dli_saddr != NULL) {
5137 st->print("%s+" PTR_FORMAT, dlinfo.dli_sname,
5138 p2i(addr) - p2i(dlinfo.dli_saddr));
5139 } else if (dlinfo.dli_fbase != NULL) {
5140 st->print("<offset " PTR_FORMAT ">", p2i(addr) - p2i(dlinfo.dli_fbase));
5141 } else {
5142 st->print("<absolute address>");
5143 }
5144 if (dlinfo.dli_fname != NULL) {
5145 st->print(" in %s", dlinfo.dli_fname);
5146 }
5147 if (dlinfo.dli_fbase != NULL) {
5148 st->print(" at " PTR_FORMAT, p2i(dlinfo.dli_fbase));
5149 }
5150 st->cr();
5151
5152 if (Verbose) {
5153 // decode some bytes around the PC
5154 address begin = clamp_address_in_page(addr-40, addr, os::vm_page_size());
5155 address end = clamp_address_in_page(addr+40, addr, os::vm_page_size());
5156 address lowest = (address) dlinfo.dli_sname;
5157 if (!lowest) lowest = (address) dlinfo.dli_fbase;
5158 if (begin < lowest) begin = lowest;
5159 Dl_info dlinfo2;
5160 if (dladdr(end, &dlinfo2) != 0 && dlinfo2.dli_saddr != dlinfo.dli_saddr
5161 && end > dlinfo2.dli_saddr && dlinfo2.dli_saddr > begin) {
5162 end = (address) dlinfo2.dli_saddr;
5163 }
5164 Disassembler::decode(begin, end, st);
5165 }
5166 return true;
5167 }
5168 return false;
5169 }
5170
5171 ////////////////////////////////////////////////////////////////////////////////
5172 // misc
5173
5174 // This does not do anything on Linux. This is basically a hook for being
5175 // able to use structured exception handling (thread-local exception filters)
5176 // on, e.g., Win32.
5177 void
5178 os::os_exception_wrapper(java_call_t f, JavaValue* value, const methodHandle& method,
5179 JavaCallArguments* args, Thread* thread) {
5180 f(value, method, args, thread);
5181 }
5182
5183 void os::print_statistics() {
5184 }
5185
5186 bool os::message_box(const char* title, const char* message) {
5187 int i;
5188 fdStream err(defaultStream::error_fd());
5189 for (i = 0; i < 78; i++) err.print_raw("=");
5190 err.cr();
5191 err.print_raw_cr(title);
5192 for (i = 0; i < 78; i++) err.print_raw("-");
5193 err.cr();
5194 err.print_raw_cr(message);
5195 for (i = 0; i < 78; i++) err.print_raw("=");
5196 err.cr();
5197
5198 char buf[16];
5199 // Prevent process from exiting upon "read error" without consuming all CPU
5200 while (::read(0, buf, sizeof(buf)) <= 0) { ::sleep(100); }
5201
5202 return buf[0] == 'y' || buf[0] == 'Y';
5203 }
5204
5205 int os::stat(const char *path, struct stat *sbuf) {
5206 char pathbuf[MAX_PATH];
5207 if (strlen(path) > MAX_PATH - 1) {
5208 errno = ENAMETOOLONG;
5209 return -1;
5210 }
5211 os::native_path(strcpy(pathbuf, path));
5212 return ::stat(pathbuf, sbuf);
5213 }
5214
5215 // Is a (classpath) directory empty?
5216 bool os::dir_is_empty(const char* path) {
5217 DIR *dir = NULL;
5218 struct dirent *ptr;
5219
5220 dir = opendir(path);
5221 if (dir == NULL) return true;
5222
5223 // Scan the directory
5224 bool result = true;
5225 char buf[sizeof(struct dirent) + MAX_PATH];
5226 while (result && (ptr = ::readdir(dir)) != NULL) {
5227 if (strcmp(ptr->d_name, ".") != 0 && strcmp(ptr->d_name, "..") != 0) {
5228 result = false;
5229 }
5230 }
5231 closedir(dir);
5232 return result;
5233 }
5234
5235 // This code originates from JDK's sysOpen and open64_w
5236 // from src/solaris/hpi/src/system_md.c
5237
5238 int os::open(const char *path, int oflag, int mode) {
5239 if (strlen(path) > MAX_PATH - 1) {
5240 errno = ENAMETOOLONG;
5241 return -1;
5242 }
5243
5244 // All file descriptors that are opened in the Java process and not
5245 // specifically destined for a subprocess should have the close-on-exec
5246 // flag set. If we don't set it, then careless 3rd party native code
5247 // might fork and exec without closing all appropriate file descriptors
5248 // (e.g. as we do in closeDescriptors in UNIXProcess.c), and this in
5249 // turn might:
5250 //
5251 // - cause end-of-file to fail to be detected on some file
5252 // descriptors, resulting in mysterious hangs, or
5253 //
5254 // - might cause an fopen in the subprocess to fail on a system
5255 // suffering from bug 1085341.
5256 //
5257 // (Yes, the default setting of the close-on-exec flag is a Unix
5258 // design flaw)
5259 //
5260 // See:
5261 // 1085341: 32-bit stdio routines should support file descriptors >255
5262 // 4843136: (process) pipe file descriptor from Runtime.exec not being closed
5263 // 6339493: (process) Runtime.exec does not close all file descriptors on Solaris 9
5264 //
5265 // Modern Linux kernels (after 2.6.23 2007) support O_CLOEXEC with open().
5266 // O_CLOEXEC is preferable to using FD_CLOEXEC on an open file descriptor
5267 // because it saves a system call and removes a small window where the flag
5268 // is unset. On ancient Linux kernels the O_CLOEXEC flag will be ignored
5269 // and we fall back to using FD_CLOEXEC (see below).
5270 #ifdef O_CLOEXEC
5271 oflag |= O_CLOEXEC;
5272 #endif
5273
5274 int fd = ::open64(path, oflag, mode);
5275 if (fd == -1) return -1;
5276
5277 //If the open succeeded, the file might still be a directory
5278 {
5279 struct stat64 buf64;
5280 int ret = ::fstat64(fd, &buf64);
5281 int st_mode = buf64.st_mode;
5282
5283 if (ret != -1) {
5284 if ((st_mode & S_IFMT) == S_IFDIR) {
5285 errno = EISDIR;
5286 ::close(fd);
5287 return -1;
5288 }
5289 } else {
5290 ::close(fd);
5291 return -1;
5292 }
5293 }
5294
5295 #ifdef FD_CLOEXEC
5296 // Validate that the use of the O_CLOEXEC flag on open above worked.
5297 // With recent kernels, we will perform this check exactly once.
5298 static sig_atomic_t O_CLOEXEC_is_known_to_work = 0;
5299 if (!O_CLOEXEC_is_known_to_work) {
5300 int flags = ::fcntl(fd, F_GETFD);
5301 if (flags != -1) {
5302 if ((flags & FD_CLOEXEC) != 0)
5303 O_CLOEXEC_is_known_to_work = 1;
5304 else
5305 ::fcntl(fd, F_SETFD, flags | FD_CLOEXEC);
5306 }
5307 }
5308 #endif
5309
5310 return fd;
5311 }
5312
5313
5314 // create binary file, rewriting existing file if required
5315 int os::create_binary_file(const char* path, bool rewrite_existing) {
5316 int oflags = O_WRONLY | O_CREAT;
5317 if (!rewrite_existing) {
5318 oflags |= O_EXCL;
5319 }
5320 return ::open64(path, oflags, S_IREAD | S_IWRITE);
5321 }
5322
5323 // return current position of file pointer
5324 jlong os::current_file_offset(int fd) {
5325 return (jlong)::lseek64(fd, (off64_t)0, SEEK_CUR);
5326 }
5327
5328 // move file pointer to the specified offset
5329 jlong os::seek_to_file_offset(int fd, jlong offset) {
5330 return (jlong)::lseek64(fd, (off64_t)offset, SEEK_SET);
5331 }
5332
5333 // This code originates from JDK's sysAvailable
5334 // from src/solaris/hpi/src/native_threads/src/sys_api_td.c
5335
5336 int os::available(int fd, jlong *bytes) {
5337 jlong cur, end;
5338 int mode;
5339 struct stat64 buf64;
5340
5341 if (::fstat64(fd, &buf64) >= 0) {
5342 mode = buf64.st_mode;
5343 if (S_ISCHR(mode) || S_ISFIFO(mode) || S_ISSOCK(mode)) {
5344 int n;
5345 if (::ioctl(fd, FIONREAD, &n) >= 0) {
5346 *bytes = n;
5347 return 1;
5348 }
5349 }
5350 }
5351 if ((cur = ::lseek64(fd, 0L, SEEK_CUR)) == -1) {
5352 return 0;
5353 } else if ((end = ::lseek64(fd, 0L, SEEK_END)) == -1) {
5354 return 0;
5355 } else if (::lseek64(fd, cur, SEEK_SET) == -1) {
5356 return 0;
5357 }
5358 *bytes = end - cur;
5359 return 1;
5360 }
5361
5362 // Map a block of memory.
5363 char* os::pd_map_memory(int fd, const char* file_name, size_t file_offset,
5364 char *addr, size_t bytes, bool read_only,
5365 bool allow_exec) {
5366 int prot;
5367 int flags = MAP_PRIVATE;
5368
5369 if (read_only) {
5370 prot = PROT_READ;
5371 } else {
5372 prot = PROT_READ | PROT_WRITE;
5373 }
5374
5375 if (allow_exec) {
5376 prot |= PROT_EXEC;
5377 }
5378
5379 if (addr != NULL) {
5380 flags |= MAP_FIXED;
5381 }
5382
5383 char* mapped_address = (char*)mmap(addr, (size_t)bytes, prot, flags,
5384 fd, file_offset);
5385 if (mapped_address == MAP_FAILED) {
5386 return NULL;
5387 }
5388 return mapped_address;
5389 }
5390
5391
5392 // Remap a block of memory.
5393 char* os::pd_remap_memory(int fd, const char* file_name, size_t file_offset,
5394 char *addr, size_t bytes, bool read_only,
5395 bool allow_exec) {
5396 // same as map_memory() on this OS
5397 return os::map_memory(fd, file_name, file_offset, addr, bytes, read_only,
5398 allow_exec);
5399 }
5400
5401
5402 // Unmap a block of memory.
5403 bool os::pd_unmap_memory(char* addr, size_t bytes) {
5404 return munmap(addr, bytes) == 0;
5405 }
5406
5407 static jlong slow_thread_cpu_time(Thread *thread, bool user_sys_cpu_time);
5408
5409 static clockid_t thread_cpu_clockid(Thread* thread) {
5410 pthread_t tid = thread->osthread()->pthread_id();
5411 clockid_t clockid;
5412
5413 // Get thread clockid
5414 int rc = os::Linux::pthread_getcpuclockid(tid, &clockid);
5415 assert(rc == 0, "pthread_getcpuclockid is expected to return 0 code");
5416 return clockid;
5417 }
5418
5419 // current_thread_cpu_time(bool) and thread_cpu_time(Thread*, bool)
5420 // are used by JVM M&M and JVMTI to get user+sys or user CPU time
5421 // of a thread.
5422 //
5423 // current_thread_cpu_time() and thread_cpu_time(Thread*) returns
5424 // the fast estimate available on the platform.
5425
5426 jlong os::current_thread_cpu_time() {
5427 if (os::Linux::supports_fast_thread_cpu_time()) {
5428 return os::Linux::fast_thread_cpu_time(CLOCK_THREAD_CPUTIME_ID);
5429 } else {
5430 // return user + sys since the cost is the same
5431 return slow_thread_cpu_time(Thread::current(), true /* user + sys */);
5432 }
5433 }
5434
5435 jlong os::thread_cpu_time(Thread* thread) {
5436 // consistent with what current_thread_cpu_time() returns
5437 if (os::Linux::supports_fast_thread_cpu_time()) {
5438 return os::Linux::fast_thread_cpu_time(thread_cpu_clockid(thread));
5439 } else {
5440 return slow_thread_cpu_time(thread, true /* user + sys */);
5441 }
5442 }
5443
5444 jlong os::current_thread_cpu_time(bool user_sys_cpu_time) {
5445 if (user_sys_cpu_time && os::Linux::supports_fast_thread_cpu_time()) {
5446 return os::Linux::fast_thread_cpu_time(CLOCK_THREAD_CPUTIME_ID);
5447 } else {
5448 return slow_thread_cpu_time(Thread::current(), user_sys_cpu_time);
5449 }
5450 }
5451
5452 jlong os::thread_cpu_time(Thread *thread, bool user_sys_cpu_time) {
5453 if (user_sys_cpu_time && os::Linux::supports_fast_thread_cpu_time()) {
5454 return os::Linux::fast_thread_cpu_time(thread_cpu_clockid(thread));
5455 } else {
5456 return slow_thread_cpu_time(thread, user_sys_cpu_time);
5457 }
5458 }
5459
5460 // -1 on error.
5461 static jlong slow_thread_cpu_time(Thread *thread, bool user_sys_cpu_time) {
5462 pid_t tid = thread->osthread()->thread_id();
5463 char *s;
5464 char stat[2048];
5465 int statlen;
5466 char proc_name[64];
5467 int count;
5468 long sys_time, user_time;
5469 char cdummy;
5470 int idummy;
5471 long ldummy;
5472 FILE *fp;
5473
5474 snprintf(proc_name, 64, "/proc/self/task/%d/stat", tid);
5475 fp = fopen(proc_name, "r");
5476 if (fp == NULL) return -1;
5477 statlen = fread(stat, 1, 2047, fp);
5478 stat[statlen] = '\0';
5479 fclose(fp);
5480
5481 // Skip pid and the command string. Note that we could be dealing with
5482 // weird command names, e.g. user could decide to rename java launcher
5483 // to "java 1.4.2 :)", then the stat file would look like
5484 // 1234 (java 1.4.2 :)) R ... ...
5485 // We don't really need to know the command string, just find the last
5486 // occurrence of ")" and then start parsing from there. See bug 4726580.
5487 s = strrchr(stat, ')');
5488 if (s == NULL) return -1;
5489
5490 // Skip blank chars
5491 do { s++; } while (s && isspace(*s));
5492
5493 count = sscanf(s,"%c %d %d %d %d %d %lu %lu %lu %lu %lu %lu %lu",
5494 &cdummy, &idummy, &idummy, &idummy, &idummy, &idummy,
5495 &ldummy, &ldummy, &ldummy, &ldummy, &ldummy,
5496 &user_time, &sys_time);
5497 if (count != 13) return -1;
5498 if (user_sys_cpu_time) {
5499 return ((jlong)sys_time + (jlong)user_time) * (1000000000 / clock_tics_per_sec);
5500 } else {
5501 return (jlong)user_time * (1000000000 / clock_tics_per_sec);
5502 }
5503 }
5504
5505 void os::current_thread_cpu_time_info(jvmtiTimerInfo *info_ptr) {
5506 info_ptr->max_value = ALL_64_BITS; // will not wrap in less than 64 bits
5507 info_ptr->may_skip_backward = false; // elapsed time not wall time
5508 info_ptr->may_skip_forward = false; // elapsed time not wall time
5509 info_ptr->kind = JVMTI_TIMER_TOTAL_CPU; // user+system time is returned
5510 }
5511
5512 void os::thread_cpu_time_info(jvmtiTimerInfo *info_ptr) {
5513 info_ptr->max_value = ALL_64_BITS; // will not wrap in less than 64 bits
5514 info_ptr->may_skip_backward = false; // elapsed time not wall time
5515 info_ptr->may_skip_forward = false; // elapsed time not wall time
5516 info_ptr->kind = JVMTI_TIMER_TOTAL_CPU; // user+system time is returned
5517 }
5518
5519 bool os::is_thread_cpu_time_supported() {
5520 return true;
5521 }
5522
5523 // System loadavg support. Returns -1 if load average cannot be obtained.
5524 // Linux doesn't yet have a (official) notion of processor sets,
5525 // so just return the system wide load average.
5526 int os::loadavg(double loadavg[], int nelem) {
5527 return ::getloadavg(loadavg, nelem);
5528 }
5529
5530 void os::pause() {
5531 char filename[MAX_PATH];
5532 if (PauseAtStartupFile && PauseAtStartupFile[0]) {
5533 jio_snprintf(filename, MAX_PATH, "%s", PauseAtStartupFile);
5534 } else {
5535 jio_snprintf(filename, MAX_PATH, "./vm.paused.%d", current_process_id());
5536 }
5537
5538 int fd = ::open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0666);
5539 if (fd != -1) {
5540 struct stat buf;
5541 ::close(fd);
5542 while (::stat(filename, &buf) == 0) {
5543 (void)::poll(NULL, 0, 100);
5544 }
5545 } else {
5546 jio_fprintf(stderr,
5547 "Could not open pause file '%s', continuing immediately.\n", filename);
5548 }
5549 }
5550
5551
5552 // Refer to the comments in os_solaris.cpp park-unpark. The next two
5553 // comment paragraphs are worth repeating here:
5554 //
5555 // Assumption:
5556 // Only one parker can exist on an event, which is why we allocate
5557 // them per-thread. Multiple unparkers can coexist.
5558 //
5559 // _Event serves as a restricted-range semaphore.
5560 // -1 : thread is blocked, i.e. there is a waiter
5561 // 0 : neutral: thread is running or ready,
5562 // could have been signaled after a wait started
5563 // 1 : signaled - thread is running or ready
5564 //
5565
5566 // utility to compute the abstime argument to timedwait:
5567 // millis is the relative timeout time
5568 // abstime will be the absolute timeout time
5569 // TODO: replace compute_abstime() with unpackTime()
5570
5571 static struct timespec* compute_abstime(timespec* abstime, jlong millis) {
5572 if (millis < 0) millis = 0;
5573
5574 jlong seconds = millis / 1000;
5575 millis %= 1000;
5576 if (seconds > 50000000) { // see man cond_timedwait(3T)
5577 seconds = 50000000;
5578 }
5579
5580 if (os::supports_monotonic_clock()) {
5581 struct timespec now;
5582 int status = os::Linux::clock_gettime(CLOCK_MONOTONIC, &now);
5583 assert_status(status == 0, status, "clock_gettime");
5584 abstime->tv_sec = now.tv_sec + seconds;
5585 long nanos = now.tv_nsec + millis * NANOSECS_PER_MILLISEC;
5586 if (nanos >= NANOSECS_PER_SEC) {
5587 abstime->tv_sec += 1;
5588 nanos -= NANOSECS_PER_SEC;
5589 }
5590 abstime->tv_nsec = nanos;
5591 } else {
5592 struct timeval now;
5593 int status = gettimeofday(&now, NULL);
5594 assert(status == 0, "gettimeofday");
5595 abstime->tv_sec = now.tv_sec + seconds;
5596 long usec = now.tv_usec + millis * 1000;
5597 if (usec >= 1000000) {
5598 abstime->tv_sec += 1;
5599 usec -= 1000000;
5600 }
5601 abstime->tv_nsec = usec * 1000;
5602 }
5603 return abstime;
5604 }
5605
5606 void os::PlatformEvent::park() { // AKA "down()"
5607 // Transitions for _Event:
5608 // -1 => -1 : illegal
5609 // 1 => 0 : pass - return immediately
5610 // 0 => -1 : block; then set _Event to 0 before returning
5611
5612 // Invariant: Only the thread associated with the Event/PlatformEvent
5613 // may call park().
5614 // TODO: assert that _Assoc != NULL or _Assoc == Self
5615 assert(_nParked == 0, "invariant");
5616
5617 int v;
5618 for (;;) {
5619 v = _Event;
5620 if (Atomic::cmpxchg(v-1, &_Event, v) == v) break;
5621 }
5622 guarantee(v >= 0, "invariant");
5623 if (v == 0) {
5624 // Do this the hard way by blocking ...
5625 int status = pthread_mutex_lock(_mutex);
5626 assert_status(status == 0, status, "mutex_lock");
5627 guarantee(_nParked == 0, "invariant");
5628 ++_nParked;
5629 while (_Event < 0) {
5630 status = pthread_cond_wait(_cond, _mutex);
5631 // for some reason, under 2.7 lwp_cond_wait() may return ETIME ...
5632 // Treat this the same as if the wait was interrupted
5633 if (status == ETIME) { status = EINTR; }
5634 assert_status(status == 0 || status == EINTR, status, "cond_wait");
5635 }
5636 --_nParked;
5637
5638 _Event = 0;
5639 status = pthread_mutex_unlock(_mutex);
5640 assert_status(status == 0, status, "mutex_unlock");
5641 // Paranoia to ensure our locked and lock-free paths interact
5642 // correctly with each other.
5643 OrderAccess::fence();
5644 }
5645 guarantee(_Event >= 0, "invariant");
5646 }
5647
5648 int os::PlatformEvent::park(jlong millis) {
5649 // Transitions for _Event:
5650 // -1 => -1 : illegal
5651 // 1 => 0 : pass - return immediately
5652 // 0 => -1 : block; then set _Event to 0 before returning
5653
5654 guarantee(_nParked == 0, "invariant");
5655
5656 int v;
5657 for (;;) {
5658 v = _Event;
5659 if (Atomic::cmpxchg(v-1, &_Event, v) == v) break;
5660 }
5661 guarantee(v >= 0, "invariant");
5662 if (v != 0) return OS_OK;
5663
5664 // We do this the hard way, by blocking the thread.
5665 // Consider enforcing a minimum timeout value.
5666 struct timespec abst;
5667 compute_abstime(&abst, millis);
5668
5669 int ret = OS_TIMEOUT;
5670 int status = pthread_mutex_lock(_mutex);
5671 assert_status(status == 0, status, "mutex_lock");
5672 guarantee(_nParked == 0, "invariant");
5673 ++_nParked;
5674
5675 // Object.wait(timo) will return because of
5676 // (a) notification
5677 // (b) timeout
5678 // (c) thread.interrupt
5679 //
5680 // Thread.interrupt and object.notify{All} both call Event::set.
5681 // That is, we treat thread.interrupt as a special case of notification.
5682 // We ignore spurious OS wakeups unless FilterSpuriousWakeups is false.
5683 // We assume all ETIME returns are valid.
5684 //
5685 // TODO: properly differentiate simultaneous notify+interrupt.
5686 // In that case, we should propagate the notify to another waiter.
5687
5688 while (_Event < 0) {
5689 status = pthread_cond_timedwait(_cond, _mutex, &abst);
5690 assert_status(status == 0 || status == EINTR ||
5691 status == ETIME || status == ETIMEDOUT,
5692 status, "cond_timedwait");
5693 if (!FilterSpuriousWakeups) break; // previous semantics
5694 if (status == ETIME || status == ETIMEDOUT) break;
5695 // We consume and ignore EINTR and spurious wakeups.
5696 }
5697 --_nParked;
5698 if (_Event >= 0) {
5699 ret = OS_OK;
5700 }
5701 _Event = 0;
5702 status = pthread_mutex_unlock(_mutex);
5703 assert_status(status == 0, status, "mutex_unlock");
5704 assert(_nParked == 0, "invariant");
5705 // Paranoia to ensure our locked and lock-free paths interact
5706 // correctly with each other.
5707 OrderAccess::fence();
5708 return ret;
5709 }
5710
5711 void os::PlatformEvent::unpark() {
5712 // Transitions for _Event:
5713 // 0 => 1 : just return
5714 // 1 => 1 : just return
5715 // -1 => either 0 or 1; must signal target thread
5716 // That is, we can safely transition _Event from -1 to either
5717 // 0 or 1.
5718 // See also: "Semaphores in Plan 9" by Mullender & Cox
5719 //
5720 // Note: Forcing a transition from "-1" to "1" on an unpark() means
5721 // that it will take two back-to-back park() calls for the owning
5722 // thread to block. This has the benefit of forcing a spurious return
5723 // from the first park() call after an unpark() call which will help
5724 // shake out uses of park() and unpark() without condition variables.
5725
5726 if (Atomic::xchg(1, &_Event) >= 0) return;
5727
5728 // Wait for the thread associated with the event to vacate
5729 int status = pthread_mutex_lock(_mutex);
5730 assert_status(status == 0, status, "mutex_lock");
5731 int AnyWaiters = _nParked;
5732 assert(AnyWaiters == 0 || AnyWaiters == 1, "invariant");
5733 status = pthread_mutex_unlock(_mutex);
5734 assert_status(status == 0, status, "mutex_unlock");
5735 if (AnyWaiters != 0) {
5736 // Note that we signal() *after* dropping the lock for "immortal" Events.
5737 // This is safe and avoids a common class of futile wakeups. In rare
5738 // circumstances this can cause a thread to return prematurely from
5739 // cond_{timed}wait() but the spurious wakeup is benign and the victim
5740 // will simply re-test the condition and re-park itself.
5741 // This provides particular benefit if the underlying platform does not
5742 // provide wait morphing.
5743 status = pthread_cond_signal(_cond);
5744 assert_status(status == 0, status, "cond_signal");
5745 }
5746 }
5747
5748
5749 // JSR166
5750 // -------------------------------------------------------
5751
5752 // The solaris and linux implementations of park/unpark are fairly
5753 // conservative for now, but can be improved. They currently use a
5754 // mutex/condvar pair, plus a a count.
5755 // Park decrements count if > 0, else does a condvar wait. Unpark
5756 // sets count to 1 and signals condvar. Only one thread ever waits
5757 // on the condvar. Contention seen when trying to park implies that someone
5758 // is unparking you, so don't wait. And spurious returns are fine, so there
5759 // is no need to track notifications.
5760
5761 // This code is common to linux and solaris and will be moved to a
5762 // common place in dolphin.
5763 //
5764 // The passed in time value is either a relative time in nanoseconds
5765 // or an absolute time in milliseconds. Either way it has to be unpacked
5766 // into suitable seconds and nanoseconds components and stored in the
5767 // given timespec structure.
5768 // Given time is a 64-bit value and the time_t used in the timespec is only
5769 // a signed-32-bit value (except on 64-bit Linux) we have to watch for
5770 // overflow if times way in the future are given. Further on Solaris versions
5771 // prior to 10 there is a restriction (see cond_timedwait) that the specified
5772 // number of seconds, in abstime, is less than current_time + 100,000,000.
5773 // As it will be 28 years before "now + 100000000" will overflow we can
5774 // ignore overflow and just impose a hard-limit on seconds using the value
5775 // of "now + 100,000,000". This places a limit on the timeout of about 3.17
5776 // years from "now".
5777
5778 static void unpackTime(timespec* absTime, bool isAbsolute, jlong time) {
5779 assert(time > 0, "convertTime");
5780 time_t max_secs = 0;
5781
5782 if (!os::supports_monotonic_clock() || isAbsolute) {
5783 struct timeval now;
5784 int status = gettimeofday(&now, NULL);
5785 assert(status == 0, "gettimeofday");
5786
5787 max_secs = now.tv_sec + MAX_SECS;
5788
5789 if (isAbsolute) {
5790 jlong secs = time / 1000;
5791 if (secs > max_secs) {
5792 absTime->tv_sec = max_secs;
5793 } else {
5794 absTime->tv_sec = secs;
5795 }
5796 absTime->tv_nsec = (time % 1000) * NANOSECS_PER_MILLISEC;
5797 } else {
5798 jlong secs = time / NANOSECS_PER_SEC;
5799 if (secs >= MAX_SECS) {
5800 absTime->tv_sec = max_secs;
5801 absTime->tv_nsec = 0;
5802 } else {
5803 absTime->tv_sec = now.tv_sec + secs;
5804 absTime->tv_nsec = (time % NANOSECS_PER_SEC) + now.tv_usec*1000;
5805 if (absTime->tv_nsec >= NANOSECS_PER_SEC) {
5806 absTime->tv_nsec -= NANOSECS_PER_SEC;
5807 ++absTime->tv_sec; // note: this must be <= max_secs
5808 }
5809 }
5810 }
5811 } else {
5812 // must be relative using monotonic clock
5813 struct timespec now;
5814 int status = os::Linux::clock_gettime(CLOCK_MONOTONIC, &now);
5815 assert_status(status == 0, status, "clock_gettime");
5816 max_secs = now.tv_sec + MAX_SECS;
5817 jlong secs = time / NANOSECS_PER_SEC;
5818 if (secs >= MAX_SECS) {
5819 absTime->tv_sec = max_secs;
5820 absTime->tv_nsec = 0;
5821 } else {
5822 absTime->tv_sec = now.tv_sec + secs;
5823 absTime->tv_nsec = (time % NANOSECS_PER_SEC) + now.tv_nsec;
5824 if (absTime->tv_nsec >= NANOSECS_PER_SEC) {
5825 absTime->tv_nsec -= NANOSECS_PER_SEC;
5826 ++absTime->tv_sec; // note: this must be <= max_secs
5827 }
5828 }
5829 }
5830 assert(absTime->tv_sec >= 0, "tv_sec < 0");
5831 assert(absTime->tv_sec <= max_secs, "tv_sec > max_secs");
5832 assert(absTime->tv_nsec >= 0, "tv_nsec < 0");
5833 assert(absTime->tv_nsec < NANOSECS_PER_SEC, "tv_nsec >= nanos_per_sec");
5834 }
5835
5836 void Parker::park(bool isAbsolute, jlong time) {
5837 // Ideally we'd do something useful while spinning, such
5838 // as calling unpackTime().
5839
5840 // Optional fast-path check:
5841 // Return immediately if a permit is available.
5842 // We depend on Atomic::xchg() having full barrier semantics
5843 // since we are doing a lock-free update to _counter.
5844 if (Atomic::xchg(0, &_counter) > 0) return;
5845
5846 Thread* thread = Thread::current();
5847 assert(thread->is_Java_thread(), "Must be JavaThread");
5848 JavaThread *jt = (JavaThread *)thread;
5849
5850 // Optional optimization -- avoid state transitions if there's an interrupt pending.
5851 // Check interrupt before trying to wait
5852 if (Thread::is_interrupted(thread, false)) {
5853 return;
5854 }
5855
5856 // Next, demultiplex/decode time arguments
5857 timespec absTime;
5858 if (time < 0 || (isAbsolute && time == 0)) { // don't wait at all
5859 return;
5860 }
5861 if (time > 0) {
5862 unpackTime(&absTime, isAbsolute, time);
5863 }
5864
5865
5866 // Enter safepoint region
5867 // Beware of deadlocks such as 6317397.
5868 // The per-thread Parker:: mutex is a classic leaf-lock.
5869 // In particular a thread must never block on the Threads_lock while
5870 // holding the Parker:: mutex. If safepoints are pending both the
5871 // the ThreadBlockInVM() CTOR and DTOR may grab Threads_lock.
5872 ThreadBlockInVM tbivm(jt);
5873
5874 // Don't wait if cannot get lock since interference arises from
5875 // unblocking. Also. check interrupt before trying wait
5876 if (Thread::is_interrupted(thread, false) || pthread_mutex_trylock(_mutex) != 0) {
5877 return;
5878 }
5879
5880 int status;
5881 if (_counter > 0) { // no wait needed
5882 _counter = 0;
5883 status = pthread_mutex_unlock(_mutex);
5884 assert_status(status == 0, status, "invariant");
5885 // Paranoia to ensure our locked and lock-free paths interact
5886 // correctly with each other and Java-level accesses.
5887 OrderAccess::fence();
5888 return;
5889 }
5890
5891 #ifdef ASSERT
5892 // Don't catch signals while blocked; let the running threads have the signals.
5893 // (This allows a debugger to break into the running thread.)
5894 sigset_t oldsigs;
5895 sigemptyset(&oldsigs);
5896 sigset_t* allowdebug_blocked = os::Linux::allowdebug_blocked_signals();
5897 pthread_sigmask(SIG_BLOCK, allowdebug_blocked, &oldsigs);
5898 #endif
5899
5900 OSThreadWaitState osts(thread->osthread(), false /* not Object.wait() */);
5901 jt->set_suspend_equivalent();
5902 // cleared by handle_special_suspend_equivalent_condition() or java_suspend_self()
5903
5904 assert(_cur_index == -1, "invariant");
5905 if (time == 0) {
5906 _cur_index = REL_INDEX; // arbitrary choice when not timed
5907 status = pthread_cond_wait(&_cond[_cur_index], _mutex);
5908 } else {
5909 _cur_index = isAbsolute ? ABS_INDEX : REL_INDEX;
5910 status = pthread_cond_timedwait(&_cond[_cur_index], _mutex, &absTime);
5911 }
5912 _cur_index = -1;
5913 assert_status(status == 0 || status == EINTR ||
5914 status == ETIME || status == ETIMEDOUT,
5915 status, "cond_timedwait");
5916
5917 #ifdef ASSERT
5918 pthread_sigmask(SIG_SETMASK, &oldsigs, NULL);
5919 #endif
5920
5921 _counter = 0;
5922 status = pthread_mutex_unlock(_mutex);
5923 assert_status(status == 0, status, "invariant");
5924 // Paranoia to ensure our locked and lock-free paths interact
5925 // correctly with each other and Java-level accesses.
5926 OrderAccess::fence();
5927
5928 // If externally suspended while waiting, re-suspend
5929 if (jt->handle_special_suspend_equivalent_condition()) {
5930 jt->java_suspend_self();
5931 }
5932 }
5933
5934 void Parker::unpark() {
5935 int status = pthread_mutex_lock(_mutex);
5936 assert_status(status == 0, status, "invariant");
5937 const int s = _counter;
5938 _counter = 1;
5939 // must capture correct index before unlocking
5940 int index = _cur_index;
5941 status = pthread_mutex_unlock(_mutex);
5942 assert_status(status == 0, status, "invariant");
5943 if (s < 1 && index != -1) {
5944 // thread is definitely parked
5945 status = pthread_cond_signal(&_cond[index]);
5946 assert_status(status == 0, status, "invariant");
5947 }
5948 }
5949
5950
5951 extern char** environ;
5952
5953 // Run the specified command in a separate process. Return its exit value,
5954 // or -1 on failure (e.g. can't fork a new process).
5955 // Unlike system(), this function can be called from signal handler. It
5956 // doesn't block SIGINT et al.
5957 int os::fork_and_exec(char* cmd) {
5958 const char * argv[4] = {"sh", "-c", cmd, NULL};
5959
5960 pid_t pid = fork();
5961
5962 if (pid < 0) {
5963 // fork failed
5964 return -1;
5965
5966 } else if (pid == 0) {
5967 // child process
5968
5969 execve("/bin/sh", (char* const*)argv, environ);
5970
5971 // execve failed
5972 _exit(-1);
5973
5974 } else {
5975 // copied from J2SE ..._waitForProcessExit() in UNIXProcess_md.c; we don't
5976 // care about the actual exit code, for now.
5977
5978 int status;
5979
5980 // Wait for the child process to exit. This returns immediately if
5981 // the child has already exited. */
5982 while (waitpid(pid, &status, 0) < 0) {
5983 switch (errno) {
5984 case ECHILD: return 0;
5985 case EINTR: break;
5986 default: return -1;
5987 }
5988 }
5989
5990 if (WIFEXITED(status)) {
5991 // The child exited normally; get its exit code.
5992 return WEXITSTATUS(status);
5993 } else if (WIFSIGNALED(status)) {
5994 // The child exited because of a signal
5995 // The best value to return is 0x80 + signal number,
5996 // because that is what all Unix shells do, and because
5997 // it allows callers to distinguish between process exit and
5998 // process death by signal.
5999 return 0x80 + WTERMSIG(status);
6000 } else {
6001 // Unknown exit code; pass it through
6002 return status;
6003 }
6004 }
6005 }
6006
6007 // is_headless_jre()
6008 //
6009 // Test for the existence of xawt/libmawt.so or libawt_xawt.so
6010 // in order to report if we are running in a headless jre
6011 //
6012 // Since JDK8 xawt/libmawt.so was moved into the same directory
6013 // as libawt.so, and renamed libawt_xawt.so
6014 //
6015 bool os::is_headless_jre() {
6016 struct stat statbuf;
6017 char buf[MAXPATHLEN];
6018 char libmawtpath[MAXPATHLEN];
6019 const char *xawtstr = "/xawt/libmawt.so";
6020 const char *new_xawtstr = "/libawt_xawt.so";
6021 char *p;
6022
6023 // Get path to libjvm.so
6024 os::jvm_path(buf, sizeof(buf));
6025
6026 // Get rid of libjvm.so
6027 p = strrchr(buf, '/');
6028 if (p == NULL) {
6029 return false;
6030 } else {
6031 *p = '\0';
6032 }
6033
6034 // Get rid of client or server
6035 p = strrchr(buf, '/');
6036 if (p == NULL) {
6037 return false;
6038 } else {
6039 *p = '\0';
6040 }
6041
6042 // check xawt/libmawt.so
6043 strcpy(libmawtpath, buf);
6044 strcat(libmawtpath, xawtstr);
6045 if (::stat(libmawtpath, &statbuf) == 0) return false;
6046
6047 // check libawt_xawt.so
6048 strcpy(libmawtpath, buf);
6049 strcat(libmawtpath, new_xawtstr);
6050 if (::stat(libmawtpath, &statbuf) == 0) return false;
6051
6052 return true;
6053 }
6054
6055 // Get the default path to the core file
6056 // Returns the length of the string
6057 int os::get_core_path(char* buffer, size_t bufferSize) {
6058 /*
6059 * Max length of /proc/sys/kernel/core_pattern is 128 characters.
6060 * See https://www.kernel.org/doc/Documentation/sysctl/kernel.txt
6061 */
6062 const int core_pattern_len = 129;
6063 char core_pattern[core_pattern_len] = {0};
6064
6065 int core_pattern_file = ::open("/proc/sys/kernel/core_pattern", O_RDONLY);
6066 if (core_pattern_file == -1) {
6067 return -1;
6068 }
6069
6070 ssize_t ret = ::read(core_pattern_file, core_pattern, core_pattern_len);
6071 ::close(core_pattern_file);
6072 if (ret <= 0 || ret >= core_pattern_len || core_pattern[0] == '\n') {
6073 return -1;
6074 }
6075 if (core_pattern[ret-1] == '\n') {
6076 core_pattern[ret-1] = '\0';
6077 } else {
6078 core_pattern[ret] = '\0';
6079 }
6080
6081 char *pid_pos = strstr(core_pattern, "%p");
6082 int written;
6083
6084 if (core_pattern[0] == '/') {
6085 written = jio_snprintf(buffer, bufferSize, "%s", core_pattern);
6086 } else {
6087 char cwd[PATH_MAX];
6088
6089 const char* p = get_current_directory(cwd, PATH_MAX);
6090 if (p == NULL) {
6091 return -1;
6092 }
6093
6094 if (core_pattern[0] == '|') {
6095 written = jio_snprintf(buffer, bufferSize,
6096 "\"%s\" (or dumping to %s/core.%d)",
6097 &core_pattern[1], p, current_process_id());
6098 } else {
6099 written = jio_snprintf(buffer, bufferSize, "%s/%s", p, core_pattern);
6100 }
6101 }
6102
6103 if (written < 0) {
6104 return -1;
6105 }
6106
6107 if (((size_t)written < bufferSize) && (pid_pos == NULL) && (core_pattern[0] != '|')) {
6108 int core_uses_pid_file = ::open("/proc/sys/kernel/core_uses_pid", O_RDONLY);
6109
6110 if (core_uses_pid_file != -1) {
6111 char core_uses_pid = 0;
6112 ssize_t ret = ::read(core_uses_pid_file, &core_uses_pid, 1);
6113 ::close(core_uses_pid_file);
6114
6115 if (core_uses_pid == '1') {
6116 jio_snprintf(buffer + written, bufferSize - written,
6117 ".%d", current_process_id());
6118 }
6119 }
6120 }
6121
6122 return strlen(buffer);
6123 }
6124
6125 bool os::start_debugging(char *buf, int buflen) {
6126 int len = (int)strlen(buf);
6127 char *p = &buf[len];
6128
6129 jio_snprintf(p, buflen-len,
6130 "\n\n"
6131 "Do you want to debug the problem?\n\n"
6132 "To debug, run 'gdb /proc/%d/exe %d'; then switch to thread " UINTX_FORMAT " (" INTPTR_FORMAT ")\n"
6133 "Enter 'yes' to launch gdb automatically (PATH must include gdb)\n"
6134 "Otherwise, press RETURN to abort...",
6135 os::current_process_id(), os::current_process_id(),
6136 os::current_thread_id(), os::current_thread_id());
6137
6138 bool yes = os::message_box("Unexpected Error", buf);
6139
6140 if (yes) {
6141 // yes, user asked VM to launch debugger
6142 jio_snprintf(buf, sizeof(char)*buflen, "gdb /proc/%d/exe %d",
6143 os::current_process_id(), os::current_process_id());
6144
6145 os::fork_and_exec(buf);
6146 yes = false;
6147 }
6148 return yes;
6149 }
6150
6151 static inline struct timespec get_mtime(const char* filename) {
6152 struct stat st;
6153 int ret = os::stat(filename, &st);
6154 assert(ret == 0, "failed to stat() file '%s': %s", filename, strerror(errno));
6155 return st.st_mtim;
6156 }
6157
6158 int os::compare_file_modified_times(const char* file1, const char* file2) {
6159 struct timespec filetime1 = get_mtime(file1);
6160 struct timespec filetime2 = get_mtime(file2);
6161 int diff = filetime1.tv_sec - filetime2.tv_sec;
6162 if (diff == 0) {
6163 return filetime1.tv_nsec - filetime2.tv_nsec;
6164 }
6165 return diff;
6166 }
6167
6168 /////////////// Unit tests ///////////////
6169
6170 #ifndef PRODUCT
6171
6172 #define test_log(...) \
6173 do { \
6174 if (VerboseInternalVMTests) { \
6175 tty->print_cr(__VA_ARGS__); \
6176 tty->flush(); \
6177 } \
6178 } while (false)
6179
6180 class TestReserveMemorySpecial : AllStatic {
6181 public:
6182 static void small_page_write(void* addr, size_t size) {
6183 size_t page_size = os::vm_page_size();
6184
6185 char* end = (char*)addr + size;
6186 for (char* p = (char*)addr; p < end; p += page_size) {
6187 *p = 1;
6188 }
6189 }
6190
6191 static void test_reserve_memory_special_huge_tlbfs_only(size_t size) {
6192 if (!UseHugeTLBFS) {
6193 return;
6194 }
6195
6196 test_log("test_reserve_memory_special_huge_tlbfs_only(" SIZE_FORMAT ")", size);
6197
6198 char* addr = os::Linux::reserve_memory_special_huge_tlbfs_only(size, NULL, false);
6199
6200 if (addr != NULL) {
6201 small_page_write(addr, size);
6202
6203 os::Linux::release_memory_special_huge_tlbfs(addr, size);
6204 }
6205 }
6206
6207 static void test_reserve_memory_special_huge_tlbfs_only() {
6208 if (!UseHugeTLBFS) {
6209 return;
6210 }
6211
6212 size_t lp = os::large_page_size();
6213
6214 for (size_t size = lp; size <= lp * 10; size += lp) {
6215 test_reserve_memory_special_huge_tlbfs_only(size);
6216 }
6217 }
6218
6219 static void test_reserve_memory_special_huge_tlbfs_mixed() {
6220 size_t lp = os::large_page_size();
6221 size_t ag = os::vm_allocation_granularity();
6222
6223 // sizes to test
6224 const size_t sizes[] = {
6225 lp, lp + ag, lp + lp / 2, lp * 2,
6226 lp * 2 + ag, lp * 2 - ag, lp * 2 + lp / 2,
6227 lp * 10, lp * 10 + lp / 2
6228 };
6229 const int num_sizes = sizeof(sizes) / sizeof(size_t);
6230
6231 // For each size/alignment combination, we test three scenarios:
6232 // 1) with req_addr == NULL
6233 // 2) with a non-null req_addr at which we expect to successfully allocate
6234 // 3) with a non-null req_addr which contains a pre-existing mapping, at which we
6235 // expect the allocation to either fail or to ignore req_addr
6236
6237 // Pre-allocate two areas; they shall be as large as the largest allocation
6238 // and aligned to the largest alignment we will be testing.
6239 const size_t mapping_size = sizes[num_sizes - 1] * 2;
6240 char* const mapping1 = (char*) ::mmap(NULL, mapping_size,
6241 PROT_NONE, MAP_PRIVATE|MAP_ANONYMOUS|MAP_NORESERVE,
6242 -1, 0);
6243 assert(mapping1 != MAP_FAILED, "should work");
6244
6245 char* const mapping2 = (char*) ::mmap(NULL, mapping_size,
6246 PROT_NONE, MAP_PRIVATE|MAP_ANONYMOUS|MAP_NORESERVE,
6247 -1, 0);
6248 assert(mapping2 != MAP_FAILED, "should work");
6249
6250 // Unmap the first mapping, but leave the second mapping intact: the first
6251 // mapping will serve as a value for a "good" req_addr (case 2). The second
6252 // mapping, still intact, as "bad" req_addr (case 3).
6253 ::munmap(mapping1, mapping_size);
6254
6255 // Case 1
6256 test_log("%s, req_addr NULL:", __FUNCTION__);
6257 test_log("size align result");
6258
6259 for (int i = 0; i < num_sizes; i++) {
6260 const size_t size = sizes[i];
6261 for (size_t alignment = ag; is_size_aligned(size, alignment); alignment *= 2) {
6262 char* p = os::Linux::reserve_memory_special_huge_tlbfs_mixed(size, alignment, NULL, false);
6263 test_log(SIZE_FORMAT_HEX " " SIZE_FORMAT_HEX " -> " PTR_FORMAT " %s",
6264 size, alignment, p2i(p), (p != NULL ? "" : "(failed)"));
6265 if (p != NULL) {
6266 assert(is_ptr_aligned(p, alignment), "must be");
6267 small_page_write(p, size);
6268 os::Linux::release_memory_special_huge_tlbfs(p, size);
6269 }
6270 }
6271 }
6272
6273 // Case 2
6274 test_log("%s, req_addr non-NULL:", __FUNCTION__);
6275 test_log("size align req_addr result");
6276
6277 for (int i = 0; i < num_sizes; i++) {
6278 const size_t size = sizes[i];
6279 for (size_t alignment = ag; is_size_aligned(size, alignment); alignment *= 2) {
6280 char* const req_addr = (char*) align_ptr_up(mapping1, alignment);
6281 char* p = os::Linux::reserve_memory_special_huge_tlbfs_mixed(size, alignment, req_addr, false);
6282 test_log(SIZE_FORMAT_HEX " " SIZE_FORMAT_HEX " " PTR_FORMAT " -> " PTR_FORMAT " %s",
6283 size, alignment, p2i(req_addr), p2i(p),
6284 ((p != NULL ? (p == req_addr ? "(exact match)" : "") : "(failed)")));
6285 if (p != NULL) {
6286 assert(p == req_addr, "must be");
6287 small_page_write(p, size);
6288 os::Linux::release_memory_special_huge_tlbfs(p, size);
6289 }
6290 }
6291 }
6292
6293 // Case 3
6294 test_log("%s, req_addr non-NULL with preexisting mapping:", __FUNCTION__);
6295 test_log("size align req_addr result");
6296
6297 for (int i = 0; i < num_sizes; i++) {
6298 const size_t size = sizes[i];
6299 for (size_t alignment = ag; is_size_aligned(size, alignment); alignment *= 2) {
6300 char* const req_addr = (char*) align_ptr_up(mapping2, alignment);
6301 char* p = os::Linux::reserve_memory_special_huge_tlbfs_mixed(size, alignment, req_addr, false);
6302 test_log(SIZE_FORMAT_HEX " " SIZE_FORMAT_HEX " " PTR_FORMAT " -> " PTR_FORMAT " %s",
6303 size, alignment, p2i(req_addr), p2i(p), ((p != NULL ? "" : "(failed)")));
6304 // as the area around req_addr contains already existing mappings, the API should always
6305 // return NULL (as per contract, it cannot return another address)
6306 assert(p == NULL, "must be");
6307 }
6308 }
6309
6310 ::munmap(mapping2, mapping_size);
6311
6312 }
6313
6314 static void test_reserve_memory_special_huge_tlbfs() {
6315 if (!UseHugeTLBFS) {
6316 return;
6317 }
6318
6319 test_reserve_memory_special_huge_tlbfs_only();
6320 test_reserve_memory_special_huge_tlbfs_mixed();
6321 }
6322
6323 static void test_reserve_memory_special_shm(size_t size, size_t alignment) {
6324 if (!UseSHM) {
6325 return;
6326 }
6327
6328 test_log("test_reserve_memory_special_shm(" SIZE_FORMAT ", " SIZE_FORMAT ")", size, alignment);
6329
6330 char* addr = os::Linux::reserve_memory_special_shm(size, alignment, NULL, false);
6331
6332 if (addr != NULL) {
6333 assert(is_ptr_aligned(addr, alignment), "Check");
6334 assert(is_ptr_aligned(addr, os::large_page_size()), "Check");
6335
6336 small_page_write(addr, size);
6337
6338 os::Linux::release_memory_special_shm(addr, size);
6339 }
6340 }
6341
6342 static void test_reserve_memory_special_shm() {
6343 size_t lp = os::large_page_size();
6344 size_t ag = os::vm_allocation_granularity();
6345
6346 for (size_t size = ag; size < lp * 3; size += ag) {
6347 for (size_t alignment = ag; is_size_aligned(size, alignment); alignment *= 2) {
6348 test_reserve_memory_special_shm(size, alignment);
6349 }
6350 }
6351 }
6352
6353 static void test() {
6354 test_reserve_memory_special_huge_tlbfs();
6355 test_reserve_memory_special_shm();
6356 }
6357 };
6358
6359 void TestReserveMemorySpecial_test() {
6360 TestReserveMemorySpecial::test();
6361 }
6362
6363 #endif