Searched refs:fence (Results 1 - 25 of 34) sorted by relevance

12

/openjdk7/hotspot/src/os_cpu/solaris_sparc/vm/
H A DorderAccess_solaris_sparc.inline.hpp42 inline void OrderAccess::storeload() { fence(); }
55 inline void OrderAccess::fence() { function in class:OrderAccess
71 inline void OrderAccess::fence() { function in class:OrderAccess
106 inline void OrderAccess::store_fence(jbyte* p, jbyte v) { *p = v; fence(); }
107 inline void OrderAccess::store_fence(jshort* p, jshort v) { *p = v; fence(); }
108 inline void OrderAccess::store_fence(jint* p, jint v) { *p = v; fence(); }
109 inline void OrderAccess::store_fence(jlong* p, jlong v) { *p = v; fence(); }
110 inline void OrderAccess::store_fence(jubyte* p, jubyte v) { *p = v; fence(); }
111 inline void OrderAccess::store_fence(jushort* p, jushort v) { *p = v; fence(); }
112 inline void OrderAccess::store_fence(juint* p, juint v) { *p = v; fence(); }
[all...]
/openjdk7/hotspot/src/os_cpu/linux_sparc/vm/
H A DorderAccess_linux_sparc.inline.hpp38 inline void OrderAccess::storeload() { fence(); }
49 inline void OrderAccess::fence() { function in class:OrderAccess
82 inline void OrderAccess::store_fence(jbyte* p, jbyte v) { *p = v; fence(); }
83 inline void OrderAccess::store_fence(jshort* p, jshort v) { *p = v; fence(); }
84 inline void OrderAccess::store_fence(jint* p, jint v) { *p = v; fence(); }
85 inline void OrderAccess::store_fence(jlong* p, jlong v) { *p = v; fence(); }
86 inline void OrderAccess::store_fence(jubyte* p, jubyte v) { *p = v; fence(); }
87 inline void OrderAccess::store_fence(jushort* p, jushort v) { *p = v; fence(); }
88 inline void OrderAccess::store_fence(juint* p, juint v) { *p = v; fence(); }
89 inline void OrderAccess::store_fence(julong* p, julong v) { *p = v; fence(); }
[all...]
/openjdk7/hotspot/src/os_cpu/solaris_x86/vm/
H A DorderAccess_solaris_x86.inline.hpp42 inline void OrderAccess::storeload() { fence(); }
55 inline void OrderAccess::fence() { function in class:OrderAccess
110 inline void OrderAccess::store_fence(jbyte* p, jbyte v) { *p = v; fence(); }
111 inline void OrderAccess::store_fence(jshort* p, jshort v) { *p = v; fence(); }
112 inline void OrderAccess::store_fence(jint* p, jint v) { *p = v; fence(); }
113 inline void OrderAccess::store_fence(jlong* p, jlong v) { *p = v; fence(); }
114 inline void OrderAccess::store_fence(jubyte* p, jubyte v) { *p = v; fence(); }
115 inline void OrderAccess::store_fence(jushort* p, jushort v) { *p = v; fence(); }
116 inline void OrderAccess::store_fence(juint* p, juint v) { *p = v; fence(); }
117 inline void OrderAccess::store_fence(julong* p, julong v) { *p = v; fence(); }
[all...]
/openjdk7/hotspot/src/os_cpu/bsd_zero/vm/
H A DorderAccess_bsd_zero.inline.hpp74 inline void OrderAccess::storeload() { fence(); }
84 inline void OrderAccess::fence() { function in class:OrderAccess
148 inline void OrderAccess::store_fence(jbyte* p, jbyte v) { *p = v; fence(); }
149 inline void OrderAccess::store_fence(jshort* p, jshort v) { *p = v; fence(); }
150 inline void OrderAccess::store_fence(jint* p, jint v) { *p = v; fence(); }
151 inline void OrderAccess::store_fence(jlong* p, jlong v) { os::atomic_copy64(&v, p); fence(); }
152 inline void OrderAccess::store_fence(jubyte* p, jubyte v) { *p = v; fence(); }
153 inline void OrderAccess::store_fence(jushort* p, jushort v) { *p = v; fence(); }
154 inline void OrderAccess::store_fence(juint* p, juint v) { *p = v; fence(); }
155 inline void OrderAccess::store_fence(julong* p, julong v) { os::atomic_copy64(&v, p); fence(); }
[all...]
/openjdk7/hotspot/src/os_cpu/linux_zero/vm/
H A DorderAccess_linux_zero.inline.hpp73 inline void OrderAccess::storeload() { fence(); }
83 inline void OrderAccess::fence() { function in class:OrderAccess
147 inline void OrderAccess::store_fence(jbyte* p, jbyte v) { *p = v; fence(); }
148 inline void OrderAccess::store_fence(jshort* p, jshort v) { *p = v; fence(); }
149 inline void OrderAccess::store_fence(jint* p, jint v) { *p = v; fence(); }
150 inline void OrderAccess::store_fence(jlong* p, jlong v) { os::atomic_copy64(&v, p); fence(); }
151 inline void OrderAccess::store_fence(jubyte* p, jubyte v) { *p = v; fence(); }
152 inline void OrderAccess::store_fence(jushort* p, jushort v) { *p = v; fence(); }
153 inline void OrderAccess::store_fence(juint* p, juint v) { *p = v; fence(); }
154 inline void OrderAccess::store_fence(julong* p, julong v) { os::atomic_copy64(&v, p); fence(); }
[all...]
/openjdk7/hotspot/src/os_cpu/windows_x86/vm/
H A DorderAccess_windows_x86.inline.hpp39 inline void OrderAccess::storeload() { fence(); }
54 inline void OrderAccess::fence() { function in class:OrderAccess
97 *p = v; fence();
109 *p = v; fence();
121 *p = v; fence();
131 inline void OrderAccess::store_fence(jlong* p, jlong v) { *p = v; fence(); }
136 inline void OrderAccess::store_fence(jfloat* p, jfloat v) { *p = v; fence(); }
137 inline void OrderAccess::store_fence(jdouble* p, jdouble v) { *p = v; fence(); }
141 *p = v; fence();
149 *p = v; fence();
[all...]
/openjdk7/jdk/src/share/classes/java/math/
H A DMathContext.java189 int fence = val.indexOf(' '); // could be -1
191 setPrecision = Integer.parseInt(val.substring(10, fence));
193 if (!val.startsWith("roundingMode=", fence+1))
195 off = fence + 1 + 13;
/openjdk7/hotspot/src/os_cpu/bsd_x86/vm/
H A DorderAccess_bsd_x86.inline.hpp37 inline void OrderAccess::storeload() { fence(); }
54 inline void OrderAccess::fence() { function in class:OrderAccess
120 *p = v; fence();
130 inline void OrderAccess::store_fence(jfloat* p, jfloat v) { *p = v; fence(); }
131 inline void OrderAccess::store_fence(jdouble* p, jdouble v) { *p = v; fence(); }
182 release_store(p, v); fence();
191 inline void OrderAccess::release_store_fence(volatile jfloat* p, jfloat v) { *p = v; fence(); }
192 inline void OrderAccess::release_store_fence(volatile jdouble* p, jdouble v) { *p = v; fence(); }
/openjdk7/hotspot/src/os_cpu/linux_x86/vm/
H A DorderAccess_linux_x86.inline.hpp37 inline void OrderAccess::storeload() { fence(); }
54 inline void OrderAccess::fence() { function in class:OrderAccess
120 *p = v; fence();
130 inline void OrderAccess::store_fence(jfloat* p, jfloat v) { *p = v; fence(); }
131 inline void OrderAccess::store_fence(jdouble* p, jdouble v) { *p = v; fence(); }
182 release_store(p, v); fence();
191 inline void OrderAccess::release_store_fence(volatile jfloat* p, jfloat v) { *p = v; fence(); }
192 inline void OrderAccess::release_store_fence(volatile jdouble* p, jdouble v) { *p = v; fence(); }
/openjdk7/hotspot/src/cpu/sparc/vm/
H A DjavaFrameAnchor_sparc.hpp51 // fence?
101 OrderAccess::fence();
/openjdk7/jdk/src/share/classes/java/util/
H A DArrayDeque.java613 private int fence = tail; field in class:ArrayDeque.DeqIterator
622 return cursor != fence;
626 if (cursor == fence)
631 if (tail != fence || result == null)
643 fence = tail;
653 * tail for fence.
656 private int fence = head; field in class:ArrayDeque.DescendingIterator
660 return cursor != fence;
664 if (cursor == fence)
668 if (head != fence || resul
[all...]
H A DTreeMap.java1229 * Dummy value serving as unmatchable fence key for unbounded
1361 /** Returns the absolute high fence for ascending traversal */
1368 /** Return the absolute low fence for descending traversal */
1578 TreeMap.Entry<K,V> fence) {
1582 fenceKey = fence == null ? UNBOUNDED : fence.key;
1638 TreeMap.Entry<K,V> fence) {
1639 super(first, fence);
1651 TreeMap.Entry<K,V> fence) {
1652 super(first, fence);
1577 SubMapIterator(TreeMap.Entry<K,V> first, TreeMap.Entry<K,V> fence) argument
1637 SubMapEntryIterator(TreeMap.Entry<K,V> first, TreeMap.Entry<K,V> fence) argument
1650 SubMapKeyIterator(TreeMap.Entry<K,V> first, TreeMap.Entry<K,V> fence) argument
1663 DescendingSubMapEntryIterator(TreeMap.Entry<K,V> last, TreeMap.Entry<K,V> fence) argument
1677 DescendingSubMapKeyIterator(TreeMap.Entry<K,V> last, TreeMap.Entry<K,V> fence) argument
[all...]
/openjdk7/hotspot/src/share/vm/prims/
H A DjvmtiRawMonitor.cpp139 OrderAccess::fence() ;
155 OrderAccess::fence() ;
169 OrderAccess::fence() ;
368 OrderAccess::fence() ;
/openjdk7/hotspot/src/share/vm/runtime/
H A DobjectMonitor.cpp644 OrderAccess::fence() ;
649 OrderAccess::fence() ;
672 OrderAccess::fence(); // Dekker pivot-point
677 // threads that arrived on the cxq|EntryList before the fence, above --
718 OrderAccess::fence() ;
770 if (_succ == Self) { _succ = NULL; OrderAccess::fence(); }
795 OrderAccess::fence() ;
816 OrderAccess::fence() ; // see comments at the end of EnterI()
1326 OrderAccess::fence() ; // ST _owner vs LD in unpark()
1483 OrderAccess::fence(); // S
[all...]
H A DinterfaceSupport.hpp152 // Force a fence between the write above and read below
153 OrderAccess::fence();
183 // Force a fence between the write above and read below
184 OrderAccess::fence();
216 // Force a fence between the write above and read below
217 OrderAccess::fence();
H A Dmutex.cpp476 OrderAccess::fence() ;
530 // Conceptually we need a MEMBAR #storestore|#loadstore barrier or fence immediately
536 // from "leaking" out, we need a release fence between the critical section and the
540 // Note that the OrderAccess::storeload() fence that appears after unlock store
711 OrderAccess::fence() ;
750 OrderAccess::fence() ;
812 OrderAccess::fence() ;
H A DorderAccess.hpp90 // Finally, we define a 'fence' operation, which conceptually is a
95 // sort of memory fence instruction.
106 // fence membar #LoadStore | mf lock addl 0,(sp)
124 // fence mf
146 // sparc-TSO. A fence is required by ia64. On x86, we use locked xchg.
238 // and friends' constructors do a fence, a lock and an acquire *in that
252 static void fence();
H A Dsafepoint.cpp201 OrderAccess::fence();
383 OrderAccess::fence();
421 // memory fence isn't required here since an odd _safepoint_counter
422 // value can do no harm and a fence is issued below anyway.
459 OrderAccess::fence();
H A Dthread.cpp1345 OrderAccess::fence(); // ensure WatcherThread sees update in main loop
2369 // Force a fence between the write above and read below
2370 OrderAccess::fence();
4419 OrderAccess::fence() ; // guarantee at least release consistency.
4503 // The following fence() isn't _strictly necessary as the subsequent
4505 OrderAccess::fence();
4556 // The following fence() isn't _strictly necessary as the subsequent
4558 OrderAccess::fence();
4621 OrderAccess::fence() ;
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DCopyOnWriteArrayList.java168 * @param fence one past last index to search
172 int index, int fence) {
174 for (int i = index; i < fence; i++)
178 for (int i = index; i < fence; i++)
171 indexOf(Object o, Object[] elements, int index, int fence) argument
H A DConcurrentSkipListMap.java680 * strictly less than fence, bypassing either test if least or
681 * fence are null. Needed mainly in submap operations.
683 boolean inHalfOpenRange(K key, K least, K fence) { argument
687 (fence == null || compare(key, fence) < 0));
692 * or equal to fence. Needed mainly in submap operations.
694 boolean inOpenRange(K key, K least, K fence) { argument
698 (fence == null || compare(key, fence) <= 0));
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1CollectedHeap.hpp1147 OrderAccess::fence();
1157 OrderAccess::fence();
/openjdk7/hotspot/src/share/vm/utilities/
H A Dtaskqueue.hpp709 OrderAccess::fence();
/openjdk7/hotspot/src/os/bsd/vm/
H A Dos_bsd.cpp3606 OrderAccess::fence() ;
4095 OrderAccess::fence();
5645 OrderAccess::fence();
5710 OrderAccess::fence();
5881 OrderAccess::fence();
5919 OrderAccess::fence();
/openjdk7/hotspot/src/os/linux/vm/
H A Dos_linux.cpp3527 OrderAccess::fence() ;
3941 OrderAccess::fence();
5384 OrderAccess::fence();
5449 OrderAccess::fence();
5620 OrderAccess::fence();
5658 OrderAccess::fence();

Completed in 206 milliseconds

12