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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
|
/* LoongArch opcode support.
Copyright (C) 2021-2022 Free Software Foundation, Inc.
Contributed by Loongson Ltd.
This file is part of the GNU opcodes library.
This library 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 3, or (at your option)
any later version.
It 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; see the file COPYING3. If not,
see <http://www.gnu.org/licenses/>. */
#include "sysdep.h"
#include "opcode/loongarch.h"
int
is_unsigned (const char *c_str)
{
if (c_str[0] == '0' && (c_str[1] == 'x' || c_str[1] == 'X'))
{
c_str += 2;
while (('a' <= *c_str && *c_str <= 'f')
|| ('A' <= *c_str && *c_str <= 'F')
|| ('0' <= *c_str && *c_str <= '9'))
c_str++;
}
else if (*c_str == '\0')
return 0;
else
while ('0' <= *c_str && *c_str <= '9')
c_str++;
return *c_str == '\0';
}
int
is_signed (const char *c_str)
{
return *c_str == '-' ? is_unsigned (c_str + 1) : is_unsigned (c_str);
}
int
loongarch_get_bit_field_width (const char *bit_field, char **end)
{
int width = 0;
char has_specify = 0, *bit_field_1 = (char *) bit_field;
if (bit_field_1 && *bit_field_1 != '\0')
while (1)
{
strtol (bit_field_1, &bit_field_1, 10);
if (*bit_field_1 != ':')
break;
bit_field_1++;
width += strtol (bit_field_1, &bit_field_1, 10);
has_specify = 1;
if (*bit_field_1 != '|')
break;
bit_field_1++;
}
if (end)
*end = bit_field_1;
return has_specify ? width : -1;
}
int32_t
loongarch_decode_imm (const char *bit_field, insn_t insn, int si)
{
int32_t ret = 0;
uint32_t t;
int len = 0, width, b_start;
char *bit_field_1 = (char *) bit_field;
while (1)
{
b_start = strtol (bit_field_1, &bit_field_1, 10);
if (*bit_field_1 != ':')
break;
width = strtol (bit_field_1 + 1, &bit_field_1, 10);
len += width;
t = insn;
t <<= sizeof (t) * 8 - width - b_start;
t >>= sizeof (t) * 8 - width;
ret <<= width;
ret |= t;
if (*bit_field_1 != '|')
break;
bit_field_1++;
}
if (*bit_field_1 == '<' && *(++bit_field_1) == '<')
{
width = atoi (bit_field_1 + 1);
ret <<= width;
len += width;
}
else if (*bit_field_1 == '+')
ret += atoi (bit_field_1 + 1);
/* Extend signed bit. */
if (si)
{
uint32_t sign = 1u << (len - 1);
ret = (ret ^ sign) - sign;
}
return ret;
}
static insn_t
loongarch_encode_imm (const char *bit_field, int32_t imm)
{
char *bit_field_1 = (char *) bit_field;
char *t = bit_field_1;
int width, b_start;
insn_t ret = 0;
uint32_t i;
uint32_t uimm = (uint32_t)imm;
width = loongarch_get_bit_field_width (t, &t);
if (width == -1)
return ret;
if (*t == '<' && *(++t) == '<')
width += atoi (t + 1);
else if (*t == '+')
uimm -= atoi (t + 1);
uimm = width ? (uimm << (sizeof (uimm) * 8 - width)) : 0;
while (1)
{
b_start = strtol (bit_field_1, &bit_field_1, 10);
if (*bit_field_1 != ':')
break;
width = strtol (bit_field_1 + 1, &bit_field_1, 10);
i = uimm;
i = width ? (i >> (sizeof (i) * 8 - width)) : 0;
i = (b_start == 32) ? 0 : (i << b_start);
ret |= i;
uimm = (width == 32) ? 0 : (uimm << width);
if (*bit_field_1 != '|')
break;
bit_field_1++;
}
return ret;
}
/* Parse such FORMAT
""
"u"
"v0:5,r5:5,s10:10<<2"
"r0:5,r5:5,r10:5,u15:2+1"
"r,r,u0:5+32,u0:5+1"
*/
static int
loongarch_parse_format (const char *format, char *esc1s, char *esc2s,
const char **bit_fields)
{
size_t arg_num = 0;
if (*format == '\0')
goto end;
while (1)
{
/* esc1 esc2
for "[a-zA-Z][a-zA-Z]?" */
if (('a' <= *format && *format <= 'z')
|| ('A' <= *format && *format <= 'Z'))
{
*esc1s++ = *format++;
if (('a' <= *format && *format <= 'z')
|| ('A' <= *format && *format <= 'Z'))
*esc2s++ = *format++;
else
*esc2s++ = '\0';
}
else
return -1;
arg_num++;
if (MAX_ARG_NUM_PLUS_2 - 2 < arg_num)
/* Need larger MAX_ARG_NUM_PLUS_2. */
return -1;
*bit_fields++ = format;
if ('0' <= *format && *format <= '9')
{
/* For "[0-9]+:[0-9]+(\|[0-9]+:[0-9]+)*". */
while (1)
{
while ('0' <= *format && *format <= '9')
format++;
if (*format != ':')
return -1;
format++;
if (!('0' <= *format && *format <= '9'))
return -1;
while ('0' <= *format && *format <= '9')
format++;
if (*format != '|')
break;
format++;
}
/* For "((\+|<<)[1-9][0-9]*)?". */
do
{
if (*format == '+')
format++;
else if (format[0] == '<' && format[1] == '<')
format += 2;
else
break;
if (!('1' <= *format && *format <= '9'))
return -1;
while ('0' <= *format && *format <= '9')
format++;
}
while (0);
}
if (*format == ',')
format++;
else if (*format == '\0')
break;
else
return -1;
}
end:
*esc1s = '\0';
return 0;
}
size_t
loongarch_split_args_by_comma (char *args, const char *arg_strs[])
{
size_t num = 0;
if (*args)
arg_strs[num++] = args;
for (; *args; args++)
if (*args == ',')
{
if (MAX_ARG_NUM_PLUS_2 - 1 == num)
break;
else
*args = '\0', arg_strs[num++] = args + 1;
}
arg_strs[num] = NULL;
return num;
}
char *
loongarch_cat_splited_strs (const char *arg_strs[])
{
char *ret;
size_t n, l;
for (l = 0, n = 0; arg_strs[n]; n++)
l += strlen (arg_strs[n]);
ret = malloc (l + n + 1);
if (!ret)
return ret;
ret[0] = '\0';
if (0 < n)
strcat (ret, arg_strs[0]);
for (l = 1; l < n; l++)
strcat (ret, ","), strcat (ret, arg_strs[l]);
return ret;
}
insn_t
loongarch_foreach_args (const char *format, const char *arg_strs[],
int32_t (*helper) (char esc1, char esc2,
const char *bit_field,
const char *arg, void *context),
void *context)
{
char esc1s[MAX_ARG_NUM_PLUS_2 - 1], esc2s[MAX_ARG_NUM_PLUS_2 - 1];
const char *bit_fields[MAX_ARG_NUM_PLUS_2 - 1];
size_t i;
insn_t ret = 0;
int ok;
ok = loongarch_parse_format (format, esc1s, esc2s, bit_fields) == 0;
/* Make sure the num of actual args is equal to the num of escape. */
for (i = 0; esc1s[i] && arg_strs[i]; i++)
;
ok = ok && !esc1s[i] && !arg_strs[i];
if (ok && helper)
{
for (i = 0; arg_strs[i]; i++)
ret |= loongarch_encode_imm (bit_fields[i],
helper (esc1s[i], esc2s[i],
bit_fields[i], arg_strs[i],
context));
ret |= helper ('\0', '\0', NULL, NULL, context);
}
return ret;
}
int
loongarch_check_format (const char *format)
{
char esc1s[MAX_ARG_NUM_PLUS_2 - 1], esc2s[MAX_ARG_NUM_PLUS_2 - 1];
const char *bit_fields[MAX_ARG_NUM_PLUS_2 - 1];
if (!format)
return -1;
return loongarch_parse_format (format, esc1s, esc2s, bit_fields);
}
int
loongarch_check_macro (const char *format, const char *macro)
{
int num_of_args;
char esc1s[MAX_ARG_NUM_PLUS_2 - 1], esc2s[MAX_ARG_NUM_PLUS_2 - 1];
const char *bit_fields[MAX_ARG_NUM_PLUS_2 - 1];
if (!format || !macro
|| loongarch_parse_format (format, esc1s, esc2s, bit_fields) != 0)
return -1;
for (num_of_args = 0; esc1s[num_of_args]; num_of_args++)
;
for (; macro[0]; macro++)
if (macro[0] == '%')
{
macro++;
if ('1' <= macro[0] && macro[0] <= '9')
{
if (num_of_args < macro[0] - '0')
/* Out of args num. */
return -1;
}
else if (macro[0] == 'f')
;
else if (macro[0] == '%')
;
else
return -1;
}
return 0;
}
static const char *
I (char esc_ch1 ATTRIBUTE_UNUSED, char esc_ch2 ATTRIBUTE_UNUSED,
const char *c_str)
{
return c_str;
}
char *
loongarch_expand_macro_with_format_map (
const char *format, const char *macro, const char *const arg_strs[],
const char *(*map) (char esc1, char esc2, const char *arg),
char *(*helper) (const char *const arg_strs[], void *context), void *context,
size_t len_str)
{
char esc1s[MAX_ARG_NUM_PLUS_2 - 1], esc2s[MAX_ARG_NUM_PLUS_2 - 1];
const char *bit_fields[MAX_ARG_NUM_PLUS_2 - 1];
const char *src;
char *dest;
/* The expanded macro character length does not exceed 1000, and number of
label is 6 at most in the expanded macro. The len_str is the length of
str. */
char *buffer =(char *) malloc(1024 + 6 * len_str);
if (format)
loongarch_parse_format (format, esc1s, esc2s, bit_fields);
src = macro;
dest = buffer;
while (*src)
if (*src == '%')
{
src++;
if ('1' <= *src && *src <= '9')
{
size_t i = *src - '1';
const char *t = map (esc1s[i], esc2s[i], arg_strs[i]);
while (*t)
*dest++ = *t++;
}
else if (*src == '%')
*dest++ = '%';
else if (*src == 'f' && helper)
{
char *b, *t;
t = b = (*helper) (arg_strs, context);
if (b)
{
while (*t)
*dest++ = *t++;
free (b);
}
}
src++;
}
else
*dest++ = *src++;
*dest = '\0';
return buffer;
}
char *
loongarch_expand_macro (const char *macro, const char *const arg_strs[],
char *(*helper) (const char *const arg_strs[],
void *context),
void *context, size_t len_str)
{
return loongarch_expand_macro_with_format_map (NULL, macro, arg_strs, I,
helper, context, len_str);
}
size_t
loongarch_bits_imm_needed (int64_t imm, int si)
{
size_t ret;
if (si)
{
if (imm < 0)
{
uint64_t uimm = (uint64_t) imm;
uint64_t uimax = UINT64_C (1) << 63;
for (ret = 0; (uimm & uimax) != 0; uimm <<= 1, ret++)
;
ret = 64 - ret + 1;
}
else
ret = loongarch_bits_imm_needed (imm, 0) + 1;
}
else
{
uint64_t t = imm;
for (ret = 0; t; t >>= 1, ret++)
;
}
return ret;
}
void
loongarch_eliminate_adjacent_repeat_char (char *dest, char c)
{
if (c == '\0')
return;
char *src = dest;
while (*dest)
{
while (src[0] == c && src[0] == src[1])
src++;
*dest++ = *src++;
}
}
|