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

1 2 3 4 5 6 7 891011>>

  /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/internal/repository/
SamplePackage.java 276 // Get the hash computed during the last installation
280 // Get the hash of the folder now
316 * Computes a hash of the installed content (in case of successful install.)
333 * Reads the hash from the properties file, if it exists.
335 * it doesn't contain our hash. Returns an empty string if the hash wasn't
347 return props.getProperty("content-hash", null); //$NON-NLS-1$
364 * Saves the hash using a properties file
366 private void saveContentHash(File folder, String hash) {
369 props.setProperty("content-hash", hash == null ? "" : hash); //$NON-NLS-1$ //$NON-NLS-2$
    [all...]
  /dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/
PBE.java 50 int hash)
56 switch (hash)
74 switch (hash)
207 int hash,
211 PBEParametersGenerator generator = makePBEGenerator(type, hash);
251 int hash,
254 PBEParametersGenerator generator = makePBEGenerator(type, hash);
  /dalvik/vm/hprof/
HprofClass.c 45 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
  /external/dropbear/libtomcrypt/src/pk/dsa/
dsa_sign_hash.c 15 DSA implementation, sign a hash, Tom St Denis
21 Sign a hash with DSA
22 @param in The hash to sign
23 @param inlen The length of the hash to sign
112 Sign a hash with DSA
113 @param in The hash to sign
114 @param inlen The length of the hash to sign
  /external/dropbear/libtomcrypt/src/pk/ecc/
ecc_verify_hash.c 40 @param hash The hash (message digest) that was signed
41 @param hashlen The length of the hash (octets)
47 const unsigned char *hash, unsigned long hashlen,
56 LTC_ARGCHK(hash != NULL);
102 /* read hash */
103 if ((err = mp_read_unsigned_bin(e, (unsigned char *)hash, (int)hashlen)) != CRYPT_OK) { goto error; }
  /external/oprofile/daemon/
opd_anon.c 79 unsigned long hash = hash_anon(trans->tgid, trans->app_cookie); local
88 list_for_each_safe(pos, pos2, &hashes[hash]) {
111 unsigned long hash = hash_anon(trans->tgid, trans->app_cookie); local
118 list_add_tail(&m->list, &hashes[hash]);
181 unsigned long hash = hash_anon(trans->tgid, trans->app_cookie); local
190 list_for_each(pos, &hashes[hash]) {
211 list_add(&entry->list, &hashes[hash]);
  /frameworks/base/tests/CoreTests/android/core/
CryptoTest.java 54 Assert.assertEquals("Hash names must be equal", oldDigest.getAlgorithmName(), newDigest.getAlgorithmName());
55 Assert.assertEquals("Hash sizes must be equal", oldHash.length, newHash.length);
56 Assert.assertEquals("Hash block sizes must be equal", ((ExtendedDigest)oldDigest).getByteLength(), ((ExtendedDigest)newDigest).getByteLength());
83 Assert.assertEquals("Hash sizes must be equal", oldLength, newLength);
90 android.util.Log.d("CryptoTest", "Time for " + ITERATIONS + " x old hash processing: " + oldTime + " ms");
91 android.util.Log.d("CryptoTest", "Time for " + ITERATIONS + " x new hash processing: " + newTime + " ms");
93 // Assert.assertTrue("New hash should be faster", newTime < oldTime);
  /external/dropbear/libtomcrypt/src/hashes/chc/
chc.c 83 Initialize the hash state
84 @param md The hash state you wish to initialize
163 Process a block of memory though the hash
164 @param md The hash state
165 @param in The data to hash
188 Terminate the hash to get the digest
189 @param md The hash state
190 @param out [out] The destination of the hash (length of the block size of the block cipher)
249 Self-test the hash
  /external/webkit/JavaScriptCore/runtime/
Identifier.cpp 102 static unsigned hash(const char* c) function in struct:JSC::CStringTranslator
112 static void translate(UString::Rep*& location, const char* c, unsigned hash)
119 r->setHash(hash);
129 UString::Rep::empty().hash();
164 static unsigned hash(const UCharBuffer& buf) function in struct:JSC::UCharBufferTranslator
174 static void translate(UString::Rep*& location, const UCharBuffer& buf, unsigned hash)
180 r->setHash(hash);
193 UString::Rep::empty().hash();
224 UString::Rep::empty().hash();
PropertyMapHashTable.h 72 // have a 0 in its key to allow the hash table lookup to handle deleted
79 // We never let a hash table get more than half full,
80 // So the number of indices we need is the size of the hash table.
  /external/wpa_supplicant_6/wpa_supplicant/src/wps/
wps_common.c 33 u8 hash[SHA256_MAC_LEN], *opos; local
53 hmac_sha256_vector(key, SHA256_MAC_LEN, 4, addr, len, hash);
55 os_memcpy(opos, hash, SHA256_MAC_LEN);
59 os_memcpy(opos, hash, left);
134 u8 hash[SHA256_MAC_LEN]; local
137 (dev_passwd_len + 1) / 2, hash);
138 os_memcpy(wps->psk1, hash, WPS_PSK_LEN);
141 dev_passwd_len / 2, hash);
142 os_memcpy(wps->psk2, hash, WPS_PSK_LEN);
  /dalvik/libcore/security/src/main/java/java/security/
Principal.java 47 * Returns the hash code value for this {@code Principal}. Returns the same
48 * hash code for {@code Principal}s that are equal to each other as
51 * @return the hash code value for this {@code Principal}.
  /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/signers/
ISO9796d2Signer.java 16 * ISO9796-2 - mechanism using a hash function with recovery (scheme 1)
43 * @param implicit whether or not the trailer is implicit or gives the hash.
366 throw new IllegalArgumentException("unrecognised hash in signature");
390 byte[] hash = new byte[digest.getDigestSize()];
392 int off = block.length - delta - hash.length;
406 // if we contain the whole message as well, check the hash of that.
414 digest.doFinal(hash, 0);
416 for (int i = 0; i != hash.length; i++)
418 block[off + i] ^= hash[i];
435 digest.doFinal(hash, 0)
    [all...]
  /external/bison/lib/
hash.h 0 /* hash - hashing table processing.
19 /* A generic hash table package. */
22 obstacks instead of malloc, and recompile `hash.c' with same setting. */
hash.c 0 /* hash - hashing table processing.
22 /* A generic hash table package. */
31 #include "hash.h"
86 /* A hash table contains many internal entries, each holding a pointer to
91 and the current table size. At each slot position in the hash table,
92 starts a linked chain of entries for which the user data all hash to this
100 larger hash table size (that is, a larger number of buckets) is prone to
103 Long buckets slow down the lookup algorithm. One might use big hash table
105 become inordinate, as unused slots in the hash table take some space. The
141 /* The following few functions provide information about the overall hash
    [all...]
  /external/bluetooth/glib/gio/
gicon.h 49 * @hash: A hash for a given #GIcon.
68 guint (* hash) (GIcon *icon); member in struct:_GIconIface
  /external/dropbear/libtomcrypt/src/hashes/sha2/
sha512.c 171 Initialize the hash state
172 @param md The hash state you wish to initialize
192 Process a block of memory though the hash
193 @param md The hash state
194 @param in The data to hash
201 Terminate the hash to get the digest
202 @param md The hash state
203 @param out [out] The destination of the hash (64 bytes)
236 * note: that from 112 to 120 is the 64 MSB of the length. We assume that you won't hash
258 Self-test the hash
    [all...]
  /external/dropbear/libtomcrypt/src/misc/pkcs5/
pkcs_5_1.c 24 @param hash_idx The index of the hash desired
44 /* test hash IDX */
62 /* hash initial password + salt */
  /external/e2fsprogs/debugfs/
debug_cmds.ct 136 request do_htree_dump, "Dump a hash-indexed directory",
139 request do_dx_hash, "Calculate the directory hash of a filename",
140 dx_hash, hash;
  /external/icu4c/test/intltest/
sfwdchit.cpp 18 // A hash code of kInvalidHashCode indicates that the has code needs
19 // to be computed. A hash code of kEmptyHashCode is used for empty keys
20 // and for any key whose computed hash code is kInvalidHashCode.
  /external/wpa_supplicant_6/wpa_supplicant/src/utils/
uuid.c 86 u8 hash[SHA1_MAC_LEN]; local
99 sha1_vector(2, addr, len, hash);
100 os_memcpy(uuid, hash, 16);
  /bionic/libc/netbsd/resolv/
res_cache.c 57 * - the implementation is just a (query-data) => (answer-data) hash table
749 /* use 32-bit FNV hash function */
754 _dnsPacket_hashBytes( DnsPacket* packet, int numBytes, unsigned hash )
760 hash = hash*FNV_MULT ^ *p++;
763 return hash;
768 _dnsPacket_hashQName( DnsPacket* packet, unsigned hash )
796 hash = hash*FNV_MULT ^ *p++;
801 return hash;
817 unsigned hash = FNV_BASIS; local
981 unsigned int hash; \/* hash value *\/ member in struct:Entry
    [all...]
  /bootable/recovery/minzip/
Inlines.c 23 #include "Hash.h"
  /build/tools/lsd/
Android.mk 27 hash.c \
  /cts/tests/assets/webkit/
jsform.html 22 if (location.hash == "") {

Completed in 57 milliseconds

1 2 3 4 5 6 7 891011>>