2 * Copyright 2010 Jerome Glisse <glisse@freedesktop.org>
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.
25 #include "util/u_memory.h"
26 #include "r600_pipe.h"
29 #include "r600_opcodes.h"
30 #include "evergreend.h"
32 int eg_bc_cf_build(struct r600_bc
*bc
, struct r600_bc_cf
*cf
)
35 unsigned end_of_program
= bc
->cf
.prev
== &cf
->list
;
38 case (EG_V_SQ_CF_ALU_WORD1_SQ_CF_INST_ALU
<< 3):
39 case (EG_V_SQ_CF_ALU_WORD1_SQ_CF_INST_ALU_POP_AFTER
<< 3):
40 case (EG_V_SQ_CF_ALU_WORD1_SQ_CF_INST_ALU_POP2_AFTER
<< 3):
41 case (EG_V_SQ_CF_ALU_WORD1_SQ_CF_INST_ALU_PUSH_BEFORE
<< 3):
42 assert(!end_of_program
);
43 bc
->bytecode
[id
++] = S_SQ_CF_ALU_WORD0_ADDR(cf
->addr
>> 1) |
44 S_SQ_CF_ALU_WORD0_KCACHE_MODE0(cf
->kcache
[0].mode
) |
45 S_SQ_CF_ALU_WORD0_KCACHE_BANK0(cf
->kcache
[0].bank
) |
46 S_SQ_CF_ALU_WORD0_KCACHE_BANK1(cf
->kcache
[1].bank
);
47 bc
->bytecode
[id
++] = S_SQ_CF_ALU_WORD1_CF_INST(cf
->inst
>> 3) |
48 S_SQ_CF_ALU_WORD1_KCACHE_MODE1(cf
->kcache
[1].mode
) |
49 S_SQ_CF_ALU_WORD1_KCACHE_ADDR0(cf
->kcache
[0].addr
) |
50 S_SQ_CF_ALU_WORD1_KCACHE_ADDR1(cf
->kcache
[1].addr
) |
51 S_SQ_CF_ALU_WORD1_BARRIER(cf
->barrier
) |
52 S_SQ_CF_ALU_WORD1_COUNT((cf
->ndw
/ 2) - 1);
54 case EG_V_SQ_CF_WORD1_SQ_CF_INST_TEX
:
55 case EG_V_SQ_CF_WORD1_SQ_CF_INST_VTX
:
56 bc
->bytecode
[id
++] = S_SQ_CF_WORD0_ADDR(cf
->addr
>> 1);
57 bc
->bytecode
[id
++] = S_SQ_CF_WORD1_CF_INST(cf
->inst
) |
58 S_SQ_CF_WORD1_BARRIER(cf
->barrier
) |
59 S_SQ_CF_WORD1_COUNT((cf
->ndw
/ 4) - 1) |
60 S_SQ_CF_WORD1_END_OF_PROGRAM(end_of_program
);
62 case EG_V_SQ_CF_ALLOC_EXPORT_WORD1_SQ_CF_INST_EXPORT
:
63 case EG_V_SQ_CF_ALLOC_EXPORT_WORD1_SQ_CF_INST_EXPORT_DONE
:
64 bc
->bytecode
[id
++] = S_SQ_CF_ALLOC_EXPORT_WORD0_RW_GPR(cf
->output
.gpr
) |
65 S_SQ_CF_ALLOC_EXPORT_WORD0_ELEM_SIZE(cf
->output
.elem_size
) |
66 S_SQ_CF_ALLOC_EXPORT_WORD0_ARRAY_BASE(cf
->output
.array_base
) |
67 S_SQ_CF_ALLOC_EXPORT_WORD0_TYPE(cf
->output
.type
);
68 bc
->bytecode
[id
++] = S_SQ_CF_ALLOC_EXPORT_WORD1_BURST_COUNT(cf
->output
.burst_count
- 1) |
69 S_SQ_CF_ALLOC_EXPORT_WORD1_SWIZ_SEL_X(cf
->output
.swizzle_x
) |
70 S_SQ_CF_ALLOC_EXPORT_WORD1_SWIZ_SEL_Y(cf
->output
.swizzle_y
) |
71 S_SQ_CF_ALLOC_EXPORT_WORD1_SWIZ_SEL_Z(cf
->output
.swizzle_z
) |
72 S_SQ_CF_ALLOC_EXPORT_WORD1_SWIZ_SEL_W(cf
->output
.swizzle_w
) |
73 S_SQ_CF_ALLOC_EXPORT_WORD1_BARRIER(cf
->barrier
) |
74 S_SQ_CF_ALLOC_EXPORT_WORD1_CF_INST(cf
->inst
) |
75 S_SQ_CF_ALLOC_EXPORT_WORD1_END_OF_PROGRAM(end_of_program
);
77 case EG_V_SQ_CF_WORD1_SQ_CF_INST_JUMP
:
78 case EG_V_SQ_CF_WORD1_SQ_CF_INST_ELSE
:
79 case EG_V_SQ_CF_WORD1_SQ_CF_INST_POP
:
80 case EG_V_SQ_CF_WORD1_SQ_CF_INST_LOOP_START_NO_AL
:
81 case EG_V_SQ_CF_WORD1_SQ_CF_INST_LOOP_END
:
82 case EG_V_SQ_CF_WORD1_SQ_CF_INST_LOOP_CONTINUE
:
83 case EG_V_SQ_CF_WORD1_SQ_CF_INST_LOOP_BREAK
:
84 case EG_V_SQ_CF_WORD1_SQ_CF_INST_CALL_FS
:
85 case EG_V_SQ_CF_WORD1_SQ_CF_INST_RETURN
:
86 bc
->bytecode
[id
++] = S_SQ_CF_WORD0_ADDR(cf
->cf_addr
>> 1);
87 bc
->bytecode
[id
++] = S_SQ_CF_WORD1_CF_INST(cf
->inst
) |
88 S_SQ_CF_WORD1_BARRIER(cf
->barrier
) |
89 S_SQ_CF_WORD1_COND(cf
->cond
) |
90 S_SQ_CF_WORD1_POP_COUNT(cf
->pop_count
) |
91 S_SQ_CF_WORD1_END_OF_PROGRAM(end_of_program
);
95 R600_ERR("unsupported CF instruction (0x%X)\n", cf
->inst
);
101 void eg_cf_vtx(struct r600_vertex_element
*ve
, u32
*bytecode
, unsigned count
)
103 struct r600_pipe_state
*rstate
;
107 bytecode
[i
++] = S_SQ_CF_WORD0_ADDR(8 >> 1);
108 bytecode
[i
++] = S_SQ_CF_WORD1_CF_INST(EG_V_SQ_CF_WORD1_SQ_CF_INST_VTX
) |
109 S_SQ_CF_WORD1_BARRIER(1) |
110 S_SQ_CF_WORD1_COUNT(8 - 1);
111 bytecode
[i
++] = S_SQ_CF_WORD0_ADDR(40 >> 1);
112 bytecode
[i
++] = S_SQ_CF_WORD1_CF_INST(EG_V_SQ_CF_WORD1_SQ_CF_INST_VTX
) |
113 S_SQ_CF_WORD1_BARRIER(1) |
114 S_SQ_CF_WORD1_COUNT(count
- 8 - 1);
116 bytecode
[i
++] = S_SQ_CF_WORD0_ADDR(8 >> 1);
117 bytecode
[i
++] = S_SQ_CF_WORD1_CF_INST(EG_V_SQ_CF_WORD1_SQ_CF_INST_VTX
) |
118 S_SQ_CF_WORD1_BARRIER(1) |
119 S_SQ_CF_WORD1_COUNT(count
- 1);
121 bytecode
[i
++] = S_SQ_CF_WORD0_ADDR(0);
122 bytecode
[i
++] = S_SQ_CF_WORD1_CF_INST(EG_V_SQ_CF_WORD1_SQ_CF_INST_RETURN
) |
123 S_SQ_CF_WORD1_BARRIER(1);
125 rstate
= &ve
->rstate
;
126 rstate
->id
= R600_PIPE_STATE_FETCH_SHADER
;
128 r600_pipe_state_add_reg(rstate
, R_0288A8_SQ_PGM_RESOURCES_FS
,
129 0x00000000, 0xFFFFFFFF, NULL
);
130 r600_pipe_state_add_reg(rstate
, R_0288A4_SQ_PGM_START_FS
,
131 (r600_bo_offset(ve
->fetch_shader
)) >> 8,
132 0xFFFFFFFF, ve
->fetch_shader
);