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.44 by root, Sun Nov 18 15:19:47 2018 UTC

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

Diff Legend

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