2 * Copyright 2013 Vadim Girlin <vadimgirlin@gmail.com>
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 * on the rights to use, copy, modify, merge, publish, distribute, sub
8 * license, and/or sell copies of the Software, and to permit persons to whom
9 * the 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 NON-INFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHOR(S) AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM,
19 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
20 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
21 * USE OR OTHER DEALINGS IN THE SOFTWARE.
30 #define FBC_DUMP(q) do { q } while (0)
36 #include "sb_shader.h"
41 int bc_finalizer::run() {
45 regions_vec
&rv
= sh
.get_regions();
46 for (regions_vec::reverse_iterator I
= rv
.rbegin(), E
= rv
.rend(); I
!= E
;
52 bool loop
= r
->is_loop();
64 // workaround for some problems on r6xx/7xx
65 // add ALU NOP to each vertex shader
66 if (!ctx
.is_egcm() && (sh
.target
== TARGET_VS
|| sh
.target
== TARGET_ES
)) {
67 cf_node
*c
= sh
.create_clause(NST_ALU_CLAUSE
);
69 alu_group_node
*g
= sh
.create_alu_group();
71 alu_node
*a
= sh
.create_alu();
72 a
->bc
.set_op(ALU_OP0_NOP
);
78 sh
.root
->push_back(c
);
80 c
= sh
.create_cf(CF_OP_NOP
);
81 sh
.root
->push_back(c
);
86 if (!ctx
.is_cayman() && last_cf
->bc
.op_ptr
->flags
& CF_ALU
) {
87 last_cf
= sh
.create_cf(CF_OP_NOP
);
88 sh
.root
->push_back(last_cf
);
91 if (ctx
.is_cayman()) {
93 cf_node
*c
= sh
.create_cf(CF_OP_CF_END
);
94 sh
.root
->push_back(c
);
96 last_cf
->insert_after(sh
.create_cf(CF_OP_CF_END
));
98 last_cf
->bc
.end_of_program
= 1;
100 for (unsigned t
= EXP_PIXEL
; t
< EXP_TYPE_COUNT
; ++t
) {
101 cf_node
*le
= last_export
[t
];
103 le
->bc
.set_op(CF_OP_EXPORT_DONE
);
111 void bc_finalizer::finalize_loop(region_node
* r
) {
115 cf_node
*loop_start
= sh
.create_cf(CF_OP_LOOP_START_DX10
);
116 cf_node
*loop_end
= sh
.create_cf(CF_OP_LOOP_END
);
118 loop_start
->jump_after(loop_end
);
119 loop_end
->jump_after(loop_start
);
121 for (depart_vec::iterator I
= r
->departs
.begin(), E
= r
->departs
.end();
123 depart_node
*dep
= *I
;
124 cf_node
*loop_break
= sh
.create_cf(CF_OP_LOOP_BREAK
);
125 loop_break
->jump(loop_end
);
126 dep
->push_back(loop_break
);
130 // FIXME produces unnecessary LOOP_CONTINUE
131 for (repeat_vec::iterator I
= r
->repeats
.begin(), E
= r
->repeats
.end();
133 repeat_node
*rep
= *I
;
134 if (!(rep
->parent
== r
&& rep
->prev
== NULL
)) {
135 cf_node
*loop_cont
= sh
.create_cf(CF_OP_LOOP_CONTINUE
);
136 loop_cont
->jump(loop_end
);
137 rep
->push_back(loop_cont
);
142 r
->push_front(loop_start
);
143 r
->push_back(loop_end
);
146 void bc_finalizer::finalize_if(region_node
* r
) {
150 // expecting the following control flow structure here:
153 // - depart/repeat 1 (it may be depart/repeat for some outer region)
157 // - depart/repeat 2 (possibly for outer region)
159 // - some optional code
162 // - optional <else> code> ...
166 container_node
*repdep1
= static_cast<container_node
*>(r
->first
);
167 assert(repdep1
->is_depart() || repdep1
->is_repeat());
169 if_node
*n_if
= static_cast<if_node
*>(repdep1
->first
);
174 assert(n_if
->is_if());
176 container_node
*repdep2
= static_cast<container_node
*>(n_if
->first
);
177 assert(repdep2
->is_depart() || repdep2
->is_repeat());
179 cf_node
*if_jump
= sh
.create_cf(CF_OP_JUMP
);
180 cf_node
*if_pop
= sh
.create_cf(CF_OP_POP
);
182 if_pop
->bc
.pop_count
= 1;
183 if_pop
->jump_after(if_pop
);
185 r
->push_front(if_jump
);
186 r
->push_back(if_pop
);
188 bool has_else
= n_if
->next
;
191 cf_node
*nelse
= sh
.create_cf(CF_OP_ELSE
);
192 n_if
->insert_after(nelse
);
193 if_jump
->jump(nelse
);
194 nelse
->jump_after(if_pop
);
195 nelse
->bc
.pop_count
= 1;
198 if_jump
->jump_after(if_pop
);
199 if_jump
->bc
.pop_count
= 1;
205 for (depart_vec::iterator I
= r
->departs
.begin(), E
= r
->departs
.end();
210 assert(r
->repeats
.empty());
213 void bc_finalizer::run_on(container_node
* c
) {
215 for (node_iterator I
= c
->begin(), E
= c
->end(); I
!= E
; ++I
) {
218 if (n
->is_alu_group()) {
219 finalize_alu_group(static_cast<alu_group_node
*>(n
));
221 if (n
->is_alu_clause()) {
222 cf_node
*c
= static_cast<cf_node
*>(n
);
224 if (c
->bc
.op
== CF_OP_ALU_PUSH_BEFORE
&& ctx
.is_egcm()) {
225 if (ctx
.stack_workaround_8xx
) {
226 region_node
*r
= c
->get_parent_region();
229 unsigned elems
= get_stack_depth(r
, loops
, ifs
);
230 unsigned dmod1
= elems
% ctx
.stack_entry_size
;
231 unsigned dmod2
= (elems
+ 1) % ctx
.stack_entry_size
;
233 if (elems
&& (!dmod1
|| !dmod2
))
234 c
->flags
|= NF_ALU_STACK_WORKAROUND
;
236 } else if (ctx
.stack_workaround_9xx
) {
237 region_node
*r
= c
->get_parent_region();
240 get_stack_depth(r
, loops
, ifs
);
242 c
->flags
|= NF_ALU_STACK_WORKAROUND
;
246 } else if (n
->is_fetch_inst()) {
247 finalize_fetch(static_cast<fetch_node
*>(n
));
248 } else if (n
->is_cf_inst()) {
249 finalize_cf(static_cast<cf_node
*>(n
));
251 if (n
->is_container())
252 run_on(static_cast<container_node
*>(n
));
257 void bc_finalizer::finalize_alu_group(alu_group_node
* g
) {
259 alu_node
*last
= NULL
;
261 for (node_iterator I
= g
->begin(), E
= g
->end(); I
!= E
; ++I
) {
262 alu_node
*n
= static_cast<alu_node
*>(*I
);
263 unsigned slot
= n
->bc
.slot
;
265 value
*d
= n
->dst
.empty() ? NULL
: n
->dst
[0];
267 if (d
&& d
->is_special_reg()) {
268 assert(n
->bc
.op_ptr
->flags
& AF_MOVA
);
272 sel_chan fdst
= d
? d
->get_final_gpr() : sel_chan(0, 0);
275 assert(fdst
.chan() == slot
|| slot
== SLOT_TRANS
);
278 n
->bc
.dst_gpr
= fdst
.sel();
279 n
->bc
.dst_chan
= d
? fdst
.chan() : slot
< SLOT_TRANS
? slot
: 0;
282 if (d
&& d
->is_rel() && d
->rel
&& !d
->rel
->is_const()) {
284 update_ngpr(d
->array
->gpr
.sel() + d
->array
->array_size
-1);
289 n
->bc
.write_mask
= d
!= NULL
;
292 if (n
->bc
.op_ptr
->flags
& AF_PRED
) {
293 n
->bc
.update_pred
= (n
->dst
[1] != NULL
);
294 n
->bc
.update_exec_mask
= (n
->dst
[2] != NULL
);
297 // FIXME handle predication here
298 n
->bc
.pred_sel
= PRED_SEL_OFF
;
300 update_ngpr(n
->bc
.dst_gpr
);
302 finalize_alu_src(g
, n
);
310 void bc_finalizer::finalize_alu_src(alu_group_node
* g
, alu_node
* a
) {
314 sblog
<< "finalize_alu_src: ";
321 for (vvec::iterator I
= sv
.begin(), E
= sv
.end(); I
!= E
; ++I
, ++si
) {
325 bc_alu_src
&src
= a
->bc
.src
[si
];
333 sc
= v
->get_final_gpr();
335 src
.chan
= sc
.chan();
336 if (!v
->rel
->is_const()) {
338 update_ngpr(v
->array
->gpr
.sel() + v
->array
->array_size
-1);
344 gpr
= v
->get_final_gpr();
346 src
.chan
= gpr
.chan();
347 update_ngpr(src
.sel
);
350 src
.sel
= v
->gpr
.sel();
351 src
.chan
= v
->gpr
.chan();
352 update_ngpr(src
.sel
);
356 literal lv
= v
->literal_value
;
359 if (lv
== literal(0))
361 else if (lv
== literal(0.5f
))
362 src
.sel
= ALU_SRC_0_5
;
363 else if (lv
== literal(1.0f
))
365 else if (lv
== literal(1))
366 src
.sel
= ALU_SRC_1_INT
;
367 else if (lv
== literal(-1))
368 src
.sel
= ALU_SRC_M_1_INT
;
370 src
.sel
= ALU_SRC_LITERAL
;
371 src
.chan
= g
->literal_chan(lv
);
377 cf_node
*clause
= static_cast<cf_node
*>(g
->parent
);
378 assert(clause
->is_alu_clause());
379 sel_chan k
= translate_kcache(clause
, v
);
381 assert(k
&& "kcache translation failed");
388 case VLK_SPECIAL_CONST
:
389 src
.sel
= v
->select
.sel();
390 src
.chan
= v
->select
.chan();
393 assert(!"unknown value kind");
399 a
->bc
.src
[si
++].sel
= 0;
403 void bc_finalizer::copy_fetch_src(fetch_node
&dst
, fetch_node
&src
, unsigned arg_start
)
407 for (unsigned chan
= 0; chan
< 4; ++chan
) {
409 dst
.bc
.dst_sel
[chan
] = SEL_MASK
;
411 unsigned sel
= SEL_MASK
;
413 value
*v
= src
.src
[arg_start
+ chan
];
415 if (!v
|| v
->is_undef()) {
417 } else if (v
->is_const()) {
418 literal l
= v
->literal_value
;
421 else if (l
== literal(1.0f
))
424 sblog
<< "invalid fetch constant operand " << chan
<< " ";
430 } else if (v
->is_any_gpr()) {
431 unsigned vreg
= v
->gpr
.sel();
432 unsigned vchan
= v
->gpr
.chan();
436 else if ((unsigned)reg
!= vreg
) {
437 sblog
<< "invalid fetch source operand " << chan
<< " ";
446 sblog
<< "invalid fetch source operand " << chan
<< " ";
452 dst
.bc
.src_sel
[chan
] = sel
;
458 dst
.bc
.src_gpr
= reg
>= 0 ? reg
: 0;
461 void bc_finalizer::emit_set_grad(fetch_node
* f
) {
463 assert(f
->src
.size() == 12);
464 unsigned ops
[2] = { FETCH_OP_SET_GRADIENTS_V
, FETCH_OP_SET_GRADIENTS_H
};
466 unsigned arg_start
= 0;
468 for (unsigned op
= 0; op
< 2; ++op
) {
469 fetch_node
*n
= sh
.create_fetch();
470 n
->bc
.set_op(ops
[op
]);
474 copy_fetch_src(*n
, *f
, arg_start
);
481 void bc_finalizer::emit_set_texture_offsets(fetch_node
&f
) {
482 assert(f
.src
.size() == 8);
484 fetch_node
*n
= sh
.create_fetch();
486 n
->bc
.set_op(FETCH_OP_SET_TEXTURE_OFFSETS
);
488 copy_fetch_src(*n
, f
, 4);
493 void bc_finalizer::finalize_fetch(fetch_node
* f
) {
499 unsigned src_count
= 4;
501 unsigned flags
= f
->bc
.op_ptr
->flags
;
503 if (flags
& FF_VTX
) {
505 } else if (flags
& FF_USEGRAD
) {
507 } else if (flags
& FF_USE_TEXTURE_OFFSETS
) {
508 emit_set_texture_offsets(*f
);
511 for (unsigned chan
= 0; chan
< src_count
; ++chan
) {
513 unsigned sel
= f
->bc
.src_sel
[chan
];
518 value
*v
= f
->src
[chan
];
522 } else if (v
->is_const()) {
523 literal l
= v
->literal_value
;
526 else if (l
== literal(1.0f
))
529 sblog
<< "invalid fetch constant operand " << chan
<< " ";
535 } else if (v
->is_any_gpr()) {
536 unsigned vreg
= v
->gpr
.sel();
537 unsigned vchan
= v
->gpr
.chan();
541 else if ((unsigned)reg
!= vreg
) {
542 sblog
<< "invalid fetch source operand " << chan
<< " ";
551 sblog
<< "invalid fetch source operand " << chan
<< " ";
557 f
->bc
.src_sel
[chan
] = sel
;
563 f
->bc
.src_gpr
= reg
>= 0 ? reg
: 0;
569 unsigned dst_swz
[4] = {SEL_MASK
, SEL_MASK
, SEL_MASK
, SEL_MASK
};
571 for (unsigned chan
= 0; chan
< 4; ++chan
) {
573 unsigned sel
= f
->bc
.dst_sel
[chan
];
578 value
*v
= f
->dst
[chan
];
582 if (v
->is_any_gpr()) {
583 unsigned vreg
= v
->gpr
.sel();
584 unsigned vchan
= v
->gpr
.chan();
588 else if ((unsigned)reg
!= vreg
) {
589 sblog
<< "invalid fetch dst operand " << chan
<< " ";
595 dst_swz
[vchan
] = sel
;
598 sblog
<< "invalid fetch dst operand " << chan
<< " ";
606 for (unsigned i
= 0; i
< 4; ++i
)
607 f
->bc
.dst_sel
[i
] = dst_swz
[i
];
614 f
->bc
.dst_gpr
= reg
>= 0 ? reg
: 0;
617 void bc_finalizer::finalize_cf(cf_node
* c
) {
619 unsigned flags
= c
->bc
.op_ptr
->flags
;
621 c
->bc
.end_of_program
= 0;
624 if (flags
& CF_EXP
) {
625 c
->bc
.set_op(CF_OP_EXPORT
);
626 last_export
[c
->bc
.type
] = c
;
630 for (unsigned chan
= 0; chan
< 4; ++chan
) {
632 unsigned sel
= c
->bc
.sel
[chan
];
637 value
*v
= c
->src
[chan
];
641 } else if (v
->is_const()) {
642 literal l
= v
->literal_value
;
645 else if (l
== literal(1.0f
))
648 sblog
<< "invalid export constant operand " << chan
<< " ";
654 } else if (v
->is_any_gpr()) {
655 unsigned vreg
= v
->gpr
.sel();
656 unsigned vchan
= v
->gpr
.chan();
660 else if ((unsigned)reg
!= vreg
) {
661 sblog
<< "invalid export source operand " << chan
<< " ";
670 sblog
<< "invalid export source operand " << chan
<< " ";
676 c
->bc
.sel
[chan
] = sel
;
682 c
->bc
.rw_gpr
= reg
>= 0 ? reg
: 0;
684 } else if (flags
& CF_MEM
) {
689 for (unsigned chan
= 0; chan
< 4; ++chan
) {
690 value
*v
= c
->src
[chan
];
691 if (!v
|| v
->is_undef())
694 if (!v
->is_any_gpr() || v
->gpr
.chan() != chan
) {
695 sblog
<< "invalid source operand " << chan
<< " ";
700 unsigned vreg
= v
->gpr
.sel();
703 else if ((unsigned)reg
!= vreg
) {
704 sblog
<< "invalid source operand " << chan
<< " ";
713 assert(reg
>= 0 && mask
);
718 c
->bc
.rw_gpr
= reg
>= 0 ? reg
: 0;
719 c
->bc
.comp_mask
= mask
;
721 if (((flags
& CF_RAT
) || (!(flags
& CF_STRM
))) && (c
->bc
.type
& 1)) {
725 for (unsigned chan
= 0; chan
< 4; ++chan
) {
726 value
*v
= c
->src
[4 + chan
];
727 if (!v
|| v
->is_undef())
730 if (!v
->is_any_gpr() || v
->gpr
.chan() != chan
) {
731 sblog
<< "invalid source operand " << chan
<< " ";
736 unsigned vreg
= v
->gpr
.sel();
739 else if ((unsigned)reg
!= vreg
) {
740 sblog
<< "invalid source operand " << chan
<< " ";
752 c
->bc
.index_gpr
= reg
>= 0 ? reg
: 0;
754 } else if (flags
& CF_CALL
) {
755 update_nstack(c
->get_parent_region(), ctx
.wavefront_size
== 16 ? 2 : 1);
759 sel_chan
bc_finalizer::translate_kcache(cf_node
* alu
, value
* v
) {
760 unsigned sel
= v
->select
.sel();
761 unsigned bank
= sel
>> 12;
762 unsigned chan
= v
->select
.chan();
763 static const unsigned kc_base
[] = {128, 160, 256, 288};
767 unsigned line
= sel
>> 4;
769 for (unsigned k
= 0; k
< 4; ++k
) {
770 bc_kcache
&kc
= alu
->bc
.kc
[k
];
772 if (kc
.mode
== KC_LOCK_NONE
)
775 if (kc
.bank
== bank
&& (kc
.addr
== line
||
776 (kc
.mode
== KC_LOCK_2
&& kc
.addr
+ 1 == line
))) {
778 sel
= kc_base
[k
] + (sel
- (kc
.addr
<< 4));
780 return sel_chan(sel
, chan
);
784 assert(!"kcache translation error");
788 void bc_finalizer::update_ngpr(unsigned gpr
) {
789 if (gpr
< MAX_GPR
- ctx
.alu_temp_gprs
&& gpr
>= ngpr
)
793 unsigned bc_finalizer::get_stack_depth(node
*n
, unsigned &loops
,
794 unsigned &ifs
, unsigned add
) {
795 unsigned stack_elements
= add
;
796 bool has_non_wqm_push
= (add
!= 0);
797 region_node
*r
= n
->is_region() ?
798 static_cast<region_node
*>(n
) : n
->get_parent_region();
808 has_non_wqm_push
= true;
810 r
= r
->get_parent_region();
812 stack_elements
+= (loops
* ctx
.stack_entry_size
) + ifs
;
814 // reserve additional elements in some cases
815 switch (ctx
.hw_class
) {
818 // If any non-WQM push is invoked, 2 elements should be reserved.
819 if (has_non_wqm_push
)
822 case HW_CLASS_CAYMAN
:
823 // If any stack operation is invoked, 2 elements should be reserved
827 case HW_CLASS_EVERGREEN
:
828 // According to the docs we need to reserve 1 element for each of the
830 // 1) non-WQM push is used with WQM/LOOP frames on stack
831 // 2) ALU_ELSE_AFTER is used at the point of max stack usage
833 // It was found that the conditions above are not sufficient, there are
834 // other cases where we also need to reserve stack space, that's why
835 // we always reserve 1 stack element if we have non-WQM push on stack.
836 // Condition 2 is ignored for now because we don't use this instruction.
837 if (has_non_wqm_push
)
840 case HW_CLASS_UNKNOWN
:
843 return stack_elements
;
846 void bc_finalizer::update_nstack(region_node
* r
, unsigned add
) {
849 unsigned elems
= r
? get_stack_depth(r
, loops
, ifs
, add
) : add
;
851 // XXX all chips expect this value to be computed using 4 as entry size,
852 // not the real entry size
853 unsigned stack_entries
= (elems
+ 3) >> 2;
855 if (nstack
< stack_entries
)
856 nstack
= stack_entries
;
859 void bc_finalizer::cf_peephole() {
860 if (ctx
.stack_workaround_8xx
|| ctx
.stack_workaround_9xx
) {
861 for (node_iterator N
, I
= sh
.root
->begin(), E
= sh
.root
->end(); I
!= E
;
864 cf_node
*c
= static_cast<cf_node
*>(*I
);
866 if (c
->bc
.op
== CF_OP_ALU_PUSH_BEFORE
&&
867 (c
->flags
& NF_ALU_STACK_WORKAROUND
)) {
868 cf_node
*push
= sh
.create_cf(CF_OP_PUSH
);
869 c
->insert_before(push
);
871 c
->bc
.set_op(CF_OP_ALU
);
876 for (node_iterator N
, I
= sh
.root
->begin(), E
= sh
.root
->end(); I
!= E
;
880 cf_node
*c
= static_cast<cf_node
*>(*I
);
882 if (c
->jump_after_target
) {
883 c
->jump_target
= static_cast<cf_node
*>(c
->jump_target
->next
);
884 c
->jump_after_target
= false;
887 if (c
->is_cf_op(CF_OP_POP
)) {
889 if (p
->is_alu_clause()) {
890 cf_node
*a
= static_cast<cf_node
*>(p
);
892 if (a
->bc
.op
== CF_OP_ALU
) {
893 a
->bc
.set_op(CF_OP_ALU_POP_AFTER
);
897 } else if (c
->is_cf_op(CF_OP_JUMP
) && c
->jump_target
== c
->next
) {
898 // if JUMP is immediately followed by its jump target,
899 // then JUMP is useless and we can eliminate it
905 } // namespace r600_sb