Searched refs:rehash (Results 1 - 24 of 24) sorted by relevance

/xsrc/external/mit/libX11/dist/src/
H A DQuarks.c99 #define REHASH(idx,rehash) ((idx + rehash) & quarkMask)
181 register int oldidx, newidx, rehash; local in function:ExpandQuarkTable
225 rehash = REHASHVAL(sig);
227 newidx = REHASH(newidx, rehash);
245 register int idx, rehash; local in function:_XrmInternalStringToQuark
249 rehash = 0;
266 nomatch: if (!rehash)
267 rehash = REHASHVAL(sig);
268 idx = REHASH(idx, rehash);
[all...]
H A DIntAtom.c37 #define REHASH(idx,rehash) ((idx + rehash) & (TABLESIZE-1))
71 int n, firstidx, rehash = 0; local in function:_XInternAtom
95 rehash = REHASHVAL(sig);
96 idx = REHASH(idx, rehash);
127 int firstidx, rehash; local in function:_XUpdateAtomCache
144 rehash = REHASHVAL(sig);
146 idx = REHASH(idx, rehash);
/xsrc/external/mit/libXfont/dist/src/util/
H A Datom.c50 static int rehash; variable in typeref:typename:int
114 rehash = newRehash;
174 r = (hash % rehash) | 1;
210 r = (hash % rehash) | 1;
/xsrc/external/mit/libXfont2/dist/src/stubs/
H A Datom.c51 static unsigned rehash; variable in typeref:typename:unsigned
110 rehash = newRehash;
161 r = (hash % rehash) | 1;
197 r = (hash % rehash) | 1;
/xsrc/external/mit/bdftopcf/dist/
H A Datom.c49 static unsigned rehash; variable in typeref:typename:unsigned
105 rehash = newRehash;
156 r = (hash % rehash) | 1;
188 r = (hash % rehash) | 1;
/xsrc/external/mit/MesaLib.old/dist/src/util/
H A Dset.c45 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
54 uint32_t max_entries, size, rehash; member in struct:__anonb5213f730108
121 ht->rehash = hash_sizes[ht->size_index].rehash;
225 double_hash = 1 + hash % ht->rehash;
271 ht->rehash = hash_sizes[ht->size_index].rehash;
286 * Note that insertion may rearrange the table on a resize or rehash,
331 double_hash = 1 + hash % ht->rehash;
H A Dset.h49 uint32_t rehash; member in struct:set
99 * insertion (which may rehash the set, making entry a dangling
H A Dhash_table.c55 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
60 uint32_t max_entries, size, rehash; member in struct:__anon250118320108
122 ht->rehash = hash_sizes[ht->size_index].rehash;
261 double_hash = 1 + hash % ht->rehash;
313 ht->rehash = hash_sizes[ht->size_index].rehash;
374 double_hash = 1 + hash % ht->rehash;
398 * Note that insertion may rearrange the table on a resize or rehash,
H A Dhash_table.h53 uint32_t rehash; member in struct:hash_table
151 * (which may rehash the table, making entry a dangling pointer).
/xsrc/external/mit/MesaLib/dist/src/util/
H A Dhash_table.c79 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
84 uint32_t max_entries, size, rehash; member in struct:__anonc801dae50108
87 #define ENTRY(max_entries, size, rehash) \
88 { max_entries, size, rehash, \
89 REMAINDER_MAGIC(size), REMAINDER_MAGIC(rehash) }
157 ht->rehash = hash_sizes[ht->size_index].rehash;
315 uint32_t double_hash = 1 + util_fast_urem32(hash, ht->rehash,
369 uint32_t double_hash = 1 + util_fast_urem32(hash, ht->rehash,
413 ht->rehash
[all...]
H A Dset.c46 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
55 uint32_t max_entries, size, rehash; member in struct:__anon74a7f5860108
58 #define ENTRY(max_entries, size, rehash) \
59 { max_entries, size, rehash, \
60 REMAINDER_MAGIC(size), REMAINDER_MAGIC(rehash) }
127 ht->rehash = hash_sizes[ht->size_index].rehash;
270 uint32_t double_hash = util_fast_urem32(hash, ht->rehash,
313 uint32_t double_hash = util_fast_urem32(hash, ht->rehash,
355 ht->rehash
[all...]
H A Dset.h49 uint32_t rehash; member in struct:set
129 * insertion (which may rehash the set, making entry a dangling
H A Dhash_table.h53 uint32_t rehash; member in struct:hash_table
138 * (which may rehash the table, making entry a dangling pointer).
/xsrc/external/mit/xorg-server/dist/render/
H A Dglyphstr.h63 CARD32 rehash; member in struct:_GlyphHashSet
H A Dglyph.c49 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
153 step = signature % hash->hashSet->rehash;
/xsrc/external/mit/MesaLib.old/dist/src/mesa/program/
H A Dprog_cache.c83 rehash(struct gl_program_cache *cache) function in typeref:typename:void
221 rehash(cache);
250 rehash(cache);
/xsrc/external/mit/MesaLib/dist/src/mesa/program/
H A Dprog_cache.c84 rehash(struct gl_program_cache *cache) function in typeref:typename:void
222 rehash(cache);
251 rehash(cache);
/xsrc/external/mit/xorg-server.old/dist/render/
H A Dglyphstr.h63 CARD32 rehash; member in struct:_GlyphHashSet
H A Dglyph.c49 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
168 step = signature % hash->hashSet->rehash;
/xsrc/external/mit/libXt/dist/src/
H A DEvent.c534 unsigned int rehash; /* mask - 2 */ member in struct:_WWTable
544 #define WWREHASHVAL(tab,win) ((((win) % tab->rehash) + 2) | 1)
545 #define WWREHASH(tab,idx,rehash) ((unsigned)(idx + rehash) & (tab->mask))
581 int rehash = (int) WWREHASHVAL(tab, window); local in function:XtRegisterDrawable
584 idx = (int) WWREHASH(tab, idx, rehash);
629 int rehash = (int) WWREHASHVAL(tab, window); local in function:XtUnregisterDrawable
632 idx = (int) WWREHASH(tab, idx, rehash);
652 register Cardinal oldidx, newidx, rehash; local in function:ExpandWWTable
662 tab->rehash
699 int rehash = (int) WWREHASHVAL(tab, window); local in function:XtWindowToWidget
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/mesa/drivers/dri/i965/
H A Dbrw_program_cache.c171 rehash(struct brw_cache *cache) function in typeref:typename:void
382 rehash(cache);
/xsrc/external/mit/MesaLib/dist/src/mesa/drivers/dri/i965/
H A Dbrw_program_cache.c144 rehash(struct brw_cache *cache) function in typeref:typename:void
355 rehash(cache);
/xsrc/external/mit/MesaLib/dist/docs/relnotes/
H A D21.1.0.rst3819 - util/hash_table: optimize rehash for empty table and no-func clears
3820 - util/set: optimize rehash for empty table and no-func clears
H A D21.0.0.rst823 - nir/opt_vectorize: rehash users of vectorized instructions

Completed in 32 milliseconds