1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) 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, |
… | |
… | |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License 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 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | #include <unistd.h> |
24 | #include <unistd.h> |
25 | |
25 | |
26 | #include "global.h" |
26 | #include "global.h" |
27 | #include "funcpoint.h" |
|
|
28 | |
27 | |
29 | #include "loader.h" |
28 | #include "loader.h" |
30 | |
29 | |
31 | #include "path.h" |
30 | #include "path.h" |
32 | |
31 | |
… | |
… | |
245 | |
244 | |
246 | insert_ob_in_ob (tmp, container); |
245 | insert_ob_in_ob (tmp, container); |
247 | tmp = next; |
246 | tmp = next; |
248 | } |
247 | } |
249 | |
248 | |
250 | /* sum_weight will go through and calculate what all the containers are |
249 | // go through and calculate what all the containers are carrying. |
251 | * carrying. |
250 | //TODO: remove |
252 | */ |
251 | container->update_weight (); |
253 | sum_weight (container); |
|
|
254 | } |
252 | } |
255 | |
253 | |
256 | void |
254 | void |
257 | maptile::set_object_flag (int flag, int value) |
255 | maptile::set_object_flag (int flag, int value) |
258 | { |
256 | { |
… | |
… | |
307 | bool |
305 | bool |
308 | maptile::_load_objects (object_thawer &f) |
306 | maptile::_load_objects (object_thawer &f) |
309 | { |
307 | { |
310 | for (;;) |
308 | for (;;) |
311 | { |
309 | { |
312 | coroapi::cede_to_tick_every (100); // cede once in a while |
310 | coroapi::cede_to_tick (); // cede once in a while |
313 | |
311 | |
314 | switch (f.kw) |
312 | switch (f.kw) |
315 | { |
313 | { |
316 | case KW_arch: |
314 | case KW_arch: |
317 | if (object *op = object::read (f, this)) |
315 | if (object *op = object::read (f, this)) |
318 | { |
316 | { |
|
|
317 | // TODO: why? |
319 | if (op->inv) |
318 | if (op->inv) |
320 | sum_weight (op); |
319 | op->update_weight (); |
321 | |
320 | |
322 | 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)) |
323 | { |
322 | { |
324 | // we insert manually because |
323 | // we insert manually because |
325 | // a) its way faster |
324 | // a) its way faster |
… | |
… | |
1221 | maptile::tile_available (int dir, bool load) |
1220 | maptile::tile_available (int dir, bool load) |
1222 | { |
1221 | { |
1223 | if (!tile_path[dir]) |
1222 | if (!tile_path[dir]) |
1224 | return 0; |
1223 | return 0; |
1225 | |
1224 | |
1226 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
1225 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1227 | return 1; |
1226 | return 1; |
1228 | |
1227 | |
1229 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1228 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1230 | return 1; |
1229 | return 1; |
1231 | |
1230 | |