1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/jaxws_classes/com/sun/xml/internal/rngom/binary/PatternInterner.java Wed Apr 27 01:27:09 2016 +0800
1.3 @@ -0,0 +1,112 @@
1.4 +/*
1.5 + * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation. Oracle designates this
1.11 + * particular file as subject to the "Classpath" exception as provided
1.12 + * by Oracle in the LICENSE file that accompanied this code.
1.13 + *
1.14 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.15 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.16 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.17 + * version 2 for more details (a copy is included in the LICENSE file that
1.18 + * accompanied this code).
1.19 + *
1.20 + * You should have received a copy of the GNU General Public License version
1.21 + * 2 along with this work; if not, write to the Free Software Foundation,
1.22 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.23 + *
1.24 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1.25 + * or visit www.oracle.com if you need additional information or have any
1.26 + * questions.
1.27 + */
1.28 +/*
1.29 + * Copyright (C) 2004-2011
1.30 + *
1.31 + * Permission is hereby granted, free of charge, to any person obtaining a copy
1.32 + * of this software and associated documentation files (the "Software"), to deal
1.33 + * in the Software without restriction, including without limitation the rights
1.34 + * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
1.35 + * copies of the Software, and to permit persons to whom the Software is
1.36 + * furnished to do so, subject to the following conditions:
1.37 + *
1.38 + * The above copyright notice and this permission notice shall be included in
1.39 + * all copies or substantial portions of the Software.
1.40 + *
1.41 + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
1.42 + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
1.43 + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
1.44 + * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
1.45 + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
1.46 + * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
1.47 + * THE SOFTWARE.
1.48 + */
1.49 +package com.sun.xml.internal.rngom.binary;
1.50 +
1.51 +final class PatternInterner {
1.52 + private static final int INIT_SIZE = 256;
1.53 + private static final float LOAD_FACTOR = 0.3f;
1.54 + private Pattern[] table;
1.55 + private int used;
1.56 + private int usedLimit;
1.57 +
1.58 + PatternInterner() {
1.59 + table = null;
1.60 + used = 0;
1.61 + usedLimit = 0;
1.62 + }
1.63 +
1.64 + PatternInterner(PatternInterner parent) {
1.65 + table = parent.table;
1.66 + if (table != null)
1.67 + table = (Pattern[]) table.clone();
1.68 + used = parent.used;
1.69 + usedLimit = parent.usedLimit;
1.70 + }
1.71 +
1.72 + @SuppressWarnings("empty-statement")
1.73 + Pattern intern(Pattern p) {
1.74 + int h;
1.75 +
1.76 + if (table == null) {
1.77 + table = new Pattern[INIT_SIZE];
1.78 + usedLimit = (int) (INIT_SIZE * LOAD_FACTOR);
1.79 + h = firstIndex(p);
1.80 + } else {
1.81 + for (h = firstIndex(p); table[h] != null; h = nextIndex(h)) {
1.82 + if (p.samePattern(table[h]))
1.83 + return table[h];
1.84 + }
1.85 + }
1.86 + if (used >= usedLimit) {
1.87 + // rehash
1.88 + Pattern[] oldTable = table;
1.89 + table = new Pattern[table.length << 1];
1.90 + for (int i = oldTable.length; i > 0;) {
1.91 + --i;
1.92 + if (oldTable[i] != null) {
1.93 + int j;
1.94 + for (j = firstIndex(oldTable[i]);
1.95 + table[j] != null;
1.96 + j = nextIndex(j));
1.97 + table[j] = oldTable[i];
1.98 + }
1.99 + }
1.100 + for (h = firstIndex(p); table[h] != null; h = nextIndex(h));
1.101 + usedLimit = (int) (table.length * LOAD_FACTOR);
1.102 + }
1.103 + used++;
1.104 + table[h] = p;
1.105 + return p;
1.106 + }
1.107 +
1.108 + private int firstIndex(Pattern p) {
1.109 + return p.patternHashCode() & (table.length - 1);
1.110 + }
1.111 +
1.112 + private int nextIndex(int i) {
1.113 + return i == 0 ? table.length - 1 : i - 1;
1.114 + }
1.115 +}
