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,2008 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 | |
… | |
… | |
66 | 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 */ |
67 | } Body_Locations; |
66 | } Body_Locations; |
68 | |
67 | |
69 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
68 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
70 | |
69 | |
|
|
70 | #define NUM_COINS 4 /* number of coin types */ |
|
|
71 | extern const char *const coins[NUM_COINS + 1]; |
|
|
72 | |
71 | /* |
73 | /* |
72 | * 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 |
73 | * "dangling" from it; this could also end up containing 'parse errors'. |
75 | * "dangling" from it; this could also end up containing 'parse errors'. |
74 | * |
76 | * |
75 | * key and value are shared-strings. |
77 | * key and value are shared-strings. |
76 | * |
78 | * |
77 | * 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 |
78 | * accessing the list directly. |
80 | * accessing the list directly. |
79 | * 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. |
80 | */ |
82 | */ |
81 | struct key_value |
83 | struct key_value : slice_allocated |
82 | { |
84 | { |
83 | key_value *next; |
85 | key_value *next; |
84 | shstr key, value; |
86 | shstr key, value; |
85 | }; |
87 | }; |
86 | |
88 | |
87 | struct UUID |
89 | struct UUID |
88 | { |
90 | { |
89 | uint64 seq; |
91 | uint64 seq; |
|
|
92 | |
|
|
93 | static UUID cur; // last uuid generated |
|
|
94 | static void init (); |
|
|
95 | static UUID gen (); |
90 | |
96 | |
91 | UUID () { } |
97 | UUID () { } |
92 | UUID (uint64 seq) : seq(seq) { } |
98 | UUID (uint64 seq) : seq(seq) { } |
93 | operator uint64() { return seq; } |
99 | operator uint64() { return seq; } |
94 | 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 | } |
95 | }; |
122 | }; |
96 | |
|
|
97 | extern void init_uuid (); |
|
|
98 | extern UUID gen_uuid (); |
|
|
99 | extern const uint64 UUID_SKIP; |
|
|
100 | |
123 | |
101 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
124 | /* Definition for WILL_APPLY values. Replaces having harcoded values |
102 | * 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 |
103 | * 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 |
104 | * can_apply and will_apply? |
127 | * can_apply and will_apply? |
… | |
… | |
132 | shstr ACC (RW, name_pl); /* The plural name of the object */ |
155 | shstr ACC (RW, name_pl); /* The plural name of the object */ |
133 | shstr ACC (RW, title); /* Of foo, etc */ |
156 | shstr ACC (RW, title); /* Of foo, etc */ |
134 | shstr ACC (RW, race); /* human, goblin, dragon, etc */ |
157 | shstr ACC (RW, race); /* human, goblin, dragon, etc */ |
135 | shstr ACC (RW, slaying); /* Which race to do double damage to */ |
158 | shstr ACC (RW, slaying); /* Which race to do double damage to */ |
136 | /* If this is an exit, this is the filename */ |
159 | /* If this is an exit, this is the filename */ |
|
|
160 | shstr ACC (RW, tag); // a tag used to tracking this object |
137 | shstr ACC (RW, skill); /* Name of the skill this object uses/grants */ |
161 | shstr ACC (RW, skill); /* Name of the skill this object uses/grants */ |
138 | shstr ACC (RW, msg); /* If this is a book/sign/magic mouth/etc */ |
162 | shstr ACC (RW, msg); /* If this is a book/sign/magic mouth/etc */ |
139 | shstr ACC (RW, lore); /* Obscure information about this object, */ |
163 | shstr ACC (RW, lore); /* Obscure information about this object, */ |
140 | /* To get put into books and the like. */ |
164 | /* To get put into books and the like. */ |
141 | shstr ACC (RW, materialname); /* specific material name */ |
165 | shstr ACC (RW, materialname); /* specific material name */ |
… | |
… | |
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); /* Face with colors */ |
214 | faceidx ACC (RW, face); /* the graphical face */ |
|
|
215 | faceidx ACC (RW, sound); /* the sound face */ |
|
|
216 | faceidx ACC (RW, sound_destroy); /* played on destroy */ |
191 | living ACC (RO, stats); /* Str, Con, Dex, etc */ |
217 | living ACC (RO, stats); /* Str, Con, Dex, etc */ |
192 | /* See the pod/objects.pod for more info about body locations */ |
218 | /* See the pod/objects.pod for more info about body locations */ |
193 | |
219 | |
194 | /* Following mostly refers to fields only used for monsters */ |
220 | /* Following mostly refers to fields only used for monsters */ |
195 | uint32 ACC (RW, hide); /* The object is hidden, not invisible */ |
221 | uint32 ACC (RW, hide); /* The object is hidden, not invisible */ |
… | |
… | |
246 | // These variables are not changed by ->copy_to |
272 | // These variables are not changed by ->copy_to |
247 | maptile_ptr ACC (RW, map); /* Pointer to the map in which this object is present */ |
273 | maptile_ptr ACC (RW, map); /* Pointer to the map in which this object is present */ |
248 | |
274 | |
249 | UUID ACC (RW, uuid); // Unique Identifier, survives saves etc. |
275 | UUID ACC (RW, uuid); // Unique Identifier, survives saves etc. |
250 | int ACC (RO, count); |
276 | int ACC (RO, count); |
251 | int ACC (RO, index); // index into objects |
277 | object_vector_index ACC (RO, index); // index into objects |
252 | int ACC (RO, active); // index into actives |
278 | object_vector_index ACC (RO, active); // index into actives |
253 | |
279 | |
254 | player_ptr ACC (RW, contr); /* Pointer to the player which control this object */ |
280 | player_ptr ACC (RW, contr); /* Pointer to the player which control this object, ALWAYS set *iff* type == PLAYER */ |
255 | |
281 | |
256 | object *ACC (RW, below); /* Pointer to the object stacked below this one */ |
282 | object *ACC (RW, below); /* Pointer to the object stacked below this one */ |
257 | object *ACC (RW, above); /* Pointer to the object stacked above this one */ |
283 | object *ACC (RW, above); /* Pointer to the object stacked above this one */ |
258 | /* Note: stacked in the *same* environment */ |
284 | /* Note: stacked in the *same* environment */ |
259 | object *inv; /* Pointer to the first object in the inventory */ |
285 | object *inv; /* Pointer to the first object in the inventory */ |
… | |
… | |
268 | 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 */ |
269 | 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 |
270 | client_container *seen_by; // seen by which player/container currently? |
296 | client_container *seen_by; // seen by which player/container currently? |
271 | key_value *key_values; /* Fields not explictly known by the loader. */ |
297 | key_value *key_values; /* Fields not explictly known by the loader. */ |
272 | |
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 | |
273 | 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 |
274 | void post_load_check (); // do some adjustments after parsing |
335 | MTH void post_load_check (); // do some adjustments after parsing |
275 | 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. |
276 | bool write (object_freezer &f); |
337 | bool write (object_freezer &f); |
277 | |
338 | |
278 | MTH int slottype () const; |
339 | MTH int slottype () const; |
279 | MTH static object *create (); |
340 | MTH static object *create (); |
280 | object &operator =(const object &src); |
341 | const mapxy &operator =(const mapxy &pos); |
281 | MTH void copy_to (object *dst); |
342 | MTH void copy_to (object *dst); |
282 | MTH object *clone (); // create + copy_to |
343 | MTH object *clone (); // create + copy_to |
283 | void do_destroy (); |
344 | void do_destroy (); |
284 | void gather_callbacks (AV *&callbacks, event_type event) const; |
345 | void gather_callbacks (AV *&callbacks, event_type event) const; |
285 | MTH void destroy (bool destroy_inventory = false); |
346 | MTH void destroy (bool destroy_inventory = false); |
286 | |
347 | |
287 | // recursively destroy all objects in inventory, optionally dropping them to the ground instead |
348 | // recursively destroy all objects in inventory, optionally dropping them to the ground instead |
288 | MTH void destroy_inv (bool drop_to_ground = false); |
349 | MTH void destroy_inv (bool drop_to_ground = false); |
289 | MTH object *insert (object *item); // insert into inventory |
350 | MTH object *insert (object *item); // insert into inventory |
|
|
351 | MTH void play_sound (faceidx sound); |
|
|
352 | |
290 | void do_remove (); |
353 | void do_remove (); |
291 | MTH void remove () |
354 | MTH void remove () |
292 | { |
355 | { |
293 | if (!flag [FLAG_REMOVED]) |
356 | if (!flag [FLAG_REMOVED]) |
294 | do_remove (); |
357 | do_remove (); |
|
|
358 | } |
|
|
359 | |
|
|
360 | MTH bool blocked (maptile *m, int x, int y) const; |
|
|
361 | |
|
|
362 | void move_to (const mapxy &pos) |
|
|
363 | { |
|
|
364 | remove (); |
|
|
365 | *this = pos; |
|
|
366 | insert_at (this, this); |
295 | } |
367 | } |
296 | |
368 | |
297 | static bool can_merge_slow (object *op1, object *op2); |
369 | static bool can_merge_slow (object *op1, object *op2); |
298 | |
370 | |
299 | // this is often used in time-critical code, so optimise |
371 | // this is often used in time-critical code, so optimise |
… | |
… | |
312 | MTH void open_container (object *new_container); |
384 | MTH void open_container (object *new_container); |
313 | MTH void close_container () |
385 | MTH void close_container () |
314 | { |
386 | { |
315 | open_container (0); |
387 | open_container (0); |
316 | } |
388 | } |
|
|
389 | |
|
|
390 | MTH object *force_find (const shstr name); |
|
|
391 | MTH void force_add (const shstr name, int duration = 0); |
317 | |
392 | |
318 | // overwrite the attachable should_invoke function with a version that also checks ev_want_type |
393 | // overwrite the attachable should_invoke function with a version that also checks ev_want_type |
319 | bool should_invoke (event_type event) |
394 | bool should_invoke (event_type event) |
320 | { |
395 | { |
321 | return ev_want_event [event] || ev_want_type [type] || cb; |
396 | return ev_want_event [event] || ev_want_type [type] || cb; |
… | |
… | |
336 | // info must hold 256 * 3 bytes currently |
411 | // info must hold 256 * 3 bytes currently |
337 | const char *debug_desc (char *info) const; |
412 | const char *debug_desc (char *info) const; |
338 | MTH const char *debug_desc () const; // uses at least 3 round-robin buffers |
413 | MTH const char *debug_desc () const; // uses at least 3 round-robin buffers |
339 | const char *flag_desc (char *desc, int len) const; |
414 | const char *flag_desc (char *desc, int len) const; |
340 | |
415 | |
|
|
416 | MTH bool decrease (sint32 nr = 1); // returns true if anything is left |
|
|
417 | MTH object *split (sint32 nr = 1); // return 0 on failure |
|
|
418 | |
341 | int number_of () const |
419 | MTH int number_of () const |
342 | { |
420 | { |
343 | return nrof ? nrof : 1; |
421 | return nrof ? nrof : 1; |
344 | } |
422 | } |
345 | |
423 | |
346 | uint64 total_weight () const |
424 | MTH sint32 total_weight () const |
347 | { |
425 | { |
348 | return weight * number_of (); |
426 | return (weight + carrying) * number_of (); |
349 | } |
427 | } |
|
|
428 | |
|
|
429 | MTH void update_weight (); |
350 | |
430 | |
351 | // return the dominant material of this item, always return something |
431 | // return the dominant material of this item, always return something |
352 | const materialtype_t *dominant_material () const; |
432 | const materialtype_t *dominant_material () const; |
353 | |
433 | |
354 | // return the volume of this object in cm³ |
434 | // return the volume of this object in cm³ |
355 | uint64 volume () const |
435 | MTH uint64 volume () const |
356 | { |
436 | { |
357 | return total_weight () |
437 | return total_weight () |
358 | * 1000 |
438 | * 1000 |
359 | * (type == CONTAINER ? 1000 : 1) |
439 | * (type == CONTAINER ? 1000 : 1) |
360 | / dominant_material ()->density; |
440 | / dominant_material ()->density; |
… | |
… | |
377 | |
457 | |
378 | // temporary: wether the object can be saved in a map file |
458 | // temporary: wether the object can be saved in a map file |
379 | // contr => is a player |
459 | // contr => is a player |
380 | // head => only save head of a multitile object |
460 | // head => only save head of a multitile object |
381 | // owner => can not reference owner yet |
461 | // owner => can not reference owner yet |
382 | MTH bool can_map_save () const { return !contr && !head && !owner && !flag [FLAG_NO_MAP_SAVE]; } |
462 | MTH bool can_map_save () const { return !head && (!owner || owner->contr) && !contr && !flag [FLAG_NO_MAP_SAVE]; } |
383 | |
463 | |
384 | /* This return true if object has still randomitems which |
464 | /* This return true if object has still randomitems which |
385 | * could be expanded. |
465 | * could be expanded. |
386 | */ |
466 | */ |
387 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
467 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
388 | |
468 | |
|
|
469 | // returns the outermost owner, never returns 0 |
|
|
470 | MTH object *outer_owner () |
|
|
471 | { |
|
|
472 | for (object *op = this; ; op = op->owner) |
|
|
473 | if (!op->owner) |
|
|
474 | return op; |
|
|
475 | } |
|
|
476 | |
|
|
477 | // returns the outermost environment, never returns 0 |
|
|
478 | MTH object *outer_env () |
|
|
479 | { |
|
|
480 | for (object *op = this; ; op = op->env) |
|
|
481 | if (!op->env) |
|
|
482 | return op; |
|
|
483 | } |
|
|
484 | |
389 | // returns the player that has this object in his inventory, or 0 |
485 | // returns the player that has this object in his inventory, or 0 |
|
|
486 | // we assume the player is always the outer env |
390 | MTH object *in_player () const |
487 | MTH object *in_player () |
391 | { |
488 | { |
392 | for (object *op = env; op; op = op->env) |
489 | object *op = outer_env (); |
393 | if (op->type == PLAYER) |
|
|
394 | return op; |
|
|
395 | |
490 | |
396 | return 0; |
491 | return op->type == PLAYER ? op : 0; |
397 | } |
492 | } |
398 | |
493 | |
399 | // "temporary" helper function |
494 | // "temporary" helper function |
400 | MTH object *head_ () |
495 | MTH object *head_ () |
401 | { |
496 | { |
402 | return head ? head : this; |
497 | return head ? head : this; |
403 | } |
498 | } |
|
|
499 | |
|
|
500 | MTH bool is_head () |
|
|
501 | { |
|
|
502 | return head_ () == this; |
|
|
503 | } |
|
|
504 | |
|
|
505 | MTH bool is_on_map () const |
|
|
506 | { |
|
|
507 | return !env && !flag [FLAG_REMOVED]; |
|
|
508 | } |
|
|
509 | |
|
|
510 | // returns the player that cna see this object, if any |
|
|
511 | MTH object *visible_to () const; |
404 | |
512 | |
405 | MTH std::string long_desc (object *who = 0); |
513 | MTH std::string long_desc (object *who = 0); |
406 | MTH std::string describe_monster (object *who = 0); |
514 | MTH std::string describe_monster (object *who = 0); |
407 | MTH std::string describe_item (object *who = 0); |
515 | MTH std::string describe_item (object *who = 0); |
408 | MTH std::string describe (object *who = 0); |
516 | MTH std::string describe (object *who = 0); |
… | |
… | |
416 | MTH void create_treasure (treasurelist *tl, int flags = 0); |
524 | MTH void create_treasure (treasurelist *tl, int flags = 0); |
417 | |
525 | |
418 | // insert object at same map position as 'where' |
526 | // insert object at same map position as 'where' |
419 | // handles both inventory and map "positions" |
527 | // handles both inventory and map "positions" |
420 | MTH object *insert_at (object *where, object *originator = 0, int flags = 0); |
528 | MTH object *insert_at (object *where, object *originator = 0, int flags = 0); |
|
|
529 | MTH void drop_unpaid_items (); |
421 | |
530 | |
422 | MTH void activate (); |
531 | MTH void activate (); |
423 | MTH void deactivate (); |
532 | MTH void deactivate (); |
424 | MTH void activate_recursive (); |
533 | MTH void activate_recursive (); |
425 | MTH void deactivate_recursive (); |
534 | MTH void deactivate_recursive (); |
426 | |
535 | |
427 | // set the givne flag on all objects in the inventory recursively |
536 | // set the given flag on all objects in the inventory recursively |
428 | MTH void set_flag_inv (int flag, int value = 1); |
537 | MTH void set_flag_inv (int flag, int value = 1); |
429 | |
538 | |
430 | void enter_exit (object *exit);//Perl |
539 | void enter_exit (object *exit);//Perl |
431 | MTH void enter_map (maptile *newmap, int x, int y); |
540 | MTH void enter_map (maptile *newmap, int x, int y); |
432 | |
541 | |
… | |
… | |
472 | { |
581 | { |
473 | return this; |
582 | return this; |
474 | } |
583 | } |
475 | |
584 | |
476 | /* This returns TRUE if the object is something that |
585 | /* This returns TRUE if the object is something that |
477 | * should be displayed in the floorbox/inventory window |
586 | * a client might want to know about. |
478 | */ |
587 | */ |
479 | MTH bool client_visible () const |
588 | MTH bool client_visible () const |
480 | { |
589 | { |
481 | return !invisible && type != PLAYER; |
590 | return !invisible && type != PLAYER; |
482 | } |
591 | } |
483 | |
592 | |
|
|
593 | // the client does nrof * this weight |
|
|
594 | MTH sint32 client_weight () const |
|
|
595 | { |
|
|
596 | return weight + carrying; |
|
|
597 | } |
|
|
598 | |
484 | MTH struct region *region () const; |
599 | MTH struct region *region () const; |
485 | |
600 | |
|
|
601 | void statusmsg (const char *msg, int color = NDI_BLACK); |
|
|
602 | void failmsg (const char *msg, int color = NDI_RED); |
|
|
603 | |
|
|
604 | const char *query_inventory (object *who = 0, const char *indent = ""); |
|
|
605 | |
|
|
606 | MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference |
|
|
607 | static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible |
|
|
608 | |
486 | protected: |
609 | protected: |
487 | friend struct archetype; |
|
|
488 | |
|
|
489 | void link (); |
610 | void link (); |
490 | void unlink (); |
611 | void unlink (); |
491 | |
612 | |
492 | object (); |
613 | object (); |
493 | ~object (); |
614 | ~object (); |
|
|
615 | |
|
|
616 | private: |
|
|
617 | object &operator =(const object &); |
|
|
618 | object (const object &); |
494 | }; |
619 | }; |
495 | |
620 | |
496 | // move this object to the top of its env's inventory to speed up |
621 | // move this object to the top of its env's inventory to speed up |
497 | // searches for it. |
622 | // searches for it. |
498 | static object * |
623 | static object * |
… | |
… | |
510 | } |
635 | } |
511 | |
636 | |
512 | return ob; |
637 | return ob; |
513 | } |
638 | } |
514 | |
639 | |
515 | typedef object_vector<object, &object::index > objectvec; |
|
|
516 | typedef object_vector<object, &object::active> activevec; |
|
|
517 | |
|
|
518 | extern objectvec objects; |
|
|
519 | extern activevec actives; |
|
|
520 | |
|
|
521 | #define for_all_objects(var) \ |
|
|
522 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
|
|
523 | declvar (object *, var, objects [_i]) |
|
|
524 | |
|
|
525 | #define for_all_actives(var) \ |
|
|
526 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
|
|
527 | declvar (object *, var, actives [_i]) |
|
|
528 | |
|
|
529 | typedef struct oblnk |
640 | typedef struct oblnk |
530 | { /* Used to link together several objects */ |
641 | { /* Used to link together several objects */ |
531 | object_ptr ob; |
642 | object_ptr ob; |
532 | struct oblnk *next; |
643 | struct oblnk *next; |
533 | } objectlink; |
644 | } objectlink; |
534 | |
645 | |
535 | typedef struct oblinkpt |
646 | typedef struct oblinkpt |
536 | { /* Used to link together several object links */ |
647 | { /* Used to link together several object links */ |
537 | struct oblnk *link; |
648 | struct oblnk *link; |
538 | long value; /* Used as connected value in buttons/gates */ |
649 | sint32 value; /* Used as connected value in buttons/gates */ |
539 | struct oblinkpt *next; |
650 | struct oblinkpt *next; |
540 | } oblinkpt; |
651 | } oblinkpt; |
541 | |
652 | |
542 | object *find_skill_by_name (object *who, const char *name); |
653 | object *find_skill_by_name (object *who, const char *name); |
543 | object *find_skill_by_name (object *who, const shstr &sh); |
654 | object *find_skill_by_name (object *who, const shstr &sh); |
… | |
… | |
551 | * object and pointers. This structure should get removed, and just replaced |
662 | * object and pointers. This structure should get removed, and just replaced |
552 | * by the object structure |
663 | * by the object structure |
553 | */ |
664 | */ |
554 | |
665 | |
555 | INTERFACE_CLASS (archetype) |
666 | INTERFACE_CLASS (archetype) |
556 | struct archetype : zero_initialised, attachable |
667 | struct archetype : object |
557 | { |
668 | { |
558 | archetype (); |
669 | static arch_ptr empty; // the empty_archetype |
|
|
670 | MTH static void gc (); |
|
|
671 | |
|
|
672 | archetype (const char *name); |
559 | ~archetype (); |
673 | ~archetype (); |
560 | void gather_callbacks (AV *&callbacks, event_type event) const; |
674 | void gather_callbacks (AV *&callbacks, event_type event) const; |
561 | |
675 | |
|
|
676 | MTH static archetype *find (const_utf8_string name); |
|
|
677 | |
|
|
678 | MTH void link (); |
|
|
679 | MTH void unlink (); |
|
|
680 | |
|
|
681 | MTH static object *get (const char *name); // find()->instance() |
|
|
682 | MTH object *instance (); |
|
|
683 | |
|
|
684 | object_vector_index ACC (RW, archid); // index in archvector |
|
|
685 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
|
|
686 | |
|
|
687 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
|
|
688 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
|
|
689 | |
|
|
690 | // support for archetype loading |
562 | static archetype *read (object_thawer &f); |
691 | static archetype *read (object_thawer &f); |
563 | static archetype *get (const char *name); // find or create |
692 | MTH static void commit_load (); // commit any objects loaded, resolves cyclic dependencies and more |
564 | static archetype *find (const char *name); |
693 | static void postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch); /* postpone other_arch reference */ |
565 | |
|
|
566 | void hash_add (); // add to hashtable |
|
|
567 | void hash_del (); // remove from hashtable |
|
|
568 | |
|
|
569 | shstr ACC (RW, name); /* More definite name, like "generate_kobold" */ |
|
|
570 | struct archetype *ACC (RW, next); /* Next archetype in a linked list */ |
|
|
571 | struct archetype *ACC (RW, head); /* The main part of a linked object */ |
|
|
572 | struct archetype *ACC (RW, more); /* Next part of a linked object */ |
|
|
573 | object ACC (RO, clone); /* An object from which to do ->copy_to () */ |
|
|
574 | uint32 ACC (RW, editable); /* editable flags (mainly for editor) */ |
|
|
575 | bool ACC (RW, linked); // linked into list of heads |
|
|
576 | sint8 ACC (RW, tail_x), ACC (RW, tail_y); /* Where the lower right most portion of the object is |
|
|
577 | * in comparison to the head. |
|
|
578 | */ |
|
|
579 | }; |
694 | }; |
|
|
695 | |
|
|
696 | inline void |
|
|
697 | object_freezer::put (keyword k, archetype *v) |
|
|
698 | { |
|
|
699 | put (k, v ? &v->archname : (const char *)0); |
|
|
700 | } |
|
|
701 | |
|
|
702 | typedef object_vector<object, &object::index > objectvec; |
|
|
703 | typedef object_vector<object, &object::active> activevec; |
|
|
704 | typedef object_vector<archetype, &archetype::archid> archvec; |
|
|
705 | |
|
|
706 | extern objectvec objects; |
|
|
707 | extern activevec actives; |
|
|
708 | extern archvec archetypes; |
|
|
709 | |
|
|
710 | #define for_all_objects(var) \ |
|
|
711 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
|
|
712 | statementvar (object *, var, objects [_i]) |
|
|
713 | |
|
|
714 | #define for_all_actives(var) \ |
|
|
715 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
|
|
716 | statementvar (object *, var, actives [_i]) |
|
|
717 | |
|
|
718 | #define for_all_archetypes(var) \ |
|
|
719 | for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ |
|
|
720 | statementvar (archetype *, var, archetypes [_i]) |
580 | |
721 | |
581 | /* Used by update_object to know if the object being passed is |
722 | /* Used by update_object to know if the object being passed is |
582 | * being added or removed. |
723 | * being added or removed. |
583 | */ |
724 | */ |
584 | #define UP_OBJ_INSERT 1 |
725 | #define UP_OBJ_INSERT 1 |
… | |
… | |
601 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
742 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
602 | * Use for treasure chests so the new object is the highest thing |
743 | * Use for treasure chests so the new object is the highest thing |
603 | * beneath the player, but not actually above it. Note - the |
744 | * beneath the player, but not actually above it. Note - the |
604 | * map and x,y coordinates for the object to be inserted must |
745 | * map and x,y coordinates for the object to be inserted must |
605 | * match the originator. |
746 | * match the originator. |
606 | * INS_MAP_LOAD: disable lots of checkings done at insertion to |
|
|
607 | * speed up map loading process, as we assume the ordering in |
|
|
608 | * loaded map is correct. |
|
|
609 | * |
747 | * |
610 | * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY |
748 | * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY |
611 | * are mutually exclusive. The behaviour for passing more than one |
749 | * are mutually exclusive. The behaviour for passing more than one |
612 | * should be considered undefined - while you may notice what happens |
750 | * should be considered undefined - while you may notice what happens |
613 | * right now if you pass more than one, that could very well change |
751 | * right now if you pass more than one, that could very well change |
… | |
… | |
616 | #define INS_NO_MERGE 0x0001 |
754 | #define INS_NO_MERGE 0x0001 |
617 | #define INS_ABOVE_FLOOR_ONLY 0x0002 |
755 | #define INS_ABOVE_FLOOR_ONLY 0x0002 |
618 | #define INS_NO_WALK_ON 0x0004 |
756 | #define INS_NO_WALK_ON 0x0004 |
619 | #define INS_ON_TOP 0x0008 |
757 | #define INS_ON_TOP 0x0008 |
620 | #define INS_BELOW_ORIGINATOR 0x0010 |
758 | #define INS_BELOW_ORIGINATOR 0x0010 |
621 | #define INS_MAP_LOAD 0x0020 |
|
|
622 | |
759 | |
623 | #define ARCH_SINGULARITY "singularity" |
|
|
624 | #define ARCH_DETECT_MAGIC "detect_magic" |
|
|
625 | #define ARCH_DEPLETION "depletion" |
760 | #define ARCH_DEPLETION "depletion" |
626 | #define ARCH_SYMPTOM "symptom" |
|
|
627 | |
761 | |
628 | #endif |
762 | #endif |
629 | |
763 | |