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.2 by elmex, Tue Aug 15 15:00:20 2006 UTC vs.
Revision 1.28 by root, Fri Sep 8 18:26:22 2006 UTC

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

Diff Legend

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