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_statevars.h"
47 #include "slang_typeinfo.h"
48 #include "slang_codegen.h"
49 #include "slang_compile.h"
50 #include "slang_label.h"
51 #include "slang_mem.h"
52 #include "slang_simplify.h"
53 #include "slang_emit.h"
54 #include "slang_vartable.h"
56 #include "slang_print.h"
59 static slang_ir_node
*
60 _slang_gen_operation(slang_assemble_ctx
* A
, slang_operation
*oper
);
64 is_sampler_type(const slang_fully_specified_type
*t
)
66 switch (t
->specifier
.type
) {
67 case SLANG_SPEC_SAMPLER1D
:
68 case SLANG_SPEC_SAMPLER2D
:
69 case SLANG_SPEC_SAMPLER3D
:
70 case SLANG_SPEC_SAMPLERCUBE
:
71 case SLANG_SPEC_SAMPLER1DSHADOW
:
72 case SLANG_SPEC_SAMPLER2DSHADOW
:
73 case SLANG_SPEC_SAMPLER2DRECT
:
74 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
83 * Return the offset (in floats or ints) of the named field within
84 * the given struct. Return -1 if field not found.
85 * If field is NULL, return the size of the struct instead.
88 _slang_field_offset(const slang_type_specifier
*spec
, slang_atom field
)
92 for (i
= 0; i
< spec
->_struct
->fields
->num_variables
; i
++) {
93 const slang_variable
*v
= spec
->_struct
->fields
->variables
[i
];
94 const GLuint sz
= _slang_sizeof_type_specifier(&v
->type
.specifier
);
96 /* types larger than 1 float are register (4-float) aligned */
97 offset
= (offset
+ 3) & ~3;
99 if (field
&& v
->a_name
== field
) {
105 return -1; /* field not found */
107 return offset
; /* struct size */
112 * Return the size (in floats) of the given type specifier.
113 * If the size is greater than 4, the size should be a multiple of 4
114 * so that the correct number of 4-float registers are allocated.
115 * For example, a mat3x2 is size 12 because we want to store the
116 * 3 columns in 3 float[4] registers.
119 _slang_sizeof_type_specifier(const slang_type_specifier
*spec
)
122 switch (spec
->type
) {
123 case SLANG_SPEC_VOID
:
126 case SLANG_SPEC_BOOL
:
129 case SLANG_SPEC_BVEC2
:
132 case SLANG_SPEC_BVEC3
:
135 case SLANG_SPEC_BVEC4
:
141 case SLANG_SPEC_IVEC2
:
144 case SLANG_SPEC_IVEC3
:
147 case SLANG_SPEC_IVEC4
:
150 case SLANG_SPEC_FLOAT
:
153 case SLANG_SPEC_VEC2
:
156 case SLANG_SPEC_VEC3
:
159 case SLANG_SPEC_VEC4
:
162 case SLANG_SPEC_MAT2
:
163 sz
= 2 * 4; /* 2 columns (regs) */
165 case SLANG_SPEC_MAT3
:
168 case SLANG_SPEC_MAT4
:
171 case SLANG_SPEC_MAT23
:
172 sz
= 2 * 4; /* 2 columns (regs) */
174 case SLANG_SPEC_MAT32
:
175 sz
= 3 * 4; /* 3 columns (regs) */
177 case SLANG_SPEC_MAT24
:
180 case SLANG_SPEC_MAT42
:
181 sz
= 4 * 4; /* 4 columns (regs) */
183 case SLANG_SPEC_MAT34
:
186 case SLANG_SPEC_MAT43
:
187 sz
= 4 * 4; /* 4 columns (regs) */
189 case SLANG_SPEC_SAMPLER1D
:
190 case SLANG_SPEC_SAMPLER2D
:
191 case SLANG_SPEC_SAMPLER3D
:
192 case SLANG_SPEC_SAMPLERCUBE
:
193 case SLANG_SPEC_SAMPLER1DSHADOW
:
194 case SLANG_SPEC_SAMPLER2DSHADOW
:
195 case SLANG_SPEC_SAMPLER2DRECT
:
196 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
197 sz
= 1; /* a sampler is basically just an integer index */
199 case SLANG_SPEC_STRUCT
:
200 sz
= _slang_field_offset(spec
, 0); /* special use */
202 sz
= (sz
+ 3) & ~0x3; /* round up to multiple of four */
205 case SLANG_SPEC_ARRAY
:
206 sz
= _slang_sizeof_type_specifier(spec
->_array
);
209 _mesa_problem(NULL
, "Unexpected type in _slang_sizeof_type_specifier()");
214 /* if size is > 4, it should be a multiple of four */
215 assert((sz
& 0x3) == 0);
222 * Establish the binding between a slang_ir_node and a slang_variable.
223 * Then, allocate/attach a slang_ir_storage object to the IR node if needed.
224 * The IR node must be a IR_VAR or IR_VAR_DECL node.
225 * \param n the IR node
226 * \param var the variable to associate with the IR node
229 _slang_attach_storage(slang_ir_node
*n
, slang_variable
*var
)
233 assert(n
->Opcode
== IR_VAR
|| n
->Opcode
== IR_VAR_DECL
);
234 assert(!n
->Var
|| n
->Var
== var
);
239 /* need to setup storage */
240 if (n
->Var
&& n
->Var
->aux
) {
241 /* node storage info = var storage info */
242 n
->Store
= (slang_ir_storage
*) n
->Var
->aux
;
245 /* alloc new storage info */
246 n
->Store
= _slang_new_ir_storage(PROGRAM_UNDEFINED
, -1, -5);
248 n
->Var
->aux
= n
->Store
;
256 * Return the TEXTURE_*_INDEX value that corresponds to a sampler type,
257 * or -1 if the type is not a sampler.
260 sampler_to_texture_index(const slang_type_specifier_type type
)
263 case SLANG_SPEC_SAMPLER1D
:
264 return TEXTURE_1D_INDEX
;
265 case SLANG_SPEC_SAMPLER2D
:
266 return TEXTURE_2D_INDEX
;
267 case SLANG_SPEC_SAMPLER3D
:
268 return TEXTURE_3D_INDEX
;
269 case SLANG_SPEC_SAMPLERCUBE
:
270 return TEXTURE_CUBE_INDEX
;
271 case SLANG_SPEC_SAMPLER1DSHADOW
:
272 return TEXTURE_1D_INDEX
; /* XXX fix */
273 case SLANG_SPEC_SAMPLER2DSHADOW
:
274 return TEXTURE_2D_INDEX
; /* XXX fix */
275 case SLANG_SPEC_SAMPLER2DRECT
:
276 return TEXTURE_RECT_INDEX
;
277 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
278 return TEXTURE_RECT_INDEX
; /* XXX fix */
285 #define SWIZZLE_ZWWW MAKE_SWIZZLE4(SWIZZLE_Z, SWIZZLE_W, SWIZZLE_W, SWIZZLE_W)
288 * Return the VERT_ATTRIB_* or FRAG_ATTRIB_* value that corresponds to
289 * a vertex or fragment program input variable. Return -1 if the input
291 * XXX return size too
294 _slang_input_index(const char *name
, GLenum target
, GLuint
*swizzleOut
)
301 static const struct input_info vertInputs
[] = {
302 { "gl_Vertex", VERT_ATTRIB_POS
, SWIZZLE_NOOP
},
303 { "gl_Normal", VERT_ATTRIB_NORMAL
, SWIZZLE_NOOP
},
304 { "gl_Color", VERT_ATTRIB_COLOR0
, SWIZZLE_NOOP
},
305 { "gl_SecondaryColor", VERT_ATTRIB_COLOR1
, SWIZZLE_NOOP
},
306 { "gl_FogCoord", VERT_ATTRIB_FOG
, SWIZZLE_XXXX
},
307 { "gl_MultiTexCoord0", VERT_ATTRIB_TEX0
, SWIZZLE_NOOP
},
308 { "gl_MultiTexCoord1", VERT_ATTRIB_TEX1
, SWIZZLE_NOOP
},
309 { "gl_MultiTexCoord2", VERT_ATTRIB_TEX2
, SWIZZLE_NOOP
},
310 { "gl_MultiTexCoord3", VERT_ATTRIB_TEX3
, SWIZZLE_NOOP
},
311 { "gl_MultiTexCoord4", VERT_ATTRIB_TEX4
, SWIZZLE_NOOP
},
312 { "gl_MultiTexCoord5", VERT_ATTRIB_TEX5
, SWIZZLE_NOOP
},
313 { "gl_MultiTexCoord6", VERT_ATTRIB_TEX6
, SWIZZLE_NOOP
},
314 { "gl_MultiTexCoord7", VERT_ATTRIB_TEX7
, SWIZZLE_NOOP
},
315 { NULL
, 0, SWIZZLE_NOOP
}
317 static const struct input_info fragInputs
[] = {
318 { "gl_FragCoord", FRAG_ATTRIB_WPOS
, SWIZZLE_NOOP
},
319 { "gl_Color", FRAG_ATTRIB_COL0
, SWIZZLE_NOOP
},
320 { "gl_SecondaryColor", FRAG_ATTRIB_COL1
, SWIZZLE_NOOP
},
321 { "gl_TexCoord", FRAG_ATTRIB_TEX0
, SWIZZLE_NOOP
},
322 /* note: we're packing several quantities into the fogcoord vector */
323 { "gl_FogFragCoord", FRAG_ATTRIB_FOGC
, SWIZZLE_XXXX
},
324 { "gl_FrontFacing", FRAG_ATTRIB_FOGC
, SWIZZLE_YYYY
}, /*XXX*/
325 { "gl_PointCoord", FRAG_ATTRIB_FOGC
, SWIZZLE_ZWWW
},
326 { NULL
, 0, SWIZZLE_NOOP
}
329 const struct input_info
*inputs
330 = (target
== GL_VERTEX_PROGRAM_ARB
) ? vertInputs
: fragInputs
;
332 ASSERT(MAX_TEXTURE_UNITS
== 8); /* if this fails, fix vertInputs above */
334 for (i
= 0; inputs
[i
].Name
; i
++) {
335 if (strcmp(inputs
[i
].Name
, name
) == 0) {
337 *swizzleOut
= inputs
[i
].Swizzle
;
338 return inputs
[i
].Attrib
;
346 * Return the VERT_RESULT_* or FRAG_RESULT_* value that corresponds to
347 * a vertex or fragment program output variable. Return -1 for an invalid
351 _slang_output_index(const char *name
, GLenum target
)
357 static const struct output_info vertOutputs
[] = {
358 { "gl_Position", VERT_RESULT_HPOS
},
359 { "gl_FrontColor", VERT_RESULT_COL0
},
360 { "gl_BackColor", VERT_RESULT_BFC0
},
361 { "gl_FrontSecondaryColor", VERT_RESULT_COL1
},
362 { "gl_BackSecondaryColor", VERT_RESULT_BFC1
},
363 { "gl_TexCoord", VERT_RESULT_TEX0
},
364 { "gl_FogFragCoord", VERT_RESULT_FOGC
},
365 { "gl_PointSize", VERT_RESULT_PSIZ
},
368 static const struct output_info fragOutputs
[] = {
369 { "gl_FragColor", FRAG_RESULT_COLR
},
370 { "gl_FragDepth", FRAG_RESULT_DEPR
},
371 { "gl_FragData", FRAG_RESULT_DATA0
},
375 const struct output_info
*outputs
376 = (target
== GL_VERTEX_PROGRAM_ARB
) ? vertOutputs
: fragOutputs
;
378 for (i
= 0; outputs
[i
].Name
; i
++) {
379 if (strcmp(outputs
[i
].Name
, name
) == 0) {
381 return outputs
[i
].Attrib
;
389 /**********************************************************************/
393 * Map "_asm foo" to IR_FOO, etc.
398 slang_ir_opcode Opcode
;
399 GLuint HaveRetValue
, NumParams
;
403 static slang_asm_info AsmInfo
[] = {
405 { "vec4_add", IR_ADD
, 1, 2 },
406 { "vec4_subtract", IR_SUB
, 1, 2 },
407 { "vec4_multiply", IR_MUL
, 1, 2 },
408 { "vec4_dot", IR_DOT4
, 1, 2 },
409 { "vec3_dot", IR_DOT3
, 1, 2 },
410 { "vec3_cross", IR_CROSS
, 1, 2 },
411 { "vec4_lrp", IR_LRP
, 1, 3 },
412 { "vec4_min", IR_MIN
, 1, 2 },
413 { "vec4_max", IR_MAX
, 1, 2 },
414 { "vec4_clamp", IR_CLAMP
, 1, 3 },
415 { "vec4_seq", IR_SEQUAL
, 1, 2 },
416 { "vec4_sne", IR_SNEQUAL
, 1, 2 },
417 { "vec4_sge", IR_SGE
, 1, 2 },
418 { "vec4_sgt", IR_SGT
, 1, 2 },
419 { "vec4_sle", IR_SLE
, 1, 2 },
420 { "vec4_slt", IR_SLT
, 1, 2 },
422 { "vec4_floor", IR_FLOOR
, 1, 1 },
423 { "vec4_frac", IR_FRAC
, 1, 1 },
424 { "vec4_abs", IR_ABS
, 1, 1 },
425 { "vec4_negate", IR_NEG
, 1, 1 },
426 { "vec4_ddx", IR_DDX
, 1, 1 },
427 { "vec4_ddy", IR_DDY
, 1, 1 },
428 /* float binary op */
429 { "float_power", IR_POW
, 1, 2 },
430 /* texture / sampler */
431 { "vec4_tex1d", IR_TEX
, 1, 2 },
432 { "vec4_texb1d", IR_TEXB
, 1, 2 }, /* 1d w/ bias */
433 { "vec4_texp1d", IR_TEXP
, 1, 2 }, /* 1d w/ projection */
434 { "vec4_tex2d", IR_TEX
, 1, 2 },
435 { "vec4_texb2d", IR_TEXB
, 1, 2 }, /* 2d w/ bias */
436 { "vec4_texp2d", IR_TEXP
, 1, 2 }, /* 2d w/ projection */
437 { "vec4_tex3d", IR_TEX
, 1, 2 },
438 { "vec4_texb3d", IR_TEXB
, 1, 2 }, /* 3d w/ bias */
439 { "vec4_texp3d", IR_TEXP
, 1, 2 }, /* 3d w/ projection */
440 { "vec4_texcube", IR_TEX
, 1, 2 }, /* cubemap */
441 { "vec4_tex_rect", IR_TEX
, 1, 2 }, /* rectangle */
442 { "vec4_texp_rect", IR_TEX
, 1, 2 },/* rectangle w/ projection */
445 { "int_to_float", IR_I_TO_F
, 1, 1 },
446 { "float_to_int", IR_F_TO_I
, 1, 1 },
447 { "float_exp", IR_EXP
, 1, 1 },
448 { "float_exp2", IR_EXP2
, 1, 1 },
449 { "float_log2", IR_LOG2
, 1, 1 },
450 { "float_rsq", IR_RSQ
, 1, 1 },
451 { "float_rcp", IR_RCP
, 1, 1 },
452 { "float_sine", IR_SIN
, 1, 1 },
453 { "float_cosine", IR_COS
, 1, 1 },
454 { "float_noise1", IR_NOISE1
, 1, 1},
455 { "float_noise2", IR_NOISE2
, 1, 1},
456 { "float_noise3", IR_NOISE3
, 1, 1},
457 { "float_noise4", IR_NOISE4
, 1, 1},
459 { NULL
, IR_NOP
, 0, 0 }
463 static slang_ir_node
*
464 new_node3(slang_ir_opcode op
,
465 slang_ir_node
*c0
, slang_ir_node
*c1
, slang_ir_node
*c2
)
467 slang_ir_node
*n
= (slang_ir_node
*) _slang_alloc(sizeof(slang_ir_node
));
473 n
->Writemask
= WRITEMASK_XYZW
;
474 n
->InstLocation
= -1;
479 static slang_ir_node
*
480 new_node2(slang_ir_opcode op
, slang_ir_node
*c0
, slang_ir_node
*c1
)
482 return new_node3(op
, c0
, c1
, NULL
);
485 static slang_ir_node
*
486 new_node1(slang_ir_opcode op
, slang_ir_node
*c0
)
488 return new_node3(op
, c0
, NULL
, NULL
);
491 static slang_ir_node
*
492 new_node0(slang_ir_opcode op
)
494 return new_node3(op
, NULL
, NULL
, NULL
);
498 static slang_ir_node
*
499 new_seq(slang_ir_node
*left
, slang_ir_node
*right
)
505 return new_node2(IR_SEQ
, left
, right
);
508 static slang_ir_node
*
509 new_label(slang_label
*label
)
511 slang_ir_node
*n
= new_node0(IR_LABEL
);
518 static slang_ir_node
*
519 new_float_literal(const float v
[4], GLuint size
)
521 slang_ir_node
*n
= new_node0(IR_FLOAT
);
523 COPY_4V(n
->Value
, v
);
524 /* allocate a storage object, but compute actual location (Index) later */
525 n
->Store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, size
);
530 static slang_ir_node
*
531 new_not(slang_ir_node
*n
)
533 return new_node1(IR_NOT
, n
);
538 * Inlined subroutine.
540 static slang_ir_node
*
541 new_inlined_function_call(slang_ir_node
*code
, slang_label
*name
)
543 slang_ir_node
*n
= new_node1(IR_CALL
, code
);
552 * Unconditional jump.
554 static slang_ir_node
*
555 new_return(slang_label
*dest
)
557 slang_ir_node
*n
= new_node0(IR_RETURN
);
565 static slang_ir_node
*
566 new_loop(slang_ir_node
*body
)
568 return new_node1(IR_LOOP
, body
);
572 static slang_ir_node
*
573 new_break(slang_ir_node
*loopNode
)
575 slang_ir_node
*n
= new_node0(IR_BREAK
);
577 assert(loopNode
->Opcode
== IR_LOOP
);
579 /* insert this node at head of linked list */
580 n
->List
= loopNode
->List
;
588 * Make new IR_BREAK_IF_TRUE.
590 static slang_ir_node
*
591 new_break_if_true(slang_ir_node
*loopNode
, slang_ir_node
*cond
)
595 assert(loopNode
->Opcode
== IR_LOOP
);
596 n
= new_node1(IR_BREAK_IF_TRUE
, cond
);
598 /* insert this node at head of linked list */
599 n
->List
= loopNode
->List
;
607 * Make new IR_CONT_IF_TRUE node.
609 static slang_ir_node
*
610 new_cont_if_true(slang_ir_node
*loopNode
, slang_ir_node
*cond
)
614 assert(loopNode
->Opcode
== IR_LOOP
);
615 n
= new_node1(IR_CONT_IF_TRUE
, cond
);
617 /* insert this node at head of linked list */
618 n
->List
= loopNode
->List
;
625 static slang_ir_node
*
626 new_cond(slang_ir_node
*n
)
628 slang_ir_node
*c
= new_node1(IR_COND
, n
);
633 static slang_ir_node
*
634 new_if(slang_ir_node
*cond
, slang_ir_node
*ifPart
, slang_ir_node
*elsePart
)
636 return new_node3(IR_IF
, cond
, ifPart
, elsePart
);
641 * New IR_VAR node - a reference to a previously declared variable.
643 static slang_ir_node
*
644 new_var(slang_assemble_ctx
*A
, slang_operation
*oper
, slang_atom name
)
647 slang_variable
*var
= _slang_locate_variable(oper
->locals
, name
, GL_TRUE
);
651 assert(!oper
->var
|| oper
->var
== var
);
653 n
= new_node0(IR_VAR
);
655 _slang_attach_storage(n
, var
);
662 * Check if the given function is really just a wrapper for a
663 * basic assembly instruction.
666 slang_is_asm_function(const slang_function
*fun
)
668 if (fun
->body
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
&&
669 fun
->body
->num_children
== 1 &&
670 fun
->body
->children
[0].type
== SLANG_OPER_ASM
) {
678 _slang_is_noop(const slang_operation
*oper
)
681 oper
->type
== SLANG_OPER_VOID
||
682 (oper
->num_children
== 1 && oper
->children
[0].type
== SLANG_OPER_VOID
))
690 * Recursively search tree for a node of the given type.
692 static slang_operation
*
693 _slang_find_node_type(slang_operation
*oper
, slang_operation_type type
)
696 if (oper
->type
== type
)
698 for (i
= 0; i
< oper
->num_children
; i
++) {
699 slang_operation
*p
= _slang_find_node_type(&oper
->children
[i
], type
);
708 slang_resolve_variable(slang_operation
*oper
)
710 if (oper
->type
== SLANG_OPER_IDENTIFIER
&& !oper
->var
) {
711 oper
->var
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
717 * Replace particular variables (SLANG_OPER_IDENTIFIER) with new expressions.
720 slang_substitute(slang_assemble_ctx
*A
, slang_operation
*oper
,
721 GLuint substCount
, slang_variable
**substOld
,
722 slang_operation
**substNew
, GLboolean isLHS
)
724 switch (oper
->type
) {
725 case SLANG_OPER_VARIABLE_DECL
:
727 slang_variable
*v
= _slang_locate_variable(oper
->locals
,
728 oper
->a_id
, GL_TRUE
);
730 if (v
->initializer
&& oper
->num_children
== 0) {
731 /* set child of oper to copy of initializer */
732 oper
->num_children
= 1;
733 oper
->children
= slang_operation_new(1);
734 slang_operation_copy(&oper
->children
[0], v
->initializer
);
736 if (oper
->num_children
== 1) {
737 /* the initializer */
738 slang_substitute(A
, &oper
->children
[0], substCount
,
739 substOld
, substNew
, GL_FALSE
);
743 case SLANG_OPER_IDENTIFIER
:
744 assert(oper
->num_children
== 0);
745 if (1/**!isLHS XXX FIX */) {
746 slang_atom id
= oper
->a_id
;
749 v
= _slang_locate_variable(oper
->locals
, id
, GL_TRUE
);
751 _mesa_problem(NULL
, "var %s not found!\n", (char *) oper
->a_id
);
755 /* look for a substitution */
756 for (i
= 0; i
< substCount
; i
++) {
757 if (v
== substOld
[i
]) {
758 /* OK, replace this SLANG_OPER_IDENTIFIER with a new expr */
759 #if 0 /* DEBUG only */
760 if (substNew
[i
]->type
== SLANG_OPER_IDENTIFIER
) {
761 assert(substNew
[i
]->var
);
762 assert(substNew
[i
]->var
->a_name
);
763 printf("Substitute %s with %s in id node %p\n",
764 (char*)v
->a_name
, (char*) substNew
[i
]->var
->a_name
,
768 printf("Substitute %s with %f in id node %p\n",
769 (char*)v
->a_name
, substNew
[i
]->literal
[0],
773 slang_operation_copy(oper
, substNew
[i
]);
780 case SLANG_OPER_RETURN
:
781 /* do return replacement here too */
782 assert(oper
->num_children
== 0 || oper
->num_children
== 1);
783 if (oper
->num_children
== 1 && !_slang_is_noop(&oper
->children
[0])) {
789 * then do substitutions on the assignment.
791 slang_operation
*blockOper
, *assignOper
, *returnOper
;
793 /* check if function actually has a return type */
794 assert(A
->CurFunction
);
795 if (A
->CurFunction
->header
.type
.specifier
.type
== SLANG_SPEC_VOID
) {
796 slang_info_log_error(A
->log
, "illegal return expression");
800 blockOper
= slang_operation_new(1);
801 blockOper
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
;
802 blockOper
->num_children
= 2;
803 blockOper
->locals
->outer_scope
= oper
->locals
->outer_scope
;
804 blockOper
->children
= slang_operation_new(2);
805 assignOper
= blockOper
->children
+ 0;
806 returnOper
= blockOper
->children
+ 1;
808 assignOper
->type
= SLANG_OPER_ASSIGN
;
809 assignOper
->num_children
= 2;
810 assignOper
->locals
->outer_scope
= blockOper
->locals
;
811 assignOper
->children
= slang_operation_new(2);
812 assignOper
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
813 assignOper
->children
[0].a_id
= slang_atom_pool_atom(A
->atoms
, "__retVal");
814 assignOper
->children
[0].locals
->outer_scope
= assignOper
->locals
;
816 slang_operation_copy(&assignOper
->children
[1],
819 returnOper
->type
= SLANG_OPER_RETURN
; /* return w/ no value */
820 assert(returnOper
->num_children
== 0);
822 /* do substitutions on the "__retVal = expr" sub-tree */
823 slang_substitute(A
, assignOper
,
824 substCount
, substOld
, substNew
, GL_FALSE
);
826 /* install new code */
827 slang_operation_copy(oper
, blockOper
);
828 slang_operation_destruct(blockOper
);
831 /* check if return value was expected */
832 assert(A
->CurFunction
);
833 if (A
->CurFunction
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
834 slang_info_log_error(A
->log
, "return statement requires an expression");
840 case SLANG_OPER_ASSIGN
:
841 case SLANG_OPER_SUBSCRIPT
:
843 * child[0] can't have substitutions but child[1] can.
845 slang_substitute(A
, &oper
->children
[0],
846 substCount
, substOld
, substNew
, GL_TRUE
);
847 slang_substitute(A
, &oper
->children
[1],
848 substCount
, substOld
, substNew
, GL_FALSE
);
850 case SLANG_OPER_FIELD
:
852 slang_substitute(A
, &oper
->children
[0],
853 substCount
, substOld
, substNew
, GL_TRUE
);
858 for (i
= 0; i
< oper
->num_children
; i
++)
859 slang_substitute(A
, &oper
->children
[i
],
860 substCount
, substOld
, substNew
, GL_FALSE
);
868 * Produce inline code for a call to an assembly instruction.
869 * This is typically used to compile a call to a built-in function like this:
871 * vec4 mix(const vec4 x, const vec4 y, const vec4 a)
873 * __asm vec4_lrp __retVal, a, y, x;
876 * We basically translate a SLANG_OPER_CALL into a SLANG_OPER_ASM.
878 static slang_operation
*
879 slang_inline_asm_function(slang_assemble_ctx
*A
,
880 slang_function
*fun
, slang_operation
*oper
)
882 const GLuint numArgs
= oper
->num_children
;
884 slang_operation
*inlined
;
885 const GLboolean haveRetValue
= _slang_function_has_return_value(fun
);
886 slang_variable
**substOld
;
887 slang_operation
**substNew
;
889 ASSERT(slang_is_asm_function(fun
));
890 ASSERT(fun
->param_count
== numArgs
+ haveRetValue
);
893 printf("Inline %s as %s\n",
894 (char*) fun->header.a_name,
895 (char*) fun->body->children[0].a_id);
899 * We'll substitute formal params with actual args in the asm call.
901 substOld
= (slang_variable
**)
902 _slang_alloc(numArgs
* sizeof(slang_variable
*));
903 substNew
= (slang_operation
**)
904 _slang_alloc(numArgs
* sizeof(slang_operation
*));
905 for (i
= 0; i
< numArgs
; i
++) {
906 substOld
[i
] = fun
->parameters
->variables
[i
];
907 substNew
[i
] = oper
->children
+ i
;
910 /* make a copy of the code to inline */
911 inlined
= slang_operation_new(1);
912 slang_operation_copy(inlined
, &fun
->body
->children
[0]);
914 /* get rid of the __retVal child */
915 for (i
= 0; i
< numArgs
; i
++) {
916 inlined
->children
[i
] = inlined
->children
[i
+ 1];
918 inlined
->num_children
--;
921 /* now do formal->actual substitutions */
922 slang_substitute(A
, inlined
, numArgs
, substOld
, substNew
, GL_FALSE
);
924 _slang_free(substOld
);
925 _slang_free(substNew
);
932 * Inline the given function call operation.
933 * Return a new slang_operation that corresponds to the inlined code.
935 static slang_operation
*
936 slang_inline_function_call(slang_assemble_ctx
* A
, slang_function
*fun
,
937 slang_operation
*oper
, slang_operation
*returnOper
)
944 ParamMode
*paramMode
;
945 const GLboolean haveRetValue
= _slang_function_has_return_value(fun
);
946 const GLuint numArgs
= oper
->num_children
;
947 const GLuint totalArgs
= numArgs
+ haveRetValue
;
948 slang_operation
*args
= oper
->children
;
949 slang_operation
*inlined
, *top
;
950 slang_variable
**substOld
;
951 slang_operation
**substNew
;
952 GLuint substCount
, numCopyIn
, i
;
953 slang_function
*prevFunction
;
956 prevFunction
= A
->CurFunction
;
957 A
->CurFunction
= fun
;
959 /*assert(oper->type == SLANG_OPER_CALL); (or (matrix) multiply, etc) */
960 assert(fun
->param_count
== totalArgs
);
962 /* allocate temporary arrays */
963 paramMode
= (ParamMode
*)
964 _slang_alloc(totalArgs
* sizeof(ParamMode
));
965 substOld
= (slang_variable
**)
966 _slang_alloc(totalArgs
* sizeof(slang_variable
*));
967 substNew
= (slang_operation
**)
968 _slang_alloc(totalArgs
* sizeof(slang_operation
*));
971 printf("Inline call to %s (total vars=%d nparams=%d)\n",
972 (char *) fun
->header
.a_name
,
973 fun
->parameters
->num_variables
, numArgs
);
976 if (haveRetValue
&& !returnOper
) {
977 /* Create 3-child comma sequence for inlined code:
978 * child[0]: declare __resultTmp
979 * child[1]: inlined function body
980 * child[2]: __resultTmp
982 slang_operation
*commaSeq
;
983 slang_operation
*declOper
= NULL
;
984 slang_variable
*resultVar
;
986 commaSeq
= slang_operation_new(1);
987 commaSeq
->type
= SLANG_OPER_SEQUENCE
;
988 assert(commaSeq
->locals
);
989 commaSeq
->locals
->outer_scope
= oper
->locals
->outer_scope
;
990 commaSeq
->num_children
= 3;
991 commaSeq
->children
= slang_operation_new(3);
992 /* allocate the return var */
993 resultVar
= slang_variable_scope_grow(commaSeq
->locals
);
995 printf("Alloc __resultTmp in scope %p for retval of calling %s\n",
996 (void*)commaSeq->locals, (char *) fun->header.a_name);
999 resultVar
->a_name
= slang_atom_pool_atom(A
->atoms
, "__resultTmp");
1000 resultVar
->type
= fun
->header
.type
; /* XXX copy? */
1001 resultVar
->isTemp
= GL_TRUE
;
1003 /* child[0] = __resultTmp declaration */
1004 declOper
= &commaSeq
->children
[0];
1005 declOper
->type
= SLANG_OPER_VARIABLE_DECL
;
1006 declOper
->a_id
= resultVar
->a_name
;
1007 declOper
->locals
->outer_scope
= commaSeq
->locals
;
1009 /* child[1] = function body */
1010 inlined
= &commaSeq
->children
[1];
1011 inlined
->locals
->outer_scope
= commaSeq
->locals
;
1013 /* child[2] = __resultTmp reference */
1014 returnOper
= &commaSeq
->children
[2];
1015 returnOper
->type
= SLANG_OPER_IDENTIFIER
;
1016 returnOper
->a_id
= resultVar
->a_name
;
1017 returnOper
->locals
->outer_scope
= commaSeq
->locals
;
1022 top
= inlined
= slang_operation_new(1);
1023 /* XXXX this may be inappropriate!!!! */
1024 inlined
->locals
->outer_scope
= oper
->locals
->outer_scope
;
1028 assert(inlined
->locals
);
1030 /* Examine the parameters, look for inout/out params, look for possible
1031 * substitutions, etc:
1032 * param type behaviour
1033 * in copy actual to local
1034 * const in substitute param with actual
1038 for (i
= 0; i
< totalArgs
; i
++) {
1039 slang_variable
*p
= fun
->parameters
->variables
[i
];
1041 printf("Param %d: %s %s \n", i,
1042 slang_type_qual_string(p->type.qualifier),
1043 (char *) p->a_name);
1045 if (p
->type
.qualifier
== SLANG_QUAL_INOUT
||
1046 p
->type
.qualifier
== SLANG_QUAL_OUT
) {
1047 /* an output param */
1048 slang_operation
*arg
;
1053 paramMode
[i
] = SUBST
;
1055 if (arg
->type
== SLANG_OPER_IDENTIFIER
)
1056 slang_resolve_variable(arg
);
1058 /* replace parameter 'p' with argument 'arg' */
1059 substOld
[substCount
] = p
;
1060 substNew
[substCount
] = arg
; /* will get copied */
1063 else if (p
->type
.qualifier
== SLANG_QUAL_CONST
) {
1064 /* a constant input param */
1065 if (args
[i
].type
== SLANG_OPER_IDENTIFIER
||
1066 args
[i
].type
== SLANG_OPER_LITERAL_FLOAT
) {
1067 /* replace all occurances of this parameter variable with the
1068 * actual argument variable or a literal.
1070 paramMode
[i
] = SUBST
;
1071 slang_resolve_variable(&args
[i
]);
1072 substOld
[substCount
] = p
;
1073 substNew
[substCount
] = &args
[i
]; /* will get copied */
1077 paramMode
[i
] = COPY_IN
;
1081 paramMode
[i
] = COPY_IN
;
1083 assert(paramMode
[i
]);
1086 /* actual code inlining: */
1087 slang_operation_copy(inlined
, fun
->body
);
1089 /*** XXX review this */
1090 assert(inlined
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
);
1091 inlined
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
;
1094 printf("======================= orig body code ======================\n");
1095 printf("=== params scope = %p\n", (void*) fun
->parameters
);
1096 slang_print_tree(fun
->body
, 8);
1097 printf("======================= copied code =========================\n");
1098 slang_print_tree(inlined
, 8);
1101 /* do parameter substitution in inlined code: */
1102 slang_substitute(A
, inlined
, substCount
, substOld
, substNew
, GL_FALSE
);
1105 printf("======================= subst code ==========================\n");
1106 slang_print_tree(inlined
, 8);
1107 printf("=============================================================\n");
1110 /* New prolog statements: (inserted before the inlined code)
1111 * Copy the 'in' arguments.
1114 for (i
= 0; i
< numArgs
; i
++) {
1115 if (paramMode
[i
] == COPY_IN
) {
1116 slang_variable
*p
= fun
->parameters
->variables
[i
];
1117 /* declare parameter 'p' */
1118 slang_operation
*decl
= slang_operation_insert(&inlined
->num_children
,
1122 printf("COPY_IN %s from expr\n", (char*)p->a_name);
1124 decl
->type
= SLANG_OPER_VARIABLE_DECL
;
1125 assert(decl
->locals
);
1126 decl
->locals
->outer_scope
= inlined
->locals
;
1127 decl
->a_id
= p
->a_name
;
1128 decl
->num_children
= 1;
1129 decl
->children
= slang_operation_new(1);
1131 /* child[0] is the var's initializer */
1132 slang_operation_copy(&decl
->children
[0], args
+ i
);
1138 /* New epilog statements:
1139 * 1. Create end of function label to jump to from return statements.
1140 * 2. Copy the 'out' parameter vars
1143 slang_operation
*lab
= slang_operation_insert(&inlined
->num_children
,
1145 inlined
->num_children
);
1146 lab
->type
= SLANG_OPER_LABEL
;
1147 lab
->label
= A
->curFuncEndLabel
;
1150 for (i
= 0; i
< totalArgs
; i
++) {
1151 if (paramMode
[i
] == COPY_OUT
) {
1152 const slang_variable
*p
= fun
->parameters
->variables
[i
];
1153 /* actualCallVar = outParam */
1154 /*if (i > 0 || !haveRetValue)*/
1155 slang_operation
*ass
= slang_operation_insert(&inlined
->num_children
,
1157 inlined
->num_children
);
1158 ass
->type
= SLANG_OPER_ASSIGN
;
1159 ass
->num_children
= 2;
1160 ass
->locals
->outer_scope
= inlined
->locals
;
1161 ass
->children
= slang_operation_new(2);
1162 ass
->children
[0] = args
[i
]; /*XXX copy */
1163 ass
->children
[1].type
= SLANG_OPER_IDENTIFIER
;
1164 ass
->children
[1].a_id
= p
->a_name
;
1165 ass
->children
[1].locals
->outer_scope
= ass
->locals
;
1169 _slang_free(paramMode
);
1170 _slang_free(substOld
);
1171 _slang_free(substNew
);
1174 printf("Done Inline call to %s (total vars=%d nparams=%d)\n",
1175 (char *) fun
->header
.a_name
,
1176 fun
->parameters
->num_variables
, numArgs
);
1177 slang_print_tree(top
, 0);
1181 A
->CurFunction
= prevFunction
;
1187 static slang_ir_node
*
1188 _slang_gen_function_call(slang_assemble_ctx
*A
, slang_function
*fun
,
1189 slang_operation
*oper
, slang_operation
*dest
)
1192 slang_operation
*inlined
;
1193 slang_label
*prevFuncEndLabel
;
1196 prevFuncEndLabel
= A
->curFuncEndLabel
;
1197 sprintf(name
, "__endOfFunc_%s_", (char *) fun
->header
.a_name
);
1198 A
->curFuncEndLabel
= _slang_label_new(name
);
1199 assert(A
->curFuncEndLabel
);
1201 if (slang_is_asm_function(fun
) && !dest
) {
1202 /* assemble assembly function - tree style */
1203 inlined
= slang_inline_asm_function(A
, fun
, oper
);
1206 /* non-assembly function */
1207 inlined
= slang_inline_function_call(A
, fun
, oper
, dest
);
1208 if (inlined
&& _slang_find_node_type(inlined
, SLANG_OPER_RETURN
)) {
1209 slang_operation
*callOper
;
1210 /* The function we're calling has one or more 'return' statements.
1211 * So, we can't truly inline this function because we need to
1212 * implement 'return' with RET (and CAL).
1213 * Nevertheless, we performed "inlining" to make a new instance
1214 * of the function body to deal with static register allocation.
1216 * XXX check if there's one 'return' and if it's the very last
1217 * statement in the function - we can optimize that case.
1219 assert(inlined
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
||
1220 inlined
->type
== SLANG_OPER_SEQUENCE
);
1221 if (_slang_function_has_return_value(fun
) && !dest
) {
1222 assert(inlined
->children
[0].type
== SLANG_OPER_VARIABLE_DECL
);
1223 assert(inlined
->children
[2].type
== SLANG_OPER_IDENTIFIER
);
1224 callOper
= &inlined
->children
[1];
1229 callOper
->type
= SLANG_OPER_INLINED_CALL
;
1230 callOper
->fun
= fun
;
1231 callOper
->label
= _slang_label_new_unique((char*) fun
->header
.a_name
);
1238 /* Replace the function call with the inlined block */
1239 slang_operation_destruct(oper
);
1241 _slang_free(inlined
);
1244 assert(inlined
->locals
);
1245 printf("*** Inlined code for call to %s:\n",
1246 (char*) fun
->header
.a_name
);
1247 slang_print_tree(oper
, 10);
1251 n
= _slang_gen_operation(A
, oper
);
1253 /*_slang_label_delete(A->curFuncEndLabel);*/
1254 A
->curFuncEndLabel
= prevFuncEndLabel
;
1260 static slang_asm_info
*
1261 slang_find_asm_info(const char *name
)
1264 for (i
= 0; AsmInfo
[i
].Name
; i
++) {
1265 if (_mesa_strcmp(AsmInfo
[i
].Name
, name
) == 0) {
1274 make_writemask(const char *field
)
1282 mask
|= WRITEMASK_X
;
1287 mask
|= WRITEMASK_Y
;
1292 mask
|= WRITEMASK_Z
;
1297 mask
|= WRITEMASK_W
;
1300 _mesa_problem(NULL
, "invalid writemask in make_writemask()");
1306 return WRITEMASK_XYZW
;
1313 * Generate IR tree for an asm instruction/operation such as:
1314 * __asm vec4_dot __retVal.x, v1, v2;
1316 static slang_ir_node
*
1317 _slang_gen_asm(slang_assemble_ctx
*A
, slang_operation
*oper
,
1318 slang_operation
*dest
)
1320 const slang_asm_info
*info
;
1321 slang_ir_node
*kids
[3], *n
;
1322 GLuint j
, firstOperand
;
1324 assert(oper
->type
== SLANG_OPER_ASM
);
1326 info
= slang_find_asm_info((char *) oper
->a_id
);
1328 _mesa_problem(NULL
, "undefined __asm function %s\n",
1329 (char *) oper
->a_id
);
1332 assert(info
->NumParams
<= 3);
1334 if (info
->NumParams
== oper
->num_children
) {
1335 /* Storage for result is not specified.
1336 * Children[0], [1] are the operands.
1341 /* Storage for result (child[0]) is specified.
1342 * Children[1], [2] are the operands.
1347 /* assemble child(ren) */
1348 kids
[0] = kids
[1] = kids
[2] = NULL
;
1349 for (j
= 0; j
< info
->NumParams
; j
++) {
1350 kids
[j
] = _slang_gen_operation(A
, &oper
->children
[firstOperand
+ j
]);
1355 n
= new_node3(info
->Opcode
, kids
[0], kids
[1], kids
[2]);
1358 /* Setup n->Store to be a particular location. Otherwise, storage
1359 * for the result (a temporary) will be allocated later.
1361 GLuint writemask
= WRITEMASK_XYZW
;
1362 slang_operation
*dest_oper
;
1365 dest_oper
= &oper
->children
[0];
1366 while (dest_oper
->type
== SLANG_OPER_FIELD
) {
1368 writemask
&= make_writemask((char*) dest_oper
->a_id
);
1369 dest_oper
= &dest_oper
->children
[0];
1372 n0
= _slang_gen_operation(A
, dest_oper
);
1376 n
->Store
= n0
->Store
;
1377 n
->Writemask
= writemask
;
1387 print_funcs(struct slang_function_scope_
*scope
, const char *name
)
1390 for (i
= 0; i
< scope
->num_functions
; i
++) {
1391 slang_function
*f
= &scope
->functions
[i
];
1392 if (!name
|| strcmp(name
, (char*) f
->header
.a_name
) == 0)
1393 printf(" %s (%d args)\n", name
, f
->param_count
);
1396 if (scope
->outer_scope
)
1397 print_funcs(scope
->outer_scope
, name
);
1402 * Return first function in the scope that has the given name.
1403 * This is the function we'll try to call when there is no exact match
1404 * between function parameters and call arguments.
1406 * XXX we should really create a list of candidate functions and try
1409 static slang_function
*
1410 _slang_first_function(struct slang_function_scope_
*scope
, const char *name
)
1413 for (i
= 0; i
< scope
->num_functions
; i
++) {
1414 slang_function
*f
= &scope
->functions
[i
];
1415 if (strcmp(name
, (char*) f
->header
.a_name
) == 0)
1418 if (scope
->outer_scope
)
1419 return _slang_first_function(scope
->outer_scope
, name
);
1426 * Assemble a function call, given a particular function name.
1427 * \param name the function's name (operators like '*' are possible).
1429 static slang_ir_node
*
1430 _slang_gen_function_call_name(slang_assemble_ctx
*A
, const char *name
,
1431 slang_operation
*oper
, slang_operation
*dest
)
1433 slang_operation
*params
= oper
->children
;
1434 const GLuint param_count
= oper
->num_children
;
1436 slang_function
*fun
;
1438 atom
= slang_atom_pool_atom(A
->atoms
, name
);
1439 if (atom
== SLANG_ATOM_NULL
)
1443 * Use 'name' to find the function to call
1445 fun
= _slang_locate_function(A
->space
.funcs
, atom
, params
, param_count
,
1446 &A
->space
, A
->atoms
, A
->log
);
1448 /* A function with exactly the right parameters/types was not found.
1449 * Try adapting the parameters.
1451 fun
= _slang_first_function(A
->space
.funcs
, name
);
1452 if (!fun
|| !_slang_adapt_call(oper
, fun
, &A
->space
, A
->atoms
, A
->log
)) {
1453 slang_info_log_error(A
->log
, "Function '%s' not found (check argument types)", name
);
1459 return _slang_gen_function_call(A
, fun
, oper
, dest
);
1464 _slang_is_constant_cond(const slang_operation
*oper
, GLboolean
*value
)
1466 if (oper
->type
== SLANG_OPER_LITERAL_FLOAT
||
1467 oper
->type
== SLANG_OPER_LITERAL_INT
||
1468 oper
->type
== SLANG_OPER_LITERAL_BOOL
) {
1469 if (oper
->literal
[0])
1475 else if (oper
->type
== SLANG_OPER_EXPRESSION
&&
1476 oper
->num_children
== 1) {
1477 return _slang_is_constant_cond(&oper
->children
[0], value
);
1484 * Test if an operation is a scalar or boolean.
1487 _slang_is_scalar_or_boolean(slang_assemble_ctx
*A
, slang_operation
*oper
)
1489 slang_typeinfo type
;
1492 slang_typeinfo_construct(&type
);
1493 _slang_typeof_operation(A
, oper
, &type
);
1494 size
= _slang_sizeof_type_specifier(&type
.spec
);
1495 slang_typeinfo_destruct(&type
);
1501 * Generate loop code using high-level IR_LOOP instruction
1503 static slang_ir_node
*
1504 _slang_gen_while(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1508 * BREAK if !expr (child[0])
1509 * body code (child[1])
1511 slang_ir_node
*prevLoop
, *loop
, *breakIf
, *body
;
1512 GLboolean isConst
, constTrue
;
1514 /* type-check expression */
1515 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
1516 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'while'");
1520 /* Check if loop condition is a constant */
1521 isConst
= _slang_is_constant_cond(&oper
->children
[0], &constTrue
);
1523 if (isConst
&& !constTrue
) {
1524 /* loop is never executed! */
1525 return new_node0(IR_NOP
);
1528 loop
= new_loop(NULL
);
1530 /* save old, push new loop */
1531 prevLoop
= A
->CurLoop
;
1534 if (isConst
&& constTrue
) {
1535 /* while(nonzero constant), no conditional break */
1540 = new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[0])));
1541 breakIf
= new_break_if_true(A
->CurLoop
, cond
);
1543 body
= _slang_gen_operation(A
, &oper
->children
[1]);
1544 loop
->Children
[0] = new_seq(breakIf
, body
);
1546 /* Do infinite loop detection */
1547 /* loop->List is head of linked list of break/continue nodes */
1548 if (!loop
->List
&& isConst
&& constTrue
) {
1549 /* infinite loop detected */
1550 A
->CurLoop
= prevLoop
; /* clean-up */
1551 slang_info_log_error(A
->log
, "Infinite loop detected!");
1555 /* pop loop, restore prev */
1556 A
->CurLoop
= prevLoop
;
1563 * Generate IR tree for a do-while loop using high-level LOOP, IF instructions.
1565 static slang_ir_node
*
1566 _slang_gen_do(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1570 * body code (child[0])
1572 * BREAK if !expr (child[1])
1574 slang_ir_node
*prevLoop
, *loop
;
1575 GLboolean isConst
, constTrue
;
1577 /* type-check expression */
1578 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[1])) {
1579 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'do/while'");
1583 loop
= new_loop(NULL
);
1585 /* save old, push new loop */
1586 prevLoop
= A
->CurLoop
;
1590 loop
->Children
[0] = _slang_gen_operation(A
, &oper
->children
[0]);
1592 /* Check if loop condition is a constant */
1593 isConst
= _slang_is_constant_cond(&oper
->children
[1], &constTrue
);
1594 if (isConst
&& constTrue
) {
1595 /* do { } while(1) ==> no conditional break */
1596 loop
->Children
[1] = NULL
; /* no tail code */
1600 = new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[1])));
1601 loop
->Children
[1] = new_break_if_true(A
->CurLoop
, cond
);
1604 /* XXX we should do infinite loop detection, as above */
1606 /* pop loop, restore prev */
1607 A
->CurLoop
= prevLoop
;
1614 * Generate for-loop using high-level IR_LOOP instruction.
1616 static slang_ir_node
*
1617 _slang_gen_for(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1620 * init code (child[0])
1622 * BREAK if !expr (child[1])
1623 * body code (child[3])
1625 * incr code (child[2]) // XXX continue here
1627 slang_ir_node
*prevLoop
, *loop
, *cond
, *breakIf
, *body
, *init
, *incr
;
1629 init
= _slang_gen_operation(A
, &oper
->children
[0]);
1630 loop
= new_loop(NULL
);
1632 /* save old, push new loop */
1633 prevLoop
= A
->CurLoop
;
1636 cond
= new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[1])));
1637 breakIf
= new_break_if_true(A
->CurLoop
, cond
);
1638 body
= _slang_gen_operation(A
, &oper
->children
[3]);
1639 incr
= _slang_gen_operation(A
, &oper
->children
[2]);
1641 loop
->Children
[0] = new_seq(breakIf
, body
);
1642 loop
->Children
[1] = incr
; /* tail code */
1644 /* pop loop, restore prev */
1645 A
->CurLoop
= prevLoop
;
1647 return new_seq(init
, loop
);
1651 static slang_ir_node
*
1652 _slang_gen_continue(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1654 slang_ir_node
*n
, *loopNode
;
1655 assert(oper
->type
== SLANG_OPER_CONTINUE
);
1656 loopNode
= A
->CurLoop
;
1658 assert(loopNode
->Opcode
== IR_LOOP
);
1659 n
= new_node0(IR_CONT
);
1661 n
->Parent
= loopNode
;
1662 /* insert this node at head of linked list */
1663 n
->List
= loopNode
->List
;
1671 * Determine if the given operation is of a specific type.
1674 is_operation_type(const slang_operation
*oper
, slang_operation_type type
)
1676 if (oper
->type
== type
)
1678 else if ((oper
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
||
1679 oper
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
) &&
1680 oper
->num_children
== 1)
1681 return is_operation_type(&oper
->children
[0], type
);
1688 * Generate IR tree for an if/then/else conditional using high-level
1689 * IR_IF instruction.
1691 static slang_ir_node
*
1692 _slang_gen_if(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1695 * eval expr (child[0])
1702 const GLboolean haveElseClause
= !_slang_is_noop(&oper
->children
[2]);
1703 slang_ir_node
*ifNode
, *cond
, *ifBody
, *elseBody
;
1704 GLboolean isConst
, constTrue
;
1706 /* type-check expression */
1707 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
1708 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'if'");
1712 isConst
= _slang_is_constant_cond(&oper
->children
[0], &constTrue
);
1716 return _slang_gen_operation(A
, &oper
->children
[1]);
1719 /* if (false) ... */
1720 return _slang_gen_operation(A
, &oper
->children
[2]);
1724 cond
= _slang_gen_operation(A
, &oper
->children
[0]);
1725 cond
= new_cond(cond
);
1727 if (is_operation_type(&oper
->children
[1], SLANG_OPER_BREAK
)) {
1728 /* Special case: generate a conditional break */
1729 ifBody
= new_break_if_true(A
->CurLoop
, cond
);
1730 if (haveElseClause
) {
1731 elseBody
= _slang_gen_operation(A
, &oper
->children
[2]);
1732 return new_seq(ifBody
, elseBody
);
1736 else if (is_operation_type(&oper
->children
[1], SLANG_OPER_CONTINUE
)) {
1737 /* Special case: generate a conditional break */
1738 ifBody
= new_cont_if_true(A
->CurLoop
, cond
);
1739 if (haveElseClause
) {
1740 elseBody
= _slang_gen_operation(A
, &oper
->children
[2]);
1741 return new_seq(ifBody
, elseBody
);
1747 ifBody
= _slang_gen_operation(A
, &oper
->children
[1]);
1749 elseBody
= _slang_gen_operation(A
, &oper
->children
[2]);
1752 ifNode
= new_if(cond
, ifBody
, elseBody
);
1759 static slang_ir_node
*
1760 _slang_gen_not(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1764 assert(oper
->type
== SLANG_OPER_NOT
);
1766 /* type-check expression */
1767 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
1768 slang_info_log_error(A
->log
,
1769 "scalar/boolean expression expected for '!'");
1773 n
= _slang_gen_operation(A
, &oper
->children
[0]);
1781 static slang_ir_node
*
1782 _slang_gen_xor(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1784 slang_ir_node
*n1
, *n2
;
1786 assert(oper
->type
== SLANG_OPER_LOGICALXOR
);
1788 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0]) ||
1789 !_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
1790 slang_info_log_error(A
->log
,
1791 "scalar/boolean expressions expected for '^^'");
1795 n1
= _slang_gen_operation(A
, &oper
->children
[0]);
1798 n2
= _slang_gen_operation(A
, &oper
->children
[1]);
1801 return new_node2(IR_NOTEQUAL
, n1
, n2
);
1806 * Generate IR node for storage of a temporary of given size.
1808 static slang_ir_node
*
1809 _slang_gen_temporary(GLint size
)
1811 slang_ir_storage
*store
;
1812 slang_ir_node
*n
= NULL
;
1814 store
= _slang_new_ir_storage(PROGRAM_TEMPORARY
, -1, size
);
1816 n
= new_node0(IR_VAR_DECL
);
1829 * Generate IR node for allocating/declaring a variable.
1831 static slang_ir_node
*
1832 _slang_gen_var_decl(slang_assemble_ctx
*A
, slang_variable
*var
)
1835 assert(!is_sampler_type(&var
->type
));
1836 n
= new_node0(IR_VAR_DECL
);
1838 _slang_attach_storage(n
, var
);
1841 assert(n
->Store
== var
->aux
);
1843 assert(n
->Store
->Index
< 0);
1845 n
->Store
->File
= PROGRAM_TEMPORARY
;
1846 n
->Store
->Size
= _slang_sizeof_type_specifier(&n
->Var
->type
.specifier
);
1847 assert(n
->Store
->Size
> 0);
1854 * Generate code for a selection expression: b ? x : y
1855 * XXX In some cases we could implement a selection expression
1856 * with an LRP instruction (use the boolean as the interpolant).
1857 * Otherwise, we use an IF/ELSE/ENDIF construct.
1859 static slang_ir_node
*
1860 _slang_gen_select(slang_assemble_ctx
*A
, slang_operation
*oper
)
1862 slang_ir_node
*cond
, *ifNode
, *trueExpr
, *falseExpr
, *trueNode
, *falseNode
;
1863 slang_ir_node
*tmpDecl
, *tmpVar
, *tree
;
1864 slang_typeinfo type
;
1867 assert(oper
->type
== SLANG_OPER_SELECT
);
1868 assert(oper
->num_children
== 3);
1870 /* size of x or y's type */
1871 slang_typeinfo_construct(&type
);
1872 _slang_typeof_operation(A
, &oper
->children
[1], &type
);
1873 size
= _slang_sizeof_type_specifier(&type
.spec
);
1877 tmpDecl
= _slang_gen_temporary(size
);
1879 /* the condition (child 0) */
1880 cond
= _slang_gen_operation(A
, &oper
->children
[0]);
1881 cond
= new_cond(cond
);
1883 /* if-true body (child 1) */
1884 tmpVar
= new_node0(IR_VAR
);
1885 tmpVar
->Store
= tmpDecl
->Store
;
1886 trueExpr
= _slang_gen_operation(A
, &oper
->children
[1]);
1887 trueNode
= new_node2(IR_MOVE
, tmpVar
, trueExpr
);
1889 /* if-false body (child 2) */
1890 tmpVar
= new_node0(IR_VAR
);
1891 tmpVar
->Store
= tmpDecl
->Store
;
1892 falseExpr
= _slang_gen_operation(A
, &oper
->children
[2]);
1893 falseNode
= new_node2(IR_MOVE
, tmpVar
, falseExpr
);
1895 ifNode
= new_if(cond
, trueNode
, falseNode
);
1898 tmpVar
= new_node0(IR_VAR
);
1899 tmpVar
->Store
= tmpDecl
->Store
;
1901 tree
= new_seq(ifNode
, tmpVar
);
1902 tree
= new_seq(tmpDecl
, tree
);
1904 /*_slang_print_ir_tree(tree, 10);*/
1910 * Generate code for &&.
1912 static slang_ir_node
*
1913 _slang_gen_logical_and(slang_assemble_ctx
*A
, slang_operation
*oper
)
1915 /* rewrite "a && b" as "a ? b : false" */
1916 slang_operation
*select
;
1919 select
= slang_operation_new(1);
1920 select
->type
= SLANG_OPER_SELECT
;
1921 select
->num_children
= 3;
1922 select
->children
= slang_operation_new(3);
1924 slang_operation_copy(&select
->children
[0], &oper
->children
[0]);
1925 slang_operation_copy(&select
->children
[1], &oper
->children
[1]);
1926 select
->children
[2].type
= SLANG_OPER_LITERAL_BOOL
;
1927 ASSIGN_4V(select
->children
[2].literal
, 0, 0, 0, 0); /* false */
1928 select
->children
[2].literal_size
= 1;
1930 n
= _slang_gen_select(A
, select
);
1936 * Generate code for ||.
1938 static slang_ir_node
*
1939 _slang_gen_logical_or(slang_assemble_ctx
*A
, slang_operation
*oper
)
1941 /* rewrite "a || b" as "a ? true : b" */
1942 slang_operation
*select
;
1945 select
= slang_operation_new(1);
1946 select
->type
= SLANG_OPER_SELECT
;
1947 select
->num_children
= 3;
1948 select
->children
= slang_operation_new(3);
1950 slang_operation_copy(&select
->children
[0], &oper
->children
[0]);
1951 select
->children
[1].type
= SLANG_OPER_LITERAL_BOOL
;
1952 ASSIGN_4V(select
->children
[1].literal
, 1, 1, 1, 1); /* true */
1953 select
->children
[1].literal_size
= 1;
1954 slang_operation_copy(&select
->children
[2], &oper
->children
[1]);
1956 n
= _slang_gen_select(A
, select
);
1962 * Generate IR tree for a return statement.
1964 static slang_ir_node
*
1965 _slang_gen_return(slang_assemble_ctx
* A
, slang_operation
*oper
)
1967 const GLboolean haveReturnValue
1968 = (oper
->num_children
== 1 && oper
->children
[0].type
!= SLANG_OPER_VOID
);
1970 /* error checking */
1971 assert(A
->CurFunction
);
1972 if (haveReturnValue
&&
1973 A
->CurFunction
->header
.type
.specifier
.type
== SLANG_SPEC_VOID
) {
1974 slang_info_log_error(A
->log
, "illegal return expression");
1977 else if (!haveReturnValue
&&
1978 A
->CurFunction
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
1979 slang_info_log_error(A
->log
, "return statement requires an expression");
1983 if (!haveReturnValue
) {
1984 return new_return(A
->curFuncEndLabel
);
1992 * return; // goto __endOfFunction
1994 slang_operation
*assign
;
1995 slang_atom a_retVal
;
1998 a_retVal
= slang_atom_pool_atom(A
->atoms
, "__retVal");
2004 = _slang_locate_variable(oper
->locals
, a_retVal
, GL_TRUE
);
2006 /* trying to return a value in a void-valued function */
2012 assign
= slang_operation_new(1);
2013 assign
->type
= SLANG_OPER_ASSIGN
;
2014 assign
->num_children
= 2;
2015 assign
->children
= slang_operation_new(2);
2016 /* lhs (__retVal) */
2017 assign
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
2018 assign
->children
[0].a_id
= a_retVal
;
2019 assign
->children
[0].locals
->outer_scope
= assign
->locals
;
2021 /* XXX we might be able to avoid this copy someday */
2022 slang_operation_copy(&assign
->children
[1], &oper
->children
[0]);
2024 /* assemble the new code */
2025 n
= new_seq(_slang_gen_operation(A
, assign
),
2026 new_return(A
->curFuncEndLabel
));
2028 slang_operation_delete(assign
);
2035 * Generate IR tree for a variable declaration.
2037 static slang_ir_node
*
2038 _slang_gen_declaration(slang_assemble_ctx
*A
, slang_operation
*oper
)
2041 slang_ir_node
*varDecl
;
2043 const char *varName
= (char *) oper
->a_id
;
2045 assert(oper
->num_children
== 0 || oper
->num_children
== 1);
2047 v
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
2050 varDecl
= _slang_gen_var_decl(A
, v
);
2052 if (oper
->num_children
> 0) {
2053 /* child is initializer */
2054 slang_ir_node
*var
, *init
, *rhs
;
2055 assert(oper
->num_children
== 1);
2056 var
= new_var(A
, oper
, oper
->a_id
);
2058 slang_info_log_error(A
->log
, "undefined variable '%s'", varName
);
2061 /* XXX make copy of this initializer? */
2062 rhs
= _slang_gen_operation(A
, &oper
->children
[0]);
2064 init
= new_node2(IR_MOVE
, var
, rhs
);
2065 /*assert(rhs->Opcode != IR_SEQ);*/
2066 n
= new_seq(varDecl
, init
);
2068 else if (v
->initializer
) {
2069 slang_ir_node
*var
, *init
, *rhs
;
2070 var
= new_var(A
, oper
, oper
->a_id
);
2072 slang_info_log_error(A
->log
, "undefined variable '%s'", varName
);
2076 /* XXX make copy of this initializer? */
2078 slang_operation dup
;
2079 slang_operation_construct(&dup
);
2080 slang_operation_copy(&dup
, v
->initializer
);
2081 _slang_simplify(&dup
, &A
->space
, A
->atoms
);
2082 rhs
= _slang_gen_operation(A
, &dup
);
2085 _slang_simplify(v
->initializer
, &A
->space
, A
->atoms
);
2086 rhs
= _slang_gen_operation(A
, v
->initializer
);
2092 init
= new_node2(IR_MOVE
, var
, rhs
);
2094 assert(rhs->Opcode != IR_SEQ);
2096 n
= new_seq(varDecl
, init
);
2106 * Generate IR tree for a variable (such as in an expression).
2108 static slang_ir_node
*
2109 _slang_gen_variable(slang_assemble_ctx
* A
, slang_operation
*oper
)
2111 /* If there's a variable associated with this oper (from inlining)
2112 * use it. Otherwise, use the oper's var id.
2114 slang_atom aVar
= oper
->var
? oper
->var
->a_name
: oper
->a_id
;
2115 slang_ir_node
*n
= new_var(A
, oper
, aVar
);
2117 slang_info_log_error(A
->log
, "undefined variable '%s'", (char *) aVar
);
2125 * Some write-masked assignments are simple, but others are hard.
2128 * v.xy = vec2(a, b);
2131 * v.zy = vec2(a, b);
2132 * this gets transformed/swizzled into:
2133 * v.zy = vec2(a, b).*yx* (* = don't care)
2134 * This function helps to determine simple vs. non-simple.
2137 _slang_simple_writemask(GLuint writemask
, GLuint swizzle
)
2139 switch (writemask
) {
2141 return GET_SWZ(swizzle
, 0) == SWIZZLE_X
;
2143 return GET_SWZ(swizzle
, 1) == SWIZZLE_Y
;
2145 return GET_SWZ(swizzle
, 2) == SWIZZLE_Z
;
2147 return GET_SWZ(swizzle
, 3) == SWIZZLE_W
;
2149 return (GET_SWZ(swizzle
, 0) == SWIZZLE_X
)
2150 && (GET_SWZ(swizzle
, 1) == SWIZZLE_Y
);
2152 return (GET_SWZ(swizzle
, 0) == SWIZZLE_X
)
2153 && (GET_SWZ(swizzle
, 1) == SWIZZLE_Y
)
2154 && (GET_SWZ(swizzle
, 2) == SWIZZLE_Z
);
2155 case WRITEMASK_XYZW
:
2156 return swizzle
== SWIZZLE_NOOP
;
2164 * Convert the given swizzle into a writemask. In some cases this
2165 * is trivial, in other cases, we'll need to also swizzle the right
2166 * hand side to put components in the right places.
2167 * \param swizzle the incoming swizzle
2168 * \param writemaskOut returns the writemask
2169 * \param swizzleOut swizzle to apply to the right-hand-side
2170 * \return GL_FALSE for simple writemasks, GL_TRUE for non-simple
2173 swizzle_to_writemask(GLuint swizzle
,
2174 GLuint
*writemaskOut
, GLuint
*swizzleOut
)
2176 GLuint mask
= 0x0, newSwizzle
[4];
2179 /* make new dst writemask, compute size */
2180 for (i
= 0; i
< 4; i
++) {
2181 const GLuint swz
= GET_SWZ(swizzle
, i
);
2182 if (swz
== SWIZZLE_NIL
) {
2186 assert(swz
>= 0 && swz
<= 3);
2189 assert(mask
<= 0xf);
2190 size
= i
; /* number of components in mask/swizzle */
2192 *writemaskOut
= mask
;
2194 /* make new src swizzle, by inversion */
2195 for (i
= 0; i
< 4; i
++) {
2196 newSwizzle
[i
] = i
; /*identity*/
2198 for (i
= 0; i
< size
; i
++) {
2199 const GLuint swz
= GET_SWZ(swizzle
, i
);
2200 newSwizzle
[swz
] = i
;
2202 *swizzleOut
= MAKE_SWIZZLE4(newSwizzle
[0],
2207 if (_slang_simple_writemask(mask
, *swizzleOut
)) {
2209 assert(GET_SWZ(*swizzleOut
, 0) == SWIZZLE_X
);
2211 assert(GET_SWZ(*swizzleOut
, 1) == SWIZZLE_Y
);
2213 assert(GET_SWZ(*swizzleOut
, 2) == SWIZZLE_Z
);
2215 assert(GET_SWZ(*swizzleOut
, 3) == SWIZZLE_W
);
2223 static slang_ir_node
*
2224 _slang_gen_swizzle(slang_ir_node
*child
, GLuint swizzle
)
2226 slang_ir_node
*n
= new_node1(IR_SWIZZLE
, child
);
2229 n
->Store
= _slang_new_ir_storage(PROGRAM_UNDEFINED
, -1, -1);
2230 n
->Store
->Swizzle
= swizzle
;
2237 * Generate IR tree for an assignment (=).
2239 static slang_ir_node
*
2240 _slang_gen_assignment(slang_assemble_ctx
* A
, slang_operation
*oper
)
2242 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
) {
2243 /* Check that var is writeable */
2245 = _slang_locate_variable(oper
->children
[0].locals
,
2246 oper
->children
[0].a_id
, GL_TRUE
);
2248 slang_info_log_error(A
->log
, "undefined variable '%s'",
2249 (char *) oper
->children
[0].a_id
);
2252 if (var
->type
.qualifier
== SLANG_QUAL_CONST
||
2253 var
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
||
2254 var
->type
.qualifier
== SLANG_QUAL_UNIFORM
||
2255 (var
->type
.qualifier
== SLANG_QUAL_VARYING
&&
2256 A
->program
->Target
== GL_FRAGMENT_PROGRAM_ARB
)) {
2257 slang_info_log_error(A
->log
,
2258 "illegal assignment to read-only variable '%s'",
2259 (char *) oper
->children
[0].a_id
);
2264 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
&&
2265 oper
->children
[1].type
== SLANG_OPER_CALL
) {
2266 /* Special case of: x = f(a, b)
2267 * Replace with f(a, b, x) (where x == hidden __retVal out param)
2269 * XXX this could be even more effective if we could accomodate
2270 * cases such as "v.x = f();" - would help with typical vertex
2274 n
= _slang_gen_function_call_name(A
,
2275 (const char *) oper
->children
[1].a_id
,
2276 &oper
->children
[1], &oper
->children
[0]);
2280 slang_ir_node
*n
, *lhs
, *rhs
;
2281 lhs
= _slang_gen_operation(A
, &oper
->children
[0]);
2284 if (!(lhs
->Store
->File
== PROGRAM_OUTPUT
||
2285 lhs
->Store
->File
== PROGRAM_TEMPORARY
||
2286 (lhs
->Store
->File
== PROGRAM_VARYING
&&
2287 A
->program
->Target
== GL_VERTEX_PROGRAM_ARB
) ||
2288 lhs
->Store
->File
== PROGRAM_UNDEFINED
)) {
2289 slang_info_log_error(A
->log
,
2290 "illegal assignment to read-only l-value");
2295 rhs
= _slang_gen_operation(A
, &oper
->children
[1]);
2297 /* convert lhs swizzle into writemask */
2298 GLuint writemask
, newSwizzle
;
2299 if (!swizzle_to_writemask(lhs
->Store
->Swizzle
,
2300 &writemask
, &newSwizzle
)) {
2301 /* Non-simple writemask, need to swizzle right hand side in
2302 * order to put components into the right place.
2304 rhs
= _slang_gen_swizzle(rhs
, newSwizzle
);
2306 n
= new_node2(IR_MOVE
, lhs
, rhs
);
2307 n
->Writemask
= writemask
;
2318 * Generate IR tree for referencing a field in a struct (or basic vector type)
2320 static slang_ir_node
*
2321 _slang_gen_field(slang_assemble_ctx
* A
, slang_operation
*oper
)
2325 /* type of struct */
2326 slang_typeinfo_construct(&ti
);
2327 _slang_typeof_operation(A
, &oper
->children
[0], &ti
);
2329 if (_slang_type_is_vector(ti
.spec
.type
)) {
2330 /* the field should be a swizzle */
2331 const GLuint rows
= _slang_type_dim(ti
.spec
.type
);
2335 if (!_slang_is_swizzle((char *) oper
->a_id
, rows
, &swz
)) {
2336 slang_info_log_error(A
->log
, "Bad swizzle");
2338 swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
2343 n
= _slang_gen_operation(A
, &oper
->children
[0]);
2344 /* create new parent node with swizzle */
2346 n
= _slang_gen_swizzle(n
, swizzle
);
2349 else if ( ti
.spec
.type
== SLANG_SPEC_FLOAT
2350 || ti
.spec
.type
== SLANG_SPEC_INT
) {
2351 const GLuint rows
= 1;
2355 if (!_slang_is_swizzle((char *) oper
->a_id
, rows
, &swz
)) {
2356 slang_info_log_error(A
->log
, "Bad swizzle");
2358 swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
2362 n
= _slang_gen_operation(A
, &oper
->children
[0]);
2363 /* create new parent node with swizzle */
2364 n
= _slang_gen_swizzle(n
, swizzle
);
2368 /* the field is a structure member (base.field) */
2369 /* oper->children[0] is the base */
2370 /* oper->a_id is the field name */
2371 slang_ir_node
*base
, *n
;
2372 slang_typeinfo field_ti
;
2373 GLint fieldSize
, fieldOffset
= -1;
2375 slang_typeinfo_construct(&field_ti
);
2376 _slang_typeof_operation(A
, oper
, &field_ti
);
2378 fieldSize
= _slang_sizeof_type_specifier(&field_ti
.spec
);
2380 fieldOffset
= _slang_field_offset(&ti
.spec
, oper
->a_id
);
2382 if (fieldSize
== 0 || fieldOffset
< 0) {
2383 slang_info_log_error(A
->log
,
2384 "\"%s\" is not a member of struct \"%s\"",
2385 (char *) oper
->a_id
,
2386 (char *) ti
.spec
._struct
->a_name
);
2389 assert(fieldSize
>= 0);
2391 base
= _slang_gen_operation(A
, &oper
->children
[0]);
2393 /* error msg should have already been logged */
2397 n
= new_node1(IR_FIELD
, base
);
2399 n
->Field
= (char *) oper
->a_id
;
2400 n
->FieldOffset
= fieldOffset
;
2401 assert(n
->FieldOffset
>= 0);
2402 n
->Store
= _slang_new_ir_storage(base
->Store
->File
,
2409 _mesa_problem(NULL
, "glsl structs/fields not supported yet");
2417 * Gen code for array indexing.
2419 static slang_ir_node
*
2420 _slang_gen_subscript(slang_assemble_ctx
* A
, slang_operation
*oper
)
2422 slang_typeinfo array_ti
;
2424 /* get array's type info */
2425 slang_typeinfo_construct(&array_ti
);
2426 _slang_typeof_operation(A
, &oper
->children
[0], &array_ti
);
2428 if (_slang_type_is_vector(array_ti
.spec
.type
)) {
2429 /* indexing a simple vector type: "vec4 v; v[0]=p;" */
2430 /* translate the index into a swizzle/writemask: "v.x=p" */
2431 const GLuint max
= _slang_type_dim(array_ti
.spec
.type
);
2435 index
= (GLint
) oper
->children
[1].literal
[0];
2436 if (oper
->children
[1].type
!= SLANG_OPER_LITERAL_INT
||
2438 slang_info_log_error(A
->log
, "Invalid array index for vector type");
2442 n
= _slang_gen_operation(A
, &oper
->children
[0]);
2444 /* use swizzle to access the element */
2445 GLuint swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
+ index
,
2449 n
= _slang_gen_swizzle(n
, swizzle
);
2450 /*n->Store = _slang_clone_ir_storage_swz(n->Store, */
2451 n
->Writemask
= WRITEMASK_X
<< index
;
2456 /* conventional array */
2457 slang_typeinfo elem_ti
;
2458 slang_ir_node
*elem
, *array
, *index
;
2459 GLint elemSize
, arrayLen
;
2461 /* size of array element */
2462 slang_typeinfo_construct(&elem_ti
);
2463 _slang_typeof_operation(A
, oper
, &elem_ti
);
2464 elemSize
= _slang_sizeof_type_specifier(&elem_ti
.spec
);
2466 if (_slang_type_is_matrix(array_ti
.spec
.type
))
2467 arrayLen
= _slang_type_dim(array_ti
.spec
.type
);
2469 arrayLen
= array_ti
.array_len
;
2471 slang_typeinfo_destruct(&array_ti
);
2472 slang_typeinfo_destruct(&elem_ti
);
2474 if (elemSize
<= 0) {
2475 /* unknown var or type */
2476 slang_info_log_error(A
->log
, "Undefined variable or type");
2480 array
= _slang_gen_operation(A
, &oper
->children
[0]);
2481 index
= _slang_gen_operation(A
, &oper
->children
[1]);
2482 if (array
&& index
) {
2484 if (index
->Opcode
== IR_FLOAT
&&
2485 ((int) index
->Value
[0] < 0 ||
2486 (int) index
->Value
[0] >= arrayLen
)) {
2487 slang_info_log_error(A
->log
,
2488 "Array index out of bounds (index=%d size=%d)",
2489 (int) index
->Value
[0], arrayLen
);
2490 _slang_free_ir_tree(array
);
2491 _slang_free_ir_tree(index
);
2495 elem
= new_node2(IR_ELEMENT
, array
, index
);
2496 elem
->Store
= _slang_new_ir_storage(array
->Store
->File
,
2497 array
->Store
->Index
,
2499 /* XXX try to do some array bounds checking here */
2503 _slang_free_ir_tree(array
);
2504 _slang_free_ir_tree(index
);
2512 * Look for expressions such as: gl_ModelviewMatrix * gl_Vertex
2513 * and replace with this: gl_Vertex * gl_ModelviewMatrixTranpose
2514 * Since matrices are stored in column-major order, the second form of
2515 * multiplication is much more efficient (just 4 dot products).
2518 _slang_check_matmul_optimization(slang_assemble_ctx
*A
, slang_operation
*oper
)
2520 static const struct {
2522 const char *tranpose
;
2524 {"gl_ModelViewMatrix", "gl_ModelViewMatrixTranspose"},
2525 {"gl_ProjectionMatrix", "gl_ProjectionMatrixTranspose"},
2526 {"gl_ModelViewProjectionMatrix", "gl_ModelViewProjectionMatrixTranspose"},
2527 {"gl_TextureMatrix", "gl_TextureMatrixTranspose"},
2528 {"gl_NormalMatrix", "__NormalMatrixTranspose"},
2532 assert(oper
->type
== SLANG_OPER_MULTIPLY
);
2533 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
) {
2535 for (i
= 0; matrices
[i
].orig
; i
++) {
2536 if (oper
->children
[0].a_id
2537 == slang_atom_pool_atom(A
->atoms
, matrices
[i
].orig
)) {
2539 _mesa_printf("Replace %s with %s\n",
2540 matrices[i].orig, matrices[i].tranpose);
2542 assert(oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
);
2543 oper
->children
[0].a_id
2544 = slang_atom_pool_atom(A
->atoms
, matrices
[i
].tranpose
);
2545 /* finally, swap the operands */
2546 _slang_operation_swap(&oper
->children
[0], &oper
->children
[1]);
2555 * Generate IR tree for a slang_operation (AST node)
2557 static slang_ir_node
*
2558 _slang_gen_operation(slang_assemble_ctx
* A
, slang_operation
*oper
)
2560 switch (oper
->type
) {
2561 case SLANG_OPER_BLOCK_NEW_SCOPE
:
2565 _slang_push_var_table(A
->vartable
);
2567 oper
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
; /* temp change */
2568 n
= _slang_gen_operation(A
, oper
);
2569 oper
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
; /* restore */
2571 _slang_pop_var_table(A
->vartable
);
2574 n
= new_node1(IR_SCOPE
, n
);
2579 case SLANG_OPER_BLOCK_NO_NEW_SCOPE
:
2580 /* list of operations */
2581 if (oper
->num_children
> 0)
2583 slang_ir_node
*n
, *tree
= NULL
;
2586 for (i
= 0; i
< oper
->num_children
; i
++) {
2587 n
= _slang_gen_operation(A
, &oper
->children
[i
]);
2589 _slang_free_ir_tree(tree
);
2590 return NULL
; /* error must have occured */
2592 tree
= tree
? new_seq(tree
, n
) : n
;
2596 if (oper
->locals
->num_variables
> 0) {
2599 printf("\n****** Deallocate vars in scope!\n");
2601 for (i
= 0; i
< oper
->locals
->num_variables
; i
++) {
2602 slang_variable
*v
= oper
->locals
->variables
+ i
;
2604 slang_ir_storage
*store
= (slang_ir_storage
*) v
->aux
;
2606 printf(" Deallocate var %s\n", (char*) v->a_name);
2608 assert(store
->File
== PROGRAM_TEMPORARY
);
2609 assert(store
->Index
>= 0);
2610 _slang_free_temp(A
->vartable
, store
->Index
, store
->Size
);
2618 return new_node0(IR_NOP
);
2621 case SLANG_OPER_EXPRESSION
:
2622 return _slang_gen_operation(A
, &oper
->children
[0]);
2624 case SLANG_OPER_FOR
:
2625 return _slang_gen_for(A
, oper
);
2627 return _slang_gen_do(A
, oper
);
2628 case SLANG_OPER_WHILE
:
2629 return _slang_gen_while(A
, oper
);
2630 case SLANG_OPER_BREAK
:
2632 slang_info_log_error(A
->log
, "'break' not in loop");
2635 return new_break(A
->CurLoop
);
2636 case SLANG_OPER_CONTINUE
:
2638 slang_info_log_error(A
->log
, "'continue' not in loop");
2641 return _slang_gen_continue(A
, oper
);
2642 case SLANG_OPER_DISCARD
:
2643 return new_node0(IR_KILL
);
2645 case SLANG_OPER_EQUAL
:
2646 return new_node2(IR_EQUAL
,
2647 _slang_gen_operation(A
, &oper
->children
[0]),
2648 _slang_gen_operation(A
, &oper
->children
[1]));
2649 case SLANG_OPER_NOTEQUAL
:
2650 return new_node2(IR_NOTEQUAL
,
2651 _slang_gen_operation(A
, &oper
->children
[0]),
2652 _slang_gen_operation(A
, &oper
->children
[1]));
2653 case SLANG_OPER_GREATER
:
2654 return new_node2(IR_SGT
,
2655 _slang_gen_operation(A
, &oper
->children
[0]),
2656 _slang_gen_operation(A
, &oper
->children
[1]));
2657 case SLANG_OPER_LESS
:
2658 return new_node2(IR_SLT
,
2659 _slang_gen_operation(A
, &oper
->children
[0]),
2660 _slang_gen_operation(A
, &oper
->children
[1]));
2661 case SLANG_OPER_GREATEREQUAL
:
2662 return new_node2(IR_SGE
,
2663 _slang_gen_operation(A
, &oper
->children
[0]),
2664 _slang_gen_operation(A
, &oper
->children
[1]));
2665 case SLANG_OPER_LESSEQUAL
:
2666 return new_node2(IR_SLE
,
2667 _slang_gen_operation(A
, &oper
->children
[0]),
2668 _slang_gen_operation(A
, &oper
->children
[1]));
2669 case SLANG_OPER_ADD
:
2672 assert(oper
->num_children
== 2);
2673 n
= _slang_gen_function_call_name(A
, "+", oper
, NULL
);
2676 case SLANG_OPER_SUBTRACT
:
2679 assert(oper
->num_children
== 2);
2680 n
= _slang_gen_function_call_name(A
, "-", oper
, NULL
);
2683 case SLANG_OPER_MULTIPLY
:
2686 assert(oper
->num_children
== 2);
2687 _slang_check_matmul_optimization(A
, oper
);
2688 n
= _slang_gen_function_call_name(A
, "*", oper
, NULL
);
2691 case SLANG_OPER_DIVIDE
:
2694 assert(oper
->num_children
== 2);
2695 n
= _slang_gen_function_call_name(A
, "/", oper
, NULL
);
2698 case SLANG_OPER_MINUS
:
2701 assert(oper
->num_children
== 1);
2702 n
= _slang_gen_function_call_name(A
, "-", oper
, NULL
);
2705 case SLANG_OPER_PLUS
:
2706 /* +expr --> do nothing */
2707 return _slang_gen_operation(A
, &oper
->children
[0]);
2708 case SLANG_OPER_VARIABLE_DECL
:
2709 return _slang_gen_declaration(A
, oper
);
2710 case SLANG_OPER_ASSIGN
:
2711 return _slang_gen_assignment(A
, oper
);
2712 case SLANG_OPER_ADDASSIGN
:
2715 assert(oper
->num_children
== 2);
2716 n
= _slang_gen_function_call_name(A
, "+=", oper
, &oper
->children
[0]);
2719 case SLANG_OPER_SUBASSIGN
:
2722 assert(oper
->num_children
== 2);
2723 n
= _slang_gen_function_call_name(A
, "-=", oper
, &oper
->children
[0]);
2727 case SLANG_OPER_MULASSIGN
:
2730 assert(oper
->num_children
== 2);
2731 n
= _slang_gen_function_call_name(A
, "*=", oper
, &oper
->children
[0]);
2734 case SLANG_OPER_DIVASSIGN
:
2737 assert(oper
->num_children
== 2);
2738 n
= _slang_gen_function_call_name(A
, "/=", oper
, &oper
->children
[0]);
2741 case SLANG_OPER_LOGICALAND
:
2744 assert(oper
->num_children
== 2);
2745 n
= _slang_gen_logical_and(A
, oper
);
2748 case SLANG_OPER_LOGICALOR
:
2751 assert(oper
->num_children
== 2);
2752 n
= _slang_gen_logical_or(A
, oper
);
2755 case SLANG_OPER_LOGICALXOR
:
2756 return _slang_gen_xor(A
, oper
);
2757 case SLANG_OPER_NOT
:
2758 return _slang_gen_not(A
, oper
);
2759 case SLANG_OPER_SELECT
: /* b ? x : y */
2762 assert(oper
->num_children
== 3);
2763 n
= _slang_gen_select(A
, oper
);
2767 case SLANG_OPER_ASM
:
2768 return _slang_gen_asm(A
, oper
, NULL
);
2769 case SLANG_OPER_CALL
:
2770 return _slang_gen_function_call_name(A
, (const char *) oper
->a_id
,
2772 case SLANG_OPER_RETURN
:
2773 return _slang_gen_return(A
, oper
);
2774 case SLANG_OPER_LABEL
:
2775 return new_label(oper
->label
);
2776 case SLANG_OPER_IDENTIFIER
:
2777 return _slang_gen_variable(A
, oper
);
2779 return _slang_gen_if(A
, oper
);
2780 case SLANG_OPER_FIELD
:
2781 return _slang_gen_field(A
, oper
);
2782 case SLANG_OPER_SUBSCRIPT
:
2783 return _slang_gen_subscript(A
, oper
);
2784 case SLANG_OPER_LITERAL_FLOAT
:
2786 case SLANG_OPER_LITERAL_INT
:
2788 case SLANG_OPER_LITERAL_BOOL
:
2789 return new_float_literal(oper
->literal
, oper
->literal_size
);
2791 case SLANG_OPER_POSTINCREMENT
: /* var++ */
2794 assert(oper
->num_children
== 1);
2795 n
= _slang_gen_function_call_name(A
, "__postIncr", oper
, NULL
);
2798 case SLANG_OPER_POSTDECREMENT
: /* var-- */
2801 assert(oper
->num_children
== 1);
2802 n
= _slang_gen_function_call_name(A
, "__postDecr", oper
, NULL
);
2805 case SLANG_OPER_PREINCREMENT
: /* ++var */
2808 assert(oper
->num_children
== 1);
2809 n
= _slang_gen_function_call_name(A
, "++", oper
, NULL
);
2812 case SLANG_OPER_PREDECREMENT
: /* --var */
2815 assert(oper
->num_children
== 1);
2816 n
= _slang_gen_function_call_name(A
, "--", oper
, NULL
);
2820 case SLANG_OPER_INLINED_CALL
:
2821 case SLANG_OPER_SEQUENCE
:
2823 slang_ir_node
*tree
= NULL
;
2825 for (i
= 0; i
< oper
->num_children
; i
++) {
2826 slang_ir_node
*n
= _slang_gen_operation(A
, &oper
->children
[i
]);
2827 tree
= tree
? new_seq(tree
, n
) : n
;
2829 if (oper
->type
== SLANG_OPER_INLINED_CALL
) {
2830 tree
= new_inlined_function_call(tree
, oper
->label
);
2835 case SLANG_OPER_NONE
:
2836 case SLANG_OPER_VOID
:
2837 /* returning NULL here would generate an error */
2838 return new_node0(IR_NOP
);
2841 _mesa_problem(NULL
, "bad node type %d in _slang_gen_operation",
2843 return new_node0(IR_NOP
);
2852 * Called by compiler when a global variable has been parsed/compiled.
2853 * Here we examine the variable's type to determine what kind of register
2854 * storage will be used.
2856 * A uniform such as "gl_Position" will become the register specification
2857 * (PROGRAM_OUTPUT, VERT_RESULT_HPOS). Or, uniform "gl_FogFragCoord"
2858 * will be (PROGRAM_INPUT, FRAG_ATTRIB_FOGC).
2860 * Samplers are interesting. For "uniform sampler2D tex;" we'll specify
2861 * (PROGRAM_SAMPLER, index) where index is resolved at link-time to an
2862 * actual texture unit (as specified by the user calling glUniform1i()).
2865 _slang_codegen_global_variable(slang_assemble_ctx
*A
, slang_variable
*var
,
2866 slang_unit_type type
)
2868 struct gl_program
*prog
= A
->program
;
2869 const char *varName
= (char *) var
->a_name
;
2870 GLboolean success
= GL_TRUE
;
2871 slang_ir_storage
*store
= NULL
;
2873 const GLenum datatype
= _slang_gltype_from_specifier(&var
->type
.specifier
);
2874 const GLint texIndex
= sampler_to_texture_index(var
->type
.specifier
.type
);
2876 if (texIndex
!= -1) {
2877 /* This is a texture sampler variable...
2878 * store->File = PROGRAM_SAMPLER
2879 * store->Index = sampler number (0..7, typically)
2880 * store->Size = texture type index (1D, 2D, 3D, cube, etc)
2883 GLint samplerUniform
2884 = _mesa_add_sampler(prog
->Parameters
, varName
, datatype
);
2886 GLint samplerUniform
2887 = _mesa_add_sampler(prog
->Samplers
, varName
, datatype
);
2888 (void) _mesa_add_sampler(prog
->Parameters
, varName
, datatype
); /* dummy entry */
2890 const GLint sampNum
= A
->numSamplers
++;
2891 _mesa_add_sampler(prog
->Parameters
, varName
, datatype
, sampNum
);
2893 store
= _slang_new_ir_storage(PROGRAM_SAMPLER
, sampNum
, texIndex
);
2894 if (dbg
) printf("SAMPLER ");
2896 else if (var
->type
.qualifier
== SLANG_QUAL_UNIFORM
) {
2897 /* Uniform variable */
2898 const GLint size
= _slang_sizeof_type_specifier(&var
->type
.specifier
)
2899 * MAX2(var
->array_len
, 1);
2901 /* user-defined uniform */
2902 if (datatype
== GL_NONE
) {
2903 if (var
->type
.specifier
.type
== SLANG_SPEC_STRUCT
) {
2904 _mesa_problem(NULL
, "user-declared uniform structs not supported yet");
2905 /* XXX what we need to do is unroll the struct into its
2906 * basic types, creating a uniform variable for each.
2914 * Should produce uniforms:
2915 * "f.a" (GL_FLOAT_VEC3)
2916 * "f.b" (GL_FLOAT_VEC4)
2920 slang_info_log_error(A
->log
,
2921 "invalid datatype for uniform variable %s",
2922 (char *) var
->a_name
);
2927 GLint uniformLoc
= _mesa_add_uniform(prog
->Parameters
, varName
,
2929 store
= _slang_new_ir_storage(PROGRAM_UNIFORM
, uniformLoc
, size
);
2933 /* pre-defined uniform, like gl_ModelviewMatrix */
2934 /* We know it's a uniform, but don't allocate storage unless
2937 store
= _slang_new_ir_storage(PROGRAM_STATE_VAR
, -1, size
);
2939 if (dbg
) printf("UNIFORM (sz %d) ", size
);
2941 else if (var
->type
.qualifier
== SLANG_QUAL_VARYING
) {
2942 const GLint size
= 4; /* XXX fix */
2944 /* user-defined varying */
2945 GLint varyingLoc
= _mesa_add_varying(prog
->Varying
, varName
, size
);
2946 store
= _slang_new_ir_storage(PROGRAM_VARYING
, varyingLoc
, size
);
2949 /* pre-defined varying, like gl_Color or gl_TexCoord */
2950 if (type
== SLANG_UNIT_FRAGMENT_BUILTIN
) {
2952 GLint index
= _slang_input_index(varName
, GL_FRAGMENT_PROGRAM_ARB
,
2955 store
= _slang_new_ir_storage(PROGRAM_INPUT
, index
, size
);
2956 store
->Swizzle
= swizzle
;
2957 assert(index
< FRAG_ATTRIB_MAX
);
2960 GLint index
= _slang_output_index(varName
, GL_VERTEX_PROGRAM_ARB
);
2962 assert(type
== SLANG_UNIT_VERTEX_BUILTIN
);
2963 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, size
);
2964 assert(index
< VERT_RESULT_MAX
);
2966 if (dbg
) printf("V/F ");
2968 if (dbg
) printf("VARYING ");
2970 else if (var
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
) {
2972 /* user-defined vertex attribute */
2973 const GLint size
= _slang_sizeof_type_specifier(&var
->type
.specifier
);
2974 const GLint attr
= -1; /* unknown */
2975 GLint index
= _mesa_add_attribute(prog
->Attributes
, varName
,
2978 store
= _slang_new_ir_storage(PROGRAM_INPUT
,
2979 VERT_ATTRIB_GENERIC0
+ index
, size
);
2982 /* pre-defined vertex attrib */
2984 GLint index
= _slang_input_index(varName
, GL_VERTEX_PROGRAM_ARB
,
2986 GLint size
= 4; /* XXX? */
2988 store
= _slang_new_ir_storage(PROGRAM_INPUT
, index
, size
);
2989 store
->Swizzle
= swizzle
;
2991 if (dbg
) printf("ATTRIB ");
2993 else if (var
->type
.qualifier
== SLANG_QUAL_FIXEDINPUT
) {
2994 GLuint swizzle
= SWIZZLE_XYZW
; /* silence compiler warning */
2995 GLint index
= _slang_input_index(varName
, GL_FRAGMENT_PROGRAM_ARB
,
2997 GLint size
= 4; /* XXX? */
2998 store
= _slang_new_ir_storage(PROGRAM_INPUT
, index
, size
);
2999 store
->Swizzle
= swizzle
;
3000 if (dbg
) printf("INPUT ");
3002 else if (var
->type
.qualifier
== SLANG_QUAL_FIXEDOUTPUT
) {
3003 if (type
== SLANG_UNIT_VERTEX_BUILTIN
) {
3004 GLint index
= _slang_output_index(varName
, GL_VERTEX_PROGRAM_ARB
);
3005 GLint size
= 4; /* XXX? */
3006 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, size
);
3009 GLint index
= _slang_output_index(varName
, GL_FRAGMENT_PROGRAM_ARB
);
3010 GLint size
= 4; /* XXX? */
3011 assert(type
== SLANG_UNIT_FRAGMENT_BUILTIN
);
3012 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, size
);
3014 if (dbg
) printf("OUTPUT ");
3016 else if (var
->type
.qualifier
== SLANG_QUAL_CONST
&& !prog
) {
3017 /* pre-defined global constant, like gl_MaxLights */
3018 const GLint size
= _slang_sizeof_type_specifier(&var
->type
.specifier
);
3019 store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, size
);
3020 if (dbg
) printf("CONST ");
3023 /* ordinary variable (may be const) */
3026 /* IR node to declare the variable */
3027 n
= _slang_gen_var_decl(A
, var
);
3029 /* IR code for the var's initializer, if present */
3030 if (var
->initializer
) {
3031 slang_ir_node
*lhs
, *rhs
, *init
;
3033 /* Generate IR_MOVE instruction to initialize the variable */
3034 lhs
= new_node0(IR_VAR
);
3036 lhs
->Store
= n
->Store
;
3038 /* constant folding, etc */
3039 _slang_simplify(var
->initializer
, &A
->space
, A
->atoms
);
3041 rhs
= _slang_gen_operation(A
, var
->initializer
);
3043 init
= new_node2(IR_MOVE
, lhs
, rhs
);
3044 n
= new_seq(n
, init
);
3047 success
= _slang_emit_code(n
, A
->vartable
, A
->program
, GL_FALSE
, A
->log
);
3049 _slang_free_ir_tree(n
);
3052 if (dbg
) printf("GLOBAL VAR %s idx %d\n", (char*) var
->a_name
,
3053 store
? store
->Index
: -2);
3056 var
->aux
= store
; /* save var's storage info */
3063 * Produce an IR tree from a function AST (fun->body).
3064 * Then call the code emitter to convert the IR tree into gl_program
3068 _slang_codegen_function(slang_assemble_ctx
* A
, slang_function
* fun
)
3071 GLboolean success
= GL_TRUE
;
3073 if (_mesa_strcmp((char *) fun
->header
.a_name
, "main") != 0) {
3074 /* we only really generate code for main, all other functions get
3078 /* do some basic error checking though */
3079 if (fun
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
3080 /* check that non-void functions actually return something */
3082 = _slang_find_node_type(fun
->body
, SLANG_OPER_RETURN
);
3084 slang_info_log_error(A
->log
,
3085 "function \"%s\" has no return statement",
3086 (char *) fun
->header
.a_name
);
3088 "function \"%s\" has no return statement\n",
3089 (char *) fun
->header
.a_name
);
3094 return GL_TRUE
; /* not an error */
3098 printf("\n*********** codegen_function %s\n", (char *) fun
->header
.a_name
);
3099 slang_print_function(fun
, 1);
3102 /* should have been allocated earlier: */
3103 assert(A
->program
->Parameters
);
3104 assert(A
->program
->Varying
);
3105 assert(A
->vartable
);
3107 A
->CurFunction
= fun
;
3109 /* fold constant expressions, etc. */
3110 _slang_simplify(fun
->body
, &A
->space
, A
->atoms
);
3113 printf("\n*********** simplified %s\n", (char *) fun
->header
.a_name
);
3114 slang_print_function(fun
, 1);
3117 /* Create an end-of-function label */
3118 A
->curFuncEndLabel
= _slang_label_new("__endOfFunc__main");
3120 /* push new vartable scope */
3121 _slang_push_var_table(A
->vartable
);
3123 /* Generate IR tree for the function body code */
3124 n
= _slang_gen_operation(A
, fun
->body
);
3126 n
= new_node1(IR_SCOPE
, n
);
3128 /* pop vartable, restore previous */
3129 _slang_pop_var_table(A
->vartable
);
3132 /* XXX record error */
3136 /* append an end-of-function-label to IR tree */
3137 n
= new_seq(n
, new_label(A
->curFuncEndLabel
));
3139 /*_slang_label_delete(A->curFuncEndLabel);*/
3140 A
->curFuncEndLabel
= NULL
;
3143 printf("************* New AST for %s *****\n", (char*)fun
->header
.a_name
);
3144 slang_print_function(fun
, 1);
3147 printf("************* IR for %s *******\n", (char*)fun
->header
.a_name
);
3148 _slang_print_ir_tree(n
, 0);
3151 printf("************* End codegen function ************\n\n");
3154 /* Emit program instructions */
3155 success
= _slang_emit_code(n
, A
->vartable
, A
->program
, GL_TRUE
, A
->log
);
3156 _slang_free_ir_tree(n
);
3158 /* free codegen context */
3160 _mesa_free(A->codegen);