Searched refs:hash (Results 1 - 25 of 92) sorted by relevance

1234

/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/
H A DExtendedType.java32 private int hash; field in class:ExtendedType
36 * The hash code is calculated from the node type, namespace and local name.
47 this.hash = nodetype + namespace.hashCode() + localName.hashCode();
52 * and a given hash code.
57 * @param hash The given hash code
59 public ExtendedType (int nodetype, String namespace, String localName, int hash) argument
64 this.hash = hash;
77 this.hash
85 redefine(int nodetype, String namespace, String localName, int hash) argument
[all...]
H A DExpandedNameTable.java31 * a simple hash algorithm directly into this class, instead of using the
33 * are combined in getExpandedTypeID() method to share the same hash calculation
35 * expand the hash table.
80 * The initial capacity of the hash table. Use a bigger number
86 * The capacity of the hash table, i.e. the size of the
92 * The threshold of the hash table, which is equal to capacity * loadFactor.
93 * If the number of entries in the hash table is bigger than the threshold,
94 * the hash table needs to be expanded.
99 * The internal array to store the hash entries.
100 * Each array member is a slot for a hash bucke
379 int hash; field in class:ExpandedNameTable.HashEntry
382 HashEntry(ExtendedType key, int value, int hash, HashEntry next) argument
[all...]
/dalvik/vm/test/
H A DTestHash.c18 * Test the hash table functions.
76 * Some quick hash table tests.
83 u4 hash; local
97 hash = dvmComputeUtf8Hash(tmpStr);
98 dvmHashTableLookup(pTab, hash, strdup(tmpStr),
107 hash = dvmComputeUtf8Hash(tmpStr);
108 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr,
118 hash = dvmComputeUtf8Hash(tmpStr);
119 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr,
141 hash
[all...]
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/cert/
H A DCache.java75 // AA - 2 bytes for prefix hash
77 // BB - 2 bytes for tail hash
82 // the similar hash codes.
84 // The masks to work with hash codes:
85 // the hash code without the reserved bytes
87 // the hash code of the prefix
94 // the number of bytes which will be used for array hash generation.
98 // This information includes: hash of the array, encoded form of the object,
100 // The hash-encoding-object correspondence is made by means of index
101 // in the particular array. I.e. for index N hash containe
230 get(long hash, byte[] encoding) argument
255 put(long hash, byte[] encoding, Object object) argument
[all...]
/dalvik/libcore/luni/src/main/java/java/util/
H A DUUID.java55 private transient int hash; field in class:UUID
79 // setup hash field
82 hash = msbHash ^ lsbHash;
168 byte[] hash;
171 hash = md.digest(name);
176 long msb = (hash[0] & 0xFFL) << 56;
177 msb |= (hash[1] & 0xFFL) << 48;
178 msb |= (hash[2] & 0xFFL) << 40;
179 msb |= (hash[3] & 0xFFL) << 32;
180 msb |= (hash[
[all...]
H A DHashMap.java90 * The hash table. If this hash map contains a mapping for null, it is
91 * not represented this hash table.
101 * The number of mappings in this hash map.
137 * the initial capacity of this hash map.
169 * the initial capacity of this hash map.
301 int hash = key.hashCode();
302 hash ^= (hash >>> 20) ^ (hash >>> 1
478 addNewEntry(K key, V value, int hash, int index) argument
496 constructorNewEntry( K key, V value, int hash, HashMapEntry<K, V> first) argument
729 final int hash; field in class:HashMap.HashMapEntry
732 HashMapEntry(K key, V value, int hash, HashMapEntry<K, V> next) argument
[all...]
H A DHashtable.java76 * The hash table.
81 * The number of mappings in this hash map.
267 int hash = key.hashCode();
268 hash ^= (hash >>> 20) ^ (hash >>> 12);
269 hash ^= (hash >>> 7) ^ (hash >>> 4);
272 for (HashtableEntry<K, V> e = tab[hash
667 final int hash; field in class:Hashtable.HashtableEntry
670 HashtableEntry(K key, V value, int hash, HashtableEntry<K, V> next) argument
[all...]
H A DLinkedHashMap.java110 * the initial capacity of this hash map.
159 LinkedEntry(K key, V value, int hash, HashMapEntry<K, V> next, argument
161 super(key, value, hash, next);
173 * to the hash table (which is properly the province of our superclass).
178 * the resulting hash table corrupt.
180 @Override void addNewEntry(K key, V value, int hash, int index) { argument
192 key, value, hash, table[index], header, oldTail);
216 K key, V value, int hash, HashMapEntry<K, V> next) {
220 = new LinkedEntry<K,V>(key, value, hash, next, header, oldTail);
247 int hash
215 constructorNewEntry( K key, V value, int hash, HashMapEntry<K, V> next) argument
[all...]
/dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/
H A DCertificateVerify.java42 * @param hash
44 public CertificateVerify(byte[] hash) { argument
45 if (hash == null || hash.length == 0) {
47 "INTERNAL ERROR: incorrect certificate verify hash");
49 this.signedHash = hash;
50 length = hash.length + 2;
H A DServerKeyExchange.java50 final byte[] hash; field in class:ServerKeyExchange
59 * @param hash should be null for anonymous SignatureAlgorithm
62 byte[] hash) {
66 this.hash = hash;
73 if (hash != null) {
74 length += 2 + hash.length;
133 hash = in.read(size);
134 this.length += 2 + hash.length;
136 hash
61 ServerKeyExchange(BigInteger par1, BigInteger par2, BigInteger par3, byte[] hash) argument
[all...]
H A DPRF.java160 byte[] hash = md5_mac.doFinal(seed); // A(1)
162 md5_mac.update(hash);
174 hash = md5_mac.doFinal(hash);
183 hash = sha_mac.doFinal(seed); // A(1)
186 sha_mac.update(hash);
193 hash = sha_mac.doFinal(hash);
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java20 * A hash table supporting full concurrency of retrievals and
38 * Enumerations return elements reflecting the state of the hash table
48 * in hash tables is essentially random, the actual concurrency will
57 * hash table is a relatively slow operation, so, when possible, it is
79 * each of which itself is a concurrently readable hash table.
128 * key's hash code are used to choose the segment.
138 * The segments, each of which is a specialized hash table
149 * Applies a supplemental hash function to a given hashCode, which
150 * defends against poor quality hash functions. This is critical
151 * because ConcurrentHashMap uses power-of-two length hash table
155 private static int hash(int h) { method in class:ConcurrentHashMap
171 segmentFor(int hash) argument
191 final int hash; field in class:ConcurrentHashMap.HashEntry
195 HashEntry(K key, int hash, HashEntry<K,V> next, V value) argument
310 getFirst(int hash) argument
333 get(Object key, int hash) argument
349 containsKey(Object key, int hash) argument
378 replace(K key, int hash, V oldValue, V newValue) argument
396 replace(K key, int hash, V newValue) argument
415 put(K key, int hash, V value, boolean onlyIfAbsent) argument
513 remove(Object key, int hash, Object value) argument
[all...]
/dalvik/libcore/security/src/main/java/java/security/
H A DCodeSigner.java36 // Cached hash code value
37 private transient int hash; field in class:CodeSigner
106 * Returns the hash code value for this {@code CodeSigner}. Returns the same
107 * hash code for {@code CodeSigner}s that are equal to each other as
110 * @return the hash code value for this {@code CodeSigner}.
116 if (hash == 0) {
117 hash = signerCertPath.hashCode()
120 return hash;
H A DTimestamp.java38 // Cached hash
39 private transient int hash; field in class:Timestamp
111 * Returns the hash code value for this {@code Timestamp}. Returns the same
112 * hash code for {@code Timestamp}s that are equal to each other as
115 * @return the hash code value for this {@code Timestamp}.
121 if (hash == 0) {
122 hash = timestamp.hashCode() ^ signerCertPath.hashCode();
124 return hash;
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/
H A DUnresolvedPrincipal.java124 * Returns the hash code value for this object.
127 int hash = 0;
129 hash ^= name.hashCode();
132 hash ^= klass.hashCode();
134 return hash;
/dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/ess/
H A DESSCertID.java54 byte[] hash)
56 certHash = new DEROctetString(hash);
60 byte[] hash,
63 this.certHash = new DEROctetString(hash);
53 ESSCertID( byte[] hash) argument
59 ESSCertID( byte[] hash, IssuerSerial issuerSerial) argument
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/encodings/
H A DOAEPEncoding.java20 private Digest hash; field in class:OAEPEncoding
34 Digest hash)
36 this(cipher, hash, null);
41 Digest hash,
45 this.hash = hash;
46 this.defHash = new byte[hash.getDigestSize()];
50 hash.update(encodingParams, 0, encodingParams.length);
53 hash.doFinal(defHash, 0);
152 // add the hash o
32 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash) argument
39 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash, byte[] encodingParams) argument
[all...]
/dalvik/vm/hprof/
H A DHprofString.c43 u4 hash = 0; local
49 hash = hash * 31 + c;
52 return hash;
H A DHprofClass.c45 u4 hash; local
50 hash = (u4)clazz->classLoader;
52 hash = hash * 31 + c;
55 return hash;
163 /* We're using the hash table as a list.
164 * TODO: replace the hash table with a more suitable structure
/dalvik/vm/
H A DIntern.c69 u4 hash; local
72 hash = dvmComputeStringHash(strObj);
87 hash, strObj, hashcmpImmortalStrings, true);
92 * There's no way to get a pointer to the actual hash table entry,
96 dvmHashTableRemove(gDvm.internedStrings, hash, found);
99 hash, found, hashcmpImmortalStrings, true);
H A DAtomicCache.h98 int hash; \
102 /* simple hash function */ \
103 hash = (((u4)(_key1) >> 2) ^ (u4)(_key2)) & ((_cacheSize)-1); \
104 pEntry = (_cache)->entries + hash; \
/dalvik/dx/src/com/android/dx/dex/code/
H A DCatchTable.java133 int hash = (start * 31) + end;
134 hash = (hash * 31) + handlers.hashCode();
135 return hash;
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/utils/
H A DObjectIdentifier.java47 //hash code
48 private int hash = -1; field in class:ObjectIdentifier
177 if (hash == -1) {
178 hash = hashIntArray(oid);
180 return hash;
211 * Returns hash code for array of integers
/dalvik/libcore/luni-kernel/src/main/java/org/apache/harmony/lang/annotation/
H A DAnnotationMember.java251 * Computes hash code of this element. The formula is as follows:
255 * @return the hash code
260 int hash = name.hashCode() * 127;
264 return hash ^ Arrays.hashCode((int[])value);
266 return hash ^ Arrays.hashCode((byte[])value);
268 return hash ^ Arrays.hashCode((short[])value);
270 return hash ^ Arrays.hashCode((long[])value);
272 return hash ^ Arrays.hashCode((char[])value);
274 return hash ^ Arrays.hashCode((boolean[])value);
276 return hash
[all...]
/dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/
H A DJDKDigestSignature.java123 byte[] hash = new byte[digest.getDigestSize()];
125 digest.doFinal(hash, 0);
129 byte[] bytes = derEncode(hash);
147 byte[] hash = new byte[digest.getDigestSize()];
149 digest.doFinal(hash, 0);
158 expected = derEncode(hash);
177 int sigOffset = sig.length - hash.length - 2;
178 int expectedOffset = expected.length - hash.length - 2;
183 for (int i = 0; i < hash.length; i++)
185 if (sig[sigOffset + i] != expected[expectedOffset + i]) // check hash
232 derEncode( byte[] hash) argument
[all...]

Completed in 471 milliseconds

1234