166d29a5eSTaylor Simpson /* 214edcf11SMatheus Tavares Bernardino * Copyright(c) 2019-2023 Qualcomm Innovation Center, Inc. All Rights Reserved. 366d29a5eSTaylor Simpson * 466d29a5eSTaylor Simpson * This program is free software; you can redistribute it and/or modify 566d29a5eSTaylor Simpson * it under the terms of the GNU General Public License as published by 666d29a5eSTaylor Simpson * the Free Software Foundation; either version 2 of the License, or 766d29a5eSTaylor Simpson * (at your option) any later version. 866d29a5eSTaylor Simpson * 966d29a5eSTaylor Simpson * This program is distributed in the hope that it will be useful, 1066d29a5eSTaylor Simpson * but WITHOUT ANY WARRANTY; without even the implied warranty of 1166d29a5eSTaylor Simpson * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 1266d29a5eSTaylor Simpson * GNU General Public License for more details. 1366d29a5eSTaylor Simpson * 1466d29a5eSTaylor Simpson * You should have received a copy of the GNU General Public License 1566d29a5eSTaylor Simpson * along with this program; if not, see <http://www.gnu.org/licenses/>. 1666d29a5eSTaylor Simpson */ 1766d29a5eSTaylor Simpson 1866d29a5eSTaylor Simpson #include "qemu/osdep.h" 1966d29a5eSTaylor Simpson #include "iclass.h" 2066d29a5eSTaylor Simpson #include "attribs.h" 2166d29a5eSTaylor Simpson #include "genptr.h" 2266d29a5eSTaylor Simpson #include "decode.h" 2366d29a5eSTaylor Simpson #include "insn.h" 2466d29a5eSTaylor Simpson #include "printinsn.h" 2560d1180bSTaylor Simpson #include "mmvec/decode_ext_mmvec.h" 2666d29a5eSTaylor Simpson 2766d29a5eSTaylor Simpson #define fZXTN(N, M, VAL) ((VAL) & ((1LL << (N)) - 1)) 2866d29a5eSTaylor Simpson 2966d29a5eSTaylor Simpson enum { 3066d29a5eSTaylor Simpson EXT_IDX_noext = 0, 3166d29a5eSTaylor Simpson EXT_IDX_noext_AFTER = 4, 3266d29a5eSTaylor Simpson EXT_IDX_mmvec = 4, 3366d29a5eSTaylor Simpson EXT_IDX_mmvec_AFTER = 8, 3466d29a5eSTaylor Simpson XX_LAST_EXT_IDX 3566d29a5eSTaylor Simpson }; 3666d29a5eSTaylor Simpson 3766d29a5eSTaylor Simpson /* 3866d29a5eSTaylor Simpson * Certain operand types represent a non-contiguous set of values. 3966d29a5eSTaylor Simpson * For example, the compound compare-and-jump instruction can only access 4066d29a5eSTaylor Simpson * registers R0-R7 and R16-23. 4166d29a5eSTaylor Simpson * This table represents the mapping from the encoding to the actual values. 4266d29a5eSTaylor Simpson */ 4366d29a5eSTaylor Simpson 4466d29a5eSTaylor Simpson #define DEF_REGMAP(NAME, ELEMENTS, ...) \ 4566d29a5eSTaylor Simpson static const unsigned int DECODE_REGISTER_##NAME[ELEMENTS] = \ 4666d29a5eSTaylor Simpson { __VA_ARGS__ }; 4766d29a5eSTaylor Simpson /* Name Num Table */ 4866d29a5eSTaylor Simpson DEF_REGMAP(R_16, 16, 0, 1, 2, 3, 4, 5, 6, 7, 16, 17, 18, 19, 20, 21, 22, 23) 4966d29a5eSTaylor Simpson DEF_REGMAP(R__8, 8, 0, 2, 4, 6, 16, 18, 20, 22) 5061c9aab0STaylor Simpson DEF_REGMAP(R_8, 8, 0, 1, 2, 3, 4, 5, 6, 7) 5166d29a5eSTaylor Simpson 521de468b3STaylor Simpson #define DECODE_MAPPED_REG(OPNUM, NAME) \ 531de468b3STaylor Simpson insn->regno[OPNUM] = DECODE_REGISTER_##NAME[insn->regno[OPNUM]]; 5466d29a5eSTaylor Simpson 55*1547a2d3STaylor Simpson /* Helper functions for decode_*_generated.c.inc */ 56*1547a2d3STaylor Simpson #define DECODE_MAPPED(NAME) \ 57*1547a2d3STaylor Simpson static int decode_mapped_reg_##NAME(DisasContext *ctx, int x) \ 58*1547a2d3STaylor Simpson { \ 59*1547a2d3STaylor Simpson return DECODE_REGISTER_##NAME[x]; \ 60*1547a2d3STaylor Simpson } 61*1547a2d3STaylor Simpson DECODE_MAPPED(R_16) 62*1547a2d3STaylor Simpson DECODE_MAPPED(R_8) 63*1547a2d3STaylor Simpson 64*1547a2d3STaylor Simpson /* Helper function for decodetree_trans_funcs_generated.c.inc */ 65*1547a2d3STaylor Simpson static int shift_left(DisasContext *ctx, int x, int n, int immno) 66*1547a2d3STaylor Simpson { 67*1547a2d3STaylor Simpson int ret = x; 68*1547a2d3STaylor Simpson Insn *insn = ctx->insn; 69*1547a2d3STaylor Simpson if (!insn->extension_valid || 70*1547a2d3STaylor Simpson insn->which_extended != immno) { 71*1547a2d3STaylor Simpson ret <<= n; 72*1547a2d3STaylor Simpson } 73*1547a2d3STaylor Simpson return ret; 74*1547a2d3STaylor Simpson } 75*1547a2d3STaylor Simpson 76*1547a2d3STaylor Simpson /* Include the generated decoder for 32 bit insn */ 77*1547a2d3STaylor Simpson #include "decode_normal_generated.c.inc" 78*1547a2d3STaylor Simpson #include "decode_hvx_generated.c.inc" 79*1547a2d3STaylor Simpson 80*1547a2d3STaylor Simpson /* Include the generated helpers for the decoder */ 81*1547a2d3STaylor Simpson #include "decodetree_trans_funcs_generated.c.inc" 82*1547a2d3STaylor Simpson 8366d29a5eSTaylor Simpson typedef struct { 8466d29a5eSTaylor Simpson const struct DectreeTable *table_link; 8566d29a5eSTaylor Simpson const struct DectreeTable *table_link_b; 8666d29a5eSTaylor Simpson Opcode opcode; 8766d29a5eSTaylor Simpson enum { 8866d29a5eSTaylor Simpson DECTREE_ENTRY_INVALID, 8966d29a5eSTaylor Simpson DECTREE_TABLE_LINK, 9066d29a5eSTaylor Simpson DECTREE_SUBINSNS, 9166d29a5eSTaylor Simpson DECTREE_EXTSPACE, 9266d29a5eSTaylor Simpson DECTREE_TERMINAL 9366d29a5eSTaylor Simpson } type; 9466d29a5eSTaylor Simpson } DectreeEntry; 9566d29a5eSTaylor Simpson 9666d29a5eSTaylor Simpson typedef struct DectreeTable { 9766d29a5eSTaylor Simpson unsigned int (*lookup_function)(int startbit, int width, uint32_t opcode); 9866d29a5eSTaylor Simpson unsigned int size; 9966d29a5eSTaylor Simpson unsigned int startbit; 10066d29a5eSTaylor Simpson unsigned int width; 10166d29a5eSTaylor Simpson const DectreeEntry table[]; 10266d29a5eSTaylor Simpson } DectreeTable; 10366d29a5eSTaylor Simpson 10466d29a5eSTaylor Simpson #define DECODE_NEW_TABLE(TAG, SIZE, WHATNOT) \ 10566d29a5eSTaylor Simpson static const DectreeTable dectree_table_##TAG; 10666d29a5eSTaylor Simpson #define TABLE_LINK(TABLE) /* NOTHING */ 10766d29a5eSTaylor Simpson #define TERMINAL(TAG, ENC) /* NOTHING */ 10866d29a5eSTaylor Simpson #define SUBINSNS(TAG, CLASSA, CLASSB, ENC) /* NOTHING */ 10966d29a5eSTaylor Simpson #define EXTSPACE(TAG, ENC) /* NOTHING */ 11066d29a5eSTaylor Simpson #define INVALID() /* NOTHING */ 11166d29a5eSTaylor Simpson #define DECODE_END_TABLE(...) /* NOTHING */ 11266d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) /* NOTHING */ 11366d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) /* NOTHING */ 11466d29a5eSTaylor Simpson #define DECODE_OPINFO(...) /* NOTHING */ 11566d29a5eSTaylor Simpson 11666d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 11766d29a5eSTaylor Simpson 11866d29a5eSTaylor Simpson #undef DECODE_OPINFO 11966d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 12066d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 12166d29a5eSTaylor Simpson #undef DECODE_END_TABLE 12266d29a5eSTaylor Simpson #undef INVALID 12366d29a5eSTaylor Simpson #undef TERMINAL 12466d29a5eSTaylor Simpson #undef SUBINSNS 12566d29a5eSTaylor Simpson #undef EXTSPACE 12666d29a5eSTaylor Simpson #undef TABLE_LINK 12766d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE 12866d29a5eSTaylor Simpson #undef DECODE_SEPARATOR_BITS 12966d29a5eSTaylor Simpson 13066d29a5eSTaylor Simpson #define DECODE_SEPARATOR_BITS(START, WIDTH) NULL, START, WIDTH 13166d29a5eSTaylor Simpson #define DECODE_NEW_TABLE_HELPER(TAG, SIZE, FN, START, WIDTH) \ 13266d29a5eSTaylor Simpson static const DectreeTable dectree_table_##TAG = { \ 13366d29a5eSTaylor Simpson .size = SIZE, \ 13466d29a5eSTaylor Simpson .lookup_function = FN, \ 13566d29a5eSTaylor Simpson .startbit = START, \ 13666d29a5eSTaylor Simpson .width = WIDTH, \ 13766d29a5eSTaylor Simpson .table = { 13866d29a5eSTaylor Simpson #define DECODE_NEW_TABLE(TAG, SIZE, WHATNOT) \ 13966d29a5eSTaylor Simpson DECODE_NEW_TABLE_HELPER(TAG, SIZE, WHATNOT) 14066d29a5eSTaylor Simpson 14166d29a5eSTaylor Simpson #define TABLE_LINK(TABLE) \ 14266d29a5eSTaylor Simpson { .type = DECTREE_TABLE_LINK, .table_link = &dectree_table_##TABLE }, 14366d29a5eSTaylor Simpson #define TERMINAL(TAG, ENC) \ 14466d29a5eSTaylor Simpson { .type = DECTREE_TERMINAL, .opcode = TAG }, 14566d29a5eSTaylor Simpson #define SUBINSNS(TAG, CLASSA, CLASSB, ENC) \ 14666d29a5eSTaylor Simpson { \ 14766d29a5eSTaylor Simpson .type = DECTREE_SUBINSNS, \ 14866d29a5eSTaylor Simpson .table_link = &dectree_table_DECODE_SUBINSN_##CLASSA, \ 14966d29a5eSTaylor Simpson .table_link_b = &dectree_table_DECODE_SUBINSN_##CLASSB \ 15066d29a5eSTaylor Simpson }, 15166d29a5eSTaylor Simpson #define EXTSPACE(TAG, ENC) { .type = DECTREE_EXTSPACE }, 15266d29a5eSTaylor Simpson #define INVALID() { .type = DECTREE_ENTRY_INVALID, .opcode = XX_LAST_OPCODE }, 15366d29a5eSTaylor Simpson 15466d29a5eSTaylor Simpson #define DECODE_END_TABLE(...) } }; 15566d29a5eSTaylor Simpson 15666d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) /* NOTHING */ 15766d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) /* NOTHING */ 15866d29a5eSTaylor Simpson #define DECODE_OPINFO(...) /* NOTHING */ 15966d29a5eSTaylor Simpson 16066d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 16166d29a5eSTaylor Simpson 16266d29a5eSTaylor Simpson #undef DECODE_OPINFO 16366d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 16466d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 16566d29a5eSTaylor Simpson #undef DECODE_END_TABLE 16666d29a5eSTaylor Simpson #undef INVALID 16766d29a5eSTaylor Simpson #undef TERMINAL 16866d29a5eSTaylor Simpson #undef SUBINSNS 16966d29a5eSTaylor Simpson #undef EXTSPACE 17066d29a5eSTaylor Simpson #undef TABLE_LINK 17166d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE 17266d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE_HELPER 17366d29a5eSTaylor Simpson #undef DECODE_SEPARATOR_BITS 17466d29a5eSTaylor Simpson 17566d29a5eSTaylor Simpson static const DectreeTable dectree_table_DECODE_EXT_EXT_noext = { 17666d29a5eSTaylor Simpson .size = 1, .lookup_function = NULL, .startbit = 0, .width = 0, 17766d29a5eSTaylor Simpson .table = { 17866d29a5eSTaylor Simpson { .type = DECTREE_ENTRY_INVALID, .opcode = XX_LAST_OPCODE }, 17966d29a5eSTaylor Simpson } 18066d29a5eSTaylor Simpson }; 18166d29a5eSTaylor Simpson 18266d29a5eSTaylor Simpson static const DectreeTable *ext_trees[XX_LAST_EXT_IDX]; 18366d29a5eSTaylor Simpson 18466d29a5eSTaylor Simpson static void decode_ext_init(void) 18566d29a5eSTaylor Simpson { 18666d29a5eSTaylor Simpson int i; 18766d29a5eSTaylor Simpson for (i = EXT_IDX_noext; i < EXT_IDX_noext_AFTER; i++) { 18866d29a5eSTaylor Simpson ext_trees[i] = &dectree_table_DECODE_EXT_EXT_noext; 18966d29a5eSTaylor Simpson } 19061c9aab0STaylor Simpson for (i = EXT_IDX_mmvec; i < EXT_IDX_mmvec_AFTER; i++) { 19161c9aab0STaylor Simpson ext_trees[i] = &dectree_table_DECODE_EXT_EXT_mmvec; 19261c9aab0STaylor Simpson } 19366d29a5eSTaylor Simpson } 19466d29a5eSTaylor Simpson 19566d29a5eSTaylor Simpson typedef struct { 19666d29a5eSTaylor Simpson uint32_t mask; 19766d29a5eSTaylor Simpson uint32_t match; 19866d29a5eSTaylor Simpson } DecodeITableEntry; 19966d29a5eSTaylor Simpson 20066d29a5eSTaylor Simpson #define DECODE_NEW_TABLE(TAG, SIZE, WHATNOT) /* NOTHING */ 20166d29a5eSTaylor Simpson #define TABLE_LINK(TABLE) /* NOTHING */ 20266d29a5eSTaylor Simpson #define TERMINAL(TAG, ENC) /* NOTHING */ 20366d29a5eSTaylor Simpson #define SUBINSNS(TAG, CLASSA, CLASSB, ENC) /* NOTHING */ 20466d29a5eSTaylor Simpson #define EXTSPACE(TAG, ENC) /* NOTHING */ 20566d29a5eSTaylor Simpson #define INVALID() /* NOTHING */ 20666d29a5eSTaylor Simpson #define DECODE_END_TABLE(...) /* NOTHING */ 20766d29a5eSTaylor Simpson #define DECODE_OPINFO(...) /* NOTHING */ 20866d29a5eSTaylor Simpson 20966d29a5eSTaylor Simpson #define DECODE_MATCH_INFO_NORMAL(TAG, MASK, MATCH) \ 21066d29a5eSTaylor Simpson [TAG] = { \ 21166d29a5eSTaylor Simpson .mask = MASK, \ 21266d29a5eSTaylor Simpson .match = MATCH, \ 21366d29a5eSTaylor Simpson }, 21466d29a5eSTaylor Simpson 21566d29a5eSTaylor Simpson #define DECODE_MATCH_INFO_NULL(TAG, MASK, MATCH) \ 21666d29a5eSTaylor Simpson [TAG] = { .match = ~0 }, 21766d29a5eSTaylor Simpson 21866d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) DECODE_MATCH_INFO_NORMAL(__VA_ARGS__) 21966d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) /* NOTHING */ 22066d29a5eSTaylor Simpson 22166d29a5eSTaylor Simpson static const DecodeITableEntry decode_itable[XX_LAST_OPCODE] = { 22266d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 22366d29a5eSTaylor Simpson }; 22466d29a5eSTaylor Simpson 22566d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 22666d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) DECODE_MATCH_INFO_NULL(__VA_ARGS__) 22766d29a5eSTaylor Simpson 22866d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 22966d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) DECODE_MATCH_INFO_NORMAL(__VA_ARGS__) 23066d29a5eSTaylor Simpson 23166d29a5eSTaylor Simpson static const DecodeITableEntry decode_legacy_itable[XX_LAST_OPCODE] = { 23266d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 23366d29a5eSTaylor Simpson }; 23466d29a5eSTaylor Simpson 23566d29a5eSTaylor Simpson #undef DECODE_OPINFO 23666d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 23766d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 23866d29a5eSTaylor Simpson #undef DECODE_END_TABLE 23966d29a5eSTaylor Simpson #undef INVALID 24066d29a5eSTaylor Simpson #undef TERMINAL 24166d29a5eSTaylor Simpson #undef SUBINSNS 24266d29a5eSTaylor Simpson #undef EXTSPACE 24366d29a5eSTaylor Simpson #undef TABLE_LINK 24466d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE 24566d29a5eSTaylor Simpson #undef DECODE_SEPARATOR_BITS 24666d29a5eSTaylor Simpson 24766d29a5eSTaylor Simpson void decode_init(void) 24866d29a5eSTaylor Simpson { 24966d29a5eSTaylor Simpson decode_ext_init(); 25066d29a5eSTaylor Simpson } 25166d29a5eSTaylor Simpson 25266d29a5eSTaylor Simpson void decode_send_insn_to(Packet *packet, int start, int newloc) 25366d29a5eSTaylor Simpson { 25466d29a5eSTaylor Simpson Insn tmpinsn; 25566d29a5eSTaylor Simpson int direction; 25666d29a5eSTaylor Simpson int i; 25766d29a5eSTaylor Simpson if (start == newloc) { 25866d29a5eSTaylor Simpson return; 25966d29a5eSTaylor Simpson } 26066d29a5eSTaylor Simpson if (start < newloc) { 26166d29a5eSTaylor Simpson /* Move towards end */ 26266d29a5eSTaylor Simpson direction = 1; 26366d29a5eSTaylor Simpson } else { 26466d29a5eSTaylor Simpson /* move towards beginning */ 26566d29a5eSTaylor Simpson direction = -1; 26666d29a5eSTaylor Simpson } 26766d29a5eSTaylor Simpson for (i = start; i != newloc; i += direction) { 26866d29a5eSTaylor Simpson tmpinsn = packet->insn[i]; 26966d29a5eSTaylor Simpson packet->insn[i] = packet->insn[i + direction]; 27066d29a5eSTaylor Simpson packet->insn[i + direction] = tmpinsn; 27166d29a5eSTaylor Simpson } 27266d29a5eSTaylor Simpson } 27366d29a5eSTaylor Simpson 27466d29a5eSTaylor Simpson /* Fill newvalue registers with the correct regno */ 27566d29a5eSTaylor Simpson static void 27666d29a5eSTaylor Simpson decode_fill_newvalue_regno(Packet *packet) 27766d29a5eSTaylor Simpson { 27866d29a5eSTaylor Simpson int i, use_regidx, offset, def_idx, dst_idx; 27966d29a5eSTaylor Simpson uint16_t def_opcode, use_opcode; 28066d29a5eSTaylor Simpson char *dststr; 28166d29a5eSTaylor Simpson 28266d29a5eSTaylor Simpson for (i = 1; i < packet->num_insns; i++) { 28366d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i].opcode, A_DOTNEWVALUE) && 28466d29a5eSTaylor Simpson !GET_ATTRIB(packet->insn[i].opcode, A_EXTENSION)) { 28566d29a5eSTaylor Simpson use_opcode = packet->insn[i].opcode; 28666d29a5eSTaylor Simpson 28766d29a5eSTaylor Simpson /* It's a store, so we're adjusting the Nt field */ 28866d29a5eSTaylor Simpson if (GET_ATTRIB(use_opcode, A_STORE)) { 28966d29a5eSTaylor Simpson use_regidx = strchr(opcode_reginfo[use_opcode], 't') - 29066d29a5eSTaylor Simpson opcode_reginfo[use_opcode]; 29166d29a5eSTaylor Simpson } else { /* It's a Jump, so we're adjusting the Ns field */ 29266d29a5eSTaylor Simpson use_regidx = strchr(opcode_reginfo[use_opcode], 's') - 29366d29a5eSTaylor Simpson opcode_reginfo[use_opcode]; 29466d29a5eSTaylor Simpson } 29566d29a5eSTaylor Simpson 29666d29a5eSTaylor Simpson /* 29766d29a5eSTaylor Simpson * What's encoded at the N-field is the offset to who's producing 29866d29a5eSTaylor Simpson * the value. Shift off the LSB which indicates odd/even register, 29966d29a5eSTaylor Simpson * then walk backwards and skip over the constant extenders. 30066d29a5eSTaylor Simpson */ 30166d29a5eSTaylor Simpson offset = packet->insn[i].regno[use_regidx] >> 1; 30266d29a5eSTaylor Simpson def_idx = i - offset; 30366d29a5eSTaylor Simpson for (int j = 0; j < offset; j++) { 30466d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i - j - 1].opcode, A_IT_EXTENDER)) { 30566d29a5eSTaylor Simpson def_idx--; 30666d29a5eSTaylor Simpson } 30766d29a5eSTaylor Simpson } 30866d29a5eSTaylor Simpson 30966d29a5eSTaylor Simpson /* 31066d29a5eSTaylor Simpson * Check for a badly encoded N-field which points to an instruction 31166d29a5eSTaylor Simpson * out-of-range 31266d29a5eSTaylor Simpson */ 31366d29a5eSTaylor Simpson g_assert(!((def_idx < 0) || (def_idx > (packet->num_insns - 1)))); 31466d29a5eSTaylor Simpson 31566d29a5eSTaylor Simpson /* 31666d29a5eSTaylor Simpson * packet->insn[def_idx] is the producer 31766d29a5eSTaylor Simpson * Figure out which type of destination it produces 31866d29a5eSTaylor Simpson * and the corresponding index in the reginfo 31966d29a5eSTaylor Simpson */ 32066d29a5eSTaylor Simpson def_opcode = packet->insn[def_idx].opcode; 32166d29a5eSTaylor Simpson dststr = strstr(opcode_wregs[def_opcode], "Rd"); 32266d29a5eSTaylor Simpson if (dststr) { 32366d29a5eSTaylor Simpson dststr = strchr(opcode_reginfo[def_opcode], 'd'); 32466d29a5eSTaylor Simpson } else { 32566d29a5eSTaylor Simpson dststr = strstr(opcode_wregs[def_opcode], "Rx"); 32666d29a5eSTaylor Simpson if (dststr) { 32766d29a5eSTaylor Simpson dststr = strchr(opcode_reginfo[def_opcode], 'x'); 32866d29a5eSTaylor Simpson } else { 32966d29a5eSTaylor Simpson dststr = strstr(opcode_wregs[def_opcode], "Re"); 33066d29a5eSTaylor Simpson if (dststr) { 33166d29a5eSTaylor Simpson dststr = strchr(opcode_reginfo[def_opcode], 'e'); 33266d29a5eSTaylor Simpson } else { 33366d29a5eSTaylor Simpson dststr = strstr(opcode_wregs[def_opcode], "Ry"); 33466d29a5eSTaylor Simpson if (dststr) { 33566d29a5eSTaylor Simpson dststr = strchr(opcode_reginfo[def_opcode], 'y'); 33666d29a5eSTaylor Simpson } else { 33766d29a5eSTaylor Simpson g_assert_not_reached(); 33866d29a5eSTaylor Simpson } 33966d29a5eSTaylor Simpson } 34066d29a5eSTaylor Simpson } 34166d29a5eSTaylor Simpson } 34266d29a5eSTaylor Simpson g_assert(dststr != NULL); 34366d29a5eSTaylor Simpson 34466d29a5eSTaylor Simpson /* Now patch up the consumer with the register number */ 34566d29a5eSTaylor Simpson dst_idx = dststr - opcode_reginfo[def_opcode]; 34666d29a5eSTaylor Simpson packet->insn[i].regno[use_regidx] = 34766d29a5eSTaylor Simpson packet->insn[def_idx].regno[dst_idx]; 34866d29a5eSTaylor Simpson /* 34966d29a5eSTaylor Simpson * We need to remember who produces this value to later 35066d29a5eSTaylor Simpson * check if it was dynamically cancelled 35166d29a5eSTaylor Simpson */ 35266d29a5eSTaylor Simpson packet->insn[i].new_value_producer_slot = 35366d29a5eSTaylor Simpson packet->insn[def_idx].slot; 35466d29a5eSTaylor Simpson } 35566d29a5eSTaylor Simpson } 35666d29a5eSTaylor Simpson } 35766d29a5eSTaylor Simpson 35866d29a5eSTaylor Simpson /* Split CJ into a compare and a jump */ 35966d29a5eSTaylor Simpson static void decode_split_cmpjump(Packet *pkt) 36066d29a5eSTaylor Simpson { 36166d29a5eSTaylor Simpson int last, i; 36266d29a5eSTaylor Simpson int numinsns = pkt->num_insns; 36366d29a5eSTaylor Simpson 36466d29a5eSTaylor Simpson /* 36566d29a5eSTaylor Simpson * First, split all compare-jumps. 36666d29a5eSTaylor Simpson * The compare is sent to the end as a new instruction. 36766d29a5eSTaylor Simpson * Do it this way so we don't reorder dual jumps. Those need to stay in 36866d29a5eSTaylor Simpson * original order. 36966d29a5eSTaylor Simpson */ 37066d29a5eSTaylor Simpson for (i = 0; i < numinsns; i++) { 37166d29a5eSTaylor Simpson /* It's a cmp-jump */ 37266d29a5eSTaylor Simpson if (GET_ATTRIB(pkt->insn[i].opcode, A_NEWCMPJUMP)) { 37366d29a5eSTaylor Simpson last = pkt->num_insns; 37466d29a5eSTaylor Simpson pkt->insn[last] = pkt->insn[i]; /* copy the instruction */ 37592cfa25fSTaylor Simpson pkt->insn[last].part1 = true; /* last insn does the CMP */ 37692cfa25fSTaylor Simpson pkt->insn[i].part1 = false; /* existing insn does the JUMP */ 37766d29a5eSTaylor Simpson pkt->num_insns++; 37866d29a5eSTaylor Simpson } 37966d29a5eSTaylor Simpson } 38066d29a5eSTaylor Simpson 38166d29a5eSTaylor Simpson /* Now re-shuffle all the compares back to the beginning */ 38266d29a5eSTaylor Simpson for (i = 0; i < pkt->num_insns; i++) { 38366d29a5eSTaylor Simpson if (pkt->insn[i].part1) { 38466d29a5eSTaylor Simpson decode_send_insn_to(pkt, i, 0); 38566d29a5eSTaylor Simpson } 38666d29a5eSTaylor Simpson } 38766d29a5eSTaylor Simpson } 38866d29a5eSTaylor Simpson 38992cfa25fSTaylor Simpson static bool decode_opcode_can_jump(int opcode) 39066d29a5eSTaylor Simpson { 39166d29a5eSTaylor Simpson if ((GET_ATTRIB(opcode, A_JUMP)) || 39266d29a5eSTaylor Simpson (GET_ATTRIB(opcode, A_CALL)) || 39366d29a5eSTaylor Simpson (opcode == J2_trap0) || 39466d29a5eSTaylor Simpson (opcode == J2_pause)) { 39566d29a5eSTaylor Simpson /* Exception to A_JUMP attribute */ 39666d29a5eSTaylor Simpson if (opcode == J4_hintjumpr) { 39792cfa25fSTaylor Simpson return false; 39866d29a5eSTaylor Simpson } 39992cfa25fSTaylor Simpson return true; 40066d29a5eSTaylor Simpson } 40166d29a5eSTaylor Simpson 40292cfa25fSTaylor Simpson return false; 40366d29a5eSTaylor Simpson } 40466d29a5eSTaylor Simpson 40592cfa25fSTaylor Simpson static bool decode_opcode_ends_loop(int opcode) 40666d29a5eSTaylor Simpson { 40766d29a5eSTaylor Simpson return GET_ATTRIB(opcode, A_HWLOOP0_END) || 40866d29a5eSTaylor Simpson GET_ATTRIB(opcode, A_HWLOOP1_END); 40966d29a5eSTaylor Simpson } 41066d29a5eSTaylor Simpson 41166d29a5eSTaylor Simpson /* Set the is_* fields in each instruction */ 41266d29a5eSTaylor Simpson static void decode_set_insn_attr_fields(Packet *pkt) 41366d29a5eSTaylor Simpson { 41466d29a5eSTaylor Simpson int i; 41566d29a5eSTaylor Simpson int numinsns = pkt->num_insns; 41666d29a5eSTaylor Simpson uint16_t opcode; 41766d29a5eSTaylor Simpson 41892cfa25fSTaylor Simpson pkt->pkt_has_cof = false; 419fb67c2bfSTaylor Simpson pkt->pkt_has_multi_cof = false; 42092cfa25fSTaylor Simpson pkt->pkt_has_endloop = false; 42192cfa25fSTaylor Simpson pkt->pkt_has_dczeroa = false; 42266d29a5eSTaylor Simpson 42366d29a5eSTaylor Simpson for (i = 0; i < numinsns; i++) { 42466d29a5eSTaylor Simpson opcode = pkt->insn[i].opcode; 42566d29a5eSTaylor Simpson if (pkt->insn[i].part1) { 42666d29a5eSTaylor Simpson continue; /* Skip compare of cmp-jumps */ 42766d29a5eSTaylor Simpson } 42866d29a5eSTaylor Simpson 42966d29a5eSTaylor Simpson if (GET_ATTRIB(opcode, A_DCZEROA)) { 43092cfa25fSTaylor Simpson pkt->pkt_has_dczeroa = true; 43166d29a5eSTaylor Simpson } 43266d29a5eSTaylor Simpson 43366d29a5eSTaylor Simpson if (GET_ATTRIB(opcode, A_STORE)) { 434e2be9a5cSTaylor Simpson if (GET_ATTRIB(opcode, A_SCALAR_STORE) && 435e2be9a5cSTaylor Simpson !GET_ATTRIB(opcode, A_MEMSIZE_0B)) { 43666d29a5eSTaylor Simpson if (pkt->insn[i].slot == 0) { 43792cfa25fSTaylor Simpson pkt->pkt_has_store_s0 = true; 43866d29a5eSTaylor Simpson } else { 43992cfa25fSTaylor Simpson pkt->pkt_has_store_s1 = true; 44066d29a5eSTaylor Simpson } 44166d29a5eSTaylor Simpson } 442e2be9a5cSTaylor Simpson } 44366d29a5eSTaylor Simpson 444fb67c2bfSTaylor Simpson if (decode_opcode_can_jump(opcode)) { 445fb67c2bfSTaylor Simpson if (pkt->pkt_has_cof) { 446fb67c2bfSTaylor Simpson pkt->pkt_has_multi_cof = true; 447fb67c2bfSTaylor Simpson } 448fb67c2bfSTaylor Simpson pkt->pkt_has_cof = true; 449fb67c2bfSTaylor Simpson } 45066d29a5eSTaylor Simpson 45166d29a5eSTaylor Simpson pkt->insn[i].is_endloop = decode_opcode_ends_loop(opcode); 45266d29a5eSTaylor Simpson 45366d29a5eSTaylor Simpson pkt->pkt_has_endloop |= pkt->insn[i].is_endloop; 45466d29a5eSTaylor Simpson 455fb67c2bfSTaylor Simpson if (pkt->pkt_has_endloop) { 456fb67c2bfSTaylor Simpson if (pkt->pkt_has_cof) { 457fb67c2bfSTaylor Simpson pkt->pkt_has_multi_cof = true; 458fb67c2bfSTaylor Simpson } 459fb67c2bfSTaylor Simpson pkt->pkt_has_cof = true; 460fb67c2bfSTaylor Simpson } 46166d29a5eSTaylor Simpson } 46266d29a5eSTaylor Simpson } 46366d29a5eSTaylor Simpson 46466d29a5eSTaylor Simpson /* 46566d29a5eSTaylor Simpson * Shuffle for execution 46666d29a5eSTaylor Simpson * Move stores to end (in same order as encoding) 46766d29a5eSTaylor Simpson * Move compares to beginning (for use by .new insns) 46866d29a5eSTaylor Simpson */ 46966d29a5eSTaylor Simpson static void decode_shuffle_for_execution(Packet *packet) 47066d29a5eSTaylor Simpson { 47192cfa25fSTaylor Simpson bool changed = false; 47266d29a5eSTaylor Simpson int i; 47392cfa25fSTaylor Simpson bool flag; /* flag means we've seen a non-memory instruction */ 47466d29a5eSTaylor Simpson int n_mems; 47566d29a5eSTaylor Simpson int last_insn = packet->num_insns - 1; 47666d29a5eSTaylor Simpson 47766d29a5eSTaylor Simpson /* 47866d29a5eSTaylor Simpson * Skip end loops, somehow an end loop is getting in and messing 47966d29a5eSTaylor Simpson * up the order 48066d29a5eSTaylor Simpson */ 48166d29a5eSTaylor Simpson if (decode_opcode_ends_loop(packet->insn[last_insn].opcode)) { 48266d29a5eSTaylor Simpson last_insn--; 48366d29a5eSTaylor Simpson } 48466d29a5eSTaylor Simpson 48566d29a5eSTaylor Simpson do { 48692cfa25fSTaylor Simpson changed = false; 48766d29a5eSTaylor Simpson /* 48866d29a5eSTaylor Simpson * Stores go last, must not reorder. 48966d29a5eSTaylor Simpson * Cannot shuffle stores past loads, either. 49066d29a5eSTaylor Simpson * Iterate backwards. If we see a non-memory instruction, 49166d29a5eSTaylor Simpson * then a store, shuffle the store to the front. Don't shuffle 49266d29a5eSTaylor Simpson * stores wrt each other or a load. 49366d29a5eSTaylor Simpson */ 49492cfa25fSTaylor Simpson for (flag = false, n_mems = 0, i = last_insn; i >= 0; i--) { 49566d29a5eSTaylor Simpson int opcode = packet->insn[i].opcode; 49666d29a5eSTaylor Simpson 49766d29a5eSTaylor Simpson if (flag && GET_ATTRIB(opcode, A_STORE)) { 49866d29a5eSTaylor Simpson decode_send_insn_to(packet, i, last_insn - n_mems); 49966d29a5eSTaylor Simpson n_mems++; 50092cfa25fSTaylor Simpson changed = true; 50166d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_STORE)) { 50266d29a5eSTaylor Simpson n_mems++; 50366d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_LOAD)) { 50466d29a5eSTaylor Simpson /* 50566d29a5eSTaylor Simpson * Don't set flag, since we don't want to shuffle a 50666d29a5eSTaylor Simpson * store past a load 50766d29a5eSTaylor Simpson */ 50866d29a5eSTaylor Simpson n_mems++; 50966d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_DOTNEWVALUE)) { 51066d29a5eSTaylor Simpson /* 51166d29a5eSTaylor Simpson * Don't set flag, since we don't want to shuffle past 51266d29a5eSTaylor Simpson * a .new value 51366d29a5eSTaylor Simpson */ 51466d29a5eSTaylor Simpson } else { 51592cfa25fSTaylor Simpson flag = true; 51666d29a5eSTaylor Simpson } 51766d29a5eSTaylor Simpson } 51866d29a5eSTaylor Simpson 51966d29a5eSTaylor Simpson if (changed) { 52066d29a5eSTaylor Simpson continue; 52166d29a5eSTaylor Simpson } 52266d29a5eSTaylor Simpson /* Compares go first, may be reordered wrt each other */ 52392cfa25fSTaylor Simpson for (flag = false, i = 0; i < last_insn + 1; i++) { 52466d29a5eSTaylor Simpson int opcode = packet->insn[i].opcode; 52566d29a5eSTaylor Simpson 52666d29a5eSTaylor Simpson if ((strstr(opcode_wregs[opcode], "Pd4") || 52766d29a5eSTaylor Simpson strstr(opcode_wregs[opcode], "Pe4")) && 52866d29a5eSTaylor Simpson GET_ATTRIB(opcode, A_STORE) == 0) { 52966d29a5eSTaylor Simpson /* This should be a compare (not a store conditional) */ 53066d29a5eSTaylor Simpson if (flag) { 53166d29a5eSTaylor Simpson decode_send_insn_to(packet, i, 0); 53292cfa25fSTaylor Simpson changed = true; 53366d29a5eSTaylor Simpson continue; 53466d29a5eSTaylor Simpson } 53566d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_IMPLICIT_WRITES_P3) && 53666d29a5eSTaylor Simpson !decode_opcode_ends_loop(packet->insn[i].opcode)) { 53766d29a5eSTaylor Simpson /* 53866d29a5eSTaylor Simpson * spNloop instruction 53966d29a5eSTaylor Simpson * Don't reorder endloops; they are not valid for .new uses, 54066d29a5eSTaylor Simpson * and we want to match HW 54166d29a5eSTaylor Simpson */ 54266d29a5eSTaylor Simpson if (flag) { 54366d29a5eSTaylor Simpson decode_send_insn_to(packet, i, 0); 54492cfa25fSTaylor Simpson changed = true; 54566d29a5eSTaylor Simpson continue; 54666d29a5eSTaylor Simpson } 54766d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_IMPLICIT_WRITES_P0) && 54866d29a5eSTaylor Simpson !GET_ATTRIB(opcode, A_NEWCMPJUMP)) { 54966d29a5eSTaylor Simpson if (flag) { 55066d29a5eSTaylor Simpson decode_send_insn_to(packet, i, 0); 55192cfa25fSTaylor Simpson changed = true; 55266d29a5eSTaylor Simpson continue; 55366d29a5eSTaylor Simpson } 55466d29a5eSTaylor Simpson } else { 55592cfa25fSTaylor Simpson flag = true; 55666d29a5eSTaylor Simpson } 55766d29a5eSTaylor Simpson } 55866d29a5eSTaylor Simpson if (changed) { 55966d29a5eSTaylor Simpson continue; 56066d29a5eSTaylor Simpson } 56166d29a5eSTaylor Simpson } while (changed); 56266d29a5eSTaylor Simpson 56366d29a5eSTaylor Simpson /* 56466d29a5eSTaylor Simpson * If we have a .new register compare/branch, move that to the very 56566d29a5eSTaylor Simpson * very end, past stores 56666d29a5eSTaylor Simpson */ 56766d29a5eSTaylor Simpson for (i = 0; i < last_insn; i++) { 56866d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i].opcode, A_DOTNEWVALUE)) { 56966d29a5eSTaylor Simpson decode_send_insn_to(packet, i, last_insn); 57066d29a5eSTaylor Simpson break; 57166d29a5eSTaylor Simpson } 57266d29a5eSTaylor Simpson } 57366d29a5eSTaylor Simpson } 57466d29a5eSTaylor Simpson 57566d29a5eSTaylor Simpson static void 57666d29a5eSTaylor Simpson apply_extender(Packet *pkt, int i, uint32_t extender) 57766d29a5eSTaylor Simpson { 57866d29a5eSTaylor Simpson int immed_num; 57966d29a5eSTaylor Simpson uint32_t base_immed; 58066d29a5eSTaylor Simpson 581*1547a2d3STaylor Simpson immed_num = pkt->insn[i].which_extended; 582*1547a2d3STaylor Simpson g_assert(immed_num == opcode_which_immediate_is_extended(pkt->insn[i].opcode)); 58366d29a5eSTaylor Simpson base_immed = pkt->insn[i].immed[immed_num]; 58466d29a5eSTaylor Simpson 58566d29a5eSTaylor Simpson pkt->insn[i].immed[immed_num] = extender | fZXTN(6, 32, base_immed); 58666d29a5eSTaylor Simpson } 58766d29a5eSTaylor Simpson 58866d29a5eSTaylor Simpson static void decode_apply_extenders(Packet *packet) 58966d29a5eSTaylor Simpson { 59066d29a5eSTaylor Simpson int i; 59166d29a5eSTaylor Simpson for (i = 0; i < packet->num_insns; i++) { 59266d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i].opcode, A_IT_EXTENDER)) { 59392cfa25fSTaylor Simpson packet->insn[i + 1].extension_valid = true; 59466d29a5eSTaylor Simpson apply_extender(packet, i + 1, packet->insn[i].immed[0]); 59566d29a5eSTaylor Simpson } 59666d29a5eSTaylor Simpson } 59766d29a5eSTaylor Simpson } 59866d29a5eSTaylor Simpson 59966d29a5eSTaylor Simpson static void decode_remove_extenders(Packet *packet) 60066d29a5eSTaylor Simpson { 60166d29a5eSTaylor Simpson int i, j; 60266d29a5eSTaylor Simpson for (i = 0; i < packet->num_insns; i++) { 60366d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i].opcode, A_IT_EXTENDER)) { 60466d29a5eSTaylor Simpson /* Remove this one by moving the remaining instructions down */ 60566d29a5eSTaylor Simpson for (j = i; 60666d29a5eSTaylor Simpson (j < packet->num_insns - 1) && (j < INSTRUCTIONS_MAX - 1); 60766d29a5eSTaylor Simpson j++) { 60866d29a5eSTaylor Simpson packet->insn[j] = packet->insn[j + 1]; 60966d29a5eSTaylor Simpson } 61066d29a5eSTaylor Simpson packet->num_insns--; 61166d29a5eSTaylor Simpson } 61266d29a5eSTaylor Simpson } 61366d29a5eSTaylor Simpson } 61466d29a5eSTaylor Simpson 61566d29a5eSTaylor Simpson static SlotMask get_valid_slots(const Packet *pkt, unsigned int slot) 61666d29a5eSTaylor Simpson { 61760d1180bSTaylor Simpson if (GET_ATTRIB(pkt->insn[slot].opcode, A_EXTENSION)) { 61860d1180bSTaylor Simpson return mmvec_ext_decode_find_iclass_slots(pkt->insn[slot].opcode); 61960d1180bSTaylor Simpson } else { 62066d29a5eSTaylor Simpson return find_iclass_slots(pkt->insn[slot].opcode, 62166d29a5eSTaylor Simpson pkt->insn[slot].iclass); 62266d29a5eSTaylor Simpson } 62360d1180bSTaylor Simpson } 62466d29a5eSTaylor Simpson 62566d29a5eSTaylor Simpson #define DECODE_NEW_TABLE(TAG, SIZE, WHATNOT) /* NOTHING */ 62666d29a5eSTaylor Simpson #define TABLE_LINK(TABLE) /* NOTHING */ 62766d29a5eSTaylor Simpson #define TERMINAL(TAG, ENC) /* NOTHING */ 62866d29a5eSTaylor Simpson #define SUBINSNS(TAG, CLASSA, CLASSB, ENC) /* NOTHING */ 62966d29a5eSTaylor Simpson #define EXTSPACE(TAG, ENC) /* NOTHING */ 63066d29a5eSTaylor Simpson #define INVALID() /* NOTHING */ 63166d29a5eSTaylor Simpson #define DECODE_END_TABLE(...) /* NOTHING */ 63266d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) /* NOTHING */ 63366d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) /* NOTHING */ 63466d29a5eSTaylor Simpson 63566d29a5eSTaylor Simpson #define DECODE_REG(REGNO, WIDTH, STARTBIT) \ 63666d29a5eSTaylor Simpson insn->regno[REGNO] = ((encoding >> STARTBIT) & ((1 << WIDTH) - 1)); 63766d29a5eSTaylor Simpson 63866d29a5eSTaylor Simpson #define DECODE_IMPL_REG(REGNO, VAL) \ 63966d29a5eSTaylor Simpson insn->regno[REGNO] = VAL; 64066d29a5eSTaylor Simpson 64166d29a5eSTaylor Simpson #define DECODE_IMM(IMMNO, WIDTH, STARTBIT, VALSTART) \ 64266d29a5eSTaylor Simpson insn->immed[IMMNO] |= (((encoding >> STARTBIT) & ((1 << WIDTH) - 1))) << \ 64366d29a5eSTaylor Simpson (VALSTART); 64466d29a5eSTaylor Simpson 64566d29a5eSTaylor Simpson #define DECODE_IMM_SXT(IMMNO, WIDTH) \ 64666d29a5eSTaylor Simpson insn->immed[IMMNO] = ((((int32_t)insn->immed[IMMNO]) << (32 - WIDTH)) >> \ 64766d29a5eSTaylor Simpson (32 - WIDTH)); 64866d29a5eSTaylor Simpson 64966d29a5eSTaylor Simpson #define DECODE_IMM_NEG(IMMNO, WIDTH) \ 65066d29a5eSTaylor Simpson insn->immed[IMMNO] = -insn->immed[IMMNO]; 65166d29a5eSTaylor Simpson 65266d29a5eSTaylor Simpson #define DECODE_IMM_SHIFT(IMMNO, SHAMT) \ 65366d29a5eSTaylor Simpson if ((!insn->extension_valid) || \ 65466d29a5eSTaylor Simpson (insn->which_extended != IMMNO)) { \ 65566d29a5eSTaylor Simpson insn->immed[IMMNO] <<= SHAMT; \ 65666d29a5eSTaylor Simpson } 65766d29a5eSTaylor Simpson 65866d29a5eSTaylor Simpson #define DECODE_OPINFO(TAG, BEH) \ 65966d29a5eSTaylor Simpson case TAG: \ 66066d29a5eSTaylor Simpson { BEH } \ 66166d29a5eSTaylor Simpson break; \ 66266d29a5eSTaylor Simpson 66366d29a5eSTaylor Simpson /* 66466d29a5eSTaylor Simpson * Fill in the operands of the instruction 66566d29a5eSTaylor Simpson * dectree_generated.h.inc has a DECODE_OPINFO entry for each opcode 66666d29a5eSTaylor Simpson * For example, 66766d29a5eSTaylor Simpson * DECODE_OPINFO(A2_addi, 66866d29a5eSTaylor Simpson * DECODE_REG(0,5,0) 66966d29a5eSTaylor Simpson * DECODE_REG(1,5,16) 67066d29a5eSTaylor Simpson * DECODE_IMM(0,7,21,9) 67166d29a5eSTaylor Simpson * DECODE_IMM(0,9,5,0) 67266d29a5eSTaylor Simpson * DECODE_IMM_SXT(0,16) 67366d29a5eSTaylor Simpson * with the macros defined above, we'll fill in a switch statement 67466d29a5eSTaylor Simpson * where each case is an opcode tag. 67566d29a5eSTaylor Simpson */ 67666d29a5eSTaylor Simpson static void 67766d29a5eSTaylor Simpson decode_op(Insn *insn, Opcode tag, uint32_t encoding) 67866d29a5eSTaylor Simpson { 67966d29a5eSTaylor Simpson insn->immed[0] = 0; 68066d29a5eSTaylor Simpson insn->immed[1] = 0; 68166d29a5eSTaylor Simpson insn->opcode = tag; 68266d29a5eSTaylor Simpson if (insn->extension_valid) { 68366d29a5eSTaylor Simpson insn->which_extended = opcode_which_immediate_is_extended(tag); 68466d29a5eSTaylor Simpson } 68566d29a5eSTaylor Simpson 68666d29a5eSTaylor Simpson switch (tag) { 68766d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 68866d29a5eSTaylor Simpson default: 68966d29a5eSTaylor Simpson break; 69066d29a5eSTaylor Simpson } 69166d29a5eSTaylor Simpson 69266d29a5eSTaylor Simpson insn->generate = opcode_genptr[tag]; 69366d29a5eSTaylor Simpson 69466d29a5eSTaylor Simpson insn->iclass = iclass_bits(encoding); 69566d29a5eSTaylor Simpson } 69666d29a5eSTaylor Simpson 69766d29a5eSTaylor Simpson #undef DECODE_REG 69866d29a5eSTaylor Simpson #undef DECODE_IMPL_REG 69966d29a5eSTaylor Simpson #undef DECODE_IMM 70066d29a5eSTaylor Simpson #undef DECODE_IMM_SHIFT 70166d29a5eSTaylor Simpson #undef DECODE_OPINFO 70266d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 70366d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 70466d29a5eSTaylor Simpson #undef DECODE_END_TABLE 70566d29a5eSTaylor Simpson #undef INVALID 70666d29a5eSTaylor Simpson #undef TERMINAL 70766d29a5eSTaylor Simpson #undef SUBINSNS 70866d29a5eSTaylor Simpson #undef EXTSPACE 70966d29a5eSTaylor Simpson #undef TABLE_LINK 71066d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE 71166d29a5eSTaylor Simpson #undef DECODE_SEPARATOR_BITS 71266d29a5eSTaylor Simpson 71366d29a5eSTaylor Simpson static unsigned int 71466d29a5eSTaylor Simpson decode_subinsn_tablewalk(Insn *insn, const DectreeTable *table, 71566d29a5eSTaylor Simpson uint32_t encoding) 71666d29a5eSTaylor Simpson { 71766d29a5eSTaylor Simpson unsigned int i; 71866d29a5eSTaylor Simpson Opcode opc; 71966d29a5eSTaylor Simpson if (table->lookup_function) { 72066d29a5eSTaylor Simpson i = table->lookup_function(table->startbit, table->width, encoding); 72166d29a5eSTaylor Simpson } else { 72266d29a5eSTaylor Simpson i = extract32(encoding, table->startbit, table->width); 72366d29a5eSTaylor Simpson } 72466d29a5eSTaylor Simpson if (table->table[i].type == DECTREE_TABLE_LINK) { 72566d29a5eSTaylor Simpson return decode_subinsn_tablewalk(insn, table->table[i].table_link, 72666d29a5eSTaylor Simpson encoding); 72766d29a5eSTaylor Simpson } else if (table->table[i].type == DECTREE_TERMINAL) { 72866d29a5eSTaylor Simpson opc = table->table[i].opcode; 72966d29a5eSTaylor Simpson if ((encoding & decode_itable[opc].mask) != decode_itable[opc].match) { 73066d29a5eSTaylor Simpson return 0; 73166d29a5eSTaylor Simpson } 73266d29a5eSTaylor Simpson decode_op(insn, opc, encoding); 73366d29a5eSTaylor Simpson return 1; 73466d29a5eSTaylor Simpson } else { 73566d29a5eSTaylor Simpson return 0; 73666d29a5eSTaylor Simpson } 73766d29a5eSTaylor Simpson } 73866d29a5eSTaylor Simpson 73966d29a5eSTaylor Simpson static unsigned int get_insn_a(uint32_t encoding) 74066d29a5eSTaylor Simpson { 74166d29a5eSTaylor Simpson return extract32(encoding, 0, 13); 74266d29a5eSTaylor Simpson } 74366d29a5eSTaylor Simpson 74466d29a5eSTaylor Simpson static unsigned int get_insn_b(uint32_t encoding) 74566d29a5eSTaylor Simpson { 74666d29a5eSTaylor Simpson return extract32(encoding, 16, 13); 74766d29a5eSTaylor Simpson } 74866d29a5eSTaylor Simpson 74966d29a5eSTaylor Simpson static unsigned int 75066d29a5eSTaylor Simpson decode_insns_tablewalk(Insn *insn, const DectreeTable *table, 75166d29a5eSTaylor Simpson uint32_t encoding) 75266d29a5eSTaylor Simpson { 75366d29a5eSTaylor Simpson unsigned int i; 75466d29a5eSTaylor Simpson unsigned int a, b; 75566d29a5eSTaylor Simpson Opcode opc; 75666d29a5eSTaylor Simpson if (table->lookup_function) { 75766d29a5eSTaylor Simpson i = table->lookup_function(table->startbit, table->width, encoding); 75866d29a5eSTaylor Simpson } else { 75966d29a5eSTaylor Simpson i = extract32(encoding, table->startbit, table->width); 76066d29a5eSTaylor Simpson } 76166d29a5eSTaylor Simpson if (table->table[i].type == DECTREE_TABLE_LINK) { 76266d29a5eSTaylor Simpson return decode_insns_tablewalk(insn, table->table[i].table_link, 76366d29a5eSTaylor Simpson encoding); 76466d29a5eSTaylor Simpson } else if (table->table[i].type == DECTREE_SUBINSNS) { 76566d29a5eSTaylor Simpson a = get_insn_a(encoding); 76666d29a5eSTaylor Simpson b = get_insn_b(encoding); 76766d29a5eSTaylor Simpson b = decode_subinsn_tablewalk(insn, table->table[i].table_link_b, b); 76866d29a5eSTaylor Simpson a = decode_subinsn_tablewalk(insn + 1, table->table[i].table_link, a); 76966d29a5eSTaylor Simpson if ((a == 0) || (b == 0)) { 77066d29a5eSTaylor Simpson return 0; 77166d29a5eSTaylor Simpson } 77266d29a5eSTaylor Simpson return 2; 77366d29a5eSTaylor Simpson } else if (table->table[i].type == DECTREE_TERMINAL) { 77466d29a5eSTaylor Simpson opc = table->table[i].opcode; 77566d29a5eSTaylor Simpson if ((encoding & decode_itable[opc].mask) != decode_itable[opc].match) { 77666d29a5eSTaylor Simpson if ((encoding & decode_legacy_itable[opc].mask) != 77766d29a5eSTaylor Simpson decode_legacy_itable[opc].match) { 77866d29a5eSTaylor Simpson return 0; 77966d29a5eSTaylor Simpson } 78066d29a5eSTaylor Simpson } 78166d29a5eSTaylor Simpson decode_op(insn, opc, encoding); 78266d29a5eSTaylor Simpson return 1; 78360d1180bSTaylor Simpson } else if (table->table[i].type == DECTREE_EXTSPACE) { 78460d1180bSTaylor Simpson /* 78560d1180bSTaylor Simpson * For now, HVX will be the only coproc 78660d1180bSTaylor Simpson */ 78760d1180bSTaylor Simpson return decode_insns_tablewalk(insn, ext_trees[EXT_IDX_mmvec], encoding); 78866d29a5eSTaylor Simpson } else { 78966d29a5eSTaylor Simpson return 0; 79066d29a5eSTaylor Simpson } 79166d29a5eSTaylor Simpson } 79266d29a5eSTaylor Simpson 79366d29a5eSTaylor Simpson static unsigned int 794*1547a2d3STaylor Simpson decode_insns(DisasContext *ctx, Insn *insn, uint32_t encoding) 79566d29a5eSTaylor Simpson { 79666d29a5eSTaylor Simpson const DectreeTable *table; 79766d29a5eSTaylor Simpson if (parse_bits(encoding) != 0) { 798*1547a2d3STaylor Simpson if (decode_normal(ctx, encoding) || 799*1547a2d3STaylor Simpson decode_hvx(ctx, encoding)) { 800*1547a2d3STaylor Simpson insn->generate = opcode_genptr[insn->opcode]; 801*1547a2d3STaylor Simpson insn->iclass = iclass_bits(encoding); 802*1547a2d3STaylor Simpson return 1; 803*1547a2d3STaylor Simpson } 80466d29a5eSTaylor Simpson /* Start with PP table - 32 bit instructions */ 80566d29a5eSTaylor Simpson table = &dectree_table_DECODE_ROOT_32; 806*1547a2d3STaylor Simpson g_assert_not_reached(); 80766d29a5eSTaylor Simpson } else { 80866d29a5eSTaylor Simpson /* start with EE table - duplex instructions */ 80966d29a5eSTaylor Simpson table = &dectree_table_DECODE_ROOT_EE; 81066d29a5eSTaylor Simpson } 81166d29a5eSTaylor Simpson return decode_insns_tablewalk(insn, table, encoding); 81266d29a5eSTaylor Simpson } 81366d29a5eSTaylor Simpson 81466d29a5eSTaylor Simpson static void decode_add_endloop_insn(Insn *insn, int loopnum) 81566d29a5eSTaylor Simpson { 81666d29a5eSTaylor Simpson if (loopnum == 10) { 81766d29a5eSTaylor Simpson insn->opcode = J2_endloop01; 81866d29a5eSTaylor Simpson insn->generate = opcode_genptr[J2_endloop01]; 81966d29a5eSTaylor Simpson } else if (loopnum == 1) { 82066d29a5eSTaylor Simpson insn->opcode = J2_endloop1; 82166d29a5eSTaylor Simpson insn->generate = opcode_genptr[J2_endloop1]; 82266d29a5eSTaylor Simpson } else if (loopnum == 0) { 82366d29a5eSTaylor Simpson insn->opcode = J2_endloop0; 82466d29a5eSTaylor Simpson insn->generate = opcode_genptr[J2_endloop0]; 82566d29a5eSTaylor Simpson } else { 82666d29a5eSTaylor Simpson g_assert_not_reached(); 82766d29a5eSTaylor Simpson } 82866d29a5eSTaylor Simpson } 82966d29a5eSTaylor Simpson 83092cfa25fSTaylor Simpson static bool decode_parsebits_is_loopend(uint32_t encoding32) 83166d29a5eSTaylor Simpson { 83266d29a5eSTaylor Simpson uint32_t bits = parse_bits(encoding32); 83366d29a5eSTaylor Simpson return bits == 0x2; 83466d29a5eSTaylor Simpson } 83566d29a5eSTaylor Simpson 83614edcf11SMatheus Tavares Bernardino static bool has_valid_slot_assignment(Packet *pkt) 83714edcf11SMatheus Tavares Bernardino { 83814edcf11SMatheus Tavares Bernardino int used_slots = 0; 83914edcf11SMatheus Tavares Bernardino for (int i = 0; i < pkt->num_insns; i++) { 84014edcf11SMatheus Tavares Bernardino int slot_mask; 84114edcf11SMatheus Tavares Bernardino Insn *insn = &pkt->insn[i]; 84214edcf11SMatheus Tavares Bernardino if (decode_opcode_ends_loop(insn->opcode)) { 84314edcf11SMatheus Tavares Bernardino /* We overload slot 0 for endloop. */ 84414edcf11SMatheus Tavares Bernardino continue; 84514edcf11SMatheus Tavares Bernardino } 84614edcf11SMatheus Tavares Bernardino slot_mask = 1 << insn->slot; 84714edcf11SMatheus Tavares Bernardino if (used_slots & slot_mask) { 84814edcf11SMatheus Tavares Bernardino return false; 84914edcf11SMatheus Tavares Bernardino } 85014edcf11SMatheus Tavares Bernardino used_slots |= slot_mask; 85114edcf11SMatheus Tavares Bernardino } 85214edcf11SMatheus Tavares Bernardino return true; 85314edcf11SMatheus Tavares Bernardino } 85414edcf11SMatheus Tavares Bernardino 85514edcf11SMatheus Tavares Bernardino static bool 85666d29a5eSTaylor Simpson decode_set_slot_number(Packet *pkt) 85766d29a5eSTaylor Simpson { 85866d29a5eSTaylor Simpson int slot; 85966d29a5eSTaylor Simpson int i; 86092cfa25fSTaylor Simpson bool hit_mem_insn = false; 86192cfa25fSTaylor Simpson bool hit_duplex = false; 86292cfa25fSTaylor Simpson bool slot0_found = false; 86392cfa25fSTaylor Simpson bool slot1_found = false; 86492cfa25fSTaylor Simpson int slot1_iidx = 0; 86566d29a5eSTaylor Simpson 86666d29a5eSTaylor Simpson /* 86766d29a5eSTaylor Simpson * The slots are encoded in reverse order 86866d29a5eSTaylor Simpson * For each instruction, count down until you find a suitable slot 86966d29a5eSTaylor Simpson */ 87066d29a5eSTaylor Simpson for (i = 0, slot = 3; i < pkt->num_insns; i++) { 87166d29a5eSTaylor Simpson SlotMask valid_slots = get_valid_slots(pkt, i); 87266d29a5eSTaylor Simpson 87366d29a5eSTaylor Simpson while (!(valid_slots & (1 << slot))) { 87466d29a5eSTaylor Simpson slot--; 87566d29a5eSTaylor Simpson } 87666d29a5eSTaylor Simpson pkt->insn[i].slot = slot; 87766d29a5eSTaylor Simpson if (slot) { 87866d29a5eSTaylor Simpson /* I've assigned the slot, now decrement it for the next insn */ 87966d29a5eSTaylor Simpson slot--; 88066d29a5eSTaylor Simpson } 88166d29a5eSTaylor Simpson } 88266d29a5eSTaylor Simpson 88366d29a5eSTaylor Simpson /* Fix the exceptions - mem insns to slot 0,1 */ 88466d29a5eSTaylor Simpson for (i = pkt->num_insns - 1; i >= 0; i--) { 88566d29a5eSTaylor Simpson /* First memory instruction always goes to slot 0 */ 88666d29a5eSTaylor Simpson if ((GET_ATTRIB(pkt->insn[i].opcode, A_MEMLIKE) || 88766d29a5eSTaylor Simpson GET_ATTRIB(pkt->insn[i].opcode, A_MEMLIKE_PACKET_RULES)) && 88866d29a5eSTaylor Simpson !hit_mem_insn) { 88992cfa25fSTaylor Simpson hit_mem_insn = true; 89066d29a5eSTaylor Simpson pkt->insn[i].slot = 0; 89166d29a5eSTaylor Simpson continue; 89266d29a5eSTaylor Simpson } 89366d29a5eSTaylor Simpson 89466d29a5eSTaylor Simpson /* Next memory instruction always goes to slot 1 */ 89566d29a5eSTaylor Simpson if ((GET_ATTRIB(pkt->insn[i].opcode, A_MEMLIKE) || 89666d29a5eSTaylor Simpson GET_ATTRIB(pkt->insn[i].opcode, A_MEMLIKE_PACKET_RULES)) && 89766d29a5eSTaylor Simpson hit_mem_insn) { 89866d29a5eSTaylor Simpson pkt->insn[i].slot = 1; 89966d29a5eSTaylor Simpson } 90066d29a5eSTaylor Simpson } 90166d29a5eSTaylor Simpson 90266d29a5eSTaylor Simpson /* Fix the exceptions - duplex always slot 0,1 */ 90366d29a5eSTaylor Simpson for (i = pkt->num_insns - 1; i >= 0; i--) { 90466d29a5eSTaylor Simpson /* First subinsn always goes to slot 0 */ 90566d29a5eSTaylor Simpson if (GET_ATTRIB(pkt->insn[i].opcode, A_SUBINSN) && !hit_duplex) { 90692cfa25fSTaylor Simpson hit_duplex = true; 90766d29a5eSTaylor Simpson pkt->insn[i].slot = 0; 90866d29a5eSTaylor Simpson continue; 90966d29a5eSTaylor Simpson } 91066d29a5eSTaylor Simpson 91166d29a5eSTaylor Simpson /* Next subinsn always goes to slot 1 */ 91266d29a5eSTaylor Simpson if (GET_ATTRIB(pkt->insn[i].opcode, A_SUBINSN) && hit_duplex) { 91366d29a5eSTaylor Simpson pkt->insn[i].slot = 1; 91466d29a5eSTaylor Simpson } 91566d29a5eSTaylor Simpson } 91666d29a5eSTaylor Simpson 91766d29a5eSTaylor Simpson /* Fix the exceptions - slot 1 is never empty, always aligns to slot 0 */ 91866d29a5eSTaylor Simpson for (i = pkt->num_insns - 1; i >= 0; i--) { 91966d29a5eSTaylor Simpson /* Is slot0 used? */ 92066d29a5eSTaylor Simpson if (pkt->insn[i].slot == 0) { 92192cfa25fSTaylor Simpson bool is_endloop = (pkt->insn[i].opcode == J2_endloop01); 92266d29a5eSTaylor Simpson is_endloop |= (pkt->insn[i].opcode == J2_endloop0); 92366d29a5eSTaylor Simpson is_endloop |= (pkt->insn[i].opcode == J2_endloop1); 92466d29a5eSTaylor Simpson 92566d29a5eSTaylor Simpson /* 92666d29a5eSTaylor Simpson * Make sure it's not endloop since, we're overloading 92766d29a5eSTaylor Simpson * slot0 for endloop 92866d29a5eSTaylor Simpson */ 92966d29a5eSTaylor Simpson if (!is_endloop) { 93092cfa25fSTaylor Simpson slot0_found = true; 93166d29a5eSTaylor Simpson } 93266d29a5eSTaylor Simpson } 93366d29a5eSTaylor Simpson /* Is slot1 used? */ 93466d29a5eSTaylor Simpson if (pkt->insn[i].slot == 1) { 93592cfa25fSTaylor Simpson slot1_found = true; 93666d29a5eSTaylor Simpson slot1_iidx = i; 93766d29a5eSTaylor Simpson } 93866d29a5eSTaylor Simpson } 93966d29a5eSTaylor Simpson /* Is slot0 empty and slot1 used? */ 94092cfa25fSTaylor Simpson if ((!slot0_found) && slot1_found) { 94166d29a5eSTaylor Simpson /* Then push it to slot0 */ 94266d29a5eSTaylor Simpson pkt->insn[slot1_iidx].slot = 0; 94366d29a5eSTaylor Simpson } 94414edcf11SMatheus Tavares Bernardino 94514edcf11SMatheus Tavares Bernardino return has_valid_slot_assignment(pkt); 94666d29a5eSTaylor Simpson } 94766d29a5eSTaylor Simpson 94866d29a5eSTaylor Simpson /* 94966d29a5eSTaylor Simpson * decode_packet 95066d29a5eSTaylor Simpson * Decodes packet with given words 95166d29a5eSTaylor Simpson * Returns 0 on insufficient words, 95266d29a5eSTaylor Simpson * or number of words used on success 95366d29a5eSTaylor Simpson */ 95466d29a5eSTaylor Simpson 955*1547a2d3STaylor Simpson int decode_packet(DisasContext *ctx, int max_words, const uint32_t *words, 956*1547a2d3STaylor Simpson Packet *pkt, bool disas_only) 95766d29a5eSTaylor Simpson { 95866d29a5eSTaylor Simpson int num_insns = 0; 95966d29a5eSTaylor Simpson int words_read = 0; 96092cfa25fSTaylor Simpson bool end_of_packet = false; 96166d29a5eSTaylor Simpson int new_insns = 0; 96260d1180bSTaylor Simpson int i; 96366d29a5eSTaylor Simpson uint32_t encoding32; 96466d29a5eSTaylor Simpson 96566d29a5eSTaylor Simpson /* Initialize */ 96666d29a5eSTaylor Simpson memset(pkt, 0, sizeof(*pkt)); 96766d29a5eSTaylor Simpson /* Try to build packet */ 96866d29a5eSTaylor Simpson while (!end_of_packet && (words_read < max_words)) { 969*1547a2d3STaylor Simpson Insn *insn = &pkt->insn[num_insns]; 970*1547a2d3STaylor Simpson ctx->insn = insn; 97166d29a5eSTaylor Simpson encoding32 = words[words_read]; 97266d29a5eSTaylor Simpson end_of_packet = is_packet_end(encoding32); 973*1547a2d3STaylor Simpson new_insns = decode_insns(ctx, insn, encoding32); 97466d29a5eSTaylor Simpson g_assert(new_insns > 0); 97566d29a5eSTaylor Simpson /* 97666d29a5eSTaylor Simpson * If we saw an extender, mark next word extended so immediate 97766d29a5eSTaylor Simpson * decode works 97866d29a5eSTaylor Simpson */ 97966d29a5eSTaylor Simpson if (pkt->insn[num_insns].opcode == A4_ext) { 98092cfa25fSTaylor Simpson pkt->insn[num_insns + 1].extension_valid = true; 98166d29a5eSTaylor Simpson } 98266d29a5eSTaylor Simpson num_insns += new_insns; 98366d29a5eSTaylor Simpson words_read++; 98466d29a5eSTaylor Simpson } 98566d29a5eSTaylor Simpson 98666d29a5eSTaylor Simpson pkt->num_insns = num_insns; 98766d29a5eSTaylor Simpson if (!end_of_packet) { 98866d29a5eSTaylor Simpson /* Ran out of words! */ 98966d29a5eSTaylor Simpson return 0; 99066d29a5eSTaylor Simpson } 99166d29a5eSTaylor Simpson pkt->encod_pkt_size_in_bytes = words_read * 4; 99260d1180bSTaylor Simpson pkt->pkt_has_hvx = false; 99360d1180bSTaylor Simpson for (i = 0; i < num_insns; i++) { 99460d1180bSTaylor Simpson pkt->pkt_has_hvx |= 99560d1180bSTaylor Simpson GET_ATTRIB(pkt->insn[i].opcode, A_CVI); 99660d1180bSTaylor Simpson } 99766d29a5eSTaylor Simpson 99866d29a5eSTaylor Simpson /* 99966d29a5eSTaylor Simpson * Check for :endloop in the parse bits 100066d29a5eSTaylor Simpson * Section 10.6 of the Programmer's Reference describes the encoding 100166d29a5eSTaylor Simpson * The end of hardware loop 0 can be encoded with 2 words 100266d29a5eSTaylor Simpson * The end of hardware loop 1 needs 3 words 100366d29a5eSTaylor Simpson */ 100466d29a5eSTaylor Simpson if ((words_read == 2) && (decode_parsebits_is_loopend(words[0]))) { 100566d29a5eSTaylor Simpson decode_add_endloop_insn(&pkt->insn[pkt->num_insns++], 0); 100666d29a5eSTaylor Simpson } 100766d29a5eSTaylor Simpson if (words_read >= 3) { 100892cfa25fSTaylor Simpson bool has_loop0, has_loop1; 100966d29a5eSTaylor Simpson has_loop0 = decode_parsebits_is_loopend(words[0]); 101066d29a5eSTaylor Simpson has_loop1 = decode_parsebits_is_loopend(words[1]); 101166d29a5eSTaylor Simpson if (has_loop0 && has_loop1) { 101266d29a5eSTaylor Simpson decode_add_endloop_insn(&pkt->insn[pkt->num_insns++], 10); 101366d29a5eSTaylor Simpson } else if (has_loop1) { 101466d29a5eSTaylor Simpson decode_add_endloop_insn(&pkt->insn[pkt->num_insns++], 1); 101566d29a5eSTaylor Simpson } else if (has_loop0) { 101666d29a5eSTaylor Simpson decode_add_endloop_insn(&pkt->insn[pkt->num_insns++], 0); 101766d29a5eSTaylor Simpson } 101866d29a5eSTaylor Simpson } 101966d29a5eSTaylor Simpson 102066d29a5eSTaylor Simpson decode_apply_extenders(pkt); 102166d29a5eSTaylor Simpson if (!disas_only) { 102266d29a5eSTaylor Simpson decode_remove_extenders(pkt); 102314edcf11SMatheus Tavares Bernardino if (!decode_set_slot_number(pkt)) { 102414edcf11SMatheus Tavares Bernardino /* Invalid packet */ 102514edcf11SMatheus Tavares Bernardino return 0; 102666d29a5eSTaylor Simpson } 102714edcf11SMatheus Tavares Bernardino } 102866d29a5eSTaylor Simpson decode_fill_newvalue_regno(pkt); 102966d29a5eSTaylor Simpson 103060d1180bSTaylor Simpson if (pkt->pkt_has_hvx) { 103160d1180bSTaylor Simpson mmvec_ext_decode_checks(pkt, disas_only); 103260d1180bSTaylor Simpson } 103360d1180bSTaylor Simpson 103466d29a5eSTaylor Simpson if (!disas_only) { 103566d29a5eSTaylor Simpson decode_shuffle_for_execution(pkt); 103666d29a5eSTaylor Simpson decode_split_cmpjump(pkt); 103766d29a5eSTaylor Simpson decode_set_insn_attr_fields(pkt); 103866d29a5eSTaylor Simpson } 103966d29a5eSTaylor Simpson 104066d29a5eSTaylor Simpson return words_read; 104166d29a5eSTaylor Simpson } 104266d29a5eSTaylor Simpson 104366d29a5eSTaylor Simpson /* Used for "-d in_asm" logging */ 104466d29a5eSTaylor Simpson int disassemble_hexagon(uint32_t *words, int nwords, bfd_vma pc, 104566d29a5eSTaylor Simpson GString *buf) 104666d29a5eSTaylor Simpson { 1047*1547a2d3STaylor Simpson DisasContext ctx; 104866d29a5eSTaylor Simpson Packet pkt; 104966d29a5eSTaylor Simpson 1050*1547a2d3STaylor Simpson memset(&ctx, 0, sizeof(DisasContext)); 1051*1547a2d3STaylor Simpson ctx.pkt = &pkt; 1052*1547a2d3STaylor Simpson 1053*1547a2d3STaylor Simpson if (decode_packet(&ctx, nwords, words, &pkt, true) > 0) { 105466d29a5eSTaylor Simpson snprint_a_pkt_disas(buf, &pkt, words, pc); 105566d29a5eSTaylor Simpson return pkt.encod_pkt_size_in_bytes; 105666d29a5eSTaylor Simpson } else { 105766d29a5eSTaylor Simpson g_string_assign(buf, "<invalid>"); 105866d29a5eSTaylor Simpson return 0; 105966d29a5eSTaylor Simpson } 106066d29a5eSTaylor Simpson } 1061