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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.72 by root, Sat Jan 13 23:06:12 2007 UTC vs.
Revision 1.95 by root, Thu Mar 15 13:19:37 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 21 *
22 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
23*/ 23 */
24 24
25#include <global.h>
26#include <funcpoint.h>
27
28#include <loader.h>
29#include <unistd.h> 25#include <unistd.h>
26
27#include "global.h"
28#include "funcpoint.h"
29
30#include "loader.h"
30 31
31#include "path.h" 32#include "path.h"
32 33
33/* 34/*
34 * This makes a path absolute outside the world of Crossfire. 35 * This makes a path absolute outside the world of Crossfire.
… …
67 char *endbuf; 68 char *endbuf;
68 struct stat statbuf; 69 struct stat statbuf;
69 int mode = 0; 70 int mode = 0;
70 71
71 if (prepend_dir) 72 if (prepend_dir)
72 strcpy (buf, create_pathname (name)); 73 assign (buf, create_pathname (name));
73 else 74 else
74 strcpy (buf, name); 75 assign (buf, name);
75 76
76 /* old method (strchr(buf, '\0')) seemd very odd to me - 77 /* old method (strchr(buf, '\0')) seemd very odd to me -
77 * this method should be equivalant and is clearer. 78 * this method should be equivalant and is clearer.
78 * Can not use strcat because we need to cycle through 79 * Can not use strcat because we need to cycle through
79 * all the names. 80 * all the names.
… …
228 229
229 } 230 }
230 return 0; 231 return 0;
231} 232}
232 233
233
234/* 234/*
235 * Returns true if the given object can't fit in the given spot. 235 * Returns true if the given object can't fit in the given spot.
236 * This is meant for multi space objects - for single space objecs, 236 * This is meant for multi space objects - for single space objecs,
237 * just calling get_map_blocked and checking that against movement type 237 * just calling get_map_blocked and checking that against movement type
238 * of object. This function goes through all the parts of the 238 * of object. This function goes through all the parts of the
… …
354{ 354{
355 if (!spaces) 355 if (!spaces)
356 return; 356 return;
357 357
358 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 358 for (mapspace *ms = spaces + size (); ms-- > spaces; )
359 for (object *tmp = ms->bot; tmp; ) 359 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
360 { 360 {
361 object *above = tmp->above;
362
363 /* already multipart - don't do anything more */ 361 /* already multipart - don't do anything more */
364 if (!tmp->head && !tmp->more) 362 if (!tmp->head && !tmp->more)
365 { 363 {
366 /* If there is nothing more to this object, this for loop 364 /* If there is nothing more to this object, this for loop
367 * won't do anything. 365 * won't do anything.
… …
389 * the coding is simpler to just to it here with each part. 387 * the coding is simpler to just to it here with each part.
390 */ 388 */
391 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 389 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON);
392 } 390 }
393 } 391 }
394
395 tmp = above;
396 } 392 }
397} 393}
398 394
399/* 395/*
400 * Loads (ands parses) the objects into a given map from the specified 396 * Loads (ands parses) the objects into a given map from the specified
401 * file pointer. 397 * file pointer.
402 * mapflags is the same as we get with load_original_map
403 */ 398 */
404bool 399bool
405maptile::_load_objects (object_thawer &thawer) 400maptile::_load_objects (object_thawer &f)
406{ 401{
407 int unique; 402 for (;;)
408 object *op, *prev = NULL, *last_more = NULL, *otmp;
409
410 op = object::create ();
411 op->map = this; /* To handle buttons correctly */
412
413 while (int i = load_object (thawer, op, 0))
414 { 403 {
415 /* if the archetype for the object is null, means that we 404 coroapi::cede_every (1000); // cede once in a while
416 * got an invalid object. Don't do anything with it - the game 405
417 * or editor will not be able to do anything with it either. 406 switch (f.kw)
418 */
419 if (op->arch == NULL)
420 { 407 {
421 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 408 case KW_arch:
422 continue; 409 if (object *op = object::read (f, this))
423 }
424
425 switch (i)
426 { 410 {
427 case LL_NORMAL: 411 if (op->inv)
412 sum_weight (op);
413
428 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 414 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
415 }
429 416
430 if (op->inv) 417 continue;
431 sum_weight (op);
432 418
433 prev = op, last_more = op;
434 break;
435
436 case LL_MORE: 419 case KW_EOF:
437 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 420 return true;
438 op->head = prev, last_more->more = op, last_more = op; 421
422 default:
423 if (!f.parse_error ("map file"))
424 return false;
439 break; 425 break;
440 } 426 }
441 427
442 op = object::create (); 428 f.next ();
443 op->map = this;
444 }
445
446 op->destroy ();
447
448#if 0
449 for (i = 0; i < width; i++)
450 for (j = 0; j < height; j++)
451 {
452 unique = 0;
453 /* check for unique items, or unique squares */
454 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
455 {
456 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
457 unique = 1;
458
459 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
460 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
461 }
462 } 429 }
463#endif
464 430
465 return true; 431 return true;
466} 432}
467 433
468void 434void
… …
486 for (object *op = ms->bot; op; op = op->above) 452 for (object *op = ms->bot; op; op = op->above)
487 op->deactivate_recursive (); 453 op->deactivate_recursive ();
488} 454}
489 455
490bool 456bool
491maptile::_save_objects (object_freezer &freezer, int flags) 457maptile::_save_objects (object_freezer &f, int flags)
492{ 458{
493 static int cede_count = 0; 459 static int cede_count = 0;
494 460
495 if (flags & IO_HEADER) 461 if (flags & IO_HEADER)
496 _save_header (freezer); 462 _save_header (f);
497 463
498 if (!spaces) 464 if (!spaces)
499 return false; 465 return false;
500 466
501 for (int i = 0; i < size (); ++i) 467 for (int i = 0; i < size (); ++i)
502 { 468 {
469#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
503 if (cede_count >= 500) 470 if (cede_count >= 500)
504 { 471 {
505 cede_count = 0; 472 cede_count = 0;
506 coroapi::cede (); 473 coroapi::cede ();
507 } 474 }
475#endif
508 476
509 int unique = 0; 477 int unique = 0;
510 for (object *op = spaces [i].bot; op; op = op->above) 478 for (object *op = spaces [i].bot; op; op = op->above)
511 { 479 {
512 // count per-object, but cede only when modification-safe 480 // count per-object, but cede only when modification-safe
… …
519 continue; 487 continue;
520 488
521 if (unique || op->flag [FLAG_UNIQUE]) 489 if (unique || op->flag [FLAG_UNIQUE])
522 { 490 {
523 if (flags & IO_UNIQUES) 491 if (flags & IO_UNIQUES)
524 save_object (freezer, op, 1); 492 op->write (f);
525 } 493 }
526 else if (flags & IO_OBJECTS) 494 else if (flags & IO_OBJECTS)
527 save_object (freezer, op, 1); 495 op->write (f);
528 } 496 }
529 } 497 }
530 498
531 return true; 499 return true;
532} 500}
533 501
534bool 502bool
535maptile::_load_objects (const char *path, bool skip_header) 503maptile::_load_objects (const char *path, bool skip_header)
536{ 504{
537 object_thawer thawer (path); 505 object_thawer f (path);
538 506
539 if (!thawer) 507 if (!f)
540 return false; 508 return false;
509
510 f.next ();
541 511
542 if (skip_header) 512 if (skip_header)
543 for (;;) 513 for (;;)
544 { 514 {
545 keyword kw = thawer.get_kv (); 515 keyword kw = f.kw;
546 516 f.skip ();
547 if (kw == KW_end) 517 if (kw == KW_end)
548 break; 518 break;
549
550 thawer.skip_kv (kw);
551 } 519 }
552 520
553 return _load_objects (thawer); 521 return _load_objects (f);
554} 522}
555 523
556bool 524bool
557maptile::_save_objects (const char *path, int flags) 525maptile::_save_objects (const char *path, int flags)
558{ 526{
… …
567maptile::maptile () 535maptile::maptile ()
568{ 536{
569 in_memory = MAP_SWAPPED; 537 in_memory = MAP_SWAPPED;
570 538
571 /* The maps used to pick up default x and y values from the 539 /* The maps used to pick up default x and y values from the
572 * map archetype. Mimic that behaviour. 540 * map archetype. Mimic that behaviour.
573 */ 541 */
574 width = 16; 542 width = 16;
575 height = 16; 543 height = 16;
576 reset_timeout = 0;
577 timeout = 300; 544 timeout = 300;
578 enter_x = 0; 545 max_nrof = 1000; // 1000 items of anything
579 enter_y = 0; 546 max_volume = 2000000; // 2m³
580} 547}
581 548
582maptile::maptile (int w, int h) 549maptile::maptile (int w, int h)
583{ 550{
584 in_memory = MAP_SWAPPED; 551 in_memory = MAP_SWAPPED;
… …
738 { 705 {
739 keyword kw = thawer.get_kv (); 706 keyword kw = thawer.get_kv ();
740 707
741 switch (kw) 708 switch (kw)
742 { 709 {
743 case KW_EOF:
744 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
745 return false;
746
747 case KW_end:
748 return true;
749
750 default:
751 case KW_ERROR:
752 LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword);
753 break;
754
755 case KW_msg: 710 case KW_msg:
756 thawer.get_ml (KW_endmsg, msg); 711 thawer.get_ml (KW_endmsg, msg);
757 break; 712 break;
758 713
759 case KW_lore: // CF+ extension 714 case KW_lore: // CF+ extension
… …
791 case KW_sky: thawer.get (sky); break; 746 case KW_sky: thawer.get (sky); break;
792 747
793 case KW_per_player: thawer.get (per_player); break; 748 case KW_per_player: thawer.get (per_player); break;
794 case KW_per_party: thawer.get (per_party); break; 749 case KW_per_party: thawer.get (per_party); break;
795 750
796 case KW_region: get_region_by_name (thawer.get_str ()); break; 751 case KW_region: default_region = region::find (thawer.get_str ()); break;
797 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 752 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
798 753
799 // old names new names 754 // old names new names
800 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 755 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
801 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 756 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
809 764
810 case KW_tile_path_1: thawer.get (tile_path [0]); break; 765 case KW_tile_path_1: thawer.get (tile_path [0]); break;
811 case KW_tile_path_2: thawer.get (tile_path [1]); break; 766 case KW_tile_path_2: thawer.get (tile_path [1]); break;
812 case KW_tile_path_3: thawer.get (tile_path [2]); break; 767 case KW_tile_path_3: thawer.get (tile_path [2]); break;
813 case KW_tile_path_4: thawer.get (tile_path [3]); break; 768 case KW_tile_path_4: thawer.get (tile_path [3]); break;
769
770 case KW_end:
771 return true;
772
773 default:
774 if (!thawer.parse_error ("map", 0))
775 return false;
776 break;
814 } 777 }
815 } 778 }
816 779
817 abort (); 780 abort ();
818} 781}
… …
870 MAP_OUT (reset_time); 833 MAP_OUT (reset_time);
871 MAP_OUT (reset_timeout); 834 MAP_OUT (reset_timeout);
872 MAP_OUT (fixed_resettime); 835 MAP_OUT (fixed_resettime);
873 MAP_OUT (difficulty); 836 MAP_OUT (difficulty);
874 837
875 if (region) MAP_OUT2 (region, region->name); 838 if (default_region) MAP_OUT2 (region, default_region->name);
876 839
877 if (shopitems) 840 if (shopitems)
878 { 841 {
879 char shop[MAX_BUF]; 842 char shop[MAX_BUF];
880 print_shop_string (this, shop); 843 print_shop_string (this, shop);
… …
931 * Remove and free all objects in the given map. 894 * Remove and free all objects in the given map.
932 */ 895 */
933void 896void
934maptile::clear () 897maptile::clear ()
935{ 898{
899 sfree (regions, size ()), regions = 0;
900 free (regionmap), regionmap = 0;
901
936 if (!spaces) 902 if (spaces)
937 return; 903 {
938
939 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 904 for (mapspace *ms = spaces + size (); ms-- > spaces; )
940 while (object *op = ms->bot) 905 while (object *op = ms->bot)
941 { 906 {
942 if (op->head) 907 if (op->head)
943 op = op->head; 908 op = op->head;
944 909
945 op->destroy_inv (false); 910 op->destroy_inv (false);
946 op->destroy (); 911 op->destroy ();
947 } 912 }
948 913
949 sfree (spaces, size ()), spaces = 0; 914 sfree (spaces, size ()), spaces = 0;
915 }
950 916
951 if (buttons) 917 if (buttons)
952 free_objectlinkpt (buttons), buttons = 0; 918 free_objectlinkpt (buttons), buttons = 0;
953} 919}
954 920
… …
1108 */ 1074 */
1109void 1075void
1110mapspace::update_ () 1076mapspace::update_ ()
1111{ 1077{
1112 object *tmp, *last = 0; 1078 object *tmp, *last = 0;
1113 uint8 flags = 0, light = 0, anywhere = 0; 1079 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1114 New_Face *top, *floor, *middle;
1115 object *top_obj, *floor_obj, *middle_obj;
1116 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1080 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1117 1081
1118 middle = blank_face; 1082 //object *middle = 0;
1119 top = blank_face; 1083 //object *top = 0;
1120 floor = blank_face; 1084 //object *floor = 0;
1121 1085 // this seems to generate better code than using locals, above
1122 middle_obj = 0; 1086 object *&top = faces_obj[0] = 0;
1123 top_obj = 0; 1087 object *&middle = faces_obj[1] = 0;
1124 floor_obj = 0; 1088 object *&floor = faces_obj[2] = 0;
1125 1089
1126 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1090 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1127 { 1091 {
1128 /* This could be made additive I guess (two lights better than 1092 /* This could be made additive I guess (two lights better than
1129 * one). But if so, it shouldn't be a simple additive - 2 1093 * one). But if so, it shouldn't be a simple additive - 2
… …
1142 * Always put the player down for drawing. 1106 * Always put the player down for drawing.
1143 */ 1107 */
1144 if (!tmp->invisible) 1108 if (!tmp->invisible)
1145 { 1109 {
1146 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1110 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1147 {
1148 top = tmp->face;
1149 top_obj = tmp; 1111 top = tmp;
1150 }
1151 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1112 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1152 { 1113 {
1153 /* If we got a floor, that means middle and top were below it, 1114 /* If we got a floor, that means middle and top were below it,
1154 * so should not be visible, so we clear them. 1115 * so should not be visible, so we clear them.
1155 */ 1116 */
1156 middle = blank_face; 1117 middle = 0;
1157 top = blank_face; 1118 top = 0;
1158 floor = tmp->face;
1159 floor_obj = tmp; 1119 floor = tmp;
1160 } 1120 }
1161 /* Flag anywhere have high priority */ 1121 /* Flag anywhere have high priority */
1162 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1122 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1163 { 1123 {
1164 middle = tmp->face;
1165
1166 middle_obj = tmp; 1124 middle = tmp;
1167 anywhere = 1; 1125 anywhere = 1;
1168 } 1126 }
1169 /* Find the highest visible face around. If equal 1127 /* Find the highest visible face around. If equal
1170 * visibilities, we still want the one nearer to the 1128 * visibilities, we still want the one nearer to the
1171 * top 1129 * top
1172 */ 1130 */
1173 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1131 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1174 {
1175 middle = tmp->face;
1176 middle_obj = tmp; 1132 middle = tmp;
1177 }
1178 } 1133 }
1179 1134
1180 if (tmp == tmp->above) 1135 if (tmp == tmp->above)
1181 { 1136 {
1182 LOG (llevError, "Error in structure of map\n"); 1137 LOG (llevError, "Error in structure of map\n");
… …
1217 * middle face. This should not happen, as we already have the 1172 * middle face. This should not happen, as we already have the
1218 * else statement above so middle should not get set. OTOH, it 1173 * else statement above so middle should not get set. OTOH, it
1219 * may be possible for the faces to match but be different objects. 1174 * may be possible for the faces to match but be different objects.
1220 */ 1175 */
1221 if (top == middle) 1176 if (top == middle)
1222 middle = blank_face; 1177 middle = 0;
1223 1178
1224 /* There are three posibilities at this point: 1179 /* There are three posibilities at this point:
1225 * 1) top face is set, need middle to be set. 1180 * 1) top face is set, need middle to be set.
1226 * 2) middle is set, need to set top. 1181 * 2) middle is set, need to set top.
1227 * 3) neither middle or top is set - need to set both. 1182 * 3) neither middle or top is set - need to set both.
… …
1232 /* Once we get to a floor, stop, since we already have a floor object */ 1187 /* Once we get to a floor, stop, since we already have a floor object */
1233 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1188 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1234 break; 1189 break;
1235 1190
1236 /* If two top faces are already set, quit processing */ 1191 /* If two top faces are already set, quit processing */
1237 if ((top != blank_face) && (middle != blank_face)) 1192 if (top && middle)
1238 break; 1193 break;
1239 1194
1240 /* Only show visible faces */ 1195 /* Only show visible faces */
1241 if (!tmp->invisible) 1196 if (!tmp->invisible)
1242 { 1197 {
1243 /* Fill in top if needed */ 1198 /* Fill in top if needed */
1244 if (top == blank_face) 1199 if (!top)
1245 { 1200 {
1246 top = tmp->face;
1247 top_obj = tmp; 1201 top = tmp;
1248 if (top == middle) 1202 if (top == middle)
1249 middle = blank_face; 1203 middle = 0;
1250 } 1204 }
1251 else 1205 else
1252 { 1206 {
1253 /* top is already set - we should only get here if 1207 /* top is already set - we should only get here if
1254 * middle is not set 1208 * middle is not set
1255 * 1209 *
1256 * Set the middle face and break out, since there is nothing 1210 * Set the middle face and break out, since there is nothing
1257 * more to fill in. We don't check visiblity here, since 1211 * more to fill in. We don't check visiblity here, since
1258 * 1212 *
1259 */ 1213 */
1260 if (tmp->face != top) 1214 if (tmp != top)
1261 { 1215 {
1262 middle = tmp->face;
1263 middle_obj = tmp; 1216 middle = tmp;
1264 break; 1217 break;
1265 } 1218 }
1266 } 1219 }
1267 } 1220 }
1268 } 1221 }
1269 1222
1270 if (middle == floor) 1223 if (middle == floor)
1271 middle = blank_face; 1224 middle = 0;
1272 1225
1273 if (top == middle) 1226 if (top == middle)
1274 middle = blank_face; 1227 middle = 0;
1275 1228
1276 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1229#if 0
1277 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1230 faces_obj [0] = top;
1278 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1231 faces_obj [1] = middle;
1232 faces_obj [2] = floor;
1233#endif
1234}
1235
1236uint64
1237mapspace::volume () const
1238{
1239 uint64 vol = 0;
1240
1241 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1242 vol += op->volume ();
1243
1244 return vol;
1279} 1245}
1280 1246
1281/* this updates the orig_map->tile_map[tile_num] value after finding 1247/* this updates the orig_map->tile_map[tile_num] value after finding
1282 * the map. It also takes care of linking back the freshly found 1248 * the map. It also takes care of linking back the freshly found
1283 * maps tile_map values if it tiles back to this one. It returns 1249 * maps tile_map values if it tiles back to this one. It returns
… …
1448 1414
1449/** 1415/**
1450 * Return whether map2 is adjacent to map1. If so, store the distance from 1416 * Return whether map2 is adjacent to map1. If so, store the distance from
1451 * map1 to map2 in dx/dy. 1417 * map1 to map2 in dx/dy.
1452 */ 1418 */
1453static int 1419int
1454adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1420adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1455{ 1421{
1456 if (!map1 || !map2) 1422 if (!map1 || !map2)
1457 return 0; 1423 return 0;
1458 1424
… …
1549/* From map.c 1515/* From map.c
1550 * This is used by get_player to determine where the other 1516 * This is used by get_player to determine where the other
1551 * creature is. get_rangevector takes into account map tiling, 1517 * creature is. get_rangevector takes into account map tiling,
1552 * so you just can not look the the map coordinates and get the 1518 * so you just can not look the the map coordinates and get the
1553 * righte value. distance_x/y are distance away, which 1519 * righte value. distance_x/y are distance away, which
1554 * can be negativbe. direction is the crossfire direction scheme 1520 * can be negative. direction is the crossfire direction scheme
1555 * that the creature should head. part is the part of the 1521 * that the creature should head. part is the part of the
1556 * monster that is closest. 1522 * monster that is closest.
1557 * 1523 *
1558 * get_rangevector looks at op1 and op2, and fills in the 1524 * get_rangevector looks at op1 and op2, and fills in the
1559 * structure for op1 to get to op2. 1525 * structure for op1 to get to op2.
… …
1570get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1536get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1571{ 1537{
1572 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1538 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1573 { 1539 {
1574 /* be conservative and fill in _some_ data */ 1540 /* be conservative and fill in _some_ data */
1575 retval->distance = 100000; 1541 retval->distance = 10000;
1576 retval->distance_x = 32767; 1542 retval->distance_x = 10000;
1577 retval->distance_y = 32767; 1543 retval->distance_y = 10000;
1578 retval->direction = 0; 1544 retval->direction = 0;
1579 retval->part = 0; 1545 retval->part = 0;
1580 } 1546 }
1581 else 1547 else
1582 { 1548 {
… …
1587 1553
1588 best = op1; 1554 best = op1;
1589 /* If this is multipart, find the closest part now */ 1555 /* If this is multipart, find the closest part now */
1590 if (!(flags & 0x1) && op1->more) 1556 if (!(flags & 0x1) && op1->more)
1591 { 1557 {
1592 object *tmp;
1593 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1558 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1594 1559
1595 /* we just take the offset of the piece to head to figure 1560 /* we just take the offset of the piece to head to figure
1596 * distance instead of doing all that work above again 1561 * distance instead of doing all that work above again
1597 * since the distance fields we set above are positive in the 1562 * since the distance fields we set above are positive in the
1598 * same axis as is used for multipart objects, the simply arithmetic 1563 * same axis as is used for multipart objects, the simply arithmetic
1599 * below works. 1564 * below works.
1600 */ 1565 */
1601 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1566 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1602 { 1567 {
1603 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1568 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1604 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1569 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1605 if (tmpi < best_distance) 1570 if (tmpi < best_distance)
1606 { 1571 {
1607 best_distance = tmpi; 1572 best_distance = tmpi;
1608 best = tmp; 1573 best = tmp;
1609 } 1574 }
1610 } 1575 }
1576
1611 if (best != op1) 1577 if (best != op1)
1612 { 1578 {
1613 retval->distance_x += op1->x - best->x; 1579 retval->distance_x += op1->x - best->x;
1614 retval->distance_y += op1->y - best->y; 1580 retval->distance_y += op1->y - best->y;
1615 } 1581 }
1616 } 1582 }
1583
1617 retval->part = best; 1584 retval->part = best;
1618 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1585 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1619 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1586 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1620 } 1587 }
1621} 1588}
1622 1589
1623/* this is basically the same as get_rangevector above, but instead of 1590/* this is basically the same as get_rangevector above, but instead of
… …
1628 * flags has no meaning for this function at this time - I kept it in to 1595 * flags has no meaning for this function at this time - I kept it in to
1629 * be more consistant with the above function and also in case they are needed 1596 * be more consistant with the above function and also in case they are needed
1630 * for something in the future. Also, since no object is pasted, the best 1597 * for something in the future. Also, since no object is pasted, the best
1631 * field of the rv_vector is set to NULL. 1598 * field of the rv_vector is set to NULL.
1632 */ 1599 */
1633
1634void 1600void
1635get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1601get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1636{ 1602{
1637 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1603 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1638 { 1604 {
1639 /* be conservative and fill in _some_ data */ 1605 /* be conservative and fill in _some_ data */
1640 retval->distance = 100000; 1606 retval->distance = 100000;
… …
1647 { 1613 {
1648 retval->distance_x += op2->x - x; 1614 retval->distance_x += op2->x - x;
1649 retval->distance_y += op2->y - y; 1615 retval->distance_y += op2->y - y;
1650 1616
1651 retval->part = NULL; 1617 retval->part = NULL;
1652 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1618 retval->distance = idistance (retval->distance_x, retval->distance_y);
1653 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1619 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1654 } 1620 }
1655} 1621}
1656 1622
1657/* Returns true of op1 and op2 are effectively on the same map 1623/* Returns true of op1 and op2 are effectively on the same map
… …
1677 op->remove (); 1643 op->remove ();
1678 1644
1679 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1645 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1680} 1646}
1681 1647
1648region *
1649maptile::region (int x, int y) const
1650{
1651 if (regions
1652 && regionmap
1653 && !OUT_OF_REAL_MAP (this, x, y))
1654 if (struct region *reg = regionmap [regions [y * width + x]])
1655 return reg;
1656
1657 if (default_region)
1658 return default_region;
1659
1660 return ::region::default_region ();
1661}
1662
1663/* picks a random object from a style map.
1664 * Redone by MSW so it should be faster and not use static
1665 * variables to generate tables.
1666 */
1667object *
1668maptile::pick_random_object () const
1669{
1670 /* while returning a null object will result in a crash, that
1671 * is actually preferable to an infinite loop. That is because
1672 * most servers will automatically restart in case of crash.
1673 * Change the logic on getting the random space - shouldn't make
1674 * any difference, but this seems clearer to me.
1675 */
1676 for (int i = 1000; --i;)
1677 {
1678 object *pick = at (rndm (width), rndm (height)).bot;
1679
1680 // do not prefer big monsters just because they are big.
1681 if (pick && pick->head_ () == pick)
1682 return pick->head_ ();
1683 }
1684
1685 // instead of crashing in the unlikely(?) case, try to return *something*
1686 return get_archetype ("blocked");
1687}
1688

Diff Legend

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