ClassValue.java 8.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
/*
 * Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.  Oracle designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Oracle in the LICENSE file that accompanied this code.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

package java.dyn;

import java.util.WeakHashMap;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.concurrent.atomic.AtomicReference;
31
import java.lang.reflect.UndeclaredThrowableException;
32 33 34 35 36

/**
 * Lazily associate a computed value with (potentially) every class.
 * @author John Rose, JSR 292 EG
 */
37
public class ClassValue<T> {
38 39 40 41
    /**
     * Compute the given class's derived value for this {@code ClassValue}.
     * <p>
     * This method will be invoked within the first thread that accesses
42
     * the value with the {@link #get get} method.
43 44
     * <p>
     * Normally, this method is invoked at most once per class,
45 46 47 48 49 50
     * but it may be invoked again if there has been a call to
     * {@link #remove remove}.
     * <p>
     * If there is no override from a subclass, this method returns
     * the result of applying the {@code ClassValue}'s {@code computeValue}
     * method handle, which was supplied at construction time.
51
     *
52 53 54
     * @return the newly computed value associated with this {@code ClassValue}, for the given class or interface
     * @throws UndeclaredThrowableException if the {@code computeValue} method handle invocation throws something other than a {@code RuntimeException} or {@code Error}
     * @throws UnsupportedOperationException if the {@code computeValue} method handle is null (subclasses must override)
55
     */
56 57 58 59 60 61 62 63 64 65 66 67 68
    protected T computeValue(Class<?> type) {
        if (computeValue == null)
            return null;
        try {
            return (T) (Object) computeValue.invokeGeneric(type);
        } catch (Throwable ex) {
            if (ex instanceof Error)             throw (Error) ex;
            if (ex instanceof RuntimeException)  throw (RuntimeException) ex;
            throw new UndeclaredThrowableException(ex);
        }
    }

    private final MethodHandle computeValue;
69 70 71

    /**
     * Creates a new class value.
72 73 74 75
     * Subclasses which use this constructor must override
     * the {@link #computeValue computeValue} method,
     * since the default {@code computeValue} method requires a method handle,
     * which this constructor does not provide.
76 77
     */
    protected ClassValue() {
78 79 80 81 82 83 84 85 86 87 88
        this.computeValue = null;
    }

    /**
     * Creates a new class value, whose {@link #computeValue computeValue} method
     * will return the result of {@code computeValue.invokeGeneric(type)}.
     * @throws NullPointerException  if the method handle parameter is null
     */
    public ClassValue(MethodHandle computeValue) {
        computeValue.getClass();  // trigger NPE if null
        this.computeValue = computeValue;
89 90 91 92 93
    }

    /**
     * Returns the value for the given class.
     * If no value has yet been computed, it is obtained by
94
     * by an invocation of the {@link #computeValue computeValue} method.
95 96
     * <p>
     * The actual installation of the value on the class
97 98
     * is performed atomically.
     * At that point, if racing threads have
99 100 101
     * computed values, one is chosen, and returned to
     * all the racing threads.
     *
102
     * @return the current value associated with this {@code ClassValue}, for the given class or interface
103 104 105 106 107 108 109 110 111 112 113 114 115 116 117
     */
    public T get(Class<?> type) {
        ClassValueMap map = getMap(type);
        if (map != null) {
            Object x = map.get(this);
            if (x != null) {
                return (T) map.unmaskNull(x);
            }
        }
        return setComputedValue(type);
    }

    /**
     * Removes the associated value for the given class.
     * If this value is subsequently {@linkplain #get read} for the same class,
118
     * its value will be reinitialized by invoking its {@link #computeValue computeValue} method.
119
     * This may result in an additional invocation of the
120 121 122 123 124 125 126 127
     * {@code computeValue computeValue} method for the given class.
     * <p>
     * If racing threads perform a combination of {@code get} and {@code remove} calls,
     * the calls are serialized.
     * A value produced by a call to {@code computeValue} will be discarded, if
     * the corresponding {@code get} call was followed by a {@code remove} call
     * before the {@code computeValue} could complete.
     * In such a case, the {@code get} call will re-invoke {@code computeValue}.
128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161
     */
    public void remove(Class<?> type) {
        ClassValueMap map = getMap(type);
        if (map != null) {
            synchronized (map) {
                map.remove(this);
            }
        }
    }

    /// Implementation...

    /** The hash code for this type is based on the identity of the object,
     *  and is well-dispersed for power-of-two tables.
     */
    public final int hashCode() { return hashCode; }
    private final int hashCode = HASH_CODES.getAndAdd(0x61c88647);
    private static final AtomicInteger HASH_CODES = new AtomicInteger();

    private static final AtomicInteger STORE_BARRIER = new AtomicInteger();

    /** Slow path for {@link #get}. */
    private T setComputedValue(Class<?> type) {
        ClassValueMap map = getMap(type);
        if (map == null) {
            map = initializeMap(type);
        }
        T value = computeValue(type);
        STORE_BARRIER.lazySet(0);
        // All stores pending from computeValue are completed.
        synchronized (map) {
            // Warm up the table with a null entry.
            map.preInitializeEntry(this);
        }
162
        STORE_BARRIER.lazySet(0);
163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215
        // All stores pending from table expansion are completed.
        synchronized (map) {
            value = (T) map.initializeEntry(this, value);
            // One might fear a possible race condition here
            // if the code for map.put has flushed the write
            // to map.table[*] before the writes to the Map.Entry
            // are done.  This is not possible, since we have
            // warmed up the table with an empty entry.
        }
        return value;
    }

    // Replace this map by a per-class slot.
    private static final WeakHashMap<Class<?>, ClassValueMap> ROOT
        = new WeakHashMap<Class<?>, ClassValueMap>();

    private static ClassValueMap getMap(Class<?> type) {
        return ROOT.get(type);
    }

    private static ClassValueMap initializeMap(Class<?> type) {
        synchronized (ClassValue.class) {
            ClassValueMap map = ROOT.get(type);
            if (map == null)
                ROOT.put(type, map = new ClassValueMap());
            return map;
        }
    }

    static class ClassValueMap extends WeakHashMap<ClassValue, Object> {
        /** Make sure this table contains an Entry for the given key, even if it is empty. */
        void preInitializeEntry(ClassValue key) {
            if (!this.containsKey(key))
                this.put(key, null);
        }
        /** Make sure this table contains a non-empty Entry for the given key. */
        Object initializeEntry(ClassValue key, Object value) {
            Object prior = this.get(key);
            if (prior != null) {
                return unmaskNull(prior);
            }
            this.put(key, maskNull(value));
            return value;
        }

        Object maskNull(Object x) {
            return x == null ? this : x;
        }
        Object unmaskNull(Object x) {
            return x == this ? null : x;
        }
    }
}