Searched refs:table (Results 1 - 25 of 576) sorted by relevance

1234567891011>>

/xsrc/external/mit/MesaLib/dist/src/mesa/main/
H A Dhash.c3 * Generic hash table.
46 * Create a new hash table.
48 * \return pointer to a new, empty hash table.
53 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local in function:_mesa_NewHashTable
55 if (table) {
56 table->ht = _mesa_hash_table_create(NULL, uint_key_hash,
58 if (table->ht == NULL) {
59 free(table);
64 _mesa_hash_table_set_deleted_key(table->ht, uint_key(DELETED_KEY_VALUE));
65 simple_mtx_init(&table
85 _mesa_DeleteHashTable(struct _mesa_HashTable * table) argument
103 init_name_reuse(struct _mesa_HashTable * table) argument
113 _mesa_HashEnableNameReuse(struct _mesa_HashTable * table) argument
125 _mesa_HashLookup_unlocked(struct _mesa_HashTable * table,GLuint key) argument
154 _mesa_HashLookup(struct _mesa_HashTable * table,GLuint key) argument
176 _mesa_HashLookupLocked(struct _mesa_HashTable * table,GLuint key) argument
183 _mesa_HashInsert_unlocked(struct _mesa_HashTable * table,GLuint key,void * data) argument
220 _mesa_HashInsertLocked(struct _mesa_HashTable * table,GLuint key,void * data,GLboolean isGenName) argument
239 _mesa_HashInsert(struct _mesa_HashTable * table,GLuint key,void * data,GLboolean isGenName) argument
260 _mesa_HashRemove_unlocked(struct _mesa_HashTable * table,GLuint key) argument
289 _mesa_HashRemoveLocked(struct _mesa_HashTable * table,GLuint key) argument
295 _mesa_HashRemove(struct _mesa_HashTable * table,GLuint key) argument
312 _mesa_HashDeleteAll(struct _mesa_HashTable * table,void (* callback)(void * data,void * userData),void * userData) argument
350 hash_walk_unlocked(const struct _mesa_HashTable * table,void (* callback)(void * data,void * userData),void * userData) argument
366 _mesa_HashWalk(const struct _mesa_HashTable * table,void (* callback)(void * data,void * userData),void * userData) argument
379 _mesa_HashWalkLocked(const struct _mesa_HashTable * table,void (* callback)(void * data,void * userData),void * userData) argument
392 _mesa_HashPrint(const struct _mesa_HashTable * table) argument
418 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable * table,GLuint numKeys) argument
453 _mesa_HashFindFreeKeys(struct _mesa_HashTable * table,GLuint * keys,GLuint numKeys) argument
475 _mesa_HashNumEntries(const struct _mesa_HashTable * table) argument
[all...]
H A Dhash.h3 * Generic hash table.
47 * The hash table needs a particular pointer to be the marker for a key that
48 * was deleted from the table, along with NULL for the "never allocated in the
49 * table" marker. Legacy GL allows any GLuint to be used as a GL object name,
52 * struct hash_table. We tell the hash table to use "1" as the deleted key
53 * value, so that we test the deleted-key-in-the-table path as best we can.
66 * are never deleted, we will never see a collision in the table, because the
67 * table resizes itself when it approaches full, and thus key % table_size ==
102 * The hash table data structure.
111 /** Value that would be in the table fo
139 _mesa_HashLockMutex(struct _mesa_HashTable * table) argument
152 _mesa_HashUnlockMutex(struct _mesa_HashTable * table) argument
195 _mesa_HashWalkMaybeLocked(const struct _mesa_HashTable * table,void (* callback)(void * data,void * userData),void * userData,bool locked) argument
206 _mesa_HashLookupMaybeLocked(struct _mesa_HashTable * table,GLuint key,bool locked) argument
216 _mesa_HashInsertMaybeLocked(struct _mesa_HashTable * table,GLuint key,void * data,GLboolean isGenName,bool locked) argument
227 _mesa_HashLockMaybeLocked(struct _mesa_HashTable * table,bool locked) argument
234 _mesa_HashUnlockMaybeLocked(struct _mesa_HashTable * table,bool locked) argument
[all...]
/xsrc/external/mit/MesaLib.old/src/mapi/glapi/
H A Dindirect_init.c31 * Initialize indirect rendering dispatch table.
55 * Create and initialize a new GL dispatch table. The table is initialized
60 _glapi_proc *table; local in function:__glXNewIndirectAPI
66 table = malloc(entries * sizeof(_glapi_proc));
67 if (table == NULL)
72 table[i] = (_glapi_proc) NoOp;
79 table[213] = (_glapi_proc) __indirect_glAccum;
80 table[240] = (_glapi_proc) __indirect_glAlphaFunc;
81 table[
[all...]
/xsrc/external/mit/MesaLib/src/mapi/glapi/gen/
H A Dindirect_init.c31 * Initialize indirect rendering dispatch table.
55 * Create and initialize a new GL dispatch table. The table is initialized
60 _glapi_proc *table; local in function:__glXNewIndirectAPI
66 table = malloc(entries * sizeof(_glapi_proc));
67 if (table == NULL)
72 table[i] = (_glapi_proc) NoOp;
79 table[213] = (_glapi_proc) __indirect_glAccum;
80 table[240] = (_glapi_proc) __indirect_glAlphaFunc;
81 table[
[all...]
H A Dmarshal_generated0.c1339 struct _glapi_table *table; local in function:_mesa_create_marshal_table
1341 table = _mesa_alloc_dispatch_table();
1342 if (table == NULL)
1346 ((_glapi_proc *)(table))[_gloffset_NewList] = (_glapi_proc)_mesa_marshal_NewList;
1348 ((_glapi_proc *)(table))[_gloffset_EndList] = (_glapi_proc)_mesa_marshal_EndList;
1350 ((_glapi_proc *)(table))[_gloffset_CallList] = (_glapi_proc)_mesa_marshal_CallList;
1352 ((_glapi_proc *)(table))[_gloffset_CallLists] = (_glapi_proc)_mesa_marshal_CallLists;
1354 ((_glapi_proc *)(table))[_gloffset_DeleteLists] = (_glapi_proc)_mesa_marshal_DeleteLists;
1356 ((_glapi_proc *)(table))[_gloffset_GenLists] = (_glapi_proc)_mesa_marshal_GenLists;
1358 ((_glapi_proc *)(table))[_gloffset_ListBas
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/mesa/main/
H A Dhash.c3 * Generic hash table.
44 * Create a new hash table.
46 * \return pointer to a new, empty hash table.
51 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local in function:_mesa_NewHashTable
53 if (table) {
54 table->ht = _mesa_hash_table_create(NULL, uint_key_hash,
56 if (table->ht == NULL) {
57 free(table);
62 _mesa_hash_table_set_deleted_key(table->ht, uint_key(DELETED_KEY_VALUE));
67 mtx_init(&table
87 _mesa_DeleteHashTable(struct _mesa_HashTable * table) argument
108 _mesa_HashLookup_unlocked(struct _mesa_HashTable * table,GLuint key) argument
137 _mesa_HashLookup(struct _mesa_HashTable * table,GLuint key) argument
159 _mesa_HashLookupLocked(struct _mesa_HashTable * table,GLuint key) argument
166 _mesa_HashInsert_unlocked(struct _mesa_HashTable * table,GLuint key,void * data) argument
202 _mesa_HashInsertLocked(struct _mesa_HashTable * table,GLuint key,void * data) argument
217 _mesa_HashInsert(struct _mesa_HashTable * table,GLuint key,void * data) argument
235 _mesa_HashRemove_unlocked(struct _mesa_HashTable * table,GLuint key) argument
259 _mesa_HashRemoveLocked(struct _mesa_HashTable * table,GLuint key) argument
265 _mesa_HashRemove(struct _mesa_HashTable * table,GLuint key) argument
282 _mesa_HashDeleteAll(struct _mesa_HashTable * table,void (* callback)(GLuint key,void * data,void * userData),void * userData) argument
310 hash_walk_unlocked(const struct _mesa_HashTable * table,void (* callback)(GLuint key,void * data,void * userData),void * userData) argument
326 _mesa_HashWalk(const struct _mesa_HashTable * table,void (* callback)(GLuint key,void * data,void * userData),void * userData) argument
339 _mesa_HashWalkLocked(const struct _mesa_HashTable * table,void (* callback)(GLuint key,void * data,void * userData),void * userData) argument
358 _mesa_HashPrint(const struct _mesa_HashTable * table) argument
380 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable * table,GLuint numKeys) argument
416 _mesa_HashNumEntries(const struct _mesa_HashTable * table) argument
[all...]
H A Dhash.h3 * Generic hash table.
42 * The hash table needs a particular pointer to be the marker for a key that
43 * was deleted from the table, along with NULL for the "never allocated in the
44 * table" marker. Legacy GL allows any GLuint to be used as a GL object name,
47 * struct hash_table. We tell the hash table to use "1" as the deleted key
48 * value, so that we test the deleted-key-in-the-table path as best we can.
61 * are never deleted, we will never see a collision in the table, because the
62 * table resizes itself when it approaches full, and thus key % table_size ==
97 * The hash table data structure.
104 /** Value that would be in the table fo
128 _mesa_HashLockMutex(struct _mesa_HashTable * table) argument
141 _mesa_HashUnlockMutex(struct _mesa_HashTable * table) argument
[all...]
/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
35 * 1) The table is power-of-two sized. Prime sized tables are more
37 * sized table, especially when double hashing is not used for collision
40 * 2) The hash computation uses a table of random integers [Hanson97,
45 * With a table size of 512, the current implementation is sufficient for a
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,
51 * and destroys the old table
107 HashTablePtr table; local in function:drmHashCreate
118 HashTablePtr table = (HashTablePtr)t; local in function:drmHashDestroy
139 HashFind(HashTablePtr table,unsigned long key,unsigned long * h) argument
169 HashTablePtr table = (HashTablePtr)t; local in function:drmHashLookup
182 HashTablePtr table = (HashTablePtr)t; local in function:drmHashInsert
201 HashTablePtr table = (HashTablePtr)t; local in function:drmHashDelete
218 HashTablePtr table = (HashTablePtr)t; local in function:drmHashNext
235 HashTablePtr table = (HashTablePtr)t; local in function:drmHashFirst
[all...]
/xsrc/external/mit/libdrm/dist/amdgpu/
H A Dhandle_table.c31 drm_private int handle_table_insert(struct handle_table *table, uint32_t key, argument
34 if (key >= table->max_key) {
39 values = realloc(table->values, max_key * sizeof(void *));
43 memset(values + table->max_key, 0, (max_key - table->max_key) *
46 table->max_key = max_key;
47 table->values = values;
49 table->values[key] = value;
53 drm_private void handle_table_remove(struct handle_table *table, uint32_t key) argument
55 if (key < table
59 handle_table_lookup(struct handle_table * table,uint32_t key) argument
67 handle_table_fini(struct handle_table * table) argument
[all...]
H A Dhandle_table.h35 drm_private int handle_table_insert(struct handle_table *table, uint32_t key,
37 drm_private void handle_table_remove(struct handle_table *table, uint32_t key);
38 drm_private void *handle_table_lookup(struct handle_table *table, uint32_t key);
39 drm_private void handle_table_fini(struct handle_table *table);
/xsrc/external/mit/MesaLib.old/dist/src/glx/
H A Dglxhash.c1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
37 * 1) The table is power-of-two sized. Prime sized tables are more
39 * sized table, especially when double hashing is not used for collision
42 * 2) The hash computation uses a table of random integers [Hanson97,
47 * With a table size of 512, the current implementation is sufficient for a
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
53 * and destroys the old table
159 __glxHashTablePtr table; local in function:__glxHashCreate
178 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashDestroy
201 HashFind(__glxHashTablePtr table,unsigned long key,unsigned long * h) argument
233 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashLookup
249 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashInsert
275 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashDelete
295 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashNext
313 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashFirst
356 compute_dist(__glxHashTablePtr table) argument
377 check_table(__glxHashTablePtr table,unsigned long key,unsigned long value) argument
407 __glxHashTablePtr table; local in function:main
[all...]
/xsrc/external/mit/MesaLib/dist/src/glx/
H A Dglxhash.c1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
37 * 1) The table is power-of-two sized. Prime sized tables are more
39 * sized table, especially when double hashing is not used for collision
42 * 2) The hash computation uses a table of random integers [Hanson97,
47 * With a table size of 512, the current implementation is sufficient for a
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
53 * and destroys the old table
159 __glxHashTablePtr table; local in function:__glxHashCreate
178 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashDestroy
201 HashFind(__glxHashTablePtr table,unsigned long key,unsigned long * h) argument
233 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashLookup
249 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashInsert
275 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashDelete
295 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashNext
313 __glxHashTablePtr table = (__glxHashTablePtr) t; local in function:__glxHashFirst
356 compute_dist(__glxHashTablePtr table) argument
377 check_table(__glxHashTablePtr table,unsigned long key,unsigned long value) argument
407 __glxHashTablePtr table; local in function:main
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/mesa/program/
H A Dsymbol_table.c35 * Link to the next symbol in the table with the same name
43 * Link to the next symbol in the table with the same scope
76 /** Hash table containing all symbols in the symbol table. */
87 _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table) argument
89 struct scope_level *const scope = table->current_scope;
92 table->current_scope = scope->next;
93 table->depth--;
99 struct hash_entry *hte = _mesa_hash_table_search(table->ht,
103 * the hash table t
119 _mesa_symbol_table_push_scope(struct _mesa_symbol_table * table) argument
134 find_symbol(struct _mesa_symbol_table * table,const char * name) argument
150 _mesa_symbol_table_symbol_scope(struct _mesa_symbol_table * table,const char * name) argument
165 _mesa_symbol_table_find_symbol(struct _mesa_symbol_table * table,const char * name) argument
177 _mesa_symbol_table_add_symbol(struct _mesa_symbol_table * table,const char * name,void * declaration) argument
217 _mesa_symbol_table_replace_symbol(struct _mesa_symbol_table * table,const char * name,void * declaration) argument
232 _mesa_symbol_table_add_global_symbol(struct _mesa_symbol_table * table,const char * name,void * declaration) argument
292 struct _mesa_symbol_table *table = calloc(1, sizeof(*table)); local in function:_mesa_symbol_table_ctor
306 _mesa_symbol_table_dtor(struct _mesa_symbol_table * table) argument
[all...]
H A Dsymbol_table.h32 extern void _mesa_symbol_table_push_scope(struct _mesa_symbol_table *table);
34 extern void _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table);
39 extern int _mesa_symbol_table_replace_symbol(struct _mesa_symbol_table *table,
48 extern int _mesa_symbol_table_symbol_scope(struct _mesa_symbol_table *table,
/xsrc/external/mit/MesaLib/dist/src/mesa/program/
H A Dsymbol_table.c35 * Link to the next symbol in the table with the same name
43 * Link to the next symbol in the table with the same scope
76 /** Hash table containing all symbols in the symbol table. */
87 _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table) argument
89 struct scope_level *const scope = table->current_scope;
92 table->current_scope = scope->next;
93 table->depth--;
99 struct hash_entry *hte = _mesa_hash_table_search(table->ht,
103 * the hash table t
119 _mesa_symbol_table_push_scope(struct _mesa_symbol_table * table) argument
134 find_symbol(struct _mesa_symbol_table * table,const char * name) argument
150 _mesa_symbol_table_symbol_scope(struct _mesa_symbol_table * table,const char * name) argument
165 _mesa_symbol_table_find_symbol(struct _mesa_symbol_table * table,const char * name) argument
177 _mesa_symbol_table_add_symbol(struct _mesa_symbol_table * table,const char * name,void * declaration) argument
217 _mesa_symbol_table_replace_symbol(struct _mesa_symbol_table * table,const char * name,void * declaration) argument
232 _mesa_symbol_table_add_global_symbol(struct _mesa_symbol_table * table,const char * name,void * declaration) argument
292 struct _mesa_symbol_table *table = calloc(1, sizeof(*table)); local in function:_mesa_symbol_table_ctor
306 _mesa_symbol_table_dtor(struct _mesa_symbol_table * table) argument
[all...]
H A Dsymbol_table.h32 extern void _mesa_symbol_table_push_scope(struct _mesa_symbol_table *table);
34 extern void _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table);
39 extern int _mesa_symbol_table_replace_symbol(struct _mesa_symbol_table *table,
48 extern int _mesa_symbol_table_symbol_scope(struct _mesa_symbol_table *table,
/xsrc/external/mit/MesaLib.old/dist/src/glx/tests/
H A Dindirect_api.cpp28 * Tests various apsects of the dispatch table generated by
31 * * No entry in the table should be \c NULL.
33 * * Entries in the table that correspond to "known" functions with GLX
36 * * Entries beyond the end of the "known" part of the table (i.e., entries
40 * * Entries in the table that correspond to "known" functions that lack
715 _glapi_proc *table; member in class:IndirectAPI
721 this->table = (_glapi_proc *) __glXNewIndirectAPI();
727 free(this->table);
728 this->table = NULL;
735 /* __glXNewIndirectAPI determines the size of the dispatch table b
740 _glapi_table *table = __glXNewIndirectAPI(); local in function:TEST_F
[all...]
/xsrc/external/mit/mkfontscale/dist/
H A Dhash.h36 void destroyHashTable(HashTablePtr table);
37 char *getHash(HashTablePtr table, const char *key);
38 int putHash(HashTablePtr table, char *key, char *value, int prio);
39 int hashElements(HashTablePtr table);
40 HashBucketPtr *hashArray(HashTablePtr table, int value_first);
/xsrc/external/mit/xf86-video-sunffb/dist/src/
H A Dffb_wid.c129 ffb_wid_pool_t *table = &p->wid_table; local in function:init_wid_table
132 for (i = 0; i < table->num_wids; i++) {
133 table->wid_pool[i].InUse = FALSE;
134 table->wid_pool[i].buffer = 0;
135 table->wid_pool[i].depth = 24;
136 table->wid_pool[i].greyscale = 0;
137 table->wid_pool[i].linear = 0;
138 table->wid_pool[i].direct = 0;
139 table->wid_pool[i].channel = 0;
140 table
153 ffb_wid_pool_t *table = &p->wid_table; local in function:init_hw_wids
236 ffb_wid_pool_t *table = &p->wid_table; local in function:FFBWidAlloc
324 ffb_wid_pool_t *table = &p->wid_table; local in function:FFBWidFree
342 ffb_wid_pool_t *table = &p->wid_table; local in function:FFBWidUnshare
383 ffb_wid_pool_t *table = &p->wid_table; local in function:FFBWidReshare
427 ffb_wid_pool_t *table = &p->wid_table; local in function:FFBWidChangeBuffer
[all...]
/xsrc/external/mit/freetype/dist/src/base/
H A Dftdbgmem.c226 ft_mem_table_alloc( FT_MemTable table, argument
229 FT_Memory memory = table->memory;
233 memory->user = table->memory_user;
234 block = table->alloc( memory, size );
235 memory->user = table;
242 ft_mem_table_free( FT_MemTable table, argument
245 FT_Memory memory = table->memory;
248 memory->user = table->memory_user;
249 table->free( memory, block );
250 memory->user = table;
255 ft_mem_table_resize(FT_MemTable table) argument
308 FT_MemTable table; local in function:ft_mem_table_new
346 ft_mem_table_destroy(FT_MemTable table) argument
428 ft_mem_table_get_nodep(FT_MemTable table,FT_Byte * address) argument
454 ft_mem_table_get_source(FT_MemTable table) argument
507 ft_mem_table_set(FT_MemTable table,FT_Byte * address,FT_Long size,FT_Long delta) argument
606 ft_mem_table_remove(FT_MemTable table,FT_Byte * address,FT_Long delta) argument
683 FT_MemTable table = (FT_MemTable)memory->user; local in function:ft_mem_debug_alloc
719 FT_MemTable table = (FT_MemTable)memory->user; local in function:ft_mem_debug_free
745 FT_MemTable table = (FT_MemTable)memory->user; local in function:ft_mem_debug_realloc
827 FT_MemTable table; local in function:ft_mem_debug_init
890 FT_MemTable table = (FT_MemTable)memory->user; local in function:ft_mem_debug_done
925 FT_MemTable table = (FT_MemTable)memory->user; local in function:FT_DumpMemory
[all...]
/xsrc/external/mit/libdrm/dist/tests/
H A Dhash.c1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
35 * 1) The table is power-of-two sized. Prime sized tables are more
37 * sized table, especially when double hashing is not used for collision
40 * 2) The hash computation uses a table of random integers [Hanson97,
45 * With a table size of 512, the current implementation is sufficient for a
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,
51 * and destroys the old table
104 compute_dist(HashTablePtr table) argument
124 check_table(HashTablePtr table,unsigned long key,void * value) argument
157 HashTablePtr table; local in function:main
[all...]
/xsrc/external/mit/libXpm/dist/src/
H A Dhashtab.c42 LFUNC(HashTableGrows, int, (xpmHashTable * table));
60 * hash table routines *
69 * HASH_TABLE_GROWS how hash table grows.
96 * The hash table is used to store atoms via their NAME:
111 xpmHashTable *table,
114 xpmHashAtom *atomTable = table->atomTable;
124 p = atomTable + hash % table->size;
131 p = atomTable + table->size - 1;
137 HashTableGrows(xpmHashTable *table) argument
139 xpmHashAtom *atomTable = table
110 xpmHashSlot(xpmHashTable * table,char * s) argument
173 xpmHashIntern(xpmHashTable * table,char * tag,void * data) argument
202 xpmHashTableInit(xpmHashTable * table) argument
227 xpmHashTableFree(xpmHashTable * table) argument
[all...]
/xsrc/external/mit/freetype/dist/src/gxvalid/
H A Dgxvmorx4.c5 * TrueTypeGX/AAT morx table validation
43 gxv_morx_subtable_type4_validate( FT_Bytes table, argument
50 gxv_mort_subtable_type4_validate( table, limit, gxvalid );
/xsrc/external/mit/freetype/dist/src/otvalid/
H A Dotvgpos.h5 * OpenType GPOS table validator (specification).
27 otv_GPOS_subtable_validate( FT_Bytes table,
/xsrc/external/mit/mesa-demos/dist/src/demos/
H A Dpaltex.c107 GLubyte table[256][4]; local in function:Init
114 /* load the color table for each texel-index */
115 memset(table, 0, 256*4);
116 table[' '][0] = 255;
117 table[' '][1] = 255;
118 table[' '][2] = 255;
119 table[' '][3] = 64;
120 table['M'][0] = 255;
121 table['M'][1] = 0;
122 table['
188 GLubyte table[256][4]; local in function:Init2
[all...]

Completed in 32 milliseconds

1234567891011>>