Tue, 07 Jul 2009 14:23:00 -0400
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
Summary: Changing the behavior of -XX:+PrintHeapAtGC for G1 from printing lengthy, per-region information to instead printing a concise summary.
Reviewed-by: ysr, apetrusenko, jcoomes
duke@435 | 1 | /* |
xdono@1014 | 2 | * Copyright 1997-2009 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_os.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | # include <signal.h> |
duke@435 | 29 | |
duke@435 | 30 | OSThread* os::_starting_thread = NULL; |
duke@435 | 31 | address os::_polling_page = NULL; |
duke@435 | 32 | volatile int32_t* os::_mem_serialize_page = NULL; |
duke@435 | 33 | uintptr_t os::_serialize_page_mask = 0; |
duke@435 | 34 | long os::_rand_seed = 1; |
duke@435 | 35 | int os::_processor_count = 0; |
duke@435 | 36 | size_t os::_page_sizes[os::page_sizes_max]; |
duke@435 | 37 | |
duke@435 | 38 | #ifndef PRODUCT |
duke@435 | 39 | int os::num_mallocs = 0; // # of calls to malloc/realloc |
duke@435 | 40 | size_t os::alloc_bytes = 0; // # of bytes allocated |
duke@435 | 41 | int os::num_frees = 0; // # of calls to free |
duke@435 | 42 | #endif |
duke@435 | 43 | |
duke@435 | 44 | // Fill in buffer with current local time as an ISO-8601 string. |
duke@435 | 45 | // E.g., yyyy-mm-ddThh:mm:ss-zzzz. |
duke@435 | 46 | // Returns buffer, or NULL if it failed. |
duke@435 | 47 | // This would mostly be a call to |
duke@435 | 48 | // strftime(...., "%Y-%m-%d" "T" "%H:%M:%S" "%z", ....) |
duke@435 | 49 | // except that on Windows the %z behaves badly, so we do it ourselves. |
duke@435 | 50 | // Also, people wanted milliseconds on there, |
duke@435 | 51 | // and strftime doesn't do milliseconds. |
duke@435 | 52 | char* os::iso8601_time(char* buffer, size_t buffer_length) { |
duke@435 | 53 | // Output will be of the form "YYYY-MM-DDThh:mm:ss.mmm+zzzz\0" |
duke@435 | 54 | // 1 2 |
duke@435 | 55 | // 12345678901234567890123456789 |
duke@435 | 56 | static const char* iso8601_format = |
duke@435 | 57 | "%04d-%02d-%02dT%02d:%02d:%02d.%03d%c%02d%02d"; |
duke@435 | 58 | static const size_t needed_buffer = 29; |
duke@435 | 59 | |
duke@435 | 60 | // Sanity check the arguments |
duke@435 | 61 | if (buffer == NULL) { |
duke@435 | 62 | assert(false, "NULL buffer"); |
duke@435 | 63 | return NULL; |
duke@435 | 64 | } |
duke@435 | 65 | if (buffer_length < needed_buffer) { |
duke@435 | 66 | assert(false, "buffer_length too small"); |
duke@435 | 67 | return NULL; |
duke@435 | 68 | } |
duke@435 | 69 | // Get the current time |
sbohne@496 | 70 | jlong milliseconds_since_19700101 = javaTimeMillis(); |
duke@435 | 71 | const int milliseconds_per_microsecond = 1000; |
duke@435 | 72 | const time_t seconds_since_19700101 = |
duke@435 | 73 | milliseconds_since_19700101 / milliseconds_per_microsecond; |
duke@435 | 74 | const int milliseconds_after_second = |
duke@435 | 75 | milliseconds_since_19700101 % milliseconds_per_microsecond; |
duke@435 | 76 | // Convert the time value to a tm and timezone variable |
ysr@983 | 77 | struct tm time_struct; |
ysr@983 | 78 | if (localtime_pd(&seconds_since_19700101, &time_struct) == NULL) { |
ysr@983 | 79 | assert(false, "Failed localtime_pd"); |
duke@435 | 80 | return NULL; |
duke@435 | 81 | } |
duke@435 | 82 | const time_t zone = timezone; |
duke@435 | 83 | |
duke@435 | 84 | // If daylight savings time is in effect, |
duke@435 | 85 | // we are 1 hour East of our time zone |
duke@435 | 86 | const time_t seconds_per_minute = 60; |
duke@435 | 87 | const time_t minutes_per_hour = 60; |
duke@435 | 88 | const time_t seconds_per_hour = seconds_per_minute * minutes_per_hour; |
duke@435 | 89 | time_t UTC_to_local = zone; |
duke@435 | 90 | if (time_struct.tm_isdst > 0) { |
duke@435 | 91 | UTC_to_local = UTC_to_local - seconds_per_hour; |
duke@435 | 92 | } |
duke@435 | 93 | // Compute the time zone offset. |
ysr@983 | 94 | // localtime_pd() sets timezone to the difference (in seconds) |
duke@435 | 95 | // between UTC and and local time. |
duke@435 | 96 | // ISO 8601 says we need the difference between local time and UTC, |
ysr@983 | 97 | // we change the sign of the localtime_pd() result. |
duke@435 | 98 | const time_t local_to_UTC = -(UTC_to_local); |
duke@435 | 99 | // Then we have to figure out if if we are ahead (+) or behind (-) UTC. |
duke@435 | 100 | char sign_local_to_UTC = '+'; |
duke@435 | 101 | time_t abs_local_to_UTC = local_to_UTC; |
duke@435 | 102 | if (local_to_UTC < 0) { |
duke@435 | 103 | sign_local_to_UTC = '-'; |
duke@435 | 104 | abs_local_to_UTC = -(abs_local_to_UTC); |
duke@435 | 105 | } |
duke@435 | 106 | // Convert time zone offset seconds to hours and minutes. |
duke@435 | 107 | const time_t zone_hours = (abs_local_to_UTC / seconds_per_hour); |
duke@435 | 108 | const time_t zone_min = |
duke@435 | 109 | ((abs_local_to_UTC % seconds_per_hour) / seconds_per_minute); |
duke@435 | 110 | |
duke@435 | 111 | // Print an ISO 8601 date and time stamp into the buffer |
duke@435 | 112 | const int year = 1900 + time_struct.tm_year; |
duke@435 | 113 | const int month = 1 + time_struct.tm_mon; |
duke@435 | 114 | const int printed = jio_snprintf(buffer, buffer_length, iso8601_format, |
duke@435 | 115 | year, |
duke@435 | 116 | month, |
duke@435 | 117 | time_struct.tm_mday, |
duke@435 | 118 | time_struct.tm_hour, |
duke@435 | 119 | time_struct.tm_min, |
duke@435 | 120 | time_struct.tm_sec, |
duke@435 | 121 | milliseconds_after_second, |
duke@435 | 122 | sign_local_to_UTC, |
duke@435 | 123 | zone_hours, |
duke@435 | 124 | zone_min); |
duke@435 | 125 | if (printed == 0) { |
duke@435 | 126 | assert(false, "Failed jio_printf"); |
duke@435 | 127 | return NULL; |
duke@435 | 128 | } |
duke@435 | 129 | return buffer; |
duke@435 | 130 | } |
duke@435 | 131 | |
duke@435 | 132 | OSReturn os::set_priority(Thread* thread, ThreadPriority p) { |
duke@435 | 133 | #ifdef ASSERT |
duke@435 | 134 | if (!(!thread->is_Java_thread() || |
duke@435 | 135 | Thread::current() == thread || |
duke@435 | 136 | Threads_lock->owned_by_self() |
duke@435 | 137 | || thread->is_Compiler_thread() |
duke@435 | 138 | )) { |
duke@435 | 139 | assert(false, "possibility of dangling Thread pointer"); |
duke@435 | 140 | } |
duke@435 | 141 | #endif |
duke@435 | 142 | |
duke@435 | 143 | if (p >= MinPriority && p <= MaxPriority) { |
duke@435 | 144 | int priority = java_to_os_priority[p]; |
duke@435 | 145 | return set_native_priority(thread, priority); |
duke@435 | 146 | } else { |
duke@435 | 147 | assert(false, "Should not happen"); |
duke@435 | 148 | return OS_ERR; |
duke@435 | 149 | } |
duke@435 | 150 | } |
duke@435 | 151 | |
duke@435 | 152 | |
duke@435 | 153 | OSReturn os::get_priority(const Thread* const thread, ThreadPriority& priority) { |
duke@435 | 154 | int p; |
duke@435 | 155 | int os_prio; |
duke@435 | 156 | OSReturn ret = get_native_priority(thread, &os_prio); |
duke@435 | 157 | if (ret != OS_OK) return ret; |
duke@435 | 158 | |
duke@435 | 159 | for (p = MaxPriority; p > MinPriority && java_to_os_priority[p] > os_prio; p--) ; |
duke@435 | 160 | priority = (ThreadPriority)p; |
duke@435 | 161 | return OS_OK; |
duke@435 | 162 | } |
duke@435 | 163 | |
duke@435 | 164 | |
duke@435 | 165 | // --------------------- sun.misc.Signal (optional) --------------------- |
duke@435 | 166 | |
duke@435 | 167 | |
duke@435 | 168 | // SIGBREAK is sent by the keyboard to query the VM state |
duke@435 | 169 | #ifndef SIGBREAK |
duke@435 | 170 | #define SIGBREAK SIGQUIT |
duke@435 | 171 | #endif |
duke@435 | 172 | |
duke@435 | 173 | // sigexitnum_pd is a platform-specific special signal used for terminating the Signal thread. |
duke@435 | 174 | |
duke@435 | 175 | |
duke@435 | 176 | static void signal_thread_entry(JavaThread* thread, TRAPS) { |
duke@435 | 177 | os::set_priority(thread, NearMaxPriority); |
duke@435 | 178 | while (true) { |
duke@435 | 179 | int sig; |
duke@435 | 180 | { |
duke@435 | 181 | // FIXME : Currently we have not decieded what should be the status |
duke@435 | 182 | // for this java thread blocked here. Once we decide about |
duke@435 | 183 | // that we should fix this. |
duke@435 | 184 | sig = os::signal_wait(); |
duke@435 | 185 | } |
duke@435 | 186 | if (sig == os::sigexitnum_pd()) { |
duke@435 | 187 | // Terminate the signal thread |
duke@435 | 188 | return; |
duke@435 | 189 | } |
duke@435 | 190 | |
duke@435 | 191 | switch (sig) { |
duke@435 | 192 | case SIGBREAK: { |
duke@435 | 193 | // Check if the signal is a trigger to start the Attach Listener - in that |
duke@435 | 194 | // case don't print stack traces. |
duke@435 | 195 | if (!DisableAttachMechanism && AttachListener::is_init_trigger()) { |
duke@435 | 196 | continue; |
duke@435 | 197 | } |
duke@435 | 198 | // Print stack traces |
duke@435 | 199 | // Any SIGBREAK operations added here should make sure to flush |
duke@435 | 200 | // the output stream (e.g. tty->flush()) after output. See 4803766. |
duke@435 | 201 | // Each module also prints an extra carriage return after its output. |
duke@435 | 202 | VM_PrintThreads op; |
duke@435 | 203 | VMThread::execute(&op); |
duke@435 | 204 | VM_PrintJNI jni_op; |
duke@435 | 205 | VMThread::execute(&jni_op); |
duke@435 | 206 | VM_FindDeadlocks op1(tty); |
duke@435 | 207 | VMThread::execute(&op1); |
duke@435 | 208 | Universe::print_heap_at_SIGBREAK(); |
duke@435 | 209 | if (PrintClassHistogram) { |
ysr@1050 | 210 | VM_GC_HeapInspection op1(gclog_or_tty, true /* force full GC before heap inspection */, |
ysr@1050 | 211 | true /* need_prologue */); |
duke@435 | 212 | VMThread::execute(&op1); |
duke@435 | 213 | } |
duke@435 | 214 | if (JvmtiExport::should_post_data_dump()) { |
duke@435 | 215 | JvmtiExport::post_data_dump(); |
duke@435 | 216 | } |
duke@435 | 217 | break; |
duke@435 | 218 | } |
duke@435 | 219 | default: { |
duke@435 | 220 | // Dispatch the signal to java |
duke@435 | 221 | HandleMark hm(THREAD); |
duke@435 | 222 | klassOop k = SystemDictionary::resolve_or_null(vmSymbolHandles::sun_misc_Signal(), THREAD); |
duke@435 | 223 | KlassHandle klass (THREAD, k); |
duke@435 | 224 | if (klass.not_null()) { |
duke@435 | 225 | JavaValue result(T_VOID); |
duke@435 | 226 | JavaCallArguments args; |
duke@435 | 227 | args.push_int(sig); |
duke@435 | 228 | JavaCalls::call_static( |
duke@435 | 229 | &result, |
duke@435 | 230 | klass, |
duke@435 | 231 | vmSymbolHandles::dispatch_name(), |
duke@435 | 232 | vmSymbolHandles::int_void_signature(), |
duke@435 | 233 | &args, |
duke@435 | 234 | THREAD |
duke@435 | 235 | ); |
duke@435 | 236 | } |
duke@435 | 237 | if (HAS_PENDING_EXCEPTION) { |
duke@435 | 238 | // tty is initialized early so we don't expect it to be null, but |
duke@435 | 239 | // if it is we can't risk doing an initialization that might |
duke@435 | 240 | // trigger additional out-of-memory conditions |
duke@435 | 241 | if (tty != NULL) { |
duke@435 | 242 | char klass_name[256]; |
duke@435 | 243 | char tmp_sig_name[16]; |
duke@435 | 244 | const char* sig_name = "UNKNOWN"; |
duke@435 | 245 | instanceKlass::cast(PENDING_EXCEPTION->klass())-> |
duke@435 | 246 | name()->as_klass_external_name(klass_name, 256); |
duke@435 | 247 | if (os::exception_name(sig, tmp_sig_name, 16) != NULL) |
duke@435 | 248 | sig_name = tmp_sig_name; |
duke@435 | 249 | warning("Exception %s occurred dispatching signal %s to handler" |
duke@435 | 250 | "- the VM may need to be forcibly terminated", |
duke@435 | 251 | klass_name, sig_name ); |
duke@435 | 252 | } |
duke@435 | 253 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 254 | } |
duke@435 | 255 | } |
duke@435 | 256 | } |
duke@435 | 257 | } |
duke@435 | 258 | } |
duke@435 | 259 | |
duke@435 | 260 | |
duke@435 | 261 | void os::signal_init() { |
duke@435 | 262 | if (!ReduceSignalUsage) { |
duke@435 | 263 | // Setup JavaThread for processing signals |
duke@435 | 264 | EXCEPTION_MARK; |
duke@435 | 265 | klassOop k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_Thread(), true, CHECK); |
duke@435 | 266 | instanceKlassHandle klass (THREAD, k); |
duke@435 | 267 | instanceHandle thread_oop = klass->allocate_instance_handle(CHECK); |
duke@435 | 268 | |
duke@435 | 269 | const char thread_name[] = "Signal Dispatcher"; |
duke@435 | 270 | Handle string = java_lang_String::create_from_str(thread_name, CHECK); |
duke@435 | 271 | |
duke@435 | 272 | // Initialize thread_oop to put it into the system threadGroup |
duke@435 | 273 | Handle thread_group (THREAD, Universe::system_thread_group()); |
duke@435 | 274 | JavaValue result(T_VOID); |
duke@435 | 275 | JavaCalls::call_special(&result, thread_oop, |
duke@435 | 276 | klass, |
duke@435 | 277 | vmSymbolHandles::object_initializer_name(), |
duke@435 | 278 | vmSymbolHandles::threadgroup_string_void_signature(), |
duke@435 | 279 | thread_group, |
duke@435 | 280 | string, |
duke@435 | 281 | CHECK); |
duke@435 | 282 | |
duke@435 | 283 | KlassHandle group(THREAD, SystemDictionary::threadGroup_klass()); |
duke@435 | 284 | JavaCalls::call_special(&result, |
duke@435 | 285 | thread_group, |
duke@435 | 286 | group, |
duke@435 | 287 | vmSymbolHandles::add_method_name(), |
duke@435 | 288 | vmSymbolHandles::thread_void_signature(), |
duke@435 | 289 | thread_oop, // ARG 1 |
duke@435 | 290 | CHECK); |
duke@435 | 291 | |
duke@435 | 292 | os::signal_init_pd(); |
duke@435 | 293 | |
duke@435 | 294 | { MutexLocker mu(Threads_lock); |
duke@435 | 295 | JavaThread* signal_thread = new JavaThread(&signal_thread_entry); |
duke@435 | 296 | |
duke@435 | 297 | // At this point it may be possible that no osthread was created for the |
duke@435 | 298 | // JavaThread due to lack of memory. We would have to throw an exception |
duke@435 | 299 | // in that case. However, since this must work and we do not allow |
duke@435 | 300 | // exceptions anyway, check and abort if this fails. |
duke@435 | 301 | if (signal_thread == NULL || signal_thread->osthread() == NULL) { |
duke@435 | 302 | vm_exit_during_initialization("java.lang.OutOfMemoryError", |
duke@435 | 303 | "unable to create new native thread"); |
duke@435 | 304 | } |
duke@435 | 305 | |
duke@435 | 306 | java_lang_Thread::set_thread(thread_oop(), signal_thread); |
duke@435 | 307 | java_lang_Thread::set_priority(thread_oop(), NearMaxPriority); |
duke@435 | 308 | java_lang_Thread::set_daemon(thread_oop()); |
duke@435 | 309 | |
duke@435 | 310 | signal_thread->set_threadObj(thread_oop()); |
duke@435 | 311 | Threads::add(signal_thread); |
duke@435 | 312 | Thread::start(signal_thread); |
duke@435 | 313 | } |
duke@435 | 314 | // Handle ^BREAK |
duke@435 | 315 | os::signal(SIGBREAK, os::user_handler()); |
duke@435 | 316 | } |
duke@435 | 317 | } |
duke@435 | 318 | |
duke@435 | 319 | |
duke@435 | 320 | void os::terminate_signal_thread() { |
duke@435 | 321 | if (!ReduceSignalUsage) |
duke@435 | 322 | signal_notify(sigexitnum_pd()); |
duke@435 | 323 | } |
duke@435 | 324 | |
duke@435 | 325 | |
duke@435 | 326 | // --------------------- loading libraries --------------------- |
duke@435 | 327 | |
duke@435 | 328 | typedef jint (JNICALL *JNI_OnLoad_t)(JavaVM *, void *); |
duke@435 | 329 | extern struct JavaVM_ main_vm; |
duke@435 | 330 | |
duke@435 | 331 | static void* _native_java_library = NULL; |
duke@435 | 332 | |
duke@435 | 333 | void* os::native_java_library() { |
duke@435 | 334 | if (_native_java_library == NULL) { |
duke@435 | 335 | char buffer[JVM_MAXPATHLEN]; |
duke@435 | 336 | char ebuf[1024]; |
duke@435 | 337 | |
kamg@677 | 338 | // Try to load verify dll first. In 1.3 java dll depends on it and is not |
kamg@677 | 339 | // always able to find it when the loading executable is outside the JDK. |
duke@435 | 340 | // In order to keep working with 1.2 we ignore any loading errors. |
kamg@677 | 341 | dll_build_name(buffer, sizeof(buffer), Arguments::get_dll_dir(), "verify"); |
kamg@677 | 342 | dll_load(buffer, ebuf, sizeof(ebuf)); |
duke@435 | 343 | |
duke@435 | 344 | // Load java dll |
kamg@677 | 345 | dll_build_name(buffer, sizeof(buffer), Arguments::get_dll_dir(), "java"); |
kamg@677 | 346 | _native_java_library = dll_load(buffer, ebuf, sizeof(ebuf)); |
duke@435 | 347 | if (_native_java_library == NULL) { |
duke@435 | 348 | vm_exit_during_initialization("Unable to load native library", ebuf); |
duke@435 | 349 | } |
kamg@677 | 350 | } |
kamg@677 | 351 | static jboolean onLoaded = JNI_FALSE; |
kamg@677 | 352 | if (onLoaded) { |
kamg@677 | 353 | // We may have to wait to fire OnLoad until TLS is initialized. |
kamg@677 | 354 | if (ThreadLocalStorage::is_initialized()) { |
kamg@677 | 355 | // The JNI_OnLoad handling is normally done by method load in |
kamg@677 | 356 | // java.lang.ClassLoader$NativeLibrary, but the VM loads the base library |
kamg@677 | 357 | // explicitly so we have to check for JNI_OnLoad as well |
kamg@677 | 358 | const char *onLoadSymbols[] = JNI_ONLOAD_SYMBOLS; |
kamg@677 | 359 | JNI_OnLoad_t JNI_OnLoad = CAST_TO_FN_PTR( |
kamg@677 | 360 | JNI_OnLoad_t, dll_lookup(_native_java_library, onLoadSymbols[0])); |
kamg@677 | 361 | if (JNI_OnLoad != NULL) { |
kamg@677 | 362 | JavaThread* thread = JavaThread::current(); |
kamg@677 | 363 | ThreadToNativeFromVM ttn(thread); |
kamg@677 | 364 | HandleMark hm(thread); |
kamg@677 | 365 | jint ver = (*JNI_OnLoad)(&main_vm, NULL); |
kamg@677 | 366 | onLoaded = JNI_TRUE; |
kamg@677 | 367 | if (!Threads::is_supported_jni_version_including_1_1(ver)) { |
kamg@677 | 368 | vm_exit_during_initialization("Unsupported JNI version"); |
kamg@677 | 369 | } |
duke@435 | 370 | } |
duke@435 | 371 | } |
duke@435 | 372 | } |
duke@435 | 373 | return _native_java_library; |
duke@435 | 374 | } |
duke@435 | 375 | |
duke@435 | 376 | // --------------------- heap allocation utilities --------------------- |
duke@435 | 377 | |
duke@435 | 378 | char *os::strdup(const char *str) { |
duke@435 | 379 | size_t size = strlen(str); |
duke@435 | 380 | char *dup_str = (char *)malloc(size + 1); |
duke@435 | 381 | if (dup_str == NULL) return NULL; |
duke@435 | 382 | strcpy(dup_str, str); |
duke@435 | 383 | return dup_str; |
duke@435 | 384 | } |
duke@435 | 385 | |
duke@435 | 386 | |
duke@435 | 387 | |
duke@435 | 388 | #ifdef ASSERT |
duke@435 | 389 | #define space_before (MallocCushion + sizeof(double)) |
duke@435 | 390 | #define space_after MallocCushion |
duke@435 | 391 | #define size_addr_from_base(p) (size_t*)(p + space_before - sizeof(size_t)) |
duke@435 | 392 | #define size_addr_from_obj(p) ((size_t*)p - 1) |
duke@435 | 393 | // MallocCushion: size of extra cushion allocated around objects with +UseMallocOnly |
duke@435 | 394 | // NB: cannot be debug variable, because these aren't set from the command line until |
duke@435 | 395 | // *after* the first few allocs already happened |
duke@435 | 396 | #define MallocCushion 16 |
duke@435 | 397 | #else |
duke@435 | 398 | #define space_before 0 |
duke@435 | 399 | #define space_after 0 |
duke@435 | 400 | #define size_addr_from_base(p) should not use w/o ASSERT |
duke@435 | 401 | #define size_addr_from_obj(p) should not use w/o ASSERT |
duke@435 | 402 | #define MallocCushion 0 |
duke@435 | 403 | #endif |
duke@435 | 404 | #define paranoid 0 /* only set to 1 if you suspect checking code has bug */ |
duke@435 | 405 | |
duke@435 | 406 | #ifdef ASSERT |
duke@435 | 407 | inline size_t get_size(void* obj) { |
duke@435 | 408 | size_t size = *size_addr_from_obj(obj); |
duke@435 | 409 | if (size < 0 ) |
duke@435 | 410 | fatal2("free: size field of object #%p was overwritten (%lu)", obj, size); |
duke@435 | 411 | return size; |
duke@435 | 412 | } |
duke@435 | 413 | |
duke@435 | 414 | u_char* find_cushion_backwards(u_char* start) { |
duke@435 | 415 | u_char* p = start; |
duke@435 | 416 | while (p[ 0] != badResourceValue || p[-1] != badResourceValue || |
duke@435 | 417 | p[-2] != badResourceValue || p[-3] != badResourceValue) p--; |
duke@435 | 418 | // ok, we have four consecutive marker bytes; find start |
duke@435 | 419 | u_char* q = p - 4; |
duke@435 | 420 | while (*q == badResourceValue) q--; |
duke@435 | 421 | return q + 1; |
duke@435 | 422 | } |
duke@435 | 423 | |
duke@435 | 424 | u_char* find_cushion_forwards(u_char* start) { |
duke@435 | 425 | u_char* p = start; |
duke@435 | 426 | while (p[0] != badResourceValue || p[1] != badResourceValue || |
duke@435 | 427 | p[2] != badResourceValue || p[3] != badResourceValue) p++; |
duke@435 | 428 | // ok, we have four consecutive marker bytes; find end of cushion |
duke@435 | 429 | u_char* q = p + 4; |
duke@435 | 430 | while (*q == badResourceValue) q++; |
duke@435 | 431 | return q - MallocCushion; |
duke@435 | 432 | } |
duke@435 | 433 | |
duke@435 | 434 | void print_neighbor_blocks(void* ptr) { |
duke@435 | 435 | // find block allocated before ptr (not entirely crash-proof) |
duke@435 | 436 | if (MallocCushion < 4) { |
duke@435 | 437 | tty->print_cr("### cannot find previous block (MallocCushion < 4)"); |
duke@435 | 438 | return; |
duke@435 | 439 | } |
duke@435 | 440 | u_char* start_of_this_block = (u_char*)ptr - space_before; |
duke@435 | 441 | u_char* end_of_prev_block_data = start_of_this_block - space_after -1; |
duke@435 | 442 | // look for cushion in front of prev. block |
duke@435 | 443 | u_char* start_of_prev_block = find_cushion_backwards(end_of_prev_block_data); |
duke@435 | 444 | ptrdiff_t size = *size_addr_from_base(start_of_prev_block); |
duke@435 | 445 | u_char* obj = start_of_prev_block + space_before; |
duke@435 | 446 | if (size <= 0 ) { |
duke@435 | 447 | // start is bad; mayhave been confused by OS data inbetween objects |
duke@435 | 448 | // search one more backwards |
duke@435 | 449 | start_of_prev_block = find_cushion_backwards(start_of_prev_block); |
duke@435 | 450 | size = *size_addr_from_base(start_of_prev_block); |
duke@435 | 451 | obj = start_of_prev_block + space_before; |
duke@435 | 452 | } |
duke@435 | 453 | |
duke@435 | 454 | if (start_of_prev_block + space_before + size + space_after == start_of_this_block) { |
duke@435 | 455 | tty->print_cr("### previous object: %p (%ld bytes)", obj, size); |
duke@435 | 456 | } else { |
duke@435 | 457 | tty->print_cr("### previous object (not sure if correct): %p (%ld bytes)", obj, size); |
duke@435 | 458 | } |
duke@435 | 459 | |
duke@435 | 460 | // now find successor block |
duke@435 | 461 | u_char* start_of_next_block = (u_char*)ptr + *size_addr_from_obj(ptr) + space_after; |
duke@435 | 462 | start_of_next_block = find_cushion_forwards(start_of_next_block); |
duke@435 | 463 | u_char* next_obj = start_of_next_block + space_before; |
duke@435 | 464 | ptrdiff_t next_size = *size_addr_from_base(start_of_next_block); |
duke@435 | 465 | if (start_of_next_block[0] == badResourceValue && |
duke@435 | 466 | start_of_next_block[1] == badResourceValue && |
duke@435 | 467 | start_of_next_block[2] == badResourceValue && |
duke@435 | 468 | start_of_next_block[3] == badResourceValue) { |
duke@435 | 469 | tty->print_cr("### next object: %p (%ld bytes)", next_obj, next_size); |
duke@435 | 470 | } else { |
duke@435 | 471 | tty->print_cr("### next object (not sure if correct): %p (%ld bytes)", next_obj, next_size); |
duke@435 | 472 | } |
duke@435 | 473 | } |
duke@435 | 474 | |
duke@435 | 475 | |
duke@435 | 476 | void report_heap_error(void* memblock, void* bad, const char* where) { |
duke@435 | 477 | tty->print_cr("## nof_mallocs = %d, nof_frees = %d", os::num_mallocs, os::num_frees); |
duke@435 | 478 | tty->print_cr("## memory stomp: byte at %p %s object %p", bad, where, memblock); |
duke@435 | 479 | print_neighbor_blocks(memblock); |
duke@435 | 480 | fatal("memory stomping error"); |
duke@435 | 481 | } |
duke@435 | 482 | |
duke@435 | 483 | void verify_block(void* memblock) { |
duke@435 | 484 | size_t size = get_size(memblock); |
duke@435 | 485 | if (MallocCushion) { |
duke@435 | 486 | u_char* ptr = (u_char*)memblock - space_before; |
duke@435 | 487 | for (int i = 0; i < MallocCushion; i++) { |
duke@435 | 488 | if (ptr[i] != badResourceValue) { |
duke@435 | 489 | report_heap_error(memblock, ptr+i, "in front of"); |
duke@435 | 490 | } |
duke@435 | 491 | } |
duke@435 | 492 | u_char* end = (u_char*)memblock + size + space_after; |
duke@435 | 493 | for (int j = -MallocCushion; j < 0; j++) { |
duke@435 | 494 | if (end[j] != badResourceValue) { |
duke@435 | 495 | report_heap_error(memblock, end+j, "after"); |
duke@435 | 496 | } |
duke@435 | 497 | } |
duke@435 | 498 | } |
duke@435 | 499 | } |
duke@435 | 500 | #endif |
duke@435 | 501 | |
duke@435 | 502 | void* os::malloc(size_t size) { |
duke@435 | 503 | NOT_PRODUCT(num_mallocs++); |
duke@435 | 504 | NOT_PRODUCT(alloc_bytes += size); |
duke@435 | 505 | |
duke@435 | 506 | if (size == 0) { |
duke@435 | 507 | // return a valid pointer if size is zero |
duke@435 | 508 | // if NULL is returned the calling functions assume out of memory. |
duke@435 | 509 | size = 1; |
duke@435 | 510 | } |
duke@435 | 511 | |
duke@435 | 512 | NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap()); |
duke@435 | 513 | u_char* ptr = (u_char*)::malloc(size + space_before + space_after); |
duke@435 | 514 | #ifdef ASSERT |
duke@435 | 515 | if (ptr == NULL) return NULL; |
duke@435 | 516 | if (MallocCushion) { |
duke@435 | 517 | for (u_char* p = ptr; p < ptr + MallocCushion; p++) *p = (u_char)badResourceValue; |
duke@435 | 518 | u_char* end = ptr + space_before + size; |
duke@435 | 519 | for (u_char* pq = ptr+MallocCushion; pq < end; pq++) *pq = (u_char)uninitBlockPad; |
duke@435 | 520 | for (u_char* q = end; q < end + MallocCushion; q++) *q = (u_char)badResourceValue; |
duke@435 | 521 | } |
duke@435 | 522 | // put size just before data |
duke@435 | 523 | *size_addr_from_base(ptr) = size; |
duke@435 | 524 | #endif |
duke@435 | 525 | u_char* memblock = ptr + space_before; |
duke@435 | 526 | if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) { |
duke@435 | 527 | tty->print_cr("os::malloc caught, %lu bytes --> %p", size, memblock); |
duke@435 | 528 | breakpoint(); |
duke@435 | 529 | } |
duke@435 | 530 | debug_only(if (paranoid) verify_block(memblock)); |
duke@435 | 531 | if (PrintMalloc && tty != NULL) tty->print_cr("os::malloc %lu bytes --> %p", size, memblock); |
duke@435 | 532 | return memblock; |
duke@435 | 533 | } |
duke@435 | 534 | |
duke@435 | 535 | |
duke@435 | 536 | void* os::realloc(void *memblock, size_t size) { |
duke@435 | 537 | NOT_PRODUCT(num_mallocs++); |
duke@435 | 538 | NOT_PRODUCT(alloc_bytes += size); |
duke@435 | 539 | #ifndef ASSERT |
duke@435 | 540 | return ::realloc(memblock, size); |
duke@435 | 541 | #else |
duke@435 | 542 | if (memblock == NULL) { |
duke@435 | 543 | return os::malloc(size); |
duke@435 | 544 | } |
duke@435 | 545 | if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) { |
duke@435 | 546 | tty->print_cr("os::realloc caught %p", memblock); |
duke@435 | 547 | breakpoint(); |
duke@435 | 548 | } |
duke@435 | 549 | verify_block(memblock); |
duke@435 | 550 | NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap()); |
duke@435 | 551 | if (size == 0) return NULL; |
duke@435 | 552 | // always move the block |
duke@435 | 553 | void* ptr = malloc(size); |
duke@435 | 554 | if (PrintMalloc) tty->print_cr("os::remalloc %lu bytes, %p --> %p", size, memblock, ptr); |
duke@435 | 555 | // Copy to new memory if malloc didn't fail |
duke@435 | 556 | if ( ptr != NULL ) { |
duke@435 | 557 | memcpy(ptr, memblock, MIN2(size, get_size(memblock))); |
duke@435 | 558 | if (paranoid) verify_block(ptr); |
duke@435 | 559 | if ((intptr_t)ptr == (intptr_t)MallocCatchPtr) { |
duke@435 | 560 | tty->print_cr("os::realloc caught, %lu bytes --> %p", size, ptr); |
duke@435 | 561 | breakpoint(); |
duke@435 | 562 | } |
duke@435 | 563 | free(memblock); |
duke@435 | 564 | } |
duke@435 | 565 | return ptr; |
duke@435 | 566 | #endif |
duke@435 | 567 | } |
duke@435 | 568 | |
duke@435 | 569 | |
duke@435 | 570 | void os::free(void *memblock) { |
duke@435 | 571 | NOT_PRODUCT(num_frees++); |
duke@435 | 572 | #ifdef ASSERT |
duke@435 | 573 | if (memblock == NULL) return; |
duke@435 | 574 | if ((intptr_t)memblock == (intptr_t)MallocCatchPtr) { |
duke@435 | 575 | if (tty != NULL) tty->print_cr("os::free caught %p", memblock); |
duke@435 | 576 | breakpoint(); |
duke@435 | 577 | } |
duke@435 | 578 | verify_block(memblock); |
duke@435 | 579 | if (PrintMalloc && tty != NULL) |
duke@435 | 580 | // tty->print_cr("os::free %p", memblock); |
duke@435 | 581 | fprintf(stderr, "os::free %p\n", memblock); |
duke@435 | 582 | NOT_PRODUCT(if (MallocVerifyInterval > 0) check_heap()); |
duke@435 | 583 | // Added by detlefs. |
duke@435 | 584 | if (MallocCushion) { |
duke@435 | 585 | u_char* ptr = (u_char*)memblock - space_before; |
duke@435 | 586 | for (u_char* p = ptr; p < ptr + MallocCushion; p++) { |
duke@435 | 587 | guarantee(*p == badResourceValue, |
duke@435 | 588 | "Thing freed should be malloc result."); |
duke@435 | 589 | *p = (u_char)freeBlockPad; |
duke@435 | 590 | } |
duke@435 | 591 | size_t size = get_size(memblock); |
duke@435 | 592 | u_char* end = ptr + space_before + size; |
duke@435 | 593 | for (u_char* q = end; q < end + MallocCushion; q++) { |
duke@435 | 594 | guarantee(*q == badResourceValue, |
duke@435 | 595 | "Thing freed should be malloc result."); |
duke@435 | 596 | *q = (u_char)freeBlockPad; |
duke@435 | 597 | } |
duke@435 | 598 | } |
duke@435 | 599 | #endif |
duke@435 | 600 | ::free((char*)memblock - space_before); |
duke@435 | 601 | } |
duke@435 | 602 | |
duke@435 | 603 | void os::init_random(long initval) { |
duke@435 | 604 | _rand_seed = initval; |
duke@435 | 605 | } |
duke@435 | 606 | |
duke@435 | 607 | |
duke@435 | 608 | long os::random() { |
duke@435 | 609 | /* standard, well-known linear congruential random generator with |
duke@435 | 610 | * next_rand = (16807*seed) mod (2**31-1) |
duke@435 | 611 | * see |
duke@435 | 612 | * (1) "Random Number Generators: Good Ones Are Hard to Find", |
duke@435 | 613 | * S.K. Park and K.W. Miller, Communications of the ACM 31:10 (Oct 1988), |
duke@435 | 614 | * (2) "Two Fast Implementations of the 'Minimal Standard' Random |
duke@435 | 615 | * Number Generator", David G. Carta, Comm. ACM 33, 1 (Jan 1990), pp. 87-88. |
duke@435 | 616 | */ |
duke@435 | 617 | const long a = 16807; |
duke@435 | 618 | const unsigned long m = 2147483647; |
duke@435 | 619 | const long q = m / a; assert(q == 127773, "weird math"); |
duke@435 | 620 | const long r = m % a; assert(r == 2836, "weird math"); |
duke@435 | 621 | |
duke@435 | 622 | // compute az=2^31p+q |
duke@435 | 623 | unsigned long lo = a * (long)(_rand_seed & 0xFFFF); |
duke@435 | 624 | unsigned long hi = a * (long)((unsigned long)_rand_seed >> 16); |
duke@435 | 625 | lo += (hi & 0x7FFF) << 16; |
duke@435 | 626 | |
duke@435 | 627 | // if q overflowed, ignore the overflow and increment q |
duke@435 | 628 | if (lo > m) { |
duke@435 | 629 | lo &= m; |
duke@435 | 630 | ++lo; |
duke@435 | 631 | } |
duke@435 | 632 | lo += hi >> 15; |
duke@435 | 633 | |
duke@435 | 634 | // if (p+q) overflowed, ignore the overflow and increment (p+q) |
duke@435 | 635 | if (lo > m) { |
duke@435 | 636 | lo &= m; |
duke@435 | 637 | ++lo; |
duke@435 | 638 | } |
duke@435 | 639 | return (_rand_seed = lo); |
duke@435 | 640 | } |
duke@435 | 641 | |
duke@435 | 642 | // The INITIALIZED state is distinguished from the SUSPENDED state because the |
duke@435 | 643 | // conditions in which a thread is first started are different from those in which |
duke@435 | 644 | // a suspension is resumed. These differences make it hard for us to apply the |
duke@435 | 645 | // tougher checks when starting threads that we want to do when resuming them. |
duke@435 | 646 | // However, when start_thread is called as a result of Thread.start, on a Java |
duke@435 | 647 | // thread, the operation is synchronized on the Java Thread object. So there |
duke@435 | 648 | // cannot be a race to start the thread and hence for the thread to exit while |
duke@435 | 649 | // we are working on it. Non-Java threads that start Java threads either have |
duke@435 | 650 | // to do so in a context in which races are impossible, or should do appropriate |
duke@435 | 651 | // locking. |
duke@435 | 652 | |
duke@435 | 653 | void os::start_thread(Thread* thread) { |
duke@435 | 654 | // guard suspend/resume |
duke@435 | 655 | MutexLockerEx ml(thread->SR_lock(), Mutex::_no_safepoint_check_flag); |
duke@435 | 656 | OSThread* osthread = thread->osthread(); |
duke@435 | 657 | osthread->set_state(RUNNABLE); |
duke@435 | 658 | pd_start_thread(thread); |
duke@435 | 659 | } |
duke@435 | 660 | |
duke@435 | 661 | //--------------------------------------------------------------------------- |
duke@435 | 662 | // Helper functions for fatal error handler |
duke@435 | 663 | |
duke@435 | 664 | void os::print_hex_dump(outputStream* st, address start, address end, int unitsize) { |
duke@435 | 665 | assert(unitsize == 1 || unitsize == 2 || unitsize == 4 || unitsize == 8, "just checking"); |
duke@435 | 666 | |
duke@435 | 667 | int cols = 0; |
duke@435 | 668 | int cols_per_line = 0; |
duke@435 | 669 | switch (unitsize) { |
duke@435 | 670 | case 1: cols_per_line = 16; break; |
duke@435 | 671 | case 2: cols_per_line = 8; break; |
duke@435 | 672 | case 4: cols_per_line = 4; break; |
duke@435 | 673 | case 8: cols_per_line = 2; break; |
duke@435 | 674 | default: return; |
duke@435 | 675 | } |
duke@435 | 676 | |
duke@435 | 677 | address p = start; |
duke@435 | 678 | st->print(PTR_FORMAT ": ", start); |
duke@435 | 679 | while (p < end) { |
duke@435 | 680 | switch (unitsize) { |
duke@435 | 681 | case 1: st->print("%02x", *(u1*)p); break; |
duke@435 | 682 | case 2: st->print("%04x", *(u2*)p); break; |
duke@435 | 683 | case 4: st->print("%08x", *(u4*)p); break; |
duke@435 | 684 | case 8: st->print("%016" FORMAT64_MODIFIER "x", *(u8*)p); break; |
duke@435 | 685 | } |
duke@435 | 686 | p += unitsize; |
duke@435 | 687 | cols++; |
duke@435 | 688 | if (cols >= cols_per_line && p < end) { |
duke@435 | 689 | cols = 0; |
duke@435 | 690 | st->cr(); |
duke@435 | 691 | st->print(PTR_FORMAT ": ", p); |
duke@435 | 692 | } else { |
duke@435 | 693 | st->print(" "); |
duke@435 | 694 | } |
duke@435 | 695 | } |
duke@435 | 696 | st->cr(); |
duke@435 | 697 | } |
duke@435 | 698 | |
duke@435 | 699 | void os::print_environment_variables(outputStream* st, const char** env_list, |
duke@435 | 700 | char* buffer, int len) { |
duke@435 | 701 | if (env_list) { |
duke@435 | 702 | st->print_cr("Environment Variables:"); |
duke@435 | 703 | |
duke@435 | 704 | for (int i = 0; env_list[i] != NULL; i++) { |
duke@435 | 705 | if (getenv(env_list[i], buffer, len)) { |
duke@435 | 706 | st->print(env_list[i]); |
duke@435 | 707 | st->print("="); |
duke@435 | 708 | st->print_cr(buffer); |
duke@435 | 709 | } |
duke@435 | 710 | } |
duke@435 | 711 | } |
duke@435 | 712 | } |
duke@435 | 713 | |
duke@435 | 714 | void os::print_cpu_info(outputStream* st) { |
duke@435 | 715 | // cpu |
duke@435 | 716 | st->print("CPU:"); |
duke@435 | 717 | st->print("total %d", os::processor_count()); |
duke@435 | 718 | // It's not safe to query number of active processors after crash |
duke@435 | 719 | // st->print("(active %d)", os::active_processor_count()); |
duke@435 | 720 | st->print(" %s", VM_Version::cpu_features()); |
duke@435 | 721 | st->cr(); |
duke@435 | 722 | } |
duke@435 | 723 | |
duke@435 | 724 | void os::print_date_and_time(outputStream *st) { |
duke@435 | 725 | time_t tloc; |
duke@435 | 726 | (void)time(&tloc); |
duke@435 | 727 | st->print("time: %s", ctime(&tloc)); // ctime adds newline. |
duke@435 | 728 | |
duke@435 | 729 | double t = os::elapsedTime(); |
duke@435 | 730 | // NOTE: It tends to crash after a SEGV if we want to printf("%f",...) in |
duke@435 | 731 | // Linux. Must be a bug in glibc ? Workaround is to round "t" to int |
duke@435 | 732 | // before printf. We lost some precision, but who cares? |
duke@435 | 733 | st->print_cr("elapsed time: %d seconds", (int)t); |
duke@435 | 734 | } |
duke@435 | 735 | |
duke@435 | 736 | |
duke@435 | 737 | // Looks like all platforms except IA64 can use the same function to check |
duke@435 | 738 | // if C stack is walkable beyond current frame. The check for fp() is not |
duke@435 | 739 | // necessary on Sparc, but it's harmless. |
duke@435 | 740 | bool os::is_first_C_frame(frame* fr) { |
duke@435 | 741 | #ifdef IA64 |
duke@435 | 742 | // In order to walk native frames on Itanium, we need to access the unwind |
duke@435 | 743 | // table, which is inside ELF. We don't want to parse ELF after fatal error, |
duke@435 | 744 | // so return true for IA64. If we need to support C stack walking on IA64, |
duke@435 | 745 | // this function needs to be moved to CPU specific files, as fp() on IA64 |
duke@435 | 746 | // is register stack, which grows towards higher memory address. |
duke@435 | 747 | return true; |
duke@435 | 748 | #endif |
duke@435 | 749 | |
duke@435 | 750 | // Load up sp, fp, sender sp and sender fp, check for reasonable values. |
duke@435 | 751 | // Check usp first, because if that's bad the other accessors may fault |
duke@435 | 752 | // on some architectures. Ditto ufp second, etc. |
duke@435 | 753 | uintptr_t fp_align_mask = (uintptr_t)(sizeof(address)-1); |
duke@435 | 754 | // sp on amd can be 32 bit aligned. |
duke@435 | 755 | uintptr_t sp_align_mask = (uintptr_t)(sizeof(int)-1); |
duke@435 | 756 | |
duke@435 | 757 | uintptr_t usp = (uintptr_t)fr->sp(); |
duke@435 | 758 | if ((usp & sp_align_mask) != 0) return true; |
duke@435 | 759 | |
duke@435 | 760 | uintptr_t ufp = (uintptr_t)fr->fp(); |
duke@435 | 761 | if ((ufp & fp_align_mask) != 0) return true; |
duke@435 | 762 | |
duke@435 | 763 | uintptr_t old_sp = (uintptr_t)fr->sender_sp(); |
duke@435 | 764 | if ((old_sp & sp_align_mask) != 0) return true; |
duke@435 | 765 | if (old_sp == 0 || old_sp == (uintptr_t)-1) return true; |
duke@435 | 766 | |
duke@435 | 767 | uintptr_t old_fp = (uintptr_t)fr->link(); |
duke@435 | 768 | if ((old_fp & fp_align_mask) != 0) return true; |
duke@435 | 769 | if (old_fp == 0 || old_fp == (uintptr_t)-1 || old_fp == ufp) return true; |
duke@435 | 770 | |
duke@435 | 771 | // stack grows downwards; if old_fp is below current fp or if the stack |
duke@435 | 772 | // frame is too large, either the stack is corrupted or fp is not saved |
duke@435 | 773 | // on stack (i.e. on x86, ebp may be used as general register). The stack |
duke@435 | 774 | // is not walkable beyond current frame. |
duke@435 | 775 | if (old_fp < ufp) return true; |
duke@435 | 776 | if (old_fp - ufp > 64 * K) return true; |
duke@435 | 777 | |
duke@435 | 778 | return false; |
duke@435 | 779 | } |
duke@435 | 780 | |
duke@435 | 781 | #ifdef ASSERT |
duke@435 | 782 | extern "C" void test_random() { |
duke@435 | 783 | const double m = 2147483647; |
duke@435 | 784 | double mean = 0.0, variance = 0.0, t; |
duke@435 | 785 | long reps = 10000; |
duke@435 | 786 | unsigned long seed = 1; |
duke@435 | 787 | |
duke@435 | 788 | tty->print_cr("seed %ld for %ld repeats...", seed, reps); |
duke@435 | 789 | os::init_random(seed); |
duke@435 | 790 | long num; |
duke@435 | 791 | for (int k = 0; k < reps; k++) { |
duke@435 | 792 | num = os::random(); |
duke@435 | 793 | double u = (double)num / m; |
duke@435 | 794 | assert(u >= 0.0 && u <= 1.0, "bad random number!"); |
duke@435 | 795 | |
duke@435 | 796 | // calculate mean and variance of the random sequence |
duke@435 | 797 | mean += u; |
duke@435 | 798 | variance += (u*u); |
duke@435 | 799 | } |
duke@435 | 800 | mean /= reps; |
duke@435 | 801 | variance /= (reps - 1); |
duke@435 | 802 | |
duke@435 | 803 | assert(num == 1043618065, "bad seed"); |
duke@435 | 804 | tty->print_cr("mean of the 1st 10000 numbers: %f", mean); |
duke@435 | 805 | tty->print_cr("variance of the 1st 10000 numbers: %f", variance); |
duke@435 | 806 | const double eps = 0.0001; |
duke@435 | 807 | t = fabsd(mean - 0.5018); |
duke@435 | 808 | assert(t < eps, "bad mean"); |
duke@435 | 809 | t = (variance - 0.3355) < 0.0 ? -(variance - 0.3355) : variance - 0.3355; |
duke@435 | 810 | assert(t < eps, "bad variance"); |
duke@435 | 811 | } |
duke@435 | 812 | #endif |
duke@435 | 813 | |
duke@435 | 814 | |
duke@435 | 815 | // Set up the boot classpath. |
duke@435 | 816 | |
duke@435 | 817 | char* os::format_boot_path(const char* format_string, |
duke@435 | 818 | const char* home, |
duke@435 | 819 | int home_len, |
duke@435 | 820 | char fileSep, |
duke@435 | 821 | char pathSep) { |
duke@435 | 822 | assert((fileSep == '/' && pathSep == ':') || |
duke@435 | 823 | (fileSep == '\\' && pathSep == ';'), "unexpected seperator chars"); |
duke@435 | 824 | |
duke@435 | 825 | // Scan the format string to determine the length of the actual |
duke@435 | 826 | // boot classpath, and handle platform dependencies as well. |
duke@435 | 827 | int formatted_path_len = 0; |
duke@435 | 828 | const char* p; |
duke@435 | 829 | for (p = format_string; *p != 0; ++p) { |
duke@435 | 830 | if (*p == '%') formatted_path_len += home_len - 1; |
duke@435 | 831 | ++formatted_path_len; |
duke@435 | 832 | } |
duke@435 | 833 | |
duke@435 | 834 | char* formatted_path = NEW_C_HEAP_ARRAY(char, formatted_path_len + 1); |
duke@435 | 835 | if (formatted_path == NULL) { |
duke@435 | 836 | return NULL; |
duke@435 | 837 | } |
duke@435 | 838 | |
duke@435 | 839 | // Create boot classpath from format, substituting separator chars and |
duke@435 | 840 | // java home directory. |
duke@435 | 841 | char* q = formatted_path; |
duke@435 | 842 | for (p = format_string; *p != 0; ++p) { |
duke@435 | 843 | switch (*p) { |
duke@435 | 844 | case '%': |
duke@435 | 845 | strcpy(q, home); |
duke@435 | 846 | q += home_len; |
duke@435 | 847 | break; |
duke@435 | 848 | case '/': |
duke@435 | 849 | *q++ = fileSep; |
duke@435 | 850 | break; |
duke@435 | 851 | case ':': |
duke@435 | 852 | *q++ = pathSep; |
duke@435 | 853 | break; |
duke@435 | 854 | default: |
duke@435 | 855 | *q++ = *p; |
duke@435 | 856 | } |
duke@435 | 857 | } |
duke@435 | 858 | *q = '\0'; |
duke@435 | 859 | |
duke@435 | 860 | assert((q - formatted_path) == formatted_path_len, "formatted_path size botched"); |
duke@435 | 861 | return formatted_path; |
duke@435 | 862 | } |
duke@435 | 863 | |
duke@435 | 864 | |
duke@435 | 865 | bool os::set_boot_path(char fileSep, char pathSep) { |
duke@435 | 866 | const char* home = Arguments::get_java_home(); |
duke@435 | 867 | int home_len = (int)strlen(home); |
duke@435 | 868 | |
duke@435 | 869 | static const char* meta_index_dir_format = "%/lib/"; |
duke@435 | 870 | static const char* meta_index_format = "%/lib/meta-index"; |
duke@435 | 871 | char* meta_index = format_boot_path(meta_index_format, home, home_len, fileSep, pathSep); |
duke@435 | 872 | if (meta_index == NULL) return false; |
duke@435 | 873 | char* meta_index_dir = format_boot_path(meta_index_dir_format, home, home_len, fileSep, pathSep); |
duke@435 | 874 | if (meta_index_dir == NULL) return false; |
duke@435 | 875 | Arguments::set_meta_index_path(meta_index, meta_index_dir); |
duke@435 | 876 | |
duke@435 | 877 | // Any modification to the JAR-file list, for the boot classpath must be |
duke@435 | 878 | // aligned with install/install/make/common/Pack.gmk. Note: boot class |
duke@435 | 879 | // path class JARs, are stripped for StackMapTable to reduce download size. |
duke@435 | 880 | static const char classpath_format[] = |
duke@435 | 881 | "%/lib/resources.jar:" |
duke@435 | 882 | "%/lib/rt.jar:" |
duke@435 | 883 | "%/lib/sunrsasign.jar:" |
duke@435 | 884 | "%/lib/jsse.jar:" |
duke@435 | 885 | "%/lib/jce.jar:" |
duke@435 | 886 | "%/lib/charsets.jar:" |
duke@435 | 887 | "%/classes"; |
duke@435 | 888 | char* sysclasspath = format_boot_path(classpath_format, home, home_len, fileSep, pathSep); |
duke@435 | 889 | if (sysclasspath == NULL) return false; |
duke@435 | 890 | Arguments::set_sysclasspath(sysclasspath); |
duke@435 | 891 | |
duke@435 | 892 | return true; |
duke@435 | 893 | } |
duke@435 | 894 | |
phh@1126 | 895 | /* |
phh@1126 | 896 | * Splits a path, based on its separator, the number of |
phh@1126 | 897 | * elements is returned back in n. |
phh@1126 | 898 | * It is the callers responsibility to: |
phh@1126 | 899 | * a> check the value of n, and n may be 0. |
phh@1126 | 900 | * b> ignore any empty path elements |
phh@1126 | 901 | * c> free up the data. |
phh@1126 | 902 | */ |
phh@1126 | 903 | char** os::split_path(const char* path, int* n) { |
phh@1126 | 904 | *n = 0; |
phh@1126 | 905 | if (path == NULL || strlen(path) == 0) { |
phh@1126 | 906 | return NULL; |
phh@1126 | 907 | } |
phh@1126 | 908 | const char psepchar = *os::path_separator(); |
phh@1126 | 909 | char* inpath = (char*)NEW_C_HEAP_ARRAY(char, strlen(path) + 1); |
phh@1126 | 910 | if (inpath == NULL) { |
phh@1126 | 911 | return NULL; |
phh@1126 | 912 | } |
phh@1126 | 913 | strncpy(inpath, path, strlen(path)); |
phh@1126 | 914 | int count = 1; |
phh@1126 | 915 | char* p = strchr(inpath, psepchar); |
phh@1126 | 916 | // Get a count of elements to allocate memory |
phh@1126 | 917 | while (p != NULL) { |
phh@1126 | 918 | count++; |
phh@1126 | 919 | p++; |
phh@1126 | 920 | p = strchr(p, psepchar); |
phh@1126 | 921 | } |
phh@1126 | 922 | char** opath = (char**) NEW_C_HEAP_ARRAY(char*, count); |
phh@1126 | 923 | if (opath == NULL) { |
phh@1126 | 924 | return NULL; |
phh@1126 | 925 | } |
phh@1126 | 926 | |
phh@1126 | 927 | // do the actual splitting |
phh@1126 | 928 | p = inpath; |
phh@1126 | 929 | for (int i = 0 ; i < count ; i++) { |
phh@1126 | 930 | size_t len = strcspn(p, os::path_separator()); |
phh@1126 | 931 | if (len > JVM_MAXPATHLEN) { |
phh@1126 | 932 | return NULL; |
phh@1126 | 933 | } |
phh@1126 | 934 | // allocate the string and add terminator storage |
phh@1126 | 935 | char* s = (char*)NEW_C_HEAP_ARRAY(char, len + 1); |
phh@1126 | 936 | if (s == NULL) { |
phh@1126 | 937 | return NULL; |
phh@1126 | 938 | } |
phh@1126 | 939 | strncpy(s, p, len); |
phh@1126 | 940 | s[len] = '\0'; |
phh@1126 | 941 | opath[i] = s; |
phh@1126 | 942 | p += len + 1; |
phh@1126 | 943 | } |
phh@1126 | 944 | FREE_C_HEAP_ARRAY(char, inpath); |
phh@1126 | 945 | *n = count; |
phh@1126 | 946 | return opath; |
phh@1126 | 947 | } |
phh@1126 | 948 | |
duke@435 | 949 | void os::set_memory_serialize_page(address page) { |
duke@435 | 950 | int count = log2_intptr(sizeof(class JavaThread)) - log2_intptr(64); |
duke@435 | 951 | _mem_serialize_page = (volatile int32_t *)page; |
duke@435 | 952 | // We initialize the serialization page shift count here |
duke@435 | 953 | // We assume a cache line size of 64 bytes |
duke@435 | 954 | assert(SerializePageShiftCount == count, |
duke@435 | 955 | "thread size changed, fix SerializePageShiftCount constant"); |
duke@435 | 956 | set_serialize_page_mask((uintptr_t)(vm_page_size() - sizeof(int32_t))); |
duke@435 | 957 | } |
duke@435 | 958 | |
xlu@490 | 959 | static volatile intptr_t SerializePageLock = 0; |
xlu@490 | 960 | |
duke@435 | 961 | // This method is called from signal handler when SIGSEGV occurs while the current |
duke@435 | 962 | // thread tries to store to the "read-only" memory serialize page during state |
duke@435 | 963 | // transition. |
duke@435 | 964 | void os::block_on_serialize_page_trap() { |
duke@435 | 965 | if (TraceSafepoint) { |
duke@435 | 966 | tty->print_cr("Block until the serialize page permission restored"); |
duke@435 | 967 | } |
xlu@490 | 968 | // When VMThread is holding the SerializePageLock during modifying the |
duke@435 | 969 | // access permission of the memory serialize page, the following call |
duke@435 | 970 | // will block until the permission of that page is restored to rw. |
duke@435 | 971 | // Generally, it is unsafe to manipulate locks in signal handlers, but in |
duke@435 | 972 | // this case, it's OK as the signal is synchronous and we know precisely when |
xlu@490 | 973 | // it can occur. |
xlu@490 | 974 | Thread::muxAcquire(&SerializePageLock, "set_memory_serialize_page"); |
xlu@490 | 975 | Thread::muxRelease(&SerializePageLock); |
duke@435 | 976 | } |
duke@435 | 977 | |
duke@435 | 978 | // Serialize all thread state variables |
duke@435 | 979 | void os::serialize_thread_states() { |
duke@435 | 980 | // On some platforms such as Solaris & Linux, the time duration of the page |
duke@435 | 981 | // permission restoration is observed to be much longer than expected due to |
duke@435 | 982 | // scheduler starvation problem etc. To avoid the long synchronization |
xlu@490 | 983 | // time and expensive page trap spinning, 'SerializePageLock' is used to block |
xlu@490 | 984 | // the mutator thread if such case is encountered. See bug 6546278 for details. |
xlu@490 | 985 | Thread::muxAcquire(&SerializePageLock, "serialize_thread_states"); |
coleenp@672 | 986 | os::protect_memory((char *)os::get_memory_serialize_page(), |
coleenp@912 | 987 | os::vm_page_size(), MEM_PROT_READ); |
coleenp@912 | 988 | os::protect_memory((char *)os::get_memory_serialize_page(), |
coleenp@912 | 989 | os::vm_page_size(), MEM_PROT_RW); |
xlu@490 | 990 | Thread::muxRelease(&SerializePageLock); |
duke@435 | 991 | } |
duke@435 | 992 | |
duke@435 | 993 | // Returns true if the current stack pointer is above the stack shadow |
duke@435 | 994 | // pages, false otherwise. |
duke@435 | 995 | |
duke@435 | 996 | bool os::stack_shadow_pages_available(Thread *thread, methodHandle method) { |
duke@435 | 997 | assert(StackRedPages > 0 && StackYellowPages > 0,"Sanity check"); |
duke@435 | 998 | address sp = current_stack_pointer(); |
duke@435 | 999 | // Check if we have StackShadowPages above the yellow zone. This parameter |
twisti@1040 | 1000 | // is dependent on the depth of the maximum VM call stack possible from |
duke@435 | 1001 | // the handler for stack overflow. 'instanceof' in the stack overflow |
duke@435 | 1002 | // handler or a println uses at least 8k stack of VM and native code |
duke@435 | 1003 | // respectively. |
duke@435 | 1004 | const int framesize_in_bytes = |
duke@435 | 1005 | Interpreter::size_top_interpreter_activation(method()) * wordSize; |
duke@435 | 1006 | int reserved_area = ((StackShadowPages + StackRedPages + StackYellowPages) |
duke@435 | 1007 | * vm_page_size()) + framesize_in_bytes; |
duke@435 | 1008 | // The very lower end of the stack |
duke@435 | 1009 | address stack_limit = thread->stack_base() - thread->stack_size(); |
duke@435 | 1010 | return (sp > (stack_limit + reserved_area)); |
duke@435 | 1011 | } |
duke@435 | 1012 | |
duke@435 | 1013 | size_t os::page_size_for_region(size_t region_min_size, size_t region_max_size, |
duke@435 | 1014 | uint min_pages) |
duke@435 | 1015 | { |
duke@435 | 1016 | assert(min_pages > 0, "sanity"); |
duke@435 | 1017 | if (UseLargePages) { |
duke@435 | 1018 | const size_t max_page_size = region_max_size / min_pages; |
duke@435 | 1019 | |
duke@435 | 1020 | for (unsigned int i = 0; _page_sizes[i] != 0; ++i) { |
duke@435 | 1021 | const size_t sz = _page_sizes[i]; |
duke@435 | 1022 | const size_t mask = sz - 1; |
duke@435 | 1023 | if ((region_min_size & mask) == 0 && (region_max_size & mask) == 0) { |
duke@435 | 1024 | // The largest page size with no fragmentation. |
duke@435 | 1025 | return sz; |
duke@435 | 1026 | } |
duke@435 | 1027 | |
duke@435 | 1028 | if (sz <= max_page_size) { |
duke@435 | 1029 | // The largest page size that satisfies the min_pages requirement. |
duke@435 | 1030 | return sz; |
duke@435 | 1031 | } |
duke@435 | 1032 | } |
duke@435 | 1033 | } |
duke@435 | 1034 | |
duke@435 | 1035 | return vm_page_size(); |
duke@435 | 1036 | } |
duke@435 | 1037 | |
duke@435 | 1038 | #ifndef PRODUCT |
duke@435 | 1039 | void os::trace_page_sizes(const char* str, const size_t region_min_size, |
duke@435 | 1040 | const size_t region_max_size, const size_t page_size, |
duke@435 | 1041 | const char* base, const size_t size) |
duke@435 | 1042 | { |
duke@435 | 1043 | if (TracePageSizes) { |
duke@435 | 1044 | tty->print_cr("%s: min=" SIZE_FORMAT " max=" SIZE_FORMAT |
duke@435 | 1045 | " pg_sz=" SIZE_FORMAT " base=" PTR_FORMAT |
duke@435 | 1046 | " size=" SIZE_FORMAT, |
duke@435 | 1047 | str, region_min_size, region_max_size, |
duke@435 | 1048 | page_size, base, size); |
duke@435 | 1049 | } |
duke@435 | 1050 | } |
duke@435 | 1051 | #endif // #ifndef PRODUCT |
duke@435 | 1052 | |
duke@435 | 1053 | // This is the working definition of a server class machine: |
duke@435 | 1054 | // >= 2 physical CPU's and >=2GB of memory, with some fuzz |
duke@435 | 1055 | // because the graphics memory (?) sometimes masks physical memory. |
duke@435 | 1056 | // If you want to change the definition of a server class machine |
duke@435 | 1057 | // on some OS or platform, e.g., >=4GB on Windohs platforms, |
duke@435 | 1058 | // then you'll have to parameterize this method based on that state, |
duke@435 | 1059 | // as was done for logical processors here, or replicate and |
duke@435 | 1060 | // specialize this method for each platform. (Or fix os to have |
duke@435 | 1061 | // some inheritance structure and use subclassing. Sigh.) |
duke@435 | 1062 | // If you want some platform to always or never behave as a server |
duke@435 | 1063 | // class machine, change the setting of AlwaysActAsServerClassMachine |
duke@435 | 1064 | // and NeverActAsServerClassMachine in globals*.hpp. |
duke@435 | 1065 | bool os::is_server_class_machine() { |
duke@435 | 1066 | // First check for the early returns |
duke@435 | 1067 | if (NeverActAsServerClassMachine) { |
duke@435 | 1068 | return false; |
duke@435 | 1069 | } |
duke@435 | 1070 | if (AlwaysActAsServerClassMachine) { |
duke@435 | 1071 | return true; |
duke@435 | 1072 | } |
duke@435 | 1073 | // Then actually look at the machine |
duke@435 | 1074 | bool result = false; |
duke@435 | 1075 | const unsigned int server_processors = 2; |
duke@435 | 1076 | const julong server_memory = 2UL * G; |
duke@435 | 1077 | // We seem not to get our full complement of memory. |
duke@435 | 1078 | // We allow some part (1/8?) of the memory to be "missing", |
duke@435 | 1079 | // based on the sizes of DIMMs, and maybe graphics cards. |
duke@435 | 1080 | const julong missing_memory = 256UL * M; |
duke@435 | 1081 | |
duke@435 | 1082 | /* Is this a server class machine? */ |
duke@435 | 1083 | if ((os::active_processor_count() >= (int)server_processors) && |
duke@435 | 1084 | (os::physical_memory() >= (server_memory - missing_memory))) { |
duke@435 | 1085 | const unsigned int logical_processors = |
duke@435 | 1086 | VM_Version::logical_processors_per_package(); |
duke@435 | 1087 | if (logical_processors > 1) { |
duke@435 | 1088 | const unsigned int physical_packages = |
duke@435 | 1089 | os::active_processor_count() / logical_processors; |
duke@435 | 1090 | if (physical_packages > server_processors) { |
duke@435 | 1091 | result = true; |
duke@435 | 1092 | } |
duke@435 | 1093 | } else { |
duke@435 | 1094 | result = true; |
duke@435 | 1095 | } |
duke@435 | 1096 | } |
duke@435 | 1097 | return result; |
duke@435 | 1098 | } |