ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.9 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.17 by root, Thu Aug 31 06:23:19 2006 UTC

1/* 1/*
2 * static char *rcsid_map_c = 2 * static char *rcsid_map_c =
3 * "$Id: map.C,v 1.9 2006/08/27 16:15:11 root Exp $"; 3 * "$Id: map.C,v 1.17 2006/08/31 06:23:19 root Exp $";
4 */ 4 */
5 5
6/* 6/*
7 CrossFire, A Multiplayer game for X-windows 7 CrossFire, A Multiplayer game for X-windows
8 8
… …
47 47
48mapstruct *has_been_loaded (const char *name) { 48mapstruct *has_been_loaded (const char *name) {
49 mapstruct *map; 49 mapstruct *map;
50 50
51 if (!name || !*name) 51 if (!name || !*name)
52 return 0; 52 return 0;
53 for (map = first_map; map; map = map->next) 53 for (map = first_map; map; map = map->next)
54 if (!strcmp (name, map->path)) 54 if (!strcmp (name, map->path))
55 break; 55 break;
56 return (map); 56 return (map);
57} 57}
58 58
59/* 59/*
60 * This makes a path absolute outside the world of Crossfire. 60 * This makes a path absolute outside the world of Crossfire.
… …
159 struct stat statbuf; 159 struct stat statbuf;
160 int mode = 0, i; 160 int mode = 0, i;
161#endif 161#endif
162 162
163 if (prepend_dir) 163 if (prepend_dir)
164 strcpy (buf, create_pathname(name)); 164 strcpy (buf, create_pathname(name));
165 else 165 else
166 strcpy(buf, name); 166 strcpy(buf, name);
167#ifdef WIN32 /* ***win32: check this sucker in windows style. */ 167#ifdef WIN32 /* ***win32: check this sucker in windows style. */
168 return(_access(buf,0)); 168 return(_access(buf,0));
169#else 169#else
170 170
171 /* old method (strchr(buf, '\0')) seemd very odd to me - 171 /* old method (strchr(buf, '\0')) seemd very odd to me -
172 * this method should be equivalant and is clearer. 172 * this method should be equivalant and is clearer.
173 * Can not use strcat because we need to cycle through 173 * Can not use strcat because we need to cycle through
174 * all the names. 174 * all the names.
175 */ 175 */
176 endbuf = buf + strlen(buf); 176 endbuf = buf + strlen(buf);
177 177
178 for (i = 0; i < NROF_COMPRESS_METHODS; i++) {
179 if (uncomp[i][0])
180 strcpy(endbuf, uncomp[i][0]);
181 else
182 *endbuf = '\0';
183 if (!stat (buf, &statbuf)) 178 if (stat (buf, &statbuf))
184 break;
185 }
186 if (i == NROF_COMPRESS_METHODS)
187 return (-1); 179 return -1;
188 if (!S_ISREG (statbuf.st_mode)) 180 if (!S_ISREG (statbuf.st_mode))
189 return (-1); 181 return (-1);
190 182
191 if (((statbuf.st_mode & S_IRGRP) && getegid() == statbuf.st_gid) || 183 if (((statbuf.st_mode & S_IRGRP) && getegid() == statbuf.st_gid) ||
192 ((statbuf.st_mode & S_IRUSR) && geteuid() == statbuf.st_uid) || 184 ((statbuf.st_mode & S_IRUSR) && geteuid() == statbuf.st_uid) ||
193 (statbuf.st_mode & S_IROTH)) 185 (statbuf.st_mode & S_IROTH))
194 mode |= 4; 186 mode |= 4;
195 187
196 if ((statbuf.st_mode & S_IWGRP && getegid() == statbuf.st_gid) || 188 if ((statbuf.st_mode & S_IWGRP && getegid() == statbuf.st_gid) ||
197 (statbuf.st_mode & S_IWUSR && geteuid() == statbuf.st_uid) || 189 (statbuf.st_mode & S_IWUSR && geteuid() == statbuf.st_uid) ||
198 (statbuf.st_mode & S_IWOTH)) 190 (statbuf.st_mode & S_IWOTH))
199 mode |= 2; 191 mode |= 2;
200 192
201 return (mode); 193 return (mode);
202#endif 194#endif
203} 195}
204 196
… …
209 */ 201 */
210 202
211void dump_map(const mapstruct *m) { 203void dump_map(const mapstruct *m) {
212 LOG(llevError,"Map %s status: %d.\n",m->path,m->in_memory); 204 LOG(llevError,"Map %s status: %d.\n",m->path,m->in_memory);
213 LOG(llevError,"Size: %dx%d Start: %d,%d\n", 205 LOG(llevError,"Size: %dx%d Start: %d,%d\n",
214 MAP_WIDTH(m), MAP_HEIGHT(m), 206 MAP_WIDTH(m), MAP_HEIGHT(m),
215 MAP_ENTER_X(m), MAP_ENTER_Y(m)); 207 MAP_ENTER_X(m), MAP_ENTER_Y(m));
216 208
217 if(m->msg!=NULL) 209 if(m->msg!=NULL)
218 LOG(llevError,"Message:\n%s",m->msg); 210 LOG(llevError,"Message:\n%s",m->msg);
219 211
220 if(m->maplore!=NULL) 212 if(m->maplore!=NULL)
221 LOG(llevError,"Lore:\n%s",m->maplore); 213 LOG(llevError,"Lore:\n%s",m->maplore);
222 214
223 if(m->tmpname!=NULL) 215 if(m->tmpname!=NULL)
224 LOG(llevError,"Tmpname: %s\n",m->tmpname); 216 LOG(llevError,"Tmpname: %s\n",m->tmpname);
225 217
226 LOG(llevError,"Difficulty: %d\n",m->difficulty); 218 LOG(llevError,"Difficulty: %d\n",m->difficulty);
227 LOG(llevError,"Darkness: %d\n",m->darkness); 219 LOG(llevError,"Darkness: %d\n",m->darkness);
228} 220}
229 221
… …
234 */ 226 */
235 227
236void dump_all_maps(void) { 228void dump_all_maps(void) {
237 mapstruct *m; 229 mapstruct *m;
238 for(m=first_map;m!=NULL;m=m->next) { 230 for(m=first_map;m!=NULL;m=m->next) {
239 dump_map(m); 231 dump_map(m);
240 } 232 }
241} 233}
242 234
243/* This rolls up wall, blocks_magic, blocks_view, etc, all into 235/* This rolls up wall, blocks_magic, blocks_view, etc, all into
244 * one function that just returns a P_.. value (see map.h) 236 * one function that just returns a P_.. value (see map.h)
… …
259 if (out_of_map(oldmap, x, y)) return P_OUT_OF_MAP; 251 if (out_of_map(oldmap, x, y)) return P_OUT_OF_MAP;
260 newx = x; 252 newx = x;
261 newy = y; 253 newy = y;
262 mp = get_map_from_coord(oldmap, &newx, &newy); 254 mp = get_map_from_coord(oldmap, &newx, &newy);
263 if (mp != oldmap) 255 if (mp != oldmap)
264 retval |= P_NEW_MAP; 256 retval |= P_NEW_MAP;
265 if (newmap) *newmap = mp; 257 if (newmap) *newmap = mp;
266 if (nx) *nx = newx; 258 if (nx) *nx = newx;
267 if (ny) *ny = newy; 259 if (ny) *ny = newy;
268 retval |= mp->spaces[newx + mp->width * newy].flags; 260 retval |= mp->spaces[newx + mp->width * newy].flags;
269 261
… …
293 285
294 /* Make sure the coordinates are valid - they should be, as caller should 286 /* Make sure the coordinates are valid - they should be, as caller should
295 * have already checked this. 287 * have already checked this.
296 */ 288 */
297 if (OUT_OF_REAL_MAP(m, sx, sy)) { 289 if (OUT_OF_REAL_MAP(m, sx, sy)) {
298 LOG(llevError,"blocked_link: Passed map, x, y coordinates outside of map\n"); 290 LOG(llevError,"blocked_link: Passed map, x, y coordinates outside of map\n");
299 return 1; 291 return 1;
300 } 292 }
301 293
302 /* Save some cycles - instead of calling get_map_flags(), just get the value 294 /* Save some cycles - instead of calling get_map_flags(), just get the value
303 * directly. 295 * directly.
304 */ 296 */
… …
320 * let the player through (inventory checkers for example) 312 * let the player through (inventory checkers for example)
321 */ 313 */
322 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK(ob, blocked)) return 0; 314 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK(ob, blocked)) return 0;
323 315
324 if(ob->head != NULL) 316 if(ob->head != NULL)
325 ob=ob->head; 317 ob=ob->head;
326 318
327 /* We basically go through the stack of objects, and if there is 319 /* We basically go through the stack of objects, and if there is
328 * some other object that has NO_PASS or FLAG_ALIVE set, return 320 * some other object that has NO_PASS or FLAG_ALIVE set, return
329 * true. If we get through the entire stack, that must mean 321 * true. If we get through the entire stack, that must mean
330 * ob is blocking it, so return 0. 322 * ob is blocking it, so return 0.
331 */ 323 */
332 for(tmp = GET_MAP_OB(m,sx,sy); tmp!= NULL; tmp = tmp->above) { 324 for(tmp = GET_MAP_OB(m,sx,sy); tmp!= NULL; tmp = tmp->above) {
333 325
334 /* This must be before the checks below. Code for inventory checkers. */ 326 /* This must be before the checks below. Code for inventory checkers. */
335 if (tmp->type==CHECK_INV && OB_MOVE_BLOCK(ob, tmp)) { 327 if (tmp->type==CHECK_INV && OB_MOVE_BLOCK(ob, tmp)) {
336 /* If last_sp is set, the player/monster needs an object, 328 /* If last_sp is set, the player/monster needs an object,
337 * so we check for it. If they don't have it, they can't 329 * so we check for it. If they don't have it, they can't
338 * pass through this space. 330 * pass through this space.
339 */ 331 */
340 if (tmp->last_sp) { 332 if (tmp->last_sp) {
341 if (check_inv_recursive(ob,tmp)==NULL) 333 if (check_inv_recursive(ob,tmp)==NULL)
342 return 1; 334 return 1;
343 else 335 else
344 continue; 336 continue;
345 } else { 337 } else {
346 /* In this case, the player must not have the object - 338 /* In this case, the player must not have the object -
347 * if they do, they can't pass through. 339 * if they do, they can't pass through.
348 */ 340 */
349 if (check_inv_recursive(ob,tmp)!=NULL) /* player has object */ 341 if (check_inv_recursive(ob,tmp)!=NULL) /* player has object */
350 return 1; 342 return 1;
351 else 343 else
352 continue; 344 continue;
353 } 345 }
354 } /* if check_inv */ 346 } /* if check_inv */
355 else { 347 else {
356 /* Broke apart a big nasty if into several here to make 348 /* Broke apart a big nasty if into several here to make
357 * this more readable. first check - if the space blocks 349 * this more readable. first check - if the space blocks
358 * movement, can't move here. 350 * movement, can't move here.
359 * second - if a monster, can't move there, unles it is a 351 * second - if a monster, can't move there, unles it is a
360 * hidden dm 352 * hidden dm
361 */ 353 */
362 if (OB_MOVE_BLOCK(ob, tmp)) return 1; 354 if (OB_MOVE_BLOCK(ob, tmp)) return 1;
363 if (QUERY_FLAG(tmp,FLAG_ALIVE) && tmp->head != ob && tmp != ob && 355 if (QUERY_FLAG(tmp,FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
364 tmp->type != DOOR && !(QUERY_FLAG(tmp,FLAG_WIZ) && tmp->contr->hidden)) 356 tmp->type != DOOR && !(QUERY_FLAG(tmp,FLAG_WIZ) && tmp->contr->hidden))
365 return 1; 357 return 1;
366 } 358 }
367 359
368 } 360 }
369 return 0; 361 return 0;
370} 362}
371 363
… …
402 int flag; 394 int flag;
403 mapstruct *m1; 395 mapstruct *m1;
404 sint16 sx, sy; 396 sint16 sx, sy;
405 397
406 if(ob==NULL) { 398 if(ob==NULL) {
407 flag= get_map_flags(m,&m1, x,y, &sx, &sy); 399 flag= get_map_flags(m,&m1, x,y, &sx, &sy);
408 if (flag & P_OUT_OF_MAP) return P_OUT_OF_MAP; 400 if (flag & P_OUT_OF_MAP) return P_OUT_OF_MAP;
409 401
410 /* don't have object, so don't know what types would block */ 402 /* don't have object, so don't know what types would block */
411 return(GET_MAP_MOVE_BLOCK(m1, sx, sy)); 403 return(GET_MAP_MOVE_BLOCK(m1, sx, sy));
412 } 404 }
413 405
414 for(tmp=ob->arch; tmp!=NULL;tmp=tmp->more) { 406 for(tmp=ob->arch; tmp!=NULL;tmp=tmp->more) {
415 flag = get_map_flags(m, &m1, x+tmp->clone.x,y+tmp->clone.y, &sx, &sy); 407 flag = get_map_flags(m, &m1, x+tmp->clone.x,y+tmp->clone.y, &sx, &sy);
416 408
417 if (flag & P_OUT_OF_MAP) return P_OUT_OF_MAP; 409 if (flag & P_OUT_OF_MAP) return P_OUT_OF_MAP;
418 if (flag & P_IS_ALIVE) return P_IS_ALIVE; 410 if (flag & P_IS_ALIVE) return P_IS_ALIVE;
419 411
420 /* find_first_free_spot() calls this function. However, often 412 /* find_first_free_spot() calls this function. However, often
421 * ob doesn't have any move type (when used to place exits) 413 * ob doesn't have any move type (when used to place exits)
422 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 414 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
423 */ 415 */
424 416
425 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK(m1, sx, sy) != MOVE_ALL) continue; 417 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK(m1, sx, sy) != MOVE_ALL) continue;
426 418
427 /* Note it is intentional that we check ob - the movement type of the 419 /* Note it is intentional that we check ob - the movement type of the
428 * head of the object should correspond for the entire object. 420 * head of the object should correspond for the entire object.
429 */ 421 */
430 if (OB_TYPE_MOVE_BLOCK(ob, GET_MAP_MOVE_BLOCK(m1, sx, sy))) 422 if (OB_TYPE_MOVE_BLOCK(ob, GET_MAP_MOVE_BLOCK(m1, sx, sy)))
431 return AB_NO_PASS; 423 return AB_NO_PASS;
432 424
433 } 425 }
434 return 0; 426 return 0;
435} 427}
436 428
… …
445{ 437{
446 object *tmp=container->inv, *next; 438 object *tmp=container->inv, *next;
447 439
448 container->inv=NULL; 440 container->inv=NULL;
449 while (tmp!=NULL) { 441 while (tmp!=NULL) {
450 next = tmp->below; 442 next = tmp->below;
451 if (tmp->inv) 443 if (tmp->inv)
452 fix_container(tmp); 444 fix_container(tmp);
453 (void) insert_ob_in_ob(tmp,container); 445 (void) insert_ob_in_ob(tmp,container);
454 tmp = next; 446 tmp = next;
455 } 447 }
456 /* sum_weight will go through and calculate what all the containers are 448 /* sum_weight will go through and calculate what all the containers are
457 * carrying. 449 * carrying.
458 */ 450 */
459 sum_weight(container); 451 sum_weight(container);
… …
468 460
469static void link_multipart_objects(mapstruct *m) 461static void link_multipart_objects(mapstruct *m)
470{ 462{
471 int x,y; 463 int x,y;
472 object *tmp, *op, *last, *above; 464 object *tmp, *op, *last, *above;
473 archetype *at; 465 archetype *at;
474 466
475 for(x=0;x<MAP_WIDTH(m);x++) 467 for(x=0;x<MAP_WIDTH(m);x++)
476 for(y=0;y<MAP_HEIGHT(m);y++) 468 for(y=0;y<MAP_HEIGHT(m);y++)
477 for(tmp=get_map_ob(m,x,y);tmp!=NULL;tmp=above) { 469 for(tmp=get_map_ob(m,x,y);tmp!=NULL;tmp=above) {
478 above=tmp->above; 470 above=tmp->above;
479 471
480 /* already multipart - don't do anything more */ 472 /* already multipart - don't do anything more */
481 if (tmp->head || tmp->more) continue; 473 if (tmp->head || tmp->more) continue;
482 474
483 /* If there is nothing more to this object, this for loop 475 /* If there is nothing more to this object, this for loop
484 * won't do anything. 476 * won't do anything.
485 */ 477 */
486 for (at = tmp->arch->more, last=tmp; at != NULL; at=at->more, last=op) { 478 for (at = tmp->arch->more, last=tmp; at != NULL; at=at->more, last=op) {
487 op = arch_to_object(at); 479 op = arch_to_object(at);
488 480
489 /* update x,y coordinates */ 481 /* update x,y coordinates */
490 op->x += tmp->x; 482 op->x += tmp->x;
491 op->y += tmp->y; 483 op->y += tmp->y;
492 op->head = tmp; 484 op->head = tmp;
493 op->map = m; 485 op->map = m;
494 last->more = op; 486 last->more = op;
495 if (tmp->name != op->name) { 487 if (tmp->name != op->name) {
496 if (op->name) free_string(op->name); 488 if (op->name) free_string(op->name);
497 op->name = add_string(tmp->name); 489 op->name = add_string(tmp->name);
498 } 490 }
499 if (tmp->title != op->title) { 491 if (tmp->title != op->title) {
500 if (op->title) free_string(op->title); 492 if (op->title) free_string(op->title);
501 op->title = add_string(tmp->title); 493 op->title = add_string(tmp->title);
502 } 494 }
503 /* we could link all the parts onto tmp, and then just 495 /* we could link all the parts onto tmp, and then just
504 * call insert_ob_in_map once, but the effect is the same, 496 * call insert_ob_in_map once, but the effect is the same,
505 * as insert_ob_in_map will call itself with each part, and 497 * as insert_ob_in_map will call itself with each part, and
506 * the coding is simpler to just to it here with each part. 498 * the coding is simpler to just to it here with each part.
507 */ 499 */
508 insert_ob_in_map(op, op->map, tmp,INS_NO_MERGE|INS_ABOVE_FLOOR_ONLY|INS_NO_WALK_ON); 500 insert_ob_in_map(op, op->map, tmp,INS_NO_MERGE|INS_ABOVE_FLOOR_ONLY|INS_NO_WALK_ON);
509 } /* for at = tmp->arch->more */ 501 } /* for at = tmp->arch->more */
510 } /* for objects on this space */ 502 } /* for objects on this space */
511} 503}
512 504
513 505
514 506
515/* 507/*
516 * Loads (ands parses) the objects into a given map from the specified 508 * Loads (ands parses) the objects into a given map from the specified
517 * file pointer. 509 * file pointer.
518 * mapflags is the same as we get with load_original_map 510 * mapflags is the same as we get with load_original_map
519 */ 511 */
520 512
521void load_objects (mapstruct *m, FILE *fp, object_thawer &thawer, int mapflags) { 513void load_objects (mapstruct *m, object_thawer &fp, int mapflags) {
522 int i,j,bufstate=LO_NEWFILE; 514 int i,j,bufstate=LO_NEWFILE;
523 int unique; 515 int unique;
524 object *op, *prev=NULL,*last_more=NULL, *otmp; 516 object *op, *prev=NULL,*last_more=NULL, *otmp;
525 517
526 op=get_object(); 518 op=get_object();
527 op->map = m; /* To handle buttons correctly */ 519 op->map = m; /* To handle buttons correctly */
528 520
529 while((i = load_object (fp, thawer, op, bufstate, mapflags))) { 521 while((i = load_object (fp, op, bufstate, mapflags))) {
530 /* Since the loading of the map header does not load an object 522 /* Since the loading of the map header does not load an object
531 * anymore, we need to pass LO_NEWFILE for the first object loaded, 523 * anymore, we need to pass LO_NEWFILE for the first object loaded,
532 * and then switch to LO_REPEAT for faster loading. 524 * and then switch to LO_REPEAT for faster loading.
533 */ 525 */
534 bufstate = LO_REPEAT; 526 bufstate = LO_REPEAT;
535 527
536 /* if the archetype for the object is null, means that we 528 /* if the archetype for the object is null, means that we
537 * got an invalid object. Don't do anything with it - the game 529 * got an invalid object. Don't do anything with it - the game
538 * or editor will not be able to do anything with it either. 530 * or editor will not be able to do anything with it either.
539 */ 531 */
540 if (op->arch==NULL) { 532 if (op->arch==NULL) {
541 LOG(llevDebug,"Discarding object without arch: %s\n", op->name?op->name:"(null)"); 533 LOG(llevDebug,"Discarding object without arch: %s\n", op->name?op->name:"(null)");
542 continue; 534 continue;
543 } 535 }
544 536
545 537
546 switch(i) { 538 switch(i) {
547 case LL_NORMAL: 539 case LL_NORMAL:
548 /* if we are loading an overlay, put the floors on the bottom */ 540 /* if we are loading an overlay, put the floors on the bottom */
549 if ((QUERY_FLAG(op, FLAG_IS_FLOOR) || 541 if ((QUERY_FLAG(op, FLAG_IS_FLOOR) ||
550 QUERY_FLAG(op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) 542 QUERY_FLAG(op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)
551 insert_ob_in_map(op,m,op,INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD); 543 insert_ob_in_map(op,m,op,INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);
552 else 544 else
553 insert_ob_in_map(op,m,op,INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 545 insert_ob_in_map(op,m,op,INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
554 546
555 if (op->inv) 547 if (op->inv)
556 sum_weight(op); 548 sum_weight(op);
557 549
558 prev=op,last_more=op; 550 prev=op,last_more=op;
559 break; 551 break;
560 552
561 case LL_MORE: 553 case LL_MORE:
562 insert_ob_in_map(op,m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 554 insert_ob_in_map(op,m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);
563 op->head=prev,last_more->more=op,last_more=op; 555 op->head=prev,last_more->more=op,last_more=op;
564 break; 556 break;
565 } 557 }
566 if (mapflags & MAP_STYLE) { 558 if (mapflags & MAP_STYLE) {
567 remove_from_active_list(op); 559 remove_from_active_list(op);
568 } 560 }
569 op=get_object(); 561 op=get_object();
570 op->map = m; 562 op->map = m;
571 } 563 }
572 for (i=0;i<m->width;i++){ 564 for (i=0;i<m->width;i++){
573 for (j=0;j<m->height;j++){ 565 for (j=0;j<m->height;j++){
574 unique =0; 566 unique =0;
575 /* check for unique items, or unique squares */ 567 /* check for unique items, or unique squares */
576 for (otmp = get_map_ob(m, i, j); otmp; otmp = otmp->above) { 568 for (otmp = get_map_ob(m, i, j); otmp; otmp = otmp->above) {
577 if (QUERY_FLAG(otmp, FLAG_UNIQUE) || QUERY_FLAG(otmp, FLAG_OBJ_SAVE_ON_OVL)) 569 if (QUERY_FLAG(otmp, FLAG_UNIQUE) || QUERY_FLAG(otmp, FLAG_OBJ_SAVE_ON_OVL))
578 unique = 1; 570 unique = 1;
579 if (!(mapflags & (MAP_OVERLAY|MAP_PLAYER_UNIQUE) || unique)) 571 if (!(mapflags & (MAP_OVERLAY|MAP_PLAYER_UNIQUE) || unique))
580 SET_FLAG(otmp, FLAG_OBJ_ORIGINAL); 572 SET_FLAG(otmp, FLAG_OBJ_ORIGINAL);
581 } 573 }
582 } 574 }
583 } 575 }
584 free_object(op); 576 free_object(op);
585 link_multipart_objects(m); 577 link_multipart_objects(m);
586} 578}
587 579
588/* This saves all the objects on the map in a non destructive fashion. 580/* This saves all the objects on the map in a non destructive fashion.
589 * Modified by MSW 2001-07-01 to do in a single pass - reduces code, 581 * Modified by MSW 2001-07-01 to do in a single pass - reduces code,
590 * and we only save the head of multi part objects - this is needed 582 * and we only save the head of multi part objects - this is needed
591 * in order to do map tiling properly. 583 * in order to do map tiling properly.
592 */ 584 */
593void save_objects (mapstruct *m, FILE *fp, object_freezer &freezer, FILE *fp2, object_freezer &freezer2, int flag) { 585void save_objects (mapstruct *m, object_freezer &fp, object_freezer &fp2, int flag) {
594 int i, j = 0,unique=0; 586 int i, j = 0,unique=0;
595 object *op; 587 object *op;
596 /* first pass - save one-part objects */ 588 /* first pass - save one-part objects */
597 for(i = 0; i < MAP_WIDTH(m); i++) 589 for(i = 0; i < MAP_WIDTH(m); i++)
598 for (j = 0; j < MAP_HEIGHT(m); j++) { 590 for (j = 0; j < MAP_HEIGHT(m); j++) {
599 unique=0; 591 unique=0;
600 for(op = get_map_ob (m, i, j); op; op = op->above) { 592 for(op = get_map_ob (m, i, j); op; op = op->above) {
601 if (QUERY_FLAG(op,FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE)) 593 if (QUERY_FLAG(op,FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE))
602 unique=1; 594 unique=1;
603 595
604 if(op->type == PLAYER) { 596 if(op->type == PLAYER) {
605 LOG(llevDebug, "Player on map that is being saved\n"); 597 LOG(llevDebug, "Player on map that is being saved\n");
606 continue; 598 continue;
607 } 599 }
608 600
609 if (op->head || op->owner) 601 if (op->head || op->owner)
610 continue; 602 continue;
611 603
612 if (unique || QUERY_FLAG(op, FLAG_UNIQUE)) 604 if (unique || QUERY_FLAG(op, FLAG_UNIQUE))
613 save_object( fp2 , freezer2, op, 3); 605 save_object (fp2, op, 3);
614 else 606 else
615 if (flag == 0 || 607 if (flag == 0 ||
616 (flag == 2 && (!QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) && 608 (flag == 2 && (!QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) &&
617 !QUERY_FLAG(op, FLAG_UNPAID)))) 609 !QUERY_FLAG(op, FLAG_UNPAID))))
618 save_object(fp, freezer, op, 3); 610 save_object(fp, op, 3);
619 611
620 } /* for this space */ 612 } /* for this space */
621 } /* for this j */ 613 } /* for this j */
622} 614}
623 615
624/* 616/*
625 * Allocates, initialises, and returns a pointer to a mapstruct. 617 * Allocates, initialises, and returns a pointer to a mapstruct.
626 * Modified to no longer take a path option which was not being 618 * Modified to no longer take a path option which was not being
… …
630mapstruct *get_linked_map(void) { 622mapstruct *get_linked_map(void) {
631 mapstruct *map=(mapstruct *) calloc(1,sizeof(mapstruct)); 623 mapstruct *map=(mapstruct *) calloc(1,sizeof(mapstruct));
632 mapstruct *mp; 624 mapstruct *mp;
633 625
634 if(map==NULL) 626 if(map==NULL)
635 fatal(OUT_OF_MEMORY); 627 fatal(OUT_OF_MEMORY);
636 628
637 for(mp=first_map;mp!=NULL&&mp->next!=NULL;mp=mp->next); 629 for(mp=first_map;mp!=NULL&&mp->next!=NULL;mp=mp->next);
638 if(mp==NULL) 630 if(mp==NULL)
639 first_map=map; 631 first_map=map;
640 else 632 else
641 mp->next=map; 633 mp->next=map;
642 634
643 map->in_memory=MAP_SWAPPED; 635 map->in_memory=MAP_SWAPPED;
644 /* The maps used to pick up default x and y values from the 636 /* The maps used to pick up default x and y values from the
645 * map archetype. Mimic that behaviour. 637 * map archetype. Mimic that behaviour.
646 */ 638 */
… …
648 MAP_HEIGHT(map)=16; 640 MAP_HEIGHT(map)=16;
649 MAP_RESET_TIMEOUT(map)=0; 641 MAP_RESET_TIMEOUT(map)=0;
650 MAP_TIMEOUT(map)=300; 642 MAP_TIMEOUT(map)=300;
651 MAP_ENTER_X(map)=0; 643 MAP_ENTER_X(map)=0;
652 MAP_ENTER_Y(map)=0; 644 MAP_ENTER_Y(map)=0;
653 /*set part to -1 indicating conversion to weather map not yet done*/ 645 /*set part to -1 indicating conversion to weather map not yet done*/
654 MAP_WORLDPARTX(map)=-1; 646 MAP_WORLDPARTX(map)=-1;
655 MAP_WORLDPARTY(map)=-1; 647 MAP_WORLDPARTY(map)=-1;
656 return map; 648 return map;
657} 649}
658 650
659/* 651/*
660 * Allocates the arrays contained in a mapstruct. 652 * Allocates the arrays contained in a mapstruct.
… …
667 /* Log this condition and free the storage. We could I suppose 659 /* Log this condition and free the storage. We could I suppose
668 * realloc, but if the caller is presuming the data will be intact, 660 * realloc, but if the caller is presuming the data will be intact,
669 * that is their poor assumption. 661 * that is their poor assumption.
670 */ 662 */
671 if (m->spaces) { 663 if (m->spaces) {
672 LOG(llevError,"allocate_map called with already allocated map (%s)\n", m->path); 664 LOG(llevError,"allocate_map called with already allocated map (%s)\n", m->path);
673 free(m->spaces); 665 free(m->spaces);
674 } 666 }
675 667
676 m->spaces = (MapSpace *) calloc(1, MAP_WIDTH(m) * MAP_HEIGHT(m) * sizeof(MapSpace)); 668 m->spaces = (MapSpace *) calloc(1, MAP_WIDTH(m) * MAP_HEIGHT(m) * sizeof(MapSpace));
677 669
678 if(m->spaces==NULL) 670 if(m->spaces==NULL)
679 fatal(OUT_OF_MEMORY); 671 fatal(OUT_OF_MEMORY);
680} 672}
681 673
682/* Create and returns a map of the specific size. Used 674/* Create and returns a map of the specific size. Used
683 * in random map code and the editor. 675 * in random map code and the editor.
684 */ 676 */
… …
705 697
706 shop_string=strdup_local(input_string); 698 shop_string=strdup_local(input_string);
707 p=shop_string; 699 p=shop_string;
708 /* first we'll count the entries, we'll need that for allocating the array shortly */ 700 /* first we'll count the entries, we'll need that for allocating the array shortly */
709 while (p) { 701 while (p) {
710 p=strchr(p, ';'); 702 p=strchr(p, ';');
711 number_of_entries++; 703 number_of_entries++;
712 if (p) p++; 704 if (p) p++;
713 } 705 }
714 p=shop_string; 706 p=shop_string;
715 strip_endline(p); 707 strip_endline(p);
716 items=(shopitems *) CALLOC(number_of_entries+1, sizeof(shopitems)); 708 items=(shopitems *) CALLOC(number_of_entries+1, sizeof(shopitems));
717 memset(items, 0, (sizeof(shopitems) * number_of_entries+1)); 709 memset(items, 0, (sizeof(shopitems) * number_of_entries+1));
718 for (i=0; i<number_of_entries; i++) { 710 for (i=0; i<number_of_entries; i++) {
719 if (!p) { 711 if (!p) {
720 LOG(llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n"); 712 LOG(llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");
721 break; 713 break;
722 } 714 }
723 next_semicolon=strchr(p, ';'); 715 next_semicolon=strchr(p, ';');
724 next_colon=strchr(p, ':'); 716 next_colon=strchr(p, ':');
725 /* if there is a stregth specified, figure out what it is, we'll need it soon. */ 717 /* if there is a stregth specified, figure out what it is, we'll need it soon. */
726 if (next_colon &&( !next_semicolon || next_colon<next_semicolon)) 718 if (next_colon &&( !next_semicolon || next_colon<next_semicolon))
727 items[i].strength=atoi(strchr(p,':')+1); 719 items[i].strength=atoi(strchr(p,':')+1);
728 720
729 if (isdigit(*p) || *p=='*') { 721 if (isdigit(*p) || *p=='*') {
730 items[i].typenum = atoi(p); /* atoi returns 0 when we have an asterisk */ 722 items[i].typenum = atoi(p); /* atoi returns 0 when we have an asterisk */
731 current_type=get_typedata(items[i].typenum); 723 current_type=get_typedata(items[i].typenum);
732 if (current_type) { 724 if (current_type) {
733 items[i].name=current_type->name; 725 items[i].name=current_type->name;
734 items[i].name_pl=current_type->name_pl; 726 items[i].name_pl=current_type->name_pl;
735 } 727 }
736 } 728 }
737 else { /*we have a named type, let's figure out what it is */ 729 else { /*we have a named type, let's figure out what it is */
738 q=strpbrk(p,";:"); 730 q=strpbrk(p,";:");
739 if (q) *q='\0'; 731 if (q) *q='\0';
740
741 current_type=get_typedata_by_name(p);
742 if (current_type) {
743 items[i].name=current_type->name;
744 items[i].typenum=current_type->number;
745 items[i].name_pl=current_type->name_pl;
746 }
747 else { /* oh uh, something's wrong, let's free up this one, and try
748 * the next entry while we're at it, better print a warning
749 */
750 LOG(llevError, "invalid type %s defined in shopitems in string %s\n",
751 p, input_string);
752 }
753 } 732
733 current_type=get_typedata_by_name(p);
734 if (current_type) {
735 items[i].name=current_type->name;
736 items[i].typenum=current_type->number;
737 items[i].name_pl=current_type->name_pl;
738 }
739 else { /* oh uh, something's wrong, let's free up this one, and try
740 * the next entry while we're at it, better print a warning
741 */
742 LOG(llevError, "invalid type %s defined in shopitems in string %s\n",
743 p, input_string);
744 }
745 }
754 items[i].index=number_of_entries; 746 items[i].index=number_of_entries;
755 if (next_semicolon) p=++next_semicolon; 747 if (next_semicolon) p=++next_semicolon;
756 else p=NULL; 748 else p=NULL;
757 } 749 }
758 free(shop_string); 750 free(shop_string);
759 return items; 751 return items;
760} 752}
761 753
… …
764static void print_shop_string(mapstruct *m, char *output_string) { 756static void print_shop_string(mapstruct *m, char *output_string) {
765 int i; 757 int i;
766 char tmp[MAX_BUF]; 758 char tmp[MAX_BUF];
767 strcpy(output_string, ""); 759 strcpy(output_string, "");
768 for (i=0; i< m->shopitems[0].index; i++) { 760 for (i=0; i< m->shopitems[0].index; i++) {
769 if (m->shopitems[i].typenum) { 761 if (m->shopitems[i].typenum) {
770 if (m->shopitems[i].strength) { 762 if (m->shopitems[i].strength) {
771 sprintf(tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 763 sprintf(tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
772 } 764 }
773 else sprintf(tmp, "%s;", m->shopitems[i].name); 765 else sprintf(tmp, "%s;", m->shopitems[i].name);
774 } 766 }
775 else { 767 else {
776 if (m->shopitems[i].strength) { 768 if (m->shopitems[i].strength) {
777 sprintf(tmp, "*:%d;", m->shopitems[i].strength); 769 sprintf(tmp, "*:%d;", m->shopitems[i].strength);
778 } 770 }
779 else sprintf(tmp, "*"); 771 else sprintf(tmp, "*");
780 } 772 }
781 strcat(output_string, tmp); 773 strcat(output_string, tmp);
782 } 774 }
783} 775}
784 776
785/* This loads the header information of the map. The header 777/* This loads the header information of the map. The header
786 * contains things like difficulty, size, timeout, etc. 778 * contains things like difficulty, size, timeout, etc.
… …
793 * currently, there are few enough fields this is not a big deal. 785 * currently, there are few enough fields this is not a big deal.
794 * MSW 2001-07-01 786 * MSW 2001-07-01
795 * return 0 on success, 1 on failure. 787 * return 0 on success, 1 on failure.
796 */ 788 */
797 789
798static int load_map_header(FILE *fp, mapstruct *m) 790static int load_map_header(object_thawer &fp, mapstruct *m)
799{ 791{
800 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key=NULL, *value, *end; 792 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key=NULL, *value, *end;
801 int msgpos=0; 793 int msgpos=0;
802 int maplorepos=0; 794 int maplorepos=0;
803 795
804 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 796 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) {
805 buf[HUGE_BUF-1] = 0; 797 buf[HUGE_BUF-1] = 0;
806 key = buf; 798 key = buf;
807 while (isspace(*key)) key++; 799 while (isspace(*key)) key++;
808 if (*key == 0) continue; /* empty line */ 800 if (*key == 0) continue; /* empty line */
809 value = strchr(key, ' '); 801 value = strchr(key, ' ');
810 if (!value) { 802 if (!value) {
811 end = strchr(key, '\n'); 803 end = strchr(key, '\n');
812 if (end != NULL) { 804 if (end != NULL) {
813 *end = 0; 805 *end = 0;
814 } 806 }
815 } else { 807 } else {
816 *value = 0; 808 *value = 0;
817 value++; 809 value++;
818 end = strchr(value, '\n'); 810 end = strchr(value, '\n');
819 while (isspace(*value)) { 811 while (isspace(*value)) {
820 value++; 812 value++;
821 if (*value == '\0' || value == end) { 813 if (*value == '\0' || value == end) {
822 /* Nothing but spaces. */ 814 /* Nothing but spaces. */
823 value = NULL; 815 value = NULL;
824 break; 816 break;
825 } 817 }
826 } 818 }
827 } 819 }
828 if (!end) { 820 if (!end) {
829 LOG(llevError, "Error loading map header - did not find a newline - perhaps file is truncated? Buf=%s\n", 821 LOG(llevError, "Error loading map header - did not find a newline - perhaps file is truncated? Buf=%s\n",
830 buf); 822 buf);
831 return 1; 823 return 1;
832 } 824 }
833 825
834 826
835 /* key is the field name, value is what it should be set 827 /* key is the field name, value is what it should be set
836 * to. We've already done the work to null terminate key, 828 * to. We've already done the work to null terminate key,
837 * and strip off any leading spaces for both of these. 829 * and strip off any leading spaces for both of these.
838 * We have not touched the newline at the end of the line - 830 * We have not touched the newline at the end of the line -
839 * these are needed for some values. the end pointer 831 * these are needed for some values. the end pointer
840 * points to the first of the newlines. 832 * points to the first of the newlines.
841 * value could be NULL! It would be easy enough to just point 833 * value could be NULL! It would be easy enough to just point
842 * this to "" to prevent cores, but that would let more errors slide 834 * this to "" to prevent cores, but that would let more errors slide
843 * through. 835 * through.
844 * 836 *
845 * First check for entries that do not use the value parameter, then 837 * First check for entries that do not use the value parameter, then
846 * validate that value is given and check for the remaining entries 838 * validate that value is given and check for the remaining entries
847 * that use the parameter. 839 * that use the parameter.
848 */ 840 */
849 841
850 if (!strcmp(key,"msg")) { 842 if (!strcmp(key,"msg")) {
851 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 843 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) {
852 if (!strcmp(buf,"endmsg\n")) break; 844 if (!strcmp(buf,"endmsg\n")) break;
853 else { 845 else {
854 /* slightly more efficient than strcat */ 846 /* slightly more efficient than strcat */
855 strcpy(msgbuf+msgpos, buf); 847 strcpy(msgbuf+msgpos, buf);
856 msgpos += strlen(buf); 848 msgpos += strlen(buf);
857 } 849 }
858 } 850 }
859 /* There are lots of maps that have empty messages (eg, msg/endmsg 851 /* There are lots of maps that have empty messages (eg, msg/endmsg
860 * with nothing between). There is no reason in those cases to 852 * with nothing between). There is no reason in those cases to
861 * keep the empty message. Also, msgbuf contains garbage data 853 * keep the empty message. Also, msgbuf contains garbage data
862 * when msgpos is zero, so copying it results in crashes 854 * when msgpos is zero, so copying it results in crashes
863 */ 855 */
864 if (msgpos != 0) 856 if (msgpos != 0)
865 m->msg = strdup_local(msgbuf); 857 m->msg = strdup_local(msgbuf);
866 } 858 }
867 else if (!strcmp(key,"maplore")) { 859 else if (!strcmp(key,"maplore")) {
868 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 860 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) {
869 if (!strcmp(buf,"endmaplore\n")) break; 861 if (!strcmp(buf,"endmaplore\n")) break;
870 else { 862 else {
871 /* slightly more efficient than strcat */ 863 /* slightly more efficient than strcat */
872 strcpy(maplorebuf+maplorepos, buf); 864 strcpy(maplorebuf+maplorepos, buf);
873 maplorepos += strlen(buf); 865 maplorepos += strlen(buf);
874 } 866 }
875 } 867 }
876 if (maplorepos != 0) 868 if (maplorepos != 0)
877 m->maplore = strdup_local(maplorebuf); 869 m->maplore = strdup_local(maplorebuf);
878 } 870 }
879 else if (!strcmp(key,"end")) { 871 else if (!strcmp(key,"end")) {
880 break; 872 break;
881 } 873 }
882 else if (value == NULL) { 874 else if (value == NULL) {
883 LOG(llevError, "Got '%s' line without parameter in map header\n", key); 875 LOG(llevError, "Got '%s' line without parameter in map header\n", key);
884 } 876 }
885 else if (!strcmp(key, "arch")) { 877 else if (!strcmp(key, "arch")) {
886 /* This is an oddity, but not something we care about much. */ 878 /* This is an oddity, but not something we care about much. */
887 if (strcmp(value,"map\n")) 879 if (strcmp(value,"map\n"))
888 LOG(llevError,"loading map and got a non 'arch map' line(%s %s)?\n",key,value); 880 LOG(llevError,"loading map and got a non 'arch map' line(%s %s)?\n",key,value);
889 } 881 }
890 else if (!strcmp(key,"name")) { 882 else if (!strcmp(key,"name")) {
891 *end=0; 883 *end=0;
892 m->name = strdup_local(value); 884 m->name = strdup_local(value);
893 } 885 }
894 /* first strcmp value on these are old names supported 886 /* first strcmp value on these are old names supported
895 * for compatibility reasons. The new values (second) are 887 * for compatibility reasons. The new values (second) are
896 * what really should be used. 888 * what really should be used.
897 */ 889 */
890 else if (!strcmp(key,"oid")) {
891 fp.get (m, atoi(value));
892 } else if (!strcmp(key, "attach")) {
893 m->attach = add_string (value);
898 else if (!strcmp(key,"hp") || !strcmp(key, "enter_x")) { 894 } else if (!strcmp(key,"hp") || !strcmp(key, "enter_x")) {
899 m->enter_x = atoi(value); 895 m->enter_x = atoi(value);
900 } else if (!strcmp(key,"sp") || !strcmp(key, "enter_y")) { 896 } else if (!strcmp(key,"sp") || !strcmp(key, "enter_y")) {
901 m->enter_y = atoi(value); 897 m->enter_y = atoi(value);
902 } else if (!strcmp(key,"x") || !strcmp(key, "width")) { 898 } else if (!strcmp(key,"x") || !strcmp(key, "width")) {
903 m->width = atoi(value); 899 m->width = atoi(value);
904 } else if (!strcmp(key,"y") || !strcmp(key, "height")) { 900 } else if (!strcmp(key,"y") || !strcmp(key, "height")) {
905 m->height = atoi(value); 901 m->height = atoi(value);
906 } else if (!strcmp(key,"weight") || !strcmp(key, "reset_timeout")) { 902 } else if (!strcmp(key,"weight") || !strcmp(key, "reset_timeout")) {
907 m->reset_timeout = atoi(value); 903 m->reset_timeout = atoi(value);
908 } else if (!strcmp(key,"value") || !strcmp(key, "swap_time")) { 904 } else if (!strcmp(key,"value") || !strcmp(key, "swap_time")) {
909 m->timeout = atoi(value); 905 m->timeout = atoi(value);
910 } else if (!strcmp(key,"level") || !strcmp(key, "difficulty")) { 906 } else if (!strcmp(key,"level") || !strcmp(key, "difficulty")) {
911 m->difficulty = atoi(value); 907 m->difficulty = atoi(value);
912 } else if (!strcmp(key,"invisible") || !strcmp(key, "darkness")) { 908 } else if (!strcmp(key,"invisible") || !strcmp(key, "darkness")) {
913 m->darkness = atoi(value); 909 m->darkness = atoi(value);
914 } else if (!strcmp(key,"stand_still") || !strcmp(key, "fixed_resettime")) { 910 } else if (!strcmp(key,"stand_still") || !strcmp(key, "fixed_resettime")) {
915 m->fixed_resettime = atoi(value); 911 m->fixed_resettime = atoi(value);
916 } else if (!strcmp(key,"unique")) { 912 } else if (!strcmp(key,"unique")) {
917 m->unique = atoi(value); 913 m->unique = atoi(value);
918 } else if (!strcmp(key,"template")) { 914 } else if (!strcmp(key,"template")) {
919 m->templatemap = atoi(value); 915 m->templatemap = atoi(value);
920 } else if (!strcmp(key,"region")) { 916 } else if (!strcmp(key,"region")) {
921 m->region = get_region_by_name(value); 917 m->region = get_region_by_name(value);
922 } else if (!strcmp(key,"shopitems")) { 918 } else if (!strcmp(key,"shopitems")) {
923 *end=0; 919 *end=0;
924 m->shopitems = parse_shop_string(value); 920 m->shopitems = parse_shop_string(value);
925 } else if (!strcmp(key,"shopgreed")) { 921 } else if (!strcmp(key,"shopgreed")) {
926 m->shopgreed = atof(value); 922 m->shopgreed = atof(value);
927 } else if (!strcmp(key,"shopmin")) { 923 } else if (!strcmp(key,"shopmin")) {
928 m->shopmin = atol(value); 924 m->shopmin = atol(value);
929 } else if (!strcmp(key,"shopmax")) { 925 } else if (!strcmp(key,"shopmax")) {
930 m->shopmax = atol(value); 926 m->shopmax = atol(value);
931 } else if (!strcmp(key,"shoprace")) { 927 } else if (!strcmp(key,"shoprace")) {
932 *end=0; 928 *end=0;
933 m->shoprace = strdup_local(value); 929 m->shoprace = strdup_local(value);
934 } else if (!strcmp(key,"outdoor")) { 930 } else if (!strcmp(key,"outdoor")) {
935 m->outdoor = atoi(value); 931 m->outdoor = atoi(value);
936 } else if (!strcmp(key, "temp")) { 932 } else if (!strcmp(key, "temp")) {
937 m->temp = atoi(value); 933 m->temp = atoi(value);
938 } else if (!strcmp(key, "pressure")) { 934 } else if (!strcmp(key, "pressure")) {
939 m->pressure = atoi(value); 935 m->pressure = atoi(value);
940 } else if (!strcmp(key, "humid")) { 936 } else if (!strcmp(key, "humid")) {
941 m->humid = atoi(value); 937 m->humid = atoi(value);
942 } else if (!strcmp(key, "windspeed")) { 938 } else if (!strcmp(key, "windspeed")) {
943 m->windspeed = atoi(value); 939 m->windspeed = atoi(value);
944 } else if (!strcmp(key, "winddir")) { 940 } else if (!strcmp(key, "winddir")) {
945 m->winddir = atoi(value); 941 m->winddir = atoi(value);
946 } else if (!strcmp(key, "sky")) { 942 } else if (!strcmp(key, "sky")) {
947 m->sky = atoi(value); 943 m->sky = atoi(value);
948 } else if (!strcmp(key, "nosmooth")) { 944 } else if (!strcmp(key, "nosmooth")) {
949 m->nosmooth = atoi(value); 945 m->nosmooth = atoi(value);
950 } else if (!strcmp(key, "safe_map")) { 946 }
951 m->safe_map = atoi(value);
952 }
953 else if (!strncmp(key,"tile_path_", 10)) { 947 else if (!strncmp(key,"tile_path_", 10)) {
954 int tile=atoi(key+10); 948 int tile=atoi(key+10);
955 949
956 if (tile<1 || tile>4) { 950 if (tile<1 || tile>4) {
957 LOG(llevError,"load_map_header: tile location %d out of bounds (%s)\n", 951 LOG(llevError,"load_map_header: tile location %d out of bounds (%s)\n",
958 tile, m->path); 952 tile, m->path);
959 } else { 953 } else {
960 char *path; 954 char *path;
961 955
962 *end = 0; 956 *end = 0;
963 957
964 if (m->tile_path[tile-1]) { 958 if (m->tile_path[tile-1]) {
965 LOG(llevError,"load_map_header: tile location %d duplicated (%s)\n", 959 LOG(llevError,"load_map_header: tile location %d duplicated (%s)\n",
966 tile, m->path); 960 tile, m->path);
967 free(m->tile_path[tile-1]); 961 free(m->tile_path[tile-1]);
968 m->tile_path[tile-1] = NULL; 962 m->tile_path[tile-1] = NULL;
969 } 963 }
970 964
971 if (check_path(value, 1) != -1) { 965 if (check_path(value, 1) != -1) {
972 /* The unadorned path works. */ 966 /* The unadorned path works. */
973 path = value; 967 path = value;
974 } else { 968 } else {
975 /* Try again; it could be a relative exit. */ 969 /* Try again; it could be a relative exit. */
976 970
977 path = path_combine_and_normalize(m->path, value); 971 path = path_combine_and_normalize(m->path, value);
978 972
979 if (check_path(path, 1) == -1) { 973 if (check_path(path, 1) == -1) {
980 LOG(llevError, "get_map_header: Bad tile path %s %s\n", m->path, value); 974 LOG(llevError, "get_map_header: Bad tile path %s %s\n", m->path, value);
981 path = NULL; 975 path = NULL;
982 } 976 }
983 } 977 }
984 978
985 if (editor) { 979 if (editor) {
986 /* Use the value as in the file. */ 980 /* Use the value as in the file. */
987 m->tile_path[tile-1] = strdup_local(value); 981 m->tile_path[tile-1] = strdup_local(value);
988 } else if (path != NULL) { 982 } else if (path != NULL) {
989 /* Use the normalized value. */ 983 /* Use the normalized value. */
990 m->tile_path[tile-1] = strdup_local(path); 984 m->tile_path[tile-1] = strdup_local(path);
991 } 985 }
992 } /* end if tile direction (in)valid */ 986 } /* end if tile direction (in)valid */
993 } 987 }
994 else { 988 else {
995 LOG(llevError,"Got unknown value in map header: %s %s\n", key, value); 989 LOG(llevError,"Got unknown value in map header: %s %s\n", key, value);
996 } 990 }
997 } 991 }
998 if (!key || strcmp(key,"end")) { 992 if (!key || strcmp(key,"end")) {
999 LOG(llevError,"Got premature eof on map header!\n"); 993 LOG(llevError,"Got premature eof on map header!\n");
1000 return 1; 994 return 1;
1001 } 995 }
1002 return 0; 996 return 0;
1003} 997}
1004 998
1005/* 999/*
… …
1009 * flags correspond to those in map.h. Main ones used are 1003 * flags correspond to those in map.h. Main ones used are
1010 * MAP_PLAYER_UNIQUE, in which case we don't do any name changes, and 1004 * MAP_PLAYER_UNIQUE, in which case we don't do any name changes, and
1011 * MAP_BLOCK, in which case we block on this load. This happens in all 1005 * MAP_BLOCK, in which case we block on this load. This happens in all
1012 * cases, no matter if this flag is set or not. 1006 * cases, no matter if this flag is set or not.
1013 * MAP_STYLE: style map - don't add active objects, don't add to server 1007 * MAP_STYLE: style map - don't add active objects, don't add to server
1014 * managed map list. 1008 * managed map list.
1015 */ 1009 */
1016 1010
1017mapstruct *load_original_map(const char *filename, int flags) { 1011mapstruct *load_original_map(const char *filename, int flags) {
1018 FILE *fp;
1019 mapstruct *m; 1012 mapstruct *m;
1020 int comp;
1021 char pathname[MAX_BUF]; 1013 char pathname[MAX_BUF];
1022 1014
1023 LOG(llevDebug, "load_original_map: %s (%x)\n", filename,flags); 1015 LOG(llevDebug, "load_original_map: %s (%x)\n", filename,flags);
1024 if (flags & MAP_PLAYER_UNIQUE) 1016 if (flags & MAP_PLAYER_UNIQUE)
1025 strcpy(pathname, filename); 1017 strcpy(pathname, filename);
1026 else if (flags & MAP_OVERLAY) 1018 else if (flags & MAP_OVERLAY)
1027 strcpy(pathname, create_overlay_pathname(filename)); 1019 strcpy(pathname, create_overlay_pathname(filename));
1028 else 1020 else
1029 strcpy(pathname, create_pathname(filename)); 1021 strcpy(pathname, create_pathname(filename));
1030 1022
1031 if((fp=open_and_uncompress(pathname, 0, &comp))==NULL) {
1032 LOG(llevError, "Can't open %s: %s\n", pathname, strerror_local(errno));
1033 return (NULL);
1034 }
1035
1036 object_thawer thawer (filename); 1023 object_thawer thawer (pathname);
1024
1025 if (!thawer)
1026 return 0;
1037 1027
1038 m = get_linked_map(); 1028 m = get_linked_map();
1039 1029
1040 strcpy (m->path, filename); 1030 strcpy (m->path, filename);
1041 if (load_map_header(fp, m)) { 1031 if (load_map_header(thawer, m)) {
1042 LOG(llevError,"Error loading map header for %s, flags=%d\n", 1032 LOG(llevError,"Error loading map header for %s, flags=%d\n",
1043 filename, flags); 1033 filename, flags);
1044 delete_map(m); 1034 delete_map(m);
1045 return NULL; 1035 return NULL;
1046 } 1036 }
1047 1037
1048 allocate_map(m); 1038 allocate_map(m);
1049 m->compressed = comp;
1050 1039
1051 m->in_memory=MAP_LOADING; 1040 m->in_memory=MAP_LOADING;
1052 load_objects (m, fp, thawer, flags & (MAP_BLOCK|MAP_STYLE)); 1041 load_objects (m, thawer, flags & (MAP_BLOCK|MAP_STYLE));
1053 close_and_delete(fp, comp); 1042
1054 m->in_memory=MAP_IN_MEMORY; 1043 m->in_memory=MAP_IN_MEMORY;
1055 if (!MAP_DIFFICULTY(m)) 1044 if (!MAP_DIFFICULTY(m))
1056 MAP_DIFFICULTY(m)=calculate_difficulty(m); 1045 MAP_DIFFICULTY(m)=calculate_difficulty(m);
1057 set_map_reset_time(m); 1046 set_map_reset_time(m);
1058 INVOKE_MAP (LOAD, m); 1047 m->instantiate ();
1059 return (m); 1048 return (m);
1060} 1049}
1061 1050
1062/* 1051/*
1063 * Loads a map, which has been loaded earlier, from file. 1052 * Loads a map, which has been loaded earlier, from file.
1064 * Return the map object we load into (this can change from the passed 1053 * Return the map object we load into (this can change from the passed
1065 * option if we can't find the original map) 1054 * option if we can't find the original map)
1066 */ 1055 */
1067 1056
1068static mapstruct *load_temporary_map(mapstruct *m) { 1057static mapstruct *load_temporary_map(mapstruct *m) {
1069 FILE *fp;
1070 int comp; 1058 int comp;
1071 char buf[MAX_BUF]; 1059 char buf[MAX_BUF];
1072 1060
1073 if (!m->tmpname) { 1061 if (!m->tmpname) {
1074 LOG(llevError, "No temporary filename for map %s\n", m->path); 1062 LOG(llevError, "No temporary filename for map %s\n", m->path);
1075 strcpy(buf, m->path); 1063 strcpy(buf, m->path);
1076 delete_map(m); 1064 delete_map(m);
1077 m = load_original_map(buf, 0); 1065 m = load_original_map(buf, 0);
1078 if(m==NULL) return NULL; 1066 if(m==NULL) return NULL;
1079 fix_auto_apply(m); /* Chests which open as default */ 1067 fix_auto_apply(m); /* Chests which open as default */
1080 return m; 1068 return m;
1081 }
1082
1083 if((fp=open_and_uncompress(m->tmpname,0, &comp))==NULL) {
1084 LOG(llevError, "Cannot open %s: %s\n",m->tmpname, strerror_local(errno));
1085 strcpy(buf, m->path);
1086 delete_map(m);
1087 m = load_original_map(buf, 0);
1088 if(m==NULL) return NULL;
1089 fix_auto_apply(m); /* Chests which open as default */
1090 return m;
1091 } 1069 }
1092 1070
1093 object_thawer thawer (m->tmpname); 1071 object_thawer thawer (m->tmpname);
1094 1072
1073 if (!thawer)
1074 {
1075 strcpy (buf, m->path);
1076 delete_map (m);
1077 m = load_original_map (buf, 0);
1078 if (!m) return NULL;
1079 fix_auto_apply (m); /* Chests which open as default */
1080 return m;
1081 }
1082
1095 if (load_map_header(fp, m)) { 1083 if (load_map_header(thawer, m)) {
1096 LOG(llevError,"Error loading map header for %s (%s)\n", 1084 LOG(llevError,"Error loading map header for %s (%s)\n",
1097 m->path, m->tmpname); 1085 m->path, m->tmpname);
1098 delete_map(m); 1086 delete_map(m);
1099 m = load_original_map(m->path, 0); 1087 m = load_original_map(m->path, 0);
1100 return NULL; 1088 return NULL;
1101 } 1089 }
1102 m->compressed = comp;
1103 allocate_map(m); 1090 allocate_map(m);
1104 1091
1105 m->in_memory=MAP_LOADING; 1092 m->in_memory=MAP_LOADING;
1106 load_objects (m, fp, thawer, 0); 1093 load_objects (m, thawer, 0);
1107 close_and_delete(fp, comp); 1094
1108 m->in_memory=MAP_IN_MEMORY; 1095 m->in_memory=MAP_IN_MEMORY;
1109 INVOKE_MAP (SWAPIN, m); 1096 INVOKE_MAP (SWAPIN, m);
1110 return m; 1097 return m;
1111} 1098}
1112 1099
… …
1115 * Return the map object we load into (this can change from the passed 1102 * Return the map object we load into (this can change from the passed
1116 * option if we can't find the original map) 1103 * option if we can't find the original map)
1117 */ 1104 */
1118 1105
1119mapstruct *load_overlay_map(const char *filename, mapstruct *m) { 1106mapstruct *load_overlay_map(const char *filename, mapstruct *m) {
1120 FILE *fp;
1121 int comp;
1122 char pathname[MAX_BUF]; 1107 char pathname[MAX_BUF];
1123 1108
1124 strcpy(pathname, create_overlay_pathname(filename)); 1109 strcpy(pathname, create_overlay_pathname(filename));
1125 1110
1126 if((fp=open_and_uncompress(pathname, 0, &comp))==NULL) {
1127/* LOG(llevDebug,"Can't open overlay %s\n", pathname);*/
1128 return m;
1129 }
1130
1131 object_thawer thawer (pathname); 1111 object_thawer thawer (pathname);
1112
1113 if (!thawer)
1114 return m;
1132 1115
1133 if (load_map_header(fp, m)) { 1116 if (load_map_header(thawer, m)) {
1134 LOG(llevError,"Error loading map header for overlay %s (%s)\n", 1117 LOG(llevError,"Error loading map header for overlay %s (%s)\n",
1135 m->path, pathname); 1118 m->path, pathname);
1136 delete_map(m); 1119 delete_map(m);
1137 m = load_original_map(m->path, 0); 1120 m = load_original_map(m->path, 0);
1138 return NULL; 1121 return NULL;
1139 } 1122 }
1140 m->compressed = comp;
1141 /*allocate_map(m);*/ 1123 /*allocate_map(m);*/
1142 1124
1143 m->in_memory=MAP_LOADING; 1125 m->in_memory=MAP_LOADING;
1144 load_objects (m, fp, thawer, MAP_OVERLAY); 1126 load_objects (m, thawer, MAP_OVERLAY);
1145 close_and_delete(fp, comp); 1127
1146 m->in_memory=MAP_IN_MEMORY; 1128 m->in_memory=MAP_IN_MEMORY;
1147 return m; 1129 return m;
1148} 1130}
1149 1131
1150/****************************************************************************** 1132/******************************************************************************
… …
1156{ 1138{
1157 int i,j,unique; 1139 int i,j,unique;
1158 object *op, *next; 1140 object *op, *next;
1159 1141
1160 for(i=0; i<MAP_WIDTH(m); i++) 1142 for(i=0; i<MAP_WIDTH(m); i++)
1161 for(j=0; j<MAP_HEIGHT(m); j++) { 1143 for(j=0; j<MAP_HEIGHT(m); j++) {
1162 unique=0; 1144 unique=0;
1163 for (op=get_map_ob(m, i, j); op; op=next) { 1145 for (op=get_map_ob(m, i, j); op; op=next) {
1164 next = op->above; 1146 next = op->above;
1165 if (QUERY_FLAG(op, FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE)) 1147 if (QUERY_FLAG(op, FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE))
1166 unique=1; 1148 unique=1;
1167 if(op->head == NULL && (QUERY_FLAG(op, FLAG_UNIQUE) || unique)) { 1149 if(op->head == NULL && (QUERY_FLAG(op, FLAG_UNIQUE) || unique)) {
1168 clean_object(op); 1150 clean_object(op);
1169 if (QUERY_FLAG(op, FLAG_IS_LINKED)) 1151 if (QUERY_FLAG(op, FLAG_IS_LINKED))
1170 remove_button_link(op); 1152 remove_button_link(op);
1171 remove_ob(op); 1153 remove_ob(op);
1172 free_object(op); 1154 free_object(op);
1173 } 1155 }
1174 } 1156 }
1175 } 1157 }
1176} 1158}
1177 1159
1178 1160
1179/* 1161/*
1180 * Loads unique objects from file(s) into the map which is in memory 1162 * Loads unique objects from file(s) into the map which is in memory
1181 * m is the map to load unique items into. 1163 * m is the map to load unique items into.
1182 */ 1164 */
1183static void load_unique_objects(mapstruct *m) { 1165static void load_unique_objects(mapstruct *m) {
1184 FILE *fp;
1185 int comp,count; 1166 int count;
1186 char firstname[MAX_BUF]; 1167 char firstname[MAX_BUF];
1187 1168
1188 for (count=0; count<10; count++) { 1169 for (count=0; count<10; count++) {
1189 sprintf(firstname, "%s.v%02d", create_items_path(m->path), count); 1170 sprintf(firstname, "%s.v%02d", create_items_path(m->path), count);
1190 if (!access(firstname, R_OK)) break; 1171 if (!access(firstname, R_OK)) break;
1191 } 1172 }
1192 /* If we get here, we did not find any map */ 1173 /* If we get here, we did not find any map */
1193 if (count==10) return; 1174 if (count==10) return;
1194 1175
1195 if ((fp=open_and_uncompress(firstname, 0, &comp))==NULL) {
1196 /* There is no expectation that every map will have unique items, but this
1197 * is debug output, so leave it in.
1198 */
1199 LOG(llevDebug, "Can't open unique items file for %s\n", create_items_path(m->path));
1200 return;
1201 }
1202
1203 object_thawer thawer (firstname); 1176 object_thawer thawer (firstname);
1177
1178 if (!thawer)
1179 return;
1204 1180
1205 m->in_memory=MAP_LOADING; 1181 m->in_memory=MAP_LOADING;
1206 if (m->tmpname == NULL) /* if we have loaded unique items from */ 1182 if (m->tmpname == NULL) /* if we have loaded unique items from */
1207 delete_unique_items(m); /* original map before, don't duplicate them */ 1183 delete_unique_items(m); /* original map before, don't duplicate them */
1208 load_object(fp, thawer, NULL, LO_NOREAD,0); 1184 load_object(thawer, NULL, LO_NOREAD,0);
1209 load_objects (m, fp, thawer, 0); 1185 load_objects (m, thawer, 0);
1210 close_and_delete(fp, comp); 1186
1211 m->in_memory=MAP_IN_MEMORY; 1187 m->in_memory=MAP_IN_MEMORY;
1212} 1188}
1213 1189
1214 1190
1215/* 1191/*
… …
1219 * The temporary filename will be stored in the mapstructure. 1195 * The temporary filename will be stored in the mapstructure.
1220 * If the map is unique, we also save to the filename in the map 1196 * If the map is unique, we also save to the filename in the map
1221 * (this should have been updated when first loaded) 1197 * (this should have been updated when first loaded)
1222 */ 1198 */
1223 1199
1200int
1224int new_save_map(mapstruct *m, int flag) { 1201new_save_map (mapstruct * m, int flag)
1225 FILE *fp, *fp2; 1202{
1226 char filename[MAX_BUF],buf[MAX_BUF], buf_s[MAX_BUF], 1203 char filename[MAX_BUF], buf[MAX_BUF], buf_s[MAX_BUF], shop[MAX_BUF];
1227 shop[MAX_BUF], filename_s[MAX_BUF];
1228 int i; 1204 int i;
1229 1205
1230 if (flag && !*m->path) { 1206 if (flag && !*m->path)
1207 {
1231 LOG(llevError,"Tried to save map without path.\n"); 1208 LOG (llevError, "Tried to save map without path.\n");
1232 return -1; 1209 return -1;
1233 }
1234 1210 }
1211
1235 if (flag || (m->unique) || (m->templatemap)) { 1212 if (flag || (m->unique) || (m->templatemap))
1236 if (!m->unique && !m->templatemap) { /* flag is set */ 1213 {
1214 if (!m->unique && !m->templatemap)
1215 { /* flag is set */
1237 if (flag == 2) 1216 if (flag == 2)
1238 strcpy(filename, create_overlay_pathname(m->path)); 1217 strcpy (filename, create_overlay_pathname (m->path));
1239 else 1218 else
1240 strcpy (filename, create_pathname (m->path)); 1219 strcpy (filename, create_pathname (m->path));
1241 } else 1220 }
1221 else
1242 strcpy (filename, m->path); 1222 strcpy (filename, m->path);
1243 1223
1244 /* If the compression suffix already exists on the filename, don't
1245 * put it on again. This nasty looking strcmp checks to see if the
1246 * compression suffix is at the end of the filename already.
1247 */
1248 if (m->compressed &&
1249 strcmp((filename + strlen(filename)-strlen(uncomp[m->compressed][0])),
1250 uncomp[m->compressed][0]))
1251 strcat(filename, uncomp[m->compressed][0]);
1252 make_path_to_file(filename); 1224 make_path_to_file (filename);
1253 } else { 1225 }
1226 else
1227 {
1254 if (!m->tmpname) 1228 if (!m->tmpname)
1255 m->tmpname = tempnam_local(settings.tmpdir,NULL); 1229 m->tmpname = tempnam_local (settings.tmpdir, NULL);
1230
1256 strcpy(filename, m->tmpname); 1231 strcpy (filename, m->tmpname);
1257 } 1232 }
1233
1258 LOG(llevDebug,"Saving map %s to %s\n", m->path, filename); 1234 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);
1259 m->in_memory = MAP_SAVING; 1235 m->in_memory = MAP_SAVING;
1260 1236
1261 sprintf (filename_s, "%s~", filename);
1262
1263 /* Compress if it isn't a temporary save. Do compress if unique */
1264 if (m->compressed && (m->unique || m->templatemap || flag)) {
1265 char buf[MAX_BUF];
1266 strcpy(buf, uncomp[m->compressed][2]);
1267 strcat(buf, " > ");
1268 strcat(buf, filename_s);
1269 fp = popen(buf, "w");
1270 } else
1271 fp = fopen(filename_s, "w");
1272
1273 if(fp == NULL) {
1274 LOG(llevError, "Cannot write %s: %s\n", filename_s, strerror_local(errno));
1275 return -1;
1276 }
1277
1278 object_freezer freezer (filename); 1237 object_freezer freezer;
1279 1238
1280 /* legacy */ 1239 /* legacy */
1281 fprintf(fp,"arch map\n"); 1240 fprintf (freezer, "arch map\n");
1241 if (m->name)
1282 if (m->name) fprintf(fp,"name %s\n", m->name); 1242 fprintf (freezer, "name %s\n", m->name);
1243 if (!flag)
1283 if (!flag) fprintf(fp,"swap_time %d\n", m->swap_time); 1244 fprintf (freezer, "swap_time %d\n", m->swap_time);
1245 if (m->reset_timeout)
1284 if (m->reset_timeout) fprintf(fp,"reset_timeout %d\n", m->reset_timeout); 1246 fprintf (freezer, "reset_timeout %d\n", m->reset_timeout);
1247 if (m->fixed_resettime)
1285 if (m->fixed_resettime) fprintf(fp,"fixed_resettime %d\n", m->fixed_resettime); 1248 fprintf (freezer, "fixed_resettime %d\n", m->fixed_resettime);
1286 /* we unfortunately have no idea if this is a value the creator set 1249 /* we unfortunately have no idea if this is a value the creator set
1287 * or a difficulty value we generated when the map was first loaded 1250 * or a difficulty value we generated when the map was first loaded
1288 */ 1251 */
1252 if (m->difficulty)
1289 if (m->difficulty) fprintf(fp,"difficulty %d\n", m->difficulty); 1253 fprintf (freezer, "difficulty %d\n", m->difficulty);
1254 if (m->region)
1290 if (m->region) fprintf(fp,"region %s\n", m->region->name); 1255 fprintf (freezer, "region %s\n", m->region->name);
1291 if (m->shopitems) { 1256 if (m->shopitems)
1257 {
1292 print_shop_string(m, shop); 1258 print_shop_string (m, shop);
1293 fprintf(fp,"shopitems %s\n", shop); 1259 fprintf (freezer, "shopitems %s\n", shop);
1294 } 1260 }
1261 if (m->shopgreed)
1295 if (m->shopgreed) fprintf(fp,"shopgreed %f\n", m->shopgreed); 1262 fprintf (freezer, "shopgreed %f\n", m->shopgreed);
1296#ifndef WIN32 1263#ifndef WIN32
1264 if (m->shopmin)
1297 if (m->shopmin) fprintf(fp,"shopmin %llu\n", m->shopmin); 1265 fprintf (freezer, "shopmin %llu\n", m->shopmin);
1266 if (m->shopmax)
1298 if (m->shopmax) fprintf(fp,"shopmax %llu\n", m->shopmax); 1267 fprintf (freezer, "shopmax %llu\n", m->shopmax);
1299#else 1268#else
1269 if (m->shopmin)
1300 if (m->shopmin) fprintf(fp,"shopmin %I64u\n", m->shopmin); 1270 fprintf (freezer, "shopmin %I64u\n", m->shopmin);
1271 if (m->shopmax)
1301 if (m->shopmax) fprintf(fp,"shopmax %I64u\n", m->shopmax); 1272 fprintf (freezer, "shopmax %I64u\n", m->shopmax);
1302#endif 1273#endif
1274 if (m->shoprace)
1303 if (m->shoprace) fprintf(fp,"shoprace %s\n", m->shoprace); 1275 fprintf (freezer, "shoprace %s\n", m->shoprace);
1276 if (m->darkness)
1304 if (m->darkness) fprintf(fp,"darkness %d\n", m->darkness); 1277 fprintf (freezer, "darkness %d\n", m->darkness);
1278 if (m->width)
1305 if (m->width) fprintf(fp,"width %d\n", m->width); 1279 fprintf (freezer, "width %d\n", m->width);
1280 if (m->height)
1306 if (m->height) fprintf(fp,"height %d\n", m->height); 1281 fprintf (freezer, "height %d\n", m->height);
1282 if (m->enter_x)
1307 if (m->enter_x) fprintf(fp,"enter_x %d\n", m->enter_x); 1283 fprintf (freezer, "enter_x %d\n", m->enter_x);
1284 if (m->enter_y)
1308 if (m->enter_y) fprintf(fp,"enter_y %d\n", m->enter_y); 1285 fprintf (freezer, "enter_y %d\n", m->enter_y);
1286 if (m->msg)
1309 if (m->msg) fprintf(fp,"msg\n%sendmsg\n", m->msg); 1287 fprintf (freezer, "msg\n%sendmsg\n", m->msg);
1288 if (m->maplore)
1310 if (m->maplore) fprintf(fp,"maplore\n%sendmaplore\n", m->maplore); 1289 fprintf (freezer, "maplore\n%sendmaplore\n", m->maplore);
1290 if (m->unique)
1311 if (m->unique) fprintf(fp,"unique %d\n", m->unique); 1291 fprintf (freezer, "unique %d\n", m->unique);
1292 if (m->templatemap)
1312 if (m->templatemap) fprintf(fp,"template %d\n", m->templatemap); 1293 fprintf (freezer, "template %d\n", m->templatemap);
1294 if (m->outdoor)
1313 if (m->outdoor) fprintf(fp,"outdoor %d\n", m->outdoor); 1295 fprintf (freezer, "outdoor %d\n", m->outdoor);
1296 if (m->temp)
1314 if (m->temp) fprintf(fp, "temp %d\n", m->temp); 1297 fprintf (freezer, "temp %d\n", m->temp);
1298 if (m->pressure)
1315 if (m->pressure) fprintf(fp, "pressure %d\n", m->pressure); 1299 fprintf (freezer, "pressure %d\n", m->pressure);
1300 if (m->humid)
1316 if (m->humid) fprintf(fp, "humid %d\n", m->humid); 1301 fprintf (freezer, "humid %d\n", m->humid);
1302 if (m->windspeed)
1317 if (m->windspeed) fprintf(fp, "windspeed %d\n", m->windspeed); 1303 fprintf (freezer, "windspeed %d\n", m->windspeed);
1304 if (m->winddir)
1318 if (m->winddir) fprintf(fp, "winddir %d\n", m->winddir); 1305 fprintf (freezer, "winddir %d\n", m->winddir);
1306 if (m->sky)
1319 if (m->sky) fprintf(fp, "sky %d\n", m->sky); 1307 fprintf (freezer, "sky %d\n", m->sky);
1308 if (m->nosmooth)
1320 if (m->nosmooth) fprintf(fp, "nosmooth %d\n", m->nosmooth); 1309 fprintf (freezer, "nosmooth %d\n", m->nosmooth);
1321 if (m->safe_map) fprintf(fp, "safe_map %d\n", m->safe_map);
1322 1310
1323 /* Save any tiling information, except on overlays */ 1311 /* Save any tiling information, except on overlays */
1324 if (flag != 2) 1312 if (flag != 2)
1325 for (i=0; i<4; i++) 1313 for (i = 0; i < 4; i++)
1326 if (m->tile_path[i]) 1314 if (m->tile_path[i])
1327 fprintf(fp,"tile_path_%d %s\n", i+1, m->tile_path[i]); 1315 fprintf (freezer, "tile_path_%d %s\n", i + 1, m->tile_path[i]);
1328 1316
1317 freezer.put (m);
1329 fprintf(fp,"end\n"); 1318 fprintf (freezer, "end\n");
1330 1319
1331 /* In the game save unique items in the different file, but 1320 /* In the game save unique items in the different file, but
1332 * in the editor save them to the normal map file. 1321 * in the editor save them to the normal map file.
1333 * If unique map, save files in the proper destination (set by 1322 * If unique map, save files in the proper destination (set by
1334 * player) 1323 * player)
1335 */ 1324 */
1336 if ((flag == 0 || flag == 2) && !m->unique && !m->templatemap) { 1325 if ((flag == 0 || flag == 2) && !m->unique && !m->templatemap)
1326 {
1327 object_freezer unique;
1328
1329 if (flag == 2)
1330 save_objects (m, freezer, unique, 2);
1331 else
1332 save_objects (m, freezer, unique, 0);
1333
1337 sprintf (buf,"%s.v00",create_items_path (m->path)); 1334 sprintf (buf, "%s.v00", create_items_path (m->path));
1338 sprintf (buf_s, "%s~", buf);
1339 if ((fp2 = fopen (buf_s, "w")) == NULL) {
1340 LOG(llevError, "Can't open unique items file %s\n", buf_s);
1341 }
1342 1335
1343 object_freezer freezer2 (buf); 1336 unique.save (buf);
1344
1345 if (flag == 2)
1346 save_objects(m, fp, freezer, fp2, freezer2, 2);
1347 else
1348 save_objects (m, fp,freezer, fp2, freezer2, 0);
1349 if (fp2 != NULL) {
1350 if (ftell (fp2) == 0) {
1351 fclose (fp2);
1352 rename (buf_s, buf);
1353 unlink (buf);
1354 } else {
1355 fclose (fp2);
1356 rename (buf_s, buf);
1357 chmod (buf, SAVE_MODE);
1358 } 1337 }
1359 }
1360 } else { /* save same file when not playing, like in editor */
1361 save_objects(m, fp, freezer, fp, freezer, 0);
1362 }
1363
1364 if (m->compressed && (m->unique || m->templatemap || flag))
1365 pclose(fp);
1366 else 1338 else
1367 fclose(fp); 1339 { /* save same file when not playing, like in editor */
1340 save_objects (m, freezer, freezer, 0);
1341 }
1368 1342
1369 rename (filename_s, filename); 1343 freezer.save (filename);
1370 1344
1371 chmod (filename, SAVE_MODE);
1372 return 0; 1345 return 0;
1373} 1346}
1374 1347
1375 1348
1376/* 1349/*
1377 * Remove and free all objects in the inventory of the given object. 1350 * Remove and free all objects in the inventory of the given object.
… …
1382{ 1355{
1383 object *tmp, *next; 1356 object *tmp, *next;
1384 1357
1385 for(tmp = op->inv; tmp; tmp = next) 1358 for(tmp = op->inv; tmp; tmp = next)
1386 { 1359 {
1387 next = tmp->below; 1360 next = tmp->below;
1388 clean_object(tmp); 1361 clean_object(tmp);
1389 if (QUERY_FLAG(tmp, FLAG_IS_LINKED)) 1362 if (QUERY_FLAG(tmp, FLAG_IS_LINKED))
1390 remove_button_link(tmp); 1363 remove_button_link(tmp);
1391 remove_ob(tmp); 1364 remove_ob(tmp);
1392 free_object(tmp); 1365 free_object(tmp);
1393 } 1366 }
1394} 1367}
1395 1368
1396/* 1369/*
1397 * Remove and free all objects in the given map. 1370 * Remove and free all objects in the given map.
… …
1400void free_all_objects(mapstruct *m) { 1373void free_all_objects(mapstruct *m) {
1401 int i,j; 1374 int i,j;
1402 object *op; 1375 object *op;
1403 1376
1404 for(i=0;i<MAP_WIDTH(m);i++) 1377 for(i=0;i<MAP_WIDTH(m);i++)
1405 for(j=0;j<MAP_HEIGHT(m);j++) { 1378 for(j=0;j<MAP_HEIGHT(m);j++) {
1406 object *previous_obj=NULL; 1379 object *previous_obj=NULL;
1407 while((op=GET_MAP_OB(m,i,j))!=NULL) { 1380 while((op=GET_MAP_OB(m,i,j))!=NULL) {
1408 if (op==previous_obj) { 1381 if (op==previous_obj) {
1409 LOG(llevDebug, "free_all_objects: Link error, bailing out.\n"); 1382 LOG(llevDebug, "free_all_objects: Link error, bailing out.\n");
1410 break; 1383 break;
1411 } 1384 }
1412 previous_obj=op; 1385 previous_obj=op;
1413 if(op->head!=NULL) 1386 if(op->head!=NULL)
1414 op = op->head; 1387 op = op->head;
1415 1388
1416 /* If the map isn't in memory, free_object will remove and 1389 /* If the map isn't in memory, free_object will remove and
1417 * free objects in op's inventory. So let it do the job. 1390 * free objects in op's inventory. So let it do the job.
1418 */ 1391 */
1419 if (m->in_memory==MAP_IN_MEMORY) 1392 if (m->in_memory==MAP_IN_MEMORY)
1420 clean_object(op); 1393 clean_object(op);
1421 remove_ob(op); 1394 remove_ob(op);
1422 free_object(op); 1395 free_object(op);
1423 } 1396 }
1424 } 1397 }
1425#ifdef MANY_CORES 1398#ifdef MANY_CORES
1426 /* I see periodic cores on metalforge where a map has been swapped out, but apparantly 1399 /* I see periodic cores on metalforge where a map has been swapped out, but apparantly
1427 * an item on that map was not saved - look for that condition and die as appropriate - 1400 * an item on that map was not saved - look for that condition and die as appropriate -
1428 * this leaves more of the map data intact for better debugging. 1401 * this leaves more of the map data intact for better debugging.
1429 */ 1402 */
1430 for (op=objects; op!=NULL; op=op->next) { 1403 for (op=objects; op!=NULL; op=op->next) {
1431 if (!QUERY_FLAG(op, FLAG_REMOVED) && op->map == m) { 1404 if (!QUERY_FLAG(op, FLAG_REMOVED) && op->map == m) {
1432 LOG(llevDebug,"free_all_objects: object %s still on map after it should have been freed\n", op->name); 1405 LOG(llevDebug,"free_all_objects: object %s still on map after it should have been freed\n", op->name);
1433 abort(); 1406 abort();
1434 } 1407 }
1435 } 1408 }
1436#endif 1409#endif
1437} 1410}
1438 1411
1439/* 1412/*
… …
1443 1416
1444void free_map(mapstruct *m,int flag) { 1417void free_map(mapstruct *m,int flag) {
1445 int i; 1418 int i;
1446 1419
1447 if (!m->in_memory) { 1420 if (!m->in_memory) {
1448 LOG(llevError,"Trying to free freed map.\n"); 1421 LOG(llevError,"Trying to free freed map.\n");
1449 return; 1422 return;
1450 } 1423 }
1451 if (flag && m->spaces) free_all_objects(m); 1424 if (flag && m->spaces) free_all_objects(m);
1452 if (m->name) FREE_AND_CLEAR(m->name); 1425 if (m->name) FREE_AND_CLEAR(m->name);
1453 if (m->spaces) FREE_AND_CLEAR(m->spaces); 1426 if (m->spaces) FREE_AND_CLEAR(m->spaces);
1454 if (m->msg) FREE_AND_CLEAR(m->msg); 1427 if (m->msg) FREE_AND_CLEAR(m->msg);
1455 if (m->maplore) FREE_AND_CLEAR(m->maplore); 1428 if (m->maplore) FREE_AND_CLEAR(m->maplore);
1456 if (m->shopitems) FREE_AND_CLEAR(m->shopitems); 1429 if (m->shopitems) FREE_AND_CLEAR(m->shopitems);
1457 if (m->shoprace) FREE_AND_CLEAR(m->shoprace); 1430 if (m->shoprace) FREE_AND_CLEAR(m->shoprace);
1458 if (m->buttons) 1431 if (m->buttons)
1459 free_objectlinkpt(m->buttons); 1432 free_objectlinkpt(m->buttons);
1460 m->buttons = NULL; 1433 m->buttons = NULL;
1461 for (i=0; i<4; i++) { 1434 for (i=0; i<4; i++) {
1462 if (m->tile_path[i]) FREE_AND_CLEAR(m->tile_path[i]); 1435 if (m->tile_path[i]) FREE_AND_CLEAR(m->tile_path[i]);
1463 m->tile_map[i] = NULL; 1436 m->tile_map[i] = NULL;
1464 } 1437 }
1465 m->in_memory = MAP_SWAPPED; 1438 m->in_memory = MAP_SWAPPED;
1466} 1439}
1467 1440
1468/* 1441/*
… …
1476 mapstruct *tmp, *last; 1449 mapstruct *tmp, *last;
1477 int i; 1450 int i;
1478 1451
1479 if (!m) 1452 if (!m)
1480 return; 1453 return;
1454
1455 m->clear ();
1456
1481 if (m->in_memory == MAP_IN_MEMORY) { 1457 if (m->in_memory == MAP_IN_MEMORY) {
1482 /* change to MAP_SAVING, even though we are not, 1458 /* change to MAP_SAVING, even though we are not,
1483 * so that remove_ob doesn't do as much work. 1459 * so that remove_ob doesn't do as much work.
1484 */ 1460 */
1485 m->in_memory = MAP_SAVING; 1461 m->in_memory = MAP_SAVING;
1486 free_map (m, 1); 1462 free_map (m, 1);
1487 } 1463 }
1488 /* move this out of free_map, since tmpname can still be needed if 1464 /* move this out of free_map, since tmpname can still be needed if
1489 * the map is swapped out. 1465 * the map is swapped out.
1490 */ 1466 */
1491 if (m->tmpname) { 1467 if (m->tmpname) {
1492 free(m->tmpname); 1468 free(m->tmpname);
1493 m->tmpname=NULL; 1469 m->tmpname=NULL;
1494 } 1470 }
1495 last = NULL; 1471 last = NULL;
1496 /* We need to look through all the maps and see if any maps 1472 /* We need to look through all the maps and see if any maps
1497 * are pointing at this one for tiling information. Since 1473 * are pointing at this one for tiling information. Since
1498 * tiling can be assymetric, we just can not look to see which 1474 * tiling can be assymetric, we just can not look to see which
1499 * maps this map tiles with and clears those. 1475 * maps this map tiles with and clears those.
1500 */ 1476 */
1501 for (tmp = first_map; tmp != NULL; tmp = tmp->next) { 1477 for (tmp = first_map; tmp != NULL; tmp = tmp->next) {
1502 if (tmp->next == m) last = tmp; 1478 if (tmp->next == m) last = tmp;
1503 1479
1504 /* This should hopefully get unrolled on a decent compiler */ 1480 /* This should hopefully get unrolled on a decent compiler */
1505 for (i=0; i<4; i++) 1481 for (i=0; i<4; i++)
1506 if (tmp->tile_map[i] == m) tmp->tile_map[i]=NULL; 1482 if (tmp->tile_map[i] == m) tmp->tile_map[i]=NULL;
1507 } 1483 }
1508 1484
1509 /* If last is null, then this should be the first map in the list */ 1485 /* If last is null, then this should be the first map in the list */
1510 if (!last) { 1486 if (!last) {
1511 if (m == first_map) 1487 if (m == first_map)
1512 first_map = m->next; 1488 first_map = m->next;
1513 else 1489 else
1514 /* m->path is a static char, so should hopefully still have 1490 /* m->path is a static char, so should hopefully still have
1515 * some useful data in it. 1491 * some useful data in it.
1516 */ 1492 */
1517 LOG(llevError,"delete_map: Unable to find map %s in list\n", 1493 LOG(llevError,"delete_map: Unable to find map %s in list\n",
1518 m->path); 1494 m->path);
1519 } 1495 }
1520 else 1496 else
1521 last->next = m->next; 1497 last->next = m->next;
1522 1498
1523 free (m); 1499 free (m);
1524} 1500}
1525 1501
1526 1502
… …
1546 /* Have we been at this level before? */ 1522 /* Have we been at this level before? */
1547 m = has_been_loaded (name); 1523 m = has_been_loaded (name);
1548 1524
1549 /* Map is good to go, so just return it */ 1525 /* Map is good to go, so just return it */
1550 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) { 1526 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) {
1551 return m; 1527 return m;
1552 } 1528 }
1553 1529
1554 /* unique maps always get loaded from their original location, and never 1530 /* unique maps always get loaded from their original location, and never
1555 * a temp location. Likewise, if map_flush is set, or we have never loaded 1531 * a temp location. Likewise, if map_flush is set, or we have never loaded
1556 * this map, load it now. I removed the reset checking from here - 1532 * this map, load it now. I removed the reset checking from here -
… …
1559 * a bit cleaner (and players probably shouldn't rely on exact timing for 1535 * a bit cleaner (and players probably shouldn't rely on exact timing for
1560 * resets in any case - if they really care, they should use the 'maps command. 1536 * resets in any case - if they really care, they should use the 'maps command.
1561 */ 1537 */
1562 if ((flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE)) || !m) { 1538 if ((flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE)) || !m) {
1563 1539
1564 /* first visit or time to reset */ 1540 /* first visit or time to reset */
1565 if (m) { 1541 if (m) {
1566 clean_tmp_map(m); /* Doesn't make much difference */ 1542 clean_tmp_map(m); /* Doesn't make much difference */
1567 delete_map(m); 1543 delete_map(m);
1568 } 1544 }
1569 1545
1570 /* create and load a map */ 1546 /* create and load a map */
1571 if (flags & MAP_PLAYER_UNIQUE) 1547 if (flags & MAP_PLAYER_UNIQUE)
1572 LOG(llevDebug, "Trying to load map %s.\n", name); 1548 LOG(llevDebug, "Trying to load map %s.\n", name);
1573 else 1549 else
1574 LOG(llevDebug, "Trying to load map %s.\n", create_pathname(name)); 1550 LOG(llevDebug, "Trying to load map %s.\n", create_pathname(name));
1575 1551
1576 if (!(m = load_original_map(name, (flags & MAP_PLAYER_UNIQUE)))) 1552 if (!(m = load_original_map(name, (flags & MAP_PLAYER_UNIQUE))))
1577 return (NULL); 1553 return (NULL);
1578 1554
1579 fix_auto_apply(m); /* Chests which open as default */ 1555 fix_auto_apply(m); /* Chests which open as default */
1580 1556
1581 /* If a player unique map, no extra unique object file to load. 1557 /* If a player unique map, no extra unique object file to load.
1582 * if from the editor, likewise. 1558 * if from the editor, likewise.
1583 */ 1559 */
1584 if (! (flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE))) 1560 if (! (flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE)))
1585 load_unique_objects(m); 1561 load_unique_objects(m);
1586 1562
1587 if (! (flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE|MAP_OVERLAY))) { 1563 if (! (flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE|MAP_OVERLAY))) {
1588 m=load_overlay_map(name, m); 1564 m=load_overlay_map(name, m);
1589 if (m==NULL) 1565 if (m==NULL)
1590 return NULL; 1566 return NULL;
1591 } 1567 }
1568
1569 if (flags & MAP_PLAYER_UNIQUE)
1570 INVOKE_MAP (SWAPIN, m);
1592 1571
1593 } else { 1572 } else {
1594 /* If in this loop, we found a temporary map, so load it up. */ 1573 /* If in this loop, we found a temporary map, so load it up. */
1595 1574
1596 m=load_temporary_map (m); 1575 m=load_temporary_map (m);
1597 if(m==NULL) return NULL; 1576 if(m==NULL) return NULL;
1598 load_unique_objects(m); 1577 load_unique_objects(m);
1599 1578
1600 clean_tmp_map(m); 1579 clean_tmp_map(m);
1601 m->in_memory = MAP_IN_MEMORY; 1580 m->in_memory = MAP_IN_MEMORY;
1602 /* tempnam() on sun systems (probably others) uses malloc 1581 /* tempnam() on sun systems (probably others) uses malloc
1603 * to allocated space for the string. Free it here. 1582 * to allocated space for the string. Free it here.
1604 * In some cases, load_temporary_map above won't find the 1583 * In some cases, load_temporary_map above won't find the
1605 * temporary map, and so has reloaded a new map. If that 1584 * temporary map, and so has reloaded a new map. If that
1606 * is the case, tmpname is now null 1585 * is the case, tmpname is now null
1607 */ 1586 */
1608 if (m->tmpname) free(m->tmpname); 1587 if (m->tmpname) free(m->tmpname);
1609 m->tmpname = NULL; 1588 m->tmpname = NULL;
1610 /* It's going to be saved anew anyway */ 1589 /* It's going to be saved anew anyway */
1611 } 1590 }
1612 1591
1613 /* Below here is stuff common to both first time loaded maps and 1592 /* Below here is stuff common to both first time loaded maps and
1614 * temp maps. 1593 * temp maps.
1615 */ 1594 */
1616 1595
1617 decay_objects(m); /* start the decay */ 1596 decay_objects(m); /* start the decay */
1618 /* In case other objects press some buttons down */ 1597 /* In case other objects press some buttons down */
1619 update_buttons(m); 1598 update_buttons(m);
1620 if (m->outdoor) 1599 if (m->outdoor)
1621 set_darkness_map(m); 1600 set_darkness_map(m);
1622 /* run the weather over this map */ 1601 /* run the weather over this map */
1623 weather_effect(name); 1602 weather_effect(name);
1624 return m; 1603 return m;
1625} 1604}
1626 1605
… …
1686 return 1; 1665 return 1;
1687} 1666}
1688 1667
1689void clean_tmp_map(mapstruct *m) { 1668void clean_tmp_map(mapstruct *m) {
1690 if(m->tmpname == NULL) 1669 if(m->tmpname == NULL)
1691 return; 1670 return;
1692 INVOKE_MAP (CLEAN, m); 1671 INVOKE_MAP (CLEAN, m);
1693 (void) unlink(m->tmpname); 1672 (void) unlink(m->tmpname);
1694} 1673}
1695 1674
1696void free_all_maps(void) 1675void free_all_maps(void)
1697{ 1676{
1698 int real_maps=0; 1677 int real_maps=0;
1699 1678
1700 while (first_map) { 1679 while (first_map) {
1701 /* I think some of the callers above before it gets here set this to be 1680 /* I think some of the callers above before it gets here set this to be
1702 * saving, but we still want to free this data 1681 * saving, but we still want to free this data
1703 */ 1682 */
1704 if (first_map->in_memory == MAP_SAVING) first_map->in_memory = MAP_IN_MEMORY; 1683 if (first_map->in_memory == MAP_SAVING) first_map->in_memory = MAP_IN_MEMORY;
1705 delete_map(first_map); 1684 delete_map(first_map);
1706 real_maps++; 1685 real_maps++;
1707 } 1686 }
1708 LOG(llevDebug,"free_all_maps: Freed %d maps\n", real_maps); 1687 LOG(llevDebug,"free_all_maps: Freed %d maps\n", real_maps);
1709} 1688}
1710 1689
1711/* change_map_light() - used to change map light level (darkness) 1690/* change_map_light() - used to change map light level (darkness)
… …
1725 return 0; 1704 return 0;
1726 } 1705 }
1727 1706
1728 /* inform all players on the map */ 1707 /* inform all players on the map */
1729 if (change>0) 1708 if (change>0)
1730 new_info_map(NDI_BLACK|NDI_UNIQUE, m,"It becomes darker."); 1709 new_info_map(NDI_BLACK|NDI_UNIQUE, m,"It becomes darker.");
1731 else 1710 else
1732 new_info_map(NDI_BLACK|NDI_UNIQUE, m,"It becomes brighter."); 1711 new_info_map(NDI_BLACK|NDI_UNIQUE, m,"It becomes brighter.");
1733 1712
1734 /* Do extra checking. since m->darkness is a unsigned value, 1713 /* Do extra checking. since m->darkness is a unsigned value,
1735 * we need to be extra careful about negative values. 1714 * we need to be extra careful about negative values.
1736 * In general, the checks below are only needed if change 1715 * In general, the checks below are only needed if change
1737 * is not +/-1 1716 * is not +/-1
… …
1755void update_position (mapstruct *m, int x, int y) { 1734void update_position (mapstruct *m, int x, int y) {
1756 object *tmp, *last = NULL; 1735 object *tmp, *last = NULL;
1757 uint8 flags = 0, oldflags, light=0, anywhere=0; 1736 uint8 flags = 0, oldflags, light=0, anywhere=0;
1758 New_Face *top,*floor, *middle; 1737 New_Face *top,*floor, *middle;
1759 object *top_obj, *floor_obj, *middle_obj; 1738 object *top_obj, *floor_obj, *middle_obj;
1760 MoveType move_block=0, move_slow=0, move_on=0, move_off=0, move_allow=0; 1739 MoveType move_block=0, move_slow=0, move_on=0, move_off=0, move_allow=0;
1761 1740
1762 oldflags = GET_MAP_FLAGS(m,x,y); 1741 oldflags = GET_MAP_FLAGS(m,x,y);
1763 if (!(oldflags & P_NEED_UPDATE)) { 1742 if (!(oldflags & P_NEED_UPDATE)) {
1764 LOG(llevDebug,"update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", 1743 LOG(llevDebug,"update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n",
1765 m->path, x, y); 1744 m->path, x, y);
1766 return; 1745 return;
1767 } 1746 }
1768 1747
1769 middle=blank_face; 1748 middle=blank_face;
1770 top=blank_face; 1749 top=blank_face;
1771 floor=blank_face; 1750 floor=blank_face;
… …
1774 top_obj = NULL; 1753 top_obj = NULL;
1775 floor_obj = NULL; 1754 floor_obj = NULL;
1776 1755
1777 for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) { 1756 for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) {
1778 1757
1779 /* This could be made additive I guess (two lights better than 1758 /* This could be made additive I guess (two lights better than
1780 * one). But if so, it shouldn't be a simple additive - 2 1759 * one). But if so, it shouldn't be a simple additive - 2
1781 * light bulbs do not illuminate twice as far as once since 1760 * light bulbs do not illuminate twice as far as once since
1782 * it is a disapation factor that is squared (or is it cubed?) 1761 * it is a disapation factor that is squared (or is it cubed?)
1783 */ 1762 */
1784 if (tmp->glow_radius > light) light = tmp->glow_radius; 1763 if (tmp->glow_radius > light) light = tmp->glow_radius;
1785 1764
1786 /* This call is needed in order to update objects the player 1765 /* This call is needed in order to update objects the player
1787 * is standing in that have animations (ie, grass, fire, etc). 1766 * is standing in that have animations (ie, grass, fire, etc).
1788 * However, it also causes the look window to be re-drawn 1767 * However, it also causes the look window to be re-drawn
1789 * 3 times each time the player moves, because many of the 1768 * 3 times each time the player moves, because many of the
1790 * functions the move_player calls eventualy call this. 1769 * functions the move_player calls eventualy call this.
1791 * 1770 *
1792 * Always put the player down for drawing. 1771 * Always put the player down for drawing.
1793 */ 1772 */
1794 if (!tmp->invisible) { 1773 if (!tmp->invisible) {
1795 if ((tmp->type==PLAYER || QUERY_FLAG(tmp, FLAG_MONSTER))) { 1774 if ((tmp->type==PLAYER || QUERY_FLAG(tmp, FLAG_MONSTER))) {
1796 top = tmp->face; 1775 top = tmp->face;
1797 top_obj = tmp; 1776 top_obj = tmp;
1798 } 1777 }
1799 else if (QUERY_FLAG(tmp,FLAG_IS_FLOOR)) { 1778 else if (QUERY_FLAG(tmp,FLAG_IS_FLOOR)) {
1800 /* If we got a floor, that means middle and top were below it, 1779 /* If we got a floor, that means middle and top were below it,
1801 * so should not be visible, so we clear them. 1780 * so should not be visible, so we clear them.
1802 */ 1781 */
1803 middle=blank_face; 1782 middle=blank_face;
1804 top=blank_face; 1783 top=blank_face;
1805 floor = tmp->face; 1784 floor = tmp->face;
1806 floor_obj = tmp; 1785 floor_obj = tmp;
1807 } 1786 }
1808 /* Flag anywhere have high priority */ 1787 /* Flag anywhere have high priority */
1809 else if (QUERY_FLAG(tmp, FLAG_SEE_ANYWHERE)) { 1788 else if (QUERY_FLAG(tmp, FLAG_SEE_ANYWHERE)) {
1810 middle = tmp->face; 1789 middle = tmp->face;
1811 1790
1812 middle_obj = tmp; 1791 middle_obj = tmp;
1813 anywhere =1; 1792 anywhere =1;
1814 } 1793 }
1815 /* Find the highest visible face around. If equal 1794 /* Find the highest visible face around. If equal
1816 * visibilities, we still want the one nearer to the 1795 * visibilities, we still want the one nearer to the
1817 * top 1796 * top
1818 */ 1797 */
1819 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) { 1798 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) {
1820 middle = tmp->face; 1799 middle = tmp->face;
1821 middle_obj = tmp; 1800 middle_obj = tmp;
1822 } 1801 }
1823 } 1802 }
1824 if (tmp==tmp->above) { 1803 if (tmp==tmp->above) {
1825 LOG(llevError, "Error in structure of map\n"); 1804 LOG(llevError, "Error in structure of map\n");
1826 exit (-1); 1805 exit (-1);
1827 } 1806 }
1828 1807
1829 move_slow |= tmp->move_slow; 1808 move_slow |= tmp->move_slow;
1830 move_block |= tmp->move_block; 1809 move_block |= tmp->move_block;
1831 move_on |= tmp->move_on; 1810 move_on |= tmp->move_on;
1832 move_off |= tmp->move_off; 1811 move_off |= tmp->move_off;
1833 move_allow |= tmp->move_allow; 1812 move_allow |= tmp->move_allow;
1834 1813
1835 if (QUERY_FLAG(tmp,FLAG_ALIVE)) 1814 if (QUERY_FLAG(tmp,FLAG_ALIVE))
1836 flags |= P_IS_ALIVE; 1815 flags |= P_IS_ALIVE;
1837 if (QUERY_FLAG(tmp,FLAG_NO_MAGIC)) 1816 if (QUERY_FLAG(tmp,FLAG_NO_MAGIC))
1838 flags |= P_NO_MAGIC; 1817 flags |= P_NO_MAGIC;
1839 if (QUERY_FLAG(tmp,FLAG_DAMNED)) 1818 if (QUERY_FLAG(tmp,FLAG_DAMNED))
1840 flags |= P_NO_CLERIC; 1819 flags |= P_NO_CLERIC;
1841 if (tmp->type == SAFE_GROUND) 1820 if (tmp->type == SAFE_GROUND)
1842 flags |= P_SAFE | P_NO_CLERIC | P_NO_MAGIC; 1821 flags |= P_SAFE | P_NO_CLERIC | P_NO_MAGIC;
1843 1822
1844 if (QUERY_FLAG(tmp,FLAG_BLOCKSVIEW)) 1823 if (QUERY_FLAG(tmp,FLAG_BLOCKSVIEW))
1845 flags |= P_BLOCKSVIEW; 1824 flags |= P_BLOCKSVIEW;
1846 } /* for stack of objects */ 1825 } /* for stack of objects */
1847 1826
1848 /* we don't want to rely on this function to have accurate flags, but 1827 /* we don't want to rely on this function to have accurate flags, but
1849 * since we're already doing the work, we calculate them here. 1828 * since we're already doing the work, we calculate them here.
1850 * if they don't match, logic is broken someplace. 1829 * if they don't match, logic is broken someplace.
1851 */ 1830 */
1852 if (((oldflags & ~(P_NEED_UPDATE|P_NO_ERROR)) != flags) && 1831 if (((oldflags & ~(P_NEED_UPDATE|P_NO_ERROR)) != flags) &&
1853 (!(oldflags & P_NO_ERROR))) { 1832 (!(oldflags & P_NO_ERROR))) {
1854 LOG(llevDebug,"update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n", 1833 LOG(llevDebug,"update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n",
1855 m->path, x, y, 1834 m->path, x, y,
1856 (oldflags & ~P_NEED_UPDATE), flags); 1835 (oldflags & ~P_NEED_UPDATE), flags);
1857 } 1836 }
1858 SET_MAP_FLAGS(m, x, y, flags); 1837 SET_MAP_FLAGS(m, x, y, flags);
1859 SET_MAP_MOVE_BLOCK(m, x, y, move_block & ~move_allow); 1838 SET_MAP_MOVE_BLOCK(m, x, y, move_block & ~move_allow);
1860 SET_MAP_MOVE_ON(m, x, y, move_on); 1839 SET_MAP_MOVE_ON(m, x, y, move_on);
… …
1882 * 2) middle is set, need to set top. 1861 * 2) middle is set, need to set top.
1883 * 3) neither middle or top is set - need to set both. 1862 * 3) neither middle or top is set - need to set both.
1884 */ 1863 */
1885 1864
1886 for (tmp=last; tmp; tmp=tmp->below) { 1865 for (tmp=last; tmp; tmp=tmp->below) {
1887 /* Once we get to a floor, stop, since we already have a floor object */ 1866 /* Once we get to a floor, stop, since we already have a floor object */
1888 if (QUERY_FLAG(tmp,FLAG_IS_FLOOR)) break; 1867 if (QUERY_FLAG(tmp,FLAG_IS_FLOOR)) break;
1889 1868
1890 /* If two top faces are already set, quit processing */ 1869 /* If two top faces are already set, quit processing */
1891 if ((top != blank_face) && (middle != blank_face)) break; 1870 if ((top != blank_face) && (middle != blank_face)) break;
1892 1871
1893 /* Only show visible faces, unless its the editor - show all */ 1872 /* Only show visible faces, unless its the editor - show all */
1894 if (!tmp->invisible || editor) { 1873 if (!tmp->invisible || editor) {
1895 /* Fill in top if needed */ 1874 /* Fill in top if needed */
1896 if (top == blank_face) { 1875 if (top == blank_face) {
1897 top = tmp->face; 1876 top = tmp->face;
1898 top_obj = tmp; 1877 top_obj = tmp;
1899 if (top == middle) middle=blank_face; 1878 if (top == middle) middle=blank_face;
1900 } else { 1879 } else {
1901 /* top is already set - we should only get here if 1880 /* top is already set - we should only get here if
1902 * middle is not set 1881 * middle is not set
1903 * 1882 *
1904 * Set the middle face and break out, since there is nothing 1883 * Set the middle face and break out, since there is nothing
1905 * more to fill in. We don't check visiblity here, since 1884 * more to fill in. We don't check visiblity here, since
1906 * 1885 *
1907 */ 1886 */
1908 if (tmp->face != top ) { 1887 if (tmp->face != top ) {
1909 middle = tmp->face; 1888 middle = tmp->face;
1910 middle_obj = tmp; 1889 middle_obj = tmp;
1911 break; 1890 break;
1912 } 1891 }
1913 } 1892 }
1914 } 1893 }
1915 } 1894 }
1916 if (middle == floor) middle = blank_face; 1895 if (middle == floor) middle = blank_face;
1917 if (top == middle) middle = blank_face; 1896 if (top == middle) middle = blank_face;
1918 SET_MAP_FACE(m,x,y,top,0); 1897 SET_MAP_FACE(m,x,y,top,0);
1919 if(top != blank_face) 1898 if(top != blank_face)
… …
1959 1938
1960 orig_map->tile_map[tile_num] = ready_map_name(path, 0); 1939 orig_map->tile_map[tile_num] = ready_map_name(path, 0);
1961 1940
1962 /* need to do a strcmp here as the orig_map->path is not a shared string */ 1941 /* need to do a strcmp here as the orig_map->path is not a shared string */
1963 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && 1942 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] &&
1964 !strcmp(orig_map->tile_map[tile_num]->tile_path[dest_tile], orig_map->path)) 1943 !strcmp(orig_map->tile_map[tile_num]->tile_path[dest_tile], orig_map->path))
1965 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; 1944 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1966 1945
1967 return orig_map->tile_map[tile_num]; 1946 return orig_map->tile_map[tile_num];
1968} 1947}
1969 1948
1970/* this returns TRUE if the coordinates (x,y) are out of 1949/* this returns TRUE if the coordinates (x,y) are out of
… …
1985 * map loads fail below, it could happen. 1964 * map loads fail below, it could happen.
1986 */ 1965 */
1987 if (!m) return 0; 1966 if (!m) return 0;
1988 1967
1989 if (x<0) { 1968 if (x<0) {
1990 if (!m->tile_path[3]) return 1; 1969 if (!m->tile_path[3]) return 1;
1991 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) { 1970 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) {
1992 load_and_link_tiled_map(m, 3); 1971 load_and_link_tiled_map(m, 3);
1993 } 1972 }
1994 return (out_of_map(m->tile_map[3], x + MAP_WIDTH(m->tile_map[3]), y)); 1973 return (out_of_map(m->tile_map[3], x + MAP_WIDTH(m->tile_map[3]), y));
1995 } 1974 }
1996 if (x>=MAP_WIDTH(m)) { 1975 if (x>=MAP_WIDTH(m)) {
1997 if (!m->tile_path[1]) return 1; 1976 if (!m->tile_path[1]) return 1;
1998 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) { 1977 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) {
1999 load_and_link_tiled_map(m, 1); 1978 load_and_link_tiled_map(m, 1);
2000 } 1979 }
2001 return (out_of_map(m->tile_map[1], x - MAP_WIDTH(m), y)); 1980 return (out_of_map(m->tile_map[1], x - MAP_WIDTH(m), y));
2002 } 1981 }
2003 if (y<0) { 1982 if (y<0) {
2004 if (!m->tile_path[0]) return 1; 1983 if (!m->tile_path[0]) return 1;
2005 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) { 1984 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) {
2006 load_and_link_tiled_map(m, 0); 1985 load_and_link_tiled_map(m, 0);
2007 } 1986 }
2008 return (out_of_map(m->tile_map[0], x, y + MAP_HEIGHT(m->tile_map[0]))); 1987 return (out_of_map(m->tile_map[0], x, y + MAP_HEIGHT(m->tile_map[0])));
2009 } 1988 }
2010 if (y>=MAP_HEIGHT(m)) { 1989 if (y>=MAP_HEIGHT(m)) {
2011 if (!m->tile_path[2]) return 1; 1990 if (!m->tile_path[2]) return 1;
2012 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) { 1991 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) {
2013 load_and_link_tiled_map(m, 2); 1992 load_and_link_tiled_map(m, 2);
2014 } 1993 }
2015 return (out_of_map(m->tile_map[2], x, y - MAP_HEIGHT(m))); 1994 return (out_of_map(m->tile_map[2], x, y - MAP_HEIGHT(m)));
2016 } 1995 }
2017 1996
2018 /* Simple case - coordinates are within this local 1997 /* Simple case - coordinates are within this local
2019 * map. 1998 * map.
2020 */ 1999 */
… …
2031 */ 2010 */
2032mapstruct *get_map_from_coord(mapstruct *m, sint16 *x, sint16 *y) 2011mapstruct *get_map_from_coord(mapstruct *m, sint16 *x, sint16 *y)
2033{ 2012{
2034 2013
2035 if (*x<0) { 2014 if (*x<0) {
2036 if (!m->tile_path[3]) return NULL; 2015 if (!m->tile_path[3]) return NULL;
2037 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2016 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2038 load_and_link_tiled_map(m, 3); 2017 load_and_link_tiled_map(m, 3);
2039 2018
2040 *x += MAP_WIDTH(m->tile_map[3]); 2019 *x += MAP_WIDTH(m->tile_map[3]);
2041 return (get_map_from_coord(m->tile_map[3], x, y)); 2020 return (get_map_from_coord(m->tile_map[3], x, y));
2042 } 2021 }
2043 if (*x>=MAP_WIDTH(m)) { 2022 if (*x>=MAP_WIDTH(m)) {
2044 if (!m->tile_path[1]) return NULL; 2023 if (!m->tile_path[1]) return NULL;
2045 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2024 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2046 load_and_link_tiled_map(m, 1); 2025 load_and_link_tiled_map(m, 1);
2047 2026
2048 *x -= MAP_WIDTH(m); 2027 *x -= MAP_WIDTH(m);
2049 return (get_map_from_coord(m->tile_map[1], x, y)); 2028 return (get_map_from_coord(m->tile_map[1], x, y));
2050 } 2029 }
2051 if (*y<0) { 2030 if (*y<0) {
2052 if (!m->tile_path[0]) return NULL; 2031 if (!m->tile_path[0]) return NULL;
2053 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2032 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2054 load_and_link_tiled_map(m, 0); 2033 load_and_link_tiled_map(m, 0);
2055 2034
2056 *y += MAP_HEIGHT(m->tile_map[0]); 2035 *y += MAP_HEIGHT(m->tile_map[0]);
2057 return (get_map_from_coord(m->tile_map[0], x, y)); 2036 return (get_map_from_coord(m->tile_map[0], x, y));
2058 } 2037 }
2059 if (*y>=MAP_HEIGHT(m)) { 2038 if (*y>=MAP_HEIGHT(m)) {
2060 if (!m->tile_path[2]) return NULL; 2039 if (!m->tile_path[2]) return NULL;
2061 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2040 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2062 load_and_link_tiled_map(m, 2); 2041 load_and_link_tiled_map(m, 2);
2063 2042
2064 *y -= MAP_HEIGHT(m); 2043 *y -= MAP_HEIGHT(m);
2065 return (get_map_from_coord(m->tile_map[2], x, y)); 2044 return (get_map_from_coord(m->tile_map[2], x, y));
2066 } 2045 }
2067 2046
2068 /* Simple case - coordinates are within this local 2047 /* Simple case - coordinates are within this local
2069 * map. 2048 * map.
2070 */ 2049 */
… …
2214 retval->distance_x = 32767; 2193 retval->distance_x = 32767;
2215 retval->distance_y = 32767; 2194 retval->distance_y = 32767;
2216 retval->direction = 0; 2195 retval->direction = 0;
2217 retval->part = 0; 2196 retval->part = 0;
2218 } else { 2197 } else {
2219 retval->distance_x += op2->x-x; 2198 retval->distance_x += op2->x-x;
2220 retval->distance_y += op2->y-y; 2199 retval->distance_y += op2->y-y;
2221 2200
2222 retval->part = NULL; 2201 retval->part = NULL;
2223 retval->distance = isqrt(retval->distance_x*retval->distance_x+retval->distance_y*retval->distance_y); 2202 retval->distance = isqrt(retval->distance_x*retval->distance_x+retval->distance_y*retval->distance_y);
2224 retval->direction = find_dir_2(-retval->distance_x, -retval->distance_y); 2203 retval->direction = find_dir_2(-retval->distance_x, -retval->distance_y);
2225 } 2204 }

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines