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.
24 #include "main/core.h"
27 #include "ir_uniform.h"
28 #include "glsl_symbol_table.h"
29 #include "program/hash_table.h"
31 #include "util/hash_table.h"
34 * \file link_uniforms.cpp
35 * Assign locations for GLSL uniforms.
37 * \author Ian Romanick <ian.d.romanick@intel.com>
41 * Used by linker to indicate uniforms that have no location set.
43 #define UNMAPPED_UNIFORM_LOC ~0u
46 * Count the backing storage requirements for a type
49 values_for_type(const glsl_type
*type
)
51 if (type
->is_sampler()) {
53 } else if (type
->is_array() && type
->fields
.array
->is_sampler()) {
54 return type
->array_size();
56 return type
->component_slots();
61 program_resource_visitor::process(const glsl_type
*type
, const char *name
)
63 assert(type
->without_array()->is_record()
64 || type
->without_array()->is_interface());
66 unsigned record_array_count
= 1;
67 char *name_copy
= ralloc_strdup(NULL
, name
);
68 unsigned packing
= type
->interface_packing
;
70 recursion(type
, &name_copy
, strlen(name
), false, NULL
, packing
, false,
71 record_array_count
, NULL
);
72 ralloc_free(name_copy
);
76 program_resource_visitor::process(ir_variable
*var
)
78 unsigned record_array_count
= 1;
79 const bool row_major
=
80 var
->data
.matrix_layout
== GLSL_MATRIX_LAYOUT_ROW_MAJOR
;
82 const unsigned packing
= var
->get_interface_type() ?
83 var
->get_interface_type()->interface_packing
:
84 var
->type
->interface_packing
;
87 var
->data
.from_named_ifc_block
? var
->get_interface_type() : var
->type
;
88 const glsl_type
*t_without_array
= t
->without_array();
90 /* false is always passed for the row_major parameter to the other
91 * processing functions because no information is available to do
92 * otherwise. See the warning in linker.h.
94 if (t_without_array
->is_record() ||
95 (t
->is_array() && t
->fields
.array
->is_array())) {
96 char *name
= ralloc_strdup(NULL
, var
->name
);
97 recursion(var
->type
, &name
, strlen(name
), row_major
, NULL
, packing
,
98 false, record_array_count
, NULL
);
100 } else if (t_without_array
->is_interface()) {
101 char *name
= ralloc_strdup(NULL
, t_without_array
->name
);
102 const glsl_struct_field
*ifc_member
= var
->data
.from_named_ifc_block
?
104 fields
.structure
[t_without_array
->field_index(var
->name
)] : NULL
;
106 recursion(t
, &name
, strlen(name
), row_major
, NULL
, packing
,
107 false, record_array_count
, ifc_member
);
110 this->set_record_array_count(record_array_count
);
111 this->visit_field(t
, var
->name
, row_major
, NULL
, packing
, false);
116 program_resource_visitor::recursion(const glsl_type
*t
, char **name
,
117 size_t name_length
, bool row_major
,
118 const glsl_type
*record_type
,
119 const unsigned packing
,
121 unsigned record_array_count
,
122 const glsl_struct_field
*named_ifc_member
)
124 /* Records need to have each field processed individually.
126 * Arrays of records need to have each array element processed
127 * individually, then each field of the resulting array elements processed
130 if (t
->is_interface() && named_ifc_member
) {
131 ralloc_asprintf_rewrite_tail(name
, &name_length
, ".%s",
132 named_ifc_member
->name
);
133 recursion(named_ifc_member
->type
, name
, name_length
, row_major
, NULL
,
134 packing
, false, record_array_count
, NULL
);
135 } else if (t
->is_record() || t
->is_interface()) {
136 if (record_type
== NULL
&& t
->is_record())
140 this->enter_record(t
, *name
, row_major
, packing
);
142 for (unsigned i
= 0; i
< t
->length
; i
++) {
143 const char *field
= t
->fields
.structure
[i
].name
;
144 size_t new_length
= name_length
;
146 if (t
->fields
.structure
[i
].type
->is_record())
147 this->visit_field(&t
->fields
.structure
[i
]);
149 if (t
->is_interface() && t
->fields
.structure
[i
].offset
!= -1)
150 this->set_buffer_offset(t
->fields
.structure
[i
].offset
);
152 /* Append '.field' to the current variable name. */
153 if (name_length
== 0) {
154 ralloc_asprintf_rewrite_tail(name
, &new_length
, "%s", field
);
156 ralloc_asprintf_rewrite_tail(name
, &new_length
, ".%s", field
);
159 /* The layout of structures at the top level of the block is set
160 * during parsing. For matrices contained in multiple levels of
161 * structures in the block, the inner structures have no layout.
162 * These cases must potentially inherit the layout from the outer
165 bool field_row_major
= row_major
;
166 const enum glsl_matrix_layout matrix_layout
=
167 glsl_matrix_layout(t
->fields
.structure
[i
].matrix_layout
);
168 if (matrix_layout
== GLSL_MATRIX_LAYOUT_ROW_MAJOR
) {
169 field_row_major
= true;
170 } else if (matrix_layout
== GLSL_MATRIX_LAYOUT_COLUMN_MAJOR
) {
171 field_row_major
= false;
174 recursion(t
->fields
.structure
[i
].type
, name
, new_length
,
178 (i
+ 1) == t
->length
, record_array_count
, NULL
);
180 /* Only the first leaf-field of the record gets called with the
181 * record type pointer.
186 if (t
->is_record()) {
187 (*name
)[name_length
] = '\0';
188 this->leave_record(t
, *name
, row_major
, packing
);
190 } else if (t
->without_array()->is_record() ||
191 t
->without_array()->is_interface() ||
192 (t
->is_array() && t
->fields
.array
->is_array())) {
193 if (record_type
== NULL
&& t
->fields
.array
->is_record())
194 record_type
= t
->fields
.array
;
196 unsigned length
= t
->length
;
197 /* Shader storage block unsized arrays: add subscript [0] to variable
199 if (t
->is_unsized_array())
202 record_array_count
*= length
;
204 for (unsigned i
= 0; i
< length
; i
++) {
205 size_t new_length
= name_length
;
207 /* Append the subscript to the current variable name */
208 ralloc_asprintf_rewrite_tail(name
, &new_length
, "[%u]", i
);
210 recursion(t
->fields
.array
, name
, new_length
, row_major
,
213 (i
+ 1) == t
->length
, record_array_count
,
216 /* Only the first leaf-field of the record gets called with the
217 * record type pointer.
222 this->set_record_array_count(record_array_count
);
223 this->visit_field(t
, *name
, row_major
, record_type
, packing
, last_field
);
228 program_resource_visitor::visit_field(const glsl_type
*type
, const char *name
,
232 bool /* last_field */)
234 visit_field(type
, name
, row_major
);
238 program_resource_visitor::visit_field(const glsl_struct_field
*field
)
245 program_resource_visitor::enter_record(const glsl_type
*, const char *, bool,
251 program_resource_visitor::leave_record(const glsl_type
*, const char *, bool,
257 program_resource_visitor::set_buffer_offset(unsigned)
262 program_resource_visitor::set_record_array_count(unsigned)
269 * Class to help calculate the storage requirements for a set of uniforms
271 * As uniforms are added to the active set the number of active uniforms and
272 * the storage requirements for those uniforms are accumulated. The active
273 * uniforms are added to the hash table supplied to the constructor.
275 * If the same uniform is added multiple times (i.e., once for each shader
276 * target), it will only be accounted once.
278 class count_uniform_size
: public program_resource_visitor
{
280 count_uniform_size(struct string_to_uint_map
*map
,
281 struct string_to_uint_map
*hidden_map
)
282 : num_active_uniforms(0), num_hidden_uniforms(0), num_values(0),
283 num_shader_samplers(0), num_shader_images(0),
284 num_shader_uniform_components(0), num_shader_subroutines(0),
285 is_buffer_block(false), is_shader_storage(false), map(map
),
286 hidden_map(hidden_map
)
293 this->num_shader_samplers
= 0;
294 this->num_shader_images
= 0;
295 this->num_shader_uniform_components
= 0;
296 this->num_shader_subroutines
= 0;
299 void process(ir_variable
*var
)
301 this->current_var
= var
;
302 this->is_buffer_block
= var
->is_in_buffer_block();
303 this->is_shader_storage
= var
->is_in_shader_storage_block();
304 if (var
->is_interface_instance())
305 program_resource_visitor::process(var
->get_interface_type(),
306 var
->get_interface_type()->name
);
308 program_resource_visitor::process(var
);
312 * Total number of active uniforms counted
314 unsigned num_active_uniforms
;
316 unsigned num_hidden_uniforms
;
319 * Number of data values required to back the storage for the active uniforms
324 * Number of samplers used
326 unsigned num_shader_samplers
;
329 * Number of images used
331 unsigned num_shader_images
;
334 * Number of uniforms used in the current shader
336 unsigned num_shader_uniform_components
;
339 * Number of subroutine uniforms used
341 unsigned num_shader_subroutines
;
343 bool is_buffer_block
;
344 bool is_shader_storage
;
346 struct string_to_uint_map
*map
;
349 virtual void visit_field(const glsl_type
*type
, const char *name
,
352 assert(!type
->without_array()->is_record());
353 assert(!type
->without_array()->is_interface());
354 assert(!(type
->is_array() && type
->fields
.array
->is_array()));
358 /* Count the number of samplers regardless of whether the uniform is
359 * already in the hash table. The hash table prevents adding the same
360 * uniform for multiple shader targets, but in this case we want to
361 * count it for each shader target.
363 const unsigned values
= values_for_type(type
);
364 if (type
->contains_subroutine()) {
365 this->num_shader_subroutines
+= values
;
366 } else if (type
->contains_sampler()) {
367 this->num_shader_samplers
+= values
;
368 } else if (type
->contains_image()) {
369 this->num_shader_images
+= values
;
371 /* As drivers are likely to represent image uniforms as
372 * scalar indices, count them against the limit of uniform
373 * components in the default block. The spec allows image
374 * uniforms to use up no more than one scalar slot.
376 if(!is_shader_storage
)
377 this->num_shader_uniform_components
+= values
;
379 /* Accumulate the total number of uniform slots used by this shader.
380 * Note that samplers do not count against this limit because they
381 * don't use any storage on current hardware.
383 if (!is_buffer_block
)
384 this->num_shader_uniform_components
+= values
;
387 /* If the uniform is already in the map, there's nothing more to do.
390 if (this->map
->get(id
, name
))
393 if (this->current_var
->data
.how_declared
== ir_var_hidden
) {
394 this->hidden_map
->put(this->num_hidden_uniforms
, name
);
395 this->num_hidden_uniforms
++;
397 this->map
->put(this->num_active_uniforms
-this->num_hidden_uniforms
,
401 /* Each leaf uniform occupies one entry in the list of active
404 this->num_active_uniforms
++;
405 this->num_values
+= values
;
408 struct string_to_uint_map
*hidden_map
;
411 * Current variable being processed.
413 ir_variable
*current_var
;
416 } /* anonymous namespace */
419 * Class to help parcel out pieces of backing storage to uniforms
421 * Each uniform processed has some range of the \c gl_constant_value
422 * structures associated with it. The association is done by finding
423 * the uniform in the \c string_to_uint_map and using the value from
424 * the map to connect that slot in the \c gl_uniform_storage table
425 * with the next available slot in the \c gl_constant_value array.
428 * This class assumes that every uniform that will be processed is
429 * already in the \c string_to_uint_map. In addition, it assumes that
430 * the \c gl_uniform_storage and \c gl_constant_value arrays are "big
433 class parcel_out_uniform_storage
: public program_resource_visitor
{
435 parcel_out_uniform_storage(struct gl_shader_program
*prog
,
436 struct string_to_uint_map
*map
,
437 struct gl_uniform_storage
*uniforms
,
438 union gl_constant_value
*values
)
439 : prog(prog
), map(map
), uniforms(uniforms
), values(values
)
443 void start_shader(gl_shader_stage shader_type
)
445 assert(shader_type
< MESA_SHADER_STAGES
);
446 this->shader_type
= shader_type
;
448 this->shader_samplers_used
= 0;
449 this->shader_shadow_samplers
= 0;
450 this->next_sampler
= 0;
451 this->next_image
= 0;
452 this->next_subroutine
= 0;
453 this->record_array_count
= 1;
454 memset(this->targets
, 0, sizeof(this->targets
));
457 void set_and_process(ir_variable
*var
)
461 this->record_next_sampler
= new string_to_uint_map
;
463 buffer_block_index
= -1;
464 if (var
->is_in_buffer_block()) {
465 struct gl_uniform_block
*blks
= var
->is_in_shader_storage_block() ?
466 prog
->ShaderStorageBlocks
: prog
->UniformBlocks
;
467 unsigned num_blks
= var
->is_in_shader_storage_block() ?
468 prog
->NumShaderStorageBlocks
: prog
->NumUniformBlocks
;
470 if (var
->is_interface_instance() && var
->type
->is_array()) {
471 unsigned l
= strlen(var
->get_interface_type()->name
);
473 for (unsigned i
= 0; i
< num_blks
; i
++) {
474 if (strncmp(var
->get_interface_type()->name
, blks
[i
].Name
, l
)
475 == 0 && blks
[i
].Name
[l
] == '[') {
476 buffer_block_index
= i
;
481 for (unsigned i
= 0; i
< num_blks
; i
++) {
482 if (strcmp(var
->get_interface_type()->name
, blks
[i
].Name
) ==
484 buffer_block_index
= i
;
489 assert(buffer_block_index
!= -1);
491 /* Uniform blocks that were specified with an instance name must be
492 * handled a little bit differently. The name of the variable is the
493 * name used to reference the uniform block instead of being the name
494 * of a variable within the block. Therefore, searching for the name
495 * within the block will fail.
497 if (var
->is_interface_instance()) {
499 process(var
->get_interface_type(),
500 var
->get_interface_type()->name
);
502 const struct gl_uniform_block
*const block
=
503 &blks
[buffer_block_index
];
505 assert(var
->data
.location
!= -1);
507 const struct gl_uniform_buffer_variable
*const ubo_var
=
508 &block
->Uniforms
[var
->data
.location
];
510 ubo_byte_offset
= ubo_var
->Offset
;
514 /* Store any explicit location and reset data location so we can
515 * reuse this variable for storing the uniform slot number.
517 this->explicit_location
= current_var
->data
.location
;
518 current_var
->data
.location
= -1;
522 delete this->record_next_sampler
;
525 int buffer_block_index
;
527 gl_shader_stage shader_type
;
530 void handle_samplers(const glsl_type
*base_type
,
531 struct gl_uniform_storage
*uniform
, const char *name
)
533 if (base_type
->is_sampler()) {
534 uniform
->opaque
[shader_type
].active
= true;
536 /* Handle multiple samplers inside struct arrays */
537 if (this->record_array_count
> 1) {
538 unsigned inner_array_size
= MAX2(1, uniform
->array_elements
);
539 char *name_copy
= ralloc_strdup(NULL
, name
);
541 /* Remove all array subscripts from the sampler name */
544 while((str_start
= strchr(name_copy
, '[')) &&
545 (str_end
= strchr(name_copy
, ']'))) {
546 memmove(str_start
, str_end
+ 1, 1 + strlen(str_end
));
550 if (this->record_next_sampler
->get(index
, name_copy
)) {
551 /* In this case, we've already seen this uniform so we just use
552 * the next sampler index recorded the last time we visited.
554 uniform
->opaque
[shader_type
].index
= index
;
555 index
= inner_array_size
+ uniform
->opaque
[shader_type
].index
;
556 this->record_next_sampler
->put(index
, name_copy
);
558 ralloc_free(name_copy
);
559 /* Return as everything else has already been initialised in a
564 /* We've never seen this uniform before so we need to allocate
565 * enough indices to store it.
567 * Nested struct arrays behave like arrays of arrays so we need
568 * to increase the index by the total number of elements of the
569 * sampler in case there is more than one sampler inside the
570 * structs. This allows the offset to be easily calculated for
573 uniform
->opaque
[shader_type
].index
= this->next_sampler
;
574 this->next_sampler
+=
575 inner_array_size
* this->record_array_count
;
577 /* Store the next index for future passes over the struct array
579 index
= uniform
->opaque
[shader_type
].index
+ inner_array_size
;
580 this->record_next_sampler
->put(index
, name_copy
);
581 ralloc_free(name_copy
);
584 /* Increment the sampler by 1 for non-arrays and by the number of
585 * array elements for arrays.
587 uniform
->opaque
[shader_type
].index
= this->next_sampler
;
588 this->next_sampler
+= MAX2(1, uniform
->array_elements
);
591 const gl_texture_index target
= base_type
->sampler_index();
592 const unsigned shadow
= base_type
->sampler_shadow
;
593 for (unsigned i
= uniform
->opaque
[shader_type
].index
;
594 i
< MIN2(this->next_sampler
, MAX_SAMPLERS
);
596 this->targets
[i
] = target
;
597 this->shader_samplers_used
|= 1U << i
;
598 this->shader_shadow_samplers
|= shadow
<< i
;
603 void handle_images(const glsl_type
*base_type
,
604 struct gl_uniform_storage
*uniform
)
606 if (base_type
->is_image()) {
607 uniform
->opaque
[shader_type
].index
= this->next_image
;
608 uniform
->opaque
[shader_type
].active
= true;
610 /* Set image access qualifiers */
611 const GLenum access
=
612 (current_var
->data
.image_read_only
? GL_READ_ONLY
:
613 current_var
->data
.image_write_only
? GL_WRITE_ONLY
:
616 const unsigned first
= this->next_image
;
618 /* Increment the image index by 1 for non-arrays and by the
619 * number of array elements for arrays.
621 this->next_image
+= MAX2(1, uniform
->array_elements
);
623 for (unsigned i
= first
; i
< MIN2(next_image
, MAX_IMAGE_UNIFORMS
); i
++)
624 prog
->_LinkedShaders
[shader_type
]->ImageAccess
[i
] = access
;
628 void handle_subroutines(const glsl_type
*base_type
,
629 struct gl_uniform_storage
*uniform
)
631 if (base_type
->is_subroutine()) {
632 uniform
->opaque
[shader_type
].index
= this->next_subroutine
;
633 uniform
->opaque
[shader_type
].active
= true;
635 /* Increment the subroutine index by 1 for non-arrays and by the
636 * number of array elements for arrays.
638 this->next_subroutine
+= MAX2(1, uniform
->array_elements
);
643 virtual void set_buffer_offset(unsigned offset
)
645 this->ubo_byte_offset
= offset
;
648 virtual void set_record_array_count(unsigned record_array_count
)
650 this->record_array_count
= record_array_count
;
653 virtual void visit_field(const glsl_type
*type
, const char *name
,
659 assert(!"Should not get here.");
662 virtual void enter_record(const glsl_type
*type
, const char *,
663 bool row_major
, const unsigned packing
) {
664 assert(type
->is_record());
665 if (this->buffer_block_index
== -1)
667 if (packing
== GLSL_INTERFACE_PACKING_STD430
)
668 this->ubo_byte_offset
= glsl_align(
669 this->ubo_byte_offset
, type
->std430_base_alignment(row_major
));
671 this->ubo_byte_offset
= glsl_align(
672 this->ubo_byte_offset
, type
->std140_base_alignment(row_major
));
675 virtual void leave_record(const glsl_type
*type
, const char *,
676 bool row_major
, const unsigned packing
) {
677 assert(type
->is_record());
678 if (this->buffer_block_index
== -1)
680 if (packing
== GLSL_INTERFACE_PACKING_STD430
)
681 this->ubo_byte_offset
= glsl_align(
682 this->ubo_byte_offset
, type
->std430_base_alignment(row_major
));
684 this->ubo_byte_offset
= glsl_align(
685 this->ubo_byte_offset
, type
->std140_base_alignment(row_major
));
688 virtual void visit_field(const glsl_type
*type
, const char *name
,
689 bool row_major
, const glsl_type
*record_type
,
690 const unsigned packing
,
691 bool /* last_field */)
693 assert(!type
->without_array()->is_record());
694 assert(!type
->without_array()->is_interface());
695 assert(!(type
->is_array() && type
->fields
.array
->is_array()));
698 bool found
= this->map
->get(id
, name
);
704 const glsl_type
*base_type
;
705 if (type
->is_array()) {
706 this->uniforms
[id
].array_elements
= type
->length
;
707 base_type
= type
->fields
.array
;
709 this->uniforms
[id
].array_elements
= 0;
713 /* Initialise opaque data */
714 this->uniforms
[id
].opaque
[shader_type
].index
= ~0;
715 this->uniforms
[id
].opaque
[shader_type
].active
= false;
717 /* This assigns uniform indices to sampler and image uniforms. */
718 handle_samplers(base_type
, &this->uniforms
[id
], name
);
719 handle_images(base_type
, &this->uniforms
[id
]);
720 handle_subroutines(base_type
, &this->uniforms
[id
]);
722 /* For array of arrays or struct arrays the base location may have
723 * already been set so don't set it again.
725 if (buffer_block_index
== -1 && current_var
->data
.location
== -1) {
726 current_var
->data
.location
= id
;
729 /* If there is already storage associated with this uniform or if the
730 * uniform is set as builtin, it means that it was set while processing
731 * an earlier shader stage. For example, we may be processing the
732 * uniform in the fragment shader, but the uniform was already processed
733 * in the vertex shader.
735 if (this->uniforms
[id
].storage
!= NULL
|| this->uniforms
[id
].builtin
) {
739 /* Assign explicit locations. */
740 if (current_var
->data
.explicit_location
) {
741 /* Set sequential locations for struct fields. */
742 if (current_var
->type
->without_array()->is_record() ||
743 current_var
->type
->is_array_of_arrays()) {
744 const unsigned entries
= MAX2(1, this->uniforms
[id
].array_elements
);
745 this->uniforms
[id
].remap_location
=
746 this->explicit_location
+ field_counter
;
747 field_counter
+= entries
;
749 this->uniforms
[id
].remap_location
= this->explicit_location
;
752 /* Initialize to to indicate that no location is set */
753 this->uniforms
[id
].remap_location
= UNMAPPED_UNIFORM_LOC
;
756 this->uniforms
[id
].name
= ralloc_strdup(this->uniforms
, name
);
757 this->uniforms
[id
].type
= base_type
;
758 this->uniforms
[id
].num_driver_storage
= 0;
759 this->uniforms
[id
].driver_storage
= NULL
;
760 this->uniforms
[id
].atomic_buffer_index
= -1;
761 this->uniforms
[id
].hidden
=
762 current_var
->data
.how_declared
== ir_var_hidden
;
763 this->uniforms
[id
].builtin
= is_gl_identifier(name
);
765 /* Do not assign storage if the uniform is builtin */
766 if (!this->uniforms
[id
].builtin
)
767 this->uniforms
[id
].storage
= this->values
;
769 this->uniforms
[id
].is_shader_storage
=
770 current_var
->is_in_shader_storage_block();
772 if (this->buffer_block_index
!= -1) {
773 this->uniforms
[id
].block_index
= this->buffer_block_index
;
775 unsigned alignment
= type
->std140_base_alignment(row_major
);
776 if (packing
== GLSL_INTERFACE_PACKING_STD430
)
777 alignment
= type
->std430_base_alignment(row_major
);
778 this->ubo_byte_offset
= glsl_align(this->ubo_byte_offset
, alignment
);
779 this->uniforms
[id
].offset
= this->ubo_byte_offset
;
780 if (packing
== GLSL_INTERFACE_PACKING_STD430
)
781 this->ubo_byte_offset
+= type
->std430_size(row_major
);
783 this->ubo_byte_offset
+= type
->std140_size(row_major
);
785 if (type
->is_array()) {
786 if (packing
== GLSL_INTERFACE_PACKING_STD430
)
787 this->uniforms
[id
].array_stride
=
788 type
->without_array()->std430_array_stride(row_major
);
790 this->uniforms
[id
].array_stride
=
791 glsl_align(type
->without_array()->std140_size(row_major
),
794 this->uniforms
[id
].array_stride
= 0;
797 if (type
->without_array()->is_matrix()) {
798 const glsl_type
*matrix
= type
->without_array();
799 const unsigned N
= matrix
->base_type
== GLSL_TYPE_DOUBLE
? 8 : 4;
800 const unsigned items
=
801 row_major
? matrix
->matrix_columns
: matrix
->vector_elements
;
804 if (packing
== GLSL_INTERFACE_PACKING_STD430
)
805 this->uniforms
[id
].matrix_stride
= items
< 3 ? items
* N
:
806 glsl_align(items
* N
, 16);
808 this->uniforms
[id
].matrix_stride
= glsl_align(items
* N
, 16);
809 this->uniforms
[id
].row_major
= row_major
;
811 this->uniforms
[id
].matrix_stride
= 0;
812 this->uniforms
[id
].row_major
= false;
815 this->uniforms
[id
].block_index
= -1;
816 this->uniforms
[id
].offset
= -1;
817 this->uniforms
[id
].array_stride
= -1;
818 this->uniforms
[id
].matrix_stride
= -1;
819 this->uniforms
[id
].row_major
= false;
822 this->values
+= values_for_type(type
);
826 * Current program being processed.
828 struct gl_shader_program
*prog
;
830 struct string_to_uint_map
*map
;
832 struct gl_uniform_storage
*uniforms
;
833 unsigned next_sampler
;
835 unsigned next_subroutine
;
838 * Field counter is used to take care that uniform structures
839 * with explicit locations get sequential locations.
841 unsigned field_counter
;
844 * Current variable being processed.
846 ir_variable
*current_var
;
848 /* Used to store the explicit location from current_var so that we can
849 * reuse the location field for storing the uniform slot id.
851 int explicit_location
;
853 /* Stores total struct array elements including nested structs */
854 unsigned record_array_count
;
856 /* Map for temporarily storing next sampler index when handling samplers in
859 struct string_to_uint_map
*record_next_sampler
;
862 union gl_constant_value
*values
;
864 gl_texture_index targets
[MAX_SAMPLERS
];
867 * Mask of samplers used by the current shader stage.
869 unsigned shader_samplers_used
;
872 * Mask of samplers used by the current shader stage for shadows.
874 unsigned shader_shadow_samplers
;
878 * Merges a uniform block into an array of uniform blocks that may or
879 * may not already contain a copy of it.
881 * Returns the index of the new block in the array.
884 link_cross_validate_uniform_block(void *mem_ctx
,
885 struct gl_uniform_block
**linked_blocks
,
886 unsigned int *num_linked_blocks
,
887 struct gl_uniform_block
*new_block
)
889 for (unsigned int i
= 0; i
< *num_linked_blocks
; i
++) {
890 struct gl_uniform_block
*old_block
= &(*linked_blocks
)[i
];
892 if (strcmp(old_block
->Name
, new_block
->Name
) == 0)
893 return link_uniform_blocks_are_compatible(old_block
, new_block
)
897 *linked_blocks
= reralloc(mem_ctx
, *linked_blocks
,
898 struct gl_uniform_block
,
899 *num_linked_blocks
+ 1);
900 int linked_block_index
= (*num_linked_blocks
)++;
901 struct gl_uniform_block
*linked_block
= &(*linked_blocks
)[linked_block_index
];
903 memcpy(linked_block
, new_block
, sizeof(*new_block
));
904 linked_block
->Uniforms
= ralloc_array(*linked_blocks
,
905 struct gl_uniform_buffer_variable
,
906 linked_block
->NumUniforms
);
908 memcpy(linked_block
->Uniforms
,
910 sizeof(*linked_block
->Uniforms
) * linked_block
->NumUniforms
);
912 linked_block
->Name
= ralloc_strdup(*linked_blocks
, linked_block
->Name
);
914 for (unsigned int i
= 0; i
< linked_block
->NumUniforms
; i
++) {
915 struct gl_uniform_buffer_variable
*ubo_var
=
916 &linked_block
->Uniforms
[i
];
918 if (ubo_var
->Name
== ubo_var
->IndexName
) {
919 ubo_var
->Name
= ralloc_strdup(*linked_blocks
, ubo_var
->Name
);
920 ubo_var
->IndexName
= ubo_var
->Name
;
922 ubo_var
->Name
= ralloc_strdup(*linked_blocks
, ubo_var
->Name
);
923 ubo_var
->IndexName
= ralloc_strdup(*linked_blocks
, ubo_var
->IndexName
);
927 return linked_block_index
;
931 * Walks the IR and update the references to uniform blocks in the
932 * ir_variables to point at linked shader's list (previously, they
933 * would point at the uniform block list in one of the pre-linked
937 link_update_uniform_buffer_variables(struct gl_shader
*shader
)
939 foreach_in_list(ir_instruction
, node
, shader
->ir
) {
940 ir_variable
*const var
= node
->as_variable();
942 if ((var
== NULL
) || !var
->is_in_buffer_block())
945 assert(var
->data
.mode
== ir_var_uniform
||
946 var
->data
.mode
== ir_var_shader_storage
);
948 if (var
->is_interface_instance()) {
949 var
->data
.location
= 0;
954 char sentinel
= '\0';
956 if (var
->type
->is_record()) {
958 } else if (var
->type
->is_array() && (var
->type
->fields
.array
->is_array()
959 || var
->type
->without_array()->is_record())) {
963 unsigned num_blocks
= var
->data
.mode
== ir_var_uniform
?
964 shader
->NumUniformBlocks
: shader
->NumShaderStorageBlocks
;
965 struct gl_uniform_block
**blks
= var
->data
.mode
== ir_var_uniform
?
966 shader
->UniformBlocks
: shader
->ShaderStorageBlocks
;
968 const unsigned l
= strlen(var
->name
);
969 for (unsigned i
= 0; i
< num_blocks
; i
++) {
970 for (unsigned j
= 0; j
< blks
[i
]->NumUniforms
; j
++) {
972 const char *begin
= blks
[i
]->Uniforms
[j
].Name
;
973 const char *end
= strchr(begin
, sentinel
);
978 if ((ptrdiff_t) l
!= (end
- begin
))
981 if (strncmp(var
->name
, begin
, l
) == 0) {
983 var
->data
.location
= j
;
986 } else if (!strcmp(var
->name
, blks
[i
]->Uniforms
[j
].Name
)) {
988 var
->data
.location
= j
;
1000 * Combine the hidden uniform hash map with the uniform hash map so that the
1001 * hidden uniforms will be given indicies at the end of the uniform storage
1005 assign_hidden_uniform_slot_id(const char *name
, unsigned hidden_id
,
1008 count_uniform_size
*uniform_size
= (count_uniform_size
*) closure
;
1009 unsigned hidden_uniform_start
= uniform_size
->num_active_uniforms
-
1010 uniform_size
->num_hidden_uniforms
;
1012 uniform_size
->map
->put(hidden_uniform_start
+ hidden_id
, name
);
1016 * Search through the list of empty blocks to find one that fits the current
1020 find_empty_block(struct gl_shader_program
*prog
,
1021 struct gl_uniform_storage
*uniform
)
1023 const unsigned entries
= MAX2(1, uniform
->array_elements
);
1025 foreach_list_typed(struct empty_uniform_block
, block
, link
,
1026 &prog
->EmptyUniformLocations
) {
1027 /* Found a block with enough slots to fit the uniform */
1028 if (block
->slots
== entries
) {
1029 unsigned start
= block
->start
;
1030 exec_node_remove(&block
->link
);
1034 /* Found a block with more slots than needed. It can still be used. */
1035 } else if (block
->slots
> entries
) {
1036 unsigned start
= block
->start
;
1037 block
->start
+= entries
;
1038 block
->slots
-= entries
;
1048 link_assign_uniform_locations(struct gl_shader_program
*prog
,
1049 unsigned int boolean_true
,
1050 unsigned int num_explicit_uniform_locs
,
1051 unsigned int max_uniform_locs
)
1053 ralloc_free(prog
->UniformStorage
);
1054 prog
->UniformStorage
= NULL
;
1055 prog
->NumUniformStorage
= 0;
1057 if (prog
->UniformHash
!= NULL
) {
1058 prog
->UniformHash
->clear();
1060 prog
->UniformHash
= new string_to_uint_map
;
1063 /* First pass: Count the uniform resources used by the user-defined
1064 * uniforms. While this happens, each active uniform will have an index
1067 * Note: this is *NOT* the index that is returned to the application by
1068 * glGetUniformLocation.
1070 struct string_to_uint_map
*hiddenUniforms
= new string_to_uint_map
;
1071 count_uniform_size
uniform_size(prog
->UniformHash
, hiddenUniforms
);
1072 for (unsigned i
= 0; i
< MESA_SHADER_STAGES
; i
++) {
1073 struct gl_shader
*sh
= prog
->_LinkedShaders
[i
];
1078 /* Uniforms that lack an initializer in the shader code have an initial
1079 * value of zero. This includes sampler uniforms.
1081 * Page 24 (page 30 of the PDF) of the GLSL 1.20 spec says:
1083 * "The link time initial value is either the value of the variable's
1084 * initializer, if present, or 0 if no initializer is present. Sampler
1085 * types cannot have initializers."
1087 memset(sh
->SamplerUnits
, 0, sizeof(sh
->SamplerUnits
));
1088 memset(sh
->ImageUnits
, 0, sizeof(sh
->ImageUnits
));
1090 link_update_uniform_buffer_variables(sh
);
1092 /* Reset various per-shader target counts.
1094 uniform_size
.start_shader();
1096 foreach_in_list(ir_instruction
, node
, sh
->ir
) {
1097 ir_variable
*const var
= node
->as_variable();
1099 if ((var
== NULL
) || (var
->data
.mode
!= ir_var_uniform
&&
1100 var
->data
.mode
!= ir_var_shader_storage
))
1103 uniform_size
.process(var
);
1106 sh
->num_samplers
= uniform_size
.num_shader_samplers
;
1107 sh
->NumImages
= uniform_size
.num_shader_images
;
1108 sh
->num_uniform_components
= uniform_size
.num_shader_uniform_components
;
1109 sh
->num_combined_uniform_components
= sh
->num_uniform_components
;
1111 for (unsigned i
= 0; i
< sh
->NumUniformBlocks
; i
++) {
1112 sh
->num_combined_uniform_components
+=
1113 sh
->UniformBlocks
[i
]->UniformBufferSize
/ 4;
1117 const unsigned num_uniforms
= uniform_size
.num_active_uniforms
;
1118 const unsigned num_data_slots
= uniform_size
.num_values
;
1119 const unsigned hidden_uniforms
= uniform_size
.num_hidden_uniforms
;
1121 /* assign hidden uniforms a slot id */
1122 hiddenUniforms
->iterate(assign_hidden_uniform_slot_id
, &uniform_size
);
1123 delete hiddenUniforms
;
1125 /* On the outside chance that there were no uniforms, bail out.
1127 if (num_uniforms
== 0)
1130 struct gl_uniform_storage
*uniforms
=
1131 rzalloc_array(prog
, struct gl_uniform_storage
, num_uniforms
);
1132 union gl_constant_value
*data
=
1133 rzalloc_array(uniforms
, union gl_constant_value
, num_data_slots
);
1135 union gl_constant_value
*data_end
= &data
[num_data_slots
];
1138 parcel_out_uniform_storage
parcel(prog
, prog
->UniformHash
, uniforms
, data
);
1140 unsigned total_entries
= num_explicit_uniform_locs
;
1141 unsigned empty_locs
= prog
->NumUniformRemapTable
- num_explicit_uniform_locs
;
1143 for (unsigned i
= 0; i
< MESA_SHADER_STAGES
; i
++) {
1144 if (prog
->_LinkedShaders
[i
] == NULL
)
1147 parcel
.start_shader((gl_shader_stage
)i
);
1149 foreach_in_list(ir_instruction
, node
, prog
->_LinkedShaders
[i
]->ir
) {
1150 ir_variable
*const var
= node
->as_variable();
1152 if ((var
== NULL
) || (var
->data
.mode
!= ir_var_uniform
&&
1153 var
->data
.mode
!= ir_var_shader_storage
))
1156 parcel
.set_and_process(var
);
1159 prog
->_LinkedShaders
[i
]->active_samplers
= parcel
.shader_samplers_used
;
1160 prog
->_LinkedShaders
[i
]->shadow_samplers
= parcel
.shader_shadow_samplers
;
1162 STATIC_ASSERT(sizeof(prog
->_LinkedShaders
[i
]->SamplerTargets
) ==
1163 sizeof(parcel
.targets
));
1164 memcpy(prog
->_LinkedShaders
[i
]->SamplerTargets
, parcel
.targets
,
1165 sizeof(prog
->_LinkedShaders
[i
]->SamplerTargets
));
1168 /* Reserve all the explicit locations of the active uniforms. */
1169 for (unsigned i
= 0; i
< num_uniforms
; i
++) {
1170 if (uniforms
[i
].type
->is_subroutine() ||
1171 uniforms
[i
].is_shader_storage
)
1174 if (uniforms
[i
].remap_location
!= UNMAPPED_UNIFORM_LOC
) {
1175 /* How many new entries for this uniform? */
1176 const unsigned entries
= MAX2(1, uniforms
[i
].array_elements
);
1178 /* Set remap table entries point to correct gl_uniform_storage. */
1179 for (unsigned j
= 0; j
< entries
; j
++) {
1180 unsigned element_loc
= uniforms
[i
].remap_location
+ j
;
1181 assert(prog
->UniformRemapTable
[element_loc
] ==
1182 INACTIVE_UNIFORM_EXPLICIT_LOCATION
);
1183 prog
->UniformRemapTable
[element_loc
] = &uniforms
[i
];
1188 /* Reserve locations for rest of the uniforms. */
1189 for (unsigned i
= 0; i
< num_uniforms
; i
++) {
1191 if (uniforms
[i
].type
->is_subroutine() ||
1192 uniforms
[i
].is_shader_storage
)
1195 /* Built-in uniforms should not get any location. */
1196 if (uniforms
[i
].builtin
)
1199 /* Explicit ones have been set already. */
1200 if (uniforms
[i
].remap_location
!= UNMAPPED_UNIFORM_LOC
)
1203 /* how many new entries for this uniform? */
1204 const unsigned entries
= MAX2(1, uniforms
[i
].array_elements
);
1206 /* Find UniformRemapTable for empty blocks where we can fit this uniform. */
1207 int chosen_location
= -1;
1210 chosen_location
= find_empty_block(prog
, &uniforms
[i
]);
1212 /* Add new entries to the total amount of entries. */
1213 total_entries
+= entries
;
1215 if (chosen_location
!= -1) {
1216 empty_locs
-= entries
;
1218 chosen_location
= prog
->NumUniformRemapTable
;
1220 /* resize remap table to fit new entries */
1221 prog
->UniformRemapTable
=
1223 prog
->UniformRemapTable
,
1224 gl_uniform_storage
*,
1225 prog
->NumUniformRemapTable
+ entries
);
1226 prog
->NumUniformRemapTable
+= entries
;
1229 /* set pointers for this uniform */
1230 for (unsigned j
= 0; j
< entries
; j
++)
1231 prog
->UniformRemapTable
[chosen_location
+ j
] = &uniforms
[i
];
1233 /* set the base location in remap table for the uniform */
1234 uniforms
[i
].remap_location
= chosen_location
;
1237 /* Verify that total amount of entries for explicit and implicit locations
1238 * is less than MAX_UNIFORM_LOCATIONS.
1241 if (total_entries
> max_uniform_locs
) {
1242 linker_error(prog
, "count of uniform locations > MAX_UNIFORM_LOCATIONS"
1243 "(%u > %u)", total_entries
, max_uniform_locs
);
1246 /* Reserve all the explicit locations of the active subroutine uniforms. */
1247 for (unsigned i
= 0; i
< num_uniforms
; i
++) {
1248 if (!uniforms
[i
].type
->is_subroutine())
1251 if (uniforms
[i
].remap_location
== UNMAPPED_UNIFORM_LOC
)
1254 for (unsigned j
= 0; j
< MESA_SHADER_STAGES
; j
++) {
1255 struct gl_shader
*sh
= prog
->_LinkedShaders
[j
];
1259 if (!uniforms
[i
].opaque
[j
].active
)
1262 /* How many new entries for this uniform? */
1263 const unsigned entries
= MAX2(1, uniforms
[i
].array_elements
);
1265 /* Set remap table entries point to correct gl_uniform_storage. */
1266 for (unsigned k
= 0; k
< entries
; k
++) {
1267 unsigned element_loc
= uniforms
[i
].remap_location
+ k
;
1268 assert(sh
->SubroutineUniformRemapTable
[element_loc
] ==
1269 INACTIVE_UNIFORM_EXPLICIT_LOCATION
);
1270 sh
->SubroutineUniformRemapTable
[element_loc
] = &uniforms
[i
];
1275 /* reserve subroutine locations */
1276 for (unsigned i
= 0; i
< num_uniforms
; i
++) {
1278 if (!uniforms
[i
].type
->is_subroutine())
1280 const unsigned entries
= MAX2(1, uniforms
[i
].array_elements
);
1282 if (uniforms
[i
].remap_location
!= UNMAPPED_UNIFORM_LOC
)
1284 for (unsigned j
= 0; j
< MESA_SHADER_STAGES
; j
++) {
1285 struct gl_shader
*sh
= prog
->_LinkedShaders
[j
];
1289 if (!uniforms
[i
].opaque
[j
].active
)
1292 sh
->SubroutineUniformRemapTable
=
1294 sh
->SubroutineUniformRemapTable
,
1295 gl_uniform_storage
*,
1296 sh
->NumSubroutineUniformRemapTable
+ entries
);
1298 for (unsigned k
= 0; k
< entries
; k
++)
1299 sh
->SubroutineUniformRemapTable
[sh
->NumSubroutineUniformRemapTable
+ k
] = &uniforms
[i
];
1300 uniforms
[i
].remap_location
= sh
->NumSubroutineUniformRemapTable
;
1301 sh
->NumSubroutineUniformRemapTable
+= entries
;
1306 for (unsigned i
= 0; i
< num_uniforms
; i
++) {
1307 assert(uniforms
[i
].storage
!= NULL
|| uniforms
[i
].builtin
);
1310 assert(parcel
.values
== data_end
);
1313 prog
->NumUniformStorage
= num_uniforms
;
1314 prog
->NumHiddenUniforms
= hidden_uniforms
;
1315 prog
->UniformStorage
= uniforms
;
1317 link_set_uniform_initializers(prog
, boolean_true
);