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.
44 #include "prog_instruction.h"
45 #include "prog_parameter.h"
46 #include "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_simplify.h"
52 #include "slang_emit.h"
53 #include "slang_vartable.h"
55 #include "slang_print.h"
58 static slang_ir_node
*
59 _slang_gen_operation(slang_assemble_ctx
* A
, slang_operation
*oper
);
63 is_sampler_type(const slang_fully_specified_type
*t
)
65 switch (t
->specifier
.type
) {
66 case SLANG_SPEC_SAMPLER1D
:
67 case SLANG_SPEC_SAMPLER2D
:
68 case SLANG_SPEC_SAMPLER3D
:
69 case SLANG_SPEC_SAMPLERCUBE
:
70 case SLANG_SPEC_SAMPLER1DSHADOW
:
71 case SLANG_SPEC_SAMPLER2DSHADOW
:
72 case SLANG_SPEC_SAMPLER2DRECT
:
73 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
82 * Return the offset (in floats or ints) of the named field within
83 * the given struct. Return -1 if field not found.
84 * If field is NULL, return the size of the struct instead.
87 _slang_field_offset(const slang_type_specifier
*spec
, slang_atom field
)
91 for (i
= 0; i
< spec
->_struct
->fields
->num_variables
; i
++) {
92 const slang_variable
*v
= spec
->_struct
->fields
->variables
[i
];
93 const GLuint sz
= _slang_sizeof_type_specifier(&v
->type
.specifier
);
95 /* types larger than 1 float are register (4-float) aligned */
96 offset
= (offset
+ 3) & ~3;
98 if (field
&& v
->a_name
== field
) {
104 return -1; /* field not found */
106 return offset
; /* struct size */
111 _slang_sizeof_type_specifier(const slang_type_specifier
*spec
)
113 switch (spec
->type
) {
114 case SLANG_SPEC_VOID
:
116 case SLANG_SPEC_BOOL
:
118 case SLANG_SPEC_BVEC2
:
120 case SLANG_SPEC_BVEC3
:
122 case SLANG_SPEC_BVEC4
:
126 case SLANG_SPEC_IVEC2
:
128 case SLANG_SPEC_IVEC3
:
130 case SLANG_SPEC_IVEC4
:
132 case SLANG_SPEC_FLOAT
:
134 case SLANG_SPEC_VEC2
:
136 case SLANG_SPEC_VEC3
:
138 case SLANG_SPEC_VEC4
:
140 case SLANG_SPEC_MAT2
:
142 case SLANG_SPEC_MAT3
:
144 case SLANG_SPEC_MAT4
:
146 case SLANG_SPEC_SAMPLER1D
:
147 case SLANG_SPEC_SAMPLER2D
:
148 case SLANG_SPEC_SAMPLER3D
:
149 case SLANG_SPEC_SAMPLERCUBE
:
150 case SLANG_SPEC_SAMPLER1DSHADOW
:
151 case SLANG_SPEC_SAMPLER2DSHADOW
:
152 case SLANG_SPEC_SAMPLER2DRECT
:
153 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
154 return 1; /* a sampler is basically just an integer index */
155 case SLANG_SPEC_STRUCT
:
156 return _slang_field_offset(spec
, 0); /* special use */
157 case SLANG_SPEC_ARRAY
:
158 return _slang_sizeof_type_specifier(spec
->_array
);
160 _mesa_problem(NULL
, "Unexpected type in _slang_sizeof_type_specifier()");
168 * Establish the binding between a slang_ir_node and a slang_variable.
169 * Then, allocate/attach a slang_ir_storage object to the IR node if needed.
170 * The IR node must be a IR_VAR or IR_VAR_DECL node.
171 * \param n the IR node
172 * \param var the variable to associate with the IR node
175 _slang_attach_storage(slang_ir_node
*n
, slang_variable
*var
)
179 assert(n
->Opcode
== IR_VAR
|| n
->Opcode
== IR_VAR_DECL
);
180 assert(!n
->Var
|| n
->Var
== var
);
185 /* need to setup storage */
186 if (n
->Var
&& n
->Var
->aux
) {
187 /* node storage info = var storage info */
188 n
->Store
= (slang_ir_storage
*) n
->Var
->aux
;
191 /* alloc new storage info */
192 n
->Store
= _slang_new_ir_storage(PROGRAM_UNDEFINED
, -1, -5);
194 n
->Var
->aux
= n
->Store
;
202 * Return the TEXTURE_*_INDEX value that corresponds to a sampler type,
203 * or -1 if the type is not a sampler.
206 sampler_to_texture_index(const slang_type_specifier_type type
)
209 case SLANG_SPEC_SAMPLER1D
:
210 return TEXTURE_1D_INDEX
;
211 case SLANG_SPEC_SAMPLER2D
:
212 return TEXTURE_2D_INDEX
;
213 case SLANG_SPEC_SAMPLER3D
:
214 return TEXTURE_3D_INDEX
;
215 case SLANG_SPEC_SAMPLERCUBE
:
216 return TEXTURE_CUBE_INDEX
;
217 case SLANG_SPEC_SAMPLER1DSHADOW
:
218 return TEXTURE_1D_INDEX
; /* XXX fix */
219 case SLANG_SPEC_SAMPLER2DSHADOW
:
220 return TEXTURE_2D_INDEX
; /* XXX fix */
221 case SLANG_SPEC_SAMPLER2DRECT
:
222 return TEXTURE_RECT_INDEX
;
223 case SLANG_SPEC_SAMPLER2DRECTSHADOW
:
224 return TEXTURE_RECT_INDEX
; /* XXX fix */
232 * Return the VERT_ATTRIB_* or FRAG_ATTRIB_* value that corresponds to
233 * a vertex or fragment program input variable. Return -1 if the input
235 * XXX return size too
238 _slang_input_index(const char *name
, GLenum target
, GLuint
*swizzleOut
)
245 static const struct input_info vertInputs
[] = {
246 { "gl_Vertex", VERT_ATTRIB_POS
, SWIZZLE_NOOP
},
247 { "gl_Normal", VERT_ATTRIB_NORMAL
, SWIZZLE_NOOP
},
248 { "gl_Color", VERT_ATTRIB_COLOR0
, SWIZZLE_NOOP
},
249 { "gl_SecondaryColor", VERT_ATTRIB_COLOR1
, SWIZZLE_NOOP
},
250 { "gl_FogCoord", VERT_ATTRIB_FOG
, SWIZZLE_XXXX
},
251 { "gl_MultiTexCoord0", VERT_ATTRIB_TEX0
, SWIZZLE_NOOP
},
252 { "gl_MultiTexCoord1", VERT_ATTRIB_TEX1
, SWIZZLE_NOOP
},
253 { "gl_MultiTexCoord2", VERT_ATTRIB_TEX2
, SWIZZLE_NOOP
},
254 { "gl_MultiTexCoord3", VERT_ATTRIB_TEX3
, SWIZZLE_NOOP
},
255 { "gl_MultiTexCoord4", VERT_ATTRIB_TEX4
, SWIZZLE_NOOP
},
256 { "gl_MultiTexCoord5", VERT_ATTRIB_TEX5
, SWIZZLE_NOOP
},
257 { "gl_MultiTexCoord6", VERT_ATTRIB_TEX6
, SWIZZLE_NOOP
},
258 { "gl_MultiTexCoord7", VERT_ATTRIB_TEX7
, SWIZZLE_NOOP
},
259 { NULL
, 0, SWIZZLE_NOOP
}
261 static const struct input_info fragInputs
[] = {
262 { "gl_FragCoord", FRAG_ATTRIB_WPOS
, SWIZZLE_NOOP
},
263 { "gl_Color", FRAG_ATTRIB_COL0
, SWIZZLE_NOOP
},
264 { "gl_SecondaryColor", FRAG_ATTRIB_COL1
, SWIZZLE_NOOP
},
265 { "gl_FogFragCoord", FRAG_ATTRIB_FOGC
, SWIZZLE_XXXX
},
266 { "gl_TexCoord", FRAG_ATTRIB_TEX0
, SWIZZLE_NOOP
},
267 { "gl_FrontFacing", FRAG_ATTRIB_FOGC
, SWIZZLE_YYYY
}, /*XXX*/
268 { NULL
, 0, SWIZZLE_NOOP
}
271 const struct input_info
*inputs
272 = (target
== GL_VERTEX_PROGRAM_ARB
) ? vertInputs
: fragInputs
;
274 ASSERT(MAX_TEXTURE_UNITS
== 8); /* if this fails, fix vertInputs above */
276 for (i
= 0; inputs
[i
].Name
; i
++) {
277 if (strcmp(inputs
[i
].Name
, name
) == 0) {
279 *swizzleOut
= inputs
[i
].Swizzle
;
280 return inputs
[i
].Attrib
;
288 * Return the VERT_RESULT_* or FRAG_RESULT_* value that corresponds to
289 * a vertex or fragment program output variable. Return -1 for an invalid
293 _slang_output_index(const char *name
, GLenum target
)
299 static const struct output_info vertOutputs
[] = {
300 { "gl_Position", VERT_RESULT_HPOS
},
301 { "gl_FrontColor", VERT_RESULT_COL0
},
302 { "gl_BackColor", VERT_RESULT_BFC0
},
303 { "gl_FrontSecondaryColor", VERT_RESULT_COL1
},
304 { "gl_BackSecondaryColor", VERT_RESULT_BFC1
},
305 { "gl_TexCoord", VERT_RESULT_TEX0
},
306 { "gl_FogFragCoord", VERT_RESULT_FOGC
},
307 { "gl_PointSize", VERT_RESULT_PSIZ
},
310 static const struct output_info fragOutputs
[] = {
311 { "gl_FragColor", FRAG_RESULT_COLR
},
312 { "gl_FragDepth", FRAG_RESULT_DEPR
},
313 { "gl_FragData", FRAG_RESULT_DATA0
},
317 const struct output_info
*outputs
318 = (target
== GL_VERTEX_PROGRAM_ARB
) ? vertOutputs
: fragOutputs
;
320 for (i
= 0; outputs
[i
].Name
; i
++) {
321 if (strcmp(outputs
[i
].Name
, name
) == 0) {
323 return outputs
[i
].Attrib
;
331 /**********************************************************************/
335 * Map "_asm foo" to IR_FOO, etc.
340 slang_ir_opcode Opcode
;
341 GLuint HaveRetValue
, NumParams
;
345 static slang_asm_info AsmInfo
[] = {
347 { "vec4_add", IR_ADD
, 1, 2 },
348 { "vec4_subtract", IR_SUB
, 1, 2 },
349 { "vec4_multiply", IR_MUL
, 1, 2 },
350 { "vec4_dot", IR_DOT4
, 1, 2 },
351 { "vec3_dot", IR_DOT3
, 1, 2 },
352 { "vec3_cross", IR_CROSS
, 1, 2 },
353 { "vec4_lrp", IR_LRP
, 1, 3 },
354 { "vec4_min", IR_MIN
, 1, 2 },
355 { "vec4_max", IR_MAX
, 1, 2 },
356 { "vec4_clamp", IR_CLAMP
, 1, 3 },
357 { "vec4_seq", IR_SEQUAL
, 1, 2 },
358 { "vec4_sne", IR_SNEQUAL
, 1, 2 },
359 { "vec4_sge", IR_SGE
, 1, 2 },
360 { "vec4_sgt", IR_SGT
, 1, 2 },
361 { "vec4_sle", IR_SLE
, 1, 2 },
362 { "vec4_slt", IR_SLT
, 1, 2 },
364 { "vec4_floor", IR_FLOOR
, 1, 1 },
365 { "vec4_frac", IR_FRAC
, 1, 1 },
366 { "vec4_abs", IR_ABS
, 1, 1 },
367 { "vec4_negate", IR_NEG
, 1, 1 },
368 { "vec4_ddx", IR_DDX
, 1, 1 },
369 { "vec4_ddy", IR_DDY
, 1, 1 },
370 /* float binary op */
371 { "float_power", IR_POW
, 1, 2 },
372 /* texture / sampler */
373 { "vec4_tex1d", IR_TEX
, 1, 2 },
374 { "vec4_texb1d", IR_TEXB
, 1, 2 }, /* 1d w/ bias */
375 { "vec4_texp1d", IR_TEXP
, 1, 2 }, /* 1d w/ projection */
376 { "vec4_tex2d", IR_TEX
, 1, 2 },
377 { "vec4_texb2d", IR_TEXB
, 1, 2 }, /* 2d w/ bias */
378 { "vec4_texp2d", IR_TEXP
, 1, 2 }, /* 2d w/ projection */
379 { "vec4_tex3d", IR_TEX
, 1, 2 },
380 { "vec4_texb3d", IR_TEXB
, 1, 2 }, /* 3d w/ bias */
381 { "vec4_texp3d", IR_TEXP
, 1, 2 }, /* 3d w/ projection */
382 { "vec4_texcube", IR_TEX
, 1, 2 }, /* cubemap */
383 { "vec4_tex_rect", IR_TEX
, 1, 2 }, /* rectangle */
384 { "vec4_texp_rect", IR_TEX
, 1, 2 },/* rectangle w/ projection */
387 { "int_to_float", IR_I_TO_F
, 1, 1 },
388 { "float_to_int", IR_F_TO_I
, 1, 1 },
389 { "float_exp", IR_EXP
, 1, 1 },
390 { "float_exp2", IR_EXP2
, 1, 1 },
391 { "float_log2", IR_LOG2
, 1, 1 },
392 { "float_rsq", IR_RSQ
, 1, 1 },
393 { "float_rcp", IR_RCP
, 1, 1 },
394 { "float_sine", IR_SIN
, 1, 1 },
395 { "float_cosine", IR_COS
, 1, 1 },
396 { "float_noise1", IR_NOISE1
, 1, 1},
397 { "float_noise2", IR_NOISE2
, 1, 1},
398 { "float_noise3", IR_NOISE3
, 1, 1},
399 { "float_noise4", IR_NOISE4
, 1, 1},
401 { NULL
, IR_NOP
, 0, 0 }
405 static slang_ir_node
*
406 new_node3(slang_ir_opcode op
,
407 slang_ir_node
*c0
, slang_ir_node
*c1
, slang_ir_node
*c2
)
409 slang_ir_node
*n
= (slang_ir_node
*) calloc(1, sizeof(slang_ir_node
));
415 n
->Writemask
= WRITEMASK_XYZW
;
416 n
->InstLocation
= -1;
421 static slang_ir_node
*
422 new_node2(slang_ir_opcode op
, slang_ir_node
*c0
, slang_ir_node
*c1
)
424 return new_node3(op
, c0
, c1
, NULL
);
427 static slang_ir_node
*
428 new_node1(slang_ir_opcode op
, slang_ir_node
*c0
)
430 return new_node3(op
, c0
, NULL
, NULL
);
433 static slang_ir_node
*
434 new_node0(slang_ir_opcode op
)
436 return new_node3(op
, NULL
, NULL
, NULL
);
440 static slang_ir_node
*
441 new_seq(slang_ir_node
*left
, slang_ir_node
*right
)
447 return new_node2(IR_SEQ
, left
, right
);
450 static slang_ir_node
*
451 new_label(slang_label
*label
)
453 slang_ir_node
*n
= new_node0(IR_LABEL
);
460 static slang_ir_node
*
461 new_float_literal(const float v
[4], GLuint size
)
463 slang_ir_node
*n
= new_node0(IR_FLOAT
);
465 COPY_4V(n
->Value
, v
);
466 /* allocate a storage object, but compute actual location (Index) later */
467 n
->Store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, size
);
472 static slang_ir_node
*
473 new_not(slang_ir_node
*n
)
475 return new_node1(IR_NOT
, n
);
480 * Inlined subroutine.
482 static slang_ir_node
*
483 new_inlined_function_call(slang_ir_node
*code
, slang_label
*name
)
485 slang_ir_node
*n
= new_node1(IR_FUNC
, code
);
494 * Unconditional jump.
496 static slang_ir_node
*
497 new_return(slang_label
*dest
)
499 slang_ir_node
*n
= new_node0(IR_RETURN
);
507 static slang_ir_node
*
508 new_loop(slang_ir_node
*body
)
510 return new_node1(IR_LOOP
, body
);
514 static slang_ir_node
*
515 new_break(slang_ir_node
*loopNode
)
517 slang_ir_node
*n
= new_node0(IR_BREAK
);
519 assert(loopNode
->Opcode
== IR_LOOP
);
521 /* insert this node at head of linked list */
522 n
->List
= loopNode
->List
;
530 * Make new IR_BREAK_IF_TRUE.
532 static slang_ir_node
*
533 new_break_if_true(slang_ir_node
*loopNode
, slang_ir_node
*cond
)
537 assert(loopNode
->Opcode
== IR_LOOP
);
538 n
= new_node1(IR_BREAK_IF_TRUE
, cond
);
540 /* insert this node at head of linked list */
541 n
->List
= loopNode
->List
;
549 * Make new IR_CONT_IF_TRUE node.
551 static slang_ir_node
*
552 new_cont_if_true(slang_ir_node
*loopNode
, slang_ir_node
*cond
)
556 assert(loopNode
->Opcode
== IR_LOOP
);
557 n
= new_node1(IR_CONT_IF_TRUE
, cond
);
559 /* insert this node at head of linked list */
560 n
->List
= loopNode
->List
;
567 static slang_ir_node
*
568 new_cond(slang_ir_node
*n
)
570 slang_ir_node
*c
= new_node1(IR_COND
, n
);
575 static slang_ir_node
*
576 new_if(slang_ir_node
*cond
, slang_ir_node
*ifPart
, slang_ir_node
*elsePart
)
578 return new_node3(IR_IF
, cond
, ifPart
, elsePart
);
583 * New IR_VAR node - a reference to a previously declared variable.
585 static slang_ir_node
*
586 new_var(slang_assemble_ctx
*A
, slang_operation
*oper
, slang_atom name
)
589 slang_variable
*var
= _slang_locate_variable(oper
->locals
, name
, GL_TRUE
);
593 assert(!oper
->var
|| oper
->var
== var
);
595 n
= new_node0(IR_VAR
);
597 _slang_attach_storage(n
, var
);
604 * Check if the given function is really just a wrapper for a
605 * basic assembly instruction.
608 slang_is_asm_function(const slang_function
*fun
)
610 if (fun
->body
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
&&
611 fun
->body
->num_children
== 1 &&
612 fun
->body
->children
[0].type
== SLANG_OPER_ASM
) {
620 _slang_is_noop(const slang_operation
*oper
)
623 oper
->type
== SLANG_OPER_VOID
||
624 (oper
->num_children
== 1 && oper
->children
[0].type
== SLANG_OPER_VOID
))
632 * Recursively search tree for a node of the given type.
634 static slang_operation
*
635 _slang_find_node_type(slang_operation
*oper
, slang_operation_type type
)
638 if (oper
->type
== type
)
640 for (i
= 0; i
< oper
->num_children
; i
++) {
641 slang_operation
*p
= _slang_find_node_type(&oper
->children
[i
], type
);
650 * Produce inline code for a call to an assembly instruction.
651 * XXX Note: children are passed as asm args in-order, not by name!
653 static slang_operation
*
654 slang_inline_asm_function(slang_assemble_ctx
*A
,
655 slang_function
*fun
, slang_operation
*oper
)
657 const GLuint numArgs
= oper
->num_children
;
658 const slang_operation
*args
= oper
->children
;
660 slang_operation
*inlined
= slang_operation_new(1);
662 /*assert(oper->type == SLANG_OPER_CALL); or vec4_add, etc */
664 printf("Inline asm %s\n", (char*) fun->header.a_name);
666 inlined
->type
= fun
->body
->children
[0].type
;
667 inlined
->a_id
= fun
->body
->children
[0].a_id
;
668 inlined
->num_children
= numArgs
;
669 inlined
->children
= slang_operation_new(numArgs
);
670 inlined
->locals
->outer_scope
= oper
->locals
->outer_scope
;
672 for (i
= 0; i
< numArgs
; i
++) {
673 slang_operation_copy(inlined
->children
+ i
, args
+ i
);
681 slang_resolve_variable(slang_operation
*oper
)
683 if (oper
->type
== SLANG_OPER_IDENTIFIER
&& !oper
->var
) {
684 oper
->var
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
690 * Replace particular variables (SLANG_OPER_IDENTIFIER) with new expressions.
693 slang_substitute(slang_assemble_ctx
*A
, slang_operation
*oper
,
694 GLuint substCount
, slang_variable
**substOld
,
695 slang_operation
**substNew
, GLboolean isLHS
)
697 switch (oper
->type
) {
698 case SLANG_OPER_VARIABLE_DECL
:
700 slang_variable
*v
= _slang_locate_variable(oper
->locals
,
701 oper
->a_id
, GL_TRUE
);
703 if (v
->initializer
&& oper
->num_children
== 0) {
704 /* set child of oper to copy of initializer */
705 oper
->num_children
= 1;
706 oper
->children
= slang_operation_new(1);
707 slang_operation_copy(&oper
->children
[0], v
->initializer
);
709 if (oper
->num_children
== 1) {
710 /* the initializer */
711 slang_substitute(A
, &oper
->children
[0], substCount
,
712 substOld
, substNew
, GL_FALSE
);
716 case SLANG_OPER_IDENTIFIER
:
717 assert(oper
->num_children
== 0);
718 if (1/**!isLHS XXX FIX */) {
719 slang_atom id
= oper
->a_id
;
722 v
= _slang_locate_variable(oper
->locals
, id
, GL_TRUE
);
724 _mesa_problem(NULL
, "var %s not found!\n", (char *) oper
->a_id
);
728 /* look for a substitution */
729 for (i
= 0; i
< substCount
; i
++) {
730 if (v
== substOld
[i
]) {
731 /* OK, replace this SLANG_OPER_IDENTIFIER with a new expr */
732 #if 0 /* DEBUG only */
733 if (substNew
[i
]->type
== SLANG_OPER_IDENTIFIER
) {
734 assert(substNew
[i
]->var
);
735 assert(substNew
[i
]->var
->a_name
);
736 printf("Substitute %s with %s in id node %p\n",
737 (char*)v
->a_name
, (char*) substNew
[i
]->var
->a_name
,
741 printf("Substitute %s with %f in id node %p\n",
742 (char*)v
->a_name
, substNew
[i
]->literal
[0],
746 slang_operation_copy(oper
, substNew
[i
]);
753 case SLANG_OPER_RETURN
:
754 /* do return replacement here too */
755 assert(oper
->num_children
== 0 || oper
->num_children
== 1);
756 if (oper
->num_children
== 1 && !_slang_is_noop(&oper
->children
[0])) {
762 * then do substitutions on the assignment.
764 slang_operation
*blockOper
, *assignOper
, *returnOper
;
766 /* check if function actually has a return type */
767 assert(A
->CurFunction
);
768 if (A
->CurFunction
->header
.type
.specifier
.type
== SLANG_SPEC_VOID
) {
769 slang_info_log_error(A
->log
, "illegal return expression");
773 blockOper
= slang_operation_new(1);
774 blockOper
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
;
775 blockOper
->num_children
= 2;
776 blockOper
->locals
->outer_scope
= oper
->locals
->outer_scope
;
777 blockOper
->children
= slang_operation_new(2);
778 assignOper
= blockOper
->children
+ 0;
779 returnOper
= blockOper
->children
+ 1;
781 assignOper
->type
= SLANG_OPER_ASSIGN
;
782 assignOper
->num_children
= 2;
783 assignOper
->locals
->outer_scope
= blockOper
->locals
;
784 assignOper
->children
= slang_operation_new(2);
785 assignOper
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
786 assignOper
->children
[0].a_id
= slang_atom_pool_atom(A
->atoms
, "__retVal");
787 assignOper
->children
[0].locals
->outer_scope
= assignOper
->locals
;
789 slang_operation_copy(&assignOper
->children
[1],
792 returnOper
->type
= SLANG_OPER_RETURN
; /* return w/ no value */
793 assert(returnOper
->num_children
== 0);
795 /* do substitutions on the "__retVal = expr" sub-tree */
796 slang_substitute(A
, assignOper
,
797 substCount
, substOld
, substNew
, GL_FALSE
);
799 /* install new code */
800 slang_operation_copy(oper
, blockOper
);
801 slang_operation_destruct(blockOper
);
804 /* check if return value was expected */
805 assert(A
->CurFunction
);
806 if (A
->CurFunction
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
807 slang_info_log_error(A
->log
, "return statement requires an expression");
813 case SLANG_OPER_ASSIGN
:
814 case SLANG_OPER_SUBSCRIPT
:
816 * child[0] can't have substitutions but child[1] can.
818 slang_substitute(A
, &oper
->children
[0],
819 substCount
, substOld
, substNew
, GL_TRUE
);
820 slang_substitute(A
, &oper
->children
[1],
821 substCount
, substOld
, substNew
, GL_FALSE
);
823 case SLANG_OPER_FIELD
:
825 slang_substitute(A
, &oper
->children
[0],
826 substCount
, substOld
, substNew
, GL_TRUE
);
831 for (i
= 0; i
< oper
->num_children
; i
++)
832 slang_substitute(A
, &oper
->children
[i
],
833 substCount
, substOld
, substNew
, GL_FALSE
);
841 * Inline the given function call operation.
842 * Return a new slang_operation that corresponds to the inlined code.
844 static slang_operation
*
845 slang_inline_function_call(slang_assemble_ctx
* A
, slang_function
*fun
,
846 slang_operation
*oper
, slang_operation
*returnOper
)
853 ParamMode
*paramMode
;
854 const GLboolean haveRetValue
= _slang_function_has_return_value(fun
);
855 const GLuint numArgs
= oper
->num_children
;
856 const GLuint totalArgs
= numArgs
+ haveRetValue
;
857 slang_operation
*args
= oper
->children
;
858 slang_operation
*inlined
, *top
;
859 slang_variable
**substOld
;
860 slang_operation
**substNew
;
861 GLuint substCount
, numCopyIn
, i
;
862 slang_function
*prevFunction
;
865 prevFunction
= A
->CurFunction
;
866 A
->CurFunction
= fun
;
868 /*assert(oper->type == SLANG_OPER_CALL); (or (matrix) multiply, etc) */
869 assert(fun
->param_count
== totalArgs
);
871 /* allocate temporary arrays */
872 paramMode
= (ParamMode
*)
873 _mesa_calloc(totalArgs
* sizeof(ParamMode
));
874 substOld
= (slang_variable
**)
875 _mesa_calloc(totalArgs
* sizeof(slang_variable
*));
876 substNew
= (slang_operation
**)
877 _mesa_calloc(totalArgs
* sizeof(slang_operation
*));
880 printf("Inline call to %s (total vars=%d nparams=%d)\n",
881 (char *) fun
->header
.a_name
,
882 fun
->parameters
->num_variables
, numArgs
);
885 if (haveRetValue
&& !returnOper
) {
886 /* Create 3-child comma sequence for inlined code:
887 * child[0]: declare __resultTmp
888 * child[1]: inlined function body
889 * child[2]: __resultTmp
891 slang_operation
*commaSeq
;
892 slang_operation
*declOper
= NULL
;
893 slang_variable
*resultVar
;
895 commaSeq
= slang_operation_new(1);
896 commaSeq
->type
= SLANG_OPER_SEQUENCE
;
897 assert(commaSeq
->locals
);
898 commaSeq
->locals
->outer_scope
= oper
->locals
->outer_scope
;
899 commaSeq
->num_children
= 3;
900 commaSeq
->children
= slang_operation_new(3);
901 /* allocate the return var */
902 resultVar
= slang_variable_scope_grow(commaSeq
->locals
);
904 printf("Alloc __resultTmp in scope %p for retval of calling %s\n",
905 (void*)commaSeq->locals, (char *) fun->header.a_name);
908 resultVar
->a_name
= slang_atom_pool_atom(A
->atoms
, "__resultTmp");
909 resultVar
->type
= fun
->header
.type
; /* XXX copy? */
910 resultVar
->isTemp
= GL_TRUE
;
912 /* child[0] = __resultTmp declaration */
913 declOper
= &commaSeq
->children
[0];
914 declOper
->type
= SLANG_OPER_VARIABLE_DECL
;
915 declOper
->a_id
= resultVar
->a_name
;
916 declOper
->locals
->outer_scope
= commaSeq
->locals
;
918 /* child[1] = function body */
919 inlined
= &commaSeq
->children
[1];
920 inlined
->locals
->outer_scope
= commaSeq
->locals
;
922 /* child[2] = __resultTmp reference */
923 returnOper
= &commaSeq
->children
[2];
924 returnOper
->type
= SLANG_OPER_IDENTIFIER
;
925 returnOper
->a_id
= resultVar
->a_name
;
926 returnOper
->locals
->outer_scope
= commaSeq
->locals
;
931 top
= inlined
= slang_operation_new(1);
932 /* XXXX this may be inappropriate!!!! */
933 inlined
->locals
->outer_scope
= oper
->locals
->outer_scope
;
937 assert(inlined
->locals
);
939 /* Examine the parameters, look for inout/out params, look for possible
940 * substitutions, etc:
941 * param type behaviour
942 * in copy actual to local
943 * const in substitute param with actual
947 for (i
= 0; i
< totalArgs
; i
++) {
948 slang_variable
*p
= fun
->parameters
->variables
[i
];
950 printf("Param %d: %s %s \n", i,
951 slang_type_qual_string(p->type.qualifier),
954 if (p
->type
.qualifier
== SLANG_QUAL_INOUT
||
955 p
->type
.qualifier
== SLANG_QUAL_OUT
) {
956 /* an output param */
957 slang_operation
*arg
;
962 paramMode
[i
] = SUBST
;
964 if (arg
->type
== SLANG_OPER_IDENTIFIER
)
965 slang_resolve_variable(arg
);
967 /* replace parameter 'p' with argument 'arg' */
968 substOld
[substCount
] = p
;
969 substNew
[substCount
] = arg
; /* will get copied */
972 else if (p
->type
.qualifier
== SLANG_QUAL_CONST
) {
973 /* a constant input param */
974 if (args
[i
].type
== SLANG_OPER_IDENTIFIER
||
975 args
[i
].type
== SLANG_OPER_LITERAL_FLOAT
) {
976 /* replace all occurances of this parameter variable with the
977 * actual argument variable or a literal.
979 paramMode
[i
] = SUBST
;
980 slang_resolve_variable(&args
[i
]);
981 substOld
[substCount
] = p
;
982 substNew
[substCount
] = &args
[i
]; /* will get copied */
986 paramMode
[i
] = COPY_IN
;
990 paramMode
[i
] = COPY_IN
;
992 assert(paramMode
[i
]);
995 /* actual code inlining: */
996 slang_operation_copy(inlined
, fun
->body
);
998 /*** XXX review this */
999 assert(inlined
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
);
1000 inlined
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
;
1003 printf("======================= orig body code ======================\n");
1004 printf("=== params scope = %p\n", (void*) fun
->parameters
);
1005 slang_print_tree(fun
->body
, 8);
1006 printf("======================= copied code =========================\n");
1007 slang_print_tree(inlined
, 8);
1010 /* do parameter substitution in inlined code: */
1011 slang_substitute(A
, inlined
, substCount
, substOld
, substNew
, GL_FALSE
);
1014 printf("======================= subst code ==========================\n");
1015 slang_print_tree(inlined
, 8);
1016 printf("=============================================================\n");
1019 /* New prolog statements: (inserted before the inlined code)
1020 * Copy the 'in' arguments.
1023 for (i
= 0; i
< numArgs
; i
++) {
1024 if (paramMode
[i
] == COPY_IN
) {
1025 slang_variable
*p
= fun
->parameters
->variables
[i
];
1026 /* declare parameter 'p' */
1027 slang_operation
*decl
= slang_operation_insert(&inlined
->num_children
,
1031 printf("COPY_IN %s from expr\n", (char*)p->a_name);
1033 decl
->type
= SLANG_OPER_VARIABLE_DECL
;
1034 assert(decl
->locals
);
1035 decl
->locals
->outer_scope
= inlined
->locals
;
1036 decl
->a_id
= p
->a_name
;
1037 decl
->num_children
= 1;
1038 decl
->children
= slang_operation_new(1);
1040 /* child[0] is the var's initializer */
1041 slang_operation_copy(&decl
->children
[0], args
+ i
);
1047 /* New epilog statements:
1048 * 1. Create end of function label to jump to from return statements.
1049 * 2. Copy the 'out' parameter vars
1052 slang_operation
*lab
= slang_operation_insert(&inlined
->num_children
,
1054 inlined
->num_children
);
1055 lab
->type
= SLANG_OPER_LABEL
;
1056 lab
->label
= A
->curFuncEndLabel
;
1059 for (i
= 0; i
< totalArgs
; i
++) {
1060 if (paramMode
[i
] == COPY_OUT
) {
1061 const slang_variable
*p
= fun
->parameters
->variables
[i
];
1062 /* actualCallVar = outParam */
1063 /*if (i > 0 || !haveRetValue)*/
1064 slang_operation
*ass
= slang_operation_insert(&inlined
->num_children
,
1066 inlined
->num_children
);
1067 ass
->type
= SLANG_OPER_ASSIGN
;
1068 ass
->num_children
= 2;
1069 ass
->locals
->outer_scope
= inlined
->locals
;
1070 ass
->children
= slang_operation_new(2);
1071 ass
->children
[0] = args
[i
]; /*XXX copy */
1072 ass
->children
[1].type
= SLANG_OPER_IDENTIFIER
;
1073 ass
->children
[1].a_id
= p
->a_name
;
1074 ass
->children
[1].locals
->outer_scope
= ass
->locals
;
1078 _mesa_free(paramMode
);
1079 _mesa_free(substOld
);
1080 _mesa_free(substNew
);
1083 printf("Done Inline call to %s (total vars=%d nparams=%d)\n",
1084 (char *) fun
->header
.a_name
,
1085 fun
->parameters
->num_variables
, numArgs
);
1086 slang_print_tree(top
, 0);
1090 A
->CurFunction
= prevFunction
;
1096 static slang_ir_node
*
1097 _slang_gen_function_call(slang_assemble_ctx
*A
, slang_function
*fun
,
1098 slang_operation
*oper
, slang_operation
*dest
)
1101 slang_operation
*inlined
;
1102 slang_label
*prevFuncEndLabel
;
1105 prevFuncEndLabel
= A
->curFuncEndLabel
;
1106 sprintf(name
, "__endOfFunc_%s_", (char *) fun
->header
.a_name
);
1107 A
->curFuncEndLabel
= _slang_label_new(name
);
1108 assert(A
->curFuncEndLabel
);
1110 if (slang_is_asm_function(fun
) && !dest
) {
1111 /* assemble assembly function - tree style */
1112 inlined
= slang_inline_asm_function(A
, fun
, oper
);
1115 /* non-assembly function */
1116 inlined
= slang_inline_function_call(A
, fun
, oper
, dest
);
1117 if (inlined
&& _slang_find_node_type(inlined
, SLANG_OPER_RETURN
)) {
1118 /* This inlined function has one or more 'return' statements.
1119 * So, we can't truly inline this function because we need to
1120 * implement 'return' with RET (and CAL).
1121 * XXX check if there's one 'return' and if it's the very last
1122 * statement in the function - we can optimize that case.
1124 assert(inlined
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
||
1125 inlined
->type
== SLANG_OPER_SEQUENCE
);
1126 inlined
->type
= SLANG_OPER_INLINED_CALL
;
1128 inlined
->label
= _slang_label_new_unique((char*) fun
->header
.a_name
);
1135 /* Replace the function call with the inlined block */
1136 slang_operation_destruct(oper
);
1138 /* XXX slang_operation_destruct(inlined) ??? */
1141 assert(inlined
->locals
);
1142 printf("*** Inlined code for call to %s:\n",
1143 (char*) fun
->header
.a_name
);
1144 slang_print_tree(oper
, 10);
1148 n
= _slang_gen_operation(A
, oper
);
1150 /*_slang_label_delete(A->curFuncEndLabel);*/
1151 A
->curFuncEndLabel
= prevFuncEndLabel
;
1152 assert(A
->curFuncEndLabel
);
1158 static slang_asm_info
*
1159 slang_find_asm_info(const char *name
)
1162 for (i
= 0; AsmInfo
[i
].Name
; i
++) {
1163 if (_mesa_strcmp(AsmInfo
[i
].Name
, name
) == 0) {
1172 make_writemask(const char *field
)
1178 mask
|= WRITEMASK_X
;
1181 mask
|= WRITEMASK_Y
;
1184 mask
|= WRITEMASK_Z
;
1187 mask
|= WRITEMASK_W
;
1190 _mesa_problem(NULL
, "invalid writemask in make_writemask()");
1196 return WRITEMASK_XYZW
;
1203 * Generate IR tree for an asm instruction/operation such as:
1204 * __asm vec4_dot __retVal.x, v1, v2;
1206 static slang_ir_node
*
1207 _slang_gen_asm(slang_assemble_ctx
*A
, slang_operation
*oper
,
1208 slang_operation
*dest
)
1210 const slang_asm_info
*info
;
1211 slang_ir_node
*kids
[3], *n
;
1212 GLuint j
, firstOperand
;
1214 assert(oper
->type
== SLANG_OPER_ASM
);
1216 info
= slang_find_asm_info((char *) oper
->a_id
);
1218 _mesa_problem(NULL
, "undefined __asm function %s\n",
1219 (char *) oper
->a_id
);
1222 assert(info
->NumParams
<= 3);
1224 if (info
->NumParams
== oper
->num_children
) {
1225 /* Storage for result is not specified.
1226 * Children[0], [1] are the operands.
1231 /* Storage for result (child[0]) is specified.
1232 * Children[1], [2] are the operands.
1237 /* assemble child(ren) */
1238 kids
[0] = kids
[1] = kids
[2] = NULL
;
1239 for (j
= 0; j
< info
->NumParams
; j
++) {
1240 kids
[j
] = _slang_gen_operation(A
, &oper
->children
[firstOperand
+ j
]);
1245 n
= new_node3(info
->Opcode
, kids
[0], kids
[1], kids
[2]);
1248 /* Setup n->Store to be a particular location. Otherwise, storage
1249 * for the result (a temporary) will be allocated later.
1251 GLuint writemask
= WRITEMASK_XYZW
;
1252 slang_operation
*dest_oper
;
1255 dest_oper
= &oper
->children
[0];
1256 while (dest_oper
->type
== SLANG_OPER_FIELD
) {
1258 writemask
&= make_writemask((char*) dest_oper
->a_id
);
1259 dest_oper
= &dest_oper
->children
[0];
1262 n0
= _slang_gen_operation(A
, dest_oper
);
1266 n
->Store
= n0
->Store
;
1267 n
->Writemask
= writemask
;
1277 print_funcs(struct slang_function_scope_
*scope
, const char *name
)
1280 for (i
= 0; i
< scope
->num_functions
; i
++) {
1281 slang_function
*f
= &scope
->functions
[i
];
1282 if (!name
|| strcmp(name
, (char*) f
->header
.a_name
) == 0)
1283 printf(" %s (%d args)\n", name
, f
->param_count
);
1286 if (scope
->outer_scope
)
1287 print_funcs(scope
->outer_scope
, name
);
1292 * Return first function in the scope that has the given name.
1293 * This is the function we'll try to call when there is no exact match
1294 * between function parameters and call arguments.
1296 * XXX we should really create a list of candidate functions and try
1299 static slang_function
*
1300 _slang_first_function(struct slang_function_scope_
*scope
, const char *name
)
1303 for (i
= 0; i
< scope
->num_functions
; i
++) {
1304 slang_function
*f
= &scope
->functions
[i
];
1305 if (strcmp(name
, (char*) f
->header
.a_name
) == 0)
1308 if (scope
->outer_scope
)
1309 return _slang_first_function(scope
->outer_scope
, name
);
1316 * Assemble a function call, given a particular function name.
1317 * \param name the function's name (operators like '*' are possible).
1319 static slang_ir_node
*
1320 _slang_gen_function_call_name(slang_assemble_ctx
*A
, const char *name
,
1321 slang_operation
*oper
, slang_operation
*dest
)
1323 slang_operation
*params
= oper
->children
;
1324 const GLuint param_count
= oper
->num_children
;
1326 slang_function
*fun
;
1328 atom
= slang_atom_pool_atom(A
->atoms
, name
);
1329 if (atom
== SLANG_ATOM_NULL
)
1333 * Use 'name' to find the function to call
1335 fun
= _slang_locate_function(A
->space
.funcs
, atom
, params
, param_count
,
1336 &A
->space
, A
->atoms
, A
->log
);
1338 /* A function with exactly the right parameters/types was not found.
1339 * Try adapting the parameters.
1341 fun
= _slang_first_function(A
->space
.funcs
, name
);
1342 if (!_slang_adapt_call(oper
, fun
, &A
->space
, A
->atoms
, A
->log
)) {
1343 slang_info_log_error(A
->log
, "Function '%s' not found (check argument types)", name
);
1349 return _slang_gen_function_call(A
, fun
, oper
, dest
);
1354 _slang_is_constant_cond(const slang_operation
*oper
, GLboolean
*value
)
1356 if (oper
->type
== SLANG_OPER_LITERAL_FLOAT
||
1357 oper
->type
== SLANG_OPER_LITERAL_INT
||
1358 oper
->type
== SLANG_OPER_LITERAL_BOOL
) {
1359 if (oper
->literal
[0])
1365 else if (oper
->type
== SLANG_OPER_EXPRESSION
&&
1366 oper
->num_children
== 1) {
1367 return _slang_is_constant_cond(&oper
->children
[0], value
);
1374 * Test if an operation is a scalar or boolean.
1377 _slang_is_scalar_or_boolean(slang_assemble_ctx
*A
, slang_operation
*oper
)
1379 slang_typeinfo type
;
1382 slang_typeinfo_construct(&type
);
1383 _slang_typeof_operation(A
, oper
, &type
);
1384 size
= _slang_sizeof_type_specifier(&type
.spec
);
1385 slang_typeinfo_destruct(&type
);
1391 * Generate loop code using high-level IR_LOOP instruction
1393 static slang_ir_node
*
1394 _slang_gen_while(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1398 * BREAK if !expr (child[0])
1399 * body code (child[1])
1401 slang_ir_node
*prevLoop
, *loop
, *breakIf
, *body
;
1402 GLboolean isConst
, constTrue
;
1404 /* type-check expression */
1405 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
1406 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'while'");
1410 /* Check if loop condition is a constant */
1411 isConst
= _slang_is_constant_cond(&oper
->children
[0], &constTrue
);
1413 if (isConst
&& !constTrue
) {
1414 /* loop is never executed! */
1415 return new_node0(IR_NOP
);
1418 loop
= new_loop(NULL
);
1420 /* save old, push new loop */
1421 prevLoop
= A
->CurLoop
;
1424 if (isConst
&& constTrue
) {
1425 /* while(nonzero constant), no conditional break */
1430 = new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[0])));
1431 breakIf
= new_break_if_true(A
->CurLoop
, cond
);
1433 body
= _slang_gen_operation(A
, &oper
->children
[1]);
1434 loop
->Children
[0] = new_seq(breakIf
, body
);
1436 /* Do infinite loop detection */
1437 /* loop->List is head of linked list of break/continue nodes */
1438 if (!loop
->List
&& isConst
&& constTrue
) {
1439 /* infinite loop detected */
1440 A
->CurLoop
= prevLoop
; /* clean-up */
1441 slang_info_log_error(A
->log
, "Infinite loop detected!");
1445 /* pop loop, restore prev */
1446 A
->CurLoop
= prevLoop
;
1453 * Generate IR tree for a do-while loop using high-level LOOP, IF instructions.
1455 static slang_ir_node
*
1456 _slang_gen_do(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1460 * body code (child[0])
1462 * BREAK if !expr (child[1])
1464 slang_ir_node
*prevLoop
, *loop
;
1465 GLboolean isConst
, constTrue
;
1467 /* type-check expression */
1468 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[1])) {
1469 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'do/while'");
1473 loop
= new_loop(NULL
);
1475 /* save old, push new loop */
1476 prevLoop
= A
->CurLoop
;
1480 loop
->Children
[0] = _slang_gen_operation(A
, &oper
->children
[0]);
1482 /* Check if loop condition is a constant */
1483 isConst
= _slang_is_constant_cond(&oper
->children
[1], &constTrue
);
1484 if (isConst
&& constTrue
) {
1485 /* do { } while(1) ==> no conditional break */
1486 loop
->Children
[1] = NULL
; /* no tail code */
1490 = new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[1])));
1491 loop
->Children
[1] = new_break_if_true(A
->CurLoop
, cond
);
1494 /* XXX we should do infinite loop detection, as above */
1496 /* pop loop, restore prev */
1497 A
->CurLoop
= prevLoop
;
1504 * Generate for-loop using high-level IR_LOOP instruction.
1506 static slang_ir_node
*
1507 _slang_gen_for(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1510 * init code (child[0])
1512 * BREAK if !expr (child[1])
1513 * body code (child[3])
1515 * incr code (child[2]) // XXX continue here
1517 slang_ir_node
*prevLoop
, *loop
, *cond
, *breakIf
, *body
, *init
, *incr
;
1519 init
= _slang_gen_operation(A
, &oper
->children
[0]);
1520 loop
= new_loop(NULL
);
1522 /* save old, push new loop */
1523 prevLoop
= A
->CurLoop
;
1526 cond
= new_cond(new_not(_slang_gen_operation(A
, &oper
->children
[1])));
1527 breakIf
= new_break_if_true(A
->CurLoop
, cond
);
1528 body
= _slang_gen_operation(A
, &oper
->children
[3]);
1529 incr
= _slang_gen_operation(A
, &oper
->children
[2]);
1531 loop
->Children
[0] = new_seq(breakIf
, body
);
1532 loop
->Children
[1] = incr
; /* tail code */
1534 /* pop loop, restore prev */
1535 A
->CurLoop
= prevLoop
;
1537 return new_seq(init
, loop
);
1541 static slang_ir_node
*
1542 _slang_gen_continue(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1544 slang_ir_node
*n
, *loopNode
;
1545 assert(oper
->type
== SLANG_OPER_CONTINUE
);
1546 loopNode
= A
->CurLoop
;
1548 assert(loopNode
->Opcode
== IR_LOOP
);
1549 n
= new_node0(IR_CONT
);
1551 n
->Parent
= loopNode
;
1552 /* insert this node at head of linked list */
1553 n
->List
= loopNode
->List
;
1561 * Determine if the given operation is of a specific type.
1564 is_operation_type(const const slang_operation
*oper
, slang_operation_type type
)
1566 if (oper
->type
== type
)
1568 else if ((oper
->type
== SLANG_OPER_BLOCK_NEW_SCOPE
||
1569 oper
->type
== SLANG_OPER_BLOCK_NO_NEW_SCOPE
) &&
1570 oper
->num_children
== 1)
1571 return is_operation_type(&oper
->children
[0], type
);
1578 * Generate IR tree for an if/then/else conditional using high-level
1579 * IR_IF instruction.
1581 static slang_ir_node
*
1582 _slang_gen_if(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1585 * eval expr (child[0])
1592 const GLboolean haveElseClause
= !_slang_is_noop(&oper
->children
[2]);
1593 slang_ir_node
*ifNode
, *cond
, *ifBody
, *elseBody
;
1594 GLboolean isConst
, constTrue
;
1596 /* type-check expression */
1597 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
1598 slang_info_log_error(A
->log
, "scalar/boolean expression expected for 'if'");
1602 isConst
= _slang_is_constant_cond(&oper
->children
[0], &constTrue
);
1606 return _slang_gen_operation(A
, &oper
->children
[1]);
1609 /* if (false) ... */
1610 return _slang_gen_operation(A
, &oper
->children
[2]);
1614 cond
= _slang_gen_operation(A
, &oper
->children
[0]);
1615 cond
= new_cond(cond
);
1617 if (is_operation_type(&oper
->children
[1], SLANG_OPER_BREAK
)) {
1618 /* Special case: generate a conditional break */
1619 ifBody
= new_break_if_true(A
->CurLoop
, cond
);
1620 if (haveElseClause
) {
1621 elseBody
= _slang_gen_operation(A
, &oper
->children
[2]);
1622 return new_seq(ifBody
, elseBody
);
1626 else if (is_operation_type(&oper
->children
[1], SLANG_OPER_CONTINUE
)) {
1627 /* Special case: generate a conditional break */
1628 ifBody
= new_cont_if_true(A
->CurLoop
, cond
);
1629 if (haveElseClause
) {
1630 elseBody
= _slang_gen_operation(A
, &oper
->children
[2]);
1631 return new_seq(ifBody
, elseBody
);
1637 ifBody
= _slang_gen_operation(A
, &oper
->children
[1]);
1639 elseBody
= _slang_gen_operation(A
, &oper
->children
[2]);
1642 ifNode
= new_if(cond
, ifBody
, elseBody
);
1649 static slang_ir_node
*
1650 _slang_gen_not(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1654 assert(oper
->type
== SLANG_OPER_NOT
);
1656 /* type-check expression */
1657 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
1658 slang_info_log_error(A
->log
,
1659 "scalar/boolean expression expected for '!'");
1663 n
= _slang_gen_operation(A
, &oper
->children
[0]);
1671 static slang_ir_node
*
1672 _slang_gen_xor(slang_assemble_ctx
* A
, const slang_operation
*oper
)
1674 slang_ir_node
*n1
, *n2
;
1676 assert(oper
->type
== SLANG_OPER_LOGICALXOR
);
1678 if (!_slang_is_scalar_or_boolean(A
, &oper
->children
[0]) ||
1679 !_slang_is_scalar_or_boolean(A
, &oper
->children
[0])) {
1680 slang_info_log_error(A
->log
,
1681 "scalar/boolean expressions expected for '^^'");
1685 n1
= _slang_gen_operation(A
, &oper
->children
[0]);
1688 n2
= _slang_gen_operation(A
, &oper
->children
[1]);
1691 return new_node2(IR_NOTEQUAL
, n1
, n2
);
1696 * Generate IR node for storage of a temporary of given size.
1698 static slang_ir_node
*
1699 _slang_gen_temporary(GLint size
)
1701 slang_ir_storage
*store
;
1704 store
= _slang_new_ir_storage(PROGRAM_TEMPORARY
, -1, size
);
1706 n
= new_node0(IR_VAR_DECL
);
1719 * Generate IR node for allocating/declaring a variable.
1721 static slang_ir_node
*
1722 _slang_gen_var_decl(slang_assemble_ctx
*A
, slang_variable
*var
)
1725 assert(!is_sampler_type(&var
->type
));
1726 n
= new_node0(IR_VAR_DECL
);
1728 _slang_attach_storage(n
, var
);
1731 assert(n
->Store
== var
->aux
);
1733 assert(n
->Store
->Index
< 0);
1735 n
->Store
->File
= PROGRAM_TEMPORARY
;
1736 n
->Store
->Size
= _slang_sizeof_type_specifier(&n
->Var
->type
.specifier
);
1737 assert(n
->Store
->Size
> 0);
1744 * Generate code for a selection expression: b ? x : y
1745 * XXX In some cases we could implement a selection expression
1746 * with an LRP instruction (use the boolean as the interpolant).
1747 * Otherwise, we use an IF/ELSE/ENDIF construct.
1749 static slang_ir_node
*
1750 _slang_gen_select(slang_assemble_ctx
*A
, slang_operation
*oper
)
1752 slang_ir_node
*cond
, *ifNode
, *trueExpr
, *falseExpr
, *trueNode
, *falseNode
;
1753 slang_ir_node
*tmpDecl
, *tmpVar
, *tree
;
1754 slang_typeinfo type
;
1757 assert(oper
->type
== SLANG_OPER_SELECT
);
1758 assert(oper
->num_children
== 3);
1760 /* size of x or y's type */
1761 slang_typeinfo_construct(&type
);
1762 _slang_typeof_operation(A
, &oper
->children
[1], &type
);
1763 size
= _slang_sizeof_type_specifier(&type
.spec
);
1767 tmpDecl
= _slang_gen_temporary(size
);
1769 /* the condition (child 0) */
1770 cond
= _slang_gen_operation(A
, &oper
->children
[0]);
1771 cond
= new_cond(cond
);
1773 /* if-true body (child 1) */
1774 tmpVar
= new_node0(IR_VAR
);
1775 tmpVar
->Store
= tmpDecl
->Store
;
1776 trueExpr
= _slang_gen_operation(A
, &oper
->children
[1]);
1777 trueNode
= new_node2(IR_MOVE
, tmpVar
, trueExpr
);
1779 /* if-false body (child 2) */
1780 tmpVar
= new_node0(IR_VAR
);
1781 tmpVar
->Store
= tmpDecl
->Store
;
1782 falseExpr
= _slang_gen_operation(A
, &oper
->children
[2]);
1783 falseNode
= new_node2(IR_MOVE
, tmpVar
, falseExpr
);
1785 ifNode
= new_if(cond
, trueNode
, falseNode
);
1788 tmpVar
= new_node0(IR_VAR
);
1789 tmpVar
->Store
= tmpDecl
->Store
;
1791 tree
= new_seq(ifNode
, tmpVar
);
1792 tree
= new_seq(tmpDecl
, tree
);
1794 /*_slang_print_ir_tree(tree, 10);*/
1800 * Generate code for &&.
1802 static slang_ir_node
*
1803 _slang_gen_logical_and(slang_assemble_ctx
*A
, slang_operation
*oper
)
1805 /* rewrite "a && b" as "a ? b : false" */
1806 slang_operation
*select
;
1809 select
= slang_operation_new(1);
1810 select
->type
= SLANG_OPER_SELECT
;
1811 select
->num_children
= 3;
1812 select
->children
= slang_operation_new(3);
1814 slang_operation_copy(&select
->children
[0], &oper
->children
[0]);
1815 slang_operation_copy(&select
->children
[1], &oper
->children
[1]);
1816 select
->children
[2].type
= SLANG_OPER_LITERAL_BOOL
;
1817 ASSIGN_4V(select
->children
[2].literal
, 0, 0, 0, 0); /* false */
1818 select
->children
[2].literal_size
= 1;
1820 n
= _slang_gen_select(A
, select
);
1823 free(select
->children
);
1831 * Generate code for ||.
1833 static slang_ir_node
*
1834 _slang_gen_logical_or(slang_assemble_ctx
*A
, slang_operation
*oper
)
1836 /* rewrite "a || b" as "a ? true : b" */
1837 slang_operation
*select
;
1840 select
= slang_operation_new(1);
1841 select
->type
= SLANG_OPER_SELECT
;
1842 select
->num_children
= 3;
1843 select
->children
= slang_operation_new(3);
1845 slang_operation_copy(&select
->children
[0], &oper
->children
[0]);
1846 select
->children
[1].type
= SLANG_OPER_LITERAL_BOOL
;
1847 ASSIGN_4V(select
->children
[1].literal
, 1, 1, 1, 1); /* true */
1848 select
->children
[1].literal_size
= 1;
1849 slang_operation_copy(&select
->children
[2], &oper
->children
[1]);
1851 n
= _slang_gen_select(A
, select
);
1854 free(select
->children
);
1862 * Generate IR tree for a return statement.
1864 static slang_ir_node
*
1865 _slang_gen_return(slang_assemble_ctx
* A
, slang_operation
*oper
)
1867 const GLboolean haveReturnValue
1868 = (oper
->num_children
== 1 &&
1869 oper
->children
[0].type
!= SLANG_OPER_VOID
);
1871 /* error checking */
1872 assert(A
->CurFunction
);
1873 if (haveReturnValue
&&
1874 A
->CurFunction
->header
.type
.specifier
.type
== SLANG_SPEC_VOID
) {
1875 slang_info_log_error(A
->log
, "illegal return expression");
1878 else if (!haveReturnValue
&&
1879 A
->CurFunction
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
1880 slang_info_log_error(A
->log
, "return statement requires an expression");
1884 if (!haveReturnValue
) {
1885 return new_return(A
->curFuncEndLabel
);
1893 * return; // goto __endOfFunction
1895 slang_operation
*assign
;
1896 slang_atom a_retVal
;
1899 a_retVal
= slang_atom_pool_atom(A
->atoms
, "__retVal");
1905 = _slang_locate_variable(oper
->locals
, a_retVal
, GL_TRUE
);
1907 /* trying to return a value in a void-valued function */
1913 assign
= slang_operation_new(1);
1914 assign
->type
= SLANG_OPER_ASSIGN
;
1915 assign
->num_children
= 2;
1916 assign
->children
= slang_operation_new(2);
1917 /* lhs (__retVal) */
1918 assign
->children
[0].type
= SLANG_OPER_IDENTIFIER
;
1919 assign
->children
[0].a_id
= a_retVal
;
1920 assign
->children
[0].locals
->outer_scope
= assign
->locals
;
1922 /* XXX we might be able to avoid this copy someday */
1923 slang_operation_copy(&assign
->children
[1], &oper
->children
[0]);
1925 /* assemble the new code */
1926 n
= new_seq(_slang_gen_operation(A
, assign
),
1927 new_return(A
->curFuncEndLabel
));
1929 slang_operation_delete(assign
);
1936 * Generate IR tree for a variable declaration.
1938 static slang_ir_node
*
1939 _slang_gen_declaration(slang_assemble_ctx
*A
, slang_operation
*oper
)
1942 slang_ir_node
*varDecl
;
1944 const char *varName
= (char *) oper
->a_id
;
1946 assert(oper
->num_children
== 0 || oper
->num_children
== 1);
1948 v
= _slang_locate_variable(oper
->locals
, oper
->a_id
, GL_TRUE
);
1951 varDecl
= _slang_gen_var_decl(A
, v
);
1953 if (oper
->num_children
> 0) {
1954 /* child is initializer */
1955 slang_ir_node
*var
, *init
, *rhs
;
1956 assert(oper
->num_children
== 1);
1957 var
= new_var(A
, oper
, oper
->a_id
);
1959 slang_info_log_error(A
->log
, "undefined variable '%s'", varName
);
1962 /* XXX make copy of this initializer? */
1963 rhs
= _slang_gen_operation(A
, &oper
->children
[0]);
1965 init
= new_node2(IR_MOVE
, var
, rhs
);
1966 /*assert(rhs->Opcode != IR_SEQ);*/
1967 n
= new_seq(varDecl
, init
);
1969 else if (v
->initializer
) {
1970 slang_ir_node
*var
, *init
, *rhs
;
1971 var
= new_var(A
, oper
, oper
->a_id
);
1973 slang_info_log_error(A
->log
, "undefined variable '%s'", varName
);
1977 /* XXX make copy of this initializer? */
1979 slang_operation dup
;
1980 slang_operation_construct(&dup
);
1981 slang_operation_copy(&dup
, v
->initializer
);
1982 _slang_simplify(&dup
, &A
->space
, A
->atoms
);
1983 rhs
= _slang_gen_operation(A
, &dup
);
1986 _slang_simplify(v
->initializer
, &A
->space
, A
->atoms
);
1987 rhs
= _slang_gen_operation(A
, v
->initializer
);
1993 init
= new_node2(IR_MOVE
, var
, rhs
);
1995 assert(rhs->Opcode != IR_SEQ);
1997 n
= new_seq(varDecl
, init
);
2007 * Generate IR tree for a variable (such as in an expression).
2009 static slang_ir_node
*
2010 _slang_gen_variable(slang_assemble_ctx
* A
, slang_operation
*oper
)
2012 /* If there's a variable associated with this oper (from inlining)
2013 * use it. Otherwise, use the oper's var id.
2015 slang_atom aVar
= oper
->var
? oper
->var
->a_name
: oper
->a_id
;
2016 slang_ir_node
*n
= new_var(A
, oper
, aVar
);
2018 slang_info_log_error(A
->log
, "undefined variable '%s'", (char *) aVar
);
2026 * Some write-masked assignments are simple, but others are hard.
2029 * v.xy = vec2(a, b);
2032 * v.zy = vec2(a, b);
2033 * this gets transformed/swizzled into:
2034 * v.zy = vec2(a, b).*yx* (* = don't care)
2035 * This function helps to determine simple vs. non-simple.
2038 _slang_simple_writemask(GLuint writemask
, GLuint swizzle
)
2040 switch (writemask
) {
2042 return GET_SWZ(swizzle
, 0) == SWIZZLE_X
;
2044 return GET_SWZ(swizzle
, 1) == SWIZZLE_Y
;
2046 return GET_SWZ(swizzle
, 2) == SWIZZLE_Z
;
2048 return GET_SWZ(swizzle
, 3) == SWIZZLE_W
;
2050 return (GET_SWZ(swizzle
, 0) == SWIZZLE_X
)
2051 && (GET_SWZ(swizzle
, 1) == SWIZZLE_Y
);
2053 return (GET_SWZ(swizzle
, 0) == SWIZZLE_X
)
2054 && (GET_SWZ(swizzle
, 1) == SWIZZLE_Y
)
2055 && (GET_SWZ(swizzle
, 2) == SWIZZLE_Z
);
2056 case WRITEMASK_XYZW
:
2057 return swizzle
== SWIZZLE_NOOP
;
2065 * Convert the given swizzle into a writemask. In some cases this
2066 * is trivial, in other cases, we'll need to also swizzle the right
2067 * hand side to put components in the right places.
2068 * \param swizzle the incoming swizzle
2069 * \param writemaskOut returns the writemask
2070 * \param swizzleOut swizzle to apply to the right-hand-side
2071 * \return GL_FALSE for simple writemasks, GL_TRUE for non-simple
2074 swizzle_to_writemask(GLuint swizzle
,
2075 GLuint
*writemaskOut
, GLuint
*swizzleOut
)
2077 GLuint mask
= 0x0, newSwizzle
[4];
2080 /* make new dst writemask, compute size */
2081 for (i
= 0; i
< 4; i
++) {
2082 const GLuint swz
= GET_SWZ(swizzle
, i
);
2083 if (swz
== SWIZZLE_NIL
) {
2087 assert(swz
>= 0 && swz
<= 3);
2090 assert(mask
<= 0xf);
2091 size
= i
; /* number of components in mask/swizzle */
2093 *writemaskOut
= mask
;
2095 /* make new src swizzle, by inversion */
2096 for (i
= 0; i
< 4; i
++) {
2097 newSwizzle
[i
] = i
; /*identity*/
2099 for (i
= 0; i
< size
; i
++) {
2100 const GLuint swz
= GET_SWZ(swizzle
, i
);
2101 newSwizzle
[swz
] = i
;
2103 *swizzleOut
= MAKE_SWIZZLE4(newSwizzle
[0],
2108 if (_slang_simple_writemask(mask
, *swizzleOut
)) {
2110 assert(GET_SWZ(*swizzleOut
, 0) == SWIZZLE_X
);
2112 assert(GET_SWZ(*swizzleOut
, 1) == SWIZZLE_Y
);
2114 assert(GET_SWZ(*swizzleOut
, 2) == SWIZZLE_Z
);
2116 assert(GET_SWZ(*swizzleOut
, 3) == SWIZZLE_W
);
2124 static slang_ir_node
*
2125 _slang_gen_swizzle(slang_ir_node
*child
, GLuint swizzle
)
2127 slang_ir_node
*n
= new_node1(IR_SWIZZLE
, child
);
2130 n
->Store
= _slang_new_ir_storage(PROGRAM_UNDEFINED
, -1, -1);
2131 n
->Store
->Swizzle
= swizzle
;
2138 * Generate IR tree for an assignment (=).
2140 static slang_ir_node
*
2141 _slang_gen_assignment(slang_assemble_ctx
* A
, slang_operation
*oper
)
2143 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
&&
2144 oper
->children
[1].type
== SLANG_OPER_CALL
) {
2145 /* Special case of: x = f(a, b)
2146 * Replace with f(a, b, x) (where x == hidden __retVal out param)
2148 * XXX this could be even more effective if we could accomodate
2149 * cases such as "v.x = f();" - would help with typical vertex
2153 n
= _slang_gen_function_call_name(A
,
2154 (const char *) oper
->children
[1].a_id
,
2155 &oper
->children
[1], &oper
->children
[0]);
2159 slang_ir_node
*n
, *lhs
, *rhs
;
2160 lhs
= _slang_gen_operation(A
, &oper
->children
[0]);
2163 if (lhs
->Store
->File
!= PROGRAM_OUTPUT
&&
2164 lhs
->Store
->File
!= PROGRAM_TEMPORARY
&&
2165 lhs
->Store
->File
!= PROGRAM_VARYING
&&
2166 lhs
->Store
->File
!= PROGRAM_UNDEFINED
) {
2167 slang_info_log_error(A
->log
, "Assignment to read-only variable");
2172 rhs
= _slang_gen_operation(A
, &oper
->children
[1]);
2174 /* convert lhs swizzle into writemask */
2175 GLuint writemask
, newSwizzle
;
2176 if (!swizzle_to_writemask(lhs
->Store
->Swizzle
,
2177 &writemask
, &newSwizzle
)) {
2178 /* Non-simple writemask, need to swizzle right hand side in
2179 * order to put components into the right place.
2181 rhs
= _slang_gen_swizzle(rhs
, newSwizzle
);
2183 n
= new_node2(IR_MOVE
, lhs
, rhs
);
2184 n
->Writemask
= writemask
;
2195 * Generate IR tree for referencing a field in a struct (or basic vector type)
2197 static slang_ir_node
*
2198 _slang_gen_field(slang_assemble_ctx
* A
, slang_operation
*oper
)
2202 /* type of struct */
2203 slang_typeinfo_construct(&ti
);
2204 _slang_typeof_operation(A
, &oper
->children
[0], &ti
);
2206 if (_slang_type_is_vector(ti
.spec
.type
)) {
2207 /* the field should be a swizzle */
2208 const GLuint rows
= _slang_type_dim(ti
.spec
.type
);
2212 if (!_slang_is_swizzle((char *) oper
->a_id
, rows
, &swz
)) {
2213 slang_info_log_error(A
->log
, "Bad swizzle");
2215 swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
2220 n
= _slang_gen_operation(A
, &oper
->children
[0]);
2221 /* create new parent node with swizzle */
2223 n
= _slang_gen_swizzle(n
, swizzle
);
2226 else if (ti
.spec
.type
== SLANG_SPEC_FLOAT
) {
2227 const GLuint rows
= 1;
2231 if (!_slang_is_swizzle((char *) oper
->a_id
, rows
, &swz
)) {
2232 slang_info_log_error(A
->log
, "Bad swizzle");
2234 swizzle
= MAKE_SWIZZLE4(swz
.swizzle
[0],
2238 n
= _slang_gen_operation(A
, &oper
->children
[0]);
2239 /* create new parent node with swizzle */
2240 n
= _slang_gen_swizzle(n
, swizzle
);
2244 /* the field is a structure member (base.field) */
2245 /* oper->children[0] is the base */
2246 /* oper->a_id is the field name */
2247 slang_ir_node
*base
, *n
;
2248 slang_typeinfo field_ti
;
2249 GLint fieldSize
, fieldOffset
;
2251 slang_typeinfo_construct(&field_ti
);
2252 _slang_typeof_operation(A
, oper
, &field_ti
);
2254 fieldSize
= _slang_sizeof_type_specifier(&field_ti
.spec
);
2255 fieldOffset
= _slang_field_offset(&ti
.spec
, oper
->a_id
);
2257 if (fieldOffset
< 0) {
2258 slang_info_log_error(A
->log
,
2259 "\"%s\" is not a member of struct \"%s\"",
2260 (char *) oper
->a_id
,
2261 (char *) ti
.spec
._struct
->a_name
);
2264 assert(fieldSize
>= 0);
2266 base
= _slang_gen_operation(A
, &oper
->children
[0]);
2268 /* error msg should have already been logged */
2272 n
= new_node1(IR_FIELD
, base
);
2274 n
->Field
= (char *) oper
->a_id
;
2275 n
->FieldOffset
= fieldOffset
;
2276 assert(n
->FieldOffset
>= 0);
2277 n
->Store
= _slang_new_ir_storage(base
->Store
->File
,
2284 _mesa_problem(NULL
, "glsl structs/fields not supported yet");
2292 * Gen code for array indexing.
2294 static slang_ir_node
*
2295 _slang_gen_subscript(slang_assemble_ctx
* A
, slang_operation
*oper
)
2297 slang_typeinfo array_ti
;
2299 /* get array's type info */
2300 slang_typeinfo_construct(&array_ti
);
2301 _slang_typeof_operation(A
, &oper
->children
[0], &array_ti
);
2303 if (_slang_type_is_vector(array_ti
.spec
.type
)) {
2304 /* indexing a simple vector type: "vec4 v; v[0]=p;" */
2305 /* translate the index into a swizzle/writemask: "v.x=p" */
2306 const GLuint max
= _slang_type_dim(array_ti
.spec
.type
);
2310 index
= (GLint
) oper
->children
[1].literal
[0];
2311 if (oper
->children
[1].type
!= SLANG_OPER_LITERAL_INT
||
2313 slang_info_log_error(A
->log
, "Invalid array index for vector type");
2317 n
= _slang_gen_operation(A
, &oper
->children
[0]);
2319 /* use swizzle to access the element */
2320 GLuint swizzle
= MAKE_SWIZZLE4(SWIZZLE_X
+ index
,
2324 n
= _slang_gen_swizzle(n
, swizzle
);
2325 /*n->Store = _slang_clone_ir_storage_swz(n->Store, */
2326 n
->Writemask
= WRITEMASK_X
<< index
;
2331 /* conventional array */
2332 slang_typeinfo elem_ti
;
2333 slang_ir_node
*elem
, *array
, *index
;
2334 GLint elemSize
, arrayLen
;
2336 /* size of array element */
2337 slang_typeinfo_construct(&elem_ti
);
2338 _slang_typeof_operation(A
, oper
, &elem_ti
);
2339 elemSize
= _slang_sizeof_type_specifier(&elem_ti
.spec
);
2341 if (_slang_type_is_matrix(array_ti
.spec
.type
))
2342 arrayLen
= _slang_type_dim(array_ti
.spec
.type
);
2344 arrayLen
= array_ti
.array_len
;
2346 slang_typeinfo_destruct(&array_ti
);
2347 slang_typeinfo_destruct(&elem_ti
);
2349 if (elemSize
<= 0) {
2350 /* unknown var or type */
2351 slang_info_log_error(A
->log
, "Undefined variable or type");
2355 array
= _slang_gen_operation(A
, &oper
->children
[0]);
2356 index
= _slang_gen_operation(A
, &oper
->children
[1]);
2357 if (array
&& index
) {
2359 if (index
->Opcode
== IR_FLOAT
&&
2360 ((int) index
->Value
[0] < 0 ||
2361 (int) index
->Value
[0] >= arrayLen
)) {
2362 slang_info_log_error(A
->log
,
2363 "Array index out of bounds (index=%d size=%d)",
2364 (int) index
->Value
[0], arrayLen
);
2365 _slang_free_ir_tree(array
);
2366 _slang_free_ir_tree(index
);
2370 elem
= new_node2(IR_ELEMENT
, array
, index
);
2371 elem
->Store
= _slang_new_ir_storage(array
->Store
->File
,
2372 array
->Store
->Index
,
2374 /* XXX try to do some array bounds checking here */
2378 _slang_free_ir_tree(array
);
2379 _slang_free_ir_tree(index
);
2387 * Look for expressions such as: gl_ModelviewMatrix * gl_Vertex
2388 * and replace with this: gl_Vertex * gl_ModelviewMatrixTranpose
2389 * Since matrices are stored in column-major order, the second form of
2390 * multiplication is much more efficient (just 4 dot products).
2393 _slang_check_matmul_optimization(slang_assemble_ctx
*A
, slang_operation
*oper
)
2395 static const struct {
2397 const char *tranpose
;
2399 {"gl_ModelViewMatrix", "gl_ModelViewMatrixTranspose"},
2400 {"gl_ProjectionMatrix", "gl_ProjectionMatrixTranspose"},
2401 {"gl_ModelViewProjectionMatrix", "gl_ModelViewProjectionMatrixTranspose"},
2402 {"gl_TextureMatrix", "gl_TextureMatrixTranspose"},
2403 {"gl_NormalMatrix", "__NormalMatrixTranspose"},
2407 assert(oper
->type
== SLANG_OPER_MULTIPLY
);
2408 if (oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
) {
2410 for (i
= 0; matrices
[i
].orig
; i
++) {
2411 if (oper
->children
[0].a_id
2412 == slang_atom_pool_atom(A
->atoms
, matrices
[i
].orig
)) {
2414 _mesa_printf("Replace %s with %s\n",
2415 matrices[i].orig, matrices[i].tranpose);
2417 assert(oper
->children
[0].type
== SLANG_OPER_IDENTIFIER
);
2418 oper
->children
[0].a_id
2419 = slang_atom_pool_atom(A
->atoms
, matrices
[i
].tranpose
);
2420 /* finally, swap the operands */
2421 _slang_operation_swap(&oper
->children
[0], &oper
->children
[1]);
2430 * Generate IR tree for a slang_operation (AST node)
2432 static slang_ir_node
*
2433 _slang_gen_operation(slang_assemble_ctx
* A
, slang_operation
*oper
)
2435 switch (oper
->type
) {
2436 case SLANG_OPER_BLOCK_NEW_SCOPE
:
2440 _slang_push_var_table(A
->vartable
);
2442 oper
->type
= SLANG_OPER_BLOCK_NO_NEW_SCOPE
; /* temp change */
2443 n
= _slang_gen_operation(A
, oper
);
2444 oper
->type
= SLANG_OPER_BLOCK_NEW_SCOPE
; /* restore */
2446 _slang_pop_var_table(A
->vartable
);
2449 n
= new_node1(IR_SCOPE
, n
);
2454 case SLANG_OPER_BLOCK_NO_NEW_SCOPE
:
2455 /* list of operations */
2456 if (oper
->num_children
> 0)
2458 slang_ir_node
*n
, *tree
= NULL
;
2461 for (i
= 0; i
< oper
->num_children
; i
++) {
2462 n
= _slang_gen_operation(A
, &oper
->children
[i
]);
2464 _slang_free_ir_tree(tree
);
2465 return NULL
; /* error must have occured */
2467 tree
= tree
? new_seq(tree
, n
) : n
;
2471 if (oper
->locals
->num_variables
> 0) {
2474 printf("\n****** Deallocate vars in scope!\n");
2476 for (i
= 0; i
< oper
->locals
->num_variables
; i
++) {
2477 slang_variable
*v
= oper
->locals
->variables
+ i
;
2479 slang_ir_storage
*store
= (slang_ir_storage
*) v
->aux
;
2481 printf(" Deallocate var %s\n", (char*) v->a_name);
2483 assert(store
->File
== PROGRAM_TEMPORARY
);
2484 assert(store
->Index
>= 0);
2485 _slang_free_temp(A
->vartable
, store
->Index
, store
->Size
);
2493 return new_node0(IR_NOP
);
2496 case SLANG_OPER_EXPRESSION
:
2497 return _slang_gen_operation(A
, &oper
->children
[0]);
2499 case SLANG_OPER_FOR
:
2500 return _slang_gen_for(A
, oper
);
2502 return _slang_gen_do(A
, oper
);
2503 case SLANG_OPER_WHILE
:
2504 return _slang_gen_while(A
, oper
);
2505 case SLANG_OPER_BREAK
:
2507 slang_info_log_error(A
->log
, "'break' not in loop");
2510 return new_break(A
->CurLoop
);
2511 case SLANG_OPER_CONTINUE
:
2513 slang_info_log_error(A
->log
, "'continue' not in loop");
2516 return _slang_gen_continue(A
, oper
);
2517 case SLANG_OPER_DISCARD
:
2518 return new_node0(IR_KILL
);
2520 case SLANG_OPER_EQUAL
:
2521 return new_node2(IR_EQUAL
,
2522 _slang_gen_operation(A
, &oper
->children
[0]),
2523 _slang_gen_operation(A
, &oper
->children
[1]));
2524 case SLANG_OPER_NOTEQUAL
:
2525 return new_node2(IR_NOTEQUAL
,
2526 _slang_gen_operation(A
, &oper
->children
[0]),
2527 _slang_gen_operation(A
, &oper
->children
[1]));
2528 case SLANG_OPER_GREATER
:
2529 return new_node2(IR_SGT
,
2530 _slang_gen_operation(A
, &oper
->children
[0]),
2531 _slang_gen_operation(A
, &oper
->children
[1]));
2532 case SLANG_OPER_LESS
:
2533 return new_node2(IR_SLT
,
2534 _slang_gen_operation(A
, &oper
->children
[0]),
2535 _slang_gen_operation(A
, &oper
->children
[1]));
2536 case SLANG_OPER_GREATEREQUAL
:
2537 return new_node2(IR_SGE
,
2538 _slang_gen_operation(A
, &oper
->children
[0]),
2539 _slang_gen_operation(A
, &oper
->children
[1]));
2540 case SLANG_OPER_LESSEQUAL
:
2541 return new_node2(IR_SLE
,
2542 _slang_gen_operation(A
, &oper
->children
[0]),
2543 _slang_gen_operation(A
, &oper
->children
[1]));
2544 case SLANG_OPER_ADD
:
2547 assert(oper
->num_children
== 2);
2548 n
= _slang_gen_function_call_name(A
, "+", oper
, NULL
);
2551 case SLANG_OPER_SUBTRACT
:
2554 assert(oper
->num_children
== 2);
2555 n
= _slang_gen_function_call_name(A
, "-", oper
, NULL
);
2558 case SLANG_OPER_MULTIPLY
:
2561 assert(oper
->num_children
== 2);
2562 _slang_check_matmul_optimization(A
, oper
);
2563 n
= _slang_gen_function_call_name(A
, "*", oper
, NULL
);
2566 case SLANG_OPER_DIVIDE
:
2569 assert(oper
->num_children
== 2);
2570 n
= _slang_gen_function_call_name(A
, "/", oper
, NULL
);
2573 case SLANG_OPER_MINUS
:
2576 assert(oper
->num_children
== 1);
2577 n
= _slang_gen_function_call_name(A
, "-", oper
, NULL
);
2580 case SLANG_OPER_PLUS
:
2581 /* +expr --> do nothing */
2582 return _slang_gen_operation(A
, &oper
->children
[0]);
2583 case SLANG_OPER_VARIABLE_DECL
:
2584 return _slang_gen_declaration(A
, oper
);
2585 case SLANG_OPER_ASSIGN
:
2586 return _slang_gen_assignment(A
, oper
);
2587 case SLANG_OPER_ADDASSIGN
:
2590 assert(oper
->num_children
== 2);
2591 n
= _slang_gen_function_call_name(A
, "+=", oper
, &oper
->children
[0]);
2594 case SLANG_OPER_SUBASSIGN
:
2597 assert(oper
->num_children
== 2);
2598 n
= _slang_gen_function_call_name(A
, "-=", oper
, &oper
->children
[0]);
2602 case SLANG_OPER_MULASSIGN
:
2605 assert(oper
->num_children
== 2);
2606 n
= _slang_gen_function_call_name(A
, "*=", oper
, &oper
->children
[0]);
2609 case SLANG_OPER_DIVASSIGN
:
2612 assert(oper
->num_children
== 2);
2613 n
= _slang_gen_function_call_name(A
, "/=", oper
, &oper
->children
[0]);
2616 case SLANG_OPER_LOGICALAND
:
2619 assert(oper
->num_children
== 2);
2620 n
= _slang_gen_logical_and(A
, oper
);
2623 case SLANG_OPER_LOGICALOR
:
2626 assert(oper
->num_children
== 2);
2627 n
= _slang_gen_logical_or(A
, oper
);
2630 case SLANG_OPER_LOGICALXOR
:
2631 return _slang_gen_xor(A
, oper
);
2632 case SLANG_OPER_NOT
:
2633 return _slang_gen_not(A
, oper
);
2634 case SLANG_OPER_SELECT
: /* b ? x : y */
2637 assert(oper
->num_children
== 3);
2638 n
= _slang_gen_select(A
, oper
);
2642 case SLANG_OPER_ASM
:
2643 return _slang_gen_asm(A
, oper
, NULL
);
2644 case SLANG_OPER_CALL
:
2645 return _slang_gen_function_call_name(A
, (const char *) oper
->a_id
,
2647 case SLANG_OPER_RETURN
:
2648 return _slang_gen_return(A
, oper
);
2649 case SLANG_OPER_LABEL
:
2650 return new_label(oper
->label
);
2651 case SLANG_OPER_IDENTIFIER
:
2652 return _slang_gen_variable(A
, oper
);
2654 return _slang_gen_if(A
, oper
);
2655 case SLANG_OPER_FIELD
:
2656 return _slang_gen_field(A
, oper
);
2657 case SLANG_OPER_SUBSCRIPT
:
2658 return _slang_gen_subscript(A
, oper
);
2659 case SLANG_OPER_LITERAL_FLOAT
:
2661 case SLANG_OPER_LITERAL_INT
:
2663 case SLANG_OPER_LITERAL_BOOL
:
2664 return new_float_literal(oper
->literal
, oper
->literal_size
);
2666 case SLANG_OPER_POSTINCREMENT
: /* var++ */
2669 assert(oper
->num_children
== 1);
2670 n
= _slang_gen_function_call_name(A
, "__postIncr", oper
, NULL
);
2673 case SLANG_OPER_POSTDECREMENT
: /* var-- */
2676 assert(oper
->num_children
== 1);
2677 n
= _slang_gen_function_call_name(A
, "__postDecr", oper
, NULL
);
2680 case SLANG_OPER_PREINCREMENT
: /* ++var */
2683 assert(oper
->num_children
== 1);
2684 n
= _slang_gen_function_call_name(A
, "++", oper
, NULL
);
2687 case SLANG_OPER_PREDECREMENT
: /* --var */
2690 assert(oper
->num_children
== 1);
2691 n
= _slang_gen_function_call_name(A
, "--", oper
, NULL
);
2695 case SLANG_OPER_INLINED_CALL
:
2696 case SLANG_OPER_SEQUENCE
:
2698 slang_ir_node
*tree
= NULL
;
2700 for (i
= 0; i
< oper
->num_children
; i
++) {
2701 slang_ir_node
*n
= _slang_gen_operation(A
, &oper
->children
[i
]);
2702 tree
= tree
? new_seq(tree
, n
) : n
;
2704 if (oper
->type
== SLANG_OPER_INLINED_CALL
) {
2705 tree
= new_inlined_function_call(tree
, oper
->label
);
2710 case SLANG_OPER_NONE
:
2711 case SLANG_OPER_VOID
:
2712 /* returning NULL here would generate an error */
2713 return new_node0(IR_NOP
);
2716 _mesa_problem(NULL
, "bad node type %d in _slang_gen_operation",
2718 return new_node0(IR_NOP
);
2727 * Called by compiler when a global variable has been parsed/compiled.
2728 * Here we examine the variable's type to determine what kind of register
2729 * storage will be used.
2731 * A uniform such as "gl_Position" will become the register specification
2732 * (PROGRAM_OUTPUT, VERT_RESULT_HPOS). Or, uniform "gl_FogFragCoord"
2733 * will be (PROGRAM_INPUT, FRAG_ATTRIB_FOGC).
2735 * Samplers are interesting. For "uniform sampler2D tex;" we'll specify
2736 * (PROGRAM_SAMPLER, index) where index is resolved at link-time to an
2737 * actual texture unit (as specified by the user calling glUniform1i()).
2740 _slang_codegen_global_variable(slang_assemble_ctx
*A
, slang_variable
*var
,
2741 slang_unit_type type
)
2743 struct gl_program
*prog
= A
->program
;
2744 const char *varName
= (char *) var
->a_name
;
2745 GLboolean success
= GL_TRUE
;
2747 slang_ir_storage
*store
= NULL
;
2750 texIndex
= sampler_to_texture_index(var
->type
.specifier
.type
);
2752 if (texIndex
!= -1) {
2754 * store->File = PROGRAM_SAMPLER
2755 * store->Index = sampler uniform location
2756 * store->Size = texture type index (1D, 2D, 3D, cube, etc)
2758 GLint samplerUniform
= _mesa_add_sampler(prog
->Parameters
, varName
);
2759 store
= _slang_new_ir_storage(PROGRAM_SAMPLER
, samplerUniform
, texIndex
);
2760 if (dbg
) printf("SAMPLER ");
2762 else if (var
->type
.qualifier
== SLANG_QUAL_UNIFORM
) {
2763 /* Uniform variable */
2764 const GLint size
= _slang_sizeof_type_specifier(&var
->type
.specifier
)
2765 * MAX2(var
->array_len
, 1);
2767 /* user-defined uniform */
2768 GLint uniformLoc
= _mesa_add_uniform(prog
->Parameters
, varName
, size
);
2769 store
= _slang_new_ir_storage(PROGRAM_UNIFORM
, uniformLoc
, size
);
2772 /* pre-defined uniform, like gl_ModelviewMatrix */
2773 /* We know it's a uniform, but don't allocate storage unless
2776 store
= _slang_new_ir_storage(PROGRAM_STATE_VAR
, -1, size
);
2778 if (dbg
) printf("UNIFORM (sz %d) ", size
);
2780 else if (var
->type
.qualifier
== SLANG_QUAL_VARYING
) {
2781 const GLint size
= 4; /* XXX fix */
2783 /* user-defined varying */
2784 GLint varyingLoc
= _mesa_add_varying(prog
->Varying
, varName
, size
);
2785 store
= _slang_new_ir_storage(PROGRAM_VARYING
, varyingLoc
, size
);
2788 /* pre-defined varying, like gl_Color or gl_TexCoord */
2789 if (type
== SLANG_UNIT_FRAGMENT_BUILTIN
) {
2791 GLint index
= _slang_input_index(varName
, GL_FRAGMENT_PROGRAM_ARB
,
2794 store
= _slang_new_ir_storage(PROGRAM_INPUT
, index
, size
);
2795 store
->Swizzle
= swizzle
;
2796 assert(index
< FRAG_ATTRIB_MAX
);
2799 GLint index
= _slang_output_index(varName
, GL_VERTEX_PROGRAM_ARB
);
2801 assert(type
== SLANG_UNIT_VERTEX_BUILTIN
);
2802 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, size
);
2803 assert(index
< VERT_RESULT_MAX
);
2805 if (dbg
) printf("V/F ");
2807 if (dbg
) printf("VARYING ");
2809 else if (var
->type
.qualifier
== SLANG_QUAL_ATTRIBUTE
) {
2811 /* user-defined vertex attribute */
2812 const GLint size
= _slang_sizeof_type_specifier(&var
->type
.specifier
);
2813 const GLint attr
= -1; /* unknown */
2814 GLint index
= _mesa_add_attribute(prog
->Attributes
, varName
,
2817 store
= _slang_new_ir_storage(PROGRAM_INPUT
,
2818 VERT_ATTRIB_GENERIC0
+ index
, size
);
2821 /* pre-defined vertex attrib */
2823 GLint index
= _slang_input_index(varName
, GL_VERTEX_PROGRAM_ARB
,
2825 GLint size
= 4; /* XXX? */
2827 store
= _slang_new_ir_storage(PROGRAM_INPUT
, index
, size
);
2828 store
->Swizzle
= swizzle
;
2830 if (dbg
) printf("ATTRIB ");
2832 else if (var
->type
.qualifier
== SLANG_QUAL_FIXEDINPUT
) {
2834 GLint index
= _slang_input_index(varName
, GL_FRAGMENT_PROGRAM_ARB
,
2836 GLint size
= 4; /* XXX? */
2837 store
= _slang_new_ir_storage(PROGRAM_INPUT
, index
, size
);
2838 store
->Swizzle
= swizzle
;
2839 if (dbg
) printf("INPUT ");
2841 else if (var
->type
.qualifier
== SLANG_QUAL_FIXEDOUTPUT
) {
2842 if (type
== SLANG_UNIT_VERTEX_BUILTIN
) {
2843 GLint index
= _slang_output_index(varName
, GL_VERTEX_PROGRAM_ARB
);
2844 GLint size
= 4; /* XXX? */
2845 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, size
);
2848 assert(type
== SLANG_UNIT_FRAGMENT_BUILTIN
);
2849 GLint index
= _slang_output_index(varName
, GL_FRAGMENT_PROGRAM_ARB
);
2850 GLint size
= 4; /* XXX? */
2851 store
= _slang_new_ir_storage(PROGRAM_OUTPUT
, index
, size
);
2853 if (dbg
) printf("OUTPUT ");
2855 else if (var
->type
.qualifier
== SLANG_QUAL_CONST
&& !prog
) {
2856 /* pre-defined global constant, like gl_MaxLights */
2857 const GLint size
= _slang_sizeof_type_specifier(&var
->type
.specifier
);
2858 store
= _slang_new_ir_storage(PROGRAM_CONSTANT
, -1, size
);
2859 if (dbg
) printf("CONST ");
2862 /* ordinary variable (may be const) */
2865 /* IR node to declare the variable */
2866 n
= _slang_gen_var_decl(A
, var
);
2868 /* IR code for the var's initializer, if present */
2869 if (var
->initializer
) {
2870 slang_ir_node
*lhs
, *rhs
, *init
;
2872 /* Generate IR_MOVE instruction to initialize the variable */
2873 lhs
= new_node0(IR_VAR
);
2875 lhs
->Store
= n
->Store
;
2877 /* constant folding, etc */
2878 _slang_simplify(var
->initializer
, &A
->space
, A
->atoms
);
2880 rhs
= _slang_gen_operation(A
, var
->initializer
);
2882 init
= new_node2(IR_MOVE
, lhs
, rhs
);
2883 n
= new_seq(n
, init
);
2886 success
= _slang_emit_code(n
, A
->vartable
, A
->program
, GL_FALSE
, A
->log
);
2888 _slang_free_ir_tree(n
);
2891 if (dbg
) printf("GLOBAL VAR %s idx %d\n", (char*) var
->a_name
,
2892 store
? store
->Index
: -2);
2895 var
->aux
= store
; /* save var's storage info */
2902 * Produce an IR tree from a function AST (fun->body).
2903 * Then call the code emitter to convert the IR tree into gl_program
2907 _slang_codegen_function(slang_assemble_ctx
* A
, slang_function
* fun
)
2910 GLboolean success
= GL_TRUE
;
2912 if (_mesa_strcmp((char *) fun
->header
.a_name
, "main") != 0) {
2913 /* we only really generate code for main, all other functions get
2917 /* do some basic error checking though */
2918 if (fun
->header
.type
.specifier
.type
!= SLANG_SPEC_VOID
) {
2919 /* check that non-void functions actually return something */
2921 = _slang_find_node_type(fun
->body
, SLANG_OPER_RETURN
);
2923 slang_info_log_error(A
->log
,
2924 "function \"%s\" has no return statement",
2925 (char *) fun
->header
.a_name
);
2927 "function \"%s\" has no return statement\n",
2928 (char *) fun
->header
.a_name
);
2933 return GL_TRUE
; /* not an error */
2937 printf("\n*********** codegen_function %s\n", (char *) fun
->header
.a_name
);
2938 slang_print_function(fun
, 1);
2941 /* should have been allocated earlier: */
2942 assert(A
->program
->Parameters
);
2943 assert(A
->program
->Varying
);
2944 assert(A
->vartable
);
2946 A
->CurFunction
= fun
;
2948 /* fold constant expressions, etc. */
2949 _slang_simplify(fun
->body
, &A
->space
, A
->atoms
);
2952 printf("\n*********** simplified %s\n", (char *) fun
->header
.a_name
);
2953 slang_print_function(fun
, 1);
2956 /* Create an end-of-function label */
2957 A
->curFuncEndLabel
= _slang_label_new("__endOfFunc__main");
2959 /* push new vartable scope */
2960 _slang_push_var_table(A
->vartable
);
2962 /* Generate IR tree for the function body code */
2963 n
= _slang_gen_operation(A
, fun
->body
);
2965 n
= new_node1(IR_SCOPE
, n
);
2967 /* pop vartable, restore previous */
2968 _slang_pop_var_table(A
->vartable
);
2971 /* XXX record error */
2975 /* append an end-of-function-label to IR tree */
2976 n
= new_seq(n
, new_label(A
->curFuncEndLabel
));
2978 /*_slang_label_delete(A->curFuncEndLabel);*/
2979 A
->curFuncEndLabel
= NULL
;
2982 printf("************* New AST for %s *****\n", (char*)fun
->header
.a_name
);
2983 slang_print_function(fun
, 1);
2986 printf("************* IR for %s *******\n", (char*)fun
->header
.a_name
);
2987 _slang_print_ir_tree(n
, 0);
2990 printf("************* End codegen function ************\n\n");
2993 /* Emit program instructions */
2994 success
= _slang_emit_code(n
, A
->vartable
, A
->program
, GL_TRUE
, A
->log
);
2995 _slang_free_ir_tree(n
);
2997 /* free codegen context */
2999 _mesa_free(A->codegen);