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 | }; |
|
|
95 | |
101 | |
96 | extern void init_uuid (); |
102 | typedef char BUF [32]; |
97 | extern UUID gen_uuid (); |
103 | |
98 | extern const uint64 UUID_SKIP; |
104 | bool parse (const char *s) |
|
|
105 | { |
|
|
106 | return sscanf (s, "<1.%" SCNx64 ">", &seq) == 1; |
|
|
107 | } |
|
|
108 | |
|
|
109 | const char *c_str (char *buf, int len) const |
|
|
110 | { |
|
|
111 | snprintf (buf, len, "<1.%" PRIx64 ">", seq); |
|
|
112 | |
|
|
113 | return buf; |
|
|
114 | } |
|
|
115 | |
|
|
116 | const char *c_str () const |
|
|
117 | { |
|
|
118 | static BUF buf; |
|
|
119 | |
|
|
120 | return c_str (buf, sizeof (buf)); |
|
|
121 | } |
|
|
122 | }; |
99 | |
123 | |
100 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
124 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
101 | * sprinkled in the code. Note that some of these also replace fields |
125 | * 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 |
126 | * that were in the can_apply area. What is the point of having both |
103 | * can_apply and will_apply? |
127 | * can_apply and will_apply? |
… | |
… | |
360 | return nrof ? nrof : 1; |
384 | return nrof ? nrof : 1; |
361 | } |
385 | } |
362 | |
386 | |
363 | uint64 total_weight () const |
387 | uint64 total_weight () const |
364 | { |
388 | { |
365 | return weight * number_of (); |
389 | return weight * number_of () + carrying; |
366 | } |
390 | } |
367 | |
391 | |
368 | // return the dominant material of this item, always return something |
392 | // return the dominant material of this item, always return something |
369 | const materialtype_t *dominant_material () const; |
393 | const materialtype_t *dominant_material () const; |
370 | |
394 | |
… | |
… | |
445 | MTH void activate (); |
469 | MTH void activate (); |
446 | MTH void deactivate (); |
470 | MTH void deactivate (); |
447 | MTH void activate_recursive (); |
471 | MTH void activate_recursive (); |
448 | MTH void deactivate_recursive (); |
472 | MTH void deactivate_recursive (); |
449 | |
473 | |
450 | // set the givne flag on all objects in the inventory recursively |
474 | // set the given flag on all objects in the inventory recursively |
451 | MTH void set_flag_inv (int flag, int value = 1); |
475 | MTH void set_flag_inv (int flag, int value = 1); |
452 | |
476 | |
453 | void enter_exit (object *exit);//Perl |
477 | void enter_exit (object *exit);//Perl |
454 | MTH void enter_map (maptile *newmap, int x, int y); |
478 | MTH void enter_map (maptile *newmap, int x, int y); |
455 | |
479 | |
… | |
… | |
548 | } objectlink; |
572 | } objectlink; |
549 | |
573 | |
550 | typedef struct oblinkpt |
574 | typedef struct oblinkpt |
551 | { /* Used to link together several object links */ |
575 | { /* Used to link together several object links */ |
552 | struct oblnk *link; |
576 | struct oblnk *link; |
553 | long value; /* Used as connected value in buttons/gates */ |
577 | sint32 value; /* Used as connected value in buttons/gates */ |
554 | struct oblinkpt *next; |
578 | struct oblinkpt *next; |
555 | } oblinkpt; |
579 | } oblinkpt; |
556 | |
580 | |
557 | object *find_skill_by_name (object *who, const char *name); |
581 | object *find_skill_by_name (object *who, const char *name); |
558 | object *find_skill_by_name (object *who, const shstr &sh); |
582 | object *find_skill_by_name (object *who, const shstr &sh); |
… | |
… | |
568 | */ |
592 | */ |
569 | |
593 | |
570 | INTERFACE_CLASS (archetype) |
594 | INTERFACE_CLASS (archetype) |
571 | struct archetype : object |
595 | struct archetype : object |
572 | { |
596 | { |
|
|
597 | static arch_ptr empty; // the empty_archetype |
|
|
598 | MTH static void gc (); |
|
|
599 | |
573 | archetype (const char *name); |
600 | archetype (const char *name); |
574 | ~archetype (); |
601 | ~archetype (); |
575 | void gather_callbacks (AV *&callbacks, event_type event) const; |
602 | void gather_callbacks (AV *&callbacks, event_type event) const; |
576 | |
603 | |
577 | static archetype *read (object_thawer &f); |
|
|
578 | |
|
|
579 | MTH static archetype *get (const_utf8_string name); // find or create |
|
|
580 | MTH static archetype *find (const_utf8_string name); |
604 | MTH static archetype *find (const_utf8_string name); |
581 | |
605 | |
582 | MTH void link (); |
606 | MTH void link (); |
583 | MTH void unlink (); |
607 | MTH void unlink (); |
584 | |
608 | |
585 | MTH object *instance (); |
609 | MTH object *instance (); |
586 | |
610 | |
587 | object_vector_index ACC (RW, archid); // index in archvector |
611 | object_vector_index ACC (RW, archid); // index in archvector |
588 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
612 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
589 | bool ACC (RW, stub); // if true, this is an invalid archetype |
|
|
590 | |
613 | |
591 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
614 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
592 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
615 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
|
|
616 | |
|
|
617 | // support for archetype loading |
|
|
618 | static archetype *read (object_thawer &f); |
|
|
619 | MTH static void commit_load (); // commit any objects loaded, resolves cyclic dependencies and more |
|
|
620 | static void postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch); /* postpone other_arch reference */ |
593 | }; |
621 | }; |
594 | |
622 | |
595 | inline void |
623 | inline void |
596 | object_freezer::put (keyword k, archetype *v) |
624 | object_freezer::put (keyword k, archetype *v) |
597 | { |
625 | { |