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.4 by elmex, Tue Aug 15 18:12:20 2006 UTC vs.
Revision 1.26 by pippijn, Thu Sep 7 09:37:12 2006 UTC

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

Diff Legend

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