Skip to content

Commit

Permalink
r3131@figleaf (orig r258): stig | 2006-08-05 09:06:00 +0200
Browse files Browse the repository at this point in the history 
 detab
  • Loading branch information
stig committed Sep 2, 2007
1 parent e94aa93 commit 3cbc463
Showing 1 changed file with 140 additions and 140 deletions.
280 changes: 140 additions & 140 deletions um.c
View file
Expand Up @@ -8,15 +8,15 @@
typedef uint_fast32_t um_uint;

/* opcodes */
char *ops[] = {
"COND", "INDEX", "AMEND", "ADD", "MUL", "DIV", "NAND", "HALT",
"ALLOC", "FREE", "PRINT", "READ", "LOAD", "SET",
char *ops[] = {
"COND", "INDEX", "AMEND", "ADD", "MUL", "DIV", "NAND", "HALT",
"ALLOC", "FREE", "PRINT", "READ", "LOAD", "SET",
};

/* we need to store lengths of collections */
typedef struct {
size_t len;
um_uint *a;
size_t len;
um_uint *a;
} um_arr;

#define mod(n) (n & 0xffffffff)
Expand All @@ -25,8 +25,8 @@ typedef struct {
#define um_op(n) (n >> 28)

/* extract segment values */
#define um_seg_c(n) (n & 07) /* segment C */
#define um_seg_b(n) ((n >> 3) & 07) /* segment B */
#define um_seg_c(n) (n & 07) /* segment C */
#define um_seg_b(n) ((n >> 3) & 07) /* segment B */
#define um_seg_a(n) ((n >> 6) & 07) /* segment A */

/* op 13 is different from the others */
Expand All @@ -37,104 +37,104 @@ typedef struct {
initialize new pointers to NULL. */
um_arr **um_ppuirealloc(um_arr **p, size_t *old, size_t new)
{
int i;
p = realloc(p, new * sizeof(um_arr));
assert(p != NULL);
/* init new pointers to NULL */
for (i = 0; (*old + i) < new; i++) {
p[ *old + i ] = NULL;
}

/* update the passed-in count of elements */
*old = new;
return p;
int i;
p = realloc(p, new * sizeof(um_arr));
assert(p != NULL);
/* init new pointers to NULL */
for (i = 0; (*old + i) < new; i++) {
p[ *old + i ] = NULL;
}

/* update the passed-in count of elements */
*old = new;
return p;
}

um_arr *um_uicalloc(size_t size)
{
um_arr *arr = malloc(sizeof(um_arr));
assert(arr != NULL);
um_arr *arr = malloc(sizeof(um_arr));
assert(arr != NULL);

arr->a = calloc(size, sizeof(um_uint));
assert(arr->a != NULL);
arr->a = calloc(size, sizeof(um_uint));
assert(arr->a != NULL);

arr->len = size;
return arr;
arr->len = size;
return arr;
}

void um_free(um_arr *p)
{
assert(p != NULL);
assert(p->a != NULL);
free(p->a);
free(p);
assert(p != NULL);
assert(p->a != NULL);
free(p->a);
free(p);
}

void um_out(um_uint c)
{
assert(c <= 255);
putchar(c);
assert(c <= 255);
putchar(c);
}

um_arr *um_read_scroll(char *name)
{
um_arr *arr;
assert(name != NULL);
assert(*name); /* non-empty string */
{
int i, len, c;
FILE *fp = fopen(name, "r");
assert(fp != NULL);
/* find length of file */
for (len = 0; EOF != getc(fp); len++)
;
/* allocate array of ints big enough */
arr = um_uicalloc(len / 4 + 1);
rewind(fp);
/* read bytestream and write into array of ints */
for (i = 0; (c = getc(fp)) != EOF; i++) {
assert(c <= 255);
assert(c >= 0);
arr->a[ i / 4 ] <<= 8;
arr->a[ i / 4 ] += c;
}

/* make sure the last int is shifted correctly */
arr->a[ i / 4] <<= (i % 4) * 8;
// printf("i: %u, len: %u\n", i, len);
assert(len == i);
}
return arr;
um_arr *arr;
assert(name != NULL);
assert(*name); /* non-empty string */
{
int i, len, c;
FILE *fp = fopen(name, "r");
assert(fp != NULL);
/* find length of file */
for (len = 0; EOF != getc(fp); len++)
;
/* allocate array of ints big enough */
arr = um_uicalloc(len / 4 + 1);
rewind(fp);
/* read bytestream and write into array of ints */
for (i = 0; (c = getc(fp)) != EOF; i++) {
assert(c <= 255);
assert(c >= 0);
arr->a[ i / 4 ] <<= 8;
arr->a[ i / 4 ] += c;
}

/* make sure the last int is shifted correctly */
arr->a[ i / 4] <<= (i % 4) * 8;
// printf("i: %u, len: %u\n", i, len);
assert(len == i);
}
return arr;
}

#define dbg(a) um_seg_##a(p), r[um_seg_##a(p)]

void debug( um_uint p, um_uint *r, um_uint finger)
{
int i, n;
um_uint op = um_op(p);
fprintf(stderr, "%x: %s %n", finger, ops[op], &n);
if (op == 13)
fprintf(stderr, "reg: %u, val: %x%n", um_op13_seg(p), um_op13_val(p), &i);
else if (op == 10)
fprintf(stderr, "'%c' %n", r[um_seg_c(p)] != '\n' ? r[um_seg_c(p)] : '\\', &i);
else
fprintf(stderr, "a(%u): %x, b(%u): %x, c(%u): %x%n", dbg(a), dbg(b), dbg(c), &i);

/* make output line up */
for (i = i + n; i < 45; i++)
fputc(' ', stderr);

/* dump registers */
for (i = 0; i < 8; i++)
fprintf(stderr, "%u:%08x, ", i, r[i]);
fputc('\n', stderr);
int i, n;
um_uint op = um_op(p);
fprintf(stderr, "%x: %s %n", finger, ops[op], &n);
if (op == 13)
fprintf(stderr, "reg: %u, val: %x%n", um_op13_seg(p), um_op13_val(p), &i);
else if (op == 10)
fprintf(stderr, "'%c' %n", r[um_seg_c(p)] != '\n' ? r[um_seg_c(p)] : '\\', &i);
else
fprintf(stderr, "a(%u): %x, b(%u): %x, c(%u): %x%n", dbg(a), dbg(b), dbg(c), &i);

/* make output line up */
for (i = i + n; i < 45; i++)
fputc(' ', stderr);

/* dump registers */
for (i = 0; i < 8; i++)
fprintf(stderr, "%u:%08x, ", i, r[i]);
fputc('\n', stderr);
}

int main(int argc, char **argv)
Expand All @@ -143,113 +143,113 @@ int main(int argc, char **argv)
size_t mlen = 0;
um_arr **m = um_ppuirealloc(NULL, &mlen, 1);
um_uint finger = 0;
m[0] = um_read_scroll(argv[1]);
m[0] = um_read_scroll(argv[1]);

for (;;) {
assert(finger < m[0]->len);
um_uint p = m[0]->a[finger++];
// debug(p, r, finger - 1);
um_uint *A = r + um_seg_a(p);
um_uint *B = r + um_seg_b(p);
um_uint *C = r + um_seg_c(p);
um_uint op = um_op(p);
// fprintf(stderr, "%s\n", ops[op]);
assert(finger < m[0]->len);
um_uint p = m[0]->a[finger++];
// debug(p, r, finger - 1);
um_uint *A = r + um_seg_a(p);
um_uint *B = r + um_seg_b(p);
um_uint *C = r + um_seg_c(p);
um_uint op = um_op(p);
// fprintf(stderr, "%s\n", ops[op]);
switch (op) {

case 0: /* Conditional Move. */
if (*C) {
*A = *B;
}
if (*C) {
*A = *B;
}
break;

case 1: /* Array Index. */
assert(*B < mlen);
assert(m[ *B ] != NULL);
assert(m[ *B ]->len > *C);
*A = m[ *B ]->a[ *C ];
assert(*B < mlen);
assert(m[ *B ] != NULL);
assert(m[ *B ]->len > *C);
*A = m[ *B ]->a[ *C ];
break;

case 2: /* Array Amendment. */
assert(*A < mlen);
assert(m[ *A ] != NULL);
assert(m[ *A ]->len > *B);
m[ *A ]->a[ *B ] = *C;
assert(*A < mlen);
assert(m[ *A ] != NULL);
assert(m[ *A ]->len > *B);
m[ *A ]->a[ *B ] = *C;
break;

case 3: /* Addition. */
*A = mod(*B + *C);
*A = mod(*B + *C);
break;

case 4: /* Multiplication. */
*A = mod(*B * *C);
*A = mod(*B * *C);
break;

case 5: /* Division. */
assert(*C); /* don't devide by zero */
*A = (um_uint)*B / (um_uint)*C;
assert(*C); /* don't devide by zero */
*A = (um_uint)*B / (um_uint)*C;
break;

case 6: /* Not-And. */
*A = ~(*B & *C);
*A = ~(*B & *C);
break;

case 7: /* Halt. */
exit(0);
break;

case 8: /* Allocation. */
{
um_uint i;
for (i = 0; i < mlen; i++)
if (!m[i])
break;
if (i == mlen) {
m = um_ppuirealloc(m, &mlen, mlen * 2);
}
assert(m[i] == NULL);
m[i] = um_uicalloc( *C );
*B = i;
}
{
um_uint i;
for (i = 0; i < mlen; i++)
if (!m[i])
break;
if (i == mlen) {
m = um_ppuirealloc(m, &mlen, mlen * 2);
}
assert(m[i] == NULL);
m[i] = um_uicalloc( *C );
*B = i;
}
break;

case 9: /* Abandonment. */
um_free(m[ *C ]);
m[ *C ] = NULL;
um_free(m[ *C ]);
m[ *C ] = NULL;
break;

case 10: /* Output. */
um_out(*C);
um_out(*C);
break;

case 11: /* Input. */
puts("Input unhandled");
puts("Input unhandled");
break;

case 12: /* Load Program. */
if (*B) {
um_uint i;
um_free(m[0]);
um_arr *a = m[ *B ];
m[0] = um_uicalloc(a->len);

for (i = 0; i < a->len; i++) {
m[0]->a[i] = a->a[i];
}
}
finger = *C;
if (*B) {
um_uint i;
um_free(m[0]);
um_arr *a = m[ *B ];
m[0] = um_uicalloc(a->len);

for (i = 0; i < a->len; i++) {
m[0]->a[i] = a->a[i];
}
}
finger = *C;
break;

case 13: /* Orthography. (SET) */
r[ um_op13_seg(p) ] = um_op13_val(p);
r[ um_op13_seg(p) ] = um_op13_val(p);
break;

default:
fprintf(stderr, "Illegal operator encounted: '%u'\n", op);
exit(EXIT_FAILURE);
break;
}
fprintf(stderr, "Illegal operator encounted: '%u'\n", op);
exit(EXIT_FAILURE);
break;
}
}

return 0;
return 0;
}

0 comments on commit 3cbc463

Please sign in to comment.