Searched defs:fence (Results 1 - 12 of 12) sorted by relevance

/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_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/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/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/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/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/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/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/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));

Completed in 105 milliseconds