CSY/reowolf Files · examples/utility.c · Centrum Wiskunde & Informatica (CWI)

Files @ 031c9d14adaa

Branch filter:

Location: CSY/reowolf/examples/utility.c

031c9d14adaa 816 B text/x-csrc Show Annotation Show as Raw Download as Raw

Merge branch 'feat-bytecode'

Adds size/alignment/offset computations to the type system and detects
potentially infinite types. If the type is potentially infinite but
contains a union that can break that type loop, then all other variants
of that union are supposed to be allocated on the heap. If the type
is potentially infinite but cannot be broken up, then we throw the
appropriate error.

The size/alignment/offset computations are not yet employed in the
runtime. But prepares Reowolf for a proper bytecode/IR implementation.

#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
#include <unistd.h>
#include "../reowolf.h"

size_t get_user_msg(char * buf, size_t cap) {
	memset(buf, 0, cap);
	printf("Insert a msg of max len %zu: ", cap);
	fgets(buf, cap, stdin);
	for(size_t len = 0; len<cap; len++)
		if(buf[len]==0 || buf[len]=='\n')
			return len;
	return cap;
}
void rw_err_peek(Connector * c) {
	printf("Error str `%s`\n", reowolf_error_peek(NULL));
}

// allocates a buffer!
char * buffer_pdl(char * filename) {
	FILE *f = fopen(filename, "rb");
	if (f == NULL) {
		printf("Opening pdl file returned errno %d!\n", errno);
		exit(1);
	}
	fseek(f, 0, SEEK_END);
	long fsize = ftell(f);
	fseek(f, 0, SEEK_SET);
	char *pdl = malloc(fsize + 1);
	fread(pdl, 1, fsize, f);
	fclose(f);
	pdl[fsize] = 0;
	return pdl;
}