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
->store
) {
242 /* node storage info = var storage info */
243 n
->Store
= n
->Var
->store
;
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
->store
= n
->Store
;
255 assert(n
->Var
->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
->InstLocation
= -1;
485 static slang_ir_node
*
486 new_node2(slang_ir_opcode op
, slang_ir_node
*c0
, slang_ir_node
*c1
)
488 return new_node3(op
, c0
, c1
, NULL
);
491 static slang_ir_node
*
492 new_node1(slang_ir_opcode op
, slang_ir_node
*c0
)
494 return new_node3(op
, c0
, NULL
, NULL
);
497 static slang_ir_node
*
498 new_node0(slang_ir_opcode op
)
500 return new_node3(op
, NULL
, NULL
, NULL
);
505 * Create sequence of two nodes.
507 static slang_ir_node
*
508 new_seq(slang_ir_node
*left
, slang_ir_node
*right
)
514 return new_node2(IR_SEQ
, left
, right
);
517 static slang_ir_node
*
518 new_label(slang_label
*label
)
520 slang_ir_node
*n
= new_node0(IR_LABEL
);
527 static slang_ir_node
*
528 new_float_literal(const float v
[4], GLuint size
)
530 slang_ir_node
*n
= new_node0(IR_FLOAT
);
532 COPY_4V(n
->Value
, v
);
533 /* allocate a storage object, but compute actual location (Index) later */
534 n
->Store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, size
);
539 static slang_ir_node
*
540 new_not(slang_ir_node
*n
)
542 return new_node1(IR_NOT
, n
);
547 * Non-inlined function call.
549 static slang_ir_node
*
550 new_function_call(slang_ir_node
*code
, slang_label
*name
)
552 slang_ir_node
*n
= new_node1(IR_CALL
, code
);
561 * Unconditional jump.
563 static slang_ir_node
*
564 new_return(slang_label
*dest
)
566 slang_ir_node
*n
= new_node0(IR_RETURN
);
574 static slang_ir_node
*
575 new_loop(slang_ir_node
*body
)
577 return new_node1(IR_LOOP
, body
);
581 static slang_ir_node
*
582 new_break(slang_ir_node
*loopNode
)
584 slang_ir_node
*n
= new_node0(IR_BREAK
);
586 assert(loopNode
->Opcode
== IR_LOOP
);
588 /* insert this node at head of linked list */
589 n
->List
= loopNode
->List
;
597 * Make new IR_BREAK_IF_TRUE.
599 static slang_ir_node
*
600 new_break_if_true(slang_ir_node
*loopNode
, slang_ir_node
*cond
)
604 assert(loopNode
->Opcode
== IR_LOOP
);
605 n
= new_node1(IR_BREAK_IF_TRUE
, cond
);
607 /* insert this node at head of linked list */
608 n
->List
= loopNode
->List
;
616 * Make new IR_CONT_IF_TRUE node.
618 static slang_ir_node
*
619 new_cont_if_true(slang_ir_node
*loopNode
, slang_ir_node
*cond
)
623 assert(loopNode
->Opcode
== IR_LOOP
);
624 n
= new_node1(IR_CONT_IF_TRUE
, cond
);
626 /* insert this node at head of linked list */
627 n
->List
= loopNode
->List
;
634 static slang_ir_node
*
635 new_cond(slang_ir_node
*n
)
637 slang_ir_node
*c
= new_node1(IR_COND
, n
);
642 static slang_ir_node
*
643 new_if(slang_ir_node
*cond
, slang_ir_node
*ifPart
, slang_ir_node
*elsePart
)
645 return new_node3(IR_IF
, cond
, ifPart
, elsePart
);
650 * New IR_VAR node - a reference to a previously declared variable.
652 static slang_ir_node
*
653 new_var(slang_assemble_ctx
*A
, slang_variable
*var
)
659 assert(var
->declared
);
661 n
= new_node0(IR_VAR
);
663 _slang_attach_storage(n
, var
);
665 printf("new_var %s store=%p\n", (char*)name, (void*) n->Store);
673 * Check if the given function is really just a wrapper for a
674 * basic assembly instruction.
677 slang_is_asm_function(const slang_function
*fun
)
679 if (fun
->body
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
&&
680 fun
->body
->num_children
== 1 &&
681 fun
->body
->children
[0].type
== SLANG_OPER_ASM
) {
689 _slang_is_noop(const slang_operation
*oper
)
692 oper
->type
== SLANG_OPER_VOID
||
693 (oper
->num_children
== 1 && oper
->children
[0].type
== SLANG_OPER_VOID
))
701 * Recursively search tree for a node of the given type.
703 static slang_operation
*
704 _slang_find_node_type(slang_operation
*oper
, slang_operation_type type
)
707 if (oper
->type
== type
)
709 for (i
= 0; i
< oper
->num_children
; i
++) {
710 slang_operation
*p
= _slang_find_node_type(&oper
->children
[i
], type
);
719 * Count the number of operations of the given time rooted at 'oper'.
722 _slang_count_node_type(slang_operation
*oper
, slang_operation_type type
)
725 if (oper
->type
== type
) {
728 for (i
= 0; i
< oper
->num_children
; i
++) {
729 count
+= _slang_count_node_type(&oper
->children
[i
], type
);
736 * Check if the 'return' statement found under 'oper' is a "tail return"
737 * that can be no-op'd. For example:
742 * return; // this is a no-op
745 * This is used when determining if a function can be inlined. If the
746 * 'return' is not the last statement, we can't inline the function since
747 * we still need the semantic behaviour of the 'return' but we don't want
748 * to accidentally return from the _calling_ function. We'd need to use an
749 * unconditional branch, but we don't have such a GPU instruction (not
753 _slang_is_tail_return(const slang_operation
*oper
)
755 GLuint k
= oper
->num_children
;
758 const slang_operation
*last
= &oper
->children
[k
- 1];
759 if (last
->type
== SLANG_OPER_RETURN
)
761 else if (last
->type
== SLANG_OPER_IDENTIFIER
||
762 last
->type
== SLANG_OPER_LABEL
)
763 k
--; /* try prev child */
764 else if (last
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
||
765 last
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
)
766 /* try sub-children */
767 return _slang_is_tail_return(last
);
777 slang_resolve_variable(slang_operation
*oper
)
779 if (oper
->type
== SLANG_OPER_IDENTIFIER
&& !oper
->var
) {
780 oper
->var
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
786 * Replace particular variables (SLANG_OPER_IDENTIFIER) with new expressions.
789 slang_substitute(slang_assemble_ctx
*A
, slang_operation
*oper
,
790 GLuint substCount
, slang_variable
**substOld
,
791 slang_operation
**substNew
, GLboolean isLHS
)
793 switch (oper
->type
) {
794 case SLANG_OPER_VARIABLE_DECL
:
796 slang_variable
*v
= _slang_locate_variable(oper
->locals
,
797 oper
->a_id
, GL_TRUE
);
799 if (v
->initializer
&& oper
->num_children
== 0) {
800 /* set child of oper to copy of initializer */
801 oper
->num_children
= 1;
802 oper
->children
= slang_operation_new(1);
803 slang_operation_copy(&oper
->children
[0], v
->initializer
);
805 if (oper
->num_children
== 1) {
806 /* the initializer */
807 slang_substitute(A
, &oper
->children
[0], substCount
,
808 substOld
, substNew
, GL_FALSE
);
812 case SLANG_OPER_IDENTIFIER
:
813 assert(oper
->num_children
== 0);
814 if (1/**!isLHS XXX FIX */) {
815 slang_atom id
= oper
->a_id
;
818 v
= _slang_locate_variable(oper
->locals
, id
, GL_TRUE
);
820 _mesa_problem(NULL
, "var %s not found!\n", (char *) oper
->a_id
);
824 /* look for a substitution */
825 for (i
= 0; i
< substCount
; i
++) {
826 if (v
== substOld
[i
]) {
827 /* OK, replace this SLANG_OPER_IDENTIFIER with a new expr */
828 #if 0 /* DEBUG only */
829 if (substNew
[i
]->type
== SLANG_OPER_IDENTIFIER
) {
830 assert(substNew
[i
]->var
);
831 assert(substNew
[i
]->var
->a_name
);
832 printf("Substitute %s with %s in id node %p\n",
833 (char*)v
->a_name
, (char*) substNew
[i
]->var
->a_name
,
837 printf("Substitute %s with %f in id node %p\n",
838 (char*)v
->a_name
, substNew
[i
]->literal
[0],
842 slang_operation_copy(oper
, substNew
[i
]);
849 case SLANG_OPER_RETURN
:
850 /* do return replacement here too */
851 assert(oper
->num_children
== 0 || oper
->num_children
== 1);
852 if (oper
->num_children
== 1 && !_slang_is_noop(&oper
->children
[0])) {
858 * then do substitutions on the assignment.
860 slang_operation
*blockOper
, *assignOper
, *returnOper
;
862 /* check if function actually has a return type */
863 assert(A
->CurFunction
);
864 if (A
->CurFunction
->header
.type
.specifier
.type
== SLANG_SPEC_VOID
) {
865 slang_info_log_error(A
->log
, "illegal return expression");
869 blockOper
= slang_operation_new(1);
870 blockOper
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
;
871 blockOper
->num_children
= 2;
872 blockOper
->locals
->outer_scope
= oper
->locals
->outer_scope
;
873 blockOper
->children
= slang_operation_new(2);
874 assignOper
= blockOper
->children
+ 0;
875 returnOper
= blockOper
->children
+ 1;
877 assignOper
->type
= SLANG_OPER_ASSIGN
;
878 assignOper
->num_children
= 2;
879 assignOper
->locals
->outer_scope
= blockOper
->locals
;
880 assignOper
->children
= slang_operation_new(2);
881 assignOper
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
882 assignOper
->children
[0].a_id
= slang_atom_pool_atom(A
->atoms
, "__retVal");
883 assignOper
->children
[0].locals
->outer_scope
= assignOper
->locals
;
885 slang_operation_copy(&assignOper
->children
[1],
888 returnOper
->type
= SLANG_OPER_RETURN
; /* return w/ no value */
889 assert(returnOper
->num_children
== 0);
891 /* do substitutions on the "__retVal = expr" sub-tree */
892 slang_substitute(A
, assignOper
,
893 substCount
, substOld
, substNew
, GL_FALSE
);
895 /* install new code */
896 slang_operation_copy(oper
, blockOper
);
897 slang_operation_destruct(blockOper
);
900 /* check if return value was expected */
901 assert(A
->CurFunction
);
902 if (A
->CurFunction
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
903 slang_info_log_error(A
->log
, "return statement requires an expression");
909 case SLANG_OPER_ASSIGN
:
910 case SLANG_OPER_SUBSCRIPT
:
912 * child[0] can't have substitutions but child[1] can.
914 slang_substitute(A
, &oper
->children
[0],
915 substCount
, substOld
, substNew
, GL_TRUE
);
916 slang_substitute(A
, &oper
->children
[1],
917 substCount
, substOld
, substNew
, GL_FALSE
);
919 case SLANG_OPER_FIELD
:
921 slang_substitute(A
, &oper
->children
[0],
922 substCount
, substOld
, substNew
, GL_TRUE
);
927 for (i
= 0; i
< oper
->num_children
; i
++)
928 slang_substitute(A
, &oper
->children
[i
],
929 substCount
, substOld
, substNew
, GL_FALSE
);
936 * Produce inline code for a call to an assembly instruction.
937 * This is typically used to compile a call to a built-in function like this:
939 * vec4 mix(const vec4 x, const vec4 y, const vec4 a)
941 * __asm vec4_lrp __retVal, a, y, x;
946 * r = mix(p1, p2, p3);
956 * We basically translate a SLANG_OPER_CALL into a SLANG_OPER_ASM.
958 static slang_operation
*
959 slang_inline_asm_function(slang_assemble_ctx
*A
,
960 slang_function
*fun
, slang_operation
*oper
)
962 const GLuint numArgs
= oper
->num_children
;
964 slang_operation
*inlined
;
965 const GLboolean haveRetValue
= _slang_function_has_return_value(fun
);
966 slang_variable
**substOld
;
967 slang_operation
**substNew
;
969 ASSERT(slang_is_asm_function(fun
));
970 ASSERT(fun
->param_count
== numArgs
+ haveRetValue
);
973 printf("Inline %s as %s\n",
974 (char*) fun->header.a_name,
975 (char*) fun->body->children[0].a_id);
979 * We'll substitute formal params with actual args in the asm call.
981 substOld
= (slang_variable
**)
982 _slang_alloc(numArgs
* sizeof(slang_variable
*));
983 substNew
= (slang_operation
**)
984 _slang_alloc(numArgs
* sizeof(slang_operation
*));
985 for (i
= 0; i
< numArgs
; i
++) {
986 substOld
[i
] = fun
->parameters
->variables
[i
];
987 substNew
[i
] = oper
->children
+ i
;
990 /* make a copy of the code to inline */
991 inlined
= slang_operation_new(1);
992 slang_operation_copy(inlined
, &fun
->body
->children
[0]);
994 /* get rid of the __retVal child */
995 inlined
->num_children
--;
996 for (i
= 0; i
< inlined
->num_children
; i
++) {
997 inlined
->children
[i
] = inlined
->children
[i
+ 1];
1001 /* now do formal->actual substitutions */
1002 slang_substitute(A
, inlined
, numArgs
, substOld
, substNew
, GL_FALSE
);
1004 _slang_free(substOld
);
1005 _slang_free(substNew
);
1008 printf("+++++++++++++ inlined asm function %s +++++++++++++\n",
1009 (char *) fun
->header
.a_name
);
1010 slang_print_tree(inlined
, 3);
1011 printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n");
1019 * Inline the given function call operation.
1020 * Return a new slang_operation that corresponds to the inlined code.
1022 static slang_operation
*
1023 slang_inline_function_call(slang_assemble_ctx
* A
, slang_function
*fun
,
1024 slang_operation
*oper
, slang_operation
*returnOper
)
1031 ParamMode
*paramMode
;
1032 const GLboolean haveRetValue
= _slang_function_has_return_value(fun
);
1033 const GLuint numArgs
= oper
->num_children
;
1034 const GLuint totalArgs
= numArgs
+ haveRetValue
;
1035 slang_operation
*args
= oper
->children
;
1036 slang_operation
*inlined
, *top
;
1037 slang_variable
**substOld
;
1038 slang_operation
**substNew
;
1039 GLuint substCount
, numCopyIn
, i
;
1040 slang_function
*prevFunction
;
1041 slang_variable_scope
*newScope
= NULL
;
1044 prevFunction
= A
->CurFunction
;
1045 A
->CurFunction
= fun
;
1047 /*assert(oper->type == SLANG_OPER_CALL); (or (matrix) multiply, etc) */
1048 assert(fun
->param_count
== totalArgs
);
1050 /* allocate temporary arrays */
1051 paramMode
= (ParamMode
*)
1052 _slang_alloc(totalArgs
* sizeof(ParamMode
));
1053 substOld
= (slang_variable
**)
1054 _slang_alloc(totalArgs
* sizeof(slang_variable
*));
1055 substNew
= (slang_operation
**)
1056 _slang_alloc(totalArgs
* sizeof(slang_operation
*));
1059 printf("\nInline call to %s (total vars=%d nparams=%d)\n",
1060 (char *) fun
->header
.a_name
,
1061 fun
->parameters
->num_variables
, numArgs
);
1064 if (haveRetValue
&& !returnOper
) {
1065 /* Create 3-child comma sequence for inlined code:
1066 * child[0]: declare __resultTmp
1067 * child[1]: inlined function body
1068 * child[2]: __resultTmp
1070 slang_operation
*commaSeq
;
1071 slang_operation
*declOper
= NULL
;
1072 slang_variable
*resultVar
;
1074 commaSeq
= slang_operation_new(1);
1075 commaSeq
->type
= SLANG_OPER_SEQUENCE
;
1076 assert(commaSeq
->locals
);
1077 commaSeq
->locals
->outer_scope
= oper
->locals
->outer_scope
;
1078 commaSeq
->num_children
= 3;
1079 commaSeq
->children
= slang_operation_new(3);
1080 /* allocate the return var */
1081 resultVar
= slang_variable_scope_grow(commaSeq
->locals
);
1083 printf("Alloc __resultTmp in scope %p for retval of calling %s\n",
1084 (void*)commaSeq->locals, (char *) fun->header.a_name);
1087 resultVar
->a_name
= slang_atom_pool_atom(A
->atoms
, "__resultTmp");
1088 resultVar
->type
= fun
->header
.type
; /* XXX copy? */
1089 resultVar
->isTemp
= GL_TRUE
;
1091 /* child[0] = __resultTmp declaration */
1092 declOper
= &commaSeq
->children
[0];
1093 declOper
->type
= SLANG_OPER_VARIABLE_DECL
;
1094 declOper
->a_id
= resultVar
->a_name
;
1095 declOper
->locals
->outer_scope
= commaSeq
->locals
;
1097 /* child[1] = function body */
1098 inlined
= &commaSeq
->children
[1];
1099 inlined
->locals
->outer_scope
= commaSeq
->locals
;
1101 /* child[2] = __resultTmp reference */
1102 returnOper
= &commaSeq
->children
[2];
1103 returnOper
->type
= SLANG_OPER_IDENTIFIER
;
1104 returnOper
->a_id
= resultVar
->a_name
;
1105 returnOper
->locals
->outer_scope
= commaSeq
->locals
;
1110 top
= inlined
= slang_operation_new(1);
1111 /* XXXX this may be inappropriate!!!! */
1112 inlined
->locals
->outer_scope
= oper
->locals
->outer_scope
;
1116 assert(inlined
->locals
);
1118 /* Examine the parameters, look for inout/out params, look for possible
1119 * substitutions, etc:
1120 * param type behaviour
1121 * in copy actual to local
1122 * const in substitute param with actual
1126 for (i
= 0; i
< totalArgs
; i
++) {
1127 slang_variable
*p
= fun
->parameters
->variables
[i
];
1129 printf("Param %d: %s %s \n", i,
1130 slang_type_qual_string(p->type.qualifier),
1131 (char *) p->a_name);
1133 if (p
->type
.qualifier
== SLANG_QUAL_INOUT
||
1134 p
->type
.qualifier
== SLANG_QUAL_OUT
) {
1135 /* an output param */
1136 slang_operation
*arg
;
1141 paramMode
[i
] = SUBST
;
1143 if (arg
->type
== SLANG_OPER_IDENTIFIER
)
1144 slang_resolve_variable(arg
);
1146 /* replace parameter 'p' with argument 'arg' */
1147 substOld
[substCount
] = p
;
1148 substNew
[substCount
] = arg
; /* will get copied */
1151 else if (p
->type
.qualifier
== SLANG_QUAL_CONST
) {
1152 /* a constant input param */
1153 if (args
[i
].type
== SLANG_OPER_IDENTIFIER
||
1154 args
[i
].type
== SLANG_OPER_LITERAL_FLOAT
) {
1155 /* replace all occurances of this parameter variable with the
1156 * actual argument variable or a literal.
1158 paramMode
[i
] = SUBST
;
1159 slang_resolve_variable(&args
[i
]);
1160 substOld
[substCount
] = p
;
1161 substNew
[substCount
] = &args
[i
]; /* will get copied */
1165 paramMode
[i
] = COPY_IN
;
1169 paramMode
[i
] = COPY_IN
;
1171 assert(paramMode
[i
]);
1174 /* actual code inlining: */
1175 slang_operation_copy(inlined
, fun
->body
);
1177 /*** XXX review this */
1178 assert(inlined
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
||
1179 inlined
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
);
1180 inlined
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
;
1183 printf("======================= orig body code ======================\n");
1184 printf("=== params scope = %p\n", (void*) fun
->parameters
);
1185 slang_print_tree(fun
->body
, 8);
1186 printf("======================= copied code =========================\n");
1187 slang_print_tree(inlined
, 8);
1190 /* do parameter substitution in inlined code: */
1191 slang_substitute(A
, inlined
, substCount
, substOld
, substNew
, GL_FALSE
);
1194 printf("======================= subst code ==========================\n");
1195 slang_print_tree(inlined
, 8);
1196 printf("=============================================================\n");
1199 /* New prolog statements: (inserted before the inlined code)
1200 * Copy the 'in' arguments.
1203 for (i
= 0; i
< numArgs
; i
++) {
1204 if (paramMode
[i
] == COPY_IN
) {
1205 slang_variable
*p
= fun
->parameters
->variables
[i
];
1206 /* declare parameter 'p' */
1207 slang_operation
*decl
= slang_operation_insert(&inlined
->num_children
,
1211 decl
->type
= SLANG_OPER_VARIABLE_DECL
;
1212 assert(decl
->locals
);
1213 decl
->locals
->outer_scope
= inlined
->locals
;
1214 decl
->a_id
= p
->a_name
;
1215 decl
->num_children
= 1;
1216 decl
->children
= slang_operation_new(1);
1218 /* child[0] is the var's initializer */
1219 slang_operation_copy(&decl
->children
[0], args
+ i
);
1221 /* add parameter 'p' to the local variable scope here */
1223 slang_variable
*pCopy
= slang_variable_scope_grow(inlined
->locals
);
1224 pCopy
->type
= p
->type
;
1225 pCopy
->a_name
= p
->a_name
;
1226 pCopy
->array_len
= p
->array_len
;
1229 newScope
= inlined
->locals
;
1234 /* Now add copies of the function's local vars to the new variable scope */
1235 for (i
= totalArgs
; i
< fun
->parameters
->num_variables
; i
++) {
1236 slang_variable
*p
= fun
->parameters
->variables
[i
];
1237 slang_variable
*pCopy
= slang_variable_scope_grow(inlined
->locals
);
1238 pCopy
->type
= p
->type
;
1239 pCopy
->a_name
= p
->a_name
;
1240 pCopy
->array_len
= p
->array_len
;
1244 /* New epilog statements:
1245 * 1. Create end of function label to jump to from return statements.
1246 * 2. Copy the 'out' parameter vars
1249 slang_operation
*lab
= slang_operation_insert(&inlined
->num_children
,
1251 inlined
->num_children
);
1252 lab
->type
= SLANG_OPER_LABEL
;
1253 lab
->label
= A
->curFuncEndLabel
;
1256 for (i
= 0; i
< totalArgs
; i
++) {
1257 if (paramMode
[i
] == COPY_OUT
) {
1258 const slang_variable
*p
= fun
->parameters
->variables
[i
];
1259 /* actualCallVar = outParam */
1260 /*if (i > 0 || !haveRetValue)*/
1261 slang_operation
*ass
= slang_operation_insert(&inlined
->num_children
,
1263 inlined
->num_children
);
1264 ass
->type
= SLANG_OPER_ASSIGN
;
1265 ass
->num_children
= 2;
1266 ass
->locals
->outer_scope
= inlined
->locals
;
1267 ass
->children
= slang_operation_new(2);
1268 ass
->children
[0] = args
[i
]; /*XXX copy */
1269 ass
->children
[1].type
= SLANG_OPER_IDENTIFIER
;
1270 ass
->children
[1].a_id
= p
->a_name
;
1271 ass
->children
[1].locals
->outer_scope
= ass
->locals
;
1275 _slang_free(paramMode
);
1276 _slang_free(substOld
);
1277 _slang_free(substNew
);
1279 /* Update scoping to use the new local vars instead of the
1280 * original function's vars. This is especially important
1281 * for nested inlining.
1284 slang_replace_scope(inlined
, fun
->parameters
, newScope
);
1287 printf("Done Inline call to %s (total vars=%d nparams=%d)\n\n",
1288 (char *) fun
->header
.a_name
,
1289 fun
->parameters
->num_variables
, numArgs
);
1290 slang_print_tree(top
, 0);
1294 A
->CurFunction
= prevFunction
;
1300 static slang_ir_node
*
1301 _slang_gen_function_call(slang_assemble_ctx
*A
, slang_function
*fun
,
1302 slang_operation
*oper
, slang_operation
*dest
)
1305 slang_operation
*inlined
;
1306 slang_label
*prevFuncEndLabel
;
1309 prevFuncEndLabel
= A
->curFuncEndLabel
;
1310 sprintf(name
, "__endOfFunc_%s_", (char *) fun
->header
.a_name
);
1311 A
->curFuncEndLabel
= _slang_label_new(name
);
1312 assert(A
->curFuncEndLabel
);
1314 if (slang_is_asm_function(fun
) && !dest
) {
1315 /* assemble assembly function - tree style */
1316 inlined
= slang_inline_asm_function(A
, fun
, oper
);
1319 /* non-assembly function */
1320 /* We always generate an "inline-able" block of code here.
1322 * 1. insert the inline code
1323 * 2. Generate a call to the "inline" code as a subroutine
1327 slang_operation
*ret
= NULL
;
1329 inlined
= slang_inline_function_call(A
, fun
, oper
, dest
);
1333 ret
= _slang_find_node_type(inlined
, SLANG_OPER_RETURN
);
1335 /* check if this is a "tail" return */
1336 if (_slang_count_node_type(inlined
, SLANG_OPER_RETURN
) == 1 &&
1337 _slang_is_tail_return(inlined
)) {
1338 /* The only RETURN is the last stmt in the function, no-op it
1339 * and inline the function body.
1341 ret
->type
= SLANG_OPER_NONE
;
1344 slang_operation
*callOper
;
1345 /* The function we're calling has one or more 'return' statements.
1346 * So, we can't truly inline this function because we need to
1347 * implement 'return' with RET (and CAL).
1348 * Nevertheless, we performed "inlining" to make a new instance
1349 * of the function body to deal with static register allocation.
1351 * XXX check if there's one 'return' and if it's the very last
1352 * statement in the function - we can optimize that case.
1354 assert(inlined
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
||
1355 inlined
->type
== SLANG_OPER_SEQUENCE
);
1357 if (_slang_function_has_return_value(fun
) && !dest
) {
1358 assert(inlined
->children
[0].type
== SLANG_OPER_VARIABLE_DECL
);
1359 assert(inlined
->children
[2].type
== SLANG_OPER_IDENTIFIER
);
1360 callOper
= &inlined
->children
[1];
1365 callOper
->type
= SLANG_OPER_NON_INLINED_CALL
;
1366 callOper
->fun
= fun
;
1367 callOper
->label
= _slang_label_new_unique((char*) fun
->header
.a_name
);
1375 /* Replace the function call with the inlined block (or new CALL stmt) */
1376 slang_operation_destruct(oper
);
1378 _slang_free(inlined
);
1381 assert(inlined
->locals
);
1382 printf("*** Inlined code for call to %s:\n",
1383 (char*) fun
->header
.a_name
);
1384 slang_print_tree(oper
, 10);
1388 n
= _slang_gen_operation(A
, oper
);
1390 /*_slang_label_delete(A->curFuncEndLabel);*/
1391 A
->curFuncEndLabel
= prevFuncEndLabel
;
1397 static slang_asm_info
*
1398 slang_find_asm_info(const char *name
)
1401 for (i
= 0; AsmInfo
[i
].Name
; i
++) {
1402 if (_mesa_strcmp(AsmInfo
[i
].Name
, name
) == 0) {
1411 * Return the default swizzle mask for accessing a variable of the
1412 * given size (in floats). If size = 1, comp is used to identify
1413 * which component [0..3] of the register holds the variable.
1416 _slang_var_swizzle(GLint size
, GLint comp
)
1420 return MAKE_SWIZZLE4(comp
, comp
, comp
, comp
);
1422 return MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
, SWIZZLE_NIL
, SWIZZLE_NIL
);
1424 return MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
, SWIZZLE_Z
, SWIZZLE_NIL
);
1426 return SWIZZLE_XYZW
;
1432 * Some write-masked assignments are simple, but others are hard.
1435 * v.xy = vec2(a, b);
1438 * v.zy = vec2(a, b);
1439 * this gets transformed/swizzled into:
1440 * v.zy = vec2(a, b).*yx* (* = don't care)
1441 * This function helps to determine simple vs. non-simple.
1444 _slang_simple_writemask(GLuint writemask
, GLuint swizzle
)
1446 switch (writemask
) {
1448 return GET_SWZ(swizzle
, 0) == SWIZZLE_X
;
1450 return GET_SWZ(swizzle
, 1) == SWIZZLE_Y
;
1452 return GET_SWZ(swizzle
, 2) == SWIZZLE_Z
;
1454 return GET_SWZ(swizzle
, 3) == SWIZZLE_W
;
1456 return (GET_SWZ(swizzle
, 0) == SWIZZLE_X
)
1457 && (GET_SWZ(swizzle
, 1) == SWIZZLE_Y
);
1459 return (GET_SWZ(swizzle
, 0) == SWIZZLE_X
)
1460 && (GET_SWZ(swizzle
, 1) == SWIZZLE_Y
)
1461 && (GET_SWZ(swizzle
, 2) == SWIZZLE_Z
);
1462 case WRITEMASK_XYZW
:
1463 return swizzle
== SWIZZLE_NOOP
;
1471 * Convert the given swizzle into a writemask. In some cases this
1472 * is trivial, in other cases, we'll need to also swizzle the right
1473 * hand side to put components in the right places.
1474 * See comment above for more info.
1475 * XXX this function could be simplified and should probably be renamed.
1476 * \param swizzle the incoming swizzle
1477 * \param writemaskOut returns the writemask
1478 * \param swizzleOut swizzle to apply to the right-hand-side
1479 * \return GL_FALSE for simple writemasks, GL_TRUE for non-simple
1482 swizzle_to_writemask(slang_assemble_ctx
*A
, GLuint swizzle
,
1483 GLuint
*writemaskOut
, GLuint
*swizzleOut
)
1485 GLuint mask
= 0x0, newSwizzle
[4];
1488 /* make new dst writemask, compute size */
1489 for (i
= 0; i
< 4; i
++) {
1490 const GLuint swz
= GET_SWZ(swizzle
, i
);
1491 if (swz
== SWIZZLE_NIL
) {
1495 assert(swz
>= 0 && swz
<= 3);
1497 if (swizzle
!= SWIZZLE_XXXX
&&
1498 swizzle
!= SWIZZLE_YYYY
&&
1499 swizzle
!= SWIZZLE_ZZZZ
&&
1500 swizzle
!= SWIZZLE_WWWW
&&
1501 (mask
& (1 << swz
))) {
1502 /* a channel can't be specified twice (ex: ".xyyz") */
1503 slang_info_log_error(A
->log
, "Invalid writemask '%s'",
1504 _mesa_swizzle_string(swizzle
, 0, 0));
1510 assert(mask
<= 0xf);
1511 size
= i
; /* number of components in mask/swizzle */
1513 *writemaskOut
= mask
;
1515 /* make new src swizzle, by inversion */
1516 for (i
= 0; i
< 4; i
++) {
1517 newSwizzle
[i
] = i
; /*identity*/
1519 for (i
= 0; i
< size
; i
++) {
1520 const GLuint swz
= GET_SWZ(swizzle
, i
);
1521 newSwizzle
[swz
] = i
;
1523 *swizzleOut
= MAKE_SWIZZLE4(newSwizzle
[0],
1528 if (_slang_simple_writemask(mask
, *swizzleOut
)) {
1530 assert(GET_SWZ(*swizzleOut
, 0) == SWIZZLE_X
);
1532 assert(GET_SWZ(*swizzleOut
, 1) == SWIZZLE_Y
);
1534 assert(GET_SWZ(*swizzleOut
, 2) == SWIZZLE_Z
);
1536 assert(GET_SWZ(*swizzleOut
, 3) == SWIZZLE_W
);
1545 * Recursively traverse 'oper' to produce a swizzle mask in the event
1546 * of any vector subscripts and swizzle suffixes.
1547 * Ex: for "vec4 v", "v[2].x" resolves to v.z
1550 resolve_swizzle(const slang_operation
*oper
)
1552 if (oper
->type
== SLANG_OPER_FIELD
) {
1553 /* writemask from .xyzw suffix */
1555 if (_slang_is_swizzle((char*) oper
->a_id
, 4, &swz
)) {
1556 GLuint swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
1560 GLuint child_swizzle
= resolve_swizzle(&oper
->children
[0]);
1561 GLuint s
= _slang_swizzle_swizzle(child_swizzle
, swizzle
);
1565 return SWIZZLE_XYZW
;
1567 else if (oper
->type
== SLANG_OPER_SUBSCRIPT
&&
1568 oper
->children
[1].type
== SLANG_OPER_LITERAL_INT
) {
1569 /* writemask from [index] */
1570 GLuint child_swizzle
= resolve_swizzle(&oper
->children
[0]);
1571 GLuint i
= (GLuint
) oper
->children
[1].literal
[0];
1576 swizzle
= SWIZZLE_XXXX
;
1579 swizzle
= SWIZZLE_YYYY
;
1582 swizzle
= SWIZZLE_ZZZZ
;
1585 swizzle
= SWIZZLE_WWWW
;
1588 swizzle
= SWIZZLE_XYZW
;
1590 s
= _slang_swizzle_swizzle(child_swizzle
, swizzle
);
1594 return SWIZZLE_XYZW
;
1600 * Recursively descend through swizzle nodes to find the node's storage info.
1602 static slang_ir_storage
*
1603 get_store(const slang_ir_node
*n
)
1605 if (n
->Opcode
== IR_SWIZZLE
) {
1606 return get_store(n
->Children
[0]);
1614 * Generate IR tree for an asm instruction/operation such as:
1615 * __asm vec4_dot __retVal.x, v1, v2;
1617 static slang_ir_node
*
1618 _slang_gen_asm(slang_assemble_ctx
*A
, slang_operation
*oper
,
1619 slang_operation
*dest
)
1621 const slang_asm_info
*info
;
1622 slang_ir_node
*kids
[3], *n
;
1623 GLuint j
, firstOperand
;
1625 assert(oper
->type
== SLANG_OPER_ASM
);
1627 info
= slang_find_asm_info((char *) oper
->a_id
);
1629 _mesa_problem(NULL
, "undefined __asm function %s\n",
1630 (char *) oper
->a_id
);
1633 assert(info
->NumParams
<= 3);
1635 if (info
->NumParams
== oper
->num_children
) {
1636 /* Storage for result is not specified.
1637 * Children[0], [1], [2] are the operands.
1642 /* Storage for result (child[0]) is specified.
1643 * Children[1], [2], [3] are the operands.
1648 /* assemble child(ren) */
1649 kids
[0] = kids
[1] = kids
[2] = NULL
;
1650 for (j
= 0; j
< info
->NumParams
; j
++) {
1651 kids
[j
] = _slang_gen_operation(A
, &oper
->children
[firstOperand
+ j
]);
1656 n
= new_node3(info
->Opcode
, kids
[0], kids
[1], kids
[2]);
1659 /* Setup n->Store to be a particular location. Otherwise, storage
1660 * for the result (a temporary) will be allocated later.
1662 slang_operation
*dest_oper
;
1665 dest_oper
= &oper
->children
[0];
1667 n0
= _slang_gen_operation(A
, dest_oper
);
1672 n
->Store
= n0
->Store
;
1674 assert(n
->Store
->File
!= PROGRAM_UNDEFINED
|| n
->Store
->Parent
);
1684 print_funcs(struct slang_function_scope_
*scope
, const char *name
)
1687 for (i
= 0; i
< scope
->num_functions
; i
++) {
1688 slang_function
*f
= &scope
->functions
[i
];
1689 if (!name
|| strcmp(name
, (char*) f
->header
.a_name
) == 0)
1690 printf(" %s (%d args)\n", name
, f
->param_count
);
1693 if (scope
->outer_scope
)
1694 print_funcs(scope
->outer_scope
, name
);
1699 * Find a function of the given name, taking 'numArgs' arguments.
1700 * This is the function we'll try to call when there is no exact match
1701 * between function parameters and call arguments.
1703 * XXX we should really create a list of candidate functions and try
1706 static slang_function
*
1707 _slang_find_function_by_argc(slang_function_scope
*scope
,
1708 const char *name
, int numArgs
)
1712 for (i
= 0; i
< scope
->num_functions
; i
++) {
1713 slang_function
*f
= &scope
->functions
[i
];
1714 if (strcmp(name
, (char*) f
->header
.a_name
) == 0) {
1715 int haveRetValue
= _slang_function_has_return_value(f
);
1716 if (numArgs
== f
->param_count
- haveRetValue
)
1720 scope
= scope
->outer_scope
;
1727 static slang_function
*
1728 _slang_find_function_by_max_argc(slang_function_scope
*scope
,
1731 slang_function
*maxFunc
= NULL
;
1736 for (i
= 0; i
< scope
->num_functions
; i
++) {
1737 slang_function
*f
= &scope
->functions
[i
];
1738 if (strcmp(name
, (char*) f
->header
.a_name
) == 0) {
1739 if (f
->param_count
> maxArgs
) {
1740 maxArgs
= f
->param_count
;
1745 scope
= scope
->outer_scope
;
1753 * Generate a new slang_function which is a constructor for a user-defined
1756 static slang_function
*
1757 _slang_make_constructor(slang_assemble_ctx
*A
, slang_struct
*str
)
1759 const GLint numFields
= str
->fields
->num_variables
;
1761 slang_function
*fun
= (slang_function
*) _mesa_malloc(sizeof(slang_function
));
1765 slang_function_construct(fun
);
1767 /* function header (name, return type) */
1768 fun
->kind
= SLANG_FUNC_CONSTRUCTOR
;
1769 fun
->header
.a_name
= str
->a_name
;
1770 fun
->header
.type
.qualifier
= SLANG_QUAL_NONE
;
1771 fun
->header
.type
.specifier
.type
= SLANG_SPEC_STRUCT
;
1772 fun
->header
.type
.specifier
._struct
= str
;
1774 /* function parameters (= struct's fields) */
1777 for (i
= 0; i
< numFields
; i
++) {
1779 printf("Field %d: %s\n", i, (char*) str->fields->variables[i]->a_name);
1781 slang_variable
*p
= slang_variable_scope_grow(fun
->parameters
);
1782 *p
= *str
->fields
->variables
[i
]; /* copy the type */
1783 p
->type
.qualifier
= SLANG_QUAL_CONST
;
1785 fun
->param_count
= fun
->parameters
->num_variables
;
1788 /* Add __retVal to params */
1790 slang_variable
*p
= slang_variable_scope_grow(fun
->parameters
);
1791 slang_atom a_retVal
= slang_atom_pool_atom(A
->atoms
, "__retVal");
1793 p
->a_name
= a_retVal
;
1794 p
->type
= fun
->header
.type
;
1795 p
->type
.qualifier
= SLANG_QUAL_OUT
;
1799 /* function body is:
1809 slang_variable_scope
*scope
;
1810 slang_variable
*var
;
1813 fun
->body
= slang_operation_new(1);
1814 fun
->body
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
;
1815 fun
->body
->num_children
= numFields
+ 2;
1816 fun
->body
->children
= slang_operation_new(numFields
+ 2);
1818 scope
= fun
->body
->locals
;
1819 scope
->outer_scope
= fun
->parameters
;
1821 /* create local var 't' */
1822 var
= slang_variable_scope_grow(scope
);
1823 var
->a_name
= slang_atom_pool_atom(A
->atoms
, "t");
1824 var
->type
= fun
->header
.type
;
1828 slang_operation
*decl
;
1830 decl
= &fun
->body
->children
[0];
1831 decl
->type
= SLANG_OPER_VARIABLE_DECL
;
1832 decl
->locals
= _slang_variable_scope_new(scope
);
1833 decl
->a_id
= var
->a_name
;
1836 /* assign params to fields of t */
1837 for (i
= 0; i
< numFields
; i
++) {
1838 slang_operation
*assign
= &fun
->body
->children
[1 + i
];
1840 assign
->type
= SLANG_OPER_ASSIGN
;
1841 assign
->locals
= _slang_variable_scope_new(scope
);
1842 assign
->num_children
= 2;
1843 assign
->children
= slang_operation_new(2);
1846 slang_operation
*lhs
= &assign
->children
[0];
1848 lhs
->type
= SLANG_OPER_FIELD
;
1849 lhs
->locals
= _slang_variable_scope_new(scope
);
1850 lhs
->num_children
= 1;
1851 lhs
->children
= slang_operation_new(1);
1852 lhs
->a_id
= str
->fields
->variables
[i
]->a_name
;
1854 lhs
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
1855 lhs
->children
[0].a_id
= var
->a_name
;
1856 lhs
->children
[0].locals
= _slang_variable_scope_new(scope
);
1859 lhs
->children
[1].num_children
= 1;
1860 lhs
->children
[1].children
= slang_operation_new(1);
1861 lhs
->children
[1].children
[0].type
= SLANG_OPER_IDENTIFIER
;
1862 lhs
->children
[1].children
[0].a_id
= str
->fields
->variables
[i
]->a_name
;
1863 lhs
->children
[1].children
->locals
= _slang_variable_scope_new(scope
);
1868 slang_operation
*rhs
= &assign
->children
[1];
1870 rhs
->type
= SLANG_OPER_IDENTIFIER
;
1871 rhs
->locals
= _slang_variable_scope_new(scope
);
1872 rhs
->a_id
= str
->fields
->variables
[i
]->a_name
;
1878 slang_operation
*ret
= &fun
->body
->children
[numFields
+ 1];
1880 ret
->type
= SLANG_OPER_RETURN
;
1881 ret
->locals
= _slang_variable_scope_new(scope
);
1882 ret
->num_children
= 1;
1883 ret
->children
= slang_operation_new(1);
1884 ret
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
1885 ret
->children
[0].a_id
= var
->a_name
;
1886 ret
->children
[0].locals
= _slang_variable_scope_new(scope
);
1891 slang_print_function(fun, 1);
1898 * Find/create a function (constructor) for the given structure name.
1900 static slang_function
*
1901 _slang_locate_struct_constructor(slang_assemble_ctx
*A
, const char *name
)
1904 for (i
= 0; i
< A
->space
.structs
->num_structs
; i
++) {
1905 slang_struct
*str
= &A
->space
.structs
->structs
[i
];
1906 if (strcmp(name
, (const char *) str
->a_name
) == 0) {
1907 /* found a structure type that matches the function name */
1908 if (!str
->constructor
) {
1909 /* create the constructor function now */
1910 str
->constructor
= _slang_make_constructor(A
, str
);
1912 return str
->constructor
;
1921 _slang_is_vec_mat_type(const char *name
)
1923 static const char *vecmat_types
[] = {
1924 "float", "int", "bool",
1925 "vec2", "vec3", "vec4",
1926 "ivec2", "ivec3", "ivec4",
1927 "bvec2", "bvec3", "bvec4",
1928 "mat2", "mat3", "mat4",
1929 "mat2x3", "mat2x4", "mat3x2", "mat3x4", "mat4x2", "mat4x3",
1933 for (i
= 0; vecmat_types
[i
]; i
++)
1934 if (_mesa_strcmp(name
, vecmat_types
[i
]) == 0)
1941 * Assemble a function call, given a particular function name.
1942 * \param name the function's name (operators like '*' are possible).
1944 static slang_ir_node
*
1945 _slang_gen_function_call_name(slang_assemble_ctx
*A
, const char *name
,
1946 slang_operation
*oper
, slang_operation
*dest
)
1948 slang_operation
*params
= oper
->children
;
1949 const GLuint param_count
= oper
->num_children
;
1951 slang_function
*fun
;
1955 atom
= slang_atom_pool_atom(A
->atoms
, name
);
1956 if (atom
== SLANG_ATOM_NULL
)
1960 * First, try to find function by name and exact argument type matching.
1962 fun
= _slang_locate_function(A
->space
.funcs
, atom
, params
, param_count
,
1963 &A
->space
, A
->atoms
, A
->log
, &error
);
1966 slang_info_log_error(A
->log
,
1967 "Function '%s' not found (check argument types)",
1973 /* Next, try locating a constructor function for a user-defined type */
1974 fun
= _slang_locate_struct_constructor(A
, name
);
1978 * At this point, some heuristics are used to try to find a function
1979 * that matches the calling signature by means of casting or "unrolling"
1983 if (!fun
&& _slang_is_vec_mat_type(name
)) {
1984 /* Next, if this call looks like a vec() or mat() constructor call,
1985 * try "unwinding" the args to satisfy a constructor.
1987 fun
= _slang_find_function_by_max_argc(A
->space
.funcs
, name
);
1989 if (!_slang_adapt_call(oper
, fun
, &A
->space
, A
->atoms
, A
->log
)) {
1990 slang_info_log_error(A
->log
,
1991 "Function '%s' not found (check argument types)",
1998 if (!fun
&& _slang_is_vec_mat_type(name
)) {
1999 /* Next, try casting args to the types of the formal parameters */
2000 int numArgs
= oper
->num_children
;
2001 fun
= _slang_find_function_by_argc(A
->space
.funcs
, name
, numArgs
);
2002 if (!fun
|| !_slang_cast_func_params(oper
, fun
, &A
->space
, A
->atoms
, A
->log
)) {
2003 slang_info_log_error(A
->log
,
2004 "Function '%s' not found (check argument types)",
2012 slang_info_log_error(A
->log
,
2013 "Function '%s' not found (check argument types)",
2018 slang_info_log_error(A
->log
,
2019 "Function '%s' prototyped but not defined. "
2020 "Separate compilation units not supported.",
2025 /* type checking to be sure function's return type matches 'dest' type */
2029 slang_typeinfo_construct(&t0
);
2030 _slang_typeof_operation(A
, dest
, &t0
);
2032 if (!slang_type_specifier_equal(&t0
.spec
, &fun
->header
.type
.specifier
)) {
2033 slang_info_log_error(A
->log
,
2034 "Incompatible type returned by call to '%s'",
2040 n
= _slang_gen_function_call(A
, fun
, oper
, dest
);
2042 if (n
&& !n
->Store
&& !dest
2043 && fun
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
2044 /* setup n->Store for the result of the function call */
2045 GLint size
= _slang_sizeof_type_specifier(&fun
->header
.type
.specifier
);
2046 n
->Store
= _slang_new_ir_storage(PROGRAM_TEMPORARY
, -1, size
);
2047 /*printf("Alloc storage for function result, size %d \n", size);*/
2054 static slang_ir_node
*
2055 _slang_gen_method_call(slang_assemble_ctx
*A
, slang_operation
*oper
)
2057 slang_atom
*a_length
= slang_atom_pool_atom(A
->atoms
, "length");
2059 slang_variable
*var
;
2061 /* NOTE: In GLSL 1.20, there's only one kind of method
2062 * call: array.length(). Anything else is an error.
2064 if (oper
->a_id
!= a_length
) {
2065 slang_info_log_error(A
->log
,
2066 "Undefined method call '%s'", (char *) oper
->a_id
);
2070 /* length() takes no arguments */
2071 if (oper
->num_children
> 0) {
2072 slang_info_log_error(A
->log
, "Invalid arguments to length() method");
2076 /* lookup the object/variable */
2077 var
= _slang_locate_variable(oper
->locals
, oper
->a_obj
, GL_TRUE
);
2078 if (!var
|| var
->type
.specifier
.type
!= SLANG_SPEC_ARRAY
) {
2079 slang_info_log_error(A
->log
,
2080 "Undefined object '%s'", (char *) oper
->a_obj
);
2084 /* Create a float/literal IR node encoding the array length */
2085 n
= new_node0(IR_FLOAT
);
2087 n
->Value
[0] = (float) var
->array_len
;
2088 n
->Store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, 1);
2095 _slang_is_constant_cond(const slang_operation
*oper
, GLboolean
*value
)
2097 if (oper
->type
== SLANG_OPER_LITERAL_FLOAT
||
2098 oper
->type
== SLANG_OPER_LITERAL_INT
||
2099 oper
->type
== SLANG_OPER_LITERAL_BOOL
) {
2100 if (oper
->literal
[0])
2106 else if (oper
->type
== SLANG_OPER_EXPRESSION
&&
2107 oper
->num_children
== 1) {
2108 return _slang_is_constant_cond(&oper
->children
[0], value
);
2115 * Test if an operation is a scalar or boolean.
2118 _slang_is_scalar_or_boolean(slang_assemble_ctx
*A
, slang_operation
*oper
)
2120 slang_typeinfo type
;
2123 slang_typeinfo_construct(&type
);
2124 _slang_typeof_operation(A
, oper
, &type
);
2125 size
= _slang_sizeof_type_specifier(&type
.spec
);
2126 slang_typeinfo_destruct(&type
);
2132 * Test if an operation is boolean.
2135 _slang_is_boolean(slang_assemble_ctx
*A
, slang_operation
*oper
)
2137 slang_typeinfo type
;
2140 slang_typeinfo_construct(&type
);
2141 _slang_typeof_operation(A
, oper
, &type
);
2142 isBool
= (type
.spec
.type
== SLANG_SPEC_BOOL
);
2143 slang_typeinfo_destruct(&type
);
2149 * Generate loop code using high-level IR_LOOP instruction
2151 static slang_ir_node
*
2152 _slang_gen_while(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2156 * BREAK if !expr (child[0])
2157 * body code (child[1])
2159 slang_ir_node
*prevLoop
, *loop
, *breakIf
, *body
;
2160 GLboolean isConst
, constTrue
;
2162 /* type-check expression */
2163 if (!_slang_is_boolean(A
, &oper
->children
[0])) {
2164 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'while'");
2168 /* Check if loop condition is a constant */
2169 isConst
= _slang_is_constant_cond(&oper
->children
[0], &constTrue
);
2171 if (isConst
&& !constTrue
) {
2172 /* loop is never executed! */
2173 return new_node0(IR_NOP
);
2176 loop
= new_loop(NULL
);
2178 /* save old, push new loop */
2179 prevLoop
= A
->CurLoop
;
2182 if (isConst
&& constTrue
) {
2183 /* while(nonzero constant), no conditional break */
2188 = new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[0])));
2189 breakIf
= new_break_if_true(A
->CurLoop
, cond
);
2191 body
= _slang_gen_operation(A
, &oper
->children
[1]);
2192 loop
->Children
[0] = new_seq(breakIf
, body
);
2194 /* Do infinite loop detection */
2195 /* loop->List is head of linked list of break/continue nodes */
2196 if (!loop
->List
&& isConst
&& constTrue
) {
2197 /* infinite loop detected */
2198 A
->CurLoop
= prevLoop
; /* clean-up */
2199 slang_info_log_error(A
->log
, "Infinite loop detected!");
2203 /* pop loop, restore prev */
2204 A
->CurLoop
= prevLoop
;
2211 * Generate IR tree for a do-while loop using high-level LOOP, IF instructions.
2213 static slang_ir_node
*
2214 _slang_gen_do(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2218 * body code (child[0])
2220 * BREAK if !expr (child[1])
2222 slang_ir_node
*prevLoop
, *loop
;
2223 GLboolean isConst
, constTrue
;
2225 /* type-check expression */
2226 if (!_slang_is_boolean(A
, &oper
->children
[1])) {
2227 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'do/while'");
2231 loop
= new_loop(NULL
);
2233 /* save old, push new loop */
2234 prevLoop
= A
->CurLoop
;
2238 loop
->Children
[0] = _slang_gen_operation(A
, &oper
->children
[0]);
2240 /* Check if loop condition is a constant */
2241 isConst
= _slang_is_constant_cond(&oper
->children
[1], &constTrue
);
2242 if (isConst
&& constTrue
) {
2243 /* do { } while(1) ==> no conditional break */
2244 loop
->Children
[1] = NULL
; /* no tail code */
2248 = new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[1])));
2249 loop
->Children
[1] = new_break_if_true(A
->CurLoop
, cond
);
2252 /* XXX we should do infinite loop detection, as above */
2254 /* pop loop, restore prev */
2255 A
->CurLoop
= prevLoop
;
2262 * Generate for-loop using high-level IR_LOOP instruction.
2264 static slang_ir_node
*
2265 _slang_gen_for(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2268 * init code (child[0])
2270 * BREAK if !expr (child[1])
2271 * body code (child[3])
2273 * incr code (child[2]) // XXX continue here
2275 slang_ir_node
*prevLoop
, *loop
, *cond
, *breakIf
, *body
, *init
, *incr
;
2277 init
= _slang_gen_operation(A
, &oper
->children
[0]);
2278 loop
= new_loop(NULL
);
2280 /* save old, push new loop */
2281 prevLoop
= A
->CurLoop
;
2284 cond
= new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[1])));
2285 breakIf
= new_break_if_true(A
->CurLoop
, cond
);
2286 body
= _slang_gen_operation(A
, &oper
->children
[3]);
2287 incr
= _slang_gen_operation(A
, &oper
->children
[2]);
2289 loop
->Children
[0] = new_seq(breakIf
, body
);
2290 loop
->Children
[1] = incr
; /* tail code */
2292 /* pop loop, restore prev */
2293 A
->CurLoop
= prevLoop
;
2295 return new_seq(init
, loop
);
2299 static slang_ir_node
*
2300 _slang_gen_continue(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2302 slang_ir_node
*n
, *loopNode
;
2303 assert(oper
->type
== SLANG_OPER_CONTINUE
);
2304 loopNode
= A
->CurLoop
;
2306 assert(loopNode
->Opcode
== IR_LOOP
);
2307 n
= new_node0(IR_CONT
);
2309 n
->Parent
= loopNode
;
2310 /* insert this node at head of linked list */
2311 n
->List
= loopNode
->List
;
2319 * Determine if the given operation is of a specific type.
2322 is_operation_type(const slang_operation
*oper
, slang_operation_type type
)
2324 if (oper
->type
== type
)
2326 else if ((oper
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
||
2327 oper
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
) &&
2328 oper
->num_children
== 1)
2329 return is_operation_type(&oper
->children
[0], type
);
2336 * Generate IR tree for an if/then/else conditional using high-level
2337 * IR_IF instruction.
2339 static slang_ir_node
*
2340 _slang_gen_if(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2343 * eval expr (child[0])
2350 const GLboolean haveElseClause
= !_slang_is_noop(&oper
->children
[2]);
2351 slang_ir_node
*ifNode
, *cond
, *ifBody
, *elseBody
;
2352 GLboolean isConst
, constTrue
;
2354 /* type-check expression */
2355 if (!_slang_is_boolean(A
, &oper
->children
[0])) {
2356 slang_info_log_error(A
->log
, "boolean expression expected for 'if'");
2360 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
2361 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'if'");
2365 isConst
= _slang_is_constant_cond(&oper
->children
[0], &constTrue
);
2369 return _slang_gen_operation(A
, &oper
->children
[1]);
2372 /* if (false) ... */
2373 return _slang_gen_operation(A
, &oper
->children
[2]);
2377 cond
= _slang_gen_operation(A
, &oper
->children
[0]);
2378 cond
= new_cond(cond
);
2380 if (is_operation_type(&oper
->children
[1], SLANG_OPER_BREAK
)
2381 && !haveElseClause
) {
2382 /* Special case: generate a conditional break */
2383 ifBody
= new_break_if_true(A
->CurLoop
, cond
);
2386 else if (is_operation_type(&oper
->children
[1], SLANG_OPER_CONTINUE
)
2387 && !haveElseClause
) {
2388 /* Special case: generate a conditional break */
2389 ifBody
= new_cont_if_true(A
->CurLoop
, cond
);
2394 ifBody
= _slang_gen_operation(A
, &oper
->children
[1]);
2396 elseBody
= _slang_gen_operation(A
, &oper
->children
[2]);
2399 ifNode
= new_if(cond
, ifBody
, elseBody
);
2406 static slang_ir_node
*
2407 _slang_gen_not(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2411 assert(oper
->type
== SLANG_OPER_NOT
);
2413 /* type-check expression */
2414 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
2415 slang_info_log_error(A
->log
,
2416 "scalar/boolean expression expected for '!'");
2420 n
= _slang_gen_operation(A
, &oper
->children
[0]);
2428 static slang_ir_node
*
2429 _slang_gen_xor(slang_assemble_ctx
* A
, const slang_operation
*oper
)
2431 slang_ir_node
*n1
, *n2
;
2433 assert(oper
->type
== SLANG_OPER_LOGICALXOR
);
2435 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0]) ||
2436 !_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
2437 slang_info_log_error(A
->log
,
2438 "scalar/boolean expressions expected for '^^'");
2442 n1
= _slang_gen_operation(A
, &oper
->children
[0]);
2445 n2
= _slang_gen_operation(A
, &oper
->children
[1]);
2448 return new_node2(IR_NOTEQUAL
, n1
, n2
);
2453 * Generate IR node for storage of a temporary of given size.
2455 static slang_ir_node
*
2456 _slang_gen_temporary(GLint size
)
2458 slang_ir_storage
*store
;
2459 slang_ir_node
*n
= NULL
;
2461 store
= _slang_new_ir_storage(PROGRAM_TEMPORARY
, -2, size
);
2463 n
= new_node0(IR_VAR_DECL
);
2476 * Generate IR node for allocating/declaring a variable.
2477 * \param initializer Optional initializer expression for the variable.
2479 static slang_ir_node
*
2480 _slang_gen_var_decl(slang_assemble_ctx
*A
, slang_variable
*var
,
2481 slang_operation
*initializer
)
2483 slang_ir_node
*varDecl
, *n
;
2484 slang_ir_storage
*store
;
2486 /*assert(!var->declared);*/
2487 var
->declared
= GL_TRUE
;
2489 varDecl
= new_node0(IR_VAR_DECL
);
2493 _slang_attach_storage(varDecl
, var
);
2495 assert(varDecl
->Store
== var
->store
);
2496 assert(varDecl
->Store
);
2497 assert(varDecl
->Store
->Index
< 0);
2500 assert(store
== varDecl
->Store
);
2502 /* determine GPU storage file */
2503 /* XXX if the variable is const, use PROGRAM_CONSTANT */
2504 if (is_sampler_type(&var
->type
)) {
2505 store
->File
= PROGRAM_SAMPLER
;
2508 store
->File
= PROGRAM_TEMPORARY
;
2511 store
->Size
= _slang_sizeof_type_specifier(&varDecl
->Var
->type
.specifier
);
2513 if (store
->Size
<= 0) {
2514 slang_info_log_error(A
->log
, "invalid declaration for '%s'",
2515 (char*) var
->a_name
);
2520 printf("%s var %p %s store=%p index=%d size=%d\n",
2521 __FUNCTION__
, (void *) var
, (char *) var
->a_name
,
2522 (void *) store
, store
->Index
, store
->Size
);
2525 if (var
->array_len
> 0) {
2526 /* this is an array */
2527 /* round up the element size to a multiple of 4 */
2528 GLint sz
= (store
->Size
+ 3) & ~3;
2529 /* total size = element size * array length */
2530 sz
*= var
->array_len
;
2534 /* setup default swizzle for storing the variable */
2535 /* XXX this may not be needed anymore - remove & test */
2536 switch (store
->Size
) {
2538 store
->Swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
,
2539 SWIZZLE_NIL
, SWIZZLE_NIL
);
2542 store
->Swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
,
2543 SWIZZLE_Z
, SWIZZLE_NIL
);
2546 /* Note that float-sized vars may be allocated in any x/y/z/w
2547 * slot, but that won't be determined until code emit time.
2549 store
->Swizzle
= SWIZZLE_NOOP
;
2552 /* if there's an initializer, generate IR for the expression */
2554 const char *varName
= (const char *) var
->a_name
;
2555 slang_ir_node
*varRef
, *init
;
2557 varRef
= new_var(A
, var
);
2559 slang_info_log_error(A
->log
, "undefined variable '%s'", varName
);
2563 if (var
->type
.qualifier
== SLANG_QUAL_CONST
) {
2564 /* if the variable is const, the initializer must be a const
2565 * expression as well.
2568 if (!_slang_is_constant_expr(initializer
)) {
2569 slang_info_log_error(A
->log
,
2570 "initializer for %s not constant", varName
);
2576 /* constant-folding, etc here */
2577 _slang_simplify(initializer
, &A
->space
, A
->atoms
);
2579 init
= _slang_gen_operation(A
, initializer
);
2583 /*assert(init->Store);*/
2585 /* XXX remove this when type checking is added above */
2586 if (init
->Store
&& varRef
->Store
->Size
!= init
->Store
->Size
) {
2587 slang_info_log_error(A
->log
, "invalid assignment (wrong types)");
2591 n
= new_node2(IR_COPY
, varRef
, init
);
2592 n
= new_seq(varDecl
, n
);
2595 /* no initializer */
2604 * Generate code for a selection expression: b ? x : y
2605 * XXX In some cases we could implement a selection expression
2606 * with an LRP instruction (use the boolean as the interpolant).
2607 * Otherwise, we use an IF/ELSE/ENDIF construct.
2609 static slang_ir_node
*
2610 _slang_gen_select(slang_assemble_ctx
*A
, slang_operation
*oper
)
2612 slang_ir_node
*cond
, *ifNode
, *trueExpr
, *falseExpr
, *trueNode
, *falseNode
;
2613 slang_ir_node
*tmpDecl
, *tmpVar
, *tree
;
2614 slang_typeinfo type0
, type1
, type2
;
2615 int size
, isBool
, isEqual
;
2617 assert(oper
->type
== SLANG_OPER_SELECT
);
2618 assert(oper
->num_children
== 3);
2620 /* type of children[0] must be boolean */
2621 slang_typeinfo_construct(&type0
);
2622 _slang_typeof_operation(A
, &oper
->children
[0], &type0
);
2623 isBool
= (type0
.spec
.type
== SLANG_SPEC_BOOL
);
2624 slang_typeinfo_destruct(&type0
);
2626 slang_info_log_error(A
->log
, "selector type is not boolean");
2630 slang_typeinfo_construct(&type1
);
2631 slang_typeinfo_construct(&type2
);
2632 _slang_typeof_operation(A
, &oper
->children
[1], &type1
);
2633 _slang_typeof_operation(A
, &oper
->children
[2], &type2
);
2634 isEqual
= slang_type_specifier_equal(&type1
.spec
, &type2
.spec
);
2635 slang_typeinfo_destruct(&type1
);
2636 slang_typeinfo_destruct(&type2
);
2638 slang_info_log_error(A
->log
, "incompatible types for ?: operator");
2642 /* size of x or y's type */
2643 size
= _slang_sizeof_type_specifier(&type1
.spec
);
2647 tmpDecl
= _slang_gen_temporary(size
);
2649 /* the condition (child 0) */
2650 cond
= _slang_gen_operation(A
, &oper
->children
[0]);
2651 cond
= new_cond(cond
);
2653 /* if-true body (child 1) */
2654 tmpVar
= new_node0(IR_VAR
);
2655 tmpVar
->Store
= tmpDecl
->Store
;
2656 trueExpr
= _slang_gen_operation(A
, &oper
->children
[1]);
2657 trueNode
= new_node2(IR_COPY
, tmpVar
, trueExpr
);
2659 /* if-false body (child 2) */
2660 tmpVar
= new_node0(IR_VAR
);
2661 tmpVar
->Store
= tmpDecl
->Store
;
2662 falseExpr
= _slang_gen_operation(A
, &oper
->children
[2]);
2663 falseNode
= new_node2(IR_COPY
, tmpVar
, falseExpr
);
2665 ifNode
= new_if(cond
, trueNode
, falseNode
);
2668 tmpVar
= new_node0(IR_VAR
);
2669 tmpVar
->Store
= tmpDecl
->Store
;
2671 tree
= new_seq(ifNode
, tmpVar
);
2672 tree
= new_seq(tmpDecl
, tree
);
2674 /*_slang_print_ir_tree(tree, 10);*/
2680 * Generate code for &&.
2682 static slang_ir_node
*
2683 _slang_gen_logical_and(slang_assemble_ctx
*A
, slang_operation
*oper
)
2685 /* rewrite "a && b" as "a ? b : false" */
2686 slang_operation
*select
;
2689 select
= slang_operation_new(1);
2690 select
->type
= SLANG_OPER_SELECT
;
2691 select
->num_children
= 3;
2692 select
->children
= slang_operation_new(3);
2694 slang_operation_copy(&select
->children
[0], &oper
->children
[0]);
2695 slang_operation_copy(&select
->children
[1], &oper
->children
[1]);
2696 select
->children
[2].type
= SLANG_OPER_LITERAL_BOOL
;
2697 ASSIGN_4V(select
->children
[2].literal
, 0, 0, 0, 0); /* false */
2698 select
->children
[2].literal_size
= 1;
2700 n
= _slang_gen_select(A
, select
);
2706 * Generate code for ||.
2708 static slang_ir_node
*
2709 _slang_gen_logical_or(slang_assemble_ctx
*A
, slang_operation
*oper
)
2711 /* rewrite "a || b" as "a ? true : b" */
2712 slang_operation
*select
;
2715 select
= slang_operation_new(1);
2716 select
->type
= SLANG_OPER_SELECT
;
2717 select
->num_children
= 3;
2718 select
->children
= slang_operation_new(3);
2720 slang_operation_copy(&select
->children
[0], &oper
->children
[0]);
2721 select
->children
[1].type
= SLANG_OPER_LITERAL_BOOL
;
2722 ASSIGN_4V(select
->children
[1].literal
, 1, 1, 1, 1); /* true */
2723 select
->children
[1].literal_size
= 1;
2724 slang_operation_copy(&select
->children
[2], &oper
->children
[1]);
2726 n
= _slang_gen_select(A
, select
);
2732 * Generate IR tree for a return statement.
2734 static slang_ir_node
*
2735 _slang_gen_return(slang_assemble_ctx
* A
, slang_operation
*oper
)
2737 const GLboolean haveReturnValue
2738 = (oper
->num_children
== 1 && oper
->children
[0].type
!= SLANG_OPER_VOID
);
2740 /* error checking */
2741 assert(A
->CurFunction
);
2742 if (haveReturnValue
&&
2743 A
->CurFunction
->header
.type
.specifier
.type
== SLANG_SPEC_VOID
) {
2744 slang_info_log_error(A
->log
, "illegal return expression");
2747 else if (!haveReturnValue
&&
2748 A
->CurFunction
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
2749 slang_info_log_error(A
->log
, "return statement requires an expression");
2753 if (!haveReturnValue
) {
2754 return new_return(A
->curFuncEndLabel
);
2762 * return; // goto __endOfFunction
2764 slang_operation
*assign
;
2765 slang_atom a_retVal
;
2768 a_retVal
= slang_atom_pool_atom(A
->atoms
, "__retVal");
2774 = _slang_locate_variable(oper
->locals
, a_retVal
, GL_TRUE
);
2776 /* trying to return a value in a void-valued function */
2782 assign
= slang_operation_new(1);
2783 assign
->type
= SLANG_OPER_ASSIGN
;
2784 assign
->num_children
= 2;
2785 assign
->children
= slang_operation_new(2);
2786 /* lhs (__retVal) */
2787 assign
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
2788 assign
->children
[0].a_id
= a_retVal
;
2789 assign
->children
[0].locals
->outer_scope
= assign
->locals
;
2791 /* XXX we might be able to avoid this copy someday */
2792 slang_operation_copy(&assign
->children
[1], &oper
->children
[0]);
2794 /* assemble the new code */
2795 n
= new_seq(_slang_gen_operation(A
, assign
),
2796 new_return(A
->curFuncEndLabel
));
2798 slang_operation_delete(assign
);
2805 * Determine if the given operation/expression is const-valued.
2808 _slang_is_constant_expr(const slang_operation
*oper
)
2810 slang_variable
*var
;
2813 switch (oper
->type
) {
2814 case SLANG_OPER_IDENTIFIER
:
2815 var
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
2816 if (var
&& var
->type
.qualifier
== SLANG_QUAL_CONST
)
2820 for (i
= 0; i
< oper
->num_children
; i
++) {
2821 if (!_slang_is_constant_expr(&oper
->children
[i
]))
2830 * Check if an assignment of type t1 to t0 is legal.
2831 * XXX more cases needed.
2834 _slang_assignment_compatible(slang_assemble_ctx
*A
,
2835 slang_operation
*op0
,
2836 slang_operation
*op1
)
2838 slang_typeinfo t0
, t1
;
2841 if (op0
->type
== SLANG_OPER_POSTINCREMENT
||
2842 op0
->type
== SLANG_OPER_POSTDECREMENT
) {
2846 slang_typeinfo_construct(&t0
);
2847 _slang_typeof_operation(A
, op0
, &t0
);
2849 slang_typeinfo_construct(&t1
);
2850 _slang_typeof_operation(A
, op1
, &t1
);
2852 sz0
= _slang_sizeof_type_specifier(&t0
.spec
);
2853 sz1
= _slang_sizeof_type_specifier(&t1
.spec
);
2857 /*printf("assignment size mismatch %u vs %u\n", sz0, sz1);*/
2862 if (t0
.spec
.type
== SLANG_SPEC_STRUCT
&&
2863 t1
.spec
.type
== SLANG_SPEC_STRUCT
&&
2864 t0
.spec
._struct
->a_name
!= t1
.spec
._struct
->a_name
)
2867 if (t0
.spec
.type
== SLANG_SPEC_FLOAT
&&
2868 t1
.spec
.type
== SLANG_SPEC_BOOL
)
2871 #if 0 /* not used just yet - causes problems elsewhere */
2872 if (t0
.spec
.type
== SLANG_SPEC_INT
&&
2873 t1
.spec
.type
== SLANG_SPEC_FLOAT
)
2877 if (t0
.spec
.type
== SLANG_SPEC_BOOL
&&
2878 t1
.spec
.type
== SLANG_SPEC_FLOAT
)
2881 if (t0
.spec
.type
== SLANG_SPEC_BOOL
&&
2882 t1
.spec
.type
== SLANG_SPEC_INT
)
2891 * Generate IR tree for a local variable declaration.
2893 static slang_ir_node
*
2894 _slang_gen_declaration(slang_assemble_ctx
*A
, slang_operation
*oper
)
2896 const char *varName
= (char *) oper
->a_id
;
2897 slang_variable
*var
;
2898 slang_ir_node
*varDecl
;
2899 slang_operation
*initializer
;
2901 assert(oper
->type
== SLANG_OPER_VARIABLE_DECL
);
2902 assert(oper
->num_children
<= 1);
2904 /* lookup the variable by name */
2905 var
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
2907 return NULL
; /* "shouldn't happen" */
2909 if (var
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
||
2910 var
->type
.qualifier
== SLANG_QUAL_VARYING
||
2911 var
->type
.qualifier
== SLANG_QUAL_UNIFORM
) {
2912 /* can't declare attribute/uniform vars inside functions */
2913 slang_info_log_error(A
->log
,
2914 "local variable '%s' cannot be an attribute/uniform/varying",
2921 slang_info_log_error(A
->log
, "variable '%s' redeclared", varName
);
2926 /* check if the var has an initializer */
2927 if (oper
->num_children
> 0) {
2928 assert(oper
->num_children
== 1);
2929 initializer
= &oper
->children
[0];
2931 else if (var
->initializer
) {
2932 initializer
= var
->initializer
;
2939 /* check/compare var type and initializer type */
2940 if (!_slang_assignment_compatible(A
, oper
, initializer
)) {
2941 slang_info_log_error(A
->log
, "incompatible types in assignment");
2946 /* Generate IR node */
2947 varDecl
= _slang_gen_var_decl(A
, var
, initializer
);
2951 if (var
->type
.qualifier
== SLANG_QUAL_CONST
&& !initializer
) {
2952 slang_info_log_error(A
->log
,
2953 "const-qualified variable '%s' requires initializer",
2963 * Generate IR tree for a variable (such as in an expression).
2965 static slang_ir_node
*
2966 _slang_gen_variable(slang_assemble_ctx
* A
, slang_operation
*oper
)
2968 /* If there's a variable associated with this oper (from inlining)
2969 * use it. Otherwise, use the oper's var id.
2971 slang_atom name
= oper
->var
? oper
->var
->a_name
: oper
->a_id
;
2972 slang_variable
*var
= _slang_locate_variable(oper
->locals
, name
, GL_TRUE
);
2973 slang_ir_node
*n
= new_var(A
, var
);
2975 slang_info_log_error(A
->log
, "undefined variable '%s'", (char *) name
);
2984 * Return the number of components actually named by the swizzle.
2985 * Recall that swizzles may have undefined/don't-care values.
2988 swizzle_size(GLuint swizzle
)
2991 for (i
= 0; i
< 4; i
++) {
2992 GLuint swz
= GET_SWZ(swizzle
, i
);
2993 size
+= (swz
>= 0 && swz
<= 3);
2999 static slang_ir_node
*
3000 _slang_gen_swizzle(slang_ir_node
*child
, GLuint swizzle
)
3002 slang_ir_node
*n
= new_node1(IR_SWIZZLE
, child
);
3006 n
->Store
= _slang_new_ir_storage_relative(0,
3007 swizzle_size(swizzle
),
3009 n
->Store
->Swizzle
= swizzle
;
3016 is_store_writable(const slang_assemble_ctx
*A
, const slang_ir_storage
*store
)
3018 while (store
->Parent
)
3019 store
= store
->Parent
;
3021 if (!(store
->File
== PROGRAM_OUTPUT
||
3022 store
->File
== PROGRAM_TEMPORARY
||
3023 (store
->File
== PROGRAM_VARYING
&&
3024 A
->program
->Target
== GL_VERTEX_PROGRAM_ARB
))) {
3034 * Generate IR tree for an assignment (=).
3036 static slang_ir_node
*
3037 _slang_gen_assignment(slang_assemble_ctx
* A
, slang_operation
*oper
)
3039 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
) {
3040 /* Check that var is writeable */
3042 = _slang_locate_variable(oper
->children
[0].locals
,
3043 oper
->children
[0].a_id
, GL_TRUE
);
3045 slang_info_log_error(A
->log
, "undefined variable '%s'",
3046 (char *) oper
->children
[0].a_id
);
3049 if (var
->type
.qualifier
== SLANG_QUAL_CONST
||
3050 var
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
||
3051 var
->type
.qualifier
== SLANG_QUAL_UNIFORM
||
3052 (var
->type
.qualifier
== SLANG_QUAL_VARYING
&&
3053 A
->program
->Target
== GL_FRAGMENT_PROGRAM_ARB
)) {
3054 slang_info_log_error(A
->log
,
3055 "illegal assignment to read-only variable '%s'",
3056 (char *) oper
->children
[0].a_id
);
3061 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
&&
3062 oper
->children
[1].type
== SLANG_OPER_CALL
) {
3063 /* Special case of: x = f(a, b)
3064 * Replace with f(a, b, x) (where x == hidden __retVal out param)
3066 * XXX this could be even more effective if we could accomodate
3067 * cases such as "v.x = f();" - would help with typical vertex
3071 n
= _slang_gen_function_call_name(A
,
3072 (const char *) oper
->children
[1].a_id
,
3073 &oper
->children
[1], &oper
->children
[0]);
3077 slang_ir_node
*n
, *lhs
, *rhs
;
3079 /* lhs and rhs type checking */
3080 if (!_slang_assignment_compatible(A
,
3082 &oper
->children
[1])) {
3083 slang_info_log_error(A
->log
, "incompatible types in assignment");
3087 lhs
= _slang_gen_operation(A
, &oper
->children
[0]);
3093 slang_info_log_error(A
->log
,
3094 "invalid left hand side for assignment");
3098 /* check that lhs is writable */
3099 if (!is_store_writable(A
, lhs
->Store
)) {
3100 slang_info_log_error(A
->log
,
3101 "illegal assignment to read-only l-value");
3105 rhs
= _slang_gen_operation(A
, &oper
->children
[1]);
3107 /* convert lhs swizzle into writemask */
3108 GLuint writemask
, newSwizzle
;
3109 if (!swizzle_to_writemask(A
, lhs
->Store
->Swizzle
,
3110 &writemask
, &newSwizzle
)) {
3111 /* Non-simple writemask, need to swizzle right hand side in
3112 * order to put components into the right place.
3114 rhs
= _slang_gen_swizzle(rhs
, newSwizzle
);
3116 n
= new_node2(IR_COPY
, lhs
, rhs
);
3127 * Generate IR tree for referencing a field in a struct (or basic vector type)
3129 static slang_ir_node
*
3130 _slang_gen_struct_field(slang_assemble_ctx
* A
, slang_operation
*oper
)
3134 /* type of struct */
3135 slang_typeinfo_construct(&ti
);
3136 _slang_typeof_operation(A
, &oper
->children
[0], &ti
);
3138 if (_slang_type_is_vector(ti
.spec
.type
)) {
3139 /* the field should be a swizzle */
3140 const GLuint rows
= _slang_type_dim(ti
.spec
.type
);
3144 if (!_slang_is_swizzle((char *) oper
->a_id
, rows
, &swz
)) {
3145 slang_info_log_error(A
->log
, "Bad swizzle");
3148 swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
3153 n
= _slang_gen_operation(A
, &oper
->children
[0]);
3154 /* create new parent node with swizzle */
3156 n
= _slang_gen_swizzle(n
, swizzle
);
3159 else if ( ti
.spec
.type
== SLANG_SPEC_FLOAT
3160 || ti
.spec
.type
== SLANG_SPEC_INT
3161 || ti
.spec
.type
== SLANG_SPEC_BOOL
) {
3162 const GLuint rows
= 1;
3166 if (!_slang_is_swizzle((char *) oper
->a_id
, rows
, &swz
)) {
3167 slang_info_log_error(A
->log
, "Bad swizzle");
3169 swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
3173 n
= _slang_gen_operation(A
, &oper
->children
[0]);
3174 /* create new parent node with swizzle */
3175 n
= _slang_gen_swizzle(n
, swizzle
);
3179 /* the field is a structure member (base.field) */
3180 /* oper->children[0] is the base */
3181 /* oper->a_id is the field name */
3182 slang_ir_node
*base
, *n
;
3183 slang_typeinfo field_ti
;
3184 GLint fieldSize
, fieldOffset
= -1;
3187 slang_typeinfo_construct(&field_ti
);
3188 _slang_typeof_operation(A
, oper
, &field_ti
);
3190 fieldSize
= _slang_sizeof_type_specifier(&field_ti
.spec
);
3192 fieldOffset
= _slang_field_offset(&ti
.spec
, oper
->a_id
);
3194 if (fieldSize
== 0 || fieldOffset
< 0) {
3195 const char *structName
;
3196 if (ti
.spec
._struct
)
3197 structName
= (char *) ti
.spec
._struct
->a_name
;
3199 structName
= "unknown";
3200 slang_info_log_error(A
->log
,
3201 "\"%s\" is not a member of struct \"%s\"",
3202 (char *) oper
->a_id
, structName
);
3205 assert(fieldSize
>= 0);
3207 base
= _slang_gen_operation(A
, &oper
->children
[0]);
3209 /* error msg should have already been logged */
3213 n
= new_node1(IR_FIELD
, base
);
3217 n
->Field
= (char *) oper
->a_id
;
3219 /* Store the field's offset in storage->Index */
3220 n
->Store
= _slang_new_ir_storage(base
->Store
->File
,
3230 * Gen code for array indexing.
3232 static slang_ir_node
*
3233 _slang_gen_array_element(slang_assemble_ctx
* A
, slang_operation
*oper
)
3235 slang_typeinfo array_ti
;
3237 /* get array's type info */
3238 slang_typeinfo_construct(&array_ti
);
3239 _slang_typeof_operation(A
, &oper
->children
[0], &array_ti
);
3241 if (_slang_type_is_vector(array_ti
.spec
.type
)) {
3242 /* indexing a simple vector type: "vec4 v; v[0]=p;" */
3243 /* translate the index into a swizzle/writemask: "v.x=p" */
3244 const GLuint max
= _slang_type_dim(array_ti
.spec
.type
);
3248 index
= (GLint
) oper
->children
[1].literal
[0];
3249 if (oper
->children
[1].type
!= SLANG_OPER_LITERAL_INT
||
3250 index
>= (GLint
) max
) {
3251 slang_info_log_error(A
->log
, "Invalid array index for vector type");
3255 n
= _slang_gen_operation(A
, &oper
->children
[0]);
3257 /* use swizzle to access the element */
3258 GLuint swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
+ index
,
3262 n
= _slang_gen_swizzle(n
, swizzle
);
3268 /* conventional array */
3269 slang_typeinfo elem_ti
;
3270 slang_ir_node
*elem
, *array
, *index
;
3271 GLint elemSize
, arrayLen
;
3273 /* size of array element */
3274 slang_typeinfo_construct(&elem_ti
);
3275 _slang_typeof_operation(A
, oper
, &elem_ti
);
3276 elemSize
= _slang_sizeof_type_specifier(&elem_ti
.spec
);
3278 if (_slang_type_is_matrix(array_ti
.spec
.type
))
3279 arrayLen
= _slang_type_dim(array_ti
.spec
.type
);
3281 arrayLen
= array_ti
.array_len
;
3283 slang_typeinfo_destruct(&array_ti
);
3284 slang_typeinfo_destruct(&elem_ti
);
3286 if (elemSize
<= 0) {
3287 /* unknown var or type */
3288 slang_info_log_error(A
->log
, "Undefined variable or type");
3292 array
= _slang_gen_operation(A
, &oper
->children
[0]);
3293 index
= _slang_gen_operation(A
, &oper
->children
[1]);
3294 if (array
&& index
) {
3296 GLint constIndex
= -1;
3297 if (index
->Opcode
== IR_FLOAT
) {
3298 constIndex
= (int) index
->Value
[0];
3299 if (constIndex
< 0 || constIndex
>= arrayLen
) {
3300 slang_info_log_error(A
->log
,
3301 "Array index out of bounds (index=%d size=%d)",
3302 constIndex
, arrayLen
);
3303 _slang_free_ir_tree(array
);
3304 _slang_free_ir_tree(index
);
3309 if (!array
->Store
) {
3310 slang_info_log_error(A
->log
, "Invalid array");
3314 elem
= new_node2(IR_ELEMENT
, array
, index
);
3316 /* The storage info here will be updated during code emit */
3317 elem
->Store
= _slang_new_ir_storage(array
->Store
->File
,
3318 array
->Store
->Index
,
3324 _slang_free_ir_tree(array
);
3325 _slang_free_ir_tree(index
);
3332 static slang_ir_node
*
3333 _slang_gen_compare(slang_assemble_ctx
*A
, slang_operation
*oper
,
3334 slang_ir_opcode opcode
)
3336 slang_typeinfo t0
, t1
;
3339 slang_typeinfo_construct(&t0
);
3340 _slang_typeof_operation(A
, &oper
->children
[0], &t0
);
3342 slang_typeinfo_construct(&t1
);
3343 _slang_typeof_operation(A
, &oper
->children
[0], &t1
);
3345 if (t0
.spec
.type
== SLANG_SPEC_ARRAY
||
3346 t1
.spec
.type
== SLANG_SPEC_ARRAY
) {
3347 slang_info_log_error(A
->log
, "Illegal array comparison");
3351 if (oper
->type
!= SLANG_OPER_EQUAL
&&
3352 oper
->type
!= SLANG_OPER_NOTEQUAL
) {
3353 /* <, <=, >, >= can only be used with scalars */
3354 if ((t0
.spec
.type
!= SLANG_SPEC_INT
&&
3355 t0
.spec
.type
!= SLANG_SPEC_FLOAT
) ||
3356 (t1
.spec
.type
!= SLANG_SPEC_INT
&&
3357 t1
.spec
.type
!= SLANG_SPEC_FLOAT
)) {
3358 slang_info_log_error(A
->log
, "Incompatible type(s) for inequality operator");
3363 n
= new_node2(opcode
,
3364 _slang_gen_operation(A
, &oper
->children
[0]),
3365 _slang_gen_operation(A
, &oper
->children
[1]));
3367 /* result is a bool (size 1) */
3368 n
->Store
= _slang_new_ir_storage(PROGRAM_TEMPORARY
, -1, 1);
3376 print_vars(slang_variable_scope
*s
)
3380 for (i
= 0; i
< s
->num_variables
; i
++) {
3382 (char*) s
->variables
[i
]->a_name
,
3383 s
->variables
[i
]->declared
);
3393 _slang_undeclare_vars(slang_variable_scope
*locals
)
3395 if (locals
->num_variables
> 0) {
3397 for (i
= 0; i
< locals
->num_variables
; i
++) {
3398 slang_variable
*v
= locals
->variables
[i
];
3399 printf("undeclare %s at %p\n", (char*) v
->a_name
, v
);
3400 v
->declared
= GL_FALSE
;
3408 * Generate IR tree for a slang_operation (AST node)
3410 static slang_ir_node
*
3411 _slang_gen_operation(slang_assemble_ctx
* A
, slang_operation
*oper
)
3413 switch (oper
->type
) {
3414 case SLANG_OPER_BLOCK_NEW_SCOPE
:
3418 _slang_push_var_table(A
->vartable
);
3420 oper
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
; /* temp change */
3421 n
= _slang_gen_operation(A
, oper
);
3422 oper
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
; /* restore */
3424 _slang_pop_var_table(A
->vartable
);
3426 /*_slang_undeclare_vars(oper->locals);*/
3427 /*print_vars(oper->locals);*/
3430 n
= new_node1(IR_SCOPE
, n
);
3435 case SLANG_OPER_BLOCK_NO_NEW_SCOPE
:
3436 /* list of operations */
3437 if (oper
->num_children
> 0)
3439 slang_ir_node
*n
, *tree
= NULL
;
3442 for (i
= 0; i
< oper
->num_children
; i
++) {
3443 n
= _slang_gen_operation(A
, &oper
->children
[i
]);
3445 _slang_free_ir_tree(tree
);
3446 return NULL
; /* error must have occured */
3448 tree
= new_seq(tree
, n
);
3454 return new_node0(IR_NOP
);
3457 case SLANG_OPER_EXPRESSION
:
3458 return _slang_gen_operation(A
, &oper
->children
[0]);
3460 case SLANG_OPER_FOR
:
3461 return _slang_gen_for(A
, oper
);
3463 return _slang_gen_do(A
, oper
);
3464 case SLANG_OPER_WHILE
:
3465 return _slang_gen_while(A
, oper
);
3466 case SLANG_OPER_BREAK
:
3468 slang_info_log_error(A
->log
, "'break' not in loop");
3471 return new_break(A
->CurLoop
);
3472 case SLANG_OPER_CONTINUE
:
3474 slang_info_log_error(A
->log
, "'continue' not in loop");
3477 return _slang_gen_continue(A
, oper
);
3478 case SLANG_OPER_DISCARD
:
3479 return new_node0(IR_KILL
);
3481 case SLANG_OPER_EQUAL
:
3482 return _slang_gen_compare(A
, oper
, IR_EQUAL
);
3483 case SLANG_OPER_NOTEQUAL
:
3484 return _slang_gen_compare(A
, oper
, IR_NOTEQUAL
);
3485 case SLANG_OPER_GREATER
:
3486 return _slang_gen_compare(A
, oper
, IR_SGT
);
3487 case SLANG_OPER_LESS
:
3488 return _slang_gen_compare(A
, oper
, IR_SLT
);
3489 case SLANG_OPER_GREATEREQUAL
:
3490 return _slang_gen_compare(A
, oper
, IR_SGE
);
3491 case SLANG_OPER_LESSEQUAL
:
3492 return _slang_gen_compare(A
, oper
, IR_SLE
);
3493 case SLANG_OPER_ADD
:
3496 assert(oper
->num_children
== 2);
3497 n
= _slang_gen_function_call_name(A
, "+", oper
, NULL
);
3500 case SLANG_OPER_SUBTRACT
:
3503 assert(oper
->num_children
== 2);
3504 n
= _slang_gen_function_call_name(A
, "-", oper
, NULL
);
3507 case SLANG_OPER_MULTIPLY
:
3510 assert(oper
->num_children
== 2);
3511 n
= _slang_gen_function_call_name(A
, "*", oper
, NULL
);
3514 case SLANG_OPER_DIVIDE
:
3517 assert(oper
->num_children
== 2);
3518 n
= _slang_gen_function_call_name(A
, "/", oper
, NULL
);
3521 case SLANG_OPER_MINUS
:
3524 assert(oper
->num_children
== 1);
3525 n
= _slang_gen_function_call_name(A
, "-", oper
, NULL
);
3528 case SLANG_OPER_PLUS
:
3529 /* +expr --> do nothing */
3530 return _slang_gen_operation(A
, &oper
->children
[0]);
3531 case SLANG_OPER_VARIABLE_DECL
:
3532 return _slang_gen_declaration(A
, oper
);
3533 case SLANG_OPER_ASSIGN
:
3534 return _slang_gen_assignment(A
, oper
);
3535 case SLANG_OPER_ADDASSIGN
:
3538 assert(oper
->num_children
== 2);
3539 n
= _slang_gen_function_call_name(A
, "+=", oper
, NULL
);
3542 case SLANG_OPER_SUBASSIGN
:
3545 assert(oper
->num_children
== 2);
3546 n
= _slang_gen_function_call_name(A
, "-=", oper
, NULL
);
3550 case SLANG_OPER_MULASSIGN
:
3553 assert(oper
->num_children
== 2);
3554 n
= _slang_gen_function_call_name(A
, "*=", oper
, NULL
);
3557 case SLANG_OPER_DIVASSIGN
:
3560 assert(oper
->num_children
== 2);
3561 n
= _slang_gen_function_call_name(A
, "/=", oper
, NULL
);
3564 case SLANG_OPER_LOGICALAND
:
3567 assert(oper
->num_children
== 2);
3568 n
= _slang_gen_logical_and(A
, oper
);
3571 case SLANG_OPER_LOGICALOR
:
3574 assert(oper
->num_children
== 2);
3575 n
= _slang_gen_logical_or(A
, oper
);
3578 case SLANG_OPER_LOGICALXOR
:
3579 return _slang_gen_xor(A
, oper
);
3580 case SLANG_OPER_NOT
:
3581 return _slang_gen_not(A
, oper
);
3582 case SLANG_OPER_SELECT
: /* b ? x : y */
3585 assert(oper
->num_children
== 3);
3586 n
= _slang_gen_select(A
, oper
);
3590 case SLANG_OPER_ASM
:
3591 return _slang_gen_asm(A
, oper
, NULL
);
3592 case SLANG_OPER_CALL
:
3593 return _slang_gen_function_call_name(A
, (const char *) oper
->a_id
,
3595 case SLANG_OPER_METHOD
:
3596 return _slang_gen_method_call(A
, oper
);
3597 case SLANG_OPER_RETURN
:
3598 return _slang_gen_return(A
, oper
);
3599 case SLANG_OPER_LABEL
:
3600 return new_label(oper
->label
);
3601 case SLANG_OPER_IDENTIFIER
:
3602 return _slang_gen_variable(A
, oper
);
3604 return _slang_gen_if(A
, oper
);
3605 case SLANG_OPER_FIELD
:
3606 return _slang_gen_struct_field(A
, oper
);
3607 case SLANG_OPER_SUBSCRIPT
:
3608 return _slang_gen_array_element(A
, oper
);
3609 case SLANG_OPER_LITERAL_FLOAT
:
3611 case SLANG_OPER_LITERAL_INT
:
3613 case SLANG_OPER_LITERAL_BOOL
:
3614 return new_float_literal(oper
->literal
, oper
->literal_size
);
3616 case SLANG_OPER_POSTINCREMENT
: /* var++ */
3619 assert(oper
->num_children
== 1);
3620 n
= _slang_gen_function_call_name(A
, "__postIncr", oper
, NULL
);
3623 case SLANG_OPER_POSTDECREMENT
: /* var-- */
3626 assert(oper
->num_children
== 1);
3627 n
= _slang_gen_function_call_name(A
, "__postDecr", oper
, NULL
);
3630 case SLANG_OPER_PREINCREMENT
: /* ++var */
3633 assert(oper
->num_children
== 1);
3634 n
= _slang_gen_function_call_name(A
, "++", oper
, NULL
);
3637 case SLANG_OPER_PREDECREMENT
: /* --var */
3640 assert(oper
->num_children
== 1);
3641 n
= _slang_gen_function_call_name(A
, "--", oper
, NULL
);
3645 case SLANG_OPER_NON_INLINED_CALL
:
3646 case SLANG_OPER_SEQUENCE
:
3648 slang_ir_node
*tree
= NULL
;
3650 for (i
= 0; i
< oper
->num_children
; i
++) {
3651 slang_ir_node
*n
= _slang_gen_operation(A
, &oper
->children
[i
]);
3652 tree
= new_seq(tree
, n
);
3654 tree
->Store
= n
->Store
;
3656 if (oper
->type
== SLANG_OPER_NON_INLINED_CALL
) {
3657 tree
= new_function_call(tree
, oper
->label
);
3662 case SLANG_OPER_NONE
:
3663 case SLANG_OPER_VOID
:
3664 /* returning NULL here would generate an error */
3665 return new_node0(IR_NOP
);
3668 _mesa_problem(NULL
, "bad node type %d in _slang_gen_operation",
3670 return new_node0(IR_NOP
);
3678 * Compute total size of array give size of element, number of elements.
3681 array_size(GLint baseSize
, GLint arrayLen
)
3685 /* round up base type to multiple of 4 */
3686 total
= ((baseSize
+ 3) & ~0x3) * MAX2(arrayLen
, 1);
3696 * Called by compiler when a global variable has been parsed/compiled.
3697 * Here we examine the variable's type to determine what kind of register
3698 * storage will be used.
3700 * A uniform such as "gl_Position" will become the register specification
3701 * (PROGRAM_OUTPUT, VERT_RESULT_HPOS). Or, uniform "gl_FogFragCoord"
3702 * will be (PROGRAM_INPUT, FRAG_ATTRIB_FOGC).
3704 * Samplers are interesting. For "uniform sampler2D tex;" we'll specify
3705 * (PROGRAM_SAMPLER, index) where index is resolved at link-time to an
3706 * actual texture unit (as specified by the user calling glUniform1i()).
3709 _slang_codegen_global_variable(slang_assemble_ctx
*A
, slang_variable
*var
,
3710 slang_unit_type type
)
3712 struct gl_program
*prog
= A
->program
;
3713 const char *varName
= (char *) var
->a_name
;
3714 GLboolean success
= GL_TRUE
;
3715 slang_ir_storage
*store
= NULL
;
3717 const GLenum datatype
= _slang_gltype_from_specifier(&var
->type
.specifier
);
3718 const GLint texIndex
= sampler_to_texture_index(var
->type
.specifier
.type
);
3719 const GLint size
= _slang_sizeof_type_specifier(&var
->type
.specifier
);
3721 if (texIndex
!= -1) {
3722 /* This is a texture sampler variable...
3723 * store->File = PROGRAM_SAMPLER
3724 * store->Index = sampler number (0..7, typically)
3725 * store->Size = texture type index (1D, 2D, 3D, cube, etc)
3727 if (var
->initializer
) {
3728 slang_info_log_error(A
->log
, "illegal assignment to '%s'", varName
);
3731 #if FEATURE_es2_glsl /* XXX should use FEATURE_texture_rect */
3732 /* disallow rect samplers */
3733 if (var
->type
.specifier
.type
== SLANG_SPEC_SAMPLER2DRECT
||
3734 var
->type
.specifier
.type
== SLANG_SPEC_SAMPLER2DRECTSHADOW
) {
3735 slang_info_log_error(A
->log
, "invalid sampler type for '%s'", varName
);
3740 GLint sampNum
= _mesa_add_sampler(prog
->Parameters
, varName
, datatype
);
3741 store
= _slang_new_ir_storage(PROGRAM_SAMPLER
, sampNum
, texIndex
);
3743 if (dbg
) printf("SAMPLER ");
3745 else if (var
->type
.qualifier
== SLANG_QUAL_UNIFORM
) {
3746 /* Uniform variable */
3747 const GLint totalSize
= array_size(size
, var
->array_len
);
3748 const GLuint swizzle
= _slang_var_swizzle(totalSize
, 0);
3751 /* user-defined uniform */
3752 if (datatype
== GL_NONE
) {
3753 if (var
->type
.specifier
.type
== SLANG_SPEC_STRUCT
) {
3754 /* temporary work-around */
3755 GLenum datatype
= GL_FLOAT
;
3756 GLint uniformLoc
= _mesa_add_uniform(prog
->Parameters
, varName
,
3757 totalSize
, datatype
, NULL
);
3758 store
= _slang_new_ir_storage_swz(PROGRAM_UNIFORM
, uniformLoc
,
3759 totalSize
, swizzle
);
3761 /* XXX what we need to do is unroll the struct into its
3762 * basic types, creating a uniform variable for each.
3770 * Should produce uniforms:
3771 * "f.a" (GL_FLOAT_VEC3)
3772 * "f.b" (GL_FLOAT_VEC4)
3775 if (var
->initializer
) {
3776 slang_info_log_error(A
->log
,
3777 "unsupported initializer for uniform '%s'", varName
);
3782 slang_info_log_error(A
->log
,
3783 "invalid datatype for uniform variable %s",
3790 const GLfloat
*initialValues
= NULL
;
3791 if (var
->initializer
) {
3792 _slang_simplify(var
->initializer
, &A
->space
, A
->atoms
);
3793 if (var
->initializer
->type
== SLANG_OPER_LITERAL_FLOAT
||
3794 var
->initializer
->type
== SLANG_OPER_LITERAL_INT
) {
3795 /* simple float/vector initializer */
3796 initialValues
= var
->initializer
->literal
;
3799 /* complex initializer */
3800 slang_info_log_error(A
->log
,
3801 "unsupported initializer for uniform '%s'", varName
);
3806 uniformLoc
= _mesa_add_uniform(prog
->Parameters
, varName
,
3807 totalSize
, datatype
, initialValues
);
3808 store
= _slang_new_ir_storage_swz(PROGRAM_UNIFORM
, uniformLoc
,
3809 totalSize
, swizzle
);
3813 /* pre-defined uniform, like gl_ModelviewMatrix */
3814 /* We know it's a uniform, but don't allocate storage unless
3817 store
= _slang_new_ir_storage_swz(PROGRAM_STATE_VAR
, -1,
3818 totalSize
, swizzle
);
3820 if (dbg
) printf("UNIFORM (sz %d) ", totalSize
);
3822 else if (var
->type
.qualifier
== SLANG_QUAL_VARYING
) {
3823 const GLint totalSize
= array_size(size
, var
->array_len
);
3825 /* varyings must be float, vec or mat */
3826 if (!_slang_type_is_float_vec_mat(var
->type
.specifier
.type
) &&
3827 var
->type
.specifier
.type
!= SLANG_SPEC_ARRAY
) {
3828 slang_info_log_error(A
->log
,
3829 "varying '%s' must be float/vector/matrix",
3834 if (var
->initializer
) {
3835 slang_info_log_error(A
->log
, "illegal initializer for varying '%s'",
3841 /* user-defined varying */
3847 if (var
->type
.centroid
== SLANG_CENTROID
)
3848 flags
|= PROG_PARAM_BIT_CENTROID
;
3849 if (var
->type
.variant
== SLANG_INVARIANT
)
3850 flags
|= PROG_PARAM_BIT_INVARIANT
;
3852 varyingLoc
= _mesa_add_varying(prog
->Varying
, varName
,
3854 swizzle
= _slang_var_swizzle(size
, 0);
3855 store
= _slang_new_ir_storage_swz(PROGRAM_VARYING
, varyingLoc
,
3856 totalSize
, swizzle
);
3859 /* pre-defined varying, like gl_Color or gl_TexCoord */
3860 if (type
== SLANG_UNIT_FRAGMENT_BUILTIN
) {
3861 /* fragment program input */
3863 GLint index
= _slang_input_index(varName
, GL_FRAGMENT_PROGRAM_ARB
,
3866 assert(index
< FRAG_ATTRIB_MAX
);
3867 store
= _slang_new_ir_storage_swz(PROGRAM_INPUT
, index
,
3871 /* vertex program output */
3872 GLint index
= _slang_output_index(varName
, GL_VERTEX_PROGRAM_ARB
);
3873 GLuint swizzle
= _slang_var_swizzle(size
, 0);
3875 assert(index
< VERT_RESULT_MAX
);
3876 assert(type
== SLANG_UNIT_VERTEX_BUILTIN
);
3877 store
= _slang_new_ir_storage_swz(PROGRAM_OUTPUT
, index
,
3880 if (dbg
) printf("V/F ");
3882 if (dbg
) printf("VARYING ");
3884 else if (var
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
) {
3887 /* attributes must be float, vec or mat */
3888 if (!_slang_type_is_float_vec_mat(var
->type
.specifier
.type
)) {
3889 slang_info_log_error(A
->log
,
3890 "attribute '%s' must be float/vector/matrix",
3896 /* user-defined vertex attribute */
3897 const GLint attr
= -1; /* unknown */
3898 swizzle
= _slang_var_swizzle(size
, 0);
3899 index
= _mesa_add_attribute(prog
->Attributes
, varName
,
3900 size
, datatype
, attr
);
3902 index
= VERT_ATTRIB_GENERIC0
+ index
;
3905 /* pre-defined vertex attrib */
3906 index
= _slang_input_index(varName
, GL_VERTEX_PROGRAM_ARB
, &swizzle
);
3909 store
= _slang_new_ir_storage_swz(PROGRAM_INPUT
, index
, size
, swizzle
);
3910 if (dbg
) printf("ATTRIB ");
3912 else if (var
->type
.qualifier
== SLANG_QUAL_FIXEDINPUT
) {
3913 GLuint swizzle
= SWIZZLE_XYZW
; /* silence compiler warning */
3914 GLint index
= _slang_input_index(varName
, GL_FRAGMENT_PROGRAM_ARB
,
3916 store
= _slang_new_ir_storage_swz(PROGRAM_INPUT
, index
, size
, swizzle
);
3917 if (dbg
) printf("INPUT ");
3919 else if (var
->type
.qualifier
== SLANG_QUAL_FIXEDOUTPUT
) {
3920 if (type
== SLANG_UNIT_VERTEX_BUILTIN
) {
3921 GLint index
= _slang_output_index(varName
, GL_VERTEX_PROGRAM_ARB
);
3922 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, size
);
3925 GLint index
= _slang_output_index(varName
, GL_FRAGMENT_PROGRAM_ARB
);
3926 GLint specialSize
= 4; /* treat all fragment outputs as float[4] */
3927 assert(type
== SLANG_UNIT_FRAGMENT_BUILTIN
);
3928 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, specialSize
);
3930 if (dbg
) printf("OUTPUT ");
3932 else if (var
->type
.qualifier
== SLANG_QUAL_CONST
&& !prog
) {
3933 /* pre-defined global constant, like gl_MaxLights */
3934 store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, size
);
3935 if (dbg
) printf("CONST ");
3938 /* ordinary variable (may be const) */
3941 /* IR node to declare the variable */
3942 n
= _slang_gen_var_decl(A
, var
, var
->initializer
);
3944 /* emit GPU instructions */
3945 success
= _slang_emit_code(n
, A
->vartable
, A
->program
, GL_FALSE
, A
->log
);
3947 _slang_free_ir_tree(n
);
3950 if (dbg
) printf("GLOBAL VAR %s idx %d\n", (char*) var
->a_name
,
3951 store
? store
->Index
: -2);
3954 var
->store
= store
; /* save var's storage info */
3956 var
->declared
= GL_TRUE
;
3963 * Produce an IR tree from a function AST (fun->body).
3964 * Then call the code emitter to convert the IR tree into gl_program
3968 _slang_codegen_function(slang_assemble_ctx
* A
, slang_function
* fun
)
3971 GLboolean success
= GL_TRUE
;
3973 if (_mesa_strcmp((char *) fun
->header
.a_name
, "main") != 0) {
3974 /* we only really generate code for main, all other functions get
3975 * inlined or codegen'd upon an actual call.
3978 /* do some basic error checking though */
3979 if (fun
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
3980 /* check that non-void functions actually return something */
3982 = _slang_find_node_type(fun
->body
, SLANG_OPER_RETURN
);
3984 slang_info_log_error(A
->log
,
3985 "function \"%s\" has no return statement",
3986 (char *) fun
->header
.a_name
);
3988 "function \"%s\" has no return statement\n",
3989 (char *) fun
->header
.a_name
);
3994 return GL_TRUE
; /* not an error */
3998 printf("\n*********** codegen_function %s\n", (char *) fun
->header
.a_name
);
3999 slang_print_function(fun
, 1);
4002 /* should have been allocated earlier: */
4003 assert(A
->program
->Parameters
);
4004 assert(A
->program
->Varying
);
4005 assert(A
->vartable
);
4007 A
->CurFunction
= fun
;
4009 /* fold constant expressions, etc. */
4010 _slang_simplify(fun
->body
, &A
->space
, A
->atoms
);
4013 printf("\n*********** simplified %s\n", (char *) fun
->header
.a_name
);
4014 slang_print_function(fun
, 1);
4017 /* Create an end-of-function label */
4018 A
->curFuncEndLabel
= _slang_label_new("__endOfFunc__main");
4020 /* push new vartable scope */
4021 _slang_push_var_table(A
->vartable
);
4023 /* Generate IR tree for the function body code */
4024 n
= _slang_gen_operation(A
, fun
->body
);
4026 n
= new_node1(IR_SCOPE
, n
);
4028 /* pop vartable, restore previous */
4029 _slang_pop_var_table(A
->vartable
);
4032 /* XXX record error */
4036 /* append an end-of-function-label to IR tree */
4037 n
= new_seq(n
, new_label(A
->curFuncEndLabel
));
4039 /*_slang_label_delete(A->curFuncEndLabel);*/
4040 A
->curFuncEndLabel
= NULL
;
4043 printf("************* New AST for %s *****\n", (char*)fun
->header
.a_name
);
4044 slang_print_function(fun
, 1);
4047 printf("************* IR for %s *******\n", (char*)fun
->header
.a_name
);
4048 _slang_print_ir_tree(n
, 0);
4051 printf("************* End codegen function ************\n\n");
4054 /* Emit program instructions */
4055 success
= _slang_emit_code(n
, A
->vartable
, A
->program
, GL_TRUE
, A
->log
);
4056 _slang_free_ir_tree(n
);
4058 /* free codegen context */
4060 _mesa_free(A->codegen);