KonstantinSeurer
/
mesa
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

nir: Slightly simplify algebraic code generation by reusing a struct. 

Reviewed-by: Jason Ekstrand <jason.ekstrand@intel.com>
This commit is contained in:
Eric Anholt 2015-01-27 16:42:38 -08:00
parent 9e35af08af
commit 6706537dd4
1 changed files with 3 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/glsl/nir/nir_algebraic.py
View File

@ -179,10 +179,7 @@ struct transform {
${xform.replace.render()}
% endfor
static const struct {
const nir_search_expression *search;
const nir_search_value *replace;
} ${pass_name}_${opcode}_xforms[] = {
static const struct transform ${pass_name}_${opcode}_xforms[] = {
% for xform in xform_list:
{ &${xform.search.name}, ${xform.replace.c_ptr} },
% endfor
@ -211,8 +208,8 @@ ${pass_name}_block(nir_block *block, void *void_state)
% for opcode in xform_dict.keys():
case nir_op_${opcode}:
for (unsigned i = 0; i < ARRAY_SIZE(${pass_name}_${opcode}_xforms); i++) {
if (nir_replace_instr(alu, ${pass_name}_${opcode}_xforms[i].search,
${pass_name}_${opcode}_xforms[i].replace,
const struct transform *xform = &${pass_name}_${opcode}_xforms[i];
if (nir_replace_instr(alu, xform->search, xform->replace,
state->mem_ctx)) {
state->progress = true;
break;