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 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra 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 |
… | |
… | |
65 | const char *nonuse_name; /* Name to describe objects we can't use */ |
65 | const char *nonuse_name; /* Name to describe objects we can't use */ |
66 | } Body_Locations; |
66 | } Body_Locations; |
67 | |
67 | |
68 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
68 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
69 | |
69 | |
|
|
70 | #define NUM_COINS 4 /* number of coin types */ |
|
|
71 | extern const char *const coins[NUM_COINS + 1]; |
|
|
72 | |
70 | /* |
73 | /* |
71 | * Each object (this also means archetypes!) could have a few of these |
74 | * Each object (this also means archetypes!) could have a few of these |
72 | * "dangling" from it; this could also end up containing 'parse errors'. |
75 | * "dangling" from it; this could also end up containing 'parse errors'. |
73 | * |
76 | * |
74 | * key and value are shared-strings. |
77 | * key and value are shared-strings. |
… | |
… | |
85 | |
88 | |
86 | struct UUID |
89 | struct UUID |
87 | { |
90 | { |
88 | uint64 seq; |
91 | uint64 seq; |
89 | |
92 | |
|
|
93 | static UUID cur; // last uuid generated |
|
|
94 | static void init (); |
|
|
95 | static UUID gen (); |
|
|
96 | |
90 | UUID () { } |
97 | UUID () { } |
91 | UUID (uint64 seq) : seq(seq) { } |
98 | UUID (uint64 seq) : seq(seq) { } |
92 | operator uint64() { return seq; } |
99 | operator uint64() { return seq; } |
93 | void operator =(uint64 seq) { this->seq = seq; } |
100 | void operator =(uint64 seq) { this->seq = seq; } |
|
|
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? |
… | |
… | |
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 */ |
… | |
… | |
288 | MTH void destroy (bool destroy_inventory = false); |
312 | MTH void destroy (bool destroy_inventory = false); |
289 | |
313 | |
290 | // recursively destroy all objects in inventory, optionally dropping them to the ground instead |
314 | // recursively destroy all objects in inventory, optionally dropping them to the ground instead |
291 | MTH void destroy_inv (bool drop_to_ground = false); |
315 | MTH void destroy_inv (bool drop_to_ground = false); |
292 | MTH object *insert (object *item); // insert into inventory |
316 | MTH object *insert (object *item); // insert into inventory |
293 | MTH void play_sound (faceidx sound) const; |
317 | MTH void play_sound (faceidx sound); |
294 | |
318 | |
295 | void do_remove (); |
319 | void do_remove (); |
296 | MTH void remove () |
320 | MTH void remove () |
297 | { |
321 | { |
298 | if (!flag [FLAG_REMOVED]) |
322 | if (!flag [FLAG_REMOVED]) |
… | |
… | |
353 | // info must hold 256 * 3 bytes currently |
377 | // info must hold 256 * 3 bytes currently |
354 | const char *debug_desc (char *info) const; |
378 | const char *debug_desc (char *info) const; |
355 | MTH const char *debug_desc () const; // uses at least 3 round-robin buffers |
379 | MTH const char *debug_desc () const; // uses at least 3 round-robin buffers |
356 | const char *flag_desc (char *desc, int len) const; |
380 | const char *flag_desc (char *desc, int len) const; |
357 | |
381 | |
|
|
382 | MTH bool decrease (sint32 nr = 1); // returns true if anything is left |
|
|
383 | MTH object *split (sint32 nr = 1); // return 0 on failure |
|
|
384 | |
358 | int number_of () const |
385 | MTH int number_of () const |
359 | { |
386 | { |
360 | return nrof ? nrof : 1; |
387 | return nrof ? nrof : 1; |
361 | } |
388 | } |
362 | |
389 | |
363 | uint64 total_weight () const |
390 | MTH sint32 total_weight () const |
364 | { |
391 | { |
365 | return weight * number_of (); |
392 | return (weight + carrying) * number_of (); |
366 | } |
393 | } |
|
|
394 | |
|
|
395 | MTH void update_weight (); |
367 | |
396 | |
368 | // return the dominant material of this item, always return something |
397 | // return the dominant material of this item, always return something |
369 | const materialtype_t *dominant_material () const; |
398 | const materialtype_t *dominant_material () const; |
370 | |
399 | |
371 | // return the volume of this object in cm³ |
400 | // return the volume of this object in cm³ |
372 | uint64 volume () const |
401 | MTH uint64 volume () const |
373 | { |
402 | { |
374 | return total_weight () |
403 | return total_weight () |
375 | * 1000 |
404 | * 1000 |
376 | * (type == CONTAINER ? 1000 : 1) |
405 | * (type == CONTAINER ? 1000 : 1) |
377 | / dominant_material ()->density; |
406 | / dominant_material ()->density; |
… | |
… | |
401 | /* This return true if object has still randomitems which |
430 | /* This return true if object has still randomitems which |
402 | * could be expanded. |
431 | * could be expanded. |
403 | */ |
432 | */ |
404 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
433 | MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } |
405 | |
434 | |
|
|
435 | // returns the outermost environment, never returns 0 |
|
|
436 | MTH object *outer_env () |
|
|
437 | { |
|
|
438 | for (object *op = this; ; op = op->env) |
|
|
439 | if (!op->env) |
|
|
440 | return op; |
|
|
441 | } |
|
|
442 | |
406 | // returns the player that has this object in his inventory, or 0 |
443 | // returns the player that has this object in his inventory, or 0 |
|
|
444 | // we assume the player is always the outer env |
407 | MTH object *in_player () const |
445 | MTH object *in_player () |
408 | { |
446 | { |
409 | for (object *op = env; op; op = op->env) |
447 | object *op = outer_env (); |
410 | if (op->type == PLAYER) |
|
|
411 | return op; |
|
|
412 | |
448 | |
413 | return 0; |
449 | return op->type == PLAYER ? op : 0; |
414 | } |
450 | } |
415 | |
451 | |
416 | // "temporary" helper function |
452 | // "temporary" helper function |
417 | MTH object *head_ () |
453 | MTH object *head_ () |
418 | { |
454 | { |
… | |
… | |
420 | } |
456 | } |
421 | |
457 | |
422 | MTH bool is_head () |
458 | MTH bool is_head () |
423 | { |
459 | { |
424 | return head_ () == this; |
460 | return head_ () == this; |
|
|
461 | } |
|
|
462 | |
|
|
463 | MTH bool is_on_map () const |
|
|
464 | { |
|
|
465 | return !env && !flag [FLAG_REMOVED]; |
425 | } |
466 | } |
426 | |
467 | |
427 | MTH std::string long_desc (object *who = 0); |
468 | MTH std::string long_desc (object *who = 0); |
428 | MTH std::string describe_monster (object *who = 0); |
469 | MTH std::string describe_monster (object *who = 0); |
429 | MTH std::string describe_item (object *who = 0); |
470 | MTH std::string describe_item (object *who = 0); |
… | |
… | |
445 | MTH void activate (); |
486 | MTH void activate (); |
446 | MTH void deactivate (); |
487 | MTH void deactivate (); |
447 | MTH void activate_recursive (); |
488 | MTH void activate_recursive (); |
448 | MTH void deactivate_recursive (); |
489 | MTH void deactivate_recursive (); |
449 | |
490 | |
450 | // set the givne flag on all objects in the inventory recursively |
491 | // set the given flag on all objects in the inventory recursively |
451 | MTH void set_flag_inv (int flag, int value = 1); |
492 | MTH void set_flag_inv (int flag, int value = 1); |
452 | |
493 | |
453 | void enter_exit (object *exit);//Perl |
494 | void enter_exit (object *exit);//Perl |
454 | MTH void enter_map (maptile *newmap, int x, int y); |
495 | MTH void enter_map (maptile *newmap, int x, int y); |
455 | |
496 | |
… | |
… | |
548 | } objectlink; |
589 | } objectlink; |
549 | |
590 | |
550 | typedef struct oblinkpt |
591 | typedef struct oblinkpt |
551 | { /* Used to link together several object links */ |
592 | { /* Used to link together several object links */ |
552 | struct oblnk *link; |
593 | struct oblnk *link; |
553 | long value; /* Used as connected value in buttons/gates */ |
594 | sint32 value; /* Used as connected value in buttons/gates */ |
554 | struct oblinkpt *next; |
595 | struct oblinkpt *next; |
555 | } oblinkpt; |
596 | } oblinkpt; |
556 | |
597 | |
557 | object *find_skill_by_name (object *who, const char *name); |
598 | object *find_skill_by_name (object *who, const char *name); |
558 | object *find_skill_by_name (object *who, const shstr &sh); |
599 | object *find_skill_by_name (object *who, const shstr &sh); |
… | |
… | |
568 | */ |
609 | */ |
569 | |
610 | |
570 | INTERFACE_CLASS (archetype) |
611 | INTERFACE_CLASS (archetype) |
571 | struct archetype : object |
612 | struct archetype : object |
572 | { |
613 | { |
|
|
614 | static arch_ptr empty; // the empty_archetype |
|
|
615 | MTH static void gc (); |
|
|
616 | |
573 | archetype (const char *name); |
617 | archetype (const char *name); |
574 | ~archetype (); |
618 | ~archetype (); |
575 | void gather_callbacks (AV *&callbacks, event_type event) const; |
619 | void gather_callbacks (AV *&callbacks, event_type event) const; |
576 | |
620 | |
577 | static archetype *read (object_thawer &f); |
|
|
578 | |
|
|
579 | MTH static archetype *get (const_utf8_string name); // find or create |
|
|
580 | MTH static archetype *find (const_utf8_string name); |
621 | MTH static archetype *find (const_utf8_string name); |
581 | |
622 | |
582 | MTH void link (); |
623 | MTH void link (); |
583 | MTH void unlink (); |
624 | MTH void unlink (); |
584 | |
625 | |
585 | MTH object *instance (); |
626 | MTH object *instance (); |
586 | |
627 | |
587 | object_vector_index ACC (RW, archid); // index in archvector |
628 | object_vector_index ACC (RW, archid); // index in archvector |
588 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
629 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
589 | bool ACC (RW, stub); // if true, this is an invalid archetype |
|
|
590 | |
630 | |
591 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
631 | sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
592 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
632 | sint8 ACC (RW, max_x), ACC (RW, max_y); |
|
|
633 | |
|
|
634 | // support for archetype loading |
|
|
635 | static archetype *read (object_thawer &f); |
|
|
636 | MTH static void commit_load (); // commit any objects loaded, resolves cyclic dependencies and more |
|
|
637 | static void postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch); /* postpone other_arch reference */ |
593 | }; |
638 | }; |
594 | |
639 | |
595 | inline void |
640 | inline void |
596 | object_freezer::put (keyword k, archetype *v) |
641 | object_freezer::put (keyword k, archetype *v) |
597 | { |
642 | { |