HomeSort by: relevance | last modified time | path
    Searched defs:hashTable (Results 1 - 15 of 15) sorted by relevancy

  /src/external/bsd/zstd/dist/contrib/externalSequenceProducer/
sequence_producer.c 32 U32 hashTable[HSIZE];
42 hashTable[i] = BADIDX;
47 U32 const matchIndex = hashTable[hash];
48 hashTable[hash] = (U32)(ip - istart);
  /src/external/bsd/zstd/dist/tests/
external_matchfinder.c 33 U32 hashTable[HSIZE];
43 hashTable[i] = BADIDX;
48 U32 const matchIndex = hashTable[hash];
49 hashTable[hash] = (U32)(ip - istart);
  /src/external/bsd/tre/dist/lib/
xmalloc.c 42 } hashTable;
54 static hashTable *
57 hashTable *tbl;
94 hash_table_add(hashTable *tbl, void *ptr, int bytes,
129 hash_table_del(hashTable *tbl, void *ptr)
169 static hashTable *xmalloc_table = NULL;
  /src/external/gpl3/binutils/dist/gprofng/src/
DefaultMap.h 58 Entry **hashTable;
74 hashTable = new Entry*[HTABLE_SIZE];
76 hashTable[i] = NULL;
86 delete[] hashTable;
96 hashTable[i] = NULL;
113 Entry *entry = hashTable[idx];
153 hashTable[idx] = entry;
162 Entry *entry = hashTable[idx];
179 hashTable[idx] = entry;
StringMap.h 67 Entry **hashTable;
79 hashTable = new Entry*[HTABLE_SIZE];
81 hashTable[i] = NULL;
96 delete[] hashTable;
111 hashTable[i] = NULL;
119 Entry *entry = hashTable[idx];
160 hashTable[idx] = entry;
169 Entry *entry = hashTable[idx];
185 hashTable[idx] = entry;
HashMap.h 143 delete[] hashTable;
221 Hash_t **hashTable;
239 hashTable = new Hash_t*[hash_sz];
241 hashTable[i] = NULL;
254 for (Hash_t *p = hashTable[i]; p; p = next)
260 hashTable[i] = NULL;
270 Hash_t **old_hash_table = hashTable;
271 hashTable = new Hash_t*[hash_sz];
273 hashTable[i] = NULL;
298 for (Hash_t *p = hashTable[hash_code]; p; p = p->next
    [all...]
  /src/external/gpl3/binutils.old/dist/gprofng/src/
DefaultMap.h 58 Entry **hashTable;
74 hashTable = new Entry*[HTABLE_SIZE];
76 hashTable[i] = NULL;
86 delete[] hashTable;
96 hashTable[i] = NULL;
113 Entry *entry = hashTable[idx];
153 hashTable[idx] = entry;
162 Entry *entry = hashTable[idx];
179 hashTable[idx] = entry;
StringMap.h 67 Entry **hashTable;
79 hashTable = new Entry*[HTABLE_SIZE];
81 hashTable[i] = NULL;
96 delete[] hashTable;
111 hashTable[i] = NULL;
119 Entry *entry = hashTable[idx];
160 hashTable[idx] = entry;
169 Entry *entry = hashTable[idx];
185 hashTable[idx] = entry;
HashMap.h 143 delete[] hashTable;
221 Hash_t **hashTable;
239 hashTable = new Hash_t*[hash_sz];
241 hashTable[i] = NULL;
254 for (Hash_t *p = hashTable[i]; p; p = next)
260 hashTable[i] = NULL;
270 Hash_t **old_hash_table = hashTable;
271 hashTable = new Hash_t*[hash_sz];
273 hashTable[i] = NULL;
298 for (Hash_t *p = hashTable[hash_code]; p; p = p->next
    [all...]
  /src/external/bsd/zstd/dist/lib/compress/
zstd_fast.c 21 U32* const hashTable = ms->hashTable;
39 ZSTD_writeTaggedIndex(hashTable, hashAndTag, curr); }
46 if (hashTable[hashAndTag >> ZSTD_SHORT_CACHE_TAG_BITS] == 0) { /* not yet filled */
47 ZSTD_writeTaggedIndex(hashTable, hashAndTag, curr + p);
58 U32* const hashTable = ms->hashTable;
76 hashTable[hash0] = curr;
82 if (hashTable[hash] == 0) { /* not yet filled */
83 hashTable[hash] = curr + p
    [all...]
zstd_opt.c 449 U32* const hashTable = ms->hashTable;
455 U32 matchIndex = hashTable[h];
486 hashTable[h] = curr; /* Update Hash Table */
607 U32* const hashTable = ms->hashTable;
609 U32 matchIndex = hashTable[h];
722 hashTable[h] = curr; /* Update Hash Table */
779 U32 dictMatchIndex = dms->hashTable[dmsH];
zstd_lazy.c 34 U32* const hashTable = ms->hashTable;
54 U32 const matchIndex = hashTable[h];
60 hashTable[h] = idx; /* Update Hash Table */
175 const U32 * const dictHashTable = dms->hashTable;
250 U32* const hashTable = ms->hashTable;
253 U32 matchIndex = hashTable[h];
321 matchIndex = hashTable[h];
322 hashTable[h] = curr; /* Update Hash Table *
    [all...]
zstd_compress_internal.h 229 U32 rowHashLog; /* For row-based matchfinder: Hashlog based on nb of rows in the hashTable.*/
235 U32* hashTable;
284 ldmEntry_t* hashTable;
293 U32 hashLog; /* Log size of hashTable */
1355 * 2. Load index from hashTable[hash]
1362 * 2. Load (index, matchTag) from hashTable[hash]. See ZSTD_writeTaggedIndex to understand how this works.
1372 * Unpacks hashAndTag into (hash, tag), then packs (index, tag) into hashTable[hash]. */
1373 MEM_STATIC void ZSTD_writeTaggedIndex(U32* const hashTable, size_t hashAndTag, U32 index) {
1377 hashTable[hash] = (index << ZSTD_SHORT_CACHE_TAG_BITS) | tag;
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
lz4.c 360 HTYPE hashTable[HASHTABLESIZE];
470 HTYPE *HashTable = (HTYPE *) (srt->hashTable);
472 HTYPE HashTable[HASHTABLESIZE] = { 0 };
495 HashTable[LZ4_HASH_VALUE(ip)] = ip - base;
518 ref = base + HashTable[h];
519 HashTable[h] = ip - base;
609 HashTable[LZ4_HASH_VALUE(ip - 2)] = ip - 2 - base;
612 ref = base + HashTable[LZ4_HASH_VALUE(ip)];
613 HashTable[LZ4_HASH_VALUE(ip)] = ip - base
    [all...]
  /src/external/bsd/zstd/dist/lib/legacy/
zstd_v01.c 1396 __m256i hashTable[HASH_TABLESIZE>>3];
1398 U32 hashTable[HASH_TABLESIZE];

Completed in 43 milliseconds