| /external/e2fsprogs/intl/ |
| loadmsgcat.c | 89 #include "hash-string.h"
1066 /* This is invalid. These minor revisions need a hash table. */
1119 system dependent strings and the augmented hash table.
[all...] |
| /external/elfutils/src/ |
| ld.h | 656 scn_dot_hash, /* Generated .hash section. */
700 /* Define hash table for sections. */
703 /* Define hash table for version symbols. */
903 /* Dynamic symbol hash table. */
930 /* Hash table for version symbol strings. Only strings without
|
| /external/openssl/apps/ |
| x509.c | 101 " -subject_hash - print subject hash value\n",
102 " -issuer_hash - print issuer hash value\n",
103 " -hash - synonym for -subject_hash\n",
116 " -ocspid - print OCSP hash values for the subject name and public key\n",
397 else if (strcmp(*argv,"-hash") == 0
[all...] |
| /external/webkit/WebKitTools/Scripts/ |
| VCSUtils.pm | 401 # $headerHashRef: a hash reference representing a diff header
555 # @diffHashRefs: an array of diff hash references. See parseDiff() for
732 # Merges hash references. It's okay here if passed hash reference is undefined.
781 # $args: a reference to a hash of optional arguments. The possible
|
| /external/webkit/JavaScriptCore/ |
| ChangeLog-2002-12-03 | 70 (PropertyMap::save): Look at the attributes the same way in the single hash entry
71 case as in the actual hash table case. Change the rule for which attributes to save
604 - another step towards atomic identifiers; storing hash in the string rep. gives about
607 * kjs/ustring.h: Add a hash field to UString::Rep.
609 (UString::Rep::create): Set hash to uninitialized value.
612 (UString::append): Set hash to 0 when modifying the string in place.
615 * kjs/property_map.cpp: Use the hash from UString.
692 - fix hash function and key comparison for the other kind of hash table; yields 3%
700 - another hash table fix; yields a 2% improvement on iBench JavaScrip
[all...] |
| /external/expat/lib/ |
| xmlparse.c | 103 /* Basic character hash algorithm, taken from Python's string hash:
116 to the hash table size, which is a power of 2. We use double-hashing,
117 since we can calculate a second hash value cheaply by taking those bits
118 of the first hash value that were discarded (masked out) when the table
119 index was calculated: index = hash & mask, where mask = table->size - 1.
123 #define SECOND_HASH(hash, mask, power) \
124 ((((hash) & ~(mask)) >> ((power) - 1)) & ((mask) >> 2))
125 #define PROBE_STEP(hash, mask, power) \
126 ((unsigned char)((SECOND_HASH(hash, mask, power)) | 1)
247 unsigned long hash; member in struct:__anon1888
5846 hash(KEY s) function
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/arm-eabi/bin/ |
| ld | |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/bin/ |
| arm-eabi-ld | |
| /external/icu4c/common/ |
| ucnv_bld.c | 215 /* if the hash table still exists. The mutex */
392 * the shared data hash table should be. When on small platforms, or just a couple
396 * Larger numbers reduce the number of hash collisions, but use more memory.
448 /* cnvCacheMutex must be held by the caller to protect the hash table. */
[all...] |
| /external/v8/src/ia32/ |
| codegen-ia32.cc | 10608 Register hash = scratch1; local
[all...] |
| /external/dbus/dbus/ |
| dbus-connection.c | 34 #include "dbus-hash.h"
262 DBusHashTable *pending_replies; /**< Hash of message serials to #DBusPendingCall. */
[all...] |
| /build/tools/apriori/ |
| apriori.c | 18 #include <hash.h>
503 source->hash.scn = scn;
504 source->hash.data = elf_getdata(scn, NULL);
505 FAILIF_LIBELF(NULL == source->hash.data, elf_getdata);
506 memcpy(&source->hash.shdr, shdr, sizeof(GElf_Shdr));
507 source->hash.info = lookup_shdr_info_by_new_section(
509 ASSERT(source->shdr_info == NULL || source->hash.info != NULL);
558 FAILIF(source->hash.scn == NULL,
559 "File [%s] does not have a hash table!\n",
561 FAILIF(source->hash.shdr.sh_link != elf_ndxscn(source->symtab.scn)
[all...] |
| /external/elfcopy/ |
| elfcopy.c | 5 #include <hash.h>
138 also need to rebuild the hash table (the hash is outdated).
[all...] |
| /cts/tools/dasm/src/java_cup/ |
| lalr_item.java | 287 /** Return a hash code -- here we only hash the core since we only test core
|
| /dalvik/libcore/archive/src/main/java/java/util/zip/ |
| ZipEntry.java | 331 * Returns the hash code for this {@code ZipEntry}.
333 * @return the hash code of the entry.
|
| /dalvik/libcore/icu/src/main/java/com/ibm/icu4jni/text/ |
| Collator.java | 391 * Returns a hash of this collation object
392 * @return hash of this collation object
|
| /dalvik/libcore/icu/src/main/native/ |
| NativeCollation.cpp | 293 * Returns a hash of this collation object
298 * @return hash of this collation object
|
| /dalvik/libcore/luni/src/main/java/java/util/ |
| AbstractMap.java | 188 * Returns the hash code for this object. Objects which are equal must
191 * @return the hash code of this object.
|
| Collection.java | 174 * Returns an integer hash code for the receiver. Objects which are equal
177 * @return the receiver's hash.
|
| List.java | 167 * Returns the hash code for this {@code List}. It is calculated by taking each
170 * @return the hash code of the {@code List}.
|
| /dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/lang/ |
| ObjectTest.java | 200 assertTrue("Same object should have same hash.",
202 assertTrue("Same object should have same hash.",
|
| /dalvik/libcore/luni/src/test/java/tests/api/java/net/ |
| NetworkInterfaceTest.java | 509 "validate that hash codes are the same for two calls on the same object",
513 "validate that hash codes are the same for two objects for which equals is true",
|
| /dalvik/libcore/security/src/test/java/tests/security/cert/ |
| CertificateTest.java | 102 * Assertion: returns hash of the <code>Certificate</code> instance
126 * Assertion: hash code of equal objects should be the same
|
| /dalvik/libcore/text/src/main/java/java/text/ |
| ChoiceFormat.java | 287 * Returns an integer hash code for the receiver. Objects which are equal
290 * @return the receiver's hash.
|
| Collator.java | 357 * Returns an integer hash code for this collator.
359 * @return this collator's hash code.
|
