166d29a5eSTaylor Simpson /* 266d29a5eSTaylor Simpson * Copyright(c) 2019-2021 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) 50*61c9aab0STaylor 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 5566d29a5eSTaylor Simpson typedef struct { 5666d29a5eSTaylor Simpson const struct DectreeTable *table_link; 5766d29a5eSTaylor Simpson const struct DectreeTable *table_link_b; 5866d29a5eSTaylor Simpson Opcode opcode; 5966d29a5eSTaylor Simpson enum { 6066d29a5eSTaylor Simpson DECTREE_ENTRY_INVALID, 6166d29a5eSTaylor Simpson DECTREE_TABLE_LINK, 6266d29a5eSTaylor Simpson DECTREE_SUBINSNS, 6366d29a5eSTaylor Simpson DECTREE_EXTSPACE, 6466d29a5eSTaylor Simpson DECTREE_TERMINAL 6566d29a5eSTaylor Simpson } type; 6666d29a5eSTaylor Simpson } DectreeEntry; 6766d29a5eSTaylor Simpson 6866d29a5eSTaylor Simpson typedef struct DectreeTable { 6966d29a5eSTaylor Simpson unsigned int (*lookup_function)(int startbit, int width, uint32_t opcode); 7066d29a5eSTaylor Simpson unsigned int size; 7166d29a5eSTaylor Simpson unsigned int startbit; 7266d29a5eSTaylor Simpson unsigned int width; 7366d29a5eSTaylor Simpson const DectreeEntry table[]; 7466d29a5eSTaylor Simpson } DectreeTable; 7566d29a5eSTaylor Simpson 7666d29a5eSTaylor Simpson #define DECODE_NEW_TABLE(TAG, SIZE, WHATNOT) \ 7766d29a5eSTaylor Simpson static const DectreeTable dectree_table_##TAG; 7866d29a5eSTaylor Simpson #define TABLE_LINK(TABLE) /* NOTHING */ 7966d29a5eSTaylor Simpson #define TERMINAL(TAG, ENC) /* NOTHING */ 8066d29a5eSTaylor Simpson #define SUBINSNS(TAG, CLASSA, CLASSB, ENC) /* NOTHING */ 8166d29a5eSTaylor Simpson #define EXTSPACE(TAG, ENC) /* NOTHING */ 8266d29a5eSTaylor Simpson #define INVALID() /* NOTHING */ 8366d29a5eSTaylor Simpson #define DECODE_END_TABLE(...) /* NOTHING */ 8466d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) /* NOTHING */ 8566d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) /* NOTHING */ 8666d29a5eSTaylor Simpson #define DECODE_OPINFO(...) /* NOTHING */ 8766d29a5eSTaylor Simpson 8866d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 8966d29a5eSTaylor Simpson 9066d29a5eSTaylor Simpson #undef DECODE_OPINFO 9166d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 9266d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 9366d29a5eSTaylor Simpson #undef DECODE_END_TABLE 9466d29a5eSTaylor Simpson #undef INVALID 9566d29a5eSTaylor Simpson #undef TERMINAL 9666d29a5eSTaylor Simpson #undef SUBINSNS 9766d29a5eSTaylor Simpson #undef EXTSPACE 9866d29a5eSTaylor Simpson #undef TABLE_LINK 9966d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE 10066d29a5eSTaylor Simpson #undef DECODE_SEPARATOR_BITS 10166d29a5eSTaylor Simpson 10266d29a5eSTaylor Simpson #define DECODE_SEPARATOR_BITS(START, WIDTH) NULL, START, WIDTH 10366d29a5eSTaylor Simpson #define DECODE_NEW_TABLE_HELPER(TAG, SIZE, FN, START, WIDTH) \ 10466d29a5eSTaylor Simpson static const DectreeTable dectree_table_##TAG = { \ 10566d29a5eSTaylor Simpson .size = SIZE, \ 10666d29a5eSTaylor Simpson .lookup_function = FN, \ 10766d29a5eSTaylor Simpson .startbit = START, \ 10866d29a5eSTaylor Simpson .width = WIDTH, \ 10966d29a5eSTaylor Simpson .table = { 11066d29a5eSTaylor Simpson #define DECODE_NEW_TABLE(TAG, SIZE, WHATNOT) \ 11166d29a5eSTaylor Simpson DECODE_NEW_TABLE_HELPER(TAG, SIZE, WHATNOT) 11266d29a5eSTaylor Simpson 11366d29a5eSTaylor Simpson #define TABLE_LINK(TABLE) \ 11466d29a5eSTaylor Simpson { .type = DECTREE_TABLE_LINK, .table_link = &dectree_table_##TABLE }, 11566d29a5eSTaylor Simpson #define TERMINAL(TAG, ENC) \ 11666d29a5eSTaylor Simpson { .type = DECTREE_TERMINAL, .opcode = TAG }, 11766d29a5eSTaylor Simpson #define SUBINSNS(TAG, CLASSA, CLASSB, ENC) \ 11866d29a5eSTaylor Simpson { \ 11966d29a5eSTaylor Simpson .type = DECTREE_SUBINSNS, \ 12066d29a5eSTaylor Simpson .table_link = &dectree_table_DECODE_SUBINSN_##CLASSA, \ 12166d29a5eSTaylor Simpson .table_link_b = &dectree_table_DECODE_SUBINSN_##CLASSB \ 12266d29a5eSTaylor Simpson }, 12366d29a5eSTaylor Simpson #define EXTSPACE(TAG, ENC) { .type = DECTREE_EXTSPACE }, 12466d29a5eSTaylor Simpson #define INVALID() { .type = DECTREE_ENTRY_INVALID, .opcode = XX_LAST_OPCODE }, 12566d29a5eSTaylor Simpson 12666d29a5eSTaylor Simpson #define DECODE_END_TABLE(...) } }; 12766d29a5eSTaylor Simpson 12866d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) /* NOTHING */ 12966d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) /* NOTHING */ 13066d29a5eSTaylor Simpson #define DECODE_OPINFO(...) /* NOTHING */ 13166d29a5eSTaylor Simpson 13266d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 13366d29a5eSTaylor Simpson 13466d29a5eSTaylor Simpson #undef DECODE_OPINFO 13566d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 13666d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 13766d29a5eSTaylor Simpson #undef DECODE_END_TABLE 13866d29a5eSTaylor Simpson #undef INVALID 13966d29a5eSTaylor Simpson #undef TERMINAL 14066d29a5eSTaylor Simpson #undef SUBINSNS 14166d29a5eSTaylor Simpson #undef EXTSPACE 14266d29a5eSTaylor Simpson #undef TABLE_LINK 14366d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE 14466d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE_HELPER 14566d29a5eSTaylor Simpson #undef DECODE_SEPARATOR_BITS 14666d29a5eSTaylor Simpson 14766d29a5eSTaylor Simpson static const DectreeTable dectree_table_DECODE_EXT_EXT_noext = { 14866d29a5eSTaylor Simpson .size = 1, .lookup_function = NULL, .startbit = 0, .width = 0, 14966d29a5eSTaylor Simpson .table = { 15066d29a5eSTaylor Simpson { .type = DECTREE_ENTRY_INVALID, .opcode = XX_LAST_OPCODE }, 15166d29a5eSTaylor Simpson } 15266d29a5eSTaylor Simpson }; 15366d29a5eSTaylor Simpson 15466d29a5eSTaylor Simpson static const DectreeTable *ext_trees[XX_LAST_EXT_IDX]; 15566d29a5eSTaylor Simpson 15666d29a5eSTaylor Simpson static void decode_ext_init(void) 15766d29a5eSTaylor Simpson { 15866d29a5eSTaylor Simpson int i; 15966d29a5eSTaylor Simpson for (i = EXT_IDX_noext; i < EXT_IDX_noext_AFTER; i++) { 16066d29a5eSTaylor Simpson ext_trees[i] = &dectree_table_DECODE_EXT_EXT_noext; 16166d29a5eSTaylor Simpson } 162*61c9aab0STaylor Simpson for (i = EXT_IDX_mmvec; i < EXT_IDX_mmvec_AFTER; i++) { 163*61c9aab0STaylor Simpson ext_trees[i] = &dectree_table_DECODE_EXT_EXT_mmvec; 164*61c9aab0STaylor Simpson } 16566d29a5eSTaylor Simpson } 16666d29a5eSTaylor Simpson 16766d29a5eSTaylor Simpson typedef struct { 16866d29a5eSTaylor Simpson uint32_t mask; 16966d29a5eSTaylor Simpson uint32_t match; 17066d29a5eSTaylor Simpson } DecodeITableEntry; 17166d29a5eSTaylor Simpson 17266d29a5eSTaylor Simpson #define DECODE_NEW_TABLE(TAG, SIZE, WHATNOT) /* NOTHING */ 17366d29a5eSTaylor Simpson #define TABLE_LINK(TABLE) /* NOTHING */ 17466d29a5eSTaylor Simpson #define TERMINAL(TAG, ENC) /* NOTHING */ 17566d29a5eSTaylor Simpson #define SUBINSNS(TAG, CLASSA, CLASSB, ENC) /* NOTHING */ 17666d29a5eSTaylor Simpson #define EXTSPACE(TAG, ENC) /* NOTHING */ 17766d29a5eSTaylor Simpson #define INVALID() /* NOTHING */ 17866d29a5eSTaylor Simpson #define DECODE_END_TABLE(...) /* NOTHING */ 17966d29a5eSTaylor Simpson #define DECODE_OPINFO(...) /* NOTHING */ 18066d29a5eSTaylor Simpson 18166d29a5eSTaylor Simpson #define DECODE_MATCH_INFO_NORMAL(TAG, MASK, MATCH) \ 18266d29a5eSTaylor Simpson [TAG] = { \ 18366d29a5eSTaylor Simpson .mask = MASK, \ 18466d29a5eSTaylor Simpson .match = MATCH, \ 18566d29a5eSTaylor Simpson }, 18666d29a5eSTaylor Simpson 18766d29a5eSTaylor Simpson #define DECODE_MATCH_INFO_NULL(TAG, MASK, MATCH) \ 18866d29a5eSTaylor Simpson [TAG] = { .match = ~0 }, 18966d29a5eSTaylor Simpson 19066d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) DECODE_MATCH_INFO_NORMAL(__VA_ARGS__) 19166d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) /* NOTHING */ 19266d29a5eSTaylor Simpson 19366d29a5eSTaylor Simpson static const DecodeITableEntry decode_itable[XX_LAST_OPCODE] = { 19466d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 19566d29a5eSTaylor Simpson }; 19666d29a5eSTaylor Simpson 19766d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 19866d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) DECODE_MATCH_INFO_NULL(__VA_ARGS__) 19966d29a5eSTaylor Simpson 20066d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 20166d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) DECODE_MATCH_INFO_NORMAL(__VA_ARGS__) 20266d29a5eSTaylor Simpson 20366d29a5eSTaylor Simpson static const DecodeITableEntry decode_legacy_itable[XX_LAST_OPCODE] = { 20466d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 20566d29a5eSTaylor Simpson }; 20666d29a5eSTaylor Simpson 20766d29a5eSTaylor Simpson #undef DECODE_OPINFO 20866d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 20966d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 21066d29a5eSTaylor Simpson #undef DECODE_END_TABLE 21166d29a5eSTaylor Simpson #undef INVALID 21266d29a5eSTaylor Simpson #undef TERMINAL 21366d29a5eSTaylor Simpson #undef SUBINSNS 21466d29a5eSTaylor Simpson #undef EXTSPACE 21566d29a5eSTaylor Simpson #undef TABLE_LINK 21666d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE 21766d29a5eSTaylor Simpson #undef DECODE_SEPARATOR_BITS 21866d29a5eSTaylor Simpson 21966d29a5eSTaylor Simpson void decode_init(void) 22066d29a5eSTaylor Simpson { 22166d29a5eSTaylor Simpson decode_ext_init(); 22266d29a5eSTaylor Simpson } 22366d29a5eSTaylor Simpson 22466d29a5eSTaylor Simpson void decode_send_insn_to(Packet *packet, int start, int newloc) 22566d29a5eSTaylor Simpson { 22666d29a5eSTaylor Simpson Insn tmpinsn; 22766d29a5eSTaylor Simpson int direction; 22866d29a5eSTaylor Simpson int i; 22966d29a5eSTaylor Simpson if (start == newloc) { 23066d29a5eSTaylor Simpson return; 23166d29a5eSTaylor Simpson } 23266d29a5eSTaylor Simpson if (start < newloc) { 23366d29a5eSTaylor Simpson /* Move towards end */ 23466d29a5eSTaylor Simpson direction = 1; 23566d29a5eSTaylor Simpson } else { 23666d29a5eSTaylor Simpson /* move towards beginning */ 23766d29a5eSTaylor Simpson direction = -1; 23866d29a5eSTaylor Simpson } 23966d29a5eSTaylor Simpson for (i = start; i != newloc; i += direction) { 24066d29a5eSTaylor Simpson tmpinsn = packet->insn[i]; 24166d29a5eSTaylor Simpson packet->insn[i] = packet->insn[i + direction]; 24266d29a5eSTaylor Simpson packet->insn[i + direction] = tmpinsn; 24366d29a5eSTaylor Simpson } 24466d29a5eSTaylor Simpson } 24566d29a5eSTaylor Simpson 24666d29a5eSTaylor Simpson /* Fill newvalue registers with the correct regno */ 24766d29a5eSTaylor Simpson static void 24866d29a5eSTaylor Simpson decode_fill_newvalue_regno(Packet *packet) 24966d29a5eSTaylor Simpson { 25066d29a5eSTaylor Simpson int i, use_regidx, offset, def_idx, dst_idx; 25166d29a5eSTaylor Simpson uint16_t def_opcode, use_opcode; 25266d29a5eSTaylor Simpson char *dststr; 25366d29a5eSTaylor Simpson 25466d29a5eSTaylor Simpson for (i = 1; i < packet->num_insns; i++) { 25566d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i].opcode, A_DOTNEWVALUE) && 25666d29a5eSTaylor Simpson !GET_ATTRIB(packet->insn[i].opcode, A_EXTENSION)) { 25766d29a5eSTaylor Simpson use_opcode = packet->insn[i].opcode; 25866d29a5eSTaylor Simpson 25966d29a5eSTaylor Simpson /* It's a store, so we're adjusting the Nt field */ 26066d29a5eSTaylor Simpson if (GET_ATTRIB(use_opcode, A_STORE)) { 26166d29a5eSTaylor Simpson use_regidx = strchr(opcode_reginfo[use_opcode], 't') - 26266d29a5eSTaylor Simpson opcode_reginfo[use_opcode]; 26366d29a5eSTaylor Simpson } else { /* It's a Jump, so we're adjusting the Ns field */ 26466d29a5eSTaylor Simpson use_regidx = strchr(opcode_reginfo[use_opcode], 's') - 26566d29a5eSTaylor Simpson opcode_reginfo[use_opcode]; 26666d29a5eSTaylor Simpson } 26766d29a5eSTaylor Simpson 26866d29a5eSTaylor Simpson /* 26966d29a5eSTaylor Simpson * What's encoded at the N-field is the offset to who's producing 27066d29a5eSTaylor Simpson * the value. Shift off the LSB which indicates odd/even register, 27166d29a5eSTaylor Simpson * then walk backwards and skip over the constant extenders. 27266d29a5eSTaylor Simpson */ 27366d29a5eSTaylor Simpson offset = packet->insn[i].regno[use_regidx] >> 1; 27466d29a5eSTaylor Simpson def_idx = i - offset; 27566d29a5eSTaylor Simpson for (int j = 0; j < offset; j++) { 27666d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i - j - 1].opcode, A_IT_EXTENDER)) { 27766d29a5eSTaylor Simpson def_idx--; 27866d29a5eSTaylor Simpson } 27966d29a5eSTaylor Simpson } 28066d29a5eSTaylor Simpson 28166d29a5eSTaylor Simpson /* 28266d29a5eSTaylor Simpson * Check for a badly encoded N-field which points to an instruction 28366d29a5eSTaylor Simpson * out-of-range 28466d29a5eSTaylor Simpson */ 28566d29a5eSTaylor Simpson g_assert(!((def_idx < 0) || (def_idx > (packet->num_insns - 1)))); 28666d29a5eSTaylor Simpson 28766d29a5eSTaylor Simpson /* 28866d29a5eSTaylor Simpson * packet->insn[def_idx] is the producer 28966d29a5eSTaylor Simpson * Figure out which type of destination it produces 29066d29a5eSTaylor Simpson * and the corresponding index in the reginfo 29166d29a5eSTaylor Simpson */ 29266d29a5eSTaylor Simpson def_opcode = packet->insn[def_idx].opcode; 29366d29a5eSTaylor Simpson dststr = strstr(opcode_wregs[def_opcode], "Rd"); 29466d29a5eSTaylor Simpson if (dststr) { 29566d29a5eSTaylor Simpson dststr = strchr(opcode_reginfo[def_opcode], 'd'); 29666d29a5eSTaylor Simpson } else { 29766d29a5eSTaylor Simpson dststr = strstr(opcode_wregs[def_opcode], "Rx"); 29866d29a5eSTaylor Simpson if (dststr) { 29966d29a5eSTaylor Simpson dststr = strchr(opcode_reginfo[def_opcode], 'x'); 30066d29a5eSTaylor Simpson } else { 30166d29a5eSTaylor Simpson dststr = strstr(opcode_wregs[def_opcode], "Re"); 30266d29a5eSTaylor Simpson if (dststr) { 30366d29a5eSTaylor Simpson dststr = strchr(opcode_reginfo[def_opcode], 'e'); 30466d29a5eSTaylor Simpson } else { 30566d29a5eSTaylor Simpson dststr = strstr(opcode_wregs[def_opcode], "Ry"); 30666d29a5eSTaylor Simpson if (dststr) { 30766d29a5eSTaylor Simpson dststr = strchr(opcode_reginfo[def_opcode], 'y'); 30866d29a5eSTaylor Simpson } else { 30966d29a5eSTaylor Simpson g_assert_not_reached(); 31066d29a5eSTaylor Simpson } 31166d29a5eSTaylor Simpson } 31266d29a5eSTaylor Simpson } 31366d29a5eSTaylor Simpson } 31466d29a5eSTaylor Simpson g_assert(dststr != NULL); 31566d29a5eSTaylor Simpson 31666d29a5eSTaylor Simpson /* Now patch up the consumer with the register number */ 31766d29a5eSTaylor Simpson dst_idx = dststr - opcode_reginfo[def_opcode]; 31866d29a5eSTaylor Simpson packet->insn[i].regno[use_regidx] = 31966d29a5eSTaylor Simpson packet->insn[def_idx].regno[dst_idx]; 32066d29a5eSTaylor Simpson /* 32166d29a5eSTaylor Simpson * We need to remember who produces this value to later 32266d29a5eSTaylor Simpson * check if it was dynamically cancelled 32366d29a5eSTaylor Simpson */ 32466d29a5eSTaylor Simpson packet->insn[i].new_value_producer_slot = 32566d29a5eSTaylor Simpson packet->insn[def_idx].slot; 32666d29a5eSTaylor Simpson } 32766d29a5eSTaylor Simpson } 32866d29a5eSTaylor Simpson } 32966d29a5eSTaylor Simpson 33066d29a5eSTaylor Simpson /* Split CJ into a compare and a jump */ 33166d29a5eSTaylor Simpson static void decode_split_cmpjump(Packet *pkt) 33266d29a5eSTaylor Simpson { 33366d29a5eSTaylor Simpson int last, i; 33466d29a5eSTaylor Simpson int numinsns = pkt->num_insns; 33566d29a5eSTaylor Simpson 33666d29a5eSTaylor Simpson /* 33766d29a5eSTaylor Simpson * First, split all compare-jumps. 33866d29a5eSTaylor Simpson * The compare is sent to the end as a new instruction. 33966d29a5eSTaylor Simpson * Do it this way so we don't reorder dual jumps. Those need to stay in 34066d29a5eSTaylor Simpson * original order. 34166d29a5eSTaylor Simpson */ 34266d29a5eSTaylor Simpson for (i = 0; i < numinsns; i++) { 34366d29a5eSTaylor Simpson /* It's a cmp-jump */ 34466d29a5eSTaylor Simpson if (GET_ATTRIB(pkt->insn[i].opcode, A_NEWCMPJUMP)) { 34566d29a5eSTaylor Simpson last = pkt->num_insns; 34666d29a5eSTaylor Simpson pkt->insn[last] = pkt->insn[i]; /* copy the instruction */ 34792cfa25fSTaylor Simpson pkt->insn[last].part1 = true; /* last insn does the CMP */ 34892cfa25fSTaylor Simpson pkt->insn[i].part1 = false; /* existing insn does the JUMP */ 34966d29a5eSTaylor Simpson pkt->num_insns++; 35066d29a5eSTaylor Simpson } 35166d29a5eSTaylor Simpson } 35266d29a5eSTaylor Simpson 35366d29a5eSTaylor Simpson /* Now re-shuffle all the compares back to the beginning */ 35466d29a5eSTaylor Simpson for (i = 0; i < pkt->num_insns; i++) { 35566d29a5eSTaylor Simpson if (pkt->insn[i].part1) { 35666d29a5eSTaylor Simpson decode_send_insn_to(pkt, i, 0); 35766d29a5eSTaylor Simpson } 35866d29a5eSTaylor Simpson } 35966d29a5eSTaylor Simpson } 36066d29a5eSTaylor Simpson 36192cfa25fSTaylor Simpson static bool decode_opcode_can_jump(int opcode) 36266d29a5eSTaylor Simpson { 36366d29a5eSTaylor Simpson if ((GET_ATTRIB(opcode, A_JUMP)) || 36466d29a5eSTaylor Simpson (GET_ATTRIB(opcode, A_CALL)) || 36566d29a5eSTaylor Simpson (opcode == J2_trap0) || 36666d29a5eSTaylor Simpson (opcode == J2_pause)) { 36766d29a5eSTaylor Simpson /* Exception to A_JUMP attribute */ 36866d29a5eSTaylor Simpson if (opcode == J4_hintjumpr) { 36992cfa25fSTaylor Simpson return false; 37066d29a5eSTaylor Simpson } 37192cfa25fSTaylor Simpson return true; 37266d29a5eSTaylor Simpson } 37366d29a5eSTaylor Simpson 37492cfa25fSTaylor Simpson return false; 37566d29a5eSTaylor Simpson } 37666d29a5eSTaylor Simpson 37792cfa25fSTaylor Simpson static bool decode_opcode_ends_loop(int opcode) 37866d29a5eSTaylor Simpson { 37966d29a5eSTaylor Simpson return GET_ATTRIB(opcode, A_HWLOOP0_END) || 38066d29a5eSTaylor Simpson GET_ATTRIB(opcode, A_HWLOOP1_END); 38166d29a5eSTaylor Simpson } 38266d29a5eSTaylor Simpson 38366d29a5eSTaylor Simpson /* Set the is_* fields in each instruction */ 38466d29a5eSTaylor Simpson static void decode_set_insn_attr_fields(Packet *pkt) 38566d29a5eSTaylor Simpson { 38666d29a5eSTaylor Simpson int i; 38766d29a5eSTaylor Simpson int numinsns = pkt->num_insns; 38866d29a5eSTaylor Simpson uint16_t opcode; 38966d29a5eSTaylor Simpson 39092cfa25fSTaylor Simpson pkt->pkt_has_cof = false; 39192cfa25fSTaylor Simpson pkt->pkt_has_endloop = false; 39292cfa25fSTaylor Simpson pkt->pkt_has_dczeroa = false; 39366d29a5eSTaylor Simpson 39466d29a5eSTaylor Simpson for (i = 0; i < numinsns; i++) { 39566d29a5eSTaylor Simpson opcode = pkt->insn[i].opcode; 39666d29a5eSTaylor Simpson if (pkt->insn[i].part1) { 39766d29a5eSTaylor Simpson continue; /* Skip compare of cmp-jumps */ 39866d29a5eSTaylor Simpson } 39966d29a5eSTaylor Simpson 40066d29a5eSTaylor Simpson if (GET_ATTRIB(opcode, A_DCZEROA)) { 40192cfa25fSTaylor Simpson pkt->pkt_has_dczeroa = true; 40266d29a5eSTaylor Simpson } 40366d29a5eSTaylor Simpson 40466d29a5eSTaylor Simpson if (GET_ATTRIB(opcode, A_STORE)) { 40566d29a5eSTaylor Simpson if (pkt->insn[i].slot == 0) { 40692cfa25fSTaylor Simpson pkt->pkt_has_store_s0 = true; 40766d29a5eSTaylor Simpson } else { 40892cfa25fSTaylor Simpson pkt->pkt_has_store_s1 = true; 40966d29a5eSTaylor Simpson } 41066d29a5eSTaylor Simpson } 41166d29a5eSTaylor Simpson 41266d29a5eSTaylor Simpson pkt->pkt_has_cof |= decode_opcode_can_jump(opcode); 41366d29a5eSTaylor Simpson 41466d29a5eSTaylor Simpson pkt->insn[i].is_endloop = decode_opcode_ends_loop(opcode); 41566d29a5eSTaylor Simpson 41666d29a5eSTaylor Simpson pkt->pkt_has_endloop |= pkt->insn[i].is_endloop; 41766d29a5eSTaylor Simpson 41866d29a5eSTaylor Simpson pkt->pkt_has_cof |= pkt->pkt_has_endloop; 41966d29a5eSTaylor Simpson } 42066d29a5eSTaylor Simpson } 42166d29a5eSTaylor Simpson 42266d29a5eSTaylor Simpson /* 42366d29a5eSTaylor Simpson * Shuffle for execution 42466d29a5eSTaylor Simpson * Move stores to end (in same order as encoding) 42566d29a5eSTaylor Simpson * Move compares to beginning (for use by .new insns) 42666d29a5eSTaylor Simpson */ 42766d29a5eSTaylor Simpson static void decode_shuffle_for_execution(Packet *packet) 42866d29a5eSTaylor Simpson { 42992cfa25fSTaylor Simpson bool changed = false; 43066d29a5eSTaylor Simpson int i; 43192cfa25fSTaylor Simpson bool flag; /* flag means we've seen a non-memory instruction */ 43266d29a5eSTaylor Simpson int n_mems; 43366d29a5eSTaylor Simpson int last_insn = packet->num_insns - 1; 43466d29a5eSTaylor Simpson 43566d29a5eSTaylor Simpson /* 43666d29a5eSTaylor Simpson * Skip end loops, somehow an end loop is getting in and messing 43766d29a5eSTaylor Simpson * up the order 43866d29a5eSTaylor Simpson */ 43966d29a5eSTaylor Simpson if (decode_opcode_ends_loop(packet->insn[last_insn].opcode)) { 44066d29a5eSTaylor Simpson last_insn--; 44166d29a5eSTaylor Simpson } 44266d29a5eSTaylor Simpson 44366d29a5eSTaylor Simpson do { 44492cfa25fSTaylor Simpson changed = false; 44566d29a5eSTaylor Simpson /* 44666d29a5eSTaylor Simpson * Stores go last, must not reorder. 44766d29a5eSTaylor Simpson * Cannot shuffle stores past loads, either. 44866d29a5eSTaylor Simpson * Iterate backwards. If we see a non-memory instruction, 44966d29a5eSTaylor Simpson * then a store, shuffle the store to the front. Don't shuffle 45066d29a5eSTaylor Simpson * stores wrt each other or a load. 45166d29a5eSTaylor Simpson */ 45292cfa25fSTaylor Simpson for (flag = false, n_mems = 0, i = last_insn; i >= 0; i--) { 45366d29a5eSTaylor Simpson int opcode = packet->insn[i].opcode; 45466d29a5eSTaylor Simpson 45566d29a5eSTaylor Simpson if (flag && GET_ATTRIB(opcode, A_STORE)) { 45666d29a5eSTaylor Simpson decode_send_insn_to(packet, i, last_insn - n_mems); 45766d29a5eSTaylor Simpson n_mems++; 45892cfa25fSTaylor Simpson changed = true; 45966d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_STORE)) { 46066d29a5eSTaylor Simpson n_mems++; 46166d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_LOAD)) { 46266d29a5eSTaylor Simpson /* 46366d29a5eSTaylor Simpson * Don't set flag, since we don't want to shuffle a 46466d29a5eSTaylor Simpson * store past a load 46566d29a5eSTaylor Simpson */ 46666d29a5eSTaylor Simpson n_mems++; 46766d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_DOTNEWVALUE)) { 46866d29a5eSTaylor Simpson /* 46966d29a5eSTaylor Simpson * Don't set flag, since we don't want to shuffle past 47066d29a5eSTaylor Simpson * a .new value 47166d29a5eSTaylor Simpson */ 47266d29a5eSTaylor Simpson } else { 47392cfa25fSTaylor Simpson flag = true; 47466d29a5eSTaylor Simpson } 47566d29a5eSTaylor Simpson } 47666d29a5eSTaylor Simpson 47766d29a5eSTaylor Simpson if (changed) { 47866d29a5eSTaylor Simpson continue; 47966d29a5eSTaylor Simpson } 48066d29a5eSTaylor Simpson /* Compares go first, may be reordered wrt each other */ 48192cfa25fSTaylor Simpson for (flag = false, i = 0; i < last_insn + 1; i++) { 48266d29a5eSTaylor Simpson int opcode = packet->insn[i].opcode; 48366d29a5eSTaylor Simpson 48466d29a5eSTaylor Simpson if ((strstr(opcode_wregs[opcode], "Pd4") || 48566d29a5eSTaylor Simpson strstr(opcode_wregs[opcode], "Pe4")) && 48666d29a5eSTaylor Simpson GET_ATTRIB(opcode, A_STORE) == 0) { 48766d29a5eSTaylor Simpson /* This should be a compare (not a store conditional) */ 48866d29a5eSTaylor Simpson if (flag) { 48966d29a5eSTaylor Simpson decode_send_insn_to(packet, i, 0); 49092cfa25fSTaylor Simpson changed = true; 49166d29a5eSTaylor Simpson continue; 49266d29a5eSTaylor Simpson } 49366d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_IMPLICIT_WRITES_P3) && 49466d29a5eSTaylor Simpson !decode_opcode_ends_loop(packet->insn[i].opcode)) { 49566d29a5eSTaylor Simpson /* 49666d29a5eSTaylor Simpson * spNloop instruction 49766d29a5eSTaylor Simpson * Don't reorder endloops; they are not valid for .new uses, 49866d29a5eSTaylor Simpson * and we want to match HW 49966d29a5eSTaylor Simpson */ 50066d29a5eSTaylor Simpson if (flag) { 50166d29a5eSTaylor Simpson decode_send_insn_to(packet, i, 0); 50292cfa25fSTaylor Simpson changed = true; 50366d29a5eSTaylor Simpson continue; 50466d29a5eSTaylor Simpson } 50566d29a5eSTaylor Simpson } else if (GET_ATTRIB(opcode, A_IMPLICIT_WRITES_P0) && 50666d29a5eSTaylor Simpson !GET_ATTRIB(opcode, A_NEWCMPJUMP)) { 50766d29a5eSTaylor Simpson if (flag) { 50866d29a5eSTaylor Simpson decode_send_insn_to(packet, i, 0); 50992cfa25fSTaylor Simpson changed = true; 51066d29a5eSTaylor Simpson continue; 51166d29a5eSTaylor Simpson } 51266d29a5eSTaylor Simpson } else { 51392cfa25fSTaylor Simpson flag = true; 51466d29a5eSTaylor Simpson } 51566d29a5eSTaylor Simpson } 51666d29a5eSTaylor Simpson if (changed) { 51766d29a5eSTaylor Simpson continue; 51866d29a5eSTaylor Simpson } 51966d29a5eSTaylor Simpson } while (changed); 52066d29a5eSTaylor Simpson 52166d29a5eSTaylor Simpson /* 52266d29a5eSTaylor Simpson * If we have a .new register compare/branch, move that to the very 52366d29a5eSTaylor Simpson * very end, past stores 52466d29a5eSTaylor Simpson */ 52566d29a5eSTaylor Simpson for (i = 0; i < last_insn; i++) { 52666d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i].opcode, A_DOTNEWVALUE)) { 52766d29a5eSTaylor Simpson decode_send_insn_to(packet, i, last_insn); 52866d29a5eSTaylor Simpson break; 52966d29a5eSTaylor Simpson } 53066d29a5eSTaylor Simpson } 53166d29a5eSTaylor Simpson } 53266d29a5eSTaylor Simpson 53366d29a5eSTaylor Simpson static void 53466d29a5eSTaylor Simpson apply_extender(Packet *pkt, int i, uint32_t extender) 53566d29a5eSTaylor Simpson { 53666d29a5eSTaylor Simpson int immed_num; 53766d29a5eSTaylor Simpson uint32_t base_immed; 53866d29a5eSTaylor Simpson 53966d29a5eSTaylor Simpson immed_num = opcode_which_immediate_is_extended(pkt->insn[i].opcode); 54066d29a5eSTaylor Simpson base_immed = pkt->insn[i].immed[immed_num]; 54166d29a5eSTaylor Simpson 54266d29a5eSTaylor Simpson pkt->insn[i].immed[immed_num] = extender | fZXTN(6, 32, base_immed); 54366d29a5eSTaylor Simpson } 54466d29a5eSTaylor Simpson 54566d29a5eSTaylor Simpson static void decode_apply_extenders(Packet *packet) 54666d29a5eSTaylor Simpson { 54766d29a5eSTaylor Simpson int i; 54866d29a5eSTaylor Simpson for (i = 0; i < packet->num_insns; i++) { 54966d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i].opcode, A_IT_EXTENDER)) { 55092cfa25fSTaylor Simpson packet->insn[i + 1].extension_valid = true; 55166d29a5eSTaylor Simpson apply_extender(packet, i + 1, packet->insn[i].immed[0]); 55266d29a5eSTaylor Simpson } 55366d29a5eSTaylor Simpson } 55466d29a5eSTaylor Simpson } 55566d29a5eSTaylor Simpson 55666d29a5eSTaylor Simpson static void decode_remove_extenders(Packet *packet) 55766d29a5eSTaylor Simpson { 55866d29a5eSTaylor Simpson int i, j; 55966d29a5eSTaylor Simpson for (i = 0; i < packet->num_insns; i++) { 56066d29a5eSTaylor Simpson if (GET_ATTRIB(packet->insn[i].opcode, A_IT_EXTENDER)) { 56166d29a5eSTaylor Simpson /* Remove this one by moving the remaining instructions down */ 56266d29a5eSTaylor Simpson for (j = i; 56366d29a5eSTaylor Simpson (j < packet->num_insns - 1) && (j < INSTRUCTIONS_MAX - 1); 56466d29a5eSTaylor Simpson j++) { 56566d29a5eSTaylor Simpson packet->insn[j] = packet->insn[j + 1]; 56666d29a5eSTaylor Simpson } 56766d29a5eSTaylor Simpson packet->num_insns--; 56866d29a5eSTaylor Simpson } 56966d29a5eSTaylor Simpson } 57066d29a5eSTaylor Simpson } 57166d29a5eSTaylor Simpson 57266d29a5eSTaylor Simpson static SlotMask get_valid_slots(const Packet *pkt, unsigned int slot) 57366d29a5eSTaylor Simpson { 57460d1180bSTaylor Simpson if (GET_ATTRIB(pkt->insn[slot].opcode, A_EXTENSION)) { 57560d1180bSTaylor Simpson return mmvec_ext_decode_find_iclass_slots(pkt->insn[slot].opcode); 57660d1180bSTaylor Simpson } else { 57766d29a5eSTaylor Simpson return find_iclass_slots(pkt->insn[slot].opcode, 57866d29a5eSTaylor Simpson pkt->insn[slot].iclass); 57966d29a5eSTaylor Simpson } 58060d1180bSTaylor Simpson } 58166d29a5eSTaylor Simpson 58266d29a5eSTaylor Simpson #define DECODE_NEW_TABLE(TAG, SIZE, WHATNOT) /* NOTHING */ 58366d29a5eSTaylor Simpson #define TABLE_LINK(TABLE) /* NOTHING */ 58466d29a5eSTaylor Simpson #define TERMINAL(TAG, ENC) /* NOTHING */ 58566d29a5eSTaylor Simpson #define SUBINSNS(TAG, CLASSA, CLASSB, ENC) /* NOTHING */ 58666d29a5eSTaylor Simpson #define EXTSPACE(TAG, ENC) /* NOTHING */ 58766d29a5eSTaylor Simpson #define INVALID() /* NOTHING */ 58866d29a5eSTaylor Simpson #define DECODE_END_TABLE(...) /* NOTHING */ 58966d29a5eSTaylor Simpson #define DECODE_MATCH_INFO(...) /* NOTHING */ 59066d29a5eSTaylor Simpson #define DECODE_LEGACY_MATCH_INFO(...) /* NOTHING */ 59166d29a5eSTaylor Simpson 59266d29a5eSTaylor Simpson #define DECODE_REG(REGNO, WIDTH, STARTBIT) \ 59366d29a5eSTaylor Simpson insn->regno[REGNO] = ((encoding >> STARTBIT) & ((1 << WIDTH) - 1)); 59466d29a5eSTaylor Simpson 59566d29a5eSTaylor Simpson #define DECODE_IMPL_REG(REGNO, VAL) \ 59666d29a5eSTaylor Simpson insn->regno[REGNO] = VAL; 59766d29a5eSTaylor Simpson 59866d29a5eSTaylor Simpson #define DECODE_IMM(IMMNO, WIDTH, STARTBIT, VALSTART) \ 59966d29a5eSTaylor Simpson insn->immed[IMMNO] |= (((encoding >> STARTBIT) & ((1 << WIDTH) - 1))) << \ 60066d29a5eSTaylor Simpson (VALSTART); 60166d29a5eSTaylor Simpson 60266d29a5eSTaylor Simpson #define DECODE_IMM_SXT(IMMNO, WIDTH) \ 60366d29a5eSTaylor Simpson insn->immed[IMMNO] = ((((int32_t)insn->immed[IMMNO]) << (32 - WIDTH)) >> \ 60466d29a5eSTaylor Simpson (32 - WIDTH)); 60566d29a5eSTaylor Simpson 60666d29a5eSTaylor Simpson #define DECODE_IMM_NEG(IMMNO, WIDTH) \ 60766d29a5eSTaylor Simpson insn->immed[IMMNO] = -insn->immed[IMMNO]; 60866d29a5eSTaylor Simpson 60966d29a5eSTaylor Simpson #define DECODE_IMM_SHIFT(IMMNO, SHAMT) \ 61066d29a5eSTaylor Simpson if ((!insn->extension_valid) || \ 61166d29a5eSTaylor Simpson (insn->which_extended != IMMNO)) { \ 61266d29a5eSTaylor Simpson insn->immed[IMMNO] <<= SHAMT; \ 61366d29a5eSTaylor Simpson } 61466d29a5eSTaylor Simpson 61566d29a5eSTaylor Simpson #define DECODE_OPINFO(TAG, BEH) \ 61666d29a5eSTaylor Simpson case TAG: \ 61766d29a5eSTaylor Simpson { BEH } \ 61866d29a5eSTaylor Simpson break; \ 61966d29a5eSTaylor Simpson 62066d29a5eSTaylor Simpson /* 62166d29a5eSTaylor Simpson * Fill in the operands of the instruction 62266d29a5eSTaylor Simpson * dectree_generated.h.inc has a DECODE_OPINFO entry for each opcode 62366d29a5eSTaylor Simpson * For example, 62466d29a5eSTaylor Simpson * DECODE_OPINFO(A2_addi, 62566d29a5eSTaylor Simpson * DECODE_REG(0,5,0) 62666d29a5eSTaylor Simpson * DECODE_REG(1,5,16) 62766d29a5eSTaylor Simpson * DECODE_IMM(0,7,21,9) 62866d29a5eSTaylor Simpson * DECODE_IMM(0,9,5,0) 62966d29a5eSTaylor Simpson * DECODE_IMM_SXT(0,16) 63066d29a5eSTaylor Simpson * with the macros defined above, we'll fill in a switch statement 63166d29a5eSTaylor Simpson * where each case is an opcode tag. 63266d29a5eSTaylor Simpson */ 63366d29a5eSTaylor Simpson static void 63466d29a5eSTaylor Simpson decode_op(Insn *insn, Opcode tag, uint32_t encoding) 63566d29a5eSTaylor Simpson { 63666d29a5eSTaylor Simpson insn->immed[0] = 0; 63766d29a5eSTaylor Simpson insn->immed[1] = 0; 63866d29a5eSTaylor Simpson insn->opcode = tag; 63966d29a5eSTaylor Simpson if (insn->extension_valid) { 64066d29a5eSTaylor Simpson insn->which_extended = opcode_which_immediate_is_extended(tag); 64166d29a5eSTaylor Simpson } 64266d29a5eSTaylor Simpson 64366d29a5eSTaylor Simpson switch (tag) { 64466d29a5eSTaylor Simpson #include "dectree_generated.h.inc" 64566d29a5eSTaylor Simpson default: 64666d29a5eSTaylor Simpson break; 64766d29a5eSTaylor Simpson } 64866d29a5eSTaylor Simpson 64966d29a5eSTaylor Simpson insn->generate = opcode_genptr[tag]; 65066d29a5eSTaylor Simpson 65166d29a5eSTaylor Simpson insn->iclass = iclass_bits(encoding); 65266d29a5eSTaylor Simpson } 65366d29a5eSTaylor Simpson 65466d29a5eSTaylor Simpson #undef DECODE_REG 65566d29a5eSTaylor Simpson #undef DECODE_IMPL_REG 65666d29a5eSTaylor Simpson #undef DECODE_IMM 65766d29a5eSTaylor Simpson #undef DECODE_IMM_SHIFT 65866d29a5eSTaylor Simpson #undef DECODE_OPINFO 65966d29a5eSTaylor Simpson #undef DECODE_MATCH_INFO 66066d29a5eSTaylor Simpson #undef DECODE_LEGACY_MATCH_INFO 66166d29a5eSTaylor Simpson #undef DECODE_END_TABLE 66266d29a5eSTaylor Simpson #undef INVALID 66366d29a5eSTaylor Simpson #undef TERMINAL 66466d29a5eSTaylor Simpson #undef SUBINSNS 66566d29a5eSTaylor Simpson #undef EXTSPACE 66666d29a5eSTaylor Simpson #undef TABLE_LINK 66766d29a5eSTaylor Simpson #undef DECODE_NEW_TABLE 66866d29a5eSTaylor Simpson #undef DECODE_SEPARATOR_BITS 66966d29a5eSTaylor Simpson 67066d29a5eSTaylor Simpson static unsigned int 67166d29a5eSTaylor Simpson decode_subinsn_tablewalk(Insn *insn, const DectreeTable *table, 67266d29a5eSTaylor Simpson uint32_t encoding) 67366d29a5eSTaylor Simpson { 67466d29a5eSTaylor Simpson unsigned int i; 67566d29a5eSTaylor Simpson Opcode opc; 67666d29a5eSTaylor Simpson if (table->lookup_function) { 67766d29a5eSTaylor Simpson i = table->lookup_function(table->startbit, table->width, encoding); 67866d29a5eSTaylor Simpson } else { 67966d29a5eSTaylor Simpson i = extract32(encoding, table->startbit, table->width); 68066d29a5eSTaylor Simpson } 68166d29a5eSTaylor Simpson if (table->table[i].type == DECTREE_TABLE_LINK) { 68266d29a5eSTaylor Simpson return decode_subinsn_tablewalk(insn, table->table[i].table_link, 68366d29a5eSTaylor Simpson encoding); 68466d29a5eSTaylor Simpson } else if (table->table[i].type == DECTREE_TERMINAL) { 68566d29a5eSTaylor Simpson opc = table->table[i].opcode; 68666d29a5eSTaylor Simpson if ((encoding & decode_itable[opc].mask) != decode_itable[opc].match) { 68766d29a5eSTaylor Simpson return 0; 68866d29a5eSTaylor Simpson } 68966d29a5eSTaylor Simpson decode_op(insn, opc, encoding); 69066d29a5eSTaylor Simpson return 1; 69166d29a5eSTaylor Simpson } else { 69266d29a5eSTaylor Simpson return 0; 69366d29a5eSTaylor Simpson } 69466d29a5eSTaylor Simpson } 69566d29a5eSTaylor Simpson 69666d29a5eSTaylor Simpson static unsigned int get_insn_a(uint32_t encoding) 69766d29a5eSTaylor Simpson { 69866d29a5eSTaylor Simpson return extract32(encoding, 0, 13); 69966d29a5eSTaylor Simpson } 70066d29a5eSTaylor Simpson 70166d29a5eSTaylor Simpson static unsigned int get_insn_b(uint32_t encoding) 70266d29a5eSTaylor Simpson { 70366d29a5eSTaylor Simpson return extract32(encoding, 16, 13); 70466d29a5eSTaylor Simpson } 70566d29a5eSTaylor Simpson 70666d29a5eSTaylor Simpson static unsigned int 70766d29a5eSTaylor Simpson decode_insns_tablewalk(Insn *insn, const DectreeTable *table, 70866d29a5eSTaylor Simpson uint32_t encoding) 70966d29a5eSTaylor Simpson { 71066d29a5eSTaylor Simpson unsigned int i; 71166d29a5eSTaylor Simpson unsigned int a, b; 71266d29a5eSTaylor Simpson Opcode opc; 71366d29a5eSTaylor Simpson if (table->lookup_function) { 71466d29a5eSTaylor Simpson i = table->lookup_function(table->startbit, table->width, encoding); 71566d29a5eSTaylor Simpson } else { 71666d29a5eSTaylor Simpson i = extract32(encoding, table->startbit, table->width); 71766d29a5eSTaylor Simpson } 71866d29a5eSTaylor Simpson if (table->table[i].type == DECTREE_TABLE_LINK) { 71966d29a5eSTaylor Simpson return decode_insns_tablewalk(insn, table->table[i].table_link, 72066d29a5eSTaylor Simpson encoding); 72166d29a5eSTaylor Simpson } else if (table->table[i].type == DECTREE_SUBINSNS) { 72266d29a5eSTaylor Simpson a = get_insn_a(encoding); 72366d29a5eSTaylor Simpson b = get_insn_b(encoding); 72466d29a5eSTaylor Simpson b = decode_subinsn_tablewalk(insn, table->table[i].table_link_b, b); 72566d29a5eSTaylor Simpson a = decode_subinsn_tablewalk(insn + 1, table->table[i].table_link, a); 72666d29a5eSTaylor Simpson if ((a == 0) || (b == 0)) { 72766d29a5eSTaylor Simpson return 0; 72866d29a5eSTaylor Simpson } 72966d29a5eSTaylor Simpson return 2; 73066d29a5eSTaylor Simpson } else if (table->table[i].type == DECTREE_TERMINAL) { 73166d29a5eSTaylor Simpson opc = table->table[i].opcode; 73266d29a5eSTaylor Simpson if ((encoding & decode_itable[opc].mask) != decode_itable[opc].match) { 73366d29a5eSTaylor Simpson if ((encoding & decode_legacy_itable[opc].mask) != 73466d29a5eSTaylor Simpson decode_legacy_itable[opc].match) { 73566d29a5eSTaylor Simpson return 0; 73666d29a5eSTaylor Simpson } 73766d29a5eSTaylor Simpson } 73866d29a5eSTaylor Simpson decode_op(insn, opc, encoding); 73966d29a5eSTaylor Simpson return 1; 74060d1180bSTaylor Simpson } else if (table->table[i].type == DECTREE_EXTSPACE) { 74160d1180bSTaylor Simpson /* 74260d1180bSTaylor Simpson * For now, HVX will be the only coproc 74360d1180bSTaylor Simpson */ 74460d1180bSTaylor Simpson return decode_insns_tablewalk(insn, ext_trees[EXT_IDX_mmvec], encoding); 74566d29a5eSTaylor Simpson } else { 74666d29a5eSTaylor Simpson return 0; 74766d29a5eSTaylor Simpson } 74866d29a5eSTaylor Simpson } 74966d29a5eSTaylor Simpson 75066d29a5eSTaylor Simpson static unsigned int 75166d29a5eSTaylor Simpson decode_insns(Insn *insn, uint32_t encoding) 75266d29a5eSTaylor Simpson { 75366d29a5eSTaylor Simpson const DectreeTable *table; 75466d29a5eSTaylor Simpson if (parse_bits(encoding) != 0) { 75566d29a5eSTaylor Simpson /* Start with PP table - 32 bit instructions */ 75666d29a5eSTaylor Simpson table = &dectree_table_DECODE_ROOT_32; 75766d29a5eSTaylor Simpson } else { 75866d29a5eSTaylor Simpson /* start with EE table - duplex instructions */ 75966d29a5eSTaylor Simpson table = &dectree_table_DECODE_ROOT_EE; 76066d29a5eSTaylor Simpson } 76166d29a5eSTaylor Simpson return decode_insns_tablewalk(insn, table, encoding); 76266d29a5eSTaylor Simpson } 76366d29a5eSTaylor Simpson 76466d29a5eSTaylor Simpson static void decode_add_endloop_insn(Insn *insn, int loopnum) 76566d29a5eSTaylor Simpson { 76666d29a5eSTaylor Simpson if (loopnum == 10) { 76766d29a5eSTaylor Simpson insn->opcode = J2_endloop01; 76866d29a5eSTaylor Simpson insn->generate = opcode_genptr[J2_endloop01]; 76966d29a5eSTaylor Simpson } else if (loopnum == 1) { 77066d29a5eSTaylor Simpson insn->opcode = J2_endloop1; 77166d29a5eSTaylor Simpson insn->generate = opcode_genptr[J2_endloop1]; 77266d29a5eSTaylor Simpson } else if (loopnum == 0) { 77366d29a5eSTaylor Simpson insn->opcode = J2_endloop0; 77466d29a5eSTaylor Simpson insn->generate = opcode_genptr[J2_endloop0]; 77566d29a5eSTaylor Simpson } else { 77666d29a5eSTaylor Simpson g_assert_not_reached(); 77766d29a5eSTaylor Simpson } 77866d29a5eSTaylor Simpson } 77966d29a5eSTaylor Simpson 78092cfa25fSTaylor Simpson static bool decode_parsebits_is_loopend(uint32_t encoding32) 78166d29a5eSTaylor Simpson { 78266d29a5eSTaylor Simpson uint32_t bits = parse_bits(encoding32); 78366d29a5eSTaylor Simpson return bits == 0x2; 78466d29a5eSTaylor Simpson } 78566d29a5eSTaylor Simpson 78666d29a5eSTaylor Simpson static void 78766d29a5eSTaylor Simpson decode_set_slot_number(Packet *pkt) 78866d29a5eSTaylor Simpson { 78966d29a5eSTaylor Simpson int slot; 79066d29a5eSTaylor Simpson int i; 79192cfa25fSTaylor Simpson bool hit_mem_insn = false; 79292cfa25fSTaylor Simpson bool hit_duplex = false; 79392cfa25fSTaylor Simpson bool slot0_found = false; 79492cfa25fSTaylor Simpson bool slot1_found = false; 79592cfa25fSTaylor Simpson int slot1_iidx = 0; 79666d29a5eSTaylor Simpson 79766d29a5eSTaylor Simpson /* 79866d29a5eSTaylor Simpson * The slots are encoded in reverse order 79966d29a5eSTaylor Simpson * For each instruction, count down until you find a suitable slot 80066d29a5eSTaylor Simpson */ 80166d29a5eSTaylor Simpson for (i = 0, slot = 3; i < pkt->num_insns; i++) { 80266d29a5eSTaylor Simpson SlotMask valid_slots = get_valid_slots(pkt, i); 80366d29a5eSTaylor Simpson 80466d29a5eSTaylor Simpson while (!(valid_slots & (1 << slot))) { 80566d29a5eSTaylor Simpson slot--; 80666d29a5eSTaylor Simpson } 80766d29a5eSTaylor Simpson pkt->insn[i].slot = slot; 80866d29a5eSTaylor Simpson if (slot) { 80966d29a5eSTaylor Simpson /* I've assigned the slot, now decrement it for the next insn */ 81066d29a5eSTaylor Simpson slot--; 81166d29a5eSTaylor Simpson } 81266d29a5eSTaylor Simpson } 81366d29a5eSTaylor Simpson 81466d29a5eSTaylor Simpson /* Fix the exceptions - mem insns to slot 0,1 */ 81566d29a5eSTaylor Simpson for (i = pkt->num_insns - 1; i >= 0; i--) { 81666d29a5eSTaylor Simpson /* First memory instruction always goes to slot 0 */ 81766d29a5eSTaylor Simpson if ((GET_ATTRIB(pkt->insn[i].opcode, A_MEMLIKE) || 81866d29a5eSTaylor Simpson GET_ATTRIB(pkt->insn[i].opcode, A_MEMLIKE_PACKET_RULES)) && 81966d29a5eSTaylor Simpson !hit_mem_insn) { 82092cfa25fSTaylor Simpson hit_mem_insn = true; 82166d29a5eSTaylor Simpson pkt->insn[i].slot = 0; 82266d29a5eSTaylor Simpson continue; 82366d29a5eSTaylor Simpson } 82466d29a5eSTaylor Simpson 82566d29a5eSTaylor Simpson /* Next memory instruction always goes to slot 1 */ 82666d29a5eSTaylor Simpson if ((GET_ATTRIB(pkt->insn[i].opcode, A_MEMLIKE) || 82766d29a5eSTaylor Simpson GET_ATTRIB(pkt->insn[i].opcode, A_MEMLIKE_PACKET_RULES)) && 82866d29a5eSTaylor Simpson hit_mem_insn) { 82966d29a5eSTaylor Simpson pkt->insn[i].slot = 1; 83066d29a5eSTaylor Simpson } 83166d29a5eSTaylor Simpson } 83266d29a5eSTaylor Simpson 83366d29a5eSTaylor Simpson /* Fix the exceptions - duplex always slot 0,1 */ 83466d29a5eSTaylor Simpson for (i = pkt->num_insns - 1; i >= 0; i--) { 83566d29a5eSTaylor Simpson /* First subinsn always goes to slot 0 */ 83666d29a5eSTaylor Simpson if (GET_ATTRIB(pkt->insn[i].opcode, A_SUBINSN) && !hit_duplex) { 83792cfa25fSTaylor Simpson hit_duplex = true; 83866d29a5eSTaylor Simpson pkt->insn[i].slot = 0; 83966d29a5eSTaylor Simpson continue; 84066d29a5eSTaylor Simpson } 84166d29a5eSTaylor Simpson 84266d29a5eSTaylor Simpson /* Next subinsn always goes to slot 1 */ 84366d29a5eSTaylor Simpson if (GET_ATTRIB(pkt->insn[i].opcode, A_SUBINSN) && hit_duplex) { 84466d29a5eSTaylor Simpson pkt->insn[i].slot = 1; 84566d29a5eSTaylor Simpson } 84666d29a5eSTaylor Simpson } 84766d29a5eSTaylor Simpson 84866d29a5eSTaylor Simpson /* Fix the exceptions - slot 1 is never empty, always aligns to slot 0 */ 84966d29a5eSTaylor Simpson for (i = pkt->num_insns - 1; i >= 0; i--) { 85066d29a5eSTaylor Simpson /* Is slot0 used? */ 85166d29a5eSTaylor Simpson if (pkt->insn[i].slot == 0) { 85292cfa25fSTaylor Simpson bool is_endloop = (pkt->insn[i].opcode == J2_endloop01); 85366d29a5eSTaylor Simpson is_endloop |= (pkt->insn[i].opcode == J2_endloop0); 85466d29a5eSTaylor Simpson is_endloop |= (pkt->insn[i].opcode == J2_endloop1); 85566d29a5eSTaylor Simpson 85666d29a5eSTaylor Simpson /* 85766d29a5eSTaylor Simpson * Make sure it's not endloop since, we're overloading 85866d29a5eSTaylor Simpson * slot0 for endloop 85966d29a5eSTaylor Simpson */ 86066d29a5eSTaylor Simpson if (!is_endloop) { 86192cfa25fSTaylor Simpson slot0_found = true; 86266d29a5eSTaylor Simpson } 86366d29a5eSTaylor Simpson } 86466d29a5eSTaylor Simpson /* Is slot1 used? */ 86566d29a5eSTaylor Simpson if (pkt->insn[i].slot == 1) { 86692cfa25fSTaylor Simpson slot1_found = true; 86766d29a5eSTaylor Simpson slot1_iidx = i; 86866d29a5eSTaylor Simpson } 86966d29a5eSTaylor Simpson } 87066d29a5eSTaylor Simpson /* Is slot0 empty and slot1 used? */ 87192cfa25fSTaylor Simpson if ((!slot0_found) && slot1_found) { 87266d29a5eSTaylor Simpson /* Then push it to slot0 */ 87366d29a5eSTaylor Simpson pkt->insn[slot1_iidx].slot = 0; 87466d29a5eSTaylor Simpson } 87566d29a5eSTaylor Simpson } 87666d29a5eSTaylor Simpson 87766d29a5eSTaylor Simpson /* 87866d29a5eSTaylor Simpson * decode_packet 87966d29a5eSTaylor Simpson * Decodes packet with given words 88066d29a5eSTaylor Simpson * Returns 0 on insufficient words, 88166d29a5eSTaylor Simpson * or number of words used on success 88266d29a5eSTaylor Simpson */ 88366d29a5eSTaylor Simpson 88466d29a5eSTaylor Simpson int decode_packet(int max_words, const uint32_t *words, Packet *pkt, 88566d29a5eSTaylor Simpson bool disas_only) 88666d29a5eSTaylor Simpson { 88766d29a5eSTaylor Simpson int num_insns = 0; 88866d29a5eSTaylor Simpson int words_read = 0; 88992cfa25fSTaylor Simpson bool end_of_packet = false; 89066d29a5eSTaylor Simpson int new_insns = 0; 89160d1180bSTaylor Simpson int i; 89266d29a5eSTaylor Simpson uint32_t encoding32; 89366d29a5eSTaylor Simpson 89466d29a5eSTaylor Simpson /* Initialize */ 89566d29a5eSTaylor Simpson memset(pkt, 0, sizeof(*pkt)); 89666d29a5eSTaylor Simpson /* Try to build packet */ 89766d29a5eSTaylor Simpson while (!end_of_packet && (words_read < max_words)) { 89866d29a5eSTaylor Simpson encoding32 = words[words_read]; 89966d29a5eSTaylor Simpson end_of_packet = is_packet_end(encoding32); 90066d29a5eSTaylor Simpson new_insns = decode_insns(&pkt->insn[num_insns], encoding32); 90166d29a5eSTaylor Simpson g_assert(new_insns > 0); 90266d29a5eSTaylor Simpson /* 90366d29a5eSTaylor Simpson * If we saw an extender, mark next word extended so immediate 90466d29a5eSTaylor Simpson * decode works 90566d29a5eSTaylor Simpson */ 90666d29a5eSTaylor Simpson if (pkt->insn[num_insns].opcode == A4_ext) { 90792cfa25fSTaylor Simpson pkt->insn[num_insns + 1].extension_valid = true; 90866d29a5eSTaylor Simpson } 90966d29a5eSTaylor Simpson num_insns += new_insns; 91066d29a5eSTaylor Simpson words_read++; 91166d29a5eSTaylor Simpson } 91266d29a5eSTaylor Simpson 91366d29a5eSTaylor Simpson pkt->num_insns = num_insns; 91466d29a5eSTaylor Simpson if (!end_of_packet) { 91566d29a5eSTaylor Simpson /* Ran out of words! */ 91666d29a5eSTaylor Simpson return 0; 91766d29a5eSTaylor Simpson } 91866d29a5eSTaylor Simpson pkt->encod_pkt_size_in_bytes = words_read * 4; 91960d1180bSTaylor Simpson pkt->pkt_has_hvx = false; 92060d1180bSTaylor Simpson for (i = 0; i < num_insns; i++) { 92160d1180bSTaylor Simpson pkt->pkt_has_hvx |= 92260d1180bSTaylor Simpson GET_ATTRIB(pkt->insn[i].opcode, A_CVI); 92360d1180bSTaylor Simpson } 92466d29a5eSTaylor Simpson 92566d29a5eSTaylor Simpson /* 92666d29a5eSTaylor Simpson * Check for :endloop in the parse bits 92766d29a5eSTaylor Simpson * Section 10.6 of the Programmer's Reference describes the encoding 92866d29a5eSTaylor Simpson * The end of hardware loop 0 can be encoded with 2 words 92966d29a5eSTaylor Simpson * The end of hardware loop 1 needs 3 words 93066d29a5eSTaylor Simpson */ 93166d29a5eSTaylor Simpson if ((words_read == 2) && (decode_parsebits_is_loopend(words[0]))) { 93266d29a5eSTaylor Simpson decode_add_endloop_insn(&pkt->insn[pkt->num_insns++], 0); 93366d29a5eSTaylor Simpson } 93466d29a5eSTaylor Simpson if (words_read >= 3) { 93592cfa25fSTaylor Simpson bool has_loop0, has_loop1; 93666d29a5eSTaylor Simpson has_loop0 = decode_parsebits_is_loopend(words[0]); 93766d29a5eSTaylor Simpson has_loop1 = decode_parsebits_is_loopend(words[1]); 93866d29a5eSTaylor Simpson if (has_loop0 && has_loop1) { 93966d29a5eSTaylor Simpson decode_add_endloop_insn(&pkt->insn[pkt->num_insns++], 10); 94066d29a5eSTaylor Simpson } else if (has_loop1) { 94166d29a5eSTaylor Simpson decode_add_endloop_insn(&pkt->insn[pkt->num_insns++], 1); 94266d29a5eSTaylor Simpson } else if (has_loop0) { 94366d29a5eSTaylor Simpson decode_add_endloop_insn(&pkt->insn[pkt->num_insns++], 0); 94466d29a5eSTaylor Simpson } 94566d29a5eSTaylor Simpson } 94666d29a5eSTaylor Simpson 94766d29a5eSTaylor Simpson decode_apply_extenders(pkt); 94866d29a5eSTaylor Simpson if (!disas_only) { 94966d29a5eSTaylor Simpson decode_remove_extenders(pkt); 95066d29a5eSTaylor Simpson } 95166d29a5eSTaylor Simpson decode_set_slot_number(pkt); 95266d29a5eSTaylor Simpson decode_fill_newvalue_regno(pkt); 95366d29a5eSTaylor Simpson 95460d1180bSTaylor Simpson if (pkt->pkt_has_hvx) { 95560d1180bSTaylor Simpson mmvec_ext_decode_checks(pkt, disas_only); 95660d1180bSTaylor Simpson } 95760d1180bSTaylor Simpson 95866d29a5eSTaylor Simpson if (!disas_only) { 95966d29a5eSTaylor Simpson decode_shuffle_for_execution(pkt); 96066d29a5eSTaylor Simpson decode_split_cmpjump(pkt); 96166d29a5eSTaylor Simpson decode_set_insn_attr_fields(pkt); 96266d29a5eSTaylor Simpson } 96366d29a5eSTaylor Simpson 96466d29a5eSTaylor Simpson return words_read; 96566d29a5eSTaylor Simpson } 96666d29a5eSTaylor Simpson 96766d29a5eSTaylor Simpson /* Used for "-d in_asm" logging */ 96866d29a5eSTaylor Simpson int disassemble_hexagon(uint32_t *words, int nwords, bfd_vma pc, 96966d29a5eSTaylor Simpson GString *buf) 97066d29a5eSTaylor Simpson { 97166d29a5eSTaylor Simpson Packet pkt; 97266d29a5eSTaylor Simpson 97366d29a5eSTaylor Simpson if (decode_packet(nwords, words, &pkt, true) > 0) { 97466d29a5eSTaylor Simpson snprint_a_pkt_disas(buf, &pkt, words, pc); 97566d29a5eSTaylor Simpson return pkt.encod_pkt_size_in_bytes; 97666d29a5eSTaylor Simpson } else { 97766d29a5eSTaylor Simpson g_string_assign(buf, "<invalid>"); 97866d29a5eSTaylor Simpson return 0; 97966d29a5eSTaylor Simpson } 98066d29a5eSTaylor Simpson } 981