1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
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) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,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 |
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 2 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
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, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <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. |
26 | sub/add_weight will transcend the environment updating the carrying |
25 | sub/add_weight will transcend the environment updating the carrying |
27 | variable. */ |
26 | variable. */ |
… | |
… | |
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) |
… | |
… | |
517 | |
516 | |
518 | next: ; |
517 | next: ; |
519 | } |
518 | } |
520 | } |
519 | } |
521 | |
520 | |
522 | #define GET_FLAG(op,flag) \ |
521 | #define GET_FLAG(op,flg) op->flag [flg] = f.get_bool () |
523 | if (f.get_sint32 ()) \ |
|
|
524 | SET_FLAG (op, flag); \ |
|
|
525 | else \ |
|
|
526 | CLEAR_FLAG (op, flag) \ |
|
|
527 | |
522 | |
528 | bool |
523 | bool |
529 | object::parse_kv (object_thawer &f) |
524 | object::parse_kv (object_thawer &f) |
530 | { |
525 | { |
531 | object *op_inv = inv; |
526 | object *op_inv = inv; |
… | |
… | |
640 | f.get (move_slow_penalty); |
635 | f.get (move_slow_penalty); |
641 | break; |
636 | break; |
642 | |
637 | |
643 | case KW_face: |
638 | case KW_face: |
644 | face = face_find (f.get_str ()); |
639 | face = face_find (f.get_str ()); |
|
|
640 | break; |
|
|
641 | |
|
|
642 | case KW_sound: |
|
|
643 | sound = sound_find (f.get_str ()); |
|
|
644 | if (!sound) |
|
|
645 | sound = face_find (f.get_str ());//TODO: really fall back to face name? |
645 | break; |
646 | break; |
646 | |
647 | |
647 | case KW_x: f.get (x); break; |
648 | case KW_x: f.get (x); break; |
648 | case KW_y: f.get (y); break; |
649 | case KW_y: f.get (y); break; |
649 | |
650 | |
… | |
… | |
777 | CLEAR_FLAG (this, FLAG_KNOWN_MAGICAL); |
778 | CLEAR_FLAG (this, FLAG_KNOWN_MAGICAL); |
778 | |
779 | |
779 | break; |
780 | break; |
780 | |
781 | |
781 | case KW_friendly: |
782 | case KW_friendly: |
782 | if (f.get_sint32 ()) |
783 | if (f.get_bool ()) |
783 | if (type != PLAYER) |
784 | if (type != PLAYER) |
784 | add_friendly_object (this); |
785 | add_friendly_object (this); |
785 | |
786 | |
786 | break; |
787 | break; |
787 | |
788 | |
… | |
… | |
963 | randomitems = 0; |
964 | randomitems = 0; |
964 | break; |
965 | break; |
965 | |
966 | |
966 | case KW_msg: |
967 | case KW_msg: |
967 | f.get_ml (KW_endmsg, msg); |
968 | f.get_ml (KW_endmsg, msg); |
968 | //TODO: allow longer messages |
|
|
969 | if (strlen (msg) >= HUGE_BUF) |
|
|
970 | { |
|
|
971 | LOG (llevDebug, "\tError message length >= %d: %d\n>%.80s<\n", HUGE_BUF, strlen (msg), &msg); |
|
|
972 | msg = "ERROR, please report: string too long, winged.\n"; |
|
|
973 | } |
|
|
974 | break; |
969 | break; |
975 | |
970 | |
976 | case KW_lore: |
971 | case KW_lore: |
977 | f.get_ml (KW_endlore, lore); |
972 | f.get_ml (KW_endlore, lore); |
978 | //TODO: allow longer messages |
|
|
979 | /* Just print a warning so we can be reasonably safe |
|
|
980 | * about not overflowing the buffer. |
|
|
981 | */ |
|
|
982 | if (strlen (lore) > (HUGE_BUF / 2)) |
|
|
983 | LOG (llevDebug, "\tWarning lore length > %d (max allowed=%d): %d\n>%.80s<\n", |
|
|
984 | HUGE_BUF / 2, HUGE_BUF, strlen (lore), &lore); |
|
|
985 | break; |
973 | break; |
986 | |
974 | |
987 | case KW_editable: |
975 | case KW_editable: |
988 | case KW_editor_folder: |
976 | case KW_editor_folder: |
989 | break; |
977 | break; |
… | |
… | |
1028 | f.next (); |
1016 | f.next (); |
1029 | |
1017 | |
1030 | object *op = object::create (); |
1018 | object *op = object::create (); |
1031 | |
1019 | |
1032 | op->map = map; |
1020 | op->map = map; |
1033 | arch->clone.copy_to (op); |
1021 | arch->copy_to (op); |
1034 | // copy_to activates, this should be fixed properly |
1022 | // copy_to activates, this should be fixed properly |
1035 | op->deactivate (); |
1023 | op->deactivate (); |
1036 | |
1024 | |
1037 | if (!op->parse_kv (f)) |
1025 | if (!op->parse_kv (f)) |
1038 | { |
1026 | { |
… | |
… | |
1284 | CMP_OUT (name_pl); |
1272 | CMP_OUT (name_pl); |
1285 | CMP_OUT (custom_name); |
1273 | CMP_OUT (custom_name); |
1286 | CMP_OUT (title); |
1274 | CMP_OUT (title); |
1287 | CMP_OUT (race); |
1275 | CMP_OUT (race); |
1288 | CMP_OUT (slaying); |
1276 | CMP_OUT (slaying); |
1289 | |
|
|
1290 | if (op->msg != tmp->msg) |
|
|
1291 | f.put (KW_msg, KW_endmsg, op->msg); |
|
|
1292 | if (op->lore != tmp->lore) |
|
|
1293 | f.put (KW_lore, KW_endlore, op->lore); |
|
|
1294 | |
|
|
1295 | CMP_OUT (other_arch); |
1277 | CMP_OUT (other_arch); |
1296 | |
1278 | |
|
|
1279 | if (op->msg != tmp->msg ) f.put (KW_msg , KW_endmsg , op->msg ); |
|
|
1280 | if (op->lore != tmp->lore) f.put (KW_lore, KW_endlore, op->lore); |
|
|
1281 | |
|
|
1282 | if (op->sound != tmp->sound) f.put (KW_sound, op->sound ? &faces [op->sound] : 0); |
1297 | if (op->face != tmp->face) f.put (KW_face, op->face ? &faces [op->face] : 0); |
1283 | if (op->face != tmp->face ) f.put (KW_face , op->face ? &faces [op->face ] : 0); |
1298 | |
1284 | |
1299 | if (op->animation_id != tmp->animation_id) |
1285 | if (op->animation_id != tmp->animation_id) |
1300 | if (op->animation_id) |
1286 | if (op->animation_id) |
1301 | { |
1287 | { |
1302 | f.put (KW_animation, animations[GET_ANIM_ID (op)].name); |
1288 | f.put (KW_animation, animations[GET_ANIM_ID (op)].name); |
1303 | |
1289 | |
1304 | if (!QUERY_FLAG (op, FLAG_ANIMATE)) |
1290 | if (!QUERY_FLAG (op, FLAG_ANIMATE)) |
1305 | f.put (KW_is_animated, (sint32) 0); |
1291 | f.put (KW_is_animated, (sint32)0); |
1306 | } |
1292 | } |
1307 | else |
1293 | else |
1308 | f.put (KW_animation, (const char *) 0); |
1294 | f.put (KW_animation, (const char *)0); |
1309 | |
1295 | |
1310 | CMP_OUT2 (str, stats.Str); |
1296 | CMP_OUT2 (str, stats.Str); |
1311 | CMP_OUT2 (dex, stats.Dex); |
1297 | CMP_OUT2 (dex, stats.Dex); |
1312 | CMP_OUT2 (con, stats.Con); |
1298 | CMP_OUT2 (con, stats.Con); |
1313 | CMP_OUT2 (wis, stats.Wis); |
1299 | CMP_OUT2 (wis, stats.Wis); |
… | |
… | |
1421 | if (owner) |
1407 | if (owner) |
1422 | return true; |
1408 | return true; |
1423 | |
1409 | |
1424 | archetype *at = arch ? (archetype *)arch : empty_archetype; |
1410 | archetype *at = arch ? (archetype *)arch : empty_archetype; |
1425 | |
1411 | |
1426 | f.put (KW_arch, at->name); |
1412 | f.put (KW_arch, at->archname); |
1427 | write_diff (f, this, &at->clone); |
1413 | write_diff (f, this, at); |
1428 | |
1414 | |
1429 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1415 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1430 | tmp->write (f); |
1416 | tmp->write (f); |
1431 | |
1417 | |
1432 | f.put (this); |
1418 | f.put (this); |