1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * 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 Affero GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #ifndef OBJECT_H |
25 | #ifndef OBJECT_H |
26 | #define OBJECT_H |
26 | #define OBJECT_H |
… | |
… | |
73 | * accessing the list directly. |
73 | * accessing the list directly. |
74 | * Exception is if you want to walk this list for some reason. |
74 | * Exception is if you want to walk this list for some reason. |
75 | */ |
75 | */ |
76 | struct key_value : slice_allocated |
76 | struct key_value : slice_allocated |
77 | { |
77 | { |
78 | key_value *next; |
78 | key_value *next; // must be first element |
79 | shstr key, value; |
79 | shstr key, value; |
|
|
80 | }; |
|
|
81 | |
|
|
82 | // "crossfires version of a perl hash." |
|
|
83 | struct key_values |
|
|
84 | { |
|
|
85 | key_value *first; // must be first element |
|
|
86 | |
|
|
87 | bool empty() const |
|
|
88 | { |
|
|
89 | return !first; |
|
|
90 | } |
|
|
91 | |
|
|
92 | void clear (); |
|
|
93 | shstr_tmp get (shstr_tmp key) const; |
|
|
94 | void del (shstr_tmp key); |
|
|
95 | void set (shstr_tmp key, shstr_tmp value); |
|
|
96 | |
|
|
97 | void add (shstr_tmp key, shstr_tmp value); // liek set, but doesn't check for duplicates |
|
|
98 | void reverse (); // reverses the ordering, to be used after loading an object |
|
|
99 | key_values &operator =(const key_values &kv); |
|
|
100 | |
|
|
101 | // custom extra fields management |
|
|
102 | struct access_proxy |
|
|
103 | { |
|
|
104 | key_values &kv; |
|
|
105 | shstr_tmp key; |
|
|
106 | |
|
|
107 | access_proxy (key_values &kv, shstr_tmp key) |
|
|
108 | : kv (kv), key (key) |
|
|
109 | { |
|
|
110 | } |
|
|
111 | |
|
|
112 | const access_proxy &operator =(shstr_tmp value) const |
|
|
113 | { |
|
|
114 | kv.set (key, value); |
|
|
115 | return *this; |
|
|
116 | } |
|
|
117 | |
|
|
118 | operator const shstr_tmp () const { return kv.get (key); } |
|
|
119 | operator const char *() const { return kv.get (key); } |
|
|
120 | |
|
|
121 | private: |
|
|
122 | void operator =(int); |
|
|
123 | }; |
|
|
124 | |
|
|
125 | const access_proxy operator [](shstr_tmp key) |
|
|
126 | { |
|
|
127 | return access_proxy (*this, key); |
|
|
128 | } |
80 | }; |
129 | }; |
81 | |
130 | |
82 | //-GPL |
131 | //-GPL |
83 | |
132 | |
84 | struct UUID |
133 | struct UUID |
… | |
… | |
245 | |
294 | |
246 | // 8 free bits |
295 | // 8 free bits |
247 | |
296 | |
248 | //float ACC (RW, expmul) = 1.0; /* needed experience = (calc_exp*expmul) - means some */ |
297 | //float ACC (RW, expmul) = 1.0; /* needed experience = (calc_exp*expmul) - means some */ |
249 | // /* races/classes can need less/more exp to gain levels */ |
298 | // /* races/classes can need less/more exp to gain levels */ |
250 | static const float expmul = 1.0;//D |
299 | constexpr static const float expmul = 1.0;//D |
251 | float ACC (RW, move_slow_penalty); /* How much this slows down the object */ |
300 | float ACC (RW, move_slow_penalty); /* How much this slows down the object */ |
252 | |
301 | |
253 | /* Following are values used by any object */ |
302 | /* Following are values used by any object */ |
254 | /* this objects turns into or what this object creates */ |
303 | /* this objects turns into or what this object creates */ |
255 | treasurelist *ACC (RW, randomitems); /* Items to be generated */ |
304 | treasurelist *ACC (RW, randomitems); /* Items to be generated */ |
… | |
… | |
322 | object *ACC (RW, env); /* Pointer to the object which is the environment. |
371 | object *ACC (RW, env); /* Pointer to the object which is the environment. |
323 | * This is typically the container that the object is in. |
372 | * This is typically the container that the object is in. |
324 | */ |
373 | */ |
325 | object *ACC (RW, more); /* Pointer to the rest of a large body of objects */ |
374 | object *ACC (RW, more); /* Pointer to the rest of a large body of objects */ |
326 | object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different |
375 | object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different |
327 | key_value *key_values; /* Fields not explictly known by the loader. */ |
|
|
328 | |
376 | |
329 | MTH void set_flag (int flagnum) |
377 | MTH void set_flag (int flagnum) |
330 | { |
378 | { |
331 | flag [flagnum] = true; |
379 | flag [flagnum] = true; |
332 | } |
380 | } |
… | |
… | |
334 | MTH void clr_flag (int flagnum) |
382 | MTH void clr_flag (int flagnum) |
335 | { |
383 | { |
336 | flag [flagnum] = false; |
384 | flag [flagnum] = false; |
337 | } |
385 | } |
338 | |
386 | |
339 | // privates / perl |
387 | // extra key value pairs |
340 | shstr_tmp kv_get (shstr_tmp key) const; |
388 | key_values kv; |
341 | void kv_del (shstr_tmp key); |
|
|
342 | void kv_set (shstr_tmp key, shstr_tmp value); |
|
|
343 | |
389 | |
344 | //-GPL |
390 | //-GPL |
345 | |
|
|
346 | // custom extra fields management |
|
|
347 | struct key_value_access_proxy |
|
|
348 | { |
|
|
349 | object &ob; |
|
|
350 | shstr_tmp key; |
|
|
351 | |
|
|
352 | key_value_access_proxy (object &ob, shstr_tmp key) |
|
|
353 | : ob (ob), key (key) |
|
|
354 | { |
|
|
355 | } |
|
|
356 | |
|
|
357 | const key_value_access_proxy &operator =(shstr_tmp value) const |
|
|
358 | { |
|
|
359 | ob.kv_set (key, value); |
|
|
360 | return *this; |
|
|
361 | } |
|
|
362 | |
|
|
363 | operator const shstr_tmp () const { return ob.kv_get (key); } |
|
|
364 | operator const char *() const { return ob.kv_get (key); } |
|
|
365 | |
|
|
366 | private: |
|
|
367 | void operator =(int); |
|
|
368 | }; |
|
|
369 | |
|
|
370 | // operator [] is too annoying to use |
|
|
371 | const key_value_access_proxy kv (shstr_tmp key) |
|
|
372 | { |
|
|
373 | return key_value_access_proxy (*this, key); |
|
|
374 | } |
|
|
375 | |
391 | |
376 | bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all |
392 | bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all |
377 | MTH void post_load_check (); // do some adjustments after parsing |
393 | MTH void post_load_check (); // do some adjustments after parsing |
378 | static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. |
394 | static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. |
379 | bool write (object_freezer &f); |
395 | bool write (object_freezer &f); |
… | |
… | |
442 | return op1->value == op2->value |
458 | return op1->value == op2->value |
443 | && op1->name == op2->name |
459 | && op1->name == op2->name |
444 | && can_merge_slow (op1, op2); |
460 | && can_merge_slow (op1, op2); |
445 | } |
461 | } |
446 | |
462 | |
447 | MTH void set_owner (object *owner); |
463 | MTH void set_owner (object_ornull *owner); |
448 | MTH void set_speed (float speed); |
464 | MTH void set_speed (float speed); |
449 | MTH void set_glow_radius (sint8 rad); |
465 | MTH void set_glow_radius (sint8 rad); |
450 | |
466 | |
451 | MTH void open_container (object *new_container); |
467 | MTH void open_container (object *new_container); |
452 | MTH void close_container () |
468 | MTH void close_container () |
… | |
… | |
465 | // strangely enough, using ?: here causes code to inflate |
481 | // strangely enough, using ?: here causes code to inflate |
466 | return type == CONTAINER |
482 | return type == CONTAINER |
467 | && ((env && env->container_ () == this) |
483 | && ((env && env->container_ () == this) |
468 | || (!env && flag [FLAG_APPLIED])); |
484 | || (!env && flag [FLAG_APPLIED])); |
469 | } |
485 | } |
|
|
486 | |
|
|
487 | MTH object *find_spell (const_utf8_string prefix) const; |
470 | |
488 | |
471 | MTH object *force_find (shstr_tmp name); |
489 | MTH object *force_find (shstr_tmp name); |
472 | MTH void force_set_timer (int duration); |
490 | MTH void force_set_timer (int duration); |
473 | MTH object *force_add (shstr_tmp name, int duration = 0); |
491 | MTH object *force_add (shstr_tmp name, int duration = 0); |
474 | |
492 | |
… | |
… | |
505 | MTH int number_of () const |
523 | MTH int number_of () const |
506 | { |
524 | { |
507 | return nrof ? nrof : 1; |
525 | return nrof ? nrof : 1; |
508 | } |
526 | } |
509 | |
527 | |
510 | MTH sint32 total_weight () const |
528 | MTH weight_t total_weight () const |
511 | { |
529 | { |
512 | return (weight + carrying) * number_of (); |
530 | return sint64 (weight + carrying) * number_of (); |
513 | } |
531 | } |
514 | |
532 | |
515 | MTH void update_weight (); |
533 | MTH void update_weight (); |
516 | |
534 | |
517 | // return the dominant material of this item, always return something |
535 | // return the dominant material of this item, always return something |
… | |
… | |
519 | { |
537 | { |
520 | return material; |
538 | return material; |
521 | } |
539 | } |
522 | |
540 | |
523 | // return the volume of this object in cm³ |
541 | // return the volume of this object in cm³ |
524 | MTH uint64 volume () const |
542 | MTH volume_t volume () const |
525 | { |
543 | { |
526 | return (uint64)total_weight () |
544 | return (volume_t)total_weight () |
527 | * 1024 // 1000 actually |
545 | * 1024 // 1000 actually |
528 | * (type == CONTAINER ? 128 : 1) |
546 | * (type == CONTAINER ? 128 : 1) |
529 | / dominant_material ()->density; // ugh, division |
547 | / dominant_material ()->density; // ugh, division |
530 | } |
548 | } |
531 | |
549 | |
… | |
… | |
685 | MTH void activate (); |
703 | MTH void activate (); |
686 | MTH void deactivate (); |
704 | MTH void deactivate (); |
687 | MTH void activate_recursive (); |
705 | MTH void activate_recursive (); |
688 | MTH void deactivate_recursive (); |
706 | MTH void deactivate_recursive (); |
689 | |
707 | |
|
|
708 | // prefetch and activate the surrounding area |
|
|
709 | MTH void prefetch_surrounding_maps (); |
|
|
710 | |
690 | // set the given flag on all objects in the inventory recursively |
711 | // set the given flag on all objects in the inventory recursively |
691 | MTH void set_flag_inv (int flag, int value = 1); |
712 | MTH void set_flag_inv (int flag, int value = 1); |
692 | |
713 | |
693 | void enter_exit (object *exit); // perl |
714 | void enter_exit (object *exit); // perl |
694 | MTH bool enter_map (maptile *newmap, int x, int y); |
715 | MTH bool enter_map (maptile *newmap, int x, int y); |
… | |
… | |
863 | MTH object *instance (); |
884 | MTH object *instance (); |
864 | |
885 | |
865 | MTH void post_load_check (); // do some adjustments after parsing |
886 | MTH void post_load_check (); // do some adjustments after parsing |
866 | |
887 | |
867 | object_vector_index ACC (RW, archid); // index in archvector |
888 | object_vector_index ACC (RW, archid); // index in archvector |
868 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
889 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
869 | |
890 | |
870 | sint8 ACC (RW, max_x); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
891 | sint8 ACC (RW, max_x); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
871 | |
892 | |
872 | // support for archetype loading |
893 | // support for archetype loading |
873 | static archetype *read (object_thawer &f); |
894 | static archetype *read (object_thawer &f); |
… | |
… | |
905 | // "safely" iterate over inv in a way such that the current item is removable |
926 | // "safely" iterate over inv in a way such that the current item is removable |
906 | // quite horrible, that's why its hidden in some macro |
927 | // quite horrible, that's why its hidden in some macro |
907 | #define for_inv_removable(op,var) \ |
928 | #define for_inv_removable(op,var) \ |
908 | for (object *var, *next_ = (op)->inv; (var = next_), var && (next_ = var->below), var; ) |
929 | for (object *var, *next_ = (op)->inv; (var = next_), var && (next_ = var->below), var; ) |
909 | |
930 | |
910 | #define for_all_objects(var) \ |
931 | #define for_all_objects(var) \ |
911 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
932 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
912 | statementvar (object *, var, objects [_i]) |
933 | statementvar (object *, var, objects [_i]) |
913 | |
934 | |
914 | #define for_all_actives(var) \ |
935 | #define for_all_actives(var) \ |
915 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
936 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
916 | statementvar (object *, var, actives [_i]) |
937 | statementvar (object *, var, actives [_i]) |
917 | |
938 | |
918 | #define for_all_archetypes(var) \ |
939 | #define for_all_archetypes(var) \ |
919 | for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ |
940 | for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ |
920 | statementvar (archetype *, var, archetypes [_i]) |
941 | statementvar (archetype *, var, archetypes [_i]) |
921 | |
942 | |
922 | //+GPL |
943 | //+GPL |
923 | |
944 | |
924 | /* Used by update_object to know if the object being passed is |
945 | /* Used by update_object to know if the object being passed is |
… | |
… | |
927 | #define UP_OBJ_INSERT 1 |
948 | #define UP_OBJ_INSERT 1 |
928 | #define UP_OBJ_REMOVE 2 |
949 | #define UP_OBJ_REMOVE 2 |
929 | #define UP_OBJ_CHANGE 3 |
950 | #define UP_OBJ_CHANGE 3 |
930 | #define UP_OBJ_FACE 4 /* Only thing that changed was the face */ |
951 | #define UP_OBJ_FACE 4 /* Only thing that changed was the face */ |
931 | |
952 | |
932 | /* These are flags passed to insert_ob_in_map and |
953 | /* These are flags passed to insert_ob_in_map and |
933 | * insert_ob_in_ob. Note that all flags may not be meaningful |
954 | * insert_ob_in_ob. Note that all flags may not be meaningful |
934 | * for both functions. |
955 | * for both functions. |
935 | * Most are fairly explanatory: |
956 | * Most are fairly explanatory: |
936 | * INS_NO_MERGE: don't try to merge inserted object with ones alrady |
957 | * INS_NO_MERGE: don't try to merge inserted object with ones alrady |
937 | * on space. |
958 | * on space. |