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

1234567891011>>

/macosx-10.9.5/WebCore-7537.78.1/bindings/scripts/
H A DHasher.pm37 # http://www.azillionmonkeys.com/qed/hash.html
42 # This hash is designed to work on 16-bit chunks at a time. But since the normal case
43 # (above) is to hash UTF-16 characters, we just treat the 8-bit chars as if they
48 my $hash = 0x9e3779b9;
57 $hash += ord($chars[$s]);
58 my $tmp = leftShift(ord($chars[$s+1]), 11) ^ $hash;
59 $hash = (leftShift($hash, 16)% $EXP2_32) ^ $tmp;
61 $hash += $hash >> 1
[all...]
/macosx-10.9.5/JavaScriptCore-7537.78.1/bytecode/
H A DCodeBlockHash.h33 // to the low 32 bits of a SHA1 hash of the source code with two low bit flipped
35 // hashes are typically operated over using a string in which the hash is transformed
38 // functions, in which case the hash is replaced by the function address.
51 explicit CodeBlockHash(unsigned hash) argument
52 : m_hash(hash)
60 unsigned hash() const { return m_hash; } function in class:JSC::CodeBlockHash
65 bool operator==(const CodeBlockHash& other) const { return hash() == other.hash(); }
66 bool operator!=(const CodeBlockHash& other) const { return hash() != other.hash(); }
[all...]
/macosx-10.9.5/ICU-511.35/icuSources/test/cintltst/
H A Dchashtst.c30 static void _put(UHashtable* hash,
35 static void _get(UHashtable* hash,
39 static void _remove(UHashtable* hash,
104 UHashtable *hash; local
106 hash = uhash_open(hashChars, isEqualChars, NULL, &status);
109 u_errorName(status), hash);
112 if (hash == NULL) {
116 log_verbose("Ok: uhash_open returned 0x%08X\n", hash);
118 _put(hash, one, 1, 0);
119 _put(hash, omeg
154 UHashtable *hash; local
288 UHashtable *hash; local
336 _put(UHashtable* hash, const char* key, int32_t value, int32_t expectedOldValue) argument
355 _get(UHashtable* hash, const char* key, int32_t expectedValue) argument
372 _remove(UHashtable* hash, const char* key, int32_t expectedValue) argument
[all...]
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.69/examples/COM/
H A Dhashecho.vbs6 ' values can be stored in hash using "hash" method
7 Set subhash = soaplite.hash("key_c", "Value C")
8 Set hash = soaplite.hash("key_a", "Value A", "key_b", subhash)
10 hash.key_b.key_d = "Value D"
15 ).echo(hash).result
H A Dhash.vbs8 ).getStateStruct(CreateObject("SOAP.Lite").hash("a", 1, "b", 2)) _
/macosx-10.9.5/CPANInternal-140/SOAP-Lite-0.715/examples/COM/
H A Dhashecho.vbs6 ' values can be stored in hash using "hash" method
7 Set subhash = soaplite.hash("key_c", "Value C")
8 Set hash = soaplite.hash("key_a", "Value A", "key_b", subhash)
10 hash.key_b.key_d = "Value D"
15 ).echo(hash).result
/macosx-10.9.5/CPANInternal-140/SOAP-Lite_new/examples/COM/
H A Dhashecho.vbs6 ' values can be stored in hash using "hash" method
7 Set subhash = soaplite.hash("key_c", "Value C")
8 Set hash = soaplite.hash("key_a", "Value A", "key_b", subhash)
10 hash.key_b.key_d = "Value D"
15 ).echo(hash).result
/macosx-10.9.5/libxml2-26/libxml2/python/tests/
H A DcompareNodes.py9 # Testing XML Node comparison and Node hash-value
30 # Next check that the hash function for the objects also works ok
31 if not (hash(foonode1) == hash(foonode2)):
32 print("Error hash values for two equal nodes are different")
34 if not (hash(foonode1) != hash(root)):
35 print("Error hash values for two unequal nodes are not different")
37 if hash(foonode1) == hash(roo
[all...]
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/python/tests/
H A DcompareNodes.py9 # Testing XML Node comparison and Node hash-value
30 # Next check that the hash function for the objects also works ok
31 if not (hash(foonode1) == hash(foonode2)):
32 print "Error hash values for two equal nodes are different"
34 if not (hash(foonode1) != hash(root)):
35 print "Error hash values for two unequal nodes are not different"
37 if hash(foonode1) == hash(roo
[all...]
/macosx-10.9.5/Security-55471.14.18/include/security_cryptkit/
H A DfeeHash.c11 * FeeHash.c - generic, portable MD5 hash object
42 * Alloc and init an empty hash object.
54 void feeHashReinit(feeHash hash) argument
56 hashInst *hinst = (hashInst *) hash;
63 * Free a hash object.
65 void feeHashFree(feeHash hash) argument
67 hashInst *hinst = (hashInst *) hash;
74 * Add some data to the hash object.
76 void feeHashAddData(feeHash hash, argument
80 hashInst *hinst = (hashInst *) hash;
94 feeHashDigest(feeHash hash) argument
[all...]
H A DfeeHash.h11 * FeeHash.h - generic, portable MD5 hash object
37 * Opaque hash object handle.
42 * Alloc and init an empty hash object.
47 * reinitialize a hash object for reuse.
49 void feeHashReinit(feeHash hash);
52 * Free a hash object.
54 void feeHashFree(feeHash hash);
57 * Add some data to the hash object.
59 void feeHashAddData(feeHash hash,
68 unsigned char *feeHashDigest(feeHash hash);
[all...]
/macosx-10.9.5/Security-55471.14.18/libsecurity_cryptkit/lib/
H A DfeeHash.c11 * FeeHash.c - generic, portable MD5 hash object
42 * Alloc and init an empty hash object.
54 void feeHashReinit(feeHash hash) argument
56 hashInst *hinst = (hashInst *) hash;
63 * Free a hash object.
65 void feeHashFree(feeHash hash) argument
67 hashInst *hinst = (hashInst *) hash;
74 * Add some data to the hash object.
76 void feeHashAddData(feeHash hash, argument
80 hashInst *hinst = (hashInst *) hash;
94 feeHashDigest(feeHash hash) argument
[all...]
H A DfeeHash.h11 * FeeHash.h - generic, portable MD5 hash object
37 * Opaque hash object handle.
42 * Alloc and init an empty hash object.
47 * reinitialize a hash object for reuse.
49 void feeHashReinit(feeHash hash);
52 * Free a hash object.
54 void feeHashFree(feeHash hash);
57 * Add some data to the hash object.
59 void feeHashAddData(feeHash hash,
68 unsigned char *feeHashDigest(feeHash hash);
[all...]
/macosx-10.9.5/dtrace-118.1/tools/ctfconvert/
H A Dhash.c27 #pragma ident "@(#)hash.c 1.5 05/06/08 SMI"
30 * Routines for manipulating hash tables
40 #include "hash.h"
52 #include "hash.h"
58 struct hash { struct
109 hash_t *hash; local
111 hash = xmalloc(sizeof (hash_t));
112 hash->h_buckets = xcalloc(sizeof (list_t *) * nbuckets);
113 hash->h_nbuckets = nbuckets;
114 hash
121 hash_add(hash_t *hash, void *key) argument
142 hash_remove_cb(void *key1, void *key2, hash_t *hash) argument
148 hash_remove(hash_t *hash, void *key) argument
157 hash_match(hash_t *hash, void *key, int (*fun)(void *, void *), void *private) argument
181 hash_find_iter(hash_t *hash, void *key, int (*fun)(void *, void *), void *private) argument
209 hash_find(hash_t *hash, void *key, void **value) argument
226 hash_iter(hash_t *hash, int (*fun)(void *, void *), void *private) argument
245 hash_count(hash_t *hash) argument
256 hash_free(hash_t *hash, void (*datafree)(void *, void *), void *private) argument
270 hash_stats(hash_t *hash, int verbose) argument
[all...]
/macosx-10.9.5/BerkeleyDB-21/db/java/src/com/sleepycat/db/
H A DHasher.java11 An application-specified, database hash function.
15 An application-specified, database-specific hash function.
17 The hash function must handle any key values used by the application
27 The hash value of the byte string.
29 int hash(Database db, byte[] data, int len); method in interface:Hasher
/macosx-10.9.5/bind9-45.100/bind9/contrib/idn/idnkit-1.0-src/include/idn/
H A Dstrhash.h52 * String-keyed hash table
54 * Just a hash table. Nothing special. Number of hash buckets
71 * Create a hash table.
81 * Delete a hash table created by 'idn__strhash_create'.
83 * hash to release memory for them.
86 idn__strhash_destroy(idn__strhash_t hash, idn__strhash_freeproc_t proc);
89 * Register an item to the hash table. This function makes a
97 idn__strhash_put(idn__strhash_t hash, const char *key, void *value);
107 idn__strhash_get(idn__strhash_t hash, cons
[all...]
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/ext/
H A Dhash_fun.h1 // 'struct hash' from SGI -*- C++ -*-
71 struct hash { }; struct
83 struct hash<char*> struct
91 struct hash<const char*> struct
99 struct hash<char> struct
107 struct hash<unsigned char> struct
115 struct hash<signed char> struct
123 struct hash<short> struct
131 struct hash<unsigned short> struct
139 struct hash<in struct
147 struct hash<unsigned int> struct
155 struct hash<long> struct
163 struct hash<unsigned long> struct
[all...]
/macosx-10.9.5/bind9-45.100/bind9/contrib/idn/idnkit-1.0-src/lib/
H A Dstrhash.c59 * Initially, the number of hash buckets is INITIAL_HASH_SIZE.
60 * As the more elements are put in the hash, the number of elements
85 unsigned long hash);
87 static idn_result_t expand_bins(idn__strhash_t hash, int new_size);
91 idn__strhash_t hash; local
100 if ((hash = malloc(sizeof(struct idn__strhash))) == NULL) {
101 WARNING(("idn__strhash_create: malloc failed (hash)\n"));
104 hash->nbins = 0;
105 hash->nelements = 0;
106 hash
119 idn__strhash_destroy(idn__strhash_t hash, idn__strhash_freeproc_t proc) argument
141 idn__strhash_put(idn__strhash_t hash, const char *key, void *value) argument
177 idn__strhash_get(idn__strhash_t hash, const char *key, void **valuep) argument
193 idn__strhash_exists(idn__strhash_t hash, const char *key) argument
215 find_entry(strhash_entry_t *entry, const char *key, unsigned long hash) argument
247 expand_bins(idn__strhash_t hash, int new_size) argument
[all...]
/macosx-10.9.5/apache-786.1/httpd/srclib/apr-util/crypto/
H A Dapr_passwd.c77 const char *hash)
83 if (hash[0] == '$'
84 && hash[1] == '2'
85 && (hash[2] == 'a' || hash[2] == 'y')
86 && hash[3] == '$') {
87 if (_crypt_blowfish_rn(passwd, hash, sample, sizeof(sample)) == NULL)
90 else if (!strncmp(hash, apr1_id, strlen(apr1_id))) {
92 * The hash was created using our custom algorithm.
94 apr_md5_encode(passwd, hash, sampl
[all...]
/macosx-10.9.5/ICU-511.35/icuSources/common/
H A Duhash.c20 /* This hashtable is implemented as a double hash. All elements are
22 * resolution (no linked list, etc.). When there is a hash collision
24 * using a secondary hash. The secondary hash is an increment
25 * computed as a hash function (a different one) of the primary
26 * hashcode. This increment is added to the initial hash value to
27 * obtain further slots assigned to the same hash code. For this to
120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \
121 if (hash->keyDeleter != NULL && keypointer != NULL) { \
122 (*hash
141 _uhash_setElement(UHashtable *hash, UHashElement* e, int32_t hashcode, UHashTok key, UHashTok value, int8_t hint) argument
181 _uhash_internalRemoveElement(UHashtable *hash, UHashElement* e) argument
190 _uhash_internalSetResizePolicy(UHashtable *hash, enum UHashResizePolicy policy) argument
208 _uhash_allocate(UHashtable *hash, int32_t primeIndex, UErrorCode *status) argument
331 _uhash_find(const UHashtable *hash, UHashTok key, int32_t hashcode) argument
393 _uhash_rehash(UHashtable *hash, UErrorCode *status) argument
436 _uhash_remove(UHashtable *hash, UHashTok key) argument
461 _uhash_put(UHashtable *hash, UHashTok key, UHashTok value, int8_t hint, UErrorCode *status) argument
572 uhash_close(UHashtable *hash) argument
593 uhash_setKeyHasher(UHashtable *hash, UHashFunction *fn) argument
600 uhash_setKeyComparator(UHashtable *hash, UKeyComparator *fn) argument
606 uhash_setValueComparator(UHashtable *hash, UValueComparator *fn) argument
613 uhash_setKeyDeleter(UHashtable *hash, UObjectDeleter *fn) argument
620 uhash_setValueDeleter(UHashtable *hash, UObjectDeleter *fn) argument
627 uhash_setResizePolicy(UHashtable *hash, enum UHashResizePolicy policy) argument
636 uhash_count(const UHashtable *hash) argument
641 uhash_get(const UHashtable *hash, const void* key) argument
649 uhash_iget(const UHashtable *hash, int32_t key) argument
657 uhash_geti(const UHashtable *hash, const void* key) argument
665 uhash_igeti(const UHashtable *hash, int32_t key) argument
673 uhash_put(UHashtable *hash, void* key, void* value, UErrorCode *status) argument
686 uhash_iput(UHashtable *hash, int32_t key, void* value, UErrorCode *status) argument
699 uhash_puti(UHashtable *hash, void* key, int32_t value, UErrorCode *status) argument
713 uhash_iputi(UHashtable *hash, int32_t key, int32_t value, UErrorCode *status) argument
726 uhash_remove(UHashtable *hash, const void* key) argument
734 uhash_iremove(UHashtable *hash, int32_t key) argument
742 uhash_removei(UHashtable *hash, const void* key) argument
750 uhash_iremovei(UHashtable *hash, int32_t key) argument
758 uhash_removeAll(UHashtable *hash) argument
771 uhash_find(const UHashtable *hash, const void* key) argument
780 uhash_nextElement(const UHashtable *hash, int32_t *pos) argument
798 uhash_removeElement(UHashtable *hash, const UHashElement* e) argument
[all...]
H A Dhash.h29 UHashtable* hash; member in class:Hashtable
111 hash = &hashObj;
112 uhash_setKeyDeleter(hash, uprv_deleteUObject);
117 UErrorCode& status) : hash(0) {
121 : hash(0)
132 : hash(0)
138 : hash(0)
145 if (hash != NULL) {
146 uhash_close(hash);
151 return uhash_setValueDeleter(hash, f
[all...]
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/backward/
H A Dhashtable.h69 using __gnu_cxx::hash;
/macosx-10.9.5/BerkeleyDB-21/db/mod_db4/
H A Dmm_hash.c51 unsigned int hash = 0; local
54 hash = hash * 65599 + *key++;
56 return hash;
62 unsigned int hash = hash_hash((const char *)key, length) % MM_HASH_SIZE; local
64 for (b = table->buckets[ hash ]; b; b = b->next) {
65 if (hash != b->hash) continue;
78 unsigned int hash; local
80 hash
107 unsigned int hash; local
[all...]
/macosx-10.9.5/CPANInternal-140/Unix-Getrusage/
H A DGetrusage.xs16 #define STORE_FIELD(format,data) string_store(hash, #data, format, res.data);
17 #define STORE_TIMEVAL(x) string_store(hash, #x, "%.6f", timeval_to_double(&res.x));
20 static void string_store(HV* hash, const char *key, const char *fmt, ...) {
25 assert(hash != NULL);
33 hv_store(hash, key, strlen(key), newSVpv(buffer, len), 0);
42 static void fetch_getrusage(HV *hash, int who) {
45 assert(hash != NULL);
74 HV *hash;
76 hash = newHV();
77 fetch_getrusage(hash, RUSAGE_SEL
[all...]
/macosx-10.9.5/CPANInternal-140/Unix-Getrusage-0.03/
H A DGetrusage.xs16 #define STORE_FIELD(format,data) string_store(hash, #data, format, res.data);
17 #define STORE_TIMEVAL(x) string_store(hash, #x, "%.6f", timeval_to_double(&res.x));
20 static void string_store(HV* hash, const char *key, const char *fmt, ...) {
25 assert(hash != NULL);
33 hv_store(hash, key, strlen(key), newSVpv(buffer, len), 0);
42 static void fetch_getrusage(HV *hash, int who) {
45 assert(hash != NULL);
74 HV *hash;
76 hash = newHV();
77 fetch_getrusage(hash, RUSAGE_SEL
[all...]

Completed in 505 milliseconds

1234567891011>>