old-cross-binutils/sim/common/sim-utils.c

270 lines
6.1 KiB
C
Raw Normal View History

/* Miscellaneous simulator utilities.
Copyright (C) 1997 Free Software Foundation, Inc.
Contributed by Cygnus Support.
This file is part of GDB, the GNU debugger.
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, 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, write to the Free Software Foundation, Inc.,
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
#include "sim-main.h"
#include "sim-assert.h"
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_TIME_H
#include <time.h>
#endif
#ifdef HAVE_SYS_TIME_H
#include <sys/time.h> /* needed by sys/resource.h */
#endif
#ifdef HAVE_SYS_RESOURCE_H
#include <sys/resource.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#else
#ifdef HAVE_STRINGS_H
#include <strings.h>
#endif
#endif
#include "libiberty.h"
#include "bfd.h"
#include "sim-utils.h"
/* Global pointer to all state data.
Set by sim_resume. */
struct sim_state *current_state;
/* Allocate zero filled memory with xmalloc - xmalloc aborts of the
allocation fails. */
void *
zalloc (unsigned long size)
{
void *memory = (void *) xmalloc (size);
memset (memory, 0, size);
return memory;
}
void
zfree (void *data)
{
free (data);
}
/* Allocate a sim_state struct. */
SIM_DESC
sim_state_alloc (SIM_OPEN_KIND kind,
host_callback *callback)
{
int cpu_nr;
SIM_DESC sd = ZALLOC (struct sim_state);
STATE_MAGIC (sd) = SIM_MAGIC_NUMBER;
STATE_CALLBACK (sd) = callback;
STATE_OPEN_KIND (sd) = kind;
#if 0
/* Initialize the back link from the cpu struct to the state struct. */
/* ??? I can envision a design where the state struct contains an array
of pointers to cpu structs, rather than an array of structs themselves.
Implementing this is trickier as one may not know what to allocate until
one has parsed the args. Parsing the args twice wouldn't be unreasonable,
IMHO. If the state struct ever does contain an array of pointers then we
can't do this here. */
for (cpu_nr = 0; cpu_nr < MAX_NR_PROCESSORS; cpu_nr++)
CPU_STATE (STATE_CPU (sd, cpu_nr)) = sd;
#endif
#ifdef SIM_STATE_INIT
SIM_STATE_INIT (sd);
#endif
return sd;
}
/* Free a sim_state struct. */
void
sim_state_free (SIM_DESC sd)
{
ASSERT (sd->base.magic == SIM_MAGIC_NUMBER);
#ifdef SIM_STATE_FREE
SIM_STATE_FREE (sd);
#endif
zfree (sd);
}
/* Turn VALUE into a string with commas. */
char *
sim_add_commas (char *buf, int sizeof_buf, unsigned long value)
{
int comma = 3;
char *endbuf = buf + sizeof_buf - 1;
*--endbuf = '\0';
do {
if (comma-- == 0)
{
*--endbuf = ',';
comma = 2;
}
*--endbuf = (value % 10) + '0';
} while ((value /= 10) != 0);
return endbuf;
}
/* Analyze a prog_name/prog_bfd and set various fields in the state
struct. */
SIM_RC
sim_analyze_program (sd, prog_name, prog_bfd)
SIM_DESC sd;
char *prog_name;
bfd *prog_bfd;
{
asection *s;
SIM_ASSERT (STATE_MAGIC (sd) == SIM_MAGIC_NUMBER);
if (prog_bfd != NULL)
{
if (prog_bfd == STATE_PROG_BFD (sd))
/* already analyzed */
return SIM_RC_OK;
else
/* duplicate needed, save the name of the file to be re-opened */
prog_name = bfd_get_filename (prog_bfd);
}
/* do we need to duplicate anything? */
if (prog_name == NULL)
return SIM_RC_OK;
/* open a new copy of the prog_bfd */
prog_bfd = bfd_openr (prog_name, STATE_TARGET (sd));
if (prog_bfd == NULL)
{
sim_io_eprintf (sd, "%s: can't open \"%s\": %s\n",
STATE_MY_NAME (sd),
prog_name,
bfd_errmsg (bfd_get_error ()));
return SIM_RC_FAIL;
}
if (!bfd_check_format (prog_bfd, bfd_object))
{
sim_io_eprintf (sd, "%s: \"%s\" is not an object file: %s\n",
STATE_MY_NAME (sd),
prog_name,
bfd_errmsg (bfd_get_error ()));
bfd_close (prog_bfd);
return SIM_RC_FAIL;
}
if (STATE_ARCHITECTURE (sd) != NULL)
bfd_set_arch_info (prog_bfd, STATE_ARCHITECTURE (sd));
else
{
if (bfd_get_arch (prog_bfd) != bfd_arch_unknown
&& bfd_get_arch (prog_bfd) != bfd_arch_obscure)
{
STATE_ARCHITECTURE (sd) = bfd_get_arch_info (prog_bfd);
}
}
/* update the sim structure */
if (STATE_PROG_BFD (sd) != NULL)
bfd_close (STATE_PROG_BFD (sd));
STATE_PROG_BFD (sd) = prog_bfd;
STATE_START_ADDR (sd) = bfd_get_start_address (prog_bfd);
for (s = prog_bfd->sections; s; s = s->next)
if (strcmp (bfd_get_section_name (prog_bfd, s), ".text") == 0)
{
STATE_TEXT_SECTION (sd) = s;
STATE_TEXT_START (sd) = bfd_get_section_vma (prog_bfd, s);
STATE_TEXT_END (sd) = STATE_TEXT_START (sd) + bfd_section_size (prog_bfd, s);
break;
}
return SIM_RC_OK;
}
/* Simulator timing support. */
/* Called before sim_elapsed_time_since to get a reference point. */
SIM_ELAPSED_TIME
sim_elapsed_time_get ()
{
#ifdef HAVE_GETRUSAGE
struct rusage mytime;
if (getrusage (RUSAGE_SELF, &mytime) == 0)
return 1 + (SIM_ELAPSED_TIME) (((double) mytime.ru_utime.tv_sec * 1000) + (((double) mytime.ru_utime.tv_usec + 500) / 1000));
return 1;
#else
#ifdef HAVE_TIME
return 1 + (SIM_ELAPSED_TIME) time ((time_t) 0);
#else
return 1;
#endif
#endif
}
/* Return the elapsed time in milliseconds since START.
The actual time may be cpu usage (prefered) or wall clock. */
unsigned long
sim_elapsed_time_since (start)
SIM_ELAPSED_TIME start;
{
#ifdef HAVE_GETRUSAGE
return sim_elapsed_time_get () - start;
#else
#ifdef HAVE_TIME
return (sim_elapsed_time_get () - start) * 1000;
#else
return 0;
#endif
#endif
}
/* do_command but with printf style formatting of the arguments */
void
sim_do_commandf (SIM_DESC sd,
const char *fmt,
...)
{
va_list ap;
char *buf;
va_start (ap, fmt);
vasprintf (&buf, fmt, ap);
sim_do_command (sd, buf);
va_end (ap);
free (buf);
}