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