| /xsrc/external/mit/MesaLib/src/mapi/glapi/gen/ |
| marshal_generated0.c | 1339 struct _glapi_table *table; local
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_ListBase] = (_glapi_proc)_mesa_marshal_ListBase
[all...] |
| indirect_init.c | 31 * Initialize indirect rendering dispatch table.
55 * Create and initialize a new GL dispatch table. The table is initialized
60 _glapi_proc *table; local
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[7] = (_glapi_proc) __indirect_glBegin
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/compiler/glsl/ |
| glsl_symbol_table.h | 40 * type safe and some symbol table invariants.
60 * \name Methods to add symbols to the table
81 * \name Methods to get symbols from the table
94 * in the symbol table. This is necessary when gl_PerVertex is redeclared,
108 struct _mesa_symbol_table *table; member in struct:glsl_symbol_table
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/ |
| glsl_symbol_table.h | 40 * type safe and some symbol table invariants.
60 * \name Methods to add symbols to the table
81 * \name Methods to get symbols from the table
94 * in the symbol table. This is necessary when gl_PerVertex is redeclared,
108 struct _mesa_symbol_table *table; member in struct:glsl_symbol_table
|
| /xsrc/external/mit/MesaLib.old/src/mapi/glapi/ |
| indirect_init.c | 31 * Initialize indirect rendering dispatch table.
55 * Create and initialize a new GL dispatch table. The table is initialized
60 _glapi_proc *table; local
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[7] = (_glapi_proc) __indirect_glBegin
[all...] |
| /xsrc/external/mit/freetype/dist/src/psaux/ |
| psobjs.h | 50 ps_table_new( PS_Table table,
55 ps_table_add( PS_Table table,
61 ps_table_done( PS_Table table ); variable
65 ps_table_release( PS_Table table ); variable
|
| /xsrc/external/mit/libXmu/dist/src/ |
| CursorName.c | 121 register _Xconst struct _CursorName *table; local
128 for (i=0, table=cursor_names; i < NUM_CURSOR_NAMES; i++, table++ ) {
129 if (strcmp(tmp, table->name) == 0) return table->shape;
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/crocus/ |
| crocus_formats.c | 40 static const enum isl_format table[PIPE_FORMAT_COUNT] = { local
300 return table[pf];
|
| /xsrc/external/mit/MesaLib/src/mesa/ |
| get_hash.h | 2225 #define table(api) (*table_set[api]) macro
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/iris/ |
| iris_formats.c | 40 static const enum isl_format table[PIPE_FORMAT_COUNT] = { local
320 return table[pf];
|
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| set.h | 45 struct set_entry *table; member in struct:set
|
| /xsrc/external/mit/MesaLib.old/src/mesa/ |
| get_hash.h | 2219 #define table(api) (*table_set[api]) macro
|
| /xsrc/external/mit/libX11/dist/src/ |
| Xintatom.h | 22 Entry table[TABLESIZE]; member in struct:_XDisplayAtoms
|
| /xsrc/external/mit/libdrm/dist/tests/ |
| hash.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
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. The approach in [Larson88] is superior i
157 HashTablePtr table; local
[all...] |
| /xsrc/external/mit/mesa-demos/dist/src/demos/ |
| paltex.c | 107 GLubyte table[256][4]; local
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['M'][2] = 0
188 GLubyte table[256][4]; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/glx/ |
| singlepix.c | 118 const _glapi_proc *const table = (_glapi_proc *) GET_DISPATCH(); local
120 (PFNGLGETSEPARABLEFILTEREXTPROC) table[359];
|
| /xsrc/external/mit/MesaLib/dist/src/mapi/glapi/ |
| glapi_nop.c | 28 * No-op dispatch table.
30 * This file defines a special dispatch table which is loaded with no-op
36 * In the past, the dispatch table was loaded with pointers to a single
113 * Defines for the table of no-op entry points.
122 /** Return pointer to new dispatch table filled with no-op functions */
126 struct _glapi_table *table = malloc(num_entries * sizeof(_glapi_proc)); local
127 if (table) {
128 memcpy(table, __glapi_noop_table,
131 return table;
|
| /xsrc/external/mit/MesaLib/dist/src/mesa/drivers/dri/i965/ |
| brw_surface_formats.c | 34 /* This table is ordered according to the enum ordering in formats.h. We do
39 static const enum isl_format table[MESA_FORMAT_COUNT] = { local
203 return table[mesa_format];
313 /* We will check this table for FBO completeness, but the surface format
314 * table above only covered color rendering.
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| set.h | 45 struct set_entry *table; member in struct:set
138 * This foreach function destroys the table as it iterates.
|
| /xsrc/external/mit/MesaLib.old/dist/src/glx/ |
| singlepix.c | 118 const _glapi_proc *const table = (_glapi_proc *) GET_DISPATCH(); local
120 (PFNGLGETSEPARABLEFILTEREXTPROC) table[359];
|
| /xsrc/external/mit/MesaLib.old/dist/src/mapi/glapi/ |
| glapi_nop.c | 28 * No-op dispatch table.
30 * This file defines a special dispatch table which is loaded with no-op
36 * In the past, the dispatch table was loaded with pointers to a single
113 * Defines for the table of no-op entry points.
122 /** Return pointer to new dispatch table filled with no-op functions */
126 struct _glapi_table *table = malloc(num_entries * sizeof(_glapi_proc)); local
127 if (table) {
128 memcpy(table, __glapi_noop_table,
131 return table;
|
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/drivers/dri/i965/ |
| brw_surface_formats.c | 34 /* This table is ordered according to the enum ordering in formats.h. We do
39 static const enum isl_format table[MESA_FORMAT_COUNT] = { local
203 return table[mesa_format];
309 /* We will check this table for FBO completeness, but the surface format
310 * table above only covered color rendering.
|
| /xsrc/external/mit/freetype/dist/src/gzip/ |
| zutil.c | 75 local ptr_table table[MAX_PTR]; variable
76 /* This table is used to remember the original form of pointers
78 * Since MSDOS is not a preemptive multitasking OS, this table is not
98 table[next_ptr].org_ptr = buf;
103 table[next_ptr++].new_ptr = buf;
116 if (ptr != table[n].new_ptr) continue;
118 farfree(table[n].org_ptr);
120 table[n-1] = table[n];
|
| /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
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. The approach in [Larson88] is superior i
107 HashTablePtr table; local
118 HashTablePtr table = (HashTablePtr)t; local
169 HashTablePtr table = (HashTablePtr)t; local
182 HashTablePtr table = (HashTablePtr)t; local
201 HashTablePtr table = (HashTablePtr)t; local
218 HashTablePtr table = (HashTablePtr)t; local
235 HashTablePtr table = (HashTablePtr)t; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/mapi/ |
| mapi_glapi.c | 33 #include "table.h" /* for MAPI_TABLE_NUM_SLOTS */
72 * Return size of dispatch table struct as number of functions (or
100 * The offset in the dispatch table of the named function. A pointer to the
206 * Return offset of entrypoint for named function within dispatch table.
238 /** Return pointer to new dispatch table filled with no-op functions */
242 struct _glapi_table *table; local
247 table = malloc(num_entries * sizeof(mapi_func));
248 if (table) {
249 memcpy(table, table_noop_array, num_entries * sizeof(mapi_func));
251 return table;
[all...] |
