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,2008 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. |
75 | * |
78 | * |
76 | * Please use get_ob_key_value(), set_ob_key_value() from object.c rather than |
79 | * Please use kv_get/kv_set/kv_del from object rather than |
77 | * accessing the list directly. |
80 | * accessing the list directly. |
78 | * Exception is if you want to walk this list for some reason. |
81 | * Exception is if you want to walk this list for some reason. |
79 | */ |
82 | */ |
80 | struct key_value |
83 | struct key_value : slice_allocated |
81 | { |
84 | { |
82 | key_value *next; |
85 | key_value *next; |
83 | shstr key, value; |
86 | shstr key, value; |
84 | }; |
87 | }; |
85 | |
88 | |
86 | struct UUID |
89 | struct UUID |
87 | { |
90 | { |
88 | uint64 seq; |
91 | uint64 seq; |
|
|
92 | |
|
|
93 | static UUID cur; // last uuid generated |
|
|
94 | static void init (); |
|
|
95 | static UUID gen (); |
89 | |
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; } |
|
|
101 | |
|
|
102 | typedef char BUF [32]; |
|
|
103 | |
|
|
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 | } |
94 | }; |
122 | }; |
95 | |
|
|
96 | extern void init_uuid (); |
|
|
97 | extern UUID gen_uuid (); |
|
|
98 | extern const uint64 UUID_SKIP; |
|
|
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? |
… | |
… | |
153 | |
177 | |
154 | float ACC (RW, speed); /* The overall speed of this object */ |
178 | float ACC (RW, speed); /* The overall speed of this object */ |
155 | float ACC (RW, speed_left); /* How much speed is left to spend this round */ |
179 | float ACC (RW, speed_left); /* How much speed is left to spend this round */ |
156 | uint32 ACC (RW, nrof); /* How many of the objects */ |
180 | uint32 ACC (RW, nrof); /* How many of the objects */ |
157 | |
181 | |
158 | /* This next big block are basically used for monsters and equipment */ |
182 | /* This next big block is basically used for monsters and equipment */ |
159 | uint16 ACC (RW, client_type); /* Public type information. see doc/Developers/objects */ |
183 | uint16 ACC (RW, client_type); /* Public type information. see doc/Developers/objects */ |
160 | |
184 | |
161 | sint16 ACC (RW, resist[NROFATTACKS]); /* Resistance adjustments for attacks */ |
185 | sint16 ACC (RW, resist[NROFATTACKS]); /* Resistance adjustments for attacks */ |
162 | uint32 ACC (RW, attacktype); /* Bitmask of attacks this object does */ |
186 | uint32 ACC (RW, attacktype); /* Bitmask of attacks this object does */ |
163 | uint32 ACC (RW, path_attuned);/* Paths the object is attuned to */ |
187 | uint32 ACC (RW, path_attuned);/* Paths the object is attuned to */ |
… | |
… | |
180 | sint8 ACC (RW, item_power); /* power rating of the object */ |
204 | sint8 ACC (RW, item_power); /* power rating of the object */ |
181 | sint8 ACC (RW, gen_sp_armour);/* sp regen penalty this object has (was last_heal) */ |
205 | sint8 ACC (RW, gen_sp_armour);/* sp regen penalty this object has (was last_heal) */ |
182 | sint8 ACC (RW, glow_radius); /* indicates the glow radius of the object */ |
206 | sint8 ACC (RW, glow_radius); /* indicates the glow radius of the object */ |
183 | sint32 ACC (RW, weight); /* Attributes of the object */ |
207 | sint32 ACC (RW, weight); /* Attributes of the object */ |
184 | sint32 ACC (RW, weight_limit);/* Weight-limit of object */ |
208 | sint32 ACC (RW, weight_limit);/* Weight-limit of object */ |
185 | sint32 ACC (RW, carrying); /* How much weight this object contains */ |
209 | sint32 ACC (RW, carrying); /* How much weight this object contains, must be 0 if nrof == 0 */ |
186 | sint64 ACC (RW, perm_exp); /* Permanent exp */ |
210 | sint64 ACC (RW, perm_exp); /* Permanent exp */ |
187 | uint32 ACC (RW, weapontype); /* type of weapon */ |
211 | uint32 ACC (RW, weapontype); /* type of weapon */ |
188 | uint32 ACC (RW, tooltype); /* type of tool or build facility */ |
212 | uint32 ACC (RW, tooltype); /* type of tool or build facility */ |
189 | body_slot slot [NUM_BODY_LOCATIONS]; |
213 | body_slot slot [NUM_BODY_LOCATIONS]; |
190 | faceidx ACC (RW, face); /* the graphical face */ |
214 | faceidx ACC (RW, face); /* the graphical face */ |
… | |
… | |
270 | object *ACC (RW, more); /* Pointer to the rest of a large body of objects */ |
294 | object *ACC (RW, more); /* Pointer to the rest of a large body of objects */ |
271 | object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different |
295 | object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different |
272 | client_container *seen_by; // seen by which player/container currently? |
296 | client_container *seen_by; // seen by which player/container currently? |
273 | key_value *key_values; /* Fields not explictly known by the loader. */ |
297 | key_value *key_values; /* Fields not explictly known by the loader. */ |
274 | |
298 | |
|
|
299 | // privates / perl |
|
|
300 | const shstr &kv_get (const shstr &key) const; |
|
|
301 | void kv_del (const shstr &key); |
|
|
302 | void kv_set (const shstr &key, const shstr &value); |
|
|
303 | |
|
|
304 | // custom extra fields management |
|
|
305 | struct key_value_access_proxy |
|
|
306 | { |
|
|
307 | object &ob; |
|
|
308 | shstr key; |
|
|
309 | |
|
|
310 | key_value_access_proxy (object &ob, const shstr &key) |
|
|
311 | : ob (ob), key (key) |
|
|
312 | { |
|
|
313 | } |
|
|
314 | |
|
|
315 | const key_value_access_proxy &operator =(const shstr &value) const |
|
|
316 | { |
|
|
317 | ob.kv_set (key, value); |
|
|
318 | return *this; |
|
|
319 | } |
|
|
320 | |
|
|
321 | operator const shstr &() const { return ob.kv_get (key); } |
|
|
322 | operator const char *() const { return ob.kv_get (key); } |
|
|
323 | |
|
|
324 | private: |
|
|
325 | void operator =(int); |
|
|
326 | }; |
|
|
327 | |
|
|
328 | // operator [] is too annoying to use |
|
|
329 | const key_value_access_proxy kv (const shstr &key) |
|
|
330 | { |
|
|
331 | return key_value_access_proxy (*this, key); |
|
|
332 | } |
|
|
333 | |
275 | bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all |
334 | bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all |
276 | MTH void post_load_check (); // do some adjustments after parsing |
335 | MTH void post_load_check (); // do some adjustments after parsing |
277 | static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. |
336 | static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. |
278 | bool write (object_freezer &f); |
337 | bool write (object_freezer &f); |
279 | |
338 | |
280 | MTH int slottype () const; |
339 | MTH int slottype () const; |
281 | MTH static object *create (); |
340 | MTH static object *create (); |
282 | const mapxy &operator =(const mapxy &pos); |
341 | const mapxy &operator =(const mapxy &pos); |
283 | object &operator =(const object &src); |
|
|
284 | MTH void copy_to (object *dst); |
342 | MTH void copy_to (object *dst); |
285 | MTH object *clone (); // create + copy_to |
343 | MTH object *clone (); // create + copy_to a single object |
|
|
344 | MTH object *deep_clone (); // copy whole more chain and inventory |
286 | void do_destroy (); |
345 | void do_destroy (); |
287 | void gather_callbacks (AV *&callbacks, event_type event) const; |
346 | void gather_callbacks (AV *&callbacks, event_type event) const; |
288 | MTH void destroy (bool destroy_inventory = false); |
347 | MTH void destroy (bool destroy_inventory = false); |
289 | |
348 | |
290 | // recursively destroy all objects in inventory, optionally dropping them to the ground instead |
349 | // recursively destroy all objects in inventory, optionally dropping them to the ground instead |
291 | MTH void destroy_inv (bool drop_to_ground = false); |
350 | MTH void destroy_inv (bool drop_to_ground = false); |
292 | MTH object *insert (object *item); // insert into inventory |
351 | MTH object *insert (object *item); // insert into inventory |
293 | MTH void play_sound (faceidx sound) const; |
352 | MTH void play_sound (faceidx sound); |
294 | |
353 | |
295 | void do_remove (); |
354 | void do_remove (); |
296 | MTH void remove () |
355 | MTH void remove () |
297 | { |
356 | { |
298 | if (!flag [FLAG_REMOVED]) |
357 | if (!flag [FLAG_REMOVED]) |
299 | do_remove (); |
358 | do_remove (); |
300 | } |
359 | } |
|
|
360 | |
|
|
361 | MTH bool blocked (maptile *m, int x, int y) const; |
301 | |
362 | |
302 | void move_to (const mapxy &pos) |
363 | void move_to (const mapxy &pos) |
303 | { |
364 | { |
304 | remove (); |
365 | remove (); |
305 | *this = pos; |
366 | *this = pos; |
… | |
… | |
351 | // info must hold 256 * 3 bytes currently |
412 | // info must hold 256 * 3 bytes currently |
352 | const char *debug_desc (char *info) const; |
413 | const char *debug_desc (char *info) const; |
353 | MTH const char *debug_desc () const; // uses at least 3 round-robin buffers |
414 | MTH const char *debug_desc () const; // uses at least 3 round-robin buffers |
354 | const char *flag_desc (char *desc, int len) const; |
415 | const char *flag_desc (char *desc, int len) const; |
355 | |
416 | |
|
|
417 | MTH bool decrease (sint32 nr = 1); // returns true if anything is left |
|
|
418 | MTH object *split (sint32 nr = 1); // return 0 on failure |
|
|
419 | |
356 | int number_of () const |
420 | MTH int number_of () const |
357 | { |
421 | { |
358 | return nrof ? nrof : 1; |
422 | return nrof ? nrof : 1; |
359 | } |
423 | } |
360 | |
424 | |
361 | uint64 total_weight () const |
425 | MTH sint32 total_weight () const |
362 | { |
426 | { |
363 | return weight * number_of (); |
427 | return (weight + carrying) * number_of (); |
364 | } |
428 | } |
|
|
429 | |
|
|
430 | MTH void update_weight (); |
365 | |
431 | |
366 | // return the dominant material of this item, always return something |
432 | // return the dominant material of this item, always return something |
367 | const materialtype_t *dominant_material () const; |
433 | const materialtype_t *dominant_material () const; |
368 | |
434 | |
369 | // return the volume of this object in cm³ |
435 | // return the volume of this object in cm³ |
370 | uint64 volume () const |
436 | MTH uint64 volume () const |
371 | { |
437 | { |
372 | return total_weight () |
438 | return total_weight () |
373 | * 1000 |
439 | * 1000 |
374 | * (type == CONTAINER ? 1000 : 1) |
440 | * (type == CONTAINER ? 1000 : 1) |
375 | / dominant_material ()->density; |
441 | / dominant_material ()->density; |
… | |
… | |
399 | /* This return true if object has still randomitems which |
465 | /* This return true if object has still randomitems which |
400 | * could be expanded. |
466 | * could be expanded. |
401 | */ |
467 | */ |
402 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
468 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
403 | |
469 | |
|
|
470 | // returns the outermost owner, never returns 0 |
|
|
471 | MTH object *outer_owner () |
|
|
472 | { |
|
|
473 | for (object *op = this; ; op = op->owner) |
|
|
474 | if (!op->owner) |
|
|
475 | return op; |
|
|
476 | } |
|
|
477 | |
|
|
478 | // returns the outermost environment, never returns 0 |
|
|
479 | MTH object *outer_env () |
|
|
480 | { |
|
|
481 | for (object *op = this; ; op = op->env) |
|
|
482 | if (!op->env) |
|
|
483 | return op; |
|
|
484 | } |
|
|
485 | |
404 | // returns the player that has this object in his inventory, or 0 |
486 | // returns the player that has this object in his inventory, or 0 |
|
|
487 | // we assume the player is always the outer env |
405 | MTH object *in_player () const |
488 | MTH object *in_player () |
406 | { |
489 | { |
407 | for (object *op = env; op; op = op->env) |
490 | object *op = outer_env (); |
408 | if (op->type == PLAYER) |
|
|
409 | return op; |
|
|
410 | |
491 | |
411 | return 0; |
492 | return op->type == PLAYER ? op : 0; |
412 | } |
493 | } |
413 | |
494 | |
414 | // "temporary" helper function |
495 | // "temporary" helper function |
415 | MTH object *head_ () |
496 | MTH object *head_ () |
416 | { |
497 | { |
… | |
… | |
419 | |
500 | |
420 | MTH bool is_head () |
501 | MTH bool is_head () |
421 | { |
502 | { |
422 | return head_ () == this; |
503 | return head_ () == this; |
423 | } |
504 | } |
|
|
505 | |
|
|
506 | MTH bool is_on_map () const |
|
|
507 | { |
|
|
508 | return !env && !flag [FLAG_REMOVED]; |
|
|
509 | } |
|
|
510 | |
|
|
511 | // returns the player that cna see this object, if any |
|
|
512 | MTH object *visible_to () const; |
424 | |
513 | |
425 | MTH std::string long_desc (object *who = 0); |
514 | MTH std::string long_desc (object *who = 0); |
426 | MTH std::string describe_monster (object *who = 0); |
515 | MTH std::string describe_monster (object *who = 0); |
427 | MTH std::string describe_item (object *who = 0); |
516 | MTH std::string describe_item (object *who = 0); |
428 | MTH std::string describe (object *who = 0); |
517 | MTH std::string describe (object *who = 0); |
… | |
… | |
443 | MTH void activate (); |
532 | MTH void activate (); |
444 | MTH void deactivate (); |
533 | MTH void deactivate (); |
445 | MTH void activate_recursive (); |
534 | MTH void activate_recursive (); |
446 | MTH void deactivate_recursive (); |
535 | MTH void deactivate_recursive (); |
447 | |
536 | |
448 | // set the givne flag on all objects in the inventory recursively |
537 | // set the given flag on all objects in the inventory recursively |
449 | MTH void set_flag_inv (int flag, int value = 1); |
538 | MTH void set_flag_inv (int flag, int value = 1); |
450 | |
539 | |
451 | void enter_exit (object *exit);//Perl |
540 | void enter_exit (object *exit);//Perl |
452 | MTH void enter_map (maptile *newmap, int x, int y); |
541 | MTH void enter_map (maptile *newmap, int x, int y); |
|
|
542 | void player_goto (const char *path, int x, int y); // only for players |
453 | |
543 | |
454 | // returns the mapspace this object is in |
544 | // returns the mapspace this object is in |
455 | mapspace &ms () const; |
545 | mapspace &ms () const; |
456 | |
546 | |
457 | // fully recursive iterator |
547 | // fully recursive iterator |
… | |
… | |
493 | { |
583 | { |
494 | return this; |
584 | return this; |
495 | } |
585 | } |
496 | |
586 | |
497 | /* This returns TRUE if the object is something that |
587 | /* This returns TRUE if the object is something that |
498 | * should be displayed in the floorbox/inventory window |
588 | * a client might want to know about. |
499 | */ |
589 | */ |
500 | MTH bool client_visible () const |
590 | MTH bool client_visible () const |
501 | { |
591 | { |
502 | return !invisible && type != PLAYER; |
592 | return !invisible && type != PLAYER; |
503 | } |
593 | } |
504 | |
594 | |
|
|
595 | // the client does nrof * this weight |
|
|
596 | MTH sint32 client_weight () const |
|
|
597 | { |
|
|
598 | return weight + carrying; |
|
|
599 | } |
|
|
600 | |
505 | MTH struct region *region () const; |
601 | MTH struct region *region () const; |
506 | |
602 | |
507 | void statusmsg (const char *msg, int color = NDI_BLACK); |
603 | void statusmsg (const char *msg, int color = NDI_BLACK); |
508 | void failmsg (const char *msg, int color = NDI_RED); |
604 | void failmsg (const char *msg, int color = NDI_RED); |
|
|
605 | |
|
|
606 | const char *query_inventory (object *who = 0, const char *indent = ""); |
509 | |
607 | |
510 | MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference |
608 | MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference |
511 | static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible |
609 | static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible |
512 | |
610 | |
513 | protected: |
611 | protected: |
514 | void link (); |
612 | void link (); |
515 | void unlink (); |
613 | void unlink (); |
516 | |
614 | |
517 | object (); |
615 | object (); |
518 | ~object (); |
616 | ~object (); |
|
|
617 | |
|
|
618 | private: |
|
|
619 | object &operator =(const object &); |
|
|
620 | object (const object &); |
519 | }; |
621 | }; |
520 | |
622 | |
521 | // move this object to the top of its env's inventory to speed up |
623 | // move this object to the top of its env's inventory to speed up |
522 | // searches for it. |
624 | // searches for it. |
523 | static object * |
625 | static object * |
… | |
… | |
544 | } objectlink; |
646 | } objectlink; |
545 | |
647 | |
546 | typedef struct oblinkpt |
648 | typedef struct oblinkpt |
547 | { /* Used to link together several object links */ |
649 | { /* Used to link together several object links */ |
548 | struct oblnk *link; |
650 | struct oblnk *link; |
549 | long value; /* Used as connected value in buttons/gates */ |
651 | sint32 value; /* Used as connected value in buttons/gates */ |
550 | struct oblinkpt *next; |
652 | struct oblinkpt *next; |
551 | } oblinkpt; |
653 | } oblinkpt; |
552 | |
654 | |
553 | object *find_skill_by_name (object *who, const char *name); |
655 | object *find_skill_by_name (object *who, const char *name); |
554 | object *find_skill_by_name (object *who, const shstr &sh); |
656 | object *find_skill_by_name (object *who, const shstr &sh); |
… | |
… | |
564 | */ |
666 | */ |
565 | |
667 | |
566 | INTERFACE_CLASS (archetype) |
668 | INTERFACE_CLASS (archetype) |
567 | struct archetype : object |
669 | struct archetype : object |
568 | { |
670 | { |
|
|
671 | static arch_ptr empty; // the empty_archetype |
|
|
672 | MTH static void gc (); |
|
|
673 | |
569 | archetype (const char *name); |
674 | archetype (const char *name); |
570 | ~archetype (); |
675 | ~archetype (); |
571 | void gather_callbacks (AV *&callbacks, event_type event) const; |
676 | void gather_callbacks (AV *&callbacks, event_type event) const; |
572 | |
677 | |
573 | static archetype *read (object_thawer &f); |
|
|
574 | |
|
|
575 | MTH static archetype *get (const_utf8_string name); // find or create |
|
|
576 | MTH static archetype *find (const_utf8_string name); |
678 | MTH static archetype *find (const_utf8_string name); |
577 | |
679 | |
578 | MTH void link (); |
680 | MTH void link (); |
579 | MTH void unlink (); |
681 | MTH void unlink (); |
580 | |
682 | |
|
|
683 | MTH static object *get (const char *name); // (find() || singularity)->instance() |
|
|
684 | MTH object *instance (); |
|
|
685 | |
581 | object_vector_index ACC (RW, archid); // index in archvector |
686 | object_vector_index ACC (RW, archid); // index in archvector |
582 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
687 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
583 | bool ACC (RW, stub); // if true, this is an invalid archetype |
|
|
584 | |
688 | |
585 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
689 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
586 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
690 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
|
|
691 | |
|
|
692 | // support for archetype loading |
|
|
693 | static archetype *read (object_thawer &f); |
|
|
694 | MTH static void commit_load (); // commit any objects loaded, resolves cyclic dependencies and more |
|
|
695 | static void postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch); /* postpone other_arch reference */ |
587 | }; |
696 | }; |
|
|
697 | |
|
|
698 | // compatbiility, remove once replaced by ->instance |
|
|
699 | inline object * |
|
|
700 | arch_to_object (archetype *at) |
|
|
701 | { |
|
|
702 | return at->instance (); |
|
|
703 | } |
588 | |
704 | |
589 | inline void |
705 | inline void |
590 | object_freezer::put (keyword k, archetype *v) |
706 | object_freezer::put (keyword k, archetype *v) |
591 | { |
707 | { |
592 | put (k, v ? &v->archname : (const char *)0); |
708 | put (k, v ? &v->archname : (const char *)0); |
… | |
… | |
598 | |
714 | |
599 | extern objectvec objects; |
715 | extern objectvec objects; |
600 | extern activevec actives; |
716 | extern activevec actives; |
601 | extern archvec archetypes; |
717 | extern archvec archetypes; |
602 | |
718 | |
|
|
719 | // "safely" iterate over inv in a way such that the current item is removable |
|
|
720 | // quite horrible, thats why its hidden in some macro |
|
|
721 | #define for_inv_removable(op,var) \ |
|
|
722 | for (object *var, *next_ = (op)->inv; (var = next_), var && (next_ = var->below), var; ) |
|
|
723 | |
603 | #define for_all_objects(var) \ |
724 | #define for_all_objects(var) \ |
604 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
725 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
605 | statementvar (object *, var, objects [_i]) |
726 | statementvar (object *, var, objects [_i]) |
606 | |
727 | |
607 | #define for_all_actives(var) \ |
728 | #define for_all_actives(var) \ |
608 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
729 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
609 | statementvar (object *, var, actives [_i]) |
730 | statementvar (object *, var, actives [_i]) |
610 | |
731 | |
611 | #define for_all_archetypes(var) \ |
732 | #define for_all_archetypes(var) \ |
612 | for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ |
733 | for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ |
613 | statementvar (archetype *, var, archetypes [_i]) |
734 | statementvar (archetype *, var, archetypes [_i]) |
614 | |
735 | |
615 | /* Used by update_object to know if the object being passed is |
736 | /* Used by update_object to know if the object being passed is |
616 | * being added or removed. |
737 | * being added or removed. |
… | |
… | |
635 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
756 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
636 | * Use for treasure chests so the new object is the highest thing |
757 | * Use for treasure chests so the new object is the highest thing |
637 | * beneath the player, but not actually above it. Note - the |
758 | * beneath the player, but not actually above it. Note - the |
638 | * map and x,y coordinates for the object to be inserted must |
759 | * map and x,y coordinates for the object to be inserted must |
639 | * match the originator. |
760 | * match the originator. |
640 | * INS_MAP_LOAD: disable lots of checkings done at insertion to |
|
|
641 | * speed up map loading process, as we assume the ordering in |
|
|
642 | * loaded map is correct. |
|
|
643 | * |
761 | * |
644 | * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY |
762 | * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY |
645 | * are mutually exclusive. The behaviour for passing more than one |
763 | * are mutually exclusive. The behaviour for passing more than one |
646 | * should be considered undefined - while you may notice what happens |
764 | * should be considered undefined - while you may notice what happens |
647 | * right now if you pass more than one, that could very well change |
765 | * right now if you pass more than one, that could very well change |
… | |
… | |
650 | #define INS_NO_MERGE 0x0001 |
768 | #define INS_NO_MERGE 0x0001 |
651 | #define INS_ABOVE_FLOOR_ONLY 0x0002 |
769 | #define INS_ABOVE_FLOOR_ONLY 0x0002 |
652 | #define INS_NO_WALK_ON 0x0004 |
770 | #define INS_NO_WALK_ON 0x0004 |
653 | #define INS_ON_TOP 0x0008 |
771 | #define INS_ON_TOP 0x0008 |
654 | #define INS_BELOW_ORIGINATOR 0x0010 |
772 | #define INS_BELOW_ORIGINATOR 0x0010 |
655 | #define INS_MAP_LOAD 0x0020 |
|
|
656 | |
773 | |
657 | #define ARCH_DEPLETION "depletion" |
774 | #define ARCH_DEPLETION "depletion" |
658 | |
775 | |
659 | #endif |
776 | #endif |
660 | |
777 | |