server/include/face.h

/*
 * CrossFire, A Multiplayer game for X-windows
 * 
 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
 * Copyright (C) 1994 Mark Wedel
 * Copyright (C) 1992 Frank Tore Johansen
 * 
 * This program 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 2 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, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * The author can be reached via e-mail to mark@pyramid.com
 */
#ifndef FACE_H__
#define FACE_H__

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

#define CHKSUM_SIZE (128 / 8)
#define MAX_FACES 10000 // stupid gcfclient artificially limits

typedef uint16 faceidx;

extern faceidx blank_face, empty_face;

/* 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;
  faceidx number;               /* This is the image id.  It should be the */
                                /* same value as its position in the array */
  uint8 visibility;
  uint8 magicmap;               /* Color to show this in magic map */
};

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

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;
extern std::vector<facedata> face32, face64;

/* 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.
 */
int face_find (const char *name, int defidx = 0);
facedata *face_data (int idx, int faceset);

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

struct animation
{
  shstr name;                   /* Name of the animation sequence */
  uint8 num_animations;         /* How many different faces to animate */
  uint8 facings;                /* How many facings (1,2,4,8) */
  faceidx *faces;               /* The different animations */
  uint16 num;                   /* Where we are in the array */
};

#endif

Revision:	1.9
Committed:	Sun Mar 11 02:12:44 2007 UTC (17 years, 2 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.8:	+44 -5 lines
Log Message:	- MAJOR CHANGE - you now need to use cfutil to install arches. - former bigfaces are broken in the server - bigfaces are no longer supported. at all. - use face numbers instead of pointers * saves lotsa space * saves lotsa indirections * saves lots(?) cpu cycles - completely rewrote face handling - faces can now be added at runtime - reload will add new faces - this does not apply to animations - use a hastable instead of binary search (faster) for faces - face caching is broken - facesets are gone - server always reports MAX_FACES to any client who asks
#	User	Rev	Content
1	root	1.1	/*
2	pippijn	1.7	* CrossFire, A Multiplayer game for X-windows
3			*
4			* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5			* Copyright (C) 1994 Mark Wedel
6			* Copyright (C) 1992 Frank Tore Johansen
7			*
8			* This program 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 2 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, write to the Free Software
20			* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21			*
22			* The author can be reached via e-mail to mark@pyramid.com
23			*/
24	root	1.9	#ifndef FACE_H__
25			#define FACE_H__
26
27			#include <string>
28			#include <tr1/unordered_map>
29
30			#define CHKSUM_SIZE (128 / 8)
31			#define MAX_FACES 10000 // stupid gcfclient artificially limits
32
33			typedef uint16 faceidx;
34
35			extern faceidx blank_face, empty_face;
36	root	1.1
37			/* New face structure - this enforces the notion that data is face by
38			* face only - you can not change the color of an item - you need to instead
39			* create a new face with that color.
40			*/
41	root	1.9	struct faceinfo
42	root	1.3	{
43	root	1.9	shstr name;
44			faceidx number; /* This is the image id. It should be the */
45	root	1.2	/* same value as its position in the array */
46	root	1.3	uint8 visibility;
47			uint8 magicmap; /* Color to show this in magic map */
48	root	1.4	};
49	root	1.3
50	root	1.9	struct facedata
51			{
52			std::string data;
53			uint8 chksum[CHKSUM_SIZE];
54			};
55
56			typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> >, true> facehash_t;
57
58			extern facehash_t facehash;
59			extern std::vector<faceinfo> faces;
60			extern std::vector<facedata> face32, face64;
61
62			/* This returns an the face number of face 'name'. Number is constant
63			* during an invocation, but not necessarily between versions (this
64			* is because the faces are arranged in alphabetical order, so
65			* if a face is removed or added, all faces after that will now
66			* have a different number.
67			*
68			* If a face is not found, then defidx is returned. This can be useful
69			* if you want some default face used, or can be set to negative so that
70			* it will be known that the face could not be found.
71			*/
72			int face_find (const char *name, int defidx = 0);
73			facedata *face_data (int idx, int faceset);
74
75	root	1.4	struct MapLook
76	root	1.3	{
77	root	1.9	faceinfo *face;
78	root	1.3	uint8 flags;
79	root	1.4	};
80	root	1.1
81	root	1.8	struct animation
82	root	1.3	{
83			shstr name; /* Name of the animation sequence */
84			uint8 num_animations; /* How many different faces to animate */
85			uint8 facings; /* How many facings (1,2,4,8) */
86	root	1.9	faceidx faces; / The different animations */
87	root	1.3	uint16 num; /* Where we are in the array */
88	root	1.4	};
89	root	1.1
90	root	1.9	#endif
91