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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,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 | #ifndef OBJECT_H |
24 | #ifndef OBJECT_H |
25 | #define OBJECT_H |
25 | #define OBJECT_H |
26 | |
26 | |
… | |
… | |
65 | const char *nonuse_name; /* Name to describe objects we can't use */ |
65 | const char *nonuse_name; /* Name to describe objects we can't use */ |
66 | } Body_Locations; |
66 | } Body_Locations; |
67 | |
67 | |
68 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
68 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
69 | |
69 | |
|
|
70 | #define NUM_COINS 4 /* number of coin types */ |
|
|
71 | extern const char *const coins[NUM_COINS + 1]; |
|
|
72 | |
70 | /* |
73 | /* |
71 | * Each object (this also means archetypes!) could have a few of these |
74 | * Each object (this also means archetypes!) could have a few of these |
72 | * "dangling" from it; this could also end up containing 'parse errors'. |
75 | * "dangling" from it; this could also end up containing 'parse errors'. |
73 | * |
76 | * |
74 | * key and value are shared-strings. |
77 | * key and value are shared-strings. |
… | |
… | |
85 | |
88 | |
86 | struct UUID |
89 | struct UUID |
87 | { |
90 | { |
88 | uint64 seq; |
91 | uint64 seq; |
89 | |
92 | |
|
|
93 | static UUID cur; // last uuid generated |
|
|
94 | static void init (); |
|
|
95 | static UUID gen (); |
|
|
96 | |
90 | UUID () { } |
97 | UUID () { } |
91 | UUID (uint64 seq) : seq(seq) { } |
98 | UUID (uint64 seq) : seq(seq) { } |
92 | operator uint64() { return seq; } |
99 | operator uint64() { return seq; } |
93 | void operator =(uint64 seq) { this->seq = seq; } |
100 | void operator =(uint64 seq) { this->seq = seq; } |
94 | }; |
101 | }; |
95 | |
|
|
96 | extern void init_uuid (); |
|
|
97 | extern UUID gen_uuid (); |
|
|
98 | extern const uint64 UUID_SKIP; |
|
|
99 | |
102 | |
100 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
103 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
101 | * sprinkled in the code. Note that some of these also replace fields |
104 | * sprinkled in the code. Note that some of these also replace fields |
102 | * that were in the can_apply area. What is the point of having both |
105 | * that were in the can_apply area. What is the point of having both |
103 | * can_apply and will_apply? |
106 | * can_apply and will_apply? |
… | |
… | |
131 | shstr ACC (RW, name_pl); /* The plural name of the object */ |
134 | shstr ACC (RW, name_pl); /* The plural name of the object */ |
132 | shstr ACC (RW, title); /* Of foo, etc */ |
135 | shstr ACC (RW, title); /* Of foo, etc */ |
133 | shstr ACC (RW, race); /* human, goblin, dragon, etc */ |
136 | shstr ACC (RW, race); /* human, goblin, dragon, etc */ |
134 | shstr ACC (RW, slaying); /* Which race to do double damage to */ |
137 | shstr ACC (RW, slaying); /* Which race to do double damage to */ |
135 | /* If this is an exit, this is the filename */ |
138 | /* If this is an exit, this is the filename */ |
|
|
139 | shstr ACC (RW, tag); // a tag used to tracking this object |
136 | shstr ACC (RW, skill); /* Name of the skill this object uses/grants */ |
140 | shstr ACC (RW, skill); /* Name of the skill this object uses/grants */ |
137 | shstr ACC (RW, msg); /* If this is a book/sign/magic mouth/etc */ |
141 | shstr ACC (RW, msg); /* If this is a book/sign/magic mouth/etc */ |
138 | shstr ACC (RW, lore); /* Obscure information about this object, */ |
142 | shstr ACC (RW, lore); /* Obscure information about this object, */ |
139 | /* To get put into books and the like. */ |
143 | /* To get put into books and the like. */ |
140 | shstr ACC (RW, materialname); /* specific material name */ |
144 | shstr ACC (RW, materialname); /* specific material name */ |
… | |
… | |
250 | UUID ACC (RW, uuid); // Unique Identifier, survives saves etc. |
254 | UUID ACC (RW, uuid); // Unique Identifier, survives saves etc. |
251 | int ACC (RO, count); |
255 | int ACC (RO, count); |
252 | object_vector_index ACC (RO, index); // index into objects |
256 | object_vector_index ACC (RO, index); // index into objects |
253 | object_vector_index ACC (RO, active); // index into actives |
257 | object_vector_index ACC (RO, active); // index into actives |
254 | |
258 | |
255 | player_ptr ACC (RW, contr); /* Pointer to the player which control this object */ |
259 | player_ptr ACC (RW, contr); /* Pointer to the player which control this object, ALWAYS set *iff* type == PLAYER */ |
256 | |
260 | |
257 | object *ACC (RW, below); /* Pointer to the object stacked below this one */ |
261 | object *ACC (RW, below); /* Pointer to the object stacked below this one */ |
258 | object *ACC (RW, above); /* Pointer to the object stacked above this one */ |
262 | object *ACC (RW, above); /* Pointer to the object stacked above this one */ |
259 | /* Note: stacked in the *same* environment */ |
263 | /* Note: stacked in the *same* environment */ |
260 | object *inv; /* Pointer to the first object in the inventory */ |
264 | object *inv; /* Pointer to the first object in the inventory */ |
… | |
… | |
270 | object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different |
274 | object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different |
271 | client_container *seen_by; // seen by which player/container currently? |
275 | client_container *seen_by; // seen by which player/container currently? |
272 | key_value *key_values; /* Fields not explictly known by the loader. */ |
276 | key_value *key_values; /* Fields not explictly known by the loader. */ |
273 | |
277 | |
274 | bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all |
278 | bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all |
275 | void post_load_check (); // do some adjustments after parsing |
279 | MTH void post_load_check (); // do some adjustments after parsing |
276 | static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. |
280 | static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. |
277 | bool write (object_freezer &f); |
281 | bool write (object_freezer &f); |
278 | |
282 | |
279 | MTH int slottype () const; |
283 | MTH int slottype () const; |
280 | MTH static object *create (); |
284 | MTH static object *create (); |
|
|
285 | const mapxy &operator =(const mapxy &pos); |
281 | object &operator =(const object &src); |
286 | object &operator =(const object &src); |
282 | MTH void copy_to (object *dst); |
287 | MTH void copy_to (object *dst); |
283 | MTH object *clone (); // create + copy_to |
288 | MTH object *clone (); // create + copy_to |
284 | void do_destroy (); |
289 | void do_destroy (); |
285 | void gather_callbacks (AV *&callbacks, event_type event) const; |
290 | void gather_callbacks (AV *&callbacks, event_type event) const; |
… | |
… | |
293 | void do_remove (); |
298 | void do_remove (); |
294 | MTH void remove () |
299 | MTH void remove () |
295 | { |
300 | { |
296 | if (!flag [FLAG_REMOVED]) |
301 | if (!flag [FLAG_REMOVED]) |
297 | do_remove (); |
302 | do_remove (); |
|
|
303 | } |
|
|
304 | |
|
|
305 | MTH bool blocked (maptile *m, int x, int y) const; |
|
|
306 | |
|
|
307 | void move_to (const mapxy &pos) |
|
|
308 | { |
|
|
309 | remove (); |
|
|
310 | *this = pos; |
|
|
311 | insert_at (this, this); |
298 | } |
312 | } |
299 | |
313 | |
300 | static bool can_merge_slow (object *op1, object *op2); |
314 | static bool can_merge_slow (object *op1, object *op2); |
301 | |
315 | |
302 | // this is often used in time-critical code, so optimise |
316 | // this is often used in time-critical code, so optimise |
… | |
… | |
383 | |
397 | |
384 | // temporary: wether the object can be saved in a map file |
398 | // temporary: wether the object can be saved in a map file |
385 | // contr => is a player |
399 | // contr => is a player |
386 | // head => only save head of a multitile object |
400 | // head => only save head of a multitile object |
387 | // owner => can not reference owner yet |
401 | // owner => can not reference owner yet |
388 | MTH bool can_map_save () const { return !contr && !head && !owner && !flag [FLAG_NO_MAP_SAVE]; } |
402 | MTH bool can_map_save () const { return !head && (!owner || owner->contr) && !contr && !flag [FLAG_NO_MAP_SAVE]; } |
389 | |
403 | |
390 | /* This return true if object has still randomitems which |
404 | /* This return true if object has still randomitems which |
391 | * could be expanded. |
405 | * could be expanded. |
392 | */ |
406 | */ |
393 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
407 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
… | |
… | |
492 | { |
506 | { |
493 | return !invisible && type != PLAYER; |
507 | return !invisible && type != PLAYER; |
494 | } |
508 | } |
495 | |
509 | |
496 | MTH struct region *region () const; |
510 | MTH struct region *region () const; |
|
|
511 | |
|
|
512 | void statusmsg (const char *msg, int color = NDI_BLACK); |
|
|
513 | void failmsg (const char *msg, int color = NDI_RED); |
|
|
514 | |
|
|
515 | const char *query_inventory (object *who = 0, const char *indent = ""); |
|
|
516 | |
|
|
517 | MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference |
|
|
518 | static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible |
497 | |
519 | |
498 | protected: |
520 | protected: |
499 | void link (); |
521 | void link (); |
500 | void unlink (); |
522 | void unlink (); |
501 | |
523 | |
… | |
… | |
554 | archetype (const char *name); |
576 | archetype (const char *name); |
555 | ~archetype (); |
577 | ~archetype (); |
556 | void gather_callbacks (AV *&callbacks, event_type event) const; |
578 | void gather_callbacks (AV *&callbacks, event_type event) const; |
557 | |
579 | |
558 | static archetype *read (object_thawer &f); |
580 | static archetype *read (object_thawer &f); |
|
|
581 | |
559 | static archetype *get (const char *name); // find or create |
582 | MTH static archetype *get (const_utf8_string name); // find or create |
560 | static archetype *find (const char *name); |
583 | MTH static archetype *find (const_utf8_string name); |
561 | |
584 | |
562 | void link (); |
585 | MTH void link (); |
563 | void unlink (); |
586 | MTH void unlink (); |
|
|
587 | |
|
|
588 | MTH object *instance (); |
564 | |
589 | |
565 | object_vector_index ACC (RW, archid); // index in archvector |
590 | object_vector_index ACC (RW, archid); // index in archvector |
566 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
591 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
567 | bool ACC (RW, stub); // if true, this is an invalid archetype |
592 | bool ACC (RW, stub); // if true, this is an invalid archetype |
568 | uint32 ACC (RW, editable); /* editable flags (mainly for editor) */ |
|
|
569 | |
593 | |
570 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
594 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
571 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
595 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
572 | }; |
596 | }; |
573 | |
597 | |
… | |
… | |
620 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
644 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
621 | * Use for treasure chests so the new object is the highest thing |
645 | * Use for treasure chests so the new object is the highest thing |
622 | * beneath the player, but not actually above it. Note - the |
646 | * beneath the player, but not actually above it. Note - the |
623 | * map and x,y coordinates for the object to be inserted must |
647 | * map and x,y coordinates for the object to be inserted must |
624 | * match the originator. |
648 | * match the originator. |
625 | * INS_MAP_LOAD: disable lots of checkings done at insertion to |
|
|
626 | * speed up map loading process, as we assume the ordering in |
|
|
627 | * loaded map is correct. |
|
|
628 | * |
649 | * |
629 | * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY |
650 | * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY |
630 | * are mutually exclusive. The behaviour for passing more than one |
651 | * are mutually exclusive. The behaviour for passing more than one |
631 | * should be considered undefined - while you may notice what happens |
652 | * should be considered undefined - while you may notice what happens |
632 | * right now if you pass more than one, that could very well change |
653 | * right now if you pass more than one, that could very well change |
… | |
… | |
635 | #define INS_NO_MERGE 0x0001 |
656 | #define INS_NO_MERGE 0x0001 |
636 | #define INS_ABOVE_FLOOR_ONLY 0x0002 |
657 | #define INS_ABOVE_FLOOR_ONLY 0x0002 |
637 | #define INS_NO_WALK_ON 0x0004 |
658 | #define INS_NO_WALK_ON 0x0004 |
638 | #define INS_ON_TOP 0x0008 |
659 | #define INS_ON_TOP 0x0008 |
639 | #define INS_BELOW_ORIGINATOR 0x0010 |
660 | #define INS_BELOW_ORIGINATOR 0x0010 |
640 | #define INS_MAP_LOAD 0x0020 |
|
|
641 | |
661 | |
642 | #define ARCH_DEPLETION "depletion" |
662 | #define ARCH_DEPLETION "depletion" |
643 | |
663 | |
644 | #endif |
664 | #endif |
645 | |
665 | |