1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,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 it |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * 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, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * 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 along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
… | |
… | |
325 | * also have to catch is if this object is not using the normal name for |
324 | * also have to catch is if this object is not using the normal name for |
326 | * the object. In that case, we also want to use the loaded name. |
325 | * the object. In that case, we also want to use the loaded name. |
327 | * Otherwise, what happens is that the the plural name will lose |
326 | * Otherwise, what happens is that the the plural name will lose |
328 | * information (appear as just 'hearts' and not 'goblins heart') |
327 | * information (appear as just 'hearts' and not 'goblins heart') |
329 | */ |
328 | */ |
330 | if (arch && name != arch->clone.name && name_pl == arch->clone.name_pl) |
329 | if (arch && name != arch->object::name && name_pl == arch->object::name_pl) |
331 | name_pl = 0; |
330 | name_pl = 0; |
332 | |
331 | |
333 | if (!name_pl) |
332 | if (!name_pl) |
334 | name_pl = name; |
333 | name_pl = name; |
335 | |
334 | |
… | |
… | |
410 | { |
409 | { |
411 | object *tmp = get_archetype_by_object_name (slaying); |
410 | object *tmp = get_archetype_by_object_name (slaying); |
412 | insert_ob_in_ob (tmp, this); |
411 | insert_ob_in_ob (tmp, this); |
413 | randomitems = NULL; /* So another spell isn't created for this object */ |
412 | randomitems = NULL; /* So another spell isn't created for this object */ |
414 | /* without this, value is all screwed up */ |
413 | /* without this, value is all screwed up */ |
415 | value = arch->clone.value * inv->value; |
414 | value = arch->value * inv->value; |
416 | } |
415 | } |
417 | |
416 | |
418 | if (QUERY_FLAG (this, FLAG_MONSTER)) |
417 | if (QUERY_FLAG (this, FLAG_MONSTER)) |
419 | { |
418 | { |
420 | if (stats.hp > stats.maxhp) |
419 | if (stats.hp > stats.maxhp) |
… | |
… | |
602 | |
601 | |
603 | if (!other_arch) |
602 | if (!other_arch) |
604 | LOG (llevError, "%s uses unknown other_arch '%s'.\n", debug_desc (), f.get_str ()); |
603 | LOG (llevError, "%s uses unknown other_arch '%s'.\n", debug_desc (), f.get_str ()); |
605 | break; |
604 | break; |
606 | |
605 | |
|
|
606 | case KW_owner: |
|
|
607 | if (const char *s = f.get_str ()) |
|
|
608 | { |
|
|
609 | unsigned int version; |
|
|
610 | unsigned long long seq; |
|
|
611 | char name[256]; |
|
|
612 | |
|
|
613 | if (3 == sscanf (s, "<%d.%llx>/%256s", &version, &seq, name) && version == 1) |
|
|
614 | { |
|
|
615 | UUID uuid = seq; |
|
|
616 | player *pl = player::find (name); |
|
|
617 | |
|
|
618 | if (pl && pl->ob->uuid == uuid) |
|
|
619 | owner = pl->ob; |
|
|
620 | } |
|
|
621 | } |
|
|
622 | break; |
|
|
623 | |
607 | case KW_animation: |
624 | case KW_animation: |
608 | { |
625 | { |
609 | CLEAR_FLAG (this, FLAG_ANIMATE); |
626 | CLEAR_FLAG (this, FLAG_ANIMATE); |
610 | animation_id = 0; |
627 | animation_id = 0; |
611 | |
628 | |
… | |
… | |
636 | f.get (move_slow_penalty); |
653 | f.get (move_slow_penalty); |
637 | break; |
654 | break; |
638 | |
655 | |
639 | case KW_face: |
656 | case KW_face: |
640 | face = face_find (f.get_str ()); |
657 | face = face_find (f.get_str ()); |
|
|
658 | break; |
|
|
659 | |
|
|
660 | case KW_sound: |
|
|
661 | sound = sound_find (f.get_str ()); |
|
|
662 | if (!sound) |
|
|
663 | f.parse_warn ("sound not found"); |
|
|
664 | break; |
|
|
665 | |
|
|
666 | case KW_sound_destroy: |
|
|
667 | sound_destroy = sound_find (f.get_str ()); |
|
|
668 | if (!sound_destroy) |
|
|
669 | f.parse_warn ("sound not found"); |
641 | break; |
670 | break; |
642 | |
671 | |
643 | case KW_x: f.get (x); break; |
672 | case KW_x: f.get (x); break; |
644 | case KW_y: f.get (y); break; |
673 | case KW_y: f.get (y); break; |
645 | |
674 | |
… | |
… | |
959 | randomitems = 0; |
988 | randomitems = 0; |
960 | break; |
989 | break; |
961 | |
990 | |
962 | case KW_msg: |
991 | case KW_msg: |
963 | f.get_ml (KW_endmsg, msg); |
992 | f.get_ml (KW_endmsg, msg); |
964 | //TODO: allow longer messages |
|
|
965 | if (strlen (msg) >= HUGE_BUF) |
|
|
966 | { |
|
|
967 | LOG (llevDebug, "\tError message length >= %d: %d\n>%.80s<\n", HUGE_BUF, strlen (msg), &msg); |
|
|
968 | msg = "ERROR, please report: string too long, winged.\n"; |
|
|
969 | } |
|
|
970 | break; |
993 | break; |
971 | |
994 | |
972 | case KW_lore: |
995 | case KW_lore: |
973 | f.get_ml (KW_endlore, lore); |
996 | f.get_ml (KW_endlore, lore); |
974 | //TODO: allow longer messages |
|
|
975 | /* Just print a warning so we can be reasonably safe |
|
|
976 | * about not overflowing the buffer. |
|
|
977 | */ |
|
|
978 | if (strlen (lore) > (HUGE_BUF / 2)) |
|
|
979 | LOG (llevDebug, "\tWarning lore length > %d (max allowed=%d): %d\n>%.80s<\n", |
|
|
980 | HUGE_BUF / 2, HUGE_BUF, strlen (lore), &lore); |
|
|
981 | break; |
997 | break; |
982 | |
998 | |
983 | case KW_editable: |
999 | case KW_editable: |
984 | case KW_editor_folder: |
1000 | case KW_editor_folder: |
985 | break; |
1001 | break; |
… | |
… | |
1024 | f.next (); |
1040 | f.next (); |
1025 | |
1041 | |
1026 | object *op = object::create (); |
1042 | object *op = object::create (); |
1027 | |
1043 | |
1028 | op->map = map; |
1044 | op->map = map; |
1029 | arch->clone.copy_to (op); |
1045 | arch->copy_to (op); |
1030 | // copy_to activates, this should be fixed properly |
1046 | // copy_to activates, this should be fixed properly |
1031 | op->deactivate (); |
1047 | op->deactivate (); |
1032 | |
1048 | |
1033 | if (!op->parse_kv (f)) |
1049 | if (!op->parse_kv (f)) |
1034 | { |
1050 | { |
… | |
… | |
1271 | char uids[64]; |
1287 | char uids[64]; |
1272 | snprintf (uids, sizeof (uids), "<1.%llx>", (unsigned long long)op->uuid.seq); |
1288 | snprintf (uids, sizeof (uids), "<1.%llx>", (unsigned long long)op->uuid.seq); |
1273 | f.put (KW_uuid, (const char *)uids); |
1289 | f.put (KW_uuid, (const char *)uids); |
1274 | } |
1290 | } |
1275 | |
1291 | |
1276 | #define CMP_OUT(v) if (op->v != tmp->v) f.put (KW_ ## v, op->v) |
1292 | #define CMP_OUT(v) if (expect_false (op->v != tmp->v)) f.put (KW_ ## v, op->v) |
1277 | #define CMP_OUT2(k,v) if (op->v != tmp->v) f.put (KW_ ## k, op->v) |
1293 | #define CMP_OUT2(k,v) if (expect_false (op->v != tmp->v)) f.put (KW_ ## k, op->v) |
|
|
1294 | |
|
|
1295 | if (object *pl = op->owner) |
|
|
1296 | if (pl->contr) |
|
|
1297 | { |
|
|
1298 | char owner[256]; |
|
|
1299 | snprintf (owner, sizeof (owner), "<1.%llx>/%s", (unsigned long long)pl->uuid.seq, &pl->name); |
|
|
1300 | f.put (KW_owner, (const char *)owner); |
|
|
1301 | } |
1278 | |
1302 | |
1279 | CMP_OUT (name); |
1303 | CMP_OUT (name); |
1280 | CMP_OUT (name_pl); |
1304 | CMP_OUT (name_pl); |
1281 | CMP_OUT (custom_name); |
1305 | CMP_OUT (custom_name); |
1282 | CMP_OUT (title); |
1306 | CMP_OUT (title); |
1283 | CMP_OUT (race); |
1307 | CMP_OUT (race); |
1284 | CMP_OUT (slaying); |
1308 | CMP_OUT (slaying); |
|
|
1309 | CMP_OUT (other_arch); |
1285 | |
1310 | |
1286 | if (op->msg != tmp->msg) |
1311 | if (op->msg != tmp->msg ) f.put (KW_msg , KW_endmsg , op->msg ); |
1287 | f.put (KW_msg, KW_endmsg, op->msg); |
|
|
1288 | if (op->lore != tmp->lore) |
|
|
1289 | f.put (KW_lore, KW_endlore, op->lore); |
1312 | if (op->lore != tmp->lore) f.put (KW_lore, KW_endlore, op->lore); |
1290 | if (op->other_arch != tmp->other_arch) |
|
|
1291 | f.put (KW_other_arch, op->other_arch ? &op->other_arch->archname : 0); |
|
|
1292 | |
1313 | |
1293 | if (op->face != tmp->face) f.put (KW_face, op->face ? &faces [op->face] : 0); |
1314 | if (op->face != tmp->face ) f.put (KW_face , op->face ? &faces [op->face ] : 0); |
|
|
1315 | if (op->sound != tmp->sound ) f.put (KW_sound , op->sound ? &faces [op->sound ] : 0); |
|
|
1316 | if (op->sound_destroy != tmp->sound_destroy) f.put (KW_sound_destroy, op->sound_destroy ? &faces [op->sound_destroy] : 0); |
1294 | |
1317 | |
1295 | if (op->animation_id != tmp->animation_id) |
1318 | if (op->animation_id != tmp->animation_id) |
1296 | if (op->animation_id) |
1319 | if (op->animation_id) |
1297 | { |
1320 | { |
1298 | f.put (KW_animation, animations[GET_ANIM_ID (op)].name); |
1321 | f.put (KW_animation, animations[GET_ANIM_ID (op)].name); |
1299 | |
1322 | |
1300 | if (!QUERY_FLAG (op, FLAG_ANIMATE)) |
1323 | if (!QUERY_FLAG (op, FLAG_ANIMATE)) |
1301 | f.put (KW_is_animated, (sint32) 0); |
1324 | f.put (KW_is_animated, (sint32)0); |
1302 | } |
1325 | } |
1303 | else |
1326 | else |
1304 | f.put (KW_animation, (const char *) 0); |
1327 | f.put (KW_animation, (const char *)0); |
1305 | |
1328 | |
1306 | CMP_OUT2 (str, stats.Str); |
1329 | CMP_OUT2 (str, stats.Str); |
1307 | CMP_OUT2 (dex, stats.Dex); |
1330 | CMP_OUT2 (dex, stats.Dex); |
1308 | CMP_OUT2 (con, stats.Con); |
1331 | CMP_OUT2 (con, stats.Con); |
1309 | CMP_OUT2 (wis, stats.Wis); |
1332 | CMP_OUT2 (wis, stats.Wis); |
… | |
… | |
1340 | CMP_OUT (type); |
1363 | CMP_OUT (type); |
1341 | CMP_OUT (subtype); |
1364 | CMP_OUT (subtype); |
1342 | CMP_OUT (attacktype); |
1365 | CMP_OUT (attacktype); |
1343 | |
1366 | |
1344 | for (i = 0; i < NROFATTACKS; i++) |
1367 | for (i = 0; i < NROFATTACKS; i++) |
1345 | if (op->resist[i] != tmp->resist[i]) |
1368 | if (expect_false (op->resist[i] != tmp->resist[i])) |
1346 | f.put (resist_save[i], op->resist[i]); |
1369 | f.put (resist_save[i], op->resist[i]); |
1347 | |
1370 | |
1348 | CMP_OUT (path_attuned); |
1371 | CMP_OUT (path_attuned); |
1349 | CMP_OUT (path_repelled); |
1372 | CMP_OUT (path_repelled); |
1350 | CMP_OUT (path_denied); |
1373 | CMP_OUT (path_denied); |
… | |
… | |
1392 | CMP_OUT (move_slow); |
1415 | CMP_OUT (move_slow); |
1393 | CMP_OUT (move_slow_penalty); |
1416 | CMP_OUT (move_slow_penalty); |
1394 | |
1417 | |
1395 | if (op->flag != tmp->flag) |
1418 | if (op->flag != tmp->flag) |
1396 | for (i = 0; i <= NUM_FLAGS; i++) |
1419 | for (i = 0; i <= NUM_FLAGS; i++) |
1397 | if (flag_names [i] && op->flag [i] != tmp->flag [i]) |
1420 | if (expect_false (flag_names [i] && op->flag [i] != tmp->flag [i])) |
1398 | f.put (flag_names [i], op->flag [i] ? "1" : "0"); |
1421 | f.put (flag_names [i], op->flag [i] ? "1" : "0"); |
1399 | |
1422 | |
1400 | // save body locations |
1423 | // save body locations |
1401 | for (i = 0; i < NUM_BODY_LOCATIONS; i++) |
1424 | for (i = 0; i < NUM_BODY_LOCATIONS; i++) |
1402 | if (op->slot[i].info != tmp->slot[i].info) |
1425 | if (expect_false (op->slot[i].info != tmp->slot[i].info)) |
1403 | f.put (body_locations[i].save_name, op->slot[i].info); |
1426 | f.put (body_locations[i].save_name, op->slot[i].info); |
1404 | } |
1427 | } |
1405 | |
1428 | |
1406 | /* |
1429 | /* |
1407 | * Dumps all variables in an object to a file. |
1430 | * Dumps all variables in an object to a file. |
… | |
… | |
1409 | * the only place this is not set is when saving the player. |
1432 | * the only place this is not set is when saving the player. |
1410 | */ |
1433 | */ |
1411 | bool |
1434 | bool |
1412 | object::write (object_freezer &f) |
1435 | object::write (object_freezer &f) |
1413 | { |
1436 | { |
1414 | /* Even if the object does have an owner, it would seem that we should |
|
|
1415 | * still save it. |
|
|
1416 | */ |
|
|
1417 | if (owner) |
|
|
1418 | return true; |
|
|
1419 | |
|
|
1420 | archetype *at = arch ? (archetype *)arch : empty_archetype; |
1437 | archetype *at = arch ? (archetype *)arch : empty_archetype; |
1421 | |
1438 | |
1422 | f.put (KW_arch, at->archname); |
1439 | f.put (KW_arch, at->archname); |
1423 | write_diff (f, this, &at->clone); |
1440 | write_diff (f, this, at); |
1424 | |
1441 | |
1425 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1442 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1426 | tmp->write (f); |
1443 | tmp->write (f); |
1427 | |
1444 | |
1428 | f.put (this); |
1445 | f.put (this); |