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