2 * Mesa 3-D graphics library
5 * Copyright (C) 2005-2007 Brian Paul All Rights Reserved.
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:
14 * The above copyright notice and this permission notice shall be included
15 * in all copies or substantial portions of the Software.
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.
26 * \file slang_codegen.c
27 * Generate IR tree from AST.
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.
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_print.h"
47 #include "shader/prog_statevars.h"
48 #include "slang_typeinfo.h"
49 #include "slang_codegen.h"
50 #include "slang_compile.h"
51 #include "slang_label.h"
52 #include "slang_mem.h"
53 #include "slang_simplify.h"
54 #include "slang_emit.h"
55 #include "slang_vartable.h"
57 #include "slang_print.h"
60 static slang_ir_node
*
61 _slang_gen_operation(slang_assemble_ctx
* A
, slang_operation
*oper
);
65 is_sampler_type(const slang_fully_specified_type
*t
)
67 switch (t
->specifier
.type
) {
68 case SLANG_SPEC_SAMPLER1D
:
69 case SLANG_SPEC_SAMPLER2D
:
70 case SLANG_SPEC_SAMPLER3D
:
71 case SLANG_SPEC_SAMPLERCUBE
:
72 case SLANG_SPEC_SAMPLER1DSHADOW
:
73 case SLANG_SPEC_SAMPLER2DSHADOW
:
74 case SLANG_SPEC_SAMPLER2DRECT
:
75 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
84 * Return the offset (in floats or ints) of the named field within
85 * the given struct. Return -1 if field not found.
86 * If field is NULL, return the size of the struct instead.
89 _slang_field_offset(const slang_type_specifier
*spec
, slang_atom field
)
93 for (i
= 0; i
< spec
->_struct
->fields
->num_variables
; i
++) {
94 const slang_variable
*v
= spec
->_struct
->fields
->variables
[i
];
95 const GLuint sz
= _slang_sizeof_type_specifier(&v
->type
.specifier
);
97 /* types larger than 1 float are register (4-float) aligned */
98 offset
= (offset
+ 3) & ~3;
100 if (field
&& v
->a_name
== field
) {
106 return -1; /* field not found */
108 return offset
; /* struct size */
113 * Return the size (in floats) of the given type specifier.
114 * If the size is greater than 4, the size should be a multiple of 4
115 * so that the correct number of 4-float registers are allocated.
116 * For example, a mat3x2 is size 12 because we want to store the
117 * 3 columns in 3 float[4] registers.
120 _slang_sizeof_type_specifier(const slang_type_specifier
*spec
)
123 switch (spec
->type
) {
124 case SLANG_SPEC_VOID
:
127 case SLANG_SPEC_BOOL
:
130 case SLANG_SPEC_BVEC2
:
133 case SLANG_SPEC_BVEC3
:
136 case SLANG_SPEC_BVEC4
:
142 case SLANG_SPEC_IVEC2
:
145 case SLANG_SPEC_IVEC3
:
148 case SLANG_SPEC_IVEC4
:
151 case SLANG_SPEC_FLOAT
:
154 case SLANG_SPEC_VEC2
:
157 case SLANG_SPEC_VEC3
:
160 case SLANG_SPEC_VEC4
:
163 case SLANG_SPEC_MAT2
:
164 sz
= 2 * 4; /* 2 columns (regs) */
166 case SLANG_SPEC_MAT3
:
169 case SLANG_SPEC_MAT4
:
172 case SLANG_SPEC_MAT23
:
173 sz
= 2 * 4; /* 2 columns (regs) */
175 case SLANG_SPEC_MAT32
:
176 sz
= 3 * 4; /* 3 columns (regs) */
178 case SLANG_SPEC_MAT24
:
181 case SLANG_SPEC_MAT42
:
182 sz
= 4 * 4; /* 4 columns (regs) */
184 case SLANG_SPEC_MAT34
:
187 case SLANG_SPEC_MAT43
:
188 sz
= 4 * 4; /* 4 columns (regs) */
190 case SLANG_SPEC_SAMPLER1D
:
191 case SLANG_SPEC_SAMPLER2D
:
192 case SLANG_SPEC_SAMPLER3D
:
193 case SLANG_SPEC_SAMPLERCUBE
:
194 case SLANG_SPEC_SAMPLER1DSHADOW
:
195 case SLANG_SPEC_SAMPLER2DSHADOW
:
196 case SLANG_SPEC_SAMPLER2DRECT
:
197 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
198 sz
= 1; /* a sampler is basically just an integer index */
200 case SLANG_SPEC_STRUCT
:
201 sz
= _slang_field_offset(spec
, 0); /* special use */
203 sz
= (sz
+ 3) & ~0x3; /* round up to multiple of four */
206 case SLANG_SPEC_ARRAY
:
207 sz
= _slang_sizeof_type_specifier(spec
->_array
);
210 _mesa_problem(NULL
, "Unexpected type in _slang_sizeof_type_specifier()");
215 /* if size is > 4, it should be a multiple of four */
216 assert((sz
& 0x3) == 0);
223 * Establish the binding between a slang_ir_node and a slang_variable.
224 * Then, allocate/attach a slang_ir_storage object to the IR node if needed.
225 * The IR node must be a IR_VAR or IR_VAR_DECL node.
226 * \param n the IR node
227 * \param var the variable to associate with the IR node
230 _slang_attach_storage(slang_ir_node
*n
, slang_variable
*var
)
234 assert(n
->Opcode
== IR_VAR
|| n
->Opcode
== IR_VAR_DECL
);
235 assert(!n
->Var
|| n
->Var
== var
);
240 /* need to setup storage */
241 if (n
->Var
&& n
->Var
->aux
) {
242 /* node storage info = var storage info */
243 n
->Store
= (slang_ir_storage
*) n
->Var
->aux
;
246 /* alloc new storage info */
247 n
->Store
= _slang_new_ir_storage(PROGRAM_UNDEFINED
, -7, -5);
249 printf("%s var=%s Store=%p Size=%d\n", __FUNCTION__
,
251 (void*) n
->Store
, n
->Store
->Size
);
254 n
->Var
->aux
= n
->Store
;
262 * Return the TEXTURE_*_INDEX value that corresponds to a sampler type,
263 * or -1 if the type is not a sampler.
266 sampler_to_texture_index(const slang_type_specifier_type type
)
269 case SLANG_SPEC_SAMPLER1D
:
270 return TEXTURE_1D_INDEX
;
271 case SLANG_SPEC_SAMPLER2D
:
272 return TEXTURE_2D_INDEX
;
273 case SLANG_SPEC_SAMPLER3D
:
274 return TEXTURE_3D_INDEX
;
275 case SLANG_SPEC_SAMPLERCUBE
:
276 return TEXTURE_CUBE_INDEX
;
277 case SLANG_SPEC_SAMPLER1DSHADOW
:
278 return TEXTURE_1D_INDEX
; /* XXX fix */
279 case SLANG_SPEC_SAMPLER2DSHADOW
:
280 return TEXTURE_2D_INDEX
; /* XXX fix */
281 case SLANG_SPEC_SAMPLER2DRECT
:
282 return TEXTURE_RECT_INDEX
;
283 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
284 return TEXTURE_RECT_INDEX
; /* XXX fix */
291 #define SWIZZLE_ZWWW MAKE_SWIZZLE4(SWIZZLE_Z, SWIZZLE_W, SWIZZLE_W, SWIZZLE_W)
294 * Return the VERT_ATTRIB_* or FRAG_ATTRIB_* value that corresponds to
295 * a vertex or fragment program input variable. Return -1 if the input
297 * XXX return size too
300 _slang_input_index(const char *name
, GLenum target
, GLuint
*swizzleOut
)
307 static const struct input_info vertInputs
[] = {
308 { "gl_Vertex", VERT_ATTRIB_POS
, SWIZZLE_NOOP
},
309 { "gl_Normal", VERT_ATTRIB_NORMAL
, SWIZZLE_NOOP
},
310 { "gl_Color", VERT_ATTRIB_COLOR0
, SWIZZLE_NOOP
},
311 { "gl_SecondaryColor", VERT_ATTRIB_COLOR1
, SWIZZLE_NOOP
},
312 { "gl_FogCoord", VERT_ATTRIB_FOG
, SWIZZLE_XXXX
},
313 { "gl_MultiTexCoord0", VERT_ATTRIB_TEX0
, SWIZZLE_NOOP
},
314 { "gl_MultiTexCoord1", VERT_ATTRIB_TEX1
, SWIZZLE_NOOP
},
315 { "gl_MultiTexCoord2", VERT_ATTRIB_TEX2
, SWIZZLE_NOOP
},
316 { "gl_MultiTexCoord3", VERT_ATTRIB_TEX3
, SWIZZLE_NOOP
},
317 { "gl_MultiTexCoord4", VERT_ATTRIB_TEX4
, SWIZZLE_NOOP
},
318 { "gl_MultiTexCoord5", VERT_ATTRIB_TEX5
, SWIZZLE_NOOP
},
319 { "gl_MultiTexCoord6", VERT_ATTRIB_TEX6
, SWIZZLE_NOOP
},
320 { "gl_MultiTexCoord7", VERT_ATTRIB_TEX7
, SWIZZLE_NOOP
},
321 { NULL
, 0, SWIZZLE_NOOP
}
323 static const struct input_info fragInputs
[] = {
324 { "gl_FragCoord", FRAG_ATTRIB_WPOS
, SWIZZLE_NOOP
},
325 { "gl_Color", FRAG_ATTRIB_COL0
, SWIZZLE_NOOP
},
326 { "gl_SecondaryColor", FRAG_ATTRIB_COL1
, SWIZZLE_NOOP
},
327 { "gl_TexCoord", FRAG_ATTRIB_TEX0
, SWIZZLE_NOOP
},
328 /* note: we're packing several quantities into the fogcoord vector */
329 { "gl_FogFragCoord", FRAG_ATTRIB_FOGC
, SWIZZLE_XXXX
},
330 { "gl_FrontFacing", FRAG_ATTRIB_FOGC
, SWIZZLE_YYYY
}, /*XXX*/
331 { "gl_PointCoord", FRAG_ATTRIB_FOGC
, SWIZZLE_ZWWW
},
332 { NULL
, 0, SWIZZLE_NOOP
}
335 const struct input_info
*inputs
336 = (target
== GL_VERTEX_PROGRAM_ARB
) ? vertInputs
: fragInputs
;
338 ASSERT(MAX_TEXTURE_UNITS
== 8); /* if this fails, fix vertInputs above */
340 for (i
= 0; inputs
[i
].Name
; i
++) {
341 if (strcmp(inputs
[i
].Name
, name
) == 0) {
343 *swizzleOut
= inputs
[i
].Swizzle
;
344 return inputs
[i
].Attrib
;
352 * Return the VERT_RESULT_* or FRAG_RESULT_* value that corresponds to
353 * a vertex or fragment program output variable. Return -1 for an invalid
357 _slang_output_index(const char *name
, GLenum target
)
363 static const struct output_info vertOutputs
[] = {
364 { "gl_Position", VERT_RESULT_HPOS
},
365 { "gl_FrontColor", VERT_RESULT_COL0
},
366 { "gl_BackColor", VERT_RESULT_BFC0
},
367 { "gl_FrontSecondaryColor", VERT_RESULT_COL1
},
368 { "gl_BackSecondaryColor", VERT_RESULT_BFC1
},
369 { "gl_TexCoord", VERT_RESULT_TEX0
},
370 { "gl_FogFragCoord", VERT_RESULT_FOGC
},
371 { "gl_PointSize", VERT_RESULT_PSIZ
},
374 static const struct output_info fragOutputs
[] = {
375 { "gl_FragColor", FRAG_RESULT_COLR
},
376 { "gl_FragDepth", FRAG_RESULT_DEPR
},
377 { "gl_FragData", FRAG_RESULT_DATA0
},
381 const struct output_info
*outputs
382 = (target
== GL_VERTEX_PROGRAM_ARB
) ? vertOutputs
: fragOutputs
;
384 for (i
= 0; outputs
[i
].Name
; i
++) {
385 if (strcmp(outputs
[i
].Name
, name
) == 0) {
387 return outputs
[i
].Attrib
;
395 /**********************************************************************/
399 * Map "_asm foo" to IR_FOO, etc.
404 slang_ir_opcode Opcode
;
405 GLuint HaveRetValue
, NumParams
;
409 static slang_asm_info AsmInfo
[] = {
411 { "vec4_add", IR_ADD
, 1, 2 },
412 { "vec4_subtract", IR_SUB
, 1, 2 },
413 { "vec4_multiply", IR_MUL
, 1, 2 },
414 { "vec4_dot", IR_DOT4
, 1, 2 },
415 { "vec3_dot", IR_DOT3
, 1, 2 },
416 { "vec3_cross", IR_CROSS
, 1, 2 },
417 { "vec4_lrp", IR_LRP
, 1, 3 },
418 { "vec4_min", IR_MIN
, 1, 2 },
419 { "vec4_max", IR_MAX
, 1, 2 },
420 { "vec4_clamp", IR_CLAMP
, 1, 3 },
421 { "vec4_seq", IR_SEQUAL
, 1, 2 },
422 { "vec4_sne", IR_SNEQUAL
, 1, 2 },
423 { "vec4_sge", IR_SGE
, 1, 2 },
424 { "vec4_sgt", IR_SGT
, 1, 2 },
425 { "vec4_sle", IR_SLE
, 1, 2 },
426 { "vec4_slt", IR_SLT
, 1, 2 },
428 { "vec4_move", IR_MOVE
, 1, 1 },
429 { "vec4_floor", IR_FLOOR
, 1, 1 },
430 { "vec4_frac", IR_FRAC
, 1, 1 },
431 { "vec4_abs", IR_ABS
, 1, 1 },
432 { "vec4_negate", IR_NEG
, 1, 1 },
433 { "vec4_ddx", IR_DDX
, 1, 1 },
434 { "vec4_ddy", IR_DDY
, 1, 1 },
435 /* float binary op */
436 { "float_power", IR_POW
, 1, 2 },
437 /* texture / sampler */
438 { "vec4_tex1d", IR_TEX
, 1, 2 },
439 { "vec4_texb1d", IR_TEXB
, 1, 2 }, /* 1d w/ bias */
440 { "vec4_texp1d", IR_TEXP
, 1, 2 }, /* 1d w/ projection */
441 { "vec4_tex2d", IR_TEX
, 1, 2 },
442 { "vec4_texb2d", IR_TEXB
, 1, 2 }, /* 2d w/ bias */
443 { "vec4_texp2d", IR_TEXP
, 1, 2 }, /* 2d w/ projection */
444 { "vec4_tex3d", IR_TEX
, 1, 2 },
445 { "vec4_texb3d", IR_TEXB
, 1, 2 }, /* 3d w/ bias */
446 { "vec4_texp3d", IR_TEXP
, 1, 2 }, /* 3d w/ projection */
447 { "vec4_texcube", IR_TEX
, 1, 2 }, /* cubemap */
448 { "vec4_tex_rect", IR_TEX
, 1, 2 }, /* rectangle */
449 { "vec4_texp_rect", IR_TEX
, 1, 2 },/* rectangle w/ projection */
452 { "ivec4_to_vec4", IR_I_TO_F
, 1, 1 }, /* int[4] to float[4] */
453 { "vec4_to_ivec4", IR_F_TO_I
, 1, 1 }, /* float[4] to int[4] */
454 { "float_exp", IR_EXP
, 1, 1 },
455 { "float_exp2", IR_EXP2
, 1, 1 },
456 { "float_log2", IR_LOG2
, 1, 1 },
457 { "float_rsq", IR_RSQ
, 1, 1 },
458 { "float_rcp", IR_RCP
, 1, 1 },
459 { "float_sine", IR_SIN
, 1, 1 },
460 { "float_cosine", IR_COS
, 1, 1 },
461 { "float_noise1", IR_NOISE1
, 1, 1},
462 { "float_noise2", IR_NOISE2
, 1, 1},
463 { "float_noise3", IR_NOISE3
, 1, 1},
464 { "float_noise4", IR_NOISE4
, 1, 1},
466 { NULL
, IR_NOP
, 0, 0 }
470 static slang_ir_node
*
471 new_node3(slang_ir_opcode op
,
472 slang_ir_node
*c0
, slang_ir_node
*c1
, slang_ir_node
*c2
)
474 slang_ir_node
*n
= (slang_ir_node
*) _slang_alloc(sizeof(slang_ir_node
));
480 n
->Writemask
= WRITEMASK_XYZW
;
481 n
->InstLocation
= -1;
486 static slang_ir_node
*
487 new_node2(slang_ir_opcode op
, slang_ir_node
*c0
, slang_ir_node
*c1
)
489 return new_node3(op
, c0
, c1
, NULL
);
492 static slang_ir_node
*
493 new_node1(slang_ir_opcode op
, slang_ir_node
*c0
)
495 return new_node3(op
, c0
, NULL
, NULL
);
498 static slang_ir_node
*
499 new_node0(slang_ir_opcode op
)
501 return new_node3(op
, NULL
, NULL
, NULL
);
506 * Create sequence of two nodes.
508 static slang_ir_node
*
509 new_seq(slang_ir_node
*left
, slang_ir_node
*right
)
515 return new_node2(IR_SEQ
, left
, right
);
518 static slang_ir_node
*
519 new_label(slang_label
*label
)
521 slang_ir_node
*n
= new_node0(IR_LABEL
);
528 static slang_ir_node
*
529 new_float_literal(const float v
[4], GLuint size
)
531 slang_ir_node
*n
= new_node0(IR_FLOAT
);
533 COPY_4V(n
->Value
, v
);
534 /* allocate a storage object, but compute actual location (Index) later */
535 n
->Store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, size
);
540 static slang_ir_node
*
541 new_not(slang_ir_node
*n
)
543 return new_node1(IR_NOT
, n
);
548 * Non-inlined function call.
550 static slang_ir_node
*
551 new_function_call(slang_ir_node
*code
, slang_label
*name
)
553 slang_ir_node
*n
= new_node1(IR_CALL
, code
);
562 * Unconditional jump.
564 static slang_ir_node
*
565 new_return(slang_label
*dest
)
567 slang_ir_node
*n
= new_node0(IR_RETURN
);
575 static slang_ir_node
*
576 new_loop(slang_ir_node
*body
)
578 return new_node1(IR_LOOP
, body
);
582 static slang_ir_node
*
583 new_break(slang_ir_node
*loopNode
)
585 slang_ir_node
*n
= new_node0(IR_BREAK
);
587 assert(loopNode
->Opcode
== IR_LOOP
);
589 /* insert this node at head of linked list */
590 n
->List
= loopNode
->List
;
598 * Make new IR_BREAK_IF_TRUE.
600 static slang_ir_node
*
601 new_break_if_true(slang_ir_node
*loopNode
, slang_ir_node
*cond
)
605 assert(loopNode
->Opcode
== IR_LOOP
);
606 n
= new_node1(IR_BREAK_IF_TRUE
, cond
);
608 /* insert this node at head of linked list */
609 n
->List
= loopNode
->List
;
617 * Make new IR_CONT_IF_TRUE node.
619 static slang_ir_node
*
620 new_cont_if_true(slang_ir_node
*loopNode
, slang_ir_node
*cond
)
624 assert(loopNode
->Opcode
== IR_LOOP
);
625 n
= new_node1(IR_CONT_IF_TRUE
, cond
);
627 /* insert this node at head of linked list */
628 n
->List
= loopNode
->List
;
635 static slang_ir_node
*
636 new_cond(slang_ir_node
*n
)
638 slang_ir_node
*c
= new_node1(IR_COND
, n
);
643 static slang_ir_node
*
644 new_if(slang_ir_node
*cond
, slang_ir_node
*ifPart
, slang_ir_node
*elsePart
)
646 return new_node3(IR_IF
, cond
, ifPart
, elsePart
);
651 * New IR_VAR node - a reference to a previously declared variable.
653 static slang_ir_node
*
654 new_var(slang_assemble_ctx
*A
, slang_operation
*oper
, slang_atom name
)
657 slang_variable
*var
= _slang_locate_variable(oper
->locals
, name
, GL_TRUE
);
661 assert(var
->declared
);
663 assert(!oper
->var
|| oper
->var
== var
);
665 n
= new_node0(IR_VAR
);
667 _slang_attach_storage(n
, var
);
669 printf("new_var %s store=%p\n", (char*)name, (void*) n->Store);
677 * Check if the given function is really just a wrapper for a
678 * basic assembly instruction.
681 slang_is_asm_function(const slang_function
*fun
)
683 if (fun
->body
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
&&
684 fun
->body
->num_children
== 1 &&
685 fun
->body
->children
[0].type
== SLANG_OPER_ASM
) {
693 _slang_is_noop(const slang_operation
*oper
)
696 oper
->type
== SLANG_OPER_VOID
||
697 (oper
->num_children
== 1 && oper
->children
[0].type
== SLANG_OPER_VOID
))
705 * Recursively search tree for a node of the given type.
707 static slang_operation
*
708 _slang_find_node_type(slang_operation
*oper
, slang_operation_type type
)
711 if (oper
->type
== type
)
713 for (i
= 0; i
< oper
->num_children
; i
++) {
714 slang_operation
*p
= _slang_find_node_type(&oper
->children
[i
], type
);
723 * Count the number of operations of the given time rooted at 'oper'.
726 _slang_count_node_type(slang_operation
*oper
, slang_operation_type type
)
729 if (oper
->type
== type
) {
732 for (i
= 0; i
< oper
->num_children
; i
++) {
733 count
+= _slang_count_node_type(&oper
->children
[i
], type
);
740 * Check if the 'return' statement found under 'oper' is a "tail return"
741 * that can be no-op'd. For example:
746 * return; // this is a no-op
749 * This is used when determining if a function can be inlined. If the
750 * 'return' is not the last statement, we can't inline the function since
751 * we still need the semantic behaviour of the 'return' but we don't want
752 * to accidentally return from the _calling_ function. We'd need to use an
753 * unconditional branch, but we don't have such a GPU instruction (not
757 _slang_is_tail_return(const slang_operation
*oper
)
759 GLuint k
= oper
->num_children
;
762 const slang_operation
*last
= &oper
->children
[k
- 1];
763 if (last
->type
== SLANG_OPER_RETURN
)
765 else if (last
->type
== SLANG_OPER_IDENTIFIER
||
766 last
->type
== SLANG_OPER_LABEL
)
767 k
--; /* try prev child */
768 else if (last
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
||
769 last
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
)
770 /* try sub-children */
771 return _slang_is_tail_return(last
);
781 slang_resolve_variable(slang_operation
*oper
)
783 if (oper
->type
== SLANG_OPER_IDENTIFIER
&& !oper
->var
) {
784 oper
->var
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
790 * Replace particular variables (SLANG_OPER_IDENTIFIER) with new expressions.
793 slang_substitute(slang_assemble_ctx
*A
, slang_operation
*oper
,
794 GLuint substCount
, slang_variable
**substOld
,
795 slang_operation
**substNew
, GLboolean isLHS
)
797 switch (oper
->type
) {
798 case SLANG_OPER_VARIABLE_DECL
:
800 slang_variable
*v
= _slang_locate_variable(oper
->locals
,
801 oper
->a_id
, GL_TRUE
);
803 if (v
->initializer
&& oper
->num_children
== 0) {
804 /* set child of oper to copy of initializer */
805 oper
->num_children
= 1;
806 oper
->children
= slang_operation_new(1);
807 slang_operation_copy(&oper
->children
[0], v
->initializer
);
809 if (oper
->num_children
== 1) {
810 /* the initializer */
811 slang_substitute(A
, &oper
->children
[0], substCount
,
812 substOld
, substNew
, GL_FALSE
);
816 case SLANG_OPER_IDENTIFIER
:
817 assert(oper
->num_children
== 0);
818 if (1/**!isLHS XXX FIX */) {
819 slang_atom id
= oper
->a_id
;
822 v
= _slang_locate_variable(oper
->locals
, id
, GL_TRUE
);
824 _mesa_problem(NULL
, "var %s not found!\n", (char *) oper
->a_id
);
828 /* look for a substitution */
829 for (i
= 0; i
< substCount
; i
++) {
830 if (v
== substOld
[i
]) {
831 /* OK, replace this SLANG_OPER_IDENTIFIER with a new expr */
832 #if 0 /* DEBUG only */
833 if (substNew
[i
]->type
== SLANG_OPER_IDENTIFIER
) {
834 assert(substNew
[i
]->var
);
835 assert(substNew
[i
]->var
->a_name
);
836 printf("Substitute %s with %s in id node %p\n",
837 (char*)v
->a_name
, (char*) substNew
[i
]->var
->a_name
,
841 printf("Substitute %s with %f in id node %p\n",
842 (char*)v
->a_name
, substNew
[i
]->literal
[0],
846 slang_operation_copy(oper
, substNew
[i
]);
853 case SLANG_OPER_RETURN
:
854 /* do return replacement here too */
855 assert(oper
->num_children
== 0 || oper
->num_children
== 1);
856 if (oper
->num_children
== 1 && !_slang_is_noop(&oper
->children
[0])) {
862 * then do substitutions on the assignment.
864 slang_operation
*blockOper
, *assignOper
, *returnOper
;
866 /* check if function actually has a return type */
867 assert(A
->CurFunction
);
868 if (A
->CurFunction
->header
.type
.specifier
.type
== SLANG_SPEC_VOID
) {
869 slang_info_log_error(A
->log
, "illegal return expression");
873 blockOper
= slang_operation_new(1);
874 blockOper
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
;
875 blockOper
->num_children
= 2;
876 blockOper
->locals
->outer_scope
= oper
->locals
->outer_scope
;
877 blockOper
->children
= slang_operation_new(2);
878 assignOper
= blockOper
->children
+ 0;
879 returnOper
= blockOper
->children
+ 1;
881 assignOper
->type
= SLANG_OPER_ASSIGN
;
882 assignOper
->num_children
= 2;
883 assignOper
->locals
->outer_scope
= blockOper
->locals
;
884 assignOper
->children
= slang_operation_new(2);
885 assignOper
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
886 assignOper
->children
[0].a_id
= slang_atom_pool_atom(A
->atoms
, "__retVal");
887 assignOper
->children
[0].locals
->outer_scope
= assignOper
->locals
;
889 slang_operation_copy(&assignOper
->children
[1],
892 returnOper
->type
= SLANG_OPER_RETURN
; /* return w/ no value */
893 assert(returnOper
->num_children
== 0);
895 /* do substitutions on the "__retVal = expr" sub-tree */
896 slang_substitute(A
, assignOper
,
897 substCount
, substOld
, substNew
, GL_FALSE
);
899 /* install new code */
900 slang_operation_copy(oper
, blockOper
);
901 slang_operation_destruct(blockOper
);
904 /* check if return value was expected */
905 assert(A
->CurFunction
);
906 if (A
->CurFunction
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
907 slang_info_log_error(A
->log
, "return statement requires an expression");
913 case SLANG_OPER_ASSIGN
:
914 case SLANG_OPER_SUBSCRIPT
:
916 * child[0] can't have substitutions but child[1] can.
918 slang_substitute(A
, &oper
->children
[0],
919 substCount
, substOld
, substNew
, GL_TRUE
);
920 slang_substitute(A
, &oper
->children
[1],
921 substCount
, substOld
, substNew
, GL_FALSE
);
923 case SLANG_OPER_FIELD
:
925 slang_substitute(A
, &oper
->children
[0],
926 substCount
, substOld
, substNew
, GL_TRUE
);
931 for (i
= 0; i
< oper
->num_children
; i
++)
932 slang_substitute(A
, &oper
->children
[i
],
933 substCount
, substOld
, substNew
, GL_FALSE
);
940 * Produce inline code for a call to an assembly instruction.
941 * This is typically used to compile a call to a built-in function like this:
943 * vec4 mix(const vec4 x, const vec4 y, const vec4 a)
945 * __asm vec4_lrp __retVal, a, y, x;
950 * r = mix(p1, p2, p3);
960 * We basically translate a SLANG_OPER_CALL into a SLANG_OPER_ASM.
962 static slang_operation
*
963 slang_inline_asm_function(slang_assemble_ctx
*A
,
964 slang_function
*fun
, slang_operation
*oper
)
966 const GLuint numArgs
= oper
->num_children
;
968 slang_operation
*inlined
;
969 const GLboolean haveRetValue
= _slang_function_has_return_value(fun
);
970 slang_variable
**substOld
;
971 slang_operation
**substNew
;
973 ASSERT(slang_is_asm_function(fun
));
974 ASSERT(fun
->param_count
== numArgs
+ haveRetValue
);
977 printf("Inline %s as %s\n",
978 (char*) fun->header.a_name,
979 (char*) fun->body->children[0].a_id);
983 * We'll substitute formal params with actual args in the asm call.
985 substOld
= (slang_variable
**)
986 _slang_alloc(numArgs
* sizeof(slang_variable
*));
987 substNew
= (slang_operation
**)
988 _slang_alloc(numArgs
* sizeof(slang_operation
*));
989 for (i
= 0; i
< numArgs
; i
++) {
990 substOld
[i
] = fun
->parameters
->variables
[i
];
991 substNew
[i
] = oper
->children
+ i
;
994 /* make a copy of the code to inline */
995 inlined
= slang_operation_new(1);
996 slang_operation_copy(inlined
, &fun
->body
->children
[0]);
998 /* get rid of the __retVal child */
999 inlined
->num_children
--;
1000 for (i
= 0; i
< inlined
->num_children
; i
++) {
1001 inlined
->children
[i
] = inlined
->children
[i
+ 1];
1005 /* now do formal->actual substitutions */
1006 slang_substitute(A
, inlined
, numArgs
, substOld
, substNew
, GL_FALSE
);
1008 _slang_free(substOld
);
1009 _slang_free(substNew
);
1012 printf("+++++++++++++ inlined asm function %s +++++++++++++\n",
1013 (char *) fun
->header
.a_name
);
1014 slang_print_tree(inlined
, 3);
1015 printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n");
1023 * Inline the given function call operation.
1024 * Return a new slang_operation that corresponds to the inlined code.
1026 static slang_operation
*
1027 slang_inline_function_call(slang_assemble_ctx
* A
, slang_function
*fun
,
1028 slang_operation
*oper
, slang_operation
*returnOper
)
1035 ParamMode
*paramMode
;
1036 const GLboolean haveRetValue
= _slang_function_has_return_value(fun
);
1037 const GLuint numArgs
= oper
->num_children
;
1038 const GLuint totalArgs
= numArgs
+ haveRetValue
;
1039 slang_operation
*args
= oper
->children
;
1040 slang_operation
*inlined
, *top
;
1041 slang_variable
**substOld
;
1042 slang_operation
**substNew
;
1043 GLuint substCount
, numCopyIn
, i
;
1044 slang_function
*prevFunction
;
1045 slang_variable_scope
*newScope
= NULL
;
1048 prevFunction
= A
->CurFunction
;
1049 A
->CurFunction
= fun
;
1051 /*assert(oper->type == SLANG_OPER_CALL); (or (matrix) multiply, etc) */
1052 assert(fun
->param_count
== totalArgs
);
1054 /* allocate temporary arrays */
1055 paramMode
= (ParamMode
*)
1056 _slang_alloc(totalArgs
* sizeof(ParamMode
));
1057 substOld
= (slang_variable
**)
1058 _slang_alloc(totalArgs
* sizeof(slang_variable
*));
1059 substNew
= (slang_operation
**)
1060 _slang_alloc(totalArgs
* sizeof(slang_operation
*));
1063 printf("\nInline call to %s (total vars=%d nparams=%d)\n",
1064 (char *) fun
->header
.a_name
,
1065 fun
->parameters
->num_variables
, numArgs
);
1068 if (haveRetValue
&& !returnOper
) {
1069 /* Create 3-child comma sequence for inlined code:
1070 * child[0]: declare __resultTmp
1071 * child[1]: inlined function body
1072 * child[2]: __resultTmp
1074 slang_operation
*commaSeq
;
1075 slang_operation
*declOper
= NULL
;
1076 slang_variable
*resultVar
;
1078 commaSeq
= slang_operation_new(1);
1079 commaSeq
->type
= SLANG_OPER_SEQUENCE
;
1080 assert(commaSeq
->locals
);
1081 commaSeq
->locals
->outer_scope
= oper
->locals
->outer_scope
;
1082 commaSeq
->num_children
= 3;
1083 commaSeq
->children
= slang_operation_new(3);
1084 /* allocate the return var */
1085 resultVar
= slang_variable_scope_grow(commaSeq
->locals
);
1087 printf("Alloc __resultTmp in scope %p for retval of calling %s\n",
1088 (void*)commaSeq->locals, (char *) fun->header.a_name);
1091 resultVar
->a_name
= slang_atom_pool_atom(A
->atoms
, "__resultTmp");
1092 resultVar
->type
= fun
->header
.type
; /* XXX copy? */
1093 resultVar
->isTemp
= GL_TRUE
;
1095 /* child[0] = __resultTmp declaration */
1096 declOper
= &commaSeq
->children
[0];
1097 declOper
->type
= SLANG_OPER_VARIABLE_DECL
;
1098 declOper
->a_id
= resultVar
->a_name
;
1099 declOper
->locals
->outer_scope
= commaSeq
->locals
;
1101 /* child[1] = function body */
1102 inlined
= &commaSeq
->children
[1];
1103 inlined
->locals
->outer_scope
= commaSeq
->locals
;
1105 /* child[2] = __resultTmp reference */
1106 returnOper
= &commaSeq
->children
[2];
1107 returnOper
->type
= SLANG_OPER_IDENTIFIER
;
1108 returnOper
->a_id
= resultVar
->a_name
;
1109 returnOper
->locals
->outer_scope
= commaSeq
->locals
;
1114 top
= inlined
= slang_operation_new(1);
1115 /* XXXX this may be inappropriate!!!! */
1116 inlined
->locals
->outer_scope
= oper
->locals
->outer_scope
;
1120 assert(inlined
->locals
);
1122 /* Examine the parameters, look for inout/out params, look for possible
1123 * substitutions, etc:
1124 * param type behaviour
1125 * in copy actual to local
1126 * const in substitute param with actual
1130 for (i
= 0; i
< totalArgs
; i
++) {
1131 slang_variable
*p
= fun
->parameters
->variables
[i
];
1133 printf("Param %d: %s %s \n", i,
1134 slang_type_qual_string(p->type.qualifier),
1135 (char *) p->a_name);
1137 if (p
->type
.qualifier
== SLANG_QUAL_INOUT
||
1138 p
->type
.qualifier
== SLANG_QUAL_OUT
) {
1139 /* an output param */
1140 slang_operation
*arg
;
1145 paramMode
[i
] = SUBST
;
1147 if (arg
->type
== SLANG_OPER_IDENTIFIER
)
1148 slang_resolve_variable(arg
);
1150 /* replace parameter 'p' with argument 'arg' */
1151 substOld
[substCount
] = p
;
1152 substNew
[substCount
] = arg
; /* will get copied */
1155 else if (p
->type
.qualifier
== SLANG_QUAL_CONST
) {
1156 /* a constant input param */
1157 if (args
[i
].type
== SLANG_OPER_IDENTIFIER
||
1158 args
[i
].type
== SLANG_OPER_LITERAL_FLOAT
) {
1159 /* replace all occurances of this parameter variable with the
1160 * actual argument variable or a literal.
1162 paramMode
[i
] = SUBST
;
1163 slang_resolve_variable(&args
[i
]);
1164 substOld
[substCount
] = p
;
1165 substNew
[substCount
] = &args
[i
]; /* will get copied */
1169 paramMode
[i
] = COPY_IN
;
1173 paramMode
[i
] = COPY_IN
;
1175 assert(paramMode
[i
]);
1178 /* actual code inlining: */
1179 slang_operation_copy(inlined
, fun
->body
);
1181 /*** XXX review this */
1182 assert(inlined
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
||
1183 inlined
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
);
1184 inlined
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
;
1187 printf("======================= orig body code ======================\n");
1188 printf("=== params scope = %p\n", (void*) fun
->parameters
);
1189 slang_print_tree(fun
->body
, 8);
1190 printf("======================= copied code =========================\n");
1191 slang_print_tree(inlined
, 8);
1194 /* do parameter substitution in inlined code: */
1195 slang_substitute(A
, inlined
, substCount
, substOld
, substNew
, GL_FALSE
);
1198 printf("======================= subst code ==========================\n");
1199 slang_print_tree(inlined
, 8);
1200 printf("=============================================================\n");
1203 /* New prolog statements: (inserted before the inlined code)
1204 * Copy the 'in' arguments.
1207 for (i
= 0; i
< numArgs
; i
++) {
1208 if (paramMode
[i
] == COPY_IN
) {
1209 slang_variable
*p
= fun
->parameters
->variables
[i
];
1210 /* declare parameter 'p' */
1211 slang_operation
*decl
= slang_operation_insert(&inlined
->num_children
,
1215 decl
->type
= SLANG_OPER_VARIABLE_DECL
;
1216 assert(decl
->locals
);
1217 decl
->locals
->outer_scope
= inlined
->locals
;
1218 decl
->a_id
= p
->a_name
;
1219 decl
->num_children
= 1;
1220 decl
->children
= slang_operation_new(1);
1222 /* child[0] is the var's initializer */
1223 slang_operation_copy(&decl
->children
[0], args
+ i
);
1225 /* add parameter 'p' to the local variable scope here */
1227 slang_variable
*pCopy
= slang_variable_scope_grow(inlined
->locals
);
1228 pCopy
->type
= p
->type
;
1229 pCopy
->a_name
= p
->a_name
;
1230 pCopy
->array_len
= p
->array_len
;
1233 newScope
= inlined
->locals
;
1238 /* Now add copies of the function's local vars to the new variable scope */
1239 for (i
= totalArgs
; i
< fun
->parameters
->num_variables
; i
++) {
1240 slang_variable
*p
= fun
->parameters
->variables
[i
];
1241 slang_variable
*pCopy
= slang_variable_scope_grow(inlined
->locals
);
1242 pCopy
->type
= p
->type
;
1243 pCopy
->a_name
= p
->a_name
;
1244 pCopy
->array_len
= p
->array_len
;
1248 /* New epilog statements:
1249 * 1. Create end of function label to jump to from return statements.
1250 * 2. Copy the 'out' parameter vars
1253 slang_operation
*lab
= slang_operation_insert(&inlined
->num_children
,
1255 inlined
->num_children
);
1256 lab
->type
= SLANG_OPER_LABEL
;
1257 lab
->label
= A
->curFuncEndLabel
;
1260 for (i
= 0; i
< totalArgs
; i
++) {
1261 if (paramMode
[i
] == COPY_OUT
) {
1262 const slang_variable
*p
= fun
->parameters
->variables
[i
];
1263 /* actualCallVar = outParam */
1264 /*if (i > 0 || !haveRetValue)*/
1265 slang_operation
*ass
= slang_operation_insert(&inlined
->num_children
,
1267 inlined
->num_children
);
1268 ass
->type
= SLANG_OPER_ASSIGN
;
1269 ass
->num_children
= 2;
1270 ass
->locals
->outer_scope
= inlined
->locals
;
1271 ass
->children
= slang_operation_new(2);
1272 ass
->children
[0] = args
[i
]; /*XXX copy */
1273 ass
->children
[1].type
= SLANG_OPER_IDENTIFIER
;
1274 ass
->children
[1].a_id
= p
->a_name
;
1275 ass
->children
[1].locals
->outer_scope
= ass
->locals
;
1279 _slang_free(paramMode
);
1280 _slang_free(substOld
);
1281 _slang_free(substNew
);
1283 /* Update scoping to use the new local vars instead of the
1284 * original function's vars. This is especially important
1285 * for nested inlining.
1288 slang_replace_scope(inlined
, fun
->parameters
, newScope
);
1291 printf("Done Inline call to %s (total vars=%d nparams=%d)\n\n",
1292 (char *) fun
->header
.a_name
,
1293 fun
->parameters
->num_variables
, numArgs
);
1294 slang_print_tree(top
, 0);
1298 A
->CurFunction
= prevFunction
;
1304 static slang_ir_node
*
1305 _slang_gen_function_call(slang_assemble_ctx
*A
, slang_function
*fun
,
1306 slang_operation
*oper
, slang_operation
*dest
)
1309 slang_operation
*inlined
;
1310 slang_label
*prevFuncEndLabel
;
1313 prevFuncEndLabel
= A
->curFuncEndLabel
;
1314 sprintf(name
, "__endOfFunc_%s_", (char *) fun
->header
.a_name
);
1315 A
->curFuncEndLabel
= _slang_label_new(name
);
1316 assert(A
->curFuncEndLabel
);
1318 if (slang_is_asm_function(fun
) && !dest
) {
1319 /* assemble assembly function - tree style */
1320 inlined
= slang_inline_asm_function(A
, fun
, oper
);
1323 /* non-assembly function */
1324 /* We always generate an "inline-able" block of code here.
1326 * 1. insert the inline code
1327 * 2. Generate a call to the "inline" code as a subroutine
1331 slang_operation
*ret
= NULL
;
1333 inlined
= slang_inline_function_call(A
, fun
, oper
, dest
);
1337 ret
= _slang_find_node_type(inlined
, SLANG_OPER_RETURN
);
1339 /* check if this is a "tail" return */
1340 if (_slang_count_node_type(inlined
, SLANG_OPER_RETURN
) == 1 &&
1341 _slang_is_tail_return(inlined
)) {
1342 /* The only RETURN is the last stmt in the function, no-op it
1343 * and inline the function body.
1345 ret
->type
= SLANG_OPER_NONE
;
1348 slang_operation
*callOper
;
1349 /* The function we're calling has one or more 'return' statements.
1350 * So, we can't truly inline this function because we need to
1351 * implement 'return' with RET (and CAL).
1352 * Nevertheless, we performed "inlining" to make a new instance
1353 * of the function body to deal with static register allocation.
1355 * XXX check if there's one 'return' and if it's the very last
1356 * statement in the function - we can optimize that case.
1358 assert(inlined
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
||
1359 inlined
->type
== SLANG_OPER_SEQUENCE
);
1361 if (_slang_function_has_return_value(fun
) && !dest
) {
1362 assert(inlined
->children
[0].type
== SLANG_OPER_VARIABLE_DECL
);
1363 assert(inlined
->children
[2].type
== SLANG_OPER_IDENTIFIER
);
1364 callOper
= &inlined
->children
[1];
1369 callOper
->type
= SLANG_OPER_NON_INLINED_CALL
;
1370 callOper
->fun
= fun
;
1371 callOper
->label
= _slang_label_new_unique((char*) fun
->header
.a_name
);
1379 /* Replace the function call with the inlined block (or new CALL stmt) */
1380 slang_operation_destruct(oper
);
1382 _slang_free(inlined
);
1385 assert(inlined
->locals
);
1386 printf("*** Inlined code for call to %s:\n",
1387 (char*) fun
->header
.a_name
);
1388 slang_print_tree(oper
, 10);
1392 n
= _slang_gen_operation(A
, oper
);
1394 /*_slang_label_delete(A->curFuncEndLabel);*/
1395 A
->curFuncEndLabel
= prevFuncEndLabel
;
1401 static slang_asm_info
*
1402 slang_find_asm_info(const char *name
)
1405 for (i
= 0; AsmInfo
[i
].Name
; i
++) {
1406 if (_mesa_strcmp(AsmInfo
[i
].Name
, name
) == 0) {
1415 * Return the default swizzle mask for accessing a variable of the
1416 * given size (in floats). If size = 1, comp is used to identify
1417 * which component [0..3] of the register holds the variable.
1420 _slang_var_swizzle(GLint size
, GLint comp
)
1424 return MAKE_SWIZZLE4(comp
, comp
, comp
, comp
);
1426 return MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
, SWIZZLE_NIL
, SWIZZLE_NIL
);
1428 return MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
, SWIZZLE_Z
, SWIZZLE_NIL
);
1430 return SWIZZLE_XYZW
;
1436 * Some write-masked assignments are simple, but others are hard.
1439 * v.xy = vec2(a, b);
1442 * v.zy = vec2(a, b);
1443 * this gets transformed/swizzled into:
1444 * v.zy = vec2(a, b).*yx* (* = don't care)
1445 * This function helps to determine simple vs. non-simple.
1448 _slang_simple_writemask(GLuint writemask
, GLuint swizzle
)
1450 switch (writemask
) {
1452 return GET_SWZ(swizzle
, 0) == SWIZZLE_X
;
1454 return GET_SWZ(swizzle
, 1) == SWIZZLE_Y
;
1456 return GET_SWZ(swizzle
, 2) == SWIZZLE_Z
;
1458 return GET_SWZ(swizzle
, 3) == SWIZZLE_W
;
1460 return (GET_SWZ(swizzle
, 0) == SWIZZLE_X
)
1461 && (GET_SWZ(swizzle
, 1) == SWIZZLE_Y
);
1463 return (GET_SWZ(swizzle
, 0) == SWIZZLE_X
)
1464 && (GET_SWZ(swizzle
, 1) == SWIZZLE_Y
)
1465 && (GET_SWZ(swizzle
, 2) == SWIZZLE_Z
);
1466 case WRITEMASK_XYZW
:
1467 return swizzle
== SWIZZLE_NOOP
;
1475 * Convert the given swizzle into a writemask. In some cases this
1476 * is trivial, in other cases, we'll need to also swizzle the right
1477 * hand side to put components in the right places.
1478 * \param swizzle the incoming swizzle
1479 * \param writemaskOut returns the writemask
1480 * \param swizzleOut swizzle to apply to the right-hand-side
1481 * \return GL_FALSE for simple writemasks, GL_TRUE for non-simple
1484 swizzle_to_writemask(slang_assemble_ctx
*A
, GLuint swizzle
,
1485 GLuint
*writemaskOut
, GLuint
*swizzleOut
)
1487 GLuint mask
= 0x0, newSwizzle
[4];
1490 /* make new dst writemask, compute size */
1491 for (i
= 0; i
< 4; i
++) {
1492 const GLuint swz
= GET_SWZ(swizzle
, i
);
1493 if (swz
== SWIZZLE_NIL
) {
1497 assert(swz
>= 0 && swz
<= 3);
1499 if (swizzle
!= SWIZZLE_XXXX
&&
1500 swizzle
!= SWIZZLE_YYYY
&&
1501 swizzle
!= SWIZZLE_ZZZZ
&&
1502 swizzle
!= SWIZZLE_WWWW
&&
1503 (mask
& (1 << swz
))) {
1504 /* a channel can't be specified twice (ex: ".xyyz") */
1505 slang_info_log_error(A
->log
, "Invalid writemask '%s'",
1506 _mesa_swizzle_string(swizzle
, 0, 0));
1512 assert(mask
<= 0xf);
1513 size
= i
; /* number of components in mask/swizzle */
1515 *writemaskOut
= mask
;
1517 /* make new src swizzle, by inversion */
1518 for (i
= 0; i
< 4; i
++) {
1519 newSwizzle
[i
] = i
; /*identity*/
1521 for (i
= 0; i
< size
; i
++) {
1522 const GLuint swz
= GET_SWZ(swizzle
, i
);
1523 newSwizzle
[swz
] = i
;
1525 *swizzleOut
= MAKE_SWIZZLE4(newSwizzle
[0],
1530 if (_slang_simple_writemask(mask
, *swizzleOut
)) {
1532 assert(GET_SWZ(*swizzleOut
, 0) == SWIZZLE_X
);
1534 assert(GET_SWZ(*swizzleOut
, 1) == SWIZZLE_Y
);
1536 assert(GET_SWZ(*swizzleOut
, 2) == SWIZZLE_Z
);
1538 assert(GET_SWZ(*swizzleOut
, 3) == SWIZZLE_W
);
1547 * Recursively traverse 'oper' to produce a swizzle mask in the event
1548 * of any vector subscripts and swizzle suffixes.
1549 * Ex: for "vec4 v", "v[2].x" resolves to v.z
1552 resolve_swizzle(const slang_operation
*oper
)
1554 if (oper
->type
== SLANG_OPER_FIELD
) {
1555 /* writemask from .xyzw suffix */
1557 if (_slang_is_swizzle((char*) oper
->a_id
, 4, &swz
)) {
1558 GLuint swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
1562 GLuint child_swizzle
= resolve_swizzle(&oper
->children
[0]);
1563 GLuint s
= _slang_swizzle_swizzle(child_swizzle
, swizzle
);
1567 return SWIZZLE_XYZW
;
1569 else if (oper
->type
== SLANG_OPER_SUBSCRIPT
&&
1570 oper
->children
[1].type
== SLANG_OPER_LITERAL_INT
) {
1571 /* writemask from [index] */
1572 GLuint child_swizzle
= resolve_swizzle(&oper
->children
[0]);
1573 GLuint i
= (GLuint
) oper
->children
[1].literal
[0];
1578 swizzle
= SWIZZLE_XXXX
;
1581 swizzle
= SWIZZLE_YYYY
;
1584 swizzle
= SWIZZLE_ZZZZ
;
1587 swizzle
= SWIZZLE_WWWW
;
1590 swizzle
= SWIZZLE_XYZW
;
1592 s
= _slang_swizzle_swizzle(child_swizzle
, swizzle
);
1596 return SWIZZLE_XYZW
;
1602 * As above, but produce a writemask.
1605 resolve_writemask(slang_assemble_ctx
*A
, const slang_operation
*oper
)
1607 GLuint swizzle
= resolve_swizzle(oper
);
1608 GLuint writemask
, swizzleOut
;
1609 swizzle_to_writemask(A
, swizzle
, &writemask
, &swizzleOut
);
1615 * Recursively descend through swizzle nodes to find the node's storage info.
1617 static slang_ir_storage
*
1618 get_store(const slang_ir_node
*n
)
1620 if (n
->Opcode
== IR_SWIZZLE
) {
1621 return get_store(n
->Children
[0]);
1629 * Generate IR tree for an asm instruction/operation such as:
1630 * __asm vec4_dot __retVal.x, v1, v2;
1632 static slang_ir_node
*
1633 _slang_gen_asm(slang_assemble_ctx
*A
, slang_operation
*oper
,
1634 slang_operation
*dest
)
1636 const slang_asm_info
*info
;
1637 slang_ir_node
*kids
[3], *n
;
1638 GLuint j
, firstOperand
;
1640 assert(oper
->type
== SLANG_OPER_ASM
);
1642 info
= slang_find_asm_info((char *) oper
->a_id
);
1644 _mesa_problem(NULL
, "undefined __asm function %s\n",
1645 (char *) oper
->a_id
);
1648 assert(info
->NumParams
<= 3);
1650 if (info
->NumParams
== oper
->num_children
) {
1651 /* Storage for result is not specified.
1652 * Children[0], [1], [2] are the operands.
1657 /* Storage for result (child[0]) is specified.
1658 * Children[1], [2], [3] are the operands.
1663 /* assemble child(ren) */
1664 kids
[0] = kids
[1] = kids
[2] = NULL
;
1665 for (j
= 0; j
< info
->NumParams
; j
++) {
1666 kids
[j
] = _slang_gen_operation(A
, &oper
->children
[firstOperand
+ j
]);
1671 n
= new_node3(info
->Opcode
, kids
[0], kids
[1], kids
[2]);
1674 /* Setup n->Store to be a particular location. Otherwise, storage
1675 * for the result (a temporary) will be allocated later.
1677 GLuint writemask
= WRITEMASK_XYZW
;
1678 slang_operation
*dest_oper
;
1681 dest_oper
= &oper
->children
[0];
1683 writemask
= resolve_writemask(A
, dest_oper
);
1685 n0
= _slang_gen_operation(A
, dest_oper
);
1690 n
->Store
= n0
->Store
;
1692 assert(n
->Store
->File
!= PROGRAM_UNDEFINED
|| n
->Store
->Parent
);
1702 print_funcs(struct slang_function_scope_
*scope
, const char *name
)
1705 for (i
= 0; i
< scope
->num_functions
; i
++) {
1706 slang_function
*f
= &scope
->functions
[i
];
1707 if (!name
|| strcmp(name
, (char*) f
->header
.a_name
) == 0)
1708 printf(" %s (%d args)\n", name
, f
->param_count
);
1711 if (scope
->outer_scope
)
1712 print_funcs(scope
->outer_scope
, name
);
1717 * Find a function of the given name, taking 'numArgs' arguments.
1718 * This is the function we'll try to call when there is no exact match
1719 * between function parameters and call arguments.
1721 * XXX we should really create a list of candidate functions and try
1724 static slang_function
*
1725 _slang_find_function_by_argc(slang_function_scope
*scope
,
1726 const char *name
, int numArgs
)
1730 for (i
= 0; i
< scope
->num_functions
; i
++) {
1731 slang_function
*f
= &scope
->functions
[i
];
1732 if (strcmp(name
, (char*) f
->header
.a_name
) == 0) {
1733 int haveRetValue
= _slang_function_has_return_value(f
);
1734 if (numArgs
== f
->param_count
- haveRetValue
)
1738 scope
= scope
->outer_scope
;
1745 static slang_function
*
1746 _slang_find_function_by_max_argc(slang_function_scope
*scope
,
1749 slang_function
*maxFunc
= NULL
;
1754 for (i
= 0; i
< scope
->num_functions
; i
++) {
1755 slang_function
*f
= &scope
->functions
[i
];
1756 if (strcmp(name
, (char*) f
->header
.a_name
) == 0) {
1757 if (f
->param_count
> maxArgs
) {
1758 maxArgs
= f
->param_count
;
1763 scope
= scope
->outer_scope
;
1771 * Generate a new slang_function which is a constructor for a user-defined
1774 static slang_function
*
1775 _slang_make_constructor(slang_assemble_ctx
*A
, slang_struct
*str
)
1777 const GLint numFields
= str
->fields
->num_variables
;
1779 slang_function
*fun
= (slang_function
*) _mesa_malloc(sizeof(slang_function
));
1783 slang_function_construct(fun
);
1785 /* function header (name, return type) */
1786 fun
->kind
= SLANG_FUNC_CONSTRUCTOR
;
1787 fun
->header
.a_name
= str
->a_name
;
1788 fun
->header
.type
.qualifier
= SLANG_QUAL_NONE
;
1789 fun
->header
.type
.specifier
.type
= SLANG_SPEC_STRUCT
;
1790 fun
->header
.type
.specifier
._struct
= str
;
1792 /* function parameters (= struct's fields) */
1795 for (i
= 0; i
< numFields
; i
++) {
1797 printf("Field %d: %s\n", i, (char*) str->fields->variables[i]->a_name);
1799 slang_variable
*p
= slang_variable_scope_grow(fun
->parameters
);
1800 *p
= *str
->fields
->variables
[i
]; /* copy the type */
1801 p
->type
.qualifier
= SLANG_QUAL_CONST
;
1803 fun
->param_count
= fun
->parameters
->num_variables
;
1806 /* Add __retVal to params */
1808 slang_variable
*p
= slang_variable_scope_grow(fun
->parameters
);
1809 slang_atom a_retVal
= slang_atom_pool_atom(A
->atoms
, "__retVal");
1811 p
->a_name
= a_retVal
;
1812 p
->type
= fun
->header
.type
;
1813 p
->type
.qualifier
= SLANG_QUAL_OUT
;
1817 /* function body is:
1827 slang_variable_scope
*scope
;
1828 slang_variable
*var
;
1831 fun
->body
= slang_operation_new(1);
1832 fun
->body
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
;
1833 fun
->body
->num_children
= numFields
+ 2;
1834 fun
->body
->children
= slang_operation_new(numFields
+ 2);
1836 scope
= fun
->body
->locals
;
1837 scope
->outer_scope
= fun
->parameters
;
1839 /* create local var 't' */
1840 var
= slang_variable_scope_grow(scope
);
1841 var
->a_name
= slang_atom_pool_atom(A
->atoms
, "t");
1842 var
->type
= fun
->header
.type
;
1846 slang_operation
*decl
;
1848 decl
= &fun
->body
->children
[0];
1849 decl
->type
= SLANG_OPER_VARIABLE_DECL
;
1850 decl
->locals
= _slang_variable_scope_new(scope
);
1851 decl
->a_id
= var
->a_name
;
1854 /* assign params to fields of t */
1855 for (i
= 0; i
< numFields
; i
++) {
1856 slang_operation
*assign
= &fun
->body
->children
[1 + i
];
1858 assign
->type
= SLANG_OPER_ASSIGN
;
1859 assign
->locals
= _slang_variable_scope_new(scope
);
1860 assign
->num_children
= 2;
1861 assign
->children
= slang_operation_new(2);
1864 slang_operation
*lhs
= &assign
->children
[0];
1866 lhs
->type
= SLANG_OPER_FIELD
;
1867 lhs
->locals
= _slang_variable_scope_new(scope
);
1868 lhs
->num_children
= 1;
1869 lhs
->children
= slang_operation_new(1);
1870 lhs
->a_id
= str
->fields
->variables
[i
]->a_name
;
1872 lhs
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
1873 lhs
->children
[0].a_id
= var
->a_name
;
1874 lhs
->children
[0].locals
= _slang_variable_scope_new(scope
);
1877 lhs
->children
[1].num_children
= 1;
1878 lhs
->children
[1].children
= slang_operation_new(1);
1879 lhs
->children
[1].children
[0].type
= SLANG_OPER_IDENTIFIER
;
1880 lhs
->children
[1].children
[0].a_id
= str
->fields
->variables
[i
]->a_name
;
1881 lhs
->children
[1].children
->locals
= _slang_variable_scope_new(scope
);
1886 slang_operation
*rhs
= &assign
->children
[1];
1888 rhs
->type
= SLANG_OPER_IDENTIFIER
;
1889 rhs
->locals
= _slang_variable_scope_new(scope
);
1890 rhs
->a_id
= str
->fields
->variables
[i
]->a_name
;
1896 slang_operation
*ret
= &fun
->body
->children
[numFields
+ 1];
1898 ret
->type
= SLANG_OPER_RETURN
;
1899 ret
->locals
= _slang_variable_scope_new(scope
);
1900 ret
->num_children
= 1;
1901 ret
->children
= slang_operation_new(1);
1902 ret
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
1903 ret
->children
[0].a_id
= var
->a_name
;
1904 ret
->children
[0].locals
= _slang_variable_scope_new(scope
);
1909 slang_print_function(fun, 1);
1916 * Find/create a function (constructor) for the given structure name.
1918 static slang_function
*
1919 _slang_locate_struct_constructor(slang_assemble_ctx
*A
, const char *name
)
1922 for (i
= 0; i
< A
->space
.structs
->num_structs
; i
++) {
1923 slang_struct
*str
= &A
->space
.structs
->structs
[i
];
1924 if (strcmp(name
, (const char *) str
->a_name
) == 0) {
1925 /* found a structure type that matches the function name */
1926 if (!str
->constructor
) {
1927 /* create the constructor function now */
1928 str
->constructor
= _slang_make_constructor(A
, str
);
1930 return str
->constructor
;
1939 _slang_is_vec_mat_type(const char *name
)
1941 static const char *vecmat_types
[] = {
1942 "float", "int", "bool",
1943 "vec2", "vec3", "vec4",
1944 "ivec2", "ivec3", "ivec4",
1945 "bvec2", "bvec3", "bvec4",
1946 "mat2", "mat3", "mat4",
1947 "mat2x3", "mat2x4", "mat3x2", "mat3x4", "mat4x2", "mat4x3",
1951 for (i
= 0; vecmat_types
[i
]; i
++)
1952 if (_mesa_strcmp(name
, vecmat_types
[i
]) == 0)
1959 * Assemble a function call, given a particular function name.
1960 * \param name the function's name (operators like '*' are possible).
1962 static slang_ir_node
*
1963 _slang_gen_function_call_name(slang_assemble_ctx
*A
, const char *name
,
1964 slang_operation
*oper
, slang_operation
*dest
)
1966 slang_operation
*params
= oper
->children
;
1967 const GLuint param_count
= oper
->num_children
;
1969 slang_function
*fun
;
1973 atom
= slang_atom_pool_atom(A
->atoms
, name
);
1974 if (atom
== SLANG_ATOM_NULL
)
1978 * First, try to find function by name and exact argument type matching.
1980 fun
= _slang_locate_function(A
->space
.funcs
, atom
, params
, param_count
,
1981 &A
->space
, A
->atoms
, A
->log
, &error
);
1984 slang_info_log_error(A
->log
,
1985 "Function '%s' not found (check argument types)",
1991 /* Next, try locating a constructor function for a user-defined type */
1992 fun
= _slang_locate_struct_constructor(A
, name
);
1996 * At this point, some heuristics are used to try to find a function
1997 * that matches the calling signature by means of casting or "unrolling"
2001 if (!fun
&& _slang_is_vec_mat_type(name
)) {
2002 /* Next, if this call looks like a vec() or mat() constructor call,
2003 * try "unwinding" the args to satisfy a constructor.
2005 fun
= _slang_find_function_by_max_argc(A
->space
.funcs
, name
);
2007 if (!_slang_adapt_call(oper
, fun
, &A
->space
, A
->atoms
, A
->log
)) {
2008 slang_info_log_error(A
->log
,
2009 "Function '%s' not found (check argument types)",
2016 if (!fun
&& _slang_is_vec_mat_type(name
)) {
2017 /* Next, try casting args to the types of the formal parameters */
2018 int numArgs
= oper
->num_children
;
2019 fun
= _slang_find_function_by_argc(A
->space
.funcs
, name
, numArgs
);
2020 if (!fun
|| !_slang_cast_func_params(oper
, fun
, &A
->space
, A
->atoms
, A
->log
)) {
2021 slang_info_log_error(A
->log
,
2022 "Function '%s' not found (check argument types)",
2030 slang_info_log_error(A
->log
,
2031 "Function '%s' not found (check argument types)",
2036 n
= _slang_gen_function_call(A
, fun
, oper
, dest
);
2038 if (n
&& !n
->Store
&& !dest
2039 && fun
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
2040 /* setup n->Store for the result of the function call */
2041 GLint size
= _slang_sizeof_type_specifier(&fun
->header
.type
.specifier
);
2042 n
->Store
= _slang_new_ir_storage(PROGRAM_TEMPORARY
, -1, size
);
2043 /*printf("Alloc storage for function result, size %d \n", size);*/
2051 _slang_is_constant_cond(const slang_operation
*oper
, GLboolean
*value
)
2053 if (oper
->type
== SLANG_OPER_LITERAL_FLOAT
||
2054 oper
->type
== SLANG_OPER_LITERAL_INT
||
2055 oper
->type
== SLANG_OPER_LITERAL_BOOL
) {
2056 if (oper
->literal
[0])
2062 else if (oper
->type
== SLANG_OPER_EXPRESSION
&&
2063 oper
->num_children
== 1) {
2064 return _slang_is_constant_cond(&oper
->children
[0], value
);
2071 * Test if an operation is a scalar or boolean.
2074 _slang_is_scalar_or_boolean(slang_assemble_ctx
*A
, slang_operation
*oper
)
2076 slang_typeinfo type
;
2079 slang_typeinfo_construct(&type
);
2080 _slang_typeof_operation(A
, oper
, &type
);
2081 size
= _slang_sizeof_type_specifier(&type
.spec
);
2082 slang_typeinfo_destruct(&type
);
2088 * Test if an operation is boolean.
2091 _slang_is_boolean(slang_assemble_ctx
*A
, slang_operation
*oper
)
2093 slang_typeinfo type
;
2096 slang_typeinfo_construct(&type
);
2097 _slang_typeof_operation(A
, oper
, &type
);
2098 isBool
= (type
.spec
.type
== SLANG_SPEC_BOOL
);
2099 slang_typeinfo_destruct(&type
);
2105 * Generate loop code using high-level IR_LOOP instruction
2107 static slang_ir_node
*
2108 _slang_gen_while(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2112 * BREAK if !expr (child[0])
2113 * body code (child[1])
2115 slang_ir_node
*prevLoop
, *loop
, *breakIf
, *body
;
2116 GLboolean isConst
, constTrue
;
2118 /* type-check expression */
2119 if (!_slang_is_boolean(A
, &oper
->children
[0])) {
2120 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'while'");
2124 /* Check if loop condition is a constant */
2125 isConst
= _slang_is_constant_cond(&oper
->children
[0], &constTrue
);
2127 if (isConst
&& !constTrue
) {
2128 /* loop is never executed! */
2129 return new_node0(IR_NOP
);
2132 loop
= new_loop(NULL
);
2134 /* save old, push new loop */
2135 prevLoop
= A
->CurLoop
;
2138 if (isConst
&& constTrue
) {
2139 /* while(nonzero constant), no conditional break */
2144 = new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[0])));
2145 breakIf
= new_break_if_true(A
->CurLoop
, cond
);
2147 body
= _slang_gen_operation(A
, &oper
->children
[1]);
2148 loop
->Children
[0] = new_seq(breakIf
, body
);
2150 /* Do infinite loop detection */
2151 /* loop->List is head of linked list of break/continue nodes */
2152 if (!loop
->List
&& isConst
&& constTrue
) {
2153 /* infinite loop detected */
2154 A
->CurLoop
= prevLoop
; /* clean-up */
2155 slang_info_log_error(A
->log
, "Infinite loop detected!");
2159 /* pop loop, restore prev */
2160 A
->CurLoop
= prevLoop
;
2167 * Generate IR tree for a do-while loop using high-level LOOP, IF instructions.
2169 static slang_ir_node
*
2170 _slang_gen_do(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2174 * body code (child[0])
2176 * BREAK if !expr (child[1])
2178 slang_ir_node
*prevLoop
, *loop
;
2179 GLboolean isConst
, constTrue
;
2181 /* type-check expression */
2182 if (!_slang_is_boolean(A
, &oper
->children
[1])) {
2183 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'do/while'");
2187 loop
= new_loop(NULL
);
2189 /* save old, push new loop */
2190 prevLoop
= A
->CurLoop
;
2194 loop
->Children
[0] = _slang_gen_operation(A
, &oper
->children
[0]);
2196 /* Check if loop condition is a constant */
2197 isConst
= _slang_is_constant_cond(&oper
->children
[1], &constTrue
);
2198 if (isConst
&& constTrue
) {
2199 /* do { } while(1) ==> no conditional break */
2200 loop
->Children
[1] = NULL
; /* no tail code */
2204 = new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[1])));
2205 loop
->Children
[1] = new_break_if_true(A
->CurLoop
, cond
);
2208 /* XXX we should do infinite loop detection, as above */
2210 /* pop loop, restore prev */
2211 A
->CurLoop
= prevLoop
;
2218 * Generate for-loop using high-level IR_LOOP instruction.
2220 static slang_ir_node
*
2221 _slang_gen_for(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2224 * init code (child[0])
2226 * BREAK if !expr (child[1])
2227 * body code (child[3])
2229 * incr code (child[2]) // XXX continue here
2231 slang_ir_node
*prevLoop
, *loop
, *cond
, *breakIf
, *body
, *init
, *incr
;
2233 init
= _slang_gen_operation(A
, &oper
->children
[0]);
2234 loop
= new_loop(NULL
);
2236 /* save old, push new loop */
2237 prevLoop
= A
->CurLoop
;
2240 cond
= new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[1])));
2241 breakIf
= new_break_if_true(A
->CurLoop
, cond
);
2242 body
= _slang_gen_operation(A
, &oper
->children
[3]);
2243 incr
= _slang_gen_operation(A
, &oper
->children
[2]);
2245 loop
->Children
[0] = new_seq(breakIf
, body
);
2246 loop
->Children
[1] = incr
; /* tail code */
2248 /* pop loop, restore prev */
2249 A
->CurLoop
= prevLoop
;
2251 return new_seq(init
, loop
);
2255 static slang_ir_node
*
2256 _slang_gen_continue(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2258 slang_ir_node
*n
, *loopNode
;
2259 assert(oper
->type
== SLANG_OPER_CONTINUE
);
2260 loopNode
= A
->CurLoop
;
2262 assert(loopNode
->Opcode
== IR_LOOP
);
2263 n
= new_node0(IR_CONT
);
2265 n
->Parent
= loopNode
;
2266 /* insert this node at head of linked list */
2267 n
->List
= loopNode
->List
;
2275 * Determine if the given operation is of a specific type.
2278 is_operation_type(const slang_operation
*oper
, slang_operation_type type
)
2280 if (oper
->type
== type
)
2282 else if ((oper
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
||
2283 oper
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
) &&
2284 oper
->num_children
== 1)
2285 return is_operation_type(&oper
->children
[0], type
);
2292 * Generate IR tree for an if/then/else conditional using high-level
2293 * IR_IF instruction.
2295 static slang_ir_node
*
2296 _slang_gen_if(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2299 * eval expr (child[0])
2306 const GLboolean haveElseClause
= !_slang_is_noop(&oper
->children
[2]);
2307 slang_ir_node
*ifNode
, *cond
, *ifBody
, *elseBody
;
2308 GLboolean isConst
, constTrue
;
2310 /* type-check expression */
2311 if (!_slang_is_boolean(A
, &oper
->children
[0])) {
2312 slang_info_log_error(A
->log
, "boolean expression expected for 'if'");
2316 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
2317 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'if'");
2321 isConst
= _slang_is_constant_cond(&oper
->children
[0], &constTrue
);
2325 return _slang_gen_operation(A
, &oper
->children
[1]);
2328 /* if (false) ... */
2329 return _slang_gen_operation(A
, &oper
->children
[2]);
2333 cond
= _slang_gen_operation(A
, &oper
->children
[0]);
2334 cond
= new_cond(cond
);
2336 if (is_operation_type(&oper
->children
[1], SLANG_OPER_BREAK
)
2337 && !haveElseClause
) {
2338 /* Special case: generate a conditional break */
2339 ifBody
= new_break_if_true(A
->CurLoop
, cond
);
2342 else if (is_operation_type(&oper
->children
[1], SLANG_OPER_CONTINUE
)
2343 && !haveElseClause
) {
2344 /* Special case: generate a conditional break */
2345 ifBody
= new_cont_if_true(A
->CurLoop
, cond
);
2350 ifBody
= _slang_gen_operation(A
, &oper
->children
[1]);
2352 elseBody
= _slang_gen_operation(A
, &oper
->children
[2]);
2355 ifNode
= new_if(cond
, ifBody
, elseBody
);
2362 static slang_ir_node
*
2363 _slang_gen_not(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2367 assert(oper
->type
== SLANG_OPER_NOT
);
2369 /* type-check expression */
2370 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
2371 slang_info_log_error(A
->log
,
2372 "scalar/boolean expression expected for '!'");
2376 n
= _slang_gen_operation(A
, &oper
->children
[0]);
2384 static slang_ir_node
*
2385 _slang_gen_xor(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2387 slang_ir_node
*n1
, *n2
;
2389 assert(oper
->type
== SLANG_OPER_LOGICALXOR
);
2391 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0]) ||
2392 !_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
2393 slang_info_log_error(A
->log
,
2394 "scalar/boolean expressions expected for '^^'");
2398 n1
= _slang_gen_operation(A
, &oper
->children
[0]);
2401 n2
= _slang_gen_operation(A
, &oper
->children
[1]);
2404 return new_node2(IR_NOTEQUAL
, n1
, n2
);
2409 * Generate IR node for storage of a temporary of given size.
2411 static slang_ir_node
*
2412 _slang_gen_temporary(GLint size
)
2414 slang_ir_storage
*store
;
2415 slang_ir_node
*n
= NULL
;
2417 store
= _slang_new_ir_storage(PROGRAM_TEMPORARY
, -2, size
);
2419 n
= new_node0(IR_VAR_DECL
);
2432 * Generate IR node for allocating/declaring a variable.
2434 static slang_ir_node
*
2435 _slang_gen_var_decl(slang_assemble_ctx
*A
, slang_variable
*var
)
2439 /*assert(!var->declared);*/
2440 var
->declared
= GL_TRUE
;
2442 n
= new_node0(IR_VAR_DECL
);
2444 _slang_attach_storage(n
, var
);
2446 assert(n
->Store
== var
->aux
);
2448 assert(n
->Store
->Index
< 0);
2450 if (is_sampler_type(&var
->type
)) {
2451 n
->Store
->File
= PROGRAM_SAMPLER
;
2454 n
->Store
->File
= PROGRAM_TEMPORARY
;
2457 n
->Store
->Size
= _slang_sizeof_type_specifier(&n
->Var
->type
.specifier
);
2459 if (n
->Store
->Size
<= 0) {
2460 slang_info_log_error(A
->log
, "invalid declaration for '%s'",
2461 (char*) var
->a_name
);
2465 printf("%s var %p %s store=%p index=%d size=%d\n",
2466 __FUNCTION__
, (void *) var
, (char *) var
->a_name
,
2467 (void *) n
->Store
, n
->Store
->Index
, n
->Store
->Size
);
2470 if (var
->array_len
> 0) {
2471 /* this is an array */
2472 /* cannot be const-qualified */
2473 if (var
->type
.qualifier
== SLANG_QUAL_CONST
) {
2474 slang_info_log_error(A
->log
, "array '%s' cannot be const",
2475 (char*) var
->a_name
);
2479 /* round up element size to mult of 4 */
2480 GLint sz
= (n
->Store
->Size
+ 3) & ~3;
2481 /* mult by array size */
2482 sz
*= var
->array_len
;
2483 n
->Store
->Size
= sz
;
2487 assert(n
->Store
->Size
> 0);
2489 /* setup default swizzle for storing the variable */
2490 switch (n
->Store
->Size
) {
2492 n
->Store
->Swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
,
2493 SWIZZLE_NIL
, SWIZZLE_NIL
);
2496 n
->Store
->Swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
,
2497 SWIZZLE_Z
, SWIZZLE_NIL
);
2500 /* Note that float-sized vars may be allocated in any x/y/z/w
2501 * slot, but that won't be determined until code emit time.
2503 n
->Store
->Swizzle
= SWIZZLE_NOOP
;
2511 * Generate code for a selection expression: b ? x : y
2512 * XXX In some cases we could implement a selection expression
2513 * with an LRP instruction (use the boolean as the interpolant).
2514 * Otherwise, we use an IF/ELSE/ENDIF construct.
2516 static slang_ir_node
*
2517 _slang_gen_select(slang_assemble_ctx
*A
, slang_operation
*oper
)
2519 slang_ir_node
*cond
, *ifNode
, *trueExpr
, *falseExpr
, *trueNode
, *falseNode
;
2520 slang_ir_node
*tmpDecl
, *tmpVar
, *tree
;
2521 slang_typeinfo type0
, type1
, type2
;
2522 int size
, isBool
, isEqual
;
2524 assert(oper
->type
== SLANG_OPER_SELECT
);
2525 assert(oper
->num_children
== 3);
2527 /* type of children[0] must be boolean */
2528 slang_typeinfo_construct(&type0
);
2529 _slang_typeof_operation(A
, &oper
->children
[0], &type0
);
2530 isBool
= (type0
.spec
.type
== SLANG_SPEC_BOOL
);
2531 slang_typeinfo_destruct(&type0
);
2533 slang_info_log_error(A
->log
, "selector type is not boolean");
2537 slang_typeinfo_construct(&type1
);
2538 slang_typeinfo_construct(&type2
);
2539 _slang_typeof_operation(A
, &oper
->children
[1], &type1
);
2540 _slang_typeof_operation(A
, &oper
->children
[2], &type2
);
2541 isEqual
= slang_type_specifier_equal(&type1
.spec
, &type2
.spec
);
2542 slang_typeinfo_destruct(&type1
);
2543 slang_typeinfo_destruct(&type2
);
2545 slang_info_log_error(A
->log
, "incompatible types for ?: operator");
2549 /* size of x or y's type */
2550 size
= _slang_sizeof_type_specifier(&type1
.spec
);
2554 tmpDecl
= _slang_gen_temporary(size
);
2556 /* the condition (child 0) */
2557 cond
= _slang_gen_operation(A
, &oper
->children
[0]);
2558 cond
= new_cond(cond
);
2560 /* if-true body (child 1) */
2561 tmpVar
= new_node0(IR_VAR
);
2562 tmpVar
->Store
= tmpDecl
->Store
;
2563 trueExpr
= _slang_gen_operation(A
, &oper
->children
[1]);
2564 trueNode
= new_node2(IR_COPY
, tmpVar
, trueExpr
);
2566 /* if-false body (child 2) */
2567 tmpVar
= new_node0(IR_VAR
);
2568 tmpVar
->Store
= tmpDecl
->Store
;
2569 falseExpr
= _slang_gen_operation(A
, &oper
->children
[2]);
2570 falseNode
= new_node2(IR_COPY
, tmpVar
, falseExpr
);
2572 ifNode
= new_if(cond
, trueNode
, falseNode
);
2575 tmpVar
= new_node0(IR_VAR
);
2576 tmpVar
->Store
= tmpDecl
->Store
;
2578 tree
= new_seq(ifNode
, tmpVar
);
2579 tree
= new_seq(tmpDecl
, tree
);
2581 /*_slang_print_ir_tree(tree, 10);*/
2587 * Generate code for &&.
2589 static slang_ir_node
*
2590 _slang_gen_logical_and(slang_assemble_ctx
*A
, slang_operation
*oper
)
2592 /* rewrite "a && b" as "a ? b : false" */
2593 slang_operation
*select
;
2596 select
= slang_operation_new(1);
2597 select
->type
= SLANG_OPER_SELECT
;
2598 select
->num_children
= 3;
2599 select
->children
= slang_operation_new(3);
2601 slang_operation_copy(&select
->children
[0], &oper
->children
[0]);
2602 slang_operation_copy(&select
->children
[1], &oper
->children
[1]);
2603 select
->children
[2].type
= SLANG_OPER_LITERAL_BOOL
;
2604 ASSIGN_4V(select
->children
[2].literal
, 0, 0, 0, 0); /* false */
2605 select
->children
[2].literal_size
= 1;
2607 n
= _slang_gen_select(A
, select
);
2613 * Generate code for ||.
2615 static slang_ir_node
*
2616 _slang_gen_logical_or(slang_assemble_ctx
*A
, slang_operation
*oper
)
2618 /* rewrite "a || b" as "a ? true : b" */
2619 slang_operation
*select
;
2622 select
= slang_operation_new(1);
2623 select
->type
= SLANG_OPER_SELECT
;
2624 select
->num_children
= 3;
2625 select
->children
= slang_operation_new(3);
2627 slang_operation_copy(&select
->children
[0], &oper
->children
[0]);
2628 select
->children
[1].type
= SLANG_OPER_LITERAL_BOOL
;
2629 ASSIGN_4V(select
->children
[1].literal
, 1, 1, 1, 1); /* true */
2630 select
->children
[1].literal_size
= 1;
2631 slang_operation_copy(&select
->children
[2], &oper
->children
[1]);
2633 n
= _slang_gen_select(A
, select
);
2639 * Generate IR tree for a return statement.
2641 static slang_ir_node
*
2642 _slang_gen_return(slang_assemble_ctx
* A
, slang_operation
*oper
)
2644 const GLboolean haveReturnValue
2645 = (oper
->num_children
== 1 && oper
->children
[0].type
!= SLANG_OPER_VOID
);
2647 /* error checking */
2648 assert(A
->CurFunction
);
2649 if (haveReturnValue
&&
2650 A
->CurFunction
->header
.type
.specifier
.type
== SLANG_SPEC_VOID
) {
2651 slang_info_log_error(A
->log
, "illegal return expression");
2654 else if (!haveReturnValue
&&
2655 A
->CurFunction
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
2656 slang_info_log_error(A
->log
, "return statement requires an expression");
2660 if (!haveReturnValue
) {
2661 return new_return(A
->curFuncEndLabel
);
2669 * return; // goto __endOfFunction
2671 slang_operation
*assign
;
2672 slang_atom a_retVal
;
2675 a_retVal
= slang_atom_pool_atom(A
->atoms
, "__retVal");
2681 = _slang_locate_variable(oper
->locals
, a_retVal
, GL_TRUE
);
2683 /* trying to return a value in a void-valued function */
2689 assign
= slang_operation_new(1);
2690 assign
->type
= SLANG_OPER_ASSIGN
;
2691 assign
->num_children
= 2;
2692 assign
->children
= slang_operation_new(2);
2693 /* lhs (__retVal) */
2694 assign
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
2695 assign
->children
[0].a_id
= a_retVal
;
2696 assign
->children
[0].locals
->outer_scope
= assign
->locals
;
2698 /* XXX we might be able to avoid this copy someday */
2699 slang_operation_copy(&assign
->children
[1], &oper
->children
[0]);
2701 /* assemble the new code */
2702 n
= new_seq(_slang_gen_operation(A
, assign
),
2703 new_return(A
->curFuncEndLabel
));
2705 slang_operation_delete(assign
);
2712 * Determine if the given operation/expression is const-valued.
2715 _slang_is_constant_expr(const slang_operation
*oper
)
2717 slang_variable
*var
;
2720 switch (oper
->type
) {
2721 case SLANG_OPER_IDENTIFIER
:
2722 var
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
2723 if (var
&& var
->type
.qualifier
== SLANG_QUAL_CONST
)
2727 for (i
= 0; i
< oper
->num_children
; i
++) {
2728 if (!_slang_is_constant_expr(&oper
->children
[i
]))
2737 * Check if an assignment of type t1 to t0 is legal.
2738 * XXX more cases needed.
2741 _slang_assignment_compatible(slang_assemble_ctx
*A
,
2742 slang_operation
*op0
,
2743 slang_operation
*op1
)
2745 slang_typeinfo t0
, t1
;
2748 if (op0
->type
== SLANG_OPER_POSTINCREMENT
||
2749 op0
->type
== SLANG_OPER_POSTDECREMENT
) {
2753 slang_typeinfo_construct(&t0
);
2754 _slang_typeof_operation(A
, op0
, &t0
);
2756 slang_typeinfo_construct(&t1
);
2757 _slang_typeof_operation(A
, op1
, &t1
);
2759 sz0
= _slang_sizeof_type_specifier(&t0
.spec
);
2760 sz1
= _slang_sizeof_type_specifier(&t1
.spec
);
2764 /*printf("assignment size mismatch %u vs %u\n", sz0, sz1);*/
2769 if (t0
.spec
.type
== SLANG_SPEC_STRUCT
&&
2770 t1
.spec
.type
== SLANG_SPEC_STRUCT
&&
2771 t0
.spec
._struct
->a_name
!= t1
.spec
._struct
->a_name
)
2774 if (t0
.spec
.type
== SLANG_SPEC_FLOAT
&&
2775 t1
.spec
.type
== SLANG_SPEC_BOOL
)
2778 #if 0 /* not used just yet - causes problems elsewhere */
2779 if (t0
.spec
.type
== SLANG_SPEC_INT
&&
2780 t1
.spec
.type
== SLANG_SPEC_FLOAT
)
2784 if (t0
.spec
.type
== SLANG_SPEC_BOOL
&&
2785 t1
.spec
.type
== SLANG_SPEC_FLOAT
)
2788 if (t0
.spec
.type
== SLANG_SPEC_BOOL
&&
2789 t1
.spec
.type
== SLANG_SPEC_INT
)
2798 * Generate IR tree for a variable declaration.
2800 static slang_ir_node
*
2801 _slang_gen_declaration(slang_assemble_ctx
*A
, slang_operation
*oper
)
2804 slang_ir_node
*varDecl
;
2806 const char *varName
= (char *) oper
->a_id
;
2807 slang_operation
*initializer
;
2809 assert(oper
->type
== SLANG_OPER_VARIABLE_DECL
);
2810 assert(oper
->num_children
<= 1);
2812 v
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
2814 return NULL
; /* "shouldn't happen" */
2816 if (v
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
||
2817 v
->type
.qualifier
== SLANG_QUAL_VARYING
||
2818 v
->type
.qualifier
== SLANG_QUAL_UNIFORM
) {
2819 /* can't declare attribute/uniform vars inside functions */
2820 slang_info_log_error(A
->log
,
2821 "local variable '%s' cannot be an attribute/uniform/varying",
2828 slang_info_log_error(A
->log
, "variable '%s' redeclared", varName
);
2833 varDecl
= _slang_gen_var_decl(A
, v
);
2837 /* check if the var has an initializer */
2838 if (oper
->num_children
> 0) {
2839 assert(oper
->num_children
== 1);
2840 initializer
= &oper
->children
[0];
2842 else if (v
->initializer
) {
2843 initializer
= v
->initializer
;
2849 if (v
->type
.qualifier
== SLANG_QUAL_CONST
&& !initializer
) {
2850 slang_info_log_error(A
->log
,
2851 "const-qualified variable '%s' requires initializer",
2858 slang_ir_node
*var
, *init
;
2860 /* type check/compare var and initializer */
2861 if (!_slang_assignment_compatible(A
, oper
, initializer
)) {
2862 slang_info_log_error(A
->log
, "incompatible types in assignment");
2866 var
= new_var(A
, oper
, oper
->a_id
);
2868 slang_info_log_error(A
->log
, "undefined variable '%s'", varName
);
2872 if (v
->type
.qualifier
== SLANG_QUAL_CONST
) {
2873 /* if the variable is const, the initializer must be a const
2874 * expression as well.
2877 if (!_slang_is_constant_expr(initializer
)) {
2878 slang_info_log_error(A
->log
,
2879 "initializer for %s not constant", varName
);
2885 _slang_simplify(initializer
, &A
->space
, A
->atoms
);
2887 init
= _slang_gen_operation(A
, initializer
);
2891 /*assert(init->Store);*/
2893 /* XXX remove this when type checking is added above */
2894 if (init
->Store
&& var
->Store
->Size
!= init
->Store
->Size
) {
2895 slang_info_log_error(A
->log
, "invalid assignment (wrong types)");
2899 n
= new_node2(IR_COPY
, var
, init
);
2900 n
= new_seq(varDecl
, n
);
2911 * Generate IR tree for a variable (such as in an expression).
2913 static slang_ir_node
*
2914 _slang_gen_variable(slang_assemble_ctx
* A
, slang_operation
*oper
)
2916 /* If there's a variable associated with this oper (from inlining)
2917 * use it. Otherwise, use the oper's var id.
2919 slang_atom aVar
= oper
->var
? oper
->var
->a_name
: oper
->a_id
;
2920 slang_ir_node
*n
= new_var(A
, oper
, aVar
);
2922 slang_info_log_error(A
->log
, "undefined variable '%s'", (char *) aVar
);
2931 * Return the number of components actually named by the swizzle.
2932 * Recall that swizzles may have undefined/don't-care values.
2935 swizzle_size(GLuint swizzle
)
2938 for (i
= 0; i
< 4; i
++) {
2939 GLuint swz
= GET_SWZ(swizzle
, i
);
2940 size
+= (swz
>= 0 && swz
<= 3);
2946 static slang_ir_node
*
2947 _slang_gen_swizzle(slang_ir_node
*child
, GLuint swizzle
)
2949 slang_ir_node
*n
= new_node1(IR_SWIZZLE
, child
);
2953 n
->Store
= _slang_new_ir_storage_relative(0,
2954 swizzle_size(swizzle
),
2956 n
->Store
->Swizzle
= swizzle
;
2963 is_store_writable(const slang_assemble_ctx
*A
, const slang_ir_storage
*store
)
2965 while (store
->Parent
)
2966 store
= store
->Parent
;
2968 if (!(store
->File
== PROGRAM_OUTPUT
||
2969 store
->File
== PROGRAM_TEMPORARY
||
2970 (store
->File
== PROGRAM_VARYING
&&
2971 A
->program
->Target
== GL_VERTEX_PROGRAM_ARB
))) {
2981 * Generate IR tree for an assignment (=).
2983 static slang_ir_node
*
2984 _slang_gen_assignment(slang_assemble_ctx
* A
, slang_operation
*oper
)
2986 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
) {
2987 /* Check that var is writeable */
2989 = _slang_locate_variable(oper
->children
[0].locals
,
2990 oper
->children
[0].a_id
, GL_TRUE
);
2992 slang_info_log_error(A
->log
, "undefined variable '%s'",
2993 (char *) oper
->children
[0].a_id
);
2996 if (var
->type
.qualifier
== SLANG_QUAL_CONST
||
2997 var
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
||
2998 var
->type
.qualifier
== SLANG_QUAL_UNIFORM
||
2999 (var
->type
.qualifier
== SLANG_QUAL_VARYING
&&
3000 A
->program
->Target
== GL_FRAGMENT_PROGRAM_ARB
)) {
3001 slang_info_log_error(A
->log
,
3002 "illegal assignment to read-only variable '%s'",
3003 (char *) oper
->children
[0].a_id
);
3008 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
&&
3009 oper
->children
[1].type
== SLANG_OPER_CALL
) {
3010 /* Special case of: x = f(a, b)
3011 * Replace with f(a, b, x) (where x == hidden __retVal out param)
3013 * XXX this could be even more effective if we could accomodate
3014 * cases such as "v.x = f();" - would help with typical vertex
3018 n
= _slang_gen_function_call_name(A
,
3019 (const char *) oper
->children
[1].a_id
,
3020 &oper
->children
[1], &oper
->children
[0]);
3024 slang_ir_node
*n
, *lhs
, *rhs
;
3026 /* lhs and rhs type checking */
3027 if (!_slang_assignment_compatible(A
,
3029 &oper
->children
[1])) {
3030 slang_info_log_error(A
->log
, "incompatible types in assignment");
3034 lhs
= _slang_gen_operation(A
, &oper
->children
[0]);
3040 slang_info_log_error(A
->log
,
3041 "invalid left hand side for assignment");
3045 /* check that lhs is writable */
3046 if (!is_store_writable(A
, lhs
->Store
)) {
3047 slang_info_log_error(A
->log
,
3048 "illegal assignment to read-only l-value");
3052 rhs
= _slang_gen_operation(A
, &oper
->children
[1]);
3054 /* convert lhs swizzle into writemask */
3055 GLuint writemask
, newSwizzle
;
3056 if (!swizzle_to_writemask(A
, lhs
->Store
->Swizzle
,
3057 &writemask
, &newSwizzle
)) {
3058 /* Non-simple writemask, need to swizzle right hand side in
3059 * order to put components into the right place.
3061 rhs
= _slang_gen_swizzle(rhs
, newSwizzle
);
3063 n
= new_node2(IR_COPY
, lhs
, rhs
);
3064 n
->Writemask
= writemask
;
3075 * Generate IR tree for referencing a field in a struct (or basic vector type)
3077 static slang_ir_node
*
3078 _slang_gen_struct_field(slang_assemble_ctx
* A
, slang_operation
*oper
)
3082 /* type of struct */
3083 slang_typeinfo_construct(&ti
);
3084 _slang_typeof_operation(A
, &oper
->children
[0], &ti
);
3086 if (_slang_type_is_vector(ti
.spec
.type
)) {
3087 /* the field should be a swizzle */
3088 const GLuint rows
= _slang_type_dim(ti
.spec
.type
);
3092 if (!_slang_is_swizzle((char *) oper
->a_id
, rows
, &swz
)) {
3093 slang_info_log_error(A
->log
, "Bad swizzle");
3096 swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
3101 n
= _slang_gen_operation(A
, &oper
->children
[0]);
3102 /* create new parent node with swizzle */
3104 n
= _slang_gen_swizzle(n
, swizzle
);
3107 else if ( ti
.spec
.type
== SLANG_SPEC_FLOAT
3108 || ti
.spec
.type
== SLANG_SPEC_INT
3109 || ti
.spec
.type
== SLANG_SPEC_BOOL
) {
3110 const GLuint rows
= 1;
3114 if (!_slang_is_swizzle((char *) oper
->a_id
, rows
, &swz
)) {
3115 slang_info_log_error(A
->log
, "Bad swizzle");
3117 swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
3121 n
= _slang_gen_operation(A
, &oper
->children
[0]);
3122 /* create new parent node with swizzle */
3123 n
= _slang_gen_swizzle(n
, swizzle
);
3127 /* the field is a structure member (base.field) */
3128 /* oper->children[0] is the base */
3129 /* oper->a_id is the field name */
3130 slang_ir_node
*base
, *n
;
3131 slang_typeinfo field_ti
;
3132 GLint fieldSize
, fieldOffset
= -1, swz
;
3135 slang_typeinfo_construct(&field_ti
);
3136 _slang_typeof_operation(A
, oper
, &field_ti
);
3138 fieldSize
= _slang_sizeof_type_specifier(&field_ti
.spec
);
3140 fieldOffset
= _slang_field_offset(&ti
.spec
, oper
->a_id
);
3142 if (fieldSize
== 0 || fieldOffset
< 0) {
3143 const char *structName
;
3144 if (ti
.spec
._struct
)
3145 structName
= (char *) ti
.spec
._struct
->a_name
;
3147 structName
= "unknown";
3148 slang_info_log_error(A
->log
,
3149 "\"%s\" is not a member of struct \"%s\"",
3150 (char *) oper
->a_id
, structName
);
3153 assert(fieldSize
>= 0);
3155 base
= _slang_gen_operation(A
, &oper
->children
[0]);
3157 /* error msg should have already been logged */
3161 n
= new_node1(IR_FIELD
, base
);
3166 /* setup the storage info for this node */
3167 swz
= fieldOffset
% 4;
3169 n
->Field
= (char *) oper
->a_id
;
3170 n
->Store
= _slang_new_ir_storage_relative(fieldOffset
/ 4,
3174 n
->Store
->Swizzle
= MAKE_SWIZZLE4(swz
, swz
, swz
, swz
);
3175 else if (fieldSize
== 2)
3176 n
->Store
->Swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
,
3177 SWIZZLE_NIL
, SWIZZLE_NIL
);
3178 else if (fieldSize
== 3)
3179 n
->Store
->Swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
,
3180 SWIZZLE_Z
, SWIZZLE_NIL
);
3188 * Gen code for array indexing.
3190 static slang_ir_node
*
3191 _slang_gen_array_element(slang_assemble_ctx
* A
, slang_operation
*oper
)
3193 slang_typeinfo array_ti
;
3195 /* get array's type info */
3196 slang_typeinfo_construct(&array_ti
);
3197 _slang_typeof_operation(A
, &oper
->children
[0], &array_ti
);
3199 if (_slang_type_is_vector(array_ti
.spec
.type
)) {
3200 /* indexing a simple vector type: "vec4 v; v[0]=p;" */
3201 /* translate the index into a swizzle/writemask: "v.x=p" */
3202 const GLuint max
= _slang_type_dim(array_ti
.spec
.type
);
3206 index
= (GLint
) oper
->children
[1].literal
[0];
3207 if (oper
->children
[1].type
!= SLANG_OPER_LITERAL_INT
||
3208 index
>= (GLint
) max
) {
3209 slang_info_log_error(A
->log
, "Invalid array index for vector type");
3213 n
= _slang_gen_operation(A
, &oper
->children
[0]);
3215 /* use swizzle to access the element */
3216 GLuint swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
+ index
,
3220 n
= _slang_gen_swizzle(n
, swizzle
);
3221 /*n->Store = _slang_clone_ir_storage_swz(n->Store, */
3222 n
->Writemask
= WRITEMASK_X
<< index
;
3228 /* conventional array */
3229 slang_typeinfo elem_ti
;
3230 slang_ir_node
*elem
, *array
, *index
;
3231 GLint elemSize
, arrayLen
;
3233 /* size of array element */
3234 slang_typeinfo_construct(&elem_ti
);
3235 _slang_typeof_operation(A
, oper
, &elem_ti
);
3236 elemSize
= _slang_sizeof_type_specifier(&elem_ti
.spec
);
3238 if (_slang_type_is_matrix(array_ti
.spec
.type
))
3239 arrayLen
= _slang_type_dim(array_ti
.spec
.type
);
3241 arrayLen
= array_ti
.array_len
;
3243 slang_typeinfo_destruct(&array_ti
);
3244 slang_typeinfo_destruct(&elem_ti
);
3246 if (elemSize
<= 0) {
3247 /* unknown var or type */
3248 slang_info_log_error(A
->log
, "Undefined variable or type");
3252 array
= _slang_gen_operation(A
, &oper
->children
[0]);
3253 index
= _slang_gen_operation(A
, &oper
->children
[1]);
3254 if (array
&& index
) {
3256 GLint constIndex
= 0;
3257 if (index
->Opcode
== IR_FLOAT
) {
3258 constIndex
= (int) index
->Value
[0];
3259 if (constIndex
< 0 || constIndex
>= arrayLen
) {
3260 slang_info_log_error(A
->log
,
3261 "Array index out of bounds (index=%d size=%d)",
3262 constIndex
, arrayLen
);
3263 _slang_free_ir_tree(array
);
3264 _slang_free_ir_tree(index
);
3269 if (!array
->Store
) {
3270 slang_info_log_error(A
->log
, "Invalid array");
3274 elem
= new_node2(IR_ELEMENT
, array
, index
);
3275 elem
->Store
= _slang_new_ir_storage_relative(constIndex
,
3279 assert(elem
->Store
->Parent
);
3280 /* XXX try to do some array bounds checking here */
3284 _slang_free_ir_tree(array
);
3285 _slang_free_ir_tree(index
);
3292 static slang_ir_node
*
3293 _slang_gen_compare(slang_assemble_ctx
*A
, slang_operation
*oper
,
3294 slang_ir_opcode opcode
)
3296 slang_typeinfo t0
, t1
;
3299 slang_typeinfo_construct(&t0
);
3300 _slang_typeof_operation(A
, &oper
->children
[0], &t0
);
3302 slang_typeinfo_construct(&t1
);
3303 _slang_typeof_operation(A
, &oper
->children
[0], &t1
);
3305 if (t0
.spec
.type
== SLANG_SPEC_ARRAY
||
3306 t1
.spec
.type
== SLANG_SPEC_ARRAY
) {
3307 slang_info_log_error(A
->log
, "Illegal array comparison");
3311 if (oper
->type
!= SLANG_OPER_EQUAL
&&
3312 oper
->type
!= SLANG_OPER_NOTEQUAL
) {
3313 /* <, <=, >, >= can only be used with scalars */
3314 if ((t0
.spec
.type
!= SLANG_SPEC_INT
&&
3315 t0
.spec
.type
!= SLANG_SPEC_FLOAT
) ||
3316 (t1
.spec
.type
!= SLANG_SPEC_INT
&&
3317 t1
.spec
.type
!= SLANG_SPEC_FLOAT
)) {
3318 slang_info_log_error(A
->log
, "Incompatible type(s) for inequality operator");
3323 n
= new_node2(opcode
,
3324 _slang_gen_operation(A
, &oper
->children
[0]),
3325 _slang_gen_operation(A
, &oper
->children
[1]));
3327 /* result is a bool (size 1) */
3328 n
->Store
= _slang_new_ir_storage(PROGRAM_TEMPORARY
, -1, 1);
3336 print_vars(slang_variable_scope
*s
)
3340 for (i
= 0; i
< s
->num_variables
; i
++) {
3342 (char*) s
->variables
[i
]->a_name
,
3343 s
->variables
[i
]->declared
);
3353 _slang_undeclare_vars(slang_variable_scope
*locals
)
3355 if (locals
->num_variables
> 0) {
3357 for (i
= 0; i
< locals
->num_variables
; i
++) {
3358 slang_variable
*v
= locals
->variables
[i
];
3359 printf("undeclare %s at %p\n", (char*) v
->a_name
, v
);
3360 v
->declared
= GL_FALSE
;
3368 * Generate IR tree for a slang_operation (AST node)
3370 static slang_ir_node
*
3371 _slang_gen_operation(slang_assemble_ctx
* A
, slang_operation
*oper
)
3373 switch (oper
->type
) {
3374 case SLANG_OPER_BLOCK_NEW_SCOPE
:
3378 _slang_push_var_table(A
->vartable
);
3380 oper
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
; /* temp change */
3381 n
= _slang_gen_operation(A
, oper
);
3382 oper
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
; /* restore */
3384 _slang_pop_var_table(A
->vartable
);
3386 /*_slang_undeclare_vars(oper->locals);*/
3387 /*print_vars(oper->locals);*/
3390 n
= new_node1(IR_SCOPE
, n
);
3395 case SLANG_OPER_BLOCK_NO_NEW_SCOPE
:
3396 /* list of operations */
3397 if (oper
->num_children
> 0)
3399 slang_ir_node
*n
, *tree
= NULL
;
3402 for (i
= 0; i
< oper
->num_children
; i
++) {
3403 n
= _slang_gen_operation(A
, &oper
->children
[i
]);
3405 _slang_free_ir_tree(tree
);
3406 return NULL
; /* error must have occured */
3408 tree
= new_seq(tree
, n
);
3414 return new_node0(IR_NOP
);
3417 case SLANG_OPER_EXPRESSION
:
3418 return _slang_gen_operation(A
, &oper
->children
[0]);
3420 case SLANG_OPER_FOR
:
3421 return _slang_gen_for(A
, oper
);
3423 return _slang_gen_do(A
, oper
);
3424 case SLANG_OPER_WHILE
:
3425 return _slang_gen_while(A
, oper
);
3426 case SLANG_OPER_BREAK
:
3428 slang_info_log_error(A
->log
, "'break' not in loop");
3431 return new_break(A
->CurLoop
);
3432 case SLANG_OPER_CONTINUE
:
3434 slang_info_log_error(A
->log
, "'continue' not in loop");
3437 return _slang_gen_continue(A
, oper
);
3438 case SLANG_OPER_DISCARD
:
3439 return new_node0(IR_KILL
);
3441 case SLANG_OPER_EQUAL
:
3442 return _slang_gen_compare(A
, oper
, IR_EQUAL
);
3443 case SLANG_OPER_NOTEQUAL
:
3444 return _slang_gen_compare(A
, oper
, IR_NOTEQUAL
);
3445 case SLANG_OPER_GREATER
:
3446 return _slang_gen_compare(A
, oper
, IR_SGT
);
3447 case SLANG_OPER_LESS
:
3448 return _slang_gen_compare(A
, oper
, IR_SLT
);
3449 case SLANG_OPER_GREATEREQUAL
:
3450 return _slang_gen_compare(A
, oper
, IR_SGE
);
3451 case SLANG_OPER_LESSEQUAL
:
3452 return _slang_gen_compare(A
, oper
, IR_SLE
);
3453 case SLANG_OPER_ADD
:
3456 assert(oper
->num_children
== 2);
3457 n
= _slang_gen_function_call_name(A
, "+", oper
, NULL
);
3460 case SLANG_OPER_SUBTRACT
:
3463 assert(oper
->num_children
== 2);
3464 n
= _slang_gen_function_call_name(A
, "-", oper
, NULL
);
3467 case SLANG_OPER_MULTIPLY
:
3470 assert(oper
->num_children
== 2);
3471 n
= _slang_gen_function_call_name(A
, "*", oper
, NULL
);
3474 case SLANG_OPER_DIVIDE
:
3477 assert(oper
->num_children
== 2);
3478 n
= _slang_gen_function_call_name(A
, "/", oper
, NULL
);
3481 case SLANG_OPER_MINUS
:
3484 assert(oper
->num_children
== 1);
3485 n
= _slang_gen_function_call_name(A
, "-", oper
, NULL
);
3488 case SLANG_OPER_PLUS
:
3489 /* +expr --> do nothing */
3490 return _slang_gen_operation(A
, &oper
->children
[0]);
3491 case SLANG_OPER_VARIABLE_DECL
:
3492 return _slang_gen_declaration(A
, oper
);
3493 case SLANG_OPER_ASSIGN
:
3494 return _slang_gen_assignment(A
, oper
);
3495 case SLANG_OPER_ADDASSIGN
:
3498 assert(oper
->num_children
== 2);
3499 n
= _slang_gen_function_call_name(A
, "+=", oper
, NULL
);
3502 case SLANG_OPER_SUBASSIGN
:
3505 assert(oper
->num_children
== 2);
3506 n
= _slang_gen_function_call_name(A
, "-=", oper
, NULL
);
3510 case SLANG_OPER_MULASSIGN
:
3513 assert(oper
->num_children
== 2);
3514 n
= _slang_gen_function_call_name(A
, "*=", oper
, NULL
);
3517 case SLANG_OPER_DIVASSIGN
:
3520 assert(oper
->num_children
== 2);
3521 n
= _slang_gen_function_call_name(A
, "/=", oper
, NULL
);
3524 case SLANG_OPER_LOGICALAND
:
3527 assert(oper
->num_children
== 2);
3528 n
= _slang_gen_logical_and(A
, oper
);
3531 case SLANG_OPER_LOGICALOR
:
3534 assert(oper
->num_children
== 2);
3535 n
= _slang_gen_logical_or(A
, oper
);
3538 case SLANG_OPER_LOGICALXOR
:
3539 return _slang_gen_xor(A
, oper
);
3540 case SLANG_OPER_NOT
:
3541 return _slang_gen_not(A
, oper
);
3542 case SLANG_OPER_SELECT
: /* b ? x : y */
3545 assert(oper
->num_children
== 3);
3546 n
= _slang_gen_select(A
, oper
);
3550 case SLANG_OPER_ASM
:
3551 return _slang_gen_asm(A
, oper
, NULL
);
3552 case SLANG_OPER_CALL
:
3553 return _slang_gen_function_call_name(A
, (const char *) oper
->a_id
,
3555 case SLANG_OPER_RETURN
:
3556 return _slang_gen_return(A
, oper
);
3557 case SLANG_OPER_LABEL
:
3558 return new_label(oper
->label
);
3559 case SLANG_OPER_IDENTIFIER
:
3560 return _slang_gen_variable(A
, oper
);
3562 return _slang_gen_if(A
, oper
);
3563 case SLANG_OPER_FIELD
:
3564 return _slang_gen_struct_field(A
, oper
);
3565 case SLANG_OPER_SUBSCRIPT
:
3566 return _slang_gen_array_element(A
, oper
);
3567 case SLANG_OPER_LITERAL_FLOAT
:
3569 case SLANG_OPER_LITERAL_INT
:
3571 case SLANG_OPER_LITERAL_BOOL
:
3572 return new_float_literal(oper
->literal
, oper
->literal_size
);
3574 case SLANG_OPER_POSTINCREMENT
: /* var++ */
3577 assert(oper
->num_children
== 1);
3578 n
= _slang_gen_function_call_name(A
, "__postIncr", oper
, NULL
);
3581 case SLANG_OPER_POSTDECREMENT
: /* var-- */
3584 assert(oper
->num_children
== 1);
3585 n
= _slang_gen_function_call_name(A
, "__postDecr", oper
, NULL
);
3588 case SLANG_OPER_PREINCREMENT
: /* ++var */
3591 assert(oper
->num_children
== 1);
3592 n
= _slang_gen_function_call_name(A
, "++", oper
, NULL
);
3595 case SLANG_OPER_PREDECREMENT
: /* --var */
3598 assert(oper
->num_children
== 1);
3599 n
= _slang_gen_function_call_name(A
, "--", oper
, NULL
);
3603 case SLANG_OPER_NON_INLINED_CALL
:
3604 case SLANG_OPER_SEQUENCE
:
3606 slang_ir_node
*tree
= NULL
;
3608 for (i
= 0; i
< oper
->num_children
; i
++) {
3609 slang_ir_node
*n
= _slang_gen_operation(A
, &oper
->children
[i
]);
3610 tree
= new_seq(tree
, n
);
3612 tree
->Store
= n
->Store
;
3614 if (oper
->type
== SLANG_OPER_NON_INLINED_CALL
) {
3615 tree
= new_function_call(tree
, oper
->label
);
3620 case SLANG_OPER_NONE
:
3621 case SLANG_OPER_VOID
:
3622 /* returning NULL here would generate an error */
3623 return new_node0(IR_NOP
);
3626 _mesa_problem(NULL
, "bad node type %d in _slang_gen_operation",
3628 return new_node0(IR_NOP
);
3636 * Compute total size of array give size of element, number of elements.
3639 array_size(GLint baseSize
, GLint arrayLen
)
3643 /* round up base type to multiple of 4 */
3644 total
= ((baseSize
+ 3) & ~0x3) * MAX2(arrayLen
, 1);
3654 * Called by compiler when a global variable has been parsed/compiled.
3655 * Here we examine the variable's type to determine what kind of register
3656 * storage will be used.
3658 * A uniform such as "gl_Position" will become the register specification
3659 * (PROGRAM_OUTPUT, VERT_RESULT_HPOS). Or, uniform "gl_FogFragCoord"
3660 * will be (PROGRAM_INPUT, FRAG_ATTRIB_FOGC).
3662 * Samplers are interesting. For "uniform sampler2D tex;" we'll specify
3663 * (PROGRAM_SAMPLER, index) where index is resolved at link-time to an
3664 * actual texture unit (as specified by the user calling glUniform1i()).
3667 _slang_codegen_global_variable(slang_assemble_ctx
*A
, slang_variable
*var
,
3668 slang_unit_type type
)
3670 struct gl_program
*prog
= A
->program
;
3671 const char *varName
= (char *) var
->a_name
;
3672 GLboolean success
= GL_TRUE
;
3673 slang_ir_storage
*store
= NULL
;
3675 const GLenum datatype
= _slang_gltype_from_specifier(&var
->type
.specifier
);
3676 const GLint texIndex
= sampler_to_texture_index(var
->type
.specifier
.type
);
3677 const GLint size
= _slang_sizeof_type_specifier(&var
->type
.specifier
);
3679 if (texIndex
!= -1) {
3680 /* This is a texture sampler variable...
3681 * store->File = PROGRAM_SAMPLER
3682 * store->Index = sampler number (0..7, typically)
3683 * store->Size = texture type index (1D, 2D, 3D, cube, etc)
3685 if (var
->initializer
) {
3686 slang_info_log_error(A
->log
, "illegal assignment to '%s'", varName
);
3689 #if FEATURE_es2_glsl /* XXX should use FEATURE_texture_rect */
3690 /* disallow rect samplers */
3691 if (var
->type
.specifier
.type
== SLANG_SPEC_SAMPLER2DRECT
||
3692 var
->type
.specifier
.type
== SLANG_SPEC_SAMPLER2DRECTSHADOW
) {
3693 slang_info_log_error(A
->log
, "invalid sampler type for '%s'", varName
);
3698 GLint sampNum
= _mesa_add_sampler(prog
->Parameters
, varName
, datatype
);
3699 store
= _slang_new_ir_storage(PROGRAM_SAMPLER
, sampNum
, texIndex
);
3701 if (dbg
) printf("SAMPLER ");
3703 else if (var
->type
.qualifier
== SLANG_QUAL_UNIFORM
) {
3704 /* Uniform variable */
3705 const GLint totalSize
= array_size(size
, var
->array_len
);
3706 const GLuint swizzle
= _slang_var_swizzle(totalSize
, 0);
3708 if (var
->initializer
) {
3709 slang_info_log_error(A
->log
, "illegal initializer for uniform '%s'", varName
);
3714 /* user-defined uniform */
3715 if (datatype
== GL_NONE
) {
3716 if (var
->type
.specifier
.type
== SLANG_SPEC_STRUCT
) {
3717 /* temporary work-around */
3718 GLenum datatype
= GL_FLOAT
;
3719 GLint uniformLoc
= _mesa_add_uniform(prog
->Parameters
, varName
,
3720 totalSize
, datatype
);
3721 store
= _slang_new_ir_storage_swz(PROGRAM_UNIFORM
, uniformLoc
,
3722 totalSize
, swizzle
);
3724 /* XXX what we need to do is unroll the struct into its
3725 * basic types, creating a uniform variable for each.
3733 * Should produce uniforms:
3734 * "f.a" (GL_FLOAT_VEC3)
3735 * "f.b" (GL_FLOAT_VEC4)
3739 slang_info_log_error(A
->log
,
3740 "invalid datatype for uniform variable %s",
3746 GLint uniformLoc
= _mesa_add_uniform(prog
->Parameters
, varName
,
3747 totalSize
, datatype
);
3748 store
= _slang_new_ir_storage_swz(PROGRAM_UNIFORM
, uniformLoc
,
3749 totalSize
, swizzle
);
3753 /* pre-defined uniform, like gl_ModelviewMatrix */
3754 /* We know it's a uniform, but don't allocate storage unless
3757 store
= _slang_new_ir_storage_swz(PROGRAM_STATE_VAR
, -1,
3758 totalSize
, swizzle
);
3760 if (dbg
) printf("UNIFORM (sz %d) ", totalSize
);
3762 else if (var
->type
.qualifier
== SLANG_QUAL_VARYING
) {
3763 const GLint totalSize
= array_size(size
, var
->array_len
);
3765 /* varyings must be float, vec or mat */
3766 if (!_slang_type_is_float_vec_mat(var
->type
.specifier
.type
) &&
3767 var
->type
.specifier
.type
!= SLANG_SPEC_ARRAY
) {
3768 slang_info_log_error(A
->log
,
3769 "varying '%s' must be float/vector/matrix",
3774 if (var
->initializer
) {
3775 slang_info_log_error(A
->log
, "illegal initializer for varying '%s'",
3781 /* user-defined varying */
3782 GLint varyingLoc
= _mesa_add_varying(prog
->Varying
, varName
, totalSize
);
3783 GLuint swizzle
= _slang_var_swizzle(size
, 0);
3784 store
= _slang_new_ir_storage_swz(PROGRAM_VARYING
, varyingLoc
,
3785 totalSize
, swizzle
);
3788 /* pre-defined varying, like gl_Color or gl_TexCoord */
3789 if (type
== SLANG_UNIT_FRAGMENT_BUILTIN
) {
3790 /* fragment program input */
3792 GLint index
= _slang_input_index(varName
, GL_FRAGMENT_PROGRAM_ARB
,
3795 assert(index
< FRAG_ATTRIB_MAX
);
3796 store
= _slang_new_ir_storage_swz(PROGRAM_INPUT
, index
,
3800 /* vertex program output */
3801 GLint index
= _slang_output_index(varName
, GL_VERTEX_PROGRAM_ARB
);
3802 GLuint swizzle
= _slang_var_swizzle(size
, 0);
3804 assert(index
< VERT_RESULT_MAX
);
3805 assert(type
== SLANG_UNIT_VERTEX_BUILTIN
);
3806 store
= _slang_new_ir_storage_swz(PROGRAM_OUTPUT
, index
,
3809 if (dbg
) printf("V/F ");
3811 if (dbg
) printf("VARYING ");
3813 else if (var
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
) {
3816 /* attributes must be float, vec or mat */
3817 if (!_slang_type_is_float_vec_mat(var
->type
.specifier
.type
)) {
3818 slang_info_log_error(A
->log
,
3819 "attribute '%s' must be float/vector/matrix",
3825 /* user-defined vertex attribute */
3826 const GLint attr
= -1; /* unknown */
3827 swizzle
= _slang_var_swizzle(size
, 0);
3828 index
= _mesa_add_attribute(prog
->Attributes
, varName
,
3829 size
, datatype
, attr
);
3831 index
= VERT_ATTRIB_GENERIC0
+ index
;
3834 /* pre-defined vertex attrib */
3835 index
= _slang_input_index(varName
, GL_VERTEX_PROGRAM_ARB
, &swizzle
);
3838 store
= _slang_new_ir_storage_swz(PROGRAM_INPUT
, index
, size
, swizzle
);
3839 if (dbg
) printf("ATTRIB ");
3841 else if (var
->type
.qualifier
== SLANG_QUAL_FIXEDINPUT
) {
3842 GLuint swizzle
= SWIZZLE_XYZW
; /* silence compiler warning */
3843 GLint index
= _slang_input_index(varName
, GL_FRAGMENT_PROGRAM_ARB
,
3845 store
= _slang_new_ir_storage_swz(PROGRAM_INPUT
, index
, size
, swizzle
);
3846 if (dbg
) printf("INPUT ");
3848 else if (var
->type
.qualifier
== SLANG_QUAL_FIXEDOUTPUT
) {
3849 if (type
== SLANG_UNIT_VERTEX_BUILTIN
) {
3850 GLint index
= _slang_output_index(varName
, GL_VERTEX_PROGRAM_ARB
);
3851 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, size
);
3854 GLint index
= _slang_output_index(varName
, GL_FRAGMENT_PROGRAM_ARB
);
3855 GLint specialSize
= 4; /* treat all fragment outputs as float[4] */
3856 assert(type
== SLANG_UNIT_FRAGMENT_BUILTIN
);
3857 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, specialSize
);
3859 if (dbg
) printf("OUTPUT ");
3861 else if (var
->type
.qualifier
== SLANG_QUAL_CONST
&& !prog
) {
3862 /* pre-defined global constant, like gl_MaxLights */
3863 store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, size
);
3864 if (dbg
) printf("CONST ");
3867 /* ordinary variable (may be const) */
3870 /* IR node to declare the variable */
3871 n
= _slang_gen_var_decl(A
, var
);
3873 /* IR code for the var's initializer, if present */
3874 if (var
->initializer
) {
3875 slang_ir_node
*lhs
, *rhs
, *init
;
3877 /* Generate IR_COPY instruction to initialize the variable */
3878 lhs
= new_node0(IR_VAR
);
3880 lhs
->Store
= n
->Store
;
3882 /* constant folding, etc */
3883 _slang_simplify(var
->initializer
, &A
->space
, A
->atoms
);
3885 rhs
= _slang_gen_operation(A
, var
->initializer
);
3887 init
= new_node2(IR_COPY
, lhs
, rhs
);
3888 n
= new_seq(n
, init
);
3891 success
= _slang_emit_code(n
, A
->vartable
, A
->program
, GL_FALSE
, A
->log
);
3893 _slang_free_ir_tree(n
);
3896 if (dbg
) printf("GLOBAL VAR %s idx %d\n", (char*) var
->a_name
,
3897 store
? store
->Index
: -2);
3900 var
->aux
= store
; /* save var's storage info */
3902 var
->declared
= GL_TRUE
;
3909 * Produce an IR tree from a function AST (fun->body).
3910 * Then call the code emitter to convert the IR tree into gl_program
3914 _slang_codegen_function(slang_assemble_ctx
* A
, slang_function
* fun
)
3917 GLboolean success
= GL_TRUE
;
3919 if (_mesa_strcmp((char *) fun
->header
.a_name
, "main") != 0) {
3920 /* we only really generate code for main, all other functions get
3921 * inlined or codegen'd upon an actual call.
3924 /* do some basic error checking though */
3925 if (fun
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
3926 /* check that non-void functions actually return something */
3928 = _slang_find_node_type(fun
->body
, SLANG_OPER_RETURN
);
3930 slang_info_log_error(A
->log
,
3931 "function \"%s\" has no return statement",
3932 (char *) fun
->header
.a_name
);
3934 "function \"%s\" has no return statement\n",
3935 (char *) fun
->header
.a_name
);
3940 return GL_TRUE
; /* not an error */
3944 printf("\n*********** codegen_function %s\n", (char *) fun
->header
.a_name
);
3945 slang_print_function(fun
, 1);
3948 /* should have been allocated earlier: */
3949 assert(A
->program
->Parameters
);
3950 assert(A
->program
->Varying
);
3951 assert(A
->vartable
);
3953 A
->CurFunction
= fun
;
3955 /* fold constant expressions, etc. */
3956 _slang_simplify(fun
->body
, &A
->space
, A
->atoms
);
3959 printf("\n*********** simplified %s\n", (char *) fun
->header
.a_name
);
3960 slang_print_function(fun
, 1);
3963 /* Create an end-of-function label */
3964 A
->curFuncEndLabel
= _slang_label_new("__endOfFunc__main");
3966 /* push new vartable scope */
3967 _slang_push_var_table(A
->vartable
);
3969 /* Generate IR tree for the function body code */
3970 n
= _slang_gen_operation(A
, fun
->body
);
3972 n
= new_node1(IR_SCOPE
, n
);
3974 /* pop vartable, restore previous */
3975 _slang_pop_var_table(A
->vartable
);
3978 /* XXX record error */
3982 /* append an end-of-function-label to IR tree */
3983 n
= new_seq(n
, new_label(A
->curFuncEndLabel
));
3985 /*_slang_label_delete(A->curFuncEndLabel);*/
3986 A
->curFuncEndLabel
= NULL
;
3989 printf("************* New AST for %s *****\n", (char*)fun
->header
.a_name
);
3990 slang_print_function(fun
, 1);
3993 printf("************* IR for %s *******\n", (char*)fun
->header
.a_name
);
3994 _slang_print_ir_tree(n
, 0);
3997 printf("************* End codegen function ************\n\n");
4000 /* Emit program instructions */
4001 success
= _slang_emit_code(n
, A
->vartable
, A
->program
, GL_TRUE
, A
->log
);
4002 _slang_free_ir_tree(n
);
4004 /* free codegen context */
4006 _mesa_free(A->codegen);