1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
|
/*
* Copyright(c) 2019-2021 Qualcomm Innovation Center, Inc. All Rights Reserved.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <http://www.gnu.org/licenses/>.
*/
#include "qemu/osdep.h"
#include "attribs.h"
#include "printinsn.h"
#include "insn.h"
#include "reg_fields.h"
#include "internal.h"
static const char *sreg2str(unsigned int reg)
{
if (reg < TOTAL_PER_THREAD_REGS) {
return hexagon_regnames[reg];
} else {
return "???";
}
}
static const char *creg2str(unsigned int reg)
{
return sreg2str(reg + HEX_REG_SA0);
}
static void snprintinsn(GString *buf, Insn *insn)
{
switch (insn->opcode) {
#define DEF_VECX_PRINTINFO(TAG, FMT, ...) DEF_PRINTINFO(TAG, FMT, __VA_ARGS__)
#define DEF_PRINTINFO(TAG, FMT, ...) \
case TAG: \
g_string_append_printf(buf, FMT, __VA_ARGS__); \
break;
#include "printinsn_generated.h.inc"
#undef DEF_VECX_PRINTINFO
#undef DEF_PRINTINFO
}
}
void snprint_a_pkt_disas(GString *buf, Packet *pkt, uint32_t *words,
target_ulong pc)
{
bool has_endloop0 = false;
bool has_endloop1 = false;
bool has_endloop01 = false;
for (int i = 0; i < pkt->num_insns; i++) {
if (pkt->insn[i].part1) {
continue;
}
/* We'll print the endloop's at the end of the packet */
if (pkt->insn[i].opcode == J2_endloop0) {
has_endloop0 = true;
continue;
}
if (pkt->insn[i].opcode == J2_endloop1) {
has_endloop1 = true;
continue;
}
if (pkt->insn[i].opcode == J2_endloop01) {
has_endloop01 = true;
continue;
}
g_string_append_printf(buf, "0x" TARGET_FMT_lx "\t", words[i]);
if (i == 0) {
g_string_append(buf, "{");
}
g_string_append(buf, "\t");
snprintinsn(buf, &(pkt->insn[i]));
if (i < pkt->num_insns - 1) {
/*
* Subinstructions are two instructions encoded
* in the same word. Print them on the same line.
*/
if (GET_ATTRIB(pkt->insn[i].opcode, A_SUBINSN)) {
g_string_append(buf, "; ");
snprintinsn(buf, &(pkt->insn[i + 1]));
i++;
} else if (pkt->insn[i + 1].opcode != J2_endloop0 &&
pkt->insn[i + 1].opcode != J2_endloop1 &&
pkt->insn[i + 1].opcode != J2_endloop01) {
pc += 4;
g_string_append_printf(buf, "\n0x" TARGET_FMT_lx ": ", pc);
}
}
}
g_string_append(buf, " }");
if (has_endloop0) {
g_string_append(buf, " :endloop0");
}
if (has_endloop1) {
g_string_append(buf, " :endloop1");
}
if (has_endloop01) {
g_string_append(buf, " :endloop01");
}
}
void snprint_a_pkt_debug(GString *buf, Packet *pkt)
{
int slot, opcode;
if (pkt->num_insns > 1) {
g_string_append(buf, "\n{\n");
}
for (int i = 0; i < pkt->num_insns; i++) {
if (pkt->insn[i].part1) {
continue;
}
g_string_append(buf, "\t");
snprintinsn(buf, &(pkt->insn[i]));
if (GET_ATTRIB(pkt->insn[i].opcode, A_SUBINSN)) {
g_string_append(buf, " //subinsn");
}
if (pkt->insn[i].extension_valid) {
g_string_append(buf, " //constant extended");
}
slot = pkt->insn[i].slot;
opcode = pkt->insn[i].opcode;
g_string_append_printf(buf, " //slot=%d:tag=%s\n",
slot, opcode_names[opcode]);
}
if (pkt->num_insns > 1) {
g_string_append(buf, "}\n");
}
}
|
