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
) {
113 cf_node
*loop_start
= sh
.create_cf(CF_OP_LOOP_START_DX10
);
114 cf_node
*loop_end
= sh
.create_cf(CF_OP_LOOP_END
);
116 loop_start
->jump_after(loop_end
);
117 loop_end
->jump_after(loop_start
);
119 for (depart_vec::iterator I
= r
->departs
.begin(), E
= r
->departs
.end();
121 depart_node
*dep
= *I
;
122 cf_node
*loop_break
= sh
.create_cf(CF_OP_LOOP_BREAK
);
123 loop_break
->jump(loop_end
);
124 dep
->push_back(loop_break
);
128 // FIXME produces unnecessary LOOP_CONTINUE
129 for (repeat_vec::iterator I
= r
->repeats
.begin(), E
= r
->repeats
.end();
131 repeat_node
*rep
= *I
;
132 if (!(rep
->parent
== r
&& rep
->prev
== NULL
)) {
133 cf_node
*loop_cont
= sh
.create_cf(CF_OP_LOOP_CONTINUE
);
134 loop_cont
->jump(loop_end
);
135 rep
->push_back(loop_cont
);
140 r
->push_front(loop_start
);
141 r
->push_back(loop_end
);
144 void bc_finalizer::finalize_if(region_node
* r
) {
148 // expecting the following control flow structure here:
151 // - depart/repeat 1 (it may be depart/repeat for some outer region)
155 // - depart/repeat 2 (possibly for outer region)
157 // - some optional code
160 // - optional <else> code> ...
164 container_node
*repdep1
= static_cast<container_node
*>(r
->first
);
165 assert(repdep1
->is_depart() || repdep1
->is_repeat());
167 if_node
*n_if
= static_cast<if_node
*>(repdep1
->first
);
172 assert(n_if
->is_if());
174 container_node
*repdep2
= static_cast<container_node
*>(n_if
->first
);
175 assert(repdep2
->is_depart() || repdep2
->is_repeat());
177 cf_node
*if_jump
= sh
.create_cf(CF_OP_JUMP
);
178 cf_node
*if_pop
= sh
.create_cf(CF_OP_POP
);
180 if_pop
->bc
.pop_count
= 1;
181 if_pop
->jump_after(if_pop
);
183 r
->push_front(if_jump
);
184 r
->push_back(if_pop
);
186 bool has_else
= n_if
->next
;
189 cf_node
*nelse
= sh
.create_cf(CF_OP_ELSE
);
190 n_if
->insert_after(nelse
);
191 if_jump
->jump(nelse
);
192 nelse
->jump_after(if_pop
);
193 nelse
->bc
.pop_count
= 1;
196 if_jump
->jump_after(if_pop
);
197 if_jump
->bc
.pop_count
= 1;
203 for (depart_vec::iterator I
= r
->departs
.begin(), E
= r
->departs
.end();
208 assert(r
->repeats
.empty());
211 void bc_finalizer::run_on(container_node
* c
) {
213 for (node_iterator I
= c
->begin(), E
= c
->end(); I
!= E
; ++I
) {
216 if (n
->is_alu_group()) {
217 finalize_alu_group(static_cast<alu_group_node
*>(n
));
219 if (n
->is_alu_clause()) {
220 cf_node
*c
= static_cast<cf_node
*>(n
);
222 if (c
->bc
.op
== CF_OP_ALU_PUSH_BEFORE
&& ctx
.is_egcm()) {
223 if (ctx
.stack_workaround_8xx
) {
224 region_node
*r
= c
->get_parent_region();
227 unsigned elems
= get_stack_depth(r
, loops
, ifs
);
228 unsigned dmod1
= elems
% ctx
.stack_entry_size
;
229 unsigned dmod2
= (elems
+ 1) % ctx
.stack_entry_size
;
231 if (elems
&& (!dmod1
|| !dmod2
))
232 c
->flags
|= NF_ALU_STACK_WORKAROUND
;
234 } else if (ctx
.stack_workaround_9xx
) {
235 region_node
*r
= c
->get_parent_region();
238 get_stack_depth(r
, loops
, ifs
);
240 c
->flags
|= NF_ALU_STACK_WORKAROUND
;
244 } else if (n
->is_fetch_inst()) {
245 finalize_fetch(static_cast<fetch_node
*>(n
));
246 } else if (n
->is_cf_inst()) {
247 finalize_cf(static_cast<cf_node
*>(n
));
249 if (n
->is_container())
250 run_on(static_cast<container_node
*>(n
));
255 void bc_finalizer::finalize_alu_group(alu_group_node
* g
) {
257 alu_node
*last
= NULL
;
259 for (node_iterator I
= g
->begin(), E
= g
->end(); I
!= E
; ++I
) {
260 alu_node
*n
= static_cast<alu_node
*>(*I
);
261 unsigned slot
= n
->bc
.slot
;
263 value
*d
= n
->dst
.empty() ? NULL
: n
->dst
[0];
265 if (d
&& d
->is_special_reg()) {
266 assert(n
->bc
.op_ptr
->flags
& AF_MOVA
);
270 sel_chan fdst
= d
? d
->get_final_gpr() : sel_chan(0, 0);
273 assert(fdst
.chan() == slot
|| slot
== SLOT_TRANS
);
276 n
->bc
.dst_gpr
= fdst
.sel();
277 n
->bc
.dst_chan
= d
? fdst
.chan() : slot
< SLOT_TRANS
? slot
: 0;
280 if (d
&& d
->is_rel() && d
->rel
&& !d
->rel
->is_const()) {
282 update_ngpr(d
->array
->gpr
.sel() + d
->array
->array_size
-1);
287 n
->bc
.write_mask
= d
!= NULL
;
290 if (n
->bc
.op_ptr
->flags
& AF_PRED
) {
291 n
->bc
.update_pred
= (n
->dst
[1] != NULL
);
292 n
->bc
.update_exec_mask
= (n
->dst
[2] != NULL
);
295 // FIXME handle predication here
296 n
->bc
.pred_sel
= PRED_SEL_OFF
;
298 update_ngpr(n
->bc
.dst_gpr
);
300 finalize_alu_src(g
, n
);
308 void bc_finalizer::finalize_alu_src(alu_group_node
* g
, alu_node
* a
) {
312 sblog
<< "finalize_alu_src: ";
319 for (vvec::iterator I
= sv
.begin(), E
= sv
.end(); I
!= E
; ++I
, ++si
) {
323 bc_alu_src
&src
= a
->bc
.src
[si
];
331 sc
= v
->get_final_gpr();
333 src
.chan
= sc
.chan();
334 if (!v
->rel
->is_const()) {
336 update_ngpr(v
->array
->gpr
.sel() + v
->array
->array_size
-1);
342 gpr
= v
->get_final_gpr();
344 src
.chan
= gpr
.chan();
345 update_ngpr(src
.sel
);
348 src
.sel
= v
->gpr
.sel();
349 src
.chan
= v
->gpr
.chan();
350 update_ngpr(src
.sel
);
354 literal lv
= v
->literal_value
;
357 if (lv
== literal(0))
359 else if (lv
== literal(0.5f
))
360 src
.sel
= ALU_SRC_0_5
;
361 else if (lv
== literal(1.0f
))
363 else if (lv
== literal(1))
364 src
.sel
= ALU_SRC_1_INT
;
365 else if (lv
== literal(-1))
366 src
.sel
= ALU_SRC_M_1_INT
;
368 src
.sel
= ALU_SRC_LITERAL
;
369 src
.chan
= g
->literal_chan(lv
);
375 cf_node
*clause
= static_cast<cf_node
*>(g
->parent
);
376 assert(clause
->is_alu_clause());
377 sel_chan k
= translate_kcache(clause
, v
);
379 assert(k
&& "kcache translation failed");
386 case VLK_SPECIAL_CONST
:
387 src
.sel
= v
->select
.sel();
388 src
.chan
= v
->select
.chan();
391 assert(!"unknown value kind");
397 a
->bc
.src
[si
++].sel
= 0;
401 void bc_finalizer::copy_fetch_src(fetch_node
&dst
, fetch_node
&src
, unsigned arg_start
)
405 for (unsigned chan
= 0; chan
< 4; ++chan
) {
407 dst
.bc
.dst_sel
[chan
] = SEL_MASK
;
409 unsigned sel
= SEL_MASK
;
411 value
*v
= src
.src
[arg_start
+ chan
];
413 if (!v
|| v
->is_undef()) {
415 } else if (v
->is_const()) {
416 literal l
= v
->literal_value
;
419 else if (l
== literal(1.0f
))
422 sblog
<< "invalid fetch constant operand " << chan
<< " ";
428 } else if (v
->is_any_gpr()) {
429 unsigned vreg
= v
->gpr
.sel();
430 unsigned vchan
= v
->gpr
.chan();
434 else if ((unsigned)reg
!= vreg
) {
435 sblog
<< "invalid fetch source operand " << chan
<< " ";
444 sblog
<< "invalid fetch source operand " << chan
<< " ";
450 dst
.bc
.src_sel
[chan
] = sel
;
456 dst
.bc
.src_gpr
= reg
>= 0 ? reg
: 0;
459 void bc_finalizer::emit_set_grad(fetch_node
* f
) {
461 assert(f
->src
.size() == 12);
462 unsigned ops
[2] = { FETCH_OP_SET_GRADIENTS_V
, FETCH_OP_SET_GRADIENTS_H
};
464 unsigned arg_start
= 0;
466 for (unsigned op
= 0; op
< 2; ++op
) {
467 fetch_node
*n
= sh
.create_fetch();
468 n
->bc
.set_op(ops
[op
]);
472 copy_fetch_src(*n
, *f
, arg_start
);
479 void bc_finalizer::emit_set_texture_offsets(fetch_node
&f
) {
480 assert(f
.src
.size() == 8);
482 fetch_node
*n
= sh
.create_fetch();
484 n
->bc
.set_op(FETCH_OP_SET_TEXTURE_OFFSETS
);
486 copy_fetch_src(*n
, f
, 4);
491 void bc_finalizer::finalize_fetch(fetch_node
* f
) {
497 unsigned src_count
= 4;
499 unsigned flags
= f
->bc
.op_ptr
->flags
;
501 if (flags
& FF_VTX
) {
503 } else if (flags
& FF_USEGRAD
) {
505 } else if (flags
& FF_USE_TEXTURE_OFFSETS
) {
506 emit_set_texture_offsets(*f
);
509 for (unsigned chan
= 0; chan
< src_count
; ++chan
) {
511 unsigned sel
= f
->bc
.src_sel
[chan
];
516 value
*v
= f
->src
[chan
];
520 } else if (v
->is_const()) {
521 literal l
= v
->literal_value
;
524 else if (l
== literal(1.0f
))
527 sblog
<< "invalid fetch constant operand " << chan
<< " ";
533 } else if (v
->is_any_gpr()) {
534 unsigned vreg
= v
->gpr
.sel();
535 unsigned vchan
= v
->gpr
.chan();
539 else if ((unsigned)reg
!= vreg
) {
540 sblog
<< "invalid fetch source operand " << chan
<< " ";
549 sblog
<< "invalid fetch source operand " << chan
<< " ";
555 f
->bc
.src_sel
[chan
] = sel
;
561 f
->bc
.src_gpr
= reg
>= 0 ? reg
: 0;
567 unsigned dst_swz
[4] = {SEL_MASK
, SEL_MASK
, SEL_MASK
, SEL_MASK
};
569 for (unsigned chan
= 0; chan
< 4; ++chan
) {
571 unsigned sel
= f
->bc
.dst_sel
[chan
];
576 value
*v
= f
->dst
[chan
];
580 if (v
->is_any_gpr()) {
581 unsigned vreg
= v
->gpr
.sel();
582 unsigned vchan
= v
->gpr
.chan();
586 else if ((unsigned)reg
!= vreg
) {
587 sblog
<< "invalid fetch dst operand " << chan
<< " ";
593 dst_swz
[vchan
] = sel
;
596 sblog
<< "invalid fetch dst operand " << chan
<< " ";
604 for (unsigned i
= 0; i
< 4; ++i
)
605 f
->bc
.dst_sel
[i
] = dst_swz
[i
];
612 f
->bc
.dst_gpr
= reg
>= 0 ? reg
: 0;
615 void bc_finalizer::finalize_cf(cf_node
* c
) {
617 unsigned flags
= c
->bc
.op_ptr
->flags
;
619 c
->bc
.end_of_program
= 0;
622 if (flags
& CF_EXP
) {
623 c
->bc
.set_op(CF_OP_EXPORT
);
624 last_export
[c
->bc
.type
] = c
;
628 for (unsigned chan
= 0; chan
< 4; ++chan
) {
630 unsigned sel
= c
->bc
.sel
[chan
];
635 value
*v
= c
->src
[chan
];
639 } else if (v
->is_const()) {
640 literal l
= v
->literal_value
;
643 else if (l
== literal(1.0f
))
646 sblog
<< "invalid export constant operand " << chan
<< " ";
652 } else if (v
->is_any_gpr()) {
653 unsigned vreg
= v
->gpr
.sel();
654 unsigned vchan
= v
->gpr
.chan();
658 else if ((unsigned)reg
!= vreg
) {
659 sblog
<< "invalid export source operand " << chan
<< " ";
668 sblog
<< "invalid export source operand " << chan
<< " ";
674 c
->bc
.sel
[chan
] = sel
;
680 c
->bc
.rw_gpr
= reg
>= 0 ? reg
: 0;
682 } else if (flags
& CF_MEM
) {
687 for (unsigned chan
= 0; chan
< 4; ++chan
) {
688 value
*v
= c
->src
[chan
];
689 if (!v
|| v
->is_undef())
692 if (!v
->is_any_gpr() || v
->gpr
.chan() != chan
) {
693 sblog
<< "invalid source operand " << chan
<< " ";
698 unsigned vreg
= v
->gpr
.sel();
701 else if ((unsigned)reg
!= vreg
) {
702 sblog
<< "invalid source operand " << chan
<< " ";
711 assert(reg
>= 0 && mask
);
716 c
->bc
.rw_gpr
= reg
>= 0 ? reg
: 0;
717 c
->bc
.comp_mask
= mask
;
719 if (((flags
& CF_RAT
) || (!(flags
& CF_STRM
))) && (c
->bc
.type
& 1)) {
723 for (unsigned chan
= 0; chan
< 4; ++chan
) {
724 value
*v
= c
->src
[4 + chan
];
725 if (!v
|| v
->is_undef())
728 if (!v
->is_any_gpr() || v
->gpr
.chan() != chan
) {
729 sblog
<< "invalid source operand " << chan
<< " ";
734 unsigned vreg
= v
->gpr
.sel();
737 else if ((unsigned)reg
!= vreg
) {
738 sblog
<< "invalid source operand " << chan
<< " ";
750 c
->bc
.index_gpr
= reg
>= 0 ? reg
: 0;
752 } else if (flags
& CF_CALL
) {
753 update_nstack(c
->get_parent_region(), ctx
.wavefront_size
== 16 ? 2 : 1);
757 sel_chan
bc_finalizer::translate_kcache(cf_node
* alu
, value
* v
) {
758 unsigned sel
= v
->select
.sel();
759 unsigned bank
= sel
>> 12;
760 unsigned chan
= v
->select
.chan();
761 static const unsigned kc_base
[] = {128, 160, 256, 288};
765 unsigned line
= sel
>> 4;
767 for (unsigned k
= 0; k
< 4; ++k
) {
768 bc_kcache
&kc
= alu
->bc
.kc
[k
];
770 if (kc
.mode
== KC_LOCK_NONE
)
773 if (kc
.bank
== bank
&& (kc
.addr
== line
||
774 (kc
.mode
== KC_LOCK_2
&& kc
.addr
+ 1 == line
))) {
776 sel
= kc_base
[k
] + (sel
- (kc
.addr
<< 4));
778 return sel_chan(sel
, chan
);
782 assert(!"kcache translation error");
786 void bc_finalizer::update_ngpr(unsigned gpr
) {
787 if (gpr
< MAX_GPR
- ctx
.alu_temp_gprs
&& gpr
>= ngpr
)
791 unsigned bc_finalizer::get_stack_depth(node
*n
, unsigned &loops
,
792 unsigned &ifs
, unsigned add
) {
793 unsigned stack_elements
= add
;
794 bool has_non_wqm_push
= (add
!= 0);
795 region_node
*r
= n
->is_region() ?
796 static_cast<region_node
*>(n
) : n
->get_parent_region();
806 has_non_wqm_push
= true;
808 r
= r
->get_parent_region();
810 stack_elements
+= (loops
* ctx
.stack_entry_size
) + ifs
;
812 // reserve additional elements in some cases
813 switch (ctx
.hw_class
) {
816 // If any non-WQM push is invoked, 2 elements should be reserved.
817 if (has_non_wqm_push
)
820 case HW_CLASS_CAYMAN
:
821 // If any stack operation is invoked, 2 elements should be reserved
825 case HW_CLASS_EVERGREEN
:
826 // According to the docs we need to reserve 1 element for each of the
828 // 1) non-WQM push is used with WQM/LOOP frames on stack
829 // 2) ALU_ELSE_AFTER is used at the point of max stack usage
831 // It was found that the conditions above are not sufficient, there are
832 // other cases where we also need to reserve stack space, that's why
833 // we always reserve 1 stack element if we have non-WQM push on stack.
834 // Condition 2 is ignored for now because we don't use this instruction.
835 if (has_non_wqm_push
)
838 case HW_CLASS_UNKNOWN
:
841 return stack_elements
;
844 void bc_finalizer::update_nstack(region_node
* r
, unsigned add
) {
847 unsigned elems
= r
? get_stack_depth(r
, loops
, ifs
, add
) : add
;
849 // XXX all chips expect this value to be computed using 4 as entry size,
850 // not the real entry size
851 unsigned stack_entries
= (elems
+ 3) >> 2;
853 if (nstack
< stack_entries
)
854 nstack
= stack_entries
;
857 void bc_finalizer::cf_peephole() {
858 if (ctx
.stack_workaround_8xx
|| ctx
.stack_workaround_9xx
) {
859 for (node_iterator N
, I
= sh
.root
->begin(), E
= sh
.root
->end(); I
!= E
;
862 cf_node
*c
= static_cast<cf_node
*>(*I
);
864 if (c
->bc
.op
== CF_OP_ALU_PUSH_BEFORE
&&
865 (c
->flags
& NF_ALU_STACK_WORKAROUND
)) {
866 cf_node
*push
= sh
.create_cf(CF_OP_PUSH
);
867 c
->insert_before(push
);
869 c
->bc
.set_op(CF_OP_ALU
);
874 for (node_iterator N
, I
= sh
.root
->begin(), E
= sh
.root
->end(); I
!= E
;
878 cf_node
*c
= static_cast<cf_node
*>(*I
);
880 if (c
->jump_after_target
) {
881 c
->jump_target
= static_cast<cf_node
*>(c
->jump_target
->next
);
882 c
->jump_after_target
= false;
885 if (c
->is_cf_op(CF_OP_POP
)) {
887 if (p
->is_alu_clause()) {
888 cf_node
*a
= static_cast<cf_node
*>(p
);
890 if (a
->bc
.op
== CF_OP_ALU
) {
891 a
->bc
.set_op(CF_OP_ALU_POP_AFTER
);
895 } else if (c
->is_cf_op(CF_OP_JUMP
) && c
->jump_target
== c
->next
) {
896 // if JUMP is immediately followed by its jump target,
897 // then JUMP is useless and we can eliminate it
903 } // namespace r600_sb