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
|
/* This file is part of the program psim.
Copyright (C) 1994-1997, Andrew Cagney <cagney@highland.com.au>
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 3 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 <stdio.h>
#include <stdarg.h>
#include <ctype.h>
#include "build-config.h"
#include "misc.h"
#include <stdlib.h>
#include <string.h>
void
error (const char *msg, ...)
{
va_list ap;
va_start(ap, msg);
vprintf(msg, ap);
va_end(ap);
exit (1);
}
void *
zalloc(long size)
{
void *memory = malloc(size);
if (memory == NULL)
error("zalloc failed\n");
memset(memory, 0, size);
return memory;
}
void
dumpf (int indent, const char *msg, ...)
{
va_list ap;
for (; indent > 0; indent--)
printf(" ");
va_start(ap, msg);
vprintf(msg, ap);
va_end(ap);
}
unsigned
a2i(const char *a)
{
int neg = 0;
int base = 10;
unsigned num = 0;
int looping;
while (isspace (*a))
a++;
if (*a == '-') {
neg = 1;
a++;
}
if (*a == '0') {
if (a[1] == 'x' || a[1] == 'X') {
a += 2;
base = 16;
}
else
base = 8;
}
looping = 1;
while (looping) {
int ch = *a++;
switch (base) {
default:
looping = 0;
break;
case 10:
if (ch >= '0' && ch <= '9') {
num = (num * 10) + (ch - '0');
} else {
looping = 0;
}
break;
case 8:
if (ch >= '0' && ch <= '7') {
num = (num * 8) + (ch - '0');
} else {
looping = 0;
}
break;
case 16:
if (ch >= '0' && ch <= '9') {
num = (num * 16) + (ch - '0');
} else if (ch >= 'a' && ch <= 'f') {
num = (num * 16) + (ch - 'a' + 10);
} else if (ch >= 'A' && ch <= 'F') {
num = (num * 16) + (ch - 'A' + 10);
} else {
looping = 0;
}
break;
}
}
if (neg)
num = - num;
return num;
}
unsigned
target_a2i(int ms_bit_nr,
const char *a)
{
if (ms_bit_nr)
return (ms_bit_nr - a2i(a));
else
return a2i(a);
}
unsigned
i2target(int ms_bit_nr,
unsigned bit)
{
if (ms_bit_nr)
return ms_bit_nr - bit;
else
return bit;
}
int
name2i(const char *names,
const name_map *map)
{
const name_map *curr;
const char *name = names;
while (*name != '\0') {
/* find our name */
const char *end = strchr(name, ',');
const char *next;
int len;
if (end == NULL) {
end = strchr(name, '\0');
next = end;
}
else {
next = end + 1;
}
len = end - name;
/* look it up */
curr = map;
while (curr->name != NULL) {
if (strncmp(curr->name, name, len) == 0
&& strlen(curr->name) == len)
return curr->i;
curr++;
}
name = next;
}
/* nothing found, possibly return a default */
curr = map;
while (curr->name != NULL)
curr++;
if (curr->i >= 0)
return curr->i;
else
error("%s contains no valid names\n", names);
return 0;
}
const char *
i2name(const int i,
const name_map *map)
{
while (map->name != NULL) {
if (map->i == i)
return map->name;
map++;
}
error("map lookup failed for %d\n", i);
return NULL;
}
|
