| /xsrc/external/mit/xedit/dist/ |
| hash.c | 31 * This is a very simplified and adapted version of the hash tables I am
32 * using in a personal project. It was added to try to have a single hash
42 * also, all code traversing hash tables is now using
48 * Also, this hash table implementation was added mainly for the tags
55 static int hash_equal(hash_table *hash, hash_key *left, hash_key *right);
63 hash_equal(hash_table *hash, hash_key *left, hash_key *right)
68 if (hash->compare)
69 return (hash->compare(left, right));
97 hash_table *hash; local
99 hash = calloc(1, sizeof(hash_table))
[all...] |
| util.h | 26 /* Generic hash table */
65 hash_entry *hash_put(hash_table *hash, hash_entry *entry);
66 hash_entry *hash_get(hash_table *hash, hash_key *name);
67 hash_entry * hash_check(hash_table *hash, const char *name, unsigned int length);
68 void hash_rem(hash_table *hash, hash_entry *entry);
69 /* Removes from hash table but doesn't release any memory */
70 hash_entry *hash_rem_no_free(hash_table *hash, hash_entry *entry);
71 void hash_rehash(hash_table *hash, unsigned int length);
72 hash_entry *hash_iter_first(hash_table *hash);
73 hash_entry *hash_iter_next(hash_table *hash);
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/cso_cache/ |
| cso_hash.c | 77 cso_hash_create_node(struct cso_hash *hash,
91 ++hash->size;
95 static void cso_data_rehash(struct cso_hash *hash, int hint)
101 hash->userNumBits = (short)hint;
102 while (primeForNumBits(hint) < (hash->size >> 1))
108 if (hash->numBits != hint) {
109 struct cso_node *e = (struct cso_node *)hash;
110 struct cso_node **oldBuckets = hash->buckets;
111 int oldNumBuckets = hash->numBuckets;
114 hash->numBits = (short)hint
[all...] |
| cso_hash.h | 30 * Hash table implementation.
32 * This file provides a hash implementation that is capable of dealing
34 * functions operating on the hash return an iterator. The iterator
61 struct cso_hash *hash; member in struct:cso_hash_iter
75 void cso_hash_init(struct cso_hash *hash);
76 void cso_hash_deinit(struct cso_hash *hash);
79 int cso_hash_size(struct cso_hash *hash);
83 * Adds a data with the given key to the hash. If entry with the given
84 * key is already in the hash, this current entry is instered before it
86 * Function returns iterator pointing to the inserted item in the hash
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/nine/ |
| nine_pdata.h | 24 unsigned i, hash = 0; local
28 hash = (unsigned)(str[i]) + (hash << 6) + (hash << 16) - hash;
31 return hash;
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/nine/ |
| nine_pdata.h | 22 unsigned i, hash = 0; local
26 hash = (unsigned)(str[i]) + (hash << 6) + (hash << 16) - hash;
29 return hash;
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/cso_cache/ |
| cso_hash.c | 86 static void *cso_data_allocate_node(struct cso_hash_data *hash)
88 return MALLOC(hash->nodeSize);
97 cso_hash_create_node(struct cso_hash *hash,
101 struct cso_node *node = cso_data_allocate_node(hash->data.d);
111 ++hash->data.d->size;
115 static void cso_data_rehash(struct cso_hash_data *hash, int hint)
121 hash->userNumBits = (short)hint;
122 while (primeForNumBits(hint) < (hash->size >> 1))
128 if (hash->numBits != hint) {
129 struct cso_node *e = (struct cso_node *)(hash);
229 struct cso_hash *hash = MALLOC_STRUCT(cso_hash); local
[all...] |
| cso_hash.h | 30 * Hash table implementation.
32 * This file provides a hash implementation that is capable of dealing
34 * functions operating on the hash return an iterator. The iterator
68 struct cso_hash *hash; member in struct:cso_hash_iter
74 void cso_hash_delete(struct cso_hash *hash);
77 int cso_hash_size(struct cso_hash *hash);
81 * Adds a data with the given key to the hash. If entry with the given
82 * key is already in the hash, this current entry is instered before it
84 * Function returns iterator pointing to the inserted item in the hash.
86 struct cso_hash_iter cso_hash_insert(struct cso_hash *hash, unsigned key
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/ |
| bi_opt_cse.c | 37 HASH(uint32_t hash, unsigned data)
39 return XXH32(&data, sizeof(data), hash);
43 hash_index(uint32_t hash, bi_index index)
45 hash = HASH(hash, index.value);
46 hash = HASH(hash, index.abs)
60 uint32_t hash = 0; local
[all...] |
| /xsrc/external/mit/freetype/dist/src/base/ |
| fthash.c | 56 /* Mocklisp hash function. */
71 /* Mocklisp hash function. */
106 FT_Hash hash )
109 FT_Hashnode* bp = hash->table;
113 res = (hash->lookup)( &key );
115 ndp = bp + ( res % hash->size );
118 if ( (hash->compare)( &(*ndp)->key, &key ) )
123 ndp = bp + ( hash->size - 1 );
131 hash_rehash( FT_Hash hash,
134 FT_Hashnode* obp = hash->table
[all...] |
| /xsrc/external/mit/xorg-server.old/dist/hw/dmx/input/ |
| dmxmap.c | 65 int hash = remoteEvent & DMX_MAP_MASK; local
69 if (dmxLocal->map[hash].remote == remoteEvent
70 && dmxLocal->map[hash].server == serverEvent) return;
72 if (dmxLocal->map[hash].remote) {
85 dmxLocal->map[hash].remote = remoteEvent;
86 dmxLocal->map[hash].server = serverEvent;
106 int hash = remoteEvent & DMX_MAP_MASK; local
110 if (dmxLocal->mapOptimize && dmxLocal->map[hash].remote == remoteEvent) {
111 serverEvent = dmxLocal->map[hash].server;
115 serverEvent = dmxLocal->map[hash].server
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_instr_set.c | 86 #define HASH(hash, data) XXH32(&(data), sizeof(data), hash)
89 hash_src(uint32_t hash, const nir_src *src)
92 hash = HASH(hash, src->ssa);
93 return hash;
97 hash_alu_src(uint32_t hash, const nir_alu_src *src, unsigned num_components)
99 hash = HASH(hash, src->abs)
299 uint32_t hash = 0; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/translate/ |
| translate_cache.c | 37 struct cso_hash hash; member in struct:translate_cache
47 cso_hash_init(&cache->hash);
54 struct cso_hash *hash = &cache->hash; local
55 struct cso_hash_iter iter = cso_hash_first_node(hash);
68 cso_hash_deinit(&cache->hash);
95 cso_hash_find_data_from_template(&cache->hash,
102 cso_hash_insert(&cache->hash, hash_key, translate);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/translate/ |
| translate_cache.c | 37 struct cso_hash *hash; member in struct:translate_cache
47 cache->hash = cso_hash_create();
54 struct cso_hash *hash = cache->hash; local
55 struct cso_hash_iter iter = cso_hash_first_node(hash);
68 cso_hash_delete(cache->hash);
95 cso_hash_find_data_from_template(cache->hash,
102 cso_hash_insert(cache->hash, hash_key, translate);
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ |
| ir3_cse.c | 35 #define HASH(hash, data) XXH32(&(data), sizeof(data), hash)
41 uint32_t hash = 0; local
43 hash = HASH(hash, instr->opc);
44 hash = HASH(hash, instr->dsts[0]->flags)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| nir_instr_set.c | 86 #define HASH(hash, data) _mesa_fnv32_1a_accumulate((hash), (data))
89 hash_src(uint32_t hash, const nir_src *src)
92 hash = HASH(hash, src->ssa);
93 return hash;
97 hash_alu_src(uint32_t hash, const nir_alu_src *src, unsigned num_components)
99 hash = HASH(hash, src->abs)
282 uint32_t hash = _mesa_fnv32_1a_offset_bias; local
[all...] |
| /xsrc/external/mit/freetype/dist/include/freetype/internal/ |
| fthash.h | 95 ft_hash_str_init( FT_Hash hash,
99 ft_hash_num_init( FT_Hash hash,
103 ft_hash_str_free( FT_Hash hash,
111 FT_Hash hash,
117 FT_Hash hash,
122 FT_Hash hash );
126 FT_Hash hash );
|
| /xsrc/external/mit/libdrm/dist/ |
| xf86drmHash.c | 1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
40 * 2) The hash computation uses a table of random integers [Hanson97,
48 * dynamic hash tables was postponed until the need arises. A common (and
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
66 * [Larson88] Per-Ake Larson. "Dynamic Hash Tables". CACM 31(4), April
82 unsigned long hash = 0; local
97 hash = (hash << 1) + scatter[tmp & 0xff]
142 unsigned long hash = HashHash(key); local
184 unsigned long hash; local
202 unsigned long hash; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/util/ |
| u_cache.c | 51 uint32_t hash; member in struct:util_cache_entry
67 /** Hash function */
68 uint32_t (*hash)(const void *key); member in struct:util_cache
100 util_cache_create(uint32_t (*hash)(const void *key),
111 cache->hash = hash;
132 * Try to find a cache entry, given the key and hash of the key.
136 uint32_t hash,
140 uint32_t index = hash % cache->size;
155 if (current->hash == hash &
202 uint32_t hash; local
241 uint32_t hash; local
322 uint32_t hash; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/ |
| u_cache.c | 51 uint32_t hash; member in struct:util_cache_entry
67 /** Hash function */
68 uint32_t (*hash)(const void *key); member in struct:util_cache
100 util_cache_create(uint32_t (*hash)(const void *key),
111 cache->hash = hash;
132 * Try to find a cache entry, given the key and hash of the key.
136 uint32_t hash,
140 uint32_t index = hash % cache->size;
155 if (current->hash == hash &
202 uint32_t hash; local
241 uint32_t hash; local
322 uint32_t hash; local
[all...] |
| /xsrc/external/mit/libXfont/dist/src/util/ |
| patcache.c | 38 * Static sized hash table for looking up font name patterns
54 int hash; member in struct:_FontPatternCacheEntry
116 Hash (const char *string, int len)
118 int hash; local
120 hash = 0;
122 hash = (hash << 1) ^ *string++;
123 if (hash < 0)
124 hash = -hash;
180 int hash; local
[all...] |
| /xsrc/external/mit/libXfont2/dist/src/util/ |
| patcache.c | 39 * Static sized hash table for looking up font name patterns
55 int hash; member in struct:_FontPatternCacheEntry
117 Hash (const char *string, int len)
119 int hash; local
121 hash = 0;
123 hash = (hash << 1) ^ *string++;
124 if (hash < 0)
125 hash = -hash;
181 int hash; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/mesa/program/ |
| prog_cache.c | 40 GLuint hash; member in struct:cache_item
57 * Compute hash index from state key.
63 GLuint hash = 0, i; local
67 /* Make a slightly better attempt at a hash function:
71 hash += ikey[i];
72 hash += (hash << 10);
73 hash ^= (hash >> 6);
76 return hash;
185 const GLuint hash = hash_key(key, keysize); local
209 const GLuint hash = hash_key(key, keysize); local
238 const GLuint hash = hash_key(key, keysize); local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/panfrost/midgard/ |
| mir_squeeze.c | 29 /* When we're 'squeezing down' the values in the IR, we maintain a hash
34 unsigned hash)
36 if (hash >= SSA_FIXED_MINIMUM)
37 return hash;
40 map, hash + 1);
47 ctx->max_hash = MAX2(ctx->max_hash, hash);
50 hash + 1, (void *) ((uintptr_t) temp + 1));
|
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/program/ |
| prog_cache.c | 39 GLuint hash; member in struct:cache_item
56 * Compute hash index from state key.
62 GLuint hash = 0, i; local
66 /* Make a slightly better attempt at a hash function:
70 hash += ikey[i];
71 hash += (hash << 10);
72 hash ^= (hash >> 6);
75 return hash;
184 const GLuint hash = hash_key(key, keysize); local
208 const GLuint hash = hash_key(key, keysize); local
237 const GLuint hash = hash_key(key, keysize); local
[all...] |
