1 /*
2 * Copyright (c) 1997, 2019, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "jvm.h"
27 #include "classfile/classLoader.hpp"
28 #include "classfile/javaClasses.hpp"
29 #include "classfile/moduleEntry.hpp"
30 #include "classfile/systemDictionary.hpp"
31 #include "classfile/vmSymbols.hpp"
32 #include "code/codeCache.hpp"
33 #include "code/icBuffer.hpp"
34 #include "code/vtableStubs.hpp"
35 #include "gc/shared/gcVMOperations.hpp"
36 #include "logging/log.hpp"
37 #include "interpreter/interpreter.hpp"
38 #include "logging/log.hpp"
39 #include "logging/logStream.hpp"
40 #include "memory/allocation.inline.hpp"
41 #include "memory/guardedMemory.hpp"
42 #include "memory/resourceArea.hpp"
43 #include "memory/universe.hpp"
44 #include "oops/compressedOops.inline.hpp"
45 #include "oops/oop.inline.hpp"
46 #include "prims/jvm_misc.hpp"
47 #include "runtime/arguments.hpp"
48 #include "runtime/atomic.hpp"
49 #include "runtime/frame.inline.hpp"
50 #include "runtime/handles.inline.hpp"
51 #include "runtime/interfaceSupport.inline.hpp"
52 #include "runtime/java.hpp"
53 #include "runtime/javaCalls.hpp"
54 #include "runtime/mutexLocker.hpp"
55 #include "runtime/os.inline.hpp"
56 #include "runtime/sharedRuntime.hpp"
57 #include "runtime/stubRoutines.hpp"
58 #include "runtime/thread.inline.hpp"
59 #include "runtime/threadSMR.hpp"
60 #include "runtime/vm_version.hpp"
61 #include "services/attachListener.hpp"
62 #include "services/mallocTracker.hpp"
63 #include "services/memTracker.hpp"
64 #include "services/nmtCommon.hpp"
65 #include "services/threadService.hpp"
66 #include "utilities/align.hpp"
67 #include "utilities/defaultStream.hpp"
68 #include "utilities/events.hpp"
69
70 # include <signal.h>
71 # include <errno.h>
72
73 OSThread* os::_starting_thread = NULL;
74 address os::_polling_page = NULL;
75 volatile unsigned int os::_rand_seed = 1;
76 int os::_processor_count = 0;
77 int os::_initial_active_processor_count = 0;
78 size_t os::_page_sizes[os::page_sizes_max];
79
80 #ifndef PRODUCT
81 julong os::num_mallocs = 0; // # of calls to malloc/realloc
82 julong os::alloc_bytes = 0; // # of bytes allocated
83 julong os::num_frees = 0; // # of calls to free
84 julong os::free_bytes = 0; // # of bytes freed
85 #endif
86
87 static size_t cur_malloc_words = 0; // current size for MallocMaxTestWords
88
89 DEBUG_ONLY(bool os::_mutex_init_done = false;)
90
91 void os_init_globals() {
92 // Called from init_globals().
93 // See Threads::create_vm() in thread.cpp, and init.cpp.
94 os::init_globals();
95 }
96
97 static time_t get_timezone(const struct tm* time_struct) {
98 #if defined(_ALLBSD_SOURCE)
99 return time_struct->tm_gmtoff;
100 #elif defined(_WINDOWS)
101 long zone;
102 _get_timezone(&zone);
103 return static_cast<time_t>(zone);
104 #else
105 return timezone;
106 #endif
107 }
108
109 int os::snprintf(char* buf, size_t len, const char* fmt, ...) {
110 va_list args;
111 va_start(args, fmt);
112 int result = os::vsnprintf(buf, len, fmt, args);
113 va_end(args);
114 return result;
115 }
116
117 // Fill in buffer with current local time as an ISO-8601 string.
118 // E.g., yyyy-mm-ddThh:mm:ss-zzzz.
119 // Returns buffer, or NULL if it failed.
120 // This would mostly be a call to
121 // strftime(...., "%Y-%m-%d" "T" "%H:%M:%S" "%z", ....)
122 // except that on Windows the %z behaves badly, so we do it ourselves.
123 // Also, people wanted milliseconds on there,
124 // and strftime doesn't do milliseconds.
125 char* os::iso8601_time(char* buffer, size_t buffer_length, bool utc) {
126 // Output will be of the form "YYYY-MM-DDThh:mm:ss.mmm+zzzz\0"
127 // 1 2
128 // 12345678901234567890123456789
129 // format string: "%04d-%02d-%02dT%02d:%02d:%02d.%03d%c%02d%02d"
130 static const size_t needed_buffer = 29;
131
132 // Sanity check the arguments
133 if (buffer == NULL) {
134 assert(false, "NULL buffer");
135 return NULL;
136 }
137 if (buffer_length < needed_buffer) {
138 assert(false, "buffer_length too small");
139 return NULL;
140 }
141 // Get the current time
142 jlong milliseconds_since_19700101 = javaTimeMillis();
143 const int milliseconds_per_microsecond = 1000;
144 const time_t seconds_since_19700101 =
145 milliseconds_since_19700101 / milliseconds_per_microsecond;
146 const int milliseconds_after_second =
147 milliseconds_since_19700101 % milliseconds_per_microsecond;
148 // Convert the time value to a tm and timezone variable
149 struct tm time_struct;
150 if (utc) {
151 if (gmtime_pd(&seconds_since_19700101, &time_struct) == NULL) {
152 assert(false, "Failed gmtime_pd");
153 return NULL;
154 }
155 } else {
156 if (localtime_pd(&seconds_since_19700101, &time_struct) == NULL) {
157 assert(false, "Failed localtime_pd");
158 return NULL;
159 }
160 }
161 const time_t zone = get_timezone(&time_struct);
162
163 // If daylight savings time is in effect,
164 // we are 1 hour East of our time zone
165 const time_t seconds_per_minute = 60;
166 const time_t minutes_per_hour = 60;
167 const time_t seconds_per_hour = seconds_per_minute * minutes_per_hour;
168 time_t UTC_to_local = zone;
169 if (time_struct.tm_isdst > 0) {
170 UTC_to_local = UTC_to_local - seconds_per_hour;
171 }
172
173 // No offset when dealing with UTC
174 if (utc) {
175 UTC_to_local = 0;
176 }
177
178 // Compute the time zone offset.
179 // localtime_pd() sets timezone to the difference (in seconds)
180 // between UTC and and local time.
181 // ISO 8601 says we need the difference between local time and UTC,
182 // we change the sign of the localtime_pd() result.
183 const time_t local_to_UTC = -(UTC_to_local);
184 // Then we have to figure out if if we are ahead (+) or behind (-) UTC.
185 char sign_local_to_UTC = '+';
186 time_t abs_local_to_UTC = local_to_UTC;
187 if (local_to_UTC < 0) {
188 sign_local_to_UTC = '-';
189 abs_local_to_UTC = -(abs_local_to_UTC);
190 }
191 // Convert time zone offset seconds to hours and minutes.
192 const time_t zone_hours = (abs_local_to_UTC / seconds_per_hour);
193 const time_t zone_min =
194 ((abs_local_to_UTC % seconds_per_hour) / seconds_per_minute);
195
196 // Print an ISO 8601 date and time stamp into the buffer
197 const int year = 1900 + time_struct.tm_year;
198 const int month = 1 + time_struct.tm_mon;
199 const int printed = jio_snprintf(buffer, buffer_length,
200 "%04d-%02d-%02dT%02d:%02d:%02d.%03d%c%02d%02d",
201 year,
202 month,
203 time_struct.tm_mday,
204 time_struct.tm_hour,
205 time_struct.tm_min,
206 time_struct.tm_sec,
207 milliseconds_after_second,
208 sign_local_to_UTC,
209 zone_hours,
210 zone_min);
211 if (printed == 0) {
212 assert(false, "Failed jio_printf");
213 return NULL;
214 }
215 return buffer;
216 }
217
218 OSReturn os::set_priority(Thread* thread, ThreadPriority p) {
219 debug_only(Thread::check_for_dangling_thread_pointer(thread);)
220
221 if ((p >= MinPriority && p <= MaxPriority) ||
222 (p == CriticalPriority && thread->is_ConcurrentGC_thread())) {
223 int priority = java_to_os_priority[p];
224 return set_native_priority(thread, priority);
225 } else {
226 assert(false, "Should not happen");
227 return OS_ERR;
228 }
229 }
230
231 // The mapping from OS priority back to Java priority may be inexact because
232 // Java priorities can map M:1 with native priorities. If you want the definite
233 // Java priority then use JavaThread::java_priority()
234 OSReturn os::get_priority(const Thread* const thread, ThreadPriority& priority) {
235 int p;
236 int os_prio;
237 OSReturn ret = get_native_priority(thread, &os_prio);
238 if (ret != OS_OK) return ret;
239
240 if (java_to_os_priority[MaxPriority] > java_to_os_priority[MinPriority]) {
241 for (p = MaxPriority; p > MinPriority && java_to_os_priority[p] > os_prio; p--) ;
242 } else {
243 // niceness values are in reverse order
244 for (p = MaxPriority; p > MinPriority && java_to_os_priority[p] < os_prio; p--) ;
245 }
246 priority = (ThreadPriority)p;
247 return OS_OK;
248 }
249
250 bool os::dll_build_name(char* buffer, size_t size, const char* fname) {
251 int n = jio_snprintf(buffer, size, "%s%s%s", JNI_LIB_PREFIX, fname, JNI_LIB_SUFFIX);
252 return (n != -1);
253 }
254
255 #if !defined(LINUX) && !defined(_WINDOWS)
256 bool os::committed_in_range(address start, size_t size, address& committed_start, size_t& committed_size) {
257 committed_start = start;
258 committed_size = size;
259 return true;
260 }
261 #endif
262
263 // Helper for dll_locate_lib.
264 // Pass buffer and printbuffer as we already printed the path to buffer
265 // when we called get_current_directory. This way we avoid another buffer
266 // of size MAX_PATH.
267 static bool conc_path_file_and_check(char *buffer, char *printbuffer, size_t printbuflen,
268 const char* pname, char lastchar, const char* fname) {
269
270 // Concatenate path and file name, but don't print double path separators.
271 const char *filesep = (WINDOWS_ONLY(lastchar == ':' ||) lastchar == os::file_separator()[0]) ?
272 "" : os::file_separator();
273 int ret = jio_snprintf(printbuffer, printbuflen, "%s%s%s", pname, filesep, fname);
274 // Check whether file exists.
275 if (ret != -1) {
276 struct stat statbuf;
277 return os::stat(buffer, &statbuf) == 0;
278 }
279 return false;
280 }
281
282 bool os::dll_locate_lib(char *buffer, size_t buflen,
283 const char* pname, const char* fname) {
284 bool retval = false;
285
286 size_t fullfnamelen = strlen(JNI_LIB_PREFIX) + strlen(fname) + strlen(JNI_LIB_SUFFIX);
287 char* fullfname = (char*)NEW_C_HEAP_ARRAY(char, fullfnamelen + 1, mtInternal);
288 if (dll_build_name(fullfname, fullfnamelen + 1, fname)) {
289 const size_t pnamelen = pname ? strlen(pname) : 0;
290
291 if (pnamelen == 0) {
292 // If no path given, use current working directory.
293 const char* p = get_current_directory(buffer, buflen);
294 if (p != NULL) {
295 const size_t plen = strlen(buffer);
296 const char lastchar = buffer[plen - 1];
297 retval = conc_path_file_and_check(buffer, &buffer[plen], buflen - plen,
298 "", lastchar, fullfname);
299 }
300 } else if (strchr(pname, *os::path_separator()) != NULL) {
301 // A list of paths. Search for the path that contains the library.
302 int n;
303 char** pelements = split_path(pname, &n);
304 if (pelements != NULL) {
305 for (int i = 0; i < n; i++) {
306 char* path = pelements[i];
307 // Really shouldn't be NULL, but check can't hurt.
308 size_t plen = (path == NULL) ? 0 : strlen(path);
309 if (plen == 0) {
310 continue; // Skip the empty path values.
311 }
312 const char lastchar = path[plen - 1];
313 retval = conc_path_file_and_check(buffer, buffer, buflen, path, lastchar, fullfname);
314 if (retval) break;
315 }
316 // Release the storage allocated by split_path.
317 for (int i = 0; i < n; i++) {
318 if (pelements[i] != NULL) {
319 FREE_C_HEAP_ARRAY(char, pelements[i]);
320 }
321 }
322 FREE_C_HEAP_ARRAY(char*, pelements);
323 }
324 } else {
325 // A definite path.
326 const char lastchar = pname[pnamelen-1];
327 retval = conc_path_file_and_check(buffer, buffer, buflen, pname, lastchar, fullfname);
328 }
329 }
330
331 FREE_C_HEAP_ARRAY(char*, fullfname);
332 return retval;
333 }
334
335 // --------------------- sun.misc.Signal (optional) ---------------------
336
337
338 // SIGBREAK is sent by the keyboard to query the VM state
339 #ifndef SIGBREAK
340 #define SIGBREAK SIGQUIT
341 #endif
342
343 // sigexitnum_pd is a platform-specific special signal used for terminating the Signal thread.
344
345
346 static void signal_thread_entry(JavaThread* thread, TRAPS) {
347 os::set_priority(thread, NearMaxPriority);
348 while (true) {
349 int sig;
350 {
351 // FIXME : Currently we have not decided what should be the status
352 // for this java thread blocked here. Once we decide about
353 // that we should fix this.
354 sig = os::signal_wait();
355 }
356 if (sig == os::sigexitnum_pd()) {
357 // Terminate the signal thread
358 return;
359 }
360
361 switch (sig) {
362 case SIGBREAK: {
363 // Check if the signal is a trigger to start the Attach Listener - in that
364 // case don't print stack traces.
365 if (!DisableAttachMechanism) {
366 // Attempt to transit state to AL_INITIALIZING.
367 AttachListenerState cur_state = AttachListener::transit_state(AL_INITIALIZING, AL_NOT_INITIALIZED);
368 if (cur_state == AL_INITIALIZING) {
369 // Attach Listener has been started to initialize. Ignore this signal.
370 continue;
371 } else if (cur_state == AL_NOT_INITIALIZED) {
372 // Start to initialize.
373 if (AttachListener::is_init_trigger()) {
374 // Attach Listener has been initialized.
375 // Accept subsequent request.
376 continue;
377 } else {
378 // Attach Listener could not be started.
379 // So we need to transit the state to AL_NOT_INITIALIZED.
380 AttachListener::set_state(AL_NOT_INITIALIZED);
381 }
382 } else if (AttachListener::check_socket_file()) {
383 // Attach Listener has been started, but unix domain socket file
384 // does not exist. So restart Attach Listener.
385 continue;
386 }
387 }
388 // Print stack traces
389 // Any SIGBREAK operations added here should make sure to flush
390 // the output stream (e.g. tty->flush()) after output. See 4803766.
391 // Each module also prints an extra carriage return after its output.
392 VM_PrintThreads op;
393 VMThread::execute(&op);
394 VM_PrintJNI jni_op;
395 VMThread::execute(&jni_op);
396 VM_FindDeadlocks op1(tty);
397 VMThread::execute(&op1);
398 Universe::print_heap_at_SIGBREAK();
399 if (PrintClassHistogram) {
400 VM_GC_HeapInspection op1(tty, true /* force full GC before heap inspection */);
401 VMThread::execute(&op1);
402 }
403 if (JvmtiExport::should_post_data_dump()) {
404 JvmtiExport::post_data_dump();
405 }
406 break;
407 }
408 default: {
409 // Dispatch the signal to java
410 HandleMark hm(THREAD);
411 Klass* klass = SystemDictionary::resolve_or_null(vmSymbols::jdk_internal_misc_Signal(), THREAD);
412 if (klass != NULL) {
413 JavaValue result(T_VOID);
414 JavaCallArguments args;
415 args.push_int(sig);
416 JavaCalls::call_static(
417 &result,
418 klass,
419 vmSymbols::dispatch_name(),
420 vmSymbols::int_void_signature(),
421 &args,
422 THREAD
423 );
424 }
425 if (HAS_PENDING_EXCEPTION) {
426 // tty is initialized early so we don't expect it to be null, but
427 // if it is we can't risk doing an initialization that might
428 // trigger additional out-of-memory conditions
429 if (tty != NULL) {
430 char klass_name[256];
431 char tmp_sig_name[16];
432 const char* sig_name = "UNKNOWN";
433 InstanceKlass::cast(PENDING_EXCEPTION->klass())->
434 name()->as_klass_external_name(klass_name, 256);
435 if (os::exception_name(sig, tmp_sig_name, 16) != NULL)
436 sig_name = tmp_sig_name;
437 warning("Exception %s occurred dispatching signal %s to handler"
438 "- the VM may need to be forcibly terminated",
439 klass_name, sig_name );
440 }
441 CLEAR_PENDING_EXCEPTION;
442 }
443 }
444 }
445 }
446 }
447
448 void os::init_before_ergo() {
449 initialize_initial_active_processor_count();
450 // We need to initialize large page support here because ergonomics takes some
451 // decisions depending on large page support and the calculated large page size.
452 large_page_init();
453
454 // We need to adapt the configured number of stack protection pages given
455 // in 4K pages to the actual os page size. We must do this before setting
456 // up minimal stack sizes etc. in os::init_2().
457 JavaThread::set_stack_red_zone_size (align_up(StackRedPages * 4 * K, vm_page_size()));
458 JavaThread::set_stack_yellow_zone_size (align_up(StackYellowPages * 4 * K, vm_page_size()));
459 JavaThread::set_stack_reserved_zone_size(align_up(StackReservedPages * 4 * K, vm_page_size()));
460 JavaThread::set_stack_shadow_zone_size (align_up(StackShadowPages * 4 * K, vm_page_size()));
461
462 // VM version initialization identifies some characteristics of the
463 // platform that are used during ergonomic decisions.
464 VM_Version::init_before_ergo();
465 }
466
467 void os::initialize_jdk_signal_support(TRAPS) {
468 if (!ReduceSignalUsage) {
469 // Setup JavaThread for processing signals
470 const char thread_name[] = "Signal Dispatcher";
471 Handle string = java_lang_String::create_from_str(thread_name, CHECK);
472
473 // Initialize thread_oop to put it into the system threadGroup
474 Handle thread_group (THREAD, Universe::system_thread_group());
475 Handle thread_oop = JavaCalls::construct_new_instance(SystemDictionary::Thread_klass(),
476 vmSymbols::threadgroup_string_void_signature(),
477 thread_group,
478 string,
479 CHECK);
480
481 Klass* group = SystemDictionary::ThreadGroup_klass();
482 JavaValue result(T_VOID);
483 JavaCalls::call_special(&result,
484 thread_group,
485 group,
486 vmSymbols::add_method_name(),
487 vmSymbols::thread_void_signature(),
488 thread_oop,
489 CHECK);
490
491 { MutexLocker mu(Threads_lock);
492 JavaThread* signal_thread = new JavaThread(&signal_thread_entry);
493
494 // At this point it may be possible that no osthread was created for the
495 // JavaThread due to lack of memory. We would have to throw an exception
496 // in that case. However, since this must work and we do not allow
497 // exceptions anyway, check and abort if this fails.
498 if (signal_thread == NULL || signal_thread->osthread() == NULL) {
499 vm_exit_during_initialization("java.lang.OutOfMemoryError",
500 os::native_thread_creation_failed_msg());
501 }
502
503 java_lang_Thread::set_thread(thread_oop(), signal_thread);
504 java_lang_Thread::set_priority(thread_oop(), NearMaxPriority);
505 java_lang_Thread::set_daemon(thread_oop());
506
507 signal_thread->set_threadObj(thread_oop());
508 Threads::add(signal_thread);
509 Thread::start(signal_thread);
510 }
511 // Handle ^BREAK
512 os::signal(SIGBREAK, os::user_handler());
513 }
514 }
515
516
517 void os::terminate_signal_thread() {
518 if (!ReduceSignalUsage)
519 signal_notify(sigexitnum_pd());
520 }
521
522
523 // --------------------- loading libraries ---------------------
524
525 typedef jint (JNICALL *JNI_OnLoad_t)(JavaVM *, void *);
526 extern struct JavaVM_ main_vm;
527
528 static void* _native_java_library = NULL;
529
530 void* os::native_java_library() {
531 if (_native_java_library == NULL) {
532 char buffer[JVM_MAXPATHLEN];
533 char ebuf[1024];
534
535 // Try to load verify dll first. In 1.3 java dll depends on it and is not
536 // always able to find it when the loading executable is outside the JDK.
537 // In order to keep working with 1.2 we ignore any loading errors.
538 if (dll_locate_lib(buffer, sizeof(buffer), Arguments::get_dll_dir(),
539 "verify")) {
540 dll_load(buffer, ebuf, sizeof(ebuf));
541 }
542
543 // Load java dll
544 if (dll_locate_lib(buffer, sizeof(buffer), Arguments::get_dll_dir(),
545 "java")) {
546 _native_java_library = dll_load(buffer, ebuf, sizeof(ebuf));
547 }
548 if (_native_java_library == NULL) {
549 vm_exit_during_initialization("Unable to load native library", ebuf);
550 }
551
552 #if defined(__OpenBSD__)
553 // Work-around OpenBSD's lack of $ORIGIN support by pre-loading libnet.so
554 // ignore errors
555 if (dll_locate_lib(buffer, sizeof(buffer), Arguments::get_dll_dir(),
556 "net")) {
557 dll_load(buffer, ebuf, sizeof(ebuf));
558 }
559 #endif
560 }
561 return _native_java_library;
562 }
563
564 /*
565 * Support for finding Agent_On(Un)Load/Attach<_lib_name> if it exists.
566 * If check_lib == true then we are looking for an
567 * Agent_OnLoad_lib_name or Agent_OnAttach_lib_name function to determine if
568 * this library is statically linked into the image.
569 * If check_lib == false then we will look for the appropriate symbol in the
570 * executable if agent_lib->is_static_lib() == true or in the shared library
571 * referenced by 'handle'.
572 */
573 void* os::find_agent_function(AgentLibrary *agent_lib, bool check_lib,
574 const char *syms[], size_t syms_len) {
575 assert(agent_lib != NULL, "sanity check");
576 const char *lib_name;
577 void *handle = agent_lib->os_lib();
578 void *entryName = NULL;
579 char *agent_function_name;
580 size_t i;
581
582 // If checking then use the agent name otherwise test is_static_lib() to
583 // see how to process this lookup
584 lib_name = ((check_lib || agent_lib->is_static_lib()) ? agent_lib->name() : NULL);
585 for (i = 0; i < syms_len; i++) {
586 agent_function_name = build_agent_function_name(syms[i], lib_name, agent_lib->is_absolute_path());
587 if (agent_function_name == NULL) {
588 break;
589 }
590 entryName = dll_lookup(handle, agent_function_name);
591 FREE_C_HEAP_ARRAY(char, agent_function_name);
592 if (entryName != NULL) {
593 break;
594 }
595 }
596 return entryName;
597 }
598
599 // See if the passed in agent is statically linked into the VM image.
600 bool os::find_builtin_agent(AgentLibrary *agent_lib, const char *syms[],
601 size_t syms_len) {
602 void *ret;
603 void *proc_handle;
604 void *save_handle;
605
606 assert(agent_lib != NULL, "sanity check");
607 if (agent_lib->name() == NULL) {
608 return false;
609 }
610 proc_handle = get_default_process_handle();
611 // Check for Agent_OnLoad/Attach_lib_name function
612 save_handle = agent_lib->os_lib();
613 // We want to look in this process' symbol table.
614 agent_lib->set_os_lib(proc_handle);
615 ret = find_agent_function(agent_lib, true, syms, syms_len);
616 if (ret != NULL) {
617 // Found an entry point like Agent_OnLoad_lib_name so we have a static agent
618 agent_lib->set_valid();
619 agent_lib->set_static_lib(true);
620 return true;
621 }
622 agent_lib->set_os_lib(save_handle);
623 return false;
624 }
625
626 // --------------------- heap allocation utilities ---------------------
627
628 char *os::strdup(const char *str, MEMFLAGS flags) {
629 size_t size = strlen(str);
630 char *dup_str = (char *)malloc(size + 1, flags);
631 if (dup_str == NULL) return NULL;
632 strcpy(dup_str, str);
633 return dup_str;
634 }
635
636 char* os::strdup_check_oom(const char* str, MEMFLAGS flags) {
637 char* p = os::strdup(str, flags);
638 if (p == NULL) {
639 vm_exit_out_of_memory(strlen(str) + 1, OOM_MALLOC_ERROR, "os::strdup_check_oom");
640 }
641 return p;
642 }
643
644
645 #define paranoid 0 /* only set to 1 if you suspect checking code has bug */
646
647 #ifdef ASSERT
648
649 static void verify_memory(void* ptr) {
650 GuardedMemory guarded(ptr);
651 if (!guarded.verify_guards()) {
652 LogTarget(Warning, malloc, free) lt;
653 ResourceMark rm;
654 LogStream ls(lt);
655 ls.print_cr("## nof_mallocs = " UINT64_FORMAT ", nof_frees = " UINT64_FORMAT, os::num_mallocs, os::num_frees);
656 ls.print_cr("## memory stomp:");
657 guarded.print_on(&ls);
658 fatal("memory stomping error");
659 }
660 }
661
662 #endif
663
664 //
665 // This function supports testing of the malloc out of memory
666 // condition without really running the system out of memory.
667 //
668 static bool has_reached_max_malloc_test_peak(size_t alloc_size) {
669 if (MallocMaxTestWords > 0) {
670 size_t words = (alloc_size / BytesPerWord);
671
672 if ((cur_malloc_words + words) > MallocMaxTestWords) {
673 return true;
674 }
675 Atomic::add(words, &cur_malloc_words);
676 }
677 return false;
678 }
679
680 void* os::malloc(size_t size, MEMFLAGS flags) {
681 return os::malloc(size, flags, CALLER_PC);
682 }
683
684 void* os::malloc(size_t size, MEMFLAGS memflags, const NativeCallStack& stack) {
685 NOT_PRODUCT(inc_stat_counter(&num_mallocs, 1));
686 NOT_PRODUCT(inc_stat_counter(&alloc_bytes, size));
687
688 // Since os::malloc can be called when the libjvm.{dll,so} is
689 // first loaded and we don't have a thread yet we must accept NULL also here.
690 assert(!os::ThreadCrashProtection::is_crash_protected(Thread::current_or_null()),
691 "malloc() not allowed when crash protection is set");
692
693 if (size == 0) {
694 // return a valid pointer if size is zero
695 // if NULL is returned the calling functions assume out of memory.
696 size = 1;
697 }
698
699 // NMT support
700 NMT_TrackingLevel level = MemTracker::tracking_level();
701 size_t nmt_header_size = MemTracker::malloc_header_size(level);
702
703 #ifndef ASSERT
704 const size_t alloc_size = size + nmt_header_size;
705 #else
706 const size_t alloc_size = GuardedMemory::get_total_size(size + nmt_header_size);
707 if (size + nmt_header_size > alloc_size) { // Check for rollover.
708 return NULL;
709 }
710 #endif
711
712 // For the test flag -XX:MallocMaxTestWords
713 if (has_reached_max_malloc_test_peak(size)) {
714 return NULL;
715 }
716
717 u_char* ptr;
718 ptr = (u_char*)::malloc(alloc_size);
719
720 #ifdef ASSERT
721 if (ptr == NULL) {
722 return NULL;
723 }
724 // Wrap memory with guard
725 GuardedMemory guarded(ptr, size + nmt_header_size);
726 ptr = guarded.get_user_ptr();
727
728 if ((intptr_t)ptr == (intptr_t)MallocCatchPtr) {
729 log_warning(malloc, free)("os::malloc caught, " SIZE_FORMAT " bytes --> " PTR_FORMAT, size, p2i(ptr));
730 breakpoint();
731 }
732 if (paranoid) {
733 verify_memory(ptr);
734 }
735 #endif
736
737 // we do not track guard memory
738 return MemTracker::record_malloc((address)ptr, size, memflags, stack, level);
739 }
740
741 void* os::realloc(void *memblock, size_t size, MEMFLAGS flags) {
742 return os::realloc(memblock, size, flags, CALLER_PC);
743 }
744
745 void* os::realloc(void *memblock, size_t size, MEMFLAGS memflags, const NativeCallStack& stack) {
746
747 // For the test flag -XX:MallocMaxTestWords
748 if (has_reached_max_malloc_test_peak(size)) {
749 return NULL;
750 }
751
752 if (size == 0) {
753 // return a valid pointer if size is zero
754 // if NULL is returned the calling functions assume out of memory.
755 size = 1;
756 }
757
758 #ifndef ASSERT
759 NOT_PRODUCT(inc_stat_counter(&num_mallocs, 1));
760 NOT_PRODUCT(inc_stat_counter(&alloc_bytes, size));
761 // NMT support
762 void* membase = MemTracker::record_free(memblock);
763 NMT_TrackingLevel level = MemTracker::tracking_level();
764 size_t nmt_header_size = MemTracker::malloc_header_size(level);
765 void* ptr = ::realloc(membase, size + nmt_header_size);
766 return MemTracker::record_malloc(ptr, size, memflags, stack, level);
767 #else
768 if (memblock == NULL) {
769 return os::malloc(size, memflags, stack);
770 }
771 if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) {
772 log_warning(malloc, free)("os::realloc caught " PTR_FORMAT, p2i(memblock));
773 breakpoint();
774 }
775 // NMT support
776 void* membase = MemTracker::malloc_base(memblock);
777 verify_memory(membase);
778 // always move the block
779 void* ptr = os::malloc(size, memflags, stack);
780 // Copy to new memory if malloc didn't fail
781 if (ptr != NULL ) {
782 GuardedMemory guarded(MemTracker::malloc_base(memblock));
783 // Guard's user data contains NMT header
784 size_t memblock_size = guarded.get_user_size() - MemTracker::malloc_header_size(memblock);
785 memcpy(ptr, memblock, MIN2(size, memblock_size));
786 if (paranoid) {
787 verify_memory(MemTracker::malloc_base(ptr));
788 }
789 os::free(memblock);
790 }
791 return ptr;
792 #endif
793 }
794
795
796 void os::free(void *memblock) {
797 NOT_PRODUCT(inc_stat_counter(&num_frees, 1));
798 #ifdef ASSERT
799 if (memblock == NULL) return;
800 if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) {
801 log_warning(malloc, free)("os::free caught " PTR_FORMAT, p2i(memblock));
802 breakpoint();
803 }
804 void* membase = MemTracker::record_free(memblock);
805 verify_memory(membase);
806
807 GuardedMemory guarded(membase);
808 size_t size = guarded.get_user_size();
809 inc_stat_counter(&free_bytes, size);
810 membase = guarded.release_for_freeing();
811 ::free(membase);
812 #else
813 void* membase = MemTracker::record_free(memblock);
814 ::free(membase);
815 #endif
816 }
817
818 void os::init_random(unsigned int initval) {
819 _rand_seed = initval;
820 }
821
822
823 static int random_helper(unsigned int rand_seed) {
824 /* standard, well-known linear congruential random generator with
825 * next_rand = (16807*seed) mod (2**31-1)
826 * see
827 * (1) "Random Number Generators: Good Ones Are Hard to Find",
828 * S.K. Park and K.W. Miller, Communications of the ACM 31:10 (Oct 1988),
829 * (2) "Two Fast Implementations of the 'Minimal Standard' Random
830 * Number Generator", David G. Carta, Comm. ACM 33, 1 (Jan 1990), pp. 87-88.
831 */
832 const unsigned int a = 16807;
833 const unsigned int m = 2147483647;
834 const int q = m / a; assert(q == 127773, "weird math");
835 const int r = m % a; assert(r == 2836, "weird math");
836
837 // compute az=2^31p+q
838 unsigned int lo = a * (rand_seed & 0xFFFF);
839 unsigned int hi = a * (rand_seed >> 16);
840 lo += (hi & 0x7FFF) << 16;
841
842 // if q overflowed, ignore the overflow and increment q
843 if (lo > m) {
844 lo &= m;
845 ++lo;
846 }
847 lo += hi >> 15;
848
849 // if (p+q) overflowed, ignore the overflow and increment (p+q)
850 if (lo > m) {
851 lo &= m;
852 ++lo;
853 }
854 return lo;
855 }
856
857 int os::random() {
858 // Make updating the random seed thread safe.
859 while (true) {
860 unsigned int seed = _rand_seed;
861 unsigned int rand = random_helper(seed);
862 if (Atomic::cmpxchg(rand, &_rand_seed, seed) == seed) {
863 return static_cast<int>(rand);
864 }
865 }
866 }
867
868 // The INITIALIZED state is distinguished from the SUSPENDED state because the
869 // conditions in which a thread is first started are different from those in which
870 // a suspension is resumed. These differences make it hard for us to apply the
871 // tougher checks when starting threads that we want to do when resuming them.
872 // However, when start_thread is called as a result of Thread.start, on a Java
873 // thread, the operation is synchronized on the Java Thread object. So there
874 // cannot be a race to start the thread and hence for the thread to exit while
875 // we are working on it. Non-Java threads that start Java threads either have
876 // to do so in a context in which races are impossible, or should do appropriate
877 // locking.
878
879 void os::start_thread(Thread* thread) {
880 // guard suspend/resume
881 MutexLocker ml(thread->SR_lock(), Mutex::_no_safepoint_check_flag);
882 OSThread* osthread = thread->osthread();
883 osthread->set_state(RUNNABLE);
884 pd_start_thread(thread);
885 }
886
887 void os::abort(bool dump_core) {
888 abort(dump_core && CreateCoredumpOnCrash, NULL, NULL);
889 }
890
891 //---------------------------------------------------------------------------
892 // Helper functions for fatal error handler
893
894 void os::print_hex_dump(outputStream* st, address start, address end, int unitsize) {
895 assert(unitsize == 1 || unitsize == 2 || unitsize == 4 || unitsize == 8, "just checking");
896
897 start = align_down(start, unitsize);
898
899 int cols = 0;
900 int cols_per_line = 0;
901 switch (unitsize) {
902 case 1: cols_per_line = 16; break;
903 case 2: cols_per_line = 8; break;
904 case 4: cols_per_line = 4; break;
905 case 8: cols_per_line = 2; break;
906 default: return;
907 }
908
909 address p = start;
910 st->print(PTR_FORMAT ": ", p2i(start));
911 while (p < end) {
912 if (is_readable_pointer(p)) {
913 switch (unitsize) {
914 case 1: st->print("%02x", *(u1*)p); break;
915 case 2: st->print("%04x", *(u2*)p); break;
916 case 4: st->print("%08x", *(u4*)p); break;
917 case 8: st->print("%016" FORMAT64_MODIFIER "x", *(u8*)p); break;
918 }
919 } else {
920 st->print("%*.*s", 2*unitsize, 2*unitsize, "????????????????");
921 }
922 p += unitsize;
923 cols++;
924 if (cols >= cols_per_line && p < end) {
925 cols = 0;
926 st->cr();
927 st->print(PTR_FORMAT ": ", p2i(p));
928 } else {
929 st->print(" ");
930 }
931 }
932 st->cr();
933 }
934
935 void os::print_instructions(outputStream* st, address pc, int unitsize) {
936 st->print_cr("Instructions: (pc=" PTR_FORMAT ")", p2i(pc));
937 print_hex_dump(st, pc - 256, pc + 256, unitsize);
938 }
939
940 void os::print_environment_variables(outputStream* st, const char** env_list) {
941 if (env_list) {
942 st->print_cr("Environment Variables:");
943
944 for (int i = 0; env_list[i] != NULL; i++) {
945 char *envvar = ::getenv(env_list[i]);
946 if (envvar != NULL) {
947 st->print("%s", env_list[i]);
948 st->print("=");
949 st->print_cr("%s", envvar);
950 }
951 }
952 }
953 }
954
955 void os::print_cpu_info(outputStream* st, char* buf, size_t buflen) {
956 // cpu
957 st->print("CPU:");
958 st->print("total %d", os::processor_count());
959 // It's not safe to query number of active processors after crash
960 // st->print("(active %d)", os::active_processor_count()); but we can
961 // print the initial number of active processors.
962 // We access the raw value here because the assert in the accessor will
963 // fail if the crash occurs before initialization of this value.
964 st->print(" (initial active %d)", _initial_active_processor_count);
965 st->print(" %s", VM_Version::features_string());
966 st->cr();
967 pd_print_cpu_info(st, buf, buflen);
968 }
969
970 // Print a one line string summarizing the cpu, number of cores, memory, and operating system version
971 void os::print_summary_info(outputStream* st, char* buf, size_t buflen) {
972 st->print("Host: ");
973 #ifndef PRODUCT
974 if (get_host_name(buf, buflen)) {
975 st->print("%s, ", buf);
976 }
977 #endif // PRODUCT
978 get_summary_cpu_info(buf, buflen);
979 st->print("%s, ", buf);
980 size_t mem = physical_memory()/G;
981 if (mem == 0) { // for low memory systems
982 mem = physical_memory()/M;
983 st->print("%d cores, " SIZE_FORMAT "M, ", processor_count(), mem);
984 } else {
985 st->print("%d cores, " SIZE_FORMAT "G, ", processor_count(), mem);
986 }
987 get_summary_os_info(buf, buflen);
988 st->print_raw(buf);
989 st->cr();
990 }
991
992 void os::print_date_and_time(outputStream *st, char* buf, size_t buflen) {
993 const int secs_per_day = 86400;
994 const int secs_per_hour = 3600;
995 const int secs_per_min = 60;
996
997 time_t tloc;
998 (void)time(&tloc);
999 char* timestring = ctime(&tloc); // ctime adds newline.
1000 // edit out the newline
1001 char* nl = strchr(timestring, '\n');
1002 if (nl != NULL) {
1003 *nl = '\0';
1004 }
1005
1006 struct tm tz;
1007 if (localtime_pd(&tloc, &tz) != NULL) {
1008 ::strftime(buf, buflen, "%Z", &tz);
1009 st->print("Time: %s %s", timestring, buf);
1010 } else {
1011 st->print("Time: %s", timestring);
1012 }
1013
1014 double t = os::elapsedTime();
1015 // NOTE: It tends to crash after a SEGV if we want to printf("%f",...) in
1016 // Linux. Must be a bug in glibc ? Workaround is to round "t" to int
1017 // before printf. We lost some precision, but who cares?
1018 int eltime = (int)t; // elapsed time in seconds
1019
1020 // print elapsed time in a human-readable format:
1021 int eldays = eltime / secs_per_day;
1022 int day_secs = eldays * secs_per_day;
1023 int elhours = (eltime - day_secs) / secs_per_hour;
1024 int hour_secs = elhours * secs_per_hour;
1025 int elmins = (eltime - day_secs - hour_secs) / secs_per_min;
1026 int minute_secs = elmins * secs_per_min;
1027 int elsecs = (eltime - day_secs - hour_secs - minute_secs);
1028 st->print_cr(" elapsed time: %d seconds (%dd %dh %dm %ds)", eltime, eldays, elhours, elmins, elsecs);
1029 }
1030
1031
1032 // Check if pointer can be read from (4-byte read access).
1033 // Helps to prove validity of a not-NULL pointer.
1034 // Returns true in very early stages of VM life when stub is not yet generated.
1035 #define SAFEFETCH_DEFAULT true
1036 bool os::is_readable_pointer(const void* p) {
1037 if (!CanUseSafeFetch32()) {
1038 return SAFEFETCH_DEFAULT;
1039 }
1040 int* const aligned = (int*) align_down((intptr_t)p, 4);
1041 int cafebabe = 0xcafebabe; // tester value 1
1042 int deadbeef = 0xdeadbeef; // tester value 2
1043 return (SafeFetch32(aligned, cafebabe) != cafebabe) || (SafeFetch32(aligned, deadbeef) != deadbeef);
1044 }
1045
1046 bool os::is_readable_range(const void* from, const void* to) {
1047 if ((uintptr_t)from >= (uintptr_t)to) return false;
1048 for (uintptr_t p = align_down((uintptr_t)from, min_page_size()); p < (uintptr_t)to; p += min_page_size()) {
1049 if (!is_readable_pointer((const void*)p)) {
1050 return false;
1051 }
1052 }
1053 return true;
1054 }
1055
1056
1057 // moved from debug.cpp (used to be find()) but still called from there
1058 // The verbose parameter is only set by the debug code in one case
1059 void os::print_location(outputStream* st, intptr_t x, bool verbose) {
1060 address addr = (address)x;
1061 // Handle NULL first, so later checks don't need to protect against it.
1062 if (addr == NULL) {
1063 st->print_cr("0x0 is NULL");
1064 return;
1065 }
1066
1067 // Check if addr points into a code blob.
1068 CodeBlob* b = CodeCache::find_blob_unsafe(addr);
1069 if (b != NULL) {
1070 b->dump_for_addr(addr, st, verbose);
1071 return;
1072 }
1073
1074 // Check if addr points into Java heap.
1075 if (Universe::heap()->is_in(addr)) {
1076 oop o = oopDesc::oop_or_null(addr);
1077 if (o != NULL) {
1078 if ((HeapWord*)o == (HeapWord*)addr) {
1079 st->print(INTPTR_FORMAT " is an oop: ", p2i(addr));
1080 } else {
1081 st->print(INTPTR_FORMAT " is pointing into object: " , p2i(addr));
1082 }
1083 o->print_on(st);
1084 return;
1085 }
1086 } else if (Universe::heap()->is_in_reserved(addr)) {
1087 st->print_cr(INTPTR_FORMAT " is an unallocated location in the heap", p2i(addr));
1088 return;
1089 }
1090
1091 // Compressed oop needs to be decoded first.
1092 #ifdef _LP64
1093 if (UseCompressedOops && ((uintptr_t)addr &~ (uintptr_t)max_juint) == 0) {
1094 narrowOop narrow_oop = (narrowOop)(uintptr_t)addr;
1095 oop o = CompressedOops::decode_raw(narrow_oop);
1096
1097 if (oopDesc::is_valid(o)) {
1098 st->print(UINT32_FORMAT " is a compressed pointer to object: ", narrow_oop);
1099 o->print_on(st);
1100 return;
1101 }
1102 }
1103 #endif
1104
1105 bool accessible = is_readable_pointer(addr);
1106
1107 // Check if addr is a JNI handle.
1108 if (align_down((intptr_t)addr, sizeof(intptr_t)) != 0 && accessible) {
1109 if (JNIHandles::is_global_handle((jobject) addr)) {
1110 st->print_cr(INTPTR_FORMAT " is a global jni handle", p2i(addr));
1111 return;
1112 }
1113 if (JNIHandles::is_weak_global_handle((jobject) addr)) {
1114 st->print_cr(INTPTR_FORMAT " is a weak global jni handle", p2i(addr));
1115 return;
1116 }
1117 #ifndef PRODUCT
1118 // we don't keep the block list in product mode
1119 if (JNIHandles::is_local_handle((jobject) addr)) {
1120 st->print_cr(INTPTR_FORMAT " is a local jni handle", p2i(addr));
1121 return;
1122 }
1123 #endif
1124 }
1125
1126 // Check if addr belongs to a Java thread.
1127 for (JavaThreadIteratorWithHandle jtiwh; JavaThread *thread = jtiwh.next(); ) {
1128 // If the addr is a java thread print information about that.
1129 if (addr == (address)thread) {
1130 if (verbose) {
1131 thread->print_on(st);
1132 } else {
1133 st->print_cr(INTPTR_FORMAT " is a thread", p2i(addr));
1134 }
1135 return;
1136 }
1137 // If the addr is in the stack region for this thread then report that
1138 // and print thread info
1139 if (thread->on_local_stack(addr)) {
1140 st->print_cr(INTPTR_FORMAT " is pointing into the stack for thread: "
1141 INTPTR_FORMAT, p2i(addr), p2i(thread));
1142 if (verbose) thread->print_on(st);
1143 return;
1144 }
1145 }
1146
1147 // Check if in metaspace and print types that have vptrs
1148 if (Metaspace::contains(addr)) {
1149 if (Klass::is_valid((Klass*)addr)) {
1150 st->print_cr(INTPTR_FORMAT " is a pointer to class: ", p2i(addr));
1151 ((Klass*)addr)->print_on(st);
1152 } else if (Method::is_valid_method((const Method*)addr)) {
1153 ((Method*)addr)->print_value_on(st);
1154 st->cr();
1155 } else {
1156 // Use addr->print() from the debugger instead (not here)
1157 st->print_cr(INTPTR_FORMAT " is pointing into metadata", p2i(addr));
1158 }
1159 return;
1160 }
1161
1162 // Compressed klass needs to be decoded first.
1163 #ifdef _LP64
1164 if (UseCompressedClassPointers && ((uintptr_t)addr &~ (uintptr_t)max_juint) == 0) {
1165 narrowKlass narrow_klass = (narrowKlass)(uintptr_t)addr;
1166 Klass* k = CompressedKlassPointers::decode_raw(narrow_klass);
1167
1168 if (Klass::is_valid(k)) {
1169 st->print_cr(UINT32_FORMAT " is a compressed pointer to class: " INTPTR_FORMAT, narrow_klass, p2i((HeapWord*)k));
1170 k->print_on(st);
1171 return;
1172 }
1173 }
1174 #endif
1175
1176 // Try an OS specific find
1177 if (os::find(addr, st)) {
1178 return;
1179 }
1180
1181 if (accessible) {
1182 st->print(INTPTR_FORMAT " points into unknown readable memory:", p2i(addr));
1183 for (address p = addr; p < align_up(addr + 1, sizeof(intptr_t)); ++p) {
1184 st->print(" %02x", *(u1*)p);
1185 }
1186 st->cr();
1187 return;
1188 }
1189
1190 st->print_cr(INTPTR_FORMAT " is an unknown value", p2i(addr));
1191 }
1192
1193 // Looks like all platforms can use the same function to check if C
1194 // stack is walkable beyond current frame. The check for fp() is not
1195 // necessary on Sparc, but it's harmless.
1196 bool os::is_first_C_frame(frame* fr) {
1197 // Load up sp, fp, sender sp and sender fp, check for reasonable values.
1198 // Check usp first, because if that's bad the other accessors may fault
1199 // on some architectures. Ditto ufp second, etc.
1200 uintptr_t fp_align_mask = (uintptr_t)(sizeof(address)-1);
1201 // sp on amd can be 32 bit aligned.
1202 uintptr_t sp_align_mask = (uintptr_t)(sizeof(int)-1);
1203
1204 uintptr_t usp = (uintptr_t)fr->sp();
1205 if ((usp & sp_align_mask) != 0) return true;
1206
1207 uintptr_t ufp = (uintptr_t)fr->fp();
1208 if ((ufp & fp_align_mask) != 0) return true;
1209
1210 uintptr_t old_sp = (uintptr_t)fr->sender_sp();
1211 if ((old_sp & sp_align_mask) != 0) return true;
1212 if (old_sp == 0 || old_sp == (uintptr_t)-1) return true;
1213
1214 uintptr_t old_fp = (uintptr_t)fr->link();
1215 if ((old_fp & fp_align_mask) != 0) return true;
1216 if (old_fp == 0 || old_fp == (uintptr_t)-1 || old_fp == ufp) return true;
1217
1218 // stack grows downwards; if old_fp is below current fp or if the stack
1219 // frame is too large, either the stack is corrupted or fp is not saved
1220 // on stack (i.e. on x86, ebp may be used as general register). The stack
1221 // is not walkable beyond current frame.
1222 if (old_fp < ufp) return true;
1223 if (old_fp - ufp > 64 * K) return true;
1224
1225 return false;
1226 }
1227
1228
1229 // Set up the boot classpath.
1230
1231 char* os::format_boot_path(const char* format_string,
1232 const char* home,
1233 int home_len,
1234 char fileSep,
1235 char pathSep) {
1236 assert((fileSep == '/' && pathSep == ':') ||
1237 (fileSep == '\\' && pathSep == ';'), "unexpected separator chars");
1238
1239 // Scan the format string to determine the length of the actual
1240 // boot classpath, and handle platform dependencies as well.
1241 int formatted_path_len = 0;
1242 const char* p;
1243 for (p = format_string; *p != 0; ++p) {
1244 if (*p == '%') formatted_path_len += home_len - 1;
1245 ++formatted_path_len;
1246 }
1247
1248 char* formatted_path = NEW_C_HEAP_ARRAY(char, formatted_path_len + 1, mtInternal);
1249 if (formatted_path == NULL) {
1250 return NULL;
1251 }
1252
1253 // Create boot classpath from format, substituting separator chars and
1254 // java home directory.
1255 char* q = formatted_path;
1256 for (p = format_string; *p != 0; ++p) {
1257 switch (*p) {
1258 case '%':
1259 strcpy(q, home);
1260 q += home_len;
1261 break;
1262 case '/':
1263 *q++ = fileSep;
1264 break;
1265 case ':':
1266 *q++ = pathSep;
1267 break;
1268 default:
1269 *q++ = *p;
1270 }
1271 }
1272 *q = '\0';
1273
1274 assert((q - formatted_path) == formatted_path_len, "formatted_path size botched");
1275 return formatted_path;
1276 }
1277
1278 // This function is a proxy to fopen, it tries to add a non standard flag ('e' or 'N')
1279 // that ensures automatic closing of the file on exec. If it can not find support in
1280 // the underlying c library, it will make an extra system call (fcntl) to ensure automatic
1281 // closing of the file on exec.
1282 FILE* os::fopen(const char* path, const char* mode) {
1283 char modified_mode[20];
1284 assert(strlen(mode) + 1 < sizeof(modified_mode), "mode chars plus one extra must fit in buffer");
1285 sprintf(modified_mode, "%s" LINUX_ONLY("e") BSD_ONLY("e") WINDOWS_ONLY("N"), mode);
1286 FILE* file = ::fopen(path, modified_mode);
1287
1288 #if !(defined LINUX || defined BSD || defined _WINDOWS)
1289 // assume fcntl FD_CLOEXEC support as a backup solution when 'e' or 'N'
1290 // is not supported as mode in fopen
1291 if (file != NULL) {
1292 int fd = fileno(file);
1293 if (fd != -1) {
1294 int fd_flags = fcntl(fd, F_GETFD);
1295 if (fd_flags != -1) {
1296 fcntl(fd, F_SETFD, fd_flags | FD_CLOEXEC);
1297 }
1298 }
1299 }
1300 #endif
1301
1302 return file;
1303 }
1304
1305 bool os::set_boot_path(char fileSep, char pathSep) {
1306 const char* home = Arguments::get_java_home();
1307 int home_len = (int)strlen(home);
1308
1309 struct stat st;
1310
1311 // modular image if "modules" jimage exists
1312 char* jimage = format_boot_path("%/lib/" MODULES_IMAGE_NAME, home, home_len, fileSep, pathSep);
1313 if (jimage == NULL) return false;
1314 bool has_jimage = (os::stat(jimage, &st) == 0);
1315 if (has_jimage) {
1316 Arguments::set_sysclasspath(jimage, true);
1317 FREE_C_HEAP_ARRAY(char, jimage);
1318 return true;
1319 }
1320 FREE_C_HEAP_ARRAY(char, jimage);
1321
1322 // check if developer build with exploded modules
1323 char* base_classes = format_boot_path("%/modules/" JAVA_BASE_NAME, home, home_len, fileSep, pathSep);
1324 if (base_classes == NULL) return false;
1325 if (os::stat(base_classes, &st) == 0) {
1326 Arguments::set_sysclasspath(base_classes, false);
1327 FREE_C_HEAP_ARRAY(char, base_classes);
1328 return true;
1329 }
1330 FREE_C_HEAP_ARRAY(char, base_classes);
1331
1332 return false;
1333 }
1334
1335 /*
1336 * Splits a path, based on its separator, the number of
1337 * elements is returned back in n.
1338 * It is the callers responsibility to:
1339 * a> check the value of n, and n may be 0.
1340 * b> ignore any empty path elements
1341 * c> free up the data.
1342 */
1343 char** os::split_path(const char* path, int* n) {
1344 *n = 0;
1345 if (path == NULL || strlen(path) == 0) {
1346 return NULL;
1347 }
1348 const char psepchar = *os::path_separator();
1349 char* inpath = (char*)NEW_C_HEAP_ARRAY(char, strlen(path) + 1, mtInternal);
1350 if (inpath == NULL) {
1351 return NULL;
1352 }
1353 strcpy(inpath, path);
1354 int count = 1;
1355 char* p = strchr(inpath, psepchar);
1356 // Get a count of elements to allocate memory
1357 while (p != NULL) {
1358 count++;
1359 p++;
1360 p = strchr(p, psepchar);
1361 }
1362 char** opath = (char**) NEW_C_HEAP_ARRAY(char*, count, mtInternal);
1363 if (opath == NULL) {
1364 return NULL;
1365 }
1366
1367 // do the actual splitting
1368 p = inpath;
1369 for (int i = 0 ; i < count ; i++) {
1370 size_t len = strcspn(p, os::path_separator());
1371 if (len > JVM_MAXPATHLEN) {
1372 return NULL;
1373 }
1374 // allocate the string and add terminator storage
1375 char* s = (char*)NEW_C_HEAP_ARRAY(char, len + 1, mtInternal);
1376 if (s == NULL) {
1377 return NULL;
1378 }
1379 strncpy(s, p, len);
1380 s[len] = '\0';
1381 opath[i] = s;
1382 p += len + 1;
1383 }
1384 FREE_C_HEAP_ARRAY(char, inpath);
1385 *n = count;
1386 return opath;
1387 }
1388
1389 // Returns true if the current stack pointer is above the stack shadow
1390 // pages, false otherwise.
1391 bool os::stack_shadow_pages_available(Thread *thread, const methodHandle& method, address sp) {
1392 if (!thread->is_Java_thread()) return false;
1393 // Check if we have StackShadowPages above the yellow zone. This parameter
1394 // is dependent on the depth of the maximum VM call stack possible from
1395 // the handler for stack overflow. 'instanceof' in the stack overflow
1396 // handler or a println uses at least 8k stack of VM and native code
1397 // respectively.
1398 const int framesize_in_bytes =
1399 Interpreter::size_top_interpreter_activation(method()) * wordSize;
1400
1401 address limit = ((JavaThread*)thread)->stack_end() +
1402 (JavaThread::stack_guard_zone_size() + JavaThread::stack_shadow_zone_size());
1403
1404 return sp > (limit + framesize_in_bytes);
1405 }
1406
1407 size_t os::page_size_for_region(size_t region_size, size_t min_pages, bool must_be_aligned) {
1408 assert(min_pages > 0, "sanity");
1409 if (UseLargePages) {
1410 const size_t max_page_size = region_size / min_pages;
1411
1412 for (size_t i = 0; _page_sizes[i] != 0; ++i) {
1413 const size_t page_size = _page_sizes[i];
1414 if (page_size <= max_page_size) {
1415 if (!must_be_aligned || is_aligned(region_size, page_size)) {
1416 return page_size;
1417 }
1418 }
1419 }
1420 }
1421
1422 return vm_page_size();
1423 }
1424
1425 size_t os::page_size_for_region_aligned(size_t region_size, size_t min_pages) {
1426 return page_size_for_region(region_size, min_pages, true);
1427 }
1428
1429 size_t os::page_size_for_region_unaligned(size_t region_size, size_t min_pages) {
1430 return page_size_for_region(region_size, min_pages, false);
1431 }
1432
1433 static const char* errno_to_string (int e, bool short_text) {
1434 #define ALL_SHARED_ENUMS(X) \
1435 X(E2BIG, "Argument list too long") \
1436 X(EACCES, "Permission denied") \
1437 X(EADDRINUSE, "Address in use") \
1438 X(EADDRNOTAVAIL, "Address not available") \
1439 X(EAFNOSUPPORT, "Address family not supported") \
1440 X(EAGAIN, "Resource unavailable, try again") \
1441 X(EALREADY, "Connection already in progress") \
1442 X(EBADF, "Bad file descriptor") \
1443 X(EBADMSG, "Bad message") \
1444 X(EBUSY, "Device or resource busy") \
1445 X(ECANCELED, "Operation canceled") \
1446 X(ECHILD, "No child processes") \
1447 X(ECONNABORTED, "Connection aborted") \
1448 X(ECONNREFUSED, "Connection refused") \
1449 X(ECONNRESET, "Connection reset") \
1450 X(EDEADLK, "Resource deadlock would occur") \
1451 X(EDESTADDRREQ, "Destination address required") \
1452 X(EDOM, "Mathematics argument out of domain of function") \
1453 X(EEXIST, "File exists") \
1454 X(EFAULT, "Bad address") \
1455 X(EFBIG, "File too large") \
1456 X(EHOSTUNREACH, "Host is unreachable") \
1457 X(EIDRM, "Identifier removed") \
1458 X(EILSEQ, "Illegal byte sequence") \
1459 X(EINPROGRESS, "Operation in progress") \
1460 X(EINTR, "Interrupted function") \
1461 X(EINVAL, "Invalid argument") \
1462 X(EIO, "I/O error") \
1463 X(EISCONN, "Socket is connected") \
1464 X(EISDIR, "Is a directory") \
1465 X(ELOOP, "Too many levels of symbolic links") \
1466 X(EMFILE, "Too many open files") \
1467 X(EMLINK, "Too many links") \
1468 X(EMSGSIZE, "Message too large") \
1469 X(ENAMETOOLONG, "Filename too long") \
1470 X(ENETDOWN, "Network is down") \
1471 X(ENETRESET, "Connection aborted by network") \
1472 X(ENETUNREACH, "Network unreachable") \
1473 X(ENFILE, "Too many files open in system") \
1474 X(ENOBUFS, "No buffer space available") \
1475 X(ENODATA, "No message is available on the STREAM head read queue") \
1476 X(ENODEV, "No such device") \
1477 X(ENOENT, "No such file or directory") \
1478 X(ENOEXEC, "Executable file format error") \
1479 X(ENOLCK, "No locks available") \
1480 X(ENOLINK, "Reserved") \
1481 X(ENOMEM, "Not enough space") \
1482 X(ENOMSG, "No message of the desired type") \
1483 X(ENOPROTOOPT, "Protocol not available") \
1484 X(ENOSPC, "No space left on device") \
1485 X(ENOSR, "No STREAM resources") \
1486 X(ENOSTR, "Not a STREAM") \
1487 X(ENOSYS, "Function not supported") \
1488 X(ENOTCONN, "The socket is not connected") \
1489 X(ENOTDIR, "Not a directory") \
1490 X(ENOTEMPTY, "Directory not empty") \
1491 X(ENOTSOCK, "Not a socket") \
1492 X(ENOTSUP, "Not supported") \
1493 X(ENOTTY, "Inappropriate I/O control operation") \
1494 X(ENXIO, "No such device or address") \
1495 X(EOPNOTSUPP, "Operation not supported on socket") \
1496 X(EOVERFLOW, "Value too large to be stored in data type") \
1497 X(EPERM, "Operation not permitted") \
1498 X(EPIPE, "Broken pipe") \
1499 X(EPROTO, "Protocol error") \
1500 X(EPROTONOSUPPORT, "Protocol not supported") \
1501 X(EPROTOTYPE, "Protocol wrong type for socket") \
1502 X(ERANGE, "Result too large") \
1503 X(EROFS, "Read-only file system") \
1504 X(ESPIPE, "Invalid seek") \
1505 X(ESRCH, "No such process") \
1506 X(ETIME, "Stream ioctl() timeout") \
1507 X(ETIMEDOUT, "Connection timed out") \
1508 X(ETXTBSY, "Text file busy") \
1509 X(EWOULDBLOCK, "Operation would block") \
1510 X(EXDEV, "Cross-device link")
1511
1512 #define DEFINE_ENTRY(e, text) { e, #e, text },
1513
1514 static const struct {
1515 int v;
1516 const char* short_text;
1517 const char* long_text;
1518 } table [] = {
1519
1520 ALL_SHARED_ENUMS(DEFINE_ENTRY)
1521
1522 // The following enums are not defined on all platforms.
1523 #ifdef ESTALE
1524 DEFINE_ENTRY(ESTALE, "Reserved")
1525 #endif
1526 #ifdef EDQUOT
1527 DEFINE_ENTRY(EDQUOT, "Reserved")
1528 #endif
1529 #ifdef EMULTIHOP
1530 DEFINE_ENTRY(EMULTIHOP, "Reserved")
1531 #endif
1532
1533 // End marker.
1534 { -1, "Unknown errno", "Unknown error" }
1535
1536 };
1537
1538 #undef DEFINE_ENTRY
1539 #undef ALL_FLAGS
1540
1541 int i = 0;
1542 while (table[i].v != -1 && table[i].v != e) {
1543 i ++;
1544 }
1545
1546 return short_text ? table[i].short_text : table[i].long_text;
1547
1548 }
1549
1550 const char* os::strerror(int e) {
1551 return errno_to_string(e, false);
1552 }
1553
1554 const char* os::errno_name(int e) {
1555 return errno_to_string(e, true);
1556 }
1557
1558 void os::trace_page_sizes(const char* str, const size_t* page_sizes, int count) {
1559 LogTarget(Info, pagesize) log;
1560 if (log.is_enabled()) {
1561 LogStream out(log);
1562
1563 out.print("%s: ", str);
1564 for (int i = 0; i < count; ++i) {
1565 out.print(" " SIZE_FORMAT, page_sizes[i]);
1566 }
1567 out.cr();
1568 }
1569 }
1570
1571 #define trace_page_size_params(size) byte_size_in_exact_unit(size), exact_unit_for_byte_size(size)
1572
1573 void os::trace_page_sizes(const char* str,
1574 const size_t region_min_size,
1575 const size_t region_max_size,
1576 const size_t page_size,
1577 const char* base,
1578 const size_t size) {
1579
1580 log_info(pagesize)("%s: "
1581 " min=" SIZE_FORMAT "%s"
1582 " max=" SIZE_FORMAT "%s"
1583 " base=" PTR_FORMAT
1584 " page_size=" SIZE_FORMAT "%s"
1585 " size=" SIZE_FORMAT "%s",
1586 str,
1587 trace_page_size_params(region_min_size),
1588 trace_page_size_params(region_max_size),
1589 p2i(base),
1590 trace_page_size_params(page_size),
1591 trace_page_size_params(size));
1592 }
1593
1594 void os::trace_page_sizes_for_requested_size(const char* str,
1595 const size_t requested_size,
1596 const size_t page_size,
1597 const size_t alignment,
1598 const char* base,
1599 const size_t size) {
1600
1601 log_info(pagesize)("%s:"
1602 " req_size=" SIZE_FORMAT "%s"
1603 " base=" PTR_FORMAT
1604 " page_size=" SIZE_FORMAT "%s"
1605 " alignment=" SIZE_FORMAT "%s"
1606 " size=" SIZE_FORMAT "%s",
1607 str,
1608 trace_page_size_params(requested_size),
1609 p2i(base),
1610 trace_page_size_params(page_size),
1611 trace_page_size_params(alignment),
1612 trace_page_size_params(size));
1613 }
1614
1615
1616 // This is the working definition of a server class machine:
1617 // >= 2 physical CPU's and >=2GB of memory, with some fuzz
1618 // because the graphics memory (?) sometimes masks physical memory.
1619 // If you want to change the definition of a server class machine
1620 // on some OS or platform, e.g., >=4GB on Windows platforms,
1621 // then you'll have to parameterize this method based on that state,
1622 // as was done for logical processors here, or replicate and
1623 // specialize this method for each platform. (Or fix os to have
1624 // some inheritance structure and use subclassing. Sigh.)
1625 // If you want some platform to always or never behave as a server
1626 // class machine, change the setting of AlwaysActAsServerClassMachine
1627 // and NeverActAsServerClassMachine in globals*.hpp.
1628 bool os::is_server_class_machine() {
1629 // First check for the early returns
1630 if (NeverActAsServerClassMachine) {
1631 return false;
1632 }
1633 if (AlwaysActAsServerClassMachine) {
1634 return true;
1635 }
1636 // Then actually look at the machine
1637 bool result = false;
1638 const unsigned int server_processors = 2;
1639 const julong server_memory = 2UL * G;
1640 // We seem not to get our full complement of memory.
1641 // We allow some part (1/8?) of the memory to be "missing",
1642 // based on the sizes of DIMMs, and maybe graphics cards.
1643 const julong missing_memory = 256UL * M;
1644
1645 /* Is this a server class machine? */
1646 if ((os::active_processor_count() >= (int)server_processors) &&
1647 (os::physical_memory() >= (server_memory - missing_memory))) {
1648 const unsigned int logical_processors =
1649 VM_Version::logical_processors_per_package();
1650 if (logical_processors > 1) {
1651 const unsigned int physical_packages =
1652 os::active_processor_count() / logical_processors;
1653 if (physical_packages >= server_processors) {
1654 result = true;
1655 }
1656 } else {
1657 result = true;
1658 }
1659 }
1660 return result;
1661 }
1662
1663 void os::initialize_initial_active_processor_count() {
1664 assert(_initial_active_processor_count == 0, "Initial active processor count already set.");
1665 _initial_active_processor_count = active_processor_count();
1666 log_debug(os)("Initial active processor count set to %d" , _initial_active_processor_count);
1667 }
1668
1669 void os::SuspendedThreadTask::run() {
1670 internal_do_task();
1671 _done = true;
1672 }
1673
1674 bool os::create_stack_guard_pages(char* addr, size_t bytes) {
1675 return os::pd_create_stack_guard_pages(addr, bytes);
1676 }
1677
1678 char* os::reserve_memory(size_t bytes, char* addr, size_t alignment_hint, int file_desc) {
1679 char* result = NULL;
1680
1681 if (file_desc != -1) {
1682 // Could have called pd_reserve_memory() followed by replace_existing_mapping_with_file_mapping(),
1683 // but AIX may use SHM in which case its more trouble to detach the segment and remap memory to the file.
1684 result = os::map_memory_to_file(addr, bytes, file_desc);
1685 if (result != NULL) {
1686 MemTracker::record_virtual_memory_reserve_and_commit((address)result, bytes, CALLER_PC);
1687 }
1688 } else {
1689 result = pd_reserve_memory(bytes, addr, alignment_hint);
1690 if (result != NULL) {
1691 MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC);
1692 }
1693 }
1694
1695 return result;
1696 }
1697
1698 char* os::reserve_memory(size_t bytes, char* addr, size_t alignment_hint,
1699 MEMFLAGS flags) {
1700 char* result = pd_reserve_memory(bytes, addr, alignment_hint);
1701 if (result != NULL) {
1702 MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC);
1703 MemTracker::record_virtual_memory_type((address)result, flags);
1704 }
1705
1706 return result;
1707 }
1708
1709 char* os::attempt_reserve_memory_at(size_t bytes, char* addr, int file_desc) {
1710 char* result = NULL;
1711 if (file_desc != -1) {
1712 result = pd_attempt_reserve_memory_at(bytes, addr, file_desc);
1713 if (result != NULL) {
1714 MemTracker::record_virtual_memory_reserve_and_commit((address)result, bytes, CALLER_PC);
1715 }
1716 } else {
1717 result = pd_attempt_reserve_memory_at(bytes, addr);
1718 if (result != NULL) {
1719 MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC);
1720 }
1721 }
1722 return result;
1723 }
1724
1725 void os::split_reserved_memory(char *base, size_t size,
1726 size_t split, bool realloc) {
1727 pd_split_reserved_memory(base, size, split, realloc);
1728 }
1729
1730 bool os::commit_memory(char* addr, size_t bytes, bool executable) {
1731 bool res = pd_commit_memory(addr, bytes, executable);
1732 if (res) {
1733 MemTracker::record_virtual_memory_commit((address)addr, bytes, CALLER_PC);
1734 }
1735 return res;
1736 }
1737
1738 bool os::commit_memory(char* addr, size_t size, size_t alignment_hint,
1739 bool executable) {
1740 bool res = os::pd_commit_memory(addr, size, alignment_hint, executable);
1741 if (res) {
1742 MemTracker::record_virtual_memory_commit((address)addr, size, CALLER_PC);
1743 }
1744 return res;
1745 }
1746
1747 void os::commit_memory_or_exit(char* addr, size_t bytes, bool executable,
1748 const char* mesg) {
1749 pd_commit_memory_or_exit(addr, bytes, executable, mesg);
1750 MemTracker::record_virtual_memory_commit((address)addr, bytes, CALLER_PC);
1751 }
1752
1753 void os::commit_memory_or_exit(char* addr, size_t size, size_t alignment_hint,
1754 bool executable, const char* mesg) {
1755 os::pd_commit_memory_or_exit(addr, size, alignment_hint, executable, mesg);
1756 MemTracker::record_virtual_memory_commit((address)addr, size, CALLER_PC);
1757 }
1758
1759 bool os::uncommit_memory(char* addr, size_t bytes) {
1760 bool res;
1761 if (MemTracker::tracking_level() > NMT_minimal) {
1762 Tracker tkr(Tracker::uncommit);
1763 res = pd_uncommit_memory(addr, bytes);
1764 if (res) {
1765 tkr.record((address)addr, bytes);
1766 }
1767 } else {
1768 res = pd_uncommit_memory(addr, bytes);
1769 }
1770 return res;
1771 }
1772
1773 bool os::release_memory(char* addr, size_t bytes) {
1774 bool res;
1775 if (MemTracker::tracking_level() > NMT_minimal) {
1776 Tracker tkr(Tracker::release);
1777 res = pd_release_memory(addr, bytes);
1778 if (res) {
1779 tkr.record((address)addr, bytes);
1780 }
1781 } else {
1782 res = pd_release_memory(addr, bytes);
1783 }
1784 return res;
1785 }
1786
1787 void os::pretouch_memory(void* start, void* end, size_t page_size) {
1788 for (volatile char *p = (char*)start; p < (char*)end; p += page_size) {
1789 *p = 0;
1790 }
1791 }
1792
1793 char* os::map_memory(int fd, const char* file_name, size_t file_offset,
1794 char *addr, size_t bytes, bool read_only,
1795 bool allow_exec) {
1796 char* result = pd_map_memory(fd, file_name, file_offset, addr, bytes, read_only, allow_exec);
1797 if (result != NULL) {
1798 MemTracker::record_virtual_memory_reserve_and_commit((address)result, bytes, CALLER_PC);
1799 }
1800 return result;
1801 }
1802
1803 char* os::remap_memory(int fd, const char* file_name, size_t file_offset,
1804 char *addr, size_t bytes, bool read_only,
1805 bool allow_exec) {
1806 return pd_remap_memory(fd, file_name, file_offset, addr, bytes,
1807 read_only, allow_exec);
1808 }
1809
1810 bool os::unmap_memory(char *addr, size_t bytes) {
1811 bool result;
1812 if (MemTracker::tracking_level() > NMT_minimal) {
1813 Tracker tkr(Tracker::release);
1814 result = pd_unmap_memory(addr, bytes);
1815 if (result) {
1816 tkr.record((address)addr, bytes);
1817 }
1818 } else {
1819 result = pd_unmap_memory(addr, bytes);
1820 }
1821 return result;
1822 }
1823
1824 void os::free_memory(char *addr, size_t bytes, size_t alignment_hint) {
1825 pd_free_memory(addr, bytes, alignment_hint);
1826 }
1827
1828 void os::realign_memory(char *addr, size_t bytes, size_t alignment_hint) {
1829 pd_realign_memory(addr, bytes, alignment_hint);
1830 }
1831
1832 #ifndef _WINDOWS
1833 /* try to switch state from state "from" to state "to"
1834 * returns the state set after the method is complete
1835 */
1836 os::SuspendResume::State os::SuspendResume::switch_state(os::SuspendResume::State from,
1837 os::SuspendResume::State to)
1838 {
1839 os::SuspendResume::State result = Atomic::cmpxchg(to, &_state, from);
1840 if (result == from) {
1841 // success
1842 return to;
1843 }
1844 return result;
1845 }
1846 #endif