Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/runtime/orderAccess.hpp@f47fa50d9b9c (annotated)

src/share/vm/runtime/orderAccess.hpp

Fri, 28 Mar 2014 10:12:48 -0700

author
vlivanov
date
Fri, 28 Mar 2014 10:12:48 -0700
changeset 6527
f47fa50d9b9c
parent 2314
f95d63e2154a
child 6876
710a3c8b516e
permissions
-rw-r--r--

8035887: VM crashes trying to force inlining the recursive call
Reviewed-by: kvn, twisti

duke@435 1 /*
ysr@2066 2 * Copyright (c) 2003, 2010, 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 #ifndef SHARE_VM_RUNTIME_ORDERACCESS_HPP
stefank@2314 26 #define SHARE_VM_RUNTIME_ORDERACCESS_HPP
stefank@2314 27
stefank@2314 28 #include "memory/allocation.hpp"
stefank@2314 29
duke@435 30 // Memory Access Ordering Model
duke@435 31 //
duke@435 32 // This interface is based on the JSR-133 Cookbook for Compiler Writers
duke@435 33 // and on the IA64 memory model. It is the dynamic equivalent of the
duke@435 34 // C/C++ volatile specifier. I.e., volatility restricts compile-time
duke@435 35 // memory access reordering in a way similar to what we want to occur
duke@435 36 // at runtime.
duke@435 37 //
duke@435 38 // In the following, the terms 'previous', 'subsequent', 'before',
twisti@1040 39 // 'after', 'preceding' and 'succeeding' refer to program order. The
duke@435 40 // terms 'down' and 'below' refer to forward load or store motion
duke@435 41 // relative to program order, while 'up' and 'above' refer to backward
duke@435 42 // motion.
duke@435 43 //
duke@435 44 //
duke@435 45 // We define four primitive memory barrier operations.
duke@435 46 //
duke@435 47 // LoadLoad: Load1(s); LoadLoad; Load2
duke@435 48 //
duke@435 49 // Ensures that Load1 completes (obtains the value it loads from memory)
duke@435 50 // before Load2 and any subsequent load operations. Loads before Load1
duke@435 51 // may *not* float below Load2 and any subsequent load operations.
duke@435 52 //
duke@435 53 // StoreStore: Store1(s); StoreStore; Store2
duke@435 54 //
duke@435 55 // Ensures that Store1 completes (the effect on memory of Store1 is made
duke@435 56 // visible to other processors) before Store2 and any subsequent store
duke@435 57 // operations. Stores before Store1 may *not* float below Store2 and any
duke@435 58 // subsequent store operations.
duke@435 59 //
duke@435 60 // LoadStore: Load1(s); LoadStore; Store2
duke@435 61 //
duke@435 62 // Ensures that Load1 completes before Store2 and any subsequent store
duke@435 63 // operations. Loads before Load1 may *not* float below Store2 and any
duke@435 64 // subseqeuent store operations.
duke@435 65 //
duke@435 66 // StoreLoad: Store1(s); StoreLoad; Load2
duke@435 67 //
duke@435 68 // Ensures that Store1 completes before Load2 and any subsequent load
duke@435 69 // operations. Stores before Store1 may *not* float below Load2 and any
duke@435 70 // subseqeuent load operations.
duke@435 71 //
duke@435 72 //
duke@435 73 // We define two further operations, 'release' and 'acquire'. They are
duke@435 74 // mirror images of each other.
duke@435 75 //
duke@435 76 // Execution by a processor of release makes the effect of all memory
duke@435 77 // accesses issued by it previous to the release visible to all
duke@435 78 // processors *before* the release completes. The effect of subsequent
duke@435 79 // memory accesses issued by it *may* be made visible *before* the
duke@435 80 // release. I.e., subsequent memory accesses may float above the
duke@435 81 // release, but prior ones may not float below it.
duke@435 82 //
duke@435 83 // Execution by a processor of acquire makes the effect of all memory
duke@435 84 // accesses issued by it subsequent to the acquire visible to all
duke@435 85 // processors *after* the acquire completes. The effect of prior memory
duke@435 86 // accesses issued by it *may* be made visible *after* the acquire.
duke@435 87 // I.e., prior memory accesses may float below the acquire, but
duke@435 88 // subsequent ones may not float above it.
duke@435 89 //
duke@435 90 // Finally, we define a 'fence' operation, which conceptually is a
duke@435 91 // release combined with an acquire. In the real world these operations
duke@435 92 // require one or more machine instructions which can float above and
duke@435 93 // below the release or acquire, so we usually can't just issue the
duke@435 94 // release-acquire back-to-back. All machines we know of implement some
duke@435 95 // sort of memory fence instruction.
duke@435 96 //
duke@435 97 //
duke@435 98 // The standalone implementations of release and acquire need an associated
duke@435 99 // dummy volatile store or load respectively. To avoid redundant operations,
duke@435 100 // we can define the composite operators: 'release_store', 'store_fence' and
duke@435 101 // 'load_acquire'. Here's a summary of the machine instructions corresponding
duke@435 102 // to each operation.
duke@435 103 //
duke@435 104 // sparc RMO ia64 x86
duke@435 105 // ---------------------------------------------------------------------
duke@435 106 // fence membar #LoadStore | mf lock addl 0,(sp)
duke@435 107 // #StoreStore |
duke@435 108 // #LoadLoad |
duke@435 109 // #StoreLoad
duke@435 110 //
duke@435 111 // release membar #LoadStore | st.rel [sp]=r0 movl $0,<dummy>
duke@435 112 // #StoreStore
duke@435 113 // st %g0,[]
duke@435 114 //
duke@435 115 // acquire ld [%sp],%g0 ld.acq <r>=[sp] movl (sp),<r>
duke@435 116 // membar #LoadLoad |
duke@435 117 // #LoadStore
duke@435 118 //
duke@435 119 // release_store membar #LoadStore | st.rel <store>
duke@435 120 // #StoreStore
duke@435 121 // st
duke@435 122 //
duke@435 123 // store_fence st st lock xchg
duke@435 124 // fence mf
duke@435 125 //
duke@435 126 // load_acquire ld ld.acq <load>
duke@435 127 // membar #LoadLoad |
duke@435 128 // #LoadStore
duke@435 129 //
duke@435 130 // Using only release_store and load_acquire, we can implement the
duke@435 131 // following ordered sequences.
duke@435 132 //
duke@435 133 // 1. load, load == load_acquire, load
duke@435 134 // or load_acquire, load_acquire
duke@435 135 // 2. load, store == load, release_store
duke@435 136 // or load_acquire, store
duke@435 137 // or load_acquire, release_store
duke@435 138 // 3. store, store == store, release_store
duke@435 139 // or release_store, release_store
duke@435 140 //
duke@435 141 // These require no membar instructions for sparc-TSO and no extra
duke@435 142 // instructions for ia64.
duke@435 143 //
duke@435 144 // Ordering a load relative to preceding stores requires a store_fence,
duke@435 145 // which implies a membar #StoreLoad between the store and load under
duke@435 146 // sparc-TSO. A fence is required by ia64. On x86, we use locked xchg.
duke@435 147 //
duke@435 148 // 4. store, load == store_fence, load
duke@435 149 //
duke@435 150 // Use store_fence to make sure all stores done in an 'interesting'
duke@435 151 // region are made visible prior to both subsequent loads and stores.
duke@435 152 //
duke@435 153 // Conventional usage is to issue a load_acquire for ordered loads. Use
duke@435 154 // release_store for ordered stores when you care only that prior stores
duke@435 155 // are visible before the release_store, but don't care exactly when the
duke@435 156 // store associated with the release_store becomes visible. Use
duke@435 157 // release_store_fence to update values like the thread state, where we
duke@435 158 // don't want the current thread to continue until all our prior memory
duke@435 159 // accesses (including the new thread state) are visible to other threads.
duke@435 160 //
duke@435 161 //
duke@435 162 // C++ Volatility
duke@435 163 //
duke@435 164 // C++ guarantees ordering at operations termed 'sequence points' (defined
duke@435 165 // to be volatile accesses and calls to library I/O functions). 'Side
duke@435 166 // effects' (defined as volatile accesses, calls to library I/O functions
duke@435 167 // and object modification) previous to a sequence point must be visible
duke@435 168 // at that sequence point. See the C++ standard, section 1.9, titled
duke@435 169 // "Program Execution". This means that all barrier implementations,
duke@435 170 // including standalone loadload, storestore, loadstore, storeload, acquire
duke@435 171 // and release must include a sequence point, usually via a volatile memory
duke@435 172 // access. Other ways to guarantee a sequence point are, e.g., use of
duke@435 173 // indirect calls and linux's __asm__ volatile.
ysr@2066 174 // Note: as of 6973570, we have replaced the originally static "dummy" field
ysr@2066 175 // (see above) by a volatile store to the stack. All of the versions of the
ysr@2066 176 // compilers that we currently use (SunStudio, gcc and VC++) respect the
ysr@2066 177 // semantics of volatile here. If you build HotSpot using other
ysr@2066 178 // compilers, you may need to verify that no compiler reordering occurs
ysr@2066 179 // across the sequence point respresented by the volatile access.
duke@435 180 //
duke@435 181 //
duke@435 182 // os::is_MP Considered Redundant
duke@435 183 //
duke@435 184 // Callers of this interface do not need to test os::is_MP() before
duke@435 185 // issuing an operation. The test is taken care of by the implementation
duke@435 186 // of the interface (depending on the vm version and platform, the test
duke@435 187 // may or may not be actually done by the implementation).
duke@435 188 //
duke@435 189 //
duke@435 190 // A Note on Memory Ordering and Cache Coherency
duke@435 191 //
duke@435 192 // Cache coherency and memory ordering are orthogonal concepts, though they
duke@435 193 // interact. E.g., all existing itanium machines are cache-coherent, but
duke@435 194 // the hardware can freely reorder loads wrt other loads unless it sees a
duke@435 195 // load-acquire instruction. All existing sparc machines are cache-coherent
duke@435 196 // and, unlike itanium, TSO guarantees that the hardware orders loads wrt
duke@435 197 // loads and stores, and stores wrt to each other.
duke@435 198 //
duke@435 199 // Consider the implementation of loadload. *If* your platform *isn't*
duke@435 200 // cache-coherent, then loadload must not only prevent hardware load
duke@435 201 // instruction reordering, but it must *also* ensure that subsequent
duke@435 202 // loads from addresses that could be written by other processors (i.e.,
duke@435 203 // that are broadcast by other processors) go all the way to the first
duke@435 204 // level of memory shared by those processors and the one issuing
duke@435 205 // the loadload.
duke@435 206 //
duke@435 207 // So if we have a MP that has, say, a per-processor D$ that doesn't see
duke@435 208 // writes by other processors, and has a shared E$ that does, the loadload
duke@435 209 // barrier would have to make sure that either
duke@435 210 //
duke@435 211 // 1. cache lines in the issuing processor's D$ that contained data from
duke@435 212 // addresses that could be written by other processors are invalidated, so
duke@435 213 // subsequent loads from those addresses go to the E$, (it could do this
duke@435 214 // by tagging such cache lines as 'shared', though how to tell the hardware
duke@435 215 // to do the tagging is an interesting problem), or
duke@435 216 //
duke@435 217 // 2. there never are such cache lines in the issuing processor's D$, which
duke@435 218 // means all references to shared data (however identified: see above)
duke@435 219 // bypass the D$ (i.e., are satisfied from the E$).
duke@435 220 //
duke@435 221 // If your machine doesn't have an E$, substitute 'main memory' for 'E$'.
duke@435 222 //
duke@435 223 // Either of these alternatives is a pain, so no current machine we know of
duke@435 224 // has incoherent caches.
duke@435 225 //
duke@435 226 // If loadload didn't have these properties, the store-release sequence for
duke@435 227 // publishing a shared data structure wouldn't work, because a processor
duke@435 228 // trying to read data newly published by another processor might go to
duke@435 229 // its own incoherent caches to satisfy the read instead of to the newly
duke@435 230 // written shared memory.
duke@435 231 //
duke@435 232 //
duke@435 233 // NOTE WELL!!
duke@435 234 //
duke@435 235 // A Note on MutexLocker and Friends
duke@435 236 //
duke@435 237 // See mutexLocker.hpp. We assume throughout the VM that MutexLocker's
duke@435 238 // and friends' constructors do a fence, a lock and an acquire *in that
duke@435 239 // order*. And that their destructors do a release and unlock, in *that*
duke@435 240 // order. If their implementations change such that these assumptions
duke@435 241 // are violated, a whole lot of code will break.
duke@435 242
duke@435 243 class OrderAccess : AllStatic {
duke@435 244 public:
duke@435 245 static void loadload();
duke@435 246 static void storestore();
duke@435 247 static void loadstore();
duke@435 248 static void storeload();
duke@435 249
duke@435 250 static void acquire();
duke@435 251 static void release();
duke@435 252 static void fence();
duke@435 253
duke@435 254 static jbyte load_acquire(volatile jbyte* p);
duke@435 255 static jshort load_acquire(volatile jshort* p);
duke@435 256 static jint load_acquire(volatile jint* p);
duke@435 257 static jlong load_acquire(volatile jlong* p);
duke@435 258 static jubyte load_acquire(volatile jubyte* p);
duke@435 259 static jushort load_acquire(volatile jushort* p);
duke@435 260 static juint load_acquire(volatile juint* p);
duke@435 261 static julong load_acquire(volatile julong* p);
duke@435 262 static jfloat load_acquire(volatile jfloat* p);
duke@435 263 static jdouble load_acquire(volatile jdouble* p);
duke@435 264
duke@435 265 static intptr_t load_ptr_acquire(volatile intptr_t* p);
duke@435 266 static void* load_ptr_acquire(volatile void* p);
duke@435 267 static void* load_ptr_acquire(const volatile void* p);
duke@435 268
duke@435 269 static void release_store(volatile jbyte* p, jbyte v);
duke@435 270 static void release_store(volatile jshort* p, jshort v);
duke@435 271 static void release_store(volatile jint* p, jint v);
duke@435 272 static void release_store(volatile jlong* p, jlong v);
duke@435 273 static void release_store(volatile jubyte* p, jubyte v);
duke@435 274 static void release_store(volatile jushort* p, jushort v);
duke@435 275 static void release_store(volatile juint* p, juint v);
duke@435 276 static void release_store(volatile julong* p, julong v);
duke@435 277 static void release_store(volatile jfloat* p, jfloat v);
duke@435 278 static void release_store(volatile jdouble* p, jdouble v);
duke@435 279
duke@435 280 static void release_store_ptr(volatile intptr_t* p, intptr_t v);
duke@435 281 static void release_store_ptr(volatile void* p, void* v);
duke@435 282
duke@435 283 static void store_fence(jbyte* p, jbyte v);
duke@435 284 static void store_fence(jshort* p, jshort v);
duke@435 285 static void store_fence(jint* p, jint v);
duke@435 286 static void store_fence(jlong* p, jlong v);
duke@435 287 static void store_fence(jubyte* p, jubyte v);
duke@435 288 static void store_fence(jushort* p, jushort v);
duke@435 289 static void store_fence(juint* p, juint v);
duke@435 290 static void store_fence(julong* p, julong v);
duke@435 291 static void store_fence(jfloat* p, jfloat v);
duke@435 292 static void store_fence(jdouble* p, jdouble v);
duke@435 293
duke@435 294 static void store_ptr_fence(intptr_t* p, intptr_t v);
duke@435 295 static void store_ptr_fence(void** p, void* v);
duke@435 296
duke@435 297 static void release_store_fence(volatile jbyte* p, jbyte v);
duke@435 298 static void release_store_fence(volatile jshort* p, jshort v);
duke@435 299 static void release_store_fence(volatile jint* p, jint v);
duke@435 300 static void release_store_fence(volatile jlong* p, jlong v);
duke@435 301 static void release_store_fence(volatile jubyte* p, jubyte v);
duke@435 302 static void release_store_fence(volatile jushort* p, jushort v);
duke@435 303 static void release_store_fence(volatile juint* p, juint v);
duke@435 304 static void release_store_fence(volatile julong* p, julong v);
duke@435 305 static void release_store_fence(volatile jfloat* p, jfloat v);
duke@435 306 static void release_store_fence(volatile jdouble* p, jdouble v);
duke@435 307
duke@435 308 static void release_store_ptr_fence(volatile intptr_t* p, intptr_t v);
duke@435 309 static void release_store_ptr_fence(volatile void* p, void* v);
duke@435 310
never@1106 311 private:
never@1106 312 // This is a helper that invokes the StubRoutines::fence_entry()
never@1106 313 // routine if it exists, It should only be used by platforms that
never@1106 314 // don't another way to do the inline eassembly.
never@1106 315 static void StubRoutines_fence();
duke@435 316 };
stefank@2314 317
stefank@2314 318 #endif // SHARE_VM_RUNTIME_ORDERACCESS_HPP

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial