Merge commit 'origin/gallium-draw-retval'
[mesa.git] / src / gallium / auxiliary / draw / draw_vs.c
1 /**************************************************************************
2 *
3 * Copyright 2007 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 * Authors:
30 * Keith Whitwell <keith@tungstengraphics.com>
31 * Brian Paul
32 */
33
34 #include "util/u_math.h"
35 #include "util/u_memory.h"
36
37 #include "pipe/p_shader_tokens.h"
38
39 #include "draw_private.h"
40 #include "draw_context.h"
41 #include "draw_vs.h"
42
43 #include "translate/translate.h"
44 #include "translate/translate_cache.h"
45
46 #include "tgsi/tgsi_exec.h"
47
48
49
50
51 void draw_vs_set_constants( struct draw_context *draw,
52 const float (*constants)[4],
53 unsigned size )
54 {
55 if (((uintptr_t)constants) & 0xf) {
56 if (size > draw->vs.const_storage_size) {
57 if (draw->vs.aligned_constant_storage)
58 align_free((void *)draw->vs.aligned_constant_storage);
59 draw->vs.aligned_constant_storage = align_malloc( size, 16 );
60 }
61 memcpy( (void*)draw->vs.aligned_constant_storage,
62 constants,
63 size );
64 constants = draw->vs.aligned_constant_storage;
65 }
66
67 draw->vs.aligned_constants = constants;
68 draw_vs_aos_machine_constants( draw->vs.aos_machine, constants );
69 }
70
71
72 void draw_vs_set_viewport( struct draw_context *draw,
73 const struct pipe_viewport_state *viewport )
74 {
75 draw_vs_aos_machine_viewport( draw->vs.aos_machine, viewport );
76 }
77
78
79
80 struct draw_vertex_shader *
81 draw_create_vertex_shader(struct draw_context *draw,
82 const struct pipe_shader_state *shader)
83 {
84 struct draw_vertex_shader *vs;
85
86 vs = draw_create_vs_llvm( draw, shader );
87 if (!vs) {
88 vs = draw_create_vs_sse( draw, shader );
89 if (!vs) {
90 vs = draw_create_vs_ppc( draw, shader );
91 if (!vs) {
92 vs = draw_create_vs_exec( draw, shader );
93 }
94 }
95 }
96
97 if (vs)
98 {
99 uint i;
100 for (i = 0; i < vs->info.num_outputs; i++) {
101 if (vs->info.output_semantic_name[i] == TGSI_SEMANTIC_POSITION &&
102 vs->info.output_semantic_index[i] == 0)
103 vs->position_output = i;
104 else if (vs->info.output_semantic_name[i] == TGSI_SEMANTIC_EDGEFLAG &&
105 vs->info.output_semantic_index[i] == 0)
106 vs->edgeflag_output = i;
107 }
108 }
109
110 assert(vs);
111 return vs;
112 }
113
114
115 void
116 draw_bind_vertex_shader(struct draw_context *draw,
117 struct draw_vertex_shader *dvs)
118 {
119 draw_do_flush( draw, DRAW_FLUSH_STATE_CHANGE );
120
121 if (dvs)
122 {
123 draw->vs.vertex_shader = dvs;
124 draw->vs.num_vs_outputs = dvs->info.num_outputs;
125 draw->vs.position_output = dvs->position_output;
126 draw->vs.edgeflag_output = dvs->edgeflag_output;
127 dvs->prepare( dvs, draw );
128 }
129 else {
130 draw->vs.vertex_shader = NULL;
131 draw->vs.num_vs_outputs = 0;
132 }
133 }
134
135
136 void
137 draw_delete_vertex_shader(struct draw_context *draw,
138 struct draw_vertex_shader *dvs)
139 {
140 unsigned i;
141
142 for (i = 0; i < dvs->nr_varients; i++)
143 dvs->varient[i]->destroy( dvs->varient[i] );
144
145 dvs->nr_varients = 0;
146
147 dvs->delete( dvs );
148 }
149
150
151
152 boolean
153 draw_vs_init( struct draw_context *draw )
154 {
155 draw->vs.machine = tgsi_exec_machine_create();
156 if (!draw->vs.machine)
157 return FALSE;
158
159 draw->vs.emit_cache = translate_cache_create();
160 if (!draw->vs.emit_cache)
161 return FALSE;
162
163 draw->vs.fetch_cache = translate_cache_create();
164 if (!draw->vs.fetch_cache)
165 return FALSE;
166
167 draw->vs.aos_machine = draw_vs_aos_machine();
168 #ifdef PIPE_ARCH_X86
169 if (!draw->vs.aos_machine)
170 return FALSE;
171 #endif
172
173 return TRUE;
174 }
175
176 void
177 draw_vs_destroy( struct draw_context *draw )
178 {
179 if (draw->vs.fetch_cache)
180 translate_cache_destroy(draw->vs.fetch_cache);
181
182 if (draw->vs.emit_cache)
183 translate_cache_destroy(draw->vs.emit_cache);
184
185 if (draw->vs.aos_machine)
186 draw_vs_aos_machine_destroy(draw->vs.aos_machine);
187
188 if (draw->vs.aligned_constant_storage)
189 align_free((void*)draw->vs.aligned_constant_storage);
190
191 tgsi_exec_machine_destroy(draw->vs.machine);
192 }
193
194
195 struct draw_vs_varient *
196 draw_vs_lookup_varient( struct draw_vertex_shader *vs,
197 const struct draw_vs_varient_key *key )
198 {
199 struct draw_vs_varient *varient;
200 unsigned i;
201
202 /* Lookup existing varient:
203 */
204 for (i = 0; i < vs->nr_varients; i++)
205 if (draw_vs_varient_key_compare(key, &vs->varient[i]->key) == 0)
206 return vs->varient[i];
207
208 /* Else have to create a new one:
209 */
210 varient = vs->create_varient( vs, key );
211 if (varient == NULL)
212 return NULL;
213
214 /* Add it to our list, could be smarter:
215 */
216 if (vs->nr_varients < Elements(vs->varient)) {
217 vs->varient[vs->nr_varients++] = varient;
218 }
219 else {
220 vs->last_varient++;
221 vs->last_varient %= Elements(vs->varient);
222 vs->varient[vs->last_varient]->destroy(vs->varient[vs->last_varient]);
223 vs->varient[vs->last_varient] = varient;
224 }
225
226 /* Done
227 */
228 return varient;
229 }
230
231
232 struct translate *
233 draw_vs_get_fetch( struct draw_context *draw,
234 struct translate_key *key )
235 {
236 if (!draw->vs.fetch ||
237 translate_key_compare(&draw->vs.fetch->key, key) != 0)
238 {
239 translate_key_sanitize(key);
240 draw->vs.fetch = translate_cache_find(draw->vs.fetch_cache, key);
241 }
242
243 return draw->vs.fetch;
244 }
245
246 struct translate *
247 draw_vs_get_emit( struct draw_context *draw,
248 struct translate_key *key )
249 {
250 if (!draw->vs.emit ||
251 translate_key_compare(&draw->vs.emit->key, key) != 0)
252 {
253 translate_key_sanitize(key);
254 draw->vs.emit = translate_cache_find(draw->vs.emit_cache, key);
255 }
256
257 return draw->vs.emit;
258 }