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.149 by root, Mon Sep 10 12:44:06 2007 UTC vs.
Revision 1.162 by root, Sun Apr 20 22:03:21 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; }
94};
95 101
96extern void init_uuid (); 102 typedef char BUF [32];
97extern UUID gen_uuid (); 103
98extern const uint64 UUID_SKIP; 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 }
122};
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?
… …
297 { 321 {
298 if (!flag [FLAG_REMOVED]) 322 if (!flag [FLAG_REMOVED])
299 do_remove (); 323 do_remove ();
300 } 324 }
301 325
326 MTH bool blocked (maptile *m, int x, int y) const;
327
302 void move_to (const mapxy &pos) 328 void move_to (const mapxy &pos)
303 { 329 {
304 remove (); 330 remove ();
305 *this = pos; 331 *this = pos;
306 insert_at (this, this); 332 insert_at (this, this);
… …
358 return nrof ? nrof : 1; 384 return nrof ? nrof : 1;
359 } 385 }
360 386
361 uint64 total_weight () const 387 uint64 total_weight () const
362 { 388 {
363 return weight * number_of (); 389 return weight * number_of () + carrying;
364 } 390 }
365 391
366 // return the dominant material of this item, always return something 392 // return the dominant material of this item, always return something
367 const materialtype_t *dominant_material () const; 393 const materialtype_t *dominant_material () const;
368 394
… …
443 MTH void activate (); 469 MTH void activate ();
444 MTH void deactivate (); 470 MTH void deactivate ();
445 MTH void activate_recursive (); 471 MTH void activate_recursive ();
446 MTH void deactivate_recursive (); 472 MTH void deactivate_recursive ();
447 473
448 // set the givne flag on all objects in the inventory recursively 474 // set the given flag on all objects in the inventory recursively
449 MTH void set_flag_inv (int flag, int value = 1); 475 MTH void set_flag_inv (int flag, int value = 1);
450 476
451 void enter_exit (object *exit);//Perl 477 void enter_exit (object *exit);//Perl
452 MTH void enter_map (maptile *newmap, int x, int y); 478 MTH void enter_map (maptile *newmap, int x, int y);
453 479
… …
505 MTH struct region *region () const; 531 MTH struct region *region () const;
506 532
507 void statusmsg (const char *msg, int color = NDI_BLACK); 533 void statusmsg (const char *msg, int color = NDI_BLACK);
508 void failmsg (const char *msg, int color = NDI_RED); 534 void failmsg (const char *msg, int color = NDI_RED);
509 535
536 const char *query_inventory (object *who = 0, const char *indent = "");
537
510 MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference 538 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 539 static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible
512 540
513protected: 541protected:
514 void link (); 542 void link ();
… …
544} objectlink; 572} objectlink;
545 573
546typedef struct oblinkpt 574typedef struct oblinkpt
547{ /* Used to link together several object links */ 575{ /* Used to link together several object links */
548 struct oblnk *link; 576 struct oblnk *link;
549 long value; /* Used as connected value in buttons/gates */ 577 sint32 value; /* Used as connected value in buttons/gates */
550 struct oblinkpt *next; 578 struct oblinkpt *next;
551} oblinkpt; 579} oblinkpt;
552 580
553object *find_skill_by_name (object *who, const char *name); 581object *find_skill_by_name (object *who, const char *name);
554object *find_skill_by_name (object *who, const shstr &sh); 582object *find_skill_by_name (object *who, const shstr &sh);
… …
564 */ 592 */
565 593
566INTERFACE_CLASS (archetype) 594INTERFACE_CLASS (archetype)
567struct archetype : object 595struct archetype : object
568{ 596{
597 static arch_ptr empty; // the empty_archetype
598 MTH static void gc ();
599
569 archetype (const char *name); 600 archetype (const char *name);
570 ~archetype (); 601 ~archetype ();
571 void gather_callbacks (AV *&callbacks, event_type event) const; 602 void gather_callbacks (AV *&callbacks, event_type event) const;
572 603
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); 604 MTH static archetype *find (const_utf8_string name);
577 605
578 MTH void link (); 606 MTH void link ();
579 MTH void unlink (); 607 MTH void unlink ();
580 608
609 MTH object *instance ();
610
581 object_vector_index ACC (RW, archid); // index in archvector 611 object_vector_index ACC (RW, archid); // index in archvector
582 shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ 612 shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */
583 bool ACC (RW, stub); // if true, this is an invalid archetype
584 613
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...) */ 614 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); 615 sint8 ACC (RW, max_x), ACC (RW, max_y);
616
617 // support for archetype loading
618 static archetype *read (object_thawer &f);
619 MTH static void commit_load (); // commit any objects loaded, resolves cyclic dependencies and more
620 static void postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch); /* postpone other_arch reference */
587}; 621};
588 622
589inline void 623inline void
590object_freezer::put (keyword k, archetype *v) 624object_freezer::put (keyword k, archetype *v)
591{ 625{
… …
635 * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - 669 * INS_BELOW_ORIGINATOR: Insert new object immediately below originator -
636 * Use for treasure chests so the new object is the highest thing 670 * Use for treasure chests so the new object is the highest thing
637 * beneath the player, but not actually above it. Note - the 671 * beneath the player, but not actually above it. Note - the
638 * map and x,y coordinates for the object to be inserted must 672 * map and x,y coordinates for the object to be inserted must
639 * match the originator. 673 * 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 * 674 *
644 * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY 675 * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY
645 * are mutually exclusive. The behaviour for passing more than one 676 * are mutually exclusive. The behaviour for passing more than one
646 * should be considered undefined - while you may notice what happens 677 * should be considered undefined - while you may notice what happens
647 * right now if you pass more than one, that could very well change 678 * right now if you pass more than one, that could very well change
… …
650#define INS_NO_MERGE 0x0001 681#define INS_NO_MERGE 0x0001
651#define INS_ABOVE_FLOOR_ONLY 0x0002 682#define INS_ABOVE_FLOOR_ONLY 0x0002
652#define INS_NO_WALK_ON 0x0004 683#define INS_NO_WALK_ON 0x0004
653#define INS_ON_TOP 0x0008 684#define INS_ON_TOP 0x0008
654#define INS_BELOW_ORIGINATOR 0x0010 685#define INS_BELOW_ORIGINATOR 0x0010
655#define INS_MAP_LOAD 0x0020
656 686
657#define ARCH_DEPLETION "depletion" 687#define ARCH_DEPLETION "depletion"
658 688
659#endif 689#endif
660 690

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines