1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
|
|
4 | * Copyright (©) 2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
21 | * <http://www.gnu.org/licenses/>. |
21 | * |
22 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | #include <global.h> |
26 | #include <global.h> |
26 | #include <sproto.h> |
27 | #include <sproto.h> |
… | |
… | |
250 | "spell_glyph", /* 205 */ |
251 | "spell_glyph", /* 205 */ |
251 | NULL |
252 | NULL |
252 | }; |
253 | }; |
253 | |
254 | |
254 | /* This function checks the object after it has been loaded (when we |
255 | /* This function checks the object after it has been loaded (when we |
255 | * get the 'end' in the input stream). This function can be used to |
256 | * get the 'end' in the input stream). This function can be used to |
256 | * deal with legacy objects where fields may have changed. It can also be used |
257 | * deal with legacy objects where fields may have changed. It can also be used |
257 | * to check for objects to make sure there are no common errors. |
258 | * to check for objects to make sure there are no common errors. |
258 | */ |
259 | */ |
259 | void |
260 | void |
260 | object::post_load_check () |
261 | object::post_load_check () |
… | |
… | |
293 | LOG (llevError, "ITEMBUG: %s: body_shield %d != -1\n", debug_desc (), slot [body_shield].info); |
294 | LOG (llevError, "ITEMBUG: %s: body_shield %d != -1\n", debug_desc (), slot [body_shield].info); |
294 | slot [body_shield].info = -1; |
295 | slot [body_shield].info = -1; |
295 | } |
296 | } |
296 | break; |
297 | break; |
297 | |
298 | |
|
|
299 | case CONTAINER: |
|
|
300 | if (nrof) |
|
|
301 | { |
|
|
302 | LOG (llevError, "ITEMBUG: %s: stackable container (nrof %d)\n", debug_desc (), (int)nrof); |
|
|
303 | nrof = 0; |
|
|
304 | } |
|
|
305 | break; |
|
|
306 | |
298 | case PLAYER: |
307 | case PLAYER: |
299 | if (slot [body_shield].info != 1) |
308 | if (slot [body_shield].info != 1) |
300 | { |
309 | { |
301 | LOG (llevError, "ITEMBUG: %s: body_shield %d != 1\n", debug_desc (), slot [body_shield].info); |
310 | LOG (llevError, "ITEMBUG: %s: body_shield %d != 1\n", debug_desc (), slot [body_shield].info); |
302 | slot [body_shield].info = 1; |
311 | slot [body_shield].info = 1; |
… | |
… | |
321 | * this isn't perfect (things won't be properly pluralised), but works to |
330 | * this isn't perfect (things won't be properly pluralised), but works to |
322 | * that degree (5 heart is still quite understandable). But the case we |
331 | * that degree (5 heart is still quite understandable). But the case we |
323 | * also have to catch is if this object is not using the normal name for |
332 | * also have to catch is if this object is not using the normal name for |
324 | * the object. In that case, we also want to use the loaded name. |
333 | * the object. In that case, we also want to use the loaded name. |
325 | * Otherwise, what happens is that the the plural name will lose |
334 | * Otherwise, what happens is that the the plural name will lose |
326 | * information (appear as just 'hearts' and not 'goblins heart') |
335 | * information (appear as just 'hearts' and not 'goblins heart') |
327 | */ |
336 | */ |
328 | if (arch && name != arch->object::name && name_pl == arch->object::name_pl) |
337 | if (arch && name != arch->object::name && name_pl == arch->object::name_pl) |
329 | name_pl = 0; |
338 | name_pl = 0; |
330 | |
339 | |
331 | if (!name_pl) |
340 | if (!name_pl) |
… | |
… | |
475 | } |
484 | } |
476 | |
485 | |
477 | // if the object has an animation, try to provide a default face |
486 | // if the object has an animation, try to provide a default face |
478 | if (has_anim ()) |
487 | if (has_anim ()) |
479 | { |
488 | { |
480 | const animation &anim_ob = anim (); |
|
|
481 | |
|
|
482 | if (anim_speed) |
489 | if (anim_speed) |
483 | // if this item is time-animated, force the last frame |
490 | // if this item is time-animated, force the last frame |
484 | animate_object (this, 0); |
491 | animate_object (this, 0); |
485 | else if (flag [FLAG_MONSTER]) |
492 | else if (flag [FLAG_MONSTER]) |
486 | // if it is a monster, set appropriate facing |
493 | // if it is a monster, set appropriate facing |
… | |
… | |
523 | { |
530 | { |
524 | negate = 1; |
531 | negate = 1; |
525 | str++; |
532 | str++; |
526 | } |
533 | } |
527 | |
534 | |
528 | for (const flagstr *f = move_flags; f < move_flags + array_length (move_flags); ++f) |
535 | for (const flagstr *f = move_flags; f < move_flags + ecb_array_length (move_flags); ++f) |
529 | { |
536 | { |
530 | if (!strcmp (f->name, str)) |
537 | if (!strcmp (f->name, str)) |
531 | { |
538 | { |
532 | if (negate) |
539 | if (negate) |
533 | mt &= ~f->flags; |
540 | mt &= ~f->flags; |
… | |
… | |
550 | |
557 | |
551 | bool |
558 | bool |
552 | object::parse_kv (object_thawer &f) |
559 | object::parse_kv (object_thawer &f) |
553 | { |
560 | { |
554 | object *op_inv = inv; |
561 | object *op_inv = inv; |
555 | key_value *last_kv = kv.first; |
|
|
556 | |
562 | |
557 | for (;;) |
563 | for (;;) |
558 | { |
564 | { |
559 | switch (f.kw) |
565 | switch (f.kw) |
560 | { |
566 | { |
… | |
… | |
633 | f.delayed_deref (this, owner, f.get_str ()); |
639 | f.delayed_deref (this, owner, f.get_str ()); |
634 | break; |
640 | break; |
635 | |
641 | |
636 | case KW_animation: |
642 | case KW_animation: |
637 | { |
643 | { |
638 | this->clr_flag (FLAG_ANIMATE); |
644 | clr_flag (FLAG_ANIMATE); |
639 | animation_id = 0; |
645 | animation_id = 0; |
640 | |
646 | |
641 | if (f.has_value () && (animation_id = find_animation (f.get_str ()))) |
647 | if (f.has_value () && (animation_id = animation::find (f.get_str ()).number)) |
642 | this->set_flag (FLAG_ANIMATE); //TODO: should not be forced to true here |
648 | set_flag (FLAG_ANIMATE); //TODO: should not be forced to true here |
643 | } |
649 | } |
644 | break; |
650 | break; |
645 | |
651 | |
646 | case KW_last_heal: f.get (last_heal); break; |
652 | case KW_last_heal: f.get (last_heal); break; |
647 | case KW_last_sp: f.get (last_sp); break; |
653 | case KW_last_sp: f.get (last_sp); break; |
… | |
… | |
1021 | { |
1027 | { |
1022 | op->destroy (); |
1028 | op->destroy (); |
1023 | return 0; |
1029 | return 0; |
1024 | } |
1030 | } |
1025 | |
1031 | |
1026 | // the loader reverses the ordering of kv-pairs, so we reverse it again after loading |
1032 | // The loader reverses the ordering of kv-pairs, so we reverse it again after loading. |
1027 | // that greatly simplifies the loading code. |
1033 | // This greatly simplifies the loading code. |
1028 | op->kv.reverse (); |
1034 | op->kv.reverse (); |
1029 | |
1035 | |
1030 | op->post_load_check (); |
1036 | op->post_load_check (); |
1031 | return op; |
1037 | return op; |
1032 | } |
1038 | } |
… | |
… | |
1218 | *ptr++ = '\n'; |
1224 | *ptr++ = '\n'; |
1219 | |
1225 | |
1220 | f.alloc (ptr - cur); |
1226 | f.alloc (ptr - cur); |
1221 | } |
1227 | } |
1222 | |
1228 | |
1223 | #define CMP_OUT(v) if (expect_false (op->v != arch->v)) f.put (KW (v), op->v) |
1229 | #define CMP_OUT(v) if (ecb_expect_false (op->v != arch->v)) f.put (KW (v), op->v) |
1224 | #define CMP_OUT2(k,v) if (expect_false (op->v != arch->v)) f.put (KW (k), op->v) |
1230 | #define CMP_OUT2(k,v) if (ecb_expect_false (op->v != arch->v)) f.put (KW (k), op->v) |
1225 | |
1231 | |
1226 | CMP_OUT (x); |
1232 | CMP_OUT (x); |
1227 | CMP_OUT (y); |
1233 | CMP_OUT (y); |
1228 | |
1234 | |
1229 | CMP_OUT (type); |
1235 | CMP_OUT (type); |
… | |
… | |
1243 | static int last_speed_left_len = sizeof ("sl 0\n") - 1; |
1249 | static int last_speed_left_len = sizeof ("sl 0\n") - 1; |
1244 | |
1250 | |
1245 | if (last_speed_left != op->speed_left) |
1251 | if (last_speed_left != op->speed_left) |
1246 | { |
1252 | { |
1247 | last_speed_left = op->speed_left; |
1253 | last_speed_left = op->speed_left; |
|
|
1254 | // .7g loses precision even for float, but gives nice round numbers and smaller files |
|
|
1255 | // maybe hex format or a raw binary dump of the float is good enough, more exact, and much faster? |
|
|
1256 | // (printf is typically very slow) |
1248 | last_speed_left_len = sizeof ("sl ") - 1 |
1257 | last_speed_left_len = sizeof ("sl ") - 1 |
1249 | + sprintf (last_speed_left_str + sizeof ("sl ") - 1, "%.7g\n", last_speed_left); |
1258 | + sprintf (last_speed_left_str + sizeof ("sl ") - 1, "%.7g\n", last_speed_left); |
1250 | } |
1259 | } |
1251 | |
1260 | |
1252 | f.add (last_speed_left_str, last_speed_left_len); |
1261 | f.add (last_speed_left_str, last_speed_left_len); |
… | |
… | |
1315 | CMP_OUT (level); |
1324 | CMP_OUT (level); |
1316 | CMP_OUT (attacktype); |
1325 | CMP_OUT (attacktype); |
1317 | |
1326 | |
1318 | // using memcmp here seems to be a loss - is gcc vectorising? |
1327 | // using memcmp here seems to be a loss - is gcc vectorising? |
1319 | for (int i = 0; i < NROFATTACKS; i++) |
1328 | for (int i = 0; i < NROFATTACKS; i++) |
1320 | if (expect_false (op->resist[i] != arch->resist[i])) |
1329 | if (ecb_expect_false (op->resist[i] != arch->resist[i])) |
1321 | f.put (resist_save[i], op->resist[i]); |
1330 | f.put (resist_save[i], op->resist[i]); |
1322 | |
1331 | |
1323 | CMP_OUT (path_attuned); |
1332 | CMP_OUT (path_attuned); |
1324 | CMP_OUT (path_repelled); |
1333 | CMP_OUT (path_repelled); |
1325 | CMP_OUT (path_denied); |
1334 | CMP_OUT (path_denied); |
… | |
… | |
1339 | CMP_OUT (last_grace); |
1348 | CMP_OUT (last_grace); |
1340 | CMP_OUT (last_eat); |
1349 | CMP_OUT (last_eat); |
1341 | CMP_OUT (glow_radius); |
1350 | CMP_OUT (glow_radius); |
1342 | |
1351 | |
1343 | if (op->flag [FLAG_IS_LINKED]) |
1352 | if (op->flag [FLAG_IS_LINKED]) |
1344 | if (auto (ol, op->find_link ())) |
1353 | if (auto ol = op->find_link ()) |
1345 | f.put (KW(connected), ol->id); |
1354 | f.put (KW(connected), ol->id); |
1346 | |
1355 | |
1347 | CMP_OUT (randomitems); |
1356 | CMP_OUT (randomitems); |
1348 | |
1357 | |
1349 | CMP_OUT2 (container, weight_limit); |
1358 | CMP_OUT2 (container, weight_limit); |
… | |
… | |
1377 | f.put (flag_names [FLAG_OBJ_ORIGINAL], op->flag [FLAG_OBJ_ORIGINAL] ? CS(1) : CS(0)); |
1386 | f.put (flag_names [FLAG_OBJ_ORIGINAL], op->flag [FLAG_OBJ_ORIGINAL] ? CS(1) : CS(0)); |
1378 | |
1387 | |
1379 | diff.reset (FLAG_OBJ_ORIGINAL); |
1388 | diff.reset (FLAG_OBJ_ORIGINAL); |
1380 | |
1389 | |
1381 | // quickly test whether any other flags differ |
1390 | // quickly test whether any other flags differ |
1382 | if (expect_true (diff.any ())) |
1391 | if (ecb_expect_true (diff.any ())) |
1383 | for (int i = 0; i < NUM_FLAGS; i++) |
1392 | for (int i = 0; i < NUM_FLAGS; i++) |
1384 | if (expect_false (diff [i])) |
1393 | if (ecb_expect_false (diff [i])) |
1385 | f.put (flag_names [i], op->flag [i] ? CS(1) : CS(0)); |
1394 | f.put (flag_names [i], op->flag [i] ? CS(1) : CS(0)); |
1386 | #else |
1395 | #else |
1387 | // use sgi extensions |
1396 | // use sgi extensions |
1388 | for (int i = diff._Find_first (); i < diff.size (); i = diff._Find_next (i)) |
1397 | for (int i = diff._Find_first (); i < diff.size (); i = diff._Find_next (i)) |
1389 | f.put (flag_names [i], op->flag [i] ? CS(1) : CS(0)); |
1398 | f.put (flag_names [i], op->flag [i] ? CS(1) : CS(0)); |
1390 | #endif |
1399 | #endif |
1391 | |
1400 | |
1392 | // save body locations. gcc's memcmp does an abysmal job when used |
1401 | // save body locations. gcc's memcmp does an abysmal job when used |
1393 | for (int i = 0; i < NUM_BODY_LOCATIONS; i++) |
1402 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
1394 | if (expect_false (op->slot[i].info != arch->slot[i].info)) |
1403 | if (ecb_expect_false (op->slot[i].info != arch->slot[i].info)) |
1395 | f.put (body_locations[i].kw, op->slot[i].info); |
1404 | f.put (body_locations[i].kw, op->slot[i].info); |
1396 | } |
1405 | } |
1397 | |
1406 | |
1398 | /* |
1407 | /* |
1399 | * Dumps all variables in an object to a file. |
1408 | * Dumps all variables in an object to a file. |
… | |
… | |
1401 | * the only place this is not set is when saving the player. |
1410 | * the only place this is not set is when saving the player. |
1402 | */ |
1411 | */ |
1403 | bool |
1412 | bool |
1404 | object::write (object_freezer &f) |
1413 | object::write (object_freezer &f) |
1405 | { |
1414 | { |
1406 | if (expect_false (is_arch ())) |
1415 | if (ecb_expect_false (is_arch ())) |
1407 | { |
1416 | { |
1408 | f.put (KW(object), arch->archname); |
1417 | f.put (KW(object), arch->archname); |
1409 | write_diff (f, this, archetype::empty); |
1418 | write_diff (f, this, archetype::empty); |
1410 | } |
1419 | } |
1411 | else |
1420 | else |