--- deliantra/server/common/map.C 2007/07/26 00:27:07 1.114
+++ deliantra/server/common/map.C 2008/04/20 23:25:09 1.135
@@ -1,11 +1,11 @@
/*
- * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
+ * This file is part of Deliantra, the Roguelike Realtime MMORPG.
*
- * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
+ * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
* Copyright (©) 1992,2007 Frank Tore Johansen
*
- * Crossfire TRT is free software: you can redistribute it and/or modify
+ * Deliantra is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
@@ -18,7 +18,7 @@
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*
- * The authors can be reached via e-mail to
+ * The authors can be reached via e-mail to
*/
#include
@@ -168,11 +168,11 @@
}
/*
- * Returns true if the given object can't fit in the given spot.
- * This is meant for multi space objects - for single space objecs,
+ * Returns qthe blocking object if the given object can't fit in the given
+ * spot. This is meant for multi space objects - for single space objecs,
* just calling get_map_blocked and checking that against movement type
- * of object. This function goes through all the parts of the
- * multipart object and makes sure they can be inserted.
+ * of object. This function goes through all the parts of the multipart
+ * object and makes sure they can be inserted.
*
* While this doesn't call out of map, the get_map_flags does.
*
@@ -193,48 +193,33 @@
* code, we need to have actual object to check its move_type
* against the move_block values.
*/
-int
-ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)
+bool
+object::blocked (maptile *m, int x, int y) const
{
- archetype *tmp;
- int flag;
- maptile *m1;
- sint16 sx, sy;
-
- if (!ob)
+ for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
{
- flag = get_map_flags (m, &m1, x, y, &sx, &sy);
- if (flag & P_OUT_OF_MAP)
- return P_OUT_OF_MAP;
-
- /* don't have object, so don't know what types would block */
- return m1->at (sx, sy).move_block;
- }
+ mapxy pos (m, x + tmp->x, y + tmp->y);
- for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)
- {
- flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
+ if (!pos.normalise ())
+ return 1;
- if (flag & P_OUT_OF_MAP)
- return P_OUT_OF_MAP;
- if (flag & P_IS_ALIVE)
- return P_IS_ALIVE;
+ mapspace &ms = *pos;
- mapspace &ms = m1->at (sx, sy);
+ if (ms.flags () & P_IS_ALIVE)
+ return 1;
- /* find_first_free_spot() calls this function. However, often
- * ob doesn't have any move type (when used to place exits)
+ /* However, often ob doesn't have any move type
+ * (signifying non-moving objects)
* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
*/
-
- if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
+ if (!move_type && ms.move_block != MOVE_ALL)
continue;
/* Note it is intentional that we check ob - the movement type of the
* head of the object should correspond for the entire object.
*/
- if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
- return P_NO_PASS;
+ if (ms.blocks (move_type))
+ return 1;
}
return 0;
@@ -262,10 +247,9 @@
tmp = next;
}
- /* sum_weight will go through and calculate what all the containers are
- * carrying.
- */
- sum_weight (container);
+ // go through and calculate what all the containers are carrying.
+ //TODO: remove
+ container->update_weight ();
}
void
@@ -324,17 +308,43 @@
{
for (;;)
{
- coroapi::cede_to_tick_every (100); // cede once in a while
+ coroapi::cede_to_tick (); // cede once in a while
switch (f.kw)
{
case KW_arch:
if (object *op = object::read (f, this))
{
+ // TODO: why?
if (op->inv)
- sum_weight (op);
+ op->update_weight ();
- insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
+ if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
+ {
+ // we insert manually because
+ // a) its way faster
+ // b) we remove manually, too, and there are good reasons for that
+ // c) its correct
+ mapspace &ms = at (op->x, op->y);
+
+ op->flag [FLAG_REMOVED] = false;
+
+ op->above = 0;
+ op->below = ms.top;
+
+ if (ms.top)
+ ms.top->above = op;
+ else
+ ms.bot = op;
+
+ ms.top = op;
+ ms.flags_ = 0;
+ }
+ else
+ {
+ f.parse_warn (format ("object %s out of range", op->debug_desc ()));
+ op->destroy ();
+ }
}
continue;
@@ -357,8 +367,6 @@
void
maptile::activate ()
{
- active = true;
-
if (spaces)
for (mapspace *ms = spaces + size (); ms-- > spaces; )
for (object *op = ms->bot; op; op = op->above)
@@ -368,8 +376,6 @@
void
maptile::deactivate ()
{
- active = false;
-
if (spaces)
for (mapspace *ms = spaces + size (); ms-- > spaces; )
for (object *op = ms->bot; op; op = op->above)
@@ -389,21 +395,21 @@
for (int i = 0; i < size (); ++i)
{
- int unique = 0;
+ bool unique = 0;
+
for (object *op = spaces [i].bot; op; op = op->above)
{
- if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
- unique = 1;
+ unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
- if (!op->can_map_save ())
+ if (expect_false (!op->can_map_save ()))
continue;
- if (unique || op->flag [FLAG_UNIQUE])
+ if (expect_false (unique || op->flag [FLAG_UNIQUE]))
{
if (flags & IO_UNIQUES)
op->write (f);
}
- else if (flags & IO_OBJECTS)
+ else if (expect_true (flags & IO_OBJECTS))
op->write (f);
}
}
@@ -414,28 +420,6 @@
}
bool
-maptile::_load_objects (const char *path, bool skip_header)
-{
- object_thawer f (path);
-
- if (!f)
- return false;
-
- f.next ();
-
- if (skip_header)
- for (;;)
- {
- keyword kw = f.kw;
- f.skip ();
- if (kw == KW_end)
- break;
- }
-
- return _load_objects (f);
-}
-
-bool
maptile::_save_objects (const char *path, int flags)
{
object_freezer freezer;
@@ -617,8 +601,6 @@
{
for (;;)
{
- thawer.next ();
-
switch (thawer.kw)
{
case KW_msg:
@@ -683,10 +665,11 @@
case KW_tile_path_4: thawer.get (tile_path [3]); break;
case KW_ERROR:
- set_key (thawer.kw_str, thawer.value);
+ set_key_text (thawer.kw_str, thawer.value);
break;
case KW_end:
+ thawer.next ();
return true;
default:
@@ -694,22 +677,13 @@
return false;
break;
}
+
+ thawer.next ();
}
abort ();
}
-bool
-maptile::_load_header (const char *path)
-{
- object_thawer thawer (path);
-
- if (!thawer)
- return false;
-
- return _load_header (thawer);
-}
-
/******************************************************************************
* This is the start of unique map handling code
*****************************************************************************/
@@ -816,17 +790,28 @@
void
maptile::clear ()
{
- sfree (regions, size ()); regions = 0;
- delete [] regionmap; regionmap = 0;
-
if (spaces)
{
for (mapspace *ms = spaces + size (); ms-- > spaces; )
while (object *op = ms->bot)
{
- op = op->head_ ();
- op->destroy_inv (false);
- op->destroy ();
+ // manually remove, as to not trigger anything
+ if (ms->bot = op->above)
+ ms->bot->below = 0;
+
+ op->flag [FLAG_REMOVED] = true;
+
+ object *head = op->head_ ();
+ if (op == head)
+ {
+ op->destroy_inv (false);
+ op->destroy ();
+ }
+ else if (head->map != op->map)
+ {
+ LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
+ head->destroy ();
+ }
}
sfree (spaces, size ()), spaces = 0;
@@ -834,6 +819,9 @@
if (buttons)
free_objectlinkpt (buttons), buttons = 0;
+
+ sfree (regions, size ()); regions = 0;
+ delete [] regionmap; regionmap = 0;
}
void
@@ -895,7 +883,6 @@
if (QUERY_FLAG (op, FLAG_IS_FLOOR)
|| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
- || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
|| QUERY_FLAG (op, FLAG_UNIQUE)
|| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
|| QUERY_FLAG (op, FLAG_UNPAID)
@@ -1230,47 +1217,19 @@
return vol;
}
-/* this updates the orig_map->tile_map[tile_num] value after finding
- * the map. It also takes care of linking back the freshly found
- * maps tile_map values if it tiles back to this one. It returns
- * the value of orig_map->tile_map[tile_num].
- */
-static inline maptile *
-find_and_link (maptile *orig_map, int tile_num)
+bool
+maptile::tile_available (int dir, bool load)
{
- maptile *mp = orig_map->tile_map [tile_num];
-
- if (!mp)
- {
- mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
-
- if (!mp)
- {
- // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
- LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
- &orig_map->tile_path[tile_num], &orig_map->path);
- mp = new maptile (1, 1);
- mp->alloc ();
- mp->in_memory = MAP_IN_MEMORY;
- }
- }
-
- int dest_tile = (tile_num + 2) % 4;
-
- orig_map->tile_map [tile_num] = mp;
+ if (!tile_path[dir])
+ return 0;
- // optimisation: back-link map to origin map if euclidean
- //TODO: non-euclidean maps MUST GO
- if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
- orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
+ if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
+ return 1;
- return mp;
-}
+ if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
+ return 1;
-static inline void
-load_and_link (maptile *orig_map, int tile_num)
-{
- find_and_link (orig_map, tile_num)->load_sync ();
+ return 0;
}
/* this returns TRUE if the coordinates (x,y) are out of
@@ -1293,45 +1252,33 @@
if (x < 0)
{
- if (!m->tile_path[3])
+ if (!m->tile_available (3))
return 1;
- if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
- find_and_link (m, 3);
-
return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
}
if (x >= m->width)
{
- if (!m->tile_path[1])
+ if (!m->tile_available (1))
return 1;
- if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
- find_and_link (m, 1);
-
return out_of_map (m->tile_map[1], x - m->width, y);
}
if (y < 0)
{
- if (!m->tile_path[0])
+ if (!m->tile_available (0))
return 1;
- if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
- find_and_link (m, 0);
-
return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
}
if (y >= m->height)
{
- if (!m->tile_path[2])
+ if (!m->tile_available (2))
return 1;
- if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
- find_and_link (m, 2);
-
return out_of_map (m->tile_map[2], x, y - m->height);
}
@@ -1354,40 +1301,36 @@
{
if (x < 0)
{
- if (!tile_path[3])
+ if (!tile_available (3))
return 0;
- find_and_link (this, 3);
x += tile_map[3]->width;
return tile_map[3]->xy_find (x, y);
}
if (x >= width)
{
- if (!tile_path[1])
+ if (!tile_available (1))
return 0;
- find_and_link (this, 1);
x -= width;
return tile_map[1]->xy_find (x, y);
}
if (y < 0)
{
- if (!tile_path[0])
+ if (!tile_available (0))
return 0;
- find_and_link (this, 0);
y += tile_map[0]->height;
return tile_map[0]->xy_find (x, y);
}
if (y >= height)
{
- if (!tile_path[2])
+ if (!tile_available (2))
return 0;
- find_and_link (this, 2);
y -= height;
return tile_map[2]->xy_find (x, y);
}
@@ -1408,7 +1351,7 @@
if (!map1 || !map2)
return 0;
- //TODO: this doesn't actually check corretcly when intermediate maps are not loaded
+ //TODO: this doesn't actually check correctly when intermediate maps are not loaded
//fix: compare paths instead (this is likely faster, too!)
if (map1 == map2)
{
@@ -1672,13 +1615,6 @@
return get_archetype ("blocked");
}
-/**
- * Maximum distance a player may hear a sound from.
- * This is only used for new client/server sound. If the sound source
- * on the map is farther away than this, we don't sent it to the client.
- */
-#define MAX_SOUND_DISTANCE 10
-
void
maptile::play_sound (faceidx sound, int x, int y) const
{