Searched refs:hash (Results 1 - 25 of 294) sorted by relevance

1234567891011>>

/xsrc/external/mit/xedit/dist/
H A Dhash.c31 * 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) argument
68 if (hash->compare)
69 return (hash->compare(left, right));
97 hash_table *hash; local in function:hash_new
99 hash
117 hash_put(hash_table * hash,hash_entry * entry) argument
166 hash_get(hash_table * hash,hash_key * name) argument
183 hash_check(hash_table * hash,const char * name,unsigned int length) argument
201 hash_rem_no_free(hash_table * hash,hash_entry * entry) argument
226 hash_rem(hash_table * hash,hash_entry * entry) argument
237 hash_rehash(hash_table * hash,unsigned int length) argument
263 hash_iter_first(hash_table * hash) argument
272 hash_iter_next(hash_table * hash) argument
292 hash_clr(hash_table * hash) argument
316 hash_del(hash_table * hash) argument
[all...]
H A Dutil.h26 /* 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/
H A Dcso_hash.c77 cso_hash_create_node(struct cso_hash *hash, argument
91 ++hash->size;
95 static void cso_data_rehash(struct cso_hash *hash, int hint) argument
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
144 cso_data_might_grow(struct cso_hash * hash) argument
150 cso_data_has_shrunk(struct cso_hash * hash) argument
159 cso_data_first_node(struct cso_hash * hash) argument
173 cso_hash_insert(struct cso_hash * hash,unsigned key,void * data) argument
189 cso_hash_init(struct cso_hash * hash) argument
200 cso_hash_deinit(struct cso_hash * hash) argument
254 cso_hash_take(struct cso_hash * hash,unsigned akey) argument
270 cso_hash_first_node(struct cso_hash * hash) argument
276 cso_hash_size(struct cso_hash * hash) argument
281 cso_hash_erase(struct cso_hash * hash,struct cso_hash_iter iter) argument
300 cso_hash_contains(struct cso_hash * hash,unsigned key) argument
[all...]
H A Dcso_hash.h32 * 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.
88 struct cso_hash_iter cso_hash_insert(struct cso_hash *hash, unsigne
141 cso_hash_find_node(struct cso_hash * hash,unsigned akey) argument
160 cso_hash_find(struct cso_hash * hash,unsigned key) argument
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/nine/
H A Dnine_pdata.h22 unsigned i, hash = 0; local in function:ht_guid_hash
26 hash = (unsigned)(str[i]) + (hash << 6) + (hash << 16) - hash;
29 return hash;
/xsrc/external/mit/MesaLib/dist/src/gallium/frontends/nine/
H A Dnine_pdata.h24 unsigned i, hash = 0; local in function:ht_guid_hash
28 hash = (unsigned)(str[i]) + (hash << 6) + (hash << 16) - hash;
31 return hash;
/xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/cso_cache/
H A Dcso_hash.c86 static void *cso_data_allocate_node(struct cso_hash_data *hash) argument
88 return MALLOC(hash->nodeSize);
97 cso_hash_create_node(struct cso_hash *hash, argument
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) argument
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);
164 cso_data_might_grow(struct cso_hash_data * hash) argument
170 cso_data_has_shrunk(struct cso_hash_data * hash) argument
179 cso_data_first_node(struct cso_hash_data * hash) argument
192 cso_hash_find_node(struct cso_hash * hash,unsigned akey) argument
207 cso_hash_insert(struct cso_hash * hash,unsigned key,void * data) argument
229 struct cso_hash *hash = MALLOC_STRUCT(cso_hash); local in function:cso_hash_create
250 cso_hash_delete(struct cso_hash * hash) argument
268 cso_hash_find(struct cso_hash * hash,unsigned key) argument
357 cso_hash_take(struct cso_hash * hash,unsigned akey) argument
380 cso_hash_first_node(struct cso_hash * hash) argument
386 cso_hash_size(struct cso_hash * hash) argument
391 cso_hash_erase(struct cso_hash * hash,struct cso_hash_iter iter) argument
410 cso_hash_contains(struct cso_hash * hash,unsigned key) argument
[all...]
H A Dcso_hash.h32 * 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,
89 * Removes the item pointed to by the current iterator from the hash
[all...]
/xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
H A Dbi_opt_cse.c37 HASH(uint32_t hash, unsigned data) argument
39 return XXH32(&data, sizeof(data), hash);
43 hash_index(uint32_t hash, bi_index index) argument
45 hash = HASH(hash, index.value);
46 hash = HASH(hash, index.abs);
47 hash = HASH(hash, index.neg);
48 hash
60 uint32_t hash = 0; local in function:hash_instr
[all...]
/xsrc/external/mit/freetype/dist/src/base/
H A Dfthash.c56 /* 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, argument
134 FT_Hashnode* obp = hash
105 hash_bucket(FT_Hashkey key,FT_Hash hash) argument
165 hash_init(FT_Hash hash,FT_Bool is_num,FT_Memory memory) argument
195 ft_hash_str_init(FT_Hash hash,FT_Memory memory) argument
203 ft_hash_num_init(FT_Hash hash,FT_Memory memory) argument
211 ft_hash_str_free(FT_Hash hash,FT_Memory memory) argument
233 hash_insert(FT_Hashkey key,size_t data,FT_Hash hash,FT_Memory memory) argument
271 ft_hash_str_insert(const char * key,size_t data,FT_Hash hash,FT_Memory memory) argument
286 ft_hash_num_insert(FT_Int num,size_t data,FT_Hash hash,FT_Memory memory) argument
301 hash_lookup(FT_Hashkey key,FT_Hash hash) argument
313 ft_hash_str_lookup(const char * key,FT_Hash hash) argument
326 ft_hash_num_lookup(FT_Int num,FT_Hash hash) argument
[all...]
/xsrc/external/mit/xorg-server.old/dist/hw/dmx/input/
H A Ddmxmap.c65 int hash = remoteEvent & DMX_MAP_MASK; local in function:dmxMapInsert
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 in function:dmxMapLookup
110 if (dmxLocal->mapOptimize && dmxLocal->map[hash].remote == remoteEvent) {
111 serverEvent = dmxLocal->map[hash].server;
115 serverEvent = dmxLocal->map[hash]
[all...]
/xsrc/external/mit/MesaLib/dist/src/compiler/nir/
H A Dnir_instr_set.c86 #define HASH(hash, data) XXH32(&(data), sizeof(data), hash)
89 hash_src(uint32_t hash, const nir_src *src) argument
92 hash = HASH(hash, src->ssa);
93 return hash;
97 hash_alu_src(uint32_t hash, const nir_alu_src *src, unsigned num_components) argument
99 hash = HASH(hash, src->abs);
100 hash
110 hash_alu(uint32_t hash,const nir_alu_instr * instr) argument
152 hash_deref(uint32_t hash,const nir_deref_instr * instr) argument
192 hash_load_const(uint32_t hash,const nir_load_const_instr * instr) argument
218 hash_phi(uint32_t hash,const nir_phi_instr * instr) argument
241 hash_intrinsic(uint32_t hash,const nir_intrinsic_instr * instr) argument
260 hash_tex(uint32_t hash,const nir_tex_instr * instr) argument
299 uint32_t hash = 0; local in function:hash_instr
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/translate/
H A Dtranslate_cache.c37 struct cso_hash *hash; member in struct:translate_cache
47 cache->hash = cso_hash_create();
54 struct cso_hash *hash = cache->hash; local in function:delete_translates
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/gallium/auxiliary/translate/
H A Dtranslate_cache.c37 struct cso_hash hash; member in struct:translate_cache
47 cso_hash_init(&cache->hash);
54 struct cso_hash *hash = &cache->hash; local in function:delete_translates
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/dist/src/freedreno/ir3/
H A Dir3_cse.c35 #define HASH(hash, data) XXH32(&(data), sizeof(data), hash)
41 uint32_t hash = 0; local in function:hash_instr
43 hash = HASH(hash, instr->opc);
44 hash = HASH(hash, instr->dsts[0]->flags);
47 hash = HASH(hash, src->num);
49 hash
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
H A Dnir_instr_set.c86 #define HASH(hash, data) _mesa_fnv32_1a_accumulate((hash), (data))
89 hash_src(uint32_t hash, const nir_src *src) argument
92 hash = HASH(hash, src->ssa);
93 return hash;
97 hash_alu_src(uint32_t hash, const nir_alu_src *src, unsigned num_components) argument
99 hash = HASH(hash, src->abs);
100 hash
110 hash_alu(uint32_t hash,const nir_alu_instr * instr) argument
141 hash_deref(uint32_t hash,const nir_deref_instr * instr) argument
179 hash_load_const(uint32_t hash,const nir_load_const_instr * instr) argument
205 hash_phi(uint32_t hash,const nir_phi_instr * instr) argument
228 hash_intrinsic(uint32_t hash,const nir_intrinsic_instr * instr) argument
245 hash_tex(uint32_t hash,const nir_tex_instr * instr) argument
282 uint32_t hash = _mesa_fnv32_1a_offset_bias; local in function:hash_instr
818 uint32_t hash = hash_instr(instr); local in function:nir_instr_set_add_or_rewrite
[all...]
/xsrc/external/mit/freetype/dist/include/freetype/internal/
H A Dfthash.h95 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/
H A Dxf86drmHash.c1 /* 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,
82 unsigned long hash = 0; local in function:HashHash
97 hash = (hash << 1) + scatter[tmp & 0xff];
101 hash
142 unsigned long hash = HashHash(key); local in function:HashFind
184 unsigned long hash; local in function:drmHashInsert
202 unsigned long hash; local in function:drmHashDelete
[all...]
/xsrc/external/mit/libXfont/dist/src/util/
H A Dpatcache.c38 * Static sized hash table for looking up font name patterns
54 int hash; member in struct:_FontPatternCacheEntry
118 int hash; local in function:Hash
120 hash = 0;
122 hash = (hash << 1) ^ *string++;
123 if (hash < 0)
124 hash = -hash;
125 return hash;
180 int hash; local in function:FindCachedFontPattern
[all...]
/xsrc/external/mit/libXfont2/dist/src/util/
H A Dpatcache.c39 * Static sized hash table for looking up font name patterns
55 int hash; member in struct:_FontPatternCacheEntry
119 int hash; local in function:Hash
121 hash = 0;
123 hash = (hash << 1) ^ *string++;
124 if (hash < 0)
125 hash = -hash;
126 return hash;
181 int hash; local in function:xfont2_find_cached_font_pattern
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/
H A Du_cache.c51 uint32_t hash; member in struct:util_cache_entry
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
135 util_cache_entry_get(struct util_cache * cache,uint32_t hash,const void * key) argument
202 uint32_t hash; local in function:util_cache_set
241 uint32_t hash; local in function:util_cache_get
322 uint32_t hash; local in function:util_cache_remove
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/util/
H A Du_cache.c51 uint32_t hash; member in struct:util_cache_entry
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
135 util_cache_entry_get(struct util_cache * cache,uint32_t hash,const void * key) argument
202 uint32_t hash; local in function:util_cache_set
241 uint32_t hash; local in function:util_cache_get
322 uint32_t hash; local in function:util_cache_remove
[all...]
/xsrc/external/mit/freetype/dist/docs/reference/javascripts/
H A Dextra.js29 if(this.hash.substr(1)){
30 var o = document.getElementById(this.hash.substr(1));
32 window.location.hash = this.hash;
46 // If there is a hash in the url, slugify it
48 if(window.location.hash) {
50 slug = slugify(window.location.hash);
52 //window.location.hash = slug;
/xsrc/external/mit/MesaLib.old/dist/src/mesa/program/
H A Dprog_cache.c39 GLuint hash; member in struct:cache_item
56 * Compute hash index from state key.
62 GLuint hash = 0, i; local in function:hash_key
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 in function:_mesa_search_program_cache
208 const GLuint hash = hash_key(key, keysize); local in function:_mesa_program_cache_insert
237 const GLuint hash = hash_key(key, keysize); local in function:_mesa_shader_cache_insert
[all...]
/xsrc/external/mit/MesaLib/dist/src/mesa/program/
H A Dprog_cache.c40 GLuint hash; member in struct:cache_item
57 * Compute hash index from state key.
63 GLuint hash = 0, i; local in function:hash_key
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 in function:_mesa_search_program_cache
209 const GLuint hash = hash_key(key, keysize); local in function:_mesa_program_cache_insert
238 const GLuint hash = hash_key(key, keysize); local in function:_mesa_shader_cache_insert
[all...]

Completed in 25 milliseconds

1234567891011>>