2 * Copyright (C) 2005-2007 Brian Paul All Rights Reserved.
3 * Copyright (C) 2008 VMware, Inc. All Rights Reserved.
4 * Copyright © 2010 Intel Corporation
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the "Software"),
8 * to deal in the Software without restriction, including without limitation
9 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
10 * and/or sell copies of the Software, and to permit persons to whom the
11 * Software is furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice (including the next
14 * paragraph) shall be included in all copies or substantial portions of the
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
22 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
23 * DEALINGS IN THE SOFTWARE.
27 * \file ir_to_mesa.cpp
29 * Translate GLSL IR to Mesa's gl_program representation.
33 #include "main/compiler.h"
35 #include "ir_visitor.h"
36 #include "ir_print_visitor.h"
37 #include "ir_expression_flattening.h"
38 #include "glsl_types.h"
39 #include "glsl_parser_extras.h"
40 #include "../glsl/program.h"
41 #include "ir_optimization.h"
45 #include "main/mtypes.h"
46 #include "main/shaderobj.h"
47 #include "program/hash_table.h"
50 #include "main/shaderapi.h"
51 #include "main/uniforms.h"
52 #include "program/prog_instruction.h"
53 #include "program/prog_optimize.h"
54 #include "program/prog_print.h"
55 #include "program/program.h"
56 #include "program/prog_uniform.h"
57 #include "program/prog_parameter.h"
58 #include "program/sampler.h"
64 static int swizzle_for_size(int size
);
67 * This struct is a corresponding struct to Mesa prog_src_register, with
72 src_reg(gl_register_file file
, int index
, const glsl_type
*type
)
76 if (type
&& (type
->is_scalar() || type
->is_vector() || type
->is_matrix()))
77 this->swizzle
= swizzle_for_size(type
->vector_elements
);
79 this->swizzle
= SWIZZLE_XYZW
;
86 this->file
= PROGRAM_UNDEFINED
;
93 explicit src_reg(dst_reg reg
);
95 gl_register_file file
; /**< PROGRAM_* from Mesa */
96 int index
; /**< temporary index, VERT_ATTRIB_*, FRAG_ATTRIB_*, etc. */
97 GLuint swizzle
; /**< SWIZZLE_XYZWONEZERO swizzles from Mesa. */
98 int negate
; /**< NEGATE_XYZW mask from mesa */
99 /** Register index should be offset by the integer in this reg. */
105 dst_reg(gl_register_file file
, int writemask
)
109 this->writemask
= writemask
;
110 this->cond_mask
= COND_TR
;
111 this->reladdr
= NULL
;
116 this->file
= PROGRAM_UNDEFINED
;
119 this->cond_mask
= COND_TR
;
120 this->reladdr
= NULL
;
123 explicit dst_reg(src_reg reg
);
125 gl_register_file file
; /**< PROGRAM_* from Mesa */
126 int index
; /**< temporary index, VERT_ATTRIB_*, FRAG_ATTRIB_*, etc. */
127 int writemask
; /**< Bitfield of WRITEMASK_[XYZW] */
129 /** Register index should be offset by the integer in this reg. */
133 src_reg::src_reg(dst_reg reg
)
135 this->file
= reg
.file
;
136 this->index
= reg
.index
;
137 this->swizzle
= SWIZZLE_XYZW
;
139 this->reladdr
= reg
.reladdr
;
142 dst_reg::dst_reg(src_reg reg
)
144 this->file
= reg
.file
;
145 this->index
= reg
.index
;
146 this->writemask
= WRITEMASK_XYZW
;
147 this->cond_mask
= COND_TR
;
148 this->reladdr
= reg
.reladdr
;
151 class ir_to_mesa_instruction
: public exec_node
{
153 /* Callers of this ralloc-based new need not call delete. It's
154 * easier to just ralloc_free 'ctx' (or any of its ancestors). */
155 static void* operator new(size_t size
, void *ctx
)
159 node
= rzalloc_size(ctx
, size
);
160 assert(node
!= NULL
);
168 /** Pointer to the ir source this tree came from for debugging */
170 GLboolean cond_update
;
172 int sampler
; /**< sampler index */
173 int tex_target
; /**< One of TEXTURE_*_INDEX */
174 GLboolean tex_shadow
;
176 class function_entry
*function
; /* Set on OPCODE_CAL or OPCODE_BGNSUB */
179 class variable_storage
: public exec_node
{
181 variable_storage(ir_variable
*var
, gl_register_file file
, int index
)
182 : file(file
), index(index
), var(var
)
187 gl_register_file file
;
189 ir_variable
*var
; /* variable that maps to this, if any */
192 class function_entry
: public exec_node
{
194 ir_function_signature
*sig
;
197 * identifier of this function signature used by the program.
199 * At the point that Mesa instructions for function calls are
200 * generated, we don't know the address of the first instruction of
201 * the function body. So we make the BranchTarget that is called a
202 * small integer and rewrite them during set_branchtargets().
207 * Pointer to first instruction of the function body.
209 * Set during function body emits after main() is processed.
211 ir_to_mesa_instruction
*bgn_inst
;
214 * Index of the first instruction of the function body in actual
217 * Set after convertion from ir_to_mesa_instruction to prog_instruction.
221 /** Storage for the return value. */
225 class ir_to_mesa_visitor
: public ir_visitor
{
227 ir_to_mesa_visitor();
228 ~ir_to_mesa_visitor();
230 function_entry
*current_function
;
232 struct gl_context
*ctx
;
233 struct gl_program
*prog
;
234 struct gl_shader_program
*shader_program
;
235 struct gl_shader_compiler_options
*options
;
239 variable_storage
*find_variable_storage(ir_variable
*var
);
241 function_entry
*get_function_signature(ir_function_signature
*sig
);
243 src_reg
get_temp(const glsl_type
*type
);
244 void reladdr_to_temp(ir_instruction
*ir
, src_reg
*reg
, int *num_reladdr
);
246 src_reg
src_reg_for_float(float val
);
249 * \name Visit methods
251 * As typical for the visitor pattern, there must be one \c visit method for
252 * each concrete subclass of \c ir_instruction. Virtual base classes within
253 * the hierarchy should not have \c visit methods.
256 virtual void visit(ir_variable
*);
257 virtual void visit(ir_loop
*);
258 virtual void visit(ir_loop_jump
*);
259 virtual void visit(ir_function_signature
*);
260 virtual void visit(ir_function
*);
261 virtual void visit(ir_expression
*);
262 virtual void visit(ir_swizzle
*);
263 virtual void visit(ir_dereference_variable
*);
264 virtual void visit(ir_dereference_array
*);
265 virtual void visit(ir_dereference_record
*);
266 virtual void visit(ir_assignment
*);
267 virtual void visit(ir_constant
*);
268 virtual void visit(ir_call
*);
269 virtual void visit(ir_return
*);
270 virtual void visit(ir_discard
*);
271 virtual void visit(ir_texture
*);
272 virtual void visit(ir_if
*);
277 /** List of variable_storage */
280 /** List of function_entry */
281 exec_list function_signatures
;
282 int next_signature_id
;
284 /** List of ir_to_mesa_instruction */
285 exec_list instructions
;
287 ir_to_mesa_instruction
*emit(ir_instruction
*ir
, enum prog_opcode op
);
289 ir_to_mesa_instruction
*emit(ir_instruction
*ir
, enum prog_opcode op
,
290 dst_reg dst
, src_reg src0
);
292 ir_to_mesa_instruction
*emit(ir_instruction
*ir
, enum prog_opcode op
,
293 dst_reg dst
, src_reg src0
, src_reg src1
);
295 ir_to_mesa_instruction
*emit(ir_instruction
*ir
, enum prog_opcode op
,
297 src_reg src0
, src_reg src1
, src_reg src2
);
300 * Emit the correct dot-product instruction for the type of arguments
302 ir_to_mesa_instruction
* emit_dp(ir_instruction
*ir
,
308 void emit_scalar(ir_instruction
*ir
, enum prog_opcode op
,
309 dst_reg dst
, src_reg src0
);
311 void emit_scalar(ir_instruction
*ir
, enum prog_opcode op
,
312 dst_reg dst
, src_reg src0
, src_reg src1
);
314 void emit_scs(ir_instruction
*ir
, enum prog_opcode op
,
315 dst_reg dst
, const src_reg
&src
);
317 bool try_emit_mad(ir_expression
*ir
,
319 bool try_emit_mad_for_and_not(ir_expression
*ir
,
321 bool try_emit_sat(ir_expression
*ir
);
323 void emit_swz(ir_expression
*ir
);
325 bool process_move_condition(ir_rvalue
*ir
);
327 void copy_propagate(void);
332 src_reg undef_src
= src_reg(PROGRAM_UNDEFINED
, 0, NULL
);
334 dst_reg undef_dst
= dst_reg(PROGRAM_UNDEFINED
, SWIZZLE_NOOP
);
336 dst_reg address_reg
= dst_reg(PROGRAM_ADDRESS
, WRITEMASK_X
);
339 swizzle_for_size(int size
)
341 int size_swizzles
[4] = {
342 MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_X
, SWIZZLE_X
, SWIZZLE_X
),
343 MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
, SWIZZLE_Y
, SWIZZLE_Y
),
344 MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
, SWIZZLE_Z
, SWIZZLE_Z
),
345 MAKE_SWIZZLE4(SWIZZLE_X
, SWIZZLE_Y
, SWIZZLE_Z
, SWIZZLE_W
),
348 assert((size
>= 1) && (size
<= 4));
349 return size_swizzles
[size
- 1];
352 ir_to_mesa_instruction
*
353 ir_to_mesa_visitor::emit(ir_instruction
*ir
, enum prog_opcode op
,
355 src_reg src0
, src_reg src1
, src_reg src2
)
357 ir_to_mesa_instruction
*inst
= new(mem_ctx
) ir_to_mesa_instruction();
360 /* If we have to do relative addressing, we want to load the ARL
361 * reg directly for one of the regs, and preload the other reladdr
362 * sources into temps.
364 num_reladdr
+= dst
.reladdr
!= NULL
;
365 num_reladdr
+= src0
.reladdr
!= NULL
;
366 num_reladdr
+= src1
.reladdr
!= NULL
;
367 num_reladdr
+= src2
.reladdr
!= NULL
;
369 reladdr_to_temp(ir
, &src2
, &num_reladdr
);
370 reladdr_to_temp(ir
, &src1
, &num_reladdr
);
371 reladdr_to_temp(ir
, &src0
, &num_reladdr
);
374 emit(ir
, OPCODE_ARL
, address_reg
, *dst
.reladdr
);
377 assert(num_reladdr
== 0);
386 inst
->function
= NULL
;
388 this->instructions
.push_tail(inst
);
394 ir_to_mesa_instruction
*
395 ir_to_mesa_visitor::emit(ir_instruction
*ir
, enum prog_opcode op
,
396 dst_reg dst
, src_reg src0
, src_reg src1
)
398 return emit(ir
, op
, dst
, src0
, src1
, undef_src
);
401 ir_to_mesa_instruction
*
402 ir_to_mesa_visitor::emit(ir_instruction
*ir
, enum prog_opcode op
,
403 dst_reg dst
, src_reg src0
)
405 assert(dst
.writemask
!= 0);
406 return emit(ir
, op
, dst
, src0
, undef_src
, undef_src
);
409 ir_to_mesa_instruction
*
410 ir_to_mesa_visitor::emit(ir_instruction
*ir
, enum prog_opcode op
)
412 return emit(ir
, op
, undef_dst
, undef_src
, undef_src
, undef_src
);
415 ir_to_mesa_instruction
*
416 ir_to_mesa_visitor::emit_dp(ir_instruction
*ir
,
417 dst_reg dst
, src_reg src0
, src_reg src1
,
420 static const gl_inst_opcode dot_opcodes
[] = {
421 OPCODE_DP2
, OPCODE_DP3
, OPCODE_DP4
424 return emit(ir
, dot_opcodes
[elements
- 2], dst
, src0
, src1
);
428 * Emits Mesa scalar opcodes to produce unique answers across channels.
430 * Some Mesa opcodes are scalar-only, like ARB_fp/vp. The src X
431 * channel determines the result across all channels. So to do a vec4
432 * of this operation, we want to emit a scalar per source channel used
433 * to produce dest channels.
436 ir_to_mesa_visitor::emit_scalar(ir_instruction
*ir
, enum prog_opcode op
,
438 src_reg orig_src0
, src_reg orig_src1
)
441 int done_mask
= ~dst
.writemask
;
443 /* Mesa RCP is a scalar operation splatting results to all channels,
444 * like ARB_fp/vp. So emit as many RCPs as necessary to cover our
447 for (i
= 0; i
< 4; i
++) {
448 GLuint this_mask
= (1 << i
);
449 ir_to_mesa_instruction
*inst
;
450 src_reg src0
= orig_src0
;
451 src_reg src1
= orig_src1
;
453 if (done_mask
& this_mask
)
456 GLuint src0_swiz
= GET_SWZ(src0
.swizzle
, i
);
457 GLuint src1_swiz
= GET_SWZ(src1
.swizzle
, i
);
458 for (j
= i
+ 1; j
< 4; j
++) {
459 /* If there is another enabled component in the destination that is
460 * derived from the same inputs, generate its value on this pass as
463 if (!(done_mask
& (1 << j
)) &&
464 GET_SWZ(src0
.swizzle
, j
) == src0_swiz
&&
465 GET_SWZ(src1
.swizzle
, j
) == src1_swiz
) {
466 this_mask
|= (1 << j
);
469 src0
.swizzle
= MAKE_SWIZZLE4(src0_swiz
, src0_swiz
,
470 src0_swiz
, src0_swiz
);
471 src1
.swizzle
= MAKE_SWIZZLE4(src1_swiz
, src1_swiz
,
472 src1_swiz
, src1_swiz
);
474 inst
= emit(ir
, op
, dst
, src0
, src1
);
475 inst
->dst
.writemask
= this_mask
;
476 done_mask
|= this_mask
;
481 ir_to_mesa_visitor::emit_scalar(ir_instruction
*ir
, enum prog_opcode op
,
482 dst_reg dst
, src_reg src0
)
484 src_reg undef
= undef_src
;
486 undef
.swizzle
= SWIZZLE_XXXX
;
488 emit_scalar(ir
, op
, dst
, src0
, undef
);
492 * Emit an OPCODE_SCS instruction
494 * The \c SCS opcode functions a bit differently than the other Mesa (or
495 * ARB_fragment_program) opcodes. Instead of splatting its result across all
496 * four components of the destination, it writes one value to the \c x
497 * component and another value to the \c y component.
499 * \param ir IR instruction being processed
500 * \param op Either \c OPCODE_SIN or \c OPCODE_COS depending on which
502 * \param dst Destination register
503 * \param src Source register
506 ir_to_mesa_visitor::emit_scs(ir_instruction
*ir
, enum prog_opcode op
,
510 /* Vertex programs cannot use the SCS opcode.
512 if (this->prog
->Target
== GL_VERTEX_PROGRAM_ARB
) {
513 emit_scalar(ir
, op
, dst
, src
);
517 const unsigned component
= (op
== OPCODE_SIN
) ? 0 : 1;
518 const unsigned scs_mask
= (1U << component
);
519 int done_mask
= ~dst
.writemask
;
522 assert(op
== OPCODE_SIN
|| op
== OPCODE_COS
);
524 /* If there are compnents in the destination that differ from the component
525 * that will be written by the SCS instrution, we'll need a temporary.
527 if (scs_mask
!= unsigned(dst
.writemask
)) {
528 tmp
= get_temp(glsl_type::vec4_type
);
531 for (unsigned i
= 0; i
< 4; i
++) {
532 unsigned this_mask
= (1U << i
);
535 if ((done_mask
& this_mask
) != 0)
538 /* The source swizzle specified which component of the source generates
539 * sine / cosine for the current component in the destination. The SCS
540 * instruction requires that this value be swizzle to the X component.
541 * Replace the current swizzle with a swizzle that puts the source in
544 unsigned src0_swiz
= GET_SWZ(src
.swizzle
, i
);
546 src0
.swizzle
= MAKE_SWIZZLE4(src0_swiz
, src0_swiz
,
547 src0_swiz
, src0_swiz
);
548 for (unsigned j
= i
+ 1; j
< 4; j
++) {
549 /* If there is another enabled component in the destination that is
550 * derived from the same inputs, generate its value on this pass as
553 if (!(done_mask
& (1 << j
)) &&
554 GET_SWZ(src0
.swizzle
, j
) == src0_swiz
) {
555 this_mask
|= (1 << j
);
559 if (this_mask
!= scs_mask
) {
560 ir_to_mesa_instruction
*inst
;
561 dst_reg tmp_dst
= dst_reg(tmp
);
563 /* Emit the SCS instruction.
565 inst
= emit(ir
, OPCODE_SCS
, tmp_dst
, src0
);
566 inst
->dst
.writemask
= scs_mask
;
568 /* Move the result of the SCS instruction to the desired location in
571 tmp
.swizzle
= MAKE_SWIZZLE4(component
, component
,
572 component
, component
);
573 inst
= emit(ir
, OPCODE_SCS
, dst
, tmp
);
574 inst
->dst
.writemask
= this_mask
;
576 /* Emit the SCS instruction to write directly to the destination.
578 ir_to_mesa_instruction
*inst
= emit(ir
, OPCODE_SCS
, dst
, src0
);
579 inst
->dst
.writemask
= scs_mask
;
582 done_mask
|= this_mask
;
587 ir_to_mesa_visitor::src_reg_for_float(float val
)
589 src_reg
src(PROGRAM_CONSTANT
, -1, NULL
);
591 src
.index
= _mesa_add_unnamed_constant(this->prog
->Parameters
,
592 (const gl_constant_value
*)&val
, 1, &src
.swizzle
);
598 type_size(const struct glsl_type
*type
)
603 switch (type
->base_type
) {
606 case GLSL_TYPE_FLOAT
:
608 if (type
->is_matrix()) {
609 return type
->matrix_columns
;
611 /* Regardless of size of vector, it gets a vec4. This is bad
612 * packing for things like floats, but otherwise arrays become a
613 * mess. Hopefully a later pass over the code can pack scalars
614 * down if appropriate.
618 case GLSL_TYPE_ARRAY
:
619 assert(type
->length
> 0);
620 return type_size(type
->fields
.array
) * type
->length
;
621 case GLSL_TYPE_STRUCT
:
623 for (i
= 0; i
< type
->length
; i
++) {
624 size
+= type_size(type
->fields
.structure
[i
].type
);
627 case GLSL_TYPE_SAMPLER
:
628 /* Samplers take up one slot in UNIFORMS[], but they're baked in
639 * In the initial pass of codegen, we assign temporary numbers to
640 * intermediate results. (not SSA -- variable assignments will reuse
641 * storage). Actual register allocation for the Mesa VM occurs in a
642 * pass over the Mesa IR later.
645 ir_to_mesa_visitor::get_temp(const glsl_type
*type
)
649 src
.file
= PROGRAM_TEMPORARY
;
650 src
.index
= next_temp
;
652 next_temp
+= type_size(type
);
654 if (type
->is_array() || type
->is_record()) {
655 src
.swizzle
= SWIZZLE_NOOP
;
657 src
.swizzle
= swizzle_for_size(type
->vector_elements
);
665 ir_to_mesa_visitor::find_variable_storage(ir_variable
*var
)
668 variable_storage
*entry
;
670 foreach_iter(exec_list_iterator
, iter
, this->variables
) {
671 entry
= (variable_storage
*)iter
.get();
673 if (entry
->var
== var
)
681 ir_to_mesa_visitor::visit(ir_variable
*ir
)
683 if (strcmp(ir
->name
, "gl_FragCoord") == 0) {
684 struct gl_fragment_program
*fp
= (struct gl_fragment_program
*)this->prog
;
686 fp
->OriginUpperLeft
= ir
->origin_upper_left
;
687 fp
->PixelCenterInteger
= ir
->pixel_center_integer
;
689 } else if (strcmp(ir
->name
, "gl_FragDepth") == 0) {
690 struct gl_fragment_program
*fp
= (struct gl_fragment_program
*)this->prog
;
691 switch (ir
->depth_layout
) {
692 case ir_depth_layout_none
:
693 fp
->FragDepthLayout
= FRAG_DEPTH_LAYOUT_NONE
;
695 case ir_depth_layout_any
:
696 fp
->FragDepthLayout
= FRAG_DEPTH_LAYOUT_ANY
;
698 case ir_depth_layout_greater
:
699 fp
->FragDepthLayout
= FRAG_DEPTH_LAYOUT_GREATER
;
701 case ir_depth_layout_less
:
702 fp
->FragDepthLayout
= FRAG_DEPTH_LAYOUT_LESS
;
704 case ir_depth_layout_unchanged
:
705 fp
->FragDepthLayout
= FRAG_DEPTH_LAYOUT_UNCHANGED
;
713 if (ir
->mode
== ir_var_uniform
&& strncmp(ir
->name
, "gl_", 3) == 0) {
715 const ir_state_slot
*const slots
= ir
->state_slots
;
716 assert(ir
->state_slots
!= NULL
);
718 /* Check if this statevar's setup in the STATE file exactly
719 * matches how we'll want to reference it as a
720 * struct/array/whatever. If not, then we need to move it into
721 * temporary storage and hope that it'll get copy-propagated
724 for (i
= 0; i
< ir
->num_state_slots
; i
++) {
725 if (slots
[i
].swizzle
!= SWIZZLE_XYZW
) {
730 variable_storage
*storage
;
732 if (i
== ir
->num_state_slots
) {
733 /* We'll set the index later. */
734 storage
= new(mem_ctx
) variable_storage(ir
, PROGRAM_STATE_VAR
, -1);
735 this->variables
.push_tail(storage
);
739 /* The variable_storage constructor allocates slots based on the size
740 * of the type. However, this had better match the number of state
741 * elements that we're going to copy into the new temporary.
743 assert((int) ir
->num_state_slots
== type_size(ir
->type
));
745 storage
= new(mem_ctx
) variable_storage(ir
, PROGRAM_TEMPORARY
,
747 this->variables
.push_tail(storage
);
748 this->next_temp
+= type_size(ir
->type
);
750 dst
= dst_reg(src_reg(PROGRAM_TEMPORARY
, storage
->index
, NULL
));
754 for (unsigned int i
= 0; i
< ir
->num_state_slots
; i
++) {
755 int index
= _mesa_add_state_reference(this->prog
->Parameters
,
756 (gl_state_index
*)slots
[i
].tokens
);
758 if (storage
->file
== PROGRAM_STATE_VAR
) {
759 if (storage
->index
== -1) {
760 storage
->index
= index
;
762 assert(index
== storage
->index
+ (int)i
);
765 src_reg
src(PROGRAM_STATE_VAR
, index
, NULL
);
766 src
.swizzle
= slots
[i
].swizzle
;
767 emit(ir
, OPCODE_MOV
, dst
, src
);
768 /* even a float takes up a whole vec4 reg in a struct/array. */
773 if (storage
->file
== PROGRAM_TEMPORARY
&&
774 dst
.index
!= storage
->index
+ (int) ir
->num_state_slots
) {
775 linker_error(this->shader_program
,
776 "failed to load builtin uniform `%s' "
777 "(%d/%d regs loaded)\n",
778 ir
->name
, dst
.index
- storage
->index
,
779 type_size(ir
->type
));
785 ir_to_mesa_visitor::visit(ir_loop
*ir
)
787 ir_dereference_variable
*counter
= NULL
;
789 if (ir
->counter
!= NULL
)
790 counter
= new(mem_ctx
) ir_dereference_variable(ir
->counter
);
792 if (ir
->from
!= NULL
) {
793 assert(ir
->counter
!= NULL
);
796 new(mem_ctx
) ir_assignment(counter
, ir
->from
, NULL
);
801 emit(NULL
, OPCODE_BGNLOOP
);
805 new(mem_ctx
) ir_expression(ir
->cmp
, glsl_type::bool_type
,
807 ir_if
*if_stmt
= new(mem_ctx
) ir_if(e
);
810 new(mem_ctx
) ir_loop_jump(ir_loop_jump::jump_break
);
812 if_stmt
->then_instructions
.push_tail(brk
);
814 if_stmt
->accept(this);
817 visit_exec_list(&ir
->body_instructions
, this);
821 new(mem_ctx
) ir_expression(ir_binop_add
, counter
->type
,
822 counter
, ir
->increment
);
825 new(mem_ctx
) ir_assignment(counter
, e
, NULL
);
830 emit(NULL
, OPCODE_ENDLOOP
);
834 ir_to_mesa_visitor::visit(ir_loop_jump
*ir
)
837 case ir_loop_jump::jump_break
:
838 emit(NULL
, OPCODE_BRK
);
840 case ir_loop_jump::jump_continue
:
841 emit(NULL
, OPCODE_CONT
);
848 ir_to_mesa_visitor::visit(ir_function_signature
*ir
)
855 ir_to_mesa_visitor::visit(ir_function
*ir
)
857 /* Ignore function bodies other than main() -- we shouldn't see calls to
858 * them since they should all be inlined before we get to ir_to_mesa.
860 if (strcmp(ir
->name
, "main") == 0) {
861 const ir_function_signature
*sig
;
864 sig
= ir
->matching_signature(&empty
);
868 foreach_iter(exec_list_iterator
, iter
, sig
->body
) {
869 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
877 ir_to_mesa_visitor::try_emit_mad(ir_expression
*ir
, int mul_operand
)
879 int nonmul_operand
= 1 - mul_operand
;
882 ir_expression
*expr
= ir
->operands
[mul_operand
]->as_expression();
883 if (!expr
|| expr
->operation
!= ir_binop_mul
)
886 expr
->operands
[0]->accept(this);
888 expr
->operands
[1]->accept(this);
890 ir
->operands
[nonmul_operand
]->accept(this);
893 this->result
= get_temp(ir
->type
);
894 emit(ir
, OPCODE_MAD
, dst_reg(this->result
), a
, b
, c
);
900 * Emit OPCODE_MAD(a, -b, a) instead of AND(a, NOT(b))
902 * The logic values are 1.0 for true and 0.0 for false. Logical-and is
903 * implemented using multiplication, and logical-or is implemented using
904 * addition. Logical-not can be implemented as (true - x), or (1.0 - x).
905 * As result, the logical expression (a & !b) can be rewritten as:
909 * - (a * 1) - (a * b)
913 * This final expression can be implemented as a single MAD(a, -b, a)
917 ir_to_mesa_visitor::try_emit_mad_for_and_not(ir_expression
*ir
, int try_operand
)
919 const int other_operand
= 1 - try_operand
;
922 ir_expression
*expr
= ir
->operands
[try_operand
]->as_expression();
923 if (!expr
|| expr
->operation
!= ir_unop_logic_not
)
926 ir
->operands
[other_operand
]->accept(this);
928 expr
->operands
[0]->accept(this);
931 b
.negate
= ~b
.negate
;
933 this->result
= get_temp(ir
->type
);
934 emit(ir
, OPCODE_MAD
, dst_reg(this->result
), a
, b
, a
);
940 ir_to_mesa_visitor::try_emit_sat(ir_expression
*ir
)
942 /* Saturates were only introduced to vertex programs in
943 * NV_vertex_program3, so don't give them to drivers in the VP.
945 if (this->prog
->Target
== GL_VERTEX_PROGRAM_ARB
)
948 ir_rvalue
*sat_src
= ir
->as_rvalue_to_saturate();
952 sat_src
->accept(this);
953 src_reg src
= this->result
;
955 /* If we generated an expression instruction into a temporary in
956 * processing the saturate's operand, apply the saturate to that
957 * instruction. Otherwise, generate a MOV to do the saturate.
959 * Note that we have to be careful to only do this optimization if
960 * the instruction in question was what generated src->result. For
961 * example, ir_dereference_array might generate a MUL instruction
962 * to create the reladdr, and return us a src reg using that
963 * reladdr. That MUL result is not the value we're trying to
966 ir_expression
*sat_src_expr
= sat_src
->as_expression();
967 ir_to_mesa_instruction
*new_inst
;
968 new_inst
= (ir_to_mesa_instruction
*)this->instructions
.get_tail();
969 if (sat_src_expr
&& (sat_src_expr
->operation
== ir_binop_mul
||
970 sat_src_expr
->operation
== ir_binop_add
||
971 sat_src_expr
->operation
== ir_binop_dot
)) {
972 new_inst
->saturate
= true;
974 this->result
= get_temp(ir
->type
);
975 ir_to_mesa_instruction
*inst
;
976 inst
= emit(ir
, OPCODE_MOV
, dst_reg(this->result
), src
);
977 inst
->saturate
= true;
984 ir_to_mesa_visitor::reladdr_to_temp(ir_instruction
*ir
,
985 src_reg
*reg
, int *num_reladdr
)
990 emit(ir
, OPCODE_ARL
, address_reg
, *reg
->reladdr
);
992 if (*num_reladdr
!= 1) {
993 src_reg temp
= get_temp(glsl_type::vec4_type
);
995 emit(ir
, OPCODE_MOV
, dst_reg(temp
), *reg
);
1003 ir_to_mesa_visitor::emit_swz(ir_expression
*ir
)
1005 /* Assume that the vector operator is in a form compatible with OPCODE_SWZ.
1006 * This means that each of the operands is either an immediate value of -1,
1007 * 0, or 1, or is a component from one source register (possibly with
1010 uint8_t components
[4] = { 0 };
1011 bool negate
[4] = { false };
1012 ir_variable
*var
= NULL
;
1014 for (unsigned i
= 0; i
< ir
->type
->vector_elements
; i
++) {
1015 ir_rvalue
*op
= ir
->operands
[i
];
1017 assert(op
->type
->is_scalar());
1019 while (op
!= NULL
) {
1020 switch (op
->ir_type
) {
1021 case ir_type_constant
: {
1023 assert(op
->type
->is_scalar());
1025 const ir_constant
*const c
= op
->as_constant();
1027 components
[i
] = SWIZZLE_ONE
;
1028 } else if (c
->is_zero()) {
1029 components
[i
] = SWIZZLE_ZERO
;
1030 } else if (c
->is_negative_one()) {
1031 components
[i
] = SWIZZLE_ONE
;
1034 assert(!"SWZ constant must be 0.0 or 1.0.");
1041 case ir_type_dereference_variable
: {
1042 ir_dereference_variable
*const deref
=
1043 (ir_dereference_variable
*) op
;
1045 assert((var
== NULL
) || (deref
->var
== var
));
1046 components
[i
] = SWIZZLE_X
;
1052 case ir_type_expression
: {
1053 ir_expression
*const expr
= (ir_expression
*) op
;
1055 assert(expr
->operation
== ir_unop_neg
);
1058 op
= expr
->operands
[0];
1062 case ir_type_swizzle
: {
1063 ir_swizzle
*const swiz
= (ir_swizzle
*) op
;
1065 components
[i
] = swiz
->mask
.x
;
1071 assert(!"Should not get here.");
1077 assert(var
!= NULL
);
1079 ir_dereference_variable
*const deref
=
1080 new(mem_ctx
) ir_dereference_variable(var
);
1082 this->result
.file
= PROGRAM_UNDEFINED
;
1083 deref
->accept(this);
1084 if (this->result
.file
== PROGRAM_UNDEFINED
) {
1086 printf("Failed to get tree for expression operand:\n");
1094 src
.swizzle
= MAKE_SWIZZLE4(components
[0],
1098 src
.negate
= ((unsigned(negate
[0]) << 0)
1099 | (unsigned(negate
[1]) << 1)
1100 | (unsigned(negate
[2]) << 2)
1101 | (unsigned(negate
[3]) << 3));
1103 /* Storage for our result. Ideally for an assignment we'd be using the
1104 * actual storage for the result here, instead.
1106 const src_reg result_src
= get_temp(ir
->type
);
1107 dst_reg result_dst
= dst_reg(result_src
);
1109 /* Limit writes to the channels that will be used by result_src later.
1110 * This does limit this temp's use as a temporary for multi-instruction
1113 result_dst
.writemask
= (1 << ir
->type
->vector_elements
) - 1;
1115 emit(ir
, OPCODE_SWZ
, result_dst
, src
);
1116 this->result
= result_src
;
1120 ir_to_mesa_visitor::visit(ir_expression
*ir
)
1122 unsigned int operand
;
1123 src_reg op
[Elements(ir
->operands
)];
1127 /* Quick peephole: Emit OPCODE_MAD(a, b, c) instead of ADD(MUL(a, b), c)
1129 if (ir
->operation
== ir_binop_add
) {
1130 if (try_emit_mad(ir
, 1))
1132 if (try_emit_mad(ir
, 0))
1136 /* Quick peephole: Emit OPCODE_MAD(-a, -b, a) instead of AND(a, NOT(b))
1138 if (ir
->operation
== ir_binop_logic_and
) {
1139 if (try_emit_mad_for_and_not(ir
, 1))
1141 if (try_emit_mad_for_and_not(ir
, 0))
1145 if (try_emit_sat(ir
))
1148 if (ir
->operation
== ir_quadop_vector
) {
1153 for (operand
= 0; operand
< ir
->get_num_operands(); operand
++) {
1154 this->result
.file
= PROGRAM_UNDEFINED
;
1155 ir
->operands
[operand
]->accept(this);
1156 if (this->result
.file
== PROGRAM_UNDEFINED
) {
1158 printf("Failed to get tree for expression operand:\n");
1159 ir
->operands
[operand
]->accept(&v
);
1162 op
[operand
] = this->result
;
1164 /* Matrix expression operands should have been broken down to vector
1165 * operations already.
1167 assert(!ir
->operands
[operand
]->type
->is_matrix());
1170 int vector_elements
= ir
->operands
[0]->type
->vector_elements
;
1171 if (ir
->operands
[1]) {
1172 vector_elements
= MAX2(vector_elements
,
1173 ir
->operands
[1]->type
->vector_elements
);
1176 this->result
.file
= PROGRAM_UNDEFINED
;
1178 /* Storage for our result. Ideally for an assignment we'd be using
1179 * the actual storage for the result here, instead.
1181 result_src
= get_temp(ir
->type
);
1182 /* convenience for the emit functions below. */
1183 result_dst
= dst_reg(result_src
);
1184 /* Limit writes to the channels that will be used by result_src later.
1185 * This does limit this temp's use as a temporary for multi-instruction
1188 result_dst
.writemask
= (1 << ir
->type
->vector_elements
) - 1;
1190 switch (ir
->operation
) {
1191 case ir_unop_logic_not
:
1192 /* Previously 'SEQ dst, src, 0.0' was used for this. However, many
1193 * older GPUs implement SEQ using multiple instructions (i915 uses two
1194 * SGE instructions and a MUL instruction). Since our logic values are
1195 * 0.0 and 1.0, 1-x also implements !x.
1197 op
[0].negate
= ~op
[0].negate
;
1198 emit(ir
, OPCODE_ADD
, result_dst
, op
[0], src_reg_for_float(1.0));
1201 op
[0].negate
= ~op
[0].negate
;
1205 emit(ir
, OPCODE_ABS
, result_dst
, op
[0]);
1208 emit(ir
, OPCODE_SSG
, result_dst
, op
[0]);
1211 emit_scalar(ir
, OPCODE_RCP
, result_dst
, op
[0]);
1215 emit_scalar(ir
, OPCODE_EX2
, result_dst
, op
[0]);
1219 assert(!"not reached: should be handled by ir_explog_to_explog2");
1222 emit_scalar(ir
, OPCODE_LG2
, result_dst
, op
[0]);
1225 emit_scalar(ir
, OPCODE_SIN
, result_dst
, op
[0]);
1228 emit_scalar(ir
, OPCODE_COS
, result_dst
, op
[0]);
1230 case ir_unop_sin_reduced
:
1231 emit_scs(ir
, OPCODE_SIN
, result_dst
, op
[0]);
1233 case ir_unop_cos_reduced
:
1234 emit_scs(ir
, OPCODE_COS
, result_dst
, op
[0]);
1238 emit(ir
, OPCODE_DDX
, result_dst
, op
[0]);
1241 emit(ir
, OPCODE_DDY
, result_dst
, op
[0]);
1244 case ir_unop_noise
: {
1245 const enum prog_opcode opcode
=
1246 prog_opcode(OPCODE_NOISE1
1247 + (ir
->operands
[0]->type
->vector_elements
) - 1);
1248 assert((opcode
>= OPCODE_NOISE1
) && (opcode
<= OPCODE_NOISE4
));
1250 emit(ir
, opcode
, result_dst
, op
[0]);
1255 emit(ir
, OPCODE_ADD
, result_dst
, op
[0], op
[1]);
1258 emit(ir
, OPCODE_SUB
, result_dst
, op
[0], op
[1]);
1262 emit(ir
, OPCODE_MUL
, result_dst
, op
[0], op
[1]);
1265 assert(!"not reached: should be handled by ir_div_to_mul_rcp");
1268 /* Floating point should be lowered by MOD_TO_FRACT in the compiler. */
1269 assert(ir
->type
->is_integer());
1270 emit(ir
, OPCODE_MUL
, result_dst
, op
[0], op
[1]);
1274 emit(ir
, OPCODE_SLT
, result_dst
, op
[0], op
[1]);
1276 case ir_binop_greater
:
1277 emit(ir
, OPCODE_SGT
, result_dst
, op
[0], op
[1]);
1279 case ir_binop_lequal
:
1280 emit(ir
, OPCODE_SLE
, result_dst
, op
[0], op
[1]);
1282 case ir_binop_gequal
:
1283 emit(ir
, OPCODE_SGE
, result_dst
, op
[0], op
[1]);
1285 case ir_binop_equal
:
1286 emit(ir
, OPCODE_SEQ
, result_dst
, op
[0], op
[1]);
1288 case ir_binop_nequal
:
1289 emit(ir
, OPCODE_SNE
, result_dst
, op
[0], op
[1]);
1291 case ir_binop_all_equal
:
1292 /* "==" operator producing a scalar boolean. */
1293 if (ir
->operands
[0]->type
->is_vector() ||
1294 ir
->operands
[1]->type
->is_vector()) {
1295 src_reg temp
= get_temp(glsl_type::vec4_type
);
1296 emit(ir
, OPCODE_SNE
, dst_reg(temp
), op
[0], op
[1]);
1298 /* After the dot-product, the value will be an integer on the
1299 * range [0,4]. Zero becomes 1.0, and positive values become zero.
1301 emit_dp(ir
, result_dst
, temp
, temp
, vector_elements
);
1303 /* Negating the result of the dot-product gives values on the range
1304 * [-4, 0]. Zero becomes 1.0, and negative values become zero. This
1305 * achieved using SGE.
1307 src_reg sge_src
= result_src
;
1308 sge_src
.negate
= ~sge_src
.negate
;
1309 emit(ir
, OPCODE_SGE
, result_dst
, sge_src
, src_reg_for_float(0.0));
1311 emit(ir
, OPCODE_SEQ
, result_dst
, op
[0], op
[1]);
1314 case ir_binop_any_nequal
:
1315 /* "!=" operator producing a scalar boolean. */
1316 if (ir
->operands
[0]->type
->is_vector() ||
1317 ir
->operands
[1]->type
->is_vector()) {
1318 src_reg temp
= get_temp(glsl_type::vec4_type
);
1319 emit(ir
, OPCODE_SNE
, dst_reg(temp
), op
[0], op
[1]);
1321 /* After the dot-product, the value will be an integer on the
1322 * range [0,4]. Zero stays zero, and positive values become 1.0.
1324 ir_to_mesa_instruction
*const dp
=
1325 emit_dp(ir
, result_dst
, temp
, temp
, vector_elements
);
1326 if (this->prog
->Target
== GL_FRAGMENT_PROGRAM_ARB
) {
1327 /* The clamping to [0,1] can be done for free in the fragment
1328 * shader with a saturate.
1330 dp
->saturate
= true;
1332 /* Negating the result of the dot-product gives values on the range
1333 * [-4, 0]. Zero stays zero, and negative values become 1.0. This
1334 * achieved using SLT.
1336 src_reg slt_src
= result_src
;
1337 slt_src
.negate
= ~slt_src
.negate
;
1338 emit(ir
, OPCODE_SLT
, result_dst
, slt_src
, src_reg_for_float(0.0));
1341 emit(ir
, OPCODE_SNE
, result_dst
, op
[0], op
[1]);
1346 assert(ir
->operands
[0]->type
->is_vector());
1348 /* After the dot-product, the value will be an integer on the
1349 * range [0,4]. Zero stays zero, and positive values become 1.0.
1351 ir_to_mesa_instruction
*const dp
=
1352 emit_dp(ir
, result_dst
, op
[0], op
[0],
1353 ir
->operands
[0]->type
->vector_elements
);
1354 if (this->prog
->Target
== GL_FRAGMENT_PROGRAM_ARB
) {
1355 /* The clamping to [0,1] can be done for free in the fragment
1356 * shader with a saturate.
1358 dp
->saturate
= true;
1360 /* Negating the result of the dot-product gives values on the range
1361 * [-4, 0]. Zero stays zero, and negative values become 1.0. This
1362 * is achieved using SLT.
1364 src_reg slt_src
= result_src
;
1365 slt_src
.negate
= ~slt_src
.negate
;
1366 emit(ir
, OPCODE_SLT
, result_dst
, slt_src
, src_reg_for_float(0.0));
1371 case ir_binop_logic_xor
:
1372 emit(ir
, OPCODE_SNE
, result_dst
, op
[0], op
[1]);
1375 case ir_binop_logic_or
: {
1376 /* After the addition, the value will be an integer on the
1377 * range [0,2]. Zero stays zero, and positive values become 1.0.
1379 ir_to_mesa_instruction
*add
=
1380 emit(ir
, OPCODE_ADD
, result_dst
, op
[0], op
[1]);
1381 if (this->prog
->Target
== GL_FRAGMENT_PROGRAM_ARB
) {
1382 /* The clamping to [0,1] can be done for free in the fragment
1383 * shader with a saturate.
1385 add
->saturate
= true;
1387 /* Negating the result of the addition gives values on the range
1388 * [-2, 0]. Zero stays zero, and negative values become 1.0. This
1389 * is achieved using SLT.
1391 src_reg slt_src
= result_src
;
1392 slt_src
.negate
= ~slt_src
.negate
;
1393 emit(ir
, OPCODE_SLT
, result_dst
, slt_src
, src_reg_for_float(0.0));
1398 case ir_binop_logic_and
:
1399 /* the bool args are stored as float 0.0 or 1.0, so "mul" gives us "and". */
1400 emit(ir
, OPCODE_MUL
, result_dst
, op
[0], op
[1]);
1404 assert(ir
->operands
[0]->type
->is_vector());
1405 assert(ir
->operands
[0]->type
== ir
->operands
[1]->type
);
1406 emit_dp(ir
, result_dst
, op
[0], op
[1],
1407 ir
->operands
[0]->type
->vector_elements
);
1411 /* sqrt(x) = x * rsq(x). */
1412 emit_scalar(ir
, OPCODE_RSQ
, result_dst
, op
[0]);
1413 emit(ir
, OPCODE_MUL
, result_dst
, result_src
, op
[0]);
1414 /* For incoming channels <= 0, set the result to 0. */
1415 op
[0].negate
= ~op
[0].negate
;
1416 emit(ir
, OPCODE_CMP
, result_dst
,
1417 op
[0], result_src
, src_reg_for_float(0.0));
1420 emit_scalar(ir
, OPCODE_RSQ
, result_dst
, op
[0]);
1428 /* Mesa IR lacks types, ints are stored as truncated floats. */
1432 emit(ir
, OPCODE_TRUNC
, result_dst
, op
[0]);
1436 emit(ir
, OPCODE_SNE
, result_dst
,
1437 op
[0], src_reg_for_float(0.0));
1440 emit(ir
, OPCODE_TRUNC
, result_dst
, op
[0]);
1443 op
[0].negate
= ~op
[0].negate
;
1444 emit(ir
, OPCODE_FLR
, result_dst
, op
[0]);
1445 result_src
.negate
= ~result_src
.negate
;
1448 emit(ir
, OPCODE_FLR
, result_dst
, op
[0]);
1451 emit(ir
, OPCODE_FRC
, result_dst
, op
[0]);
1455 emit(ir
, OPCODE_MIN
, result_dst
, op
[0], op
[1]);
1458 emit(ir
, OPCODE_MAX
, result_dst
, op
[0], op
[1]);
1461 emit_scalar(ir
, OPCODE_POW
, result_dst
, op
[0], op
[1]);
1464 /* GLSL 1.30 integer ops are unsupported in Mesa IR, but since
1465 * hardware backends have no way to avoid Mesa IR generation
1466 * even if they don't use it, we need to emit "something" and
1469 case ir_binop_lshift
:
1470 case ir_binop_rshift
:
1471 case ir_binop_bit_and
:
1472 case ir_binop_bit_xor
:
1473 case ir_binop_bit_or
:
1474 emit(ir
, OPCODE_ADD
, result_dst
, op
[0], op
[1]);
1477 case ir_unop_bit_not
:
1478 case ir_unop_round_even
:
1479 emit(ir
, OPCODE_MOV
, result_dst
, op
[0]);
1482 case ir_quadop_vector
:
1483 /* This operation should have already been handled.
1485 assert(!"Should not get here.");
1489 this->result
= result_src
;
1494 ir_to_mesa_visitor::visit(ir_swizzle
*ir
)
1500 /* Note that this is only swizzles in expressions, not those on the left
1501 * hand side of an assignment, which do write masking. See ir_assignment
1505 ir
->val
->accept(this);
1507 assert(src
.file
!= PROGRAM_UNDEFINED
);
1509 for (i
= 0; i
< 4; i
++) {
1510 if (i
< ir
->type
->vector_elements
) {
1513 swizzle
[i
] = GET_SWZ(src
.swizzle
, ir
->mask
.x
);
1516 swizzle
[i
] = GET_SWZ(src
.swizzle
, ir
->mask
.y
);
1519 swizzle
[i
] = GET_SWZ(src
.swizzle
, ir
->mask
.z
);
1522 swizzle
[i
] = GET_SWZ(src
.swizzle
, ir
->mask
.w
);
1526 /* If the type is smaller than a vec4, replicate the last
1529 swizzle
[i
] = swizzle
[ir
->type
->vector_elements
- 1];
1533 src
.swizzle
= MAKE_SWIZZLE4(swizzle
[0], swizzle
[1], swizzle
[2], swizzle
[3]);
1539 ir_to_mesa_visitor::visit(ir_dereference_variable
*ir
)
1541 variable_storage
*entry
= find_variable_storage(ir
->var
);
1542 ir_variable
*var
= ir
->var
;
1545 switch (var
->mode
) {
1546 case ir_var_uniform
:
1547 entry
= new(mem_ctx
) variable_storage(var
, PROGRAM_UNIFORM
,
1549 this->variables
.push_tail(entry
);
1553 /* The linker assigns locations for varyings and attributes,
1554 * including deprecated builtins (like gl_Color),
1555 * user-assigned generic attributes (glBindVertexLocation),
1556 * and user-defined varyings.
1558 * FINISHME: We would hit this path for function arguments. Fix!
1560 assert(var
->location
!= -1);
1561 entry
= new(mem_ctx
) variable_storage(var
,
1566 assert(var
->location
!= -1);
1567 entry
= new(mem_ctx
) variable_storage(var
,
1571 case ir_var_system_value
:
1572 entry
= new(mem_ctx
) variable_storage(var
,
1573 PROGRAM_SYSTEM_VALUE
,
1577 case ir_var_temporary
:
1578 entry
= new(mem_ctx
) variable_storage(var
, PROGRAM_TEMPORARY
,
1580 this->variables
.push_tail(entry
);
1582 next_temp
+= type_size(var
->type
);
1587 printf("Failed to make storage for %s\n", var
->name
);
1592 this->result
= src_reg(entry
->file
, entry
->index
, var
->type
);
1596 ir_to_mesa_visitor::visit(ir_dereference_array
*ir
)
1600 int element_size
= type_size(ir
->type
);
1602 index
= ir
->array_index
->constant_expression_value();
1604 ir
->array
->accept(this);
1608 src
.index
+= index
->value
.i
[0] * element_size
;
1610 /* Variable index array dereference. It eats the "vec4" of the
1611 * base of the array and an index that offsets the Mesa register
1614 ir
->array_index
->accept(this);
1618 if (element_size
== 1) {
1619 index_reg
= this->result
;
1621 index_reg
= get_temp(glsl_type::float_type
);
1623 emit(ir
, OPCODE_MUL
, dst_reg(index_reg
),
1624 this->result
, src_reg_for_float(element_size
));
1627 /* If there was already a relative address register involved, add the
1628 * new and the old together to get the new offset.
1630 if (src
.reladdr
!= NULL
) {
1631 src_reg accum_reg
= get_temp(glsl_type::float_type
);
1633 emit(ir
, OPCODE_ADD
, dst_reg(accum_reg
),
1634 index_reg
, *src
.reladdr
);
1636 index_reg
= accum_reg
;
1639 src
.reladdr
= ralloc(mem_ctx
, src_reg
);
1640 memcpy(src
.reladdr
, &index_reg
, sizeof(index_reg
));
1643 /* If the type is smaller than a vec4, replicate the last channel out. */
1644 if (ir
->type
->is_scalar() || ir
->type
->is_vector())
1645 src
.swizzle
= swizzle_for_size(ir
->type
->vector_elements
);
1647 src
.swizzle
= SWIZZLE_NOOP
;
1653 ir_to_mesa_visitor::visit(ir_dereference_record
*ir
)
1656 const glsl_type
*struct_type
= ir
->record
->type
;
1659 ir
->record
->accept(this);
1661 for (i
= 0; i
< struct_type
->length
; i
++) {
1662 if (strcmp(struct_type
->fields
.structure
[i
].name
, ir
->field
) == 0)
1664 offset
+= type_size(struct_type
->fields
.structure
[i
].type
);
1667 /* If the type is smaller than a vec4, replicate the last channel out. */
1668 if (ir
->type
->is_scalar() || ir
->type
->is_vector())
1669 this->result
.swizzle
= swizzle_for_size(ir
->type
->vector_elements
);
1671 this->result
.swizzle
= SWIZZLE_NOOP
;
1673 this->result
.index
+= offset
;
1677 * We want to be careful in assignment setup to hit the actual storage
1678 * instead of potentially using a temporary like we might with the
1679 * ir_dereference handler.
1682 get_assignment_lhs(ir_dereference
*ir
, ir_to_mesa_visitor
*v
)
1684 /* The LHS must be a dereference. If the LHS is a variable indexed array
1685 * access of a vector, it must be separated into a series conditional moves
1686 * before reaching this point (see ir_vec_index_to_cond_assign).
1688 assert(ir
->as_dereference());
1689 ir_dereference_array
*deref_array
= ir
->as_dereference_array();
1691 assert(!deref_array
->array
->type
->is_vector());
1694 /* Use the rvalue deref handler for the most part. We'll ignore
1695 * swizzles in it and write swizzles using writemask, though.
1698 return dst_reg(v
->result
);
1702 * Process the condition of a conditional assignment
1704 * Examines the condition of a conditional assignment to generate the optimal
1705 * first operand of a \c CMP instruction. If the condition is a relational
1706 * operator with 0 (e.g., \c ir_binop_less), the value being compared will be
1707 * used as the source for the \c CMP instruction. Otherwise the comparison
1708 * is processed to a boolean result, and the boolean result is used as the
1709 * operand to the CMP instruction.
1712 ir_to_mesa_visitor::process_move_condition(ir_rvalue
*ir
)
1714 ir_rvalue
*src_ir
= ir
;
1716 bool switch_order
= false;
1718 ir_expression
*const expr
= ir
->as_expression();
1719 if ((expr
!= NULL
) && (expr
->get_num_operands() == 2)) {
1720 bool zero_on_left
= false;
1722 if (expr
->operands
[0]->is_zero()) {
1723 src_ir
= expr
->operands
[1];
1724 zero_on_left
= true;
1725 } else if (expr
->operands
[1]->is_zero()) {
1726 src_ir
= expr
->operands
[0];
1727 zero_on_left
= false;
1731 * (a < 0) T F F ( a < 0) T F F
1732 * (0 < a) F F T (-a < 0) F F T
1733 * (a <= 0) T T F (-a < 0) F F T (swap order of other operands)
1734 * (0 <= a) F T T ( a < 0) T F F (swap order of other operands)
1735 * (a > 0) F F T (-a < 0) F F T
1736 * (0 > a) T F F ( a < 0) T F F
1737 * (a >= 0) F T T ( a < 0) T F F (swap order of other operands)
1738 * (0 >= a) T T F (-a < 0) F F T (swap order of other operands)
1740 * Note that exchanging the order of 0 and 'a' in the comparison simply
1741 * means that the value of 'a' should be negated.
1744 switch (expr
->operation
) {
1746 switch_order
= false;
1747 negate
= zero_on_left
;
1750 case ir_binop_greater
:
1751 switch_order
= false;
1752 negate
= !zero_on_left
;
1755 case ir_binop_lequal
:
1756 switch_order
= true;
1757 negate
= !zero_on_left
;
1760 case ir_binop_gequal
:
1761 switch_order
= true;
1762 negate
= zero_on_left
;
1766 /* This isn't the right kind of comparison afterall, so make sure
1767 * the whole condition is visited.
1775 src_ir
->accept(this);
1777 /* We use the OPCODE_CMP (a < 0 ? b : c) for conditional moves, and the
1778 * condition we produced is 0.0 or 1.0. By flipping the sign, we can
1779 * choose which value OPCODE_CMP produces without an extra instruction
1780 * computing the condition.
1783 this->result
.negate
= ~this->result
.negate
;
1785 return switch_order
;
1789 ir_to_mesa_visitor::visit(ir_assignment
*ir
)
1795 ir
->rhs
->accept(this);
1798 l
= get_assignment_lhs(ir
->lhs
, this);
1800 /* FINISHME: This should really set to the correct maximal writemask for each
1801 * FINISHME: component written (in the loops below). This case can only
1802 * FINISHME: occur for matrices, arrays, and structures.
1804 if (ir
->write_mask
== 0) {
1805 assert(!ir
->lhs
->type
->is_scalar() && !ir
->lhs
->type
->is_vector());
1806 l
.writemask
= WRITEMASK_XYZW
;
1807 } else if (ir
->lhs
->type
->is_scalar()) {
1808 /* FINISHME: This hack makes writing to gl_FragDepth, which lives in the
1809 * FINISHME: W component of fragment shader output zero, work correctly.
1811 l
.writemask
= WRITEMASK_XYZW
;
1814 int first_enabled_chan
= 0;
1817 assert(ir
->lhs
->type
->is_vector());
1818 l
.writemask
= ir
->write_mask
;
1820 for (int i
= 0; i
< 4; i
++) {
1821 if (l
.writemask
& (1 << i
)) {
1822 first_enabled_chan
= GET_SWZ(r
.swizzle
, i
);
1827 /* Swizzle a small RHS vector into the channels being written.
1829 * glsl ir treats write_mask as dictating how many channels are
1830 * present on the RHS while Mesa IR treats write_mask as just
1831 * showing which channels of the vec4 RHS get written.
1833 for (int i
= 0; i
< 4; i
++) {
1834 if (l
.writemask
& (1 << i
))
1835 swizzles
[i
] = GET_SWZ(r
.swizzle
, rhs_chan
++);
1837 swizzles
[i
] = first_enabled_chan
;
1839 r
.swizzle
= MAKE_SWIZZLE4(swizzles
[0], swizzles
[1],
1840 swizzles
[2], swizzles
[3]);
1843 assert(l
.file
!= PROGRAM_UNDEFINED
);
1844 assert(r
.file
!= PROGRAM_UNDEFINED
);
1846 if (ir
->condition
) {
1847 const bool switch_order
= this->process_move_condition(ir
->condition
);
1848 src_reg condition
= this->result
;
1850 for (i
= 0; i
< type_size(ir
->lhs
->type
); i
++) {
1852 emit(ir
, OPCODE_CMP
, l
, condition
, src_reg(l
), r
);
1854 emit(ir
, OPCODE_CMP
, l
, condition
, r
, src_reg(l
));
1861 for (i
= 0; i
< type_size(ir
->lhs
->type
); i
++) {
1862 emit(ir
, OPCODE_MOV
, l
, r
);
1871 ir_to_mesa_visitor::visit(ir_constant
*ir
)
1874 GLfloat stack_vals
[4] = { 0 };
1875 GLfloat
*values
= stack_vals
;
1878 /* Unfortunately, 4 floats is all we can get into
1879 * _mesa_add_unnamed_constant. So, make a temp to store an
1880 * aggregate constant and move each constant value into it. If we
1881 * get lucky, copy propagation will eliminate the extra moves.
1884 if (ir
->type
->base_type
== GLSL_TYPE_STRUCT
) {
1885 src_reg temp_base
= get_temp(ir
->type
);
1886 dst_reg temp
= dst_reg(temp_base
);
1888 foreach_iter(exec_list_iterator
, iter
, ir
->components
) {
1889 ir_constant
*field_value
= (ir_constant
*)iter
.get();
1890 int size
= type_size(field_value
->type
);
1894 field_value
->accept(this);
1897 for (i
= 0; i
< (unsigned int)size
; i
++) {
1898 emit(ir
, OPCODE_MOV
, temp
, src
);
1904 this->result
= temp_base
;
1908 if (ir
->type
->is_array()) {
1909 src_reg temp_base
= get_temp(ir
->type
);
1910 dst_reg temp
= dst_reg(temp_base
);
1911 int size
= type_size(ir
->type
->fields
.array
);
1915 for (i
= 0; i
< ir
->type
->length
; i
++) {
1916 ir
->array_elements
[i
]->accept(this);
1918 for (int j
= 0; j
< size
; j
++) {
1919 emit(ir
, OPCODE_MOV
, temp
, src
);
1925 this->result
= temp_base
;
1929 if (ir
->type
->is_matrix()) {
1930 src_reg mat
= get_temp(ir
->type
);
1931 dst_reg mat_column
= dst_reg(mat
);
1933 for (i
= 0; i
< ir
->type
->matrix_columns
; i
++) {
1934 assert(ir
->type
->base_type
== GLSL_TYPE_FLOAT
);
1935 values
= &ir
->value
.f
[i
* ir
->type
->vector_elements
];
1937 src
= src_reg(PROGRAM_CONSTANT
, -1, NULL
);
1938 src
.index
= _mesa_add_unnamed_constant(this->prog
->Parameters
,
1939 (gl_constant_value
*) values
,
1940 ir
->type
->vector_elements
,
1942 emit(ir
, OPCODE_MOV
, mat_column
, src
);
1951 src
.file
= PROGRAM_CONSTANT
;
1952 switch (ir
->type
->base_type
) {
1953 case GLSL_TYPE_FLOAT
:
1954 values
= &ir
->value
.f
[0];
1956 case GLSL_TYPE_UINT
:
1957 for (i
= 0; i
< ir
->type
->vector_elements
; i
++) {
1958 values
[i
] = ir
->value
.u
[i
];
1962 for (i
= 0; i
< ir
->type
->vector_elements
; i
++) {
1963 values
[i
] = ir
->value
.i
[i
];
1966 case GLSL_TYPE_BOOL
:
1967 for (i
= 0; i
< ir
->type
->vector_elements
; i
++) {
1968 values
[i
] = ir
->value
.b
[i
];
1972 assert(!"Non-float/uint/int/bool constant");
1975 this->result
= src_reg(PROGRAM_CONSTANT
, -1, ir
->type
);
1976 this->result
.index
= _mesa_add_unnamed_constant(this->prog
->Parameters
,
1977 (gl_constant_value
*) values
,
1978 ir
->type
->vector_elements
,
1979 &this->result
.swizzle
);
1983 ir_to_mesa_visitor::get_function_signature(ir_function_signature
*sig
)
1985 function_entry
*entry
;
1987 foreach_iter(exec_list_iterator
, iter
, this->function_signatures
) {
1988 entry
= (function_entry
*)iter
.get();
1990 if (entry
->sig
== sig
)
1994 entry
= ralloc(mem_ctx
, function_entry
);
1996 entry
->sig_id
= this->next_signature_id
++;
1997 entry
->bgn_inst
= NULL
;
1999 /* Allocate storage for all the parameters. */
2000 foreach_iter(exec_list_iterator
, iter
, sig
->parameters
) {
2001 ir_variable
*param
= (ir_variable
*)iter
.get();
2002 variable_storage
*storage
;
2004 storage
= find_variable_storage(param
);
2007 storage
= new(mem_ctx
) variable_storage(param
, PROGRAM_TEMPORARY
,
2009 this->variables
.push_tail(storage
);
2011 this->next_temp
+= type_size(param
->type
);
2014 if (!sig
->return_type
->is_void()) {
2015 entry
->return_reg
= get_temp(sig
->return_type
);
2017 entry
->return_reg
= undef_src
;
2020 this->function_signatures
.push_tail(entry
);
2025 ir_to_mesa_visitor::visit(ir_call
*ir
)
2027 ir_to_mesa_instruction
*call_inst
;
2028 ir_function_signature
*sig
= ir
->get_callee();
2029 function_entry
*entry
= get_function_signature(sig
);
2032 /* Process in parameters. */
2033 exec_list_iterator sig_iter
= sig
->parameters
.iterator();
2034 foreach_iter(exec_list_iterator
, iter
, *ir
) {
2035 ir_rvalue
*param_rval
= (ir_rvalue
*)iter
.get();
2036 ir_variable
*param
= (ir_variable
*)sig_iter
.get();
2038 if (param
->mode
== ir_var_in
||
2039 param
->mode
== ir_var_inout
) {
2040 variable_storage
*storage
= find_variable_storage(param
);
2043 param_rval
->accept(this);
2044 src_reg r
= this->result
;
2047 l
.file
= storage
->file
;
2048 l
.index
= storage
->index
;
2050 l
.writemask
= WRITEMASK_XYZW
;
2051 l
.cond_mask
= COND_TR
;
2053 for (i
= 0; i
< type_size(param
->type
); i
++) {
2054 emit(ir
, OPCODE_MOV
, l
, r
);
2062 assert(!sig_iter
.has_next());
2064 /* Emit call instruction */
2065 call_inst
= emit(ir
, OPCODE_CAL
);
2066 call_inst
->function
= entry
;
2068 /* Process out parameters. */
2069 sig_iter
= sig
->parameters
.iterator();
2070 foreach_iter(exec_list_iterator
, iter
, *ir
) {
2071 ir_rvalue
*param_rval
= (ir_rvalue
*)iter
.get();
2072 ir_variable
*param
= (ir_variable
*)sig_iter
.get();
2074 if (param
->mode
== ir_var_out
||
2075 param
->mode
== ir_var_inout
) {
2076 variable_storage
*storage
= find_variable_storage(param
);
2080 r
.file
= storage
->file
;
2081 r
.index
= storage
->index
;
2083 r
.swizzle
= SWIZZLE_NOOP
;
2086 param_rval
->accept(this);
2087 dst_reg l
= dst_reg(this->result
);
2089 for (i
= 0; i
< type_size(param
->type
); i
++) {
2090 emit(ir
, OPCODE_MOV
, l
, r
);
2098 assert(!sig_iter
.has_next());
2100 /* Process return value. */
2101 this->result
= entry
->return_reg
;
2105 ir_to_mesa_visitor::visit(ir_texture
*ir
)
2107 src_reg result_src
, coord
, lod_info
, projector
, dx
, dy
;
2108 dst_reg result_dst
, coord_dst
;
2109 ir_to_mesa_instruction
*inst
= NULL
;
2110 prog_opcode opcode
= OPCODE_NOP
;
2112 if (ir
->op
== ir_txs
)
2113 this->result
= src_reg_for_float(0.0);
2115 ir
->coordinate
->accept(this);
2117 /* Put our coords in a temp. We'll need to modify them for shadow,
2118 * projection, or LOD, so the only case we'd use it as is is if
2119 * we're doing plain old texturing. Mesa IR optimization should
2120 * handle cleaning up our mess in that case.
2122 coord
= get_temp(glsl_type::vec4_type
);
2123 coord_dst
= dst_reg(coord
);
2124 emit(ir
, OPCODE_MOV
, coord_dst
, this->result
);
2126 if (ir
->projector
) {
2127 ir
->projector
->accept(this);
2128 projector
= this->result
;
2131 /* Storage for our result. Ideally for an assignment we'd be using
2132 * the actual storage for the result here, instead.
2134 result_src
= get_temp(glsl_type::vec4_type
);
2135 result_dst
= dst_reg(result_src
);
2140 opcode
= OPCODE_TEX
;
2143 opcode
= OPCODE_TXB
;
2144 ir
->lod_info
.bias
->accept(this);
2145 lod_info
= this->result
;
2148 /* Pretend to be TXL so the sampler, coordinate, lod are available */
2150 opcode
= OPCODE_TXL
;
2151 ir
->lod_info
.lod
->accept(this);
2152 lod_info
= this->result
;
2155 opcode
= OPCODE_TXD
;
2156 ir
->lod_info
.grad
.dPdx
->accept(this);
2158 ir
->lod_info
.grad
.dPdy
->accept(this);
2163 const glsl_type
*sampler_type
= ir
->sampler
->type
;
2165 if (ir
->projector
) {
2166 if (opcode
== OPCODE_TEX
) {
2167 /* Slot the projector in as the last component of the coord. */
2168 coord_dst
.writemask
= WRITEMASK_W
;
2169 emit(ir
, OPCODE_MOV
, coord_dst
, projector
);
2170 coord_dst
.writemask
= WRITEMASK_XYZW
;
2171 opcode
= OPCODE_TXP
;
2173 src_reg coord_w
= coord
;
2174 coord_w
.swizzle
= SWIZZLE_WWWW
;
2176 /* For the other TEX opcodes there's no projective version
2177 * since the last slot is taken up by lod info. Do the
2178 * projective divide now.
2180 coord_dst
.writemask
= WRITEMASK_W
;
2181 emit(ir
, OPCODE_RCP
, coord_dst
, projector
);
2183 /* In the case where we have to project the coordinates "by hand,"
2184 * the shadow comparitor value must also be projected.
2186 src_reg tmp_src
= coord
;
2187 if (ir
->shadow_comparitor
) {
2188 /* Slot the shadow value in as the second to last component of the
2191 ir
->shadow_comparitor
->accept(this);
2193 tmp_src
= get_temp(glsl_type::vec4_type
);
2194 dst_reg tmp_dst
= dst_reg(tmp_src
);
2196 /* Projective division not allowed for array samplers. */
2197 assert(!sampler_type
->sampler_array
);
2199 tmp_dst
.writemask
= WRITEMASK_Z
;
2200 emit(ir
, OPCODE_MOV
, tmp_dst
, this->result
);
2202 tmp_dst
.writemask
= WRITEMASK_XY
;
2203 emit(ir
, OPCODE_MOV
, tmp_dst
, coord
);
2206 coord_dst
.writemask
= WRITEMASK_XYZ
;
2207 emit(ir
, OPCODE_MUL
, coord_dst
, tmp_src
, coord_w
);
2209 coord_dst
.writemask
= WRITEMASK_XYZW
;
2210 coord
.swizzle
= SWIZZLE_XYZW
;
2214 /* If projection is done and the opcode is not OPCODE_TXP, then the shadow
2215 * comparitor was put in the correct place (and projected) by the code,
2216 * above, that handles by-hand projection.
2218 if (ir
->shadow_comparitor
&& (!ir
->projector
|| opcode
== OPCODE_TXP
)) {
2219 /* Slot the shadow value in as the second to last component of the
2222 ir
->shadow_comparitor
->accept(this);
2224 /* XXX This will need to be updated for cubemap array samplers. */
2225 if (sampler_type
->sampler_dimensionality
== GLSL_SAMPLER_DIM_2D
&&
2226 sampler_type
->sampler_array
) {
2227 coord_dst
.writemask
= WRITEMASK_W
;
2229 coord_dst
.writemask
= WRITEMASK_Z
;
2232 emit(ir
, OPCODE_MOV
, coord_dst
, this->result
);
2233 coord_dst
.writemask
= WRITEMASK_XYZW
;
2236 if (opcode
== OPCODE_TXL
|| opcode
== OPCODE_TXB
) {
2237 /* Mesa IR stores lod or lod bias in the last channel of the coords. */
2238 coord_dst
.writemask
= WRITEMASK_W
;
2239 emit(ir
, OPCODE_MOV
, coord_dst
, lod_info
);
2240 coord_dst
.writemask
= WRITEMASK_XYZW
;
2243 if (opcode
== OPCODE_TXD
)
2244 inst
= emit(ir
, opcode
, result_dst
, coord
, dx
, dy
);
2246 inst
= emit(ir
, opcode
, result_dst
, coord
);
2248 if (ir
->shadow_comparitor
)
2249 inst
->tex_shadow
= GL_TRUE
;
2251 inst
->sampler
= _mesa_get_sampler_uniform_value(ir
->sampler
,
2252 this->shader_program
,
2255 switch (sampler_type
->sampler_dimensionality
) {
2256 case GLSL_SAMPLER_DIM_1D
:
2257 inst
->tex_target
= (sampler_type
->sampler_array
)
2258 ? TEXTURE_1D_ARRAY_INDEX
: TEXTURE_1D_INDEX
;
2260 case GLSL_SAMPLER_DIM_2D
:
2261 inst
->tex_target
= (sampler_type
->sampler_array
)
2262 ? TEXTURE_2D_ARRAY_INDEX
: TEXTURE_2D_INDEX
;
2264 case GLSL_SAMPLER_DIM_3D
:
2265 inst
->tex_target
= TEXTURE_3D_INDEX
;
2267 case GLSL_SAMPLER_DIM_CUBE
:
2268 inst
->tex_target
= TEXTURE_CUBE_INDEX
;
2270 case GLSL_SAMPLER_DIM_RECT
:
2271 inst
->tex_target
= TEXTURE_RECT_INDEX
;
2273 case GLSL_SAMPLER_DIM_BUF
:
2274 assert(!"FINISHME: Implement ARB_texture_buffer_object");
2276 case GLSL_SAMPLER_DIM_EXTERNAL
:
2277 inst
->tex_target
= TEXTURE_EXTERNAL_INDEX
;
2280 assert(!"Should not get here.");
2283 this->result
= result_src
;
2287 ir_to_mesa_visitor::visit(ir_return
*ir
)
2289 if (ir
->get_value()) {
2293 assert(current_function
);
2295 ir
->get_value()->accept(this);
2296 src_reg r
= this->result
;
2298 l
= dst_reg(current_function
->return_reg
);
2300 for (i
= 0; i
< type_size(current_function
->sig
->return_type
); i
++) {
2301 emit(ir
, OPCODE_MOV
, l
, r
);
2307 emit(ir
, OPCODE_RET
);
2311 ir_to_mesa_visitor::visit(ir_discard
*ir
)
2313 struct gl_fragment_program
*fp
= (struct gl_fragment_program
*)this->prog
;
2315 if (ir
->condition
) {
2316 ir
->condition
->accept(this);
2317 this->result
.negate
= ~this->result
.negate
;
2318 emit(ir
, OPCODE_KIL
, undef_dst
, this->result
);
2320 emit(ir
, OPCODE_KIL_NV
);
2323 fp
->UsesKill
= GL_TRUE
;
2327 ir_to_mesa_visitor::visit(ir_if
*ir
)
2329 ir_to_mesa_instruction
*cond_inst
, *if_inst
;
2330 ir_to_mesa_instruction
*prev_inst
;
2332 prev_inst
= (ir_to_mesa_instruction
*)this->instructions
.get_tail();
2334 ir
->condition
->accept(this);
2335 assert(this->result
.file
!= PROGRAM_UNDEFINED
);
2337 if (this->options
->EmitCondCodes
) {
2338 cond_inst
= (ir_to_mesa_instruction
*)this->instructions
.get_tail();
2340 /* See if we actually generated any instruction for generating
2341 * the condition. If not, then cook up a move to a temp so we
2342 * have something to set cond_update on.
2344 if (cond_inst
== prev_inst
) {
2345 src_reg temp
= get_temp(glsl_type::bool_type
);
2346 cond_inst
= emit(ir
->condition
, OPCODE_MOV
, dst_reg(temp
), result
);
2348 cond_inst
->cond_update
= GL_TRUE
;
2350 if_inst
= emit(ir
->condition
, OPCODE_IF
);
2351 if_inst
->dst
.cond_mask
= COND_NE
;
2353 if_inst
= emit(ir
->condition
, OPCODE_IF
, undef_dst
, this->result
);
2356 this->instructions
.push_tail(if_inst
);
2358 visit_exec_list(&ir
->then_instructions
, this);
2360 if (!ir
->else_instructions
.is_empty()) {
2361 emit(ir
->condition
, OPCODE_ELSE
);
2362 visit_exec_list(&ir
->else_instructions
, this);
2365 if_inst
= emit(ir
->condition
, OPCODE_ENDIF
);
2368 ir_to_mesa_visitor::ir_to_mesa_visitor()
2370 result
.file
= PROGRAM_UNDEFINED
;
2372 next_signature_id
= 1;
2373 current_function
= NULL
;
2374 mem_ctx
= ralloc_context(NULL
);
2377 ir_to_mesa_visitor::~ir_to_mesa_visitor()
2379 ralloc_free(mem_ctx
);
2382 static struct prog_src_register
2383 mesa_src_reg_from_ir_src_reg(src_reg reg
)
2385 struct prog_src_register mesa_reg
;
2387 mesa_reg
.File
= reg
.file
;
2388 assert(reg
.index
< (1 << INST_INDEX_BITS
));
2389 mesa_reg
.Index
= reg
.index
;
2390 mesa_reg
.Swizzle
= reg
.swizzle
;
2391 mesa_reg
.RelAddr
= reg
.reladdr
!= NULL
;
2392 mesa_reg
.Negate
= reg
.negate
;
2394 mesa_reg
.HasIndex2
= GL_FALSE
;
2395 mesa_reg
.RelAddr2
= 0;
2396 mesa_reg
.Index2
= 0;
2402 set_branchtargets(ir_to_mesa_visitor
*v
,
2403 struct prog_instruction
*mesa_instructions
,
2404 int num_instructions
)
2406 int if_count
= 0, loop_count
= 0;
2407 int *if_stack
, *loop_stack
;
2408 int if_stack_pos
= 0, loop_stack_pos
= 0;
2411 for (i
= 0; i
< num_instructions
; i
++) {
2412 switch (mesa_instructions
[i
].Opcode
) {
2416 case OPCODE_BGNLOOP
:
2421 mesa_instructions
[i
].BranchTarget
= -1;
2428 if_stack
= rzalloc_array(v
->mem_ctx
, int, if_count
);
2429 loop_stack
= rzalloc_array(v
->mem_ctx
, int, loop_count
);
2431 for (i
= 0; i
< num_instructions
; i
++) {
2432 switch (mesa_instructions
[i
].Opcode
) {
2434 if_stack
[if_stack_pos
] = i
;
2438 mesa_instructions
[if_stack
[if_stack_pos
- 1]].BranchTarget
= i
;
2439 if_stack
[if_stack_pos
- 1] = i
;
2442 mesa_instructions
[if_stack
[if_stack_pos
- 1]].BranchTarget
= i
;
2445 case OPCODE_BGNLOOP
:
2446 loop_stack
[loop_stack_pos
] = i
;
2449 case OPCODE_ENDLOOP
:
2451 /* Rewrite any breaks/conts at this nesting level (haven't
2452 * already had a BranchTarget assigned) to point to the end
2455 for (j
= loop_stack
[loop_stack_pos
]; j
< i
; j
++) {
2456 if (mesa_instructions
[j
].Opcode
== OPCODE_BRK
||
2457 mesa_instructions
[j
].Opcode
== OPCODE_CONT
) {
2458 if (mesa_instructions
[j
].BranchTarget
== -1) {
2459 mesa_instructions
[j
].BranchTarget
= i
;
2463 /* The loop ends point at each other. */
2464 mesa_instructions
[i
].BranchTarget
= loop_stack
[loop_stack_pos
];
2465 mesa_instructions
[loop_stack
[loop_stack_pos
]].BranchTarget
= i
;
2468 foreach_iter(exec_list_iterator
, iter
, v
->function_signatures
) {
2469 function_entry
*entry
= (function_entry
*)iter
.get();
2471 if (entry
->sig_id
== mesa_instructions
[i
].BranchTarget
) {
2472 mesa_instructions
[i
].BranchTarget
= entry
->inst
;
2484 print_program(struct prog_instruction
*mesa_instructions
,
2485 ir_instruction
**mesa_instruction_annotation
,
2486 int num_instructions
)
2488 ir_instruction
*last_ir
= NULL
;
2492 for (i
= 0; i
< num_instructions
; i
++) {
2493 struct prog_instruction
*mesa_inst
= mesa_instructions
+ i
;
2494 ir_instruction
*ir
= mesa_instruction_annotation
[i
];
2496 fprintf(stdout
, "%3d: ", i
);
2498 if (last_ir
!= ir
&& ir
) {
2501 for (j
= 0; j
< indent
; j
++) {
2502 fprintf(stdout
, " ");
2508 fprintf(stdout
, " "); /* line number spacing. */
2511 indent
= _mesa_fprint_instruction_opt(stdout
, mesa_inst
, indent
,
2512 PROG_PRINT_DEBUG
, NULL
);
2518 * Count resources used by the given gpu program (number of texture
2522 count_resources(struct gl_program
*prog
)
2526 prog
->SamplersUsed
= 0;
2528 for (i
= 0; i
< prog
->NumInstructions
; i
++) {
2529 struct prog_instruction
*inst
= &prog
->Instructions
[i
];
2531 if (_mesa_is_tex_instruction(inst
->Opcode
)) {
2532 prog
->SamplerTargets
[inst
->TexSrcUnit
] =
2533 (gl_texture_index
)inst
->TexSrcTarget
;
2534 prog
->SamplersUsed
|= 1 << inst
->TexSrcUnit
;
2535 if (inst
->TexShadow
) {
2536 prog
->ShadowSamplers
|= 1 << inst
->TexSrcUnit
;
2541 _mesa_update_shader_textures_used(prog
);
2546 * Check if the given vertex/fragment/shader program is within the
2547 * resource limits of the context (number of texture units, etc).
2548 * If any of those checks fail, record a linker error.
2550 * XXX more checks are needed...
2553 check_resources(const struct gl_context
*ctx
,
2554 struct gl_shader_program
*shader_program
,
2555 struct gl_program
*prog
)
2557 switch (prog
->Target
) {
2558 case GL_VERTEX_PROGRAM_ARB
:
2559 if (_mesa_bitcount(prog
->SamplersUsed
) >
2560 ctx
->Const
.MaxVertexTextureImageUnits
) {
2561 linker_error(shader_program
,
2562 "Too many vertex shader texture samplers");
2564 if (prog
->Parameters
->NumParameters
> MAX_UNIFORMS
) {
2565 linker_error(shader_program
, "Too many vertex shader constants");
2568 case MESA_GEOMETRY_PROGRAM
:
2569 if (_mesa_bitcount(prog
->SamplersUsed
) >
2570 ctx
->Const
.MaxGeometryTextureImageUnits
) {
2571 linker_error(shader_program
,
2572 "Too many geometry shader texture samplers");
2574 if (prog
->Parameters
->NumParameters
>
2575 MAX_GEOMETRY_UNIFORM_COMPONENTS
/ 4) {
2576 linker_error(shader_program
, "Too many geometry shader constants");
2579 case GL_FRAGMENT_PROGRAM_ARB
:
2580 if (_mesa_bitcount(prog
->SamplersUsed
) >
2581 ctx
->Const
.MaxTextureImageUnits
) {
2582 linker_error(shader_program
,
2583 "Too many fragment shader texture samplers");
2585 if (prog
->Parameters
->NumParameters
> MAX_UNIFORMS
) {
2586 linker_error(shader_program
, "Too many fragment shader constants");
2590 _mesa_problem(ctx
, "unexpected program type in check_resources()");
2593 return shader_program
->LinkStatus
;
2596 class add_uniform_to_shader
: public uniform_field_visitor
{
2598 add_uniform_to_shader(struct gl_shader_program
*shader_program
,
2599 struct gl_program_parameter_list
*params
)
2600 : shader_program(shader_program
), params(params
), next_sampler(0)
2605 int process(ir_variable
*var
)
2608 this->uniform_field_visitor::process(var
);
2614 virtual void visit_field(const glsl_type
*type
, const char *name
);
2616 struct gl_shader_program
*shader_program
;
2617 struct gl_program_parameter_list
*params
;
2623 add_uniform_to_shader::visit_field(const glsl_type
*type
, const char *name
)
2627 if (type
->is_vector() || type
->is_scalar()) {
2628 size
= type
->vector_elements
;
2630 size
= type_size(type
) * 4;
2633 gl_register_file file
;
2634 if (type
->is_sampler() ||
2635 (type
->is_array() && type
->fields
.array
->is_sampler())) {
2636 file
= PROGRAM_SAMPLER
;
2638 file
= PROGRAM_UNIFORM
;
2641 int index
= _mesa_lookup_parameter_index(params
, -1, name
);
2643 index
= _mesa_add_parameter(params
, file
, name
, size
, type
->gl_type
,
2646 /* Sampler uniform values are stored in prog->SamplerUnits,
2647 * and the entry in that array is selected by this index we
2648 * store in ParameterValues[].
2650 if (file
== PROGRAM_SAMPLER
) {
2651 for (unsigned int j
= 0; j
< size
/ 4; j
++)
2652 params
->ParameterValues
[index
+ j
][0].f
= this->next_sampler
++;
2656 /* The first part of the uniform that's processed determines the base
2657 * location of the whole uniform (for structures).
2664 * Generate the program parameters list for the user uniforms in a shader
2666 * \param shader_program Linked shader program. This is only used to
2667 * emit possible link errors to the info log.
2668 * \param sh Shader whose uniforms are to be processed.
2669 * \param params Parameter list to be filled in.
2672 _mesa_generate_parameters_list_for_uniforms(struct gl_shader_program
2674 struct gl_shader
*sh
,
2675 struct gl_program_parameter_list
2678 add_uniform_to_shader
add(shader_program
, params
);
2680 foreach_list(node
, sh
->ir
) {
2681 ir_variable
*var
= ((ir_instruction
*) node
)->as_variable();
2683 if ((var
== NULL
) || (var
->mode
!= ir_var_uniform
)
2684 || (strncmp(var
->name
, "gl_", 3) == 0))
2687 int loc
= add
.process(var
);
2689 /* The location chosen in the Parameters list here (returned from
2690 * _mesa_add_parameter) has to match what the linker chose.
2692 if (var
->location
!= loc
) {
2693 linker_error(shader_program
,
2694 "Allocation of uniform `%s' to target failed "
2696 var
->name
, loc
, var
->location
);
2702 set_uniform_initializer(struct gl_context
*ctx
, void *mem_ctx
,
2703 struct gl_shader_program
*shader_program
,
2704 const char *name
, const glsl_type
*type
,
2707 if (type
->is_record()) {
2708 ir_constant
*field_constant
;
2710 field_constant
= (ir_constant
*)val
->components
.get_head();
2712 for (unsigned int i
= 0; i
< type
->length
; i
++) {
2713 const glsl_type
*field_type
= type
->fields
.structure
[i
].type
;
2714 const char *field_name
= ralloc_asprintf(mem_ctx
, "%s.%s", name
,
2715 type
->fields
.structure
[i
].name
);
2716 set_uniform_initializer(ctx
, mem_ctx
, shader_program
, field_name
,
2717 field_type
, field_constant
);
2718 field_constant
= (ir_constant
*)field_constant
->next
;
2723 int loc
= _mesa_get_uniform_location(ctx
, shader_program
, name
);
2726 linker_error(shader_program
,
2727 "Couldn't find uniform for initializer %s\n", name
);
2731 for (unsigned int i
= 0; i
< (type
->is_array() ? type
->length
: 1); i
++) {
2732 ir_constant
*element
;
2733 const glsl_type
*element_type
;
2734 if (type
->is_array()) {
2735 element
= val
->array_elements
[i
];
2736 element_type
= type
->fields
.array
;
2739 element_type
= type
;
2744 if (element_type
->base_type
== GLSL_TYPE_BOOL
) {
2745 int *conv
= ralloc_array(mem_ctx
, int, element_type
->components());
2746 for (unsigned int j
= 0; j
< element_type
->components(); j
++) {
2747 conv
[j
] = element
->value
.b
[j
];
2749 values
= (void *)conv
;
2750 element_type
= glsl_type::get_instance(GLSL_TYPE_INT
,
2751 element_type
->vector_elements
,
2754 values
= &element
->value
;
2757 if (element_type
->is_matrix()) {
2758 _mesa_uniform_matrix(ctx
, shader_program
,
2759 element_type
->matrix_columns
,
2760 element_type
->vector_elements
,
2761 loc
, 1, GL_FALSE
, (GLfloat
*)values
);
2762 loc
+= element_type
->matrix_columns
;
2764 _mesa_uniform(ctx
, shader_program
, loc
, element_type
->matrix_columns
,
2765 values
, element_type
->gl_type
);
2766 loc
+= type_size(element_type
);
2772 set_uniform_initializers(struct gl_context
*ctx
,
2773 struct gl_shader_program
*shader_program
)
2775 void *mem_ctx
= NULL
;
2777 for (unsigned int i
= 0; i
< MESA_SHADER_TYPES
; i
++) {
2778 struct gl_shader
*shader
= shader_program
->_LinkedShaders
[i
];
2783 foreach_iter(exec_list_iterator
, iter
, *shader
->ir
) {
2784 ir_instruction
*ir
= (ir_instruction
*)iter
.get();
2785 ir_variable
*var
= ir
->as_variable();
2787 if (!var
|| var
->mode
!= ir_var_uniform
|| !var
->constant_value
)
2791 mem_ctx
= ralloc_context(NULL
);
2793 set_uniform_initializer(ctx
, mem_ctx
, shader_program
, var
->name
,
2794 var
->type
, var
->constant_value
);
2798 ralloc_free(mem_ctx
);
2802 * On a basic block basis, tracks available PROGRAM_TEMPORARY register
2803 * channels for copy propagation and updates following instructions to
2804 * use the original versions.
2806 * The ir_to_mesa_visitor lazily produces code assuming that this pass
2807 * will occur. As an example, a TXP production before this pass:
2809 * 0: MOV TEMP[1], INPUT[4].xyyy;
2810 * 1: MOV TEMP[1].w, INPUT[4].wwww;
2811 * 2: TXP TEMP[2], TEMP[1], texture[0], 2D;
2815 * 0: MOV TEMP[1], INPUT[4].xyyy;
2816 * 1: MOV TEMP[1].w, INPUT[4].wwww;
2817 * 2: TXP TEMP[2], INPUT[4].xyyw, texture[0], 2D;
2819 * which allows for dead code elimination on TEMP[1]'s writes.
2822 ir_to_mesa_visitor::copy_propagate(void)
2824 ir_to_mesa_instruction
**acp
= rzalloc_array(mem_ctx
,
2825 ir_to_mesa_instruction
*,
2826 this->next_temp
* 4);
2827 int *acp_level
= rzalloc_array(mem_ctx
, int, this->next_temp
* 4);
2830 foreach_iter(exec_list_iterator
, iter
, this->instructions
) {
2831 ir_to_mesa_instruction
*inst
= (ir_to_mesa_instruction
*)iter
.get();
2833 assert(inst
->dst
.file
!= PROGRAM_TEMPORARY
2834 || inst
->dst
.index
< this->next_temp
);
2836 /* First, do any copy propagation possible into the src regs. */
2837 for (int r
= 0; r
< 3; r
++) {
2838 ir_to_mesa_instruction
*first
= NULL
;
2840 int acp_base
= inst
->src
[r
].index
* 4;
2842 if (inst
->src
[r
].file
!= PROGRAM_TEMPORARY
||
2843 inst
->src
[r
].reladdr
)
2846 /* See if we can find entries in the ACP consisting of MOVs
2847 * from the same src register for all the swizzled channels
2848 * of this src register reference.
2850 for (int i
= 0; i
< 4; i
++) {
2851 int src_chan
= GET_SWZ(inst
->src
[r
].swizzle
, i
);
2852 ir_to_mesa_instruction
*copy_chan
= acp
[acp_base
+ src_chan
];
2859 assert(acp_level
[acp_base
+ src_chan
] <= level
);
2864 if (first
->src
[0].file
!= copy_chan
->src
[0].file
||
2865 first
->src
[0].index
!= copy_chan
->src
[0].index
) {
2873 /* We've now validated that we can copy-propagate to
2874 * replace this src register reference. Do it.
2876 inst
->src
[r
].file
= first
->src
[0].file
;
2877 inst
->src
[r
].index
= first
->src
[0].index
;
2880 for (int i
= 0; i
< 4; i
++) {
2881 int src_chan
= GET_SWZ(inst
->src
[r
].swizzle
, i
);
2882 ir_to_mesa_instruction
*copy_inst
= acp
[acp_base
+ src_chan
];
2883 swizzle
|= (GET_SWZ(copy_inst
->src
[0].swizzle
, src_chan
) <<
2886 inst
->src
[r
].swizzle
= swizzle
;
2891 case OPCODE_BGNLOOP
:
2892 case OPCODE_ENDLOOP
:
2893 /* End of a basic block, clear the ACP entirely. */
2894 memset(acp
, 0, sizeof(*acp
) * this->next_temp
* 4);
2903 /* Clear all channels written inside the block from the ACP, but
2904 * leaving those that were not touched.
2906 for (int r
= 0; r
< this->next_temp
; r
++) {
2907 for (int c
= 0; c
< 4; c
++) {
2908 if (!acp
[4 * r
+ c
])
2911 if (acp_level
[4 * r
+ c
] >= level
)
2912 acp
[4 * r
+ c
] = NULL
;
2915 if (inst
->op
== OPCODE_ENDIF
)
2920 /* Continuing the block, clear any written channels from
2923 if (inst
->dst
.file
== PROGRAM_TEMPORARY
&& inst
->dst
.reladdr
) {
2924 /* Any temporary might be written, so no copy propagation
2925 * across this instruction.
2927 memset(acp
, 0, sizeof(*acp
) * this->next_temp
* 4);
2928 } else if (inst
->dst
.file
== PROGRAM_OUTPUT
&&
2929 inst
->dst
.reladdr
) {
2930 /* Any output might be written, so no copy propagation
2931 * from outputs across this instruction.
2933 for (int r
= 0; r
< this->next_temp
; r
++) {
2934 for (int c
= 0; c
< 4; c
++) {
2935 if (!acp
[4 * r
+ c
])
2938 if (acp
[4 * r
+ c
]->src
[0].file
== PROGRAM_OUTPUT
)
2939 acp
[4 * r
+ c
] = NULL
;
2942 } else if (inst
->dst
.file
== PROGRAM_TEMPORARY
||
2943 inst
->dst
.file
== PROGRAM_OUTPUT
) {
2944 /* Clear where it's used as dst. */
2945 if (inst
->dst
.file
== PROGRAM_TEMPORARY
) {
2946 for (int c
= 0; c
< 4; c
++) {
2947 if (inst
->dst
.writemask
& (1 << c
)) {
2948 acp
[4 * inst
->dst
.index
+ c
] = NULL
;
2953 /* Clear where it's used as src. */
2954 for (int r
= 0; r
< this->next_temp
; r
++) {
2955 for (int c
= 0; c
< 4; c
++) {
2956 if (!acp
[4 * r
+ c
])
2959 int src_chan
= GET_SWZ(acp
[4 * r
+ c
]->src
[0].swizzle
, c
);
2961 if (acp
[4 * r
+ c
]->src
[0].file
== inst
->dst
.file
&&
2962 acp
[4 * r
+ c
]->src
[0].index
== inst
->dst
.index
&&
2963 inst
->dst
.writemask
& (1 << src_chan
))
2965 acp
[4 * r
+ c
] = NULL
;
2973 /* If this is a copy, add it to the ACP. */
2974 if (inst
->op
== OPCODE_MOV
&&
2975 inst
->dst
.file
== PROGRAM_TEMPORARY
&&
2976 !inst
->dst
.reladdr
&&
2978 !inst
->src
[0].reladdr
&&
2979 !inst
->src
[0].negate
) {
2980 for (int i
= 0; i
< 4; i
++) {
2981 if (inst
->dst
.writemask
& (1 << i
)) {
2982 acp
[4 * inst
->dst
.index
+ i
] = inst
;
2983 acp_level
[4 * inst
->dst
.index
+ i
] = level
;
2989 ralloc_free(acp_level
);
2995 * Convert a shader's GLSL IR into a Mesa gl_program.
2997 static struct gl_program
*
2998 get_mesa_program(struct gl_context
*ctx
,
2999 struct gl_shader_program
*shader_program
,
3000 struct gl_shader
*shader
)
3002 ir_to_mesa_visitor v
;
3003 struct prog_instruction
*mesa_instructions
, *mesa_inst
;
3004 ir_instruction
**mesa_instruction_annotation
;
3006 struct gl_program
*prog
;
3008 const char *target_string
;
3010 struct gl_shader_compiler_options
*options
=
3011 &ctx
->ShaderCompilerOptions
[_mesa_shader_type_to_index(shader
->Type
)];
3013 switch (shader
->Type
) {
3014 case GL_VERTEX_SHADER
:
3015 target
= GL_VERTEX_PROGRAM_ARB
;
3016 target_string
= "vertex";
3018 case GL_FRAGMENT_SHADER
:
3019 target
= GL_FRAGMENT_PROGRAM_ARB
;
3020 target_string
= "fragment";
3022 case GL_GEOMETRY_SHADER
:
3023 target
= GL_GEOMETRY_PROGRAM_NV
;
3024 target_string
= "geometry";
3027 assert(!"should not be reached");
3031 validate_ir_tree(shader
->ir
);
3033 prog
= ctx
->Driver
.NewProgram(ctx
, target
, shader_program
->Name
);
3036 prog
->Parameters
= _mesa_new_parameter_list();
3039 v
.shader_program
= shader_program
;
3040 v
.options
= options
;
3042 _mesa_generate_parameters_list_for_uniforms(shader_program
, shader
,
3045 /* Emit Mesa IR for main(). */
3046 visit_exec_list(shader
->ir
, &v
);
3047 v
.emit(NULL
, OPCODE_END
);
3049 /* Now emit bodies for any functions that were used. */
3051 progress
= GL_FALSE
;
3053 foreach_iter(exec_list_iterator
, iter
, v
.function_signatures
) {
3054 function_entry
*entry
= (function_entry
*)iter
.get();
3056 if (!entry
->bgn_inst
) {
3057 v
.current_function
= entry
;
3059 entry
->bgn_inst
= v
.emit(NULL
, OPCODE_BGNSUB
);
3060 entry
->bgn_inst
->function
= entry
;
3062 visit_exec_list(&entry
->sig
->body
, &v
);
3064 ir_to_mesa_instruction
*last
;
3065 last
= (ir_to_mesa_instruction
*)v
.instructions
.get_tail();
3066 if (last
->op
!= OPCODE_RET
)
3067 v
.emit(NULL
, OPCODE_RET
);
3069 ir_to_mesa_instruction
*end
;
3070 end
= v
.emit(NULL
, OPCODE_ENDSUB
);
3071 end
->function
= entry
;
3078 prog
->NumTemporaries
= v
.next_temp
;
3080 int num_instructions
= 0;
3081 foreach_iter(exec_list_iterator
, iter
, v
.instructions
) {
3086 (struct prog_instruction
*)calloc(num_instructions
,
3087 sizeof(*mesa_instructions
));
3088 mesa_instruction_annotation
= ralloc_array(v
.mem_ctx
, ir_instruction
*,
3093 /* Convert ir_mesa_instructions into prog_instructions.
3095 mesa_inst
= mesa_instructions
;
3097 foreach_iter(exec_list_iterator
, iter
, v
.instructions
) {
3098 const ir_to_mesa_instruction
*inst
= (ir_to_mesa_instruction
*)iter
.get();
3100 mesa_inst
->Opcode
= inst
->op
;
3101 mesa_inst
->CondUpdate
= inst
->cond_update
;
3103 mesa_inst
->SaturateMode
= SATURATE_ZERO_ONE
;
3104 mesa_inst
->DstReg
.File
= inst
->dst
.file
;
3105 mesa_inst
->DstReg
.Index
= inst
->dst
.index
;
3106 mesa_inst
->DstReg
.CondMask
= inst
->dst
.cond_mask
;
3107 mesa_inst
->DstReg
.WriteMask
= inst
->dst
.writemask
;
3108 mesa_inst
->DstReg
.RelAddr
= inst
->dst
.reladdr
!= NULL
;
3109 mesa_inst
->SrcReg
[0] = mesa_src_reg_from_ir_src_reg(inst
->src
[0]);
3110 mesa_inst
->SrcReg
[1] = mesa_src_reg_from_ir_src_reg(inst
->src
[1]);
3111 mesa_inst
->SrcReg
[2] = mesa_src_reg_from_ir_src_reg(inst
->src
[2]);
3112 mesa_inst
->TexSrcUnit
= inst
->sampler
;
3113 mesa_inst
->TexSrcTarget
= inst
->tex_target
;
3114 mesa_inst
->TexShadow
= inst
->tex_shadow
;
3115 mesa_instruction_annotation
[i
] = inst
->ir
;
3117 /* Set IndirectRegisterFiles. */
3118 if (mesa_inst
->DstReg
.RelAddr
)
3119 prog
->IndirectRegisterFiles
|= 1 << mesa_inst
->DstReg
.File
;
3121 /* Update program's bitmask of indirectly accessed register files */
3122 for (unsigned src
= 0; src
< 3; src
++)
3123 if (mesa_inst
->SrcReg
[src
].RelAddr
)
3124 prog
->IndirectRegisterFiles
|= 1 << mesa_inst
->SrcReg
[src
].File
;
3126 switch (mesa_inst
->Opcode
) {
3128 if (options
->MaxIfDepth
== 0) {
3129 linker_warning(shader_program
,
3130 "Couldn't flatten if-statement. "
3131 "This will likely result in software "
3132 "rasterization.\n");
3135 case OPCODE_BGNLOOP
:
3136 if (options
->EmitNoLoops
) {
3137 linker_warning(shader_program
,
3138 "Couldn't unroll loop. "
3139 "This will likely result in software "
3140 "rasterization.\n");
3144 if (options
->EmitNoCont
) {
3145 linker_warning(shader_program
,
3146 "Couldn't lower continue-statement. "
3147 "This will likely result in software "
3148 "rasterization.\n");
3152 inst
->function
->inst
= i
;
3153 mesa_inst
->Comment
= strdup(inst
->function
->sig
->function_name());
3156 mesa_inst
->Comment
= strdup(inst
->function
->sig
->function_name());
3159 mesa_inst
->BranchTarget
= inst
->function
->sig_id
; /* rewritten later */
3162 prog
->NumAddressRegs
= 1;
3171 if (!shader_program
->LinkStatus
)
3175 if (!shader_program
->LinkStatus
) {
3179 set_branchtargets(&v
, mesa_instructions
, num_instructions
);
3181 if (ctx
->Shader
.Flags
& GLSL_DUMP
) {
3183 printf("GLSL IR for linked %s program %d:\n", target_string
,
3184 shader_program
->Name
);
3185 _mesa_print_ir(shader
->ir
, NULL
);
3188 printf("Mesa IR for linked %s program %d:\n", target_string
,
3189 shader_program
->Name
);
3190 print_program(mesa_instructions
, mesa_instruction_annotation
,
3194 prog
->Instructions
= mesa_instructions
;
3195 prog
->NumInstructions
= num_instructions
;
3197 /* Setting this to NULL prevents a possible double free in the fail_exit
3200 mesa_instructions
= NULL
;
3202 do_set_program_inouts(shader
->ir
, prog
, shader
->Type
== GL_FRAGMENT_SHADER
);
3203 count_resources(prog
);
3205 if (!check_resources(ctx
, shader_program
, prog
))
3208 _mesa_reference_program(ctx
, &shader
->Program
, prog
);
3210 if ((ctx
->Shader
.Flags
& GLSL_NO_OPT
) == 0) {
3211 _mesa_optimize_program(ctx
, prog
);
3217 free(mesa_instructions
);
3218 _mesa_reference_program(ctx
, &shader
->Program
, NULL
);
3226 * Called via ctx->Driver.LinkShader()
3227 * This actually involves converting GLSL IR into Mesa gl_programs with
3228 * code lowering and other optimizations.
3231 _mesa_ir_link_shader(struct gl_context
*ctx
, struct gl_shader_program
*prog
)
3233 assert(prog
->LinkStatus
);
3235 for (unsigned i
= 0; i
< MESA_SHADER_TYPES
; i
++) {
3236 if (prog
->_LinkedShaders
[i
] == NULL
)
3240 exec_list
*ir
= prog
->_LinkedShaders
[i
]->ir
;
3241 const struct gl_shader_compiler_options
*options
=
3242 &ctx
->ShaderCompilerOptions
[_mesa_shader_type_to_index(prog
->_LinkedShaders
[i
]->Type
)];
3248 do_mat_op_to_vec(ir
);
3249 lower_instructions(ir
, (MOD_TO_FRACT
| DIV_TO_MUL_RCP
| EXP_TO_EXP2
3250 | LOG_TO_LOG2
| INT_DIV_TO_MUL_RCP
3251 | ((options
->EmitNoPow
) ? POW_TO_EXP2
: 0)));
3253 progress
= do_lower_jumps(ir
, true, true, options
->EmitNoMainReturn
, options
->EmitNoCont
, options
->EmitNoLoops
) || progress
;
3255 progress
= do_common_optimization(ir
, true, true,
3256 options
->MaxUnrollIterations
)
3259 progress
= lower_quadop_vector(ir
, true) || progress
;
3261 if (options
->MaxIfDepth
== 0)
3262 progress
= lower_discard(ir
) || progress
;
3264 progress
= lower_if_to_cond_assign(ir
, options
->MaxIfDepth
) || progress
;
3266 if (options
->EmitNoNoise
)
3267 progress
= lower_noise(ir
) || progress
;
3269 /* If there are forms of indirect addressing that the driver
3270 * cannot handle, perform the lowering pass.
3272 if (options
->EmitNoIndirectInput
|| options
->EmitNoIndirectOutput
3273 || options
->EmitNoIndirectTemp
|| options
->EmitNoIndirectUniform
)
3275 lower_variable_index_to_cond_assign(ir
,
3276 options
->EmitNoIndirectInput
,
3277 options
->EmitNoIndirectOutput
,
3278 options
->EmitNoIndirectTemp
,
3279 options
->EmitNoIndirectUniform
)
3282 progress
= do_vec_index_to_cond_assign(ir
) || progress
;
3285 validate_ir_tree(ir
);
3288 for (unsigned i
= 0; i
< MESA_SHADER_TYPES
; i
++) {
3289 struct gl_program
*linked_prog
;
3291 if (prog
->_LinkedShaders
[i
] == NULL
)
3294 linked_prog
= get_mesa_program(ctx
, prog
, prog
->_LinkedShaders
[i
]);
3297 static const GLenum targets
[] = {
3298 GL_VERTEX_PROGRAM_ARB
,
3299 GL_FRAGMENT_PROGRAM_ARB
,
3300 GL_GEOMETRY_PROGRAM_NV
3303 if (i
== MESA_SHADER_VERTEX
) {
3304 ((struct gl_vertex_program
*)linked_prog
)->UsesClipDistance
3305 = prog
->Vert
.UsesClipDistance
;
3308 _mesa_reference_program(ctx
, &prog
->_LinkedShaders
[i
]->Program
,
3310 if (!ctx
->Driver
.ProgramStringNotify(ctx
, targets
[i
], linked_prog
)) {
3315 _mesa_reference_program(ctx
, &linked_prog
, NULL
);
3318 return prog
->LinkStatus
;
3323 * Compile a GLSL shader. Called via glCompileShader().
3326 _mesa_glsl_compile_shader(struct gl_context
*ctx
, struct gl_shader
*shader
)
3328 struct _mesa_glsl_parse_state
*state
=
3329 new(shader
) _mesa_glsl_parse_state(ctx
, shader
->Type
, shader
);
3331 const char *source
= shader
->Source
;
3332 /* Check if the user called glCompileShader without first calling
3333 * glShaderSource. This should fail to compile, but not raise a GL_ERROR.
3335 if (source
== NULL
) {
3336 shader
->CompileStatus
= GL_FALSE
;
3340 state
->error
= preprocess(state
, &source
, &state
->info_log
,
3341 &ctx
->Extensions
, ctx
->API
);
3343 if (ctx
->Shader
.Flags
& GLSL_DUMP
) {
3344 printf("GLSL source for %s shader %d:\n",
3345 _mesa_glsl_shader_target_name(state
->target
), shader
->Name
);
3346 printf("%s\n", shader
->Source
);
3349 if (!state
->error
) {
3350 _mesa_glsl_lexer_ctor(state
, source
);
3351 _mesa_glsl_parse(state
);
3352 _mesa_glsl_lexer_dtor(state
);
3355 ralloc_free(shader
->ir
);
3356 shader
->ir
= new(shader
) exec_list
;
3357 if (!state
->error
&& !state
->translation_unit
.is_empty())
3358 _mesa_ast_to_hir(shader
->ir
, state
);
3360 if (!state
->error
&& !shader
->ir
->is_empty()) {
3361 validate_ir_tree(shader
->ir
);
3363 /* Do some optimization at compile time to reduce shader IR size
3364 * and reduce later work if the same shader is linked multiple times
3366 while (do_common_optimization(shader
->ir
, false, false, 32))
3369 validate_ir_tree(shader
->ir
);
3372 shader
->symbols
= state
->symbols
;
3374 shader
->CompileStatus
= !state
->error
;
3375 shader
->InfoLog
= state
->info_log
;
3376 shader
->Version
= state
->language_version
;
3377 memcpy(shader
->builtins_to_link
, state
->builtins_to_link
,
3378 sizeof(shader
->builtins_to_link
[0]) * state
->num_builtins_to_link
);
3379 shader
->num_builtins_to_link
= state
->num_builtins_to_link
;
3381 if (ctx
->Shader
.Flags
& GLSL_LOG
) {
3382 _mesa_write_shader_to_file(shader
);
3385 if (ctx
->Shader
.Flags
& GLSL_DUMP
) {
3386 if (shader
->CompileStatus
) {
3387 printf("GLSL IR for shader %d:\n", shader
->Name
);
3388 _mesa_print_ir(shader
->ir
, NULL
);
3391 printf("GLSL shader %d failed to compile.\n", shader
->Name
);
3393 if (shader
->InfoLog
&& shader
->InfoLog
[0] != 0) {
3394 printf("GLSL shader %d info log:\n", shader
->Name
);
3395 printf("%s\n", shader
->InfoLog
);
3399 /* Retain any live IR, but trash the rest. */
3400 reparent_ir(shader
->ir
, shader
->ir
);
3407 * Link a GLSL shader program. Called via glLinkProgram().
3410 _mesa_glsl_link_shader(struct gl_context
*ctx
, struct gl_shader_program
*prog
)
3414 _mesa_clear_shader_program_data(ctx
, prog
);
3416 prog
->LinkStatus
= GL_TRUE
;
3418 for (i
= 0; i
< prog
->NumShaders
; i
++) {
3419 if (!prog
->Shaders
[i
]->CompileStatus
) {
3420 linker_error(prog
, "linking with uncompiled shader");
3421 prog
->LinkStatus
= GL_FALSE
;
3425 if (prog
->LinkStatus
) {
3426 link_shaders(ctx
, prog
);
3429 if (prog
->LinkStatus
) {
3430 if (!ctx
->Driver
.LinkShader(ctx
, prog
)) {
3431 prog
->LinkStatus
= GL_FALSE
;
3435 set_uniform_initializers(ctx
, prog
);
3437 if (ctx
->Shader
.Flags
& GLSL_DUMP
) {
3438 if (!prog
->LinkStatus
) {
3439 printf("GLSL shader program %d failed to link\n", prog
->Name
);
3442 if (prog
->InfoLog
&& prog
->InfoLog
[0] != 0) {
3443 printf("GLSL shader program %d info log:\n", prog
->Name
);
3444 printf("%s\n", prog
->InfoLog
);