Lines Matching refs:clause
32 bi_pack_header(bi_clause *clause, bi_clause *next_1, bi_clause *next_2) in bi_pack_header() argument
43 if (clause->message_type == BIFROST_MESSAGE_BARRIER) in bi_pack_header()
52 BIFROST_FLOW_END : clause->flow_control, in bi_pack_header()
53 .terminate_discarded_threads = clause->td, in bi_pack_header()
54 .next_clause_prefetch = clause->next_clause_prefetch && next_1, in bi_pack_header()
56 .staging_register = clause->staging_register, in bi_pack_header()
58 .dependency_slot = clause->scoreboard_id, in bi_pack_header()
59 .message_type = clause->message_type, in bi_pack_header()
61 .flush_to_zero = clause->ftz ? BIFROST_FTZ_ALWAYS : BIFROST_FTZ_DISABLE in bi_pack_header()
321 bi_pack_tuple(bi_clause *clause, bi_tuple *tuple, bi_tuple *prev, bool first_tuple, gl_shader_stage… in bi_pack_tuple() argument
353 clause->staging_register = add->src[0].value; in bi_pack_tuple()
359 clause->staging_register = add->dest[0].value; in bi_pack_tuple()
384 bi_clause *clause = list_last_entry(&block->clauses, bi_clause, link); in bi_assign_branch_offset() local
385 bi_instr *br = bi_last_instr_in_clause(clause); in bi_assign_branch_offset()
391 int32_t qwords = bi_block_offset(ctx, clause, br->branch_target); in bi_assign_branch_offset()
402 assert(clause->pcrel_idx < 8); in bi_assign_branch_offset()
403 clause->constants[clause->pcrel_idx] |= ((uint64_t) raw) << 32ull; in bi_assign_branch_offset()
638 bi_pack_clause(bi_context *ctx, bi_clause *clause, in bi_pack_clause() argument
644 for (unsigned i = 0; i < clause->tuple_count; ++i) { in bi_pack_clause()
645 unsigned prev = ((i == 0) ? clause->tuple_count : i) - 1; in bi_pack_clause()
646 ins[i] = bi_pack_tuple(clause, &clause->tuples[i], in bi_pack_clause()
647 &clause->tuples[prev], i == 0, stage); in bi_pack_clause()
649 bi_instr *add = clause->tuples[i].add; in bi_pack_clause()
660 bool ec0_packed = bi_ec0_packed(clause->tuple_count); in bi_pack_clause()
663 clause->constant_count = MAX2(clause->constant_count, 1); in bi_pack_clause()
666 DIV_ROUND_UP(clause->constant_count - (ec0_packed ? 1 : 0), 2); in bi_pack_clause()
668 uint64_t header = bi_pack_header(clause, next_1, next_2); in bi_pack_clause()
669 uint64_t ec0 = (clause->constants[0] >> 4); in bi_pack_clause()
670 unsigned m0 = (clause->pcrel_idx == 0) ? 4 : 0; in bi_pack_clause()
687 unsigned count = counts[clause->tuple_count - 1]; in bi_pack_clause()
690 ASSERTED unsigned idx = indices[clause->tuple_count - 1][pos]; in bi_pack_clause()
698 bi_pack_format(emission, indices[clause->tuple_count - 1][pos], in bi_pack_clause()
699 ins, clause->tuple_count, header, ec0, m0, in bi_pack_clause()
706 bi_pack_constants(clause->tuple_count, clause->constants, in bi_pack_clause()
713 const bi_clause *clause) in bi_collect_blend_ret_addr() argument
719 const bi_tuple *tuple = &clause->tuples[clause->tuple_count - 1]; in bi_collect_blend_ret_addr()
742 bi_foreach_clause_in_block(block, clause) { in bi_pack()
743 bool is_last = (clause->link.next == &block->clauses); in bi_pack()
755 next = bi_next_clause(ctx, block, clause); in bi_pack()
761 bi_pack_clause(ctx, clause, next, next_2, emission, ctx->stage); in bi_pack()
764 bi_collect_blend_ret_addr(ctx, emission, clause); in bi_pack()