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.19 by root, Sun Mar 11 02:12:44 2007 UTC vs.
Revision 1.29 by root, Thu Nov 8 19:43:23 2007 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 (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program 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 2 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
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, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The maintainer of this code can be reached at <crossfire@schmorp.de> 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"
… …
31 29
32faceidx blank_face, empty_face; 30faceidx blank_face, empty_face;
33 31
34facehash_t facehash; 32facehash_t facehash;
35std::vector<faceinfo> faces; 33std::vector<faceinfo> faces;
36std::vector<facedata> face32, face64;
37
38/**
39 * id is the face to smooth, smooth is the 16x2 face used to smooth id.
40 */
41struct smoothing : zero_initialised
42{
43 uint16 id;
44 uint16 smooth;
45};
46
47/**
48 * Contains all defined smoothing entries. smooth is an array of nrofsmooth
49 * entries. It is sorted by smooth[].id.
50 */
51static struct smoothing *smooth = NULL;
52int nrofsmooth = 0;
53 34
54/* the only thing this table is used for now is to 35/* the only thing this table is used for now is to
55 * translate the colorname in the magicmap field of the 36 * translate the colorname in the magicmap field of the
56 * face into a numeric index that is then sent to the 37 * face into a numeric index that is then sent to the
57 * client for magic map commands. The order of this table 38 * client for magic map commands. The order of this table
… …
71 "brown", /* 10 */ 52 "brown", /* 10 */
72 "yellow", /* 11 */ 53 "yellow", /* 11 */
73 "khaki" /* 12 */ 54 "khaki" /* 12 */
74}; 55};
75 56
76static int
77compar_smooth (const struct smoothing *a, const struct smoothing *b)
78{
79 if (a->id < b->id)
80 return -1;
81 if (b->id < a->id)
82 return 1;
83 return 0;
84}
85
86/* 57/*
87 * Returns the matching color in the coloralias if found, 58 * Returns the matching color in the coloralias if found,
88 * 0 otherwise. Note that 0 will actually be black, so there is no 59 * 0 otherwise. Note that 0 will actually be black, so there is no
89 * way the calling function can tell if an error occurred or not 60 * way the calling function can tell if an error occurred or not
90 */ 61 */
… …
99 70
100 LOG (llevError, "Unknown color: %s\n", name); 71 LOG (llevError, "Unknown color: %s\n", name);
101 return 0; 72 return 0;
102} 73}
103 74
104int 75faceidx
105face_find (const char *name, int defidx) 76face_find (const char *name, faceidx defidx)
106{ 77{
78 if (!name)
79 return defidx;
80
107 facehash_t::iterator i = facehash.find (name); 81 facehash_t::iterator i = facehash.find (name);
108 82
109 return i == facehash.end () 83 return i == facehash.end ()
110 ? defidx : i->second; 84 ? defidx : i->second;
111} 85}
112 86
113facedata * 87faceinfo *
114face_data (int idx, int faceset) 88face_info (faceidx idx)
115{ 89{
116 return &(faceset ? face64 : face32)[idx]; 90 assert (0 < (faceidx)-1); // faceidx must be unsigned
91
92 if (idx >= faces.size ())
93 return 0;
94
95 return &faces [idx];
117} 96}
118 97
119/* Reads the smooth file to know how to smooth datas. 98facedata *
120 * the smooth file if made of 2 elements lines. 99faceinfo::data (int faceset) const
121 * lines starting with # are comment
122 * the first element of line is face to smooth
123 * the next element is the 16x2 faces picture
124 * used for smoothing
125 */
126int
127ReadSmooth (void)
128{ 100{
129 char buf[MAX_BUF], *p, *q; 101 return (facedata *)&(faceset && !type && data64.data.size () ? data64 : data32);
130 FILE *fp;
131 int smoothcount = 0;
132
133 sprintf (buf, "%s/smooth", settings.datadir);
134 LOG (llevDebug, "Reading smooth from %s...\n", buf);
135 if ((fp = fopen (buf, "r")) == NULL)
136 {
137 LOG (llevError, "Cannot open smooth file %s: %s\n", strerror (errno));
138 exit (-1);
139 }
140
141 /* First count how many smooth we have, so we can allocate correctly */
142 while (fgets (buf, MAX_BUF, fp) != NULL)
143 if (buf[0] != '#' && buf[0] != '\n')
144 smoothcount++;
145 rewind (fp);
146
147 smooth = new smoothing[smoothcount];
148
149 while (nrofsmooth < smoothcount && fgets (buf, MAX_BUF, fp) != NULL)
150 {
151 if (*buf == '#')
152 continue;
153 p = strchr (buf, ' ');
154 if (!p)
155 continue;
156 *p = '\0';
157 q = buf;
158 smooth[nrofsmooth].id = face_find (q);
159 q = p + 1;
160 smooth[nrofsmooth].smooth = face_find (q);
161 nrofsmooth++;
162 }
163 fclose (fp);
164
165 LOG (llevDebug, "done (got %d smooth entries)\n", nrofsmooth);
166 qsort (smooth, nrofsmooth, sizeof (struct smoothing), (int (*)(const void *, const void *)) compar_smooth);
167 return nrofsmooth;
168} 102}
169 103
170/** 104facedata *
171 * Find the smooth face for a given face. 105face_data (faceidx idx, int faceset)
172 *
173 * @param face the face to find the smoothing face for
174 *
175 * @param smoothed return value: set to smooth face
176 *
177 * @return 1=smooth face found, 0=no smooth face found
178 */
179int
180FindSmooth (uint16 face, uint16 * smoothed)
181{ 106{
182 struct smoothing *bp, tmp; 107 if (faceinfo *f = face_info (idx))
108 return f->data (faceset);
183 109
184 tmp.id = face; 110 return 0;
185 bp = (struct smoothing *) bsearch
186 (&tmp, smooth, nrofsmooth, sizeof (struct smoothing), (int (*)(const void *, const void *)) compar_smooth);
187 (*smoothed) = 0;
188 if (bp)
189 (*smoothed) = bp->smooth;
190 return bp ? 1 : 0;
191} 111}
192 112

Diff Legend

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