| /external/kernel-headers/original/linux/ |
| mmzone.h | 216 * wait_table -- the array holding the hash table
217 * wait_table_hash_nr_entries -- the size of the hash table array
225 * per-page waitqueues, we use a waitqueue hash table.
|
| /external/libxml2/ |
| catalog.c | 36 #include <libxml/hash.h>
154 * SGML Catalogs are stored as a simple hash table of catalog entries
184 * Hash table containing all the trees of XML catalogs parsed by
327 * Entries stored in the file hash must be deallocated
328 * only by the file hash cleaner !
376 * catalog file hash.
[all...] |
| /packages/apps/Email/src/com/android/email/ |
| Utility.java | 561 final int hash = getSmallHashFromSha1(sha.digest()); local
562 return Integer.toString(hash);
566 * @return a non-negative integer generated from 20 byte SHA-1 hash.
|
| /system/core/sh/ |
| TOUR | 239 the command in the hash table if it is not already there. The
243 fore any forking is done, so to get the commands into the hash
261 VAR.C: Variables are stored in a hash table. Probably we should
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.2.1/arm-eabi/bin/ |
| ld | |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.2.1/bin/ |
| arm-eabi-ld | |
| /bionic/libc/regex/ |
| regcomp.c | 1061 cs->hash = 0;
1097 * of time (although the hash code minimizes the overhead), but can win
1098 * big if REG_ICASE is being used. REG_ICASE, by the way, is why the hash
1105 uch h = cs->hash;
1113 if (cs2->hash == h && cs2 != cs) {
[all...] |
| /external/sqlite/dist/ |
| sqlite3.c | 628 ** hash of the entire source tree.
13289 u32 size, hash; local
13323 u32 size, hash; local
13501 int hash = nBlock % N_HASH; local
17776 Hash hash; \/* A set is just a hash table *\/ member in struct:Set
31978 u32 hash = 0; local
[all...] |
| sqlite3.c.orig | 628 ** hash of the entire source tree.
[all...] |
| /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/bin/ |
| i686-unknown-linux-gnu-ld | |
| /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/i686-unknown-linux-gnu/bin/ |
| ld | |
| /external/bluetooth/glib/ |
| ChangeLog.pre-2-10 | 904 g_hash_table_new_full(): create hash tables with a ref count of 1.
906 g_hash_table_unref(): atomically ref_count-=1, destroys hash table
[all...] |
| /external/libpcap/ |
| optimize.c | 581 u_int hash; local
585 hash = (u_int)code ^ (v0 << 4) ^ (v1 << 8);
586 hash %= MODULUS;
588 for (p = hashtbl[hash]; p; p = p->next)
603 p->next = hashtbl[hash];
604 hashtbl[hash] = p;
[all...] |
| /external/webkit/JavaScriptCore/ |
| ChangeLog-2003-10-25 | 472 * kjs/property_map.h: Add index field to hash table entry and index parameter to insert function.
667 * kjs/property_map.h: Remove the hash function.
669 Moved from linear probing to double hashing, using the hash modulo
672 * kjs/ustring.h: Use unsigned instead of int for hash function result.
797 There were a couple of problems with the identifier hash table that
804 (UString::Rep::computeHash): Use a better hash function that
[all...] |
| /external/webkit/WebCore/bindings/scripts/ |
| CodeGeneratorObjC.pm | 111 "hash" => "NSObject",
717 if ($attributeName eq "id" or $attributeName eq "hash") {
718 # Special case attributes id and hash to be idName and hashName to avoid ObjC naming conflict.
[all...] |
| /frameworks/base/core/java/android/server/ |
| BluetoothService.java | 146 int hash = 1; local
147 hash = hash * 31 + (address == null ? 0 : address.hashCode());
148 hash = hash * 31 + (uuid == null ? 0 : uuid.hashCode());
149 return hash;
[all...] |
| /cts/tools/dasm/src/java_cup/ |
| lalr_state.java | 98 /** Hash table to find states by their kernels (i.e, the original,
720 /** Produce a hash code. */
723 /* just use the item set hash code */
|
| /dalvik/libcore/luni/src/test/java/tests/api/java/util/ |
| LinkedHashMapTest.java | 182 assertNull("Failed with missing key matching null hash", m
432 assertNull("Failed with same hash as null",
604 assertTrue("Failed with missing key matching null hash", !m
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/ |
| JDKPKCS12KeyStore.java | 131 int hash = id[0] & 0xff; local
135 hash ^= ((id[i] & 0xff) << 24) | ((id[i + 1] & 0xff) << 16)
139 return hash;
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xpath/objects/ |
| XStringForFSB.java | 46 /** cached hash code */
554 * (The hash value of the empty string is zero.)
556 * @return a hash code value for this object.
|
| /external/bison/ |
| Makefile | 52 $(top_srcdir)/m4/hash.m4 $(top_srcdir)/m4/iconv.m4 \
156 LIBOBJS = dirname$U.o exitfail$U.o hard-locale$U.o hash$U.o quote$U.o quotearg$U.o fopen-safer$U.o dup-safer$U.o fd-safer$U.o pipe-safer$U.o xmalloc$U.o
160 LTLIBOBJS = dirname$U.lo exitfail$U.lo hard-locale$U.lo hash$U.lo quote$U.lo quotearg$U.lo fopen-safer$U.lo dup-safer$U.lo fd-safer$U.lo pipe-safer$U.lo xmalloc$U.lo
|
| /external/bison/doc/ |
| Makefile | 50 $(top_srcdir)/m4/hash.m4 $(top_srcdir)/m4/iconv.m4 \
141 LIBOBJS = dirname$U.o exitfail$U.o hard-locale$U.o hash$U.o quote$U.o quotearg$U.o fopen-safer$U.o dup-safer$U.o fd-safer$U.o pipe-safer$U.o xmalloc$U.o
145 LTLIBOBJS = dirname$U.lo exitfail$U.lo hard-locale$U.lo hash$U.lo quote$U.lo quotearg$U.lo fopen-safer$U.lo dup-safer$U.lo fd-safer$U.lo pipe-safer$U.lo xmalloc$U.lo
|
| /external/bison/src/ |
| Makefile | 52 $(top_srcdir)/m4/hash.m4 $(top_srcdir)/m4/iconv.m4 \
158 LIBOBJS = dirname$U.o exitfail$U.o hard-locale$U.o hash$U.o quote$U.o quotearg$U.o fopen-safer$U.o dup-safer$U.o fd-safer$U.o pipe-safer$U.o xmalloc$U.o
162 LTLIBOBJS = dirname$U.lo exitfail$U.lo hard-locale$U.lo hash$U.lo quote$U.lo quotearg$U.lo fopen-safer$U.lo dup-safer$U.lo fd-safer$U.lo pipe-safer$U.lo xmalloc$U.lo
|
| /external/guava/javadoc/com/google/common/collect/ |
| MapDifference.html | 198 Returns the hash code for this instance.</TD>
308 <DD>Returns the hash code for this instance. This is defined as the hash code
|
| /external/guava/javadoc/com/google/common/primitives/ |
| Bytes.html | 172 Returns a hash code for <code>value</code>; equal to the result of invoking
241 <DD>Returns a hash code for <code>value</code>; equal to the result of invoking
246 <DT><B>Returns:</B><DD>a hash code for the value</DL>
|
