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.73 by root, Sun Jan 14 18:00:33 2007 UTC vs.
Revision 1.88 by root, Fri Feb 16 19:43:40 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
… …
397} 397}
398 398
399/* 399/*
400 * Loads (ands parses) the objects into a given map from the specified 400 * Loads (ands parses) the objects into a given map from the specified
401 * file pointer. 401 * file pointer.
402 * mapflags is the same as we get with load_original_map
403 */ 402 */
404bool 403bool
405maptile::_load_objects (object_thawer &thawer) 404maptile::_load_objects (object_thawer &f)
406{ 405{
407 int unique; 406 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 { 407 {
415 /* if the archetype for the object is null, means that we 408 coroapi::cede_every (1000); // cede once in a while
416 * got an invalid object. Don't do anything with it - the game 409
417 * or editor will not be able to do anything with it either. 410 switch (f.kw)
418 */
419 if (op->arch == NULL)
420 { 411 {
421 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 412 case KW_arch:
422 continue; 413 if (object *op = object::read (f))
423 }
424
425 switch (i)
426 { 414 {
427 case LL_NORMAL: 415 if (op->inv)
416 sum_weight (op);
417
428 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 418 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
419 }
429 420
430 if (op->inv) 421 continue;
431 sum_weight (op);
432 422
433 prev = op, last_more = op;
434 break;
435
436 case LL_MORE: 423 case KW_EOF:
437 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 424 return true;
438 op->head = prev, last_more->more = op, last_more = op; 425
426 default:
427 if (!f.parse_error ("map file"))
428 return false;
439 break; 429 break;
440 } 430 }
441 431
442 op = object::create (); 432 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 } 433 }
463#endif
464 434
465 return true; 435 return true;
466} 436}
467 437
468void 438void
… …
486 for (object *op = ms->bot; op; op = op->above) 456 for (object *op = ms->bot; op; op = op->above)
487 op->deactivate_recursive (); 457 op->deactivate_recursive ();
488} 458}
489 459
490bool 460bool
491maptile::_save_objects (object_freezer &freezer, int flags) 461maptile::_save_objects (object_freezer &f, int flags)
492{ 462{
493 static int cede_count = 0; 463 static int cede_count = 0;
494 464
495 if (flags & IO_HEADER) 465 if (flags & IO_HEADER)
496 _save_header (freezer); 466 _save_header (f);
497 467
498 if (!spaces) 468 if (!spaces)
499 return false; 469 return false;
500 470
501 for (int i = 0; i < size (); ++i) 471 for (int i = 0; i < size (); ++i)
… …
521 continue; 491 continue;
522 492
523 if (unique || op->flag [FLAG_UNIQUE]) 493 if (unique || op->flag [FLAG_UNIQUE])
524 { 494 {
525 if (flags & IO_UNIQUES) 495 if (flags & IO_UNIQUES)
526 save_object (freezer, op, 1); 496 op->write (f);
527 } 497 }
528 else if (flags & IO_OBJECTS) 498 else if (flags & IO_OBJECTS)
529 save_object (freezer, op, 1); 499 op->write (f);
530 } 500 }
531 } 501 }
532 502
533 return true; 503 return true;
534} 504}
535 505
536bool 506bool
537maptile::_load_objects (const char *path, bool skip_header) 507maptile::_load_objects (const char *path, bool skip_header)
538{ 508{
539 object_thawer thawer (path); 509 object_thawer f (path);
540 510
541 if (!thawer) 511 if (!f)
542 return false; 512 return false;
513
514 f.next ();
543 515
544 if (skip_header) 516 if (skip_header)
545 for (;;) 517 for (;;)
546 { 518 {
547 keyword kw = thawer.get_kv (); 519 keyword kw = f.kw;
548 520 f.skip ();
549 if (kw == KW_end) 521 if (kw == KW_end)
550 break; 522 break;
551
552 thawer.skip_kv (kw);
553 } 523 }
554 524
555 return _load_objects (thawer); 525 return _load_objects (f);
556} 526}
557 527
558bool 528bool
559maptile::_save_objects (const char *path, int flags) 529maptile::_save_objects (const char *path, int flags)
560{ 530{
… …
569maptile::maptile () 539maptile::maptile ()
570{ 540{
571 in_memory = MAP_SWAPPED; 541 in_memory = MAP_SWAPPED;
572 542
573 /* The maps used to pick up default x and y values from the 543 /* The maps used to pick up default x and y values from the
574 * map archetype. Mimic that behaviour. 544 * map archetype. Mimic that behaviour.
575 */ 545 */
576 width = 16; 546 width = 16;
577 height = 16; 547 height = 16;
578 reset_timeout = 0;
579 timeout = 300; 548 timeout = 300;
580 enter_x = 0; 549 max_nrof = 1000; // 1000 items of anything
581 enter_y = 0; 550 max_volume = 2000000; // 2m³
582} 551}
583 552
584maptile::maptile (int w, int h) 553maptile::maptile (int w, int h)
585{ 554{
586 in_memory = MAP_SWAPPED; 555 in_memory = MAP_SWAPPED;
… …
740 { 709 {
741 keyword kw = thawer.get_kv (); 710 keyword kw = thawer.get_kv ();
742 711
743 switch (kw) 712 switch (kw)
744 { 713 {
745 case KW_EOF:
746 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
747 return false;
748
749 case KW_end:
750 return true;
751
752 default:
753 case KW_ERROR:
754 LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword);
755 break;
756
757 case KW_msg: 714 case KW_msg:
758 thawer.get_ml (KW_endmsg, msg); 715 thawer.get_ml (KW_endmsg, msg);
759 break; 716 break;
760 717
761 case KW_lore: // CF+ extension 718 case KW_lore: // CF+ extension
… …
793 case KW_sky: thawer.get (sky); break; 750 case KW_sky: thawer.get (sky); break;
794 751
795 case KW_per_player: thawer.get (per_player); break; 752 case KW_per_player: thawer.get (per_player); break;
796 case KW_per_party: thawer.get (per_party); break; 753 case KW_per_party: thawer.get (per_party); break;
797 754
798 case KW_region: get_region_by_name (thawer.get_str ()); break; 755 case KW_region: default_region = region::find (thawer.get_str ()); break;
799 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 756 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
800 757
801 // old names new names 758 // old names new names
802 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 759 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
803 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 760 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
811 768
812 case KW_tile_path_1: thawer.get (tile_path [0]); break; 769 case KW_tile_path_1: thawer.get (tile_path [0]); break;
813 case KW_tile_path_2: thawer.get (tile_path [1]); break; 770 case KW_tile_path_2: thawer.get (tile_path [1]); break;
814 case KW_tile_path_3: thawer.get (tile_path [2]); break; 771 case KW_tile_path_3: thawer.get (tile_path [2]); break;
815 case KW_tile_path_4: thawer.get (tile_path [3]); break; 772 case KW_tile_path_4: thawer.get (tile_path [3]); break;
773
774 case KW_end:
775 return true;
776
777 default:
778 if (!thawer.parse_error ("map", 0))
779 return false;
780 break;
816 } 781 }
817 } 782 }
818 783
819 abort (); 784 abort ();
820} 785}
… …
872 MAP_OUT (reset_time); 837 MAP_OUT (reset_time);
873 MAP_OUT (reset_timeout); 838 MAP_OUT (reset_timeout);
874 MAP_OUT (fixed_resettime); 839 MAP_OUT (fixed_resettime);
875 MAP_OUT (difficulty); 840 MAP_OUT (difficulty);
876 841
877 if (region) MAP_OUT2 (region, region->name); 842 if (default_region) MAP_OUT2 (region, default_region->name);
878 843
879 if (shopitems) 844 if (shopitems)
880 { 845 {
881 char shop[MAX_BUF]; 846 char shop[MAX_BUF];
882 print_shop_string (this, shop); 847 print_shop_string (this, shop);
… …
933 * Remove and free all objects in the given map. 898 * Remove and free all objects in the given map.
934 */ 899 */
935void 900void
936maptile::clear () 901maptile::clear ()
937{ 902{
903 sfree (regions, size ()), regions = 0;
904 free (regionmap), regionmap = 0;
905
938 if (!spaces) 906 if (spaces)
939 return; 907 {
940
941 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 908 for (mapspace *ms = spaces + size (); ms-- > spaces; )
942 while (object *op = ms->bot) 909 while (object *op = ms->bot)
943 { 910 {
944 if (op->head) 911 if (op->head)
945 op = op->head; 912 op = op->head;
946 913
947 op->destroy_inv (false); 914 op->destroy_inv (false);
948 op->destroy (); 915 op->destroy ();
949 } 916 }
950 917
951 sfree (spaces, size ()), spaces = 0; 918 sfree (spaces, size ()), spaces = 0;
919 }
952 920
953 if (buttons) 921 if (buttons)
954 free_objectlinkpt (buttons), buttons = 0; 922 free_objectlinkpt (buttons), buttons = 0;
955} 923}
956 924
… …
1110 */ 1078 */
1111void 1079void
1112mapspace::update_ () 1080mapspace::update_ ()
1113{ 1081{
1114 object *tmp, *last = 0; 1082 object *tmp, *last = 0;
1115 uint8 flags = 0, light = 0, anywhere = 0; 1083 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1116 New_Face *top, *floor, *middle; 1084 facetile *top, *floor, *middle;
1117 object *top_obj, *floor_obj, *middle_obj; 1085 object *top_obj, *floor_obj, *middle_obj;
1118 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1086 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1119 1087
1120 middle = blank_face; 1088 middle = blank_face;
1121 top = blank_face; 1089 top = blank_face;
… …
1278 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1246 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
1279 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1247 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
1280 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1248 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1281} 1249}
1282 1250
1251uint64
1252mapspace::volume () const
1253{
1254 uint64 vol = 0;
1255
1256 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1257 vol += op->volume ();
1258
1259 return vol;
1260}
1261
1283/* this updates the orig_map->tile_map[tile_num] value after finding 1262/* this updates the orig_map->tile_map[tile_num] value after finding
1284 * the map. It also takes care of linking back the freshly found 1263 * the map. It also takes care of linking back the freshly found
1285 * maps tile_map values if it tiles back to this one. It returns 1264 * maps tile_map values if it tiles back to this one. It returns
1286 * the value of orig_map->tile_map[tile_num]. 1265 * the value of orig_map->tile_map[tile_num].
1287 */ 1266 */
… …
1450 1429
1451/** 1430/**
1452 * Return whether map2 is adjacent to map1. If so, store the distance from 1431 * Return whether map2 is adjacent to map1. If so, store the distance from
1453 * map1 to map2 in dx/dy. 1432 * map1 to map2 in dx/dy.
1454 */ 1433 */
1455static int 1434int
1456adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1435adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1457{ 1436{
1458 if (!map1 || !map2) 1437 if (!map1 || !map2)
1459 return 0; 1438 return 0;
1460 1439
… …
1551/* From map.c 1530/* From map.c
1552 * This is used by get_player to determine where the other 1531 * This is used by get_player to determine where the other
1553 * creature is. get_rangevector takes into account map tiling, 1532 * creature is. get_rangevector takes into account map tiling,
1554 * so you just can not look the the map coordinates and get the 1533 * so you just can not look the the map coordinates and get the
1555 * righte value. distance_x/y are distance away, which 1534 * righte value. distance_x/y are distance away, which
1556 * can be negativbe. direction is the crossfire direction scheme 1535 * can be negative. direction is the crossfire direction scheme
1557 * that the creature should head. part is the part of the 1536 * that the creature should head. part is the part of the
1558 * monster that is closest. 1537 * monster that is closest.
1559 * 1538 *
1560 * get_rangevector looks at op1 and op2, and fills in the 1539 * get_rangevector looks at op1 and op2, and fills in the
1561 * structure for op1 to get to op2. 1540 * structure for op1 to get to op2.
… …
1572get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1551get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1573{ 1552{
1574 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1553 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1575 { 1554 {
1576 /* be conservative and fill in _some_ data */ 1555 /* be conservative and fill in _some_ data */
1577 retval->distance = 100000; 1556 retval->distance = 10000;
1578 retval->distance_x = 32767; 1557 retval->distance_x = 10000;
1579 retval->distance_y = 32767; 1558 retval->distance_y = 10000;
1580 retval->direction = 0; 1559 retval->direction = 0;
1581 retval->part = 0; 1560 retval->part = 0;
1582 } 1561 }
1583 else 1562 else
1584 { 1563 {
… …
1589 1568
1590 best = op1; 1569 best = op1;
1591 /* If this is multipart, find the closest part now */ 1570 /* If this is multipart, find the closest part now */
1592 if (!(flags & 0x1) && op1->more) 1571 if (!(flags & 0x1) && op1->more)
1593 { 1572 {
1594 object *tmp;
1595 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1573 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1596 1574
1597 /* we just take the offset of the piece to head to figure 1575 /* we just take the offset of the piece to head to figure
1598 * distance instead of doing all that work above again 1576 * distance instead of doing all that work above again
1599 * since the distance fields we set above are positive in the 1577 * since the distance fields we set above are positive in the
1600 * same axis as is used for multipart objects, the simply arithmetic 1578 * same axis as is used for multipart objects, the simply arithmetic
1601 * below works. 1579 * below works.
1602 */ 1580 */
1603 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1581 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1604 { 1582 {
1605 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1583 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1606 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1584 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1607 if (tmpi < best_distance) 1585 if (tmpi < best_distance)
1608 { 1586 {
1609 best_distance = tmpi; 1587 best_distance = tmpi;
1610 best = tmp; 1588 best = tmp;
1611 } 1589 }
1612 } 1590 }
1591
1613 if (best != op1) 1592 if (best != op1)
1614 { 1593 {
1615 retval->distance_x += op1->x - best->x; 1594 retval->distance_x += op1->x - best->x;
1616 retval->distance_y += op1->y - best->y; 1595 retval->distance_y += op1->y - best->y;
1617 } 1596 }
1618 } 1597 }
1598
1619 retval->part = best; 1599 retval->part = best;
1620 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1600 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1621 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1601 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1622 } 1602 }
1623} 1603}
1624 1604
1625/* this is basically the same as get_rangevector above, but instead of 1605/* this is basically the same as get_rangevector above, but instead of
… …
1630 * flags has no meaning for this function at this time - I kept it in to 1610 * flags has no meaning for this function at this time - I kept it in to
1631 * be more consistant with the above function and also in case they are needed 1611 * be more consistant with the above function and also in case they are needed
1632 * for something in the future. Also, since no object is pasted, the best 1612 * for something in the future. Also, since no object is pasted, the best
1633 * field of the rv_vector is set to NULL. 1613 * field of the rv_vector is set to NULL.
1634 */ 1614 */
1635
1636void 1615void
1637get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1616get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1638{ 1617{
1639 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1618 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1640 { 1619 {
1641 /* be conservative and fill in _some_ data */ 1620 /* be conservative and fill in _some_ data */
1642 retval->distance = 100000; 1621 retval->distance = 100000;
… …
1649 { 1628 {
1650 retval->distance_x += op2->x - x; 1629 retval->distance_x += op2->x - x;
1651 retval->distance_y += op2->y - y; 1630 retval->distance_y += op2->y - y;
1652 1631
1653 retval->part = NULL; 1632 retval->part = NULL;
1654 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1633 retval->distance = idistance (retval->distance_x, retval->distance_y);
1655 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1634 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1656 } 1635 }
1657} 1636}
1658 1637
1659/* Returns true of op1 and op2 are effectively on the same map 1638/* Returns true of op1 and op2 are effectively on the same map
… …
1679 op->remove (); 1658 op->remove ();
1680 1659
1681 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1660 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1682} 1661}
1683 1662
1663region *
1664maptile::region (int x, int y) const
1665{
1666 if (regions
1667 && regionmap
1668 && !OUT_OF_REAL_MAP (this, x, y))
1669 if (struct region *reg = regionmap [regions [y * width + x]])
1670 return reg;
1671
1672 if (default_region)
1673 return default_region;
1674
1675 return ::region::default_region ();
1676}
1677
1678

Diff Legend

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