int Stack_pop(CPU_t* This) {
if (This->stack.count>=1) {
This->stack.count--;
return This->stack.head[This->stack.count]; //
} else {
printf("Pop from an empty stack\n");
CPU_dump(This);
CPU_dtor(This);
exit(0xBAD);
}
}
int main() {
CPU_t* cpu;
FILE* in = fopen("out.txt","r");
CPU_ctor(cpu);
if(!cmd_download(cpu, in)) {
printf("Empty commands file!!\n");
CPU_dtor(cpu);
return 0;
}
CPU_run(cpu);
CPU_dump(cpu);
CPU_dtor(cpu);
printf("LOL\n"); // LOL :)
return 0;
}
//=================================================================================
int ReadBinaryFile (FILE* BinFile, cpu_t* cpu) {
double Size = 0;
fread(&Size, sizeof(double), 1, BinFile);
cpu->max_counter = (int) Size;
cpu->PM = (double*) calloc (cpu->max_counter, sizeof(double));
CPU_dump(cpu); //if DEBUG
if (cpu->PM == NULL)
return CPU_ERR_MEM;
for (int i = 0; i < cpu->max_counter; i++)
fread(&cpu->PM[i], sizeof(double), 1, BinFile);
return CPU_OK;
}
//=================================================================================
int CPU_start (cpu_t* cpu) {
int check = CPU_VALID(cpu);
if (check != CPU_OK) {
return check;
}
CPU_default(cpu);
CPU_dump(cpu); //if DEBUG
while ((int) cpu->PM[cpu->prgm_counter] != END && cpu->prgm_counter < cpu->max_counter) {
double e1 = 0, e2 = 0, buf = 0;
switch ((int) cpu->PM[cpu->prgm_counter]) {
case PUSH:
safe_push(&cpu->Stack, cpu->reg[(int) cpu->PM[cpu->prgm_counter + 1]], "PUSH");
ok_op("PUSH");
cpu->prgm_counter += 2;
break;
case PUSH_DOUBLE:
safe_push(&cpu->Stack, cpu->PM[cpu->prgm_counter + 1], "PUSH DOUBLE");
ok_op("PUSH DOUBLE");
cpu->prgm_counter += 2;
break;
case POP:
safe_pop(&cpu->Stack, &cpu->reg[(int) cpu->PM[cpu->prgm_counter + 1]], "POP");
ok_op("POP");
cpu->prgm_counter += 2;
break;
case ADD:
safe_pop(&cpu->Stack, &e1, "ADD");
safe_pop(&cpu->Stack, &e2, "ADD");
buf = e1 + e2;
safe_push(&cpu->Stack, buf, "ADD");
ok_op("ADD");
cpu->prgm_counter++;
break;
case SUB:
safe_pop(&cpu->Stack, &e1, "SUB");
safe_pop(&cpu->Stack, &e2, "SUB");
buf = e2 - e1;
safe_push(&cpu->Stack, buf, "SUB");
ok_op("SUB");
cpu->prgm_counter++;
break;
case MUL:
safe_pop(&cpu->Stack, &e1, "MUL");
safe_pop(&cpu->Stack, &e2, "MUL");
buf = e2 * e1;
safe_push(&cpu->Stack, buf, "MUL");
ok_op("MUL");
cpu->prgm_counter++;
break;
case DIV:
safe_pop(&cpu->Stack, &e1, "DIV");
if (e1 == 0) {
fprintf(logs, "DIV (%d) == DIVISION BY ZERO\n", cpu->prgm_counter);
return DIVISION_BY_0;
}
safe_pop(&cpu->Stack, &e2, "DIV");
buf = e2 / e1;
safe_push(&cpu->Stack, buf, "DIV");
ok_op("DIV");
cpu->prgm_counter++;
break;
case SQRT:
safe_pop(&cpu->Stack, &e1, "SQRT");
if (e1 < 0) {
fprintf(logs, "SQRT (%d) == NEAGTIVE_RADICAL_EXPRESSION\n", cpu->prgm_counter);
return NEGATIVE_RADICAL;
}
buf = sqrt(e1);
safe_push(&cpu->Stack, buf, "SQRT");
ok_op("SQRT");
cpu->prgm_counter++;
break;
case RET:
safe_pop(&cpu->Address_stack, &e1, "RET");
ok_op("RET");
cpu->prgm_counter = (int) e1;
break;
case OUT:
safe_pop(&cpu->Stack, &e1, "OUT");
printf("%lg\n", e1);
ok_op("OUT");
cpu->prgm_counter++;
break;
case END:
ok_op("END");
return CPU_OK;
case IN:
scanf("%lg", &buf);
safe_push(&cpu->Stack, buf, "IN");
ok_op("IN");
cpu->prgm_counter++;
break;
case JAE:
safe_pop(&cpu->Stack, &e1, "JAE");
safe_pop(&cpu->Stack, &e2, "JAE");
if (e2 >= e1) {
cpu->prgm_counter = (int) cpu->PM[cpu->prgm_counter + 1];
ok_op("JAE");
break;
}
ok_op("JAE");
cpu->prgm_counter += 2;
break;
case JB:
safe_pop(&cpu->Stack, &e1, "JB");
safe_pop(&cpu->Stack, &e2, "JB");
if (e2 < e1) {
cpu->prgm_counter = (int) cpu->PM[cpu->prgm_counter + 1];
ok_op("JB");
break;
}
ok_op("JB");
cpu->prgm_counter += 2;
break;
case JBE:
safe_pop(&cpu->Stack, &e1, "JBE");
safe_pop(&cpu->Stack, &e2, "JBE");
if (e2 <= e1) {
cpu->prgm_counter = (int) cpu->PM[cpu->prgm_counter + 1];
ok_op("JBE");
break;
}
ok_op("JBE");
cpu->prgm_counter += 2;
break;
case JE:
safe_pop(&cpu->Stack, &e1, "JE");
safe_pop(&cpu->Stack, &e2, "JE");
if (e2 == e1) {
cpu->prgm_counter = (int) cpu->PM[cpu->prgm_counter + 1];
ok_op("JE");
break;
}
ok_op("JE");
cpu->prgm_counter += 2;
break;
case JNE:
safe_pop(&cpu->Stack, &e1, "JNE");
safe_pop(&cpu->Stack, &e2, "JNE");
if (e2 != e1) {
cpu->prgm_counter = (int) cpu->PM[cpu->prgm_counter + 1];
ok_op("JNE");
break;
}
ok_op("JNE");
cpu->prgm_counter += 2;
break;
case JMP:
ok_op("JMP");
cpu->prgm_counter = (int) cpu->PM[cpu->prgm_counter + 1];
break;
case JA:
safe_pop(&cpu->Stack, &e1, "JA");
safe_pop(&cpu->Stack, &e2, "JA");
if (e2 > e1) {
cpu->prgm_counter = (int) cpu->PM[cpu->prgm_counter + 1];
ok_op("JA");
break;
}
ok_op("JA");
cpu->prgm_counter += 2;
break;
case CALL:
safe_push(&cpu->Address_stack, cpu->prgm_counter + 2, "CALL");
ok_op("CALL");
cpu->prgm_counter = (int) cpu->PM[cpu->prgm_counter + 1];
break;
case MOV:
cpu->reg[(int) cpu->PM[cpu->prgm_counter + 1]] = cpu->PM[cpu->prgm_counter + 2];
ok_op("MOV");
cpu->prgm_counter += 3;
break;
default:
return NUMBER_OF_COMMAND_EXPECTED;
}
}
return CPU_OK;
}
