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