server/include/face.h

/*
 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
 * 
 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
 * Copyright (©) 1994,2007 Mark Wedel
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Crossfire TRT is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <crossfire@schmorp.de>
 */

#ifndef FACE_H__
#define FACE_H__

#include <string>
#include <tr1/unordered_map>

#define CHKSUM_SIZE 6
#define MAX_FACES 10000 // stupid gcfclient artificially limits

typedef uint16 faceidx;

extern faceidx blank_face, empty_face;

struct facedata
{
  std::string data;
  uint8 chksum[CHKSUM_SIZE];
};

/* New face structure - this enforces the notion that data is face by
 * face only - you can not change the color of an item - you need to instead
 * create a new face with that color.
 */
struct faceinfo
{
  shstr name;
  std::string meta;
  facedata data32, data64;      // either 32/64 face or data32 == generic resource
  faceidx number;               /* This is the image id.  It should be the */
                                /* same value as its position in the array */
  faceidx smooth;               /* the smooth face for this face, or 0 */
  uint8 type;                   // 0 normal face, otherwise other resource
  uint8 smoothlevel;            // smoothlevel is per-face in 2.x servers
  uint8 visibility;
  uint8 magicmap;               /* Color to show this in magic map */

  faceinfo ()
  : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0)
  { }

  facedata *data (int faceset) const;
};

inline void
object_freezer::put (keyword k, faceinfo *v)
{
  put (k, v ? &v->name : (const char *)0);
}

typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t;

extern facehash_t facehash;
extern std::vector<faceinfo> faces;

/* This returns an the face number of face 'name'.  Number is constant
 * during an invocation, but not necessarily between versions (this
 * is because the faces are arranged in alphabetical order, so
 * if a face is removed or added, all faces after that will now
 * have a different number.
 *
 * If a face is not found, then defidx is returned.  This can be useful
 * if you want some default face used, or can be set to negative so that
 * it will be known that the face could not be found.
 */
faceidx face_find (const char *name, faceidx defidx = 0);
faceinfo *face_info (faceidx idx);
facedata *face_data (faceidx idx, int faceset);

struct MapLook
{
  faceinfo *face;
  uint8 flags;
};

typedef uint16 animidx;

struct animation
{
  faceidx *faces;               /* The different animations */
  int num_animations;           /* How many different faces to animate */
  sint8 facings;                /* How many facings (1,2,4,8) */
  animidx number;
  shstr name;                   /* Name of the animation sequence */

  static animation &create (const char *name, uint8 frames, uint8 facings = 1);
  static animation &find (const char *name);

  void resize (int new_size);
};

typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> animhash_t;

extern animhash_t animhash;
extern std::vector<animation> animations;

#endif

Revision:	1.21
Committed:	Sat Sep 15 15:58:06 2007 UTC (16 years, 8 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.20:	+4 -4 lines
Log Message:	- quick work around for gate-move-bug. the real fix is probably to either give everything a movetype OR to treat movetype 0 as special (can move anywhere if there is at leats one movetype not blocked). the latter was too big a change for me to do it, thus just the workaround. - do not do locking on i/o anymore.
#	Content
1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5	* Copyright (©) 1994,2007 Mark Wedel
6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*
8	* Crossfire TRT is free software: you can redistribute it and/or modify
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
11	* (at your option) any later version.
12	*
13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.
17	*
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/>.
20	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>
22	*/
23
24	#ifndef FACE_H__
25	#define FACE_H__
26
27	#include <string>
28	#include <tr1/unordered_map>
29
30	#define CHKSUM_SIZE 6
31	#define MAX_FACES 10000 // stupid gcfclient artificially limits
32
33	typedef uint16 faceidx;
34
35	extern faceidx blank_face, empty_face;
36
37	struct facedata
38	{
39	std::string data;
40	uint8 chksum[CHKSUM_SIZE];
41	};
42
43	/* New face structure - this enforces the notion that data is face by
44	* face only - you can not change the color of an item - you need to instead
45	* create a new face with that color.
46	*/
47	struct faceinfo
48	{
49	shstr name;
50	std::string meta;
51	facedata data32, data64; // either 32/64 face or data32 == generic resource
52	faceidx number; /* This is the image id. It should be the */
53	/* same value as its position in the array */
54	faceidx smooth; /* the smooth face for this face, or 0 */
55	uint8 type; // 0 normal face, otherwise other resource
56	uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
57	uint8 visibility;
58	uint8 magicmap; /* Color to show this in magic map */
59
60	faceinfo ()
61	: number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0)
62	{ }
63
64	facedata *data (int faceset) const;
65	};
66
67	inline void
68	object_freezer::put (keyword k, faceinfo *v)
69	{
70	put (k, v ? &v->name : (const char *)0);
71	}
72
73	typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> >, true> facehash_t;
74
75	extern facehash_t facehash;
76	extern std::vector<faceinfo> faces;
77
78	/* This returns an the face number of face 'name'. Number is constant
79	* during an invocation, but not necessarily between versions (this
80	* is because the faces are arranged in alphabetical order, so
81	* if a face is removed or added, all faces after that will now
82	* have a different number.
83	*
84	* If a face is not found, then defidx is returned. This can be useful
85	* if you want some default face used, or can be set to negative so that
86	* it will be known that the face could not be found.
87	*/
88	faceidx face_find (const char *name, faceidx defidx = 0);
89	faceinfo *face_info (faceidx idx);
90	facedata *face_data (faceidx idx, int faceset);
91
92	struct MapLook
93	{
94	faceinfo *face;
95	uint8 flags;
96	};
97
98	typedef uint16 animidx;
99
100	struct animation
101	{
102	faceidx faces; / The different animations */
103	int num_animations; /* How many different faces to animate */
104	sint8 facings; /* How many facings (1,2,4,8) */
105	animidx number;
106	shstr name; /* Name of the animation sequence */
107
108	static animation &create (const char *name, uint8 frames, uint8 facings = 1);
109	static animation &find (const char *name);
110
111	void resize (int new_size);
112	};
113
114	typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> >, true> animhash_t;
115
116	extern animhash_t animhash;
117	extern std::vector<animation> animations;
118
119	#endif
120