HomeSort by relevance Sort by last modified time
    Searched full:hash (Results 376 - 400 of 2206) sorted by null

<<11121314151617181920>>

  /system/vold/
hash.h 33 /* $Heimdal: hash.h,v 1.1 1999/03/22 19:16:25 joda Exp $
34 $NetBSD: hash.h,v 1.1.1.3 2002/09/12 12:41:42 joda Exp $ */
  /dalvik/libcore/security/src/main/java/java/security/
UnresolvedPermission.java 55 // Cached hash value
56 private transient int hash; field in class:UnresolvedPermission
89 hash = 0;
195 * Returns the hash code value for this {@code UnresolvedPermission}.
196 * Returns the same hash code for {@code UnresolvedPermission}s that are
200 * @return the hash code value for this {@code UnresolvedPermission}.
206 if (hash == 0) {
207 hash = getName().hashCode();
209 hash ^= name.hashCode();
212 hash ^= actions.hashCode()
    [all...]
  /external/dropbear/libtomcrypt/src/mac/hmac/
hmac_test.c 20 #define HMAC_BLOCKSIZE hash_descriptor[hash].blocksize
76 data = "Test Using Larger Than Block-Size Key - Hash Key First"
91 "Test Using Larger Than Block-Size Key - Hash Key First", 54,
218 data = "Test Using Larger Than Block-Size Key - Hash
235 "Test Using Larger Than Block-Size Key - Hash Key First", 54,
269 int hash = find_hash(cases[i].algo);
270 if (hash == -1) continue;
273 if((err = hmac_memory(hash, cases[i].key, cases[i].keylen, cases[i].data, cases[i].datalen, digest, &outlen)) != CRYPT_OK) {
280 if(XMEMCMP(digest, cases[i].digest, (size_t)hash_descriptor[hash].hashsize) != 0) {
286 for(j=0; j < hash_descriptor[hash].hashsize; j++)
    [all...]
  /external/e2fsprogs/e2fsck/
revoke.c 83 struct list_head hash; member in struct:jbd_revoke_record_s
89 /* The revoke table is just a simple hash table of revoke records. */
92 /* It is conceivable that we might want a larger hash table
109 /* Borrowed from buffer.c: this is a tried and tested block hash function */
110 static inline int hash(journal_t *journal, unsigned long block) function
135 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
136 list_add(&record->hash, hash_list);
152 /* Find a revoke record in the journal's hash table. */
160 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
163 while (&(record->hash) != hash_list)
    [all...]
  /external/wpa_supplicant/
sha1.c 2 * SHA1 hash implementation and interface functions
30 * @mac: Buffer for the hash (20 bytes)
101 * @mac: Buffer for the hash (20 bytes)
128 u8 hash[SHA1_MAC_LEN]; local
151 hash);
152 os_memcpy(&buf[pos], hash, plen);
179 u8 hash[SHA1_MAC_LEN]; local
185 addr[0] = hash;
202 hmac_sha1_vector(key, key_len, 5, addr, len, hash);
204 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN)
    [all...]
  /external/wpa_supplicant_6/wpa_supplicant/src/crypto/
sha1.c 2 * SHA1 hash implementation and interface functions
30 * @mac: Buffer for the hash (20 bytes)
101 * @mac: Buffer for the hash (20 bytes)
128 u8 hash[SHA1_MAC_LEN]; local
149 hash);
150 os_memcpy(&buf[pos], hash, plen);
177 u8 hash[SHA1_MAC_LEN]; local
183 addr[0] = hash;
200 hmac_sha1_vector(key, key_len, 5, addr, len, hash);
202 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN)
    [all...]
  /build/tools/apriori/
Android.mk 38 hash.c \
  /build/tools/soslim/
symfilter.h 32 section_info_t hash; member in struct:symfilter_t
  /dalvik/dx/src/com/android/dx/dex/code/
CatchTable.java 133 int hash = (start * 31) + end; local
134 hash = (hash * 31) + handlers.hashCode();
135 return hash;
  /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/
SubjectKeyIdentifier.java 65 * Calulates the keyidentifier using a SHA1 hash over the BIT STRING
  /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/digests/
SHA384Digest.java 72 /* SHA-384 initial hash value
SHA512Digest.java 73 /* SHA-512 initial hash value
  /dalvik/libcore/xml/src/test/resources/
simple.xml 31 <description>two eggs, bacon or sausage, toast, and our ever-popular hash browns</description>
  /dalvik/vm/
AtomicCache.h 98 int hash; \
102 /* simple hash function */ \
103 hash = (((u4)(_key1) >> 2) ^ (u4)(_key2)) & ((_cacheSize)-1); \
104 pEntry = (_cache)->entries + hash; \
  /development/tools/apkcheck/src/com/android/apkcheck/
FieldInfo.java 40 * Returns the combined name and type. This value is used as a hash
  /external/bluetooth/glib/gio/
gemblemedicon.c 189 guint hash = g_icon_hash (emblemed->icon); local
192 hash ^= g_icon_hash (G_ICON (list->data));
194 return hash;
348 iface->hash = g_emblemed_icon_hash;
  /external/clearsilver/man/man3/
dictNext.3 35 The order is the order of the hash of the ids, which
  /external/dropbear/
common-kex.c 216 /* Helper function for gen_new_keys, creates a hash. It makes a copy of the
218 * the dh_K and hash, since these are common. X is the letter 'A', 'B' etc.
266 /* the dh_K and hash are the start of all hashes, we make use of that */
272 sha1_process(&hs, ses.hash, SHA1_HASH_SIZE);
273 m_burn(ses.hash, SHA1_HASH_SIZE);
391 * and we calculate the first portion of the key-exchange-hash for used
412 /* start the kex hash */
551 /* Create the remainder of the hash buffer, to generate the exchange hash */
561 /* calculate the hash H to sign *
    [all...]
  /external/dropbear/libtomcrypt/src/misc/crypt/
crypt_find_hash_oid.c 15 Find a hash, Tom St Denis
  /external/elfcopy/
Android.mk 13 hash.c \
  /external/elfutils/libelf/
nlist.c 37 /* XXX Use a better hash function some day. */
119 /* Create the hash table. */
147 /* And add it to the hash table. Note that we are using the
166 /* Search for a matching entry in the hash table. */
  /external/giflib/
gif_hash.h 2 * Declarations, global to other of the GIF-HASH.C module. *
  /external/guava/src/com/google/common/base/
Objects.java 56 * Generates a hash code for multiple values. The hash code is generated by
67 * <b>Warning</b>: When a single object is supplied, the returned hash code
68 * does not equal the hash code of that object.
  /external/icu4c/common/
uhash_us.cpp 14 #include "hash.h"
  /external/icu4c/i18n/
rbt_data.h 20 #include "hash.h"
59 * this hash. One or more of these chars may also correspond to a
60 * UnicodeMatcher, in which case the character in the UnicodeString in this hash is
71 * The stand-in then serves as a key in this hash to lookup the

Completed in 1289 milliseconds

<<11121314151617181920>>