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

Comparing deliantra/server/common/anim.C (file contents):
Revision 1.20 by root, Fri Feb 9 01:52:09 2007 UTC vs.
Revision 1.27 by root, Sun Jul 1 05:00:17 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2002-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002-2003,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 * 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 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 authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25/* This file contains animation related code. */ 24/* This file contains animation related code. */
26 25
27#include <global.h> 26#include <global.h>
28#include <stdio.h> 27#include <stdio.h>
29 28
29animhash_t animhash;
30std::vector<animation> animations;
31
30void 32void
31free_all_anim (void) 33animation::resize (int new_size)
32{ 34{
33 for (int i = 0; i <= num_animations; i++) 35 sfree <faceidx> (faces, num_animations);
34 { 36 num_animations = new_size;
35 animations[i].name = 0; 37 faces = salloc<faceidx> (num_animations);
36 free (animations[i].faces); 38}
37 }
38 39
39 animations.clear (); 40animation &
41animation::create (const char *name, uint8 frames, uint8 facings)
42{
43 if (animations.size () == MAXANIMNUM)
44 cleanup ("trying to create new animation, but MAXANIMNUM animations in use.");
45
46 animations.push_back (animation ());
47 animation &anim = animations.back ();
48
49 anim.number = animations.size () - 1;
50 anim.name = name;
51 anim.num_animations = frames;
52 anim.facings = facings;
53 anim.faces = salloc<faceidx> (frames);
54
55 animhash.insert (std::make_pair (anim.name, anim.number));
56
57 return anim;
58}
59
60animation &
61animation::find (const char *name)
62{
63 if (!name)
64 return animations [0];
65
66 animhash_t::iterator i = animhash.find (name);
67 return animations [i == animhash.end () ? 0 : i->second];
40} 68}
41 69
42void 70void
43init_anim (void) 71init_anim (void)
44{ 72{
45 char 73 animation &anim0 = animation::create ("none", 1, 0);
46 buf[MAX_BUF];
47 FILE *
48 fp;
49 static int
50 anim_init = 0;
51 int
52 num_frames = 0, faces[MAX_ANIMATIONS], i;
53
54 if (anim_init)
55 return;
56
57 num_animations = 0;
58 /* Make a default. New animations start at one, so if something
59 * thinks it is animated but hasn't set the animation_id properly,
60 * it will have a default value that should be pretty obvious.
61 */
62 /* set the name so we don't try to dereferance null.
63 * Put # at start so it will be first in alphabetical
64 * order.
65 */
66 {
67 animation anim0;
68
69 anim0.name = "###none";
70 anim0.num_animations = 1;
71 anim0.faces = (uint16 *)malloc (sizeof (uint16));
72 anim0.faces[0] = 0; 74 anim0.faces [0] = 0;
73 anim0.facings = 0;
74
75 animations.push_back (anim0);
76 }
77
78 sprintf (buf, "%s/animations", settings.datadir);
79 LOG (llevDebug, "Reading animations from %s...\n", buf);
80
81 if ((fp = fopen (buf, "r")) == NULL)
82 {
83 LOG (llevError, "Cannot open animations file %s: %s\n", buf, strerror (errno));
84 exit (-1);
85 }
86
87 while (fgets (buf, MAX_BUF - 1, fp) != NULL)
88 {
89 if (*buf == '#')
90 continue;
91
92 /* Kill the newline */
93 buf[strlen (buf) - 1] = '\0';
94 if (!strncmp (buf, "anim ", 5))
95 {
96 if (num_frames)
97 {
98 LOG (llevError, "Didn't get a mina before %s\n", buf);
99 num_frames = 0;
100 }
101
102 num_animations++;
103
104 animation anim;
105
106 anim.name = buf + 5;
107 anim.num = num_animations; /* for bsearch */
108 anim.facings = 1;
109 animations.push_back (anim);
110 }
111 else if (!strncmp (buf, "mina", 4))
112 {
113 animations[num_animations].faces = (uint16 *) malloc (sizeof (uint16) * num_frames);
114
115 for (i = 0; i < num_frames; i++)
116 animations[num_animations].faces[i] = faces[i];
117
118 animations[num_animations].num_animations = num_frames;
119 if (num_frames % animations[num_animations].facings)
120 {
121 LOG (llevDebug, "Animation %s frame numbers (%d) is not a multiple of facings (%d)\n",
122 &animations[num_animations].name, num_frames, animations[num_animations].facings);
123 }
124 num_frames = 0;
125 }
126 else if (!strncmp (buf, "facings", 7))
127 {
128 if (!(animations[num_animations].facings = atoi (buf + 7)))
129 {
130 LOG (llevDebug, "Animation %s has 0 facings, line=%s\n", &animations[num_animations].name, buf);
131 animations[num_animations].facings = 1;
132 }
133
134 }
135 else
136 {
137 if (!(faces[num_frames++] = FindFace (buf, 0)))
138 LOG (llevDebug, "Could not find face %s for animation %s\n", buf, &animations[num_animations].name);
139 }
140 }
141
142 fclose (fp);
143 LOG (llevDebug, "done. got (%d)\n", num_animations);
144}
145
146static int
147anim_compare (const animation *a, const animation *b)
148{
149 return std::strcmp (a->name, b->name);
150} 75}
151 76
152/* Tries to find the animation id that matches name. Returns an integer match 77/* Tries to find the animation id that matches name. Returns an integer match
153 * 0 if no match found (animation 0 is initialised as the 'bug' face 78 * 0 if no match found (animation 0 is initialised as the 'bug' face
154 */ 79 */
80//TODO: nuke this function and replace all occurences by animations::find
155int 81int
156find_animation (const char *name) 82find_animation (const char *name)
157{ 83{
158 animation search, *match; 84 return animation::find (name).number;
159
160 search.name = name;
161
162 match = (animation *) bsearch (&search, &animations[0], (num_animations + 1),
163 sizeof (animation), (int (*)(const void *, const void *)) anim_compare);
164
165
166 if (match)
167 return match->num;
168
169 LOG (llevError, "Unable to find animation %s\n", name);
170
171 return 0;
172} 85}
173 86
174/* 87/*
175 * animate_object(object) updates the face-variable of an object. 88 * animate_object(object) updates the face-variable of an object.
176 * If the object is the head of a multi-object, all objects are animated. 89 * If the object is the head of a multi-object, all objects are animated.
… …
191 LOG (llevError, "Object %s lacks animation.\n", op->debug_desc ()); 104 LOG (llevError, "Object %s lacks animation.\n", op->debug_desc ());
192 CLEAR_FLAG (op, FLAG_ANIMATE); 105 CLEAR_FLAG (op, FLAG_ANIMATE);
193 return; 106 return;
194 } 107 }
195 108
196 if (op->head) 109 if (op->head_ () != op)
197 { 110 {
198 dir = op->head->direction; 111 dir = op->head->direction;
199 112
200 if (NUM_ANIMATIONS (op) == NUM_ANIMATIONS (op->head)) 113 if (NUM_ANIMATIONS (op) == NUM_ANIMATIONS (op->head))
201 op->state = op->head->state; 114 op->state = op->head->state;
… …
245 158
246 SET_ANIMATION (op, op->state + base_state); 159 SET_ANIMATION (op, op->state + base_state);
247 160
248 if (op->face == blank_face) 161 if (op->face == blank_face)
249 op->invisible = 1; 162 op->invisible = 1;
163
250 /* This block covers monsters (eg, pixies) which are supposed to 164 /* This block covers monsters (eg, pixies) which are supposed to
251 * cycle from visible to invisible and back to being visible. 165 * cycle from visible to invisible and back to being visible.
252 * as such, disable it for players, as then players would become 166 * as such, disable it for players, as then players would become
253 * visible. 167 * visible.
254 */ 168 */
255 else if (op->type != PLAYER && op->arch->clone.flag [FLAG_ALIVE]) 169 else if (op->type != PLAYER && op->arch->flag [FLAG_ALIVE])
256 { 170 {
257 if (op->face->number == 0) 171 if (op->face == 0)
258 { 172 {
259 op->invisible = 1; 173 op->invisible = 1;
260 CLEAR_FLAG (op, FLAG_ALIVE); 174 CLEAR_FLAG (op, FLAG_ALIVE);
261 } 175 }
262 else 176 else
… …
271 185
272 /* update_object will also recursively update all the pieces. 186 /* update_object will also recursively update all the pieces.
273 * as such, we call it last, and only call it for the head 187 * as such, we call it last, and only call it for the head
274 * piece, and not for the other tail pieces. 188 * piece, and not for the other tail pieces.
275 */ 189 */
276 if (!op->head) 190 if (op->head_ () == op)
277 update_object (op, UP_OBJ_FACE); 191 update_object (op, UP_OBJ_FACE);
278} 192}
193

Diff Legend

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