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.21 by root, Sun Mar 11 02:12:44 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 buf[MAX_BUF]; 73 animation &anim0 = animation::create ("none", 1, 0);
46 FILE * fp;
47 static int anim_init = 0;
48 int num_frames = 0, faces[MAX_ANIMATIONS], i;
49
50 if (anim_init)
51 return;
52
53 num_animations = 0;
54 /* Make a default. New animations start at one, so if something
55 * thinks it is animated but hasn't set the animation_id properly,
56 * it will have a default value that should be pretty obvious.
57 */
58 /* set the name so we don't try to dereferance null.
59 * Put # at start so it will be first in alphabetical
60 * order.
61 */
62 {
63 animation anim0;
64
65 anim0.name = "###none";
66 anim0.num_animations = 1;
67 anim0.faces = (uint16 *)malloc (sizeof (uint16));
68 anim0.faces[0] = 0; 74 anim0.faces [0] = 0;
69 anim0.facings = 0;
70
71 animations.push_back (anim0);
72 }
73
74 sprintf (buf, "%s/animations", settings.datadir);
75 LOG (llevDebug, "Reading animations from %s...\n", buf);
76
77 if ((fp = fopen (buf, "r")) == NULL)
78 {
79 LOG (llevError, "Cannot open animations file %s: %s\n", buf, strerror (errno));
80 exit (-1);
81 }
82
83 while (fgets (buf, MAX_BUF - 1, fp) != NULL)
84 {
85 if (*buf == '#')
86 continue;
87
88 /* Kill the newline */
89 buf[strlen (buf) - 1] = '\0';
90 if (!strncmp (buf, "anim ", 5))
91 {
92 if (num_frames)
93 {
94 LOG (llevError, "Didn't get a mina before %s\n", buf);
95 num_frames = 0;
96 }
97
98 num_animations++;
99
100 animation anim;
101
102 anim.name = buf + 5;
103 anim.num = num_animations; /* for bsearch */
104 anim.facings = 1;
105 animations.push_back (anim);
106 }
107 else if (!strncmp (buf, "mina", 4))
108 {
109 animations[num_animations].faces = (uint16 *) malloc (sizeof (uint16) * num_frames);
110
111 for (i = 0; i < num_frames; i++)
112 animations[num_animations].faces[i] = faces[i];
113
114 animations[num_animations].num_animations = num_frames;
115 if (num_frames % animations[num_animations].facings)
116 LOG (llevDebug, "Animation %s frame numbers (%d) is not a multiple of facings (%d)\n",
117 &animations[num_animations].name, num_frames, animations[num_animations].facings);
118
119 num_frames = 0;
120 }
121 else if (!strncmp (buf, "facings ", 8))
122 {
123 if (!(animations[num_animations].facings = atoi (buf + 8)))
124 {
125 LOG (llevDebug, "Animation %s has 0 facings, line=%s\n", &animations[num_animations].name, buf);
126 animations[num_animations].facings = 1;
127 }
128
129 }
130 else
131 {
132 if (!(faces[num_frames++] = face_find (buf)))
133 LOG (llevDebug, "Could not find face %s for animation %s\n", buf, &animations[num_animations].name);
134 }
135 }
136
137 fclose (fp);
138 LOG (llevDebug, "done. got (%d)\n", num_animations);
139}
140
141static int
142anim_compare (const animation *a, const animation *b)
143{
144 return std::strcmp (a->name, b->name);
145} 75}
146 76
147/* 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
148 * 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
149 */ 79 */
80//TODO: nuke this function and replace all occurences by animations::find
150int 81int
151find_animation (const char *name) 82find_animation (const char *name)
152{ 83{
153 animation search, *match; 84 return animation::find (name).number;
154
155 search.name = name;
156
157 match = (animation *) bsearch (&search, &animations[0], (num_animations + 1),
158 sizeof (animation), (int (*)(const void *, const void *)) anim_compare);
159
160
161 if (match)
162 return match->num;
163
164 LOG (llevError, "Unable to find animation %s\n", name);
165
166 return 0;
167} 85}
168 86
169/* 87/*
170 * animate_object(object) updates the face-variable of an object. 88 * animate_object(object) updates the face-variable of an object.
171 * 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.
… …
186 LOG (llevError, "Object %s lacks animation.\n", op->debug_desc ()); 104 LOG (llevError, "Object %s lacks animation.\n", op->debug_desc ());
187 CLEAR_FLAG (op, FLAG_ANIMATE); 105 CLEAR_FLAG (op, FLAG_ANIMATE);
188 return; 106 return;
189 } 107 }
190 108
191 if (op->head) 109 if (op->head_ () != op)
192 { 110 {
193 dir = op->head->direction; 111 dir = op->head->direction;
194 112
195 if (NUM_ANIMATIONS (op) == NUM_ANIMATIONS (op->head)) 113 if (NUM_ANIMATIONS (op) == NUM_ANIMATIONS (op->head))
196 op->state = op->head->state; 114 op->state = op->head->state;
… …
246 /* This block covers monsters (eg, pixies) which are supposed to 164 /* This block covers monsters (eg, pixies) which are supposed to
247 * cycle from visible to invisible and back to being visible. 165 * cycle from visible to invisible and back to being visible.
248 * as such, disable it for players, as then players would become 166 * as such, disable it for players, as then players would become
249 * visible. 167 * visible.
250 */ 168 */
251 else if (op->type != PLAYER && op->arch->clone.flag [FLAG_ALIVE]) 169 else if (op->type != PLAYER && op->arch->flag [FLAG_ALIVE])
252 { 170 {
253 if (op->face == 0) 171 if (op->face == 0)
254 { 172 {
255 op->invisible = 1; 173 op->invisible = 1;
256 CLEAR_FLAG (op, FLAG_ALIVE); 174 CLEAR_FLAG (op, FLAG_ALIVE);
… …
267 185
268 /* update_object will also recursively update all the pieces. 186 /* update_object will also recursively update all the pieces.
269 * 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
270 * piece, and not for the other tail pieces. 188 * piece, and not for the other tail pieces.
271 */ 189 */
272 if (!op->head) 190 if (op->head_ () == op)
273 update_object (op, UP_OBJ_FACE); 191 update_object (op, UP_OBJ_FACE);
274} 192}
193

Diff Legend

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