⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 name.java

📁 这是实现Javac功能的GJC的最新源码
💻 JAVA
📖 第 1 页 / 共 2 页
字号:
/** * @(#)Name.java	1.15 03/01/23 * * Copyright 2003 Sun Microsystems, Inc. All rights reserved. * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. */package com.sun.tools.javac.v8.util;import java.lang.ref.SoftReference;/** * An abstraction for internal compiler strings. For efficiency reasons, *  GJC uses hashed strings that are stored in a common large buffer. * *  Names represent unique hashable strings. Two names are equal *  if their indices are equal. Utf8 representation is used *  for storing names internally. */public class Name {    public Name() {        super();    }    /**      * The table structure where the name is stored      */    public Table table;    /**     * The index where the bytes of this name are stored in the global name     *  buffer `names'.     */    public int index;    /**     * The number of bytes in this name.     */    public int len;    /**     * The next name occupying the same hash bucket.     */    Name next;    /**     * The hashcode of a name.     */    private static int hashValue(byte[] cs, int start, int len) {        if (len > 0)            return len * (41 * 41 * 41) + cs[start] * (41 * 41) +                    cs[start + len - 1] * 41 + cs[start + (len >> 1)];        else            return 0;    }    /**      * Is (the utf8 representation of) name equal to      *  cs[start..start+len-1]?      */    private static boolean equals(byte[] names, int index, byte[] cs, int start,            int len) {        int i = 0;        while (i < len && names[index + i] == cs[start + i])            i++;        return i == len;    }    /**      * Create a name from the bytes in cs[start..start+len-1].      *  Assume that bytes are in utf8 format.      */    public static Name fromUtf(Table table, byte[] cs, int start, int len) {        int h = hashValue(cs, start, len) & table.hashMask;        Name n = table.hashes[h];        byte[] names = table.names;        while (n != null && (n.len != len || !equals(names, n.index, cs, start, len)))            n = n.next;        if (n == null) {            int nc = table.nc;            while (nc + len > names.length) {                byte[] newnames = new byte[names.length * 2];                System.arraycopy(names, 0, newnames, 0, names.length);                names = table.names = newnames;            }            System.arraycopy(cs, start, names, nc, len);            n = new Name();            n.table = table;            n.index = nc;            n.len = len;            n.next = table.hashes[h];            table.hashes[h] = n;            table.nc = nc + len;            if (len == 0)                table.nc++;        }        return n;    }    /**      * Create a name from the bytes in array cs.      *  Assume that bytes are in utf8 format.      */    public static Name fromUtf(Table table, byte[] cs) {        return fromUtf(table, cs, 0, cs.length);    }    /**      * Create a name from the characters in cs[start..start+len-1].      */    public static Name fromChars(Table table, char[] cs, int start, int len) {        int nc = table.nc;        byte[] names = table.names;        while (nc + len * 3 >= names.length) {            byte[] newnames = new byte[names.length * 2];            System.arraycopy(names, 0, newnames, 0, names.length);            names = table.names = newnames;        }        int nbytes = Convert.chars2utf(cs, start, names, nc, len) - nc;        int h = hashValue(names, nc, nbytes) & table.hashMask;        Name n = table.hashes[h];        while (n != null &&                (n.len != nbytes || !equals(names, n.index, names, nc, nbytes)))            n = n.next;        if (n == null) {            n = new Name();            n.table = table;            n.index = nc;            n.len = nbytes;            n.next = table.hashes[h];            table.hashes[h] = n;            table.nc = nc + nbytes;            if (nbytes == 0)                table.nc++;        }        return n;    }    /**      * Create a name from the characters in string s.      */    public static Name fromString(Table table, String s) {        char[] cs = s.toCharArray();        return fromChars(table, cs, 0, cs.length);    }    /**      * Return the Utf8 representation of this name.      */    public byte[] toUtf() {        byte[] bs = new byte[len];        System.arraycopy(table.names, index, bs, 0, len);        return bs;    }    /**      * Return the string representation of this name.      */    public String toString() {        return Convert.utf2string(table.names, index, len);    }    /**      * Return the string representation of this name.  This method is provided      *  for consistency in internationalization.      */    public String toJava() {        return toString();    }    /**      * Copy all bytes of this name to buffer cs, starting at start.      */    public void getBytes(byte[] cs, int start) {        System.arraycopy(table.names, index, cs, start, len);    }    /**      * Return the hash value of this name.      */    public int hashCode() {        return index;    }    /**      * Is this name equal to other?      */    public boolean equals(Object other) {        if (other instanceof Name)            return table == ((Name) other).table && index == ((Name) other).index;        else            return false;    }    /**      * Compare this name to other name, yielding -1 if smaller, 0 if equal,      *  1 if greater.      */    public boolean less(Name that) {        int i = 0;        while (i < this.len && i < that.len) {            byte thisb = this.table.names[this.index + i];            byte thatb = that.table.names[that.index + i];            if (thisb < thatb)                return true;            else if (thisb > thatb)                return false;            else                i++;        }        return this.len < that.len;    }    /**      * Returns the length of this name.      */    public int length() {        return len;    }    /**      * Returns i'th byte of this name.      */    public byte byteAt(int i) {        return table.names[index + i];    }    /**      * Returns first occurrence of byte b in this name, len if not found.      */    public int indexOf(byte b) {        byte[] names = table.names;        int i = 0;        while (i < len && names[index + i] != b)            i++;        return i;    }    /**      * Returns last occurrence of byte b in this name, -1 if not found.      */    public int lastIndexOf(byte b) {        byte[] names = table.names;        int i = len - 1;        while (i >= 0 && names[index + i] != b)            i--;        return i;    }    /**      * Does this name start with prefix?      */    public boolean startsWith(Name prefix) {        int i = 0;        while (i < prefix.len && i < len &&                table.names[index + i] == prefix.table.names[prefix.index + i])            i++;        return i == prefix.len;    }    /**      * Does this name end with suffix?      */    public boolean endsWith(Name suffix) {        int i = len - 1;        int j = suffix.len - 1;        while (j >= 0 && i >= 0 &&                table.names[index + i] == suffix.table.names[suffix.index + j]) {            i--;            j--;        }        return j < 0;    }    /**      * Returns the sub-name starting at position start, up to and      *  excluding position end.      */    public Name subName(int start, int end) {        if (end < start)            end = start;        return fromUtf(table, table.names, index + start, end - start);

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -