1 |
elmex |
1.1 |
/* |
2 |
root |
1.123 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
pippijn |
1.64 |
* |
4 |
root |
1.128 |
* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
root |
1.100 |
* Copyright (©) 2001,2007 Mark Wedel |
6 |
|
|
* Copyright (©) 1992,2007 Frank Tore Johansen |
7 |
pippijn |
1.64 |
* |
8 |
root |
1.123 |
* Deliantra is free software: you can redistribute it and/or modify |
9 |
root |
1.112 |
* it under the terms of the GNU General Public License as published by |
10 |
|
|
* the Free Software Foundation, either version 3 of the License, or |
11 |
|
|
* (at your option) any later version. |
12 |
pippijn |
1.64 |
* |
13 |
root |
1.112 |
* 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 |
pippijn |
1.64 |
* |
18 |
root |
1.112 |
* You should have received a copy of the GNU General Public License |
19 |
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 |
root |
1.100 |
* |
21 |
root |
1.123 |
* The authors can be reached via e-mail to <support@deliantra.net> |
22 |
pippijn |
1.64 |
*/ |
23 |
elmex |
1.1 |
|
24 |
|
|
/** |
25 |
|
|
* \file |
26 |
|
|
* Client handling. |
27 |
|
|
* |
28 |
|
|
* \date 2003-12-02 |
29 |
|
|
* |
30 |
|
|
* This file implements all of the goo on the server side for handling |
31 |
|
|
* clients. It's got a bunch of global variables for keeping track of |
32 |
|
|
* each of the clients. |
33 |
|
|
* |
34 |
|
|
* Note: All functions that are used to process data from the client |
35 |
|
|
* have the prototype of (char *data, int datalen, int client_num). This |
36 |
|
|
* way, we can use one dispatch table. |
37 |
|
|
* |
38 |
|
|
* esrv_map_new starts updating the map |
39 |
|
|
* |
40 |
|
|
*/ |
41 |
|
|
|
42 |
|
|
#include <global.h> |
43 |
|
|
#include <sproto.h> |
44 |
|
|
|
45 |
|
|
#include <living.h> |
46 |
|
|
#include <commands.h> |
47 |
|
|
|
48 |
|
|
/* This block is basically taken from socket.c - I assume if it works there, |
49 |
|
|
* it should work here. |
50 |
|
|
*/ |
51 |
pippijn |
1.26 |
#include <sys/types.h> |
52 |
|
|
#include <sys/time.h> |
53 |
|
|
#include <sys/socket.h> |
54 |
|
|
#include <netinet/in.h> |
55 |
|
|
#include <netdb.h> |
56 |
elmex |
1.1 |
|
57 |
root |
1.38 |
#include <unistd.h> |
58 |
|
|
#include <sys/time.h> |
59 |
elmex |
1.1 |
|
60 |
|
|
#include "sounds.h" |
61 |
|
|
|
62 |
|
|
/** |
63 |
|
|
* This table translates the attack numbers as used within the |
64 |
|
|
* program to the value we use when sending STATS command to the |
65 |
|
|
* client. If a value is -1, then we don't send that to the |
66 |
|
|
* client. |
67 |
|
|
*/ |
68 |
root |
1.16 |
short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
69 |
|
|
CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
70 |
|
|
CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
71 |
|
|
CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
72 |
|
|
CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
73 |
|
|
CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
74 |
|
|
CS_STAT_RES_FEAR, -1 /* Cancellation */ , |
75 |
|
|
CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
76 |
|
|
-1 /* Chaos */ , -1 /* Counterspell */ , |
77 |
|
|
-1 /* Godpower */ , CS_STAT_RES_HOLYWORD, |
78 |
|
|
CS_STAT_RES_BLIND, |
79 |
|
|
-1, /* Internal */ |
80 |
|
|
-1, /* life stealing */ |
81 |
|
|
-1 /* Disease - not fully done yet */ |
82 |
elmex |
1.1 |
}; |
83 |
|
|
|
84 |
root |
1.2 |
static void |
85 |
root |
1.43 |
socket_map_scroll (client *ns, int dx, int dy) |
86 |
root |
1.2 |
{ |
87 |
root |
1.16 |
struct Map newmap; |
88 |
|
|
int x, y, mx, my; |
89 |
root |
1.2 |
|
90 |
root |
1.42 |
ns->send_packet_printf ("map_scroll %d %d", dx, dy); |
91 |
root |
1.2 |
|
92 |
root |
1.16 |
/* If we are using the Map1aCmd, we may in fact send |
93 |
|
|
* head information that is outside the viewable map. |
94 |
|
|
* So set the mx,my to the max value we want to |
95 |
|
|
* look for. Removed code to do so - it caused extra |
96 |
|
|
* complexities for the client, and probably doesn't make |
97 |
|
|
* that much difference in bandwidth. |
98 |
|
|
*/ |
99 |
|
|
mx = ns->mapx; |
100 |
|
|
my = ns->mapy; |
101 |
root |
1.2 |
|
102 |
root |
1.16 |
/* the x and y here are coordinates for the new map, i.e. if we moved |
103 |
|
|
* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
104 |
|
|
* if the destination x or y coordinate is outside the viewable |
105 |
|
|
* area, we clear the values - otherwise, the old values |
106 |
|
|
* are preserved, and the check_head thinks it needs to clear them. |
107 |
|
|
*/ |
108 |
|
|
for (x = 0; x < mx; x++) |
109 |
|
|
{ |
110 |
|
|
for (y = 0; y < my; y++) |
111 |
|
|
{ |
112 |
|
|
if (x >= ns->mapx || y >= ns->mapy) |
113 |
root |
1.25 |
/* clear cells outside the viewable area */ |
114 |
|
|
memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
115 |
root |
1.16 |
else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
116 |
root |
1.25 |
/* clear newly visible tiles within the viewable area */ |
117 |
|
|
memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
118 |
root |
1.16 |
else |
119 |
root |
1.25 |
memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
120 |
root |
1.12 |
} |
121 |
root |
1.2 |
} |
122 |
|
|
|
123 |
root |
1.16 |
memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
124 |
root |
1.2 |
|
125 |
root |
1.16 |
/* Make sure that the next "map1" command will be sent (even if it is |
126 |
|
|
* empty). |
127 |
|
|
*/ |
128 |
|
|
ns->sent_scroll = 1; |
129 |
root |
1.2 |
} |
130 |
|
|
|
131 |
root |
1.7 |
static void |
132 |
|
|
clear_map (player *pl) |
133 |
|
|
{ |
134 |
root |
1.119 |
pl->ns->mapinfo_queue_clear (); |
135 |
|
|
|
136 |
root |
1.50 |
memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
137 |
root |
1.7 |
|
138 |
root |
1.79 |
pl->ns->force_newmap = false; |
139 |
|
|
|
140 |
root |
1.50 |
if (pl->ns->newmapcmd == 1) |
141 |
|
|
pl->ns->send_packet ("newmap"); |
142 |
root |
1.7 |
|
143 |
root |
1.50 |
pl->ns->floorbox_reset (); |
144 |
root |
1.7 |
} |
145 |
|
|
|
146 |
root |
1.131 |
static void |
147 |
|
|
send_map_info (player *pl) |
148 |
|
|
{ |
149 |
|
|
client &socket = *pl->ns; |
150 |
|
|
object *ob = pl->observe; |
151 |
|
|
|
152 |
|
|
if (socket.mapinfocmd) |
153 |
|
|
{ |
154 |
|
|
if (ob->map && ob->map->path[0]) |
155 |
|
|
{ |
156 |
|
|
int flags = 0; |
157 |
|
|
|
158 |
|
|
if (ob->map->tile_path[0]) flags |= 1; |
159 |
|
|
if (ob->map->tile_path[1]) flags |= 2; |
160 |
|
|
if (ob->map->tile_path[2]) flags |= 4; |
161 |
|
|
if (ob->map->tile_path[3]) flags |= 8; |
162 |
|
|
|
163 |
|
|
socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
164 |
|
|
flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
165 |
|
|
ob->map->width, ob->map->height, &ob->map->path); |
166 |
|
|
} |
167 |
|
|
else |
168 |
|
|
socket.send_packet ("mapinfo current"); |
169 |
|
|
} |
170 |
|
|
} |
171 |
|
|
|
172 |
root |
1.66 |
/** check for map/region change and send new map data */ |
173 |
elmex |
1.1 |
static void |
174 |
|
|
check_map_change (player *pl) |
175 |
|
|
{ |
176 |
root |
1.50 |
client &socket = *pl->ns; |
177 |
root |
1.101 |
object *ob = pl->observe; |
178 |
elmex |
1.1 |
|
179 |
root |
1.131 |
region *reg = ob->region (); |
180 |
|
|
if (socket.current_region != reg) |
181 |
|
|
{ |
182 |
|
|
INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
183 |
|
|
socket.current_region = reg; |
184 |
|
|
} |
185 |
|
|
|
186 |
root |
1.130 |
// first try to aovid a full newmap on tiled map scrolls |
187 |
root |
1.131 |
if (socket.current_map != ob->map && !socket.force_newmap) |
188 |
root |
1.130 |
{ |
189 |
|
|
rv_vector rv; |
190 |
|
|
|
191 |
|
|
get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0); |
192 |
|
|
|
193 |
|
|
// manhattan distance is very handy here |
194 |
|
|
if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient |
195 |
|
|
{ |
196 |
|
|
socket.current_map = ob->map; |
197 |
|
|
socket.current_x = ob->x; |
198 |
|
|
socket.current_y = ob->y; |
199 |
|
|
|
200 |
|
|
socket_map_scroll (&socket, rv.distance_x, rv.distance_y); |
201 |
|
|
socket.floorbox_reset (); |
202 |
root |
1.131 |
send_map_info (pl); |
203 |
root |
1.130 |
} |
204 |
|
|
} |
205 |
|
|
|
206 |
root |
1.85 |
if (socket.current_map != ob->map || socket.force_newmap) |
207 |
root |
1.79 |
{ |
208 |
root |
1.7 |
clear_map (pl); |
209 |
root |
1.80 |
socket.current_map = ob->map; |
210 |
root |
1.131 |
send_map_info (pl); |
211 |
elmex |
1.1 |
} |
212 |
root |
1.2 |
else if (socket.current_x != ob->x || socket.current_y != ob->y) |
213 |
|
|
{ |
214 |
root |
1.7 |
int dx = ob->x - socket.current_x; |
215 |
|
|
int dy = ob->y - socket.current_y; |
216 |
|
|
|
217 |
|
|
if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
218 |
root |
1.16 |
clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
219 |
root |
1.7 |
else |
220 |
|
|
{ |
221 |
|
|
socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
222 |
root |
1.46 |
socket.floorbox_reset (); |
223 |
root |
1.7 |
} |
224 |
root |
1.2 |
} |
225 |
|
|
|
226 |
|
|
socket.current_x = ob->x; |
227 |
|
|
socket.current_y = ob->y; |
228 |
elmex |
1.1 |
} |
229 |
|
|
|
230 |
root |
1.40 |
/** |
231 |
|
|
* RequestInfo is sort of a meta command. There is some specific |
232 |
|
|
* request of information, but we call other functions to provide |
233 |
|
|
* that information. |
234 |
|
|
*/ |
235 |
|
|
void |
236 |
root |
1.114 |
RequestInfo (char *buf, int len, client *ns) |
237 |
root |
1.40 |
{ |
238 |
root |
1.114 |
char *params; |
239 |
root |
1.40 |
|
240 |
|
|
/* find the first space, make it null, and update the |
241 |
|
|
* params pointer. |
242 |
|
|
*/ |
243 |
root |
1.114 |
for (params = buf; *params; params++) |
244 |
|
|
if (*params == ' ') |
245 |
root |
1.40 |
{ |
246 |
root |
1.114 |
*params++ = 0; |
247 |
root |
1.40 |
break; |
248 |
|
|
} |
249 |
|
|
|
250 |
|
|
if (!strcmp (buf, "image_info")) |
251 |
|
|
send_image_info (ns, params); |
252 |
|
|
else if (!strcmp (buf, "image_sums")) |
253 |
|
|
send_image_sums (ns, params); |
254 |
|
|
else if (!strcmp (buf, "skill_info")) |
255 |
|
|
send_skill_info (ns, params); |
256 |
|
|
else if (!strcmp (buf, "spell_paths")) |
257 |
|
|
send_spell_paths (ns, params); |
258 |
|
|
else |
259 |
root |
1.114 |
{ |
260 |
|
|
// undo tokenisation above and send replyinfo with the request unchanged |
261 |
|
|
if (*params) |
262 |
|
|
*--params = ' '; |
263 |
|
|
|
264 |
|
|
ns->send_packet_printf ("replyinfo %s", buf); |
265 |
|
|
} |
266 |
root |
1.40 |
} |
267 |
|
|
|
268 |
root |
1.16 |
void |
269 |
|
|
ExtCmd (char *buf, int len, player *pl) |
270 |
elmex |
1.1 |
{ |
271 |
root |
1.10 |
INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
272 |
elmex |
1.1 |
} |
273 |
|
|
|
274 |
root |
1.16 |
void |
275 |
root |
1.45 |
ExtiCmd (char *buf, int len, client *ns) |
276 |
|
|
{ |
277 |
|
|
INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
278 |
|
|
} |
279 |
|
|
|
280 |
|
|
void |
281 |
root |
1.119 |
client::mapinfo_queue_clear () |
282 |
elmex |
1.1 |
{ |
283 |
root |
1.119 |
for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
284 |
|
|
free (*i); |
285 |
root |
1.16 |
|
286 |
root |
1.119 |
mapinfo_queue.clear (); |
287 |
|
|
} |
288 |
elmex |
1.1 |
|
289 |
root |
1.119 |
bool |
290 |
|
|
client::mapinfo_try (char *buf) |
291 |
|
|
{ |
292 |
|
|
char *token = buf; |
293 |
|
|
buf += strlen (buf) + 9; |
294 |
elmex |
1.1 |
|
295 |
root |
1.119 |
// initial map and its origin |
296 |
root |
1.122 |
maptile *map = pl->observe->map; |
297 |
|
|
int mapx = pl->ns->mapx / 2 - pl->observe->x; |
298 |
|
|
int mapy = pl->ns->mapy / 2 - pl->observe->y; |
299 |
root |
1.119 |
int max_distance = 8; // limit maximum path length to something generous |
300 |
elmex |
1.1 |
|
301 |
root |
1.119 |
while (*buf && map && max_distance) |
302 |
elmex |
1.1 |
{ |
303 |
root |
1.119 |
int dir = *buf++ - '1'; |
304 |
elmex |
1.1 |
|
305 |
root |
1.119 |
if (dir >= 0 && dir <= 3) |
306 |
|
|
{ |
307 |
|
|
if (!map->tile_path [dir]) |
308 |
|
|
map = 0; |
309 |
root |
1.120 |
else if (map->tile_available (dir, false)) |
310 |
root |
1.119 |
{ |
311 |
|
|
maptile *neigh = map->tile_map [dir]; |
312 |
elmex |
1.1 |
|
313 |
root |
1.119 |
switch (dir) |
314 |
|
|
{ |
315 |
|
|
case 0: mapy -= neigh->height; break; |
316 |
|
|
case 2: mapy += map ->height; break; |
317 |
|
|
case 3: mapx -= neigh->width ; break; |
318 |
|
|
case 1: mapx += map ->width ; break; |
319 |
|
|
} |
320 |
elmex |
1.1 |
|
321 |
root |
1.119 |
map = neigh; |
322 |
|
|
--max_distance; |
323 |
elmex |
1.1 |
} |
324 |
root |
1.119 |
else |
325 |
|
|
return 0; |
326 |
|
|
} |
327 |
|
|
else |
328 |
|
|
max_distance = 0; |
329 |
|
|
} |
330 |
|
|
|
331 |
|
|
if (!max_distance) |
332 |
|
|
send_packet_printf ("mapinfo %s error", token); |
333 |
root |
1.120 |
else if (!map || !map->path) |
334 |
root |
1.119 |
send_packet_printf ("mapinfo %s nomap", token); |
335 |
|
|
else |
336 |
|
|
{ |
337 |
|
|
int flags = 0; |
338 |
|
|
|
339 |
|
|
if (map->tile_path[0]) flags |= 1; |
340 |
|
|
if (map->tile_path[1]) flags |= 2; |
341 |
|
|
if (map->tile_path[2]) flags |= 4; |
342 |
|
|
if (map->tile_path[3]) flags |= 8; |
343 |
|
|
|
344 |
|
|
send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
345 |
|
|
} |
346 |
|
|
|
347 |
|
|
return 1; |
348 |
|
|
} |
349 |
elmex |
1.1 |
|
350 |
root |
1.119 |
void |
351 |
|
|
client::mapinfo_queue_run () |
352 |
|
|
{ |
353 |
|
|
if (mapinfo_queue.empty () || !pl) |
354 |
|
|
return; |
355 |
|
|
|
356 |
|
|
for (int i = 0; i < mapinfo_queue.size (); ++i) |
357 |
|
|
if (mapinfo_try (mapinfo_queue [i])) |
358 |
|
|
{ |
359 |
|
|
free (mapinfo_queue [i]); |
360 |
|
|
mapinfo_queue.erase (i); |
361 |
|
|
} |
362 |
|
|
else |
363 |
|
|
++i; |
364 |
|
|
} |
365 |
|
|
|
366 |
|
|
void |
367 |
|
|
MapInfoCmd (char *buf, int len, player *pl) |
368 |
|
|
{ |
369 |
|
|
// <mapinfo tag spatial tile-path |
370 |
|
|
// >mapinfo tag spatial flags x y w h hash |
371 |
|
|
|
372 |
|
|
char *token = buf; |
373 |
elmex |
1.1 |
|
374 |
root |
1.119 |
if (!(buf = strchr (buf, ' '))) |
375 |
|
|
return; |
376 |
elmex |
1.1 |
|
377 |
root |
1.119 |
if (!strncmp (buf, " spatial ", 9)) |
378 |
|
|
{ |
379 |
|
|
char *copy = strdup (token); |
380 |
|
|
copy [buf - token] = 0; |
381 |
root |
1.16 |
|
382 |
root |
1.119 |
#if 0 |
383 |
|
|
// this makes only sense when we flush the buffer immediately |
384 |
|
|
if (pl->ns->mapinfo_try (copy)) |
385 |
|
|
free (copy); |
386 |
elmex |
1.1 |
else |
387 |
root |
1.119 |
#endif |
388 |
|
|
pl->ns->mapinfo_queue.push_back (copy); |
389 |
elmex |
1.1 |
} |
390 |
|
|
else |
391 |
root |
1.119 |
pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
392 |
elmex |
1.1 |
} |
393 |
|
|
|
394 |
root |
1.83 |
/** This is the Setup cmd */ |
395 |
root |
1.16 |
void |
396 |
root |
1.41 |
SetUp (char *buf, int len, client * ns) |
397 |
elmex |
1.1 |
{ |
398 |
root |
1.83 |
INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len)); |
399 |
elmex |
1.1 |
} |
400 |
|
|
|
401 |
|
|
/** |
402 |
|
|
* The client has requested to be added to the game. |
403 |
|
|
* This is what takes care of it. We tell the client how things worked out. |
404 |
|
|
* I am not sure if this file is the best place for this function. however, |
405 |
|
|
* it either has to be here or init_sockets needs to be exported. |
406 |
|
|
*/ |
407 |
root |
1.16 |
void |
408 |
root |
1.77 |
AddMeCmd (char *buf, int len, client *ns) |
409 |
elmex |
1.1 |
{ |
410 |
root |
1.51 |
INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
411 |
elmex |
1.1 |
} |
412 |
|
|
|
413 |
|
|
/** Reply to ExtendedInfos command */ |
414 |
root |
1.16 |
void |
415 |
root |
1.41 |
ToggleExtendedInfos (char *buf, int len, client * ns) |
416 |
root |
1.16 |
{ |
417 |
|
|
char cmdback[MAX_BUF]; |
418 |
|
|
char command[50]; |
419 |
|
|
int info, nextinfo; |
420 |
|
|
|
421 |
|
|
cmdback[0] = '\0'; |
422 |
|
|
nextinfo = 0; |
423 |
root |
1.17 |
|
424 |
root |
1.16 |
while (1) |
425 |
|
|
{ |
426 |
|
|
/* 1. Extract an info */ |
427 |
|
|
info = nextinfo; |
428 |
root |
1.17 |
|
429 |
root |
1.16 |
while ((info < len) && (buf[info] == ' ')) |
430 |
|
|
info++; |
431 |
root |
1.17 |
|
432 |
root |
1.16 |
if (info >= len) |
433 |
|
|
break; |
434 |
root |
1.17 |
|
435 |
root |
1.16 |
nextinfo = info + 1; |
436 |
root |
1.17 |
|
437 |
root |
1.16 |
while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
438 |
|
|
nextinfo++; |
439 |
root |
1.17 |
|
440 |
root |
1.16 |
if (nextinfo - info >= 49) /*Erroneous info asked */ |
441 |
|
|
continue; |
442 |
root |
1.17 |
|
443 |
root |
1.16 |
strncpy (command, &(buf[info]), nextinfo - info); |
444 |
root |
1.17 |
|
445 |
root |
1.16 |
/* 2. Interpret info */ |
446 |
|
|
if (!strcmp ("smooth", command)) |
447 |
root |
1.17 |
/* Toggle smoothing */ |
448 |
|
|
ns->EMI_smooth = !ns->EMI_smooth; |
449 |
root |
1.16 |
else |
450 |
root |
1.17 |
/*bad value */; |
451 |
|
|
|
452 |
root |
1.16 |
/*3. Next info */ |
453 |
|
|
} |
454 |
root |
1.17 |
|
455 |
root |
1.16 |
strcpy (cmdback, "ExtendedInfoSet"); |
456 |
root |
1.17 |
|
457 |
root |
1.16 |
if (ns->EMI_smooth) |
458 |
|
|
{ |
459 |
|
|
strcat (cmdback, " "); |
460 |
|
|
strcat (cmdback, "smoothing"); |
461 |
|
|
} |
462 |
root |
1.17 |
|
463 |
root |
1.32 |
ns->send_packet (cmdback); |
464 |
elmex |
1.1 |
} |
465 |
root |
1.16 |
|
466 |
elmex |
1.1 |
/* |
467 |
|
|
#define MSG_TYPE_BOOK 1 |
468 |
|
|
#define MSG_TYPE_CARD 2 |
469 |
|
|
#define MSG_TYPE_PAPER 3 |
470 |
|
|
#define MSG_TYPE_SIGN 4 |
471 |
|
|
#define MSG_TYPE_MONUMENT 5 |
472 |
|
|
#define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
473 |
root |
1.16 |
|
474 |
elmex |
1.1 |
/** Reply to ExtendedInfos command */ |
475 |
root |
1.16 |
void |
476 |
root |
1.41 |
ToggleExtendedText (char *buf, int len, client * ns) |
477 |
root |
1.16 |
{ |
478 |
|
|
char cmdback[MAX_BUF]; |
479 |
|
|
char temp[10]; |
480 |
|
|
char command[50]; |
481 |
|
|
int info, nextinfo, i, flag; |
482 |
|
|
|
483 |
|
|
cmdback[0] = '\0'; |
484 |
root |
1.17 |
|
485 |
root |
1.16 |
nextinfo = 0; |
486 |
|
|
while (1) |
487 |
|
|
{ |
488 |
|
|
/* 1. Extract an info */ |
489 |
|
|
info = nextinfo; |
490 |
root |
1.17 |
|
491 |
root |
1.16 |
while ((info < len) && (buf[info] == ' ')) |
492 |
|
|
info++; |
493 |
root |
1.17 |
|
494 |
root |
1.16 |
if (info >= len) |
495 |
|
|
break; |
496 |
root |
1.17 |
|
497 |
root |
1.16 |
nextinfo = info + 1; |
498 |
root |
1.17 |
|
499 |
root |
1.16 |
while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
500 |
|
|
nextinfo++; |
501 |
root |
1.17 |
|
502 |
root |
1.16 |
if (nextinfo - info >= 49) /*Erroneous info asked */ |
503 |
|
|
continue; |
504 |
root |
1.17 |
|
505 |
root |
1.16 |
strncpy (command, &(buf[info]), nextinfo - info); |
506 |
|
|
command[nextinfo - info] = '\0'; |
507 |
|
|
/* 2. Interpret info */ |
508 |
|
|
i = sscanf (command, "%d", &flag); |
509 |
root |
1.17 |
|
510 |
root |
1.16 |
if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
511 |
|
|
ns->supported_readables |= (1 << flag); |
512 |
|
|
/*3. Next info */ |
513 |
|
|
} |
514 |
root |
1.17 |
|
515 |
root |
1.16 |
/* Send resulting state */ |
516 |
|
|
strcpy (cmdback, "ExtendedTextSet"); |
517 |
root |
1.17 |
|
518 |
root |
1.16 |
for (i = 0; i <= MSG_TYPE_LAST; i++) |
519 |
|
|
if (ns->supported_readables & (1 << i)) |
520 |
|
|
{ |
521 |
|
|
strcat (cmdback, " "); |
522 |
|
|
snprintf (temp, sizeof (temp), "%d", i); |
523 |
|
|
strcat (cmdback, temp); |
524 |
|
|
} |
525 |
root |
1.17 |
|
526 |
root |
1.32 |
ns->send_packet (cmdback); |
527 |
elmex |
1.1 |
} |
528 |
|
|
|
529 |
|
|
/** |
530 |
|
|
* This handles the general commands from the client (ie, north, fire, cast, |
531 |
|
|
* etc.) |
532 |
|
|
*/ |
533 |
root |
1.16 |
void |
534 |
|
|
PlayerCmd (char *buf, int len, player *pl) |
535 |
elmex |
1.1 |
{ |
536 |
root |
1.16 |
/* Check if there is a count. In theory, a zero count could also be |
537 |
|
|
* sent, so check for that also. |
538 |
|
|
*/ |
539 |
|
|
if (atoi (buf) || buf[0] == '0') |
540 |
|
|
{ |
541 |
|
|
pl->count = atoi ((char *) buf); |
542 |
root |
1.44 |
|
543 |
root |
1.16 |
buf = strchr (buf, ' '); /* advance beyond the numbers */ |
544 |
|
|
if (!buf) |
545 |
root |
1.44 |
return; |
546 |
|
|
|
547 |
root |
1.16 |
buf++; |
548 |
elmex |
1.1 |
} |
549 |
root |
1.44 |
|
550 |
root |
1.16 |
execute_newserver_command (pl->ob, (char *) buf); |
551 |
root |
1.44 |
|
552 |
root |
1.16 |
/* Perhaps something better should be done with a left over count. |
553 |
|
|
* Cleaning up the input should probably be done first - all actions |
554 |
|
|
* for the command that issued the count should be done before any other |
555 |
|
|
* commands. |
556 |
|
|
*/ |
557 |
|
|
pl->count = 0; |
558 |
elmex |
1.1 |
} |
559 |
|
|
|
560 |
|
|
/** |
561 |
|
|
* This handles the general commands from the client (ie, north, fire, cast, |
562 |
|
|
* etc.). It is a lot like PlayerCmd above, but is called with the |
563 |
|
|
* 'ncom' method which gives more information back to the client so it |
564 |
|
|
* can throttle. |
565 |
|
|
*/ |
566 |
root |
1.16 |
void |
567 |
root |
1.39 |
NewPlayerCmd (char *buf, int len, player *pl) |
568 |
elmex |
1.1 |
{ |
569 |
root |
1.44 |
if (len <= 6) |
570 |
root |
1.16 |
{ |
571 |
root |
1.113 |
LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len); |
572 |
root |
1.16 |
return; |
573 |
|
|
} |
574 |
|
|
|
575 |
root |
1.44 |
uint16 cmdid = net_uint16 ((uint8 *)buf); |
576 |
|
|
sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
577 |
root |
1.30 |
|
578 |
root |
1.16 |
/* -1 is special - no repeat, but don't update */ |
579 |
|
|
if (repeat != -1) |
580 |
root |
1.28 |
pl->count = repeat; |
581 |
|
|
|
582 |
root |
1.44 |
buf += 6; //len -= 6; |
583 |
root |
1.16 |
|
584 |
root |
1.44 |
execute_newserver_command (pl->ob, buf); |
585 |
root |
1.28 |
|
586 |
root |
1.16 |
/* Perhaps something better should be done with a left over count. |
587 |
|
|
* Cleaning up the input should probably be done first - all actions |
588 |
|
|
* for the command that issued the count should be done before any other |
589 |
|
|
* commands. |
590 |
|
|
*/ |
591 |
|
|
pl->count = 0; |
592 |
|
|
|
593 |
root |
1.44 |
//TODO: schmorp thinks whatever this calculates, it makes no sense at all |
594 |
root |
1.65 |
int time = fabs (pl->ob->speed) < 0.001 |
595 |
root |
1.44 |
? time = MAX_TIME * 100 |
596 |
root |
1.65 |
: time = (int) (MAX_TIME / fabs (pl->ob->speed)); |
597 |
root |
1.27 |
|
598 |
root |
1.28 |
/* Send confirmation of command execution now */ |
599 |
root |
1.47 |
packet sl ("comc"); |
600 |
|
|
sl << uint16 (cmdid) << uint32 (time); |
601 |
root |
1.50 |
pl->ns->send_packet (sl); |
602 |
elmex |
1.1 |
} |
603 |
|
|
|
604 |
|
|
/** This is a reply to a previous query. */ |
605 |
root |
1.16 |
void |
606 |
root |
1.49 |
ReplyCmd (char *buf, int len, client *ns) |
607 |
elmex |
1.1 |
{ |
608 |
root |
1.50 |
if (ns->state == ST_CUSTOM) |
609 |
|
|
{ |
610 |
|
|
INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len)); |
611 |
|
|
return; |
612 |
|
|
} |
613 |
|
|
|
614 |
root |
1.49 |
if (!ns->pl) |
615 |
|
|
return; //TODO: depends on the exact reply we are after |
616 |
|
|
//TODO: but right now, we always have a ns->pl |
617 |
|
|
|
618 |
|
|
player *pl = ns->pl; |
619 |
|
|
|
620 |
root |
1.16 |
/* This is to synthesize how the data would be stored if it |
621 |
root |
1.44 |
* was normally entered. A bit of a hack, and should be cleaned up |
622 |
root |
1.16 |
* once all the X11 code is removed from the server. |
623 |
|
|
* |
624 |
|
|
* We pass 13 to many of the functions because this way they |
625 |
|
|
* think it was the carriage return that was entered, and the |
626 |
|
|
* function then does not try to do additional input. |
627 |
|
|
*/ |
628 |
|
|
snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
629 |
|
|
|
630 |
|
|
/* this avoids any hacking here */ |
631 |
|
|
|
632 |
root |
1.50 |
switch (ns->state) |
633 |
root |
1.16 |
{ |
634 |
root |
1.44 |
case ST_PLAYING: |
635 |
|
|
LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
636 |
|
|
break; |
637 |
|
|
|
638 |
|
|
case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
639 |
|
|
receive_party_password (pl->ob, 13); |
640 |
|
|
break; |
641 |
elmex |
1.1 |
|
642 |
root |
1.44 |
default: |
643 |
root |
1.50 |
LOG (llevError, "Unknown input state: %d\n", ns->state); |
644 |
elmex |
1.1 |
} |
645 |
|
|
} |
646 |
|
|
|
647 |
|
|
/** |
648 |
|
|
* Client tells its version. If there is a mismatch, we close the |
649 |
|
|
* socket. In real life, all we should care about is the client having |
650 |
|
|
* something older than the server. If we assume the client will be |
651 |
|
|
* backwards compatible, having it be a later version should not be a |
652 |
|
|
* problem. |
653 |
|
|
*/ |
654 |
root |
1.16 |
void |
655 |
root |
1.41 |
VersionCmd (char *buf, int len, client * ns) |
656 |
elmex |
1.1 |
{ |
657 |
root |
1.16 |
if (!buf) |
658 |
|
|
{ |
659 |
|
|
LOG (llevError, "CS: received corrupted version command\n"); |
660 |
|
|
return; |
661 |
elmex |
1.1 |
} |
662 |
|
|
|
663 |
root |
1.16 |
ns->cs_version = atoi (buf); |
664 |
|
|
ns->sc_version = ns->cs_version; |
665 |
root |
1.44 |
|
666 |
|
|
LOG (llevDebug, "connection from client <%s>\n", buf); |
667 |
|
|
|
668 |
|
|
//TODO: should log here just for statistics |
669 |
|
|
|
670 |
|
|
//if (VERSION_CS != ns->cs_version) |
671 |
|
|
// unchecked; |
672 |
|
|
|
673 |
|
|
char *cp = strchr (buf + 1, ' '); |
674 |
root |
1.16 |
if (!cp) |
675 |
|
|
return; |
676 |
root |
1.44 |
|
677 |
root |
1.16 |
ns->sc_version = atoi (cp); |
678 |
root |
1.44 |
|
679 |
|
|
//if (VERSION_SC != ns->sc_version) |
680 |
|
|
// unchecked; |
681 |
|
|
|
682 |
root |
1.16 |
cp = strchr (cp + 1, ' '); |
683 |
root |
1.44 |
|
684 |
root |
1.16 |
if (cp) |
685 |
|
|
{ |
686 |
root |
1.89 |
ns->version = cp + 1; |
687 |
root |
1.16 |
|
688 |
root |
1.29 |
if (ns->sc_version < 1026) |
689 |
root |
1.44 |
ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
690 |
root |
1.16 |
"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
691 |
elmex |
1.1 |
} |
692 |
|
|
} |
693 |
|
|
|
694 |
|
|
/** sound related functions. */ |
695 |
root |
1.16 |
void |
696 |
root |
1.41 |
SetSound (char *buf, int len, client * ns) |
697 |
elmex |
1.1 |
{ |
698 |
root |
1.16 |
ns->sound = atoi (buf); |
699 |
elmex |
1.1 |
} |
700 |
|
|
|
701 |
|
|
/** client wants the map resent */ |
702 |
root |
1.16 |
void |
703 |
|
|
MapRedrawCmd (char *buf, int len, player *pl) |
704 |
elmex |
1.1 |
{ |
705 |
|
|
/* This function is currently disabled; just clearing the map state results in |
706 |
|
|
* display errors. It should clear the cache and send a newmap command. |
707 |
|
|
* Unfortunately this solution does not work because some client versions send |
708 |
|
|
* a mapredraw command after receiving a newmap command. |
709 |
|
|
*/ |
710 |
|
|
} |
711 |
|
|
|
712 |
|
|
/** |
713 |
|
|
* Moves an object (typically, container to inventory). |
714 |
|
|
* syntax is: move (to) (tag) (nrof) |
715 |
|
|
*/ |
716 |
root |
1.16 |
void |
717 |
|
|
MoveCmd (char *buf, int len, player *pl) |
718 |
elmex |
1.1 |
{ |
719 |
root |
1.129 |
int to, tag, nrof; |
720 |
elmex |
1.1 |
|
721 |
root |
1.129 |
if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
722 |
root |
1.16 |
{ |
723 |
root |
1.129 |
LOG (llevError, "Incomplete move command: %s\n", buf); |
724 |
|
|
return; |
725 |
elmex |
1.1 |
} |
726 |
root |
1.44 |
|
727 |
root |
1.129 |
esrv_move_object (pl->ob, to, tag, nrof); |
728 |
elmex |
1.1 |
} |
729 |
|
|
|
730 |
|
|
/****************************************************************************** |
731 |
|
|
* |
732 |
|
|
* Start of commands the server sends to the client. |
733 |
|
|
* |
734 |
|
|
******************************************************************************/ |
735 |
|
|
|
736 |
|
|
/** |
737 |
|
|
* Asks the client to query the user. This way, the client knows |
738 |
|
|
* it needs to send something back (vs just printing out a message) |
739 |
|
|
*/ |
740 |
root |
1.16 |
void |
741 |
root |
1.82 |
send_query (client *ns, uint8 flags, const char *text) |
742 |
elmex |
1.1 |
{ |
743 |
root |
1.44 |
ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
744 |
elmex |
1.1 |
} |
745 |
|
|
|
746 |
root |
1.91 |
/** |
747 |
|
|
* Get player's current range attack in obuf. |
748 |
|
|
*/ |
749 |
|
|
static void |
750 |
root |
1.95 |
rangetostring (player *pl, char *obuf) |
751 |
root |
1.91 |
{ |
752 |
|
|
dynbuf_text buf; |
753 |
|
|
|
754 |
root |
1.93 |
if (pl->ranged_ob) |
755 |
root |
1.96 |
buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
756 |
root |
1.93 |
|
757 |
|
|
if (pl->combat_ob) |
758 |
root |
1.96 |
buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
759 |
root |
1.91 |
|
760 |
root |
1.104 |
#if 0 |
761 |
root |
1.99 |
//TODO: remove this when slot system is working, this is only for debugging |
762 |
|
|
if (pl->ob->chosen_skill) |
763 |
|
|
buf << " Skill*: " << pl->ob->chosen_skill->name; |
764 |
root |
1.104 |
#endif |
765 |
root |
1.99 |
|
766 |
root |
1.96 |
//TODO: maybe golem should become the current_weapon, quite simply? |
767 |
root |
1.91 |
if (pl->golem) |
768 |
root |
1.96 |
buf << " Golem*: " << pl->golem->name; |
769 |
root |
1.91 |
|
770 |
root |
1.109 |
buf << '\0'; |
771 |
root |
1.94 |
buf.linearise (obuf); |
772 |
root |
1.91 |
} |
773 |
|
|
|
774 |
elmex |
1.1 |
#define AddIfInt64(Old,New,Type) if (Old != New) {\ |
775 |
root |
1.12 |
Old = New; \ |
776 |
root |
1.28 |
sl << uint8 (Type) << uint64 (New); \ |
777 |
root |
1.12 |
} |
778 |
elmex |
1.1 |
|
779 |
|
|
#define AddIfInt(Old,New,Type) if (Old != New) {\ |
780 |
root |
1.12 |
Old = New; \ |
781 |
root |
1.28 |
sl << uint8 (Type) << uint32 (New); \ |
782 |
root |
1.12 |
} |
783 |
elmex |
1.1 |
|
784 |
|
|
#define AddIfShort(Old,New,Type) if (Old != New) {\ |
785 |
root |
1.12 |
Old = New; \ |
786 |
root |
1.28 |
sl << uint8 (Type) << uint16 (New); \ |
787 |
root |
1.12 |
} |
788 |
elmex |
1.1 |
|
789 |
root |
1.98 |
#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\ |
790 |
root |
1.12 |
Old = New; \ |
791 |
root |
1.98 |
sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \ |
792 |
root |
1.12 |
} |
793 |
elmex |
1.1 |
|
794 |
|
|
#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
795 |
root |
1.28 |
free(Old); Old = strdup (New);\ |
796 |
|
|
sl << uint8 (Type) << data8 (New); \ |
797 |
root |
1.12 |
} |
798 |
elmex |
1.1 |
|
799 |
|
|
/** |
800 |
|
|
* Sends a statistics update. We look at the old values, |
801 |
|
|
* and only send what has changed. Stat mapping values are in newclient.h |
802 |
|
|
* Since this gets sent a lot, this is actually one of the few binary |
803 |
|
|
* commands for now. |
804 |
|
|
*/ |
805 |
root |
1.16 |
void |
806 |
|
|
esrv_update_stats (player *pl) |
807 |
elmex |
1.1 |
{ |
808 |
root |
1.16 |
char buf[MAX_BUF]; |
809 |
|
|
uint16 flags; |
810 |
|
|
|
811 |
root |
1.61 |
client *ns = pl->ns; |
812 |
|
|
if (!ns) |
813 |
|
|
return; |
814 |
|
|
|
815 |
root |
1.101 |
object *ob = pl->observe; |
816 |
root |
1.61 |
if (!ob) |
817 |
root |
1.53 |
return; |
818 |
|
|
|
819 |
root |
1.106 |
player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl; |
820 |
|
|
|
821 |
root |
1.47 |
packet sl ("stats"); |
822 |
elmex |
1.1 |
|
823 |
root |
1.61 |
AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
824 |
|
|
AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
825 |
|
|
AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP); |
826 |
|
|
AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP); |
827 |
|
|
AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE); |
828 |
|
|
AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE); |
829 |
|
|
AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR); |
830 |
|
|
AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX); |
831 |
|
|
AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON); |
832 |
|
|
AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
833 |
|
|
AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
834 |
|
|
AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
835 |
|
|
AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
836 |
root |
1.22 |
|
837 |
root |
1.52 |
for (int s = 0; s < NUM_SKILLS; s++) |
838 |
root |
1.106 |
if (object *skill = opl->last_skill_ob[s]) |
839 |
root |
1.61 |
if (skill->stats.exp != ns->last_skill_exp [s]) |
840 |
|
|
{ |
841 |
|
|
ns->last_skill_exp [s] = skill->stats.exp; |
842 |
|
|
|
843 |
|
|
/* Always send along the level if exp changes. This is only |
844 |
|
|
* 1 extra byte, but keeps processing simpler. |
845 |
|
|
*/ |
846 |
|
|
sl << uint8 (s + CS_STAT_SKILLINFO) |
847 |
|
|
<< uint8 (skill->level) |
848 |
|
|
<< uint64 (skill->stats.exp); |
849 |
|
|
} |
850 |
root |
1.28 |
|
851 |
root |
1.61 |
AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
852 |
|
|
AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
853 |
|
|
AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
854 |
|
|
AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
855 |
|
|
AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
856 |
root |
1.98 |
AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK); |
857 |
root |
1.61 |
AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
858 |
root |
1.98 |
AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK); |
859 |
root |
1.61 |
AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
860 |
root |
1.22 |
|
861 |
root |
1.16 |
flags = 0; |
862 |
root |
1.22 |
|
863 |
root |
1.106 |
if (opl->fire_on) |
864 |
root |
1.16 |
flags |= SF_FIREON; |
865 |
root |
1.22 |
|
866 |
root |
1.106 |
if (opl->run_on) |
867 |
root |
1.16 |
flags |= SF_RUNON; |
868 |
|
|
|
869 |
root |
1.61 |
AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
870 |
root |
1.22 |
|
871 |
root |
1.61 |
if (ns->sc_version < 1025) |
872 |
|
|
{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
873 |
root |
1.16 |
else |
874 |
root |
1.44 |
for (int i = 0; i < NROFATTACKS; i++) |
875 |
|
|
{ |
876 |
|
|
/* Skip ones we won't send */ |
877 |
|
|
if (atnr_cs_stat[i] == -1) |
878 |
|
|
continue; |
879 |
root |
1.16 |
|
880 |
root |
1.61 |
AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
881 |
root |
1.44 |
} |
882 |
root |
1.22 |
|
883 |
root |
1.50 |
if (pl->ns->monitor_spells) |
884 |
root |
1.16 |
{ |
885 |
root |
1.61 |
AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
886 |
|
|
AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
887 |
|
|
AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
888 |
root |
1.16 |
} |
889 |
root |
1.22 |
|
890 |
root |
1.106 |
rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
891 |
root |
1.61 |
AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
892 |
|
|
set_title (ob, buf); |
893 |
|
|
AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
894 |
root |
1.16 |
|
895 |
|
|
/* Only send it away if we have some actual data */ |
896 |
root |
1.34 |
if (sl.length () > 6) |
897 |
root |
1.61 |
ns->send_packet (sl); |
898 |
elmex |
1.1 |
} |
899 |
|
|
|
900 |
|
|
/** |
901 |
|
|
* Tells the client that here is a player it should start using. |
902 |
|
|
*/ |
903 |
root |
1.16 |
void |
904 |
root |
1.126 |
esrv_new_player (player *pl) |
905 |
elmex |
1.1 |
{ |
906 |
root |
1.126 |
sint32 weight = pl->ob->client_weight (); |
907 |
|
|
|
908 |
root |
1.47 |
packet sl ("player"); |
909 |
elmex |
1.1 |
|
910 |
root |
1.28 |
sl << uint32 (pl->ob->count) |
911 |
|
|
<< uint32 (weight) |
912 |
root |
1.69 |
<< uint32 (pl->ob->face) |
913 |
root |
1.28 |
<< data8 (pl->ob->name); |
914 |
root |
1.16 |
|
915 |
root |
1.61 |
pl->ns->last_weight = weight; |
916 |
root |
1.50 |
pl->ns->send_packet (sl); |
917 |
root |
1.16 |
SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
918 |
elmex |
1.1 |
} |
919 |
|
|
|
920 |
|
|
/****************************************************************************** |
921 |
|
|
* |
922 |
|
|
* Start of map related commands. |
923 |
|
|
* |
924 |
|
|
******************************************************************************/ |
925 |
|
|
|
926 |
|
|
/** Clears a map cell */ |
927 |
root |
1.16 |
static void |
928 |
root |
1.70 |
map_clearcell (struct MapCell *cell, int count) |
929 |
elmex |
1.1 |
{ |
930 |
root |
1.75 |
cell->faces[0] = 0; |
931 |
|
|
cell->faces[1] = 0; |
932 |
|
|
cell->faces[2] = 0; |
933 |
|
|
cell->smooth[0] = 0; |
934 |
|
|
cell->smooth[1] = 0; |
935 |
|
|
cell->smooth[2] = 0; |
936 |
|
|
cell->count = count; |
937 |
|
|
cell->stat_hp = 0; |
938 |
|
|
cell->flags = 0; |
939 |
|
|
cell->player = 0; |
940 |
elmex |
1.1 |
} |
941 |
|
|
|
942 |
|
|
#define MAX_LAYERS 3 |
943 |
|
|
|
944 |
|
|
/** |
945 |
|
|
* Removes the need to replicate the same code for each layer. |
946 |
|
|
* this returns true if this space is now in fact different than |
947 |
|
|
* it was. |
948 |
|
|
* sl is the socklist this data is going into. |
949 |
|
|
* ns is the socket we are working on - all the info we care |
950 |
|
|
* about is in this socket structure, so now need not pass the |
951 |
|
|
* entire player object. |
952 |
|
|
* layer is the layer to update, with 2 being the floor and 0 the |
953 |
|
|
* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
954 |
|
|
* take. Interesting to note that before this function, the map1 function |
955 |
|
|
* numbers the spaces differently - I think this was a leftover from |
956 |
|
|
* the map command, where the faces stack up. Sinces that is no longer |
957 |
|
|
* the case, it seems to make more sense to have these layer values |
958 |
|
|
* actually match. |
959 |
|
|
*/ |
960 |
root |
1.16 |
static int |
961 |
root |
1.75 |
update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer) |
962 |
elmex |
1.1 |
{ |
963 |
root |
1.75 |
object *ob = ms.faces_obj [layer]; |
964 |
root |
1.16 |
|
965 |
|
|
/* If there is no object for this space, or if the face for the object |
966 |
|
|
* is the blank face, set the face number to zero. |
967 |
|
|
* else if we have the stored head object for this space, that takes |
968 |
|
|
* precedence over the other object for this space. |
969 |
|
|
* otherwise, we do special head processing |
970 |
|
|
*/ |
971 |
root |
1.75 |
uint16 face_num = ob && ob->face != blank_face ? ob->face : 0; |
972 |
root |
1.16 |
|
973 |
|
|
/* We've gotten what face we want to use for the object. Now see if |
974 |
|
|
* if it has changed since we last sent it to the client. |
975 |
|
|
*/ |
976 |
root |
1.75 |
if (lastcell.faces[layer] != face_num) |
977 |
root |
1.16 |
{ |
978 |
root |
1.75 |
lastcell.faces[layer] = face_num; |
979 |
root |
1.73 |
|
980 |
root |
1.74 |
if (!ns.faces_sent[face_num]) |
981 |
root |
1.73 |
if (ob) |
982 |
|
|
ns.send_faces (ob); |
983 |
|
|
else |
984 |
root |
1.116 |
ns.send_face (face_num, 10); |
985 |
root |
1.28 |
|
986 |
|
|
sl << uint16 (face_num); |
987 |
root |
1.16 |
return 1; |
988 |
elmex |
1.1 |
} |
989 |
root |
1.28 |
|
990 |
root |
1.16 |
/* Nothing changed */ |
991 |
|
|
return 0; |
992 |
elmex |
1.1 |
} |
993 |
|
|
|
994 |
|
|
/** |
995 |
|
|
* Returns the size of a data for a map square as returned by |
996 |
|
|
* mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
997 |
|
|
* available. |
998 |
|
|
*/ |
999 |
root |
1.16 |
int |
1000 |
root |
1.41 |
getExtendedMapInfoSize (client * ns) |
1001 |
root |
1.16 |
{ |
1002 |
|
|
int result = 0; |
1003 |
|
|
|
1004 |
|
|
if (ns->ext_mapinfos) |
1005 |
|
|
{ |
1006 |
|
|
if (ns->EMI_smooth) |
1007 |
|
|
result += 1; /*One byte for smoothlevel */ |
1008 |
elmex |
1.1 |
} |
1009 |
root |
1.44 |
|
1010 |
root |
1.16 |
return result; |
1011 |
elmex |
1.1 |
} |
1012 |
root |
1.16 |
|
1013 |
root |
1.62 |
// prefetch (and touch) all maps within a specific distancd |
1014 |
|
|
static void |
1015 |
|
|
prefetch_surrounding_maps (maptile *map, int distance) |
1016 |
|
|
{ |
1017 |
|
|
map->last_access = runtime; |
1018 |
|
|
|
1019 |
|
|
if (--distance) |
1020 |
|
|
for (int dir = 4; --dir; ) |
1021 |
|
|
if (const shstr &path = map->tile_path [dir]) |
1022 |
|
|
if (maptile *&neigh = map->tile_map [dir]) |
1023 |
|
|
prefetch_surrounding_maps (neigh, distance); |
1024 |
|
|
else |
1025 |
|
|
neigh = maptile::find_async (path, map); |
1026 |
|
|
} |
1027 |
|
|
|
1028 |
|
|
// prefetch a generous area around the player |
1029 |
|
|
static void |
1030 |
|
|
prefetch_surrounding_maps (object *op) |
1031 |
|
|
{ |
1032 |
|
|
prefetch_surrounding_maps (op->map, 3); |
1033 |
|
|
} |
1034 |
|
|
|
1035 |
elmex |
1.1 |
/** |
1036 |
root |
1.101 |
* Draws client map. |
1037 |
elmex |
1.1 |
*/ |
1038 |
root |
1.16 |
void |
1039 |
root |
1.101 |
draw_client_map (player *pl) |
1040 |
elmex |
1.1 |
{ |
1041 |
root |
1.101 |
object *ob = pl->observe; |
1042 |
|
|
if (!ob->active) |
1043 |
|
|
return; |
1044 |
|
|
|
1045 |
|
|
maptile *plmap = ob->map; |
1046 |
|
|
|
1047 |
|
|
/* If player is just joining the game, he isn't here yet, so the map |
1048 |
|
|
* can get swapped out. If so, don't try to send them a map. All will |
1049 |
|
|
* be OK once they really log in. |
1050 |
|
|
*/ |
1051 |
root |
1.124 |
if (!plmap || plmap->in_memory != MAP_ACTIVE) |
1052 |
root |
1.101 |
return; |
1053 |
|
|
|
1054 |
root |
1.72 |
int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1055 |
root |
1.16 |
int estartlen, eoldlen; |
1056 |
|
|
uint8 eentrysize; |
1057 |
|
|
uint16 ewhatstart, ewhatflag; |
1058 |
|
|
uint8 extendedinfos; |
1059 |
|
|
|
1060 |
root |
1.101 |
check_map_change (pl); |
1061 |
|
|
prefetch_surrounding_maps (pl->ob); |
1062 |
root |
1.16 |
|
1063 |
root |
1.101 |
/* do LOS after calls to update_position */ |
1064 |
root |
1.102 |
if (ob != pl->ob) |
1065 |
|
|
clear_los (pl); |
1066 |
|
|
else if (pl->do_los) |
1067 |
root |
1.101 |
{ |
1068 |
|
|
update_los (ob); |
1069 |
|
|
pl->do_los = 0; |
1070 |
|
|
} |
1071 |
|
|
|
1072 |
|
|
/** |
1073 |
|
|
* This function uses the new map1 protocol command to send the map |
1074 |
|
|
* to the client. It is necessary because the old map command supports |
1075 |
|
|
* a maximum map size of 15x15. |
1076 |
|
|
* This function is much simpler than the old one. This is because |
1077 |
|
|
* the old function optimized to send as few face identifiers as possible, |
1078 |
|
|
* at the expense of sending more coordinate location (coordinates were |
1079 |
|
|
* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
1080 |
|
|
* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1081 |
|
|
* maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1082 |
|
|
* and use the other 4 bits for other informatiion. For full documentation |
1083 |
|
|
* of what we send, see the doc/Protocol file. |
1084 |
|
|
* I will describe internally what we do: |
1085 |
|
|
* the ns->lastmap shows how the map last looked when sent to the client. |
1086 |
|
|
* in the lastmap structure, there is a cells array, which is set to the |
1087 |
|
|
* maximum viewable size (As set in config.h). |
1088 |
|
|
* in the cells, there are faces and a count value. |
1089 |
|
|
* we use the count value to hold the darkness value. If -1, then this space |
1090 |
|
|
* is not viewable. |
1091 |
|
|
* we use faces[0] faces[1] faces[2] to hold what the three layers |
1092 |
|
|
* look like. |
1093 |
|
|
*/ |
1094 |
root |
1.58 |
|
1095 |
root |
1.101 |
client &socket = *pl->ns; |
1096 |
root |
1.16 |
|
1097 |
root |
1.47 |
packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1098 |
root |
1.33 |
packet esl; |
1099 |
root |
1.28 |
|
1100 |
root |
1.34 |
startlen = sl.length (); |
1101 |
root |
1.25 |
|
1102 |
root |
1.16 |
/*Extendedmapinfo structure initialisation */ |
1103 |
|
|
if (socket.ext_mapinfos) |
1104 |
|
|
{ |
1105 |
|
|
extendedinfos = EMI_NOREDRAW; |
1106 |
root |
1.25 |
|
1107 |
root |
1.16 |
if (socket.EMI_smooth) |
1108 |
|
|
extendedinfos |= EMI_SMOOTH; |
1109 |
root |
1.25 |
|
1110 |
root |
1.34 |
ewhatstart = esl.length (); |
1111 |
root |
1.16 |
ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit |
1112 |
|
|
could need to be taken away */ |
1113 |
|
|
eentrysize = getExtendedMapInfoSize (&socket); |
1114 |
root |
1.28 |
esl << "mapextended " |
1115 |
|
|
<< uint8 (extendedinfos) |
1116 |
|
|
<< uint8 (eentrysize); |
1117 |
root |
1.34 |
|
1118 |
|
|
estartlen = esl.length (); |
1119 |
root |
1.16 |
} |
1120 |
root |
1.25 |
|
1121 |
root |
1.16 |
/* x,y are the real map locations. ax, ay are viewport relative |
1122 |
|
|
* locations. |
1123 |
|
|
*/ |
1124 |
|
|
ay = 0; |
1125 |
|
|
|
1126 |
|
|
/* We could do this logic as conditionals in the if statement, |
1127 |
|
|
* but that started to get a bit messy to look at. |
1128 |
|
|
*/ |
1129 |
root |
1.101 |
max_x = ob->x + (socket.mapx + 1) / 2; |
1130 |
|
|
max_y = ob->y + (socket.mapy + 1) / 2; |
1131 |
root |
1.76 |
|
1132 |
root |
1.101 |
for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++) |
1133 |
root |
1.16 |
{ |
1134 |
root |
1.108 |
sint16 nx, ny; |
1135 |
|
|
maptile *m = 0; |
1136 |
|
|
|
1137 |
root |
1.16 |
ax = 0; |
1138 |
root |
1.101 |
for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++) |
1139 |
root |
1.16 |
{ |
1140 |
root |
1.108 |
// check to see if we can simply go one right quickly |
1141 |
|
|
++nx; |
1142 |
|
|
if (m && nx >= m->width) |
1143 |
|
|
m = 0; |
1144 |
|
|
|
1145 |
|
|
if (!m) |
1146 |
|
|
{ |
1147 |
|
|
nx = x; ny = y; m = plmap; |
1148 |
|
|
|
1149 |
root |
1.121 |
if (xy_normalise (m, nx, ny)) |
1150 |
|
|
m->touch (); |
1151 |
|
|
else |
1152 |
root |
1.108 |
m = 0; |
1153 |
|
|
} |
1154 |
|
|
|
1155 |
root |
1.72 |
int emask, mask; |
1156 |
root |
1.16 |
emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1157 |
|
|
|
1158 |
root |
1.25 |
MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1159 |
root |
1.16 |
|
1160 |
|
|
/* If the coordinates are not valid, or it is too dark to see, |
1161 |
|
|
* we tell the client as such |
1162 |
|
|
*/ |
1163 |
|
|
if (!m) |
1164 |
|
|
{ |
1165 |
|
|
/* space is out of map. Update space and clear values |
1166 |
|
|
* if this hasn't already been done. If the space is out |
1167 |
|
|
* of the map, it shouldn't have a head |
1168 |
|
|
*/ |
1169 |
|
|
if (lastcell.count != -1) |
1170 |
|
|
{ |
1171 |
root |
1.28 |
sl << uint16 (mask); |
1172 |
root |
1.70 |
map_clearcell (&lastcell, -1); |
1173 |
root |
1.12 |
} |
1174 |
root |
1.72 |
|
1175 |
|
|
continue; |
1176 |
root |
1.16 |
} |
1177 |
root |
1.72 |
|
1178 |
root |
1.102 |
int d = pl->blocked_los[ax][ay]; |
1179 |
root |
1.72 |
|
1180 |
|
|
if (d > 3) |
1181 |
root |
1.16 |
{ |
1182 |
root |
1.56 |
|
1183 |
root |
1.16 |
int need_send = 0, count; |
1184 |
|
|
|
1185 |
|
|
/* This block deals with spaces that are not visible for whatever |
1186 |
root |
1.71 |
* reason. Still may need to send the head for this space. |
1187 |
root |
1.16 |
*/ |
1188 |
root |
1.12 |
|
1189 |
root |
1.34 |
oldlen = sl.length (); |
1190 |
root |
1.3 |
|
1191 |
root |
1.28 |
sl << uint16 (mask); |
1192 |
root |
1.25 |
|
1193 |
root |
1.16 |
if (lastcell.count != -1) |
1194 |
|
|
need_send = 1; |
1195 |
root |
1.25 |
|
1196 |
root |
1.16 |
count = -1; |
1197 |
root |
1.3 |
|
1198 |
root |
1.70 |
/* properly clear a previously sent big face */ |
1199 |
root |
1.72 |
if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1200 |
root |
1.70 |
|| lastcell.stat_hp || lastcell.flags || lastcell.player) |
1201 |
|
|
need_send = 1; |
1202 |
root |
1.3 |
|
1203 |
root |
1.70 |
map_clearcell (&lastcell, count); |
1204 |
root |
1.3 |
|
1205 |
root |
1.16 |
if ((mask & 0xf) || need_send) |
1206 |
root |
1.37 |
sl[oldlen + 1] = mask & 0xff; |
1207 |
root |
1.16 |
else |
1208 |
root |
1.34 |
sl.reset (oldlen); |
1209 |
root |
1.16 |
} |
1210 |
|
|
else |
1211 |
|
|
{ |
1212 |
root |
1.71 |
/* In this block, the space is visible. |
1213 |
root |
1.16 |
*/ |
1214 |
|
|
|
1215 |
|
|
/* Rather than try to figure out what everything that we might |
1216 |
|
|
* need to send is, then form the packet after that, |
1217 |
|
|
* we presume that we will in fact form a packet, and update |
1218 |
|
|
* the bits by what we do actually send. If we send nothing, |
1219 |
root |
1.34 |
* we just back out sl.length () to the old value, and no harm |
1220 |
root |
1.16 |
* is done. |
1221 |
|
|
* I think this is simpler than doing a bunch of checks to see |
1222 |
|
|
* what if anything we need to send, setting the bits, then |
1223 |
|
|
* doing those checks again to add the real data. |
1224 |
|
|
*/ |
1225 |
root |
1.72 |
oldlen = sl.length (); |
1226 |
root |
1.34 |
eoldlen = esl.length (); |
1227 |
root |
1.72 |
|
1228 |
root |
1.28 |
sl << uint16 (mask); |
1229 |
root |
1.16 |
|
1230 |
|
|
unsigned char dummy; |
1231 |
|
|
unsigned char *last_ext = &dummy; |
1232 |
|
|
|
1233 |
|
|
/* Darkness changed */ |
1234 |
|
|
if (lastcell.count != d && socket.darkness) |
1235 |
|
|
{ |
1236 |
|
|
mask |= 0x8; |
1237 |
|
|
|
1238 |
|
|
if (socket.extmap) |
1239 |
|
|
{ |
1240 |
|
|
*last_ext |= 0x80; |
1241 |
root |
1.37 |
last_ext = &sl[sl.length ()]; |
1242 |
root |
1.28 |
sl << uint8 (d); |
1243 |
root |
1.16 |
} |
1244 |
|
|
else |
1245 |
root |
1.28 |
sl << uint8 (255 - 64 * d); |
1246 |
root |
1.16 |
} |
1247 |
root |
1.3 |
|
1248 |
root |
1.16 |
lastcell.count = d; |
1249 |
root |
1.8 |
|
1250 |
root |
1.75 |
mapspace &ms = m->at (nx, ny); |
1251 |
root |
1.107 |
ms.update (); |
1252 |
root |
1.75 |
|
1253 |
root |
1.16 |
if (socket.extmap) |
1254 |
|
|
{ |
1255 |
root |
1.86 |
uint8 stat_hp = 0; |
1256 |
root |
1.16 |
uint8 stat_width = 0; |
1257 |
root |
1.86 |
uint8 flags = 0; |
1258 |
|
|
tag_t player = 0; |
1259 |
root |
1.16 |
|
1260 |
|
|
// send hp information, if applicable |
1261 |
root |
1.75 |
if (object *op = ms.faces_obj [0]) |
1262 |
root |
1.125 |
if (op->is_head () && !op->invisible) |
1263 |
|
|
{ |
1264 |
|
|
if (op->stats.maxhp > op->stats.hp |
1265 |
|
|
&& op->stats.maxhp > 0 |
1266 |
|
|
&& (op->type == PLAYER |
1267 |
|
|
|| op->type == DOOR // does not work, have maxhp 0 |
1268 |
|
|
|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))) |
1269 |
|
|
{ |
1270 |
|
|
stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1271 |
|
|
stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
1272 |
|
|
} |
1273 |
|
|
|
1274 |
|
|
if (op->msg && op->msg[0] == '@') |
1275 |
|
|
flags |= 1; |
1276 |
|
|
|
1277 |
|
|
if (op->type == PLAYER && op != ob) |
1278 |
|
|
player = op->count; |
1279 |
|
|
} |
1280 |
root |
1.12 |
|
1281 |
root |
1.16 |
if (lastcell.stat_hp != stat_hp) |
1282 |
|
|
{ |
1283 |
|
|
lastcell.stat_hp = stat_hp; |
1284 |
|
|
|
1285 |
|
|
mask |= 0x8; |
1286 |
|
|
*last_ext |= 0x80; |
1287 |
root |
1.37 |
last_ext = &sl[sl.length ()]; |
1288 |
root |
1.27 |
|
1289 |
|
|
sl << uint8 (5) << uint8 (stat_hp); |
1290 |
root |
1.16 |
|
1291 |
|
|
if (stat_width > 1) |
1292 |
|
|
{ |
1293 |
|
|
*last_ext |= 0x80; |
1294 |
root |
1.37 |
last_ext = &sl[sl.length ()]; |
1295 |
root |
1.27 |
|
1296 |
|
|
sl << uint8 (6) << uint8 (stat_width); |
1297 |
root |
1.16 |
} |
1298 |
|
|
} |
1299 |
root |
1.12 |
|
1300 |
root |
1.20 |
if (lastcell.player != player) |
1301 |
root |
1.16 |
{ |
1302 |
|
|
lastcell.player = player; |
1303 |
|
|
|
1304 |
|
|
mask |= 0x8; |
1305 |
|
|
*last_ext |= 0x80; |
1306 |
root |
1.37 |
last_ext = &sl[sl.length ()]; |
1307 |
root |
1.27 |
|
1308 |
root |
1.87 |
sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1309 |
root |
1.16 |
} |
1310 |
root |
1.24 |
|
1311 |
|
|
if (lastcell.flags != flags) |
1312 |
|
|
{ |
1313 |
|
|
lastcell.flags = flags; |
1314 |
|
|
|
1315 |
|
|
mask |= 0x8; |
1316 |
|
|
*last_ext |= 0x80; |
1317 |
root |
1.37 |
last_ext = &sl[sl.length ()]; |
1318 |
root |
1.27 |
|
1319 |
|
|
sl << uint8 (8) << uint8 (flags); |
1320 |
root |
1.24 |
} |
1321 |
root |
1.16 |
} |
1322 |
root |
1.12 |
|
1323 |
root |
1.16 |
/* Floor face */ |
1324 |
root |
1.75 |
if (update_space (sl, socket, ms, lastcell, 2)) |
1325 |
root |
1.16 |
mask |= 0x4; |
1326 |
|
|
|
1327 |
|
|
/* Middle face */ |
1328 |
root |
1.75 |
if (update_space (sl, socket, ms, lastcell, 1)) |
1329 |
root |
1.16 |
mask |= 0x2; |
1330 |
|
|
|
1331 |
root |
1.101 |
if (ms.player () == ob |
1332 |
|
|
&& (ob->invisible & (ob->invisible < 50 ? 1 : 7))) |
1333 |
root |
1.16 |
{ |
1334 |
root |
1.75 |
// force player to be visible to himself if invisible |
1335 |
root |
1.101 |
if (lastcell.faces[0] != ob->face) |
1336 |
root |
1.16 |
{ |
1337 |
root |
1.101 |
lastcell.faces[0] = ob->face; |
1338 |
root |
1.75 |
|
1339 |
root |
1.16 |
mask |= 0x1; |
1340 |
root |
1.101 |
sl << uint16 (ob->face); |
1341 |
root |
1.25 |
|
1342 |
root |
1.101 |
socket.send_faces (ob); |
1343 |
root |
1.12 |
} |
1344 |
|
|
} |
1345 |
root |
1.75 |
/* Top face */ |
1346 |
|
|
else if (update_space (sl, socket, ms, lastcell, 0)) |
1347 |
|
|
mask |= 0x1; |
1348 |
root |
1.25 |
|
1349 |
root |
1.16 |
/* Check to see if we are in fact sending anything for this |
1350 |
|
|
* space by checking the mask. If so, update the mask. |
1351 |
|
|
* if not, reset the len to that from before adding the mask |
1352 |
|
|
* value, so we don't send those bits. |
1353 |
|
|
*/ |
1354 |
|
|
if (mask & 0xf) |
1355 |
root |
1.37 |
sl[oldlen + 1] = mask & 0xff; |
1356 |
root |
1.16 |
else |
1357 |
root |
1.34 |
sl.reset (oldlen); |
1358 |
root |
1.25 |
|
1359 |
root |
1.75 |
if (socket.ext_mapinfos) |
1360 |
|
|
esl << uint16 (emask); |
1361 |
|
|
|
1362 |
|
|
if (socket.EMI_smooth) |
1363 |
|
|
{ |
1364 |
|
|
for (int layer = 2+1; layer--; ) |
1365 |
|
|
{ |
1366 |
|
|
object *ob = ms.faces_obj [layer]; |
1367 |
|
|
|
1368 |
|
|
// If there is no object for this space, or if the face for the object |
1369 |
|
|
// is the blank face, set the smoothlevel to zero. |
1370 |
|
|
int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
1371 |
|
|
|
1372 |
|
|
// We've gotten what face we want to use for the object. Now see if |
1373 |
|
|
// if it has changed since we last sent it to the client. |
1374 |
|
|
if (lastcell.smooth[layer] != smoothlevel) |
1375 |
|
|
{ |
1376 |
|
|
lastcell.smooth[layer] = smoothlevel; |
1377 |
|
|
esl << uint8 (smoothlevel); |
1378 |
|
|
emask |= 1 << layer; |
1379 |
|
|
} |
1380 |
|
|
} |
1381 |
|
|
|
1382 |
|
|
if (emask & 0xf) |
1383 |
|
|
esl[eoldlen + 1] = emask & 0xff; |
1384 |
|
|
else |
1385 |
|
|
esl.reset (eoldlen); |
1386 |
|
|
} |
1387 |
root |
1.16 |
} /* else this is a viewable space */ |
1388 |
|
|
} /* for x loop */ |
1389 |
|
|
} /* for y loop */ |
1390 |
|
|
|
1391 |
root |
1.84 |
socket.flush_fx (); |
1392 |
|
|
|
1393 |
root |
1.16 |
/* Verify that we in fact do need to send this */ |
1394 |
|
|
if (socket.ext_mapinfos) |
1395 |
|
|
{ |
1396 |
root |
1.34 |
if (!(sl.length () > startlen || socket.sent_scroll)) |
1397 |
root |
1.16 |
{ |
1398 |
|
|
/* No map data will follow, so don't say the client |
1399 |
|
|
* it doesn't need draw! |
1400 |
|
|
*/ |
1401 |
root |
1.72 |
ewhatflag &= ~EMI_NOREDRAW; |
1402 |
root |
1.37 |
esl[ewhatstart + 1] = ewhatflag & 0xff; |
1403 |
root |
1.16 |
} |
1404 |
root |
1.18 |
|
1405 |
root |
1.34 |
if (esl.length () > estartlen) |
1406 |
root |
1.37 |
socket.send_packet (esl); |
1407 |
root |
1.16 |
} |
1408 |
root |
1.18 |
|
1409 |
root |
1.34 |
if (sl.length () > startlen || socket.sent_scroll) |
1410 |
root |
1.16 |
{ |
1411 |
root |
1.37 |
socket.send_packet (sl); |
1412 |
root |
1.16 |
socket.sent_scroll = 0; |
1413 |
elmex |
1.1 |
} |
1414 |
|
|
} |
1415 |
|
|
|
1416 |
|
|
/*****************************************************************************/ |
1417 |
|
|
/* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
1418 |
|
|
/* a player. Of course, the client need to know the command to be able to */ |
1419 |
|
|
/* manage it ! */ |
1420 |
|
|
/*****************************************************************************/ |
1421 |
root |
1.16 |
void |
1422 |
|
|
send_plugin_custom_message (object *pl, char *buf) |
1423 |
elmex |
1.1 |
{ |
1424 |
root |
1.50 |
pl->contr->ns->send_packet (buf); |
1425 |
elmex |
1.1 |
} |
1426 |
|
|
|
1427 |
|
|
/** |
1428 |
|
|
* This sends the skill number to name mapping. We ignore |
1429 |
|
|
* the params - we always send the same info no matter what. |
1430 |
|
|
*/ |
1431 |
root |
1.16 |
void |
1432 |
root |
1.41 |
send_skill_info (client *ns, char *params) |
1433 |
elmex |
1.1 |
{ |
1434 |
root |
1.33 |
packet sl; |
1435 |
root |
1.28 |
sl << "replyinfo skill_info\n"; |
1436 |
|
|
|
1437 |
|
|
for (int i = 1; i < NUM_SKILLS; i++) |
1438 |
root |
1.29 |
sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
1439 |
elmex |
1.1 |
|
1440 |
root |
1.118 |
if (sl.length () > MAXSOCKBUF) |
1441 |
root |
1.16 |
{ |
1442 |
|
|
LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1443 |
|
|
fatal (0); |
1444 |
elmex |
1.1 |
} |
1445 |
root |
1.28 |
|
1446 |
root |
1.37 |
ns->send_packet (sl); |
1447 |
elmex |
1.1 |
} |
1448 |
|
|
|
1449 |
|
|
/** |
1450 |
|
|
* This sends the spell path to name mapping. We ignore |
1451 |
|
|
* the params - we always send the same info no matter what. |
1452 |
|
|
*/ |
1453 |
root |
1.16 |
void |
1454 |
root |
1.41 |
send_spell_paths (client * ns, char *params) |
1455 |
root |
1.16 |
{ |
1456 |
root |
1.33 |
packet sl; |
1457 |
root |
1.28 |
|
1458 |
|
|
sl << "replyinfo spell_paths\n"; |
1459 |
|
|
|
1460 |
|
|
for (int i = 0; i < NRSPELLPATHS; i++) |
1461 |
root |
1.29 |
sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1462 |
root |
1.16 |
|
1463 |
root |
1.118 |
if (sl.length () > MAXSOCKBUF) |
1464 |
root |
1.16 |
{ |
1465 |
|
|
LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1466 |
|
|
fatal (0); |
1467 |
elmex |
1.1 |
} |
1468 |
root |
1.28 |
|
1469 |
root |
1.37 |
ns->send_packet (sl); |
1470 |
elmex |
1.1 |
} |
1471 |
|
|
|
1472 |
|
|
/** |
1473 |
|
|
* This looks for any spells the player may have that have changed their stats. |
1474 |
|
|
* it then sends an updspell packet for each spell that has changed in this way |
1475 |
|
|
*/ |
1476 |
root |
1.16 |
void |
1477 |
|
|
esrv_update_spells (player *pl) |
1478 |
|
|
{ |
1479 |
root |
1.53 |
if (!pl->ns) |
1480 |
|
|
return; |
1481 |
|
|
|
1482 |
root |
1.50 |
if (!pl->ns->monitor_spells) |
1483 |
root |
1.16 |
return; |
1484 |
root |
1.28 |
|
1485 |
|
|
for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1486 |
root |
1.16 |
{ |
1487 |
|
|
if (spell->type == SPELL) |
1488 |
|
|
{ |
1489 |
root |
1.28 |
int flags = 0; |
1490 |
|
|
|
1491 |
root |
1.16 |
/* check if we need to update it */ |
1492 |
|
|
if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1493 |
|
|
{ |
1494 |
|
|
spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1495 |
|
|
flags |= UPD_SP_MANA; |
1496 |
|
|
} |
1497 |
root |
1.28 |
|
1498 |
root |
1.16 |
if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1499 |
|
|
{ |
1500 |
|
|
spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1501 |
|
|
flags |= UPD_SP_GRACE; |
1502 |
|
|
} |
1503 |
root |
1.28 |
|
1504 |
root |
1.16 |
if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1505 |
|
|
{ |
1506 |
|
|
spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1507 |
|
|
flags |= UPD_SP_DAMAGE; |
1508 |
|
|
} |
1509 |
root |
1.28 |
|
1510 |
|
|
if (flags) |
1511 |
root |
1.16 |
{ |
1512 |
root |
1.33 |
packet sl; |
1513 |
root |
1.27 |
|
1514 |
root |
1.28 |
sl << "updspell " |
1515 |
|
|
<< uint8 (flags) |
1516 |
|
|
<< uint32 (spell->count); |
1517 |
root |
1.27 |
|
1518 |
|
|
if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1519 |
|
|
if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1520 |
|
|
if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1521 |
|
|
|
1522 |
root |
1.50 |
pl->ns->send_packet (sl); |
1523 |
root |
1.12 |
} |
1524 |
|
|
} |
1525 |
elmex |
1.1 |
} |
1526 |
|
|
} |
1527 |
|
|
|
1528 |
root |
1.16 |
void |
1529 |
|
|
esrv_remove_spell (player *pl, object *spell) |
1530 |
|
|
{ |
1531 |
root |
1.50 |
if (!pl->ns->monitor_spells) |
1532 |
root |
1.16 |
return; |
1533 |
root |
1.28 |
|
1534 |
root |
1.16 |
if (!pl || !spell || spell->env != pl->ob) |
1535 |
|
|
{ |
1536 |
|
|
LOG (llevError, "Invalid call to esrv_remove_spell"); |
1537 |
|
|
return; |
1538 |
|
|
} |
1539 |
root |
1.27 |
|
1540 |
root |
1.47 |
packet sl ("delspell"); |
1541 |
root |
1.28 |
|
1542 |
root |
1.47 |
sl << uint32 (spell->count); |
1543 |
root |
1.27 |
|
1544 |
root |
1.50 |
pl->ns->send_packet (sl); |
1545 |
elmex |
1.1 |
} |
1546 |
|
|
|
1547 |
|
|
/* appends the spell *spell to the Socklist we will send the data to. */ |
1548 |
root |
1.16 |
static void |
1549 |
root |
1.33 |
append_spell (player *pl, packet &sl, object *spell) |
1550 |
root |
1.16 |
{ |
1551 |
pippijn |
1.67 |
int i, skill = 0; |
1552 |
root |
1.16 |
|
1553 |
|
|
if (!(spell->name)) |
1554 |
|
|
{ |
1555 |
|
|
LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1556 |
|
|
return; |
1557 |
|
|
} |
1558 |
root |
1.27 |
|
1559 |
root |
1.16 |
/* store costs and damage in the object struct, to compare to later */ |
1560 |
root |
1.27 |
spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1561 |
root |
1.16 |
spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1562 |
root |
1.27 |
spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1563 |
elmex |
1.1 |
|
1564 |
root |
1.16 |
/* figure out which skill it uses, if it uses one */ |
1565 |
|
|
if (spell->skill) |
1566 |
|
|
{ |
1567 |
|
|
for (i = 1; i < NUM_SKILLS; i++) |
1568 |
|
|
if (!strcmp (spell->skill, skill_names[i])) |
1569 |
|
|
{ |
1570 |
|
|
skill = i + CS_STAT_SKILLINFO; |
1571 |
|
|
break; |
1572 |
|
|
} |
1573 |
elmex |
1.1 |
} |
1574 |
|
|
|
1575 |
root |
1.69 |
// spells better have a face |
1576 |
|
|
if (!spell->face) |
1577 |
|
|
{ |
1578 |
|
|
LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1579 |
|
|
spell->face = face_find ("burnout.x11", blank_face); |
1580 |
|
|
} |
1581 |
|
|
|
1582 |
root |
1.117 |
pl->ns->send_face (spell->face); |
1583 |
|
|
|
1584 |
root |
1.27 |
/* send the current values */ |
1585 |
|
|
sl << uint32 (spell->count) |
1586 |
|
|
<< uint16 (spell->level) |
1587 |
|
|
<< uint16 (spell->casting_time) |
1588 |
|
|
<< uint16 (spell->last_sp) |
1589 |
|
|
<< uint16 (spell->last_grace) |
1590 |
|
|
<< uint16 (spell->last_eat) |
1591 |
|
|
<< uint8 (skill) |
1592 |
|
|
<< uint32 (spell->path_attuned) |
1593 |
root |
1.69 |
<< uint32 (spell->face) |
1594 |
root |
1.27 |
<< data8 (spell->name) |
1595 |
|
|
<< data16 (spell->msg); |
1596 |
elmex |
1.1 |
} |
1597 |
|
|
|
1598 |
|
|
/** |
1599 |
|
|
* This tells the client to add the spell *ob, if *ob is NULL, then add |
1600 |
|
|
* all spells in the player's inventory. |
1601 |
|
|
*/ |
1602 |
root |
1.16 |
void |
1603 |
|
|
esrv_add_spells (player *pl, object *spell) |
1604 |
|
|
{ |
1605 |
|
|
if (!pl) |
1606 |
|
|
{ |
1607 |
|
|
LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
1608 |
|
|
return; |
1609 |
|
|
} |
1610 |
root |
1.28 |
|
1611 |
root |
1.50 |
if (!pl->ns->monitor_spells) |
1612 |
root |
1.16 |
return; |
1613 |
root |
1.28 |
|
1614 |
root |
1.47 |
packet sl ("addspell"); |
1615 |
root |
1.28 |
|
1616 |
root |
1.16 |
if (!spell) |
1617 |
|
|
{ |
1618 |
root |
1.69 |
for (spell = pl->ob->inv; spell; spell = spell->below) |
1619 |
root |
1.16 |
{ |
1620 |
|
|
/* were we to simply keep appending data here, we could exceed |
1621 |
|
|
* MAXSOCKBUF if the player has enough spells to add, we know that |
1622 |
|
|
* append_spells will always append 19 data bytes, plus 4 length |
1623 |
|
|
* bytes and 3 strings (because that is the spec) so we need to |
1624 |
|
|
* check that the length of those 3 strings, plus the 23 bytes, |
1625 |
|
|
* won't take us over the length limit for the socket, if it does, |
1626 |
|
|
* we need to send what we already have, and restart packet formation |
1627 |
|
|
*/ |
1628 |
root |
1.117 |
if (spell->type != SPELL) |
1629 |
|
|
continue; |
1630 |
|
|
|
1631 |
root |
1.16 |
/* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1632 |
|
|
* to show add_spell is 26 bytes + 2 strings. However, the overun |
1633 |
|
|
* is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1634 |
|
|
* like it will fix this |
1635 |
|
|
*/ |
1636 |
root |
1.118 |
if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1637 |
root |
1.16 |
{ |
1638 |
root |
1.117 |
pl->ns->flush_fx (); |
1639 |
root |
1.50 |
pl->ns->send_packet (sl); |
1640 |
root |
1.34 |
|
1641 |
|
|
sl.reset (); |
1642 |
|
|
sl << "addspell "; |
1643 |
root |
1.16 |
} |
1644 |
root |
1.27 |
|
1645 |
|
|
append_spell (pl, sl, spell); |
1646 |
root |
1.16 |
} |
1647 |
|
|
} |
1648 |
|
|
else if (spell->type != SPELL) |
1649 |
|
|
{ |
1650 |
|
|
LOG (llevError, "Asked to send a non-spell object as a spell"); |
1651 |
|
|
return; |
1652 |
|
|
} |
1653 |
|
|
else |
1654 |
root |
1.27 |
append_spell (pl, sl, spell); |
1655 |
|
|
|
1656 |
root |
1.118 |
if (sl.length () > MAXSOCKBUF) |
1657 |
root |
1.16 |
{ |
1658 |
|
|
LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1659 |
|
|
fatal (0); |
1660 |
|
|
} |
1661 |
root |
1.27 |
|
1662 |
root |
1.16 |
/* finally, we can send the packet */ |
1663 |
root |
1.117 |
pl->ns->flush_fx (); |
1664 |
root |
1.50 |
pl->ns->send_packet (sl); |
1665 |
elmex |
1.1 |
} |
1666 |
root |
1.28 |
|