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.4 by root, Sun Sep 3 00:18:39 2006 UTC vs.
Revision 1.22 by root, Thu Apr 12 14:18:04 2007 UTC

1/* 1/*
2 * static char *rcsid_anim_c = 2 * CrossFire, A Multiplayer game for X-windows
3 * "$Id: anim.C,v 1.4 2006/09/03 00:18:39 root Exp $"; 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 * Copyright (C) 2002-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen
7 *
8 * This program is free software; you can redistribute it and/or modify
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
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * 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 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
4 */ 23 */
5
6/*
7 CrossFire, A Multiplayer game for X-windows
8
9 Copyright (C) 2002-2003 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen
11
12 This program is free software; you can redistribute it and/or modify
13 it under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 2 of the License, or
15 (at your option) any later version.
16
17 This program is distributed in the hope that it will be useful,
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 GNU General Public License for more details.
21
22 You should have received a copy of the GNU General Public License
23 along with this program; if not, write to the Free Software
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25
26 The authors can be reached via e-mail at crossfire-devel@real-time.com
27*/
28 24
29/* This file contains animation related code. */ 25/* This file contains animation related code. */
30 26
31#include <global.h> 27#include <global.h>
32#include <stdio.h> 28#include <stdio.h>
33 29
30animhash_t animhash;
34std::vector<Animations> animations; 31std::vector<animation> animations;
35 32
36void free_all_anim(void) 33void
34animation::resize (int new_size)
37{ 35{
38 for (int i=0; i<=num_animations; i++) 36 sfree <faceidx> (faces, num_animations);
39 { 37 num_animations = new_size;
40 animations[i].name = 0; 38 faces = salloc<faceidx> (num_animations);
41 free (animations[i].faces);
42 }
43
44 animations.clear ();
45} 39}
46 40
47void init_anim(void) { 41animation &
48 char buf[MAX_BUF]; 42animation::create (const char *name, uint8 frames, uint8 facings)
49 FILE *fp; 43{
50 static int anim_init=0; 44 animations.push_back (animation ());
51 int num_frames=0,faces[MAX_ANIMATIONS],i; 45 animation &anim = animations.back ();
52 46
53 if (anim_init) return; 47 anim.number = animations.size () - 1;
54 num_animations=0; 48 anim.name = name;
55 /* Make a default. New animations start at one, so if something 49 anim.num_animations = frames;
56 * thinks it is animated but hasn't set the animation_id properly, 50 anim.facings = facings;
57 * it will have a default value that should be pretty obvious. 51 anim.faces = salloc<faceidx> (frames);
58 */
59 /* set the name so we don't try to dereferance null.
60 * Put # at start so it will be first in alphabetical
61 * order.
62 */
63 animations[0].name = "###none";
64 animations[0].num_animations=1;
65 animations[0].faces = (Fontindex *) malloc(sizeof(Fontindex));
66 animations[0].faces[0]=0;
67 animations[0].facings=0;
68 52
69 sprintf(buf,"%s/animations", settings.datadir); 53 animhash.insert (std::make_pair (anim.name, anim.number));
70 LOG(llevDebug,"Reading animations from %s...", buf);
71 if ((fp=fopen(buf,"r")) ==NULL) {
72 LOG(llevError, "Cannot open animations file %s: %s\n", buf, strerror(errno));
73 exit(-1);
74 }
75 while (fgets(buf, MAX_BUF-1, fp)!=NULL) {
76 if (*buf=='#') continue;
77 /* Kill the newline */
78 buf[strlen(buf)-1] = '\0';
79 if (!strncmp(buf,"anim ", 5)) {
80 if (num_frames) {
81 LOG(llevError,"Didn't get a mina before %s\n", buf);
82 num_frames=0;
83 }
84 num_animations++;
85 54
86 animations.resize (num_animations + 1); 55 return anim;
87 animations[num_animations].name = buf + 5;
88 animations[num_animations].num = num_animations; /* for bsearch */
89 animations[num_animations].facings = 1;
90 }
91 else if (!strncmp(buf,"mina",4)) {
92 animations[num_animations].faces = (Fontindex *) malloc(sizeof(Fontindex)*num_frames);
93 for (i=0; i<num_frames; i++)
94 animations[num_animations].faces[i]=faces[i];
95 animations[num_animations].num_animations = num_frames;
96 if (num_frames % animations[num_animations].facings) {
97 LOG(llevDebug,"Animation %s frame numbers (%d) is not a multiple of facings (%d)\n",
98 &animations[num_animations].name, num_frames, animations[num_animations].facings);
99 }
100 num_frames=0;
101 }
102 else if (!strncmp(buf,"facings",7)) {
103 if (!(animations[num_animations].facings = atoi(buf+7))) {
104 LOG(llevDebug,"Animation %s has 0 facings, line=%s\n",
105 &animations[num_animations].name, buf);
106 animations[num_animations].facings=1;
107 }
108
109 } else {
110 if (!(faces[num_frames++] = FindFace(buf,0)))
111 LOG(llevDebug,"Could not find face %s for animation %s\n",
112 buf, &animations[num_animations].name);
113 }
114 }
115 fclose(fp);
116 LOG(llevDebug,"done. got (%d)\n", num_animations);
117} 56}
118 57
119static int anim_compare(const Animations *a, const Animations *b) { 58animation &
120 return strcmp(a->name, b->name); 59animation::find (const char *name)
60{
61 if (!name)
62 return animations [0];
63
64 animhash_t::iterator i = animhash.find (name);
65 return animations [i == animhash.end () ? 0 : i->second];
66}
67
68void
69init_anim (void)
70{
71 animation &anim0 = animation::create ("none", 1, 0);
72 anim0.faces [0] = 0;
121} 73}
122 74
123/* Tries to find the animation id that matches name. Returns an integer match 75/* Tries to find the animation id that matches name. Returns an integer match
124 * 0 if no match found (animation 0 is initialized as the 'bug' face 76 * 0 if no match found (animation 0 is initialised as the 'bug' face
125 */ 77 */
78//TODO: nuke this function and replace all occurences by animations::find
79int
126int find_animation(const char *name) 80find_animation (const char *name)
127{ 81{
128 Animations search, *match; 82 return animation::find (name).number;
129
130 search.name = name;
131
132 match = (Animations*)bsearch(&search, animations, (num_animations+1),
133 sizeof(Animations), (int (*)(const void*, const void*))anim_compare);
134
135
136 if (match) return match->num;
137 LOG(llevError,"Unable to find animation %s\n", name);
138 return 0;
139} 83}
140 84
141/* 85/*
142 * animate_object(object) updates the face-variable of an object. 86 * animate_object(object) updates the face-variable of an object.
143 * If the object is the head of a multi-object, all objects are animated. 87 * If the object is the head of a multi-object, all objects are animated.
… …
145 * dir is the direction the object is facing. This is generally same as 89 * dir is the direction the object is facing. This is generally same as
146 * op->direction, but in some cases, op->facing is used instead - the 90 * op->direction, but in some cases, op->facing is used instead - the
147 * caller has a better idea which one it really wants to be using, 91 * caller has a better idea which one it really wants to be using,
148 * so let it pass along the right one. 92 * so let it pass along the right one.
149 */ 93 */
94void
95animate_object (object *op, int dir)
96{
97 int max_state; /* Max animation state object should be drawn in */
98 int base_state; /* starting index # to draw from */
150 99
151void animate_object(object *op, int dir) {
152 int max_state; /* Max animation state object should be drawn in */
153 int base_state; /* starting index # to draw from */
154
155 if(!op->animation_id || !NUM_ANIMATIONS(op)) { 100 if (!op->animation_id || !NUM_ANIMATIONS (op))
101 {
156 LOG(llevError,"Object lacks animation.\n"); 102 LOG (llevError, "Object %s lacks animation.\n", op->debug_desc ());
157 dump_object(op); 103 CLEAR_FLAG (op, FLAG_ANIMATE);
158 return; 104 return;
159 }
160 if (op->head) {
161 dir=op->head->direction;
162
163 if (NUM_ANIMATIONS(op) == NUM_ANIMATIONS(op->head))
164 op->state = op->head->state;
165 else
166 ++op->state;
167 }
168 else {
169 ++op->state; /* increase draw state */
170 } 105 }
171 106
172 /* If object is turning, then max animation state is half through the 107 if (op->head)
173 * animations. Otherwise, we can use all the animations. 108 {
174 */ 109 dir = op->head->direction;
175 max_state=NUM_ANIMATIONS(op)/ NUM_FACINGS(op); 110
176 base_state=0; 111 if (NUM_ANIMATIONS (op) == NUM_ANIMATIONS (op->head))
177 /* at least in the older aniamtions that used is_turning, the first half 112 op->state = op->head->state;
178 * of the animations were left facing, the second half right facing. 113 else
179 * Note in old the is_turning, it was set so that the animation for a monster 114 ++op->state;
180 * was always towards the enemy - now it is whatever direction the monster
181 * is facing.
182 */
183 if (NUM_FACINGS(op)==2) {
184 if (dir<5) base_state=0;
185 else base_state=NUM_ANIMATIONS(op)/2;
186 } 115 }
116 else
117 ++op->state; /* increase draw state */
118
119 /* If object is turning, then max animation state is half through the
120 * animations. Otherwise, we can use all the animations.
121 */
122 max_state = NUM_ANIMATIONS (op) / NUM_FACINGS (op);
123 base_state = 0;
124 /* at least in the older animations that used is_turning, the first half
125 * of the animations were left facing, the second half right facing.
126 * Note in old the is_turning, it was set so that the animation for a monster
127 * was always towards the enemy - now it is whatever direction the monster
128 * is facing.
129 */
130
187 else if (NUM_FACINGS(op)==4) { 131 if (NUM_FACINGS (op) == 2)
132 {
133 if (dir < 5)
188 if (dir==0) base_state=0; 134 base_state = 0;
135 else
189 else base_state = ((dir-1)/2) * (NUM_ANIMATIONS(op)/4); 136 base_state = NUM_ANIMATIONS (op) / 2;
190 } 137 }
138 else if (NUM_FACINGS (op) == 4)
139 {
140 if (dir == 0)
141 base_state = 0;
142 else
143 base_state = ((dir - 1) / 2) * (NUM_ANIMATIONS (op) / 4);
144 }
191 else if (NUM_FACINGS(op)==8) { 145 else if (NUM_FACINGS (op) == 8)
146 {
147 if (dir == 0)
192 if (dir==0) base_state=0; 148 base_state = 0;
149 else
193 else base_state = (dir-1)*(NUM_ANIMATIONS(op)/8); 150 base_state = (dir - 1) * (NUM_ANIMATIONS (op) / 8);
194 } 151 }
195 152
196 /* If beyond drawable states, reset */ 153 /* If beyond drawable states, reset */
197 if (op->state>=max_state) op->state=0; 154 if (op->state >= max_state)
155 op->state = 0;
198 156
199 SET_ANIMATION(op, op->state + base_state); 157 SET_ANIMATION (op, op->state + base_state);
200 158
201 if(op->face==blank_face) 159 if (op->face == blank_face)
202 op->invisible=1; 160 op->invisible = 1;
203 161
204 /* This block covers monsters (eg, pixies) which are supposed to 162 /* This block covers monsters (eg, pixies) which are supposed to
205 * cycle from visible to invisible and back to being visible. 163 * cycle from visible to invisible and back to being visible.
206 * as such, disable it for players, as then players would become 164 * as such, disable it for players, as then players would become
207 * visible. 165 * visible.
208 */ 166 */
209 else if(op->type != PLAYER && QUERY_FLAG((&op->arch->clone),FLAG_ALIVE)) { 167 else if (op->type != PLAYER && op->arch->clone.flag [FLAG_ALIVE])
210 if(op->face->number==0) { 168 {
169 if (op->face == 0)
170 {
211 op->invisible=1; 171 op->invisible = 1;
212 CLEAR_FLAG(op, FLAG_ALIVE); 172 CLEAR_FLAG (op, FLAG_ALIVE);
173 }
213 } else { 174 else
175 {
214 op->invisible=0; 176 op->invisible = 0;
215 SET_FLAG(op, FLAG_ALIVE); 177 SET_FLAG (op, FLAG_ALIVE);
216 } 178 }
217 } 179 }
218 180
219 if(op->more) 181 if (op->more)
220 animate_object(op->more, dir); 182 animate_object (op->more, dir);
221 183
222 /* update_object will also recursively update all the pieces. 184 /* update_object will also recursively update all the pieces.
223 * as such, we call it last, and only call it for the head 185 * as such, we call it last, and only call it for the head
224 * piece, and not for the other tail pieces. 186 * piece, and not for the other tail pieces.
225 */ 187 */
226 if (!op->head) 188 if (!op->head)
227 update_object(op, UP_OBJ_FACE); 189 update_object (op, UP_OBJ_FACE);
228} 190}
229 191

Diff Legend

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