/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/encodings/ |
OAEPEncoding.java | 20 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 of the encoding params [all...] |
/external/dropbear/libtomcrypt/src/pk/pkcs1/ |
pkcs_1_pss_encode.c | 22 @param msghash The hash to encode 23 @param msghashlen The length of the hash (octets) 27 @param hash_idx The index of the hash desired 39 unsigned char *DB, *mask, *salt, *hash; local 48 /* ensure hash and PRNG are valid */ 64 /* allocate ram for DB/mask/salt/hash of size modulus_len */ 68 hash = XMALLOC(modulus_len); 69 if (DB == NULL || mask == NULL || salt == NULL || hash == NULL) { 79 if (hash != NULL) { 80 XFREE(hash); [all...] |
pkcs_1_pss_decode.c | 22 @param msghash The hash to verify 23 @param msghashlen The length of the hash (octets) 27 @param hash_idx The index of the hash desired 37 unsigned char *DB, *mask, *salt, *hash; local 48 /* ensure hash is valid */ 62 /* allocate ram for DB/mask/salt/hash of size modulus_len */ 66 hash = XMALLOC(modulus_len); 67 if (DB == NULL || mask == NULL || salt == NULL || hash == NULL) { 77 if (hash != NULL) { 78 XFREE(hash); [all...] |
/external/dropbear/libtomcrypt/src/misc/crypt/ |
crypt_hash_is_valid.c | 15 Determine if hash is valid, Tom St Denis 19 Test if a hash index is valid 20 @param idx The index of the hash to search for
|
/external/e2fsprogs/tests/f_h_badnode/ |
expect.1 | 3 Problem in HTREE directory inode 12929: node (531) has bad max hash 5 Problem in HTREE directory inode 12929: node (1061) has bad min hash 7 Problem in HTREE directory inode 12929: node (1062) has bad max hash
|
/external/webkit/WebCore/dom/ |
StyledElement.cpp | 60 static unsigned hash(const MappedAttributeKey&); 415 // http://www.azillionmonkeys.com/qed/hash.html 416 unsigned MappedAttributeHash::hash(const MappedAttributeKey& key) function in class:MappedAttributeHash 418 uint32_t hash = WTF::stringHashingStartValue; local 424 hash += p[0]; 425 tmp = (p[1] << 11) ^ hash; 426 hash = (hash << 16) ^ tmp; 427 hash += hash >> 11 [all...] |
/external/clearsilver/util/ |
dict.c | 59 dictHashFunc hash; /* hash function */ member in struct:_dictCtx 219 static NEOERR *dictInsert(dictCtx dict, UINT32 hash, const char *id, 236 if((err = skipInsert(dict->list, hash, entry, FALSE)) == STATUS_OK) 251 entry = skipSearch(dict->list, hash, &lock); 259 UINT32 hash; local 261 hash = dict->hash(id) % DICT_HASH_BITS; 263 /* ensure hash is valid for skiplist (modify consistently if not) */ 264 if(! (hash && (hash != (UINT32)-1)) 273 UINT32 hash; local 381 UINT32 hash; local 416 UINT32 hash; local 510 UINT32 hash; local [all...] |
/external/dropbear/libtomcrypt/src/mac/hmac/ |
hmac_memory.c | 22 @param hash The index of the hash to use 31 int hmac_memory(int hash, 44 /* make sure hash descriptor is valid */ 45 if ((err = hash_is_valid(hash)) != CRYPT_OK) { 50 if (hash_descriptor[hash].hmac_block != NULL) { 51 return hash_descriptor[hash].hmac_block(key, keylen, in, inlen, out, outlen); 61 if ((err = hmac_init(hmac, hash, key, keylen)) != CRYPT_OK) {
|
/external/webkit/WebCore/manual-tests/resources/ |
hash-ref-test.html | 3 <title>Test Case for Bug 13067: Manually adding #hash to URL reloads entire page instead of jumping to #hash location in cached page</title>
|
/external/wpa_supplicant/tests/ |
test_md4.c | 24 u8 *hash; member in struct:__anon6762 65 u8 hash[16]; local 75 md4_vector(1, addr, len, hash); 76 if (memcmp(hash, tests[i].hash, 16) != 0) { 87 md4_vector(1, addr, len, hash); 88 if (memcmp(hash, tests[i].hash, 16) != 0) {
|
test_md5.c | 24 u8 *hash; member in struct:__anon6763 65 u8 hash[16]; local 75 md5_vector(1, addr, len, hash); 76 if (memcmp(hash, tests[i].hash, 16) != 0) { 87 md5_vector(1, addr, len, hash); 88 if (memcmp(hash, tests[i].hash, 16) != 0) {
|
/external/wpa_supplicant_6/wpa_supplicant/tests/ |
test_md4.c | 24 u8 *hash; member in struct:__anon6989 65 u8 hash[16]; local 75 md4_vector(1, addr, len, hash); 76 if (memcmp(hash, tests[i].hash, 16) != 0) { 87 md4_vector(1, addr, len, hash); 88 if (memcmp(hash, tests[i].hash, 16) != 0) {
|
test_md5.c | 24 u8 *hash; member in struct:__anon6990 65 u8 hash[16]; local 75 md5_vector(1, addr, len, hash); 76 if (memcmp(hash, tests[i].hash, 16) != 0) { 87 md5_vector(1, addr, len, hash); 88 if (memcmp(hash, tests[i].hash, 16) != 0) {
|
/external/icu4c/test/perf/unisetperf/draft/ |
bitset.cpp | 17 * Uses a simple hash table for compaction. 25 * Hash table for up to 1k 64-bit words, for 1 bit per BMP code point. 47 int32_t hash=(int32_t)(key>>55)&0x1ff; local 48 hash^=(int32_t)(key>>44)&0x7ff; 49 hash^=(int32_t)(key>>33)&0x7ff; 50 hash^=(int32_t)(key>>22)&0x7ff; 51 hash^=(int32_t)(key>>11)&0x7ff; 52 hash^=(int32_t)key&0x7ff; 54 if(values[hash]==0xffff) { 56 keys[hash]=key [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
ExpandedNameTable.java | 31 * 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 bucket 187 int hash = type + namespace.hashCode() + localName.hashCode(); local 379 int hash; field in class:ExpandedNameTable.HashEntry [all...] |
/external/dbus/dbus/ |
dbus-hash.c | 2 /* dbus-hash.c Generic hash table utility (internal to D-Bus implementation) 8 * Hash table implementation based on generic/tclHash.c from the Tcl 77 #include "dbus-hash.h" 82 * @defgroup DBusHashTable Hash table 90 * @defgroup DBusHashTableInternals Hash table implementation details 101 * the hash table to make it larger. 106 * Takes a preliminary integer hash value and produces an index into a 107 * hash tables bucket list. The idea is to make it so that 109 * different buckets. The hash function was taken from [all...] |
/frameworks/base/awt/java/awt/image/ |
MultiPixelPackedSampleModel.java | 328 * Returns a hash code of this MultiPixelPackedSampleModel class. 330 * @return the hash code of this MultiPixelPackedSampleModel class. 334 int hash = 0; local 337 hash = width; 338 tmp = hash >>> 24; 339 hash <<= 8; 340 hash |= tmp; 341 hash ^= height; 342 tmp = hash >>> 24; 343 hash <<= 8 [all...] |
/bootable/recovery/minzip/ |
Android.mk | 5 Hash.c \
|
/dalvik/vm/ |
Hash.h | 17 * General purpose hash table, used for finding classes, methods, etc. 25 /* compute the hash of an item with a specific type */ 29 * Compare a hash entry with a "loose" item after their hash values match. 52 * One entry in the hash table. "data" values are expected to be (or have 69 * Expandable hash table. 101 * Clear out a hash table, freeing the contents of any used entries. 106 * Free a hash table. Performs a "clear" first. 122 * Get #of entries in hash table. 129 * Get total size of hash table (for memory usage calculations) [all...] |
/external/dropbear/libtomcrypt/demos/ |
small.c | 1 /* small demo app that just includes a cipher/hash/prng */
|
/external/e2fsprogs/tests/f_h_badroot/ |
expect.1 | 7 HTREE directory inode 26689 has an unsupported hash version (240) 20 Problem in HTREE directory inode 80065: node (0) has an unordered hash table 29 Problem in HTREE directory inode 73393: node (1) has bad min hash 30 Problem in HTREE directory inode 73393: node (2) has bad max hash
|
/external/elfcopy/ |
hash.h | 17 section_info_t *hash,
|
/frameworks/base/media/libdrm/mobile2/include/dcf/ |
DrmRawContent.h | 45 * get the length of DCF hash 48 * the length of DCF hash 53 * get DCF hash 54 * \param outDcfHash the buffer to store DCF hash
|
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/ |
SHA1_Data.java | 28 * - a set of constant values, H0-H4, defined in "SECURE HASH STANDARD", FIPS PUB 180-2 ;<BR> 37 * constant defined in "SECURE HASH STANDARD" 43 * constant defined in "SECURE HASH STANDARD" 49 * constant defined in "SECURE HASH STANDARD" 55 * constant defined in "SECURE HASH STANDARD" 61 * constant defined in "SECURE HASH STANDARD" 73 * offset in buffer to store current hash value
|
/dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
CertificateVerify.java | 42 * @param hash 44 public CertificateVerify(byte[] hash) { 45 if (hash == null || hash.length == 0) { 47 "INTERNAL ERROR: incorrect certificate verify hash"); 49 this.signedHash = hash; 50 length = hash.length + 2;
|