| /xsrc/external/mit/libX11/dist/src/ |
| Quarks.c | 99 #define REHASH(idx,rehash) ((idx + rehash) & quarkMask)
181 register int oldidx, newidx, rehash; local
225 rehash = REHASHVAL(sig);
227 newidx = REHASH(newidx, rehash);
245 register int idx, rehash; local
249 rehash = 0;
266 nomatch: if (!rehash)
[all...] |
| IntAtom.c | 37 #define REHASH(idx,rehash) ((idx + rehash) & (TABLESIZE-1))
71 int n, firstidx, rehash = 0; local
95 rehash = REHASHVAL(sig);
96 idx = REHASH(idx, rehash);
127 int firstidx, rehash; local
144 rehash = REHASHVAL(sig);
146 idx = REHASH(idx, rehash)
[all...] |
| /xsrc/external/mit/bdftopcf/dist/ |
| atom.c | 49 static unsigned rehash; variable
105 rehash = newRehash;
156 r = (hash % rehash) | 1;
188 r = (hash % rehash) | 1;
|
| /xsrc/external/mit/libXfont/dist/src/util/ |
| atom.c | 50 static int rehash; variable
114 rehash = newRehash;
174 r = (hash % rehash) | 1;
210 r = (hash % rehash) | 1;
|
| /xsrc/external/mit/libXfont2/dist/src/stubs/ |
| atom.c | 51 static unsigned rehash; variable
110 rehash = newRehash;
161 r = (hash % rehash) | 1;
197 r = (hash % rehash) | 1;
|
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| set.c | 45 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
54 uint32_t max_entries, size, rehash; member in struct:__anon5043
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;
|
| set.h | 49 uint32_t rehash; member in struct:set
99 * insertion (which may rehash the set, making entry a dangling
|
| hash_table.c | 55 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
60 uint32_t max_entries, size, rehash; member in struct:__anon5038
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,
|
| hash_table.h | 53 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/ |
| hash_table.c | 79 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
84 uint32_t max_entries, size, rehash; member in struct:__anon2879
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 = hash_sizes[ht->size_index].rehash
[all...] |
| set.c | 46 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
55 uint32_t max_entries, size, rehash; member in struct:__anon2885
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 = hash_sizes[ht->size_index].rehash
[all...] |
| set.h | 49 uint32_t rehash; member in struct:set
129 * insertion (which may rehash the set, making entry a dangling
|
| hash_table.h | 53 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/ |
| glyphstr.h | 63 CARD32 rehash; member in struct:_GlyphHashSet
|
| glyph.c | 49 * From Knuth -- a good choice for hash/rehash values is p, p-2 where
153 step = signature % hash->hashSet->rehash;
|
| /xsrc/external/mit/MesaLib/dist/src/mesa/program/ |
| prog_cache.c | 84 rehash(struct gl_program_cache *cache) function
222 rehash(cache);
251 rehash(cache);
|
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/program/ |
| prog_cache.c | 83 rehash(struct gl_program_cache *cache) function
221 rehash(cache);
250 rehash(cache);
|
| /xsrc/external/mit/xorg-server.old/dist/render/ |
| glyphstr.h | 63 CARD32 rehash; member in struct:_GlyphHashSet
|
| glyph.c | 49 * 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/ |
| Event.c | 534 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
584 idx = (int) WWREHASH(tab, idx, rehash);
629 int rehash = (int) WWREHASHVAL(tab, window); local
632 idx = (int) WWREHASH(tab, idx, rehash);
652 register Cardinal oldidx, newidx, rehash; local
662 tab->rehash = tab->mask - 2
699 int rehash = (int) WWREHASHVAL(tab, window); local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/mesa/drivers/dri/i965/ |
| brw_program_cache.c | 144 rehash(struct brw_cache *cache) function
355 rehash(cache);
|
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/drivers/dri/i965/ |
| brw_program_cache.c | 171 rehash(struct brw_cache *cache) function
382 rehash(cache);
|
