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; |
… | |
… | |
273 | |
276 | |
274 | /* don't have object, so don't know what types would block */ |
277 | /* don't have object, so don't know what types would block */ |
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 = (archetype *)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; |
… | |
… | |
344 | } |
347 | } |
345 | |
348 | |
346 | /* link_multipart_objects go through all the objects on the map looking |
349 | /* link_multipart_objects go through all the objects on the map looking |
347 | * for objects whose arch says they are multipart yet according to the |
350 | * for objects whose arch says they are multipart yet according to the |
348 | * info we have, they only have the head (as would be expected when |
351 | * info we have, they only have the head (as would be expected when |
349 | * they are saved). We do have to look for the old maps that did save |
352 | * they are saved). |
350 | * the more sections and not re-add sections for them. |
|
|
351 | */ |
353 | */ |
352 | void |
354 | void |
353 | maptile::link_multipart_objects () |
355 | maptile::link_multipart_objects () |
354 | { |
356 | { |
355 | if (!spaces) |
357 | if (!spaces) |
356 | return; |
358 | return; |
357 | |
359 | |
358 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
360 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
359 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
361 | for (object *op = ms->bot; op; op = op->above) |
360 | { |
362 | { |
361 | /* already multipart - don't do anything more */ |
363 | /* already multipart - don't do anything more */ |
362 | if (!tmp->head && !tmp->more) |
364 | if (op->head_ () == op && !op->more && op->arch->more) |
363 | { |
365 | { |
364 | /* If there is nothing more to this object, this for loop |
366 | op->remove (); |
365 | * won't do anything. |
367 | op->expand_tail (); |
366 | */ |
|
|
367 | archetype *at; |
|
|
368 | object *last, *op; |
|
|
369 | for (at = tmp->arch->more, last = tmp; |
|
|
370 | at; |
|
|
371 | at = at->more, last = op) |
|
|
372 | { |
|
|
373 | op = arch_to_object (at); |
|
|
374 | |
|
|
375 | /* update x,y coordinates */ |
|
|
376 | op->x += tmp->x; |
|
|
377 | op->y += tmp->y; |
|
|
378 | op->head = tmp; |
|
|
379 | op->map = this; |
|
|
380 | last->more = op; |
|
|
381 | op->name = tmp->name; |
|
|
382 | op->title = tmp->title; |
|
|
383 | |
|
|
384 | /* we could link all the parts onto tmp, and then just |
|
|
385 | * call insert_ob_in_map once, but the effect is the same, |
|
|
386 | * as insert_ob_in_map will call itself with each part, and |
|
|
387 | * the coding is simpler to just to it here with each part. |
|
|
388 | */ |
|
|
389 | 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); |
390 | } |
|
|
391 | } |
369 | } |
392 | } |
370 | } |
393 | } |
371 | } |
394 | |
372 | |
395 | /* |
373 | /* |
… | |
… | |
399 | bool |
377 | bool |
400 | maptile::_load_objects (object_thawer &f) |
378 | maptile::_load_objects (object_thawer &f) |
401 | { |
379 | { |
402 | for (;;) |
380 | for (;;) |
403 | { |
381 | { |
404 | coroapi::cede_every (1000); // cede once in a while |
382 | coroapi::cede_to_tick_every (100); // cede once in a while |
405 | |
383 | |
406 | switch (f.kw) |
384 | switch (f.kw) |
407 | { |
385 | { |
408 | case KW_arch: |
386 | case KW_arch: |
409 | if (object *op = object::read (f, this)) |
387 | if (object *op = object::read (f, this)) |
… | |
… | |
432 | } |
410 | } |
433 | |
411 | |
434 | void |
412 | void |
435 | maptile::activate () |
413 | maptile::activate () |
436 | { |
414 | { |
|
|
415 | active = true; |
|
|
416 | |
437 | if (!spaces) |
417 | if (spaces) |
438 | return; |
|
|
439 | |
|
|
440 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
418 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
441 | for (object *op = ms->bot; op; op = op->above) |
419 | for (object *op = ms->bot; op; op = op->above) |
442 | op->activate_recursive (); |
420 | op->activate_recursive (); |
443 | } |
421 | } |
444 | |
422 | |
445 | void |
423 | void |
446 | maptile::deactivate () |
424 | maptile::deactivate () |
447 | { |
425 | { |
|
|
426 | active = false; |
|
|
427 | |
448 | if (!spaces) |
428 | if (spaces) |
449 | return; |
|
|
450 | |
|
|
451 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
429 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
452 | for (object *op = ms->bot; op; op = op->above) |
430 | for (object *op = ms->bot; op; op = op->above) |
453 | op->deactivate_recursive (); |
431 | op->deactivate_recursive (); |
454 | } |
432 | } |
455 | |
433 | |
456 | bool |
434 | bool |
457 | maptile::_save_objects (object_freezer &f, int flags) |
435 | maptile::_save_objects (object_freezer &f, int flags) |
458 | { |
436 | { |
459 | static int cede_count = 0; |
437 | coroapi::cede_to_tick (); |
460 | |
438 | |
461 | if (flags & IO_HEADER) |
439 | if (flags & IO_HEADER) |
462 | _save_header (f); |
440 | _save_header (f); |
463 | |
441 | |
464 | if (!spaces) |
442 | if (!spaces) |
465 | return false; |
443 | return false; |
466 | |
444 | |
467 | for (int i = 0; i < size (); ++i) |
445 | for (int i = 0; i < size (); ++i) |
468 | { |
446 | { |
469 | if (cede_count >= 500) |
|
|
470 | { |
|
|
471 | cede_count = 0; |
|
|
472 | coroapi::cede (); |
|
|
473 | } |
|
|
474 | |
|
|
475 | int unique = 0; |
447 | int unique = 0; |
476 | for (object *op = spaces [i].bot; op; op = op->above) |
448 | for (object *op = spaces [i].bot; op; op = op->above) |
477 | { |
449 | { |
478 | // count per-object, but cede only when modification-safe |
|
|
479 | cede_count++; |
|
|
480 | |
|
|
481 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
450 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
482 | unique = 1; |
451 | unique = 1; |
483 | |
452 | |
484 | if (!op->can_map_save ()) |
453 | if (!op->can_map_save ()) |
485 | continue; |
454 | continue; |
… | |
… | |
491 | } |
460 | } |
492 | else if (flags & IO_OBJECTS) |
461 | else if (flags & IO_OBJECTS) |
493 | op->write (f); |
462 | op->write (f); |
494 | } |
463 | } |
495 | } |
464 | } |
|
|
465 | |
|
|
466 | coroapi::cede_to_tick (); |
496 | |
467 | |
497 | return true; |
468 | return true; |
498 | } |
469 | } |
499 | |
470 | |
500 | bool |
471 | bool |
… | |
… | |
699 | bool |
670 | bool |
700 | maptile::_load_header (object_thawer &thawer) |
671 | maptile::_load_header (object_thawer &thawer) |
701 | { |
672 | { |
702 | for (;;) |
673 | for (;;) |
703 | { |
674 | { |
704 | keyword kw = thawer.get_kv (); |
675 | thawer.next (); |
705 | |
676 | |
706 | switch (kw) |
677 | switch (thawer.kw) |
707 | { |
678 | { |
708 | case KW_msg: |
679 | case KW_msg: |
709 | thawer.get_ml (KW_endmsg, msg); |
680 | thawer.get_ml (KW_endmsg, msg); |
710 | break; |
681 | break; |
711 | |
682 | |
… | |
… | |
805 | object *above = op->above; |
776 | object *above = op->above; |
806 | |
777 | |
807 | 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)) |
808 | unique = 1; |
779 | unique = 1; |
809 | |
780 | |
810 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
781 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
811 | { |
782 | { |
812 | op->destroy_inv (false); |
783 | op->destroy_inv (false); |
813 | op->destroy (); |
784 | op->destroy (); |
814 | } |
785 | } |
815 | |
786 | |
… | |
… | |
900 | if (spaces) |
871 | if (spaces) |
901 | { |
872 | { |
902 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
873 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
903 | while (object *op = ms->bot) |
874 | while (object *op = ms->bot) |
904 | { |
875 | { |
905 | if (op->head) |
|
|
906 | op = op->head; |
876 | op = op->head_ (); |
907 | |
|
|
908 | op->destroy_inv (false); |
877 | op->destroy_inv (false); |
909 | op->destroy (); |
878 | op->destroy (); |
910 | } |
879 | } |
911 | |
880 | |
912 | sfree (spaces, size ()), spaces = 0; |
881 | sfree (spaces, size ()), spaces = 0; |
… | |
… | |
1008 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
977 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
1009 | { |
978 | { |
1010 | total_exp += op->stats.exp; |
979 | total_exp += op->stats.exp; |
1011 | |
980 | |
1012 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
981 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
1013 | total_exp += at->clone.stats.exp * 8; |
982 | total_exp += at->stats.exp * 8; |
1014 | |
983 | |
1015 | monster_cnt++; |
984 | monster_cnt++; |
1016 | } |
985 | } |
1017 | } |
986 | } |
1018 | |
987 | |