st/mesa: atomize vertex array state
[mesa.git] / src / mesa / state_tracker / st_atom.c
1 /**************************************************************************
2 *
3 * Copyright 2003 Tungsten Graphics, Inc., Cedar Park, Texas.
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
16 * of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 **************************************************************************/
27
28
29 #include "main/glheader.h"
30 #include "main/context.h"
31
32 #include "pipe/p_defines.h"
33 #include "st_context.h"
34 #include "st_atom.h"
35 #include "st_cb_bitmap.h"
36 #include "st_program.h"
37 #include "st_manager.h"
38
39
40 /**
41 * This is used to initialize st->atoms[].
42 */
43 static const struct st_tracked_state *atoms[] =
44 {
45 &st_update_depth_stencil_alpha,
46 &st_update_clip,
47
48 &st_finalize_textures,
49 &st_update_fp,
50 &st_update_gp,
51 &st_update_vp,
52
53 &st_update_rasterizer,
54 &st_update_polygon_stipple,
55 &st_update_viewport,
56 &st_update_scissor,
57 &st_update_blend,
58 &st_update_sampler,
59 &st_update_vertex_texture,
60 &st_update_texture,
61 &st_update_framebuffer,
62 &st_update_msaa,
63 &st_update_vs_constants,
64 &st_update_gs_constants,
65 &st_update_fs_constants,
66 &st_update_pixel_transfer,
67
68 /* this must be done after the vertex program update */
69 &st_update_array
70 };
71
72
73 void st_init_atoms( struct st_context *st )
74 {
75 /* no-op */
76 }
77
78
79 void st_destroy_atoms( struct st_context *st )
80 {
81 /* no-op */
82 }
83
84
85 /***********************************************************************
86 */
87
88 static GLboolean check_state( const struct st_state_flags *a,
89 const struct st_state_flags *b )
90 {
91 return ((a->mesa & b->mesa) ||
92 (a->st & b->st));
93 }
94
95 static void accumulate_state( struct st_state_flags *a,
96 const struct st_state_flags *b )
97 {
98 a->mesa |= b->mesa;
99 a->st |= b->st;
100 }
101
102
103 static void xor_states( struct st_state_flags *result,
104 const struct st_state_flags *a,
105 const struct st_state_flags *b )
106 {
107 result->mesa = a->mesa ^ b->mesa;
108 result->st = a->st ^ b->st;
109 }
110
111
112 /* Too complex to figure out, just check every time:
113 */
114 static void check_program_state( struct st_context *st )
115 {
116 struct gl_context *ctx = st->ctx;
117
118 if (ctx->VertexProgram._Current != &st->vp->Base)
119 st->dirty.st |= ST_NEW_VERTEX_PROGRAM;
120
121 if (ctx->FragmentProgram._Current != &st->fp->Base)
122 st->dirty.st |= ST_NEW_FRAGMENT_PROGRAM;
123
124 if (ctx->GeometryProgram._Current != &st->gp->Base)
125 st->dirty.st |= ST_NEW_GEOMETRY_PROGRAM;
126 }
127
128 static void check_attrib_edgeflag(struct st_context *st)
129 {
130 const struct gl_client_array **arrays = st->ctx->Array._DrawArrays;
131 GLboolean vertDataEdgeFlags;
132
133 if (!arrays)
134 return;
135
136 vertDataEdgeFlags = arrays[VERT_ATTRIB_EDGEFLAG]->BufferObj &&
137 arrays[VERT_ATTRIB_EDGEFLAG]->BufferObj->Name;
138 if (vertDataEdgeFlags != st->vertdata_edgeflags) {
139 st->vertdata_edgeflags = vertDataEdgeFlags;
140 st->dirty.st |= ST_NEW_EDGEFLAGS_DATA;
141 }
142 }
143
144
145 /***********************************************************************
146 * Update all derived state:
147 */
148
149 void st_validate_state( struct st_context *st )
150 {
151 struct st_state_flags *state = &st->dirty;
152 GLuint i;
153
154 /* Get Mesa driver state. */
155 st->dirty.st |= st->ctx->NewDriverState;
156 st->ctx->NewDriverState = 0;
157
158 check_attrib_edgeflag(st);
159
160 /* The bitmap cache is immune to pixel unpack changes.
161 * Note that GLUT makes several calls to glPixelStore for each
162 * bitmap char it draws so this is an important check.
163 */
164 if (state->mesa & ~_NEW_PACKUNPACK)
165 st_flush_bitmap_cache(st);
166
167 check_program_state( st );
168
169 st_manager_validate_framebuffers(st);
170
171 if (state->st == 0)
172 return;
173
174 /*printf("%s %x/%x\n", __FUNCTION__, state->mesa, state->st);*/
175
176 #ifdef DEBUG
177 if (1) {
178 #else
179 if (0) {
180 #endif
181 /* Debug version which enforces various sanity checks on the
182 * state flags which are generated and checked to help ensure
183 * state atoms are ordered correctly in the list.
184 */
185 struct st_state_flags examined, prev;
186 memset(&examined, 0, sizeof(examined));
187 prev = *state;
188
189 for (i = 0; i < Elements(atoms); i++) {
190 const struct st_tracked_state *atom = atoms[i];
191 struct st_state_flags generated;
192
193 /*printf("atom %s %x/%x\n", atom->name, atom->dirty.mesa, atom->dirty.st);*/
194
195 if (!(atom->dirty.mesa || atom->dirty.st) ||
196 !atom->update) {
197 printf("malformed atom %s\n", atom->name);
198 assert(0);
199 }
200
201 if (check_state(state, &atom->dirty)) {
202 atoms[i]->update( st );
203 /*printf("after: %x\n", atom->dirty.mesa);*/
204 }
205
206 accumulate_state(&examined, &atom->dirty);
207
208 /* generated = (prev ^ state)
209 * if (examined & generated)
210 * fail;
211 */
212 xor_states(&generated, &prev, state);
213 assert(!check_state(&examined, &generated));
214 prev = *state;
215 }
216 /*printf("\n");*/
217
218 }
219 else {
220 for (i = 0; i < Elements(atoms); i++) {
221 if (check_state(state, &atoms[i]->dirty))
222 atoms[i]->update( st );
223 }
224 }
225
226 memset(state, 0, sizeof(*state));
227 }
228
229
230