char *test_each()
{
DArray *ary = DArray_create(sizeof(VALUE), 10);
VALUE one = Number_new(state, 1);
VALUE two = Number_new(state, 2);
VALUE three = Number_new(state, 3);
DArray_push(ary, one);
DArray_push(ary, two);
DArray_push(ary, three);
VALUE vector = Vector_new(state, ary);
__block int counter = 0;
Vector_each(vector, ^ void (VALUE val) {
counter = counter + VAL2NUM(val);
});
void run(void *literals[], byte instructions[]) {
byte *ip = instructions; // instruction pointer
Object *stack[STACK_MAX]; // the famous stack
Object **sp = stack; // stack pointer
Object *locals[STACK_MAX] = {}; // where we store our local variables
// Setup the runtime
Object *self = Object_new();
retain(self);
// Start processing instructions
while (1) {
switch (*ip) {
case CALL: {
ip++; // moving to the 1st operand
char *method = (char *)literals[*ip];
ip++;
int argc = *ip;
Object *argv[10];
int i;
for(i = 0; i < argc; ++i) argv[i] = STACK_POP();
Object *receiver = STACK_POP();
Object *result = call(receiver, method, argv, argc);
STACK_PUSH(result);
// Releasing what was poped from the stack after we're done with it.
for(i = 0; i < argc; ++i) release(argv[i]);
release(receiver);
break;
}
case PUSH_STRING: {
ip++;
STACK_PUSH(String_new((char *)literals[*ip]));
break;
}
case PUSH_NUMBER: {
ip++;
STACK_PUSH(Number_new((long)literals[*ip]));
break;
}
case PUSH_SELF: {
STACK_PUSH(self);
break;
}
case PUSH_NIL: {
STACK_PUSH(NilObject);
break;
}
case PUSH_BOOL: {
ip++;
if (*ip == 0) {
STACK_PUSH(FalseObject);
} else {
STACK_PUSH(TrueObject);
}
break;
}
case GET_LOCAL: {
ip++; // index of local in the locals table
STACK_PUSH(locals[*ip]);
break;
}
case SET_LOCAL: {
ip++;
locals[*ip] = STACK_POP();
break;
}
case ADD: {
Object *a = STACK_POP();
Object *b = STACK_POP();
STACK_PUSH(Number_new(Number_value(a) + Number_value(b)));
release(a);
release(b);
break;
}
case JUMP_UNLESS: {
ip++; // number of bytes to more forward
byte offset = *ip;
Object *condition = STACK_POP();
if (!Object_is_true(condition)) ip += offset;
release(condition);
break;
}
case RETURN: {
goto cleanup;
break;
}
}
ip++;
}
cleanup:
release(self);
int i;
for(i = 0; i < STACK_MAX; ++i) if (locals[i]) release(locals[i]);
while (sp > stack) release(STACK_POP());
}