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.7 by elmex, Mon Aug 21 02:58:22 2006 UTC vs.
Revision 1.14 by root, Wed Aug 30 06:06:26 2006 UTC

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

Diff Legend

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