ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/image.C
(Generate patch)

Comparing deliantra/server/common/image.C (file contents):
Revision 1.21 by root, Wed Mar 14 04:12:27 2007 UTC vs.
Revision 1.45 by root, Sat Nov 17 23:40:00 2018 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
6 * Copyright (C) 1992 Frank Tore Johansen
7 * 6 *
8 * This program is free software; you can redistribute it and/or modify 7 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 8 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation; either version 2 of the License, or 9 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 10 * option) any later version.
12 * 11 *
13 * This program is distributed in the hope that it will be useful, 12 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 15 * 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 * 16 *
22 * The maintainer of this code can be reached at <crossfire@schmorp.de> 17 * You should have received a copy of the Affero GNU General Public License
18 * and the GNU General Public License along with this program. If not, see
19 * <http://www.gnu.org/licenses/>.
20 *
21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24
25 23
26#include <global.h> 24#include <global.h>
27#include <stdio.h> 25#include <stdio.h>
28 26
29#include "face.h" 27#include "face.h"
30#include "crc.h" 28#include "crc.h"
31 29
32faceidx blank_face, empty_face; 30faceidx blank_face, empty_face, magicmouth_face;
33 31
34facehash_t facehash; 32facehash_t facehash;
35std::vector<faceinfo> faces; 33std::vector<faceinfo> faces;
36 34
37/* the only thing this table is used for now is to 35static std::vector<faceidx> faces_freelist;
38 * translate the colorname in the magicmap field of the
39 * face into a numeric index that is then sent to the
40 * client for magic map commands. The order of this table
41 * must match that of the NDI colors in include/newclient.h.
42 */
43static const char *const colorname[] = {
44 "black", /* 0 */
45 "white", /* 1 */
46 "blue", /* 2 */
47 "red", /* 3 */
48 "orange", /* 4 */
49 "light_blue", /* 5 */
50 "dark_orange", /* 6 */
51 "green", /* 7 */
52 "light_green", /* 8 */
53 "grey", /* 9 */
54 "brown", /* 10 */
55 "yellow", /* 11 */
56 "khaki" /* 12 */
57};
58 36
59/* 37faceidx face_alloc ()
60 * Returns the matching color in the coloralias if found,
61 * 0 otherwise. Note that 0 will actually be black, so there is no
62 * way the calling function can tell if an error occurred or not
63 */
64static uint8
65find_color (const char *name)
66{ 38{
67 uint8 i; 39 faceidx idx;
68 40
69 for (i = 0; i < sizeof (colorname) / sizeof (*colorname); i++) 41 if (!faces_freelist.empty ())
70 if (!strcmp (name, colorname[i])) 42 {
71 return i; 43 idx = faces_freelist.back ();
44 faces_freelist.pop_back ();
45 }
46 else
47 {
48 idx = faces.size ();
72 49
73 LOG (llevError, "Unknown color: %s\n", name); 50 if (!idx) // skip index 0
51 idx = 1;
52
53 faces.resize (idx + 1);
54 }
55
74 return 0; 56 return idx;
57}
58
59void
60faceinfo::unref ()
61{
62 if (--refcnt)
63 return;
64
65 refcnt = 1;
66
75} 67}
76 68
77faceidx 69faceidx
78face_find (const char *name, faceidx defidx) 70face_find (const char *name, faceidx defidx)
79{ 71{
72 if (!name)
73 return defidx;
74
80 facehash_t::iterator i = facehash.find (name); 75 facehash_t::iterator i = facehash.find (name);
81 76
82 return i == facehash.end () 77 return i == facehash.end ()
83 ? defidx : i->second; 78 ? defidx : i->second;
84} 79}
… …
93 88
94 return &faces [idx]; 89 return &faces [idx];
95} 90}
96 91
97facedata * 92facedata *
93faceinfo::data (int faceset) const
94{
95 if (!face [faceset].chksum_len)
96 faceset = 0;
97
98 return (facedata *)(face + faceset);
99}
100
101facedata *
98face_data (faceidx idx, int faceset) 102face_data (faceidx idx, int faceset)
99{ 103{
100 if (faceinfo *f = face_info (idx)) 104 if (faceinfo *f = face_info (idx))
101 return &(faceset ? f->data32 : f->data64); 105 return f->data (faceset);
102 106
103 return 0; 107 return 0;
104} 108}
105 109

Diff Legend

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