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

<<11121314151617181920>>

  /frameworks/base/core/java/android/security/
Md5MessageDigest.java 20 * Provides the MD5 hash encryption.
Sha1MessageDigest.java 20 * Provides the SHA-1 hash encyption.
  /hardware/ti/wlan/wl1271/stad/src/Sta_Management/
siteHash.c 35 * \brief Site Hash implementation
43 /* PURPOSE: Site Hash implementation */
58 This file implements the site hash mechanism. This mechanism is used for faster access to the sites information.
60 1. hash function - which maps the 4 last bits of the BSSID to an entry in the hash table.
61 2. hash table - each entry in the table points to a linked list of site entries
64 In order to find a site in the site table, we operate the hash function on the site's BSSID.
65 We receive a hash entry. We go over the linked list pointed by this hash entry until we find the site entry.
80 - Hash tabl
    [all...]
  /ndk/build/platforms/android-5/arch-x86/usr/lib/
libdl.so 
  /ndk/build/platforms/android-8/arch-x86/usr/lib/
libdl.so 
  /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/i686-unknown-linux-gnu/lib/ldscripts/
i386linux.x 17 *(.hash)
i386linux.xbn 17 *(.hash)
i386linux.xn 17 *(.hash)
  /system/core/sh/
builtins.c 24 { "hash", hashcmd },
  /system/wlan/ti/sta_dk_4_0_4_32/common/src/core/sme/siteMgr/
siteHash.c 2 * \brief Site Hash implementation
44 /* PURPOSE: Site Hash implementation */
58 This file implements the site hash mechanism. This mechanism is used for faster access to the sites information.
60 1. hash function - which maps the 4 last bits of the BSSID to an entry in the hash table.
61 2. hash table - each entry in the table points to a linked list of site entries
64 In order to find a site in the site table, we operate the hash function on the site's BSSID.
65 We receive a hash entry. We go over the linked list pointed by this hash entry until we find the site entry.
80 - Hash tabl
    [all...]
  /bootable/recovery/minzip/
Hash.c 4 * Hash table. The dominant calls are add and lookup, with removals
13 #include "Hash.h"
49 * Create and initialize a hash table.
113 * Count up the number of tombstone entries in the hash table.
128 * Resize a hash table. We do this when adding an entry increased the
133 * If multiple threads can access the hash table, the table's lock should
227 LOGE("Dalvik hash resize failure\n");
288 * Execute a function on every entry in the hash table.
354 * Evaluate the amount of probing required for the specified hash table.
356 * We do this by running through all entries in the hash table, computin
    [all...]
  /dalvik/vm/
Hash.c 17 * Hash table. The dominant calls are add and lookup, with removals
42 * Create and initialize a hash table.
109 * Count up the number of tombstone entries in the hash table.
124 * Resize a hash table. We do this when adding an entry increased the
129 * If multiple threads can access the hash table, the table's lock should
223 LOGE("Dalvik hash resize failure\n");
284 * Scan every entry in the hash table and evaluate it with the specified
316 * Execute a function on every entry in the hash table.
382 * Evaluate the amount of probing required for the specified hash table.
384 * We do this by running through all entries in the hash table, computin
    [all...]
  /external/dropbear/libtomcrypt/src/hashes/
sha1.c 161 Initialize the hash state
162 @param md The hash state you wish to initialize
179 Process a block of memory though the hash
180 @param md The hash state
181 @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 (20 bytes)
242 Self-test the hash
252 unsigned char hash[20]
    [all...]
  /external/icu4c/i18n/
sortkey.cpp 40 // A hash code of kInvalidHashCode indicates that the has code needs
41 // to be computed. A hash code of kEmptyHashCode is used for empty keys
42 // and for any key whose computed hash code is kInvalidHashCode.
364 // We compute the hash by iterating sparsely over 64 (at most) characters
366 // previous hash value by a prime number and add the new character in,
372 int32_t hash = 0;
376 hash = ( hash * 37 ) + ((p[0] << 8) + p[1]);
381 if (hash == kInvalidHashCode)
383 hash = kEmptyHashCode
    [all...]
  /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/ocsp/
CertID.java 89 * issuerNameHash OCTET STRING, -- Hash of Issuer's DN
90 * issuerKeyHash OCTET STRING, -- Hash of Issuers public key
  /dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/
PRF.java 160 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);
  /external/apache-http/src/org/apache/http/
HttpHost.java 207 int hash = LangUtils.HASH_SEED; local
208 hash = LangUtils.hashCode(hash, this.lcHostname);
209 hash = LangUtils.hashCode(hash, this.port);
210 hash = LangUtils.hashCode(hash, this.schemeName);
211 return hash;
  /external/apache-http/src/org/apache/http/message/
BasicHeaderElement.java 213 int hash = LangUtils.HASH_SEED; local
214 hash = LangUtils.hashCode(hash, this.name);
215 hash = LangUtils.hashCode(hash, this.value);
217 hash = LangUtils.hashCode(hash, this.parameters[i]);
219 return hash;
  /external/clearsilver/
ClearSilver.h 21 #if defined(CS_COMPAT) || !defined(HASH)
22 #define HASH NE_HASH
  /external/dropbear/libtomcrypt/src/headers/
tomcrypt.h 22 /* max size of either a cipher/hash block or symmetric key [largest of the two] */
46 CRYPT_INVALID_HASH, /* Invalid hash specified */
  /external/e2fsprogs/lib/ext2fs/
ext2_ext_attr.h 22 __u32 h_hash; /* hash value of all attributes */
32 __u32 e_hash; /* hash value of name and value */
  /external/elfutils/libdw/
dwarf_tag.c 28 /* See whether the entry is already in the hash table. */
36 hash table. */
  /external/elfutils/src/
sectionhash.c 1 /* Section hash table implementation.
63 /* Definitions for the section hash table. */
  /external/icu4c/test/cintltst/
cg7coll.h 25 * Sample Rules: & Question'-'mark ; '?' & Hash'-'mark ; '#' & Ampersand ; '&'
62 /* "& Question'-'mark ; '?' & Hash'-'mark ; '#' & Ampersand ; '&'" */
  /external/openssl/crypto/rsa/
rsa_pss.c 74 const EVP_MD *Hash, const unsigned char *EM, int sLen)
84 hLen = M_EVP_MD_size(Hash);
129 PKCS1_MGF1(DB, maskedDBLen, H, hLen, Hash);
146 EVP_DigestInit_ex(&ctx, Hash, NULL);
171 const EVP_MD *Hash, int sLen)
179 hLen = M_EVP_MD_size(Hash);
226 EVP_DigestInit_ex(&ctx, Hash, NULL);
235 PKCS1_MGF1(EM, maskedDBLen, H, hLen, Hash);

Completed in 2139 milliseconds

<<11121314151617181920>>