Searched refs:keys (Results 1 - 25 of 180) sorted by relevance

12345678

/xsrc/external/mit/MesaLib.old/dist/src/util/tests/hash_table/
H A Dinsert_many.c54 uint32_t keys[SIZE]; local in function:main
63 keys[i] = i;
65 _mesa_hash_table_insert(ht, keys + i, NULL);
69 entry = _mesa_hash_table_search(ht, keys + i);
H A Ddelete_management.c54 uint32_t keys[SIZE]; local in function:main
63 keys[i] = i;
65 _mesa_hash_table_insert(ht, keys + i, NULL);
76 entry = _mesa_hash_table_search(ht, keys + i);
H A Drandom_entry.c60 uint32_t keys[SIZE]; local in function:main
69 keys[i] = i;
71 _mesa_hash_table_insert(ht, keys + i, NULL);
/xsrc/external/mit/MesaLib/dist/src/util/tests/hash_table/
H A Dinsert_many.c54 uint32_t keys[SIZE]; local in function:main
63 keys[i] = i;
65 _mesa_hash_table_insert(ht, keys + i, NULL);
69 entry = _mesa_hash_table_search(ht, keys + i);
H A Ddelete_management.c54 uint32_t keys[SIZE]; local in function:main
63 keys[i] = i;
65 _mesa_hash_table_insert(ht, keys + i, NULL);
76 entry = _mesa_hash_table_search(ht, keys + i);
H A Drandom_entry.c60 uint32_t keys[SIZE]; local in function:main
69 keys[i] = i;
71 _mesa_hash_table_insert(ht, keys + i, NULL);
/xsrc/external/mit/libX11/dist/src/
H A DQuKeybd.c39 char keys[32])
48 *(struct kmap *) keys = *(struct kmap *)rep.map; /* faster than memcpy */
37 XQueryKeymap(register Display * dpy,char keys[32]) argument
/xsrc/external/mit/xorg-server.old/dist/dix/
H A Dprivates.c71 } keys[PRIVATE_LAST]; variable in typeref:struct:__anon020ad90c0108[]
117 if (!fixup(&screenInfo.screens[s]->devPrivates, keys[PRIVATE_SCREEN].offset, bytes))
126 return fixup(&serverClient->devPrivates, keys[PRIVATE_CLIENT].offset, bytes);
136 if (!fixup(&extension->devPrivates, keys[PRIVATE_EXTENSION].offset, bytes))
149 if (cmap && !fixup(&cmap->devPrivates, keys[PRIVATE_COLORMAP].offset, bytes))
190 /* Update offsets for all affected keys */
199 assert (!keys[t].created);
204 /* Move all existing keys up in the privates space to make
209 for (k = keys[t].key; k; k = k->next)
211 keys[
[all...]
/xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
H A Dgen_disasm.py56 options = [n for n in instructions.keys() if (n[0] == '*') == is_fma]
131 keys = set()
134 keys |= find_context_keys_expr(test)
139 keys |= find_context_keys_expr(val)
141 return keys
152 def compile_derived_inner(expr, keys):
158 args = [compile_derived_inner(arg, keys) for arg in expr[1:]]
165 return "ctx[{}]".format(keys.index(expr))
167 def compile_derived(expr, keys):
168 return eval('lambda ctx, ordering: ' + compile_derived_inner(expr, keys))
[all...]
H A Dbi_opcodes.h.py116 mnemonics = set(x[1:] for x in instructions.keys())
H A Dbi_opcodes.c.py64 mnemonics = set(x[1:] for x in instructions.keys())
/xsrc/external/mit/libX11/dist/specs/i18n/compose/
H A DMakefile.am5 docbook = libX11-keys.xml
/xsrc/external/mit/MesaLib/dist/src/panfrost/shared/
H A Dpan_minmax_cache.h35 uint64_t keys[PANFROST_MINMAX_SIZE]; member in struct:panfrost_minmax_cache
H A Dpan_minmax_cache.c35 * ratio and cache search speed). Note that keys are adjacent so we get cache
54 if (cache->keys[i] == ht_key) {
85 cache->keys[index] = ht_key;
107 uint64_t key = cache->keys[i];
115 cache->keys[valid_count] = key;
/xsrc/external/mit/glu/dist/src/libtess/
H A Dpriorityq.c61 pq->keys = (PQHeapKey *)memAlloc( INIT_SIZE * sizeof(pq->keys[0]) );
62 if (pq->keys == NULL) {
82 if (pq->keys != NULL) memFree( pq->keys );
98 /* Create an array of indirect pointers to the keys, so that we
115 for( piv = pq->keys, i = p; i <= r; ++piv, ++i ) {
183 PQkey *saveKey= pq->keys;
187 pq->keys = (PQHeapKey *)memRealloc( pq->keys,
[all...]
/xsrc/external/mit/xedit/dist/lisp/
H A Dhash.c214 if (entry->keys[i] == okey)
218 if (entry->keys[i] == okey)
224 if (LispObjectCompare(entry->keys[i], okey,
229 if (LispObjectCompare(entry->keys[i], okey,
259 LispObj **keys, **values; local in function:LispHash
261 keys = realloc(entry->keys, sizeof(LispObj*) * (i + 4));
262 if (keys == NULL)
266 free(keys);
269 entry->keys
323 LispObj **keys, **values; local in function:LispRehash
620 LispObj **keys, **values; local in function:Lisp_MakeHashTable
[all...]
H A Dhash.h38 LispObj **keys; member in struct:_LispHashEntry
/xsrc/external/mit/xkeyboard-config/dist/tests/ruby/
H A Dfind_fragments.rb42 numDupSymbols = symbols.keys.inject(0) do | rv, keycode |
H A Dxkbparser.rb42 alias keys_original keys
64 # All keys - including the ones specified in the included sections
66 def keys() method in class:Symbols
69 rv | syms.keys
73 # Size of all keys
75 keys().length()
82 keys.size()
/xsrc/external/mit/libdrm/dist/tests/
H A Ddrmsl.c63 unsigned long keys[1000000]; local in function:do_time
75 keys[i] = drmRandom(ranstate);
76 drmSLInsert(list, keys[i], NULL);
92 if (drmSLLookup(list, keys[i], &value))
93 printf("Error %lu %d\n", keys[i], i);
/xsrc/external/mit/fontconfig/dist/fc-lang/
H A Dfc-lang.py65 keys = sorted(self.leaves.keys())
66 other_keys = sorted(other_cs.leaves.keys())
67 if len(keys) != len(other_keys):
69 for k1, k2 in zip(keys, other_keys):
177 for fn in sorted(orth_entries.keys()):
200 for leaf_num in sorted(s.leaves.keys()):
298 for n, leaf_num in enumerate(sorted(s.leaves.keys())):
320 for n, leaf_num in enumerate(sorted(s.leaves.keys())):
341 for i, k in enumerate(orth_entries.keys())
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/mapi/glapi/gen/
H A Dgl_procs.py147 keys = sorted(categories.keys())
148 for key in keys:
/xsrc/external/mit/MesaLib/dist/src/mapi/glapi/gen/
H A Dgl_procs.py136 keys = sorted(categories.keys())
137 for key in keys:
/xsrc/external/mit/MesaLib/dist/src/compiler/glsl/
H A Dshader_cache.cpp119 cache_item_metadata.keys =
123 if (!cache_item_metadata.keys)
127 memcpy(cache_item_metadata.keys[i], prog->Shaders[i]->sha1,
141 free(cache_item_metadata.keys);
/xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/
H A Dshader_cache.cpp117 cache_item_metadata.keys =
121 if (!cache_item_metadata.keys)
125 memcpy(cache_item_metadata.keys[i], prog->Shaders[i]->sha1,
139 free(cache_item_metadata.keys);

Completed in 20 milliseconds

12345678