/* Miscellaneous simulator utilities.
- Copyright (C) 1997 Free Software Foundation, Inc.
+ Copyright (C) 1997, 1998 Free Software Foundation, Inc.
Contributed by Cygnus Support.
This file is part of GDB, the GNU debugger.
Set by sim_resume. */
struct sim_state *current_state;
-/* Allocate zero filled memory with xmalloc. */
+/* Allocate zero filled memory with xmalloc - xmalloc aborts of the
+ allocation fails. */
void *
zalloc (unsigned long size)
/* Allocate a sim_state struct. */
SIM_DESC
-sim_state_alloc (void)
+sim_state_alloc (SIM_OPEN_KIND kind,
+ host_callback *callback)
{
- SIM_DESC sd = zalloc (sizeof (struct sim_state));
- sd->base.magic = SIM_MAGIC_NUMBER;
+ SIM_DESC sd = ZALLOC (struct sim_state);
+
+ STATE_MAGIC (sd) = SIM_MAGIC_NUMBER;
+ STATE_CALLBACK (sd) = callback;
+ STATE_OPEN_KIND (sd) = kind;
+
+#if 0
+ {
+ int cpu_nr;
+
+ /* 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;
}
sim_state_free (SIM_DESC sd)
{
ASSERT (sd->base.magic == SIM_MAGIC_NUMBER);
+
+#ifdef SIM_STATE_FREE
+ SIM_STATE_FREE (sd);
+#endif
+
zfree (sd);
}
+/* Return a pointer to the cpu data for CPU_NAME, or NULL if not found. */
+
+sim_cpu *
+sim_cpu_lookup (SIM_DESC sd, const char *cpu_name)
+{
+ int i;
+
+ for (i = 0; i < MAX_NR_PROCESSORS; ++i)
+ if (strcmp (cpu_name, CPU_NAME (STATE_CPU (sd, i))) == 0)
+ return STATE_CPU (sd, i);
+ return NULL;
+}
+
/* Turn VALUE into a string with commas. */
char *
return endbuf;
}
-/* Make a copy of ARGV.
- This can also be used to copy the environment vector.
- The result is a pointer to the malloc'd copy or NULL if insufficient
- memory available. */
-
-char **
-sim_copy_argv (argv)
- char **argv;
-{
- int argc;
- char **copy;
-
- if (argv == NULL)
- return NULL;
-
- /* the vector */
- for (argc = 0; argv[argc] != NULL; argc++);
- copy = (char **) malloc ((argc + 1) * sizeof (char *));
- if (copy == NULL)
- return NULL;
-
- /* the strings */
- for (argc = 0; argv[argc] != NULL; argc++)
- {
- int len = strlen (argv[argc]);
- copy[argc] = malloc (sizeof (char *) * (len + 1));
- if (copy[argc] == NULL)
- {
- freeargv (copy);
- return NULL;
- }
- strcpy (copy[argc], argv[argc]);
- }
- copy[argc] = NULL;
- return copy;
-}
-
/* Analyze a prog_name/prog_bfd and set various fields in the state
struct. */
}
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)
#ifdef HAVE_GETRUSAGE
struct rusage mytime;
if (getrusage (RUSAGE_SELF, &mytime) == 0)
- return (SIM_ELAPSED_TIME) (((double) mytime.ru_utime.tv_sec * 1000) + (((double) mytime.ru_utime.tv_usec + 500) / 1000));
- return 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 (SIM_ELAPSED_TIME) time ((time_t) 0);
+ return 1 + (SIM_ELAPSED_TIME) time ((time_t) 0);
#else
- return 0;
+ return 1;
#endif
#endif
}
#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);
+}