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.185 by root, Sun Apr 11 04:09:56 2010 UTC vs.
Revision 1.208 by root, Sat May 7 10:50:35 2011 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
… …
77 /* Make sure the coordinates are valid - they should be, as caller should 77 /* Make sure the coordinates are valid - they should be, as caller should
78 * have already checked this. 78 * have already checked this.
79 */ 79 */
80 if (OUT_OF_REAL_MAP (m, sx, sy)) 80 if (OUT_OF_REAL_MAP (m, sx, sy))
81 { 81 {
82 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); 82 LOG (llevError | logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n");
83 return 1; 83 return 1;
84 } 84 }
85 85
86 mapspace &ms = m->at (sx, sy); 86 mapspace &ms = m->at (sx, sy);
87 87
… …
90 90
91 /* If space is currently not blocked by anything, no need to 91 /* If space is currently not blocked by anything, no need to
92 * go further. Not true for players - all sorts of special 92 * go further. Not true for players - all sorts of special
93 * things we need to do for players. 93 * things we need to do for players.
94 */ 94 */
95 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 95 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
96 return 0; 96 return 0;
97 97
98 /* if there isn't anything alive on this space, and this space isn't 98 /* if there isn't anything alive on this space, and this space isn't
99 * otherwise blocked, we can return now. Only if there is a living 99 * otherwise blocked, we can return now. Only if there is a living
100 * creature do we need to investigate if it is part of this creature 100 * creature do we need to investigate if it is part of this creature
… …
110 /* We basically go through the stack of objects, and if there is 110 /* We basically go through the stack of objects, and if there is
111 * some other object that has NO_PASS or FLAG_ALIVE set, return 111 * some other object that has NO_PASS or FLAG_ALIVE set, return
112 * true. If we get through the entire stack, that must mean 112 * true. If we get through the entire stack, that must mean
113 * ob is blocking it, so return 0. 113 * ob is blocking it, so return 0.
114 */ 114 */
115 for (object *tmp = ms.bot; tmp; tmp = tmp->above) 115 for (object *tmp = ms.top; tmp; tmp = tmp->below)
116 { 116 {
117 if (OB_MOVE_BLOCK (ob, tmp)) 117 if (OB_MOVE_BLOCK (ob, tmp))
118 { 118 {
119 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) 119 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
120 if (RESULT_INT (0)) 120 if (RESULT_INT (0))
… …
144 return 1; // unconditional block 144 return 1; // unconditional block
145 145
146 } else { 146 } else {
147 // space does not block the ob, directly, but 147 // space does not block the ob, directly, but
148 // anything alive that is not a door still 148 // anything alive that is not a door still
149 // blocks anything but wizards. 149 // blocks anything
150 150
151 if (tmp->flag [FLAG_ALIVE] 151 if (tmp->flag [FLAG_ALIVE]
152 && tmp->head_ () != ob
153 && tmp != ob
154 && tmp->type != DOOR) 152 && tmp->type != DOOR
153 && tmp->head_ () != ob) //TODO: maybe move these check up?
155 return 1; 154 return 1;
156 } 155 }
157 } 156 }
158 157
159 return 0; 158 return 0;
160} 159}
161 160
162/* 161/*
163 * Returns qthe blocking object if the given object can't fit in the given 162 * Returns the blocking object if the given object can't fit in the given
164 * spot. This is meant for multi space objects - for single space objecs, 163 * spot. This is meant for multi space objects - for single space objecs,
165 * just calling get_map_blocked and checking that against movement type 164 * just calling get_map_blocked and checking that against movement type
166 * of object. This function goes through all the parts of the multipart 165 * of object. This function goes through all the parts of the multipart
167 * object and makes sure they can be inserted. 166 * object and makes sure they can be inserted.
168 * 167 *
… …
312 case KW_arch: 311 case KW_arch:
313 if (object *op = object::read (f, this)) 312 if (object *op = object::read (f, this))
314 { 313 {
315 // TODO: why? 314 // TODO: why?
316 if (op->inv) 315 if (op->inv)
316 {
317 op->carrying = 0;
317 op->update_weight (); 318 op->update_weight ();
319 }
318 320
319 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) 321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
320 { 322 {
321 // we insert manually because 323 // we insert manually because
322 // a) its way faster 324 // a) its way faster
… …
359} 361}
360 362
361void 363void
362maptile::activate () 364maptile::activate ()
363{ 365{
364 if (spaces) 366 if (state != MAP_INACTIVE)
367 return;
368
365 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 369 for (mapspace *ms = spaces + size (); ms-- > spaces; )
366 for (object *op = ms->bot; op; op = op->above) 370 for (object *op = ms->bot; op; op = op->above)
367 op->activate_recursive (); 371 op->activate_recursive ();
372
373 state = MAP_ACTIVE;
374
375 activate_physics ();
368} 376}
369 377
370void 378void
371maptile::deactivate () 379maptile::deactivate ()
372{ 380{
373 if (spaces) 381 if (state != MAP_ACTIVE)
382 return;
383
374 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 384 for (mapspace *ms = spaces + size (); ms-- > spaces; )
375 for (object *op = ms->bot; op; op = op->above) 385 for (object *op = ms->bot; op; op = op->above)
376 op->deactivate_recursive (); 386 op->deactivate_recursive ();
387
388 state = MAP_INACTIVE;
377} 389}
378 390
379bool 391bool
380maptile::_save_objects (object_freezer &f, int flags) 392maptile::_save_objects (object_freezer &f, int flags)
381{ 393{
… …
422 return false; 434 return false;
423 435
424 return freezer.save (path); 436 return freezer.save (path);
425} 437}
426 438
427maptile::maptile () 439void
440maptile::init ()
428{ 441{
429 in_memory = MAP_SWAPPED; 442 state = MAP_SWAPPED;
430 443
431 /* The maps used to pick up default x and y values from the 444 /* The maps used to pick up default x and y values from the
432 * map archetype. Mimic that behaviour. 445 * map archetype. Mimic that behaviour.
433 */ 446 */
434 width = 16; 447 width = 16;
435 height = 16; 448 height = 16;
436 timeout = 300; 449 timeout = 300;
437 max_items = MAX_ITEM_PER_ACTION; 450 max_items = MAX_ITEM_PER_ACTION;
438 max_volume = 2000000; // 2m³ 451 max_volume = 2000000; // 2m³
439}
440
441maptile::maptile (int w, int h)
442{
443 in_memory = MAP_SWAPPED;
444
445 width = w;
446 height = h;
447 reset_timeout = 0; 452 reset_timeout = 0;
448 timeout = 300;
449 enter_x = 0; 453 enter_x = 0;
450 enter_y = 0; 454 enter_y = 0;
455}
456
457maptile::maptile ()
458{
459 init ();
460}
461
462maptile::maptile (int w, int h)
463{
464 init ();
465
466 width = w;
467 height = h;
451 468
452 alloc (); 469 alloc ();
453} 470}
454 471
455/* 472/*
… …
555 * the map (or something equivilent) into output_string. */ 572 * the map (or something equivilent) into output_string. */
556static const char * 573static const char *
557print_shop_string (maptile *m) 574print_shop_string (maptile *m)
558{ 575{
559 static dynbuf_text buf; buf.clear (); 576 static dynbuf_text buf; buf.clear ();
577 bool first = true;
560 578
561 for (int i = 0; i < m->shopitems[0].index; i++) 579 for (int i = 0; i < m->shopitems[0].index; i++)
562 { 580 {
581 if (!first)
582 buf << ';';
583
584 first = false;
585
563 if (m->shopitems[i].typenum) 586 if (m->shopitems[i].typenum)
564 { 587 {
565 if (m->shopitems[i].strength) 588 if (m->shopitems[i].strength)
566 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 589 buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
567 else 590 else
568 buf.printf ("%s;", m->shopitems[i].name); 591 buf.printf ("%s", m->shopitems[i].name);
569 } 592 }
570 else 593 else
571 { 594 {
572 if (m->shopitems[i].strength) 595 if (m->shopitems[i].strength)
573 buf.printf ("*:%d;", m->shopitems[i].strength); 596 buf.printf ("*:%d", m->shopitems[i].strength);
574 else 597 else
575 buf.printf ("*"); 598 buf.printf ("*");
576 } 599 }
577 } 600 }
578 601
… …
601 { 624 {
602 case KW_msg: 625 case KW_msg:
603 thawer.get_ml (KW_endmsg, msg); 626 thawer.get_ml (KW_endmsg, msg);
604 break; 627 break;
605 628
606 case KW_lore: // CF+ extension 629 case KW_lore: // deliantra extension
607 thawer.get_ml (KW_endlore, maplore); 630 thawer.get_ml (KW_endlore, maplore);
608 break; 631 break;
609 632
610 case KW_maplore: 633 case KW_maplore:
611 thawer.get_ml (KW_endmaplore, maplore); 634 thawer.get_ml (KW_endmaplore, maplore);
… …
634 case KW_per_player: thawer.get (per_player); break; 657 case KW_per_player: thawer.get (per_player); break;
635 case KW_per_party: thawer.get (per_party); break; 658 case KW_per_party: thawer.get (per_party); break;
636 case KW_no_reset: thawer.get (no_reset); break; 659 case KW_no_reset: thawer.get (no_reset); break;
637 case KW_no_drop: thawer.get (no_drop); break; 660 case KW_no_drop: thawer.get (no_drop); break;
638 661
639 case KW_region: default_region = region::find (thawer.get_str ()); break; 662 case KW_region: thawer.get (default_region); break;
640 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 663 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
641 664
642 // old names new names 665 // old names new names
643 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 666 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
644 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 667 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
652 675
653 case KW_tile_path_1: thawer.get (tile_path [0]); break; 676 case KW_tile_path_1: thawer.get (tile_path [0]); break;
654 case KW_tile_path_2: thawer.get (tile_path [1]); break; 677 case KW_tile_path_2: thawer.get (tile_path [1]); break;
655 case KW_tile_path_3: thawer.get (tile_path [2]); break; 678 case KW_tile_path_3: thawer.get (tile_path [2]); break;
656 case KW_tile_path_4: thawer.get (tile_path [3]); break; 679 case KW_tile_path_4: thawer.get (tile_path [3]); break;
680 case KW_tile_path_5: thawer.get (tile_path [4]); break;
681 case KW_tile_path_6: thawer.get (tile_path [5]); break;
657 682
658 case KW_ERROR: 683 case KW_ERROR:
659 set_key_text (thawer.kw_str, thawer.value); 684 set_key_text (thawer.kw_str, thawer.value);
660 break; 685 break;
661 686
662 case KW_end: 687 case KW_end:
663 thawer.next (); 688 thawer.next ();
664 return true; 689 return true;
665 690
666 default: 691 default:
667 if (!thawer.parse_error ("map", 0)) 692 if (!thawer.parse_error ("map"))
668 return false; 693 return false;
669 break; 694 break;
670 } 695 }
671 696
672 thawer.next (); 697 thawer.next ();
… …
744 769
745 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 770 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
746 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 771 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
747 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 772 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
748 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 773 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
774 if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]);
775 if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]);
749 776
750 freezer.put (this); 777 freezer.put (this);
751 freezer.put (KW(end)); 778 freezer.put (KW(end));
752 779
753 return true; 780 return true;
… …
810 msg = 0; 837 msg = 0;
811 maplore = 0; 838 maplore = 0;
812 shoprace = 0; 839 shoprace = 0;
813 delete [] shopitems, shopitems = 0; 840 delete [] shopitems, shopitems = 0;
814 841
815 for (int i = 0; i < 4; i++) 842 for (int i = 0; i < array_length (tile_path); i++)
816 tile_path [i] = 0; 843 tile_path [i] = 0;
817} 844}
818 845
819maptile::~maptile () 846maptile::~maptile ()
820{ 847{
… …
827 /* We need to look through all the maps and see if any maps 854 /* We need to look through all the maps and see if any maps
828 * are pointing at this one for tiling information. Since 855 * are pointing at this one for tiling information. Since
829 * tiling can be asymetric, we just can not look to see which 856 * tiling can be asymetric, we just can not look to see which
830 * maps this map tiles with and clears those. 857 * maps this map tiles with and clears those.
831 */ 858 */
832 for (int i = 0; i < 4; i++) 859 for (int i = 0; i < array_length (tile_path); i++)
833 if (tile_map[i] == m) 860 if (tile_map[i] == m)
834 tile_map[i] = 0; 861 tile_map[i] = 0;
835} 862}
836 863
837void 864void
… …
1180maptile * 1207maptile *
1181maptile::tile_available (int dir, bool load) 1208maptile::tile_available (int dir, bool load)
1182{ 1209{
1183 if (tile_path[dir]) 1210 if (tile_path[dir])
1184 { 1211 {
1212 // map is there and we don't need to load it OR it's loaded => return what we have
1185 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) 1213 if (tile_map[dir] && (!load || tile_map[dir]->linkable ()))
1186 return tile_map[dir]; 1214 return tile_map[dir];
1187 1215
1216 // well, try to locate it then, if possible - maybe it's there already
1188 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1217 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1189 return tile_map[dir]; 1218 return tile_map[dir];
1190 } 1219 }
1191 1220
1192 return 0; 1221 return 0;
… …
1304/** 1333/**
1305 * Return whether map2 is adjacent to map1. If so, store the distance from 1334 * Return whether map2 is adjacent to map1. If so, store the distance from
1306 * map1 to map2 in dx/dy. 1335 * map1 to map2 in dx/dy.
1307 */ 1336 */
1308int 1337int
1309adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1338adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy)
1310{ 1339{
1311 if (!map1 || !map2) 1340 if (!map1 || !map2)
1312 return 0; 1341 return 0;
1313 1342
1314 //TODO: this doesn't actually check correctly when intermediate maps are not loaded 1343 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
… …
1316 if (map1 == map2) 1345 if (map1 == map2)
1317 { 1346 {
1318 *dx = 0; 1347 *dx = 0;
1319 *dy = 0; 1348 *dy = 0;
1320 } 1349 }
1321 else if (map1->tile_map[0] == map2) 1350 else if (map1->tile_available (TILE_NORTH, false) == map2)
1322 { /* up */ 1351 {
1323 *dx = 0; 1352 *dx = 0;
1324 *dy = -map2->height; 1353 *dy = -map2->height;
1325 } 1354 }
1326 else if (map1->tile_map[1] == map2) 1355 else if (map1->tile_available (TILE_EAST , false) == map2)
1327 { /* right */ 1356 {
1328 *dx = map1->width; 1357 *dx = map1->width;
1329 *dy = 0; 1358 *dy = 0;
1330 } 1359 }
1331 else if (map1->tile_map[2] == map2) 1360 else if (map1->tile_available (TILE_SOUTH, false) == map2)
1332 { /* down */ 1361 {
1333 *dx = 0; 1362 *dx = 0;
1334 *dy = map1->height; 1363 *dy = map1->height;
1335 } 1364 }
1336 else if (map1->tile_map[3] == map2) 1365 else if (map1->tile_available (TILE_WEST , false) == map2)
1337 { /* left */ 1366 {
1338 *dx = -map2->width; 1367 *dx = -map2->width;
1339 *dy = 0; 1368 *dy = 0;
1340 } 1369 }
1341 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) 1370 else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1342 { /* up right */ 1371 { /* up right */
1343 *dx = map1->tile_map[0]->width; 1372 *dx = +map1->tile_map[TILE_NORTH]->width;
1344 *dy = -map1->tile_map[0]->height; 1373 *dy = -map1->tile_map[TILE_NORTH]->height;
1345 } 1374 }
1346 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) 1375 else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1347 { /* up left */ 1376 { /* up left */
1348 *dx = -map2->width; 1377 *dx = -map2->width;
1349 *dy = -map1->tile_map[0]->height; 1378 *dy = -map1->tile_map[TILE_NORTH]->height;
1350 } 1379 }
1351 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) 1380 else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1352 { /* right up */ 1381 { /* right up */
1353 *dx = map1->width; 1382 *dx = +map1->width;
1354 *dy = -map2->height; 1383 *dy = -map2->height;
1355 } 1384 }
1356 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) 1385 else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1357 { /* right down */ 1386 { /* right down */
1358 *dx = map1->width; 1387 *dx = +map1->width;
1359 *dy = map1->tile_map[1]->height; 1388 *dy = +map1->tile_map[TILE_EAST]->height;
1360 } 1389 }
1361 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) 1390 else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1362 { /* down right */ 1391 { /* down right */
1363 *dx = map1->tile_map[2]->width; 1392 *dx = +map1->tile_map[TILE_SOUTH]->width;
1364 *dy = map1->height; 1393 *dy = +map1->height;
1365 } 1394 }
1366 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) 1395 else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1367 { /* down left */ 1396 { /* down left */
1368 *dx = -map2->width; 1397 *dx = -map2->width;
1369 *dy = map1->height; 1398 *dy = +map1->height;
1370 } 1399 }
1371 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) 1400 else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1372 { /* left up */ 1401 { /* left up */
1373 *dx = -map1->tile_map[3]->width; 1402 *dx = -map1->tile_map[TILE_WEST]->width;
1374 *dy = -map2->height; 1403 *dy = -map2->height;
1375 } 1404 }
1376 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) 1405 else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1377 { /* left down */ 1406 { /* left down */
1378 *dx = -map1->tile_map[3]->width; 1407 *dx = -map1->tile_map[TILE_WEST]->width;
1379 *dy = map1->tile_map[3]->height; 1408 *dy = +map1->tile_map[TILE_WEST]->height;
1380 } 1409 }
1381 else 1410 else
1382 return 0; 1411 return 0;
1383 1412
1384 return 1; 1413 return 1;
… …
1425get_rangevector (object *op1, object *op2, rv_vector *retval, int flags) 1454get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1426{ 1455{
1427 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1456 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1428 { 1457 {
1429 /* be conservative and fill in _some_ data */ 1458 /* be conservative and fill in _some_ data */
1430 retval->distance = 10000; 1459 retval->distance = 10000;
1431 retval->distance_x = 10000; 1460 retval->distance_x = 10000;
1432 retval->distance_y = 10000; 1461 retval->distance_y = 10000;
1433 retval->direction = 0; 1462 retval->direction = 0;
1434 retval->part = 0; 1463 retval->part = 0;
1435 } 1464 }
1436 else 1465 else
1437 { 1466 {
1438 retval->distance_x += op2->x - op1->x; 1467 retval->distance_x += op2->x - op1->x;
1439 retval->distance_y += op2->y - op1->y; 1468 retval->distance_y += op2->y - op1->y;
… …
1441 object *best = op1; 1470 object *best = op1;
1442 1471
1443 /* If this is multipart, find the closest part now */ 1472 /* If this is multipart, find the closest part now */
1444 if (!(flags & 1) && op1->more) 1473 if (!(flags & 1) && op1->more)
1445 { 1474 {
1446 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1475 int best_distance = idistance (retval->distance_x, retval->distance_y);
1447 1476
1448 /* we just take the offset of the piece to head to figure 1477 /* we just take the offset of the piece to head to figure
1449 * distance instead of doing all that work above again 1478 * distance instead of doing all that work above again
1450 * since the distance fields we set above are positive in the 1479 * since the distance fields we set above are positive in the
1451 * same axis as is used for multipart objects, the simply arithmetic 1480 * same axis as is used for multipart objects, the simply arithmetic
1452 * below works. 1481 * below works.
1453 */ 1482 */
1454 for (object *tmp = op1->more; tmp; tmp = tmp->more) 1483 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1455 { 1484 {
1456 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1485 int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1457 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1486
1458 if (tmpi < best_distance) 1487 if (tmpi < best_distance)
1459 { 1488 {
1460 best_distance = tmpi; 1489 best_distance = tmpi;
1461 best = tmp; 1490 best = tmp;
1462 } 1491 }
1463 } 1492 }
1464 1493
1465 if (best != op1) 1494 if (best != op1)
1466 { 1495 {
1467 retval->distance_x += op1->x - best->x; 1496 retval->distance_x += op1->x - best->x;
1468 retval->distance_y += op1->y - best->y; 1497 retval->distance_y += op1->y - best->y;
1469 } 1498 }
1470 } 1499 }
1471 1500
1472 retval->part = best; 1501 retval->part = best;
1473 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); 1502 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1474 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1503 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1475 } 1504 }
1476} 1505}
1477 1506
1478/* this is basically the same as get_rangevector above, but instead of 1507/* this is basically the same as get_rangevector above, but instead of
1479 * the first parameter being an object, it instead is the map 1508 * the first parameter being an object, it instead is the map
… …
1484 * be more consistant with the above function and also in case they are needed 1513 * be more consistant with the above function and also in case they are needed
1485 * for something in the future. Also, since no object is pasted, the best 1514 * for something in the future. Also, since no object is pasted, the best
1486 * field of the rv_vector is set to NULL. 1515 * field of the rv_vector is set to NULL.
1487 */ 1516 */
1488void 1517void
1489get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) 1518get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1490{ 1519{
1491 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1520 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1492 { 1521 {
1493 /* be conservative and fill in _some_ data */ 1522 /* be conservative and fill in _some_ data */
1494 retval->distance = 100000; 1523 retval->distance = 100000;
1495 retval->distance_x = 32767; 1524 retval->distance_x = 32767;
1496 retval->distance_y = 32767; 1525 retval->distance_y = 32767;
1497 retval->direction = 0; 1526 retval->direction = 0;
1498 retval->part = 0; 1527 retval->part = 0;
1499 } 1528 }
1500 else 1529 else
1501 { 1530 {
1502 retval->distance_x += op2->x - x; 1531 retval->distance_x += op2->x - x;
1503 retval->distance_y += op2->y - y; 1532 retval->distance_y += op2->y - y;
1504 1533
1505 retval->part = 0; 1534 retval->part = 0;
1506 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); 1535 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1507 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1536 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1508 } 1537 }
1509} 1538}
1510 1539
1511/* Returns true of op1 and op2 are effectively on the same map 1540/* Returns true of op1 and op2 are effectively on the same map
1512 * (as related to map tiling). Note that this looks for a path from 1541 * (as related to map tiling). Note that this looks for a path from
… …
1562 */ 1591 */
1563 for (int i = 1000; --i;) 1592 for (int i = 1000; --i;)
1564 { 1593 {
1565 object *pick = at (gen (width), gen (height)).bot; 1594 object *pick = at (gen (width), gen (height)).bot;
1566 1595
1567 // do not prefer big monsters just because they are big. 1596 // must be head: do not prefer big monsters just because they are big.
1568 if (pick && pick->is_head ()) 1597 if (pick && pick->is_head ())
1569 return pick->head_ (); 1598 return pick;
1570 } 1599 }
1571 1600
1572 // instead of crashing in the unlikely(?) case, try to return *something* 1601 // instead of crashing in the unlikely(?) case, try to return *something*
1573 return archetype::find (shstr_bug); 1602 return archetype::find (shstr_bug);
1574} 1603}
… …
1616split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) 1645split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1617{ 1646{
1618 // clip to map to the left 1647 // clip to map to the left
1619 if (x0 < 0) 1648 if (x0 < 0)
1620 { 1649 {
1621 if (maptile *tile = m->tile_available (TILE_LEFT, 1)) 1650 if (maptile *tile = m->tile_available (TILE_WEST, 1))
1622 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); 1651 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1623 1652
1624 if (x1 < 0) // entirely to the left 1653 if (x1 < 0) // entirely to the left
1625 return; 1654 return;
1626 1655
… …
1628 } 1657 }
1629 1658
1630 // clip to map to the right 1659 // clip to map to the right
1631 if (x1 > m->width) 1660 if (x1 > m->width)
1632 { 1661 {
1633 if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) 1662 if (maptile *tile = m->tile_available (TILE_EAST, 1))
1634 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); 1663 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1635 1664
1636 if (x0 > m->width) // entirely to the right 1665 if (x0 > m->width) // entirely to the right
1637 return; 1666 return;
1638 1667
… …
1640 } 1669 }
1641 1670
1642 // clip to map above 1671 // clip to map above
1643 if (y0 < 0) 1672 if (y0 < 0)
1644 { 1673 {
1645 if (maptile *tile = m->tile_available (TILE_UP, 1)) 1674 if (maptile *tile = m->tile_available (TILE_NORTH, 1))
1646 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); 1675 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1647 1676
1648 if (y1 < 0) // entirely above 1677 if (y1 < 0) // entirely above
1649 return; 1678 return;
1650 1679
… …
1652 } 1681 }
1653 1682
1654 // clip to map below 1683 // clip to map below
1655 if (y1 > m->height) 1684 if (y1 > m->height)
1656 { 1685 {
1657 if (maptile *tile = m->tile_available (TILE_DOWN, 1)) 1686 if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
1658 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); 1687 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1659 1688
1660 if (y0 > m->height) // entirely below 1689 if (y0 > m->height) // entirely below
1661 return; 1690 return;
1662 1691

Diff Legend

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