2 * Copyright © 2011 Intel Corporation
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
21 * DEALINGS IN THE SOFTWARE.
25 * \file lower_varyings_to_packed.cpp
27 * This lowering pass generates GLSL code that manually packs varyings into
28 * vec4 slots, for the benefit of back-ends that don't support packed varyings
31 * For example, the following shader:
33 * out mat3x2 foo; // location=4, location_frac=0
34 * out vec3 bar[2]; // location=5, location_frac=2
45 * out vec4 packed4; // location=4, location_frac=0
46 * out vec4 packed5; // location=5, location_frac=0
47 * out vec4 packed6; // location=6, location_frac=0
52 * packed4.xy = foo[0];
53 * packed4.zw = foo[1];
54 * packed5.xy = foo[2];
55 * packed5.zw = bar[0].xy;
56 * packed6.x = bar[0].z;
57 * packed6.yzw = bar[1];
60 * This lowering pass properly handles "double parking" of a varying vector
61 * across two varying slots. For example, in the code above, two of the
62 * components of bar[0] are stored in packed5, and the remaining component is
65 * Note that in theory, the extra instructions may cause some loss of
66 * performance. However, hopefully in most cases the performance loss will
67 * either be absorbed by a later optimization pass, or it will be offset by
68 * memory bandwidth savings (because fewer varyings are used).
70 * This lowering pass also packs flat floats, ints, and uints together, by
71 * using ivec4 as the base type of flat "varyings", and using appropriate
72 * casts to convert floats and uints into ints.
74 * This lowering pass also handles varyings whose type is a struct or an array
75 * of struct. Structs are packed in order and with no gaps, so there may be a
76 * performance penalty due to structure elements being double-parked.
78 * Lowering of geometry shader inputs is slightly more complex, since geometry
79 * inputs are always arrays, so we need to lower arrays to arrays. For
80 * example, the following input:
86 * } arr[3]; // location=4, location_frac=0
88 * Would get lowered like this if it occurred in a fragment shader:
95 * in vec4 packed4; // location=4, location_frac=0
96 * in vec4 packed5; // location=5, location_frac=0
97 * in vec4 packed6; // location=6, location_frac=0
98 * in vec4 packed7; // location=7, location_frac=0
99 * in vec4 packed8; // location=8, location_frac=0
100 * in vec4 packed9; // location=9, location_frac=0
104 * arr[0].f = packed4.x;
105 * arr[0].v = packed4.yzw;
106 * arr[0].a[0] = packed5.xy;
107 * arr[0].a[1] = packed5.zw;
108 * arr[1].f = packed6.x;
109 * arr[1].v = packed6.yzw;
110 * arr[1].a[0] = packed7.xy;
111 * arr[1].a[1] = packed7.zw;
112 * arr[2].f = packed8.x;
113 * arr[2].v = packed8.yzw;
114 * arr[2].a[0] = packed9.xy;
115 * arr[2].a[1] = packed9.zw;
119 * But it would get lowered like this if it occurred in a geometry shader:
126 * in vec4 packed4[3]; // location=4, location_frac=0
127 * in vec4 packed5[3]; // location=5, location_frac=0
131 * arr[0].f = packed4[0].x;
132 * arr[0].v = packed4[0].yzw;
133 * arr[0].a[0] = packed5[0].xy;
134 * arr[0].a[1] = packed5[0].zw;
135 * arr[1].f = packed4[1].x;
136 * arr[1].v = packed4[1].yzw;
137 * arr[1].a[0] = packed5[1].xy;
138 * arr[1].a[1] = packed5[1].zw;
139 * arr[2].f = packed4[2].x;
140 * arr[2].v = packed4[2].yzw;
141 * arr[2].a[0] = packed5[2].xy;
142 * arr[2].a[1] = packed5[2].zw;
147 #include "glsl_symbol_table.h"
149 #include "ir_optimization.h"
154 * Visitor that performs varying packing. For each varying declared in the
155 * shader, this visitor determines whether it needs to be packed. If so, it
156 * demotes it to an ordinary global, creates new packed varyings, and
157 * generates assignments to convert between the original varying and the
160 class lower_packed_varyings_visitor
163 lower_packed_varyings_visitor(void *mem_ctx
, unsigned locations_used
,
164 ir_variable_mode mode
,
165 unsigned gs_input_vertices
,
166 exec_list
*out_instructions
);
168 void run(exec_list
*instructions
);
171 ir_assignment
*bitwise_assign_pack(ir_rvalue
*lhs
, ir_rvalue
*rhs
);
172 ir_assignment
*bitwise_assign_unpack(ir_rvalue
*lhs
, ir_rvalue
*rhs
);
173 unsigned lower_rvalue(ir_rvalue
*rvalue
, unsigned fine_location
,
174 ir_variable
*unpacked_var
, const char *name
,
175 bool gs_input_toplevel
, unsigned vertex_index
);
176 unsigned lower_arraylike(ir_rvalue
*rvalue
, unsigned array_size
,
177 unsigned fine_location
,
178 ir_variable
*unpacked_var
, const char *name
,
179 bool gs_input_toplevel
, unsigned vertex_index
);
180 ir_dereference
*get_packed_varying_deref(unsigned location
,
181 ir_variable
*unpacked_var
,
183 unsigned vertex_index
);
184 bool needs_lowering(ir_variable
*var
);
187 * Memory context used to allocate new instructions for the shader.
189 void * const mem_ctx
;
192 * Number of generic varying slots which are used by this shader. This is
193 * used to allocate temporary intermediate data structures. If any varying
194 * used by this shader has a location greater than or equal to
195 * VARYING_SLOT_VAR0 + locations_used, an assertion will fire.
197 const unsigned locations_used
;
200 * Array of pointers to the packed varyings that have been created for each
201 * generic varying slot. NULL entries in this array indicate varying slots
202 * for which a packed varying has not been created yet.
204 ir_variable
**packed_varyings
;
207 * Type of varying which is being lowered in this pass (either
208 * ir_var_shader_in or ir_var_shader_out).
210 const ir_variable_mode mode
;
213 * If we are currently lowering geometry shader inputs, the number of input
214 * vertices the geometry shader accepts. Otherwise zero.
216 const unsigned gs_input_vertices
;
219 * Exec list into which the visitor should insert the packing instructions.
220 * Caller provides this list; it should insert the instructions into the
221 * appropriate place in the shader once the visitor has finished running.
223 exec_list
*out_instructions
;
226 } /* anonymous namespace */
228 lower_packed_varyings_visitor::lower_packed_varyings_visitor(
229 void *mem_ctx
, unsigned locations_used
, ir_variable_mode mode
,
230 unsigned gs_input_vertices
, exec_list
*out_instructions
)
232 locations_used(locations_used
),
233 packed_varyings((ir_variable
**)
234 rzalloc_array_size(mem_ctx
, sizeof(*packed_varyings
),
237 gs_input_vertices(gs_input_vertices
),
238 out_instructions(out_instructions
)
243 lower_packed_varyings_visitor::run(exec_list
*instructions
)
245 foreach_list (node
, instructions
) {
246 ir_variable
*var
= ((ir_instruction
*) node
)->as_variable();
250 if (var
->data
.mode
!= this->mode
||
251 var
->data
.location
< VARYING_SLOT_VAR0
||
252 !this->needs_lowering(var
))
255 /* This lowering pass is only capable of packing floats and ints
256 * together when their interpolation mode is "flat". Therefore, to be
257 * safe, caller should ensure that integral varyings always use flat
258 * interpolation, even when this is not required by GLSL.
260 assert(var
->data
.interpolation
== INTERP_QUALIFIER_FLAT
||
261 !var
->type
->contains_integer());
263 /* Change the old varying into an ordinary global. */
264 var
->data
.mode
= ir_var_auto
;
266 /* Create a reference to the old varying. */
267 ir_dereference_variable
*deref
268 = new(this->mem_ctx
) ir_dereference_variable(var
);
270 /* Recursively pack or unpack it. */
271 this->lower_rvalue(deref
, var
->data
.location
* 4 + var
->data
.location_frac
, var
,
272 var
->name
, this->gs_input_vertices
!= 0, 0);
278 * Make an ir_assignment from \c rhs to \c lhs, performing appropriate
279 * bitcasts if necessary to match up types.
281 * This function is called when packing varyings.
284 lower_packed_varyings_visitor::bitwise_assign_pack(ir_rvalue
*lhs
,
287 if (lhs
->type
->base_type
!= rhs
->type
->base_type
) {
288 /* Since we only mix types in flat varyings, and we always store flat
289 * varyings as type ivec4, we need only produce conversions from (uint
292 assert(lhs
->type
->base_type
== GLSL_TYPE_INT
);
293 switch (rhs
->type
->base_type
) {
295 rhs
= new(this->mem_ctx
)
296 ir_expression(ir_unop_u2i
, lhs
->type
, rhs
);
298 case GLSL_TYPE_FLOAT
:
299 rhs
= new(this->mem_ctx
)
300 ir_expression(ir_unop_bitcast_f2i
, lhs
->type
, rhs
);
303 assert(!"Unexpected type conversion while lowering varyings");
307 return new(this->mem_ctx
) ir_assignment(lhs
, rhs
);
312 * Make an ir_assignment from \c rhs to \c lhs, performing appropriate
313 * bitcasts if necessary to match up types.
315 * This function is called when unpacking varyings.
318 lower_packed_varyings_visitor::bitwise_assign_unpack(ir_rvalue
*lhs
,
321 if (lhs
->type
->base_type
!= rhs
->type
->base_type
) {
322 /* Since we only mix types in flat varyings, and we always store flat
323 * varyings as type ivec4, we need only produce conversions from int to
326 assert(rhs
->type
->base_type
== GLSL_TYPE_INT
);
327 switch (lhs
->type
->base_type
) {
329 rhs
= new(this->mem_ctx
)
330 ir_expression(ir_unop_i2u
, lhs
->type
, rhs
);
332 case GLSL_TYPE_FLOAT
:
333 rhs
= new(this->mem_ctx
)
334 ir_expression(ir_unop_bitcast_i2f
, lhs
->type
, rhs
);
337 assert(!"Unexpected type conversion while lowering varyings");
341 return new(this->mem_ctx
) ir_assignment(lhs
, rhs
);
346 * Recursively pack or unpack the given varying (or portion of a varying) by
347 * traversing all of its constituent vectors.
349 * \param fine_location is the location where the first constituent vector
350 * should be packed--the word "fine" indicates that this location is expressed
351 * in multiples of a float, rather than multiples of a vec4 as is used
354 * \param gs_input_toplevel should be set to true if we are lowering geometry
355 * shader inputs, and we are currently lowering the whole input variable
356 * (i.e. we are lowering the array whose index selects the vertex).
358 * \param vertex_index: if we are lowering geometry shader inputs, and the
359 * level of the array that we are currently lowering is *not* the top level,
360 * then this indicates which vertex we are currently lowering. Otherwise it
363 * \return the location where the next constituent vector (after this one)
367 lower_packed_varyings_visitor::lower_rvalue(ir_rvalue
*rvalue
,
368 unsigned fine_location
,
369 ir_variable
*unpacked_var
,
371 bool gs_input_toplevel
,
372 unsigned vertex_index
)
374 /* When gs_input_toplevel is set, we should be looking at a geometry shader
377 assert(!gs_input_toplevel
|| rvalue
->type
->is_array());
379 if (rvalue
->type
->is_record()) {
380 for (unsigned i
= 0; i
< rvalue
->type
->length
; i
++) {
382 rvalue
= rvalue
->clone(this->mem_ctx
, NULL
);
383 const char *field_name
= rvalue
->type
->fields
.structure
[i
].name
;
384 ir_dereference_record
*dereference_record
= new(this->mem_ctx
)
385 ir_dereference_record(rvalue
, field_name
);
387 = ralloc_asprintf(this->mem_ctx
, "%s.%s", name
, field_name
);
388 fine_location
= this->lower_rvalue(dereference_record
, fine_location
,
389 unpacked_var
, deref_name
, false,
392 return fine_location
;
393 } else if (rvalue
->type
->is_array()) {
394 /* Arrays are packed/unpacked by considering each array element in
397 return this->lower_arraylike(rvalue
, rvalue
->type
->array_size(),
398 fine_location
, unpacked_var
, name
,
399 gs_input_toplevel
, vertex_index
);
400 } else if (rvalue
->type
->is_matrix()) {
401 /* Matrices are packed/unpacked by considering each column vector in
404 return this->lower_arraylike(rvalue
, rvalue
->type
->matrix_columns
,
405 fine_location
, unpacked_var
, name
,
406 false, vertex_index
);
407 } else if (rvalue
->type
->vector_elements
+ fine_location
% 4 > 4) {
408 /* This vector is going to be "double parked" across two varying slots,
409 * so handle it as two separate assignments.
411 unsigned left_components
= 4 - fine_location
% 4;
412 unsigned right_components
413 = rvalue
->type
->vector_elements
- left_components
;
414 unsigned left_swizzle_values
[4] = { 0, 0, 0, 0 };
415 unsigned right_swizzle_values
[4] = { 0, 0, 0, 0 };
416 char left_swizzle_name
[4] = { 0, 0, 0, 0 };
417 char right_swizzle_name
[4] = { 0, 0, 0, 0 };
418 for (unsigned i
= 0; i
< left_components
; i
++) {
419 left_swizzle_values
[i
] = i
;
420 left_swizzle_name
[i
] = "xyzw"[i
];
422 for (unsigned i
= 0; i
< right_components
; i
++) {
423 right_swizzle_values
[i
] = i
+ left_components
;
424 right_swizzle_name
[i
] = "xyzw"[i
+ left_components
];
426 ir_swizzle
*left_swizzle
= new(this->mem_ctx
)
427 ir_swizzle(rvalue
, left_swizzle_values
, left_components
);
428 ir_swizzle
*right_swizzle
= new(this->mem_ctx
)
429 ir_swizzle(rvalue
->clone(this->mem_ctx
, NULL
), right_swizzle_values
,
432 = ralloc_asprintf(this->mem_ctx
, "%s.%s", name
, left_swizzle_name
);
434 = ralloc_asprintf(this->mem_ctx
, "%s.%s", name
, right_swizzle_name
);
435 fine_location
= this->lower_rvalue(left_swizzle
, fine_location
,
436 unpacked_var
, left_name
, false,
438 return this->lower_rvalue(right_swizzle
, fine_location
, unpacked_var
,
439 right_name
, false, vertex_index
);
441 /* No special handling is necessary; pack the rvalue into the
444 unsigned swizzle_values
[4] = { 0, 0, 0, 0 };
445 unsigned components
= rvalue
->type
->vector_elements
;
446 unsigned location
= fine_location
/ 4;
447 unsigned location_frac
= fine_location
% 4;
448 for (unsigned i
= 0; i
< components
; ++i
)
449 swizzle_values
[i
] = i
+ location_frac
;
450 ir_dereference
*packed_deref
=
451 this->get_packed_varying_deref(location
, unpacked_var
, name
,
453 ir_swizzle
*swizzle
= new(this->mem_ctx
)
454 ir_swizzle(packed_deref
, swizzle_values
, components
);
455 if (this->mode
== ir_var_shader_out
) {
456 ir_assignment
*assignment
457 = this->bitwise_assign_pack(swizzle
, rvalue
);
458 this->out_instructions
->push_tail(assignment
);
460 ir_assignment
*assignment
461 = this->bitwise_assign_unpack(rvalue
, swizzle
);
462 this->out_instructions
->push_tail(assignment
);
464 return fine_location
+ components
;
469 * Recursively pack or unpack a varying for which we need to iterate over its
470 * constituent elements, accessing each one using an ir_dereference_array.
471 * This takes care of both arrays and matrices, since ir_dereference_array
472 * treats a matrix like an array of its column vectors.
474 * \param gs_input_toplevel should be set to true if we are lowering geometry
475 * shader inputs, and we are currently lowering the whole input variable
476 * (i.e. we are lowering the array whose index selects the vertex).
478 * \param vertex_index: if we are lowering geometry shader inputs, and the
479 * level of the array that we are currently lowering is *not* the top level,
480 * then this indicates which vertex we are currently lowering. Otherwise it
484 lower_packed_varyings_visitor::lower_arraylike(ir_rvalue
*rvalue
,
486 unsigned fine_location
,
487 ir_variable
*unpacked_var
,
489 bool gs_input_toplevel
,
490 unsigned vertex_index
)
492 for (unsigned i
= 0; i
< array_size
; i
++) {
494 rvalue
= rvalue
->clone(this->mem_ctx
, NULL
);
495 ir_constant
*constant
= new(this->mem_ctx
) ir_constant(i
);
496 ir_dereference_array
*dereference_array
= new(this->mem_ctx
)
497 ir_dereference_array(rvalue
, constant
);
498 if (gs_input_toplevel
) {
499 /* Geometry shader inputs are a special case. Instead of storing
500 * each element of the array at a different location, all elements
501 * are at the same location, but with a different vertex index.
503 (void) this->lower_rvalue(dereference_array
, fine_location
,
504 unpacked_var
, name
, false, i
);
506 char *subscripted_name
507 = ralloc_asprintf(this->mem_ctx
, "%s[%d]", name
, i
);
509 this->lower_rvalue(dereference_array
, fine_location
,
510 unpacked_var
, subscripted_name
,
511 false, vertex_index
);
514 return fine_location
;
518 * Retrieve the packed varying corresponding to the given varying location.
519 * If no packed varying has been created for the given varying location yet,
520 * create it and add it to the shader before returning it.
522 * The newly created varying inherits its interpolation parameters from \c
523 * unpacked_var. Its base type is ivec4 if we are lowering a flat varying,
526 * \param vertex_index: if we are lowering geometry shader inputs, then this
527 * indicates which vertex we are currently lowering. Otherwise it is ignored.
530 lower_packed_varyings_visitor::get_packed_varying_deref(
531 unsigned location
, ir_variable
*unpacked_var
, const char *name
,
532 unsigned vertex_index
)
534 unsigned slot
= location
- VARYING_SLOT_VAR0
;
535 assert(slot
< locations_used
);
536 if (this->packed_varyings
[slot
] == NULL
) {
537 char *packed_name
= ralloc_asprintf(this->mem_ctx
, "packed:%s", name
);
538 const glsl_type
*packed_type
;
539 if (unpacked_var
->data
.interpolation
== INTERP_QUALIFIER_FLAT
)
540 packed_type
= glsl_type::ivec4_type
;
542 packed_type
= glsl_type::vec4_type
;
543 if (this->gs_input_vertices
!= 0) {
545 glsl_type::get_array_instance(packed_type
,
546 this->gs_input_vertices
);
548 ir_variable
*packed_var
= new(this->mem_ctx
)
549 ir_variable(packed_type
, packed_name
, this->mode
);
550 if (this->gs_input_vertices
!= 0) {
551 /* Prevent update_array_sizes() from messing with the size of the
554 packed_var
->data
.max_array_access
= this->gs_input_vertices
- 1;
556 packed_var
->data
.centroid
= unpacked_var
->data
.centroid
;
557 packed_var
->data
.sample
= unpacked_var
->data
.sample
;
558 packed_var
->data
.interpolation
= unpacked_var
->data
.interpolation
;
559 packed_var
->data
.location
= location
;
560 unpacked_var
->insert_before(packed_var
);
561 this->packed_varyings
[slot
] = packed_var
;
563 /* For geometry shader inputs, only update the packed variable name the
564 * first time we visit each component.
566 if (this->gs_input_vertices
== 0 || vertex_index
== 0) {
567 ralloc_asprintf_append((char **) &this->packed_varyings
[slot
]->name
,
572 ir_dereference
*deref
= new(this->mem_ctx
)
573 ir_dereference_variable(this->packed_varyings
[slot
]);
574 if (this->gs_input_vertices
!= 0) {
575 /* When lowering GS inputs, the packed variable is an array, so we need
576 * to dereference it using vertex_index.
578 ir_constant
*constant
= new(this->mem_ctx
) ir_constant(vertex_index
);
579 deref
= new(this->mem_ctx
) ir_dereference_array(deref
, constant
);
585 lower_packed_varyings_visitor::needs_lowering(ir_variable
*var
)
587 /* Things composed of vec4's and varyings with explicitly assigned
588 * locations don't need lowering. Everything else does.
590 if (var
->data
.explicit_location
)
593 const glsl_type
*type
= var
->type
;
594 if (this->gs_input_vertices
!= 0) {
595 assert(type
->is_array());
596 type
= type
->element_type();
598 if (type
->is_array())
599 type
= type
->fields
.array
;
600 if (type
->vector_elements
== 4)
607 * Visitor that splices varying packing code before every use of EmitVertex()
608 * in a geometry shader.
610 class lower_packed_varyings_gs_splicer
: public ir_hierarchical_visitor
613 explicit lower_packed_varyings_gs_splicer(void *mem_ctx
,
614 const exec_list
*instructions
);
616 virtual ir_visitor_status
visit(ir_emit_vertex
*ev
);
620 * Memory context used to allocate new instructions for the shader.
622 void * const mem_ctx
;
625 * Instructions that should be spliced into place before each EmitVertex()
628 const exec_list
*instructions
;
632 lower_packed_varyings_gs_splicer::lower_packed_varyings_gs_splicer(
633 void *mem_ctx
, const exec_list
*instructions
)
634 : mem_ctx(mem_ctx
), instructions(instructions
)
640 lower_packed_varyings_gs_splicer::visit(ir_emit_vertex
*ev
)
642 foreach_list(node
, this->instructions
) {
643 ir_instruction
*ir
= (ir_instruction
*) node
;
644 ev
->insert_before(ir
->clone(this->mem_ctx
, NULL
));
646 return visit_continue
;
651 lower_packed_varyings(void *mem_ctx
, unsigned locations_used
,
652 ir_variable_mode mode
, unsigned gs_input_vertices
,
655 exec_list
*instructions
= shader
->ir
;
656 ir_function
*main_func
= shader
->symbols
->get_function("main");
657 exec_list void_parameters
;
658 ir_function_signature
*main_func_sig
659 = main_func
->matching_signature(NULL
, &void_parameters
);
660 exec_list new_instructions
;
661 lower_packed_varyings_visitor
visitor(mem_ctx
, locations_used
, mode
,
662 gs_input_vertices
, &new_instructions
);
663 visitor
.run(instructions
);
664 if (mode
== ir_var_shader_out
) {
665 if (shader
->Stage
== MESA_SHADER_GEOMETRY
) {
666 /* For geometry shaders, outputs need to be lowered before each call
669 lower_packed_varyings_gs_splicer
splicer(mem_ctx
, &new_instructions
);
670 splicer
.run(instructions
);
672 /* For other shader types, outputs need to be lowered at the end of
675 main_func_sig
->body
.append_list(&new_instructions
);
678 /* Shader inputs need to be lowered at the beginning of main() */
679 main_func_sig
->body
.head
->insert_before(&new_instructions
);