/* This file is part of the program psim.
|
/* This file is part of the program psim.
|
|
|
Copyright (C) 1994-1997, Andrew Cagney <cagney@highland.com.au>
|
Copyright (C) 1994-1997, Andrew Cagney <cagney@highland.com.au>
|
|
|
This program is free software; you can redistribute it and/or modify
|
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
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 2 of the License, or
|
the Free Software Foundation; either version 2 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software
|
along with this program; if not, write to the Free Software
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
*/
|
*/
|
|
|
|
|
#include <stdio.h>
|
#include <stdio.h>
|
#include <stdarg.h>
|
#include <stdarg.h>
|
#include <ctype.h>
|
#include <ctype.h>
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "misc.h"
|
#include "misc.h"
|
|
|
#ifdef HAVE_STDLIB_H
|
#ifdef HAVE_STDLIB_H
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#endif
|
#endif
|
|
|
#ifdef HAVE_STRING_H
|
#ifdef HAVE_STRING_H
|
#include <string.h>
|
#include <string.h>
|
#else
|
#else
|
#ifdef HAVE_STRINGS_H
|
#ifdef HAVE_STRINGS_H
|
#include <strings.h>
|
#include <strings.h>
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
void
|
void
|
error (char *msg, ...)
|
error (char *msg, ...)
|
{
|
{
|
va_list ap;
|
va_list ap;
|
va_start(ap, msg);
|
va_start(ap, msg);
|
vprintf(msg, ap);
|
vprintf(msg, ap);
|
va_end(ap);
|
va_end(ap);
|
exit (1);
|
exit (1);
|
}
|
}
|
|
|
void *
|
void *
|
zalloc(long size)
|
zalloc(long size)
|
{
|
{
|
void *memory = malloc(size);
|
void *memory = malloc(size);
|
if (memory == NULL)
|
if (memory == NULL)
|
error("zalloc failed\n");
|
error("zalloc failed\n");
|
memset(memory, 0, size);
|
memset(memory, 0, size);
|
return memory;
|
return memory;
|
}
|
}
|
|
|
void
|
void
|
dumpf (int indent, char *msg, ...)
|
dumpf (int indent, char *msg, ...)
|
{
|
{
|
va_list ap;
|
va_list ap;
|
for (; indent > 0; indent--)
|
for (; indent > 0; indent--)
|
printf(" ");
|
printf(" ");
|
va_start(ap, msg);
|
va_start(ap, msg);
|
vprintf(msg, ap);
|
vprintf(msg, ap);
|
va_end(ap);
|
va_end(ap);
|
}
|
}
|
|
|
|
|
unsigned
|
unsigned
|
a2i(const char *a)
|
a2i(const char *a)
|
{
|
{
|
int neg = 0;
|
int neg = 0;
|
int base = 10;
|
int base = 10;
|
unsigned num = 0;
|
unsigned num = 0;
|
int looping;
|
int looping;
|
|
|
while (isspace (*a))
|
while (isspace (*a))
|
a++;
|
a++;
|
|
|
if (*a == '-') {
|
if (*a == '-') {
|
neg = 1;
|
neg = 1;
|
a++;
|
a++;
|
}
|
}
|
|
|
if (*a == '0') {
|
if (*a == '0') {
|
if (a[1] == 'x' || a[1] == 'X') {
|
if (a[1] == 'x' || a[1] == 'X') {
|
a += 2;
|
a += 2;
|
base = 16;
|
base = 16;
|
}
|
}
|
else
|
else
|
base = 8;
|
base = 8;
|
}
|
}
|
|
|
looping = 1;
|
looping = 1;
|
while (looping) {
|
while (looping) {
|
int ch = *a++;
|
int ch = *a++;
|
|
|
switch (base) {
|
switch (base) {
|
default:
|
default:
|
looping = 0;
|
looping = 0;
|
break;
|
break;
|
|
|
case 10:
|
case 10:
|
if (ch >= '0' && ch <= '9') {
|
if (ch >= '0' && ch <= '9') {
|
num = (num * 10) + (ch - '0');
|
num = (num * 10) + (ch - '0');
|
} else {
|
} else {
|
looping = 0;
|
looping = 0;
|
}
|
}
|
break;
|
break;
|
|
|
case 8:
|
case 8:
|
if (ch >= '0' && ch <= '7') {
|
if (ch >= '0' && ch <= '7') {
|
num = (num * 8) + (ch - '0');
|
num = (num * 8) + (ch - '0');
|
} else {
|
} else {
|
looping = 0;
|
looping = 0;
|
}
|
}
|
break;
|
break;
|
|
|
case 16:
|
case 16:
|
if (ch >= '0' && ch <= '9') {
|
if (ch >= '0' && ch <= '9') {
|
num = (num * 16) + (ch - '0');
|
num = (num * 16) + (ch - '0');
|
} else if (ch >= 'a' && ch <= 'f') {
|
} else if (ch >= 'a' && ch <= 'f') {
|
num = (num * 16) + (ch - 'a' + 10);
|
num = (num * 16) + (ch - 'a' + 10);
|
} else if (ch >= 'A' && ch <= 'F') {
|
} else if (ch >= 'A' && ch <= 'F') {
|
num = (num * 16) + (ch - 'A' + 10);
|
num = (num * 16) + (ch - 'A' + 10);
|
} else {
|
} else {
|
looping = 0;
|
looping = 0;
|
}
|
}
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
if (neg)
|
if (neg)
|
num = - num;
|
num = - num;
|
|
|
return num;
|
return num;
|
}
|
}
|
|
|
unsigned
|
unsigned
|
target_a2i(int ms_bit_nr,
|
target_a2i(int ms_bit_nr,
|
const char *a)
|
const char *a)
|
{
|
{
|
if (ms_bit_nr)
|
if (ms_bit_nr)
|
return (ms_bit_nr - a2i(a));
|
return (ms_bit_nr - a2i(a));
|
else
|
else
|
return a2i(a);
|
return a2i(a);
|
}
|
}
|
|
|
unsigned
|
unsigned
|
i2target(int ms_bit_nr,
|
i2target(int ms_bit_nr,
|
unsigned bit)
|
unsigned bit)
|
{
|
{
|
if (ms_bit_nr)
|
if (ms_bit_nr)
|
return ms_bit_nr - bit;
|
return ms_bit_nr - bit;
|
else
|
else
|
return bit;
|
return bit;
|
}
|
}
|
|
|
|
|
int
|
int
|
name2i(const char *names,
|
name2i(const char *names,
|
const name_map *map)
|
const name_map *map)
|
{
|
{
|
const name_map *curr;
|
const name_map *curr;
|
const char *name = names;
|
const char *name = names;
|
while (*name != '\0') {
|
while (*name != '\0') {
|
/* find our name */
|
/* find our name */
|
char *end = strchr(name, ',');
|
char *end = strchr(name, ',');
|
char *next;
|
char *next;
|
int len;
|
int len;
|
if (end == NULL) {
|
if (end == NULL) {
|
end = strchr(name, '\0');
|
end = strchr(name, '\0');
|
next = end;
|
next = end;
|
}
|
}
|
else {
|
else {
|
next = end + 1;
|
next = end + 1;
|
}
|
}
|
len = end - name;
|
len = end - name;
|
/* look it up */
|
/* look it up */
|
curr = map;
|
curr = map;
|
while (curr->name != NULL) {
|
while (curr->name != NULL) {
|
if (strncmp(curr->name, name, len) == 0
|
if (strncmp(curr->name, name, len) == 0
|
&& strlen(curr->name) == len)
|
&& strlen(curr->name) == len)
|
return curr->i;
|
return curr->i;
|
curr++;
|
curr++;
|
}
|
}
|
name = next;
|
name = next;
|
}
|
}
|
/* nothing found, possibly return a default */
|
/* nothing found, possibly return a default */
|
curr = map;
|
curr = map;
|
while (curr->name != NULL)
|
while (curr->name != NULL)
|
curr++;
|
curr++;
|
if (curr->i >= 0)
|
if (curr->i >= 0)
|
return curr->i;
|
return curr->i;
|
else
|
else
|
error("%s contains no valid names\n", names);
|
error("%s contains no valid names\n", names);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
const char *
|
const char *
|
i2name(const int i,
|
i2name(const int i,
|
const name_map *map)
|
const name_map *map)
|
{
|
{
|
while (map->name != NULL) {
|
while (map->name != NULL) {
|
if (map->i == i)
|
if (map->i == i)
|
return map->name;
|
return map->name;
|
map++;
|
map++;
|
}
|
}
|
error("map lookup failed for %d\n", i);
|
error("map lookup failed for %d\n", i);
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
