类java.lang.ClassValue.ClassValueMap源码实例Demo

下面列出了怎么用java.lang.ClassValue.ClassValueMap的API类实例代码及写法,或者点击链接到github查看源代码。

源代码1 项目: jdk8u-dev-jdk   文件: ClassValue.java
/** Return the cache, if it exists, else a dummy empty cache. */
private static Entry<?>[] getCacheCarefully(Class<?> type) {
    // racing type.classValueMap{.cacheArray} : null => new Entry[X] <=> new Entry[Y]
    ClassValueMap map = type.classValueMap;
    if (map == null)  return EMPTY_CACHE;
    Entry<?>[] cache = map.getCache();
    return cache;
    // invariant:  returned value is safe to dereference and check for an Entry
}
 
源代码2 项目: jdk1.8-source-analysis   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码3 项目: jdk8u-jdk   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码4 项目: dragonwell8_jdk   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码5 项目: TencentKona-8   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码6 项目: jdk-1.7-annotated   文件: ClassValue.java
/** Return the cache, if it exists, else a dummy empty cache. */
private static Entry<?>[] getCacheCarefully(Class<?> type) {
    // racing type.classValueMap{.cacheArray} : null => new Entry[X] <=> new Entry[Y]
    ClassValueMap map = type.classValueMap;
    if (map == null)  return EMPTY_CACHE;
    Entry<?>[] cache = map.getCache();
    return cache;
    // invariant:  returned value is safe to dereference and check for an Entry
}
 
源代码7 项目: jdk8u_jdk   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码8 项目: JDKSourceCode1.8   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码9 项目: openjdk-jdk8u   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码10 项目: openjdk-jdk8u-backup   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码11 项目: jdk8u-jdk   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码12 项目: Java8CN   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码13 项目: openjdk-8-source   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码14 项目: jdk-1.7-annotated   文件: ClassValue.java
/** Called when the fast path of get fails, and cache reprobe also fails.
 */
private T getFromHashMap(Class<?> type) {
    // The fail-safe recovery is to fall back to the underlying classValueMap.
    ClassValueMap map = getMap(type);
    for (;;) {
        Entry<T> e = map.startEntry(this);
        if (!e.isPromise())
            return e.value();
        try {
            // Try to make a real entry for the promised version.
            e = makeEntry(e.version(), computeValue(type));
        } finally {
            // Whether computeValue throws or returns normally,
            // be sure to remove the empty entry.
            e = map.finishEntry(this, e);
        }
        if (e != null)
            return e.value();
        // else try again, in case a racing thread called remove (so e == null)
    }
}
 
源代码15 项目: jdk8u-jdk   文件: ClassValue.java
private static ClassValueMap initializeMap(Class<?> type) {
ClassValueMap map;
synchronized (CRITICAL_SECTION) {  // private object to avoid deadlocks
    // happens about once per type
    if ((map = type.classValueMap) == null)
        type.classValueMap = map = new ClassValueMap(type);
}
    return map;
}
 
源代码16 项目: jdk8u_jdk   文件: ClassValue.java
/** Return the cache, if it exists, else a dummy empty cache. */
private static Entry<?>[] getCacheCarefully(Class<?> type) {
    // racing type.classValueMap{.cacheArray} : null => new Entry[X] <=> new Entry[Y]
    ClassValueMap map = type.classValueMap;
    if (map == null)  return EMPTY_CACHE;
    Entry<?>[] cache = map.getCache();
    return cache;
    // invariant:  returned value is safe to dereference and check for an Entry
}
 
源代码17 项目: jdk1.8-source-analysis   文件: ClassValue.java
/** Return the backing map associated with this type. */
private static ClassValueMap getMap(Class<?> type) {
    // racing type.classValueMap : null (blank) => unique ClassValueMap
    // if a null is observed, a map is created (lazily, synchronously, uniquely)
    // all further access to that map is synchronized
    ClassValueMap map = type.classValueMap;
    if (map != null)  return map;
    return initializeMap(type);
}
 
源代码18 项目: jdk1.8-source-analysis   文件: ClassValue.java
private static ClassValueMap initializeMap(Class<?> type) {
ClassValueMap map;
synchronized (CRITICAL_SECTION) {  // private object to avoid deadlocks
    // happens about once per type
    if ((map = type.classValueMap) == null)
        type.classValueMap = map = new ClassValueMap(type);
}
    return map;
}
 
源代码19 项目: dragonwell8_jdk   文件: ClassValue.java
private static ClassValueMap initializeMap(Class<?> type) {
    ClassValueMap map;
    synchronized (CRITICAL_SECTION) {  // private object to avoid deadlocks
        // happens about once per type
        if (TenantGlobals.isDataIsolationEnabled() && TenantContainer.current() != null) {
            type.classValueMap = map = TenantContainer.current()
                    .getFieldValue(type, "classValueMap", () -> new ClassValueMap(type));
        } else {
            if ((map = type.classValueMap) == null) {
                type.classValueMap = map = new ClassValueMap(type);
            }
        }
    }
    return map;
}
 
源代码20 项目: TencentKona-8   文件: ClassValue.java
/** Return the cache, if it exists, else a dummy empty cache. */
private static Entry<?>[] getCacheCarefully(Class<?> type) {
    // racing type.classValueMap{.cacheArray} : null => new Entry[X] <=> new Entry[Y]
    ClassValueMap map = type.classValueMap;
    if (map == null)  return EMPTY_CACHE;
    Entry<?>[] cache = map.getCache();
    return cache;
    // invariant:  returned value is safe to dereference and check for an Entry
}
 
源代码21 项目: jdk8u60   文件: ClassValue.java
/** Return the cache, if it exists, else a dummy empty cache. */
private static Entry<?>[] getCacheCarefully(Class<?> type) {
    // racing type.classValueMap{.cacheArray} : null => new Entry[X] <=> new Entry[Y]
    ClassValueMap map = type.classValueMap;
    if (map == null)  return EMPTY_CACHE;
    Entry<?>[] cache = map.getCache();
    return cache;
    // invariant:  returned value is safe to dereference and check for an Entry
}
 
源代码22 项目: jdk-1.7-annotated   文件: ClassValue.java
private static ClassValueMap initializeMap(Class<?> type) {
ClassValueMap map;
synchronized (CRITICAL_SECTION) {  // private object to avoid deadlocks
    // happens about once per type
    if ((map = type.classValueMap) == null)
        type.classValueMap = map = new ClassValueMap(type);
}
    return map;
}
 
源代码23 项目: jdk8u60   文件: ClassValue.java
private static ClassValueMap initializeMap(Class<?> type) {
ClassValueMap map;
synchronized (CRITICAL_SECTION) {  // private object to avoid deadlocks
    // happens about once per type
    if ((map = type.classValueMap) == null)
        type.classValueMap = map = new ClassValueMap(type);
}
    return map;
}
 
源代码24 项目: openjdk-8   文件: ClassValue.java
/** Return the backing map associated with this type. */
private static ClassValueMap getMap(Class<?> type) {
    // racing type.classValueMap : null (blank) => unique ClassValueMap
    // if a null is observed, a map is created (lazily, synchronously, uniquely)
    // all further access to that map is synchronized
    ClassValueMap map = type.classValueMap;
    if (map != null)  return map;
    return initializeMap(type);
}
 
源代码25 项目: openjdk-8   文件: ClassValue.java
private static ClassValueMap initializeMap(Class<?> type) {
ClassValueMap map;
synchronized (CRITICAL_SECTION) {  // private object to avoid deadlocks
    // happens about once per type
    if ((map = type.classValueMap) == null)
        type.classValueMap = map = new ClassValueMap(type);
}
    return map;
}
 
源代码26 项目: JDKSourceCode1.8   文件: ClassValue.java
private static ClassValueMap initializeMap(Class<?> type) {
ClassValueMap map;
synchronized (CRITICAL_SECTION) {  // private object to avoid deadlocks
    // happens about once per type
    if ((map = type.classValueMap) == null)
        type.classValueMap = map = new ClassValueMap(type);
}
    return map;
}
 
源代码27 项目: openjdk-jdk8u   文件: ClassValue.java
/** Return the backing map associated with this type. */
private static ClassValueMap getMap(Class<?> type) {
    // racing type.classValueMap : null (blank) => unique ClassValueMap
    // if a null is observed, a map is created (lazily, synchronously, uniquely)
    // all further access to that map is synchronized
    ClassValueMap map = type.classValueMap;
    if (map != null)  return map;
    return initializeMap(type);
}
 
源代码28 项目: openjdk-jdk8u   文件: ClassValue.java
private static ClassValueMap initializeMap(Class<?> type) {
ClassValueMap map;
synchronized (CRITICAL_SECTION) {  // private object to avoid deadlocks
    // happens about once per type
    if ((map = type.classValueMap) == null)
        type.classValueMap = map = new ClassValueMap(type);
}
    return map;
}
 
源代码29 项目: openjdk-jdk8u-backup   文件: ClassValue.java
/** Return the cache, if it exists, else a dummy empty cache. */
private static Entry<?>[] getCacheCarefully(Class<?> type) {
    // racing type.classValueMap{.cacheArray} : null => new Entry[X] <=> new Entry[Y]
    ClassValueMap map = type.classValueMap;
    if (map == null)  return EMPTY_CACHE;
    Entry<?>[] cache = map.getCache();
    return cache;
    // invariant:  returned value is safe to dereference and check for an Entry
}
 
源代码30 项目: openjdk-jdk8u-backup   文件: ClassValue.java
/** Return the backing map associated with this type. */
private static ClassValueMap getMap(Class<?> type) {
    // racing type.classValueMap : null (blank) => unique ClassValueMap
    // if a null is observed, a map is created (lazily, synchronously, uniquely)
    // all further access to that map is synchronized
    ClassValueMap map = type.classValueMap;
    if (map != null)  return map;
    return initializeMap(type);
}
 
 类所在包
 同包方法