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.100 by root, Tue Apr 17 10:06:32 2007 UTC vs.
Revision 1.107 by root, Mon Jun 4 13:04:00 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software; you can redistribute it and/or modify it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * 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, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * 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 along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 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 to <crossfire@schmorp.de>
23 */ 23 */
24 24
25#include <unistd.h> 25#include <unistd.h>
26 26
27#include "global.h" 27#include "global.h"
174 * let the player through (inventory checkers for example) 174 * let the player through (inventory checkers for example)
175 */ 175 */
176 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 176 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
177 return 0; 177 return 0;
178 178
179 if (ob->head != NULL)
180 ob = ob->head; 179 ob = ob->head_ ();
181 180
182 /* We basically go through the stack of objects, and if there is 181 /* We basically go through the stack of objects, and if there is
183 * some other object that has NO_PASS or FLAG_ALIVE set, return 182 * some other object that has NO_PASS or FLAG_ALIVE set, return
184 * true. If we get through the entire stack, that must mean 183 * true. If we get through the entire stack, that must mean
185 * ob is blocking it, so return 0. 184 * ob is blocking it, so return 0.
215 else 214 else
216 { 215 {
217 /* Broke apart a big nasty if into several here to make 216 /* Broke apart a big nasty if into several here to make
218 * this more readable. first check - if the space blocks 217 * this more readable. first check - if the space blocks
219 * movement, can't move here. 218 * movement, can't move here.
220 * second - if a monster, can't move there, unles it is a 219 * second - if a monster, can't move there, unless it is a
221 * hidden dm 220 * hidden dm
222 */ 221 */
223 if (OB_MOVE_BLOCK (ob, tmp)) 222 if (OB_MOVE_BLOCK (ob, tmp))
224 return 1; 223 return 1;
225 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 224
226 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 225 if (tmp->flag [FLAG_ALIVE]
226 && tmp->head_ () != ob
227 && tmp != ob
228 && tmp->type != DOOR
229 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
227 return 1; 230 return 1;
228 } 231 }
229 232
230 } 233 }
231 return 0; 234 return 0;
275 return m1->at (sx, sy).move_block; 278 return m1->at (sx, sy).move_block;
276 } 279 }
277 280
278 for (tmp = ob->arch; tmp; tmp = tmp->more) 281 for (tmp = ob->arch; tmp; tmp = tmp->more)
279 { 282 {
280 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); 283 flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
281 284
282 if (flag & P_OUT_OF_MAP) 285 if (flag & P_OUT_OF_MAP)
283 return P_OUT_OF_MAP; 286 return P_OUT_OF_MAP;
284 if (flag & P_IS_ALIVE) 287 if (flag & P_IS_ALIVE)
285 return P_IS_ALIVE; 288 return P_IS_ALIVE;
353{ 356{
354 if (!spaces) 357 if (!spaces)
355 return; 358 return;
356 359
357 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 360 for (mapspace *ms = spaces + size (); ms-- > spaces; )
358 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 361 for (object *op = ms->bot; op; op = op->above)
359 { 362 {
360 /* already multipart - don't do anything more */ 363 /* already multipart - don't do anything more */
361 if (!tmp->head && !tmp->more) 364 if (op->head_ () == op && !op->more && op->arch->more)
362 { 365 {
363 /* If there is nothing more to this object, this for loop 366 op->remove ();
364 * won't do anything. 367 op->expand_tail ();
365 */
366 archetype *at;
367 object *last, *op;
368 for (at = tmp->arch->more, last = tmp;
369 at;
370 at = at->more, last = op)
371 {
372 op = arch_to_object (at);
373
374 /* update x,y coordinates */
375 op->x += tmp->x;
376 op->y += tmp->y;
377 op->head = tmp;
378 op->map = this;
379 last->more = op;
380 op->name = tmp->name;
381 op->title = tmp->title;
382
383 /* we could link all the parts onto tmp, and then just
384 * call insert_ob_in_map once, but the effect is the same,
385 * as insert_ob_in_map will call itself with each part, and
386 * the coding is simpler to just to it here with each part.
387 */
388 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 368 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON);
389 }
390 } 369 }
391 } 370 }
392} 371}
393 372
394/* 373/*
431} 410}
432 411
433void 412void
434maptile::activate () 413maptile::activate ()
435{ 414{
415 active = true;
416
436 if (!spaces) 417 if (spaces)
437 return;
438
439 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 418 for (mapspace *ms = spaces + size (); ms-- > spaces; )
440 for (object *op = ms->bot; op; op = op->above) 419 for (object *op = ms->bot; op; op = op->above)
441 op->activate_recursive (); 420 op->activate_recursive ();
442} 421}
443 422
444void 423void
445maptile::deactivate () 424maptile::deactivate ()
446{ 425{
426 active = false;
427
447 if (!spaces) 428 if (spaces)
448 return;
449
450 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 429 for (mapspace *ms = spaces + size (); ms-- > spaces; )
451 for (object *op = ms->bot; op; op = op->above) 430 for (object *op = ms->bot; op; op = op->above)
452 op->deactivate_recursive (); 431 op->deactivate_recursive ();
453} 432}
454 433
455bool 434bool
456maptile::_save_objects (object_freezer &f, int flags) 435maptile::_save_objects (object_freezer &f, int flags)
457{ 436{
691bool 670bool
692maptile::_load_header (object_thawer &thawer) 671maptile::_load_header (object_thawer &thawer)
693{ 672{
694 for (;;) 673 for (;;)
695 { 674 {
696 keyword kw = thawer.get_kv (); 675 thawer.next ();
697 676
698 switch (kw) 677 switch (thawer.kw)
699 { 678 {
700 case KW_msg: 679 case KW_msg:
701 thawer.get_ml (KW_endmsg, msg); 680 thawer.get_ml (KW_endmsg, msg);
702 break; 681 break;
703 682
797 object *above = op->above; 776 object *above = op->above;
798 777
799 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 778 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
800 unique = 1; 779 unique = 1;
801 780
802 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 781 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
803 { 782 {
804 op->destroy_inv (false); 783 op->destroy_inv (false);
805 op->destroy (); 784 op->destroy ();
806 } 785 }
807 786
892 if (spaces) 871 if (spaces)
893 { 872 {
894 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 873 for (mapspace *ms = spaces + size (); ms-- > spaces; )
895 while (object *op = ms->bot) 874 while (object *op = ms->bot)
896 { 875 {
897 if (op->head)
898 op = op->head; 876 op = op->head_ ();
899
900 op->destroy_inv (false); 877 op->destroy_inv (false);
901 op->destroy (); 878 op->destroy ();
902 } 879 }
903 880
904 sfree (spaces, size ()), spaces = 0; 881 sfree (spaces, size ()), spaces = 0;
1000 if (QUERY_FLAG (op, FLAG_GENERATOR)) 977 if (QUERY_FLAG (op, FLAG_GENERATOR))
1001 { 978 {
1002 total_exp += op->stats.exp; 979 total_exp += op->stats.exp;
1003 980
1004 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 981 if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
1005 total_exp += at->clone.stats.exp * 8; 982 total_exp += at->stats.exp * 8;
1006 983
1007 monster_cnt++; 984 monster_cnt++;
1008 } 985 }
1009 } 986 }
1010 987

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines