HomeSort by: relevance | last modified time | path
    Searched defs:hash (Results 1 - 25 of 173) sorted by relevancy

1 2 3 4 5 6 7

  /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/util/
u_debug_stack_android.cpp 40 uint32_t hash = _mesa_hash_string(symbol); local
42 _mesa_hash_table_search_pre_hashed(symbol_table, hash, symbol);
44 entry = _mesa_hash_table_insert_pre_hashed(symbol_table, hash, symbol, strdup(symbol));
set.h 39 uint32_t hash; member in struct:set_entry
87 _mesa_set_add_pre_hashed(struct set *set, uint32_t hash, const void *key);
92 _mesa_set_search_or_add_pre_hashed(struct set *set, uint32_t hash,
98 _mesa_set_search_pre_hashed(const struct set *set, uint32_t hash,
104 _mesa_set_search_and_add_pre_hashed(struct set *set, uint32_t hash,
144 entry->hash = 0, entry->key = (void*)NULL, (set)->entries--, entry = _mesa_set_next_entry_unsafe(set, entry))
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/
u_surfaces.h 39 struct cso_hash *hash; member in union:util_surfaces::__anon3618
80 return cso_hash_iter_data(cso_hash_find(us->u.hash, (layer << 8) | level));
  /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/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/dist/src/gallium/auxiliary/util/
u_vertex_state_cache.c 92 uint32_t hash = key_hash(&key); local
96 struct set_entry *entry = _mesa_set_search_pre_hashed(cache->set, hash, &key);
111 assert(key_hash(state) == hash);
112 _mesa_set_add_pre_hashed(cache->set, hash, state);
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/iris/
iris_border_color.c 38 * colors are the same (typically black or white), we maintain a hash
138 uint32_t hash = color_hash(color); local
140 _mesa_hash_table_search_pre_hashed(pool->ht, hash, color);
150 _mesa_hash_table_insert_pre_hashed(pool->ht, hash, pool->map + offset,
  /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/auxiliary/cso_cache/
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.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.old/dist/src/gallium/drivers/iris/
iris_border_color.c 38 * colors are the same (typically black or white), we maintain a hash
138 uint32_t hash = color_hash(color); local
140 _mesa_hash_table_search_pre_hashed(pool->ht, hash, color);
150 _mesa_hash_table_insert_pre_hashed(pool->ht, hash, color,
  /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/util/
set.h 39 uint32_t hash; member in struct:set_entry
74 _mesa_set_add_pre_hashed(struct set *set, uint32_t hash, const void *key);
79 _mesa_set_search_pre_hashed(const struct set *set, uint32_t hash,
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/freedreno/ir3/
ir3_cache.c 38 uint32_t hash = _mesa_fnv32_1a_offset_bias; local
39 hash = _mesa_fnv32_1a_accumulate_block(hash, key, sizeof(*key));
40 return hash;
88 uint32_t hash = key_hash(key); local
90 _mesa_hash_table_search_pre_hashed(cache->ht, hash, key);
111 _mesa_hash_table_insert_pre_hashed(cache->ht, hash, &state->key, state);
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/
swr_shader.h 90 template <> struct hash<swr_jit_fs_key> { struct in namespace:std
97 template <> struct hash<swr_jit_vs_key> { struct in namespace:std
104 template <> struct hash<swr_jit_fetch_key> { struct in namespace:std
111 template <> struct hash<swr_jit_gs_key> { struct in namespace:std
  /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/xf86-video-qxl/dist/src/
qxl_image.c 44 uint32_t hash)
59 MurmurHash3_x86_32 (src_line, n_bytes, hash, &hash);
62 return hash;
70 uint32_t hash; local
90 hash = 0;
116 hash = hash_and_copy (data, stride,
118 Bpp, width, n_lines, hash);
182 /* Add to hash table if caching is enabled */
186 image->descriptor.id = hash;
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/compiler/nir/
nir_lower_locals_to_regs.c 34 /* A hash table mapping derefs to registers */
40 /* The following two functions implement a hash and equality check for
41 * variable dreferences. When the hash or equality function encounters an
48 uint32_t hash = 0; local
54 return XXH32(&deref->var, sizeof(deref->var), hash);
60 hash = XXH32(&deref->strct.index, sizeof(deref->strct.index), hash);
102 uint32_t hash = hash_deref(deref); local
108 _mesa_hash_table_search_pre_hashed(state->regs_table, hash, deref);
125 _mesa_hash_table_insert_pre_hashed(state->regs_table, hash, deref, reg)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/cso_cache/
cso_cache.c 74 struct cso_hash *hash,
79 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
83 static inline void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type,
90 int hash_size = cso_hash_size(hash);
98 struct cso_hash_iter iter = cso_hash_first_node(hash);
99 void *cso = cso_hash_take(hash, cso_hash_iter_key(iter));
110 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
111 sanitize_hash(sc, hash, type, sc->max_size);
113 return cso_hash_insert(hash, hash_key, state);
120 struct cso_hash *hash = _cso_hash_for_type(sc, type) local
175 struct cso_hash *hash = _cso_hash_for_type(sc, type); 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
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/drivers/freedreno/ir3/
ir3_cache.c 92 uint32_t hash = key_hash(key); local
94 _mesa_hash_table_search_pre_hashed(cache->ht, hash, key);
166 _mesa_hash_table_insert_pre_hashed(cache->ht, hash, &state->key, state);
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/
r300_fragprog_swizzle.c 46 unsigned int hash; /**< swizzle value this matches */ member in struct:swizzle_data
82 if (swz != GET_SWZ(sd->hash, comp))
172 if (swz == GET_SWZ(sd->hash, comp)) {
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/swr/
swr_shader.h 127 template <> struct hash<swr_jit_fs_key> { struct in namespace:std
134 template <> struct hash<swr_jit_vs_key> { struct in namespace:std
141 template <> struct hash<swr_jit_fetch_key> { struct in namespace:std
148 template <> struct hash<swr_jit_gs_key> { struct in namespace:std
155 template <> struct hash<swr_jit_tcs_key> { struct in namespace:std
162 template <> struct hash<swr_jit_tes_key> { struct in namespace:std
  /xsrc/external/mit/MesaLib/dist/src/gallium/winsys/radeon/drm/
radeon_drm_bo.h 62 uint32_t hash; member in struct:radeon_bo

Completed in 21 milliseconds

1 2 3 4 5 6 7