1 |
elmex |
1.1 |
/* |
2 |
root |
1.55 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
root |
1.69 |
* |
4 |
root |
1.67 |
* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
root |
1.63 |
* Copyright (©) 2001 Mark Wedel |
6 |
|
|
* Copyright (©) 1992 Frank Tore Johansen |
7 |
root |
1.69 |
* |
8 |
root |
1.60 |
* Deliantra is free software: you can redistribute it and/or modify it under |
9 |
|
|
* the terms of the Affero GNU General Public License as published by the |
10 |
|
|
* Free Software Foundation, either version 3 of the License, or (at your |
11 |
|
|
* option) any later version. |
12 |
root |
1.69 |
* |
13 |
root |
1.44 |
* 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 |
root |
1.69 |
* |
18 |
root |
1.60 |
* You should have received a copy of the Affero GNU General Public License |
19 |
|
|
* and the GNU General Public License along with this program. If not, see |
20 |
|
|
* <http://www.gnu.org/licenses/>. |
21 |
root |
1.69 |
* |
22 |
root |
1.55 |
* The authors can be reached via e-mail to <support@deliantra.net> |
23 |
root |
1.17 |
*/ |
24 |
elmex |
1.1 |
|
25 |
|
|
/** \file |
26 |
|
|
* Image related communication |
27 |
|
|
* |
28 |
|
|
* \date 2003-12-02 |
29 |
|
|
* |
30 |
|
|
* This file deals with the image related communication to the |
31 |
|
|
* client. I've located all the functions in this file - this |
32 |
|
|
* localizes it more, and means that we don't need to declare |
33 |
|
|
* things like all the structures as globals. |
34 |
|
|
*/ |
35 |
|
|
|
36 |
|
|
#include <global.h> |
37 |
|
|
#include <sproto.h> |
38 |
|
|
|
39 |
root |
1.20 |
#include "crc.h" |
40 |
|
|
|
41 |
elmex |
1.1 |
#define MAX_IMAGE_SIZE 10000 |
42 |
|
|
|
43 |
|
|
/** |
44 |
root |
1.43 |
* client requested an image. send it rate-limited |
45 |
|
|
* before flushing. |
46 |
elmex |
1.1 |
*/ |
47 |
root |
1.3 |
void |
48 |
root |
1.43 |
AskFaceCmd (char *buf, int len, client *ns) |
49 |
elmex |
1.1 |
{ |
50 |
root |
1.43 |
int idx = 0, pri = 0; |
51 |
|
|
|
52 |
|
|
sscanf (buf, "%d %d", &idx, &pri); |
53 |
|
|
|
54 |
root |
1.51 |
//TODO: somehow fetch default priority from send_fx here |
55 |
|
|
|
56 |
root |
1.43 |
const facedata *d = face_data (idx, ns->faceset); |
57 |
|
|
|
58 |
|
|
if (!d) |
59 |
|
|
return; // doh |
60 |
|
|
|
61 |
|
|
client::ixsend ix; |
62 |
|
|
|
63 |
root |
1.71 |
ix.pri = pri; |
64 |
|
|
ix.idx = idx; |
65 |
|
|
ix.ofs = d->data.size (); |
66 |
|
|
ix.data = d->data; |
67 |
root |
1.43 |
|
68 |
root |
1.46 |
auto (pos, ns->ixface.end ()); |
69 |
|
|
|
70 |
root |
1.58 |
// the by far most common case will be to insert |
71 |
|
|
// near the end, so little looping. |
72 |
|
|
while (pos != ns->ixface.begin ()) |
73 |
root |
1.46 |
{ |
74 |
root |
1.58 |
--pos; |
75 |
|
|
|
76 |
|
|
// sort within 2k bins, to slightly prefer smaller images |
77 |
|
|
if (pri > pos->pri || (pri == pos->pri && (ix.ofs >> 11) <= (pos->ofs >> 11))) |
78 |
root |
1.46 |
{ |
79 |
root |
1.58 |
++pos; |
80 |
|
|
break; |
81 |
root |
1.46 |
} |
82 |
|
|
} |
83 |
|
|
|
84 |
|
|
ns->ixface.insert (pos, ix); |
85 |
root |
1.45 |
|
86 |
|
|
#if 0 |
87 |
root |
1.46 |
for (auto (i, ns->ixface.begin ()); i != ns->ixface.end (); ++i) |
88 |
|
|
fprintf (stderr, "<%d,%d> ", i->pri, i->ofs); |
89 |
|
|
fprintf (stderr, "\n"); |
90 |
root |
1.45 |
#endif |
91 |
root |
1.43 |
} |
92 |
|
|
|
93 |
|
|
/** |
94 |
root |
1.70 |
* Sends a face offer (fx) to a client. |
95 |
elmex |
1.1 |
* If nocache is true (nonzero), ignore the cache setting from the client - |
96 |
|
|
* this is needed for the askface, in which we really do want to send the |
97 |
|
|
* face (and askface is the only place that should be setting it). Otherwise, |
98 |
|
|
* we look at the facecache, and if set, send the image name. |
99 |
|
|
*/ |
100 |
root |
1.3 |
void |
101 |
root |
1.50 |
client::send_face (faceidx facenum, int pri) |
102 |
elmex |
1.1 |
{ |
103 |
root |
1.28 |
// never send face 0. ever. it does not exist. |
104 |
|
|
if (!facenum) |
105 |
|
|
return; |
106 |
|
|
|
107 |
root |
1.50 |
faceinfo *f = face_info (facenum); |
108 |
root |
1.28 |
|
109 |
root |
1.50 |
if (!f) |
110 |
root |
1.3 |
{ |
111 |
root |
1.54 |
LOG (llevError | logBacktrace, "client::send_face (%d) out of bounds??\n", facenum); |
112 |
root |
1.3 |
return; |
113 |
|
|
} |
114 |
|
|
|
115 |
root |
1.68 |
// refuse to send non-image faces unless requested |
116 |
root |
1.50 |
if (!fx_want [f->type]) |
117 |
|
|
return; |
118 |
root |
1.49 |
|
119 |
root |
1.50 |
if (faces_sent [facenum]) |
120 |
root |
1.48 |
return; |
121 |
|
|
|
122 |
root |
1.68 |
faces_sent [facenum] = true; |
123 |
root |
1.32 |
|
124 |
root |
1.58 |
fxface.push_back (facenum); |
125 |
root |
1.32 |
} |
126 |
|
|
|
127 |
root |
1.39 |
void client::flush_fx () |
128 |
|
|
{ |
129 |
|
|
while (!fxface.empty ()) |
130 |
|
|
{ |
131 |
root |
1.40 |
packet fx ("fx"); |
132 |
|
|
packet sx ("sx"); |
133 |
root |
1.50 |
int type = 0; |
134 |
root |
1.39 |
|
135 |
|
|
do |
136 |
|
|
{ |
137 |
|
|
faceidx facenum = fxface.back (); fxface.pop_back (); |
138 |
|
|
|
139 |
root |
1.50 |
if (const faceinfo *f = face_info (facenum)) |
140 |
|
|
{ |
141 |
|
|
if (f->type != type) |
142 |
|
|
{ |
143 |
|
|
type = f->type; |
144 |
|
|
|
145 |
|
|
fx << ber32 (0) |
146 |
|
|
<< uint8 (1) << uint8 (type); |
147 |
|
|
} |
148 |
|
|
|
149 |
|
|
const facedata *d = f->data (faceset); |
150 |
root |
1.39 |
|
151 |
root |
1.40 |
fx << ber32 (facenum) |
152 |
root |
1.62 |
<< data8 (d->chksum, d->chksum_len); |
153 |
root |
1.39 |
|
154 |
root |
1.40 |
if (smoothing) |
155 |
|
|
{ |
156 |
|
|
faceinfo *f = face_info (facenum); |
157 |
|
|
|
158 |
|
|
if (f->smooth) |
159 |
|
|
{ |
160 |
root |
1.50 |
send_face (f->smooth, -110); |
161 |
|
|
|
162 |
root |
1.40 |
sx << ber32 (facenum) |
163 |
|
|
<< ber32 (f->smooth) |
164 |
|
|
<< ber32 (f->smoothlevel); |
165 |
|
|
} |
166 |
|
|
} |
167 |
root |
1.39 |
} |
168 |
|
|
} |
169 |
root |
1.40 |
while (!fxface.empty () |
170 |
root |
1.62 |
&& fx.room () > ber32::size + CHKSUM_MAXLEN + 1 + 3 /* type switch */ |
171 |
root |
1.40 |
&& sx.room () > ber32::size * 3); |
172 |
root |
1.39 |
|
173 |
root |
1.40 |
send_packet (fx); |
174 |
|
|
if (sx.length () > 3) send_packet (sx); |
175 |
root |
1.39 |
} |
176 |
|
|
} |
177 |
|
|
|
178 |
root |
1.28 |
// send all faces of this object to the client |
179 |
|
|
// this uses more bandwidth initially, but makes |
180 |
|
|
// animations look much smoother, and every client |
181 |
|
|
// is supposed to do client-side caching anyways. |
182 |
|
|
void |
183 |
|
|
client::send_faces (object *ob) |
184 |
|
|
{ |
185 |
root |
1.50 |
send_face (ob->face, 10); |
186 |
root |
1.28 |
|
187 |
|
|
if (ob->animation_id) |
188 |
|
|
{ |
189 |
root |
1.59 |
const animation &anim = ob->anim (); |
190 |
root |
1.28 |
|
191 |
|
|
for (int i = 0; i < anim.num_animations; i++) |
192 |
root |
1.50 |
send_face (anim.faces [i], -10); |
193 |
root |
1.28 |
} |
194 |
|
|
} |
195 |
|
|
|
196 |
|
|
/** |
197 |
|
|
* Need to send an animation sequence to the client. |
198 |
|
|
* We will send appropriate face commands to the client if we haven't |
199 |
|
|
* sent them the face yet (this can become quite costly in terms of |
200 |
|
|
* how much we are sending - on the other hand, this should only happen |
201 |
|
|
* when the player logs in and picks stuff up. |
202 |
|
|
*/ |
203 |
|
|
void |
204 |
|
|
client::send_animation (short anim_num) |
205 |
|
|
{ |
206 |
|
|
/* Do some checking on the anim_num we got. Note that the animations |
207 |
root |
1.61 |
* are added in contiguous order, so if the number is in the valid |
208 |
root |
1.28 |
* range, it must be a valid animation. |
209 |
|
|
*/ |
210 |
root |
1.41 |
if (anim_num < 0 || anim_num >= animations.size ()) |
211 |
root |
1.28 |
{ |
212 |
|
|
LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
213 |
|
|
return; |
214 |
|
|
} |
215 |
|
|
|
216 |
|
|
packet sl ("anim"); |
217 |
|
|
|
218 |
|
|
sl << uint16 (anim_num) |
219 |
|
|
<< uint16 (0); /* flags - not used right now */ |
220 |
|
|
|
221 |
|
|
/* Build up the list of faces. Also, send any information (ie, the |
222 |
|
|
* the face itself) down to the client. |
223 |
|
|
*/ |
224 |
|
|
for (int i = 0; i < animations[anim_num].num_animations; i++) |
225 |
|
|
{ |
226 |
root |
1.50 |
send_face (animations[anim_num].faces[i], -20); |
227 |
root |
1.61 |
sl << uint16 (animations[anim_num].faces[i]); |
228 |
elmex |
1.1 |
} |
229 |
root |
1.6 |
|
230 |
root |
1.28 |
send_packet (sl); |
231 |
|
|
|
232 |
|
|
anims_sent[anim_num] = 1; |
233 |
elmex |
1.1 |
} |
234 |
|
|
|
235 |
root |
1.66 |
void |
236 |
|
|
client::invalidate_face (faceidx idx) |
237 |
|
|
{ |
238 |
|
|
faces_sent [idx] = false; |
239 |
|
|
force_newmap = true; |
240 |
|
|
} |
241 |
|
|
|
242 |
|
|
void |
243 |
|
|
client::invalidate_all_faces () |
244 |
|
|
{ |
245 |
|
|
faces_sent.reset (); |
246 |
|
|
force_newmap = true; |
247 |
|
|
} |
248 |
|
|
|