2 * Copyright (C) 2020 Collabora, Ltd.
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
26 /* This file contains the final passes of the compiler. Running after
27 * scheduling and RA, the IR is now finalized, so we need to emit it to actual
28 * bits on the wire (as well as fixup branches) */
31 bi_pack_header(bi_clause
*clause
, bi_clause
*next
)
33 struct bifrost_header header
= {
35 .no_end_of_shader
= (next
!= NULL
),
39 memcpy(&u
, &header
, sizeof(header
));
43 /* Represents the assignment of ports for a given bundle */
46 /* Register to assign to each port */
49 /* Read ports can be disabled */
52 /* Should we write FMA? what about ADD? If only a single port is
53 * enabled it is in port 2, else ADD/FMA is 2/3 respectively */
54 bool write_fma
, write_add
;
56 /* Should we read with port 3? */
59 /* Packed uniform/constant */
60 unsigned uniform_constant
;
62 /* Whether writes are actually for the last instruction */
63 bool first_instruction
;
66 /* Determines the register control field, ignoring the first? flag */
68 static enum bifrost_reg_control
69 bi_pack_register_ctrl_lo(struct bi_registers r
)
73 assert(!r
.read_port3
);
74 return BIFROST_WRITE_ADD_P2_FMA_P3
;
77 return BIFROST_WRITE_FMA_P2_READ_P3
;
79 return BIFROST_WRITE_FMA_P2
;
81 } else if (r
.write_add
) {
83 return BIFROST_WRITE_ADD_P2_READ_P3
;
85 return BIFROST_WRITE_ADD_P2
;
86 } else if (r
.read_port3
)
87 return BIFROST_READ_P3
;
89 return BIFROST_REG_NONE
;
92 /* Ditto but account for the first? flag this time */
94 static enum bifrost_reg_control
95 bi_pack_register_ctrl(struct bi_registers r
)
97 enum bifrost_reg_control ctrl
= bi_pack_register_ctrl_lo(r
);
99 if (r
.first_instruction
) {
100 if (ctrl
== BIFROST_REG_NONE
)
101 ctrl
= BIFROST_FIRST_NONE
;
103 ctrl
|= BIFROST_FIRST_NONE
;
110 bi_pack_registers(struct bi_registers regs
)
117 bi_pack_fma(bi_clause
*clause
, bi_bundle bundle
)
120 return BIFROST_FMA_NOP
;
124 bi_pack_add(bi_clause
*clause
, bi_bundle bundle
)
127 return BIFROST_ADD_NOP
;
130 struct bi_packed_bundle
{
135 static struct bi_packed_bundle
136 bi_pack_bundle(bi_clause
*clause
, bi_bundle bundle
)
138 unsigned reg
= /*bi_pack_registers(clause, bundle)*/0;
139 uint64_t fma
= bi_pack_fma(clause
, bundle
);
140 uint64_t add
= bi_pack_add(clause
, bundle
);
142 struct bi_packed_bundle packed
= {
143 .lo
= reg
| (fma
<< 35) | ((add
& 0b111111) << 58),
151 bi_pack_clause(bi_context
*ctx
, bi_clause
*clause
, bi_clause
*next
,
152 struct util_dynarray
*emission
)
154 struct bi_packed_bundle ins_1
= bi_pack_bundle(clause
, clause
->bundles
[0]);
155 assert(clause
->bundle_count
== 1);
157 struct bifrost_fmt1 quad_1
= {
158 .tag
= BIFROST_FMT1_FINAL
,
159 .header
= bi_pack_header(clause
, next
),
161 .ins_2
= ins_1
.hi
& ((1 << 11) - 1),
162 .ins_0
= (ins_1
.hi
>> 11) & 0b111,
165 util_dynarray_append(emission
, struct bifrost_fmt1
, quad_1
);
169 bi_next_clause(bi_context
*ctx
, pan_block
*block
, bi_clause
*clause
)
171 /* Try the next clause in this block */
172 if (clause
->link
.next
!= &((bi_block
*) block
)->clauses
)
173 return list_first_entry(&(clause
->link
), bi_clause
, link
);
175 /* Try the next block, or the one after that if it's empty, etc .*/
176 pan_block
*next_block
= pan_next_block(block
);
178 bi_foreach_block_from(ctx
, next_block
, block
) {
179 bi_block
*blk
= (bi_block
*) block
;
181 if (!list_is_empty(&blk
->clauses
))
182 return list_first_entry(&(blk
->clauses
), bi_clause
, link
);
189 bi_pack(bi_context
*ctx
, struct util_dynarray
*emission
)
191 util_dynarray_init(emission
, NULL
);
193 bi_foreach_block(ctx
, _block
) {
194 bi_block
*block
= (bi_block
*) _block
;
196 bi_foreach_clause_in_block(block
, clause
) {
197 bi_clause
*next
= bi_next_clause(ctx
, _block
, clause
);
198 bi_pack_clause(ctx
, clause
, next
, emission
);