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