server/include/face.h

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 *
 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 *
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero 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 Affero GNU General Public License
 * and 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 <support@deliantra.net>
 */

#ifndef FACE_H__
#define FACE_H__

#include <util.h>
#include <tr1/unordered_map>

#define CHKSUM_MAXLEN 15
#define MAX_FACES 65535 // we reserve face #65535

extern faceidx blank_face, empty_face, magicmouth_face;

struct facedata
{
  uint32_t size;
  uint32_t fofs; // file offste in facedatax
  uint8 chksum[CHKSUM_MAXLEN];
  uint8 chksum_len;

  facedata ()
  : size (0), fofs (0), chksum_len (0)
  { }
};

/* 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
{
  faceinfo ()
  : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1), meta_hv (0)
  {
  }

  shstr name;
  HV *meta_hv; /* note, no destructor of copy constructor, must never be freed, but can be moved aorund */
  facedata face[3];             // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text
  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 */

  facedata *data (int faceset) const;

  int refcnt; // reference count - 1
  void ref () { ++refcnt; }
  void unref ();
};

inline void
object_freezer::put (const keyword_string k, faceinfo *v)
{
  if (expect_true (v))
    put (k, v->name);
  else
    put (k);
}

typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > 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);
faceidx face_alloc ();
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> > > animhash_t;

extern std::vector<animation> animations;

#endif

Revision:	1.42
Committed:	Sun Nov 11 04:29:11 2012 UTC (11 years, 6 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.41:	+3 -4 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	root	1.1	/*
2	root	1.24	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	root	1.40	*
4	root	1.38	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.40	*
6	root	1.27	* Deliantra is free software: you can redistribute it and/or modify it under
7			* the terms of the Affero GNU General Public License as published by the
8			* Free Software Foundation, either version 3 of the License, or (at your
9			* option) any later version.
10	root	1.40	*
11	root	1.18	* This program is distributed in the hope that it will be useful,
12			* but WITHOUT ANY WARRANTY; without even the implied warranty of
13			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14			* GNU General Public License for more details.
15	root	1.40	*
16	root	1.27	* You should have received a copy of the Affero GNU General Public License
17			* and the GNU General Public License along with this program. If not, see
18			* <http://www.gnu.org/licenses/>.
19	root	1.40	*
20	root	1.24	* The authors can be reached via e-mail to <support@deliantra.net>
21	pippijn	1.7	*/
22	root	1.15
23	root	1.9	#ifndef FACE_H__
24			#define FACE_H__
25
26	root	1.37	#include <util.h>
27	root	1.9	#include <tr1/unordered_map>
28
29	root	1.31	#define CHKSUM_MAXLEN 15
30	root	1.41	#define MAX_FACES 65535 // we reserve face #65535
31	root	1.9
32	root	1.34	extern faceidx blank_face, empty_face, magicmouth_face;
33	root	1.1
34	root	1.10	struct facedata
35			{
36	root	1.42	uint32_t size;
37			uint32_t fofs; // file offste in facedatax
38	root	1.31	uint8 chksum[CHKSUM_MAXLEN];
39			uint8 chksum_len;
40	root	1.32
41			facedata ()
42	root	1.42	: size (0), fofs (0), chksum_len (0)
43	root	1.32	{ }
44	root	1.10	};
45
46	root	1.1	/* New face structure - this enforces the notion that data is face by
47			* face only - you can not change the color of an item - you need to instead
48			* create a new face with that color.
49			*/
50	elmex	1.23	struct faceinfo
51	root	1.3	{
52	elmex	1.23	faceinfo ()
53	root	1.39	: number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1), meta_hv (0)
54	elmex	1.23	{
55			}
56
57	root	1.9	shstr name;
58	root	1.39	HV meta_hv; / note, no destructor of copy constructor, must never be freed, but can be moved aorund */
59	root	1.35	facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text
60	root	1.9	faceidx number; /* This is the image id. It should be the */
61	root	1.2	/* same value as its position in the array */
62	root	1.10	faceidx smooth; /* the smooth face for this face, or 0 */
63	root	1.19	uint8 type; // 0 normal face, otherwise other resource
64	root	1.13	uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
65	root	1.3	uint8 visibility;
66			uint8 magicmap; /* Color to show this in magic map */
67	root	1.11
68	root	1.20	facedata *data (int faceset) const;
69	root	1.37
70			int refcnt; // reference count - 1
71			void ref () { ++refcnt; }
72			void unref ();
73	root	1.4	};
74	root	1.3
75	root	1.16	inline void
76	root	1.30	object_freezer::put (const keyword_string k, faceinfo *v)
77	root	1.16	{
78	root	1.30	if (expect_true (v))
79			put (k, v->name);
80			else
81			put (k);
82	root	1.16	}
83
84	root	1.26	typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> > > facehash_t;
85	root	1.9
86			extern facehash_t facehash;
87			extern std::vector<faceinfo> faces;
88
89			/* This returns an the face number of face 'name'. Number is constant
90			* during an invocation, but not necessarily between versions (this
91			* is because the faces are arranged in alphabetical order, so
92			* if a face is removed or added, all faces after that will now
93			* have a different number.
94			*
95			* If a face is not found, then defidx is returned. This can be useful
96			* if you want some default face used, or can be set to negative so that
97			* it will be known that the face could not be found.
98			*/
99	root	1.10	faceidx face_find (const char *name, faceidx defidx = 0);
100	root	1.37	faceidx face_alloc ();
101	root	1.10	faceinfo *face_info (faceidx idx);
102			facedata *face_data (faceidx idx, int faceset);
103	root	1.9
104	root	1.4	struct MapLook
105	root	1.3	{
106	root	1.9	faceinfo *face;
107	root	1.3	uint8 flags;
108	root	1.4	};
109	root	1.1
110	root	1.14	typedef uint16 animidx;
111
112	root	1.8	struct animation
113	root	1.3	{
114	root	1.21	faceidx faces; / The different animations */
115			int num_animations; /* How many different faces to animate */
116			sint8 facings; /* How many facings (1,2,4,8) */
117			animidx number;
118	root	1.3	shstr name; /* Name of the animation sequence */
119	root	1.14
120			static animation &create (const char *name, uint8 frames, uint8 facings = 1);
121			static animation &find (const char *name);
122
123			void resize (int new_size);
124	root	1.4	};
125	root	1.1
126	root	1.26	typedef std::tr1::unordered_map<const char , int, str_hash, str_equal, slice_allocator< std::pair<const char const, int> > > animhash_t;
127	root	1.14
128			extern std::vector<animation> animations;
129
130	root	1.9	#endif
131