Mercurial > hg > truffle
annotate src/os/linux/vm/os_linux.cpp @ 569:2cacccded90f
6805950: Typos in andL_rReg_imm instructions in x86_64.ad
Summary: There are two typos in andL_rReg_imm instructions in x86_64.ad.
Reviewed-by: kvn
author | twisti |
---|---|
date | Tue, 17 Feb 2009 11:19:31 +0100 |
parents | 9656bebe85a7 |
children | fc7ab6287598 |
rev | line source |
---|---|
0 | 1 /* |
196 | 2 * Copyright 1999-2008 Sun Microsystems, Inc. All Rights Reserved. |
0 | 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any questions. | |
22 * | |
23 */ | |
24 | |
25 // do not include precompiled header file | |
26 # include "incls/_os_linux.cpp.incl" | |
27 | |
28 // put OS-includes here | |
29 # include <sys/types.h> | |
30 # include <sys/mman.h> | |
31 # include <pthread.h> | |
32 # include <signal.h> | |
33 # include <errno.h> | |
34 # include <dlfcn.h> | |
35 # include <stdio.h> | |
36 # include <unistd.h> | |
37 # include <sys/resource.h> | |
38 # include <pthread.h> | |
39 # include <sys/stat.h> | |
40 # include <sys/time.h> | |
41 # include <sys/times.h> | |
42 # include <sys/utsname.h> | |
43 # include <sys/socket.h> | |
44 # include <sys/wait.h> | |
45 # include <pwd.h> | |
46 # include <poll.h> | |
47 # include <semaphore.h> | |
48 # include <fcntl.h> | |
49 # include <string.h> | |
50 # include <syscall.h> | |
51 # include <sys/sysinfo.h> | |
52 # include <gnu/libc-version.h> | |
53 # include <sys/ipc.h> | |
54 # include <sys/shm.h> | |
55 # include <link.h> | |
56 | |
57 #define MAX_PATH (2 * K) | |
58 | |
59 // for timer info max values which include all bits | |
60 #define ALL_64_BITS CONST64(0xFFFFFFFFFFFFFFFF) | |
61 #define SEC_IN_NANOSECS 1000000000LL | |
62 | |
63 //////////////////////////////////////////////////////////////////////////////// | |
64 // global variables | |
65 julong os::Linux::_physical_memory = 0; | |
66 | |
67 address os::Linux::_initial_thread_stack_bottom = NULL; | |
68 uintptr_t os::Linux::_initial_thread_stack_size = 0; | |
69 | |
70 int (*os::Linux::_clock_gettime)(clockid_t, struct timespec *) = NULL; | |
71 int (*os::Linux::_pthread_getcpuclockid)(pthread_t, clockid_t *) = NULL; | |
72 Mutex* os::Linux::_createThread_lock = NULL; | |
73 pthread_t os::Linux::_main_thread; | |
74 int os::Linux::_page_size = -1; | |
75 bool os::Linux::_is_floating_stack = false; | |
76 bool os::Linux::_is_NPTL = false; | |
77 bool os::Linux::_supports_fast_thread_cpu_time = false; | |
199
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
78 const char * os::Linux::_glibc_version = NULL; |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
79 const char * os::Linux::_libpthread_version = NULL; |
0 | 80 |
81 static jlong initial_time_count=0; | |
82 | |
83 static int clock_tics_per_sec = 100; | |
84 | |
85 // For diagnostics to print a message once. see run_periodic_checks | |
86 static sigset_t check_signal_done; | |
87 static bool check_signals = true;; | |
88 | |
89 static pid_t _initial_pid = 0; | |
90 | |
91 /* Signal number used to suspend/resume a thread */ | |
92 | |
93 /* do not use any signal number less than SIGSEGV, see 4355769 */ | |
94 static int SR_signum = SIGUSR2; | |
95 sigset_t SR_sigset; | |
96 | |
242 | 97 /* Used to protect dlsym() calls */ |
98 static pthread_mutex_t dl_mutex; | |
99 | |
0 | 100 //////////////////////////////////////////////////////////////////////////////// |
101 // utility functions | |
102 | |
103 static int SR_initialize(); | |
104 static int SR_finalize(); | |
105 | |
106 julong os::available_memory() { | |
107 return Linux::available_memory(); | |
108 } | |
109 | |
110 julong os::Linux::available_memory() { | |
111 // values in struct sysinfo are "unsigned long" | |
112 struct sysinfo si; | |
113 sysinfo(&si); | |
114 | |
115 return (julong)si.freeram * si.mem_unit; | |
116 } | |
117 | |
118 julong os::physical_memory() { | |
119 return Linux::physical_memory(); | |
120 } | |
121 | |
20
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
122 julong os::allocatable_physical_memory(julong size) { |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
123 #ifdef _LP64 |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
124 return size; |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
125 #else |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
126 julong result = MIN2(size, (julong)3800*M); |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
127 if (!is_allocatable(result)) { |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
128 // See comments under solaris for alignment considerations |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
129 julong reasonable_size = (julong)2*G - 2 * os::vm_page_size(); |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
130 result = MIN2(size, reasonable_size); |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
131 } |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
132 return result; |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
133 #endif // _LP64 |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
134 } |
e195fe4c40c7
6629887: 64-bit windows should not restrict default heap size to 1400m
phh
parents:
0
diff
changeset
|
135 |
0 | 136 //////////////////////////////////////////////////////////////////////////////// |
137 // environment support | |
138 | |
139 bool os::getenv(const char* name, char* buf, int len) { | |
140 const char* val = ::getenv(name); | |
141 if (val != NULL && strlen(val) < (size_t)len) { | |
142 strcpy(buf, val); | |
143 return true; | |
144 } | |
145 if (len > 0) buf[0] = 0; // return a null string | |
146 return false; | |
147 } | |
148 | |
149 | |
150 // Return true if user is running as root. | |
151 | |
152 bool os::have_special_privileges() { | |
153 static bool init = false; | |
154 static bool privileges = false; | |
155 if (!init) { | |
156 privileges = (getuid() != geteuid()) || (getgid() != getegid()); | |
157 init = true; | |
158 } | |
159 return privileges; | |
160 } | |
161 | |
162 | |
163 #ifndef SYS_gettid | |
164 // i386: 224, ia64: 1105, amd64: 186, sparc 143 | |
165 #ifdef __ia64__ | |
166 #define SYS_gettid 1105 | |
167 #elif __i386__ | |
168 #define SYS_gettid 224 | |
169 #elif __amd64__ | |
170 #define SYS_gettid 186 | |
171 #elif __sparc__ | |
172 #define SYS_gettid 143 | |
173 #else | |
174 #error define gettid for the arch | |
175 #endif | |
176 #endif | |
177 | |
178 // Cpu architecture string | |
179 #if defined(IA64) | |
180 static char cpu_arch[] = "ia64"; | |
181 #elif defined(IA32) | |
182 static char cpu_arch[] = "i386"; | |
183 #elif defined(AMD64) | |
184 static char cpu_arch[] = "amd64"; | |
185 #elif defined(SPARC) | |
186 # ifdef _LP64 | |
187 static char cpu_arch[] = "sparcv9"; | |
188 # else | |
189 static char cpu_arch[] = "sparc"; | |
190 # endif | |
191 #else | |
192 #error Add appropriate cpu_arch setting | |
193 #endif | |
194 | |
195 | |
196 // pid_t gettid() | |
197 // | |
198 // Returns the kernel thread id of the currently running thread. Kernel | |
199 // thread id is used to access /proc. | |
200 // | |
201 // (Note that getpid() on LinuxThreads returns kernel thread id too; but | |
202 // on NPTL, it returns the same pid for all threads, as required by POSIX.) | |
203 // | |
204 pid_t os::Linux::gettid() { | |
205 int rslt = syscall(SYS_gettid); | |
206 if (rslt == -1) { | |
207 // old kernel, no NPTL support | |
208 return getpid(); | |
209 } else { | |
210 return (pid_t)rslt; | |
211 } | |
212 } | |
213 | |
214 // Most versions of linux have a bug where the number of processors are | |
215 // determined by looking at the /proc file system. In a chroot environment, | |
216 // the system call returns 1. This causes the VM to act as if it is | |
217 // a single processor and elide locking (see is_MP() call). | |
218 static bool unsafe_chroot_detected = false; | |
199
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
219 static const char *unstable_chroot_error = "/proc file system not found.\n" |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
220 "Java may be unstable running multithreaded in a chroot " |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
221 "environment on Linux when /proc filesystem is not mounted."; |
0 | 222 |
223 void os::Linux::initialize_system_info() { | |
224 _processor_count = sysconf(_SC_NPROCESSORS_CONF); | |
225 if (_processor_count == 1) { | |
226 pid_t pid = os::Linux::gettid(); | |
227 char fname[32]; | |
228 jio_snprintf(fname, sizeof(fname), "/proc/%d", pid); | |
229 FILE *fp = fopen(fname, "r"); | |
230 if (fp == NULL) { | |
231 unsafe_chroot_detected = true; | |
232 } else { | |
233 fclose(fp); | |
234 } | |
235 } | |
236 _physical_memory = (julong)sysconf(_SC_PHYS_PAGES) * (julong)sysconf(_SC_PAGESIZE); | |
237 assert(_processor_count > 0, "linux error"); | |
238 } | |
239 | |
240 void os::init_system_properties_values() { | |
241 // char arch[12]; | |
242 // sysinfo(SI_ARCHITECTURE, arch, sizeof(arch)); | |
243 | |
244 // The next steps are taken in the product version: | |
245 // | |
246 // Obtain the JAVA_HOME value from the location of libjvm[_g].so. | |
247 // This library should be located at: | |
248 // <JAVA_HOME>/jre/lib/<arch>/{client|server}/libjvm[_g].so. | |
249 // | |
250 // If "/jre/lib/" appears at the right place in the path, then we | |
251 // assume libjvm[_g].so is installed in a JDK and we use this path. | |
252 // | |
253 // Otherwise exit with message: "Could not create the Java virtual machine." | |
254 // | |
255 // The following extra steps are taken in the debugging version: | |
256 // | |
257 // If "/jre/lib/" does NOT appear at the right place in the path | |
258 // instead of exit check for $JAVA_HOME environment variable. | |
259 // | |
260 // If it is defined and we are able to locate $JAVA_HOME/jre/lib/<arch>, | |
261 // then we append a fake suffix "hotspot/libjvm[_g].so" to this path so | |
262 // it looks like libjvm[_g].so is installed there | |
263 // <JAVA_HOME>/jre/lib/<arch>/hotspot/libjvm[_g].so. | |
264 // | |
265 // Otherwise exit. | |
266 // | |
267 // Important note: if the location of libjvm.so changes this | |
268 // code needs to be changed accordingly. | |
269 | |
270 // The next few definitions allow the code to be verbatim: | |
271 #define malloc(n) (char*)NEW_C_HEAP_ARRAY(char, (n)) | |
272 #define getenv(n) ::getenv(n) | |
273 | |
274 /* | |
275 * See ld(1): | |
276 * The linker uses the following search paths to locate required | |
277 * shared libraries: | |
278 * 1: ... | |
279 * ... | |
280 * 7: The default directories, normally /lib and /usr/lib. | |
281 */ | |
509
9656bebe85a7
6778662: fixes 64-bits libraries directory search paths on linux
kvn
parents:
477
diff
changeset
|
282 #if defined(AMD64) || defined(_LP64) && (defined(SPARC) || defined(PPC) || defined(S390)) |
9656bebe85a7
6778662: fixes 64-bits libraries directory search paths on linux
kvn
parents:
477
diff
changeset
|
283 #define DEFAULT_LIBPATH "/usr/lib64:/lib64:/lib:/usr/lib" |
9656bebe85a7
6778662: fixes 64-bits libraries directory search paths on linux
kvn
parents:
477
diff
changeset
|
284 #else |
0 | 285 #define DEFAULT_LIBPATH "/lib:/usr/lib" |
509
9656bebe85a7
6778662: fixes 64-bits libraries directory search paths on linux
kvn
parents:
477
diff
changeset
|
286 #endif |
0 | 287 |
288 #define EXTENSIONS_DIR "/lib/ext" | |
289 #define ENDORSED_DIR "/lib/endorsed" | |
290 #define REG_DIR "/usr/java/packages" | |
291 | |
292 { | |
293 /* sysclasspath, java_home, dll_dir */ | |
294 { | |
295 char *home_path; | |
296 char *dll_path; | |
297 char *pslash; | |
298 char buf[MAXPATHLEN]; | |
299 os::jvm_path(buf, sizeof(buf)); | |
300 | |
301 // Found the full path to libjvm.so. | |
302 // Now cut the path to <java_home>/jre if we can. | |
303 *(strrchr(buf, '/')) = '\0'; /* get rid of /libjvm.so */ | |
304 pslash = strrchr(buf, '/'); | |
305 if (pslash != NULL) | |
306 *pslash = '\0'; /* get rid of /{client|server|hotspot} */ | |
307 dll_path = malloc(strlen(buf) + 1); | |
308 if (dll_path == NULL) | |
309 return; | |
310 strcpy(dll_path, buf); | |
311 Arguments::set_dll_dir(dll_path); | |
312 | |
313 if (pslash != NULL) { | |
314 pslash = strrchr(buf, '/'); | |
315 if (pslash != NULL) { | |
316 *pslash = '\0'; /* get rid of /<arch> */ | |
317 pslash = strrchr(buf, '/'); | |
318 if (pslash != NULL) | |
319 *pslash = '\0'; /* get rid of /lib */ | |
320 } | |
321 } | |
322 | |
323 home_path = malloc(strlen(buf) + 1); | |
324 if (home_path == NULL) | |
325 return; | |
326 strcpy(home_path, buf); | |
327 Arguments::set_java_home(home_path); | |
328 | |
329 if (!set_boot_path('/', ':')) | |
330 return; | |
331 } | |
332 | |
333 /* | |
334 * Where to look for native libraries | |
335 * | |
336 * Note: Due to a legacy implementation, most of the library path | |
337 * is set in the launcher. This was to accomodate linking restrictions | |
338 * on legacy Linux implementations (which are no longer supported). | |
339 * Eventually, all the library path setting will be done here. | |
340 * | |
341 * However, to prevent the proliferation of improperly built native | |
342 * libraries, the new path component /usr/java/packages is added here. | |
343 * Eventually, all the library path setting will be done here. | |
344 */ | |
345 { | |
346 char *ld_library_path; | |
347 | |
348 /* | |
349 * Construct the invariant part of ld_library_path. Note that the | |
350 * space for the colon and the trailing null are provided by the | |
351 * nulls included by the sizeof operator (so actually we allocate | |
352 * a byte more than necessary). | |
353 */ | |
354 ld_library_path = (char *) malloc(sizeof(REG_DIR) + sizeof("/lib/") + | |
355 strlen(cpu_arch) + sizeof(DEFAULT_LIBPATH)); | |
356 sprintf(ld_library_path, REG_DIR "/lib/%s:" DEFAULT_LIBPATH, cpu_arch); | |
357 | |
358 /* | |
359 * Get the user setting of LD_LIBRARY_PATH, and prepended it. It | |
360 * should always exist (until the legacy problem cited above is | |
361 * addressed). | |
362 */ | |
363 char *v = getenv("LD_LIBRARY_PATH"); | |
364 if (v != NULL) { | |
365 char *t = ld_library_path; | |
366 /* That's +1 for the colon and +1 for the trailing '\0' */ | |
367 ld_library_path = (char *) malloc(strlen(v) + 1 + strlen(t) + 1); | |
368 sprintf(ld_library_path, "%s:%s", v, t); | |
369 } | |
370 Arguments::set_library_path(ld_library_path); | |
371 } | |
372 | |
373 /* | |
374 * Extensions directories. | |
375 * | |
376 * Note that the space for the colon and the trailing null are provided | |
377 * by the nulls included by the sizeof operator (so actually one byte more | |
378 * than necessary is allocated). | |
379 */ | |
380 { | |
381 char *buf = malloc(strlen(Arguments::get_java_home()) + | |
382 sizeof(EXTENSIONS_DIR) + sizeof(REG_DIR) + sizeof(EXTENSIONS_DIR)); | |
383 sprintf(buf, "%s" EXTENSIONS_DIR ":" REG_DIR EXTENSIONS_DIR, | |
384 Arguments::get_java_home()); | |
385 Arguments::set_ext_dirs(buf); | |
386 } | |
387 | |
388 /* Endorsed standards default directory. */ | |
389 { | |
390 char * buf; | |
391 buf = malloc(strlen(Arguments::get_java_home()) + sizeof(ENDORSED_DIR)); | |
392 sprintf(buf, "%s" ENDORSED_DIR, Arguments::get_java_home()); | |
393 Arguments::set_endorsed_dirs(buf); | |
394 } | |
395 } | |
396 | |
397 #undef malloc | |
398 #undef getenv | |
399 #undef EXTENSIONS_DIR | |
400 #undef ENDORSED_DIR | |
401 | |
402 // Done | |
403 return; | |
404 } | |
405 | |
406 //////////////////////////////////////////////////////////////////////////////// | |
407 // breakpoint support | |
408 | |
409 void os::breakpoint() { | |
410 BREAKPOINT; | |
411 } | |
412 | |
413 extern "C" void breakpoint() { | |
414 // use debugger to set breakpoint here | |
415 } | |
416 | |
417 //////////////////////////////////////////////////////////////////////////////// | |
418 // signal support | |
419 | |
420 debug_only(static bool signal_sets_initialized = false); | |
421 static sigset_t unblocked_sigs, vm_sigs, allowdebug_blocked_sigs; | |
422 | |
423 bool os::Linux::is_sig_ignored(int sig) { | |
424 struct sigaction oact; | |
425 sigaction(sig, (struct sigaction*)NULL, &oact); | |
426 void* ohlr = oact.sa_sigaction ? CAST_FROM_FN_PTR(void*, oact.sa_sigaction) | |
427 : CAST_FROM_FN_PTR(void*, oact.sa_handler); | |
428 if (ohlr == CAST_FROM_FN_PTR(void*, SIG_IGN)) | |
429 return true; | |
430 else | |
431 return false; | |
432 } | |
433 | |
434 void os::Linux::signal_sets_init() { | |
435 // Should also have an assertion stating we are still single-threaded. | |
436 assert(!signal_sets_initialized, "Already initialized"); | |
437 // Fill in signals that are necessarily unblocked for all threads in | |
438 // the VM. Currently, we unblock the following signals: | |
439 // SHUTDOWN{1,2,3}_SIGNAL: for shutdown hooks support (unless over-ridden | |
440 // by -Xrs (=ReduceSignalUsage)); | |
441 // BREAK_SIGNAL which is unblocked only by the VM thread and blocked by all | |
442 // other threads. The "ReduceSignalUsage" boolean tells us not to alter | |
443 // the dispositions or masks wrt these signals. | |
444 // Programs embedding the VM that want to use the above signals for their | |
445 // own purposes must, at this time, use the "-Xrs" option to prevent | |
446 // interference with shutdown hooks and BREAK_SIGNAL thread dumping. | |
447 // (See bug 4345157, and other related bugs). | |
448 // In reality, though, unblocking these signals is really a nop, since | |
449 // these signals are not blocked by default. | |
450 sigemptyset(&unblocked_sigs); | |
451 sigemptyset(&allowdebug_blocked_sigs); | |
452 sigaddset(&unblocked_sigs, SIGILL); | |
453 sigaddset(&unblocked_sigs, SIGSEGV); | |
454 sigaddset(&unblocked_sigs, SIGBUS); | |
455 sigaddset(&unblocked_sigs, SIGFPE); | |
456 sigaddset(&unblocked_sigs, SR_signum); | |
457 | |
458 if (!ReduceSignalUsage) { | |
459 if (!os::Linux::is_sig_ignored(SHUTDOWN1_SIGNAL)) { | |
460 sigaddset(&unblocked_sigs, SHUTDOWN1_SIGNAL); | |
461 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN1_SIGNAL); | |
462 } | |
463 if (!os::Linux::is_sig_ignored(SHUTDOWN2_SIGNAL)) { | |
464 sigaddset(&unblocked_sigs, SHUTDOWN2_SIGNAL); | |
465 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN2_SIGNAL); | |
466 } | |
467 if (!os::Linux::is_sig_ignored(SHUTDOWN3_SIGNAL)) { | |
468 sigaddset(&unblocked_sigs, SHUTDOWN3_SIGNAL); | |
469 sigaddset(&allowdebug_blocked_sigs, SHUTDOWN3_SIGNAL); | |
470 } | |
471 } | |
472 // Fill in signals that are blocked by all but the VM thread. | |
473 sigemptyset(&vm_sigs); | |
474 if (!ReduceSignalUsage) | |
475 sigaddset(&vm_sigs, BREAK_SIGNAL); | |
476 debug_only(signal_sets_initialized = true); | |
477 | |
478 } | |
479 | |
480 // These are signals that are unblocked while a thread is running Java. | |
481 // (For some reason, they get blocked by default.) | |
482 sigset_t* os::Linux::unblocked_signals() { | |
483 assert(signal_sets_initialized, "Not initialized"); | |
484 return &unblocked_sigs; | |
485 } | |
486 | |
487 // These are the signals that are blocked while a (non-VM) thread is | |
488 // running Java. Only the VM thread handles these signals. | |
489 sigset_t* os::Linux::vm_signals() { | |
490 assert(signal_sets_initialized, "Not initialized"); | |
491 return &vm_sigs; | |
492 } | |
493 | |
494 // These are signals that are blocked during cond_wait to allow debugger in | |
495 sigset_t* os::Linux::allowdebug_blocked_signals() { | |
496 assert(signal_sets_initialized, "Not initialized"); | |
497 return &allowdebug_blocked_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. Note that _CS_GNU_LIBC_VERSION | |
527 // and _CS_GNU_LIBPTHREAD_VERSION are supported in glibc >= 2.3.2. Use a | |
528 // generic name for earlier versions. | |
529 // Define macros here so we can build HotSpot on old systems. | |
530 # ifndef _CS_GNU_LIBC_VERSION | |
531 # define _CS_GNU_LIBC_VERSION 2 | |
532 # endif | |
533 # ifndef _CS_GNU_LIBPTHREAD_VERSION | |
534 # define _CS_GNU_LIBPTHREAD_VERSION 3 | |
535 # endif | |
536 | |
537 size_t n = confstr(_CS_GNU_LIBC_VERSION, NULL, 0); | |
538 if (n > 0) { | |
539 char *str = (char *)malloc(n); | |
540 confstr(_CS_GNU_LIBC_VERSION, str, n); | |
541 os::Linux::set_glibc_version(str); | |
542 } else { | |
543 // _CS_GNU_LIBC_VERSION is not supported, try gnu_get_libc_version() | |
544 static char _gnu_libc_version[32]; | |
545 jio_snprintf(_gnu_libc_version, sizeof(_gnu_libc_version), | |
546 "glibc %s %s", gnu_get_libc_version(), gnu_get_libc_release()); | |
547 os::Linux::set_glibc_version(_gnu_libc_version); | |
548 } | |
549 | |
550 n = confstr(_CS_GNU_LIBPTHREAD_VERSION, NULL, 0); | |
551 if (n > 0) { | |
552 char *str = (char *)malloc(n); | |
553 confstr(_CS_GNU_LIBPTHREAD_VERSION, str, n); | |
554 // Vanilla RH-9 (glibc 2.3.2) has a bug that confstr() always tells | |
555 // us "NPTL-0.29" even we are running with LinuxThreads. Check if this | |
199
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
556 // is the case. LinuxThreads has a hard limit on max number of threads. |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
557 // So sysconf(_SC_THREAD_THREADS_MAX) will return a positive value. |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
558 // On the other hand, NPTL does not have such a limit, sysconf() |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
559 // will return -1 and errno is not changed. Check if it is really NPTL. |
0 | 560 if (strcmp(os::Linux::glibc_version(), "glibc 2.3.2") == 0 && |
199
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
561 strstr(str, "NPTL") && |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
562 sysconf(_SC_THREAD_THREADS_MAX) > 0) { |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
563 free(str); |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
564 os::Linux::set_libpthread_version("linuxthreads"); |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
565 } else { |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
566 os::Linux::set_libpthread_version(str); |
0 | 567 } |
568 } else { | |
199
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
569 // glibc before 2.3.2 only has LinuxThreads. |
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
570 os::Linux::set_libpthread_version("linuxthreads"); |
0 | 571 } |
572 | |
573 if (strstr(libpthread_version(), "NPTL")) { | |
574 os::Linux::set_is_NPTL(); | |
575 } else { | |
576 os::Linux::set_is_LinuxThreads(); | |
577 } | |
578 | |
579 // LinuxThreads have two flavors: floating-stack mode, which allows variable | |
580 // stack size; and fixed-stack mode. NPTL is always floating-stack. | |
581 if (os::Linux::is_NPTL() || os::Linux::supports_variable_stack_size()) { | |
582 os::Linux::set_is_floating_stack(); | |
583 } | |
584 } | |
585 | |
586 ///////////////////////////////////////////////////////////////////////////// | |
587 // thread stack | |
588 | |
589 // Force Linux kernel to expand current thread stack. If "bottom" is close | |
590 // to the stack guard, caller should block all signals. | |
591 // | |
592 // MAP_GROWSDOWN: | |
593 // A special mmap() flag that is used to implement thread stacks. It tells | |
594 // kernel that the memory region should extend downwards when needed. This | |
595 // allows early versions of LinuxThreads to only mmap the first few pages | |
596 // when creating a new thread. Linux kernel will automatically expand thread | |
597 // stack as needed (on page faults). | |
598 // | |
599 // However, because the memory region of a MAP_GROWSDOWN stack can grow on | |
600 // demand, if a page fault happens outside an already mapped MAP_GROWSDOWN | |
601 // region, it's hard to tell if the fault is due to a legitimate stack | |
602 // access or because of reading/writing non-exist memory (e.g. buffer | |
603 // overrun). As a rule, if the fault happens below current stack pointer, | |
604 // Linux kernel does not expand stack, instead a SIGSEGV is sent to the | |
605 // application (see Linux kernel fault.c). | |
606 // | |
607 // This Linux feature can cause SIGSEGV when VM bangs thread stack for | |
608 // stack overflow detection. | |
609 // | |
610 // Newer version of LinuxThreads (since glibc-2.2, or, RH-7.x) and NPTL do | |
611 // not use this flag. However, the stack of initial thread is not created | |
612 // by pthread, it is still MAP_GROWSDOWN. Also it's possible (though | |
613 // unlikely) that user code can create a thread with MAP_GROWSDOWN stack | |
614 // and then attach the thread to JVM. | |
615 // | |
616 // To get around the problem and allow stack banging on Linux, we need to | |
617 // manually expand thread stack after receiving the SIGSEGV. | |
618 // | |
619 // There are two ways to expand thread stack to address "bottom", we used | |
620 // both of them in JVM before 1.5: | |
621 // 1. adjust stack pointer first so that it is below "bottom", and then | |
622 // touch "bottom" | |
623 // 2. mmap() the page in question | |
624 // | |
625 // Now alternate signal stack is gone, it's harder to use 2. For instance, | |
626 // if current sp is already near the lower end of page 101, and we need to | |
627 // call mmap() to map page 100, it is possible that part of the mmap() frame | |
628 // will be placed in page 100. When page 100 is mapped, it is zero-filled. | |
629 // That will destroy the mmap() frame and cause VM to crash. | |
630 // | |
631 // The following code works by adjusting sp first, then accessing the "bottom" | |
632 // page to force a page fault. Linux kernel will then automatically expand the | |
633 // stack mapping. | |
634 // | |
635 // _expand_stack_to() assumes its frame size is less than page size, which | |
636 // should always be true if the function is not inlined. | |
637 | |
638 #if __GNUC__ < 3 // gcc 2.x does not support noinline attribute | |
639 #define NOINLINE | |
640 #else | |
641 #define NOINLINE __attribute__ ((noinline)) | |
642 #endif | |
643 | |
644 static void _expand_stack_to(address bottom) NOINLINE; | |
645 | |
646 static void _expand_stack_to(address bottom) { | |
647 address sp; | |
648 size_t size; | |
649 volatile char *p; | |
650 | |
651 // Adjust bottom to point to the largest address within the same page, it | |
652 // gives us a one-page buffer if alloca() allocates slightly more memory. | |
653 bottom = (address)align_size_down((uintptr_t)bottom, os::Linux::page_size()); | |
654 bottom += os::Linux::page_size() - 1; | |
655 | |
656 // sp might be slightly above current stack pointer; if that's the case, we | |
657 // will alloca() a little more space than necessary, which is OK. Don't use | |
658 // os::current_stack_pointer(), as its result can be slightly below current | |
659 // stack pointer, causing us to not alloca enough to reach "bottom". | |
660 sp = (address)&sp; | |
661 | |
662 if (sp > bottom) { | |
663 size = sp - bottom; | |
664 p = (volatile char *)alloca(size); | |
665 assert(p != NULL && p <= (volatile char *)bottom, "alloca problem?"); | |
666 p[0] = '\0'; | |
667 } | |
668 } | |
669 | |
670 bool os::Linux::manually_expand_stack(JavaThread * t, address addr) { | |
671 assert(t!=NULL, "just checking"); | |
672 assert(t->osthread()->expanding_stack(), "expand should be set"); | |
673 assert(t->stack_base() != NULL, "stack_base was not initialized"); | |
674 | |
675 if (addr < t->stack_base() && addr >= t->stack_yellow_zone_base()) { | |
676 sigset_t mask_all, old_sigset; | |
677 sigfillset(&mask_all); | |
678 pthread_sigmask(SIG_SETMASK, &mask_all, &old_sigset); | |
679 _expand_stack_to(addr); | |
680 pthread_sigmask(SIG_SETMASK, &old_sigset, NULL); | |
681 return true; | |
682 } | |
683 return false; | |
684 } | |
685 | |
686 ////////////////////////////////////////////////////////////////////////////// | |
687 // create new thread | |
688 | |
689 static address highest_vm_reserved_address(); | |
690 | |
691 // check if it's safe to start a new thread | |
692 static bool _thread_safety_check(Thread* thread) { | |
693 if (os::Linux::is_LinuxThreads() && !os::Linux::is_floating_stack()) { | |
694 // Fixed stack LinuxThreads (SuSE Linux/x86, and some versions of Redhat) | |
695 // Heap is mmap'ed at lower end of memory space. Thread stacks are | |
696 // allocated (MAP_FIXED) from high address space. Every thread stack | |
697 // occupies a fixed size slot (usually 2Mbytes, but user can change | |
698 // it to other values if they rebuild LinuxThreads). | |
699 // | |
700 // Problem with MAP_FIXED is that mmap() can still succeed even part of | |
701 // the memory region has already been mmap'ed. That means if we have too | |
702 // many threads and/or very large heap, eventually thread stack will | |
703 // collide with heap. | |
704 // | |
705 // Here we try to prevent heap/stack collision by comparing current | |
706 // stack bottom with the highest address that has been mmap'ed by JVM | |
707 // plus a safety margin for memory maps created by native code. | |
708 // | |
709 // This feature can be disabled by setting ThreadSafetyMargin to 0 | |
710 // | |
711 if (ThreadSafetyMargin > 0) { | |
712 address stack_bottom = os::current_stack_base() - os::current_stack_size(); | |
713 | |
714 // not safe if our stack extends below the safety margin | |
715 return stack_bottom - ThreadSafetyMargin >= highest_vm_reserved_address(); | |
716 } else { | |
717 return true; | |
718 } | |
719 } else { | |
720 // Floating stack LinuxThreads or NPTL: | |
721 // Unlike fixed stack LinuxThreads, thread stacks are not MAP_FIXED. When | |
722 // there's not enough space left, pthread_create() will fail. If we come | |
723 // here, that means enough space has been reserved for stack. | |
724 return true; | |
725 } | |
726 } | |
727 | |
728 // Thread start routine for all newly created threads | |
729 static void *java_start(Thread *thread) { | |
730 // Try to randomize the cache line index of hot stack frames. | |
731 // This helps when threads of the same stack traces evict each other's | |
732 // cache lines. The threads can be either from the same JVM instance, or | |
733 // from different JVM instances. The benefit is especially true for | |
734 // processors with hyperthreading technology. | |
735 static int counter = 0; | |
736 int pid = os::current_process_id(); | |
737 alloca(((pid ^ counter++) & 7) * 128); | |
738 | |
739 ThreadLocalStorage::set_thread(thread); | |
740 | |
741 OSThread* osthread = thread->osthread(); | |
742 Monitor* sync = osthread->startThread_lock(); | |
743 | |
744 // non floating stack LinuxThreads needs extra check, see above | |
745 if (!_thread_safety_check(thread)) { | |
746 // notify parent thread | |
747 MutexLockerEx ml(sync, Mutex::_no_safepoint_check_flag); | |
748 osthread->set_state(ZOMBIE); | |
749 sync->notify_all(); | |
750 return NULL; | |
751 } | |
752 | |
753 // thread_id is kernel thread id (similar to Solaris LWP id) | |
754 osthread->set_thread_id(os::Linux::gettid()); | |
755 | |
756 if (UseNUMA) { | |
757 int lgrp_id = os::numa_get_group_id(); | |
758 if (lgrp_id != -1) { | |
759 thread->set_lgrp_id(lgrp_id); | |
760 } | |
761 } | |
762 // initialize signal mask for this thread | |
763 os::Linux::hotspot_sigmask(thread); | |
764 | |
765 // initialize floating point control register | |
766 os::Linux::init_thread_fpu_state(); | |
767 | |
768 // handshaking with parent thread | |
769 { | |
770 MutexLockerEx ml(sync, Mutex::_no_safepoint_check_flag); | |
771 | |
772 // notify parent thread | |
773 osthread->set_state(INITIALIZED); | |
774 sync->notify_all(); | |
775 | |
776 // wait until os::start_thread() | |
777 while (osthread->get_state() == INITIALIZED) { | |
778 sync->wait(Mutex::_no_safepoint_check_flag); | |
779 } | |
780 } | |
781 | |
782 // call one more level start routine | |
783 thread->run(); | |
784 | |
785 return 0; | |
786 } | |
787 | |
788 bool os::create_thread(Thread* thread, ThreadType thr_type, size_t stack_size) { | |
789 assert(thread->osthread() == NULL, "caller responsible"); | |
790 | |
791 // Allocate the OSThread object | |
792 OSThread* osthread = new OSThread(NULL, NULL); | |
793 if (osthread == NULL) { | |
794 return false; | |
795 } | |
796 | |
797 // set the correct thread state | |
798 osthread->set_thread_type(thr_type); | |
799 | |
800 // Initial state is ALLOCATED but not INITIALIZED | |
801 osthread->set_state(ALLOCATED); | |
802 | |
803 thread->set_osthread(osthread); | |
804 | |
805 // init thread attributes | |
806 pthread_attr_t attr; | |
807 pthread_attr_init(&attr); | |
808 pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED); | |
809 | |
810 // stack size | |
811 if (os::Linux::supports_variable_stack_size()) { | |
812 // calculate stack size if it's not specified by caller | |
813 if (stack_size == 0) { | |
814 stack_size = os::Linux::default_stack_size(thr_type); | |
815 | |
816 switch (thr_type) { | |
817 case os::java_thread: | |
818 // Java threads use ThreadStackSize which default value can be changed with the flag -Xss | |
819 if (JavaThread::stack_size_at_create() > 0) stack_size = JavaThread::stack_size_at_create(); | |
820 break; | |
821 case os::compiler_thread: | |
822 if (CompilerThreadStackSize > 0) { | |
823 stack_size = (size_t)(CompilerThreadStackSize * K); | |
824 break; | |
825 } // else fall through: | |
826 // use VMThreadStackSize if CompilerThreadStackSize is not defined | |
827 case os::vm_thread: | |
828 case os::pgc_thread: | |
829 case os::cgc_thread: | |
830 case os::watcher_thread: | |
831 if (VMThreadStackSize > 0) stack_size = (size_t)(VMThreadStackSize * K); | |
832 break; | |
833 } | |
834 } | |
835 | |
836 stack_size = MAX2(stack_size, os::Linux::min_stack_allowed); | |
837 pthread_attr_setstacksize(&attr, stack_size); | |
838 } else { | |
839 // let pthread_create() pick the default value. | |
840 } | |
841 | |
842 // glibc guard page | |
843 pthread_attr_setguardsize(&attr, os::Linux::default_guard_size(thr_type)); | |
844 | |
845 ThreadState state; | |
846 | |
847 { | |
848 // Serialize thread creation if we are running with fixed stack LinuxThreads | |
849 bool lock = os::Linux::is_LinuxThreads() && !os::Linux::is_floating_stack(); | |
850 if (lock) { | |
851 os::Linux::createThread_lock()->lock_without_safepoint_check(); | |
852 } | |
853 | |
854 pthread_t tid; | |
855 int ret = pthread_create(&tid, &attr, (void* (*)(void*)) java_start, thread); | |
856 | |
857 pthread_attr_destroy(&attr); | |
858 | |
859 if (ret != 0) { | |
860 if (PrintMiscellaneous && (Verbose || WizardMode)) { | |
861 perror("pthread_create()"); | |
862 } | |
863 // Need to clean up stuff we've allocated so far | |
864 thread->set_osthread(NULL); | |
865 delete osthread; | |
866 if (lock) os::Linux::createThread_lock()->unlock(); | |
867 return false; | |
868 } | |
869 | |
870 // Store pthread info into the OSThread | |
871 osthread->set_pthread_id(tid); | |
872 | |
873 // Wait until child thread is either initialized or aborted | |
874 { | |
875 Monitor* sync_with_child = osthread->startThread_lock(); | |
876 MutexLockerEx ml(sync_with_child, Mutex::_no_safepoint_check_flag); | |
877 while ((state = osthread->get_state()) == ALLOCATED) { | |
878 sync_with_child->wait(Mutex::_no_safepoint_check_flag); | |
879 } | |
880 } | |
881 | |
882 if (lock) { | |
883 os::Linux::createThread_lock()->unlock(); | |
884 } | |
885 } | |
886 | |
887 // Aborted due to thread limit being reached | |
888 if (state == ZOMBIE) { | |
889 thread->set_osthread(NULL); | |
890 delete osthread; | |
891 return false; | |
892 } | |
893 | |
894 // The thread is returned suspended (in state INITIALIZED), | |
895 // and is started higher up in the call chain | |
896 assert(state == INITIALIZED, "race condition"); | |
897 return true; | |
898 } | |
899 | |
900 ///////////////////////////////////////////////////////////////////////////// | |
901 // attach existing thread | |
902 | |
903 // bootstrap the main thread | |
904 bool os::create_main_thread(JavaThread* thread) { | |
905 assert(os::Linux::_main_thread == pthread_self(), "should be called inside main thread"); | |
906 return create_attached_thread(thread); | |
907 } | |
908 | |
909 bool os::create_attached_thread(JavaThread* thread) { | |
910 #ifdef ASSERT | |
911 thread->verify_not_published(); | |
912 #endif | |
913 | |
914 // Allocate the OSThread object | |
915 OSThread* osthread = new OSThread(NULL, NULL); | |
916 | |
917 if (osthread == NULL) { | |
918 return false; | |
919 } | |
920 | |
921 // Store pthread info into the OSThread | |
922 osthread->set_thread_id(os::Linux::gettid()); | |
923 osthread->set_pthread_id(::pthread_self()); | |
924 | |
925 // initialize floating point control register | |
926 os::Linux::init_thread_fpu_state(); | |
927 | |
928 // Initial thread state is RUNNABLE | |
929 osthread->set_state(RUNNABLE); | |
930 | |
931 thread->set_osthread(osthread); | |
932 | |
933 if (UseNUMA) { | |
934 int lgrp_id = os::numa_get_group_id(); | |
935 if (lgrp_id != -1) { | |
936 thread->set_lgrp_id(lgrp_id); | |
937 } | |
938 } | |
939 | |
940 if (os::Linux::is_initial_thread()) { | |
941 // If current thread is initial thread, its stack is mapped on demand, | |
942 // see notes about MAP_GROWSDOWN. Here we try to force kernel to map | |
943 // the entire stack region to avoid SEGV in stack banging. | |
944 // It is also useful to get around the heap-stack-gap problem on SuSE | |
945 // kernel (see 4821821 for details). We first expand stack to the top | |
946 // of yellow zone, then enable stack yellow zone (order is significant, | |
947 // enabling yellow zone first will crash JVM on SuSE Linux), so there | |
948 // is no gap between the last two virtual memory regions. | |
949 | |
950 JavaThread *jt = (JavaThread *)thread; | |
951 address addr = jt->stack_yellow_zone_base(); | |
952 assert(addr != NULL, "initialization problem?"); | |
953 assert(jt->stack_available(addr) > 0, "stack guard should not be enabled"); | |
954 | |
955 osthread->set_expanding_stack(); | |
956 os::Linux::manually_expand_stack(jt, addr); | |
957 osthread->clear_expanding_stack(); | |
958 } | |
959 | |
960 // initialize signal mask for this thread | |
961 // and save the caller's signal mask | |
962 os::Linux::hotspot_sigmask(thread); | |
963 | |
964 return true; | |
965 } | |
966 | |
967 void os::pd_start_thread(Thread* thread) { | |
968 OSThread * osthread = thread->osthread(); | |
969 assert(osthread->get_state() != INITIALIZED, "just checking"); | |
970 Monitor* sync_with_child = osthread->startThread_lock(); | |
971 MutexLockerEx ml(sync_with_child, Mutex::_no_safepoint_check_flag); | |
972 sync_with_child->notify(); | |
973 } | |
974 | |
975 // Free Linux resources related to the OSThread | |
976 void os::free_thread(OSThread* osthread) { | |
977 assert(osthread != NULL, "osthread not set"); | |
978 | |
979 if (Thread::current()->osthread() == osthread) { | |
980 // Restore caller's signal mask | |
981 sigset_t sigmask = osthread->caller_sigmask(); | |
982 pthread_sigmask(SIG_SETMASK, &sigmask, NULL); | |
983 } | |
984 | |
985 delete osthread; | |
986 } | |
987 | |
988 ////////////////////////////////////////////////////////////////////////////// | |
989 // thread local storage | |
990 | |
991 int os::allocate_thread_local_storage() { | |
992 pthread_key_t key; | |
993 int rslt = pthread_key_create(&key, NULL); | |
994 assert(rslt == 0, "cannot allocate thread local storage"); | |
995 return (int)key; | |
996 } | |
997 | |
998 // Note: This is currently not used by VM, as we don't destroy TLS key | |
999 // on VM exit. | |
1000 void os::free_thread_local_storage(int index) { | |
1001 int rslt = pthread_key_delete((pthread_key_t)index); | |
1002 assert(rslt == 0, "invalid index"); | |
1003 } | |
1004 | |
1005 void os::thread_local_storage_at_put(int index, void* value) { | |
1006 int rslt = pthread_setspecific((pthread_key_t)index, value); | |
1007 assert(rslt == 0, "pthread_setspecific failed"); | |
1008 } | |
1009 | |
1010 extern "C" Thread* get_thread() { | |
1011 return ThreadLocalStorage::thread(); | |
1012 } | |
1013 | |
1014 ////////////////////////////////////////////////////////////////////////////// | |
1015 // initial thread | |
1016 | |
1017 // Check if current thread is the initial thread, similar to Solaris thr_main. | |
1018 bool os::Linux::is_initial_thread(void) { | |
1019 char dummy; | |
1020 // If called before init complete, thread stack bottom will be null. | |
1021 // Can be called if fatal error occurs before initialization. | |
1022 if (initial_thread_stack_bottom() == NULL) return false; | |
1023 assert(initial_thread_stack_bottom() != NULL && | |
1024 initial_thread_stack_size() != 0, | |
1025 "os::init did not locate initial thread's stack region"); | |
1026 if ((address)&dummy >= initial_thread_stack_bottom() && | |
1027 (address)&dummy < initial_thread_stack_bottom() + initial_thread_stack_size()) | |
1028 return true; | |
1029 else return false; | |
1030 } | |
1031 | |
1032 // Find the virtual memory area that contains addr | |
1033 static bool find_vma(address addr, address* vma_low, address* vma_high) { | |
1034 FILE *fp = fopen("/proc/self/maps", "r"); | |
1035 if (fp) { | |
1036 address low, high; | |
1037 while (!feof(fp)) { | |
1038 if (fscanf(fp, "%p-%p", &low, &high) == 2) { | |
1039 if (low <= addr && addr < high) { | |
1040 if (vma_low) *vma_low = low; | |
1041 if (vma_high) *vma_high = high; | |
1042 fclose (fp); | |
1043 return true; | |
1044 } | |
1045 } | |
1046 for (;;) { | |
1047 int ch = fgetc(fp); | |
1048 if (ch == EOF || ch == (int)'\n') break; | |
1049 } | |
1050 } | |
1051 fclose(fp); | |
1052 } | |
1053 return false; | |
1054 } | |
1055 | |
1056 // Locate initial thread stack. This special handling of initial thread stack | |
1057 // is needed because pthread_getattr_np() on most (all?) Linux distros returns | |
1058 // bogus value for initial thread. | |
1059 void os::Linux::capture_initial_stack(size_t max_size) { | |
1060 // stack size is the easy part, get it from RLIMIT_STACK | |
1061 size_t stack_size; | |
1062 struct rlimit rlim; | |
1063 getrlimit(RLIMIT_STACK, &rlim); | |
1064 stack_size = rlim.rlim_cur; | |
1065 | |
1066 // 6308388: a bug in ld.so will relocate its own .data section to the | |
1067 // lower end of primordial stack; reduce ulimit -s value a little bit | |
1068 // so we won't install guard page on ld.so's data section. | |
1069 stack_size -= 2 * page_size(); | |
1070 | |
1071 // 4441425: avoid crash with "unlimited" stack size on SuSE 7.1 or Redhat | |
1072 // 7.1, in both cases we will get 2G in return value. | |
1073 // 4466587: glibc 2.2.x compiled w/o "--enable-kernel=2.4.0" (RH 7.0, | |
1074 // SuSE 7.2, Debian) can not handle alternate signal stack correctly | |
1075 // for initial thread if its stack size exceeds 6M. Cap it at 2M, | |
1076 // in case other parts in glibc still assumes 2M max stack size. | |
1077 // FIXME: alt signal stack is gone, maybe we can relax this constraint? | |
1078 #ifndef IA64 | |
1079 if (stack_size > 2 * K * K) stack_size = 2 * K * K; | |
1080 #else | |
1081 // Problem still exists RH7.2 (IA64 anyway) but 2MB is a little small | |
1082 if (stack_size > 4 * K * K) stack_size = 4 * K * K; | |
1083 #endif | |
1084 | |
1085 // Try to figure out where the stack base (top) is. This is harder. | |
1086 // | |
1087 // When an application is started, glibc saves the initial stack pointer in | |
1088 // a global variable "__libc_stack_end", which is then used by system | |
1089 // libraries. __libc_stack_end should be pretty close to stack top. The | |
1090 // variable is available since the very early days. However, because it is | |
1091 // a private interface, it could disappear in the future. | |
1092 // | |
1093 // Linux kernel saves start_stack information in /proc/<pid>/stat. Similar | |
1094 // to __libc_stack_end, it is very close to stack top, but isn't the real | |
1095 // stack top. Note that /proc may not exist if VM is running as a chroot | |
1096 // program, so reading /proc/<pid>/stat could fail. Also the contents of | |
1097 // /proc/<pid>/stat could change in the future (though unlikely). | |
1098 // | |
1099 // We try __libc_stack_end first. If that doesn't work, look for | |
1100 // /proc/<pid>/stat. If neither of them works, we use current stack pointer | |
1101 // as a hint, which should work well in most cases. | |
1102 | |
1103 uintptr_t stack_start; | |
1104 | |
1105 // try __libc_stack_end first | |
1106 uintptr_t *p = (uintptr_t *)dlsym(RTLD_DEFAULT, "__libc_stack_end"); | |
1107 if (p && *p) { | |
1108 stack_start = *p; | |
1109 } else { | |
1110 // see if we can get the start_stack field from /proc/self/stat | |
1111 FILE *fp; | |
1112 int pid; | |
1113 char state; | |
1114 int ppid; | |
1115 int pgrp; | |
1116 int session; | |
1117 int nr; | |
1118 int tpgrp; | |
1119 unsigned long flags; | |
1120 unsigned long minflt; | |
1121 unsigned long cminflt; | |
1122 unsigned long majflt; | |
1123 unsigned long cmajflt; | |
1124 unsigned long utime; | |
1125 unsigned long stime; | |
1126 long cutime; | |
1127 long cstime; | |
1128 long prio; | |
1129 long nice; | |
1130 long junk; | |
1131 long it_real; | |
1132 uintptr_t start; | |
1133 uintptr_t vsize; | |
1134 uintptr_t rss; | |
1135 unsigned long rsslim; | |
1136 uintptr_t scodes; | |
1137 uintptr_t ecode; | |
1138 int i; | |
1139 | |
1140 // Figure what the primordial thread stack base is. Code is inspired | |
1141 // by email from Hans Boehm. /proc/self/stat begins with current pid, | |
1142 // followed by command name surrounded by parentheses, state, etc. | |
1143 char stat[2048]; | |
1144 int statlen; | |
1145 | |
1146 fp = fopen("/proc/self/stat", "r"); | |
1147 if (fp) { | |
1148 statlen = fread(stat, 1, 2047, fp); | |
1149 stat[statlen] = '\0'; | |
1150 fclose(fp); | |
1151 | |
1152 // Skip pid and the command string. Note that we could be dealing with | |
1153 // weird command names, e.g. user could decide to rename java launcher | |
1154 // to "java 1.4.2 :)", then the stat file would look like | |
1155 // 1234 (java 1.4.2 :)) R ... ... | |
1156 // We don't really need to know the command string, just find the last | |
1157 // occurrence of ")" and then start parsing from there. See bug 4726580. | |
1158 char * s = strrchr(stat, ')'); | |
1159 | |
1160 i = 0; | |
1161 if (s) { | |
1162 // Skip blank chars | |
1163 do s++; while (isspace(*s)); | |
1164 | |
1165 /* 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 */ | |
1166 /* 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 */ | |
1167 i = sscanf(s, "%c %d %d %d %d %d %lu %lu %lu %lu %lu %lu %lu %ld %ld %ld %ld %ld %ld %lu %lu %ld %lu %lu %lu %lu", | |
1168 &state, /* 3 %c */ | |
1169 &ppid, /* 4 %d */ | |
1170 &pgrp, /* 5 %d */ | |
1171 &session, /* 6 %d */ | |
1172 &nr, /* 7 %d */ | |
1173 &tpgrp, /* 8 %d */ | |
1174 &flags, /* 9 %lu */ | |
1175 &minflt, /* 10 %lu */ | |
1176 &cminflt, /* 11 %lu */ | |
1177 &majflt, /* 12 %lu */ | |
1178 &cmajflt, /* 13 %lu */ | |
1179 &utime, /* 14 %lu */ | |
1180 &stime, /* 15 %lu */ | |
1181 &cutime, /* 16 %ld */ | |
1182 &cstime, /* 17 %ld */ | |
1183 &prio, /* 18 %ld */ | |
1184 &nice, /* 19 %ld */ | |
1185 &junk, /* 20 %ld */ | |
1186 &it_real, /* 21 %ld */ | |
1187 &start, /* 22 %lu */ | |
1188 &vsize, /* 23 %lu */ | |
1189 &rss, /* 24 %ld */ | |
1190 &rsslim, /* 25 %lu */ | |
1191 &scodes, /* 26 %lu */ | |
1192 &ecode, /* 27 %lu */ | |
1193 &stack_start); /* 28 %lu */ | |
1194 } | |
1195 | |
1196 if (i != 28 - 2) { | |
1197 assert(false, "Bad conversion from /proc/self/stat"); | |
1198 // product mode - assume we are the initial thread, good luck in the | |
1199 // embedded case. | |
1200 warning("Can't detect initial thread stack location - bad conversion"); | |
1201 stack_start = (uintptr_t) &rlim; | |
1202 } | |
1203 } else { | |
1204 // For some reason we can't open /proc/self/stat (for example, running on | |
1205 // FreeBSD with a Linux emulator, or inside chroot), this should work for | |
1206 // most cases, so don't abort: | |
1207 warning("Can't detect initial thread stack location - no /proc/self/stat"); | |
1208 stack_start = (uintptr_t) &rlim; | |
1209 } | |
1210 } | |
1211 | |
1212 // Now we have a pointer (stack_start) very close to the stack top, the | |
1213 // next thing to do is to figure out the exact location of stack top. We | |
1214 // can find out the virtual memory area that contains stack_start by | |
1215 // reading /proc/self/maps, it should be the last vma in /proc/self/maps, | |
1216 // and its upper limit is the real stack top. (again, this would fail if | |
1217 // running inside chroot, because /proc may not exist.) | |
1218 | |
1219 uintptr_t stack_top; | |
1220 address low, high; | |
1221 if (find_vma((address)stack_start, &low, &high)) { | |
1222 // success, "high" is the true stack top. (ignore "low", because initial | |
1223 // thread stack grows on demand, its real bottom is high - RLIMIT_STACK.) | |
1224 stack_top = (uintptr_t)high; | |
1225 } else { | |
1226 // failed, likely because /proc/self/maps does not exist | |
1227 warning("Can't detect initial thread stack location - find_vma failed"); | |
1228 // best effort: stack_start is normally within a few pages below the real | |
1229 // stack top, use it as stack top, and reduce stack size so we won't put | |
1230 // guard page outside stack. | |
1231 stack_top = stack_start; | |
1232 stack_size -= 16 * page_size(); | |
1233 } | |
1234 | |
1235 // stack_top could be partially down the page so align it | |
1236 stack_top = align_size_up(stack_top, page_size()); | |
1237 | |
1238 if (max_size && stack_size > max_size) { | |
1239 _initial_thread_stack_size = max_size; | |
1240 } else { | |
1241 _initial_thread_stack_size = stack_size; | |
1242 } | |
1243 | |
1244 _initial_thread_stack_size = align_size_down(_initial_thread_stack_size, page_size()); | |
1245 _initial_thread_stack_bottom = (address)stack_top - _initial_thread_stack_size; | |
1246 } | |
1247 | |
1248 //////////////////////////////////////////////////////////////////////////////// | |
1249 // time support | |
1250 | |
1251 // Time since start-up in seconds to a fine granularity. | |
1252 // Used by VMSelfDestructTimer and the MemProfiler. | |
1253 double os::elapsedTime() { | |
1254 | |
1255 return (double)(os::elapsed_counter()) * 0.000001; | |
1256 } | |
1257 | |
1258 jlong os::elapsed_counter() { | |
1259 timeval time; | |
1260 int status = gettimeofday(&time, NULL); | |
1261 return jlong(time.tv_sec) * 1000 * 1000 + jlong(time.tv_usec) - initial_time_count; | |
1262 } | |
1263 | |
1264 jlong os::elapsed_frequency() { | |
1265 return (1000 * 1000); | |
1266 } | |
1267 | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1268 // For now, we say that linux does not support vtime. I have no idea |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1269 // whether it can actually be made to (DLD, 9/13/05). |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1270 |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1271 bool os::supports_vtime() { return false; } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1272 bool os::enable_vtime() { return false; } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1273 bool os::vtime_enabled() { return false; } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1274 double os::elapsedVTime() { |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1275 // better than nothing, but not much |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1276 return elapsedTime(); |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1277 } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
141
diff
changeset
|
1278 |
61 | 1279 jlong os::javaTimeMillis() { |
0 | 1280 timeval time; |
1281 int status = gettimeofday(&time, NULL); | |
1282 assert(status != -1, "linux error"); | |
1283 return jlong(time.tv_sec) * 1000 + jlong(time.tv_usec / 1000); | |
1284 } | |
1285 | |
1286 #ifndef CLOCK_MONOTONIC | |
1287 #define CLOCK_MONOTONIC (1) | |
1288 #endif | |
1289 | |
1290 void os::Linux::clock_init() { | |
1291 // we do dlopen's in this particular order due to bug in linux | |
1292 // dynamical loader (see 6348968) leading to crash on exit | |
1293 void* handle = dlopen("librt.so.1", RTLD_LAZY); | |
1294 if (handle == NULL) { | |
1295 handle = dlopen("librt.so", RTLD_LAZY); | |
1296 } | |
1297 | |
1298 if (handle) { | |
1299 int (*clock_getres_func)(clockid_t, struct timespec*) = | |
1300 (int(*)(clockid_t, struct timespec*))dlsym(handle, "clock_getres"); | |
1301 int (*clock_gettime_func)(clockid_t, struct timespec*) = | |
1302 (int(*)(clockid_t, struct timespec*))dlsym(handle, "clock_gettime"); | |
1303 if (clock_getres_func && clock_gettime_func) { | |
1304 // See if monotonic clock is supported by the kernel. Note that some | |
1305 // early implementations simply return kernel jiffies (updated every | |
1306 // 1/100 or 1/1000 second). It would be bad to use such a low res clock | |
1307 // for nano time (though the monotonic property is still nice to have). | |
1308 // It's fixed in newer kernels, however clock_getres() still returns | |
1309 // 1/HZ. We check if clock_getres() works, but will ignore its reported | |
1310 // resolution for now. Hopefully as people move to new kernels, this | |
1311 // won't be a problem. | |
1312 struct timespec res; | |
1313 struct timespec tp; | |
1314 if (clock_getres_func (CLOCK_MONOTONIC, &res) == 0 && | |
1315 clock_gettime_func(CLOCK_MONOTONIC, &tp) == 0) { | |
1316 // yes, monotonic clock is supported | |
1317 _clock_gettime = clock_gettime_func; | |
1318 } else { | |
1319 // close librt if there is no monotonic clock | |
1320 dlclose(handle); | |
1321 } | |
1322 } | |
1323 } | |
1324 } | |
1325 | |
1326 #ifndef SYS_clock_getres | |
1327 | |
1328 #if defined(IA32) || defined(AMD64) | |
1329 #define SYS_clock_getres IA32_ONLY(266) AMD64_ONLY(229) | |
1330 #else | |
1331 #error Value of SYS_clock_getres not known on this platform | |
1332 #endif | |
1333 | |
1334 #endif | |
1335 | |
1336 #define sys_clock_getres(x,y) ::syscall(SYS_clock_getres, x, y) | |
1337 | |
1338 void os::Linux::fast_thread_clock_init() { | |
1339 if (!UseLinuxPosixThreadCPUClocks) { | |
1340 return; | |
1341 } | |
1342 clockid_t clockid; | |
1343 struct timespec tp; | |
1344 int (*pthread_getcpuclockid_func)(pthread_t, clockid_t *) = | |
1345 (int(*)(pthread_t, clockid_t *)) dlsym(RTLD_DEFAULT, "pthread_getcpuclockid"); | |
1346 | |
1347 // Switch to using fast clocks for thread cpu time if | |
1348 // the sys_clock_getres() returns 0 error code. | |
1349 // Note, that some kernels may support the current thread | |
1350 // clock (CLOCK_THREAD_CPUTIME_ID) but not the clocks | |
1351 // returned by the pthread_getcpuclockid(). | |
1352 // If the fast Posix clocks are supported then the sys_clock_getres() | |
1353 // must return at least tp.tv_sec == 0 which means a resolution | |
1354 // better than 1 sec. This is extra check for reliability. | |
1355 | |
1356 if(pthread_getcpuclockid_func && | |
1357 pthread_getcpuclockid_func(_main_thread, &clockid) == 0 && | |
1358 sys_clock_getres(clockid, &tp) == 0 && tp.tv_sec == 0) { | |
1359 | |
1360 _supports_fast_thread_cpu_time = true; | |
1361 _pthread_getcpuclockid = pthread_getcpuclockid_func; | |
1362 } | |
1363 } | |
1364 | |
1365 jlong os::javaTimeNanos() { | |
1366 if (Linux::supports_monotonic_clock()) { | |
1367 struct timespec tp; | |
1368 int status = Linux::clock_gettime(CLOCK_MONOTONIC, &tp); | |
1369 assert(status == 0, "gettime error"); | |
1370 jlong result = jlong(tp.tv_sec) * (1000 * 1000 * 1000) + jlong(tp.tv_nsec); | |
1371 return result; | |
1372 } else { | |
1373 timeval time; | |
1374 int status = gettimeofday(&time, NULL); | |
1375 assert(status != -1, "linux error"); | |
1376 jlong usecs = jlong(time.tv_sec) * (1000 * 1000) + jlong(time.tv_usec); | |
1377 return 1000 * usecs; | |
1378 } | |
1379 } | |
1380 | |
1381 void os::javaTimeNanos_info(jvmtiTimerInfo *info_ptr) { | |
1382 if (Linux::supports_monotonic_clock()) { | |
1383 info_ptr->max_value = ALL_64_BITS; | |
1384 | |
1385 // CLOCK_MONOTONIC - amount of time since some arbitrary point in the past | |
1386 info_ptr->may_skip_backward = false; // not subject to resetting or drifting | |
1387 info_ptr->may_skip_forward = false; // not subject to resetting or drifting | |
1388 } else { | |
1389 // gettimeofday - based on time in seconds since the Epoch thus does not wrap | |
1390 info_ptr->max_value = ALL_64_BITS; | |
1391 | |
1392 // gettimeofday is a real time clock so it skips | |
1393 info_ptr->may_skip_backward = true; | |
1394 info_ptr->may_skip_forward = true; | |
1395 } | |
1396 | |
1397 info_ptr->kind = JVMTI_TIMER_ELAPSED; // elapsed not CPU time | |
1398 } | |
1399 | |
1400 // Return the real, user, and system times in seconds from an | |
1401 // arbitrary fixed point in the past. | |
1402 bool os::getTimesSecs(double* process_real_time, | |
1403 double* process_user_time, | |
1404 double* process_system_time) { | |
1405 struct tms ticks; | |
1406 clock_t real_ticks = times(&ticks); | |
1407 | |
1408 if (real_ticks == (clock_t) (-1)) { | |
1409 return false; | |
1410 } else { | |
1411 double ticks_per_second = (double) clock_tics_per_sec; | |
1412 *process_user_time = ((double) ticks.tms_utime) / ticks_per_second; | |
1413 *process_system_time = ((double) ticks.tms_stime) / ticks_per_second; | |
1414 *process_real_time = ((double) real_ticks) / ticks_per_second; | |
1415 | |
1416 return true; | |
1417 } | |
1418 } | |
1419 | |
1420 | |
1421 char * os::local_time_string(char *buf, size_t buflen) { | |
1422 struct tm t; | |
1423 time_t long_time; | |
1424 time(&long_time); | |
1425 localtime_r(&long_time, &t); | |
1426 jio_snprintf(buf, buflen, "%d-%02d-%02d %02d:%02d:%02d", | |
1427 t.tm_year + 1900, t.tm_mon + 1, t.tm_mday, | |
1428 t.tm_hour, t.tm_min, t.tm_sec); | |
1429 return buf; | |
1430 } | |
1431 | |
1432 //////////////////////////////////////////////////////////////////////////////// | |
1433 // runtime exit support | |
1434 | |
1435 // Note: os::shutdown() might be called very early during initialization, or | |
1436 // called from signal handler. Before adding something to os::shutdown(), make | |
1437 // sure it is async-safe and can handle partially initialized VM. | |
1438 void os::shutdown() { | |
1439 | |
1440 // allow PerfMemory to attempt cleanup of any persistent resources | |
1441 perfMemory_exit(); | |
1442 | |
1443 // needs to remove object in file system | |
1444 AttachListener::abort(); | |
1445 | |
1446 // flush buffered output, finish log files | |
1447 ostream_abort(); | |
1448 | |
1449 // Check for abort hook | |
1450 abort_hook_t abort_hook = Arguments::abort_hook(); | |
1451 if (abort_hook != NULL) { | |
1452 abort_hook(); | |
1453 } | |
1454 | |
1455 } | |
1456 | |
1457 // Note: os::abort() might be called very early during initialization, or | |
1458 // called from signal handler. Before adding something to os::abort(), make | |
1459 // sure it is async-safe and can handle partially initialized VM. | |
1460 void os::abort(bool dump_core) { | |
1461 os::shutdown(); | |
1462 if (dump_core) { | |
1463 #ifndef PRODUCT | |
1464 fdStream out(defaultStream::output_fd()); | |
1465 out.print_raw("Current thread is "); | |
1466 char buf[16]; | |
1467 jio_snprintf(buf, sizeof(buf), UINTX_FORMAT, os::current_thread_id()); | |
1468 out.print_raw_cr(buf); | |
1469 out.print_raw_cr("Dumping core ..."); | |
1470 #endif | |
1471 ::abort(); // dump core | |
1472 } | |
1473 | |
1474 ::exit(1); | |
1475 } | |
1476 | |
1477 // Die immediately, no exit hook, no abort hook, no cleanup. | |
1478 void os::die() { | |
1479 // _exit() on LinuxThreads only kills current thread | |
1480 ::abort(); | |
1481 } | |
1482 | |
1483 // unused on linux for now. | |
1484 void os::set_error_file(const char *logfile) {} | |
1485 | |
1486 intx os::current_thread_id() { return (intx)pthread_self(); } | |
1487 int os::current_process_id() { | |
1488 | |
1489 // Under the old linux thread library, linux gives each thread | |
1490 // its own process id. Because of this each thread will return | |
1491 // a different pid if this method were to return the result | |
1492 // of getpid(2). Linux provides no api that returns the pid | |
1493 // of the launcher thread for the vm. This implementation | |
1494 // returns a unique pid, the pid of the launcher thread | |
1495 // that starts the vm 'process'. | |
1496 | |
1497 // Under the NPTL, getpid() returns the same pid as the | |
1498 // launcher thread rather than a unique pid per thread. | |
1499 // Use gettid() if you want the old pre NPTL behaviour. | |
1500 | |
1501 // if you are looking for the result of a call to getpid() that | |
1502 // returns a unique pid for the calling thread, then look at the | |
1503 // OSThread::thread_id() method in osThread_linux.hpp file | |
1504 | |
1505 return (int)(_initial_pid ? _initial_pid : getpid()); | |
1506 } | |
1507 | |
1508 // DLL functions | |
1509 | |
1510 const char* os::dll_file_extension() { return ".so"; } | |
1511 | |
1512 const char* os::get_temp_directory() { return "/tmp/"; } | |
1513 | |
242 | 1514 void os::dll_build_name( |
1515 char* buffer, size_t buflen, const char* pname, const char* fname) { | |
1516 // copied from libhpi | |
1517 const size_t pnamelen = pname ? strlen(pname) : 0; | |
1518 | |
1519 /* Quietly truncate on buffer overflow. Should be an error. */ | |
1520 if (pnamelen + strlen(fname) + 10 > (size_t) buflen) { | |
1521 *buffer = '\0'; | |
1522 return; | |
1523 } | |
1524 | |
1525 if (pnamelen == 0) { | |
1526 sprintf(buffer, "lib%s.so", fname); | |
1527 } else { | |
1528 sprintf(buffer, "%s/lib%s.so", pname, fname); | |
1529 } | |
1530 } | |
1531 | |
0 | 1532 const char* os::get_current_directory(char *buf, int buflen) { |
1533 return getcwd(buf, buflen); | |
1534 } | |
1535 | |
1536 // check if addr is inside libjvm[_g].so | |
1537 bool os::address_is_in_vm(address addr) { | |
1538 static address libjvm_base_addr; | |
1539 Dl_info dlinfo; | |
1540 | |
1541 if (libjvm_base_addr == NULL) { | |
1542 dladdr(CAST_FROM_FN_PTR(void *, os::address_is_in_vm), &dlinfo); | |
1543 libjvm_base_addr = (address)dlinfo.dli_fbase; | |
1544 assert(libjvm_base_addr !=NULL, "Cannot obtain base address for libjvm"); | |
1545 } | |
1546 | |
1547 if (dladdr((void *)addr, &dlinfo)) { | |
1548 if (libjvm_base_addr == (address)dlinfo.dli_fbase) return true; | |
1549 } | |
1550 | |
1551 return false; | |
1552 } | |
1553 | |
1554 bool os::dll_address_to_function_name(address addr, char *buf, | |
1555 int buflen, int *offset) { | |
1556 Dl_info dlinfo; | |
1557 | |
1558 if (dladdr((void*)addr, &dlinfo) && dlinfo.dli_sname != NULL) { | |
1559 if (buf) jio_snprintf(buf, buflen, "%s", dlinfo.dli_sname); | |
1560 if (offset) *offset = addr - (address)dlinfo.dli_saddr; | |
1561 return true; | |
1562 } else { | |
1563 if (buf) buf[0] = '\0'; | |
1564 if (offset) *offset = -1; | |
1565 return false; | |
1566 } | |
1567 } | |
1568 | |
1569 struct _address_to_library_name { | |
1570 address addr; // input : memory address | |
1571 size_t buflen; // size of fname | |
1572 char* fname; // output: library name | |
1573 address base; // library base addr | |
1574 }; | |
1575 | |
1576 static int address_to_library_name_callback(struct dl_phdr_info *info, | |
1577 size_t size, void *data) { | |
1578 int i; | |
1579 bool found = false; | |
1580 address libbase = NULL; | |
1581 struct _address_to_library_name * d = (struct _address_to_library_name *)data; | |
1582 | |
1583 // iterate through all loadable segments | |
1584 for (i = 0; i < info->dlpi_phnum; i++) { | |
1585 address segbase = (address)(info->dlpi_addr + info->dlpi_phdr[i].p_vaddr); | |
1586 if (info->dlpi_phdr[i].p_type == PT_LOAD) { | |
1587 // base address of a library is the lowest address of its loaded | |
1588 // segments. | |
1589 if (libbase == NULL || libbase > segbase) { | |
1590 libbase = segbase; | |
1591 } | |
1592 // see if 'addr' is within current segment | |
1593 if (segbase <= d->addr && | |
1594 d->addr < segbase + info->dlpi_phdr[i].p_memsz) { | |
1595 found = true; | |
1596 } | |
1597 } | |
1598 } | |
1599 | |
1600 // dlpi_name is NULL or empty if the ELF file is executable, return 0 | |
1601 // so dll_address_to_library_name() can fall through to use dladdr() which | |
1602 // can figure out executable name from argv[0]. | |
1603 if (found && info->dlpi_name && info->dlpi_name[0]) { | |
1604 d->base = libbase; | |
1605 if (d->fname) { | |
1606 jio_snprintf(d->fname, d->buflen, "%s", info->dlpi_name); | |
1607 } | |
1608 return 1; | |
1609 } | |
1610 return 0; | |
1611 } | |
1612 | |
1613 bool os::dll_address_to_library_name(address addr, char* buf, | |
1614 int buflen, int* offset) { | |
1615 Dl_info dlinfo; | |
1616 struct _address_to_library_name data; | |
1617 | |
1618 // There is a bug in old glibc dladdr() implementation that it could resolve | |
1619 // to wrong library name if the .so file has a base address != NULL. Here | |
1620 // we iterate through the program headers of all loaded libraries to find | |
1621 // out which library 'addr' really belongs to. This workaround can be | |
1622 // removed once the minimum requirement for glibc is moved to 2.3.x. | |
1623 data.addr = addr; | |
1624 data.fname = buf; | |
1625 data.buflen = buflen; | |
1626 data.base = NULL; | |
1627 int rslt = dl_iterate_phdr(address_to_library_name_callback, (void *)&data); | |
1628 | |
1629 if (rslt) { | |
1630 // buf already contains library name | |
1631 if (offset) *offset = addr - data.base; | |
1632 return true; | |
1633 } else if (dladdr((void*)addr, &dlinfo)){ | |
1634 if (buf) jio_snprintf(buf, buflen, "%s", dlinfo.dli_fname); | |
1635 if (offset) *offset = addr - (address)dlinfo.dli_fbase; | |
1636 return true; | |
1637 } else { | |
1638 if (buf) buf[0] = '\0'; | |
1639 if (offset) *offset = -1; | |
1640 return false; | |
1641 } | |
1642 } | |
1643 | |
1644 // Loads .dll/.so and | |
1645 // in case of error it checks if .dll/.so was built for the | |
1646 // same architecture as Hotspot is running on | |
1647 | |
1648 void * os::dll_load(const char *filename, char *ebuf, int ebuflen) | |
1649 { | |
1650 void * result= ::dlopen(filename, RTLD_LAZY); | |
1651 if (result != NULL) { | |
1652 // Successful loading | |
1653 return result; | |
1654 } | |
1655 | |
1656 Elf32_Ehdr elf_head; | |
1657 | |
1658 // Read system error message into ebuf | |
1659 // It may or may not be overwritten below | |
1660 ::strncpy(ebuf, ::dlerror(), ebuflen-1); | |
1661 ebuf[ebuflen-1]='\0'; | |
1662 int diag_msg_max_length=ebuflen-strlen(ebuf); | |
1663 char* diag_msg_buf=ebuf+strlen(ebuf); | |
1664 | |
1665 if (diag_msg_max_length==0) { | |
1666 // No more space in ebuf for additional diagnostics message | |
1667 return NULL; | |
1668 } | |
1669 | |
1670 | |
1671 int file_descriptor= ::open(filename, O_RDONLY | O_NONBLOCK); | |
1672 | |
1673 if (file_descriptor < 0) { | |
1674 // Can't open library, report dlerror() message | |
1675 return NULL; | |
1676 } | |
1677 | |
1678 bool failed_to_read_elf_head= | |
1679 (sizeof(elf_head)!= | |
1680 (::read(file_descriptor, &elf_head,sizeof(elf_head)))) ; | |
1681 | |
1682 ::close(file_descriptor); | |
1683 if (failed_to_read_elf_head) { | |
1684 // file i/o error - report dlerror() msg | |
1685 return NULL; | |
1686 } | |
1687 | |
1688 typedef struct { | |
1689 Elf32_Half code; // Actual value as defined in elf.h | |
1690 Elf32_Half compat_class; // Compatibility of archs at VM's sense | |
1691 char elf_class; // 32 or 64 bit | |
1692 char endianess; // MSB or LSB | |
1693 char* name; // String representation | |
1694 } arch_t; | |
1695 | |
1696 #ifndef EM_486 | |
1697 #define EM_486 6 /* Intel 80486 */ | |
1698 #endif | |
1699 | |
1700 static const arch_t arch_array[]={ | |
1701 {EM_386, EM_386, ELFCLASS32, ELFDATA2LSB, (char*)"IA 32"}, | |
1702 {EM_486, EM_386, ELFCLASS32, ELFDATA2LSB, (char*)"IA 32"}, | |
1703 {EM_IA_64, EM_IA_64, ELFCLASS64, ELFDATA2LSB, (char*)"IA 64"}, | |
1704 {EM_X86_64, EM_X86_64, ELFCLASS64, ELFDATA2LSB, (char*)"AMD 64"}, | |
1705 {EM_SPARC, EM_SPARC, ELFCLASS32, ELFDATA2MSB, (char*)"Sparc 32"}, | |
1706 {EM_SPARC32PLUS, EM_SPARC, ELFCLASS32, ELFDATA2MSB, (char*)"Sparc 32"}, | |
1707 {EM_SPARCV9, EM_SPARCV9, ELFCLASS64, ELFDATA2MSB, (char*)"Sparc v9 64"}, | |
1708 {EM_PPC, EM_PPC, ELFCLASS32, ELFDATA2MSB, (char*)"Power PC 32"}, | |
1709 {EM_PPC64, EM_PPC64, ELFCLASS64, ELFDATA2MSB, (char*)"Power PC 64"} | |
1710 }; | |
1711 | |
1712 #if (defined IA32) | |
1713 static Elf32_Half running_arch_code=EM_386; | |
1714 #elif (defined AMD64) | |
1715 static Elf32_Half running_arch_code=EM_X86_64; | |
1716 #elif (defined IA64) | |
1717 static Elf32_Half running_arch_code=EM_IA_64; | |
1718 #elif (defined __sparc) && (defined _LP64) | |
1719 static Elf32_Half running_arch_code=EM_SPARCV9; | |
1720 #elif (defined __sparc) && (!defined _LP64) | |
1721 static Elf32_Half running_arch_code=EM_SPARC; | |
1722 #elif (defined __powerpc64__) | |
1723 static Elf32_Half running_arch_code=EM_PPC64; | |
1724 #elif (defined __powerpc__) | |
1725 static Elf32_Half running_arch_code=EM_PPC; | |
1726 #else | |
1727 #error Method os::dll_load requires that one of following is defined:\ | |
1728 IA32, AMD64, IA64, __sparc, __powerpc__ | |
1729 #endif | |
1730 | |
1731 // Identify compatability class for VM's architecture and library's architecture | |
1732 // Obtain string descriptions for architectures | |
1733 | |
1734 arch_t lib_arch={elf_head.e_machine,0,elf_head.e_ident[EI_CLASS], elf_head.e_ident[EI_DATA], NULL}; | |
1735 int running_arch_index=-1; | |
1736 | |
1737 for (unsigned int i=0 ; i < ARRAY_SIZE(arch_array) ; i++ ) { | |
1738 if (running_arch_code == arch_array[i].code) { | |
1739 running_arch_index = i; | |
1740 } | |
1741 if (lib_arch.code == arch_array[i].code) { | |
1742 lib_arch.compat_class = arch_array[i].compat_class; | |
1743 lib_arch.name = arch_array[i].name; | |
1744 } | |
1745 } | |
1746 | |
1747 assert(running_arch_index != -1, | |
1748 "Didn't find running architecture code (running_arch_code) in arch_array"); | |
1749 if (running_arch_index == -1) { | |
1750 // Even though running architecture detection failed | |
1751 // we may still continue with reporting dlerror() message | |
1752 return NULL; | |
1753 } | |
1754 | |
1755 if (lib_arch.endianess != arch_array[running_arch_index].endianess) { | |
1756 ::snprintf(diag_msg_buf, diag_msg_max_length-1," (Possible cause: endianness mismatch)"); | |
1757 return NULL; | |
1758 } | |
1759 | |
1760 if (lib_arch.elf_class != arch_array[running_arch_index].elf_class) { | |
1761 ::snprintf(diag_msg_buf, diag_msg_max_length-1," (Possible cause: architecture word width mismatch)"); | |
1762 return NULL; | |
1763 } | |
1764 | |
1765 if (lib_arch.compat_class != arch_array[running_arch_index].compat_class) { | |
1766 if ( lib_arch.name!=NULL ) { | |
1767 ::snprintf(diag_msg_buf, diag_msg_max_length-1, | |
1768 " (Possible cause: can't load %s-bit .so on a %s-bit platform)", | |
1769 lib_arch.name, arch_array[running_arch_index].name); | |
1770 } else { | |
1771 ::snprintf(diag_msg_buf, diag_msg_max_length-1, | |
1772 " (Possible cause: can't load this .so (machine code=0x%x) on a %s-bit platform)", | |
1773 lib_arch.code, | |
1774 arch_array[running_arch_index].name); | |
1775 } | |
1776 } | |
1777 | |
1778 return NULL; | |
1779 } | |
1780 | |
242 | 1781 /* |
1782 * glibc-2.0 libdl is not MT safe. If you are building with any glibc, | |
1783 * chances are you might want to run the generated bits against glibc-2.0 | |
1784 * libdl.so, so always use locking for any version of glibc. | |
1785 */ | |
1786 void* os::dll_lookup(void* handle, const char* name) { | |
1787 pthread_mutex_lock(&dl_mutex); | |
1788 void* res = dlsym(handle, name); | |
1789 pthread_mutex_unlock(&dl_mutex); | |
1790 return res; | |
1791 } | |
0 | 1792 |
1793 | |
1794 bool _print_ascii_file(const char* filename, outputStream* st) { | |
1795 int fd = open(filename, O_RDONLY); | |
1796 if (fd == -1) { | |
1797 return false; | |
1798 } | |
1799 | |
1800 char buf[32]; | |
1801 int bytes; | |
1802 while ((bytes = read(fd, buf, sizeof(buf))) > 0) { | |
1803 st->print_raw(buf, bytes); | |
1804 } | |
1805 | |
1806 close(fd); | |
1807 | |
1808 return true; | |
1809 } | |
1810 | |
1811 void os::print_dll_info(outputStream *st) { | |
1812 st->print_cr("Dynamic libraries:"); | |
1813 | |
1814 char fname[32]; | |
1815 pid_t pid = os::Linux::gettid(); | |
1816 | |
1817 jio_snprintf(fname, sizeof(fname), "/proc/%d/maps", pid); | |
1818 | |
1819 if (!_print_ascii_file(fname, st)) { | |
1820 st->print("Can not get library information for pid = %d\n", pid); | |
1821 } | |
1822 } | |
1823 | |
1824 | |
1825 void os::print_os_info(outputStream* st) { | |
1826 st->print("OS:"); | |
1827 | |
1828 // Try to identify popular distros. | |
1829 // Most Linux distributions have /etc/XXX-release file, which contains | |
1830 // the OS version string. Some have more than one /etc/XXX-release file | |
1831 // (e.g. Mandrake has both /etc/mandrake-release and /etc/redhat-release.), | |
1832 // so the order is important. | |
1833 if (!_print_ascii_file("/etc/mandrake-release", st) && | |
1834 !_print_ascii_file("/etc/sun-release", st) && | |
1835 !_print_ascii_file("/etc/redhat-release", st) && | |
1836 !_print_ascii_file("/etc/SuSE-release", st) && | |
1837 !_print_ascii_file("/etc/turbolinux-release", st) && | |
1838 !_print_ascii_file("/etc/gentoo-release", st) && | |
1839 !_print_ascii_file("/etc/debian_version", st)) { | |
1840 st->print("Linux"); | |
1841 } | |
1842 st->cr(); | |
1843 | |
1844 // kernel | |
1845 st->print("uname:"); | |
1846 struct utsname name; | |
1847 uname(&name); | |
1848 st->print(name.sysname); st->print(" "); | |
1849 st->print(name.release); st->print(" "); | |
1850 st->print(name.version); st->print(" "); | |
1851 st->print(name.machine); | |
1852 st->cr(); | |
1853 | |
1854 // Print warning if unsafe chroot environment detected | |
1855 if (unsafe_chroot_detected) { | |
1856 st->print("WARNING!! "); | |
1857 st->print_cr(unstable_chroot_error); | |
1858 } | |
1859 | |
1860 // libc, pthread | |
1861 st->print("libc:"); | |
1862 st->print(os::Linux::glibc_version()); st->print(" "); | |
1863 st->print(os::Linux::libpthread_version()); st->print(" "); | |
1864 if (os::Linux::is_LinuxThreads()) { | |
1865 st->print("(%s stack)", os::Linux::is_floating_stack() ? "floating" : "fixed"); | |
1866 } | |
1867 st->cr(); | |
1868 | |
1869 // rlimit | |
1870 st->print("rlimit:"); | |
1871 struct rlimit rlim; | |
1872 | |
1873 st->print(" STACK "); | |
1874 getrlimit(RLIMIT_STACK, &rlim); | |
1875 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); | |
1876 else st->print("%uk", rlim.rlim_cur >> 10); | |
1877 | |
1878 st->print(", CORE "); | |
1879 getrlimit(RLIMIT_CORE, &rlim); | |
1880 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); | |
1881 else st->print("%uk", rlim.rlim_cur >> 10); | |
1882 | |
1883 st->print(", NPROC "); | |
1884 getrlimit(RLIMIT_NPROC, &rlim); | |
1885 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); | |
1886 else st->print("%d", rlim.rlim_cur); | |
1887 | |
1888 st->print(", NOFILE "); | |
1889 getrlimit(RLIMIT_NOFILE, &rlim); | |
1890 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); | |
1891 else st->print("%d", rlim.rlim_cur); | |
1892 | |
1893 st->print(", AS "); | |
1894 getrlimit(RLIMIT_AS, &rlim); | |
1895 if (rlim.rlim_cur == RLIM_INFINITY) st->print("infinity"); | |
1896 else st->print("%uk", rlim.rlim_cur >> 10); | |
1897 st->cr(); | |
1898 | |
1899 // load average | |
1900 st->print("load average:"); | |
1901 double loadavg[3]; | |
1902 os::loadavg(loadavg, 3); | |
1903 st->print("%0.02f %0.02f %0.02f", loadavg[0], loadavg[1], loadavg[2]); | |
1904 st->cr(); | |
1905 } | |
1906 | |
1907 void os::print_memory_info(outputStream* st) { | |
1908 | |
1909 st->print("Memory:"); | |
1910 st->print(" %dk page", os::vm_page_size()>>10); | |
1911 | |
1912 // values in struct sysinfo are "unsigned long" | |
1913 struct sysinfo si; | |
1914 sysinfo(&si); | |
1915 | |
1916 st->print(", physical " UINT64_FORMAT "k", | |
1917 os::physical_memory() >> 10); | |
1918 st->print("(" UINT64_FORMAT "k free)", | |
1919 os::available_memory() >> 10); | |
1920 st->print(", swap " UINT64_FORMAT "k", | |
1921 ((jlong)si.totalswap * si.mem_unit) >> 10); | |
1922 st->print("(" UINT64_FORMAT "k free)", | |
1923 ((jlong)si.freeswap * si.mem_unit) >> 10); | |
1924 st->cr(); | |
1925 } | |
1926 | |
1927 // Taken from /usr/include/bits/siginfo.h Supposed to be architecture specific | |
1928 // but they're the same for all the linux arch that we support | |
1929 // and they're the same for solaris but there's no common place to put this. | |
1930 const char *ill_names[] = { "ILL0", "ILL_ILLOPC", "ILL_ILLOPN", "ILL_ILLADR", | |
1931 "ILL_ILLTRP", "ILL_PRVOPC", "ILL_PRVREG", | |
1932 "ILL_COPROC", "ILL_BADSTK" }; | |
1933 | |
1934 const char *fpe_names[] = { "FPE0", "FPE_INTDIV", "FPE_INTOVF", "FPE_FLTDIV", | |
1935 "FPE_FLTOVF", "FPE_FLTUND", "FPE_FLTRES", | |
1936 "FPE_FLTINV", "FPE_FLTSUB", "FPE_FLTDEN" }; | |
1937 | |
1938 const char *segv_names[] = { "SEGV0", "SEGV_MAPERR", "SEGV_ACCERR" }; | |
1939 | |
1940 const char *bus_names[] = { "BUS0", "BUS_ADRALN", "BUS_ADRERR", "BUS_OBJERR" }; | |
1941 | |
1942 void os::print_siginfo(outputStream* st, void* siginfo) { | |
1943 st->print("siginfo:"); | |
1944 | |
1945 const int buflen = 100; | |
1946 char buf[buflen]; | |
1947 siginfo_t *si = (siginfo_t*)siginfo; | |
1948 st->print("si_signo=%s: ", os::exception_name(si->si_signo, buf, buflen)); | |
1949 if (si->si_errno != 0 && strerror_r(si->si_errno, buf, buflen) == 0) { | |
1950 st->print("si_errno=%s", buf); | |
1951 } else { | |
1952 st->print("si_errno=%d", si->si_errno); | |
1953 } | |
1954 const int c = si->si_code; | |
1955 assert(c > 0, "unexpected si_code"); | |
1956 switch (si->si_signo) { | |
1957 case SIGILL: | |
1958 st->print(", si_code=%d (%s)", c, c > 8 ? "" : ill_names[c]); | |
1959 st->print(", si_addr=" PTR_FORMAT, si->si_addr); | |
1960 break; | |
1961 case SIGFPE: | |
1962 st->print(", si_code=%d (%s)", c, c > 9 ? "" : fpe_names[c]); | |
1963 st->print(", si_addr=" PTR_FORMAT, si->si_addr); | |
1964 break; | |
1965 case SIGSEGV: | |
1966 st->print(", si_code=%d (%s)", c, c > 2 ? "" : segv_names[c]); | |
1967 st->print(", si_addr=" PTR_FORMAT, si->si_addr); | |
1968 break; | |
1969 case SIGBUS: | |
1970 st->print(", si_code=%d (%s)", c, c > 3 ? "" : bus_names[c]); | |
1971 st->print(", si_addr=" PTR_FORMAT, si->si_addr); | |
1972 break; | |
1973 default: | |
1974 st->print(", si_code=%d", si->si_code); | |
1975 // no si_addr | |
1976 } | |
1977 | |
1978 if ((si->si_signo == SIGBUS || si->si_signo == SIGSEGV) && | |
1979 UseSharedSpaces) { | |
1980 FileMapInfo* mapinfo = FileMapInfo::current_info(); | |
1981 if (mapinfo->is_in_shared_space(si->si_addr)) { | |
1982 st->print("\n\nError accessing class data sharing archive." \ | |
1983 " Mapped file inaccessible during execution, " \ | |
1984 " possible disk/network problem."); | |
1985 } | |
1986 } | |
1987 st->cr(); | |
1988 } | |
1989 | |
1990 | |
1991 static void print_signal_handler(outputStream* st, int sig, | |
1992 char* buf, size_t buflen); | |
1993 | |
1994 void os::print_signal_handlers(outputStream* st, char* buf, size_t buflen) { | |
1995 st->print_cr("Signal Handlers:"); | |
1996 print_signal_handler(st, SIGSEGV, buf, buflen); | |
1997 print_signal_handler(st, SIGBUS , buf, buflen); | |
1998 print_signal_handler(st, SIGFPE , buf, buflen); | |
1999 print_signal_handler(st, SIGPIPE, buf, buflen); | |
2000 print_signal_handler(st, SIGXFSZ, buf, buflen); | |
2001 print_signal_handler(st, SIGILL , buf, buflen); | |
2002 print_signal_handler(st, INTERRUPT_SIGNAL, buf, buflen); | |
2003 print_signal_handler(st, SR_signum, buf, buflen); | |
2004 print_signal_handler(st, SHUTDOWN1_SIGNAL, buf, buflen); | |
2005 print_signal_handler(st, SHUTDOWN2_SIGNAL , buf, buflen); | |
2006 print_signal_handler(st, SHUTDOWN3_SIGNAL , buf, buflen); | |
2007 print_signal_handler(st, BREAK_SIGNAL, buf, buflen); | |
2008 } | |
2009 | |
2010 static char saved_jvm_path[MAXPATHLEN] = {0}; | |
2011 | |
2012 // Find the full path to the current module, libjvm.so or libjvm_g.so | |
2013 void os::jvm_path(char *buf, jint len) { | |
2014 // Error checking. | |
2015 if (len < MAXPATHLEN) { | |
2016 assert(false, "must use a large-enough buffer"); | |
2017 buf[0] = '\0'; | |
2018 return; | |
2019 } | |
2020 // Lazy resolve the path to current module. | |
2021 if (saved_jvm_path[0] != 0) { | |
2022 strcpy(buf, saved_jvm_path); | |
2023 return; | |
2024 } | |
2025 | |
2026 char dli_fname[MAXPATHLEN]; | |
2027 bool ret = dll_address_to_library_name( | |
2028 CAST_FROM_FN_PTR(address, os::jvm_path), | |
2029 dli_fname, sizeof(dli_fname), NULL); | |
2030 assert(ret != 0, "cannot locate libjvm"); | |
2031 realpath(dli_fname, buf); | |
2032 | |
2033 if (strcmp(Arguments::sun_java_launcher(), "gamma") == 0) { | |
2034 // Support for the gamma launcher. Typical value for buf is | |
2035 // "<JAVA_HOME>/jre/lib/<arch>/<vmtype>/libjvm.so". If "/jre/lib/" appears at | |
2036 // the right place in the string, then assume we are installed in a JDK and | |
2037 // we're done. Otherwise, check for a JAVA_HOME environment variable and fix | |
2038 // up the path so it looks like libjvm.so is installed there (append a | |
2039 // fake suffix hotspot/libjvm.so). | |
2040 const char *p = buf + strlen(buf) - 1; | |
2041 for (int count = 0; p > buf && count < 5; ++count) { | |
2042 for (--p; p > buf && *p != '/'; --p) | |
2043 /* empty */ ; | |
2044 } | |
2045 | |
2046 if (strncmp(p, "/jre/lib/", 9) != 0) { | |
2047 // Look for JAVA_HOME in the environment. | |
2048 char* java_home_var = ::getenv("JAVA_HOME"); | |
2049 if (java_home_var != NULL && java_home_var[0] != 0) { | |
2050 // Check the current module name "libjvm.so" or "libjvm_g.so". | |
2051 p = strrchr(buf, '/'); | |
2052 assert(strstr(p, "/libjvm") == p, "invalid library name"); | |
2053 p = strstr(p, "_g") ? "_g" : ""; | |
2054 | |
2055 realpath(java_home_var, buf); | |
2056 sprintf(buf + strlen(buf), "/jre/lib/%s", cpu_arch); | |
2057 if (0 == access(buf, F_OK)) { | |
2058 // Use current module name "libjvm[_g].so" instead of | |
2059 // "libjvm"debug_only("_g")".so" since for fastdebug version | |
2060 // we should have "libjvm.so" but debug_only("_g") adds "_g"! | |
2061 // It is used when we are choosing the HPI library's name | |
2062 // "libhpi[_g].so" in hpi::initialize_get_interface(). | |
2063 sprintf(buf + strlen(buf), "/hotspot/libjvm%s.so", p); | |
2064 } else { | |
2065 // Go back to path of .so | |
2066 realpath(dli_fname, buf); | |
2067 } | |
2068 } | |
2069 } | |
2070 } | |
2071 | |
2072 strcpy(saved_jvm_path, buf); | |
2073 } | |
2074 | |
2075 void os::print_jni_name_prefix_on(outputStream* st, int args_size) { | |
2076 // no prefix required, not even "_" | |
2077 } | |
2078 | |
2079 void os::print_jni_name_suffix_on(outputStream* st, int args_size) { | |
2080 // no suffix required | |
2081 } | |
2082 | |
2083 //////////////////////////////////////////////////////////////////////////////// | |
2084 // sun.misc.Signal support | |
2085 | |
2086 static volatile jint sigint_count = 0; | |
2087 | |
2088 static void | |
2089 UserHandler(int sig, void *siginfo, void *context) { | |
2090 // 4511530 - sem_post is serialized and handled by the manager thread. When | |
2091 // the program is interrupted by Ctrl-C, SIGINT is sent to every thread. We | |
2092 // don't want to flood the manager thread with sem_post requests. | |
2093 if (sig == SIGINT && Atomic::add(1, &sigint_count) > 1) | |
2094 return; | |
2095 | |
2096 // Ctrl-C is pressed during error reporting, likely because the error | |
2097 // handler fails to abort. Let VM die immediately. | |
2098 if (sig == SIGINT && is_error_reported()) { | |
2099 os::die(); | |
2100 } | |
2101 | |
2102 os::signal_notify(sig); | |
2103 } | |
2104 | |
2105 void* os::user_handler() { | |
2106 return CAST_FROM_FN_PTR(void*, UserHandler); | |
2107 } | |
2108 | |
2109 extern "C" { | |
2110 typedef void (*sa_handler_t)(int); | |
2111 typedef void (*sa_sigaction_t)(int, siginfo_t *, void *); | |
2112 } | |
2113 | |
2114 void* os::signal(int signal_number, void* handler) { | |
2115 struct sigaction sigAct, oldSigAct; | |
2116 | |
2117 sigfillset(&(sigAct.sa_mask)); | |
2118 sigAct.sa_flags = SA_RESTART|SA_SIGINFO; | |
2119 sigAct.sa_handler = CAST_TO_FN_PTR(sa_handler_t, handler); | |
2120 | |
2121 if (sigaction(signal_number, &sigAct, &oldSigAct)) { | |
2122 // -1 means registration failed | |
2123 return (void *)-1; | |
2124 } | |
2125 | |
2126 return CAST_FROM_FN_PTR(void*, oldSigAct.sa_handler); | |
2127 } | |
2128 | |
2129 void os::signal_raise(int signal_number) { | |
2130 ::raise(signal_number); | |
2131 } | |
2132 | |
2133 /* | |
2134 * The following code is moved from os.cpp for making this | |
2135 * code platform specific, which it is by its very nature. | |
2136 */ | |
2137 | |
2138 // Will be modified when max signal is changed to be dynamic | |
2139 int os::sigexitnum_pd() { | |
2140 return NSIG; | |
2141 } | |
2142 | |
2143 // a counter for each possible signal value | |
2144 static volatile jint pending_signals[NSIG+1] = { 0 }; | |
2145 | |
2146 // Linux(POSIX) specific hand shaking semaphore. | |
2147 static sem_t sig_sem; | |
2148 | |
2149 void os::signal_init_pd() { | |
2150 // Initialize signal structures | |
2151 ::memset((void*)pending_signals, 0, sizeof(pending_signals)); | |
2152 | |
2153 // Initialize signal semaphore | |
2154 ::sem_init(&sig_sem, 0, 0); | |
2155 } | |
2156 | |
2157 void os::signal_notify(int sig) { | |
2158 Atomic::inc(&pending_signals[sig]); | |
2159 ::sem_post(&sig_sem); | |
2160 } | |
2161 | |
2162 static int check_pending_signals(bool wait) { | |
2163 Atomic::store(0, &sigint_count); | |
2164 for (;;) { | |
2165 for (int i = 0; i < NSIG + 1; i++) { | |
2166 jint n = pending_signals[i]; | |
2167 if (n > 0 && n == Atomic::cmpxchg(n - 1, &pending_signals[i], n)) { | |
2168 return i; | |
2169 } | |
2170 } | |
2171 if (!wait) { | |
2172 return -1; | |
2173 } | |
2174 JavaThread *thread = JavaThread::current(); | |
2175 ThreadBlockInVM tbivm(thread); | |
2176 | |
2177 bool threadIsSuspended; | |
2178 do { | |
2179 thread->set_suspend_equivalent(); | |
2180 // cleared by handle_special_suspend_equivalent_condition() or java_suspend_self() | |
2181 ::sem_wait(&sig_sem); | |
2182 | |
2183 // were we externally suspended while we were waiting? | |
2184 threadIsSuspended = thread->handle_special_suspend_equivalent_condition(); | |
2185 if (threadIsSuspended) { | |
2186 // | |
2187 // The semaphore has been incremented, but while we were waiting | |
2188 // another thread suspended us. We don't want to continue running | |
2189 // while suspended because that would surprise the thread that | |
2190 // suspended us. | |
2191 // | |
2192 ::sem_post(&sig_sem); | |
2193 | |
2194 thread->java_suspend_self(); | |
2195 } | |
2196 } while (threadIsSuspended); | |
2197 } | |
2198 } | |
2199 | |
2200 int os::signal_lookup() { | |
2201 return check_pending_signals(false); | |
2202 } | |
2203 | |
2204 int os::signal_wait() { | |
2205 return check_pending_signals(true); | |
2206 } | |
2207 | |
2208 //////////////////////////////////////////////////////////////////////////////// | |
2209 // Virtual Memory | |
2210 | |
2211 int os::vm_page_size() { | |
2212 // Seems redundant as all get out | |
2213 assert(os::Linux::page_size() != -1, "must call os::init"); | |
2214 return os::Linux::page_size(); | |
2215 } | |
2216 | |
2217 // Solaris allocates memory by pages. | |
2218 int os::vm_allocation_granularity() { | |
2219 assert(os::Linux::page_size() != -1, "must call os::init"); | |
2220 return os::Linux::page_size(); | |
2221 } | |
2222 | |
2223 // Rationale behind this function: | |
2224 // current (Mon Apr 25 20:12:18 MSD 2005) oprofile drops samples without executable | |
2225 // mapping for address (see lookup_dcookie() in the kernel module), thus we cannot get | |
2226 // samples for JITted code. Here we create private executable mapping over the code cache | |
2227 // and then we can use standard (well, almost, as mapping can change) way to provide | |
2228 // info for the reporting script by storing timestamp and location of symbol | |
2229 void linux_wrap_code(char* base, size_t size) { | |
2230 static volatile jint cnt = 0; | |
2231 | |
2232 if (!UseOprofile) { | |
2233 return; | |
2234 } | |
2235 | |
2236 char buf[40]; | |
2237 int num = Atomic::add(1, &cnt); | |
2238 | |
2239 sprintf(buf, "/tmp/hs-vm-%d-%d", os::current_process_id(), num); | |
2240 unlink(buf); | |
2241 | |
2242 int fd = open(buf, O_CREAT | O_RDWR, S_IRWXU); | |
2243 | |
2244 if (fd != -1) { | |
2245 off_t rv = lseek(fd, size-2, SEEK_SET); | |
2246 if (rv != (off_t)-1) { | |
2247 if (write(fd, "", 1) == 1) { | |
2248 mmap(base, size, | |
2249 PROT_READ|PROT_WRITE|PROT_EXEC, | |
2250 MAP_PRIVATE|MAP_FIXED|MAP_NORESERVE, fd, 0); | |
2251 } | |
2252 } | |
2253 close(fd); | |
2254 unlink(buf); | |
2255 } | |
2256 } | |
2257 | |
2258 // NOTE: Linux kernel does not really reserve the pages for us. | |
2259 // All it does is to check if there are enough free pages | |
2260 // left at the time of mmap(). This could be a potential | |
2261 // problem. | |
2262 bool os::commit_memory(char* addr, size_t size) { | |
2263 uintptr_t res = (uintptr_t) ::mmap(addr, size, | |
2264 PROT_READ|PROT_WRITE|PROT_EXEC, | |
2265 MAP_PRIVATE|MAP_FIXED|MAP_ANONYMOUS, -1, 0); | |
2266 return res != (uintptr_t) MAP_FAILED; | |
2267 } | |
2268 | |
2269 bool os::commit_memory(char* addr, size_t size, size_t alignment_hint) { | |
2270 return commit_memory(addr, size); | |
2271 } | |
2272 | |
2273 void os::realign_memory(char *addr, size_t bytes, size_t alignment_hint) { } | |
141 | 2274 |
2275 void os::free_memory(char *addr, size_t bytes) { | |
2276 uncommit_memory(addr, bytes); | |
2277 } | |
2278 | |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2279 void os::numa_make_global(char *addr, size_t bytes) { |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2280 Linux::numa_interleave_memory(addr, bytes); |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2281 } |
141 | 2282 |
2283 void os::numa_make_local(char *addr, size_t bytes, int lgrp_hint) { | |
2284 Linux::numa_tonode_memory(addr, bytes, lgrp_hint); | |
2285 } | |
2286 | |
2287 bool os::numa_topology_changed() { return false; } | |
2288 | |
2289 size_t os::numa_get_groups_num() { | |
2290 int max_node = Linux::numa_max_node(); | |
2291 return max_node > 0 ? max_node + 1 : 1; | |
2292 } | |
2293 | |
2294 int os::numa_get_group_id() { | |
2295 int cpu_id = Linux::sched_getcpu(); | |
2296 if (cpu_id != -1) { | |
2297 int lgrp_id = Linux::get_node_by_cpu(cpu_id); | |
2298 if (lgrp_id != -1) { | |
2299 return lgrp_id; | |
2300 } | |
0 | 2301 } |
2302 return 0; | |
2303 } | |
2304 | |
141 | 2305 size_t os::numa_get_leaf_groups(int *ids, size_t size) { |
2306 for (size_t i = 0; i < size; i++) { | |
2307 ids[i] = i; | |
2308 } | |
2309 return size; | |
2310 } | |
2311 | |
0 | 2312 bool os::get_page_info(char *start, page_info* info) { |
2313 return false; | |
2314 } | |
2315 | |
2316 char *os::scan_pages(char *start, char* end, page_info* page_expected, page_info* page_found) { | |
2317 return end; | |
2318 } | |
2319 | |
141 | 2320 extern "C" void numa_warn(int number, char *where, ...) { } |
2321 extern "C" void numa_error(char *where) { } | |
2322 | |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2323 bool os::Linux::libnuma_init() { |
141 | 2324 // sched_getcpu() should be in libc. |
2325 set_sched_getcpu(CAST_TO_FN_PTR(sched_getcpu_func_t, | |
2326 dlsym(RTLD_DEFAULT, "sched_getcpu"))); | |
2327 | |
2328 if (sched_getcpu() != -1) { // Does it work? | |
267
9d6a3a6891f8
6720130: NUMA allocator: The linux version should search for libnuma.so.1
iveresov
parents:
199
diff
changeset
|
2329 void *handle = dlopen("libnuma.so.1", RTLD_LAZY); |
141 | 2330 if (handle != NULL) { |
2331 set_numa_node_to_cpus(CAST_TO_FN_PTR(numa_node_to_cpus_func_t, | |
2332 dlsym(handle, "numa_node_to_cpus"))); | |
2333 set_numa_max_node(CAST_TO_FN_PTR(numa_max_node_func_t, | |
2334 dlsym(handle, "numa_max_node"))); | |
2335 set_numa_available(CAST_TO_FN_PTR(numa_available_func_t, | |
2336 dlsym(handle, "numa_available"))); | |
2337 set_numa_tonode_memory(CAST_TO_FN_PTR(numa_tonode_memory_func_t, | |
2338 dlsym(handle, "numa_tonode_memory"))); | |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2339 set_numa_interleave_memory(CAST_TO_FN_PTR(numa_interleave_memory_func_t, |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2340 dlsym(handle, "numa_interleave_memory"))); |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2341 |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2342 |
141 | 2343 if (numa_available() != -1) { |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2344 set_numa_all_nodes((unsigned long*)dlsym(handle, "numa_all_nodes")); |
141 | 2345 // Create a cpu -> node mapping |
2346 _cpu_to_node = new (ResourceObj::C_HEAP) GrowableArray<int>(0, true); | |
2347 rebuild_cpu_to_node_map(); | |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2348 return true; |
141 | 2349 } |
2350 } | |
2351 } | |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2352 return false; |
141 | 2353 } |
2354 | |
2355 // rebuild_cpu_to_node_map() constructs a table mapping cpud id to node id. | |
2356 // The table is later used in get_node_by_cpu(). | |
2357 void os::Linux::rebuild_cpu_to_node_map() { | |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2358 const size_t NCPUS = 32768; // Since the buffer size computation is very obscure |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2359 // in libnuma (possible values are starting from 16, |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2360 // and continuing up with every other power of 2, but less |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2361 // than the maximum number of CPUs supported by kernel), and |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2362 // is a subject to change (in libnuma version 2 the requirements |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2363 // are more reasonable) we'll just hardcode the number they use |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2364 // in the library. |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2365 const size_t BitsPerCLong = sizeof(long) * CHAR_BIT; |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2366 |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2367 size_t cpu_num = os::active_processor_count(); |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2368 size_t cpu_map_size = NCPUS / BitsPerCLong; |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2369 size_t cpu_map_valid_size = |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2370 MIN2((cpu_num + BitsPerCLong - 1) / BitsPerCLong, cpu_map_size); |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2371 |
141 | 2372 cpu_to_node()->clear(); |
2373 cpu_to_node()->at_grow(cpu_num - 1); | |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2374 size_t node_num = numa_get_groups_num(); |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2375 |
141 | 2376 unsigned long *cpu_map = NEW_C_HEAP_ARRAY(unsigned long, cpu_map_size); |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2377 for (size_t i = 0; i < node_num; i++) { |
141 | 2378 if (numa_node_to_cpus(i, cpu_map, cpu_map_size * sizeof(unsigned long)) != -1) { |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2379 for (size_t j = 0; j < cpu_map_valid_size; j++) { |
141 | 2380 if (cpu_map[j] != 0) { |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2381 for (size_t k = 0; k < BitsPerCLong; k++) { |
141 | 2382 if (cpu_map[j] & (1UL << k)) { |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2383 cpu_to_node()->at_put(j * BitsPerCLong + k, i); |
141 | 2384 } |
2385 } | |
2386 } | |
2387 } | |
2388 } | |
2389 } | |
2390 FREE_C_HEAP_ARRAY(unsigned long, cpu_map); | |
2391 } | |
2392 | |
2393 int os::Linux::get_node_by_cpu(int cpu_id) { | |
2394 if (cpu_to_node() != NULL && cpu_id >= 0 && cpu_id < cpu_to_node()->length()) { | |
2395 return cpu_to_node()->at(cpu_id); | |
2396 } | |
2397 return -1; | |
2398 } | |
2399 | |
2400 GrowableArray<int>* os::Linux::_cpu_to_node; | |
2401 os::Linux::sched_getcpu_func_t os::Linux::_sched_getcpu; | |
2402 os::Linux::numa_node_to_cpus_func_t os::Linux::_numa_node_to_cpus; | |
2403 os::Linux::numa_max_node_func_t os::Linux::_numa_max_node; | |
2404 os::Linux::numa_available_func_t os::Linux::_numa_available; | |
2405 os::Linux::numa_tonode_memory_func_t os::Linux::_numa_tonode_memory; | |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2406 os::Linux::numa_interleave_memory_func_t os::Linux::_numa_interleave_memory; |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
2407 unsigned long* os::Linux::_numa_all_nodes; |
141 | 2408 |
0 | 2409 bool os::uncommit_memory(char* addr, size_t size) { |
2410 return ::mmap(addr, size, | |
2411 PROT_READ|PROT_WRITE|PROT_EXEC, | |
2412 MAP_PRIVATE|MAP_FIXED|MAP_NORESERVE|MAP_ANONYMOUS, -1, 0) | |
2413 != MAP_FAILED; | |
2414 } | |
2415 | |
2416 static address _highest_vm_reserved_address = NULL; | |
2417 | |
2418 // If 'fixed' is true, anon_mmap() will attempt to reserve anonymous memory | |
2419 // at 'requested_addr'. If there are existing memory mappings at the same | |
2420 // location, however, they will be overwritten. If 'fixed' is false, | |
2421 // 'requested_addr' is only treated as a hint, the return value may or | |
2422 // may not start from the requested address. Unlike Linux mmap(), this | |
2423 // function returns NULL to indicate failure. | |
2424 static char* anon_mmap(char* requested_addr, size_t bytes, bool fixed) { | |
2425 char * addr; | |
2426 int flags; | |
2427 | |
2428 flags = MAP_PRIVATE | MAP_NORESERVE | MAP_ANONYMOUS; | |
2429 if (fixed) { | |
2430 assert((uintptr_t)requested_addr % os::Linux::page_size() == 0, "unaligned address"); | |
2431 flags |= MAP_FIXED; | |
2432 } | |
2433 | |
2434 addr = (char*)::mmap(requested_addr, bytes, PROT_READ|PROT_WRITE|PROT_EXEC, | |
2435 flags, -1, 0); | |
2436 | |
2437 if (addr != MAP_FAILED) { | |
2438 // anon_mmap() should only get called during VM initialization, | |
2439 // don't need lock (actually we can skip locking even it can be called | |
2440 // from multiple threads, because _highest_vm_reserved_address is just a | |
2441 // hint about the upper limit of non-stack memory regions.) | |
2442 if ((address)addr + bytes > _highest_vm_reserved_address) { | |
2443 _highest_vm_reserved_address = (address)addr + bytes; | |
2444 } | |
2445 } | |
2446 | |
2447 return addr == MAP_FAILED ? NULL : addr; | |
2448 } | |
2449 | |
2450 // Don't update _highest_vm_reserved_address, because there might be memory | |
2451 // regions above addr + size. If so, releasing a memory region only creates | |
2452 // a hole in the address space, it doesn't help prevent heap-stack collision. | |
2453 // | |
2454 static int anon_munmap(char * addr, size_t size) { | |
2455 return ::munmap(addr, size) == 0; | |
2456 } | |
2457 | |
2458 char* os::reserve_memory(size_t bytes, char* requested_addr, | |
2459 size_t alignment_hint) { | |
2460 return anon_mmap(requested_addr, bytes, (requested_addr != NULL)); | |
2461 } | |
2462 | |
2463 bool os::release_memory(char* addr, size_t size) { | |
2464 return anon_munmap(addr, size); | |
2465 } | |
2466 | |
2467 static address highest_vm_reserved_address() { | |
2468 return _highest_vm_reserved_address; | |
2469 } | |
2470 | |
2471 static bool linux_mprotect(char* addr, size_t size, int prot) { | |
2472 // Linux wants the mprotect address argument to be page aligned. | |
2473 char* bottom = (char*)align_size_down((intptr_t)addr, os::Linux::page_size()); | |
2474 | |
2475 // According to SUSv3, mprotect() should only be used with mappings | |
2476 // established by mmap(), and mmap() always maps whole pages. Unaligned | |
2477 // 'addr' likely indicates problem in the VM (e.g. trying to change | |
2478 // protection of malloc'ed or statically allocated memory). Check the | |
2479 // caller if you hit this assert. | |
2480 assert(addr == bottom, "sanity check"); | |
2481 | |
2482 size = align_size_up(pointer_delta(addr, bottom, 1) + size, os::Linux::page_size()); | |
2483 return ::mprotect(bottom, size, prot) == 0; | |
2484 } | |
2485 | |
237
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2486 // Set protections specified |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2487 bool os::protect_memory(char* addr, size_t bytes, ProtType prot, |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2488 bool is_committed) { |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2489 unsigned int p = 0; |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2490 switch (prot) { |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2491 case MEM_PROT_NONE: p = PROT_NONE; break; |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2492 case MEM_PROT_READ: p = PROT_READ; break; |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2493 case MEM_PROT_RW: p = PROT_READ|PROT_WRITE; break; |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2494 case MEM_PROT_RWX: p = PROT_READ|PROT_WRITE|PROT_EXEC; break; |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2495 default: |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2496 ShouldNotReachHere(); |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2497 } |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2498 // is_committed is unused. |
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
2499 return linux_mprotect(addr, bytes, p); |
0 | 2500 } |
2501 | |
2502 bool os::guard_memory(char* addr, size_t size) { | |
2503 return linux_mprotect(addr, size, PROT_NONE); | |
2504 } | |
2505 | |
2506 bool os::unguard_memory(char* addr, size_t size) { | |
477
24fda36852ce
6727377: VM stack guard pages on Windows should PAGE_READWRITE not PAGE_EXECUTE_READWRITE
coleenp
parents:
462
diff
changeset
|
2507 return linux_mprotect(addr, size, PROT_READ|PROT_WRITE); |
0 | 2508 } |
2509 | |
2510 // Large page support | |
2511 | |
2512 static size_t _large_page_size = 0; | |
2513 | |
2514 bool os::large_page_init() { | |
2515 if (!UseLargePages) return false; | |
2516 | |
2517 if (LargePageSizeInBytes) { | |
2518 _large_page_size = LargePageSizeInBytes; | |
2519 } else { | |
2520 // large_page_size on Linux is used to round up heap size. x86 uses either | |
2521 // 2M or 4M page, depending on whether PAE (Physical Address Extensions) | |
2522 // mode is enabled. AMD64/EM64T uses 2M page in 64bit mode. IA64 can use | |
2523 // page as large as 256M. | |
2524 // | |
2525 // Here we try to figure out page size by parsing /proc/meminfo and looking | |
2526 // for a line with the following format: | |
2527 // Hugepagesize: 2048 kB | |
2528 // | |
2529 // If we can't determine the value (e.g. /proc is not mounted, or the text | |
2530 // format has been changed), we'll use the largest page size supported by | |
2531 // the processor. | |
2532 | |
2533 _large_page_size = IA32_ONLY(4 * M) AMD64_ONLY(2 * M) IA64_ONLY(256 * M) SPARC_ONLY(4 * M); | |
2534 | |
2535 FILE *fp = fopen("/proc/meminfo", "r"); | |
2536 if (fp) { | |
2537 while (!feof(fp)) { | |
2538 int x = 0; | |
2539 char buf[16]; | |
2540 if (fscanf(fp, "Hugepagesize: %d", &x) == 1) { | |
2541 if (x && fgets(buf, sizeof(buf), fp) && strcmp(buf, " kB\n") == 0) { | |
2542 _large_page_size = x * K; | |
2543 break; | |
2544 } | |
2545 } else { | |
2546 // skip to next line | |
2547 for (;;) { | |
2548 int ch = fgetc(fp); | |
2549 if (ch == EOF || ch == (int)'\n') break; | |
2550 } | |
2551 } | |
2552 } | |
2553 fclose(fp); | |
2554 } | |
2555 } | |
2556 | |
2557 const size_t default_page_size = (size_t)Linux::page_size(); | |
2558 if (_large_page_size > default_page_size) { | |
2559 _page_sizes[0] = _large_page_size; | |
2560 _page_sizes[1] = default_page_size; | |
2561 _page_sizes[2] = 0; | |
2562 } | |
2563 | |
2564 // Large page support is available on 2.6 or newer kernel, some vendors | |
2565 // (e.g. Redhat) have backported it to their 2.4 based distributions. | |
2566 // We optimistically assume the support is available. If later it turns out | |
2567 // not true, VM will automatically switch to use regular page size. | |
2568 return true; | |
2569 } | |
2570 | |
2571 #ifndef SHM_HUGETLB | |
2572 #define SHM_HUGETLB 04000 | |
2573 #endif | |
2574 | |
2575 char* os::reserve_memory_special(size_t bytes) { | |
2576 assert(UseLargePages, "only for large pages"); | |
2577 | |
2578 key_t key = IPC_PRIVATE; | |
2579 char *addr; | |
2580 | |
2581 bool warn_on_failure = UseLargePages && | |
2582 (!FLAG_IS_DEFAULT(UseLargePages) || | |
2583 !FLAG_IS_DEFAULT(LargePageSizeInBytes) | |
2584 ); | |
2585 char msg[128]; | |
2586 | |
2587 // Create a large shared memory region to attach to based on size. | |
2588 // Currently, size is the total size of the heap | |
2589 int shmid = shmget(key, bytes, SHM_HUGETLB|IPC_CREAT|SHM_R|SHM_W); | |
2590 if (shmid == -1) { | |
2591 // Possible reasons for shmget failure: | |
2592 // 1. shmmax is too small for Java heap. | |
2593 // > check shmmax value: cat /proc/sys/kernel/shmmax | |
2594 // > increase shmmax value: echo "0xffffffff" > /proc/sys/kernel/shmmax | |
2595 // 2. not enough large page memory. | |
2596 // > check available large pages: cat /proc/meminfo | |
2597 // > increase amount of large pages: | |
2598 // echo new_value > /proc/sys/vm/nr_hugepages | |
2599 // Note 1: different Linux may use different name for this property, | |
2600 // e.g. on Redhat AS-3 it is "hugetlb_pool". | |
2601 // Note 2: it's possible there's enough physical memory available but | |
2602 // they are so fragmented after a long run that they can't | |
2603 // coalesce into large pages. Try to reserve large pages when | |
2604 // the system is still "fresh". | |
2605 if (warn_on_failure) { | |
2606 jio_snprintf(msg, sizeof(msg), "Failed to reserve shared memory (errno = %d).", errno); | |
2607 warning(msg); | |
2608 } | |
2609 return NULL; | |
2610 } | |
2611 | |
2612 // attach to the region | |
2613 addr = (char*)shmat(shmid, NULL, 0); | |
2614 int err = errno; | |
2615 | |
2616 // Remove shmid. If shmat() is successful, the actual shared memory segment | |
2617 // will be deleted when it's detached by shmdt() or when the process | |
2618 // terminates. If shmat() is not successful this will remove the shared | |
2619 // segment immediately. | |
2620 shmctl(shmid, IPC_RMID, NULL); | |
2621 | |
2622 if ((intptr_t)addr == -1) { | |
2623 if (warn_on_failure) { | |
2624 jio_snprintf(msg, sizeof(msg), "Failed to attach shared memory (errno = %d).", err); | |
2625 warning(msg); | |
2626 } | |
2627 return NULL; | |
2628 } | |
2629 | |
2630 return addr; | |
2631 } | |
2632 | |
2633 bool os::release_memory_special(char* base, size_t bytes) { | |
2634 // detaching the SHM segment will also delete it, see reserve_memory_special() | |
2635 int rslt = shmdt(base); | |
2636 return rslt == 0; | |
2637 } | |
2638 | |
2639 size_t os::large_page_size() { | |
2640 return _large_page_size; | |
2641 } | |
2642 | |
2643 // Linux does not support anonymous mmap with large page memory. The only way | |
2644 // to reserve large page memory without file backing is through SysV shared | |
2645 // memory API. The entire memory region is committed and pinned upfront. | |
2646 // Hopefully this will change in the future... | |
2647 bool os::can_commit_large_page_memory() { | |
2648 return false; | |
2649 } | |
2650 | |
79
82db0859acbe
6642862: Code cache allocation fails with large pages after 6588638
jcoomes
parents:
62
diff
changeset
|
2651 bool os::can_execute_large_page_memory() { |
82db0859acbe
6642862: Code cache allocation fails with large pages after 6588638
jcoomes
parents:
62
diff
changeset
|
2652 return false; |
82db0859acbe
6642862: Code cache allocation fails with large pages after 6588638
jcoomes
parents:
62
diff
changeset
|
2653 } |
82db0859acbe
6642862: Code cache allocation fails with large pages after 6588638
jcoomes
parents:
62
diff
changeset
|
2654 |
0 | 2655 // Reserve memory at an arbitrary address, only if that area is |
2656 // available (and not reserved for something else). | |
2657 | |
2658 char* os::attempt_reserve_memory_at(size_t bytes, char* requested_addr) { | |
2659 const int max_tries = 10; | |
2660 char* base[max_tries]; | |
2661 size_t size[max_tries]; | |
2662 const size_t gap = 0x000000; | |
2663 | |
2664 // Assert only that the size is a multiple of the page size, since | |
2665 // that's all that mmap requires, and since that's all we really know | |
2666 // about at this low abstraction level. If we need higher alignment, | |
2667 // we can either pass an alignment to this method or verify alignment | |
2668 // in one of the methods further up the call chain. See bug 5044738. | |
2669 assert(bytes % os::vm_page_size() == 0, "reserving unexpected size block"); | |
2670 | |
2671 // Repeatedly allocate blocks until the block is allocated at the | |
2672 // right spot. Give up after max_tries. Note that reserve_memory() will | |
2673 // automatically update _highest_vm_reserved_address if the call is | |
2674 // successful. The variable tracks the highest memory address every reserved | |
2675 // by JVM. It is used to detect heap-stack collision if running with | |
2676 // fixed-stack LinuxThreads. Because here we may attempt to reserve more | |
2677 // space than needed, it could confuse the collision detecting code. To | |
2678 // solve the problem, save current _highest_vm_reserved_address and | |
2679 // calculate the correct value before return. | |
2680 address old_highest = _highest_vm_reserved_address; | |
2681 | |
2682 // Linux mmap allows caller to pass an address as hint; give it a try first, | |
2683 // if kernel honors the hint then we can return immediately. | |
2684 char * addr = anon_mmap(requested_addr, bytes, false); | |
2685 if (addr == requested_addr) { | |
2686 return requested_addr; | |
2687 } | |
2688 | |
2689 if (addr != NULL) { | |
2690 // mmap() is successful but it fails to reserve at the requested address | |
2691 anon_munmap(addr, bytes); | |
2692 } | |
2693 | |
2694 int i; | |
2695 for (i = 0; i < max_tries; ++i) { | |
2696 base[i] = reserve_memory(bytes); | |
2697 | |
2698 if (base[i] != NULL) { | |
2699 // Is this the block we wanted? | |
2700 if (base[i] == requested_addr) { | |
2701 size[i] = bytes; | |
2702 break; | |
2703 } | |
2704 | |
2705 // Does this overlap the block we wanted? Give back the overlapped | |
2706 // parts and try again. | |
2707 | |
2708 size_t top_overlap = requested_addr + (bytes + gap) - base[i]; | |
2709 if (top_overlap >= 0 && top_overlap < bytes) { | |
2710 unmap_memory(base[i], top_overlap); | |
2711 base[i] += top_overlap; | |
2712 size[i] = bytes - top_overlap; | |
2713 } else { | |
2714 size_t bottom_overlap = base[i] + bytes - requested_addr; | |
2715 if (bottom_overlap >= 0 && bottom_overlap < bytes) { | |
2716 unmap_memory(requested_addr, bottom_overlap); | |
2717 size[i] = bytes - bottom_overlap; | |
2718 } else { | |
2719 size[i] = bytes; | |
2720 } | |
2721 } | |
2722 } | |
2723 } | |
2724 | |
2725 // Give back the unused reserved pieces. | |
2726 | |
2727 for (int j = 0; j < i; ++j) { | |
2728 if (base[j] != NULL) { | |
2729 unmap_memory(base[j], size[j]); | |
2730 } | |
2731 } | |
2732 | |
2733 if (i < max_tries) { | |
2734 _highest_vm_reserved_address = MAX2(old_highest, (address)requested_addr + bytes); | |
2735 return requested_addr; | |
2736 } else { | |
2737 _highest_vm_reserved_address = old_highest; | |
2738 return NULL; | |
2739 } | |
2740 } | |
2741 | |
2742 size_t os::read(int fd, void *buf, unsigned int nBytes) { | |
2743 return ::read(fd, buf, nBytes); | |
2744 } | |
2745 | |
2746 // TODO-FIXME: reconcile Solaris' os::sleep with the linux variation. | |
2747 // Solaris uses poll(), linux uses park(). | |
2748 // Poll() is likely a better choice, assuming that Thread.interrupt() | |
2749 // generates a SIGUSRx signal. Note that SIGUSR1 can interfere with | |
2750 // SIGSEGV, see 4355769. | |
2751 | |
2752 const int NANOSECS_PER_MILLISECS = 1000000; | |
2753 | |
2754 int os::sleep(Thread* thread, jlong millis, bool interruptible) { | |
2755 assert(thread == Thread::current(), "thread consistency check"); | |
2756 | |
2757 ParkEvent * const slp = thread->_SleepEvent ; | |
2758 slp->reset() ; | |
2759 OrderAccess::fence() ; | |
2760 | |
2761 if (interruptible) { | |
2762 jlong prevtime = javaTimeNanos(); | |
2763 | |
2764 for (;;) { | |
2765 if (os::is_interrupted(thread, true)) { | |
2766 return OS_INTRPT; | |
2767 } | |
2768 | |
2769 jlong newtime = javaTimeNanos(); | |
2770 | |
2771 if (newtime - prevtime < 0) { | |
2772 // time moving backwards, should only happen if no monotonic clock | |
2773 // not a guarantee() because JVM should not abort on kernel/glibc bugs | |
2774 assert(!Linux::supports_monotonic_clock(), "time moving backwards"); | |
2775 } else { | |
2776 millis -= (newtime - prevtime) / NANOSECS_PER_MILLISECS; | |
2777 } | |
2778 | |
2779 if(millis <= 0) { | |
2780 return OS_OK; | |
2781 } | |
2782 | |
2783 prevtime = newtime; | |
2784 | |
2785 { | |
2786 assert(thread->is_Java_thread(), "sanity check"); | |
2787 JavaThread *jt = (JavaThread *) thread; | |
2788 ThreadBlockInVM tbivm(jt); | |
2789 OSThreadWaitState osts(jt->osthread(), false /* not Object.wait() */); | |
2790 | |
2791 jt->set_suspend_equivalent(); | |
2792 // cleared by handle_special_suspend_equivalent_condition() or | |
2793 // java_suspend_self() via check_and_wait_while_suspended() | |
2794 | |
2795 slp->park(millis); | |
2796 | |
2797 // were we externally suspended while we were waiting? | |
2798 jt->check_and_wait_while_suspended(); | |
2799 } | |
2800 } | |
2801 } else { | |
2802 OSThreadWaitState osts(thread->osthread(), false /* not Object.wait() */); | |
2803 jlong prevtime = javaTimeNanos(); | |
2804 | |
2805 for (;;) { | |
2806 // It'd be nice to avoid the back-to-back javaTimeNanos() calls on | |
2807 // the 1st iteration ... | |
2808 jlong newtime = javaTimeNanos(); | |
2809 | |
2810 if (newtime - prevtime < 0) { | |
2811 // time moving backwards, should only happen if no monotonic clock | |
2812 // not a guarantee() because JVM should not abort on kernel/glibc bugs | |
2813 assert(!Linux::supports_monotonic_clock(), "time moving backwards"); | |
2814 } else { | |
2815 millis -= (newtime - prevtime) / NANOSECS_PER_MILLISECS; | |
2816 } | |
2817 | |
2818 if(millis <= 0) break ; | |
2819 | |
2820 prevtime = newtime; | |
2821 slp->park(millis); | |
2822 } | |
2823 return OS_OK ; | |
2824 } | |
2825 } | |
2826 | |
2827 int os::naked_sleep() { | |
2828 // %% make the sleep time an integer flag. for now use 1 millisec. | |
2829 return os::sleep(Thread::current(), 1, false); | |
2830 } | |
2831 | |
2832 // Sleep forever; naked call to OS-specific sleep; use with CAUTION | |
2833 void os::infinite_sleep() { | |
2834 while (true) { // sleep forever ... | |
2835 ::sleep(100); // ... 100 seconds at a time | |
2836 } | |
2837 } | |
2838 | |
2839 // Used to convert frequent JVM_Yield() to nops | |
2840 bool os::dont_yield() { | |
2841 return DontYieldALot; | |
2842 } | |
2843 | |
2844 void os::yield() { | |
2845 sched_yield(); | |
2846 } | |
2847 | |
2848 os::YieldResult os::NakedYield() { sched_yield(); return os::YIELD_UNKNOWN ;} | |
2849 | |
2850 void os::yield_all(int attempts) { | |
2851 // Yields to all threads, including threads with lower priorities | |
2852 // Threads on Linux are all with same priority. The Solaris style | |
2853 // os::yield_all() with nanosleep(1ms) is not necessary. | |
2854 sched_yield(); | |
2855 } | |
2856 | |
2857 // Called from the tight loops to possibly influence time-sharing heuristics | |
2858 void os::loop_breaker(int attempts) { | |
2859 os::yield_all(attempts); | |
2860 } | |
2861 | |
2862 //////////////////////////////////////////////////////////////////////////////// | |
2863 // thread priority support | |
2864 | |
2865 // Note: Normal Linux applications are run with SCHED_OTHER policy. SCHED_OTHER | |
2866 // only supports dynamic priority, static priority must be zero. For real-time | |
2867 // applications, Linux supports SCHED_RR which allows static priority (1-99). | |
2868 // However, for large multi-threaded applications, SCHED_RR is not only slower | |
2869 // than SCHED_OTHER, but also very unstable (my volano tests hang hard 4 out | |
2870 // of 5 runs - Sep 2005). | |
2871 // | |
2872 // The following code actually changes the niceness of kernel-thread/LWP. It | |
2873 // has an assumption that setpriority() only modifies one kernel-thread/LWP, | |
2874 // not the entire user process, and user level threads are 1:1 mapped to kernel | |
2875 // threads. It has always been the case, but could change in the future. For | |
2876 // this reason, the code should not be used as default (ThreadPriorityPolicy=0). | |
2877 // It is only used when ThreadPriorityPolicy=1 and requires root privilege. | |
2878 | |
2879 int os::java_to_os_priority[MaxPriority + 1] = { | |
2880 19, // 0 Entry should never be used | |
2881 | |
2882 4, // 1 MinPriority | |
2883 3, // 2 | |
2884 2, // 3 | |
2885 | |
2886 1, // 4 | |
2887 0, // 5 NormPriority | |
2888 -1, // 6 | |
2889 | |
2890 -2, // 7 | |
2891 -3, // 8 | |
2892 -4, // 9 NearMaxPriority | |
2893 | |
2894 -5 // 10 MaxPriority | |
2895 }; | |
2896 | |
2897 static int prio_init() { | |
2898 if (ThreadPriorityPolicy == 1) { | |
2899 // Only root can raise thread priority. Don't allow ThreadPriorityPolicy=1 | |
2900 // if effective uid is not root. Perhaps, a more elegant way of doing | |
2901 // this is to test CAP_SYS_NICE capability, but that will require libcap.so | |
2902 if (geteuid() != 0) { | |
2903 if (!FLAG_IS_DEFAULT(ThreadPriorityPolicy)) { | |
2904 warning("-XX:ThreadPriorityPolicy requires root privilege on Linux"); | |
2905 } | |
2906 ThreadPriorityPolicy = 0; | |
2907 } | |
2908 } | |
2909 return 0; | |
2910 } | |
2911 | |
2912 OSReturn os::set_native_priority(Thread* thread, int newpri) { | |
2913 if ( !UseThreadPriorities || ThreadPriorityPolicy == 0 ) return OS_OK; | |
2914 | |
2915 int ret = setpriority(PRIO_PROCESS, thread->osthread()->thread_id(), newpri); | |
2916 return (ret == 0) ? OS_OK : OS_ERR; | |
2917 } | |
2918 | |
2919 OSReturn os::get_native_priority(const Thread* const thread, int *priority_ptr) { | |
2920 if ( !UseThreadPriorities || ThreadPriorityPolicy == 0 ) { | |
2921 *priority_ptr = java_to_os_priority[NormPriority]; | |
2922 return OS_OK; | |
2923 } | |
2924 | |
2925 errno = 0; | |
2926 *priority_ptr = getpriority(PRIO_PROCESS, thread->osthread()->thread_id()); | |
2927 return (*priority_ptr != -1 || errno == 0 ? OS_OK : OS_ERR); | |
2928 } | |
2929 | |
2930 // Hint to the underlying OS that a task switch would not be good. | |
2931 // Void return because it's a hint and can fail. | |
2932 void os::hint_no_preempt() {} | |
2933 | |
2934 //////////////////////////////////////////////////////////////////////////////// | |
2935 // suspend/resume support | |
2936 | |
2937 // the low-level signal-based suspend/resume support is a remnant from the | |
2938 // old VM-suspension that used to be for java-suspension, safepoints etc, | |
2939 // within hotspot. Now there is a single use-case for this: | |
2940 // - calling get_thread_pc() on the VMThread by the flat-profiler task | |
2941 // that runs in the watcher thread. | |
2942 // The remaining code is greatly simplified from the more general suspension | |
2943 // code that used to be used. | |
2944 // | |
2945 // The protocol is quite simple: | |
2946 // - suspend: | |
2947 // - sends a signal to the target thread | |
2948 // - polls the suspend state of the osthread using a yield loop | |
2949 // - target thread signal handler (SR_handler) sets suspend state | |
2950 // and blocks in sigsuspend until continued | |
2951 // - resume: | |
2952 // - sets target osthread state to continue | |
2953 // - sends signal to end the sigsuspend loop in the SR_handler | |
2954 // | |
2955 // Note that the SR_lock plays no role in this suspend/resume protocol. | |
2956 // | |
2957 | |
2958 static void resume_clear_context(OSThread *osthread) { | |
2959 osthread->set_ucontext(NULL); | |
2960 osthread->set_siginfo(NULL); | |
2961 | |
2962 // notify the suspend action is completed, we have now resumed | |
2963 osthread->sr.clear_suspended(); | |
2964 } | |
2965 | |
2966 static void suspend_save_context(OSThread *osthread, siginfo_t* siginfo, ucontext_t* context) { | |
2967 osthread->set_ucontext(context); | |
2968 osthread->set_siginfo(siginfo); | |
2969 } | |
2970 | |
2971 // | |
2972 // Handler function invoked when a thread's execution is suspended or | |
2973 // resumed. We have to be careful that only async-safe functions are | |
2974 // called here (Note: most pthread functions are not async safe and | |
2975 // should be avoided.) | |
2976 // | |
2977 // Note: sigwait() is a more natural fit than sigsuspend() from an | |
2978 // interface point of view, but sigwait() prevents the signal hander | |
2979 // from being run. libpthread would get very confused by not having | |
2980 // its signal handlers run and prevents sigwait()'s use with the | |
2981 // mutex granting granting signal. | |
2982 // | |
2983 // Currently only ever called on the VMThread | |
2984 // | |
2985 static void SR_handler(int sig, siginfo_t* siginfo, ucontext_t* context) { | |
2986 // Save and restore errno to avoid confusing native code with EINTR | |
2987 // after sigsuspend. | |
2988 int old_errno = errno; | |
2989 | |
2990 Thread* thread = Thread::current(); | |
2991 OSThread* osthread = thread->osthread(); | |
2992 assert(thread->is_VM_thread(), "Must be VMThread"); | |
2993 // read current suspend action | |
2994 int action = osthread->sr.suspend_action(); | |
2995 if (action == SR_SUSPEND) { | |
2996 suspend_save_context(osthread, siginfo, context); | |
2997 | |
2998 // Notify the suspend action is about to be completed. do_suspend() | |
2999 // waits until SR_SUSPENDED is set and then returns. We will wait | |
3000 // here for a resume signal and that completes the suspend-other | |
3001 // action. do_suspend/do_resume is always called as a pair from | |
3002 // the same thread - so there are no races | |
3003 | |
3004 // notify the caller | |
3005 osthread->sr.set_suspended(); | |
3006 | |
3007 sigset_t suspend_set; // signals for sigsuspend() | |
3008 | |
3009 // get current set of blocked signals and unblock resume signal | |
3010 pthread_sigmask(SIG_BLOCK, NULL, &suspend_set); | |
3011 sigdelset(&suspend_set, SR_signum); | |
3012 | |
3013 // wait here until we are resumed | |
3014 do { | |
3015 sigsuspend(&suspend_set); | |
3016 // ignore all returns until we get a resume signal | |
3017 } while (osthread->sr.suspend_action() != SR_CONTINUE); | |
3018 | |
3019 resume_clear_context(osthread); | |
3020 | |
3021 } else { | |
3022 assert(action == SR_CONTINUE, "unexpected sr action"); | |
3023 // nothing special to do - just leave the handler | |
3024 } | |
3025 | |
3026 errno = old_errno; | |
3027 } | |
3028 | |
3029 | |
3030 static int SR_initialize() { | |
3031 struct sigaction act; | |
3032 char *s; | |
3033 /* Get signal number to use for suspend/resume */ | |
3034 if ((s = ::getenv("_JAVA_SR_SIGNUM")) != 0) { | |
3035 int sig = ::strtol(s, 0, 10); | |
3036 if (sig > 0 || sig < _NSIG) { | |
3037 SR_signum = sig; | |
3038 } | |
3039 } | |
3040 | |
3041 assert(SR_signum > SIGSEGV && SR_signum > SIGBUS, | |
3042 "SR_signum must be greater than max(SIGSEGV, SIGBUS), see 4355769"); | |
3043 | |
3044 sigemptyset(&SR_sigset); | |
3045 sigaddset(&SR_sigset, SR_signum); | |
3046 | |
3047 /* Set up signal handler for suspend/resume */ | |
3048 act.sa_flags = SA_RESTART|SA_SIGINFO; | |
3049 act.sa_handler = (void (*)(int)) SR_handler; | |
3050 | |
3051 // SR_signum is blocked by default. | |
3052 // 4528190 - We also need to block pthread restart signal (32 on all | |
3053 // supported Linux platforms). Note that LinuxThreads need to block | |
3054 // this signal for all threads to work properly. So we don't have | |
3055 // to use hard-coded signal number when setting up the mask. | |
3056 pthread_sigmask(SIG_BLOCK, NULL, &act.sa_mask); | |
3057 | |
3058 if (sigaction(SR_signum, &act, 0) == -1) { | |
3059 return -1; | |
3060 } | |
3061 | |
3062 // Save signal flag | |
3063 os::Linux::set_our_sigflags(SR_signum, act.sa_flags); | |
3064 return 0; | |
3065 } | |
3066 | |
3067 static int SR_finalize() { | |
3068 return 0; | |
3069 } | |
3070 | |
3071 | |
3072 // returns true on success and false on error - really an error is fatal | |
3073 // but this seems the normal response to library errors | |
3074 static bool do_suspend(OSThread* osthread) { | |
3075 // mark as suspended and send signal | |
3076 osthread->sr.set_suspend_action(SR_SUSPEND); | |
3077 int status = pthread_kill(osthread->pthread_id(), SR_signum); | |
3078 assert_status(status == 0, status, "pthread_kill"); | |
3079 | |
3080 // check status and wait until notified of suspension | |
3081 if (status == 0) { | |
3082 for (int i = 0; !osthread->sr.is_suspended(); i++) { | |
3083 os::yield_all(i); | |
3084 } | |
3085 osthread->sr.set_suspend_action(SR_NONE); | |
3086 return true; | |
3087 } | |
3088 else { | |
3089 osthread->sr.set_suspend_action(SR_NONE); | |
3090 return false; | |
3091 } | |
3092 } | |
3093 | |
3094 static void do_resume(OSThread* osthread) { | |
3095 assert(osthread->sr.is_suspended(), "thread should be suspended"); | |
3096 osthread->sr.set_suspend_action(SR_CONTINUE); | |
3097 | |
3098 int status = pthread_kill(osthread->pthread_id(), SR_signum); | |
3099 assert_status(status == 0, status, "pthread_kill"); | |
3100 // check status and wait unit notified of resumption | |
3101 if (status == 0) { | |
3102 for (int i = 0; osthread->sr.is_suspended(); i++) { | |
3103 os::yield_all(i); | |
3104 } | |
3105 } | |
3106 osthread->sr.set_suspend_action(SR_NONE); | |
3107 } | |
3108 | |
3109 //////////////////////////////////////////////////////////////////////////////// | |
3110 // interrupt support | |
3111 | |
3112 void os::interrupt(Thread* thread) { | |
3113 assert(Thread::current() == thread || Threads_lock->owned_by_self(), | |
3114 "possibility of dangling Thread pointer"); | |
3115 | |
3116 OSThread* osthread = thread->osthread(); | |
3117 | |
3118 if (!osthread->interrupted()) { | |
3119 osthread->set_interrupted(true); | |
3120 // More than one thread can get here with the same value of osthread, | |
3121 // resulting in multiple notifications. We do, however, want the store | |
3122 // to interrupted() to be visible to other threads before we execute unpark(). | |
3123 OrderAccess::fence(); | |
3124 ParkEvent * const slp = thread->_SleepEvent ; | |
3125 if (slp != NULL) slp->unpark() ; | |
3126 } | |
3127 | |
3128 // For JSR166. Unpark even if interrupt status already was set | |
3129 if (thread->is_Java_thread()) | |
3130 ((JavaThread*)thread)->parker()->unpark(); | |
3131 | |
3132 ParkEvent * ev = thread->_ParkEvent ; | |
3133 if (ev != NULL) ev->unpark() ; | |
3134 | |
3135 } | |
3136 | |
3137 bool os::is_interrupted(Thread* thread, bool clear_interrupted) { | |
3138 assert(Thread::current() == thread || Threads_lock->owned_by_self(), | |
3139 "possibility of dangling Thread pointer"); | |
3140 | |
3141 OSThread* osthread = thread->osthread(); | |
3142 | |
3143 bool interrupted = osthread->interrupted(); | |
3144 | |
3145 if (interrupted && clear_interrupted) { | |
3146 osthread->set_interrupted(false); | |
3147 // consider thread->_SleepEvent->reset() ... optional optimization | |
3148 } | |
3149 | |
3150 return interrupted; | |
3151 } | |
3152 | |
3153 /////////////////////////////////////////////////////////////////////////////////// | |
3154 // signal handling (except suspend/resume) | |
3155 | |
3156 // This routine may be used by user applications as a "hook" to catch signals. | |
3157 // The user-defined signal handler must pass unrecognized signals to this | |
3158 // routine, and if it returns true (non-zero), then the signal handler must | |
3159 // return immediately. If the flag "abort_if_unrecognized" is true, then this | |
3160 // routine will never retun false (zero), but instead will execute a VM panic | |
3161 // routine kill the process. | |
3162 // | |
3163 // If this routine returns false, it is OK to call it again. This allows | |
3164 // the user-defined signal handler to perform checks either before or after | |
3165 // the VM performs its own checks. Naturally, the user code would be making | |
3166 // a serious error if it tried to handle an exception (such as a null check | |
3167 // or breakpoint) that the VM was generating for its own correct operation. | |
3168 // | |
3169 // This routine may recognize any of the following kinds of signals: | |
3170 // SIGBUS, SIGSEGV, SIGILL, SIGFPE, SIGQUIT, SIGPIPE, SIGXFSZ, SIGUSR1. | |
3171 // It should be consulted by handlers for any of those signals. | |
3172 // | |
3173 // The caller of this routine must pass in the three arguments supplied | |
3174 // to the function referred to in the "sa_sigaction" (not the "sa_handler") | |
3175 // field of the structure passed to sigaction(). This routine assumes that | |
3176 // the sa_flags field passed to sigaction() includes SA_SIGINFO and SA_RESTART. | |
3177 // | |
3178 // Note that the VM will print warnings if it detects conflicting signal | |
3179 // handlers, unless invoked with the option "-XX:+AllowUserSignalHandlers". | |
3180 // | |
3181 extern "C" int | |
3182 JVM_handle_linux_signal(int signo, siginfo_t* siginfo, | |
3183 void* ucontext, int abort_if_unrecognized); | |
3184 | |
3185 void signalHandler(int sig, siginfo_t* info, void* uc) { | |
3186 assert(info != NULL && uc != NULL, "it must be old kernel"); | |
3187 JVM_handle_linux_signal(sig, info, uc, true); | |
3188 } | |
3189 | |
3190 | |
3191 // This boolean allows users to forward their own non-matching signals | |
3192 // to JVM_handle_linux_signal, harmlessly. | |
3193 bool os::Linux::signal_handlers_are_installed = false; | |
3194 | |
3195 // For signal-chaining | |
3196 struct sigaction os::Linux::sigact[MAXSIGNUM]; | |
3197 unsigned int os::Linux::sigs = 0; | |
3198 bool os::Linux::libjsig_is_loaded = false; | |
3199 typedef struct sigaction *(*get_signal_t)(int); | |
3200 get_signal_t os::Linux::get_signal_action = NULL; | |
3201 | |
3202 struct sigaction* os::Linux::get_chained_signal_action(int sig) { | |
3203 struct sigaction *actp = NULL; | |
3204 | |
3205 if (libjsig_is_loaded) { | |
3206 // Retrieve the old signal handler from libjsig | |
3207 actp = (*get_signal_action)(sig); | |
3208 } | |
3209 if (actp == NULL) { | |
3210 // Retrieve the preinstalled signal handler from jvm | |
3211 actp = get_preinstalled_handler(sig); | |
3212 } | |
3213 | |
3214 return actp; | |
3215 } | |
3216 | |
3217 static bool call_chained_handler(struct sigaction *actp, int sig, | |
3218 siginfo_t *siginfo, void *context) { | |
3219 // Call the old signal handler | |
3220 if (actp->sa_handler == SIG_DFL) { | |
3221 // It's more reasonable to let jvm treat it as an unexpected exception | |
3222 // instead of taking the default action. | |
3223 return false; | |
3224 } else if (actp->sa_handler != SIG_IGN) { | |
3225 if ((actp->sa_flags & SA_NODEFER) == 0) { | |
3226 // automaticlly block the signal | |
3227 sigaddset(&(actp->sa_mask), sig); | |
3228 } | |
3229 | |
3230 sa_handler_t hand; | |
3231 sa_sigaction_t sa; | |
3232 bool siginfo_flag_set = (actp->sa_flags & SA_SIGINFO) != 0; | |
3233 // retrieve the chained handler | |
3234 if (siginfo_flag_set) { | |
3235 sa = actp->sa_sigaction; | |
3236 } else { | |
3237 hand = actp->sa_handler; | |
3238 } | |
3239 | |
3240 if ((actp->sa_flags & SA_RESETHAND) != 0) { | |
3241 actp->sa_handler = SIG_DFL; | |
3242 } | |
3243 | |
3244 // try to honor the signal mask | |
3245 sigset_t oset; | |
3246 pthread_sigmask(SIG_SETMASK, &(actp->sa_mask), &oset); | |
3247 | |
3248 // call into the chained handler | |
3249 if (siginfo_flag_set) { | |
3250 (*sa)(sig, siginfo, context); | |
3251 } else { | |
3252 (*hand)(sig); | |
3253 } | |
3254 | |
3255 // restore the signal mask | |
3256 pthread_sigmask(SIG_SETMASK, &oset, 0); | |
3257 } | |
3258 // Tell jvm's signal handler the signal is taken care of. | |
3259 return true; | |
3260 } | |
3261 | |
3262 bool os::Linux::chained_handler(int sig, siginfo_t* siginfo, void* context) { | |
3263 bool chained = false; | |
3264 // signal-chaining | |
3265 if (UseSignalChaining) { | |
3266 struct sigaction *actp = get_chained_signal_action(sig); | |
3267 if (actp != NULL) { | |
3268 chained = call_chained_handler(actp, sig, siginfo, context); | |
3269 } | |
3270 } | |
3271 return chained; | |
3272 } | |
3273 | |
3274 struct sigaction* os::Linux::get_preinstalled_handler(int sig) { | |
3275 if ((( (unsigned int)1 << sig ) & sigs) != 0) { | |
3276 return &sigact[sig]; | |
3277 } | |
3278 return NULL; | |
3279 } | |
3280 | |
3281 void os::Linux::save_preinstalled_handler(int sig, struct sigaction& oldAct) { | |
3282 assert(sig > 0 && sig < MAXSIGNUM, "vm signal out of expected range"); | |
3283 sigact[sig] = oldAct; | |
3284 sigs |= (unsigned int)1 << sig; | |
3285 } | |
3286 | |
3287 // for diagnostic | |
3288 int os::Linux::sigflags[MAXSIGNUM]; | |
3289 | |
3290 int os::Linux::get_our_sigflags(int sig) { | |
3291 assert(sig > 0 && sig < MAXSIGNUM, "vm signal out of expected range"); | |
3292 return sigflags[sig]; | |
3293 } | |
3294 | |
3295 void os::Linux::set_our_sigflags(int sig, int flags) { | |
3296 assert(sig > 0 && sig < MAXSIGNUM, "vm signal out of expected range"); | |
3297 sigflags[sig] = flags; | |
3298 } | |
3299 | |
3300 void os::Linux::set_signal_handler(int sig, bool set_installed) { | |
3301 // Check for overwrite. | |
3302 struct sigaction oldAct; | |
3303 sigaction(sig, (struct sigaction*)NULL, &oldAct); | |
3304 | |
3305 void* oldhand = oldAct.sa_sigaction | |
3306 ? CAST_FROM_FN_PTR(void*, oldAct.sa_sigaction) | |
3307 : CAST_FROM_FN_PTR(void*, oldAct.sa_handler); | |
3308 if (oldhand != CAST_FROM_FN_PTR(void*, SIG_DFL) && | |
3309 oldhand != CAST_FROM_FN_PTR(void*, SIG_IGN) && | |
3310 oldhand != CAST_FROM_FN_PTR(void*, (sa_sigaction_t)signalHandler)) { | |
3311 if (AllowUserSignalHandlers || !set_installed) { | |
3312 // Do not overwrite; user takes responsibility to forward to us. | |
3313 return; | |
3314 } else if (UseSignalChaining) { | |
3315 // save the old handler in jvm | |
3316 save_preinstalled_handler(sig, oldAct); | |
3317 // libjsig also interposes the sigaction() call below and saves the | |
3318 // old sigaction on it own. | |
3319 } else { | |
3320 fatal2("Encountered unexpected pre-existing sigaction handler %#lx for signal %d.", (long)oldhand, sig); | |
3321 } | |
3322 } | |
3323 | |
3324 struct sigaction sigAct; | |
3325 sigfillset(&(sigAct.sa_mask)); | |
3326 sigAct.sa_handler = SIG_DFL; | |
3327 if (!set_installed) { | |
3328 sigAct.sa_flags = SA_SIGINFO|SA_RESTART; | |
3329 } else { | |
3330 sigAct.sa_sigaction = signalHandler; | |
3331 sigAct.sa_flags = SA_SIGINFO|SA_RESTART; | |
3332 } | |
3333 // Save flags, which are set by ours | |
3334 assert(sig > 0 && sig < MAXSIGNUM, "vm signal out of expected range"); | |
3335 sigflags[sig] = sigAct.sa_flags; | |
3336 | |
3337 int ret = sigaction(sig, &sigAct, &oldAct); | |
3338 assert(ret == 0, "check"); | |
3339 | |
3340 void* oldhand2 = oldAct.sa_sigaction | |
3341 ? CAST_FROM_FN_PTR(void*, oldAct.sa_sigaction) | |
3342 : CAST_FROM_FN_PTR(void*, oldAct.sa_handler); | |
3343 assert(oldhand2 == oldhand, "no concurrent signal handler installation"); | |
3344 } | |
3345 | |
3346 // install signal handlers for signals that HotSpot needs to | |
3347 // handle in order to support Java-level exception handling. | |
3348 | |
3349 void os::Linux::install_signal_handlers() { | |
3350 if (!signal_handlers_are_installed) { | |
3351 signal_handlers_are_installed = true; | |
3352 | |
3353 // signal-chaining | |
3354 typedef void (*signal_setting_t)(); | |
3355 signal_setting_t begin_signal_setting = NULL; | |
3356 signal_setting_t end_signal_setting = NULL; | |
3357 begin_signal_setting = CAST_TO_FN_PTR(signal_setting_t, | |
3358 dlsym(RTLD_DEFAULT, "JVM_begin_signal_setting")); | |
3359 if (begin_signal_setting != NULL) { | |
3360 end_signal_setting = CAST_TO_FN_PTR(signal_setting_t, | |
3361 dlsym(RTLD_DEFAULT, "JVM_end_signal_setting")); | |
3362 get_signal_action = CAST_TO_FN_PTR(get_signal_t, | |
3363 dlsym(RTLD_DEFAULT, "JVM_get_signal_action")); | |
3364 libjsig_is_loaded = true; | |
3365 assert(UseSignalChaining, "should enable signal-chaining"); | |
3366 } | |
3367 if (libjsig_is_loaded) { | |
3368 // Tell libjsig jvm is setting signal handlers | |
3369 (*begin_signal_setting)(); | |
3370 } | |
3371 | |
3372 set_signal_handler(SIGSEGV, true); | |
3373 set_signal_handler(SIGPIPE, true); | |
3374 set_signal_handler(SIGBUS, true); | |
3375 set_signal_handler(SIGILL, true); | |
3376 set_signal_handler(SIGFPE, true); | |
3377 set_signal_handler(SIGXFSZ, true); | |
3378 | |
3379 if (libjsig_is_loaded) { | |
3380 // Tell libjsig jvm finishes setting signal handlers | |
3381 (*end_signal_setting)(); | |
3382 } | |
3383 | |
3384 // We don't activate signal checker if libjsig is in place, we trust ourselves | |
3385 // and if UserSignalHandler is installed all bets are off | |
3386 if (CheckJNICalls) { | |
3387 if (libjsig_is_loaded) { | |
3388 tty->print_cr("Info: libjsig is activated, all active signal checking is disabled"); | |
3389 check_signals = false; | |
3390 } | |
3391 if (AllowUserSignalHandlers) { | |
3392 tty->print_cr("Info: AllowUserSignalHandlers is activated, all active signal checking is disabled"); | |
3393 check_signals = false; | |
3394 } | |
3395 } | |
3396 } | |
3397 } | |
3398 | |
3399 // This is the fastest way to get thread cpu time on Linux. | |
3400 // Returns cpu time (user+sys) for any thread, not only for current. | |
3401 // POSIX compliant clocks are implemented in the kernels 2.6.16+. | |
3402 // It might work on 2.6.10+ with a special kernel/glibc patch. | |
3403 // For reference, please, see IEEE Std 1003.1-2004: | |
3404 // http://www.unix.org/single_unix_specification | |
3405 | |
3406 jlong os::Linux::fast_thread_cpu_time(clockid_t clockid) { | |
3407 struct timespec tp; | |
3408 int rc = os::Linux::clock_gettime(clockid, &tp); | |
3409 assert(rc == 0, "clock_gettime is expected to return 0 code"); | |
3410 | |
3411 return (tp.tv_sec * SEC_IN_NANOSECS) + tp.tv_nsec; | |
3412 } | |
3413 | |
3414 ///// | |
3415 // glibc on Linux platform uses non-documented flag | |
3416 // to indicate, that some special sort of signal | |
3417 // trampoline is used. | |
3418 // We will never set this flag, and we should | |
3419 // ignore this flag in our diagnostic | |
3420 #ifdef SIGNIFICANT_SIGNAL_MASK | |
3421 #undef SIGNIFICANT_SIGNAL_MASK | |
3422 #endif | |
3423 #define SIGNIFICANT_SIGNAL_MASK (~0x04000000) | |
3424 | |
3425 static const char* get_signal_handler_name(address handler, | |
3426 char* buf, int buflen) { | |
3427 int offset; | |
3428 bool found = os::dll_address_to_library_name(handler, buf, buflen, &offset); | |
3429 if (found) { | |
3430 // skip directory names | |
3431 const char *p1, *p2; | |
3432 p1 = buf; | |
3433 size_t len = strlen(os::file_separator()); | |
3434 while ((p2 = strstr(p1, os::file_separator())) != NULL) p1 = p2 + len; | |
3435 jio_snprintf(buf, buflen, "%s+0x%x", p1, offset); | |
3436 } else { | |
3437 jio_snprintf(buf, buflen, PTR_FORMAT, handler); | |
3438 } | |
3439 return buf; | |
3440 } | |
3441 | |
3442 static void print_signal_handler(outputStream* st, int sig, | |
3443 char* buf, size_t buflen) { | |
3444 struct sigaction sa; | |
3445 | |
3446 sigaction(sig, NULL, &sa); | |
3447 | |
3448 // See comment for SIGNIFICANT_SIGNAL_MASK define | |
3449 sa.sa_flags &= SIGNIFICANT_SIGNAL_MASK; | |
3450 | |
3451 st->print("%s: ", os::exception_name(sig, buf, buflen)); | |
3452 | |
3453 address handler = (sa.sa_flags & SA_SIGINFO) | |
3454 ? CAST_FROM_FN_PTR(address, sa.sa_sigaction) | |
3455 : CAST_FROM_FN_PTR(address, sa.sa_handler); | |
3456 | |
3457 if (handler == CAST_FROM_FN_PTR(address, SIG_DFL)) { | |
3458 st->print("SIG_DFL"); | |
3459 } else if (handler == CAST_FROM_FN_PTR(address, SIG_IGN)) { | |
3460 st->print("SIG_IGN"); | |
3461 } else { | |
3462 st->print("[%s]", get_signal_handler_name(handler, buf, buflen)); | |
3463 } | |
3464 | |
3465 st->print(", sa_mask[0]=" PTR32_FORMAT, *(uint32_t*)&sa.sa_mask); | |
3466 | |
3467 address rh = VMError::get_resetted_sighandler(sig); | |
3468 // May be, handler was resetted by VMError? | |
3469 if(rh != NULL) { | |
3470 handler = rh; | |
3471 sa.sa_flags = VMError::get_resetted_sigflags(sig) & SIGNIFICANT_SIGNAL_MASK; | |
3472 } | |
3473 | |
3474 st->print(", sa_flags=" PTR32_FORMAT, sa.sa_flags); | |
3475 | |
3476 // Check: is it our handler? | |
3477 if(handler == CAST_FROM_FN_PTR(address, (sa_sigaction_t)signalHandler) || | |
3478 handler == CAST_FROM_FN_PTR(address, (sa_sigaction_t)SR_handler)) { | |
3479 // It is our signal handler | |
3480 // check for flags, reset system-used one! | |
3481 if((int)sa.sa_flags != os::Linux::get_our_sigflags(sig)) { | |
3482 st->print( | |
3483 ", flags was changed from " PTR32_FORMAT ", consider using jsig library", | |
3484 os::Linux::get_our_sigflags(sig)); | |
3485 } | |
3486 } | |
3487 st->cr(); | |
3488 } | |
3489 | |
3490 | |
3491 #define DO_SIGNAL_CHECK(sig) \ | |
3492 if (!sigismember(&check_signal_done, sig)) \ | |
3493 os::Linux::check_signal_handler(sig) | |
3494 | |
3495 // This method is a periodic task to check for misbehaving JNI applications | |
3496 // under CheckJNI, we can add any periodic checks here | |
3497 | |
3498 void os::run_periodic_checks() { | |
3499 | |
3500 if (check_signals == false) return; | |
3501 | |
3502 // SEGV and BUS if overridden could potentially prevent | |
3503 // generation of hs*.log in the event of a crash, debugging | |
3504 // such a case can be very challenging, so we absolutely | |
3505 // check the following for a good measure: | |
3506 DO_SIGNAL_CHECK(SIGSEGV); | |
3507 DO_SIGNAL_CHECK(SIGILL); | |
3508 DO_SIGNAL_CHECK(SIGFPE); | |
3509 DO_SIGNAL_CHECK(SIGBUS); | |
3510 DO_SIGNAL_CHECK(SIGPIPE); | |
3511 DO_SIGNAL_CHECK(SIGXFSZ); | |
3512 | |
3513 | |
3514 // ReduceSignalUsage allows the user to override these handlers | |
3515 // see comments at the very top and jvm_solaris.h | |
3516 if (!ReduceSignalUsage) { | |
3517 DO_SIGNAL_CHECK(SHUTDOWN1_SIGNAL); | |
3518 DO_SIGNAL_CHECK(SHUTDOWN2_SIGNAL); | |
3519 DO_SIGNAL_CHECK(SHUTDOWN3_SIGNAL); | |
3520 DO_SIGNAL_CHECK(BREAK_SIGNAL); | |
3521 } | |
3522 | |
3523 DO_SIGNAL_CHECK(SR_signum); | |
3524 DO_SIGNAL_CHECK(INTERRUPT_SIGNAL); | |
3525 } | |
3526 | |
3527 typedef int (*os_sigaction_t)(int, const struct sigaction *, struct sigaction *); | |
3528 | |
3529 static os_sigaction_t os_sigaction = NULL; | |
3530 | |
3531 void os::Linux::check_signal_handler(int sig) { | |
3532 char buf[O_BUFLEN]; | |
3533 address jvmHandler = NULL; | |
3534 | |
3535 | |
3536 struct sigaction act; | |
3537 if (os_sigaction == NULL) { | |
3538 // only trust the default sigaction, in case it has been interposed | |
3539 os_sigaction = (os_sigaction_t)dlsym(RTLD_DEFAULT, "sigaction"); | |
3540 if (os_sigaction == NULL) return; | |
3541 } | |
3542 | |
3543 os_sigaction(sig, (struct sigaction*)NULL, &act); | |
3544 | |
3545 | |
3546 act.sa_flags &= SIGNIFICANT_SIGNAL_MASK; | |
3547 | |
3548 address thisHandler = (act.sa_flags & SA_SIGINFO) | |
3549 ? CAST_FROM_FN_PTR(address, act.sa_sigaction) | |
3550 : CAST_FROM_FN_PTR(address, act.sa_handler) ; | |
3551 | |
3552 | |
3553 switch(sig) { | |
3554 case SIGSEGV: | |
3555 case SIGBUS: | |
3556 case SIGFPE: | |
3557 case SIGPIPE: | |
3558 case SIGILL: | |
3559 case SIGXFSZ: | |
3560 jvmHandler = CAST_FROM_FN_PTR(address, (sa_sigaction_t)signalHandler); | |
3561 break; | |
3562 | |
3563 case SHUTDOWN1_SIGNAL: | |
3564 case SHUTDOWN2_SIGNAL: | |
3565 case SHUTDOWN3_SIGNAL: | |
3566 case BREAK_SIGNAL: | |
3567 jvmHandler = (address)user_handler(); | |
3568 break; | |
3569 | |
3570 case INTERRUPT_SIGNAL: | |
3571 jvmHandler = CAST_FROM_FN_PTR(address, SIG_DFL); | |
3572 break; | |
3573 | |
3574 default: | |
3575 if (sig == SR_signum) { | |
3576 jvmHandler = CAST_FROM_FN_PTR(address, (sa_sigaction_t)SR_handler); | |
3577 } else { | |
3578 return; | |
3579 } | |
3580 break; | |
3581 } | |
3582 | |
3583 if (thisHandler != jvmHandler) { | |
3584 tty->print("Warning: %s handler ", exception_name(sig, buf, O_BUFLEN)); | |
3585 tty->print("expected:%s", get_signal_handler_name(jvmHandler, buf, O_BUFLEN)); | |
3586 tty->print_cr(" found:%s", get_signal_handler_name(thisHandler, buf, O_BUFLEN)); | |
3587 // No need to check this sig any longer | |
3588 sigaddset(&check_signal_done, sig); | |
3589 } else if(os::Linux::get_our_sigflags(sig) != 0 && (int)act.sa_flags != os::Linux::get_our_sigflags(sig)) { | |
3590 tty->print("Warning: %s handler flags ", exception_name(sig, buf, O_BUFLEN)); | |
3591 tty->print("expected:" PTR32_FORMAT, os::Linux::get_our_sigflags(sig)); | |
3592 tty->print_cr(" found:" PTR32_FORMAT, act.sa_flags); | |
3593 // No need to check this sig any longer | |
3594 sigaddset(&check_signal_done, sig); | |
3595 } | |
3596 | |
3597 // Dump all the signal | |
3598 if (sigismember(&check_signal_done, sig)) { | |
3599 print_signal_handlers(tty, buf, O_BUFLEN); | |
3600 } | |
3601 } | |
3602 | |
3603 extern void report_error(char* file_name, int line_no, char* title, char* format, ...); | |
3604 | |
3605 extern bool signal_name(int signo, char* buf, size_t len); | |
3606 | |
3607 const char* os::exception_name(int exception_code, char* buf, size_t size) { | |
3608 if (0 < exception_code && exception_code <= SIGRTMAX) { | |
3609 // signal | |
3610 if (!signal_name(exception_code, buf, size)) { | |
3611 jio_snprintf(buf, size, "SIG%d", exception_code); | |
3612 } | |
3613 return buf; | |
3614 } else { | |
3615 return NULL; | |
3616 } | |
3617 } | |
3618 | |
3619 // this is called _before_ the most of global arguments have been parsed | |
3620 void os::init(void) { | |
3621 char dummy; /* used to get a guess on initial stack address */ | |
3622 // first_hrtime = gethrtime(); | |
3623 | |
3624 // With LinuxThreads the JavaMain thread pid (primordial thread) | |
3625 // is different than the pid of the java launcher thread. | |
3626 // So, on Linux, the launcher thread pid is passed to the VM | |
3627 // via the sun.java.launcher.pid property. | |
3628 // Use this property instead of getpid() if it was correctly passed. | |
3629 // See bug 6351349. | |
3630 pid_t java_launcher_pid = (pid_t) Arguments::sun_java_launcher_pid(); | |
3631 | |
3632 _initial_pid = (java_launcher_pid > 0) ? java_launcher_pid : getpid(); | |
3633 | |
3634 clock_tics_per_sec = sysconf(_SC_CLK_TCK); | |
3635 | |
3636 init_random(1234567); | |
3637 | |
3638 ThreadCritical::initialize(); | |
3639 | |
3640 Linux::set_page_size(sysconf(_SC_PAGESIZE)); | |
3641 if (Linux::page_size() == -1) { | |
3642 fatal1("os_linux.cpp: os::init: sysconf failed (%s)", strerror(errno)); | |
3643 } | |
3644 init_page_sizes((size_t) Linux::page_size()); | |
3645 | |
3646 Linux::initialize_system_info(); | |
3647 | |
3648 // main_thread points to the aboriginal thread | |
3649 Linux::_main_thread = pthread_self(); | |
3650 | |
3651 Linux::clock_init(); | |
3652 initial_time_count = os::elapsed_counter(); | |
242 | 3653 pthread_mutex_init(&dl_mutex, NULL); |
0 | 3654 } |
3655 | |
3656 // To install functions for atexit system call | |
3657 extern "C" { | |
3658 static void perfMemory_exit_helper() { | |
3659 perfMemory_exit(); | |
3660 } | |
3661 } | |
3662 | |
3663 // this is called _after_ the global arguments have been parsed | |
3664 jint os::init_2(void) | |
3665 { | |
3666 Linux::fast_thread_clock_init(); | |
3667 | |
3668 // Allocate a single page and mark it as readable for safepoint polling | |
3669 address polling_page = (address) ::mmap(NULL, Linux::page_size(), PROT_READ, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0); | |
3670 guarantee( polling_page != MAP_FAILED, "os::init_2: failed to allocate polling page" ); | |
3671 | |
3672 os::set_polling_page( polling_page ); | |
3673 | |
3674 #ifndef PRODUCT | |
3675 if(Verbose && PrintMiscellaneous) | |
3676 tty->print("[SafePoint Polling address: " INTPTR_FORMAT "]\n", (intptr_t)polling_page); | |
3677 #endif | |
3678 | |
3679 if (!UseMembar) { | |
3680 address mem_serialize_page = (address) ::mmap(NULL, Linux::page_size(), PROT_READ | PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0); | |
3681 guarantee( mem_serialize_page != NULL, "mmap Failed for memory serialize page"); | |
3682 os::set_memory_serialize_page( mem_serialize_page ); | |
3683 | |
3684 #ifndef PRODUCT | |
3685 if(Verbose && PrintMiscellaneous) | |
3686 tty->print("[Memory Serialize Page address: " INTPTR_FORMAT "]\n", (intptr_t)mem_serialize_page); | |
3687 #endif | |
3688 } | |
3689 | |
3690 FLAG_SET_DEFAULT(UseLargePages, os::large_page_init()); | |
3691 | |
3692 // initialize suspend/resume support - must do this before signal_sets_init() | |
3693 if (SR_initialize() != 0) { | |
3694 perror("SR_initialize failed"); | |
3695 return JNI_ERR; | |
3696 } | |
3697 | |
3698 Linux::signal_sets_init(); | |
3699 Linux::install_signal_handlers(); | |
3700 | |
3701 size_t threadStackSizeInBytes = ThreadStackSize * K; | |
3702 if (threadStackSizeInBytes != 0 && | |
3703 threadStackSizeInBytes < Linux::min_stack_allowed) { | |
3704 tty->print_cr("\nThe stack size specified is too small, " | |
3705 "Specify at least %dk", | |
3706 Linux::min_stack_allowed / K); | |
3707 return JNI_ERR; | |
3708 } | |
3709 | |
3710 // Make the stack size a multiple of the page size so that | |
3711 // the yellow/red zones can be guarded. | |
3712 JavaThread::set_stack_size_at_create(round_to(threadStackSizeInBytes, | |
3713 vm_page_size())); | |
3714 | |
3715 Linux::capture_initial_stack(JavaThread::stack_size_at_create()); | |
3716 | |
3717 Linux::libpthread_init(); | |
3718 if (PrintMiscellaneous && (Verbose || WizardMode)) { | |
3719 tty->print_cr("[HotSpot is running with %s, %s(%s)]\n", | |
3720 Linux::glibc_version(), Linux::libpthread_version(), | |
3721 Linux::is_floating_stack() ? "floating stack" : "fixed stack"); | |
3722 } | |
3723 | |
141 | 3724 if (UseNUMA) { |
462
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3725 if (!Linux::libnuma_init()) { |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3726 UseNUMA = false; |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3727 } else { |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3728 if ((Linux::numa_max_node() < 1)) { |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3729 // There's only one node(they start from 0), disable NUMA. |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3730 UseNUMA = false; |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3731 } |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3732 } |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3733 if (!UseNUMA && ForceNUMA) { |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3734 UseNUMA = true; |
85f1b9537f70
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov
parents:
356
diff
changeset
|
3735 } |
141 | 3736 } |
3737 | |
0 | 3738 if (MaxFDLimit) { |
3739 // set the number of file descriptors to max. print out error | |
3740 // if getrlimit/setrlimit fails but continue regardless. | |
3741 struct rlimit nbr_files; | |
3742 int status = getrlimit(RLIMIT_NOFILE, &nbr_files); | |
3743 if (status != 0) { | |
3744 if (PrintMiscellaneous && (Verbose || WizardMode)) | |
3745 perror("os::init_2 getrlimit failed"); | |
3746 } else { | |
3747 nbr_files.rlim_cur = nbr_files.rlim_max; | |
3748 status = setrlimit(RLIMIT_NOFILE, &nbr_files); | |
3749 if (status != 0) { | |
3750 if (PrintMiscellaneous && (Verbose || WizardMode)) | |
3751 perror("os::init_2 setrlimit failed"); | |
3752 } | |
3753 } | |
3754 } | |
3755 | |
3756 // Initialize lock used to serialize thread creation (see os::create_thread) | |
3757 Linux::set_createThread_lock(new Mutex(Mutex::leaf, "createThread_lock", false)); | |
3758 | |
3759 // Initialize HPI. | |
3760 jint hpi_result = hpi::initialize(); | |
3761 if (hpi_result != JNI_OK) { | |
3762 tty->print_cr("There was an error trying to initialize the HPI library."); | |
3763 return hpi_result; | |
3764 } | |
3765 | |
3766 // at-exit methods are called in the reverse order of their registration. | |
3767 // atexit functions are called on return from main or as a result of a | |
3768 // call to exit(3C). There can be only 32 of these functions registered | |
3769 // and atexit() does not set errno. | |
3770 | |
3771 if (PerfAllowAtExitRegistration) { | |
3772 // only register atexit functions if PerfAllowAtExitRegistration is set. | |
3773 // atexit functions can be delayed until process exit time, which | |
3774 // can be problematic for embedded VM situations. Embedded VMs should | |
3775 // call DestroyJavaVM() to assure that VM resources are released. | |
3776 | |
3777 // note: perfMemory_exit_helper atexit function may be removed in | |
3778 // the future if the appropriate cleanup code can be added to the | |
3779 // VM_Exit VMOperation's doit method. | |
3780 if (atexit(perfMemory_exit_helper) != 0) { | |
3781 warning("os::init2 atexit(perfMemory_exit_helper) failed"); | |
3782 } | |
3783 } | |
3784 | |
3785 // initialize thread priority policy | |
3786 prio_init(); | |
3787 | |
3788 return JNI_OK; | |
3789 } | |
3790 | |
3791 // Mark the polling page as unreadable | |
3792 void os::make_polling_page_unreadable(void) { | |
3793 if( !guard_memory((char*)_polling_page, Linux::page_size()) ) | |
3794 fatal("Could not disable polling page"); | |
3795 }; | |
3796 | |
3797 // Mark the polling page as readable | |
3798 void os::make_polling_page_readable(void) { | |
237
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
3799 if( !linux_mprotect((char *)_polling_page, Linux::page_size(), PROT_READ)) { |
0 | 3800 fatal("Could not enable polling page"); |
237
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
3801 } |
0 | 3802 }; |
3803 | |
3804 int os::active_processor_count() { | |
3805 // Linux doesn't yet have a (official) notion of processor sets, | |
3806 // so just return the number of online processors. | |
3807 int online_cpus = ::sysconf(_SC_NPROCESSORS_ONLN); | |
3808 assert(online_cpus > 0 && online_cpus <= processor_count(), "sanity check"); | |
3809 return online_cpus; | |
3810 } | |
3811 | |
3812 bool os::distribute_processes(uint length, uint* distribution) { | |
3813 // Not yet implemented. | |
3814 return false; | |
3815 } | |
3816 | |
3817 bool os::bind_to_processor(uint processor_id) { | |
3818 // Not yet implemented. | |
3819 return false; | |
3820 } | |
3821 | |
3822 /// | |
3823 | |
3824 // Suspends the target using the signal mechanism and then grabs the PC before | |
3825 // resuming the target. Used by the flat-profiler only | |
3826 ExtendedPC os::get_thread_pc(Thread* thread) { | |
3827 // Make sure that it is called by the watcher for the VMThread | |
3828 assert(Thread::current()->is_Watcher_thread(), "Must be watcher"); | |
3829 assert(thread->is_VM_thread(), "Can only be called for VMThread"); | |
3830 | |
3831 ExtendedPC epc; | |
3832 | |
3833 OSThread* osthread = thread->osthread(); | |
3834 if (do_suspend(osthread)) { | |
3835 if (osthread->ucontext() != NULL) { | |
3836 epc = os::Linux::ucontext_get_pc(osthread->ucontext()); | |
3837 } else { | |
3838 // NULL context is unexpected, double-check this is the VMThread | |
3839 guarantee(thread->is_VM_thread(), "can only be called for VMThread"); | |
3840 } | |
3841 do_resume(osthread); | |
3842 } | |
3843 // failure means pthread_kill failed for some reason - arguably this is | |
3844 // a fatal problem, but such problems are ignored elsewhere | |
3845 | |
3846 return epc; | |
3847 } | |
3848 | |
3849 int os::Linux::safe_cond_timedwait(pthread_cond_t *_cond, pthread_mutex_t *_mutex, const struct timespec *_abstime) | |
3850 { | |
3851 if (is_NPTL()) { | |
3852 return pthread_cond_timedwait(_cond, _mutex, _abstime); | |
3853 } else { | |
3854 #ifndef IA64 | |
3855 // 6292965: LinuxThreads pthread_cond_timedwait() resets FPU control | |
3856 // word back to default 64bit precision if condvar is signaled. Java | |
3857 // wants 53bit precision. Save and restore current value. | |
3858 int fpu = get_fpu_control_word(); | |
3859 #endif // IA64 | |
3860 int status = pthread_cond_timedwait(_cond, _mutex, _abstime); | |
3861 #ifndef IA64 | |
3862 set_fpu_control_word(fpu); | |
3863 #endif // IA64 | |
3864 return status; | |
3865 } | |
3866 } | |
3867 | |
3868 //////////////////////////////////////////////////////////////////////////////// | |
3869 // debug support | |
3870 | |
3871 #ifndef PRODUCT | |
3872 static address same_page(address x, address y) { | |
3873 int page_bits = -os::vm_page_size(); | |
3874 if ((intptr_t(x) & page_bits) == (intptr_t(y) & page_bits)) | |
3875 return x; | |
3876 else if (x > y) | |
3877 return (address)(intptr_t(y) | ~page_bits) + 1; | |
3878 else | |
3879 return (address)(intptr_t(y) & page_bits); | |
3880 } | |
3881 | |
3882 bool os::find(address addr) { | |
3883 Dl_info dlinfo; | |
3884 memset(&dlinfo, 0, sizeof(dlinfo)); | |
3885 if (dladdr(addr, &dlinfo)) { | |
3886 tty->print(PTR_FORMAT ": ", addr); | |
3887 if (dlinfo.dli_sname != NULL) { | |
3888 tty->print("%s+%#x", dlinfo.dli_sname, | |
3889 addr - (intptr_t)dlinfo.dli_saddr); | |
3890 } else if (dlinfo.dli_fname) { | |
3891 tty->print("<offset %#x>", addr - (intptr_t)dlinfo.dli_fbase); | |
3892 } else { | |
3893 tty->print("<absolute address>"); | |
3894 } | |
3895 if (dlinfo.dli_fname) { | |
3896 tty->print(" in %s", dlinfo.dli_fname); | |
3897 } | |
3898 if (dlinfo.dli_fbase) { | |
3899 tty->print(" at " PTR_FORMAT, dlinfo.dli_fbase); | |
3900 } | |
3901 tty->cr(); | |
3902 | |
3903 if (Verbose) { | |
3904 // decode some bytes around the PC | |
3905 address begin = same_page(addr-40, addr); | |
3906 address end = same_page(addr+40, addr); | |
3907 address lowest = (address) dlinfo.dli_sname; | |
3908 if (!lowest) lowest = (address) dlinfo.dli_fbase; | |
3909 if (begin < lowest) begin = lowest; | |
3910 Dl_info dlinfo2; | |
3911 if (dladdr(end, &dlinfo2) && dlinfo2.dli_saddr != dlinfo.dli_saddr | |
3912 && end > dlinfo2.dli_saddr && dlinfo2.dli_saddr > begin) | |
3913 end = (address) dlinfo2.dli_saddr; | |
3914 Disassembler::decode(begin, end); | |
3915 } | |
3916 return true; | |
3917 } | |
3918 return false; | |
3919 } | |
3920 | |
3921 #endif | |
3922 | |
3923 //////////////////////////////////////////////////////////////////////////////// | |
3924 // misc | |
3925 | |
3926 // This does not do anything on Linux. This is basically a hook for being | |
3927 // able to use structured exception handling (thread-local exception filters) | |
3928 // on, e.g., Win32. | |
3929 void | |
3930 os::os_exception_wrapper(java_call_t f, JavaValue* value, methodHandle* method, | |
3931 JavaCallArguments* args, Thread* thread) { | |
3932 f(value, method, args, thread); | |
3933 } | |
3934 | |
3935 void os::print_statistics() { | |
3936 } | |
3937 | |
3938 int os::message_box(const char* title, const char* message) { | |
3939 int i; | |
3940 fdStream err(defaultStream::error_fd()); | |
3941 for (i = 0; i < 78; i++) err.print_raw("="); | |
3942 err.cr(); | |
3943 err.print_raw_cr(title); | |
3944 for (i = 0; i < 78; i++) err.print_raw("-"); | |
3945 err.cr(); | |
3946 err.print_raw_cr(message); | |
3947 for (i = 0; i < 78; i++) err.print_raw("="); | |
3948 err.cr(); | |
3949 | |
3950 char buf[16]; | |
3951 // Prevent process from exiting upon "read error" without consuming all CPU | |
3952 while (::read(0, buf, sizeof(buf)) <= 0) { ::sleep(100); } | |
3953 | |
3954 return buf[0] == 'y' || buf[0] == 'Y'; | |
3955 } | |
3956 | |
3957 int os::stat(const char *path, struct stat *sbuf) { | |
3958 char pathbuf[MAX_PATH]; | |
3959 if (strlen(path) > MAX_PATH - 1) { | |
3960 errno = ENAMETOOLONG; | |
3961 return -1; | |
3962 } | |
3963 hpi::native_path(strcpy(pathbuf, path)); | |
3964 return ::stat(pathbuf, sbuf); | |
3965 } | |
3966 | |
3967 bool os::check_heap(bool force) { | |
3968 return true; | |
3969 } | |
3970 | |
3971 int local_vsnprintf(char* buf, size_t count, const char* format, va_list args) { | |
3972 return ::vsnprintf(buf, count, format, args); | |
3973 } | |
3974 | |
3975 // Is a (classpath) directory empty? | |
3976 bool os::dir_is_empty(const char* path) { | |
3977 DIR *dir = NULL; | |
3978 struct dirent *ptr; | |
3979 | |
3980 dir = opendir(path); | |
3981 if (dir == NULL) return true; | |
3982 | |
3983 /* Scan the directory */ | |
3984 bool result = true; | |
3985 char buf[sizeof(struct dirent) + MAX_PATH]; | |
3986 while (result && (ptr = ::readdir(dir)) != NULL) { | |
3987 if (strcmp(ptr->d_name, ".") != 0 && strcmp(ptr->d_name, "..") != 0) { | |
3988 result = false; | |
3989 } | |
3990 } | |
3991 closedir(dir); | |
3992 return result; | |
3993 } | |
3994 | |
3995 // create binary file, rewriting existing file if required | |
3996 int os::create_binary_file(const char* path, bool rewrite_existing) { | |
3997 int oflags = O_WRONLY | O_CREAT; | |
3998 if (!rewrite_existing) { | |
3999 oflags |= O_EXCL; | |
4000 } | |
4001 return ::open64(path, oflags, S_IREAD | S_IWRITE); | |
4002 } | |
4003 | |
4004 // return current position of file pointer | |
4005 jlong os::current_file_offset(int fd) { | |
4006 return (jlong)::lseek64(fd, (off64_t)0, SEEK_CUR); | |
4007 } | |
4008 | |
4009 // move file pointer to the specified offset | |
4010 jlong os::seek_to_file_offset(int fd, jlong offset) { | |
4011 return (jlong)::lseek64(fd, (off64_t)offset, SEEK_SET); | |
4012 } | |
4013 | |
4014 // Map a block of memory. | |
4015 char* os::map_memory(int fd, const char* file_name, size_t file_offset, | |
4016 char *addr, size_t bytes, bool read_only, | |
4017 bool allow_exec) { | |
4018 int prot; | |
4019 int flags; | |
4020 | |
4021 if (read_only) { | |
4022 prot = PROT_READ; | |
4023 flags = MAP_SHARED; | |
4024 } else { | |
4025 prot = PROT_READ | PROT_WRITE; | |
4026 flags = MAP_PRIVATE; | |
4027 } | |
4028 | |
4029 if (allow_exec) { | |
4030 prot |= PROT_EXEC; | |
4031 } | |
4032 | |
4033 if (addr != NULL) { | |
4034 flags |= MAP_FIXED; | |
4035 } | |
4036 | |
4037 char* mapped_address = (char*)mmap(addr, (size_t)bytes, prot, flags, | |
4038 fd, file_offset); | |
4039 if (mapped_address == MAP_FAILED) { | |
4040 return NULL; | |
4041 } | |
4042 return mapped_address; | |
4043 } | |
4044 | |
4045 | |
4046 // Remap a block of memory. | |
4047 char* os::remap_memory(int fd, const char* file_name, size_t file_offset, | |
4048 char *addr, size_t bytes, bool read_only, | |
4049 bool allow_exec) { | |
4050 // same as map_memory() on this OS | |
4051 return os::map_memory(fd, file_name, file_offset, addr, bytes, read_only, | |
4052 allow_exec); | |
4053 } | |
4054 | |
4055 | |
4056 // Unmap a block of memory. | |
4057 bool os::unmap_memory(char* addr, size_t bytes) { | |
4058 return munmap(addr, bytes) == 0; | |
4059 } | |
4060 | |
4061 static jlong slow_thread_cpu_time(Thread *thread, bool user_sys_cpu_time); | |
4062 | |
4063 static clockid_t thread_cpu_clockid(Thread* thread) { | |
4064 pthread_t tid = thread->osthread()->pthread_id(); | |
4065 clockid_t clockid; | |
4066 | |
4067 // Get thread clockid | |
4068 int rc = os::Linux::pthread_getcpuclockid(tid, &clockid); | |
4069 assert(rc == 0, "pthread_getcpuclockid is expected to return 0 code"); | |
4070 return clockid; | |
4071 } | |
4072 | |
4073 // current_thread_cpu_time(bool) and thread_cpu_time(Thread*, bool) | |
4074 // are used by JVM M&M and JVMTI to get user+sys or user CPU time | |
4075 // of a thread. | |
4076 // | |
4077 // current_thread_cpu_time() and thread_cpu_time(Thread*) returns | |
4078 // the fast estimate available on the platform. | |
4079 | |
4080 jlong os::current_thread_cpu_time() { | |
4081 if (os::Linux::supports_fast_thread_cpu_time()) { | |
4082 return os::Linux::fast_thread_cpu_time(CLOCK_THREAD_CPUTIME_ID); | |
4083 } else { | |
4084 // return user + sys since the cost is the same | |
4085 return slow_thread_cpu_time(Thread::current(), true /* user + sys */); | |
4086 } | |
4087 } | |
4088 | |
4089 jlong os::thread_cpu_time(Thread* thread) { | |
4090 // consistent with what current_thread_cpu_time() returns | |
4091 if (os::Linux::supports_fast_thread_cpu_time()) { | |
4092 return os::Linux::fast_thread_cpu_time(thread_cpu_clockid(thread)); | |
4093 } else { | |
4094 return slow_thread_cpu_time(thread, true /* user + sys */); | |
4095 } | |
4096 } | |
4097 | |
4098 jlong os::current_thread_cpu_time(bool user_sys_cpu_time) { | |
4099 if (user_sys_cpu_time && os::Linux::supports_fast_thread_cpu_time()) { | |
4100 return os::Linux::fast_thread_cpu_time(CLOCK_THREAD_CPUTIME_ID); | |
4101 } else { | |
4102 return slow_thread_cpu_time(Thread::current(), user_sys_cpu_time); | |
4103 } | |
4104 } | |
4105 | |
4106 jlong os::thread_cpu_time(Thread *thread, bool user_sys_cpu_time) { | |
4107 if (user_sys_cpu_time && os::Linux::supports_fast_thread_cpu_time()) { | |
4108 return os::Linux::fast_thread_cpu_time(thread_cpu_clockid(thread)); | |
4109 } else { | |
4110 return slow_thread_cpu_time(thread, user_sys_cpu_time); | |
4111 } | |
4112 } | |
4113 | |
4114 // | |
4115 // -1 on error. | |
4116 // | |
4117 | |
4118 static jlong slow_thread_cpu_time(Thread *thread, bool user_sys_cpu_time) { | |
4119 static bool proc_pid_cpu_avail = true; | |
4120 static bool proc_task_unchecked = true; | |
4121 static const char *proc_stat_path = "/proc/%d/stat"; | |
4122 pid_t tid = thread->osthread()->thread_id(); | |
4123 int i; | |
4124 char *s; | |
4125 char stat[2048]; | |
4126 int statlen; | |
4127 char proc_name[64]; | |
4128 int count; | |
4129 long sys_time, user_time; | |
4130 char string[64]; | |
4131 int idummy; | |
4132 long ldummy; | |
4133 FILE *fp; | |
4134 | |
4135 // We first try accessing /proc/<pid>/cpu since this is faster to | |
4136 // process. If this file is not present (linux kernels 2.5 and above) | |
4137 // then we open /proc/<pid>/stat. | |
4138 if ( proc_pid_cpu_avail ) { | |
4139 sprintf(proc_name, "/proc/%d/cpu", tid); | |
4140 fp = fopen(proc_name, "r"); | |
4141 if ( fp != NULL ) { | |
4142 count = fscanf( fp, "%s %lu %lu\n", string, &user_time, &sys_time); | |
4143 fclose(fp); | |
4144 if ( count != 3 ) return -1; | |
4145 | |
4146 if (user_sys_cpu_time) { | |
4147 return ((jlong)sys_time + (jlong)user_time) * (1000000000 / clock_tics_per_sec); | |
4148 } else { | |
4149 return (jlong)user_time * (1000000000 / clock_tics_per_sec); | |
4150 } | |
4151 } | |
4152 else proc_pid_cpu_avail = false; | |
4153 } | |
4154 | |
4155 // The /proc/<tid>/stat aggregates per-process usage on | |
4156 // new Linux kernels 2.6+ where NPTL is supported. | |
4157 // The /proc/self/task/<tid>/stat still has the per-thread usage. | |
4158 // See bug 6328462. | |
4159 // There can be no directory /proc/self/task on kernels 2.4 with NPTL | |
4160 // and possibly in some other cases, so we check its availability. | |
4161 if (proc_task_unchecked && os::Linux::is_NPTL()) { | |
4162 // This is executed only once | |
4163 proc_task_unchecked = false; | |
4164 fp = fopen("/proc/self/task", "r"); | |
4165 if (fp != NULL) { | |
4166 proc_stat_path = "/proc/self/task/%d/stat"; | |
4167 fclose(fp); | |
4168 } | |
4169 } | |
4170 | |
4171 sprintf(proc_name, proc_stat_path, tid); | |
4172 fp = fopen(proc_name, "r"); | |
4173 if ( fp == NULL ) return -1; | |
4174 statlen = fread(stat, 1, 2047, fp); | |
4175 stat[statlen] = '\0'; | |
4176 fclose(fp); | |
4177 | |
4178 // Skip pid and the command string. Note that we could be dealing with | |
4179 // weird command names, e.g. user could decide to rename java launcher | |
4180 // to "java 1.4.2 :)", then the stat file would look like | |
4181 // 1234 (java 1.4.2 :)) R ... ... | |
4182 // We don't really need to know the command string, just find the last | |
4183 // occurrence of ")" and then start parsing from there. See bug 4726580. | |
4184 s = strrchr(stat, ')'); | |
4185 i = 0; | |
4186 if (s == NULL ) return -1; | |
4187 | |
4188 // Skip blank chars | |
4189 do s++; while (isspace(*s)); | |
4190 | |
4191 count = sscanf(s,"%c %d %d %d %d %d %lu %lu %lu %lu %lu %lu %lu", | |
4192 &idummy, &idummy, &idummy, &idummy, &idummy, &idummy, | |
4193 &ldummy, &ldummy, &ldummy, &ldummy, &ldummy, | |
4194 &user_time, &sys_time); | |
4195 if ( count != 13 ) return -1; | |
4196 if (user_sys_cpu_time) { | |
4197 return ((jlong)sys_time + (jlong)user_time) * (1000000000 / clock_tics_per_sec); | |
4198 } else { | |
4199 return (jlong)user_time * (1000000000 / clock_tics_per_sec); | |
4200 } | |
4201 } | |
4202 | |
4203 void os::current_thread_cpu_time_info(jvmtiTimerInfo *info_ptr) { | |
4204 info_ptr->max_value = ALL_64_BITS; // will not wrap in less than 64 bits | |
4205 info_ptr->may_skip_backward = false; // elapsed time not wall time | |
4206 info_ptr->may_skip_forward = false; // elapsed time not wall time | |
4207 info_ptr->kind = JVMTI_TIMER_TOTAL_CPU; // user+system time is returned | |
4208 } | |
4209 | |
4210 void os::thread_cpu_time_info(jvmtiTimerInfo *info_ptr) { | |
4211 info_ptr->max_value = ALL_64_BITS; // will not wrap in less than 64 bits | |
4212 info_ptr->may_skip_backward = false; // elapsed time not wall time | |
4213 info_ptr->may_skip_forward = false; // elapsed time not wall time | |
4214 info_ptr->kind = JVMTI_TIMER_TOTAL_CPU; // user+system time is returned | |
4215 } | |
4216 | |
4217 bool os::is_thread_cpu_time_supported() { | |
4218 return true; | |
4219 } | |
4220 | |
4221 // System loadavg support. Returns -1 if load average cannot be obtained. | |
4222 // Linux doesn't yet have a (official) notion of processor sets, | |
4223 // so just return the system wide load average. | |
4224 int os::loadavg(double loadavg[], int nelem) { | |
4225 return ::getloadavg(loadavg, nelem); | |
4226 } | |
4227 | |
4228 void os::pause() { | |
4229 char filename[MAX_PATH]; | |
4230 if (PauseAtStartupFile && PauseAtStartupFile[0]) { | |
4231 jio_snprintf(filename, MAX_PATH, PauseAtStartupFile); | |
4232 } else { | |
4233 jio_snprintf(filename, MAX_PATH, "./vm.paused.%d", current_process_id()); | |
4234 } | |
4235 | |
4236 int fd = ::open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0666); | |
4237 if (fd != -1) { | |
4238 struct stat buf; | |
4239 close(fd); | |
4240 while (::stat(filename, &buf) == 0) { | |
4241 (void)::poll(NULL, 0, 100); | |
4242 } | |
4243 } else { | |
4244 jio_fprintf(stderr, | |
4245 "Could not open pause file '%s', continuing immediately.\n", filename); | |
4246 } | |
4247 } | |
4248 | |
4249 extern "C" { | |
4250 | |
4251 /** | |
4252 * NOTE: the following code is to keep the green threads code | |
4253 * in the libjava.so happy. Once the green threads is removed, | |
4254 * these code will no longer be needed. | |
4255 */ | |
4256 int | |
4257 jdk_waitpid(pid_t pid, int* status, int options) { | |
4258 return waitpid(pid, status, options); | |
4259 } | |
4260 | |
4261 int | |
4262 fork1() { | |
4263 return fork(); | |
4264 } | |
4265 | |
4266 int | |
4267 jdk_sem_init(sem_t *sem, int pshared, unsigned int value) { | |
4268 return sem_init(sem, pshared, value); | |
4269 } | |
4270 | |
4271 int | |
4272 jdk_sem_post(sem_t *sem) { | |
4273 return sem_post(sem); | |
4274 } | |
4275 | |
4276 int | |
4277 jdk_sem_wait(sem_t *sem) { | |
4278 return sem_wait(sem); | |
4279 } | |
4280 | |
4281 int | |
4282 jdk_pthread_sigmask(int how , const sigset_t* newmask, sigset_t* oldmask) { | |
4283 return pthread_sigmask(how , newmask, oldmask); | |
4284 } | |
4285 | |
4286 } | |
4287 | |
4288 // Refer to the comments in os_solaris.cpp park-unpark. | |
4289 // | |
4290 // Beware -- Some versions of NPTL embody a flaw where pthread_cond_timedwait() can | |
4291 // hang indefinitely. For instance NPTL 0.60 on 2.4.21-4ELsmp is vulnerable. | |
4292 // For specifics regarding the bug see GLIBC BUGID 261237 : | |
4293 // http://www.mail-archive.com/debian-glibc@lists.debian.org/msg10837.html. | |
4294 // Briefly, pthread_cond_timedwait() calls with an expiry time that's not in the future | |
4295 // will either hang or corrupt the condvar, resulting in subsequent hangs if the condvar | |
4296 // is used. (The simple C test-case provided in the GLIBC bug report manifests the | |
4297 // hang). The JVM is vulernable via sleep(), Object.wait(timo), LockSupport.parkNanos() | |
4298 // and monitorenter when we're using 1-0 locking. All those operations may result in | |
4299 // calls to pthread_cond_timedwait(). Using LD_ASSUME_KERNEL to use an older version | |
4300 // of libpthread avoids the problem, but isn't practical. | |
4301 // | |
4302 // Possible remedies: | |
4303 // | |
4304 // 1. Establish a minimum relative wait time. 50 to 100 msecs seems to work. | |
4305 // This is palliative and probabilistic, however. If the thread is preempted | |
4306 // between the call to compute_abstime() and pthread_cond_timedwait(), more | |
4307 // than the minimum period may have passed, and the abstime may be stale (in the | |
4308 // past) resultin in a hang. Using this technique reduces the odds of a hang | |
4309 // but the JVM is still vulnerable, particularly on heavily loaded systems. | |
4310 // | |
4311 // 2. Modify park-unpark to use per-thread (per ParkEvent) pipe-pairs instead | |
4312 // of the usual flag-condvar-mutex idiom. The write side of the pipe is set | |
4313 // NDELAY. unpark() reduces to write(), park() reduces to read() and park(timo) | |
4314 // reduces to poll()+read(). This works well, but consumes 2 FDs per extant | |
4315 // thread. | |
4316 // | |
4317 // 3. Embargo pthread_cond_timedwait() and implement a native "chron" thread | |
4318 // that manages timeouts. We'd emulate pthread_cond_timedwait() by enqueuing | |
4319 // a timeout request to the chron thread and then blocking via pthread_cond_wait(). | |
4320 // This also works well. In fact it avoids kernel-level scalability impediments | |
4321 // on certain platforms that don't handle lots of active pthread_cond_timedwait() | |
4322 // timers in a graceful fashion. | |
4323 // | |
4324 // 4. When the abstime value is in the past it appears that control returns | |
4325 // correctly from pthread_cond_timedwait(), but the condvar is left corrupt. | |
4326 // Subsequent timedwait/wait calls may hang indefinitely. Given that, we | |
4327 // can avoid the problem by reinitializing the condvar -- by cond_destroy() | |
4328 // followed by cond_init() -- after all calls to pthread_cond_timedwait(). | |
4329 // It may be possible to avoid reinitialization by checking the return | |
4330 // value from pthread_cond_timedwait(). In addition to reinitializing the | |
4331 // condvar we must establish the invariant that cond_signal() is only called | |
4332 // within critical sections protected by the adjunct mutex. This prevents | |
4333 // cond_signal() from "seeing" a condvar that's in the midst of being | |
4334 // reinitialized or that is corrupt. Sadly, this invariant obviates the | |
4335 // desirable signal-after-unlock optimization that avoids futile context switching. | |
4336 // | |
4337 // I'm also concerned that some versions of NTPL might allocate an auxilliary | |
4338 // structure when a condvar is used or initialized. cond_destroy() would | |
4339 // release the helper structure. Our reinitialize-after-timedwait fix | |
4340 // put excessive stress on malloc/free and locks protecting the c-heap. | |
4341 // | |
4342 // We currently use (4). See the WorkAroundNTPLTimedWaitHang flag. | |
4343 // It may be possible to refine (4) by checking the kernel and NTPL verisons | |
4344 // and only enabling the work-around for vulnerable environments. | |
4345 | |
4346 // utility to compute the abstime argument to timedwait: | |
4347 // millis is the relative timeout time | |
4348 // abstime will be the absolute timeout time | |
4349 // TODO: replace compute_abstime() with unpackTime() | |
4350 | |
4351 static struct timespec* compute_abstime(timespec* abstime, jlong millis) { | |
4352 if (millis < 0) millis = 0; | |
4353 struct timeval now; | |
4354 int status = gettimeofday(&now, NULL); | |
4355 assert(status == 0, "gettimeofday"); | |
4356 jlong seconds = millis / 1000; | |
4357 millis %= 1000; | |
4358 if (seconds > 50000000) { // see man cond_timedwait(3T) | |
4359 seconds = 50000000; | |
4360 } | |
4361 abstime->tv_sec = now.tv_sec + seconds; | |
4362 long usec = now.tv_usec + millis * 1000; | |
4363 if (usec >= 1000000) { | |
4364 abstime->tv_sec += 1; | |
4365 usec -= 1000000; | |
4366 } | |
4367 abstime->tv_nsec = usec * 1000; | |
4368 return abstime; | |
4369 } | |
4370 | |
4371 | |
4372 // Test-and-clear _Event, always leaves _Event set to 0, returns immediately. | |
4373 // Conceptually TryPark() should be equivalent to park(0). | |
4374 | |
4375 int os::PlatformEvent::TryPark() { | |
4376 for (;;) { | |
4377 const int v = _Event ; | |
4378 guarantee ((v == 0) || (v == 1), "invariant") ; | |
4379 if (Atomic::cmpxchg (0, &_Event, v) == v) return v ; | |
4380 } | |
4381 } | |
4382 | |
4383 void os::PlatformEvent::park() { // AKA "down()" | |
4384 // Invariant: Only the thread associated with the Event/PlatformEvent | |
4385 // may call park(). | |
4386 // TODO: assert that _Assoc != NULL or _Assoc == Self | |
4387 int v ; | |
4388 for (;;) { | |
4389 v = _Event ; | |
4390 if (Atomic::cmpxchg (v-1, &_Event, v) == v) break ; | |
4391 } | |
4392 guarantee (v >= 0, "invariant") ; | |
4393 if (v == 0) { | |
4394 // Do this the hard way by blocking ... | |
4395 int status = pthread_mutex_lock(_mutex); | |
4396 assert_status(status == 0, status, "mutex_lock"); | |
4397 guarantee (_nParked == 0, "invariant") ; | |
4398 ++ _nParked ; | |
4399 while (_Event < 0) { | |
4400 status = pthread_cond_wait(_cond, _mutex); | |
4401 // for some reason, under 2.7 lwp_cond_wait() may return ETIME ... | |
4402 // Treat this the same as if the wait was interrupted | |
4403 if (status == ETIME) { status = EINTR; } | |
4404 assert_status(status == 0 || status == EINTR, status, "cond_wait"); | |
4405 } | |
4406 -- _nParked ; | |
4407 | |
4408 // In theory we could move the ST of 0 into _Event past the unlock(), | |
4409 // but then we'd need a MEMBAR after the ST. | |
4410 _Event = 0 ; | |
4411 status = pthread_mutex_unlock(_mutex); | |
4412 assert_status(status == 0, status, "mutex_unlock"); | |
4413 } | |
4414 guarantee (_Event >= 0, "invariant") ; | |
4415 } | |
4416 | |
4417 int os::PlatformEvent::park(jlong millis) { | |
4418 guarantee (_nParked == 0, "invariant") ; | |
4419 | |
4420 int v ; | |
4421 for (;;) { | |
4422 v = _Event ; | |
4423 if (Atomic::cmpxchg (v-1, &_Event, v) == v) break ; | |
4424 } | |
4425 guarantee (v >= 0, "invariant") ; | |
4426 if (v != 0) return OS_OK ; | |
4427 | |
4428 // We do this the hard way, by blocking the thread. | |
4429 // Consider enforcing a minimum timeout value. | |
4430 struct timespec abst; | |
4431 compute_abstime(&abst, millis); | |
4432 | |
4433 int ret = OS_TIMEOUT; | |
4434 int status = pthread_mutex_lock(_mutex); | |
4435 assert_status(status == 0, status, "mutex_lock"); | |
4436 guarantee (_nParked == 0, "invariant") ; | |
4437 ++_nParked ; | |
4438 | |
4439 // Object.wait(timo) will return because of | |
4440 // (a) notification | |
4441 // (b) timeout | |
4442 // (c) thread.interrupt | |
4443 // | |
4444 // Thread.interrupt and object.notify{All} both call Event::set. | |
4445 // That is, we treat thread.interrupt as a special case of notification. | |
4446 // The underlying Solaris implementation, cond_timedwait, admits | |
4447 // spurious/premature wakeups, but the JLS/JVM spec prevents the | |
4448 // JVM from making those visible to Java code. As such, we must | |
4449 // filter out spurious wakeups. We assume all ETIME returns are valid. | |
4450 // | |
4451 // TODO: properly differentiate simultaneous notify+interrupt. | |
4452 // In that case, we should propagate the notify to another waiter. | |
4453 | |
4454 while (_Event < 0) { | |
4455 status = os::Linux::safe_cond_timedwait(_cond, _mutex, &abst); | |
4456 if (status != 0 && WorkAroundNPTLTimedWaitHang) { | |
4457 pthread_cond_destroy (_cond); | |
4458 pthread_cond_init (_cond, NULL) ; | |
4459 } | |
4460 assert_status(status == 0 || status == EINTR || | |
4461 status == ETIME || status == ETIMEDOUT, | |
4462 status, "cond_timedwait"); | |
4463 if (!FilterSpuriousWakeups) break ; // previous semantics | |
4464 if (status == ETIME || status == ETIMEDOUT) break ; | |
4465 // We consume and ignore EINTR and spurious wakeups. | |
4466 } | |
4467 --_nParked ; | |
4468 if (_Event >= 0) { | |
4469 ret = OS_OK; | |
4470 } | |
4471 _Event = 0 ; | |
4472 status = pthread_mutex_unlock(_mutex); | |
4473 assert_status(status == 0, status, "mutex_unlock"); | |
4474 assert (_nParked == 0, "invariant") ; | |
4475 return ret; | |
4476 } | |
4477 | |
4478 void os::PlatformEvent::unpark() { | |
4479 int v, AnyWaiters ; | |
4480 for (;;) { | |
4481 v = _Event ; | |
4482 if (v > 0) { | |
4483 // The LD of _Event could have reordered or be satisfied | |
4484 // by a read-aside from this processor's write buffer. | |
4485 // To avoid problems execute a barrier and then | |
4486 // ratify the value. | |
4487 OrderAccess::fence() ; | |
4488 if (_Event == v) return ; | |
4489 continue ; | |
4490 } | |
4491 if (Atomic::cmpxchg (v+1, &_Event, v) == v) break ; | |
4492 } | |
4493 if (v < 0) { | |
4494 // Wait for the thread associated with the event to vacate | |
4495 int status = pthread_mutex_lock(_mutex); | |
4496 assert_status(status == 0, status, "mutex_lock"); | |
4497 AnyWaiters = _nParked ; | |
4498 assert (AnyWaiters == 0 || AnyWaiters == 1, "invariant") ; | |
4499 if (AnyWaiters != 0 && WorkAroundNPTLTimedWaitHang) { | |
4500 AnyWaiters = 0 ; | |
4501 pthread_cond_signal (_cond); | |
4502 } | |
4503 status = pthread_mutex_unlock(_mutex); | |
4504 assert_status(status == 0, status, "mutex_unlock"); | |
4505 if (AnyWaiters != 0) { | |
4506 status = pthread_cond_signal(_cond); | |
4507 assert_status(status == 0, status, "cond_signal"); | |
4508 } | |
4509 } | |
4510 | |
4511 // Note that we signal() _after dropping the lock for "immortal" Events. | |
4512 // This is safe and avoids a common class of futile wakeups. In rare | |
4513 // circumstances this can cause a thread to return prematurely from | |
4514 // cond_{timed}wait() but the spurious wakeup is benign and the victim will | |
4515 // simply re-test the condition and re-park itself. | |
4516 } | |
4517 | |
4518 | |
4519 // JSR166 | |
4520 // ------------------------------------------------------- | |
4521 | |
4522 /* | |
4523 * The solaris and linux implementations of park/unpark are fairly | |
4524 * conservative for now, but can be improved. They currently use a | |
4525 * mutex/condvar pair, plus a a count. | |
4526 * Park decrements count if > 0, else does a condvar wait. Unpark | |
4527 * sets count to 1 and signals condvar. Only one thread ever waits | |
4528 * on the condvar. Contention seen when trying to park implies that someone | |
4529 * is unparking you, so don't wait. And spurious returns are fine, so there | |
4530 * is no need to track notifications. | |
4531 */ | |
4532 | |
4533 | |
4534 #define NANOSECS_PER_SEC 1000000000 | |
4535 #define NANOSECS_PER_MILLISEC 1000000 | |
4536 #define MAX_SECS 100000000 | |
4537 /* | |
4538 * This code is common to linux and solaris and will be moved to a | |
4539 * common place in dolphin. | |
4540 * | |
4541 * The passed in time value is either a relative time in nanoseconds | |
4542 * or an absolute time in milliseconds. Either way it has to be unpacked | |
4543 * into suitable seconds and nanoseconds components and stored in the | |
4544 * given timespec structure. | |
4545 * Given time is a 64-bit value and the time_t used in the timespec is only | |
4546 * a signed-32-bit value (except on 64-bit Linux) we have to watch for | |
4547 * overflow if times way in the future are given. Further on Solaris versions | |
4548 * prior to 10 there is a restriction (see cond_timedwait) that the specified | |
4549 * number of seconds, in abstime, is less than current_time + 100,000,000. | |
4550 * As it will be 28 years before "now + 100000000" will overflow we can | |
4551 * ignore overflow and just impose a hard-limit on seconds using the value | |
4552 * of "now + 100,000,000". This places a limit on the timeout of about 3.17 | |
4553 * years from "now". | |
4554 */ | |
4555 | |
4556 static void unpackTime(timespec* absTime, bool isAbsolute, jlong time) { | |
4557 assert (time > 0, "convertTime"); | |
4558 | |
4559 struct timeval now; | |
4560 int status = gettimeofday(&now, NULL); | |
4561 assert(status == 0, "gettimeofday"); | |
4562 | |
4563 time_t max_secs = now.tv_sec + MAX_SECS; | |
4564 | |
4565 if (isAbsolute) { | |
4566 jlong secs = time / 1000; | |
4567 if (secs > max_secs) { | |
4568 absTime->tv_sec = max_secs; | |
4569 } | |
4570 else { | |
4571 absTime->tv_sec = secs; | |
4572 } | |
4573 absTime->tv_nsec = (time % 1000) * NANOSECS_PER_MILLISEC; | |
4574 } | |
4575 else { | |
4576 jlong secs = time / NANOSECS_PER_SEC; | |
4577 if (secs >= MAX_SECS) { | |
4578 absTime->tv_sec = max_secs; | |
4579 absTime->tv_nsec = 0; | |
4580 } | |
4581 else { | |
4582 absTime->tv_sec = now.tv_sec + secs; | |
4583 absTime->tv_nsec = (time % NANOSECS_PER_SEC) + now.tv_usec*1000; | |
4584 if (absTime->tv_nsec >= NANOSECS_PER_SEC) { | |
4585 absTime->tv_nsec -= NANOSECS_PER_SEC; | |
4586 ++absTime->tv_sec; // note: this must be <= max_secs | |
4587 } | |
4588 } | |
4589 } | |
4590 assert(absTime->tv_sec >= 0, "tv_sec < 0"); | |
4591 assert(absTime->tv_sec <= max_secs, "tv_sec > max_secs"); | |
4592 assert(absTime->tv_nsec >= 0, "tv_nsec < 0"); | |
4593 assert(absTime->tv_nsec < NANOSECS_PER_SEC, "tv_nsec >= nanos_per_sec"); | |
4594 } | |
4595 | |
4596 void Parker::park(bool isAbsolute, jlong time) { | |
4597 // Optional fast-path check: | |
4598 // Return immediately if a permit is available. | |
4599 if (_counter > 0) { | |
4600 _counter = 0 ; | |
4601 return ; | |
4602 } | |
4603 | |
4604 Thread* thread = Thread::current(); | |
4605 assert(thread->is_Java_thread(), "Must be JavaThread"); | |
4606 JavaThread *jt = (JavaThread *)thread; | |
4607 | |
4608 // Optional optimization -- avoid state transitions if there's an interrupt pending. | |
4609 // Check interrupt before trying to wait | |
4610 if (Thread::is_interrupted(thread, false)) { | |
4611 return; | |
4612 } | |
4613 | |
4614 // Next, demultiplex/decode time arguments | |
4615 timespec absTime; | |
4616 if (time < 0) { // don't wait at all | |
4617 return; | |
4618 } | |
4619 if (time > 0) { | |
4620 unpackTime(&absTime, isAbsolute, time); | |
4621 } | |
4622 | |
4623 | |
4624 // Enter safepoint region | |
4625 // Beware of deadlocks such as 6317397. | |
4626 // The per-thread Parker:: mutex is a classic leaf-lock. | |
4627 // In particular a thread must never block on the Threads_lock while | |
4628 // holding the Parker:: mutex. If safepoints are pending both the | |
4629 // the ThreadBlockInVM() CTOR and DTOR may grab Threads_lock. | |
4630 ThreadBlockInVM tbivm(jt); | |
4631 | |
4632 // Don't wait if cannot get lock since interference arises from | |
4633 // unblocking. Also. check interrupt before trying wait | |
4634 if (Thread::is_interrupted(thread, false) || pthread_mutex_trylock(_mutex) != 0) { | |
4635 return; | |
4636 } | |
4637 | |
4638 int status ; | |
4639 if (_counter > 0) { // no wait needed | |
4640 _counter = 0; | |
4641 status = pthread_mutex_unlock(_mutex); | |
4642 assert (status == 0, "invariant") ; | |
4643 return; | |
4644 } | |
4645 | |
4646 #ifdef ASSERT | |
4647 // Don't catch signals while blocked; let the running threads have the signals. | |
4648 // (This allows a debugger to break into the running thread.) | |
4649 sigset_t oldsigs; | |
4650 sigset_t* allowdebug_blocked = os::Linux::allowdebug_blocked_signals(); | |
4651 pthread_sigmask(SIG_BLOCK, allowdebug_blocked, &oldsigs); | |
4652 #endif | |
4653 | |
4654 OSThreadWaitState osts(thread->osthread(), false /* not Object.wait() */); | |
4655 jt->set_suspend_equivalent(); | |
4656 // cleared by handle_special_suspend_equivalent_condition() or java_suspend_self() | |
4657 | |
4658 if (time == 0) { | |
4659 status = pthread_cond_wait (_cond, _mutex) ; | |
4660 } else { | |
4661 status = os::Linux::safe_cond_timedwait (_cond, _mutex, &absTime) ; | |
4662 if (status != 0 && WorkAroundNPTLTimedWaitHang) { | |
4663 pthread_cond_destroy (_cond) ; | |
4664 pthread_cond_init (_cond, NULL); | |
4665 } | |
4666 } | |
4667 assert_status(status == 0 || status == EINTR || | |
4668 status == ETIME || status == ETIMEDOUT, | |
4669 status, "cond_timedwait"); | |
4670 | |
4671 #ifdef ASSERT | |
4672 pthread_sigmask(SIG_SETMASK, &oldsigs, NULL); | |
4673 #endif | |
4674 | |
4675 _counter = 0 ; | |
4676 status = pthread_mutex_unlock(_mutex) ; | |
4677 assert_status(status == 0, status, "invariant") ; | |
4678 // If externally suspended while waiting, re-suspend | |
4679 if (jt->handle_special_suspend_equivalent_condition()) { | |
4680 jt->java_suspend_self(); | |
4681 } | |
4682 | |
4683 } | |
4684 | |
4685 void Parker::unpark() { | |
4686 int s, status ; | |
4687 status = pthread_mutex_lock(_mutex); | |
4688 assert (status == 0, "invariant") ; | |
4689 s = _counter; | |
4690 _counter = 1; | |
4691 if (s < 1) { | |
4692 if (WorkAroundNPTLTimedWaitHang) { | |
4693 status = pthread_cond_signal (_cond) ; | |
4694 assert (status == 0, "invariant") ; | |
4695 status = pthread_mutex_unlock(_mutex); | |
4696 assert (status == 0, "invariant") ; | |
4697 } else { | |
4698 status = pthread_mutex_unlock(_mutex); | |
4699 assert (status == 0, "invariant") ; | |
4700 status = pthread_cond_signal (_cond) ; | |
4701 assert (status == 0, "invariant") ; | |
4702 } | |
4703 } else { | |
4704 pthread_mutex_unlock(_mutex); | |
4705 assert (status == 0, "invariant") ; | |
4706 } | |
4707 } | |
4708 | |
4709 | |
4710 extern char** environ; | |
4711 | |
4712 #ifndef __NR_fork | |
4713 #define __NR_fork IA32_ONLY(2) IA64_ONLY(not defined) AMD64_ONLY(57) | |
4714 #endif | |
4715 | |
4716 #ifndef __NR_execve | |
4717 #define __NR_execve IA32_ONLY(11) IA64_ONLY(1033) AMD64_ONLY(59) | |
4718 #endif | |
4719 | |
4720 // Run the specified command in a separate process. Return its exit value, | |
4721 // or -1 on failure (e.g. can't fork a new process). | |
4722 // Unlike system(), this function can be called from signal handler. It | |
4723 // doesn't block SIGINT et al. | |
4724 int os::fork_and_exec(char* cmd) { | |
199
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
4725 const char * argv[4] = {"sh", "-c", cmd, NULL}; |
0 | 4726 |
4727 // fork() in LinuxThreads/NPTL is not async-safe. It needs to run | |
4728 // pthread_atfork handlers and reset pthread library. All we need is a | |
4729 // separate process to execve. Make a direct syscall to fork process. | |
4730 // On IA64 there's no fork syscall, we have to use fork() and hope for | |
4731 // the best... | |
4732 pid_t pid = NOT_IA64(syscall(__NR_fork);) | |
4733 IA64_ONLY(fork();) | |
4734 | |
4735 if (pid < 0) { | |
4736 // fork failed | |
4737 return -1; | |
4738 | |
4739 } else if (pid == 0) { | |
4740 // child process | |
4741 | |
4742 // execve() in LinuxThreads will call pthread_kill_other_threads_np() | |
4743 // first to kill every thread on the thread list. Because this list is | |
4744 // not reset by fork() (see notes above), execve() will instead kill | |
4745 // every thread in the parent process. We know this is the only thread | |
4746 // in the new process, so make a system call directly. | |
4747 // IA64 should use normal execve() from glibc to match the glibc fork() | |
4748 // above. | |
4749 NOT_IA64(syscall(__NR_execve, "/bin/sh", argv, environ);) | |
199
f139919897d2
6681796: hotspot build failure on gcc 4.2.x (ubuntu 8.04) w/ openjdk 6
xlu
parents:
141
diff
changeset
|
4750 IA64_ONLY(execve("/bin/sh", (char* const*)argv, environ);) |
0 | 4751 |
4752 // execve failed | |
4753 _exit(-1); | |
4754 | |
4755 } else { | |
4756 // copied from J2SE ..._waitForProcessExit() in UNIXProcess_md.c; we don't | |
4757 // care about the actual exit code, for now. | |
4758 | |
4759 int status; | |
4760 | |
4761 // Wait for the child process to exit. This returns immediately if | |
4762 // the child has already exited. */ | |
4763 while (waitpid(pid, &status, 0) < 0) { | |
4764 switch (errno) { | |
4765 case ECHILD: return 0; | |
4766 case EINTR: break; | |
4767 default: return -1; | |
4768 } | |
4769 } | |
4770 | |
4771 if (WIFEXITED(status)) { | |
4772 // The child exited normally; get its exit code. | |
4773 return WEXITSTATUS(status); | |
4774 } else if (WIFSIGNALED(status)) { | |
4775 // The child exited because of a signal | |
4776 // The best value to return is 0x80 + signal number, | |
4777 // because that is what all Unix shells do, and because | |
4778 // it allows callers to distinguish between process exit and | |
4779 // process death by signal. | |
4780 return 0x80 + WTERMSIG(status); | |
4781 } else { | |
4782 // Unknown exit code; pass it through | |
4783 return status; | |
4784 } | |
4785 } | |
4786 } |