projects / mesa.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
Merge branch 'gallium-0.1' into gallium-tex-surfaces
[mesa.git] / src / mesa / shader / slang / slang_codegen.c
1 /*
2 * Mesa 3-D graphics library
3 * Version: 7.1
4 *
5 * Copyright (C) 2005-2007 Brian Paul All Rights Reserved.
6 *
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the "Software"),
9 * to deal in the Software without restriction, including without limitation
10 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
11 * and/or sell copies of the Software, and to permit persons to whom the
12 * Software is furnished to do so, subject to the following conditions:
13 *
14 * The above copyright notice and this permission notice shall be included
15 * in all copies or substantial portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
18 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
21 * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
22 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
23 */
24
25 /**
26 * \file slang_codegen.c
27 * Generate IR tree from AST.
28 * \author Brian Paul
29 */
30
31
32 /***
33 *** NOTES:
34 *** The new_() functions return a new instance of a simple IR node.
35 *** The gen_() functions generate larger IR trees from the simple nodes.
36 ***/
37
38
39
40 #include "main/imports.h"
41 #include "main/macros.h"
42 #include "main/mtypes.h"
43 #include "shader/program.h"
44 #include "shader/prog_instruction.h"
45 #include "shader/prog_parameter.h"
46 #include "shader/prog_statevars.h"
47 #include "slang_typeinfo.h"
48 #include "slang_codegen.h"
49 #include "slang_compile.h"
50 #include "slang_label.h"
51 #include "slang_mem.h"
52 #include "slang_simplify.h"
53 #include "slang_emit.h"
54 #include "slang_vartable.h"
55 #include "slang_ir.h"
56 #include "slang_print.h"
57
58
59 static slang_ir_node *
60 _slang_gen_operation(slang_assemble_ctx * A, slang_operation *oper);
61
62
63 static GLboolean
64 is_sampler_type(const slang_fully_specified_type *t)
65 {
66 switch (t->specifier.type) {
67 case SLANG_SPEC_SAMPLER1D:
68 case SLANG_SPEC_SAMPLER2D:
69 case SLANG_SPEC_SAMPLER3D:
70 case SLANG_SPEC_SAMPLERCUBE:
71 case SLANG_SPEC_SAMPLER1DSHADOW:
72 case SLANG_SPEC_SAMPLER2DSHADOW:
73 case SLANG_SPEC_SAMPLER2DRECT:
74 case SLANG_SPEC_SAMPLER2DRECTSHADOW:
75 return GL_TRUE;
76 default:
77 return GL_FALSE;
78 }
79 }
80
81
82 /**
83 * Return the offset (in floats or ints) of the named field within
84 * the given struct. Return -1 if field not found.
85 * If field is NULL, return the size of the struct instead.
86 */
87 static GLint
88 _slang_field_offset(const slang_type_specifier *spec, slang_atom field)
89 {
90 GLint offset = 0;
91 GLuint i;
92 for (i = 0; i < spec->_struct->fields->num_variables; i++) {
93 const slang_variable *v = spec->_struct->fields->variables[i];
94 const GLuint sz = _slang_sizeof_type_specifier(&v->type.specifier);
95 if (sz > 1) {
96 /* types larger than 1 float are register (4-float) aligned */
97 offset = (offset + 3) & ~3;
98 }
99 if (field && v->a_name == field) {
100 return offset;
101 }
102 offset += sz;
103 }
104 if (field)
105 return -1; /* field not found */
106 else
107 return offset; /* struct size */
108 }
109
110
111 /**
112 * Return the size (in floats) of the given type specifier.
113 * If the size is greater than 4, the size should be a multiple of 4
114 * so that the correct number of 4-float registers are allocated.
115 * For example, a mat3x2 is size 12 because we want to store the
116 * 3 columns in 3 float[4] registers.
117 */
118 GLuint
119 _slang_sizeof_type_specifier(const slang_type_specifier *spec)
120 {
121 GLuint sz;
122 switch (spec->type) {
123 case SLANG_SPEC_VOID:
124 sz = 0;
125 break;
126 case SLANG_SPEC_BOOL:
127 sz = 1;
128 break;
129 case SLANG_SPEC_BVEC2:
130 sz = 2;
131 break;
132 case SLANG_SPEC_BVEC3:
133 sz = 3;
134 break;
135 case SLANG_SPEC_BVEC4:
136 sz = 4;
137 break;
138 case SLANG_SPEC_INT:
139 sz = 1;
140 break;
141 case SLANG_SPEC_IVEC2:
142 sz = 2;
143 break;
144 case SLANG_SPEC_IVEC3:
145 sz = 3;
146 break;
147 case SLANG_SPEC_IVEC4:
148 sz = 4;
149 break;
150 case SLANG_SPEC_FLOAT:
151 sz = 1;
152 break;
153 case SLANG_SPEC_VEC2:
154 sz = 2;
155 break;
156 case SLANG_SPEC_VEC3:
157 sz = 3;
158 break;
159 case SLANG_SPEC_VEC4:
160 sz = 4;
161 break;
162 case SLANG_SPEC_MAT2:
163 sz = 2 * 4; /* 2 columns (regs) */
164 break;
165 case SLANG_SPEC_MAT3:
166 sz = 3 * 4;
167 break;
168 case SLANG_SPEC_MAT4:
169 sz = 4 * 4;
170 break;
171 case SLANG_SPEC_MAT23:
172 sz = 2 * 4; /* 2 columns (regs) */
173 break;
174 case SLANG_SPEC_MAT32:
175 sz = 3 * 4; /* 3 columns (regs) */
176 break;
177 case SLANG_SPEC_MAT24:
178 sz = 2 * 4;
179 break;
180 case SLANG_SPEC_MAT42:
181 sz = 4 * 4; /* 4 columns (regs) */
182 break;
183 case SLANG_SPEC_MAT34:
184 sz = 3 * 4;
185 break;
186 case SLANG_SPEC_MAT43:
187 sz = 4 * 4; /* 4 columns (regs) */
188 break;
189 case SLANG_SPEC_SAMPLER1D:
190 case SLANG_SPEC_SAMPLER2D:
191 case SLANG_SPEC_SAMPLER3D:
192 case SLANG_SPEC_SAMPLERCUBE:
193 case SLANG_SPEC_SAMPLER1DSHADOW:
194 case SLANG_SPEC_SAMPLER2DSHADOW:
195 case SLANG_SPEC_SAMPLER2DRECT:
196 case SLANG_SPEC_SAMPLER2DRECTSHADOW:
197 sz = 1; /* a sampler is basically just an integer index */
198 break;
199 case SLANG_SPEC_STRUCT:
200 sz = _slang_field_offset(spec, 0); /* special use */
201 if (sz > 4) {
202 sz = (sz + 3) & ~0x3; /* round up to multiple of four */
203 }
204 break;
205 case SLANG_SPEC_ARRAY:
206 sz = _slang_sizeof_type_specifier(spec->_array);
207 break;
208 default:
209 _mesa_problem(NULL, "Unexpected type in _slang_sizeof_type_specifier()");
210 sz = 0;
211 }
212
213 if (sz > 4) {
214 /* if size is > 4, it should be a multiple of four */
215 assert((sz & 0x3) == 0);
216 }
217 return sz;
218 }
219
220
221 /**
222 * Establish the binding between a slang_ir_node and a slang_variable.
223 * Then, allocate/attach a slang_ir_storage object to the IR node if needed.
224 * The IR node must be a IR_VAR or IR_VAR_DECL node.
225 * \param n the IR node
226 * \param var the variable to associate with the IR node
227 */
228 static void
229 _slang_attach_storage(slang_ir_node *n, slang_variable *var)
230 {
231 assert(n);
232 assert(var);
233 assert(n->Opcode == IR_VAR || n->Opcode == IR_VAR_DECL);
234 assert(!n->Var || n->Var == var);
235
236 n->Var = var;
237
238 if (!n->Store) {
239 /* need to setup storage */
240 if (n->Var && n->Var->aux) {
241 /* node storage info = var storage info */
242 n->Store = (slang_ir_storage *) n->Var->aux;
243 }
244 else {
245 /* alloc new storage info */
246 n->Store = _slang_new_ir_storage(PROGRAM_UNDEFINED, -1, -5);
247 if (n->Var)
248 n->Var->aux = n->Store;
249 assert(n->Var->aux);
250 }
251 }
252 }
253
254
255 /**
256 * Return the TEXTURE_*_INDEX value that corresponds to a sampler type,
257 * or -1 if the type is not a sampler.
258 */
259 static GLint
260 sampler_to_texture_index(const slang_type_specifier_type type)
261 {
262 switch (type) {
263 case SLANG_SPEC_SAMPLER1D:
264 return TEXTURE_1D_INDEX;
265 case SLANG_SPEC_SAMPLER2D:
266 return TEXTURE_2D_INDEX;
267 case SLANG_SPEC_SAMPLER3D:
268 return TEXTURE_3D_INDEX;
269 case SLANG_SPEC_SAMPLERCUBE:
270 return TEXTURE_CUBE_INDEX;
271 case SLANG_SPEC_SAMPLER1DSHADOW:
272 return TEXTURE_1D_INDEX; /* XXX fix */
273 case SLANG_SPEC_SAMPLER2DSHADOW:
274 return TEXTURE_2D_INDEX; /* XXX fix */
275 case SLANG_SPEC_SAMPLER2DRECT:
276 return TEXTURE_RECT_INDEX;
277 case SLANG_SPEC_SAMPLER2DRECTSHADOW:
278 return TEXTURE_RECT_INDEX; /* XXX fix */
279 default:
280 return -1;
281 }
282 }
283
284
285 #define SWIZZLE_ZWWW MAKE_SWIZZLE4(SWIZZLE_Z, SWIZZLE_W, SWIZZLE_W, SWIZZLE_W)
286
287 /**
288 * Return the VERT_ATTRIB_* or FRAG_ATTRIB_* value that corresponds to
289 * a vertex or fragment program input variable. Return -1 if the input
290 * name is invalid.
291 * XXX return size too
292 */
293 static GLint
294 _slang_input_index(const char *name, GLenum target, GLuint *swizzleOut)
295 {
296 struct input_info {
297 const char *Name;
298 GLuint Attrib;
299 GLuint Swizzle;
300 };
301 static const struct input_info vertInputs[] = {
302 { "gl_Vertex", VERT_ATTRIB_POS, SWIZZLE_NOOP },
303 { "gl_Normal", VERT_ATTRIB_NORMAL, SWIZZLE_NOOP },
304 { "gl_Color", VERT_ATTRIB_COLOR0, SWIZZLE_NOOP },
305 { "gl_SecondaryColor", VERT_ATTRIB_COLOR1, SWIZZLE_NOOP },
306 { "gl_FogCoord", VERT_ATTRIB_FOG, SWIZZLE_XXXX },
307 { "gl_MultiTexCoord0", VERT_ATTRIB_TEX0, SWIZZLE_NOOP },
308 { "gl_MultiTexCoord1", VERT_ATTRIB_TEX1, SWIZZLE_NOOP },
309 { "gl_MultiTexCoord2", VERT_ATTRIB_TEX2, SWIZZLE_NOOP },
310 { "gl_MultiTexCoord3", VERT_ATTRIB_TEX3, SWIZZLE_NOOP },
311 { "gl_MultiTexCoord4", VERT_ATTRIB_TEX4, SWIZZLE_NOOP },
312 { "gl_MultiTexCoord5", VERT_ATTRIB_TEX5, SWIZZLE_NOOP },
313 { "gl_MultiTexCoord6", VERT_ATTRIB_TEX6, SWIZZLE_NOOP },
314 { "gl_MultiTexCoord7", VERT_ATTRIB_TEX7, SWIZZLE_NOOP },
315 { NULL, 0, SWIZZLE_NOOP }
316 };
317 static const struct input_info fragInputs[] = {
318 { "gl_FragCoord", FRAG_ATTRIB_WPOS, SWIZZLE_NOOP },
319 { "gl_Color", FRAG_ATTRIB_COL0, SWIZZLE_NOOP },
320 { "gl_SecondaryColor", FRAG_ATTRIB_COL1, SWIZZLE_NOOP },
321 { "gl_TexCoord", FRAG_ATTRIB_TEX0, SWIZZLE_NOOP },
322 /* note: we're packing several quantities into the fogcoord vector */
323 { "gl_FogFragCoord", FRAG_ATTRIB_FOGC, SWIZZLE_XXXX },
324 { "gl_FrontFacing", FRAG_ATTRIB_FOGC, SWIZZLE_YYYY }, /*XXX*/
325 { "gl_PointCoord", FRAG_ATTRIB_FOGC, SWIZZLE_ZWWW },
326 { NULL, 0, SWIZZLE_NOOP }
327 };
328 GLuint i;
329 const struct input_info *inputs
330 = (target == GL_VERTEX_PROGRAM_ARB) ? vertInputs : fragInputs;
331
332 ASSERT(MAX_TEXTURE_UNITS == 8); /* if this fails, fix vertInputs above */
333
334 for (i = 0; inputs[i].Name; i++) {
335 if (strcmp(inputs[i].Name, name) == 0) {
336 /* found */
337 *swizzleOut = inputs[i].Swizzle;
338 return inputs[i].Attrib;
339 }
340 }
341 return -1;
342 }
343
344
345 /**
346 * Return the VERT_RESULT_* or FRAG_RESULT_* value that corresponds to
347 * a vertex or fragment program output variable. Return -1 for an invalid
348 * output name.
349 */
350 static GLint
351 _slang_output_index(const char *name, GLenum target)
352 {
353 struct output_info {
354 const char *Name;
355 GLuint Attrib;
356 };
357 static const struct output_info vertOutputs[] = {
358 { "gl_Position", VERT_RESULT_HPOS },
359 { "gl_FrontColor", VERT_RESULT_COL0 },
360 { "gl_BackColor", VERT_RESULT_BFC0 },
361 { "gl_FrontSecondaryColor", VERT_RESULT_COL1 },
362 { "gl_BackSecondaryColor", VERT_RESULT_BFC1 },
363 { "gl_TexCoord", VERT_RESULT_TEX0 },
364 { "gl_FogFragCoord", VERT_RESULT_FOGC },
365 { "gl_PointSize", VERT_RESULT_PSIZ },
366 { NULL, 0 }
367 };
368 static const struct output_info fragOutputs[] = {
369 { "gl_FragColor", FRAG_RESULT_COLR },
370 { "gl_FragDepth", FRAG_RESULT_DEPR },
371 { "gl_FragData", FRAG_RESULT_DATA0 },
372 { NULL, 0 }
373 };
374 GLuint i;
375 const struct output_info *outputs
376 = (target == GL_VERTEX_PROGRAM_ARB) ? vertOutputs : fragOutputs;
377
378 for (i = 0; outputs[i].Name; i++) {
379 if (strcmp(outputs[i].Name, name) == 0) {
380 /* found */
381 return outputs[i].Attrib;
382 }
383 }
384 return -1;
385 }
386
387
388
389 /**********************************************************************/
390
391
392 /**
393 * Map "_asm foo" to IR_FOO, etc.
394 */
395 typedef struct
396 {
397 const char *Name;
398 slang_ir_opcode Opcode;
399 GLuint HaveRetValue, NumParams;
400 } slang_asm_info;
401
402
403 static slang_asm_info AsmInfo[] = {
404 /* vec4 binary op */
405 { "vec4_add", IR_ADD, 1, 2 },
406 { "vec4_subtract", IR_SUB, 1, 2 },
407 { "vec4_multiply", IR_MUL, 1, 2 },
408 { "vec4_dot", IR_DOT4, 1, 2 },
409 { "vec3_dot", IR_DOT3, 1, 2 },
410 { "vec3_cross", IR_CROSS, 1, 2 },
411 { "vec4_lrp", IR_LRP, 1, 3 },
412 { "vec4_min", IR_MIN, 1, 2 },
413 { "vec4_max", IR_MAX, 1, 2 },
414 { "vec4_clamp", IR_CLAMP, 1, 3 },
415 { "vec4_seq", IR_SEQUAL, 1, 2 },
416 { "vec4_sne", IR_SNEQUAL, 1, 2 },
417 { "vec4_sge", IR_SGE, 1, 2 },
418 { "vec4_sgt", IR_SGT, 1, 2 },
419 { "vec4_sle", IR_SLE, 1, 2 },
420 { "vec4_slt", IR_SLT, 1, 2 },
421 /* vec4 unary */
422 { "vec4_floor", IR_FLOOR, 1, 1 },
423 { "vec4_frac", IR_FRAC, 1, 1 },
424 { "vec4_abs", IR_ABS, 1, 1 },
425 { "vec4_negate", IR_NEG, 1, 1 },
426 { "vec4_ddx", IR_DDX, 1, 1 },
427 { "vec4_ddy", IR_DDY, 1, 1 },
428 /* float binary op */
429 { "float_power", IR_POW, 1, 2 },
430 /* texture / sampler */
431 { "vec4_tex1d", IR_TEX, 1, 2 },
432 { "vec4_texb1d", IR_TEXB, 1, 2 }, /* 1d w/ bias */
433 { "vec4_texp1d", IR_TEXP, 1, 2 }, /* 1d w/ projection */
434 { "vec4_tex2d", IR_TEX, 1, 2 },
435 { "vec4_texb2d", IR_TEXB, 1, 2 }, /* 2d w/ bias */
436 { "vec4_texp2d", IR_TEXP, 1, 2 }, /* 2d w/ projection */
437 { "vec4_tex3d", IR_TEX, 1, 2 },
438 { "vec4_texb3d", IR_TEXB, 1, 2 }, /* 3d w/ bias */
439 { "vec4_texp3d", IR_TEXP, 1, 2 }, /* 3d w/ projection */
440 { "vec4_texcube", IR_TEX, 1, 2 }, /* cubemap */
441 { "vec4_tex_rect", IR_TEX, 1, 2 }, /* rectangle */
442 { "vec4_texp_rect", IR_TEX, 1, 2 },/* rectangle w/ projection */
443
444 /* unary op */
445 { "int_to_float", IR_I_TO_F, 1, 1 },
446 { "float_to_int", IR_F_TO_I, 1, 1 },
447 { "float_exp", IR_EXP, 1, 1 },
448 { "float_exp2", IR_EXP2, 1, 1 },
449 { "float_log2", IR_LOG2, 1, 1 },
450 { "float_rsq", IR_RSQ, 1, 1 },
451 { "float_rcp", IR_RCP, 1, 1 },
452 { "float_sine", IR_SIN, 1, 1 },
453 { "float_cosine", IR_COS, 1, 1 },
454 { "float_noise1", IR_NOISE1, 1, 1},
455 { "float_noise2", IR_NOISE2, 1, 1},
456 { "float_noise3", IR_NOISE3, 1, 1},
457 { "float_noise4", IR_NOISE4, 1, 1},
458
459 { NULL, IR_NOP, 0, 0 }
460 };
461
462
463 static slang_ir_node *
464 new_node3(slang_ir_opcode op,
465 slang_ir_node *c0, slang_ir_node *c1, slang_ir_node *c2)
466 {
467 slang_ir_node *n = (slang_ir_node *) _slang_alloc(sizeof(slang_ir_node));
468 if (n) {
469 n->Opcode = op;
470 n->Children[0] = c0;
471 n->Children[1] = c1;
472 n->Children[2] = c2;
473 n->Writemask = WRITEMASK_XYZW;
474 n->InstLocation = -1;
475 }
476 return n;
477 }
478
479 static slang_ir_node *
480 new_node2(slang_ir_opcode op, slang_ir_node *c0, slang_ir_node *c1)
481 {
482 return new_node3(op, c0, c1, NULL);
483 }
484
485 static slang_ir_node *
486 new_node1(slang_ir_opcode op, slang_ir_node *c0)
487 {
488 return new_node3(op, c0, NULL, NULL);
489 }
490
491 static slang_ir_node *
492 new_node0(slang_ir_opcode op)
493 {
494 return new_node3(op, NULL, NULL, NULL);
495 }
496
497
498 /**
499 * Create sequence of two nodes.
500 */
501 static slang_ir_node *
502 new_seq(slang_ir_node *left, slang_ir_node *right)
503 {
504 if (!left)
505 return right;
506 if (!right)
507 return left;
508 return new_node2(IR_SEQ, left, right);
509 }
510
511 static slang_ir_node *
512 new_label(slang_label *label)
513 {
514 slang_ir_node *n = new_node0(IR_LABEL);
515 assert(label);
516 if (n)
517 n->Label = label;
518 return n;
519 }
520
521 static slang_ir_node *
522 new_float_literal(const float v[4], GLuint size)
523 {
524 slang_ir_node *n = new_node0(IR_FLOAT);
525 assert(size <= 4);
526 COPY_4V(n->Value, v);
527 /* allocate a storage object, but compute actual location (Index) later */
528 n->Store = _slang_new_ir_storage(PROGRAM_CONSTANT, -1, size);
529 return n;
530 }
531
532
533 static slang_ir_node *
534 new_not(slang_ir_node *n)
535 {
536 return new_node1(IR_NOT, n);
537 }
538
539
540 /**
541 * Non-inlined function call.
542 */
543 static slang_ir_node *
544 new_function_call(slang_ir_node *code, slang_label *name)
545 {
546 slang_ir_node *n = new_node1(IR_CALL, code);
547 assert(name);
548 if (n)
549 n->Label = name;
550 return n;
551 }
552
553
554 /**
555 * Unconditional jump.
556 */
557 static slang_ir_node *
558 new_return(slang_label *dest)
559 {
560 slang_ir_node *n = new_node0(IR_RETURN);
561 assert(dest);
562 if (n)
563 n->Label = dest;
564 return n;
565 }
566
567
568 static slang_ir_node *
569 new_loop(slang_ir_node *body)
570 {
571 return new_node1(IR_LOOP, body);
572 }
573
574
575 static slang_ir_node *
576 new_break(slang_ir_node *loopNode)
577 {
578 slang_ir_node *n = new_node0(IR_BREAK);
579 assert(loopNode);
580 assert(loopNode->Opcode == IR_LOOP);
581 if (n) {
582 /* insert this node at head of linked list */
583 n->List = loopNode->List;
584 loopNode->List = n;
585 }
586 return n;
587 }
588
589
590 /**
591 * Make new IR_BREAK_IF_TRUE.
592 */
593 static slang_ir_node *
594 new_break_if_true(slang_ir_node *loopNode, slang_ir_node *cond)
595 {
596 slang_ir_node *n;
597 assert(loopNode);
598 assert(loopNode->Opcode == IR_LOOP);
599 n = new_node1(IR_BREAK_IF_TRUE, cond);
600 if (n) {
601 /* insert this node at head of linked list */
602 n->List = loopNode->List;
603 loopNode->List = n;
604 }
605 return n;
606 }
607
608
609 /**
610 * Make new IR_CONT_IF_TRUE node.
611 */
612 static slang_ir_node *
613 new_cont_if_true(slang_ir_node *loopNode, slang_ir_node *cond)
614 {
615 slang_ir_node *n;
616 assert(loopNode);
617 assert(loopNode->Opcode == IR_LOOP);
618 n = new_node1(IR_CONT_IF_TRUE, cond);
619 if (n) {
620 /* insert this node at head of linked list */
621 n->List = loopNode->List;
622 loopNode->List = n;
623 }
624 return n;
625 }
626
627
628 static slang_ir_node *
629 new_cond(slang_ir_node *n)
630 {
631 slang_ir_node *c = new_node1(IR_COND, n);
632 return c;
633 }
634
635
636 static slang_ir_node *
637 new_if(slang_ir_node *cond, slang_ir_node *ifPart, slang_ir_node *elsePart)
638 {
639 return new_node3(IR_IF, cond, ifPart, elsePart);
640 }
641
642
643 /**
644 * New IR_VAR node - a reference to a previously declared variable.
645 */
646 static slang_ir_node *
647 new_var(slang_assemble_ctx *A, slang_operation *oper, slang_atom name)
648 {
649 slang_ir_node *n;
650 slang_variable *var = _slang_locate_variable(oper->locals, name, GL_TRUE);
651 if (!var)
652 return NULL;
653
654 assert(!oper->var || oper->var == var);
655
656 n = new_node0(IR_VAR);
657 if (n) {
658 _slang_attach_storage(n, var);
659 }
660 return n;
661 }
662
663
664 /**
665 * Check if the given function is really just a wrapper for a
666 * basic assembly instruction.
667 */
668 static GLboolean
669 slang_is_asm_function(const slang_function *fun)
670 {
671 if (fun->body->type == SLANG_OPER_BLOCK_NO_NEW_SCOPE &&
672 fun->body->num_children == 1 &&
673 fun->body->children[0].type == SLANG_OPER_ASM) {
674 return GL_TRUE;
675 }
676 return GL_FALSE;
677 }
678
679
680 static GLboolean
681 _slang_is_noop(const slang_operation *oper)
682 {
683 if (!oper ||
684 oper->type == SLANG_OPER_VOID ||
685 (oper->num_children == 1 && oper->children[0].type == SLANG_OPER_VOID))
686 return GL_TRUE;
687 else
688 return GL_FALSE;
689 }
690
691
692 /**
693 * Recursively search tree for a node of the given type.
694 */
695 static slang_operation *
696 _slang_find_node_type(slang_operation *oper, slang_operation_type type)
697 {
698 GLuint i;
699 if (oper->type == type)
700 return oper;
701 for (i = 0; i < oper->num_children; i++) {
702 slang_operation *p = _slang_find_node_type(&oper->children[i], type);
703 if (p)
704 return p;
705 }
706 return NULL;
707 }
708
709
710 static void
711 slang_resolve_variable(slang_operation *oper)
712 {
713 if (oper->type == SLANG_OPER_IDENTIFIER && !oper->var) {
714 oper->var = _slang_locate_variable(oper->locals, oper->a_id, GL_TRUE);
715 }
716 }
717
718
719 /**
720 * Replace particular variables (SLANG_OPER_IDENTIFIER) with new expressions.
721 */
722 static void
723 slang_substitute(slang_assemble_ctx *A, slang_operation *oper,
724 GLuint substCount, slang_variable **substOld,
725 slang_operation **substNew, GLboolean isLHS)
726 {
727 switch (oper->type) {
728 case SLANG_OPER_VARIABLE_DECL:
729 {
730 slang_variable *v = _slang_locate_variable(oper->locals,
731 oper->a_id, GL_TRUE);
732 assert(v);
733 if (v->initializer && oper->num_children == 0) {
734 /* set child of oper to copy of initializer */
735 oper->num_children = 1;
736 oper->children = slang_operation_new(1);
737 slang_operation_copy(&oper->children[0], v->initializer);
738 }
739 if (oper->num_children == 1) {
740 /* the initializer */
741 slang_substitute(A, &oper->children[0], substCount,
742 substOld, substNew, GL_FALSE);
743 }
744 }
745 break;
746 case SLANG_OPER_IDENTIFIER:
747 assert(oper->num_children == 0);
748 if (1/**!isLHS XXX FIX */) {
749 slang_atom id = oper->a_id;
750 slang_variable *v;
751 GLuint i;
752 v = _slang_locate_variable(oper->locals, id, GL_TRUE);
753 if (!v) {
754 _mesa_problem(NULL, "var %s not found!\n", (char *) oper->a_id);
755 return;
756 }
757
758 /* look for a substitution */
759 for (i = 0; i < substCount; i++) {
760 if (v == substOld[i]) {
761 /* OK, replace this SLANG_OPER_IDENTIFIER with a new expr */
762 #if 0 /* DEBUG only */
763 if (substNew[i]->type == SLANG_OPER_IDENTIFIER) {
764 assert(substNew[i]->var);
765 assert(substNew[i]->var->a_name);
766 printf("Substitute %s with %s in id node %p\n",
767 (char*)v->a_name, (char*) substNew[i]->var->a_name,
768 (void*) oper);
769 }
770 else {
771 printf("Substitute %s with %f in id node %p\n",
772 (char*)v->a_name, substNew[i]->literal[0],
773 (void*) oper);
774 }
775 #endif
776 slang_operation_copy(oper, substNew[i]);
777 break;
778 }
779 }
780 }
781 break;
782
783 case SLANG_OPER_RETURN:
784 /* do return replacement here too */
785 assert(oper->num_children == 0 || oper->num_children == 1);
786 if (oper->num_children == 1 && !_slang_is_noop(&oper->children[0])) {
787 /* replace:
788 * return expr;
789 * with:
790 * __retVal = expr;
791 * return;
792 * then do substitutions on the assignment.
793 */
794 slang_operation *blockOper, *assignOper, *returnOper;
795
796 /* check if function actually has a return type */
797 assert(A->CurFunction);
798 if (A->CurFunction->header.type.specifier.type == SLANG_SPEC_VOID) {
799 slang_info_log_error(A->log, "illegal return expression");
800 return;
801 }
802
803 blockOper = slang_operation_new(1);
804 blockOper->type = SLANG_OPER_BLOCK_NO_NEW_SCOPE;
805 blockOper->num_children = 2;
806 blockOper->locals->outer_scope = oper->locals->outer_scope;
807 blockOper->children = slang_operation_new(2);
808 assignOper = blockOper->children + 0;
809 returnOper = blockOper->children + 1;
810
811 assignOper->type = SLANG_OPER_ASSIGN;
812 assignOper->num_children = 2;
813 assignOper->locals->outer_scope = blockOper->locals;
814 assignOper->children = slang_operation_new(2);
815 assignOper->children[0].type = SLANG_OPER_IDENTIFIER;
816 assignOper->children[0].a_id = slang_atom_pool_atom(A->atoms, "__retVal");
817 assignOper->children[0].locals->outer_scope = assignOper->locals;
818
819 slang_operation_copy(&assignOper->children[1],
820 &oper->children[0]);
821
822 returnOper->type = SLANG_OPER_RETURN; /* return w/ no value */
823 assert(returnOper->num_children == 0);
824
825 /* do substitutions on the "__retVal = expr" sub-tree */
826 slang_substitute(A, assignOper,
827 substCount, substOld, substNew, GL_FALSE);
828
829 /* install new code */
830 slang_operation_copy(oper, blockOper);
831 slang_operation_destruct(blockOper);
832 }
833 else {
834 /* check if return value was expected */
835 assert(A->CurFunction);
836 if (A->CurFunction->header.type.specifier.type != SLANG_SPEC_VOID) {
837 slang_info_log_error(A->log, "return statement requires an expression");
838 return;
839 }
840 }
841 break;
842
843 case SLANG_OPER_ASSIGN:
844 case SLANG_OPER_SUBSCRIPT:
845 /* special case:
846 * child[0] can't have substitutions but child[1] can.
847 */
848 slang_substitute(A, &oper->children[0],
849 substCount, substOld, substNew, GL_TRUE);
850 slang_substitute(A, &oper->children[1],
851 substCount, substOld, substNew, GL_FALSE);
852 break;
853 case SLANG_OPER_FIELD:
854 /* XXX NEW - test */
855 slang_substitute(A, &oper->children[0],
856 substCount, substOld, substNew, GL_TRUE);
857 break;
858 default:
859 {
860 GLuint i;
861 for (i = 0; i < oper->num_children; i++)
862 slang_substitute(A, &oper->children[i],
863 substCount, substOld, substNew, GL_FALSE);
864 }
865 }
866 }
867
868
869
870 /**
871 * Produce inline code for a call to an assembly instruction.
872 * This is typically used to compile a call to a built-in function like this:
873 *
874 * vec4 mix(const vec4 x, const vec4 y, const vec4 a)
875 * {
876 * __asm vec4_lrp __retVal, a, y, x;
877 * }
878 *
879 * We basically translate a SLANG_OPER_CALL into a SLANG_OPER_ASM.
880 */
881 static slang_operation *
882 slang_inline_asm_function(slang_assemble_ctx *A,
883 slang_function *fun, slang_operation *oper)
884 {
885 const GLuint numArgs = oper->num_children;
886 GLuint i;
887 slang_operation *inlined;
888 const GLboolean haveRetValue = _slang_function_has_return_value(fun);
889 slang_variable **substOld;
890 slang_operation **substNew;
891
892 ASSERT(slang_is_asm_function(fun));
893 ASSERT(fun->param_count == numArgs + haveRetValue);
894
895 /*
896 printf("Inline %s as %s\n",
897 (char*) fun->header.a_name,
898 (char*) fun->body->children[0].a_id);
899 */
900
901 /*
902 * We'll substitute formal params with actual args in the asm call.
903 */
904 substOld = (slang_variable **)
905 _slang_alloc(numArgs * sizeof(slang_variable *));
906 substNew = (slang_operation **)
907 _slang_alloc(numArgs * sizeof(slang_operation *));
908 for (i = 0; i < numArgs; i++) {
909 substOld[i] = fun->parameters->variables[i];
910 substNew[i] = oper->children + i;
911 }
912
913 /* make a copy of the code to inline */
914 inlined = slang_operation_new(1);
915 slang_operation_copy(inlined, &fun->body->children[0]);
916 if (haveRetValue) {
917 /* get rid of the __retVal child */
918 for (i = 0; i < numArgs; i++) {
919 inlined->children[i] = inlined->children[i + 1];
920 }
921 inlined->num_children--;
922 }
923
924 /* now do formal->actual substitutions */
925 slang_substitute(A, inlined, numArgs, substOld, substNew, GL_FALSE);
926
927 _slang_free(substOld);
928 _slang_free(substNew);
929
930 return inlined;
931 }
932
933
934 /**
935 * Inline the given function call operation.
936 * Return a new slang_operation that corresponds to the inlined code.
937 */
938 static slang_operation *
939 slang_inline_function_call(slang_assemble_ctx * A, slang_function *fun,
940 slang_operation *oper, slang_operation *returnOper)
941 {
942 typedef enum {
943 SUBST = 1,
944 COPY_IN,
945 COPY_OUT
946 } ParamMode;
947 ParamMode *paramMode;
948 const GLboolean haveRetValue = _slang_function_has_return_value(fun);
949 const GLuint numArgs = oper->num_children;
950 const GLuint totalArgs = numArgs + haveRetValue;
951 slang_operation *args = oper->children;
952 slang_operation *inlined, *top;
953 slang_variable **substOld;
954 slang_operation **substNew;
955 GLuint substCount, numCopyIn, i;
956 slang_function *prevFunction;
957
958 /* save / push */
959 prevFunction = A->CurFunction;
960 A->CurFunction = fun;
961
962 /*assert(oper->type == SLANG_OPER_CALL); (or (matrix) multiply, etc) */
963 assert(fun->param_count == totalArgs);
964
965 /* allocate temporary arrays */
966 paramMode = (ParamMode *)
967 _slang_alloc(totalArgs * sizeof(ParamMode));
968 substOld = (slang_variable **)
969 _slang_alloc(totalArgs * sizeof(slang_variable *));
970 substNew = (slang_operation **)
971 _slang_alloc(totalArgs * sizeof(slang_operation *));
972
973 #if 0
974 printf("Inline call to %s (total vars=%d nparams=%d)\n",
975 (char *) fun->header.a_name,
976 fun->parameters->num_variables, numArgs);
977 #endif
978
979 if (haveRetValue && !returnOper) {
980 /* Create 3-child comma sequence for inlined code:
981 * child[0]: declare __resultTmp
982 * child[1]: inlined function body
983 * child[2]: __resultTmp
984 */
985 slang_operation *commaSeq;
986 slang_operation *declOper = NULL;
987 slang_variable *resultVar;
988
989 commaSeq = slang_operation_new(1);
990 commaSeq->type = SLANG_OPER_SEQUENCE;
991 assert(commaSeq->locals);
992 commaSeq->locals->outer_scope = oper->locals->outer_scope;
993 commaSeq->num_children = 3;
994 commaSeq->children = slang_operation_new(3);
995 /* allocate the return var */
996 resultVar = slang_variable_scope_grow(commaSeq->locals);
997 /*
998 printf("Alloc __resultTmp in scope %p for retval of calling %s\n",
999 (void*)commaSeq->locals, (char *) fun->header.a_name);
1000 */
1001
1002 resultVar->a_name = slang_atom_pool_atom(A->atoms, "__resultTmp");
1003 resultVar->type = fun->header.type; /* XXX copy? */
1004 resultVar->isTemp = GL_TRUE;
1005
1006 /* child[0] = __resultTmp declaration */
1007 declOper = &commaSeq->children[0];
1008 declOper->type = SLANG_OPER_VARIABLE_DECL;
1009 declOper->a_id = resultVar->a_name;
1010 declOper->locals->outer_scope = commaSeq->locals;
1011
1012 /* child[1] = function body */
1013 inlined = &commaSeq->children[1];
1014 inlined->locals->outer_scope = commaSeq->locals;
1015
1016 /* child[2] = __resultTmp reference */
1017 returnOper = &commaSeq->children[2];
1018 returnOper->type = SLANG_OPER_IDENTIFIER;
1019 returnOper->a_id = resultVar->a_name;
1020 returnOper->locals->outer_scope = commaSeq->locals;
1021
1022 top = commaSeq;
1023 }
1024 else {
1025 top = inlined = slang_operation_new(1);
1026 /* XXXX this may be inappropriate!!!! */
1027 inlined->locals->outer_scope = oper->locals->outer_scope;
1028 }
1029
1030
1031 assert(inlined->locals);
1032
1033 /* Examine the parameters, look for inout/out params, look for possible
1034 * substitutions, etc:
1035 * param type behaviour
1036 * in copy actual to local
1037 * const in substitute param with actual
1038 * out copy out
1039 */
1040 substCount = 0;
1041 for (i = 0; i < totalArgs; i++) {
1042 slang_variable *p = fun->parameters->variables[i];
1043 /*
1044 printf("Param %d: %s %s \n", i,
1045 slang_type_qual_string(p->type.qualifier),
1046 (char *) p->a_name);
1047 */
1048 if (p->type.qualifier == SLANG_QUAL_INOUT ||
1049 p->type.qualifier == SLANG_QUAL_OUT) {
1050 /* an output param */
1051 slang_operation *arg;
1052 if (i < numArgs)
1053 arg = &args[i];
1054 else
1055 arg = returnOper;
1056 paramMode[i] = SUBST;
1057
1058 if (arg->type == SLANG_OPER_IDENTIFIER)
1059 slang_resolve_variable(arg);
1060
1061 /* replace parameter 'p' with argument 'arg' */
1062 substOld[substCount] = p;
1063 substNew[substCount] = arg; /* will get copied */
1064 substCount++;
1065 }
1066 else if (p->type.qualifier == SLANG_QUAL_CONST) {
1067 /* a constant input param */
1068 if (args[i].type == SLANG_OPER_IDENTIFIER ||
1069 args[i].type == SLANG_OPER_LITERAL_FLOAT) {
1070 /* replace all occurances of this parameter variable with the
1071 * actual argument variable or a literal.
1072 */
1073 paramMode[i] = SUBST;
1074 slang_resolve_variable(&args[i]);
1075 substOld[substCount] = p;
1076 substNew[substCount] = &args[i]; /* will get copied */
1077 substCount++;
1078 }
1079 else {
1080 paramMode[i] = COPY_IN;
1081 }
1082 }
1083 else {
1084 paramMode[i] = COPY_IN;
1085 }
1086 assert(paramMode[i]);
1087 }
1088
1089 /* actual code inlining: */
1090 slang_operation_copy(inlined, fun->body);
1091
1092 /*** XXX review this */
1093 assert(inlined->type == SLANG_OPER_BLOCK_NO_NEW_SCOPE);
1094 inlined->type = SLANG_OPER_BLOCK_NEW_SCOPE;
1095
1096 #if 0
1097 printf("======================= orig body code ======================\n");
1098 printf("=== params scope = %p\n", (void*) fun->parameters);
1099 slang_print_tree(fun->body, 8);
1100 printf("======================= copied code =========================\n");
1101 slang_print_tree(inlined, 8);
1102 #endif
1103
1104 /* do parameter substitution in inlined code: */
1105 slang_substitute(A, inlined, substCount, substOld, substNew, GL_FALSE);
1106
1107 #if 0
1108 printf("======================= subst code ==========================\n");
1109 slang_print_tree(inlined, 8);
1110 printf("=============================================================\n");
1111 #endif
1112
1113 /* New prolog statements: (inserted before the inlined code)
1114 * Copy the 'in' arguments.
1115 */
1116 numCopyIn = 0;
1117 for (i = 0; i < numArgs; i++) {
1118 if (paramMode[i] == COPY_IN) {
1119 slang_variable *p = fun->parameters->variables[i];
1120 /* declare parameter 'p' */
1121 slang_operation *decl = slang_operation_insert(&inlined->num_children,
1122 &inlined->children,
1123 numCopyIn);
1124 /*
1125 printf("COPY_IN %s from expr\n", (char*)p->a_name);
1126 */
1127 decl->type = SLANG_OPER_VARIABLE_DECL;
1128 assert(decl->locals);
1129 decl->locals->outer_scope = inlined->locals;
1130 decl->a_id = p->a_name;
1131 decl->num_children = 1;
1132 decl->children = slang_operation_new(1);
1133
1134 /* child[0] is the var's initializer */
1135 slang_operation_copy(&decl->children[0], args + i);
1136
1137 numCopyIn++;
1138 }
1139 }
1140
1141 /* New epilog statements:
1142 * 1. Create end of function label to jump to from return statements.
1143 * 2. Copy the 'out' parameter vars
1144 */
1145 {
1146 slang_operation *lab = slang_operation_insert(&inlined->num_children,
1147 &inlined->children,
1148 inlined->num_children);
1149 lab->type = SLANG_OPER_LABEL;
1150 lab->label = A->curFuncEndLabel;
1151 }
1152
1153 for (i = 0; i < totalArgs; i++) {
1154 if (paramMode[i] == COPY_OUT) {
1155 const slang_variable *p = fun->parameters->variables[i];
1156 /* actualCallVar = outParam */
1157 /*if (i > 0 || !haveRetValue)*/
1158 slang_operation *ass = slang_operation_insert(&inlined->num_children,
1159 &inlined->children,
1160 inlined->num_children);
1161 ass->type = SLANG_OPER_ASSIGN;
1162 ass->num_children = 2;
1163 ass->locals->outer_scope = inlined->locals;
1164 ass->children = slang_operation_new(2);
1165 ass->children[0] = args[i]; /*XXX copy */
1166 ass->children[1].type = SLANG_OPER_IDENTIFIER;
1167 ass->children[1].a_id = p->a_name;
1168 ass->children[1].locals->outer_scope = ass->locals;
1169 }
1170 }
1171
1172 _slang_free(paramMode);
1173 _slang_free(substOld);
1174 _slang_free(substNew);
1175
1176 #if 0
1177 printf("Done Inline call to %s (total vars=%d nparams=%d)\n",
1178 (char *) fun->header.a_name,
1179 fun->parameters->num_variables, numArgs);
1180 slang_print_tree(top, 0);
1181 #endif
1182
1183 /* pop */
1184 A->CurFunction = prevFunction;
1185
1186 return top;
1187 }
1188
1189
1190 static slang_ir_node *
1191 _slang_gen_function_call(slang_assemble_ctx *A, slang_function *fun,
1192 slang_operation *oper, slang_operation *dest)
1193 {
1194 slang_ir_node *n;
1195 slang_operation *inlined;
1196 slang_label *prevFuncEndLabel;
1197 char name[200];
1198
1199 prevFuncEndLabel = A->curFuncEndLabel;
1200 sprintf(name, "__endOfFunc_%s_", (char *) fun->header.a_name);
1201 A->curFuncEndLabel = _slang_label_new(name);
1202 assert(A->curFuncEndLabel);
1203
1204 if (slang_is_asm_function(fun) && !dest) {
1205 /* assemble assembly function - tree style */
1206 inlined = slang_inline_asm_function(A, fun, oper);
1207 }
1208 else {
1209 /* non-assembly function */
1210 inlined = slang_inline_function_call(A, fun, oper, dest);
1211 if (inlined && _slang_find_node_type(inlined, SLANG_OPER_RETURN)) {
1212 slang_operation *callOper;
1213 /* The function we're calling has one or more 'return' statements.
1214 * So, we can't truly inline this function because we need to
1215 * implement 'return' with RET (and CAL).
1216 * Nevertheless, we performed "inlining" to make a new instance
1217 * of the function body to deal with static register allocation.
1218 *
1219 * XXX check if there's one 'return' and if it's the very last
1220 * statement in the function - we can optimize that case.
1221 */
1222 assert(inlined->type == SLANG_OPER_BLOCK_NEW_SCOPE ||
1223 inlined->type == SLANG_OPER_SEQUENCE);
1224 if (_slang_function_has_return_value(fun) && !dest) {
1225 assert(inlined->children[0].type == SLANG_OPER_VARIABLE_DECL);
1226 assert(inlined->children[2].type == SLANG_OPER_IDENTIFIER);
1227 callOper = &inlined->children[1];
1228 }
1229 else {
1230 callOper = inlined;
1231 }
1232 callOper->type = SLANG_OPER_NON_INLINED_CALL;
1233 callOper->fun = fun;
1234 callOper->label = _slang_label_new_unique((char*) fun->header.a_name);
1235 }
1236 }
1237
1238 if (!inlined)
1239 return NULL;
1240
1241 /* Replace the function call with the inlined block */
1242 slang_operation_destruct(oper);
1243 *oper = *inlined;
1244 _slang_free(inlined);
1245
1246 #if 0
1247 assert(inlined->locals);
1248 printf("*** Inlined code for call to %s:\n",
1249 (char*) fun->header.a_name);
1250 slang_print_tree(oper, 10);
1251 printf("\n");
1252 #endif
1253
1254 n = _slang_gen_operation(A, oper);
1255
1256 /*_slang_label_delete(A->curFuncEndLabel);*/
1257 A->curFuncEndLabel = prevFuncEndLabel;
1258
1259 return n;
1260 }
1261
1262
1263 static slang_asm_info *
1264 slang_find_asm_info(const char *name)
1265 {
1266 GLuint i;
1267 for (i = 0; AsmInfo[i].Name; i++) {
1268 if (_mesa_strcmp(AsmInfo[i].Name, name) == 0) {
1269 return AsmInfo + i;
1270 }
1271 }
1272 return NULL;
1273 }
1274
1275
1276 static GLuint
1277 make_writemask(const char *field)
1278 {
1279 GLuint mask = 0x0;
1280 while (*field) {
1281 switch (*field) {
1282 case 'x':
1283 case 's':
1284 case 'r':
1285 mask |= WRITEMASK_X;
1286 break;
1287 case 'y':
1288 case 't':
1289 case 'g':
1290 mask |= WRITEMASK_Y;
1291 break;
1292 case 'z':
1293 case 'p':
1294 case 'b':
1295 mask |= WRITEMASK_Z;
1296 break;
1297 case 'w':
1298 case 'q':
1299 case 'a':
1300 mask |= WRITEMASK_W;
1301 break;
1302 default:
1303 _mesa_problem(NULL, "invalid writemask in make_writemask()");
1304 return 0;
1305 }
1306 field++;
1307 }
1308 if (mask == 0x0)
1309 return WRITEMASK_XYZW;
1310 else
1311 return mask;
1312 }
1313
1314
1315 /**
1316 * Generate IR tree for an asm instruction/operation such as:
1317 * __asm vec4_dot __retVal.x, v1, v2;
1318 */
1319 static slang_ir_node *
1320 _slang_gen_asm(slang_assemble_ctx *A, slang_operation *oper,
1321 slang_operation *dest)
1322 {
1323 const slang_asm_info *info;
1324 slang_ir_node *kids[3], *n;
1325 GLuint j, firstOperand;
1326
1327 assert(oper->type == SLANG_OPER_ASM);
1328
1329 info = slang_find_asm_info((char *) oper->a_id);
1330 if (!info) {
1331 _mesa_problem(NULL, "undefined __asm function %s\n",
1332 (char *) oper->a_id);
1333 assert(info);
1334 }
1335 assert(info->NumParams <= 3);
1336
1337 if (info->NumParams == oper->num_children) {
1338 /* Storage for result is not specified.
1339 * Children[0], [1] are the operands.
1340 */
1341 firstOperand = 0;
1342 }
1343 else {
1344 /* Storage for result (child[0]) is specified.
1345 * Children[1], [2] are the operands.
1346 */
1347 firstOperand = 1;
1348 }
1349
1350 /* assemble child(ren) */
1351 kids[0] = kids[1] = kids[2] = NULL;
1352 for (j = 0; j < info->NumParams; j++) {
1353 kids[j] = _slang_gen_operation(A, &oper->children[firstOperand + j]);
1354 if (!kids[j])
1355 return NULL;
1356 }
1357
1358 n = new_node3(info->Opcode, kids[0], kids[1], kids[2]);
1359
1360 if (firstOperand) {
1361 /* Setup n->Store to be a particular location. Otherwise, storage
1362 * for the result (a temporary) will be allocated later.
1363 */
1364 GLuint writemask = WRITEMASK_XYZW;
1365 slang_operation *dest_oper;
1366 slang_ir_node *n0;
1367
1368 dest_oper = &oper->children[0];
1369 while (dest_oper->type == SLANG_OPER_FIELD) {
1370 /* writemask */
1371 writemask &= make_writemask((char*) dest_oper->a_id);
1372 dest_oper = &dest_oper->children[0];
1373 }
1374
1375 n0 = _slang_gen_operation(A, dest_oper);
1376 assert(n0->Var);
1377 assert(n0->Store);
1378 assert(!n->Store);
1379 n->Store = n0->Store;
1380 n->Writemask = writemask;
1381
1382 _slang_free(n0);
1383 }
1384
1385 return n;
1386 }
1387
1388
1389 static void
1390 print_funcs(struct slang_function_scope_ *scope, const char *name)
1391 {
1392 GLuint i;
1393 for (i = 0; i < scope->num_functions; i++) {
1394 slang_function *f = &scope->functions[i];
1395 if (!name || strcmp(name, (char*) f->header.a_name) == 0)
1396 printf(" %s (%d args)\n", name, f->param_count);
1397
1398 }
1399 if (scope->outer_scope)
1400 print_funcs(scope->outer_scope, name);
1401 }
1402
1403
1404 /**
1405 * Return first function in the scope that has the given name.
1406 * This is the function we'll try to call when there is no exact match
1407 * between function parameters and call arguments.
1408 *
1409 * XXX we should really create a list of candidate functions and try
1410 * all of them...
1411 */
1412 static slang_function *
1413 _slang_first_function(struct slang_function_scope_ *scope, const char *name)
1414 {
1415 GLuint i;
1416 for (i = 0; i < scope->num_functions; i++) {
1417 slang_function *f = &scope->functions[i];
1418 if (strcmp(name, (char*) f->header.a_name) == 0)
1419 return f;
1420 }
1421 if (scope->outer_scope)
1422 return _slang_first_function(scope->outer_scope, name);
1423 return NULL;
1424 }
1425
1426
1427
1428 /**
1429 * Assemble a function call, given a particular function name.
1430 * \param name the function's name (operators like '*' are possible).
1431 */
1432 static slang_ir_node *
1433 _slang_gen_function_call_name(slang_assemble_ctx *A, const char *name,
1434 slang_operation *oper, slang_operation *dest)
1435 {
1436 slang_operation *params = oper->children;
1437 const GLuint param_count = oper->num_children;
1438 slang_atom atom;
1439 slang_function *fun;
1440
1441 atom = slang_atom_pool_atom(A->atoms, name);
1442 if (atom == SLANG_ATOM_NULL)
1443 return NULL;
1444
1445 /*
1446 * Use 'name' to find the function to call
1447 */
1448 fun = _slang_locate_function(A->space.funcs, atom, params, param_count,
1449 &A->space, A->atoms, A->log);
1450 if (!fun) {
1451 /* A function with exactly the right parameters/types was not found.
1452 * Try adapting the parameters.
1453 */
1454 fun = _slang_first_function(A->space.funcs, name);
1455 if (!fun || !_slang_adapt_call(oper, fun, &A->space, A->atoms, A->log)) {
1456 slang_info_log_error(A->log, "Function '%s' not found (check argument types)", name);
1457 return NULL;
1458 }
1459 assert(fun);
1460 }
1461
1462 return _slang_gen_function_call(A, fun, oper, dest);
1463 }
1464
1465
1466 static GLboolean
1467 _slang_is_constant_cond(const slang_operation *oper, GLboolean *value)
1468 {
1469 if (oper->type == SLANG_OPER_LITERAL_FLOAT ||
1470 oper->type == SLANG_OPER_LITERAL_INT ||
1471 oper->type == SLANG_OPER_LITERAL_BOOL) {
1472 if (oper->literal[0])
1473 *value = GL_TRUE;
1474 else
1475 *value = GL_FALSE;
1476 return GL_TRUE;
1477 }
1478 else if (oper->type == SLANG_OPER_EXPRESSION &&
1479 oper->num_children == 1) {
1480 return _slang_is_constant_cond(&oper->children[0], value);
1481 }
1482 return GL_FALSE;
1483 }
1484
1485
1486 /**
1487 * Test if an operation is a scalar or boolean.
1488 */
1489 static GLboolean
1490 _slang_is_scalar_or_boolean(slang_assemble_ctx *A, slang_operation *oper)
1491 {
1492 slang_typeinfo type;
1493 GLint size;
1494
1495 slang_typeinfo_construct(&type);
1496 _slang_typeof_operation(A, oper, &type);
1497 size = _slang_sizeof_type_specifier(&type.spec);
1498 slang_typeinfo_destruct(&type);
1499 return size == 1;
1500 }
1501
1502
1503 /**
1504 * Generate loop code using high-level IR_LOOP instruction
1505 */
1506 static slang_ir_node *
1507 _slang_gen_while(slang_assemble_ctx * A, const slang_operation *oper)
1508 {
1509 /*
1510 * LOOP:
1511 * BREAK if !expr (child[0])
1512 * body code (child[1])
1513 */
1514 slang_ir_node *prevLoop, *loop, *breakIf, *body;
1515 GLboolean isConst, constTrue;
1516
1517 /* type-check expression */
1518 if (!_slang_is_scalar_or_boolean(A, &oper->children[0])) {
1519 slang_info_log_error(A->log, "scalar/boolean expression expected for 'while'");
1520 return NULL;
1521 }
1522
1523 /* Check if loop condition is a constant */
1524 isConst = _slang_is_constant_cond(&oper->children[0], &constTrue);
1525
1526 if (isConst && !constTrue) {
1527 /* loop is never executed! */
1528 return new_node0(IR_NOP);
1529 }
1530
1531 loop = new_loop(NULL);
1532
1533 /* save old, push new loop */
1534 prevLoop = A->CurLoop;
1535 A->CurLoop = loop;
1536
1537 if (isConst && constTrue) {
1538 /* while(nonzero constant), no conditional break */
1539 breakIf = NULL;
1540 }
1541 else {
1542 slang_ir_node *cond
1543 = new_cond(new_not(_slang_gen_operation(A, &oper->children[0])));
1544 breakIf = new_break_if_true(A->CurLoop, cond);
1545 }
1546 body = _slang_gen_operation(A, &oper->children[1]);
1547 loop->Children[0] = new_seq(breakIf, body);
1548
1549 /* Do infinite loop detection */
1550 /* loop->List is head of linked list of break/continue nodes */
1551 if (!loop->List && isConst && constTrue) {
1552 /* infinite loop detected */
1553 A->CurLoop = prevLoop; /* clean-up */
1554 slang_info_log_error(A->log, "Infinite loop detected!");
1555 return NULL;
1556 }
1557
1558 /* pop loop, restore prev */
1559 A->CurLoop = prevLoop;
1560
1561 return loop;
1562 }
1563
1564
1565 /**
1566 * Generate IR tree for a do-while loop using high-level LOOP, IF instructions.
1567 */
1568 static slang_ir_node *
1569 _slang_gen_do(slang_assemble_ctx * A, const slang_operation *oper)
1570 {
1571 /*
1572 * LOOP:
1573 * body code (child[0])
1574 * tail code:
1575 * BREAK if !expr (child[1])
1576 */
1577 slang_ir_node *prevLoop, *loop;
1578 GLboolean isConst, constTrue;
1579
1580 /* type-check expression */
1581 if (!_slang_is_scalar_or_boolean(A, &oper->children[1])) {
1582 slang_info_log_error(A->log, "scalar/boolean expression expected for 'do/while'");
1583 return NULL;
1584 }
1585
1586 loop = new_loop(NULL);
1587
1588 /* save old, push new loop */
1589 prevLoop = A->CurLoop;
1590 A->CurLoop = loop;
1591
1592 /* loop body: */
1593 loop->Children[0] = _slang_gen_operation(A, &oper->children[0]);
1594
1595 /* Check if loop condition is a constant */
1596 isConst = _slang_is_constant_cond(&oper->children[1], &constTrue);
1597 if (isConst && constTrue) {
1598 /* do { } while(1) ==> no conditional break */
1599 loop->Children[1] = NULL; /* no tail code */
1600 }
1601 else {
1602 slang_ir_node *cond
1603 = new_cond(new_not(_slang_gen_operation(A, &oper->children[1])));
1604 loop->Children[1] = new_break_if_true(A->CurLoop, cond);
1605 }
1606
1607 /* XXX we should do infinite loop detection, as above */
1608
1609 /* pop loop, restore prev */
1610 A->CurLoop = prevLoop;
1611
1612 return loop;
1613 }
1614
1615
1616 /**
1617 * Generate for-loop using high-level IR_LOOP instruction.
1618 */
1619 static slang_ir_node *
1620 _slang_gen_for(slang_assemble_ctx * A, const slang_operation *oper)
1621 {
1622 /*
1623 * init code (child[0])
1624 * LOOP:
1625 * BREAK if !expr (child[1])
1626 * body code (child[3])
1627 * tail code:
1628 * incr code (child[2]) // XXX continue here
1629 */
1630 slang_ir_node *prevLoop, *loop, *cond, *breakIf, *body, *init, *incr;
1631
1632 init = _slang_gen_operation(A, &oper->children[0]);
1633 loop = new_loop(NULL);
1634
1635 /* save old, push new loop */
1636 prevLoop = A->CurLoop;
1637 A->CurLoop = loop;
1638
1639 cond = new_cond(new_not(_slang_gen_operation(A, &oper->children[1])));
1640 breakIf = new_break_if_true(A->CurLoop, cond);
1641 body = _slang_gen_operation(A, &oper->children[3]);
1642 incr = _slang_gen_operation(A, &oper->children[2]);
1643
1644 loop->Children[0] = new_seq(breakIf, body);
1645 loop->Children[1] = incr; /* tail code */
1646
1647 /* pop loop, restore prev */
1648 A->CurLoop = prevLoop;
1649
1650 return new_seq(init, loop);
1651 }
1652
1653
1654 static slang_ir_node *
1655 _slang_gen_continue(slang_assemble_ctx * A, const slang_operation *oper)
1656 {
1657 slang_ir_node *n, *loopNode;
1658 assert(oper->type == SLANG_OPER_CONTINUE);
1659 loopNode = A->CurLoop;
1660 assert(loopNode);
1661 assert(loopNode->Opcode == IR_LOOP);
1662 n = new_node0(IR_CONT);
1663 if (n) {
1664 n->Parent = loopNode;
1665 /* insert this node at head of linked list */
1666 n->List = loopNode->List;
1667 loopNode->List = n;
1668 }
1669 return n;
1670 }
1671
1672
1673 /**
1674 * Determine if the given operation is of a specific type.
1675 */
1676 static GLboolean
1677 is_operation_type(const slang_operation *oper, slang_operation_type type)
1678 {
1679 if (oper->type == type)
1680 return GL_TRUE;
1681 else if ((oper->type == SLANG_OPER_BLOCK_NEW_SCOPE ||
1682 oper->type == SLANG_OPER_BLOCK_NO_NEW_SCOPE) &&
1683 oper->num_children == 1)
1684 return is_operation_type(&oper->children[0], type);
1685 else
1686 return GL_FALSE;
1687 }
1688
1689
1690 /**
1691 * Generate IR tree for an if/then/else conditional using high-level
1692 * IR_IF instruction.
1693 */
1694 static slang_ir_node *
1695 _slang_gen_if(slang_assemble_ctx * A, const slang_operation *oper)
1696 {
1697 /*
1698 * eval expr (child[0])
1699 * IF expr THEN
1700 * if-body code
1701 * ELSE
1702 * else-body code
1703 * ENDIF
1704 */
1705 const GLboolean haveElseClause = !_slang_is_noop(&oper->children[2]);
1706 slang_ir_node *ifNode, *cond, *ifBody, *elseBody;
1707 GLboolean isConst, constTrue;
1708
1709 /* type-check expression */
1710 if (!_slang_is_scalar_or_boolean(A, &oper->children[0])) {
1711 slang_info_log_error(A->log, "scalar/boolean expression expected for 'if'");
1712 return NULL;
1713 }
1714
1715 isConst = _slang_is_constant_cond(&oper->children[0], &constTrue);
1716 if (isConst) {
1717 if (constTrue) {
1718 /* if (true) ... */
1719 return _slang_gen_operation(A, &oper->children[1]);
1720 }
1721 else {
1722 /* if (false) ... */
1723 return _slang_gen_operation(A, &oper->children[2]);
1724 }
1725 }
1726
1727 cond = _slang_gen_operation(A, &oper->children[0]);
1728 cond = new_cond(cond);
1729
1730 if (is_operation_type(&oper->children[1], SLANG_OPER_BREAK)) {
1731 /* Special case: generate a conditional break */
1732 ifBody = new_break_if_true(A->CurLoop, cond);
1733 if (haveElseClause) {
1734 elseBody = _slang_gen_operation(A, &oper->children[2]);
1735 return new_seq(ifBody, elseBody);
1736 }
1737 return ifBody;
1738 }
1739 else if (is_operation_type(&oper->children[1], SLANG_OPER_CONTINUE)) {
1740 /* Special case: generate a conditional break */
1741 ifBody = new_cont_if_true(A->CurLoop, cond);
1742 if (haveElseClause) {
1743 elseBody = _slang_gen_operation(A, &oper->children[2]);
1744 return new_seq(ifBody, elseBody);
1745 }
1746 return ifBody;
1747 }
1748 else {
1749 /* general case */
1750 ifBody = _slang_gen_operation(A, &oper->children[1]);
1751 if (haveElseClause)
1752 elseBody = _slang_gen_operation(A, &oper->children[2]);
1753 else
1754 elseBody = NULL;
1755 ifNode = new_if(cond, ifBody, elseBody);
1756 return ifNode;
1757 }
1758 }
1759
1760
1761
1762 static slang_ir_node *
1763 _slang_gen_not(slang_assemble_ctx * A, const slang_operation *oper)
1764 {
1765 slang_ir_node *n;
1766
1767 assert(oper->type == SLANG_OPER_NOT);
1768
1769 /* type-check expression */
1770 if (!_slang_is_scalar_or_boolean(A, &oper->children[0])) {
1771 slang_info_log_error(A->log,
1772 "scalar/boolean expression expected for '!'");
1773 return NULL;
1774 }
1775
1776 n = _slang_gen_operation(A, &oper->children[0]);
1777 if (n)
1778 return new_not(n);
1779 else
1780 return NULL;
1781 }
1782
1783
1784 static slang_ir_node *
1785 _slang_gen_xor(slang_assemble_ctx * A, const slang_operation *oper)
1786 {
1787 slang_ir_node *n1, *n2;
1788
1789 assert(oper->type == SLANG_OPER_LOGICALXOR);
1790
1791 if (!_slang_is_scalar_or_boolean(A, &oper->children[0]) ||
1792 !_slang_is_scalar_or_boolean(A, &oper->children[0])) {
1793 slang_info_log_error(A->log,
1794 "scalar/boolean expressions expected for '^^'");
1795 return NULL;
1796 }
1797
1798 n1 = _slang_gen_operation(A, &oper->children[0]);
1799 if (!n1)
1800 return NULL;
1801 n2 = _slang_gen_operation(A, &oper->children[1]);
1802 if (!n2)
1803 return NULL;
1804 return new_node2(IR_NOTEQUAL, n1, n2);
1805 }
1806
1807
1808 /**
1809 * Generate IR node for storage of a temporary of given size.
1810 */
1811 static slang_ir_node *
1812 _slang_gen_temporary(GLint size)
1813 {
1814 slang_ir_storage *store;
1815 slang_ir_node *n = NULL;
1816
1817 store = _slang_new_ir_storage(PROGRAM_TEMPORARY, -1, size);
1818 if (store) {
1819 n = new_node0(IR_VAR_DECL);
1820 if (n) {
1821 n->Store = store;
1822 }
1823 else {
1824 _slang_free(store);
1825 }
1826 }
1827 return n;
1828 }
1829
1830
1831 /**
1832 * Generate IR node for allocating/declaring a variable.
1833 */
1834 static slang_ir_node *
1835 _slang_gen_var_decl(slang_assemble_ctx *A, slang_variable *var)
1836 {
1837 slang_ir_node *n;
1838 assert(!is_sampler_type(&var->type));
1839 n = new_node0(IR_VAR_DECL);
1840 if (n) {
1841 _slang_attach_storage(n, var);
1842
1843 assert(var->aux);
1844 assert(n->Store == var->aux);
1845 assert(n->Store);
1846 assert(n->Store->Index < 0);
1847
1848 n->Store->File = PROGRAM_TEMPORARY;
1849 n->Store->Size = _slang_sizeof_type_specifier(&n->Var->type.specifier);
1850 A->program->NumTemporaries++;
1851 assert(n->Store->Size > 0);
1852 }
1853 return n;
1854 }
1855
1856
1857 /**
1858 * Generate code for a selection expression: b ? x : y
1859 * XXX In some cases we could implement a selection expression
1860 * with an LRP instruction (use the boolean as the interpolant).
1861 * Otherwise, we use an IF/ELSE/ENDIF construct.
1862 */
1863 static slang_ir_node *
1864 _slang_gen_select(slang_assemble_ctx *A, slang_operation *oper)
1865 {
1866 slang_ir_node *cond, *ifNode, *trueExpr, *falseExpr, *trueNode, *falseNode;
1867 slang_ir_node *tmpDecl, *tmpVar, *tree;
1868 slang_typeinfo type;
1869 int size;
1870
1871 assert(oper->type == SLANG_OPER_SELECT);
1872 assert(oper->num_children == 3);
1873
1874 /* size of x or y's type */
1875 slang_typeinfo_construct(&type);
1876 _slang_typeof_operation(A, &oper->children[1], &type);
1877 size = _slang_sizeof_type_specifier(&type.spec);
1878 assert(size > 0);
1879
1880 /* temporary var */
1881 tmpDecl = _slang_gen_temporary(size);
1882
1883 /* the condition (child 0) */
1884 cond = _slang_gen_operation(A, &oper->children[0]);
1885 cond = new_cond(cond);
1886
1887 /* if-true body (child 1) */
1888 tmpVar = new_node0(IR_VAR);
1889 tmpVar->Store = tmpDecl->Store;
1890 trueExpr = _slang_gen_operation(A, &oper->children[1]);
1891 trueNode = new_node2(IR_MOVE, tmpVar, trueExpr);
1892
1893 /* if-false body (child 2) */
1894 tmpVar = new_node0(IR_VAR);
1895 tmpVar->Store = tmpDecl->Store;
1896 falseExpr = _slang_gen_operation(A, &oper->children[2]);
1897 falseNode = new_node2(IR_MOVE, tmpVar, falseExpr);
1898
1899 ifNode = new_if(cond, trueNode, falseNode);
1900
1901 /* tmp var value */
1902 tmpVar = new_node0(IR_VAR);
1903 tmpVar->Store = tmpDecl->Store;
1904
1905 tree = new_seq(ifNode, tmpVar);
1906 tree = new_seq(tmpDecl, tree);
1907
1908 /*_slang_print_ir_tree(tree, 10);*/
1909 return tree;
1910 }
1911
1912
1913 /**
1914 * Generate code for &&.
1915 */
1916 static slang_ir_node *
1917 _slang_gen_logical_and(slang_assemble_ctx *A, slang_operation *oper)
1918 {
1919 /* rewrite "a && b" as "a ? b : false" */
1920 slang_operation *select;
1921 slang_ir_node *n;
1922
1923 select = slang_operation_new(1);
1924 select->type = SLANG_OPER_SELECT;
1925 select->num_children = 3;
1926 select->children = slang_operation_new(3);
1927
1928 slang_operation_copy(&select->children[0], &oper->children[0]);
1929 slang_operation_copy(&select->children[1], &oper->children[1]);
1930 select->children[2].type = SLANG_OPER_LITERAL_BOOL;
1931 ASSIGN_4V(select->children[2].literal, 0, 0, 0, 0); /* false */
1932 select->children[2].literal_size = 1;
1933
1934 n = _slang_gen_select(A, select);
1935 return n;
1936 }
1937
1938
1939 /**
1940 * Generate code for ||.
1941 */
1942 static slang_ir_node *
1943 _slang_gen_logical_or(slang_assemble_ctx *A, slang_operation *oper)
1944 {
1945 /* rewrite "a || b" as "a ? true : b" */
1946 slang_operation *select;
1947 slang_ir_node *n;
1948
1949 select = slang_operation_new(1);
1950 select->type = SLANG_OPER_SELECT;
1951 select->num_children = 3;
1952 select->children = slang_operation_new(3);
1953
1954 slang_operation_copy(&select->children[0], &oper->children[0]);
1955 select->children[1].type = SLANG_OPER_LITERAL_BOOL;
1956 ASSIGN_4V(select->children[1].literal, 1, 1, 1, 1); /* true */
1957 select->children[1].literal_size = 1;
1958 slang_operation_copy(&select->children[2], &oper->children[1]);
1959
1960 n = _slang_gen_select(A, select);
1961 return n;
1962 }
1963
1964
1965 /**
1966 * Generate IR tree for a return statement.
1967 */
1968 static slang_ir_node *
1969 _slang_gen_return(slang_assemble_ctx * A, slang_operation *oper)
1970 {
1971 const GLboolean haveReturnValue
1972 = (oper->num_children == 1 && oper->children[0].type != SLANG_OPER_VOID);
1973
1974 /* error checking */
1975 assert(A->CurFunction);
1976 if (haveReturnValue &&
1977 A->CurFunction->header.type.specifier.type == SLANG_SPEC_VOID) {
1978 slang_info_log_error(A->log, "illegal return expression");
1979 return NULL;
1980 }
1981 else if (!haveReturnValue &&
1982 A->CurFunction->header.type.specifier.type != SLANG_SPEC_VOID) {
1983 slang_info_log_error(A->log, "return statement requires an expression");
1984 return NULL;
1985 }
1986
1987 if (!haveReturnValue) {
1988 return new_return(A->curFuncEndLabel);
1989 }
1990 else {
1991 /*
1992 * Convert from:
1993 * return expr;
1994 * To:
1995 * __retVal = expr;
1996 * return; // goto __endOfFunction
1997 */
1998 slang_operation *assign;
1999 slang_atom a_retVal;
2000 slang_ir_node *n;
2001
2002 a_retVal = slang_atom_pool_atom(A->atoms, "__retVal");
2003 assert(a_retVal);
2004
2005 #if 1 /* DEBUG */
2006 {
2007 slang_variable *v
2008 = _slang_locate_variable(oper->locals, a_retVal, GL_TRUE);
2009 if (!v) {
2010 /* trying to return a value in a void-valued function */
2011 return NULL;
2012 }
2013 }
2014 #endif
2015
2016 assign = slang_operation_new(1);
2017 assign->type = SLANG_OPER_ASSIGN;
2018 assign->num_children = 2;
2019 assign->children = slang_operation_new(2);
2020 /* lhs (__retVal) */
2021 assign->children[0].type = SLANG_OPER_IDENTIFIER;
2022 assign->children[0].a_id = a_retVal;
2023 assign->children[0].locals->outer_scope = assign->locals;
2024 /* rhs (expr) */
2025 /* XXX we might be able to avoid this copy someday */
2026 slang_operation_copy(&assign->children[1], &oper->children[0]);
2027
2028 /* assemble the new code */
2029 n = new_seq(_slang_gen_operation(A, assign),
2030 new_return(A->curFuncEndLabel));
2031
2032 slang_operation_delete(assign);
2033 return n;
2034 }
2035 }
2036
2037
2038 /**
2039 * Generate IR tree for a variable declaration.
2040 */
2041 static slang_ir_node *
2042 _slang_gen_declaration(slang_assemble_ctx *A, slang_operation *oper)
2043 {
2044 slang_ir_node *n;
2045 slang_ir_node *varDecl;
2046 slang_variable *v;
2047 const char *varName = (char *) oper->a_id;
2048
2049 assert(oper->num_children == 0 || oper->num_children == 1);
2050
2051 v = _slang_locate_variable(oper->locals, oper->a_id, GL_TRUE);
2052 assert(v);
2053
2054 varDecl = _slang_gen_var_decl(A, v);
2055
2056 if (oper->num_children > 0) {
2057 /* child is initializer */
2058 slang_ir_node *var, *init, *rhs;
2059 assert(oper->num_children == 1);
2060 var = new_var(A, oper, oper->a_id);
2061 if (!var) {
2062 slang_info_log_error(A->log, "undefined variable '%s'", varName);
2063 return NULL;
2064 }
2065 /* XXX make copy of this initializer? */
2066 rhs = _slang_gen_operation(A, &oper->children[0]);
2067 if (!rhs)
2068 return NULL; /* must have found an error */
2069 init = new_node2(IR_MOVE, var, rhs);
2070 /*assert(rhs->Opcode != IR_SEQ);*/
2071 n = new_seq(varDecl, init);
2072 }
2073 else if (v->initializer) {
2074 slang_ir_node *var, *init, *rhs;
2075 var = new_var(A, oper, oper->a_id);
2076 if (!var) {
2077 slang_info_log_error(A->log, "undefined variable '%s'", varName);
2078 return NULL;
2079 }
2080 #if 0
2081 /* XXX make copy of this initializer? */
2082 {
2083 slang_operation dup;
2084 slang_operation_construct(&dup);
2085 slang_operation_copy(&dup, v->initializer);
2086 _slang_simplify(&dup, &A->space, A->atoms);
2087 rhs = _slang_gen_operation(A, &dup);
2088 }
2089 #else
2090 _slang_simplify(v->initializer, &A->space, A->atoms);
2091 rhs = _slang_gen_operation(A, v->initializer);
2092 #endif
2093 if (!rhs)
2094 return NULL;
2095
2096 assert(rhs);
2097 init = new_node2(IR_MOVE, var, rhs);
2098 /*
2099 assert(rhs->Opcode != IR_SEQ);
2100 */
2101 n = new_seq(varDecl, init);
2102 }
2103 else {
2104 n = varDecl;
2105 }
2106 return n;
2107 }
2108
2109
2110 /**
2111 * Generate IR tree for a variable (such as in an expression).
2112 */
2113 static slang_ir_node *
2114 _slang_gen_variable(slang_assemble_ctx * A, slang_operation *oper)
2115 {
2116 /* If there's a variable associated with this oper (from inlining)
2117 * use it. Otherwise, use the oper's var id.
2118 */
2119 slang_atom aVar = oper->var ? oper->var->a_name : oper->a_id;
2120 slang_ir_node *n = new_var(A, oper, aVar);
2121 if (!n) {
2122 slang_info_log_error(A->log, "undefined variable '%s'", (char *) aVar);
2123 return NULL;
2124 }
2125 return n;
2126 }
2127
2128
2129 /**
2130 * Some write-masked assignments are simple, but others are hard.
2131 * Simple example:
2132 * vec3 v;
2133 * v.xy = vec2(a, b);
2134 * Hard example:
2135 * vec3 v;
2136 * v.zy = vec2(a, b);
2137 * this gets transformed/swizzled into:
2138 * v.zy = vec2(a, b).*yx* (* = don't care)
2139 * This function helps to determine simple vs. non-simple.
2140 */
2141 static GLboolean
2142 _slang_simple_writemask(GLuint writemask, GLuint swizzle)
2143 {
2144 switch (writemask) {
2145 case WRITEMASK_X:
2146 return GET_SWZ(swizzle, 0) == SWIZZLE_X;
2147 case WRITEMASK_Y:
2148 return GET_SWZ(swizzle, 1) == SWIZZLE_Y;
2149 case WRITEMASK_Z:
2150 return GET_SWZ(swizzle, 2) == SWIZZLE_Z;
2151 case WRITEMASK_W:
2152 return GET_SWZ(swizzle, 3) == SWIZZLE_W;
2153 case WRITEMASK_XY:
2154 return (GET_SWZ(swizzle, 0) == SWIZZLE_X)
2155 && (GET_SWZ(swizzle, 1) == SWIZZLE_Y);
2156 case WRITEMASK_XYZ:
2157 return (GET_SWZ(swizzle, 0) == SWIZZLE_X)
2158 && (GET_SWZ(swizzle, 1) == SWIZZLE_Y)
2159 && (GET_SWZ(swizzle, 2) == SWIZZLE_Z);
2160 case WRITEMASK_XYZW:
2161 return swizzle == SWIZZLE_NOOP;
2162 default:
2163 return GL_FALSE;
2164 }
2165 }
2166
2167
2168 /**
2169 * Convert the given swizzle into a writemask. In some cases this
2170 * is trivial, in other cases, we'll need to also swizzle the right
2171 * hand side to put components in the right places.
2172 * \param swizzle the incoming swizzle
2173 * \param writemaskOut returns the writemask
2174 * \param swizzleOut swizzle to apply to the right-hand-side
2175 * \return GL_FALSE for simple writemasks, GL_TRUE for non-simple
2176 */
2177 static GLboolean
2178 swizzle_to_writemask(GLuint swizzle,
2179 GLuint *writemaskOut, GLuint *swizzleOut)
2180 {
2181 GLuint mask = 0x0, newSwizzle[4];
2182 GLint i, size;
2183
2184 /* make new dst writemask, compute size */
2185 for (i = 0; i < 4; i++) {
2186 const GLuint swz = GET_SWZ(swizzle, i);
2187 if (swz == SWIZZLE_NIL) {
2188 /* end */
2189 break;
2190 }
2191 assert(swz >= 0 && swz <= 3);
2192 mask |= (1 << swz);
2193 }
2194 assert(mask <= 0xf);
2195 size = i; /* number of components in mask/swizzle */
2196
2197 *writemaskOut = mask;
2198
2199 /* make new src swizzle, by inversion */
2200 for (i = 0; i < 4; i++) {
2201 newSwizzle[i] = i; /*identity*/
2202 }
2203 for (i = 0; i < size; i++) {
2204 const GLuint swz = GET_SWZ(swizzle, i);
2205 newSwizzle[swz] = i;
2206 }
2207 *swizzleOut = MAKE_SWIZZLE4(newSwizzle[0],
2208 newSwizzle[1],
2209 newSwizzle[2],
2210 newSwizzle[3]);
2211
2212 if (_slang_simple_writemask(mask, *swizzleOut)) {
2213 if (size >= 1)
2214 assert(GET_SWZ(*swizzleOut, 0) == SWIZZLE_X);
2215 if (size >= 2)
2216 assert(GET_SWZ(*swizzleOut, 1) == SWIZZLE_Y);
2217 if (size >= 3)
2218 assert(GET_SWZ(*swizzleOut, 2) == SWIZZLE_Z);
2219 if (size >= 4)
2220 assert(GET_SWZ(*swizzleOut, 3) == SWIZZLE_W);
2221 return GL_TRUE;
2222 }
2223 else
2224 return GL_FALSE;
2225 }
2226
2227
2228 static slang_ir_node *
2229 _slang_gen_swizzle(slang_ir_node *child, GLuint swizzle)
2230 {
2231 slang_ir_node *n = new_node1(IR_SWIZZLE, child);
2232 assert(child);
2233 if (n) {
2234 n->Store = _slang_new_ir_storage(PROGRAM_UNDEFINED, -1, -1);
2235 n->Store->Swizzle = swizzle;
2236 }
2237 return n;
2238 }
2239
2240
2241 /**
2242 * Generate IR tree for an assignment (=).
2243 */
2244 static slang_ir_node *
2245 _slang_gen_assignment(slang_assemble_ctx * A, slang_operation *oper)
2246 {
2247 if (oper->children[0].type == SLANG_OPER_IDENTIFIER) {
2248 /* Check that var is writeable */
2249 slang_variable *var
2250 = _slang_locate_variable(oper->children[0].locals,
2251 oper->children[0].a_id, GL_TRUE);
2252 if (!var) {
2253 slang_info_log_error(A->log, "undefined variable '%s'",
2254 (char *) oper->children[0].a_id);
2255 return NULL;
2256 }
2257 if (var->type.qualifier == SLANG_QUAL_CONST ||
2258 var->type.qualifier == SLANG_QUAL_ATTRIBUTE ||
2259 var->type.qualifier == SLANG_QUAL_UNIFORM ||
2260 (var->type.qualifier == SLANG_QUAL_VARYING &&
2261 A->program->Target == GL_FRAGMENT_PROGRAM_ARB)) {
2262 slang_info_log_error(A->log,
2263 "illegal assignment to read-only variable '%s'",
2264 (char *) oper->children[0].a_id);
2265 return NULL;
2266 }
2267 }
2268
2269 if (oper->children[0].type == SLANG_OPER_IDENTIFIER &&
2270 oper->children[1].type == SLANG_OPER_CALL) {
2271 /* Special case of: x = f(a, b)
2272 * Replace with f(a, b, x) (where x == hidden __retVal out param)
2273 *
2274 * XXX this could be even more effective if we could accomodate
2275 * cases such as "v.x = f();" - would help with typical vertex
2276 * transformation.
2277 */
2278 slang_ir_node *n;
2279 n = _slang_gen_function_call_name(A,
2280 (const char *) oper->children[1].a_id,
2281 &oper->children[1], &oper->children[0]);
2282 return n;
2283 }
2284 else {
2285 slang_ir_node *n, *lhs, *rhs;
2286 lhs = _slang_gen_operation(A, &oper->children[0]);
2287
2288 if (lhs) {
2289 if (!(lhs->Store->File == PROGRAM_OUTPUT ||
2290 lhs->Store->File == PROGRAM_TEMPORARY ||
2291 (lhs->Store->File == PROGRAM_VARYING &&
2292 A->program->Target == GL_VERTEX_PROGRAM_ARB) ||
2293 lhs->Store->File == PROGRAM_UNDEFINED)) {
2294 slang_info_log_error(A->log,
2295 "illegal assignment to read-only l-value");
2296 return NULL;
2297 }
2298 }
2299
2300 rhs = _slang_gen_operation(A, &oper->children[1]);
2301 if (lhs && rhs) {
2302 /* convert lhs swizzle into writemask */
2303 GLuint writemask, newSwizzle;
2304 if (!swizzle_to_writemask(lhs->Store->Swizzle,
2305 &writemask, &newSwizzle)) {
2306 /* Non-simple writemask, need to swizzle right hand side in
2307 * order to put components into the right place.
2308 */
2309 rhs = _slang_gen_swizzle(rhs, newSwizzle);
2310 }
2311 n = new_node2(IR_MOVE, lhs, rhs);
2312 n->Writemask = writemask;
2313 return n;
2314 }
2315 else {
2316 return NULL;
2317 }
2318 }
2319 }
2320
2321
2322 /**
2323 * Generate IR tree for referencing a field in a struct (or basic vector type)
2324 */
2325 static slang_ir_node *
2326 _slang_gen_field(slang_assemble_ctx * A, slang_operation *oper)
2327 {
2328 slang_typeinfo ti;
2329
2330 /* type of struct */
2331 slang_typeinfo_construct(&ti);
2332 _slang_typeof_operation(A, &oper->children[0], &ti);
2333
2334 if (_slang_type_is_vector(ti.spec.type)) {
2335 /* the field should be a swizzle */
2336 const GLuint rows = _slang_type_dim(ti.spec.type);
2337 slang_swizzle swz;
2338 slang_ir_node *n;
2339 GLuint swizzle;
2340 if (!_slang_is_swizzle((char *) oper->a_id, rows, &swz)) {
2341 slang_info_log_error(A->log, "Bad swizzle");
2342 }
2343 swizzle = MAKE_SWIZZLE4(swz.swizzle[0],
2344 swz.swizzle[1],
2345 swz.swizzle[2],
2346 swz.swizzle[3]);
2347
2348 n = _slang_gen_operation(A, &oper->children[0]);
2349 /* create new parent node with swizzle */
2350 if (n)
2351 n = _slang_gen_swizzle(n, swizzle);
2352 return n;
2353 }
2354 else if ( ti.spec.type == SLANG_SPEC_FLOAT
2355 || ti.spec.type == SLANG_SPEC_INT
2356 || ti.spec.type == SLANG_SPEC_BOOL) {
2357 const GLuint rows = 1;
2358 slang_swizzle swz;
2359 slang_ir_node *n;
2360 GLuint swizzle;
2361 if (!_slang_is_swizzle((char *) oper->a_id, rows, &swz)) {
2362 slang_info_log_error(A->log, "Bad swizzle");
2363 }
2364 swizzle = MAKE_SWIZZLE4(swz.swizzle[0],
2365 swz.swizzle[1],
2366 swz.swizzle[2],
2367 swz.swizzle[3]);
2368 n = _slang_gen_operation(A, &oper->children[0]);
2369 /* create new parent node with swizzle */
2370 n = _slang_gen_swizzle(n, swizzle);
2371 return n;
2372 }
2373 else {
2374 /* the field is a structure member (base.field) */
2375 /* oper->children[0] is the base */
2376 /* oper->a_id is the field name */
2377 slang_ir_node *base, *n;
2378 slang_typeinfo field_ti;
2379 GLint fieldSize, fieldOffset = -1;
2380 /* type of field */
2381 slang_typeinfo_construct(&field_ti);
2382 _slang_typeof_operation(A, oper, &field_ti);
2383
2384 fieldSize = _slang_sizeof_type_specifier(&field_ti.spec);
2385 if (fieldSize > 0)
2386 fieldOffset = _slang_field_offset(&ti.spec, oper->a_id);
2387
2388 if (fieldSize == 0 || fieldOffset < 0) {
2389 slang_info_log_error(A->log,
2390 "\"%s\" is not a member of struct \"%s\"",
2391 (char *) oper->a_id,
2392 (char *) ti.spec._struct->a_name);
2393 return NULL;
2394 }
2395 assert(fieldSize >= 0);
2396
2397 base = _slang_gen_operation(A, &oper->children[0]);
2398 if (!base) {
2399 /* error msg should have already been logged */
2400 return NULL;
2401 }
2402
2403 n = new_node1(IR_FIELD, base);
2404 if (n) {
2405 n->Field = (char *) oper->a_id;
2406 n->FieldOffset = fieldOffset;
2407 assert(n->FieldOffset >= 0);
2408 n->Store = _slang_new_ir_storage(base->Store->File,
2409 base->Store->Index,
2410 fieldSize);
2411 }
2412 return n;
2413
2414 #if 0
2415 _mesa_problem(NULL, "glsl structs/fields not supported yet");
2416 return NULL;
2417 #endif
2418 }
2419 }
2420
2421
2422 /**
2423 * Gen code for array indexing.
2424 */
2425 static slang_ir_node *
2426 _slang_gen_subscript(slang_assemble_ctx * A, slang_operation *oper)
2427 {
2428 slang_typeinfo array_ti;
2429
2430 /* get array's type info */
2431 slang_typeinfo_construct(&array_ti);
2432 _slang_typeof_operation(A, &oper->children[0], &array_ti);
2433
2434 if (_slang_type_is_vector(array_ti.spec.type)) {
2435 /* indexing a simple vector type: "vec4 v; v[0]=p;" */
2436 /* translate the index into a swizzle/writemask: "v.x=p" */
2437 const GLuint max = _slang_type_dim(array_ti.spec.type);
2438 GLint index;
2439 slang_ir_node *n;
2440
2441 index = (GLint) oper->children[1].literal[0];
2442 if (oper->children[1].type != SLANG_OPER_LITERAL_INT ||
2443 index >= max) {
2444 slang_info_log_error(A->log, "Invalid array index for vector type");
2445 return NULL;
2446 }
2447
2448 n = _slang_gen_operation(A, &oper->children[0]);
2449 if (n) {
2450 /* use swizzle to access the element */
2451 GLuint swizzle = MAKE_SWIZZLE4(SWIZZLE_X + index,
2452 SWIZZLE_NIL,
2453 SWIZZLE_NIL,
2454 SWIZZLE_NIL);
2455 n = _slang_gen_swizzle(n, swizzle);
2456 /*n->Store = _slang_clone_ir_storage_swz(n->Store, */
2457 n->Writemask = WRITEMASK_X << index;
2458 }
2459 return n;
2460 }
2461 else {
2462 /* conventional array */
2463 slang_typeinfo elem_ti;
2464 slang_ir_node *elem, *array, *index;
2465 GLint elemSize, arrayLen;
2466
2467 /* size of array element */
2468 slang_typeinfo_construct(&elem_ti);
2469 _slang_typeof_operation(A, oper, &elem_ti);
2470 elemSize = _slang_sizeof_type_specifier(&elem_ti.spec);
2471
2472 if (_slang_type_is_matrix(array_ti.spec.type))
2473 arrayLen = _slang_type_dim(array_ti.spec.type);
2474 else
2475 arrayLen = array_ti.array_len;
2476
2477 slang_typeinfo_destruct(&array_ti);
2478 slang_typeinfo_destruct(&elem_ti);
2479
2480 if (elemSize <= 0) {
2481 /* unknown var or type */
2482 slang_info_log_error(A->log, "Undefined variable or type");
2483 return NULL;
2484 }
2485
2486 array = _slang_gen_operation(A, &oper->children[0]);
2487 index = _slang_gen_operation(A, &oper->children[1]);
2488 if (array && index) {
2489 /* bounds check */
2490 if (index->Opcode == IR_FLOAT &&
2491 ((int) index->Value[0] < 0 ||
2492 (int) index->Value[0] >= arrayLen)) {
2493 slang_info_log_error(A->log,
2494 "Array index out of bounds (index=%d size=%d)",
2495 (int) index->Value[0], arrayLen);
2496 _slang_free_ir_tree(array);
2497 _slang_free_ir_tree(index);
2498 return NULL;
2499 }
2500
2501 elem = new_node2(IR_ELEMENT, array, index);
2502 elem->Store = _slang_new_ir_storage(array->Store->File,
2503 array->Store->Index,
2504 elemSize);
2505 /* XXX try to do some array bounds checking here */
2506 return elem;
2507 }
2508 else {
2509 _slang_free_ir_tree(array);
2510 _slang_free_ir_tree(index);
2511 return NULL;
2512 }
2513 }
2514 }
2515
2516
2517 /**
2518 * Generate IR tree for a slang_operation (AST node)
2519 */
2520 static slang_ir_node *
2521 _slang_gen_operation(slang_assemble_ctx * A, slang_operation *oper)
2522 {
2523 switch (oper->type) {
2524 case SLANG_OPER_BLOCK_NEW_SCOPE:
2525 {
2526 slang_ir_node *n;
2527
2528 _slang_push_var_table(A->vartable);
2529
2530 oper->type = SLANG_OPER_BLOCK_NO_NEW_SCOPE; /* temp change */
2531 n = _slang_gen_operation(A, oper);
2532 oper->type = SLANG_OPER_BLOCK_NEW_SCOPE; /* restore */
2533
2534 _slang_pop_var_table(A->vartable);
2535
2536 if (n)
2537 n = new_node1(IR_SCOPE, n);
2538 return n;
2539 }
2540 break;
2541
2542 case SLANG_OPER_BLOCK_NO_NEW_SCOPE:
2543 /* list of operations */
2544 if (oper->num_children > 0)
2545 {
2546 slang_ir_node *n, *tree = NULL;
2547 GLuint i;
2548
2549 for (i = 0; i < oper->num_children; i++) {
2550 n = _slang_gen_operation(A, &oper->children[i]);
2551 if (!n) {
2552 _slang_free_ir_tree(tree);
2553 return NULL; /* error must have occured */
2554 }
2555 tree = new_seq(tree, n);
2556 }
2557
2558 #if 00
2559 if (oper->locals->num_variables > 0) {
2560 int i;
2561 /*
2562 printf("\n****** Deallocate vars in scope!\n");
2563 */
2564 for (i = 0; i < oper->locals->num_variables; i++) {
2565 slang_variable *v = oper->locals->variables + i;
2566 if (v->aux) {
2567 slang_ir_storage *store = (slang_ir_storage *) v->aux;
2568 /*
2569 printf(" Deallocate var %s\n", (char*) v->a_name);
2570 */
2571 assert(store->File == PROGRAM_TEMPORARY);
2572 assert(store->Index >= 0);
2573 _slang_free_temp(A->vartable, store->Index, store->Size);
2574 }
2575 }
2576 }
2577 #endif
2578 return tree;
2579 }
2580 else {
2581 return new_node0(IR_NOP);
2582 }
2583
2584 case SLANG_OPER_EXPRESSION:
2585 return _slang_gen_operation(A, &oper->children[0]);
2586
2587 case SLANG_OPER_FOR:
2588 return _slang_gen_for(A, oper);
2589 case SLANG_OPER_DO:
2590 return _slang_gen_do(A, oper);
2591 case SLANG_OPER_WHILE:
2592 return _slang_gen_while(A, oper);
2593 case SLANG_OPER_BREAK:
2594 if (!A->CurLoop) {
2595 slang_info_log_error(A->log, "'break' not in loop");
2596 return NULL;
2597 }
2598 return new_break(A->CurLoop);
2599 case SLANG_OPER_CONTINUE:
2600 if (!A->CurLoop) {
2601 slang_info_log_error(A->log, "'continue' not in loop");
2602 return NULL;
2603 }
2604 return _slang_gen_continue(A, oper);
2605 case SLANG_OPER_DISCARD:
2606 return new_node0(IR_KILL);
2607
2608 case SLANG_OPER_EQUAL:
2609 return new_node2(IR_EQUAL,
2610 _slang_gen_operation(A, &oper->children[0]),
2611 _slang_gen_operation(A, &oper->children[1]));
2612 case SLANG_OPER_NOTEQUAL:
2613 return new_node2(IR_NOTEQUAL,
2614 _slang_gen_operation(A, &oper->children[0]),
2615 _slang_gen_operation(A, &oper->children[1]));
2616 case SLANG_OPER_GREATER:
2617 return new_node2(IR_SGT,
2618 _slang_gen_operation(A, &oper->children[0]),
2619 _slang_gen_operation(A, &oper->children[1]));
2620 case SLANG_OPER_LESS:
2621 return new_node2(IR_SLT,
2622 _slang_gen_operation(A, &oper->children[0]),
2623 _slang_gen_operation(A, &oper->children[1]));
2624 case SLANG_OPER_GREATEREQUAL:
2625 return new_node2(IR_SGE,
2626 _slang_gen_operation(A, &oper->children[0]),
2627 _slang_gen_operation(A, &oper->children[1]));
2628 case SLANG_OPER_LESSEQUAL:
2629 return new_node2(IR_SLE,
2630 _slang_gen_operation(A, &oper->children[0]),
2631 _slang_gen_operation(A, &oper->children[1]));
2632 case SLANG_OPER_ADD:
2633 {
2634 slang_ir_node *n;
2635 assert(oper->num_children == 2);
2636 n = _slang_gen_function_call_name(A, "+", oper, NULL);
2637 return n;
2638 }
2639 case SLANG_OPER_SUBTRACT:
2640 {
2641 slang_ir_node *n;
2642 assert(oper->num_children == 2);
2643 n = _slang_gen_function_call_name(A, "-", oper, NULL);
2644 return n;
2645 }
2646 case SLANG_OPER_MULTIPLY:
2647 {
2648 slang_ir_node *n;
2649 assert(oper->num_children == 2);
2650 n = _slang_gen_function_call_name(A, "*", oper, NULL);
2651 return n;
2652 }
2653 case SLANG_OPER_DIVIDE:
2654 {
2655 slang_ir_node *n;
2656 assert(oper->num_children == 2);
2657 n = _slang_gen_function_call_name(A, "/", oper, NULL);
2658 return n;
2659 }
2660 case SLANG_OPER_MINUS:
2661 {
2662 slang_ir_node *n;
2663 assert(oper->num_children == 1);
2664 n = _slang_gen_function_call_name(A, "-", oper, NULL);
2665 return n;
2666 }
2667 case SLANG_OPER_PLUS:
2668 /* +expr --> do nothing */
2669 return _slang_gen_operation(A, &oper->children[0]);
2670 case SLANG_OPER_VARIABLE_DECL:
2671 return _slang_gen_declaration(A, oper);
2672 case SLANG_OPER_ASSIGN:
2673 return _slang_gen_assignment(A, oper);
2674 case SLANG_OPER_ADDASSIGN:
2675 {
2676 slang_ir_node *n;
2677 assert(oper->num_children == 2);
2678 n = _slang_gen_function_call_name(A, "+=", oper, &oper->children[0]);
2679 return n;
2680 }
2681 case SLANG_OPER_SUBASSIGN:
2682 {
2683 slang_ir_node *n;
2684 assert(oper->num_children == 2);
2685 n = _slang_gen_function_call_name(A, "-=", oper, &oper->children[0]);
2686 return n;
2687 }
2688 break;
2689 case SLANG_OPER_MULASSIGN:
2690 {
2691 slang_ir_node *n;
2692 assert(oper->num_children == 2);
2693 n = _slang_gen_function_call_name(A, "*=", oper, &oper->children[0]);
2694 return n;
2695 }
2696 case SLANG_OPER_DIVASSIGN:
2697 {
2698 slang_ir_node *n;
2699 assert(oper->num_children == 2);
2700 n = _slang_gen_function_call_name(A, "/=", oper, &oper->children[0]);
2701 return n;
2702 }
2703 case SLANG_OPER_LOGICALAND:
2704 {
2705 slang_ir_node *n;
2706 assert(oper->num_children == 2);
2707 n = _slang_gen_logical_and(A, oper);
2708 return n;
2709 }
2710 case SLANG_OPER_LOGICALOR:
2711 {
2712 slang_ir_node *n;
2713 assert(oper->num_children == 2);
2714 n = _slang_gen_logical_or(A, oper);
2715 return n;
2716 }
2717 case SLANG_OPER_LOGICALXOR:
2718 return _slang_gen_xor(A, oper);
2719 case SLANG_OPER_NOT:
2720 return _slang_gen_not(A, oper);
2721 case SLANG_OPER_SELECT: /* b ? x : y */
2722 {
2723 slang_ir_node *n;
2724 assert(oper->num_children == 3);
2725 n = _slang_gen_select(A, oper);
2726 return n;
2727 }
2728
2729 case SLANG_OPER_ASM:
2730 return _slang_gen_asm(A, oper, NULL);
2731 case SLANG_OPER_CALL:
2732 return _slang_gen_function_call_name(A, (const char *) oper->a_id,
2733 oper, NULL);
2734 case SLANG_OPER_RETURN:
2735 return _slang_gen_return(A, oper);
2736 case SLANG_OPER_LABEL:
2737 return new_label(oper->label);
2738 case SLANG_OPER_IDENTIFIER:
2739 return _slang_gen_variable(A, oper);
2740 case SLANG_OPER_IF:
2741 return _slang_gen_if(A, oper);
2742 case SLANG_OPER_FIELD:
2743 return _slang_gen_field(A, oper);
2744 case SLANG_OPER_SUBSCRIPT:
2745 return _slang_gen_subscript(A, oper);
2746 case SLANG_OPER_LITERAL_FLOAT:
2747 /* fall-through */
2748 case SLANG_OPER_LITERAL_INT:
2749 /* fall-through */
2750 case SLANG_OPER_LITERAL_BOOL:
2751 return new_float_literal(oper->literal, oper->literal_size);
2752
2753 case SLANG_OPER_POSTINCREMENT: /* var++ */
2754 {
2755 slang_ir_node *n;
2756 assert(oper->num_children == 1);
2757 n = _slang_gen_function_call_name(A, "__postIncr", oper, NULL);
2758 return n;
2759 }
2760 case SLANG_OPER_POSTDECREMENT: /* var-- */
2761 {
2762 slang_ir_node *n;
2763 assert(oper->num_children == 1);
2764 n = _slang_gen_function_call_name(A, "__postDecr", oper, NULL);
2765 return n;
2766 }
2767 case SLANG_OPER_PREINCREMENT: /* ++var */
2768 {
2769 slang_ir_node *n;
2770 assert(oper->num_children == 1);
2771 n = _slang_gen_function_call_name(A, "++", oper, NULL);
2772 return n;
2773 }
2774 case SLANG_OPER_PREDECREMENT: /* --var */
2775 {
2776 slang_ir_node *n;
2777 assert(oper->num_children == 1);
2778 n = _slang_gen_function_call_name(A, "--", oper, NULL);
2779 return n;
2780 }
2781
2782 case SLANG_OPER_NON_INLINED_CALL:
2783 case SLANG_OPER_SEQUENCE:
2784 {
2785 slang_ir_node *tree = NULL;
2786 GLuint i;
2787 for (i = 0; i < oper->num_children; i++) {
2788 slang_ir_node *n = _slang_gen_operation(A, &oper->children[i]);
2789 tree = new_seq(tree, n);
2790 }
2791 if (oper->type == SLANG_OPER_NON_INLINED_CALL) {
2792 tree = new_function_call(tree, oper->label);
2793 }
2794 return tree;
2795 }
2796
2797 case SLANG_OPER_NONE:
2798 case SLANG_OPER_VOID:
2799 /* returning NULL here would generate an error */
2800 return new_node0(IR_NOP);
2801
2802 default:
2803 _mesa_problem(NULL, "bad node type %d in _slang_gen_operation",
2804 oper->type);
2805 return new_node0(IR_NOP);
2806 }
2807
2808 return NULL;
2809 }
2810
2811
2812
2813 /**
2814 * Called by compiler when a global variable has been parsed/compiled.
2815 * Here we examine the variable's type to determine what kind of register
2816 * storage will be used.
2817 *
2818 * A uniform such as "gl_Position" will become the register specification
2819 * (PROGRAM_OUTPUT, VERT_RESULT_HPOS). Or, uniform "gl_FogFragCoord"
2820 * will be (PROGRAM_INPUT, FRAG_ATTRIB_FOGC).
2821 *
2822 * Samplers are interesting. For "uniform sampler2D tex;" we'll specify
2823 * (PROGRAM_SAMPLER, index) where index is resolved at link-time to an
2824 * actual texture unit (as specified by the user calling glUniform1i()).
2825 */
2826 GLboolean
2827 _slang_codegen_global_variable(slang_assemble_ctx *A, slang_variable *var,
2828 slang_unit_type type)
2829 {
2830 struct gl_program *prog = A->program;
2831 const char *varName = (char *) var->a_name;
2832 GLboolean success = GL_TRUE;
2833 slang_ir_storage *store = NULL;
2834 int dbg = 0;
2835 const GLenum datatype = _slang_gltype_from_specifier(&var->type.specifier);
2836 const GLint texIndex = sampler_to_texture_index(var->type.specifier.type);
2837
2838 if (texIndex != -1) {
2839 /* This is a texture sampler variable...
2840 * store->File = PROGRAM_SAMPLER
2841 * store->Index = sampler number (0..7, typically)
2842 * store->Size = texture type index (1D, 2D, 3D, cube, etc)
2843 */
2844 GLint sampNum = _mesa_add_sampler(prog->Parameters, varName, datatype);
2845 store = _slang_new_ir_storage(PROGRAM_SAMPLER, sampNum, texIndex);
2846 if (dbg) printf("SAMPLER ");
2847 }
2848 else if (var->type.qualifier == SLANG_QUAL_UNIFORM) {
2849 /* Uniform variable */
2850 const GLint size = _slang_sizeof_type_specifier(&var->type.specifier)
2851 * MAX2(var->array_len, 1);
2852 if (prog) {
2853 /* user-defined uniform */
2854 if (datatype == GL_NONE) {
2855 if (var->type.specifier.type == SLANG_SPEC_STRUCT) {
2856 _mesa_problem(NULL, "user-declared uniform structs not supported yet");
2857 /* XXX what we need to do is unroll the struct into its
2858 * basic types, creating a uniform variable for each.
2859 * For example:
2860 * struct foo {
2861 * vec3 a;
2862 * vec4 b;
2863 * };
2864 * uniform foo f;
2865 *
2866 * Should produce uniforms:
2867 * "f.a" (GL_FLOAT_VEC3)
2868 * "f.b" (GL_FLOAT_VEC4)
2869 */
2870 }
2871 else {
2872 slang_info_log_error(A->log,
2873 "invalid datatype for uniform variable %s",
2874 (char *) var->a_name);
2875 }
2876 return GL_FALSE;
2877 }
2878 else {
2879 GLint uniformLoc = _mesa_add_uniform(prog->Parameters, varName,
2880 size, datatype);
2881 store = _slang_new_ir_storage(PROGRAM_UNIFORM, uniformLoc, size);
2882 }
2883 }
2884 else {
2885 /* pre-defined uniform, like gl_ModelviewMatrix */
2886 /* We know it's a uniform, but don't allocate storage unless
2887 * it's really used.
2888 */
2889 store = _slang_new_ir_storage(PROGRAM_STATE_VAR, -1, size);
2890 }
2891 if (dbg) printf("UNIFORM (sz %d) ", size);
2892 }
2893 else if (var->type.qualifier == SLANG_QUAL_VARYING) {
2894 const GLint size = 4; /* XXX fix */
2895 if (prog) {
2896 /* user-defined varying */
2897 GLint varyingLoc = _mesa_add_varying(prog->Varying, varName, size);
2898 store = _slang_new_ir_storage(PROGRAM_VARYING, varyingLoc, size);
2899 }
2900 else {
2901 /* pre-defined varying, like gl_Color or gl_TexCoord */
2902 if (type == SLANG_UNIT_FRAGMENT_BUILTIN) {
2903 GLuint swizzle;
2904 GLint index = _slang_input_index(varName, GL_FRAGMENT_PROGRAM_ARB,
2905 &swizzle);
2906 assert(index >= 0);
2907 store = _slang_new_ir_storage(PROGRAM_INPUT, index, size);
2908 store->Swizzle = swizzle;
2909 assert(index < FRAG_ATTRIB_MAX);
2910 }
2911 else {
2912 GLint index = _slang_output_index(varName, GL_VERTEX_PROGRAM_ARB);
2913 assert(index >= 0);
2914 assert(type == SLANG_UNIT_VERTEX_BUILTIN);
2915 store = _slang_new_ir_storage(PROGRAM_OUTPUT, index, size);
2916 assert(index < VERT_RESULT_MAX);
2917 }
2918 if (dbg) printf("V/F ");
2919 }
2920 if (dbg) printf("VARYING ");
2921 }
2922 else if (var->type.qualifier == SLANG_QUAL_ATTRIBUTE) {
2923 if (prog) {
2924 /* user-defined vertex attribute */
2925 const GLint size = _slang_sizeof_type_specifier(&var->type.specifier);
2926 const GLint attr = -1; /* unknown */
2927 GLint index = _mesa_add_attribute(prog->Attributes, varName,
2928 size, attr);
2929 assert(index >= 0);
2930 store = _slang_new_ir_storage(PROGRAM_INPUT,
2931 VERT_ATTRIB_GENERIC0 + index, size);
2932 }
2933 else {
2934 /* pre-defined vertex attrib */
2935 GLuint swizzle;
2936 GLint index = _slang_input_index(varName, GL_VERTEX_PROGRAM_ARB,
2937 &swizzle);
2938 GLint size = 4; /* XXX? */
2939 assert(index >= 0);
2940 store = _slang_new_ir_storage(PROGRAM_INPUT, index, size);
2941 store->Swizzle = swizzle;
2942 }
2943 if (dbg) printf("ATTRIB ");
2944 }
2945 else if (var->type.qualifier == SLANG_QUAL_FIXEDINPUT) {
2946 GLuint swizzle = SWIZZLE_XYZW; /* silence compiler warning */
2947 GLint index = _slang_input_index(varName, GL_FRAGMENT_PROGRAM_ARB,
2948 &swizzle);
2949 GLint size = 4; /* XXX? */
2950 store = _slang_new_ir_storage(PROGRAM_INPUT, index, size);
2951 store->Swizzle = swizzle;
2952 if (dbg) printf("INPUT ");
2953 }
2954 else if (var->type.qualifier == SLANG_QUAL_FIXEDOUTPUT) {
2955 if (type == SLANG_UNIT_VERTEX_BUILTIN) {
2956 GLint index = _slang_output_index(varName, GL_VERTEX_PROGRAM_ARB);
2957 GLint size = 4; /* XXX? */
2958 store = _slang_new_ir_storage(PROGRAM_OUTPUT, index, size);
2959 }
2960 else {
2961 GLint index = _slang_output_index(varName, GL_FRAGMENT_PROGRAM_ARB);
2962 GLint size = 4; /* XXX? */
2963 assert(type == SLANG_UNIT_FRAGMENT_BUILTIN);
2964 store = _slang_new_ir_storage(PROGRAM_OUTPUT, index, size);
2965 }
2966 if (dbg) printf("OUTPUT ");
2967 }
2968 else if (var->type.qualifier == SLANG_QUAL_CONST && !prog) {
2969 /* pre-defined global constant, like gl_MaxLights */
2970 const GLint size = _slang_sizeof_type_specifier(&var->type.specifier);
2971 store = _slang_new_ir_storage(PROGRAM_CONSTANT, -1, size);
2972 if (dbg) printf("CONST ");
2973 }
2974 else {
2975 /* ordinary variable (may be const) */
2976 slang_ir_node *n;
2977
2978 /* IR node to declare the variable */
2979 n = _slang_gen_var_decl(A, var);
2980
2981 /* IR code for the var's initializer, if present */
2982 if (var->initializer) {
2983 slang_ir_node *lhs, *rhs, *init;
2984
2985 /* Generate IR_MOVE instruction to initialize the variable */
2986 lhs = new_node0(IR_VAR);
2987 lhs->Var = var;
2988 lhs->Store = n->Store;
2989
2990 /* constant folding, etc */
2991 _slang_simplify(var->initializer, &A->space, A->atoms);
2992
2993 rhs = _slang_gen_operation(A, var->initializer);
2994 assert(rhs);
2995 init = new_node2(IR_MOVE, lhs, rhs);
2996 n = new_seq(n, init);
2997 }
2998
2999 success = _slang_emit_code(n, A->vartable, A->program, GL_FALSE, A->log);
3000
3001 _slang_free_ir_tree(n);
3002 }
3003
3004 if (dbg) printf("GLOBAL VAR %s idx %d\n", (char*) var->a_name,
3005 store ? store->Index : -2);
3006
3007 if (store)
3008 var->aux = store; /* save var's storage info */
3009
3010 return success;
3011 }
3012
3013
3014 /**
3015 * Produce an IR tree from a function AST (fun->body).
3016 * Then call the code emitter to convert the IR tree into gl_program
3017 * instructions.
3018 */
3019 GLboolean
3020 _slang_codegen_function(slang_assemble_ctx * A, slang_function * fun)
3021 {
3022 slang_ir_node *n;
3023 GLboolean success = GL_TRUE;
3024
3025 if (_mesa_strcmp((char *) fun->header.a_name, "main") != 0) {
3026 /* we only really generate code for main, all other functions get
3027 * inlined.
3028 */
3029 #if 0
3030 /* do some basic error checking though */
3031 if (fun->header.type.specifier.type != SLANG_SPEC_VOID) {
3032 /* check that non-void functions actually return something */
3033 slang_operation *op
3034 = _slang_find_node_type(fun->body, SLANG_OPER_RETURN);
3035 if (!op) {
3036 slang_info_log_error(A->log,
3037 "function \"%s\" has no return statement",
3038 (char *) fun->header.a_name);
3039 printf(
3040 "function \"%s\" has no return statement\n",
3041 (char *) fun->header.a_name);
3042 return GL_FALSE;
3043 }
3044 }
3045 #endif
3046 return GL_TRUE; /* not an error */
3047 }
3048
3049 #if 0
3050 printf("\n*********** codegen_function %s\n", (char *) fun->header.a_name);
3051 slang_print_function(fun, 1);
3052 #endif
3053
3054 /* should have been allocated earlier: */
3055 assert(A->program->Parameters );
3056 assert(A->program->Varying);
3057 assert(A->vartable);
3058 A->CurLoop = NULL;
3059 A->CurFunction = fun;
3060
3061 /* fold constant expressions, etc. */
3062 _slang_simplify(fun->body, &A->space, A->atoms);
3063
3064 #if 0
3065 printf("\n*********** simplified %s\n", (char *) fun->header.a_name);
3066 slang_print_function(fun, 1);
3067 #endif
3068
3069 /* Create an end-of-function label */
3070 A->curFuncEndLabel = _slang_label_new("__endOfFunc__main");
3071
3072 /* push new vartable scope */
3073 _slang_push_var_table(A->vartable);
3074
3075 /* Generate IR tree for the function body code */
3076 n = _slang_gen_operation(A, fun->body);
3077 if (n)
3078 n = new_node1(IR_SCOPE, n);
3079
3080 /* pop vartable, restore previous */
3081 _slang_pop_var_table(A->vartable);
3082
3083 if (!n) {
3084 /* XXX record error */
3085 return GL_FALSE;
3086 }
3087
3088 /* append an end-of-function-label to IR tree */
3089 n = new_seq(n, new_label(A->curFuncEndLabel));
3090
3091 /*_slang_label_delete(A->curFuncEndLabel);*/
3092 A->curFuncEndLabel = NULL;
3093
3094 #if 0
3095 printf("************* New AST for %s *****\n", (char*)fun->header.a_name);
3096 slang_print_function(fun, 1);
3097 #endif
3098 #if 0
3099 printf("************* IR for %s *******\n", (char*)fun->header.a_name);
3100 _slang_print_ir_tree(n, 0);
3101 #endif
3102 #if 0
3103 printf("************* End codegen function ************\n\n");
3104 #endif
3105
3106 /* Emit program instructions */
3107 success = _slang_emit_code(n, A->vartable, A->program, GL_TRUE, A->log);
3108 _slang_free_ir_tree(n);
3109
3110 /* free codegen context */
3111 /*
3112 _mesa_free(A->codegen);
3113 */
3114
3115 return success;
3116 }
3117