2 * Copyright(c) 2019-2024 Qualcomm Innovation Center, Inc. All Rights Reserved.
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, see <http://www.gnu.org/licenses/>.
18 #ifndef HEXAGON_TRANSLATE_H
19 #define HEXAGON_TRANSLATE_H
21 #include "qemu/bitmap.h"
24 #include "exec/translator.h"
25 #include "tcg/tcg-op.h"
29 typedef struct DisasContext
{
30 DisasContextBase base
;
37 uint32_t num_hvx_insns
;
38 int reg_log
[REG_WRITES_MAX
];
40 DECLARE_BITMAP(regs_written
, TOTAL_PER_THREAD_REGS
);
41 DECLARE_BITMAP(predicated_regs
, TOTAL_PER_THREAD_REGS
);
42 int preg_log
[PRED_WRITES_MAX
];
44 DECLARE_BITMAP(pregs_written
, NUM_PREGS
);
45 uint8_t store_width
[STORES_MAX
];
46 bool s1_store_processed
;
48 int future_vregs_num
[VECTOR_TEMPS_MAX
];
50 int tmp_vregs_num
[VECTOR_TEMPS_MAX
];
51 int vreg_log
[NUM_VREGS
];
53 DECLARE_BITMAP(vregs_written
, NUM_VREGS
);
54 DECLARE_BITMAP(insn_vregs_written
, NUM_VREGS
);
55 DECLARE_BITMAP(vregs_updated_tmp
, NUM_VREGS
);
56 DECLARE_BITMAP(vregs_updated
, NUM_VREGS
);
57 DECLARE_BITMAP(vregs_select
, NUM_VREGS
);
58 DECLARE_BITMAP(predicated_future_vregs
, NUM_VREGS
);
59 DECLARE_BITMAP(predicated_tmp_vregs
, NUM_VREGS
);
60 DECLARE_BITMAP(insn_vregs_read
, NUM_VREGS
);
61 int qreg_log
[NUM_QREGS
];
63 DECLARE_BITMAP(qregs_written
, NUM_QREGS
);
64 DECLARE_BITMAP(insn_qregs_written
, NUM_QREGS
);
65 DECLARE_BITMAP(insn_qregs_read
, NUM_QREGS
);
69 target_ulong branch_dest
;
72 bool read_after_write
;
74 TCGv new_value
[TOTAL_PER_THREAD_REGS
];
75 TCGv new_pred_value
[NUM_PREGS
];
81 bool is_gather_store_insn(DisasContext
*ctx
);
83 static inline void ctx_log_pred_write(DisasContext
*ctx
, int pnum
)
85 if (!test_bit(pnum
, ctx
->pregs_written
)) {
86 ctx
->preg_log
[ctx
->preg_log_idx
] = pnum
;
88 set_bit(pnum
, ctx
->pregs_written
);
92 static inline void ctx_log_pred_read(DisasContext
*ctx
, int pnum
)
94 if (test_bit(pnum
, ctx
->pregs_written
)) {
95 ctx
->read_after_write
= true;
99 static inline void ctx_log_pred_read_new(DisasContext
*ctx
, int pnum
)
101 g_assert(test_bit(pnum
, ctx
->pregs_written
));
104 static inline void ctx_log_reg_write(DisasContext
*ctx
, int rnum
,
107 if (rnum
== HEX_REG_P3_0_ALIASED
) {
108 for (int i
= 0; i
< NUM_PREGS
; i
++) {
109 ctx_log_pred_write(ctx
, i
);
112 if (!test_bit(rnum
, ctx
->regs_written
)) {
113 ctx
->reg_log
[ctx
->reg_log_idx
] = rnum
;
115 set_bit(rnum
, ctx
->regs_written
);
118 set_bit(rnum
, ctx
->predicated_regs
);
123 static inline void ctx_log_reg_write_pair(DisasContext
*ctx
, int rnum
,
126 ctx_log_reg_write(ctx
, rnum
, is_predicated
);
127 ctx_log_reg_write(ctx
, rnum
+ 1, is_predicated
);
130 static inline void ctx_log_reg_read(DisasContext
*ctx
, int rnum
)
132 if (test_bit(rnum
, ctx
->regs_written
)) {
133 ctx
->read_after_write
= true;
137 static inline void ctx_log_reg_read_new(DisasContext
*ctx
, int rnum
)
139 g_assert(test_bit(rnum
, ctx
->regs_written
));
142 static inline void ctx_log_reg_read_pair(DisasContext
*ctx
, int rnum
)
144 ctx_log_reg_read(ctx
, rnum
);
145 ctx_log_reg_read(ctx
, rnum
+ 1);
148 intptr_t ctx_future_vreg_off(DisasContext
*ctx
, int regnum
,
149 int num
, bool alloc_ok
);
150 intptr_t ctx_tmp_vreg_off(DisasContext
*ctx
, int regnum
,
151 int num
, bool alloc_ok
);
153 static inline void ctx_start_hvx_insn(DisasContext
*ctx
)
155 bitmap_zero(ctx
->insn_vregs_written
, NUM_VREGS
);
156 bitmap_zero(ctx
->insn_vregs_read
, NUM_VREGS
);
157 bitmap_zero(ctx
->insn_qregs_written
, NUM_QREGS
);
158 bitmap_zero(ctx
->insn_qregs_read
, NUM_QREGS
);
161 static inline void ctx_log_vreg_write(DisasContext
*ctx
,
162 int rnum
, VRegWriteType type
,
163 bool is_predicated
, bool has_helper
)
166 set_bit(rnum
, ctx
->insn_vregs_written
);
167 if (test_bit(rnum
, ctx
->insn_vregs_read
)) {
168 ctx
->has_hvx_overlap
= true;
171 set_bit(rnum
, ctx
->vregs_written
);
172 if (type
!= EXT_TMP
) {
173 if (!test_bit(rnum
, ctx
->vregs_updated
)) {
174 ctx
->vreg_log
[ctx
->vreg_log_idx
] = rnum
;
176 set_bit(rnum
, ctx
->vregs_updated
);
179 set_bit(rnum
, ctx
->vregs_updated
);
181 set_bit(rnum
, ctx
->predicated_future_vregs
);
184 if (type
== EXT_NEW
) {
185 set_bit(rnum
, ctx
->vregs_select
);
187 if (type
== EXT_TMP
) {
188 set_bit(rnum
, ctx
->vregs_updated_tmp
);
190 set_bit(rnum
, ctx
->predicated_tmp_vregs
);
195 static inline void ctx_log_vreg_write_pair(DisasContext
*ctx
,
196 int rnum
, VRegWriteType type
,
197 bool is_predicated
, bool has_helper
)
199 ctx_log_vreg_write(ctx
, rnum
^ 0, type
, is_predicated
, has_helper
);
200 ctx_log_vreg_write(ctx
, rnum
^ 1, type
, is_predicated
, has_helper
);
203 static inline void ctx_log_vreg_read(DisasContext
*ctx
, int rnum
,
207 set_bit(rnum
, ctx
->insn_vregs_read
);
208 if (test_bit(rnum
, ctx
->insn_vregs_written
)) {
209 ctx
->has_hvx_overlap
= true;
212 if (test_bit(rnum
, ctx
->vregs_written
)) {
213 ctx
->read_after_write
= true;
217 static inline void ctx_log_vreg_read_new(DisasContext
*ctx
, int rnum
,
220 g_assert(is_gather_store_insn(ctx
) ||
221 test_bit(rnum
, ctx
->vregs_updated
) ||
222 test_bit(rnum
, ctx
->vregs_select
) ||
223 test_bit(rnum
, ctx
->vregs_updated_tmp
));
225 set_bit(rnum
, ctx
->insn_vregs_read
);
226 if (test_bit(rnum
, ctx
->insn_vregs_written
)) {
227 ctx
->has_hvx_overlap
= true;
230 if (is_gather_store_insn(ctx
)) {
231 ctx
->read_after_write
= true;
235 static inline void ctx_log_vreg_read_pair(DisasContext
*ctx
, int rnum
,
238 ctx_log_vreg_read(ctx
, rnum
^ 0, has_helper
);
239 ctx_log_vreg_read(ctx
, rnum
^ 1, has_helper
);
242 static inline void ctx_log_qreg_write(DisasContext
*ctx
,
243 int rnum
, bool has_helper
)
246 set_bit(rnum
, ctx
->insn_qregs_written
);
247 if (test_bit(rnum
, ctx
->insn_qregs_read
)) {
248 ctx
->has_hvx_overlap
= true;
251 set_bit(rnum
, ctx
->qregs_written
);
252 ctx
->qreg_log
[ctx
->qreg_log_idx
] = rnum
;
256 static inline void ctx_log_qreg_read(DisasContext
*ctx
,
257 int qnum
, bool has_helper
)
260 set_bit(qnum
, ctx
->insn_qregs_read
);
261 if (test_bit(qnum
, ctx
->insn_qregs_written
)) {
262 ctx
->has_hvx_overlap
= true;
265 if (test_bit(qnum
, ctx
->qregs_written
)) {
266 ctx
->read_after_write
= true;
270 extern TCGv hex_gpr
[TOTAL_PER_THREAD_REGS
];
271 extern TCGv hex_pred
[NUM_PREGS
];
272 extern TCGv hex_slot_cancelled
;
273 extern TCGv hex_new_value_usr
;
274 extern TCGv hex_reg_written
[TOTAL_PER_THREAD_REGS
];
275 extern TCGv hex_store_addr
[STORES_MAX
];
276 extern TCGv hex_store_width
[STORES_MAX
];
277 extern TCGv hex_store_val32
[STORES_MAX
];
278 extern TCGv_i64 hex_store_val64
[STORES_MAX
];
279 extern TCGv hex_llsc_addr
;
280 extern TCGv hex_llsc_val
;
281 extern TCGv_i64 hex_llsc_val_i64
;
282 extern TCGv hex_vstore_addr
[VSTORES_MAX
];
283 extern TCGv hex_vstore_size
[VSTORES_MAX
];
284 extern TCGv hex_vstore_pending
[VSTORES_MAX
];
286 void process_store(DisasContext
*ctx
, int slot_num
);
288 FIELD(PROBE_PKT_SCALAR_STORE_S0
, MMU_IDX
, 0, 2)
289 FIELD(PROBE_PKT_SCALAR_STORE_S0
, IS_PREDICATED
, 2, 1)
291 FIELD(PROBE_PKT_SCALAR_HVX_STORES
, HAS_ST0
, 0, 1)
292 FIELD(PROBE_PKT_SCALAR_HVX_STORES
, HAS_ST1
, 1, 1)
293 FIELD(PROBE_PKT_SCALAR_HVX_STORES
, HAS_HVX_STORES
, 2, 1)
294 FIELD(PROBE_PKT_SCALAR_HVX_STORES
, S0_IS_PRED
, 3, 1)
295 FIELD(PROBE_PKT_SCALAR_HVX_STORES
, S1_IS_PRED
, 4, 1)
296 FIELD(PROBE_PKT_SCALAR_HVX_STORES
, MMU_IDX
, 5, 2)