/src/binutils-gdb/opcodes/tilegx-dis.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* tilegx-dis.c. Disassembly routines for the TILE-Gx architecture. |
2 | | Copyright (C) 2011-2025 Free Software Foundation, Inc. |
3 | | |
4 | | This file is part of the GNU opcodes library. |
5 | | |
6 | | This program is free software; you can redistribute it and/or modify |
7 | | it under the terms of the GNU General Public License as published by |
8 | | the Free Software Foundation; either version 3 of the License, or |
9 | | (at your option) any later version. |
10 | | |
11 | | This program is distributed in the hope that it will be useful, |
12 | | but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | | GNU General Public License for more details. |
15 | | |
16 | | You should have received a copy of the GNU General Public License |
17 | | along with this program; if not, write to the Free Software |
18 | | Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, |
19 | | MA 02110-1301, USA. */ |
20 | | |
21 | | #include "sysdep.h" |
22 | | #include <stddef.h> |
23 | | #include <assert.h> |
24 | | #include "bfd.h" |
25 | | #include "elf/tilegx.h" |
26 | | #include "elf-bfd.h" |
27 | | #include "disassemble.h" |
28 | | #include "opcode/tilegx.h" |
29 | | |
30 | | |
31 | | int |
32 | | print_insn_tilegx (bfd_vma memaddr, disassemble_info *info) |
33 | 45.5k | { |
34 | 45.5k | struct tilegx_decoded_instruction |
35 | 45.5k | decoded[TILEGX_MAX_INSTRUCTIONS_PER_BUNDLE]; |
36 | 45.5k | bfd_byte opbuf[TILEGX_BUNDLE_SIZE_IN_BYTES]; |
37 | 45.5k | int status, i, num_instructions, num_printed; |
38 | 45.5k | tilegx_mnemonic padding_mnemonic; |
39 | | |
40 | 45.5k | status = (*info->read_memory_func) (memaddr, opbuf, |
41 | 45.5k | TILEGX_BUNDLE_SIZE_IN_BYTES, info); |
42 | 45.5k | if (status != 0) |
43 | 192 | { |
44 | 192 | (*info->memory_error_func) (status, memaddr, info); |
45 | 192 | return -1; |
46 | 192 | } |
47 | | |
48 | 45.3k | info->bytes_per_line = TILEGX_BUNDLE_SIZE_IN_BYTES; |
49 | 45.3k | info->bytes_per_chunk = TILEGX_BUNDLE_SIZE_IN_BYTES; |
50 | 45.3k | info->octets_per_byte = 1; |
51 | 45.3k | info->display_endian = BFD_ENDIAN_LITTLE; |
52 | | |
53 | | /* Parse the instructions in the bundle. */ |
54 | 45.3k | num_instructions = |
55 | 45.3k | parse_insn_tilegx (bfd_getl64 (opbuf), memaddr, decoded); |
56 | | |
57 | | /* Print the instructions in the bundle. */ |
58 | 45.3k | info->fprintf_func (info->stream, "{ "); |
59 | 45.3k | num_printed = 0; |
60 | | |
61 | | /* Determine which nop opcode is used for padding and should be skipped. */ |
62 | 45.3k | padding_mnemonic = TILEGX_OPC_FNOP; |
63 | 111k | for (i = 0; i < num_instructions; i++) |
64 | 91.7k | { |
65 | 91.7k | if (!decoded[i].opcode->can_bundle) |
66 | 25.3k | { |
67 | | /* Instructions that cannot be bundled are padded out with nops, |
68 | | rather than fnops. Displaying them is always clutter. */ |
69 | 25.3k | padding_mnemonic = TILEGX_OPC_NOP; |
70 | 25.3k | break; |
71 | 25.3k | } |
72 | 91.7k | } |
73 | | |
74 | 159k | for (i = 0; i < num_instructions; i++) |
75 | 114k | { |
76 | 114k | const struct tilegx_opcode *opcode = decoded[i].opcode; |
77 | 114k | const char *name; |
78 | 114k | int j; |
79 | | |
80 | | /* Do not print out fnops, unless everything is an fnop, in |
81 | | which case we will print out just the last one. */ |
82 | 114k | if (opcode->mnemonic == padding_mnemonic |
83 | 114k | && (num_printed > 0 || i + 1 < num_instructions)) |
84 | 49 | continue; |
85 | | |
86 | 114k | if (num_printed > 0) |
87 | 69.1k | info->fprintf_func (info->stream, " ; "); |
88 | 114k | ++num_printed; |
89 | | |
90 | 114k | name = opcode->name; |
91 | 114k | if (name == NULL) |
92 | 28.1k | name = "<invalid>"; |
93 | 114k | info->fprintf_func (info->stream, "%s", name); |
94 | | |
95 | 346k | for (j = 0; j < opcode->num_operands; j++) |
96 | 232k | { |
97 | 232k | bfd_vma num; |
98 | 232k | const struct tilegx_operand *op; |
99 | 232k | const char *spr_name; |
100 | | |
101 | 232k | if (j > 0) |
102 | 145k | info->fprintf_func (info->stream, ","); |
103 | 232k | info->fprintf_func (info->stream, " "); |
104 | | |
105 | 232k | num = decoded[i].operand_values[j]; |
106 | | |
107 | 232k | op = decoded[i].operands[j]; |
108 | 232k | switch (op->type) |
109 | 232k | { |
110 | 186k | case TILEGX_OP_TYPE_REGISTER: |
111 | 186k | info->fprintf_func (info->stream, "%s", |
112 | 186k | tilegx_register_names[(int) num]); |
113 | 186k | break; |
114 | 103 | case TILEGX_OP_TYPE_SPR: |
115 | 103 | spr_name = get_tilegx_spr_name (num); |
116 | 103 | if (spr_name != NULL) |
117 | 14 | info->fprintf_func (info->stream, "%s", spr_name); |
118 | 89 | else |
119 | 89 | info->fprintf_func (info->stream, "%d", (int)num); |
120 | 103 | break; |
121 | 43.7k | case TILEGX_OP_TYPE_IMMEDIATE: |
122 | 43.7k | info->fprintf_func (info->stream, "%d", (int)num); |
123 | 43.7k | break; |
124 | 1.88k | case TILEGX_OP_TYPE_ADDRESS: |
125 | 1.88k | info->print_address_func (num, info); |
126 | 1.88k | break; |
127 | 0 | default: |
128 | 0 | abort (); |
129 | 232k | } |
130 | 232k | } |
131 | 114k | } |
132 | 45.3k | info->fprintf_func (info->stream, " }"); |
133 | | |
134 | 45.3k | return TILEGX_BUNDLE_SIZE_IN_BYTES; |
135 | 45.3k | } |