Lines Matching defs:add
76 bi_instr *add;
324 bi_instr *pinstr = tuple->add;
347 bi_instr *pinstr = tuple->add;
366 bi_instr *pinstr = tuple->add;
387 bi_instr *pinstr = tuple->add;
407 bi_instr *add = tuple->add;
408 bi_builder b = bi_init_builder(ctx, bi_before_instr(add));
411 add->src[0], add->table);
412 add->src[0] = dtsel->dest[0];
414 assert(bi_supports_dtsel(add));
565 return bi_opcode_props[ins->op].add;
867 /* Given an in-progress tuple, a candidate new instruction to add to the tuple,
939 bi_has_staging_passthrough_hazard(bi_index fma, bi_instr *add)
941 bi_foreach_src(add, s) {
942 bi_index src = add->src[s];
947 unsigned count = bi_count_read_registers(add, s);
953 if (read && !bi_reads_t(add, s))
1104 if (tuple->add && bi_has_staging_passthrough_hazard(instr->dest[0], tuple->add))
1130 bool can_spill_to_moves = (!tuple->add);
1140 tuple->add ? tuple->add->dest[0] : bi_null(),
1243 if (tuple->add && tuple->add->op == BI_OPCODE_CUBEFACE)
1245 else if (tuple->add && tuple->add->op == BI_OPCODE_ATOM_RETURN_I32)
1247 else if (tuple->add && tuple->add->op == BI_OPCODE_ATOM1_RETURN_I32)
1249 else if (tuple->add && tuple->add->op == BI_OPCODE_SEG_ADD_I64)
1251 else if (tuple->add && tuple->add->table)
1271 if ((bifrost_debug & BIFROST_DBG_NOSCHED) && tuple->add)
1337 bool sr_read = succ.add ? bi_opcode_props[succ.add->op].sr_read : false;
1339 if (prec.add) {
1340 bi_use_passthrough(succ.fma, prec.add->dest[0], BIFROST_SRC_PASS_ADD, false);
1341 bi_use_passthrough(succ.add, prec.add->dest[0], BIFROST_SRC_PASS_ADD, sr_read);
1346 bi_use_passthrough(succ.add, prec.fma->dest[0], BIFROST_SRC_PASS_FMA, sr_read);
1421 .pcrel = tuple->add && tuple->add->branch_target,
1711 tuple_state.add = bi_take_instr(ctx, st, &clause_state, &tuple_state, live_after_temp, false);
1713 tuple->add = tuple_state.add;
1716 if (tuple->add)
1717 *live = bi_postra_liveness_ins(*live, tuple->add);
1727 if (tuple->add && bi_must_message(tuple->add)) {
1732 bi_message_type_for_instr(tuple->add);
1733 clause->message = tuple->add;
1739 switch (tuple->add->op) {
1777 bi_use_passthrough(tuple->add, tuple->fma->dest[0],
1781 /* Don't add an empty tuple, unless the worklist has nothing
1791 if (!(tuple->fma || tuple->add || insert_empty))
1872 bi_instr *last = clause->tuples[max_tuples - 1].add;