- linenoiseFree(name);
-
- DATIME(&i,&k);
- k=i+650*k;
- if (!resume)
- {
- save.savetime = k;
- save.mode = -1;
- save.version = VRSION;
- memcpy(&save.game, &game, sizeof(struct game_t));
- save.bird = OBJSND[BIRD];
- save.bivalve = OBJTXT[OYSTER];
- IGNORE(fwrite(&save, sizeof(struct save_t), 1, fp));
- fclose(fp);
- RSPEAK(266);
- exit(0);
- } else {
- IGNORE(fread(&save, sizeof(struct save_t), 1, fp));
- fclose(fp);
- if (save.version != VRSION) {
- SETPRM(1,k/10,MOD(k,10));
- SETPRM(3,VRSION/10,MOD(VRSION,10));
- RSPEAK(269);
- return(2000);
- }
- memcpy(&game, &save.game, sizeof(struct game_t));
- OBJSND[BIRD] = save.bird;
- OBJTXT[OYSTER] = save.bivalve;
- game.zzword=RNDVOC(3,game.zzword);
- return(2000);
+ return GO_TOP;
+}
+
+bool is_valid(struct game_t valgame)
+{
+ /* Save files can be roughly grouped into three groups:
+ * With valid, reaceable state, with valid, but unreachable
+ * state and with invaild state. We check that state is
+ * valid: no states are outside minimal or maximal value
+ */
+
+ /* Bounds check for locations
+ */
+ if ( valgame.chloc < -1 || valgame.chloc > NLOCATIONS ||
+ valgame.chloc < -1 || valgame.chloc > NLOCATIONS ||
+ valgame.loc < -1 || valgame.loc > NLOCATIONS ||
+ valgame.newloc < -1 || valgame.newloc > NLOCATIONS ||
+ valgame.oldloc < -1 || valgame.oldloc > NLOCATIONS ||
+ valgame.oldloc < -1 || valgame.oldloc > NLOCATIONS) {
+ return false;
+ }
+ /* Bounds check for location arrays
+ */
+ for (int i = 0; i <= NDWARVES; i++) {
+ if (valgame.dloc[i] < -1 || valgame.dloc[i] > NLOCATIONS ||
+ valgame.odloc[i] < -1 || valgame.odloc[i] > NLOCATIONS) {
+ return false;
+ }
+ }
+
+ for (int i = 0; i <= NOBJECTS; i++) {
+ if (valgame.place[i] < -1 || valgame.place[i] > NLOCATIONS ||
+ valgame.fixed[i] < -1 || valgame.fixed[i] > NLOCATIONS) {
+ return false;
+ }
+ }
+
+ /* Bounds check for dwarves */
+ if (valgame.dtotal < 0 || valgame.dtotal > NDWARVES ||
+ valgame.dkill < 0 || valgame.dkill > NDWARVES) {
+ return false;