linker: Add a last_field parameter to various program_resource_visitor methods

I also considered renaming visit_field(const glsl_struct_field *) to
entry_record and adding an exit_record method.  This would be more
similar to the hierarchical visitor.

Signed-off-by: Ian Romanick <ian.d.romanick@intel.com>
Reviewed-by: Matt Turner <mattst88@gmail.com>
This commit is contained in:
Ian Romanick
2014-07-16 15:37:10 -07:00
parent 46356c46ea
commit 47c6fc5b04
3 changed files with 30 additions and 16 deletions

View File

@@ -68,7 +68,8 @@ private:
} }
virtual void visit_field(const glsl_type *type, const char *name, virtual void visit_field(const glsl_type *type, const char *name,
bool row_major, const glsl_type *record_type) bool row_major, const glsl_type *record_type,
bool last_field)
{ {
assert(this->index < this->num_variables); assert(this->index < this->num_variables);

View File

@@ -63,7 +63,7 @@ program_resource_visitor::process(const glsl_type *type, const char *name)
|| type->without_array()->is_interface()); || type->without_array()->is_interface());
char *name_copy = ralloc_strdup(NULL, name); char *name_copy = ralloc_strdup(NULL, name);
recursion(type, &name_copy, strlen(name), false, NULL); recursion(type, &name_copy, strlen(name), false, NULL, false);
ralloc_free(name_copy); ralloc_free(name_copy);
} }
@@ -108,7 +108,7 @@ program_resource_visitor::process(ir_variable *var)
* lowering is only applied to non-uniform interface blocks, so we * lowering is only applied to non-uniform interface blocks, so we
* can safely pass false for row_major. * can safely pass false for row_major.
*/ */
recursion(var->type, &name, new_length, false, NULL); recursion(var->type, &name, new_length, false, NULL, false);
} }
ralloc_free(name); ralloc_free(name);
} else if (var->data.from_named_ifc_block_nonarray) { } else if (var->data.from_named_ifc_block_nonarray) {
@@ -132,29 +132,30 @@ program_resource_visitor::process(ir_variable *var)
* is only applied to non-uniform interface blocks, so we can safely * is only applied to non-uniform interface blocks, so we can safely
* pass false for row_major. * pass false for row_major.
*/ */
recursion(var->type, &name, strlen(name), false, NULL); recursion(var->type, &name, strlen(name), false, NULL, false);
ralloc_free(name); ralloc_free(name);
} else if (t->without_array()->is_record()) { } else if (t->without_array()->is_record()) {
char *name = ralloc_strdup(NULL, var->name); char *name = ralloc_strdup(NULL, var->name);
recursion(var->type, &name, strlen(name), false, NULL); recursion(var->type, &name, strlen(name), false, NULL, false);
ralloc_free(name); ralloc_free(name);
} else if (t->is_interface()) { } else if (t->is_interface()) {
char *name = ralloc_strdup(NULL, var->type->name); char *name = ralloc_strdup(NULL, var->type->name);
recursion(var->type, &name, strlen(name), false, NULL); recursion(var->type, &name, strlen(name), false, NULL, false);
ralloc_free(name); ralloc_free(name);
} else if (t->is_array() && t->fields.array->is_interface()) { } else if (t->is_array() && t->fields.array->is_interface()) {
char *name = ralloc_strdup(NULL, var->type->fields.array->name); char *name = ralloc_strdup(NULL, var->type->fields.array->name);
recursion(var->type, &name, strlen(name), false, NULL); recursion(var->type, &name, strlen(name), false, NULL, false);
ralloc_free(name); ralloc_free(name);
} else { } else {
this->visit_field(t, var->name, false, NULL); this->visit_field(t, var->name, false, NULL, false);
} }
} }
void void
program_resource_visitor::recursion(const glsl_type *t, char **name, program_resource_visitor::recursion(const glsl_type *t, char **name,
size_t name_length, bool row_major, size_t name_length, bool row_major,
const glsl_type *record_type) const glsl_type *record_type,
bool last_field)
{ {
/* Records need to have each field processed individually. /* Records need to have each field processed individually.
* *
@@ -181,7 +182,8 @@ program_resource_visitor::recursion(const glsl_type *t, char **name,
} }
recursion(t->fields.structure[i].type, name, new_length, recursion(t->fields.structure[i].type, name, new_length,
t->fields.structure[i].row_major, record_type); t->fields.structure[i].row_major, record_type,
(i + 1) == t->length);
/* Only the first leaf-field of the record gets called with the /* Only the first leaf-field of the record gets called with the
* record type pointer. * record type pointer.
@@ -200,7 +202,8 @@ program_resource_visitor::recursion(const glsl_type *t, char **name,
ralloc_asprintf_rewrite_tail(name, &new_length, "[%u]", i); ralloc_asprintf_rewrite_tail(name, &new_length, "[%u]", i);
recursion(t->fields.array, name, new_length, row_major, recursion(t->fields.array, name, new_length, row_major,
record_type); record_type,
(i + 1) == t->length);
/* Only the first leaf-field of the record gets called with the /* Only the first leaf-field of the record gets called with the
* record type pointer. * record type pointer.
@@ -208,14 +211,15 @@ program_resource_visitor::recursion(const glsl_type *t, char **name,
record_type = NULL; record_type = NULL;
} }
} else { } else {
this->visit_field(t, *name, row_major, record_type); this->visit_field(t, *name, row_major, record_type, last_field);
} }
} }
void void
program_resource_visitor::visit_field(const glsl_type *type, const char *name, program_resource_visitor::visit_field(const glsl_type *type, const char *name,
bool row_major, bool row_major,
const glsl_type *) const glsl_type *,
bool /* last_field */)
{ {
visit_field(type, name, row_major); visit_field(type, name, row_major);
} }
@@ -508,7 +512,8 @@ private:
} }
virtual void visit_field(const glsl_type *type, const char *name, virtual void visit_field(const glsl_type *type, const char *name,
bool row_major, const glsl_type *record_type) bool row_major, const glsl_type *record_type,
bool /* last_field */)
{ {
assert(!type->without_array()->is_record()); assert(!type->without_array()->is_record());
assert(!type->without_array()->is_interface()); assert(!type->without_array()->is_interface());

View File

@@ -138,11 +138,15 @@ protected:
* \param name Fully qualified name of the field. * \param name Fully qualified name of the field.
* \param row_major For a matrix type, is it stored row-major. * \param row_major For a matrix type, is it stored row-major.
* \param record_type Type of the record containing the field. * \param record_type Type of the record containing the field.
* \param last_field Set if \c name is the last field of the structure
* containing it. This will always be false for items
* not contained in a structure or interface block.
* *
* The default implementation just calls the other \c visit_field method. * The default implementation just calls the other \c visit_field method.
*/ */
virtual void visit_field(const glsl_type *type, const char *name, virtual void visit_field(const glsl_type *type, const char *name,
bool row_major, const glsl_type *record_type); bool row_major, const glsl_type *record_type,
bool last_field);
/** /**
* Method invoked for each leaf of the variable * Method invoked for each leaf of the variable
@@ -168,9 +172,13 @@ private:
/** /**
* \param name_length Length of the current name \b not including the * \param name_length Length of the current name \b not including the
* terminating \c NUL character. * terminating \c NUL character.
* \param last_field Set if \c name is the last field of the structure
* containing it. This will always be false for items
* not contained in a structure or interface block.
*/ */
void recursion(const glsl_type *t, char **name, size_t name_length, void recursion(const glsl_type *t, char **name, size_t name_length,
bool row_major, const glsl_type *record_type); bool row_major, const glsl_type *record_type,
bool last_field);
}; };
void void