1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer Online RPG |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,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 | * 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 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 <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | #ifndef OBJECT_H |
24 | #ifndef OBJECT_H |
26 | #define OBJECT_H |
25 | #define OBJECT_H |
27 | |
26 | |
… | |
… | |
31 | #include "shstr.h" |
30 | #include "shstr.h" |
32 | |
31 | |
33 | typedef int tag_t; |
32 | typedef int tag_t; |
34 | |
33 | |
35 | enum { |
34 | enum { |
|
|
35 | body_skill, |
|
|
36 | body_combat, |
36 | body_range, |
37 | body_range, |
37 | body_shield, |
38 | body_shield, |
38 | body_combat, |
|
|
39 | body_arm, |
39 | body_arm, |
40 | body_torso, |
40 | body_torso, |
41 | body_head, |
41 | body_head, |
42 | body_neck, |
42 | body_neck, |
43 | body_skill, |
|
|
44 | body_finger, |
43 | body_finger, |
45 | body_shoulder, |
44 | body_shoulder, |
46 | body_foot, |
45 | body_foot, |
47 | body_hand, |
46 | body_hand, |
48 | body_wrist, |
47 | body_wrist, |
49 | body_waist, |
48 | body_waist, |
50 | NUM_BODY_LOCATIONS |
49 | NUM_BODY_LOCATIONS |
51 | }; |
50 | }; |
52 | |
51 | |
|
|
52 | enum slottype_t |
|
|
53 | { |
|
|
54 | slot_none, |
|
|
55 | slot_combat, |
|
|
56 | slot_ranged, |
|
|
57 | }; |
|
|
58 | |
53 | /* See common/item.c */ |
59 | /* See common/item.c */ |
54 | |
60 | |
55 | typedef struct Body_Locations |
61 | typedef struct Body_Locations |
56 | { |
62 | { |
57 | const char *save_name; /* Name used to load/save it to disk */ |
63 | keyword save_name; /* Name used to load/save it to disk */ |
58 | const char *use_name; /* Name used when describing an item we can use */ |
64 | const char *use_name; /* Name used when describing an item we can use */ |
59 | 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 */ |
60 | } Body_Locations; |
66 | } Body_Locations; |
61 | |
67 | |
62 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
68 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
|
|
69 | |
|
|
70 | #define NUM_COINS 4 /* number of coin types */ |
|
|
71 | extern const char *const coins[NUM_COINS + 1]; |
63 | |
72 | |
64 | /* |
73 | /* |
65 | * 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 |
66 | * "dangling" from it; this could also end up containing 'parse errors'. |
75 | * "dangling" from it; this could also end up containing 'parse errors'. |
67 | * |
76 | * |
… | |
… | |
79 | |
88 | |
80 | struct UUID |
89 | struct UUID |
81 | { |
90 | { |
82 | uint64 seq; |
91 | uint64 seq; |
83 | |
92 | |
|
|
93 | static UUID cur; // last uuid generated |
|
|
94 | static void init (); |
|
|
95 | static UUID gen (); |
|
|
96 | |
84 | UUID () { } |
97 | UUID () { } |
85 | UUID (uint64 seq) : seq(seq) { } |
98 | UUID (uint64 seq) : seq(seq) { } |
86 | operator uint64() { return seq; } |
99 | operator uint64() { return seq; } |
87 | void operator =(uint64 seq) { this->seq = seq; } |
100 | void operator =(uint64 seq) { this->seq = seq; } |
88 | }; |
101 | }; |
89 | |
|
|
90 | extern void init_uuid (); |
|
|
91 | extern UUID gen_uuid (); |
|
|
92 | extern const uint64 UUID_SKIP; |
|
|
93 | |
102 | |
94 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
103 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
95 | * 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 |
96 | * 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 |
97 | * can_apply and will_apply? |
106 | * can_apply and will_apply? |
… | |
… | |
100 | #define WILL_APPLY_TREASURE 0x02 |
109 | #define WILL_APPLY_TREASURE 0x02 |
101 | #define WILL_APPLY_EARTHWALL 0x04 |
110 | #define WILL_APPLY_EARTHWALL 0x04 |
102 | #define WILL_APPLY_DOOR 0x08 |
111 | #define WILL_APPLY_DOOR 0x08 |
103 | #define WILL_APPLY_FOOD 0x10 |
112 | #define WILL_APPLY_FOOD 0x10 |
104 | |
113 | |
105 | /* However, if you're keeping a pointer of some sort, you probably |
|
|
106 | * don't just want it copied, so you'll need to add to common/object.C, |
|
|
107 | * e.g. ->copy_to () |
|
|
108 | */ |
|
|
109 | |
|
|
110 | struct body_slot |
114 | struct body_slot |
111 | { |
115 | { |
112 | signed char info:4; /* body info as loaded from the file */ |
116 | signed char info:4; /* body info as loaded from the file */ |
113 | signed char used:4; /* Calculated value based on items equipped */ |
117 | signed char used:4; /* Calculated value based on items equipped */ |
114 | }; |
118 | }; |
… | |
… | |
130 | shstr ACC (RW, name_pl); /* The plural name of the object */ |
134 | shstr ACC (RW, name_pl); /* The plural name of the object */ |
131 | shstr ACC (RW, title); /* Of foo, etc */ |
135 | shstr ACC (RW, title); /* Of foo, etc */ |
132 | shstr ACC (RW, race); /* human, goblin, dragon, etc */ |
136 | shstr ACC (RW, race); /* human, goblin, dragon, etc */ |
133 | shstr ACC (RW, slaying); /* Which race to do double damage to */ |
137 | shstr ACC (RW, slaying); /* Which race to do double damage to */ |
134 | /* 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 |
135 | 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 */ |
136 | 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 */ |
137 | shstr ACC (RW, lore); /* Obscure information about this object, */ |
142 | shstr ACC (RW, lore); /* Obscure information about this object, */ |
138 | /* To get put into books and the like. */ |
143 | /* To get put into books and the like. */ |
139 | shstr ACC (RW, materialname); /* specific material name */ |
144 | shstr ACC (RW, materialname); /* specific material name */ |
… | |
… | |
183 | sint32 ACC (RW, carrying); /* How much weight this object contains */ |
188 | sint32 ACC (RW, carrying); /* How much weight this object contains */ |
184 | sint64 ACC (RW, perm_exp); /* Permanent exp */ |
189 | sint64 ACC (RW, perm_exp); /* Permanent exp */ |
185 | uint32 ACC (RW, weapontype); /* type of weapon */ |
190 | uint32 ACC (RW, weapontype); /* type of weapon */ |
186 | uint32 ACC (RW, tooltype); /* type of tool or build facility */ |
191 | uint32 ACC (RW, tooltype); /* type of tool or build facility */ |
187 | body_slot slot [NUM_BODY_LOCATIONS]; |
192 | body_slot slot [NUM_BODY_LOCATIONS]; |
188 | faceidx ACC (RW, face); /* Face with colors */ |
193 | faceidx ACC (RW, face); /* the graphical face */ |
|
|
194 | faceidx ACC (RW, sound); /* the sound face */ |
|
|
195 | faceidx ACC (RW, sound_destroy); /* played on destroy */ |
189 | living ACC (RO, stats); /* Str, Con, Dex, etc */ |
196 | living ACC (RO, stats); /* Str, Con, Dex, etc */ |
190 | /* See the pod/objects.pod for more info about body locations */ |
197 | /* See the pod/objects.pod for more info about body locations */ |
191 | |
198 | |
192 | /* Following mostly refers to fields only used for monsters */ |
199 | /* Following mostly refers to fields only used for monsters */ |
193 | uint32 ACC (RW, hide); /* The object is hidden, not invisible */ |
200 | uint32 ACC (RW, hide); /* The object is hidden, not invisible */ |
… | |
… | |
244 | // These variables are not changed by ->copy_to |
251 | // These variables are not changed by ->copy_to |
245 | maptile_ptr ACC (RW, map); /* Pointer to the map in which this object is present */ |
252 | maptile_ptr ACC (RW, map); /* Pointer to the map in which this object is present */ |
246 | |
253 | |
247 | UUID ACC (RW, uuid); // Unique Identifier, survives saves etc. |
254 | UUID ACC (RW, uuid); // Unique Identifier, survives saves etc. |
248 | int ACC (RO, count); |
255 | int ACC (RO, count); |
249 | int ACC (RO, index); // index into objects |
256 | object_vector_index ACC (RO, index); // index into objects |
250 | int ACC (RO, active); // index into actives |
257 | object_vector_index ACC (RO, active); // index into actives |
251 | |
258 | |
252 | 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 */ |
253 | |
260 | |
254 | 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 */ |
255 | 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 */ |
256 | /* Note: stacked in the *same* environment */ |
263 | /* Note: stacked in the *same* environment */ |
257 | object *inv; /* Pointer to the first object in the inventory */ |
264 | object *inv; /* Pointer to the first object in the inventory */ |
… | |
… | |
267 | 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 |
268 | client_container *seen_by; // seen by which player/container currently? |
275 | client_container *seen_by; // seen by which player/container currently? |
269 | key_value *key_values; /* Fields not explictly known by the loader. */ |
276 | key_value *key_values; /* Fields not explictly known by the loader. */ |
270 | |
277 | |
271 | 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 |
272 | void post_load_check (); // do some adjustments after parsing |
279 | MTH void post_load_check (); // do some adjustments after parsing |
273 | 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. |
274 | bool write (object_freezer &f); |
281 | bool write (object_freezer &f); |
275 | |
282 | |
|
|
283 | MTH int slottype () const; |
276 | MTH static object *create (); |
284 | MTH static object *create (); |
|
|
285 | const mapxy &operator =(const mapxy &pos); |
277 | object &operator =(const object &src); |
286 | object &operator =(const object &src); |
278 | MTH void copy_to (object *dst); |
287 | MTH void copy_to (object *dst); |
279 | MTH object *clone (); // create + copy_to |
288 | MTH object *clone (); // create + copy_to |
280 | void do_destroy (); |
289 | void do_destroy (); |
281 | void gather_callbacks (AV *&callbacks, event_type event) const; |
290 | void gather_callbacks (AV *&callbacks, event_type event) const; |
282 | MTH void destroy (bool destroy_inventory = false); |
291 | MTH void destroy (bool destroy_inventory = false); |
283 | |
292 | |
284 | // recursively destroy all objects in inventory, optionally dropping them to the ground instead |
293 | // recursively destroy all objects in inventory, optionally dropping them to the ground instead |
285 | MTH void destroy_inv (bool drop_to_ground = false); |
294 | MTH void destroy_inv (bool drop_to_ground = false); |
286 | MTH object *insert (object *item); // insert into inventory |
295 | MTH object *insert (object *item); // insert into inventory |
|
|
296 | MTH void play_sound (faceidx sound) const; |
|
|
297 | |
287 | void do_remove (); |
298 | void do_remove (); |
288 | MTH void remove () |
299 | MTH void remove () |
289 | { |
300 | { |
290 | if (!flag [FLAG_REMOVED]) |
301 | if (!flag [FLAG_REMOVED]) |
291 | do_remove (); |
302 | do_remove (); |
292 | } |
303 | } |
293 | |
304 | |
294 | // move this object to the top of its env's inventory to speed up |
305 | MTH bool blocked (maptile *m, int x, int y) const; |
295 | // searches for it. |
|
|
296 | MTH void inv_splay () |
|
|
297 | { |
|
|
298 | if (env && env->inv != this) |
|
|
299 | { |
|
|
300 | if (above) above->below = below; |
|
|
301 | if (below) below->above = above; |
|
|
302 | |
306 | |
303 | above = 0; |
307 | void move_to (const mapxy &pos) |
304 | below = env->inv; |
308 | { |
305 | below->above = this; |
309 | remove (); |
306 | env->inv = this; |
310 | *this = pos; |
307 | } |
311 | insert_at (this, this); |
308 | } |
312 | } |
309 | |
313 | |
310 | static bool can_merge_slow (object *op1, object *op2); |
314 | static bool can_merge_slow (object *op1, object *op2); |
311 | |
315 | |
312 | // this is often used in time-critical code, so optimise |
316 | // this is often used in time-critical code, so optimise |
… | |
… | |
317 | && can_merge_slow (op1, op2); |
321 | && can_merge_slow (op1, op2); |
318 | } |
322 | } |
319 | |
323 | |
320 | MTH void set_owner (object *owner); |
324 | MTH void set_owner (object *owner); |
321 | MTH void set_speed (float speed); |
325 | MTH void set_speed (float speed); |
322 | MTH void set_weapon (object *ob); |
326 | MTH bool change_weapon (object *ob); |
|
|
327 | MTH bool change_skill (object *ob); |
323 | |
328 | |
324 | MTH void open_container (object *new_container); |
329 | MTH void open_container (object *new_container); |
325 | MTH void close_container () |
330 | MTH void close_container () |
326 | { |
331 | { |
327 | open_container (0); |
332 | open_container (0); |
|
|
333 | } |
|
|
334 | |
|
|
335 | MTH object *force_find (const shstr name); |
|
|
336 | MTH void force_add (const shstr name, int duration = 0); |
|
|
337 | |
|
|
338 | // overwrite the attachable should_invoke function with a version that also checks ev_want_type |
|
|
339 | bool should_invoke (event_type event) |
|
|
340 | { |
|
|
341 | return ev_want_event [event] || ev_want_type [type] || cb; |
328 | } |
342 | } |
329 | |
343 | |
330 | MTH void instantiate (); |
344 | MTH void instantiate (); |
331 | |
345 | |
332 | // recalculate all stats |
346 | // recalculate all stats |
… | |
… | |
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]; } |
… | |
… | |
404 | |
418 | |
405 | // "temporary" helper function |
419 | // "temporary" helper function |
406 | MTH object *head_ () |
420 | MTH object *head_ () |
407 | { |
421 | { |
408 | return head ? head : this; |
422 | return head ? head : this; |
|
|
423 | } |
|
|
424 | |
|
|
425 | MTH bool is_head () |
|
|
426 | { |
|
|
427 | return head_ () == this; |
409 | } |
428 | } |
410 | |
429 | |
411 | MTH std::string long_desc (object *who = 0); |
430 | MTH std::string long_desc (object *who = 0); |
412 | MTH std::string describe_monster (object *who = 0); |
431 | MTH std::string describe_monster (object *who = 0); |
413 | MTH std::string describe_item (object *who = 0); |
432 | MTH std::string describe_item (object *who = 0); |
… | |
… | |
422 | MTH void create_treasure (treasurelist *tl, int flags = 0); |
441 | MTH void create_treasure (treasurelist *tl, int flags = 0); |
423 | |
442 | |
424 | // insert object at same map position as 'where' |
443 | // insert object at same map position as 'where' |
425 | // handles both inventory and map "positions" |
444 | // handles both inventory and map "positions" |
426 | MTH object *insert_at (object *where, object *originator = 0, int flags = 0); |
445 | MTH object *insert_at (object *where, object *originator = 0, int flags = 0); |
|
|
446 | MTH void drop_unpaid_items (); |
427 | |
447 | |
428 | MTH void activate (); |
448 | MTH void activate (); |
429 | MTH void deactivate (); |
449 | MTH void deactivate (); |
430 | MTH void activate_recursive (); |
450 | MTH void activate_recursive (); |
431 | MTH void deactivate_recursive (); |
451 | MTH void deactivate_recursive (); |
… | |
… | |
487 | return !invisible && type != PLAYER; |
507 | return !invisible && type != PLAYER; |
488 | } |
508 | } |
489 | |
509 | |
490 | MTH struct region *region () const; |
510 | MTH struct region *region () const; |
491 | |
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 |
|
|
519 | |
492 | protected: |
520 | protected: |
493 | friend struct archetype; |
|
|
494 | |
|
|
495 | void link (); |
521 | void link (); |
496 | void unlink (); |
522 | void unlink (); |
497 | |
523 | |
498 | object (); |
524 | object (); |
499 | ~object (); |
525 | ~object (); |
500 | }; |
526 | }; |
501 | |
527 | |
502 | typedef object_vector<object, &object::index > objectvec; |
528 | // move this object to the top of its env's inventory to speed up |
503 | typedef object_vector<object, &object::active> activevec; |
529 | // searches for it. |
|
|
530 | static object * |
|
|
531 | splay (object *ob) |
|
|
532 | { |
|
|
533 | if (ob->env && ob->env->inv != ob) |
|
|
534 | { |
|
|
535 | if (ob->above) ob->above->below = ob->below; |
|
|
536 | if (ob->below) ob->below->above = ob->above; |
504 | |
537 | |
505 | extern objectvec objects; |
538 | ob->above = 0; |
506 | extern activevec actives; |
539 | ob->below = ob->env->inv; |
|
|
540 | ob->below->above = ob; |
|
|
541 | ob->env->inv = ob; |
|
|
542 | } |
507 | |
543 | |
508 | #define for_all_objects(var) \ |
544 | return ob; |
509 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
545 | } |
510 | declvar (object *, var, objects [_i]) |
|
|
511 | |
|
|
512 | #define for_all_actives(var) \ |
|
|
513 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
|
|
514 | declvar (object *, var, actives [_i]) |
|
|
515 | |
546 | |
516 | typedef struct oblnk |
547 | typedef struct oblnk |
517 | { /* Used to link together several objects */ |
548 | { /* Used to link together several objects */ |
518 | object_ptr ob; |
549 | object_ptr ob; |
519 | struct oblnk *next; |
550 | struct oblnk *next; |
… | |
… | |
523 | { /* Used to link together several object links */ |
554 | { /* Used to link together several object links */ |
524 | struct oblnk *link; |
555 | struct oblnk *link; |
525 | long value; /* Used as connected value in buttons/gates */ |
556 | long value; /* Used as connected value in buttons/gates */ |
526 | struct oblinkpt *next; |
557 | struct oblinkpt *next; |
527 | } oblinkpt; |
558 | } oblinkpt; |
|
|
559 | |
|
|
560 | object *find_skill_by_name (object *who, const char *name); |
|
|
561 | object *find_skill_by_name (object *who, const shstr &sh); |
|
|
562 | object *find_skill_by_number (object *who, int skillno); |
528 | |
563 | |
529 | /* |
564 | /* |
530 | * The archetype structure is a set of rules on how to generate and manipulate |
565 | * The archetype structure is a set of rules on how to generate and manipulate |
531 | * objects which point to archetypes. |
566 | * objects which point to archetypes. |
532 | * This probably belongs in arch.h, but there really doesn't appear to |
567 | * This probably belongs in arch.h, but there really doesn't appear to |
… | |
… | |
534 | * object and pointers. This structure should get removed, and just replaced |
569 | * object and pointers. This structure should get removed, and just replaced |
535 | * by the object structure |
570 | * by the object structure |
536 | */ |
571 | */ |
537 | |
572 | |
538 | INTERFACE_CLASS (archetype) |
573 | INTERFACE_CLASS (archetype) |
539 | struct archetype : zero_initialised, attachable |
574 | struct archetype : object |
540 | { |
575 | { |
541 | archetype (); |
576 | archetype (const char *name); |
542 | ~archetype (); |
577 | ~archetype (); |
543 | void gather_callbacks (AV *&callbacks, event_type event) const; |
578 | void gather_callbacks (AV *&callbacks, event_type event) const; |
544 | |
579 | |
545 | static archetype *read (object_thawer &f); |
580 | static archetype *read (object_thawer &f); |
|
|
581 | |
546 | static archetype *get (const char *name); // find or create |
582 | MTH static archetype *get (const_utf8_string name); // find or create |
547 | static archetype *find (const char *name); |
583 | MTH static archetype *find (const_utf8_string name); |
548 | |
584 | |
549 | void hash_add (); // add to hashtable |
585 | MTH void link (); |
550 | void hash_del (); // remove from hashtable |
586 | MTH void unlink (); |
551 | |
587 | |
|
|
588 | MTH object *instance (); |
|
|
589 | |
|
|
590 | object_vector_index ACC (RW, archid); // index in archvector |
552 | shstr ACC (RW, name); /* More definite name, like "generate_kobold" */ |
591 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
553 | struct archetype *ACC (RW, next); /* Next archetype in a linked list */ |
592 | bool ACC (RW, stub); // if true, this is an invalid archetype |
554 | struct archetype *ACC (RW, head); /* The main part of a linked object */ |
593 | |
555 | struct archetype *ACC (RW, more); /* Next part of a linked object */ |
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...) */ |
556 | object ACC (RO, clone); /* An object from which to do ->copy_to () */ |
595 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
557 | uint32 ACC (RW, editable); /* editable flags (mainly for editor) */ |
|
|
558 | bool ACC (RW, linked); // linked into list of heads |
|
|
559 | sint8 ACC (RW, tail_x), ACC (RW, tail_y); /* Where the lower right most portion of the object is |
|
|
560 | * in comparison to the head. |
|
|
561 | */ |
|
|
562 | }; |
596 | }; |
|
|
597 | |
|
|
598 | inline void |
|
|
599 | object_freezer::put (keyword k, archetype *v) |
|
|
600 | { |
|
|
601 | put (k, v ? &v->archname : (const char *)0); |
|
|
602 | } |
|
|
603 | |
|
|
604 | typedef object_vector<object, &object::index > objectvec; |
|
|
605 | typedef object_vector<object, &object::active> activevec; |
|
|
606 | typedef object_vector<archetype, &archetype::archid> archvec; |
|
|
607 | |
|
|
608 | extern objectvec objects; |
|
|
609 | extern activevec actives; |
|
|
610 | extern archvec archetypes; |
|
|
611 | |
|
|
612 | #define for_all_objects(var) \ |
|
|
613 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
|
|
614 | statementvar (object *, var, objects [_i]) |
|
|
615 | |
|
|
616 | #define for_all_actives(var) \ |
|
|
617 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
|
|
618 | statementvar (object *, var, actives [_i]) |
|
|
619 | |
|
|
620 | #define for_all_archetypes(var) \ |
|
|
621 | for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ |
|
|
622 | statementvar (archetype *, var, archetypes [_i]) |
563 | |
623 | |
564 | /* Used by update_object to know if the object being passed is |
624 | /* Used by update_object to know if the object being passed is |
565 | * being added or removed. |
625 | * being added or removed. |
566 | */ |
626 | */ |
567 | #define UP_OBJ_INSERT 1 |
627 | #define UP_OBJ_INSERT 1 |
… | |
… | |
584 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
644 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
585 | * 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 |
586 | * beneath the player, but not actually above it. Note - the |
646 | * beneath the player, but not actually above it. Note - the |
587 | * 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 |
588 | * match the originator. |
648 | * match the originator. |
589 | * INS_MAP_LOAD: disable lots of checkings done at insertion to |
|
|
590 | * speed up map loading process, as we assume the ordering in |
|
|
591 | * loaded map is correct. |
|
|
592 | * |
649 | * |
593 | * 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 |
594 | * are mutually exclusive. The behaviour for passing more than one |
651 | * are mutually exclusive. The behaviour for passing more than one |
595 | * should be considered undefined - while you may notice what happens |
652 | * should be considered undefined - while you may notice what happens |
596 | * 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 |
… | |
… | |
599 | #define INS_NO_MERGE 0x0001 |
656 | #define INS_NO_MERGE 0x0001 |
600 | #define INS_ABOVE_FLOOR_ONLY 0x0002 |
657 | #define INS_ABOVE_FLOOR_ONLY 0x0002 |
601 | #define INS_NO_WALK_ON 0x0004 |
658 | #define INS_NO_WALK_ON 0x0004 |
602 | #define INS_ON_TOP 0x0008 |
659 | #define INS_ON_TOP 0x0008 |
603 | #define INS_BELOW_ORIGINATOR 0x0010 |
660 | #define INS_BELOW_ORIGINATOR 0x0010 |
604 | #define INS_MAP_LOAD 0x0020 |
|
|
605 | |
661 | |
606 | #define ARCH_SINGULARITY "singularity" |
|
|
607 | #define ARCH_DETECT_MAGIC "detect_magic" |
|
|
608 | #define ARCH_DEPLETION "depletion" |
662 | #define ARCH_DEPLETION "depletion" |
609 | #define ARCH_SYMPTOM "symptom" |
|
|
610 | |
663 | |
611 | #endif |
664 | #endif |
612 | |
665 | |