blob: 3e7a22c91ef543f3496600b0a126174200c875f3 [file] [log] [blame]
Taylor Simpson3e474052021-02-07 23:46:00 -06001/*
Taylor Simpson1e536332022-11-08 08:28:56 -08002 * Copyright(c) 2019-2022 Qualcomm Innovation Center, Inc. All Rights Reserved.
Taylor Simpson3e474052021-02-07 23:46:00 -06003 *
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.
8 *
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.
13 *
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/>.
16 */
17
18#ifndef HEXAGON_INSN_H
19#define HEXAGON_INSN_H
20
21#include "cpu.h"
22
23#define INSTRUCTIONS_MAX 7 /* 2 pairs + loopend */
24#define REG_OPERANDS_MAX 5
25#define IMMEDS_MAX 2
26
27struct Instruction;
28struct Packet;
29struct DisasContext;
30
Taylor Simpson1e536332022-11-08 08:28:56 -080031typedef void (*SemanticInsn)(struct DisasContext *ctx);
Taylor Simpson3e474052021-02-07 23:46:00 -060032
33struct Instruction {
34 SemanticInsn generate; /* pointer to genptr routine */
35 uint8_t regno[REG_OPERANDS_MAX]; /* reg operands including predicates */
36 uint16_t opcode;
37
38 uint32_t iclass:6;
39 uint32_t slot:3;
Taylor Simpson92cfa252021-04-08 20:07:35 -050040 uint32_t which_extended:1; /* If has an extender, which immediate */
41 uint32_t new_value_producer_slot:4;
42
43 bool part1; /*
Taylor Simpson3e474052021-02-07 23:46:00 -060044 * cmp-jumps are split into two insns.
45 * set for the compare and clear for the jump
46 */
Taylor Simpson92cfa252021-04-08 20:07:35 -050047 bool extension_valid; /* Has a constant extender attached */
48 bool is_endloop; /* This is an end of loop */
Taylor Simpson3e474052021-02-07 23:46:00 -060049 int32_t immed[IMMEDS_MAX]; /* immediate field */
50};
51
52typedef struct Instruction Insn;
53
54struct Packet {
55 uint16_t num_insns;
56 uint16_t encod_pkt_size_in_bytes;
Taylor Simpson40085902022-11-08 08:29:00 -080057 uint32_t pc;
Taylor Simpson3e474052021-02-07 23:46:00 -060058
59 /* Pre-decodes about COF */
Taylor Simpson92cfa252021-04-08 20:07:35 -050060 bool pkt_has_cof; /* Has any change-of-flow */
Taylor Simpsonfb67c2b2022-11-08 08:28:59 -080061 bool pkt_has_multi_cof; /* Has more than one change-of-flow */
Taylor Simpson92cfa252021-04-08 20:07:35 -050062 bool pkt_has_endloop;
Taylor Simpson3e474052021-02-07 23:46:00 -060063
Taylor Simpson92cfa252021-04-08 20:07:35 -050064 bool pkt_has_dczeroa;
Taylor Simpson3e474052021-02-07 23:46:00 -060065
Taylor Simpson92cfa252021-04-08 20:07:35 -050066 bool pkt_has_store_s0;
67 bool pkt_has_store_s1;
Taylor Simpson3e474052021-02-07 23:46:00 -060068
Taylor Simpsona1559532021-03-17 11:48:57 -050069 bool pkt_has_hvx;
70 Insn *vhist_insn;
71
Taylor Simpson3e474052021-02-07 23:46:00 -060072 Insn insn[INSTRUCTIONS_MAX];
73};
74
75typedef struct Packet Packet;
76
77#endif