Lines Matching defs:table

46    const nir_algebraic_table *table;
53 match_expression(const nir_algebraic_table *table, const nir_search_expression *expr, nir_alu_instr *instr,
256 match_value(const nir_algebraic_table *table,
293 return match_expression(table, nir_search_value_as_expression(value),
318 if (var->cond_index != -1 && !table->variable_cond[var->cond_index](state->range_ht, instr,
394 match_expression(const nir_algebraic_table *table, const nir_search_expression *expr, nir_alu_instr *instr,
398 if (expr->cond_index != -1 && !table->expression_cond[expr->cond_index](instr))
445 if (!match_value(table, &state->table->values[expr->srcs[i]].value, instr,
503 alu->src[i] = construct_value(build, &state->table->values[expr->srcs[i]].value,
581 UNUSED static void dump_value(const nir_algebraic_table *table, const nir_search_value *val)
639 dump_value(table, &table->values[expr->srcs[i]].value);
692 const nir_algebraic_table *table,
708 state.pass_op_table = table->pass_op_table;
709 state.table = table;
724 if (match_expression(table, search, instr,
792 nir_algebraic_automaton(ssa_val->parent_instr, states, table->pass_op_table);
800 states, table->pass_op_table);
824 /* Calculate the index into the transition table. Note the index
827 * table.
839 if (*state != tbl->table[index]) {
840 *state = tbl->table[index];
866 const nir_algebraic_table *table,
887 for (const struct transform *xform = &table->transforms[table->transform_offsets[xform_idx]];
891 !(table->values[xform->search].expression.inexact && ignore_inexact) &&
892 nir_replace_instr(build, alu, range_ht, states, table,
893 &table->values[xform->search].expression,
894 &table->values[xform->replace].value, worklist)) {
906 const nir_algebraic_table *table)
931 nir_algebraic_automaton(instr, &states, table->pass_op_table);
957 table, &states, worklist);