ed67d427c9
jumps to blocks which contain only a jump). Don't bother storing the bb graph in the ir nodes; we can find it on demand by walking the tree instead --- slower, but much easier to understand and more robust. Added a terrible map library.
73 lines
1 KiB
C
73 lines
1 KiB
C
#include "mcg.h"
|
|
|
|
void fatal(const char* msg, ...)
|
|
{
|
|
va_list ap;
|
|
va_start(ap, msg);
|
|
|
|
vfprintf(stderr, msg, ap);
|
|
fprintf(stderr, "\n");
|
|
|
|
va_end(ap);
|
|
abort();
|
|
}
|
|
|
|
const char* aprintf(const char* fmt, ...)
|
|
{
|
|
int n;
|
|
char* p;
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
n = vsnprintf(NULL, 0, fmt, ap) + 1;
|
|
va_end(ap);
|
|
|
|
p = malloc(n);
|
|
if (!p)
|
|
return NULL;
|
|
|
|
va_start(ap, fmt);
|
|
vsnprintf(p, n, fmt, ap);
|
|
va_end(ap);
|
|
|
|
return p;
|
|
}
|
|
|
|
bool tracing(char k)
|
|
{
|
|
switch (k)
|
|
{
|
|
case 'E': return false;
|
|
case '0': return false;
|
|
case '1': return false;
|
|
case '2': return true;
|
|
default: return true;
|
|
}
|
|
}
|
|
|
|
void tracef(char k, const char* fmt, ...)
|
|
{
|
|
va_list ap;
|
|
|
|
if (tracing(k))
|
|
{
|
|
va_start(ap, fmt);
|
|
vprintf(fmt, ap);
|
|
va_end(ap);
|
|
}
|
|
}
|
|
|
|
int main(int argc, char* argv[])
|
|
{
|
|
symbol_init();
|
|
|
|
if (!EM_open(argv[1]))
|
|
fatal("Couldn't open input file: %s", EM_error);
|
|
|
|
parse_em();
|
|
|
|
EM_close();
|
|
return 0;
|
|
}
|
|
|
|
/* vim: set sw=4 ts=4 expandtab : */
|