src/os_cpu/solaris_sparc/vm/threadLS_solaris_sparc.hpp

Thu, 21 Oct 2010 11:55:10 -0700

author
never
date
Thu, 21 Oct 2010 11:55:10 -0700
changeset 2262
1e9a9d2e6509
parent 1907
c18cbe5936b8
child 2314
f95d63e2154a
permissions
-rw-r--r--

6970683: improvements to hs_err output
Reviewed-by: kvn, jrose, dholmes, coleenp

duke@435 1 /*
trims@1907 2 * Copyright (c) 1998, 2005, 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
duke@435 25 public:
duke@435 26 // Java Thread - force inlining
duke@435 27 static inline Thread* thread() ;
duke@435 28
duke@435 29 private:
duke@435 30 static Thread* _get_thread_cache[]; // index by [(raw_id>>9)^(raw_id>>20) % _pd_cache_size]
duke@435 31 static Thread* get_thread_via_cache_slowly(uintptr_t raw_id, int index);
duke@435 32
duke@435 33 NOT_PRODUCT(static int _tcacheHit;)
duke@435 34 NOT_PRODUCT(static int _tcacheMiss;)
duke@435 35
duke@435 36 public:
duke@435 37
duke@435 38 // Print cache hit/miss statistics
duke@435 39 static void print_statistics() PRODUCT_RETURN;
duke@435 40
duke@435 41 enum Constants {
duke@435 42 _pd_cache_size = 256*2 // projected typical # of threads * 2
duke@435 43 };
duke@435 44
duke@435 45 static void set_thread_in_slot (Thread *) ;
duke@435 46
duke@435 47 static uintptr_t pd_raw_thread_id() {
duke@435 48 return _raw_thread_id();
duke@435 49 }
duke@435 50
duke@435 51 static int pd_cache_index(uintptr_t raw_id) {
duke@435 52 // Hash function: From email from Dave:
duke@435 53 // The hash function deserves an explanation. %g7 points to libthread's
duke@435 54 // "thread" structure. On T1 the thread structure is allocated on the
duke@435 55 // user's stack (yes, really!) so the ">>20" handles T1 where the JVM's
duke@435 56 // stack size is usually >= 1Mb. The ">>9" is for T2 where Roger allocates
duke@435 57 // globs of thread blocks contiguously. The "9" has to do with the
duke@435 58 // expected size of the T2 thread structure. If these constants are wrong
duke@435 59 // the worst thing that'll happen is that the hit rate for heavily threaded
duke@435 60 // apps won't be as good as it could be. If you want to burn another
duke@435 61 // shift+xor you could mix together _all of the %g7 bits to form the hash,
duke@435 62 // but I think that's excessive. Making the change above changed the
duke@435 63 // T$ miss rate on SpecJBB (on a 16X system) from about 3% to imperceptible.
duke@435 64 uintptr_t ix = (int) (((raw_id >> 9) ^ (raw_id >> 20)) % _pd_cache_size);
duke@435 65 return ix;
duke@435 66 }

mercurial