Mon, 18 Mar 2013 13:19:06 +0100
8008555: Debugging code in compiled method sometimes leaks memory
Summary: support for strings that have same life-time as code that uses them.
Reviewed-by: kvn, twisti
duke@435 | 1 | /* |
coleenp@4037 | 2 | * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "classfile/classLoader.hpp" |
stefank@2314 | 27 | #include "classfile/javaClasses.hpp" |
stefank@2314 | 28 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 29 | #include "classfile/vmSymbols.hpp" |
stefank@2314 | 30 | #include "code/icBuffer.hpp" |
stefank@2314 | 31 | #include "code/vtableStubs.hpp" |
stefank@2314 | 32 | #include "gc_implementation/shared/vmGCOperations.hpp" |
stefank@2314 | 33 | #include "interpreter/interpreter.hpp" |
stefank@2314 | 34 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 35 | #include "oops/oop.inline.hpp" |
stefank@2314 | 36 | #include "prims/jvm.h" |
stefank@2314 | 37 | #include "prims/jvm_misc.hpp" |
stefank@2314 | 38 | #include "prims/privilegedStack.hpp" |
stefank@2314 | 39 | #include "runtime/arguments.hpp" |
stefank@2314 | 40 | #include "runtime/frame.inline.hpp" |
stefank@2314 | 41 | #include "runtime/interfaceSupport.hpp" |
stefank@2314 | 42 | #include "runtime/java.hpp" |
stefank@2314 | 43 | #include "runtime/javaCalls.hpp" |
stefank@2314 | 44 | #include "runtime/mutexLocker.hpp" |
stefank@2314 | 45 | #include "runtime/os.hpp" |
stefank@2314 | 46 | #include "runtime/stubRoutines.hpp" |
stefank@4299 | 47 | #include "runtime/thread.inline.hpp" |
stefank@2314 | 48 | #include "services/attachListener.hpp" |
zgu@3900 | 49 | #include "services/memTracker.hpp" |
stefank@2314 | 50 | #include "services/threadService.hpp" |
stefank@2314 | 51 | #include "utilities/defaultStream.hpp" |
stefank@2314 | 52 | #include "utilities/events.hpp" |
stefank@2314 | 53 | #ifdef TARGET_OS_FAMILY_linux |
stefank@2314 | 54 | # include "os_linux.inline.hpp" |
stefank@2314 | 55 | #endif |
stefank@2314 | 56 | #ifdef TARGET_OS_FAMILY_solaris |
stefank@2314 | 57 | # include "os_solaris.inline.hpp" |
stefank@2314 | 58 | #endif |
stefank@2314 | 59 | #ifdef TARGET_OS_FAMILY_windows |
stefank@2314 | 60 | # include "os_windows.inline.hpp" |
stefank@2314 | 61 | #endif |
never@3156 | 62 | #ifdef TARGET_OS_FAMILY_bsd |
never@3156 | 63 | # include "os_bsd.inline.hpp" |
never@3156 | 64 | #endif |
duke@435 | 65 | |
duke@435 | 66 | # include <signal.h> |
duke@435 | 67 | |
duke@435 | 68 | OSThread* os::_starting_thread = NULL; |
duke@435 | 69 | address os::_polling_page = NULL; |
duke@435 | 70 | volatile int32_t* os::_mem_serialize_page = NULL; |
duke@435 | 71 | uintptr_t os::_serialize_page_mask = 0; |
duke@435 | 72 | long os::_rand_seed = 1; |
duke@435 | 73 | int os::_processor_count = 0; |
duke@435 | 74 | size_t os::_page_sizes[os::page_sizes_max]; |
duke@435 | 75 | |
duke@435 | 76 | #ifndef PRODUCT |
kvn@2557 | 77 | julong os::num_mallocs = 0; // # of calls to malloc/realloc |
kvn@2557 | 78 | julong os::alloc_bytes = 0; // # of bytes allocated |
kvn@2557 | 79 | julong os::num_frees = 0; // # of calls to free |
kvn@2557 | 80 | julong os::free_bytes = 0; // # of bytes freed |
duke@435 | 81 | #endif |
duke@435 | 82 | |
phh@3378 | 83 | void os_init_globals() { |
phh@3378 | 84 | // Called from init_globals(). |
phh@3378 | 85 | // See Threads::create_vm() in thread.cpp, and init.cpp. |
phh@3378 | 86 | os::init_globals(); |
phh@3378 | 87 | } |
phh@3378 | 88 | |
duke@435 | 89 | // Fill in buffer with current local time as an ISO-8601 string. |
duke@435 | 90 | // E.g., yyyy-mm-ddThh:mm:ss-zzzz. |
duke@435 | 91 | // Returns buffer, or NULL if it failed. |
duke@435 | 92 | // This would mostly be a call to |
duke@435 | 93 | // strftime(...., "%Y-%m-%d" "T" "%H:%M:%S" "%z", ....) |
duke@435 | 94 | // except that on Windows the %z behaves badly, so we do it ourselves. |
duke@435 | 95 | // Also, people wanted milliseconds on there, |
duke@435 | 96 | // and strftime doesn't do milliseconds. |
duke@435 | 97 | char* os::iso8601_time(char* buffer, size_t buffer_length) { |
duke@435 | 98 | // Output will be of the form "YYYY-MM-DDThh:mm:ss.mmm+zzzz\0" |
duke@435 | 99 | // 1 2 |
duke@435 | 100 | // 12345678901234567890123456789 |
duke@435 | 101 | static const char* iso8601_format = |
duke@435 | 102 | "%04d-%02d-%02dT%02d:%02d:%02d.%03d%c%02d%02d"; |
duke@435 | 103 | static const size_t needed_buffer = 29; |
duke@435 | 104 | |
duke@435 | 105 | // Sanity check the arguments |
duke@435 | 106 | if (buffer == NULL) { |
duke@435 | 107 | assert(false, "NULL buffer"); |
duke@435 | 108 | return NULL; |
duke@435 | 109 | } |
duke@435 | 110 | if (buffer_length < needed_buffer) { |
duke@435 | 111 | assert(false, "buffer_length too small"); |
duke@435 | 112 | return NULL; |
duke@435 | 113 | } |
duke@435 | 114 | // Get the current time |
sbohne@496 | 115 | jlong milliseconds_since_19700101 = javaTimeMillis(); |
duke@435 | 116 | const int milliseconds_per_microsecond = 1000; |
duke@435 | 117 | const time_t seconds_since_19700101 = |
duke@435 | 118 | milliseconds_since_19700101 / milliseconds_per_microsecond; |
duke@435 | 119 | const int milliseconds_after_second = |
duke@435 | 120 | milliseconds_since_19700101 % milliseconds_per_microsecond; |
duke@435 | 121 | // Convert the time value to a tm and timezone variable |
ysr@983 | 122 | struct tm time_struct; |
ysr@983 | 123 | if (localtime_pd(&seconds_since_19700101, &time_struct) == NULL) { |
ysr@983 | 124 | assert(false, "Failed localtime_pd"); |
duke@435 | 125 | return NULL; |
duke@435 | 126 | } |
never@3156 | 127 | #if defined(_ALLBSD_SOURCE) |
never@3156 | 128 | const time_t zone = (time_t) time_struct.tm_gmtoff; |
never@3156 | 129 | #else |
duke@435 | 130 | const time_t zone = timezone; |
never@3156 | 131 | #endif |
duke@435 | 132 | |
duke@435 | 133 | // If daylight savings time is in effect, |
duke@435 | 134 | // we are 1 hour East of our time zone |
duke@435 | 135 | const time_t seconds_per_minute = 60; |
duke@435 | 136 | const time_t minutes_per_hour = 60; |
duke@435 | 137 | const time_t seconds_per_hour = seconds_per_minute * minutes_per_hour; |
duke@435 | 138 | time_t UTC_to_local = zone; |
duke@435 | 139 | if (time_struct.tm_isdst > 0) { |
duke@435 | 140 | UTC_to_local = UTC_to_local - seconds_per_hour; |
duke@435 | 141 | } |
duke@435 | 142 | // Compute the time zone offset. |
ysr@983 | 143 | // localtime_pd() sets timezone to the difference (in seconds) |
duke@435 | 144 | // between UTC and and local time. |
duke@435 | 145 | // ISO 8601 says we need the difference between local time and UTC, |
ysr@983 | 146 | // we change the sign of the localtime_pd() result. |
duke@435 | 147 | const time_t local_to_UTC = -(UTC_to_local); |
duke@435 | 148 | // Then we have to figure out if if we are ahead (+) or behind (-) UTC. |
duke@435 | 149 | char sign_local_to_UTC = '+'; |
duke@435 | 150 | time_t abs_local_to_UTC = local_to_UTC; |
duke@435 | 151 | if (local_to_UTC < 0) { |
duke@435 | 152 | sign_local_to_UTC = '-'; |
duke@435 | 153 | abs_local_to_UTC = -(abs_local_to_UTC); |
duke@435 | 154 | } |
duke@435 | 155 | // Convert time zone offset seconds to hours and minutes. |
duke@435 | 156 | const time_t zone_hours = (abs_local_to_UTC / seconds_per_hour); |
duke@435 | 157 | const time_t zone_min = |
duke@435 | 158 | ((abs_local_to_UTC % seconds_per_hour) / seconds_per_minute); |
duke@435 | 159 | |
duke@435 | 160 | // Print an ISO 8601 date and time stamp into the buffer |
duke@435 | 161 | const int year = 1900 + time_struct.tm_year; |
duke@435 | 162 | const int month = 1 + time_struct.tm_mon; |
duke@435 | 163 | const int printed = jio_snprintf(buffer, buffer_length, iso8601_format, |
duke@435 | 164 | year, |
duke@435 | 165 | month, |
duke@435 | 166 | time_struct.tm_mday, |
duke@435 | 167 | time_struct.tm_hour, |
duke@435 | 168 | time_struct.tm_min, |
duke@435 | 169 | time_struct.tm_sec, |
duke@435 | 170 | milliseconds_after_second, |
duke@435 | 171 | sign_local_to_UTC, |
duke@435 | 172 | zone_hours, |
duke@435 | 173 | zone_min); |
duke@435 | 174 | if (printed == 0) { |
duke@435 | 175 | assert(false, "Failed jio_printf"); |
duke@435 | 176 | return NULL; |
duke@435 | 177 | } |
duke@435 | 178 | return buffer; |
duke@435 | 179 | } |
duke@435 | 180 | |
duke@435 | 181 | OSReturn os::set_priority(Thread* thread, ThreadPriority p) { |
duke@435 | 182 | #ifdef ASSERT |
duke@435 | 183 | if (!(!thread->is_Java_thread() || |
duke@435 | 184 | Thread::current() == thread || |
duke@435 | 185 | Threads_lock->owned_by_self() |
duke@435 | 186 | || thread->is_Compiler_thread() |
duke@435 | 187 | )) { |
duke@435 | 188 | assert(false, "possibility of dangling Thread pointer"); |
duke@435 | 189 | } |
duke@435 | 190 | #endif |
duke@435 | 191 | |
duke@435 | 192 | if (p >= MinPriority && p <= MaxPriority) { |
duke@435 | 193 | int priority = java_to_os_priority[p]; |
duke@435 | 194 | return set_native_priority(thread, priority); |
duke@435 | 195 | } else { |
duke@435 | 196 | assert(false, "Should not happen"); |
duke@435 | 197 | return OS_ERR; |
duke@435 | 198 | } |
duke@435 | 199 | } |
duke@435 | 200 | |
dholmes@4077 | 201 | // The mapping from OS priority back to Java priority may be inexact because |
dholmes@4077 | 202 | // Java priorities can map M:1 with native priorities. If you want the definite |
dholmes@4077 | 203 | // Java priority then use JavaThread::java_priority() |
duke@435 | 204 | OSReturn os::get_priority(const Thread* const thread, ThreadPriority& priority) { |
duke@435 | 205 | int p; |
duke@435 | 206 | int os_prio; |
duke@435 | 207 | OSReturn ret = get_native_priority(thread, &os_prio); |
duke@435 | 208 | if (ret != OS_OK) return ret; |
duke@435 | 209 | |
dholmes@4077 | 210 | if (java_to_os_priority[MaxPriority] > java_to_os_priority[MinPriority]) { |
dholmes@4077 | 211 | for (p = MaxPriority; p > MinPriority && java_to_os_priority[p] > os_prio; p--) ; |
dholmes@4077 | 212 | } else { |
dholmes@4077 | 213 | // niceness values are in reverse order |
dholmes@4077 | 214 | for (p = MaxPriority; p > MinPriority && java_to_os_priority[p] < os_prio; p--) ; |
dholmes@4077 | 215 | } |
duke@435 | 216 | priority = (ThreadPriority)p; |
duke@435 | 217 | return OS_OK; |
duke@435 | 218 | } |
duke@435 | 219 | |
duke@435 | 220 | |
duke@435 | 221 | // --------------------- sun.misc.Signal (optional) --------------------- |
duke@435 | 222 | |
duke@435 | 223 | |
duke@435 | 224 | // SIGBREAK is sent by the keyboard to query the VM state |
duke@435 | 225 | #ifndef SIGBREAK |
duke@435 | 226 | #define SIGBREAK SIGQUIT |
duke@435 | 227 | #endif |
duke@435 | 228 | |
duke@435 | 229 | // sigexitnum_pd is a platform-specific special signal used for terminating the Signal thread. |
duke@435 | 230 | |
duke@435 | 231 | |
duke@435 | 232 | static void signal_thread_entry(JavaThread* thread, TRAPS) { |
duke@435 | 233 | os::set_priority(thread, NearMaxPriority); |
duke@435 | 234 | while (true) { |
duke@435 | 235 | int sig; |
duke@435 | 236 | { |
duke@435 | 237 | // FIXME : Currently we have not decieded what should be the status |
duke@435 | 238 | // for this java thread blocked here. Once we decide about |
duke@435 | 239 | // that we should fix this. |
duke@435 | 240 | sig = os::signal_wait(); |
duke@435 | 241 | } |
duke@435 | 242 | if (sig == os::sigexitnum_pd()) { |
duke@435 | 243 | // Terminate the signal thread |
duke@435 | 244 | return; |
duke@435 | 245 | } |
duke@435 | 246 | |
duke@435 | 247 | switch (sig) { |
duke@435 | 248 | case SIGBREAK: { |
duke@435 | 249 | // Check if the signal is a trigger to start the Attach Listener - in that |
duke@435 | 250 | // case don't print stack traces. |
duke@435 | 251 | if (!DisableAttachMechanism && AttachListener::is_init_trigger()) { |
duke@435 | 252 | continue; |
duke@435 | 253 | } |
duke@435 | 254 | // Print stack traces |
duke@435 | 255 | // Any SIGBREAK operations added here should make sure to flush |
duke@435 | 256 | // the output stream (e.g. tty->flush()) after output. See 4803766. |
duke@435 | 257 | // Each module also prints an extra carriage return after its output. |
duke@435 | 258 | VM_PrintThreads op; |
duke@435 | 259 | VMThread::execute(&op); |
duke@435 | 260 | VM_PrintJNI jni_op; |
duke@435 | 261 | VMThread::execute(&jni_op); |
duke@435 | 262 | VM_FindDeadlocks op1(tty); |
duke@435 | 263 | VMThread::execute(&op1); |
duke@435 | 264 | Universe::print_heap_at_SIGBREAK(); |
duke@435 | 265 | if (PrintClassHistogram) { |
ysr@1050 | 266 | VM_GC_HeapInspection op1(gclog_or_tty, true /* force full GC before heap inspection */, |
ysr@1050 | 267 | true /* need_prologue */); |
duke@435 | 268 | VMThread::execute(&op1); |
duke@435 | 269 | } |
duke@435 | 270 | if (JvmtiExport::should_post_data_dump()) { |
duke@435 | 271 | JvmtiExport::post_data_dump(); |
duke@435 | 272 | } |
duke@435 | 273 | break; |
duke@435 | 274 | } |
duke@435 | 275 | default: { |
duke@435 | 276 | // Dispatch the signal to java |
duke@435 | 277 | HandleMark hm(THREAD); |
coleenp@4037 | 278 | Klass* k = SystemDictionary::resolve_or_null(vmSymbols::sun_misc_Signal(), THREAD); |
duke@435 | 279 | KlassHandle klass (THREAD, k); |
duke@435 | 280 | if (klass.not_null()) { |
duke@435 | 281 | JavaValue result(T_VOID); |
duke@435 | 282 | JavaCallArguments args; |
duke@435 | 283 | args.push_int(sig); |
duke@435 | 284 | JavaCalls::call_static( |
duke@435 | 285 | &result, |
duke@435 | 286 | klass, |
coleenp@2497 | 287 | vmSymbols::dispatch_name(), |
coleenp@2497 | 288 | vmSymbols::int_void_signature(), |
duke@435 | 289 | &args, |
duke@435 | 290 | THREAD |
duke@435 | 291 | ); |
duke@435 | 292 | } |
duke@435 | 293 | if (HAS_PENDING_EXCEPTION) { |
duke@435 | 294 | // tty is initialized early so we don't expect it to be null, but |
duke@435 | 295 | // if it is we can't risk doing an initialization that might |
duke@435 | 296 | // trigger additional out-of-memory conditions |
duke@435 | 297 | if (tty != NULL) { |
duke@435 | 298 | char klass_name[256]; |
duke@435 | 299 | char tmp_sig_name[16]; |
duke@435 | 300 | const char* sig_name = "UNKNOWN"; |
coleenp@4037 | 301 | InstanceKlass::cast(PENDING_EXCEPTION->klass())-> |
duke@435 | 302 | name()->as_klass_external_name(klass_name, 256); |
duke@435 | 303 | if (os::exception_name(sig, tmp_sig_name, 16) != NULL) |
duke@435 | 304 | sig_name = tmp_sig_name; |
duke@435 | 305 | warning("Exception %s occurred dispatching signal %s to handler" |
duke@435 | 306 | "- the VM may need to be forcibly terminated", |
duke@435 | 307 | klass_name, sig_name ); |
duke@435 | 308 | } |
duke@435 | 309 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 310 | } |
duke@435 | 311 | } |
duke@435 | 312 | } |
duke@435 | 313 | } |
duke@435 | 314 | } |
duke@435 | 315 | |
duke@435 | 316 | |
duke@435 | 317 | void os::signal_init() { |
duke@435 | 318 | if (!ReduceSignalUsage) { |
duke@435 | 319 | // Setup JavaThread for processing signals |
duke@435 | 320 | EXCEPTION_MARK; |
coleenp@4037 | 321 | Klass* k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_Thread(), true, CHECK); |
duke@435 | 322 | instanceKlassHandle klass (THREAD, k); |
duke@435 | 323 | instanceHandle thread_oop = klass->allocate_instance_handle(CHECK); |
duke@435 | 324 | |
duke@435 | 325 | const char thread_name[] = "Signal Dispatcher"; |
duke@435 | 326 | Handle string = java_lang_String::create_from_str(thread_name, CHECK); |
duke@435 | 327 | |
duke@435 | 328 | // Initialize thread_oop to put it into the system threadGroup |
duke@435 | 329 | Handle thread_group (THREAD, Universe::system_thread_group()); |
duke@435 | 330 | JavaValue result(T_VOID); |
duke@435 | 331 | JavaCalls::call_special(&result, thread_oop, |
duke@435 | 332 | klass, |
coleenp@2497 | 333 | vmSymbols::object_initializer_name(), |
coleenp@2497 | 334 | vmSymbols::threadgroup_string_void_signature(), |
duke@435 | 335 | thread_group, |
duke@435 | 336 | string, |
duke@435 | 337 | CHECK); |
duke@435 | 338 | |
never@1577 | 339 | KlassHandle group(THREAD, SystemDictionary::ThreadGroup_klass()); |
duke@435 | 340 | JavaCalls::call_special(&result, |
duke@435 | 341 | thread_group, |
duke@435 | 342 | group, |
coleenp@2497 | 343 | vmSymbols::add_method_name(), |
coleenp@2497 | 344 | vmSymbols::thread_void_signature(), |
duke@435 | 345 | thread_oop, // ARG 1 |
duke@435 | 346 | CHECK); |
duke@435 | 347 | |
duke@435 | 348 | os::signal_init_pd(); |
duke@435 | 349 | |
duke@435 | 350 | { MutexLocker mu(Threads_lock); |
duke@435 | 351 | JavaThread* signal_thread = new JavaThread(&signal_thread_entry); |
duke@435 | 352 | |
duke@435 | 353 | // At this point it may be possible that no osthread was created for the |
duke@435 | 354 | // JavaThread due to lack of memory. We would have to throw an exception |
duke@435 | 355 | // in that case. However, since this must work and we do not allow |
duke@435 | 356 | // exceptions anyway, check and abort if this fails. |
duke@435 | 357 | if (signal_thread == NULL || signal_thread->osthread() == NULL) { |
duke@435 | 358 | vm_exit_during_initialization("java.lang.OutOfMemoryError", |
duke@435 | 359 | "unable to create new native thread"); |
duke@435 | 360 | } |
duke@435 | 361 | |
duke@435 | 362 | java_lang_Thread::set_thread(thread_oop(), signal_thread); |
duke@435 | 363 | java_lang_Thread::set_priority(thread_oop(), NearMaxPriority); |
duke@435 | 364 | java_lang_Thread::set_daemon(thread_oop()); |
duke@435 | 365 | |
duke@435 | 366 | signal_thread->set_threadObj(thread_oop()); |
duke@435 | 367 | Threads::add(signal_thread); |
duke@435 | 368 | Thread::start(signal_thread); |
duke@435 | 369 | } |
duke@435 | 370 | // Handle ^BREAK |
duke@435 | 371 | os::signal(SIGBREAK, os::user_handler()); |
duke@435 | 372 | } |
duke@435 | 373 | } |
duke@435 | 374 | |
duke@435 | 375 | |
duke@435 | 376 | void os::terminate_signal_thread() { |
duke@435 | 377 | if (!ReduceSignalUsage) |
duke@435 | 378 | signal_notify(sigexitnum_pd()); |
duke@435 | 379 | } |
duke@435 | 380 | |
duke@435 | 381 | |
duke@435 | 382 | // --------------------- loading libraries --------------------- |
duke@435 | 383 | |
duke@435 | 384 | typedef jint (JNICALL *JNI_OnLoad_t)(JavaVM *, void *); |
duke@435 | 385 | extern struct JavaVM_ main_vm; |
duke@435 | 386 | |
duke@435 | 387 | static void* _native_java_library = NULL; |
duke@435 | 388 | |
duke@435 | 389 | void* os::native_java_library() { |
duke@435 | 390 | if (_native_java_library == NULL) { |
duke@435 | 391 | char buffer[JVM_MAXPATHLEN]; |
duke@435 | 392 | char ebuf[1024]; |
duke@435 | 393 | |
kamg@677 | 394 | // Try to load verify dll first. In 1.3 java dll depends on it and is not |
kamg@677 | 395 | // always able to find it when the loading executable is outside the JDK. |
duke@435 | 396 | // In order to keep working with 1.2 we ignore any loading errors. |
bpittore@4261 | 397 | if (dll_build_name(buffer, sizeof(buffer), Arguments::get_dll_dir(), |
bpittore@4261 | 398 | "verify")) { |
bpittore@4261 | 399 | dll_load(buffer, ebuf, sizeof(ebuf)); |
bpittore@4261 | 400 | } |
duke@435 | 401 | |
duke@435 | 402 | // Load java dll |
bpittore@4261 | 403 | if (dll_build_name(buffer, sizeof(buffer), Arguments::get_dll_dir(), |
bpittore@4261 | 404 | "java")) { |
bpittore@4261 | 405 | _native_java_library = dll_load(buffer, ebuf, sizeof(ebuf)); |
bpittore@4261 | 406 | } |
duke@435 | 407 | if (_native_java_library == NULL) { |
duke@435 | 408 | vm_exit_during_initialization("Unable to load native library", ebuf); |
duke@435 | 409 | } |
never@3156 | 410 | |
never@3156 | 411 | #if defined(__OpenBSD__) |
never@3156 | 412 | // Work-around OpenBSD's lack of $ORIGIN support by pre-loading libnet.so |
never@3156 | 413 | // ignore errors |
bpittore@4261 | 414 | if (dll_build_name(buffer, sizeof(buffer), Arguments::get_dll_dir(), |
bpittore@4261 | 415 | "net")) { |
bpittore@4261 | 416 | dll_load(buffer, ebuf, sizeof(ebuf)); |
bpittore@4261 | 417 | } |
never@3156 | 418 | #endif |
kamg@677 | 419 | } |
kamg@677 | 420 | static jboolean onLoaded = JNI_FALSE; |
kamg@677 | 421 | if (onLoaded) { |
kamg@677 | 422 | // We may have to wait to fire OnLoad until TLS is initialized. |
kamg@677 | 423 | if (ThreadLocalStorage::is_initialized()) { |
kamg@677 | 424 | // The JNI_OnLoad handling is normally done by method load in |
kamg@677 | 425 | // java.lang.ClassLoader$NativeLibrary, but the VM loads the base library |
kamg@677 | 426 | // explicitly so we have to check for JNI_OnLoad as well |
kamg@677 | 427 | const char *onLoadSymbols[] = JNI_ONLOAD_SYMBOLS; |
kamg@677 | 428 | JNI_OnLoad_t JNI_OnLoad = CAST_TO_FN_PTR( |
kamg@677 | 429 | JNI_OnLoad_t, dll_lookup(_native_java_library, onLoadSymbols[0])); |
kamg@677 | 430 | if (JNI_OnLoad != NULL) { |
kamg@677 | 431 | JavaThread* thread = JavaThread::current(); |
kamg@677 | 432 | ThreadToNativeFromVM ttn(thread); |
kamg@677 | 433 | HandleMark hm(thread); |
kamg@677 | 434 | jint ver = (*JNI_OnLoad)(&main_vm, NULL); |
kamg@677 | 435 | onLoaded = JNI_TRUE; |
kamg@677 | 436 | if (!Threads::is_supported_jni_version_including_1_1(ver)) { |
kamg@677 | 437 | vm_exit_during_initialization("Unsupported JNI version"); |
kamg@677 | 438 | } |
duke@435 | 439 | } |
duke@435 | 440 | } |
duke@435 | 441 | } |
duke@435 | 442 | return _native_java_library; |
duke@435 | 443 | } |
duke@435 | 444 | |
duke@435 | 445 | // --------------------- heap allocation utilities --------------------- |
duke@435 | 446 | |
zgu@3900 | 447 | char *os::strdup(const char *str, MEMFLAGS flags) { |
duke@435 | 448 | size_t size = strlen(str); |
zgu@3900 | 449 | char *dup_str = (char *)malloc(size + 1, flags); |
duke@435 | 450 | if (dup_str == NULL) return NULL; |
duke@435 | 451 | strcpy(dup_str, str); |
duke@435 | 452 | return dup_str; |
duke@435 | 453 | } |
duke@435 | 454 | |
duke@435 | 455 | |
duke@435 | 456 | |
duke@435 | 457 | #ifdef ASSERT |
duke@435 | 458 | #define space_before (MallocCushion + sizeof(double)) |
duke@435 | 459 | #define space_after MallocCushion |
duke@435 | 460 | #define size_addr_from_base(p) (size_t*)(p + space_before - sizeof(size_t)) |
duke@435 | 461 | #define size_addr_from_obj(p) ((size_t*)p - 1) |
duke@435 | 462 | // MallocCushion: size of extra cushion allocated around objects with +UseMallocOnly |
duke@435 | 463 | // NB: cannot be debug variable, because these aren't set from the command line until |
duke@435 | 464 | // *after* the first few allocs already happened |
duke@435 | 465 | #define MallocCushion 16 |
duke@435 | 466 | #else |
duke@435 | 467 | #define space_before 0 |
duke@435 | 468 | #define space_after 0 |
duke@435 | 469 | #define size_addr_from_base(p) should not use w/o ASSERT |
duke@435 | 470 | #define size_addr_from_obj(p) should not use w/o ASSERT |
duke@435 | 471 | #define MallocCushion 0 |
duke@435 | 472 | #endif |
duke@435 | 473 | #define paranoid 0 /* only set to 1 if you suspect checking code has bug */ |
duke@435 | 474 | |
duke@435 | 475 | #ifdef ASSERT |
duke@435 | 476 | inline size_t get_size(void* obj) { |
duke@435 | 477 | size_t size = *size_addr_from_obj(obj); |
jcoomes@1845 | 478 | if (size < 0) { |
jcoomes@1845 | 479 | fatal(err_msg("free: size field of object #" PTR_FORMAT " was overwritten (" |
jcoomes@1845 | 480 | SIZE_FORMAT ")", obj, size)); |
jcoomes@1845 | 481 | } |
duke@435 | 482 | return size; |
duke@435 | 483 | } |
duke@435 | 484 | |
duke@435 | 485 | u_char* find_cushion_backwards(u_char* start) { |
duke@435 | 486 | u_char* p = start; |
duke@435 | 487 | while (p[ 0] != badResourceValue || p[-1] != badResourceValue || |
duke@435 | 488 | p[-2] != badResourceValue || p[-3] != badResourceValue) p--; |
duke@435 | 489 | // ok, we have four consecutive marker bytes; find start |
duke@435 | 490 | u_char* q = p - 4; |
duke@435 | 491 | while (*q == badResourceValue) q--; |
duke@435 | 492 | return q + 1; |
duke@435 | 493 | } |
duke@435 | 494 | |
duke@435 | 495 | u_char* find_cushion_forwards(u_char* start) { |
duke@435 | 496 | u_char* p = start; |
duke@435 | 497 | while (p[0] != badResourceValue || p[1] != badResourceValue || |
duke@435 | 498 | p[2] != badResourceValue || p[3] != badResourceValue) p++; |
duke@435 | 499 | // ok, we have four consecutive marker bytes; find end of cushion |
duke@435 | 500 | u_char* q = p + 4; |
duke@435 | 501 | while (*q == badResourceValue) q++; |
duke@435 | 502 | return q - MallocCushion; |
duke@435 | 503 | } |
duke@435 | 504 | |
duke@435 | 505 | void print_neighbor_blocks(void* ptr) { |
duke@435 | 506 | // find block allocated before ptr (not entirely crash-proof) |
duke@435 | 507 | if (MallocCushion < 4) { |
duke@435 | 508 | tty->print_cr("### cannot find previous block (MallocCushion < 4)"); |
duke@435 | 509 | return; |
duke@435 | 510 | } |
duke@435 | 511 | u_char* start_of_this_block = (u_char*)ptr - space_before; |
duke@435 | 512 | u_char* end_of_prev_block_data = start_of_this_block - space_after -1; |
duke@435 | 513 | // look for cushion in front of prev. block |
duke@435 | 514 | u_char* start_of_prev_block = find_cushion_backwards(end_of_prev_block_data); |
duke@435 | 515 | ptrdiff_t size = *size_addr_from_base(start_of_prev_block); |
duke@435 | 516 | u_char* obj = start_of_prev_block + space_before; |
duke@435 | 517 | if (size <= 0 ) { |
duke@435 | 518 | // start is bad; mayhave been confused by OS data inbetween objects |
duke@435 | 519 | // search one more backwards |
duke@435 | 520 | start_of_prev_block = find_cushion_backwards(start_of_prev_block); |
duke@435 | 521 | size = *size_addr_from_base(start_of_prev_block); |
duke@435 | 522 | obj = start_of_prev_block + space_before; |
duke@435 | 523 | } |
duke@435 | 524 | |
duke@435 | 525 | if (start_of_prev_block + space_before + size + space_after == start_of_this_block) { |
kvn@2557 | 526 | tty->print_cr("### previous object: " PTR_FORMAT " (" SSIZE_FORMAT " bytes)", obj, size); |
duke@435 | 527 | } else { |
kvn@2557 | 528 | tty->print_cr("### previous object (not sure if correct): " PTR_FORMAT " (" SSIZE_FORMAT " bytes)", obj, size); |
duke@435 | 529 | } |
duke@435 | 530 | |
duke@435 | 531 | // now find successor block |
duke@435 | 532 | u_char* start_of_next_block = (u_char*)ptr + *size_addr_from_obj(ptr) + space_after; |
duke@435 | 533 | start_of_next_block = find_cushion_forwards(start_of_next_block); |
duke@435 | 534 | u_char* next_obj = start_of_next_block + space_before; |
duke@435 | 535 | ptrdiff_t next_size = *size_addr_from_base(start_of_next_block); |
duke@435 | 536 | if (start_of_next_block[0] == badResourceValue && |
duke@435 | 537 | start_of_next_block[1] == badResourceValue && |
duke@435 | 538 | start_of_next_block[2] == badResourceValue && |
duke@435 | 539 | start_of_next_block[3] == badResourceValue) { |
kvn@2557 | 540 | tty->print_cr("### next object: " PTR_FORMAT " (" SSIZE_FORMAT " bytes)", next_obj, next_size); |
duke@435 | 541 | } else { |
kvn@2557 | 542 | tty->print_cr("### next object (not sure if correct): " PTR_FORMAT " (" SSIZE_FORMAT " bytes)", next_obj, next_size); |
duke@435 | 543 | } |
duke@435 | 544 | } |
duke@435 | 545 | |
duke@435 | 546 | |
duke@435 | 547 | void report_heap_error(void* memblock, void* bad, const char* where) { |
kvn@2557 | 548 | tty->print_cr("## nof_mallocs = " UINT64_FORMAT ", nof_frees = " UINT64_FORMAT, os::num_mallocs, os::num_frees); |
kvn@2557 | 549 | tty->print_cr("## memory stomp: byte at " PTR_FORMAT " %s object " PTR_FORMAT, bad, where, memblock); |
duke@435 | 550 | print_neighbor_blocks(memblock); |
duke@435 | 551 | fatal("memory stomping error"); |
duke@435 | 552 | } |
duke@435 | 553 | |
duke@435 | 554 | void verify_block(void* memblock) { |
duke@435 | 555 | size_t size = get_size(memblock); |
duke@435 | 556 | if (MallocCushion) { |
duke@435 | 557 | u_char* ptr = (u_char*)memblock - space_before; |
duke@435 | 558 | for (int i = 0; i < MallocCushion; i++) { |
duke@435 | 559 | if (ptr[i] != badResourceValue) { |
duke@435 | 560 | report_heap_error(memblock, ptr+i, "in front of"); |
duke@435 | 561 | } |
duke@435 | 562 | } |
duke@435 | 563 | u_char* end = (u_char*)memblock + size + space_after; |
duke@435 | 564 | for (int j = -MallocCushion; j < 0; j++) { |
duke@435 | 565 | if (end[j] != badResourceValue) { |
duke@435 | 566 | report_heap_error(memblock, end+j, "after"); |
duke@435 | 567 | } |
duke@435 | 568 | } |
duke@435 | 569 | } |
duke@435 | 570 | } |
duke@435 | 571 | #endif |
duke@435 | 572 | |
zgu@3900 | 573 | void* os::malloc(size_t size, MEMFLAGS memflags, address caller) { |
kvn@2557 | 574 | NOT_PRODUCT(inc_stat_counter(&num_mallocs, 1)); |
kvn@2557 | 575 | NOT_PRODUCT(inc_stat_counter(&alloc_bytes, size)); |
duke@435 | 576 | |
duke@435 | 577 | if (size == 0) { |
duke@435 | 578 | // return a valid pointer if size is zero |
duke@435 | 579 | // if NULL is returned the calling functions assume out of memory. |
duke@435 | 580 | size = 1; |
duke@435 | 581 | } |
hseigel@4277 | 582 | if (size > size + space_before + space_after) { // Check for rollover. |
hseigel@4277 | 583 | return NULL; |
hseigel@4277 | 584 | } |
duke@435 | 585 | NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap()); |
duke@435 | 586 | u_char* ptr = (u_char*)::malloc(size + space_before + space_after); |
zgu@3900 | 587 | |
duke@435 | 588 | #ifdef ASSERT |
duke@435 | 589 | if (ptr == NULL) return NULL; |
duke@435 | 590 | if (MallocCushion) { |
duke@435 | 591 | for (u_char* p = ptr; p < ptr + MallocCushion; p++) *p = (u_char)badResourceValue; |
duke@435 | 592 | u_char* end = ptr + space_before + size; |
duke@435 | 593 | for (u_char* pq = ptr+MallocCushion; pq < end; pq++) *pq = (u_char)uninitBlockPad; |
duke@435 | 594 | for (u_char* q = end; q < end + MallocCushion; q++) *q = (u_char)badResourceValue; |
duke@435 | 595 | } |
duke@435 | 596 | // put size just before data |
duke@435 | 597 | *size_addr_from_base(ptr) = size; |
duke@435 | 598 | #endif |
duke@435 | 599 | u_char* memblock = ptr + space_before; |
duke@435 | 600 | if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) { |
kvn@2557 | 601 | tty->print_cr("os::malloc caught, " SIZE_FORMAT " bytes --> " PTR_FORMAT, size, memblock); |
duke@435 | 602 | breakpoint(); |
duke@435 | 603 | } |
duke@435 | 604 | debug_only(if (paranoid) verify_block(memblock)); |
kvn@2557 | 605 | if (PrintMalloc && tty != NULL) tty->print_cr("os::malloc " SIZE_FORMAT " bytes --> " PTR_FORMAT, size, memblock); |
zgu@3900 | 606 | |
zgu@3900 | 607 | // we do not track MallocCushion memory |
zgu@3900 | 608 | MemTracker::record_malloc((address)memblock, size, memflags, caller == 0 ? CALLER_PC : caller); |
zgu@3900 | 609 | |
duke@435 | 610 | return memblock; |
duke@435 | 611 | } |
duke@435 | 612 | |
duke@435 | 613 | |
zgu@3900 | 614 | void* os::realloc(void *memblock, size_t size, MEMFLAGS memflags, address caller) { |
duke@435 | 615 | #ifndef ASSERT |
kvn@2557 | 616 | NOT_PRODUCT(inc_stat_counter(&num_mallocs, 1)); |
kvn@2557 | 617 | NOT_PRODUCT(inc_stat_counter(&alloc_bytes, size)); |
zgu@3900 | 618 | void* ptr = ::realloc(memblock, size); |
zgu@4193 | 619 | if (ptr != NULL) { |
zgu@3900 | 620 | MemTracker::record_realloc((address)memblock, (address)ptr, size, memflags, |
zgu@3900 | 621 | caller == 0 ? CALLER_PC : caller); |
zgu@3900 | 622 | } |
zgu@3900 | 623 | return ptr; |
duke@435 | 624 | #else |
duke@435 | 625 | if (memblock == NULL) { |
zgu@3900 | 626 | return malloc(size, memflags, (caller == 0 ? CALLER_PC : caller)); |
duke@435 | 627 | } |
duke@435 | 628 | if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) { |
kvn@2557 | 629 | tty->print_cr("os::realloc caught " PTR_FORMAT, memblock); |
duke@435 | 630 | breakpoint(); |
duke@435 | 631 | } |
duke@435 | 632 | verify_block(memblock); |
duke@435 | 633 | NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap()); |
duke@435 | 634 | if (size == 0) return NULL; |
duke@435 | 635 | // always move the block |
zgu@3900 | 636 | void* ptr = malloc(size, memflags, caller == 0 ? CALLER_PC : caller); |
kvn@2557 | 637 | if (PrintMalloc) tty->print_cr("os::remalloc " SIZE_FORMAT " bytes, " PTR_FORMAT " --> " PTR_FORMAT, size, memblock, ptr); |
duke@435 | 638 | // Copy to new memory if malloc didn't fail |
duke@435 | 639 | if ( ptr != NULL ) { |
duke@435 | 640 | memcpy(ptr, memblock, MIN2(size, get_size(memblock))); |
duke@435 | 641 | if (paranoid) verify_block(ptr); |
duke@435 | 642 | if ((intptr_t)ptr == (intptr_t)MallocCatchPtr) { |
kvn@2557 | 643 | tty->print_cr("os::realloc caught, " SIZE_FORMAT " bytes --> " PTR_FORMAT, size, ptr); |
duke@435 | 644 | breakpoint(); |
duke@435 | 645 | } |
duke@435 | 646 | free(memblock); |
duke@435 | 647 | } |
duke@435 | 648 | return ptr; |
duke@435 | 649 | #endif |
duke@435 | 650 | } |
duke@435 | 651 | |
duke@435 | 652 | |
zgu@3900 | 653 | void os::free(void *memblock, MEMFLAGS memflags) { |
kvn@2557 | 654 | NOT_PRODUCT(inc_stat_counter(&num_frees, 1)); |
duke@435 | 655 | #ifdef ASSERT |
duke@435 | 656 | if (memblock == NULL) return; |
duke@435 | 657 | if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) { |
kvn@2557 | 658 | if (tty != NULL) tty->print_cr("os::free caught " PTR_FORMAT, memblock); |
duke@435 | 659 | breakpoint(); |
duke@435 | 660 | } |
duke@435 | 661 | verify_block(memblock); |
duke@435 | 662 | NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap()); |
duke@435 | 663 | // Added by detlefs. |
duke@435 | 664 | if (MallocCushion) { |
duke@435 | 665 | u_char* ptr = (u_char*)memblock - space_before; |
duke@435 | 666 | for (u_char* p = ptr; p < ptr + MallocCushion; p++) { |
duke@435 | 667 | guarantee(*p == badResourceValue, |
duke@435 | 668 | "Thing freed should be malloc result."); |
duke@435 | 669 | *p = (u_char)freeBlockPad; |
duke@435 | 670 | } |
duke@435 | 671 | size_t size = get_size(memblock); |
kvn@2557 | 672 | inc_stat_counter(&free_bytes, size); |
duke@435 | 673 | u_char* end = ptr + space_before + size; |
duke@435 | 674 | for (u_char* q = end; q < end + MallocCushion; q++) { |
duke@435 | 675 | guarantee(*q == badResourceValue, |
duke@435 | 676 | "Thing freed should be malloc result."); |
duke@435 | 677 | *q = (u_char)freeBlockPad; |
duke@435 | 678 | } |
kvn@2557 | 679 | if (PrintMalloc && tty != NULL) |
coleenp@2615 | 680 | fprintf(stderr, "os::free " SIZE_FORMAT " bytes --> " PTR_FORMAT "\n", size, (uintptr_t)memblock); |
kvn@2557 | 681 | } else if (PrintMalloc && tty != NULL) { |
kvn@2557 | 682 | // tty->print_cr("os::free %p", memblock); |
coleenp@2615 | 683 | fprintf(stderr, "os::free " PTR_FORMAT "\n", (uintptr_t)memblock); |
duke@435 | 684 | } |
duke@435 | 685 | #endif |
zgu@3900 | 686 | MemTracker::record_free((address)memblock, memflags); |
zgu@3900 | 687 | |
duke@435 | 688 | ::free((char*)memblock - space_before); |
duke@435 | 689 | } |
duke@435 | 690 | |
duke@435 | 691 | void os::init_random(long initval) { |
duke@435 | 692 | _rand_seed = initval; |
duke@435 | 693 | } |
duke@435 | 694 | |
duke@435 | 695 | |
duke@435 | 696 | long os::random() { |
duke@435 | 697 | /* standard, well-known linear congruential random generator with |
duke@435 | 698 | * next_rand = (16807*seed) mod (2**31-1) |
duke@435 | 699 | * see |
duke@435 | 700 | * (1) "Random Number Generators: Good Ones Are Hard to Find", |
duke@435 | 701 | * S.K. Park and K.W. Miller, Communications of the ACM 31:10 (Oct 1988), |
duke@435 | 702 | * (2) "Two Fast Implementations of the 'Minimal Standard' Random |
duke@435 | 703 | * Number Generator", David G. Carta, Comm. ACM 33, 1 (Jan 1990), pp. 87-88. |
duke@435 | 704 | */ |
duke@435 | 705 | const long a = 16807; |
duke@435 | 706 | const unsigned long m = 2147483647; |
duke@435 | 707 | const long q = m / a; assert(q == 127773, "weird math"); |
duke@435 | 708 | const long r = m % a; assert(r == 2836, "weird math"); |
duke@435 | 709 | |
duke@435 | 710 | // compute az=2^31p+q |
duke@435 | 711 | unsigned long lo = a * (long)(_rand_seed & 0xFFFF); |
duke@435 | 712 | unsigned long hi = a * (long)((unsigned long)_rand_seed >> 16); |
duke@435 | 713 | lo += (hi & 0x7FFF) << 16; |
duke@435 | 714 | |
duke@435 | 715 | // if q overflowed, ignore the overflow and increment q |
duke@435 | 716 | if (lo > m) { |
duke@435 | 717 | lo &= m; |
duke@435 | 718 | ++lo; |
duke@435 | 719 | } |
duke@435 | 720 | lo += hi >> 15; |
duke@435 | 721 | |
duke@435 | 722 | // if (p+q) overflowed, ignore the overflow and increment (p+q) |
duke@435 | 723 | if (lo > m) { |
duke@435 | 724 | lo &= m; |
duke@435 | 725 | ++lo; |
duke@435 | 726 | } |
duke@435 | 727 | return (_rand_seed = lo); |
duke@435 | 728 | } |
duke@435 | 729 | |
duke@435 | 730 | // The INITIALIZED state is distinguished from the SUSPENDED state because the |
duke@435 | 731 | // conditions in which a thread is first started are different from those in which |
duke@435 | 732 | // a suspension is resumed. These differences make it hard for us to apply the |
duke@435 | 733 | // tougher checks when starting threads that we want to do when resuming them. |
duke@435 | 734 | // However, when start_thread is called as a result of Thread.start, on a Java |
duke@435 | 735 | // thread, the operation is synchronized on the Java Thread object. So there |
duke@435 | 736 | // cannot be a race to start the thread and hence for the thread to exit while |
duke@435 | 737 | // we are working on it. Non-Java threads that start Java threads either have |
duke@435 | 738 | // to do so in a context in which races are impossible, or should do appropriate |
duke@435 | 739 | // locking. |
duke@435 | 740 | |
duke@435 | 741 | void os::start_thread(Thread* thread) { |
duke@435 | 742 | // guard suspend/resume |
duke@435 | 743 | MutexLockerEx ml(thread->SR_lock(), Mutex::_no_safepoint_check_flag); |
duke@435 | 744 | OSThread* osthread = thread->osthread(); |
duke@435 | 745 | osthread->set_state(RUNNABLE); |
duke@435 | 746 | pd_start_thread(thread); |
duke@435 | 747 | } |
duke@435 | 748 | |
duke@435 | 749 | //--------------------------------------------------------------------------- |
duke@435 | 750 | // Helper functions for fatal error handler |
duke@435 | 751 | |
duke@435 | 752 | void os::print_hex_dump(outputStream* st, address start, address end, int unitsize) { |
duke@435 | 753 | assert(unitsize == 1 || unitsize == 2 || unitsize == 4 || unitsize == 8, "just checking"); |
duke@435 | 754 | |
duke@435 | 755 | int cols = 0; |
duke@435 | 756 | int cols_per_line = 0; |
duke@435 | 757 | switch (unitsize) { |
duke@435 | 758 | case 1: cols_per_line = 16; break; |
duke@435 | 759 | case 2: cols_per_line = 8; break; |
duke@435 | 760 | case 4: cols_per_line = 4; break; |
duke@435 | 761 | case 8: cols_per_line = 2; break; |
duke@435 | 762 | default: return; |
duke@435 | 763 | } |
duke@435 | 764 | |
duke@435 | 765 | address p = start; |
duke@435 | 766 | st->print(PTR_FORMAT ": ", start); |
duke@435 | 767 | while (p < end) { |
duke@435 | 768 | switch (unitsize) { |
duke@435 | 769 | case 1: st->print("%02x", *(u1*)p); break; |
duke@435 | 770 | case 2: st->print("%04x", *(u2*)p); break; |
duke@435 | 771 | case 4: st->print("%08x", *(u4*)p); break; |
duke@435 | 772 | case 8: st->print("%016" FORMAT64_MODIFIER "x", *(u8*)p); break; |
duke@435 | 773 | } |
duke@435 | 774 | p += unitsize; |
duke@435 | 775 | cols++; |
duke@435 | 776 | if (cols >= cols_per_line && p < end) { |
duke@435 | 777 | cols = 0; |
duke@435 | 778 | st->cr(); |
duke@435 | 779 | st->print(PTR_FORMAT ": ", p); |
duke@435 | 780 | } else { |
duke@435 | 781 | st->print(" "); |
duke@435 | 782 | } |
duke@435 | 783 | } |
duke@435 | 784 | st->cr(); |
duke@435 | 785 | } |
duke@435 | 786 | |
duke@435 | 787 | void os::print_environment_variables(outputStream* st, const char** env_list, |
duke@435 | 788 | char* buffer, int len) { |
duke@435 | 789 | if (env_list) { |
duke@435 | 790 | st->print_cr("Environment Variables:"); |
duke@435 | 791 | |
duke@435 | 792 | for (int i = 0; env_list[i] != NULL; i++) { |
duke@435 | 793 | if (getenv(env_list[i], buffer, len)) { |
duke@435 | 794 | st->print(env_list[i]); |
duke@435 | 795 | st->print("="); |
duke@435 | 796 | st->print_cr(buffer); |
duke@435 | 797 | } |
duke@435 | 798 | } |
duke@435 | 799 | } |
duke@435 | 800 | } |
duke@435 | 801 | |
duke@435 | 802 | void os::print_cpu_info(outputStream* st) { |
duke@435 | 803 | // cpu |
duke@435 | 804 | st->print("CPU:"); |
duke@435 | 805 | st->print("total %d", os::processor_count()); |
duke@435 | 806 | // It's not safe to query number of active processors after crash |
duke@435 | 807 | // st->print("(active %d)", os::active_processor_count()); |
duke@435 | 808 | st->print(" %s", VM_Version::cpu_features()); |
duke@435 | 809 | st->cr(); |
jcoomes@2997 | 810 | pd_print_cpu_info(st); |
duke@435 | 811 | } |
duke@435 | 812 | |
duke@435 | 813 | void os::print_date_and_time(outputStream *st) { |
duke@435 | 814 | time_t tloc; |
duke@435 | 815 | (void)time(&tloc); |
duke@435 | 816 | st->print("time: %s", ctime(&tloc)); // ctime adds newline. |
duke@435 | 817 | |
duke@435 | 818 | double t = os::elapsedTime(); |
duke@435 | 819 | // NOTE: It tends to crash after a SEGV if we want to printf("%f",...) in |
duke@435 | 820 | // Linux. Must be a bug in glibc ? Workaround is to round "t" to int |
duke@435 | 821 | // before printf. We lost some precision, but who cares? |
duke@435 | 822 | st->print_cr("elapsed time: %d seconds", (int)t); |
duke@435 | 823 | } |
duke@435 | 824 | |
bobv@2036 | 825 | // moved from debug.cpp (used to be find()) but still called from there |
never@2262 | 826 | // The verbose parameter is only set by the debug code in one case |
never@2262 | 827 | void os::print_location(outputStream* st, intptr_t x, bool verbose) { |
bobv@2036 | 828 | address addr = (address)x; |
bobv@2036 | 829 | CodeBlob* b = CodeCache::find_blob_unsafe(addr); |
bobv@2036 | 830 | if (b != NULL) { |
bobv@2036 | 831 | if (b->is_buffer_blob()) { |
bobv@2036 | 832 | // the interpreter is generated into a buffer blob |
bobv@2036 | 833 | InterpreterCodelet* i = Interpreter::codelet_containing(addr); |
bobv@2036 | 834 | if (i != NULL) { |
twisti@3969 | 835 | st->print_cr(INTPTR_FORMAT " is at code_begin+%d in an Interpreter codelet", addr, (int)(addr - i->code_begin())); |
bobv@2036 | 836 | i->print_on(st); |
bobv@2036 | 837 | return; |
bobv@2036 | 838 | } |
bobv@2036 | 839 | if (Interpreter::contains(addr)) { |
bobv@2036 | 840 | st->print_cr(INTPTR_FORMAT " is pointing into interpreter code" |
bobv@2036 | 841 | " (not bytecode specific)", addr); |
bobv@2036 | 842 | return; |
bobv@2036 | 843 | } |
bobv@2036 | 844 | // |
bobv@2036 | 845 | if (AdapterHandlerLibrary::contains(b)) { |
twisti@3969 | 846 | st->print_cr(INTPTR_FORMAT " is at code_begin+%d in an AdapterHandler", addr, (int)(addr - b->code_begin())); |
bobv@2036 | 847 | AdapterHandlerLibrary::print_handler_on(st, b); |
bobv@2036 | 848 | } |
bobv@2036 | 849 | // the stubroutines are generated into a buffer blob |
bobv@2036 | 850 | StubCodeDesc* d = StubCodeDesc::desc_for(addr); |
bobv@2036 | 851 | if (d != NULL) { |
twisti@3969 | 852 | st->print_cr(INTPTR_FORMAT " is at begin+%d in a stub", addr, (int)(addr - d->begin())); |
bobv@2036 | 853 | d->print_on(st); |
twisti@3969 | 854 | st->cr(); |
bobv@2036 | 855 | return; |
bobv@2036 | 856 | } |
bobv@2036 | 857 | if (StubRoutines::contains(addr)) { |
bobv@2036 | 858 | st->print_cr(INTPTR_FORMAT " is pointing to an (unnamed) " |
bobv@2036 | 859 | "stub routine", addr); |
bobv@2036 | 860 | return; |
bobv@2036 | 861 | } |
bobv@2036 | 862 | // the InlineCacheBuffer is using stubs generated into a buffer blob |
bobv@2036 | 863 | if (InlineCacheBuffer::contains(addr)) { |
bobv@2036 | 864 | st->print_cr(INTPTR_FORMAT " is pointing into InlineCacheBuffer", addr); |
bobv@2036 | 865 | return; |
bobv@2036 | 866 | } |
bobv@2036 | 867 | VtableStub* v = VtableStubs::stub_containing(addr); |
bobv@2036 | 868 | if (v != NULL) { |
twisti@3969 | 869 | st->print_cr(INTPTR_FORMAT " is at entry_point+%d in a vtable stub", addr, (int)(addr - v->entry_point())); |
bobv@2036 | 870 | v->print_on(st); |
twisti@3969 | 871 | st->cr(); |
bobv@2036 | 872 | return; |
bobv@2036 | 873 | } |
bobv@2036 | 874 | } |
twisti@3969 | 875 | nmethod* nm = b->as_nmethod_or_null(); |
twisti@3969 | 876 | if (nm != NULL) { |
bobv@2036 | 877 | ResourceMark rm; |
twisti@3969 | 878 | st->print(INTPTR_FORMAT " is at entry_point+%d in (nmethod*)" INTPTR_FORMAT, |
twisti@3969 | 879 | addr, (int)(addr - nm->entry_point()), nm); |
twisti@3969 | 880 | if (verbose) { |
twisti@3969 | 881 | st->print(" for "); |
twisti@3969 | 882 | nm->method()->print_value_on(st); |
twisti@3969 | 883 | } |
stefank@4127 | 884 | st->cr(); |
twisti@3969 | 885 | nm->print_nmethod(verbose); |
bobv@2036 | 886 | return; |
bobv@2036 | 887 | } |
twisti@3969 | 888 | st->print_cr(INTPTR_FORMAT " is at code_begin+%d in ", addr, (int)(addr - b->code_begin())); |
bobv@2036 | 889 | b->print_on(st); |
bobv@2036 | 890 | return; |
bobv@2036 | 891 | } |
bobv@2036 | 892 | |
bobv@2036 | 893 | if (Universe::heap()->is_in(addr)) { |
bobv@2036 | 894 | HeapWord* p = Universe::heap()->block_start(addr); |
bobv@2036 | 895 | bool print = false; |
bobv@2036 | 896 | // If we couldn't find it it just may mean that heap wasn't parseable |
bobv@2036 | 897 | // See if we were just given an oop directly |
bobv@2036 | 898 | if (p != NULL && Universe::heap()->block_is_obj(p)) { |
bobv@2036 | 899 | print = true; |
bobv@2036 | 900 | } else if (p == NULL && ((oopDesc*)addr)->is_oop()) { |
bobv@2036 | 901 | p = (HeapWord*) addr; |
bobv@2036 | 902 | print = true; |
bobv@2036 | 903 | } |
bobv@2036 | 904 | if (print) { |
stefank@4125 | 905 | if (p == (HeapWord*) addr) { |
stefank@4125 | 906 | st->print_cr(INTPTR_FORMAT " is an oop", addr); |
stefank@4125 | 907 | } else { |
stefank@4125 | 908 | st->print_cr(INTPTR_FORMAT " is pointing into object: " INTPTR_FORMAT, addr, p); |
stefank@4125 | 909 | } |
bobv@2036 | 910 | oop(p)->print_on(st); |
bobv@2036 | 911 | return; |
bobv@2036 | 912 | } |
bobv@2036 | 913 | } else { |
bobv@2036 | 914 | if (Universe::heap()->is_in_reserved(addr)) { |
bobv@2036 | 915 | st->print_cr(INTPTR_FORMAT " is an unallocated location " |
bobv@2036 | 916 | "in the heap", addr); |
bobv@2036 | 917 | return; |
bobv@2036 | 918 | } |
bobv@2036 | 919 | } |
bobv@2036 | 920 | if (JNIHandles::is_global_handle((jobject) addr)) { |
bobv@2036 | 921 | st->print_cr(INTPTR_FORMAT " is a global jni handle", addr); |
bobv@2036 | 922 | return; |
bobv@2036 | 923 | } |
bobv@2036 | 924 | if (JNIHandles::is_weak_global_handle((jobject) addr)) { |
bobv@2036 | 925 | st->print_cr(INTPTR_FORMAT " is a weak global jni handle", addr); |
bobv@2036 | 926 | return; |
bobv@2036 | 927 | } |
bobv@2036 | 928 | #ifndef PRODUCT |
bobv@2036 | 929 | // we don't keep the block list in product mode |
bobv@2036 | 930 | if (JNIHandleBlock::any_contains((jobject) addr)) { |
bobv@2036 | 931 | st->print_cr(INTPTR_FORMAT " is a local jni handle", addr); |
bobv@2036 | 932 | return; |
bobv@2036 | 933 | } |
bobv@2036 | 934 | #endif |
bobv@2036 | 935 | |
bobv@2036 | 936 | for(JavaThread *thread = Threads::first(); thread; thread = thread->next()) { |
bobv@2036 | 937 | // Check for privilege stack |
bobv@2036 | 938 | if (thread->privileged_stack_top() != NULL && |
bobv@2036 | 939 | thread->privileged_stack_top()->contains(addr)) { |
bobv@2036 | 940 | st->print_cr(INTPTR_FORMAT " is pointing into the privilege stack " |
bobv@2036 | 941 | "for thread: " INTPTR_FORMAT, addr, thread); |
never@2262 | 942 | if (verbose) thread->print_on(st); |
bobv@2036 | 943 | return; |
bobv@2036 | 944 | } |
bobv@2036 | 945 | // If the addr is a java thread print information about that. |
bobv@2036 | 946 | if (addr == (address)thread) { |
never@2262 | 947 | if (verbose) { |
never@2262 | 948 | thread->print_on(st); |
never@2262 | 949 | } else { |
never@2262 | 950 | st->print_cr(INTPTR_FORMAT " is a thread", addr); |
never@2262 | 951 | } |
bobv@2036 | 952 | return; |
bobv@2036 | 953 | } |
bobv@2036 | 954 | // If the addr is in the stack region for this thread then report that |
bobv@2036 | 955 | // and print thread info |
bobv@2036 | 956 | if (thread->stack_base() >= addr && |
bobv@2036 | 957 | addr > (thread->stack_base() - thread->stack_size())) { |
bobv@2036 | 958 | st->print_cr(INTPTR_FORMAT " is pointing into the stack for thread: " |
bobv@2036 | 959 | INTPTR_FORMAT, addr, thread); |
never@2262 | 960 | if (verbose) thread->print_on(st); |
bobv@2036 | 961 | return; |
bobv@2036 | 962 | } |
bobv@2036 | 963 | |
bobv@2036 | 964 | } |
coleenp@4037 | 965 | |
coleenp@4037 | 966 | #ifndef PRODUCT |
coleenp@4037 | 967 | // Check if in metaspace. |
coleenp@4037 | 968 | if (ClassLoaderDataGraph::contains((address)addr)) { |
coleenp@4037 | 969 | // Use addr->print() from the debugger instead (not here) |
coleenp@4037 | 970 | st->print_cr(INTPTR_FORMAT |
coleenp@4037 | 971 | " is pointing into metadata", addr); |
coleenp@4037 | 972 | return; |
coleenp@4037 | 973 | } |
coleenp@4037 | 974 | #endif |
coleenp@4037 | 975 | |
bobv@2036 | 976 | // Try an OS specific find |
bobv@2036 | 977 | if (os::find(addr, st)) { |
bobv@2036 | 978 | return; |
bobv@2036 | 979 | } |
bobv@2036 | 980 | |
never@2262 | 981 | st->print_cr(INTPTR_FORMAT " is an unknown value", addr); |
bobv@2036 | 982 | } |
duke@435 | 983 | |
duke@435 | 984 | // Looks like all platforms except IA64 can use the same function to check |
duke@435 | 985 | // if C stack is walkable beyond current frame. The check for fp() is not |
duke@435 | 986 | // necessary on Sparc, but it's harmless. |
duke@435 | 987 | bool os::is_first_C_frame(frame* fr) { |
morris@4535 | 988 | #if defined(IA64) && !defined(_WIN32) |
morris@4535 | 989 | // On IA64 we have to check if the callers bsp is still valid |
morris@4535 | 990 | // (i.e. within the register stack bounds). |
morris@4535 | 991 | // Notice: this only works for threads created by the VM and only if |
morris@4535 | 992 | // we walk the current stack!!! If we want to be able to walk |
morris@4535 | 993 | // arbitrary other threads, we'll have to somehow store the thread |
morris@4535 | 994 | // object in the frame. |
morris@4535 | 995 | Thread *thread = Thread::current(); |
morris@4535 | 996 | if ((address)fr->fp() <= |
morris@4535 | 997 | thread->register_stack_base() HPUX_ONLY(+ 0x0) LINUX_ONLY(+ 0x50)) { |
morris@4535 | 998 | // This check is a little hacky, because on Linux the first C |
morris@4535 | 999 | // frame's ('start_thread') register stack frame starts at |
morris@4535 | 1000 | // "register_stack_base + 0x48" while on HPUX, the first C frame's |
morris@4535 | 1001 | // ('__pthread_bound_body') register stack frame seems to really |
morris@4535 | 1002 | // start at "register_stack_base". |
morris@4535 | 1003 | return true; |
morris@4535 | 1004 | } else { |
morris@4535 | 1005 | return false; |
morris@4535 | 1006 | } |
morris@4535 | 1007 | #elif defined(IA64) && defined(_WIN32) |
duke@435 | 1008 | return true; |
morris@4535 | 1009 | #else |
duke@435 | 1010 | // Load up sp, fp, sender sp and sender fp, check for reasonable values. |
duke@435 | 1011 | // Check usp first, because if that's bad the other accessors may fault |
duke@435 | 1012 | // on some architectures. Ditto ufp second, etc. |
duke@435 | 1013 | uintptr_t fp_align_mask = (uintptr_t)(sizeof(address)-1); |
duke@435 | 1014 | // sp on amd can be 32 bit aligned. |
duke@435 | 1015 | uintptr_t sp_align_mask = (uintptr_t)(sizeof(int)-1); |
duke@435 | 1016 | |
duke@435 | 1017 | uintptr_t usp = (uintptr_t)fr->sp(); |
duke@435 | 1018 | if ((usp & sp_align_mask) != 0) return true; |
duke@435 | 1019 | |
duke@435 | 1020 | uintptr_t ufp = (uintptr_t)fr->fp(); |
duke@435 | 1021 | if ((ufp & fp_align_mask) != 0) return true; |
duke@435 | 1022 | |
duke@435 | 1023 | uintptr_t old_sp = (uintptr_t)fr->sender_sp(); |
duke@435 | 1024 | if ((old_sp & sp_align_mask) != 0) return true; |
duke@435 | 1025 | if (old_sp == 0 || old_sp == (uintptr_t)-1) return true; |
duke@435 | 1026 | |
duke@435 | 1027 | uintptr_t old_fp = (uintptr_t)fr->link(); |
duke@435 | 1028 | if ((old_fp & fp_align_mask) != 0) return true; |
duke@435 | 1029 | if (old_fp == 0 || old_fp == (uintptr_t)-1 || old_fp == ufp) return true; |
duke@435 | 1030 | |
duke@435 | 1031 | // stack grows downwards; if old_fp is below current fp or if the stack |
duke@435 | 1032 | // frame is too large, either the stack is corrupted or fp is not saved |
duke@435 | 1033 | // on stack (i.e. on x86, ebp may be used as general register). The stack |
duke@435 | 1034 | // is not walkable beyond current frame. |
duke@435 | 1035 | if (old_fp < ufp) return true; |
duke@435 | 1036 | if (old_fp - ufp > 64 * K) return true; |
duke@435 | 1037 | |
duke@435 | 1038 | return false; |
morris@4535 | 1039 | #endif |
duke@435 | 1040 | } |
duke@435 | 1041 | |
duke@435 | 1042 | #ifdef ASSERT |
duke@435 | 1043 | extern "C" void test_random() { |
duke@435 | 1044 | const double m = 2147483647; |
duke@435 | 1045 | double mean = 0.0, variance = 0.0, t; |
duke@435 | 1046 | long reps = 10000; |
duke@435 | 1047 | unsigned long seed = 1; |
duke@435 | 1048 | |
duke@435 | 1049 | tty->print_cr("seed %ld for %ld repeats...", seed, reps); |
duke@435 | 1050 | os::init_random(seed); |
duke@435 | 1051 | long num; |
duke@435 | 1052 | for (int k = 0; k < reps; k++) { |
duke@435 | 1053 | num = os::random(); |
duke@435 | 1054 | double u = (double)num / m; |
duke@435 | 1055 | assert(u >= 0.0 && u <= 1.0, "bad random number!"); |
duke@435 | 1056 | |
duke@435 | 1057 | // calculate mean and variance of the random sequence |
duke@435 | 1058 | mean += u; |
duke@435 | 1059 | variance += (u*u); |
duke@435 | 1060 | } |
duke@435 | 1061 | mean /= reps; |
duke@435 | 1062 | variance /= (reps - 1); |
duke@435 | 1063 | |
duke@435 | 1064 | assert(num == 1043618065, "bad seed"); |
duke@435 | 1065 | tty->print_cr("mean of the 1st 10000 numbers: %f", mean); |
duke@435 | 1066 | tty->print_cr("variance of the 1st 10000 numbers: %f", variance); |
duke@435 | 1067 | const double eps = 0.0001; |
duke@435 | 1068 | t = fabsd(mean - 0.5018); |
duke@435 | 1069 | assert(t < eps, "bad mean"); |
duke@435 | 1070 | t = (variance - 0.3355) < 0.0 ? -(variance - 0.3355) : variance - 0.3355; |
duke@435 | 1071 | assert(t < eps, "bad variance"); |
duke@435 | 1072 | } |
duke@435 | 1073 | #endif |
duke@435 | 1074 | |
duke@435 | 1075 | |
duke@435 | 1076 | // Set up the boot classpath. |
duke@435 | 1077 | |
duke@435 | 1078 | char* os::format_boot_path(const char* format_string, |
duke@435 | 1079 | const char* home, |
duke@435 | 1080 | int home_len, |
duke@435 | 1081 | char fileSep, |
duke@435 | 1082 | char pathSep) { |
duke@435 | 1083 | assert((fileSep == '/' && pathSep == ':') || |
duke@435 | 1084 | (fileSep == '\\' && pathSep == ';'), "unexpected seperator chars"); |
duke@435 | 1085 | |
duke@435 | 1086 | // Scan the format string to determine the length of the actual |
duke@435 | 1087 | // boot classpath, and handle platform dependencies as well. |
duke@435 | 1088 | int formatted_path_len = 0; |
duke@435 | 1089 | const char* p; |
duke@435 | 1090 | for (p = format_string; *p != 0; ++p) { |
duke@435 | 1091 | if (*p == '%') formatted_path_len += home_len - 1; |
duke@435 | 1092 | ++formatted_path_len; |
duke@435 | 1093 | } |
duke@435 | 1094 | |
zgu@3900 | 1095 | char* formatted_path = NEW_C_HEAP_ARRAY(char, formatted_path_len + 1, mtInternal); |
duke@435 | 1096 | if (formatted_path == NULL) { |
duke@435 | 1097 | return NULL; |
duke@435 | 1098 | } |
duke@435 | 1099 | |
duke@435 | 1100 | // Create boot classpath from format, substituting separator chars and |
duke@435 | 1101 | // java home directory. |
duke@435 | 1102 | char* q = formatted_path; |
duke@435 | 1103 | for (p = format_string; *p != 0; ++p) { |
duke@435 | 1104 | switch (*p) { |
duke@435 | 1105 | case '%': |
duke@435 | 1106 | strcpy(q, home); |
duke@435 | 1107 | q += home_len; |
duke@435 | 1108 | break; |
duke@435 | 1109 | case '/': |
duke@435 | 1110 | *q++ = fileSep; |
duke@435 | 1111 | break; |
duke@435 | 1112 | case ':': |
duke@435 | 1113 | *q++ = pathSep; |
duke@435 | 1114 | break; |
duke@435 | 1115 | default: |
duke@435 | 1116 | *q++ = *p; |
duke@435 | 1117 | } |
duke@435 | 1118 | } |
duke@435 | 1119 | *q = '\0'; |
duke@435 | 1120 | |
duke@435 | 1121 | assert((q - formatted_path) == formatted_path_len, "formatted_path size botched"); |
duke@435 | 1122 | return formatted_path; |
duke@435 | 1123 | } |
duke@435 | 1124 | |
duke@435 | 1125 | |
duke@435 | 1126 | bool os::set_boot_path(char fileSep, char pathSep) { |
duke@435 | 1127 | const char* home = Arguments::get_java_home(); |
duke@435 | 1128 | int home_len = (int)strlen(home); |
duke@435 | 1129 | |
duke@435 | 1130 | static const char* meta_index_dir_format = "%/lib/"; |
duke@435 | 1131 | static const char* meta_index_format = "%/lib/meta-index"; |
duke@435 | 1132 | char* meta_index = format_boot_path(meta_index_format, home, home_len, fileSep, pathSep); |
duke@435 | 1133 | if (meta_index == NULL) return false; |
duke@435 | 1134 | char* meta_index_dir = format_boot_path(meta_index_dir_format, home, home_len, fileSep, pathSep); |
duke@435 | 1135 | if (meta_index_dir == NULL) return false; |
duke@435 | 1136 | Arguments::set_meta_index_path(meta_index, meta_index_dir); |
duke@435 | 1137 | |
duke@435 | 1138 | // Any modification to the JAR-file list, for the boot classpath must be |
duke@435 | 1139 | // aligned with install/install/make/common/Pack.gmk. Note: boot class |
duke@435 | 1140 | // path class JARs, are stripped for StackMapTable to reduce download size. |
duke@435 | 1141 | static const char classpath_format[] = |
duke@435 | 1142 | "%/lib/resources.jar:" |
duke@435 | 1143 | "%/lib/rt.jar:" |
duke@435 | 1144 | "%/lib/sunrsasign.jar:" |
duke@435 | 1145 | "%/lib/jsse.jar:" |
duke@435 | 1146 | "%/lib/jce.jar:" |
duke@435 | 1147 | "%/lib/charsets.jar:" |
phh@3427 | 1148 | "%/lib/jfr.jar:" |
dcubed@3202 | 1149 | #ifdef __APPLE__ |
dcubed@3202 | 1150 | "%/lib/JObjC.jar:" |
dcubed@3202 | 1151 | #endif |
duke@435 | 1152 | "%/classes"; |
duke@435 | 1153 | char* sysclasspath = format_boot_path(classpath_format, home, home_len, fileSep, pathSep); |
duke@435 | 1154 | if (sysclasspath == NULL) return false; |
duke@435 | 1155 | Arguments::set_sysclasspath(sysclasspath); |
duke@435 | 1156 | |
duke@435 | 1157 | return true; |
duke@435 | 1158 | } |
duke@435 | 1159 | |
phh@1126 | 1160 | /* |
phh@1126 | 1161 | * Splits a path, based on its separator, the number of |
phh@1126 | 1162 | * elements is returned back in n. |
phh@1126 | 1163 | * It is the callers responsibility to: |
phh@1126 | 1164 | * a> check the value of n, and n may be 0. |
phh@1126 | 1165 | * b> ignore any empty path elements |
phh@1126 | 1166 | * c> free up the data. |
phh@1126 | 1167 | */ |
phh@1126 | 1168 | char** os::split_path(const char* path, int* n) { |
phh@1126 | 1169 | *n = 0; |
phh@1126 | 1170 | if (path == NULL || strlen(path) == 0) { |
phh@1126 | 1171 | return NULL; |
phh@1126 | 1172 | } |
phh@1126 | 1173 | const char psepchar = *os::path_separator(); |
zgu@3900 | 1174 | char* inpath = (char*)NEW_C_HEAP_ARRAY(char, strlen(path) + 1, mtInternal); |
phh@1126 | 1175 | if (inpath == NULL) { |
phh@1126 | 1176 | return NULL; |
phh@1126 | 1177 | } |
bpittore@4261 | 1178 | strcpy(inpath, path); |
phh@1126 | 1179 | int count = 1; |
phh@1126 | 1180 | char* p = strchr(inpath, psepchar); |
phh@1126 | 1181 | // Get a count of elements to allocate memory |
phh@1126 | 1182 | while (p != NULL) { |
phh@1126 | 1183 | count++; |
phh@1126 | 1184 | p++; |
phh@1126 | 1185 | p = strchr(p, psepchar); |
phh@1126 | 1186 | } |
zgu@3900 | 1187 | char** opath = (char**) NEW_C_HEAP_ARRAY(char*, count, mtInternal); |
phh@1126 | 1188 | if (opath == NULL) { |
phh@1126 | 1189 | return NULL; |
phh@1126 | 1190 | } |
phh@1126 | 1191 | |
phh@1126 | 1192 | // do the actual splitting |
phh@1126 | 1193 | p = inpath; |
phh@1126 | 1194 | for (int i = 0 ; i < count ; i++) { |
phh@1126 | 1195 | size_t len = strcspn(p, os::path_separator()); |
phh@1126 | 1196 | if (len > JVM_MAXPATHLEN) { |
phh@1126 | 1197 | return NULL; |
phh@1126 | 1198 | } |
phh@1126 | 1199 | // allocate the string and add terminator storage |
zgu@3900 | 1200 | char* s = (char*)NEW_C_HEAP_ARRAY(char, len + 1, mtInternal); |
phh@1126 | 1201 | if (s == NULL) { |
phh@1126 | 1202 | return NULL; |
phh@1126 | 1203 | } |
phh@1126 | 1204 | strncpy(s, p, len); |
phh@1126 | 1205 | s[len] = '\0'; |
phh@1126 | 1206 | opath[i] = s; |
phh@1126 | 1207 | p += len + 1; |
phh@1126 | 1208 | } |
zgu@3900 | 1209 | FREE_C_HEAP_ARRAY(char, inpath, mtInternal); |
phh@1126 | 1210 | *n = count; |
phh@1126 | 1211 | return opath; |
phh@1126 | 1212 | } |
phh@1126 | 1213 | |
duke@435 | 1214 | void os::set_memory_serialize_page(address page) { |
duke@435 | 1215 | int count = log2_intptr(sizeof(class JavaThread)) - log2_intptr(64); |
duke@435 | 1216 | _mem_serialize_page = (volatile int32_t *)page; |
duke@435 | 1217 | // We initialize the serialization page shift count here |
duke@435 | 1218 | // We assume a cache line size of 64 bytes |
duke@435 | 1219 | assert(SerializePageShiftCount == count, |
duke@435 | 1220 | "thread size changed, fix SerializePageShiftCount constant"); |
duke@435 | 1221 | set_serialize_page_mask((uintptr_t)(vm_page_size() - sizeof(int32_t))); |
duke@435 | 1222 | } |
duke@435 | 1223 | |
xlu@490 | 1224 | static volatile intptr_t SerializePageLock = 0; |
xlu@490 | 1225 | |
duke@435 | 1226 | // This method is called from signal handler when SIGSEGV occurs while the current |
duke@435 | 1227 | // thread tries to store to the "read-only" memory serialize page during state |
duke@435 | 1228 | // transition. |
duke@435 | 1229 | void os::block_on_serialize_page_trap() { |
duke@435 | 1230 | if (TraceSafepoint) { |
duke@435 | 1231 | tty->print_cr("Block until the serialize page permission restored"); |
duke@435 | 1232 | } |
xlu@490 | 1233 | // When VMThread is holding the SerializePageLock during modifying the |
duke@435 | 1234 | // access permission of the memory serialize page, the following call |
duke@435 | 1235 | // will block until the permission of that page is restored to rw. |
duke@435 | 1236 | // Generally, it is unsafe to manipulate locks in signal handlers, but in |
duke@435 | 1237 | // this case, it's OK as the signal is synchronous and we know precisely when |
xlu@490 | 1238 | // it can occur. |
xlu@490 | 1239 | Thread::muxAcquire(&SerializePageLock, "set_memory_serialize_page"); |
xlu@490 | 1240 | Thread::muxRelease(&SerializePageLock); |
duke@435 | 1241 | } |
duke@435 | 1242 | |
duke@435 | 1243 | // Serialize all thread state variables |
duke@435 | 1244 | void os::serialize_thread_states() { |
duke@435 | 1245 | // On some platforms such as Solaris & Linux, the time duration of the page |
duke@435 | 1246 | // permission restoration is observed to be much longer than expected due to |
duke@435 | 1247 | // scheduler starvation problem etc. To avoid the long synchronization |
xlu@490 | 1248 | // time and expensive page trap spinning, 'SerializePageLock' is used to block |
xlu@490 | 1249 | // the mutator thread if such case is encountered. See bug 6546278 for details. |
xlu@490 | 1250 | Thread::muxAcquire(&SerializePageLock, "serialize_thread_states"); |
coleenp@672 | 1251 | os::protect_memory((char *)os::get_memory_serialize_page(), |
coleenp@912 | 1252 | os::vm_page_size(), MEM_PROT_READ); |
coleenp@912 | 1253 | os::protect_memory((char *)os::get_memory_serialize_page(), |
coleenp@912 | 1254 | os::vm_page_size(), MEM_PROT_RW); |
xlu@490 | 1255 | Thread::muxRelease(&SerializePageLock); |
duke@435 | 1256 | } |
duke@435 | 1257 | |
duke@435 | 1258 | // Returns true if the current stack pointer is above the stack shadow |
duke@435 | 1259 | // pages, false otherwise. |
duke@435 | 1260 | |
duke@435 | 1261 | bool os::stack_shadow_pages_available(Thread *thread, methodHandle method) { |
duke@435 | 1262 | assert(StackRedPages > 0 && StackYellowPages > 0,"Sanity check"); |
duke@435 | 1263 | address sp = current_stack_pointer(); |
duke@435 | 1264 | // Check if we have StackShadowPages above the yellow zone. This parameter |
twisti@1040 | 1265 | // is dependent on the depth of the maximum VM call stack possible from |
duke@435 | 1266 | // the handler for stack overflow. 'instanceof' in the stack overflow |
duke@435 | 1267 | // handler or a println uses at least 8k stack of VM and native code |
duke@435 | 1268 | // respectively. |
duke@435 | 1269 | const int framesize_in_bytes = |
duke@435 | 1270 | Interpreter::size_top_interpreter_activation(method()) * wordSize; |
duke@435 | 1271 | int reserved_area = ((StackShadowPages + StackRedPages + StackYellowPages) |
duke@435 | 1272 | * vm_page_size()) + framesize_in_bytes; |
duke@435 | 1273 | // The very lower end of the stack |
duke@435 | 1274 | address stack_limit = thread->stack_base() - thread->stack_size(); |
duke@435 | 1275 | return (sp > (stack_limit + reserved_area)); |
duke@435 | 1276 | } |
duke@435 | 1277 | |
duke@435 | 1278 | size_t os::page_size_for_region(size_t region_min_size, size_t region_max_size, |
duke@435 | 1279 | uint min_pages) |
duke@435 | 1280 | { |
duke@435 | 1281 | assert(min_pages > 0, "sanity"); |
duke@435 | 1282 | if (UseLargePages) { |
duke@435 | 1283 | const size_t max_page_size = region_max_size / min_pages; |
duke@435 | 1284 | |
duke@435 | 1285 | for (unsigned int i = 0; _page_sizes[i] != 0; ++i) { |
duke@435 | 1286 | const size_t sz = _page_sizes[i]; |
duke@435 | 1287 | const size_t mask = sz - 1; |
duke@435 | 1288 | if ((region_min_size & mask) == 0 && (region_max_size & mask) == 0) { |
duke@435 | 1289 | // The largest page size with no fragmentation. |
duke@435 | 1290 | return sz; |
duke@435 | 1291 | } |
duke@435 | 1292 | |
duke@435 | 1293 | if (sz <= max_page_size) { |
duke@435 | 1294 | // The largest page size that satisfies the min_pages requirement. |
duke@435 | 1295 | return sz; |
duke@435 | 1296 | } |
duke@435 | 1297 | } |
duke@435 | 1298 | } |
duke@435 | 1299 | |
duke@435 | 1300 | return vm_page_size(); |
duke@435 | 1301 | } |
duke@435 | 1302 | |
duke@435 | 1303 | #ifndef PRODUCT |
jcoomes@3057 | 1304 | void os::trace_page_sizes(const char* str, const size_t* page_sizes, int count) |
jcoomes@3057 | 1305 | { |
jcoomes@3057 | 1306 | if (TracePageSizes) { |
jcoomes@3057 | 1307 | tty->print("%s: ", str); |
jcoomes@3057 | 1308 | for (int i = 0; i < count; ++i) { |
jcoomes@3057 | 1309 | tty->print(" " SIZE_FORMAT, page_sizes[i]); |
jcoomes@3057 | 1310 | } |
jcoomes@3057 | 1311 | tty->cr(); |
jcoomes@3057 | 1312 | } |
jcoomes@3057 | 1313 | } |
jcoomes@3057 | 1314 | |
duke@435 | 1315 | void os::trace_page_sizes(const char* str, const size_t region_min_size, |
duke@435 | 1316 | const size_t region_max_size, const size_t page_size, |
duke@435 | 1317 | const char* base, const size_t size) |
duke@435 | 1318 | { |
duke@435 | 1319 | if (TracePageSizes) { |
duke@435 | 1320 | tty->print_cr("%s: min=" SIZE_FORMAT " max=" SIZE_FORMAT |
duke@435 | 1321 | " pg_sz=" SIZE_FORMAT " base=" PTR_FORMAT |
duke@435 | 1322 | " size=" SIZE_FORMAT, |
duke@435 | 1323 | str, region_min_size, region_max_size, |
duke@435 | 1324 | page_size, base, size); |
duke@435 | 1325 | } |
duke@435 | 1326 | } |
duke@435 | 1327 | #endif // #ifndef PRODUCT |
duke@435 | 1328 | |
duke@435 | 1329 | // This is the working definition of a server class machine: |
duke@435 | 1330 | // >= 2 physical CPU's and >=2GB of memory, with some fuzz |
duke@435 | 1331 | // because the graphics memory (?) sometimes masks physical memory. |
duke@435 | 1332 | // If you want to change the definition of a server class machine |
duke@435 | 1333 | // on some OS or platform, e.g., >=4GB on Windohs platforms, |
duke@435 | 1334 | // then you'll have to parameterize this method based on that state, |
duke@435 | 1335 | // as was done for logical processors here, or replicate and |
duke@435 | 1336 | // specialize this method for each platform. (Or fix os to have |
duke@435 | 1337 | // some inheritance structure and use subclassing. Sigh.) |
duke@435 | 1338 | // If you want some platform to always or never behave as a server |
duke@435 | 1339 | // class machine, change the setting of AlwaysActAsServerClassMachine |
duke@435 | 1340 | // and NeverActAsServerClassMachine in globals*.hpp. |
duke@435 | 1341 | bool os::is_server_class_machine() { |
duke@435 | 1342 | // First check for the early returns |
duke@435 | 1343 | if (NeverActAsServerClassMachine) { |
duke@435 | 1344 | return false; |
duke@435 | 1345 | } |
duke@435 | 1346 | if (AlwaysActAsServerClassMachine) { |
duke@435 | 1347 | return true; |
duke@435 | 1348 | } |
duke@435 | 1349 | // Then actually look at the machine |
duke@435 | 1350 | bool result = false; |
duke@435 | 1351 | const unsigned int server_processors = 2; |
duke@435 | 1352 | const julong server_memory = 2UL * G; |
duke@435 | 1353 | // We seem not to get our full complement of memory. |
duke@435 | 1354 | // We allow some part (1/8?) of the memory to be "missing", |
duke@435 | 1355 | // based on the sizes of DIMMs, and maybe graphics cards. |
duke@435 | 1356 | const julong missing_memory = 256UL * M; |
duke@435 | 1357 | |
duke@435 | 1358 | /* Is this a server class machine? */ |
duke@435 | 1359 | if ((os::active_processor_count() >= (int)server_processors) && |
duke@435 | 1360 | (os::physical_memory() >= (server_memory - missing_memory))) { |
duke@435 | 1361 | const unsigned int logical_processors = |
duke@435 | 1362 | VM_Version::logical_processors_per_package(); |
duke@435 | 1363 | if (logical_processors > 1) { |
duke@435 | 1364 | const unsigned int physical_packages = |
duke@435 | 1365 | os::active_processor_count() / logical_processors; |
duke@435 | 1366 | if (physical_packages > server_processors) { |
duke@435 | 1367 | result = true; |
duke@435 | 1368 | } |
duke@435 | 1369 | } else { |
duke@435 | 1370 | result = true; |
duke@435 | 1371 | } |
duke@435 | 1372 | } |
duke@435 | 1373 | return result; |
duke@435 | 1374 | } |
dsamersoff@2751 | 1375 | |
dsamersoff@2751 | 1376 | // Read file line by line, if line is longer than bsize, |
dsamersoff@2751 | 1377 | // skip rest of line. |
dsamersoff@2751 | 1378 | int os::get_line_chars(int fd, char* buf, const size_t bsize){ |
dsamersoff@2751 | 1379 | size_t sz, i = 0; |
dsamersoff@2751 | 1380 | |
dsamersoff@2751 | 1381 | // read until EOF, EOL or buf is full |
dsamersoff@3030 | 1382 | while ((sz = (int) read(fd, &buf[i], 1)) == 1 && i < (bsize-2) && buf[i] != '\n') { |
dsamersoff@2751 | 1383 | ++i; |
dsamersoff@2751 | 1384 | } |
dsamersoff@2751 | 1385 | |
dsamersoff@2751 | 1386 | if (buf[i] == '\n') { |
dsamersoff@2751 | 1387 | // EOL reached so ignore EOL character and return |
dsamersoff@2751 | 1388 | |
dsamersoff@2751 | 1389 | buf[i] = 0; |
dsamersoff@2751 | 1390 | return (int) i; |
dsamersoff@2751 | 1391 | } |
dsamersoff@2751 | 1392 | |
dsamersoff@2751 | 1393 | buf[i+1] = 0; |
dsamersoff@2751 | 1394 | |
dsamersoff@2751 | 1395 | if (sz != 1) { |
dsamersoff@2751 | 1396 | // EOF reached. if we read chars before EOF return them and |
dsamersoff@2751 | 1397 | // return EOF on next call otherwise return EOF |
dsamersoff@2751 | 1398 | |
dsamersoff@2751 | 1399 | return (i == 0) ? -1 : (int) i; |
dsamersoff@2751 | 1400 | } |
dsamersoff@2751 | 1401 | |
dsamersoff@2751 | 1402 | // line is longer than size of buf, skip to EOL |
dsamersoff@3030 | 1403 | char ch; |
dsamersoff@2751 | 1404 | while (read(fd, &ch, 1) == 1 && ch != '\n') { |
dsamersoff@2751 | 1405 | // Do nothing |
dsamersoff@2751 | 1406 | } |
dsamersoff@2751 | 1407 | |
dsamersoff@2751 | 1408 | // return initial part of line that fits in buf. |
dsamersoff@2751 | 1409 | // If we reached EOF, it will be returned on next call. |
dsamersoff@2751 | 1410 | |
dsamersoff@2751 | 1411 | return (int) i; |
dsamersoff@2751 | 1412 | } |
zgu@3900 | 1413 | |
zgu@3900 | 1414 | bool os::create_stack_guard_pages(char* addr, size_t bytes) { |
zgu@3900 | 1415 | return os::pd_create_stack_guard_pages(addr, bytes); |
zgu@3900 | 1416 | } |
zgu@3900 | 1417 | |
zgu@3900 | 1418 | |
zgu@3900 | 1419 | char* os::reserve_memory(size_t bytes, char* addr, size_t alignment_hint) { |
zgu@3900 | 1420 | char* result = pd_reserve_memory(bytes, addr, alignment_hint); |
zgu@4193 | 1421 | if (result != NULL) { |
zgu@3900 | 1422 | MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC); |
zgu@3900 | 1423 | } |
zgu@3900 | 1424 | |
zgu@3900 | 1425 | return result; |
zgu@3900 | 1426 | } |
zgu@3900 | 1427 | char* os::attempt_reserve_memory_at(size_t bytes, char* addr) { |
zgu@3900 | 1428 | char* result = pd_attempt_reserve_memory_at(bytes, addr); |
zgu@4193 | 1429 | if (result != NULL) { |
zgu@3900 | 1430 | MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC); |
zgu@3900 | 1431 | } |
zgu@3900 | 1432 | return result; |
zgu@3900 | 1433 | } |
zgu@3900 | 1434 | |
zgu@3900 | 1435 | void os::split_reserved_memory(char *base, size_t size, |
zgu@3900 | 1436 | size_t split, bool realloc) { |
zgu@3900 | 1437 | pd_split_reserved_memory(base, size, split, realloc); |
zgu@3900 | 1438 | } |
zgu@3900 | 1439 | |
zgu@3900 | 1440 | bool os::commit_memory(char* addr, size_t bytes, bool executable) { |
zgu@3900 | 1441 | bool res = pd_commit_memory(addr, bytes, executable); |
zgu@4193 | 1442 | if (res) { |
zgu@3900 | 1443 | MemTracker::record_virtual_memory_commit((address)addr, bytes, CALLER_PC); |
zgu@3900 | 1444 | } |
zgu@3900 | 1445 | return res; |
zgu@3900 | 1446 | } |
zgu@3900 | 1447 | |
zgu@3900 | 1448 | bool os::commit_memory(char* addr, size_t size, size_t alignment_hint, |
zgu@3900 | 1449 | bool executable) { |
zgu@3900 | 1450 | bool res = os::pd_commit_memory(addr, size, alignment_hint, executable); |
zgu@4193 | 1451 | if (res) { |
zgu@3900 | 1452 | MemTracker::record_virtual_memory_commit((address)addr, size, CALLER_PC); |
zgu@3900 | 1453 | } |
zgu@3900 | 1454 | return res; |
zgu@3900 | 1455 | } |
zgu@3900 | 1456 | |
zgu@3900 | 1457 | bool os::uncommit_memory(char* addr, size_t bytes) { |
zgu@3900 | 1458 | bool res = pd_uncommit_memory(addr, bytes); |
zgu@3900 | 1459 | if (res) { |
zgu@3900 | 1460 | MemTracker::record_virtual_memory_uncommit((address)addr, bytes); |
zgu@3900 | 1461 | } |
zgu@3900 | 1462 | return res; |
zgu@3900 | 1463 | } |
zgu@3900 | 1464 | |
zgu@3900 | 1465 | bool os::release_memory(char* addr, size_t bytes) { |
zgu@3900 | 1466 | bool res = pd_release_memory(addr, bytes); |
zgu@3900 | 1467 | if (res) { |
zgu@3900 | 1468 | MemTracker::record_virtual_memory_release((address)addr, bytes); |
zgu@3900 | 1469 | } |
zgu@3900 | 1470 | return res; |
zgu@3900 | 1471 | } |
zgu@3900 | 1472 | |
zgu@3900 | 1473 | |
zgu@3900 | 1474 | char* os::map_memory(int fd, const char* file_name, size_t file_offset, |
zgu@3900 | 1475 | char *addr, size_t bytes, bool read_only, |
zgu@3900 | 1476 | bool allow_exec) { |
zgu@3900 | 1477 | char* result = pd_map_memory(fd, file_name, file_offset, addr, bytes, read_only, allow_exec); |
zgu@4193 | 1478 | if (result != NULL) { |
zgu@3900 | 1479 | MemTracker::record_virtual_memory_reserve((address)result, bytes, CALLER_PC); |
zgu@4193 | 1480 | MemTracker::record_virtual_memory_commit((address)result, bytes, CALLER_PC); |
zgu@3900 | 1481 | } |
zgu@3900 | 1482 | return result; |
zgu@3900 | 1483 | } |
zgu@3900 | 1484 | |
zgu@3900 | 1485 | char* os::remap_memory(int fd, const char* file_name, size_t file_offset, |
zgu@3900 | 1486 | char *addr, size_t bytes, bool read_only, |
zgu@3900 | 1487 | bool allow_exec) { |
zgu@3900 | 1488 | return pd_remap_memory(fd, file_name, file_offset, addr, bytes, |
zgu@3900 | 1489 | read_only, allow_exec); |
zgu@3900 | 1490 | } |
zgu@3900 | 1491 | |
zgu@3900 | 1492 | bool os::unmap_memory(char *addr, size_t bytes) { |
zgu@3900 | 1493 | bool result = pd_unmap_memory(addr, bytes); |
zgu@3900 | 1494 | if (result) { |
zgu@4193 | 1495 | MemTracker::record_virtual_memory_uncommit((address)addr, bytes); |
zgu@3900 | 1496 | MemTracker::record_virtual_memory_release((address)addr, bytes); |
zgu@3900 | 1497 | } |
zgu@3900 | 1498 | return result; |
zgu@3900 | 1499 | } |
zgu@3900 | 1500 | |
zgu@3900 | 1501 | void os::free_memory(char *addr, size_t bytes, size_t alignment_hint) { |
zgu@3900 | 1502 | pd_free_memory(addr, bytes, alignment_hint); |
zgu@3900 | 1503 | } |
zgu@3900 | 1504 | |
zgu@3900 | 1505 | void os::realign_memory(char *addr, size_t bytes, size_t alignment_hint) { |
zgu@3900 | 1506 | pd_realign_memory(addr, bytes, alignment_hint); |
zgu@3900 | 1507 | } |
zgu@3900 | 1508 |