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.93 by root, Sun Mar 11 02:12:44 2007 UTC vs.
Revision 1.108 by root, Tue Jun 5 13:05:02 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;
… …
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 */
352void 354void
353maptile::link_multipart_objects () 355maptile::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/*
… …
399bool 377bool
400maptile::_load_objects (object_thawer &f) 378maptile::_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
434void 412void
435maptile::activate () 413maptile::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
445void 423void
446maptile::deactivate () 424maptile::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
456bool 434bool
457maptile::_save_objects (object_freezer &f, int flags) 435maptile::_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 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
470 if (cede_count >= 500)
471 {
472 cede_count = 0;
473 coroapi::cede ();
474 }
475#endif
476
477 int unique = 0; 447 int unique = 0;
478 for (object *op = spaces [i].bot; op; op = op->above) 448 for (object *op = spaces [i].bot; op; op = op->above)
479 { 449 {
480 // count per-object, but cede only when modification-safe
481 cede_count++;
482
483 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 450 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
484 unique = 1; 451 unique = 1;
485 452
486 if (!op->can_map_save ()) 453 if (!op->can_map_save ())
487 continue; 454 continue;
… …
493 } 460 }
494 else if (flags & IO_OBJECTS) 461 else if (flags & IO_OBJECTS)
495 op->write (f); 462 op->write (f);
496 } 463 }
497 } 464 }
465
466 coroapi::cede_to_tick ();
498 467
499 return true; 468 return true;
500} 469}
501 470
502bool 471bool
… …
701bool 670bool
702maptile::_load_header (object_thawer &thawer) 671maptile::_load_header (object_thawer &thawer)
703{ 672{
704 for (;;) 673 for (;;)
705 { 674 {
706 keyword kw = thawer.get_kv (); 675 thawer.next ();
707 676
708 switch (kw) 677 switch (thawer.kw)
709 { 678 {
710 case KW_msg: 679 case KW_msg:
711 thawer.get_ml (KW_endmsg, msg); 680 thawer.get_ml (KW_endmsg, msg);
712 break; 681 break;
713 682
… …
807 object *above = op->above; 776 object *above = op->above;
808 777
809 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))
810 unique = 1; 779 unique = 1;
811 780
812 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 781 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
813 { 782 {
814 op->destroy_inv (false); 783 op->destroy_inv (false);
815 op->destroy (); 784 op->destroy ();
816 } 785 }
817 786
… …
902 if (spaces) 871 if (spaces)
903 { 872 {
904 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 873 for (mapspace *ms = spaces + size (); ms-- > spaces; )
905 while (object *op = ms->bot) 874 while (object *op = ms->bot)
906 { 875 {
907 if (op->head)
908 op = op->head; 876 op = op->head_ ();
909
910 op->destroy_inv (false); 877 op->destroy_inv (false);
911 op->destroy (); 878 op->destroy ();
912 } 879 }
913 880
914 sfree (spaces, size ()), spaces = 0; 881 sfree (spaces, size ()), spaces = 0;
… …
1010 if (QUERY_FLAG (op, FLAG_GENERATOR)) 977 if (QUERY_FLAG (op, FLAG_GENERATOR))
1011 { 978 {
1012 total_exp += op->stats.exp; 979 total_exp += op->stats.exp;
1013 980
1014 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 981 if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
1015 total_exp += at->clone.stats.exp * 8; 982 total_exp += at->stats.exp * 8;
1016 983
1017 monster_cnt++; 984 monster_cnt++;
1018 } 985 }
1019 } 986 }
1020 987
… …
1075void 1042void
1076mapspace::update_ () 1043mapspace::update_ ()
1077{ 1044{
1078 object *tmp, *last = 0; 1045 object *tmp, *last = 0;
1079 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1046 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1080 faceidx top, floor, middle;
1081 object *top_obj, *floor_obj, *middle_obj;
1082 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1047 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1083 1048
1084 middle = blank_face; 1049 //object *middle = 0;
1085 top = blank_face; 1050 //object *top = 0;
1086 floor = blank_face; 1051 //object *floor = 0;
1087 1052 // this seems to generate better code than using locals, above
1088 middle_obj = 0; 1053 object *&top = faces_obj[0] = 0;
1089 top_obj = 0; 1054 object *&middle = faces_obj[1] = 0;
1090 floor_obj = 0; 1055 object *&floor = faces_obj[2] = 0;
1091 1056
1092 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1057 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1093 { 1058 {
1094 /* This could be made additive I guess (two lights better than 1059 /* This could be made additive I guess (two lights better than
1095 * one). But if so, it shouldn't be a simple additive - 2 1060 * one). But if so, it shouldn't be a simple additive - 2
… …
1108 * Always put the player down for drawing. 1073 * Always put the player down for drawing.
1109 */ 1074 */
1110 if (!tmp->invisible) 1075 if (!tmp->invisible)
1111 { 1076 {
1112 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1077 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1113 {
1114 top = tmp->face;
1115 top_obj = tmp; 1078 top = tmp;
1116 }
1117 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1079 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1118 { 1080 {
1119 /* If we got a floor, that means middle and top were below it, 1081 /* If we got a floor, that means middle and top were below it,
1120 * so should not be visible, so we clear them. 1082 * so should not be visible, so we clear them.
1121 */ 1083 */
1122 middle = blank_face; 1084 middle = 0;
1123 top = blank_face; 1085 top = 0;
1124 floor = tmp->face;
1125 floor_obj = tmp; 1086 floor = tmp;
1126 } 1087 }
1127 /* Flag anywhere have high priority */ 1088 /* Flag anywhere have high priority */
1128 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1089 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1129 { 1090 {
1130 middle = tmp->face;
1131
1132 middle_obj = tmp; 1091 middle = tmp;
1133 anywhere = 1; 1092 anywhere = 1;
1134 } 1093 }
1135 /* Find the highest visible face around. If equal 1094 /* Find the highest visible face around. If equal
1136 * visibilities, we still want the one nearer to the 1095 * visibilities, we still want the one nearer to the
1137 * top 1096 * top
1138 */ 1097 */
1139 else if (middle == blank_face || (::faces [tmp->face].visibility > ::faces [middle].visibility && !anywhere)) 1098 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1140 {
1141 middle = tmp->face;
1142 middle_obj = tmp; 1099 middle = tmp;
1143 }
1144 } 1100 }
1145 1101
1146 if (tmp == tmp->above) 1102 if (tmp == tmp->above)
1147 { 1103 {
1148 LOG (llevError, "Error in structure of map\n"); 1104 LOG (llevError, "Error in structure of map\n");
… …
1183 * middle face. This should not happen, as we already have the 1139 * middle face. This should not happen, as we already have the
1184 * else statement above so middle should not get set. OTOH, it 1140 * else statement above so middle should not get set. OTOH, it
1185 * may be possible for the faces to match but be different objects. 1141 * may be possible for the faces to match but be different objects.
1186 */ 1142 */
1187 if (top == middle) 1143 if (top == middle)
1188 middle = blank_face; 1144 middle = 0;
1189 1145
1190 /* There are three posibilities at this point: 1146 /* There are three posibilities at this point:
1191 * 1) top face is set, need middle to be set. 1147 * 1) top face is set, need middle to be set.
1192 * 2) middle is set, need to set top. 1148 * 2) middle is set, need to set top.
1193 * 3) neither middle or top is set - need to set both. 1149 * 3) neither middle or top is set - need to set both.
… …
1198 /* Once we get to a floor, stop, since we already have a floor object */ 1154 /* Once we get to a floor, stop, since we already have a floor object */
1199 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1155 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1200 break; 1156 break;
1201 1157
1202 /* If two top faces are already set, quit processing */ 1158 /* If two top faces are already set, quit processing */
1203 if ((top != blank_face) && (middle != blank_face)) 1159 if (top && middle)
1204 break; 1160 break;
1205 1161
1206 /* Only show visible faces */ 1162 /* Only show visible faces */
1207 if (!tmp->invisible) 1163 if (!tmp->invisible)
1208 { 1164 {
1209 /* Fill in top if needed */ 1165 /* Fill in top if needed */
1210 if (top == blank_face) 1166 if (!top)
1211 { 1167 {
1212 top = tmp->face;
1213 top_obj = tmp; 1168 top = tmp;
1214 if (top == middle) 1169 if (top == middle)
1215 middle = blank_face; 1170 middle = 0;
1216 } 1171 }
1217 else 1172 else
1218 { 1173 {
1219 /* top is already set - we should only get here if 1174 /* top is already set - we should only get here if
1220 * middle is not set 1175 * middle is not set
1221 * 1176 *
1222 * Set the middle face and break out, since there is nothing 1177 * Set the middle face and break out, since there is nothing
1223 * more to fill in. We don't check visiblity here, since 1178 * more to fill in. We don't check visiblity here, since
1224 * 1179 *
1225 */ 1180 */
1226 if (tmp->face != top) 1181 if (tmp != top)
1227 { 1182 {
1228 middle = tmp->face;
1229 middle_obj = tmp; 1183 middle = tmp;
1230 break; 1184 break;
1231 } 1185 }
1232 } 1186 }
1233 } 1187 }
1234 } 1188 }
1235 1189
1236 if (middle == floor) 1190 if (middle == floor)
1237 middle = blank_face; 1191 middle = 0;
1238 1192
1239 if (top == middle) 1193 if (top == middle)
1240 middle = blank_face; 1194 middle = 0;
1241 1195
1242 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1196#if 0
1243 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1197 faces_obj [0] = top;
1244 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1198 faces_obj [1] = middle;
1199 faces_obj [2] = floor;
1200#endif
1245} 1201}
1246 1202
1247uint64 1203uint64
1248mapspace::volume () const 1204mapspace::volume () const
1249{ 1205{

Diff Legend

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