ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/object.h
(Generate patch)

Comparing deliantra/server/include/object.h (file contents):
Revision 1.150 by root, Wed Sep 12 11:10:10 2007 UTC vs.
Revision 1.163 by root, Sun Apr 20 23:25:09 2008 UTC

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 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
68extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; 68extern Body_Locations body_locations[NUM_BODY_LOCATIONS];
69 69
70#define NUM_COINS 4 /* number of coin types */
71extern 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
86struct UUID 89struct 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
96extern void init_uuid ();
97extern UUID gen_uuid ();
98extern 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?
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
358 int number_of () const 382 MTH int number_of () const
359 { 383 {
360 return nrof ? nrof : 1; 384 return nrof ? nrof : 1;
361 } 385 }
362 386
363 uint64 total_weight () const 387 MTH sint32 total_weight () const
364 { 388 {
365 return weight * number_of (); 389 return weight * number_of () + carrying;
366 } 390 }
391
392 MTH void update_weight ();
367 393
368 // return the dominant material of this item, always return something 394 // return the dominant material of this item, always return something
369 const materialtype_t *dominant_material () const; 395 const materialtype_t *dominant_material () const;
370 396
371 // return the volume of this object in cm³ 397 // return the volume of this object in cm³
372 uint64 volume () const 398 MTH uint64 volume () const
373 { 399 {
374 return total_weight () 400 return total_weight ()
375 * 1000 401 * 1000
376 * (type == CONTAINER ? 1000 : 1) 402 * (type == CONTAINER ? 1000 : 1)
377 / dominant_material ()->density; 403 / dominant_material ()->density;
401 /* This return true if object has still randomitems which 427 /* This return true if object has still randomitems which
402 * could be expanded. 428 * could be expanded.
403 */ 429 */
404 MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } 430 MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; }
405 431
432 // returns the outermost environment, never returns 0
433 MTH object *outer_env ()
434 {
435 for (object *op = this; ; op = op->env)
436 if (!op->env)
437 return op;
438 }
439
406 // returns the player that has this object in his inventory, or 0 440 // returns the player that has this object in his inventory, or 0
407 MTH object *in_player () const 441 MTH object *in_player () const
408 { 442 {
409 for (object *op = env; op; op = op->env) 443 for (object *op = env; op; op = op->env)
410 if (op->type == PLAYER) 444 if (op->type == PLAYER)
445 MTH void activate (); 479 MTH void activate ();
446 MTH void deactivate (); 480 MTH void deactivate ();
447 MTH void activate_recursive (); 481 MTH void activate_recursive ();
448 MTH void deactivate_recursive (); 482 MTH void deactivate_recursive ();
449 483
450 // set the givne flag on all objects in the inventory recursively 484 // set the given flag on all objects in the inventory recursively
451 MTH void set_flag_inv (int flag, int value = 1); 485 MTH void set_flag_inv (int flag, int value = 1);
452 486
453 void enter_exit (object *exit);//Perl 487 void enter_exit (object *exit);//Perl
454 MTH void enter_map (maptile *newmap, int x, int y); 488 MTH void enter_map (maptile *newmap, int x, int y);
455 489
507 MTH struct region *region () const; 541 MTH struct region *region () const;
508 542
509 void statusmsg (const char *msg, int color = NDI_BLACK); 543 void statusmsg (const char *msg, int color = NDI_BLACK);
510 void failmsg (const char *msg, int color = NDI_RED); 544 void failmsg (const char *msg, int color = NDI_RED);
511 545
546 const char *query_inventory (object *who = 0, const char *indent = "");
547
512 MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference 548 MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference
513 static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible 549 static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible
514 550
515protected: 551protected:
516 void link (); 552 void link ();
546} objectlink; 582} objectlink;
547 583
548typedef struct oblinkpt 584typedef struct oblinkpt
549{ /* Used to link together several object links */ 585{ /* Used to link together several object links */
550 struct oblnk *link; 586 struct oblnk *link;
551 long value; /* Used as connected value in buttons/gates */ 587 sint32 value; /* Used as connected value in buttons/gates */
552 struct oblinkpt *next; 588 struct oblinkpt *next;
553} oblinkpt; 589} oblinkpt;
554 590
555object *find_skill_by_name (object *who, const char *name); 591object *find_skill_by_name (object *who, const char *name);
556object *find_skill_by_name (object *who, const shstr &sh); 592object *find_skill_by_name (object *who, const shstr &sh);
566 */ 602 */
567 603
568INTERFACE_CLASS (archetype) 604INTERFACE_CLASS (archetype)
569struct archetype : object 605struct archetype : object
570{ 606{
607 static arch_ptr empty; // the empty_archetype
608 MTH static void gc ();
609
571 archetype (const char *name); 610 archetype (const char *name);
572 ~archetype (); 611 ~archetype ();
573 void gather_callbacks (AV *&callbacks, event_type event) const; 612 void gather_callbacks (AV *&callbacks, event_type event) const;
574 613
575 static archetype *read (object_thawer &f);
576
577 MTH static archetype *get (const_utf8_string name); // find or create
578 MTH static archetype *find (const_utf8_string name); 614 MTH static archetype *find (const_utf8_string name);
579 615
580 MTH void link (); 616 MTH void link ();
581 MTH void unlink (); 617 MTH void unlink ();
582 618
619 MTH object *instance ();
620
583 object_vector_index ACC (RW, archid); // index in archvector 621 object_vector_index ACC (RW, archid); // index in archvector
584 shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ 622 shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */
585 bool ACC (RW, stub); // if true, this is an invalid archetype
586 623
587 sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ 624 sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */
588 sint8 ACC (RW, max_x), ACC (RW, max_y); 625 sint8 ACC (RW, max_x), ACC (RW, max_y);
626
627 // support for archetype loading
628 static archetype *read (object_thawer &f);
629 MTH static void commit_load (); // commit any objects loaded, resolves cyclic dependencies and more
630 static void postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch); /* postpone other_arch reference */
589}; 631};
590 632
591inline void 633inline void
592object_freezer::put (keyword k, archetype *v) 634object_freezer::put (keyword k, archetype *v)
593{ 635{
637 * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - 679 * INS_BELOW_ORIGINATOR: Insert new object immediately below originator -
638 * Use for treasure chests so the new object is the highest thing 680 * Use for treasure chests so the new object is the highest thing
639 * beneath the player, but not actually above it. Note - the 681 * beneath the player, but not actually above it. Note - the
640 * map and x,y coordinates for the object to be inserted must 682 * map and x,y coordinates for the object to be inserted must
641 * match the originator. 683 * match the originator.
642 * INS_MAP_LOAD: disable lots of checkings done at insertion to
643 * speed up map loading process, as we assume the ordering in
644 * loaded map is correct.
645 * 684 *
646 * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY 685 * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY
647 * are mutually exclusive. The behaviour for passing more than one 686 * are mutually exclusive. The behaviour for passing more than one
648 * should be considered undefined - while you may notice what happens 687 * should be considered undefined - while you may notice what happens
649 * right now if you pass more than one, that could very well change 688 * right now if you pass more than one, that could very well change
652#define INS_NO_MERGE 0x0001 691#define INS_NO_MERGE 0x0001
653#define INS_ABOVE_FLOOR_ONLY 0x0002 692#define INS_ABOVE_FLOOR_ONLY 0x0002
654#define INS_NO_WALK_ON 0x0004 693#define INS_NO_WALK_ON 0x0004
655#define INS_ON_TOP 0x0008 694#define INS_ON_TOP 0x0008
656#define INS_BELOW_ORIGINATOR 0x0010 695#define INS_BELOW_ORIGINATOR 0x0010
657#define INS_MAP_LOAD 0x0020
658 696
659#define ARCH_DEPLETION "depletion" 697#define ARCH_DEPLETION "depletion"
660 698
661#endif 699#endif
662 700

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines