1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001 Mark Wedel |
5 | * Copyright (C) 2001 Mark Wedel |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /** |
25 | /** |
25 | * \file |
26 | * \file |
26 | * Client handling. |
27 | * Client handling. |
27 | * |
28 | * |
… | |
… | |
35 | * have the prototype of (char *data, int datalen, int client_num). This |
36 | * have the prototype of (char *data, int datalen, int client_num). This |
36 | * way, we can use one dispatch table. |
37 | * way, we can use one dispatch table. |
37 | * |
38 | * |
38 | * esrv_map_new starts updating the map |
39 | * esrv_map_new starts updating the map |
39 | * |
40 | * |
40 | * esrv_map_setbelow allows filling in all of the faces for the map. |
|
|
41 | * if a face has not already been sent to the client, it is sent now. |
|
|
42 | * |
|
|
43 | */ |
41 | */ |
44 | |
42 | |
45 | #include <global.h> |
43 | #include <global.h> |
46 | #include <sproto.h> |
44 | #include <sproto.h> |
47 | |
45 | |
… | |
… | |
100 | * that much difference in bandwidth. |
98 | * that much difference in bandwidth. |
101 | */ |
99 | */ |
102 | mx = ns->mapx; |
100 | mx = ns->mapx; |
103 | my = ns->mapy; |
101 | my = ns->mapy; |
104 | |
102 | |
105 | if (ns->mapmode == Map1aCmd) |
|
|
106 | { |
|
|
107 | mx += MAX_HEAD_OFFSET; |
|
|
108 | my += MAX_HEAD_OFFSET; |
|
|
109 | } |
|
|
110 | |
|
|
111 | /* the x and y here are coordinates for the new map, i.e. if we moved |
103 | /* the x and y here are coordinates for the new map, i.e. if we moved |
112 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
104 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
113 | * if the destination x or y coordinate is outside the viewable |
105 | * if the destination x or y coordinate is outside the viewable |
114 | * area, we clear the values - otherwise, the old values |
106 | * area, we clear the values - otherwise, the old values |
115 | * are preserved, and the check_head thinks it needs to clear them. |
107 | * are preserved, and the check_head thinks it needs to clear them. |
… | |
… | |
138 | } |
130 | } |
139 | |
131 | |
140 | static void |
132 | static void |
141 | clear_map (player *pl) |
133 | clear_map (player *pl) |
142 | { |
134 | { |
143 | client &socket = *pl->socket; |
|
|
144 | |
|
|
145 | memset (&socket.lastmap, 0, sizeof (socket.lastmap)); |
135 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
146 | |
136 | |
|
|
137 | pl->ns->force_newmap = false; |
|
|
138 | |
147 | if (socket.newmapcmd == 1) |
139 | if (pl->ns->newmapcmd == 1) |
148 | socket.send_packet ("newmap"); |
140 | pl->ns->send_packet ("newmap"); |
149 | |
141 | |
150 | socket.update_look = 1; |
142 | pl->ns->floorbox_reset (); |
151 | socket.look_position = 0; |
|
|
152 | } |
143 | } |
153 | |
144 | |
154 | /** check for map change and send new map data */ |
145 | /** check for map/region change and send new map data */ |
155 | static void |
146 | static void |
156 | check_map_change (player *pl) |
147 | check_map_change (player *pl) |
157 | { |
148 | { |
158 | client &socket = *pl->socket; |
149 | client &socket = *pl->ns; |
159 | object *ob = pl->ob; |
150 | object *ob = pl->ob; |
160 | char buf[MAX_BUF]; /* eauugggh */ |
151 | char buf[MAX_BUF]; /* eauugggh */ |
161 | |
152 | |
162 | if (socket.current_map != ob->map) |
153 | if (socket.current_map != ob->map || socket.force_newmap) |
163 | { |
154 | { |
|
|
155 | clear_map (pl); |
164 | socket.current_map = ob->map; |
156 | socket.current_map = ob->map; |
165 | |
|
|
166 | clear_map (pl); |
|
|
167 | |
157 | |
168 | if (socket.mapinfocmd) |
158 | if (socket.mapinfocmd) |
169 | { |
159 | { |
170 | if (ob->map && ob->map->path[0]) |
160 | if (ob->map && ob->map->path[0]) |
171 | { |
161 | { |
172 | int flags = 0; |
162 | int flags = 0; |
173 | |
163 | |
174 | if (ob->map->tile_path[0]) |
164 | if (ob->map->tile_path[0]) flags |= 1; |
175 | flags |= 1; |
|
|
176 | if (ob->map->tile_path[1]) |
165 | if (ob->map->tile_path[1]) flags |= 2; |
177 | flags |= 2; |
|
|
178 | if (ob->map->tile_path[2]) |
166 | if (ob->map->tile_path[2]) flags |= 4; |
179 | flags |= 4; |
|
|
180 | if (ob->map->tile_path[3]) |
167 | if (ob->map->tile_path[3]) flags |= 8; |
181 | flags |= 8; |
|
|
182 | |
168 | |
183 | snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
169 | snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
184 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path); |
170 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path); |
185 | } |
171 | } |
186 | else |
172 | else |
187 | snprintf (buf, MAX_BUF, "mapinfo current"); |
173 | snprintf (buf, MAX_BUF, "mapinfo current"); |
188 | |
174 | |
189 | socket.send_packet (buf); |
175 | socket.send_packet (buf); |
… | |
… | |
197 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
183 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
198 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
184 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
199 | else |
185 | else |
200 | { |
186 | { |
201 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
187 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
202 | socket.update_look = 1; |
188 | socket.floorbox_reset (); |
203 | socket.look_position = 0; |
|
|
204 | } |
189 | } |
205 | } |
190 | } |
206 | |
191 | |
207 | socket.current_x = ob->x; |
192 | socket.current_x = ob->x; |
208 | socket.current_y = ob->y; |
193 | socket.current_y = ob->y; |
|
|
194 | |
|
|
195 | region *reg = ob->region (); |
|
|
196 | if (socket.current_region != reg) |
|
|
197 | { |
|
|
198 | socket.current_region = reg; |
|
|
199 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
|
|
200 | } |
209 | } |
201 | } |
210 | |
202 | |
211 | /** |
203 | /** |
212 | * RequestInfo is sort of a meta command. There is some specific |
204 | * RequestInfo is sort of a meta command. There is some specific |
213 | * request of information, but we call other functions to provide |
205 | * request of information, but we call other functions to provide |
… | |
… | |
257 | { |
249 | { |
258 | INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
250 | INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
259 | } |
251 | } |
260 | |
252 | |
261 | void |
253 | void |
|
|
254 | ExtiCmd (char *buf, int len, client *ns) |
|
|
255 | { |
|
|
256 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
|
|
257 | } |
|
|
258 | |
|
|
259 | void |
262 | MapInfoCmd (char *buf, int len, player *pl) |
260 | MapInfoCmd (char *buf, int len, player *pl) |
263 | { |
261 | { |
264 | // <mapinfo tag spatial tile-path |
262 | // <mapinfo tag spatial tile-path |
265 | // >mapinfo tag spatial flags x y w h hash |
263 | // >mapinfo tag spatial flags x y w h hash |
266 | |
264 | |
… | |
… | |
278 | buf += 8; |
276 | buf += 8; |
279 | |
277 | |
280 | // initial map and its origin |
278 | // initial map and its origin |
281 | maptile *map = pl->ob->map; |
279 | maptile *map = pl->ob->map; |
282 | sint16 dx, dy; |
280 | sint16 dx, dy; |
283 | int mapx = pl->socket->mapx / 2 - pl->ob->x; |
281 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
284 | int mapy = pl->socket->mapy / 2 - pl->ob->y; |
282 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
285 | int max_distance = 8; // limit maximum path length to something generous |
283 | int max_distance = 8; // limit maximum path length to something generous |
286 | |
284 | |
287 | while (*buf && map && max_distance) |
285 | while (*buf && map && max_distance) |
288 | { |
286 | { |
289 | int dir = *buf++; |
287 | int dir = *buf++; |
290 | |
288 | |
291 | switch (dir) |
289 | switch (dir) |
292 | { |
290 | { |
293 | case '1': |
291 | case '1': |
294 | dx = 0; |
292 | dx = 0; |
295 | dy = -1; |
293 | dy = -1; |
296 | map = get_map_from_coord (map, &dx, &dy); |
294 | map = map->xy_find (dx, dy); |
297 | map && (mapy -= map->height); |
295 | map && (mapy -= map->height); |
298 | break; |
296 | break; |
299 | case '2': |
297 | case '2': |
300 | mapx += map->width; |
298 | mapx += map->width; |
301 | dx = map->width; |
299 | dx = map->width; |
302 | dy = 0; |
300 | dy = 0; |
303 | map = get_map_from_coord (map, &dx, &dy); |
301 | map = map->xy_find (dx, dy); |
304 | break; |
302 | break; |
305 | case '3': |
303 | case '3': |
306 | mapy += map->height; |
304 | mapy += map->height; |
307 | dx = 0; |
305 | dx = 0; |
308 | dy = map->height; |
306 | dy = map->height; |
309 | map = get_map_from_coord (map, &dx, &dy); |
307 | map = map->xy_find (dx, dy); |
310 | break; |
308 | break; |
311 | case '4': |
309 | case '4': |
312 | dx = -1; |
310 | dx = -1; |
313 | dy = 0; |
311 | dy = 0; |
314 | map = get_map_from_coord (map, &dx, &dy); |
312 | map = map->xy_find (dx, dy); |
315 | map && (mapx -= map->width); |
313 | map && (mapx -= map->width); |
316 | break; |
314 | break; |
317 | } |
315 | } |
318 | |
316 | |
319 | --max_distance; |
317 | --max_distance; |
320 | } |
318 | } |
321 | |
319 | |
… | |
… | |
323 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
321 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
324 | else if (map && map->path[0]) |
322 | else if (map && map->path[0]) |
325 | { |
323 | { |
326 | int flags = 0; |
324 | int flags = 0; |
327 | |
325 | |
328 | if (map->tile_path[0]) |
326 | if (map->tile_path[0]) flags |= 1; |
329 | flags |= 1; |
|
|
330 | if (map->tile_path[1]) |
327 | if (map->tile_path[1]) flags |= 2; |
331 | flags |= 2; |
|
|
332 | if (map->tile_path[2]) |
328 | if (map->tile_path[2]) flags |= 4; |
333 | flags |= 4; |
|
|
334 | if (map->tile_path[3]) |
329 | if (map->tile_path[3]) flags |= 8; |
335 | flags |= 8; |
|
|
336 | |
330 | |
337 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path); |
331 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
338 | } |
332 | } |
339 | else |
333 | else |
340 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
334 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
341 | } |
335 | } |
342 | else |
336 | else |
343 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
337 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
344 | |
338 | |
345 | pl->socket->send_packet (bigbuf); |
339 | pl->ns->send_packet (bigbuf); |
346 | } |
340 | } |
347 | |
341 | |
348 | /** This is the Setup cmd - easy first implementation */ |
342 | /** This is the Setup cmd */ |
349 | void |
343 | void |
350 | SetUp (char *buf, int len, client * ns) |
344 | SetUp (char *buf, int len, client * ns) |
351 | { |
345 | { |
352 | int s, slen; |
346 | INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len)); |
353 | char *cmd, *param, cmdback[HUGE_BUF]; |
|
|
354 | |
|
|
355 | /* run through the cmds of setup |
|
|
356 | * syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ... |
|
|
357 | * |
|
|
358 | * we send the status of the cmd back, or a FALSE is the cmd is the server unknown |
|
|
359 | * The client then must sort this out |
|
|
360 | */ |
|
|
361 | |
|
|
362 | //LOG (llevInfo, "Get SetupCmd:: %s\n", buf); |
|
|
363 | |
|
|
364 | strcpy (cmdback, "setup"); |
|
|
365 | for (s = 0; s < len; ) |
|
|
366 | { |
|
|
367 | cmd = &buf[s]; |
|
|
368 | |
|
|
369 | /* find the next space, and put a null there */ |
|
|
370 | for (; buf[s] && buf[s] != ' '; s++) |
|
|
371 | ; |
|
|
372 | |
|
|
373 | buf[s++] = 0; |
|
|
374 | |
|
|
375 | while (buf[s] == ' ') |
|
|
376 | s++; |
|
|
377 | |
|
|
378 | if (s >= len) |
|
|
379 | break; |
|
|
380 | |
|
|
381 | param = &buf[s]; |
|
|
382 | |
|
|
383 | for (; buf[s] && buf[s] != ' '; s++) |
|
|
384 | ; |
|
|
385 | |
|
|
386 | buf[s++] = 0; |
|
|
387 | |
|
|
388 | while (buf[s] == ' ') |
|
|
389 | s++; |
|
|
390 | |
|
|
391 | slen = strlen (cmdback); |
|
|
392 | safe_strcat (cmdback, " ", &slen, HUGE_BUF); |
|
|
393 | safe_strcat (cmdback, cmd, &slen, HUGE_BUF); |
|
|
394 | safe_strcat (cmdback, " ", &slen, HUGE_BUF); |
|
|
395 | |
|
|
396 | if (!strcmp (cmd, "sound")) |
|
|
397 | { |
|
|
398 | ns->sound = atoi (param); |
|
|
399 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
400 | } |
|
|
401 | else if (!strcmp (cmd, "exp64")) |
|
|
402 | { |
|
|
403 | ns->exp64 = atoi (param); |
|
|
404 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
405 | } |
|
|
406 | else if (!strcmp (cmd, "spellmon")) |
|
|
407 | { |
|
|
408 | ns->monitor_spells = atoi (param); |
|
|
409 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
410 | } |
|
|
411 | else if (!strcmp (cmd, "darkness")) |
|
|
412 | { |
|
|
413 | ns->darkness = atoi (param); |
|
|
414 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
415 | } |
|
|
416 | else if (!strcmp (cmd, "map1cmd")) |
|
|
417 | { |
|
|
418 | if (atoi (param)) |
|
|
419 | ns->mapmode = Map1Cmd; |
|
|
420 | /* if beyond this size, need to use map1cmd no matter what */ |
|
|
421 | if (ns->mapx > 11 || ns->mapy > 11) |
|
|
422 | ns->mapmode = Map1Cmd; |
|
|
423 | safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF); |
|
|
424 | } |
|
|
425 | else if (!strcmp (cmd, "map1acmd")) |
|
|
426 | { |
|
|
427 | if (atoi (param)) |
|
|
428 | ns->mapmode = Map1aCmd; |
|
|
429 | /* if beyond this size, need to use map1acmd no matter what */ |
|
|
430 | if (ns->mapx > 11 || ns->mapy > 11) |
|
|
431 | ns->mapmode = Map1aCmd; |
|
|
432 | safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF); |
|
|
433 | } |
|
|
434 | else if (!strcmp (cmd, "newmapcmd")) |
|
|
435 | { |
|
|
436 | ns->newmapcmd = atoi (param); |
|
|
437 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
438 | // } else if (!strcmp(cmd,"plugincmd")) { |
|
|
439 | // ns->plugincmd = atoi(param); |
|
|
440 | // safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
441 | } |
|
|
442 | else if (!strcmp (cmd, "mapinfocmd")) |
|
|
443 | { |
|
|
444 | ns->mapinfocmd = atoi (param); |
|
|
445 | safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
|
|
446 | } |
|
|
447 | else if (!strcmp (cmd, "extcmd")) |
|
|
448 | { |
|
|
449 | ns->extcmd = atoi (param); |
|
|
450 | safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
|
|
451 | } |
|
|
452 | else if (!strcmp (cmd, "extmap")) |
|
|
453 | { |
|
|
454 | ns->extmap = atoi (param); |
|
|
455 | safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
|
|
456 | } |
|
|
457 | else if (!strcmp (cmd, "facecache")) |
|
|
458 | { |
|
|
459 | ns->facecache = atoi (param); |
|
|
460 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
461 | } |
|
|
462 | else if (!strcmp (cmd, "faceset")) |
|
|
463 | { |
|
|
464 | char tmpbuf[20]; |
|
|
465 | int q = atoi (param); |
|
|
466 | |
|
|
467 | if (is_valid_faceset (q)) |
|
|
468 | ns->faceset = q; |
|
|
469 | sprintf (tmpbuf, "%d", ns->faceset); |
|
|
470 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
471 | /* if the client is using faceset, it knows about image2 command */ |
|
|
472 | ns->image2 = 1; |
|
|
473 | } |
|
|
474 | else if (!strcmp (cmd, "itemcmd")) |
|
|
475 | { |
|
|
476 | /* Version of the item protocol command to use. Currently, |
|
|
477 | * only supported versions are 1 and 2. Using a numeric |
|
|
478 | * value will make it very easy to extend this in the future. |
|
|
479 | */ |
|
|
480 | char tmpbuf[20]; |
|
|
481 | int q = atoi (param); |
|
|
482 | |
|
|
483 | if (q < 1 || q > 2) |
|
|
484 | { |
|
|
485 | strcpy (tmpbuf, "FALSE"); |
|
|
486 | } |
|
|
487 | else |
|
|
488 | { |
|
|
489 | ns->itemcmd = q; |
|
|
490 | sprintf (tmpbuf, "%d", ns->itemcmd); |
|
|
491 | } |
|
|
492 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
493 | } |
|
|
494 | else if (!strcmp (cmd, "mapsize")) |
|
|
495 | { |
|
|
496 | int x, y = 0; |
|
|
497 | char tmpbuf[MAX_BUF], *cp; |
|
|
498 | |
|
|
499 | x = atoi (param); |
|
|
500 | for (cp = param; *cp != 0; cp++) |
|
|
501 | if (*cp == 'x' || *cp == 'X') |
|
|
502 | { |
|
|
503 | y = atoi (cp + 1); |
|
|
504 | break; |
|
|
505 | } |
|
|
506 | if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y) |
|
|
507 | { |
|
|
508 | sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y); |
|
|
509 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
510 | } |
|
|
511 | else |
|
|
512 | { |
|
|
513 | ns->mapx = x; |
|
|
514 | ns->mapy = y; |
|
|
515 | /* better to send back what we are really using and not the |
|
|
516 | * param as given to us in case it gets parsed differently. |
|
|
517 | */ |
|
|
518 | sprintf (tmpbuf, "%dx%d", x, y); |
|
|
519 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
520 | /* If beyond this size and still using orig map command, need to |
|
|
521 | * go to map1cmd. |
|
|
522 | */ |
|
|
523 | if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd) |
|
|
524 | ns->mapmode = Map1Cmd; |
|
|
525 | } |
|
|
526 | } |
|
|
527 | else if (!strcmp (cmd, "extendedMapInfos")) |
|
|
528 | { |
|
|
529 | /* Added by tchize |
|
|
530 | * prepare to use the mapextended command |
|
|
531 | */ |
|
|
532 | char tmpbuf[20]; |
|
|
533 | |
|
|
534 | ns->ext_mapinfos = (atoi (param)); |
|
|
535 | sprintf (tmpbuf, "%d", ns->ext_mapinfos); |
|
|
536 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
537 | } |
|
|
538 | else if (!strcmp (cmd, "extendedTextInfos")) |
|
|
539 | { |
|
|
540 | /* Added by tchize |
|
|
541 | * prepare to use the extended text commands |
|
|
542 | * Client toggle this to non zero to get exttext |
|
|
543 | */ |
|
|
544 | char tmpbuf[20]; |
|
|
545 | |
|
|
546 | ns->has_readable_type = (atoi (param)); |
|
|
547 | sprintf (tmpbuf, "%d", ns->has_readable_type); |
|
|
548 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
549 | } |
|
|
550 | else |
|
|
551 | { |
|
|
552 | /* Didn't get a setup command we understood - |
|
|
553 | * report a failure to the client. |
|
|
554 | */ |
|
|
555 | safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF); |
|
|
556 | } |
|
|
557 | } /* for processing all the setup commands */ |
|
|
558 | |
|
|
559 | LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback); |
|
|
560 | ns->send_packet (cmdback); |
|
|
561 | } |
347 | } |
562 | |
348 | |
563 | /** |
349 | /** |
564 | * The client has requested to be added to the game. |
350 | * The client has requested to be added to the game. |
565 | * This is what takes care of it. We tell the client how things worked out. |
351 | * This is what takes care of it. We tell the client how things worked out. |
566 | * I am not sure if this file is the best place for this function. however, |
352 | * I am not sure if this file is the best place for this function. however, |
567 | * it either has to be here or init_sockets needs to be exported. |
353 | * it either has to be here or init_sockets needs to be exported. |
568 | */ |
354 | */ |
569 | void |
355 | void |
570 | AddMeCmd (char *buf, int len, client * ns) |
356 | AddMeCmd (char *buf, int len, client *ns) |
571 | { |
357 | { |
572 | if (ns->status != Ns_Add || add_player (ns)) |
358 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
573 | ns->send_packet ("addme_failed"); |
|
|
574 | else |
|
|
575 | ns->send_packet ("addme_success"); |
|
|
576 | } |
359 | } |
577 | |
360 | |
578 | /** Reply to ExtendedInfos command */ |
361 | /** Reply to ExtendedInfos command */ |
579 | void |
362 | void |
580 | ToggleExtendedInfos (char *buf, int len, client * ns) |
363 | ToggleExtendedInfos (char *buf, int len, client * ns) |
… | |
… | |
690 | |
473 | |
691 | ns->send_packet (cmdback); |
474 | ns->send_packet (cmdback); |
692 | } |
475 | } |
693 | |
476 | |
694 | /** |
477 | /** |
695 | * A lot like the old AskSmooth (in fact, now called by AskSmooth). |
478 | * client requested an image. send it rate-limited |
696 | * Basically, it makes no sense to wait for the client to request a |
479 | * before flushing. |
697 | * a piece of data from us that we know the client wants. So |
|
|
698 | * if we know the client wants it, might as well push it to the |
|
|
699 | * client. |
|
|
700 | */ |
|
|
701 | static void |
|
|
702 | SendSmooth (client *ns, uint16 face) |
|
|
703 | { |
|
|
704 | uint16 smoothface; |
|
|
705 | |
|
|
706 | /* If we can't find a face, return and set it so we won't try to send this |
|
|
707 | * again. |
|
|
708 | */ |
480 | */ |
709 | if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface))) |
481 | void |
710 | { |
482 | AskFaceCmd (char *buf, int len, client *ns) |
711 | |
483 | { |
712 | LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name); |
484 | ns->askface.push_back (atoi (buf)); |
713 | ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
|
|
714 | return; |
|
|
715 | } |
|
|
716 | |
|
|
717 | if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) |
|
|
718 | esrv_send_face (ns, smoothface, 0); |
|
|
719 | |
|
|
720 | ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
|
|
721 | |
|
|
722 | packet sl; |
|
|
723 | |
|
|
724 | sl << "smooth " |
|
|
725 | << uint16 (face) |
|
|
726 | << uint16 (smoothface); |
|
|
727 | |
|
|
728 | ns->send_packet (sl); |
|
|
729 | } |
485 | } |
730 | |
486 | |
731 | /** |
487 | /** |
732 | * Tells client the picture it has to use |
488 | * Tells client the picture it has to use |
733 | * to smooth a picture number given as argument. |
489 | * to smooth a picture number given as argument. |
734 | */ |
490 | */ |
735 | void |
491 | void |
736 | AskSmooth (char *buf, int len, client *ns) |
492 | AskSmooth (char *buf, int len, client *ns) |
737 | { |
493 | { |
738 | SendSmooth (ns, atoi (buf)); |
494 | ns->send_face (atoi (buf)); |
|
|
495 | ns->flush_fx (); |
739 | } |
496 | } |
740 | |
497 | |
741 | /** |
498 | /** |
742 | * This handles the general commands from the client (ie, north, fire, cast, |
499 | * This handles the general commands from the client (ie, north, fire, cast, |
743 | * etc.) |
500 | * etc.) |
… | |
… | |
802 | * commands. |
559 | * commands. |
803 | */ |
560 | */ |
804 | pl->count = 0; |
561 | pl->count = 0; |
805 | |
562 | |
806 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
563 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
807 | int time = FABS (pl->ob->speed) < 0.001 |
564 | int time = fabs (pl->ob->speed) < 0.001 |
808 | ? time = MAX_TIME * 100 |
565 | ? time = MAX_TIME * 100 |
809 | : time = (int) (MAX_TIME / FABS (pl->ob->speed)); |
566 | : time = (int) (MAX_TIME / fabs (pl->ob->speed)); |
810 | |
567 | |
811 | /* Send confirmation of command execution now */ |
568 | /* Send confirmation of command execution now */ |
812 | packet sl; |
569 | packet sl ("comc"); |
813 | sl << "comc " << uint16 (cmdid) << uint32 (time); |
570 | sl << uint16 (cmdid) << uint32 (time); |
814 | pl->socket->send_packet (sl); |
571 | pl->ns->send_packet (sl); |
815 | } |
572 | } |
816 | |
|
|
817 | |
573 | |
818 | /** This is a reply to a previous query. */ |
574 | /** This is a reply to a previous query. */ |
819 | void |
575 | void |
820 | ReplyCmd (char *buf, int len, player *pl) |
576 | ReplyCmd (char *buf, int len, client *ns) |
821 | { |
577 | { |
|
|
578 | if (ns->state == ST_CUSTOM) |
|
|
579 | { |
|
|
580 | INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len)); |
|
|
581 | return; |
|
|
582 | } |
|
|
583 | |
|
|
584 | if (!ns->pl) |
|
|
585 | return; //TODO: depends on the exact reply we are after |
|
|
586 | //TODO: but right now, we always have a ns->pl |
|
|
587 | |
|
|
588 | player *pl = ns->pl; |
|
|
589 | |
822 | /* This is to synthesize how the data would be stored if it |
590 | /* This is to synthesize how the data would be stored if it |
823 | * was normally entered. A bit of a hack, and should be cleaned up |
591 | * was normally entered. A bit of a hack, and should be cleaned up |
824 | * once all the X11 code is removed from the server. |
592 | * once all the X11 code is removed from the server. |
825 | * |
593 | * |
826 | * We pass 13 to many of the functions because this way they |
594 | * We pass 13 to many of the functions because this way they |
… | |
… | |
829 | */ |
597 | */ |
830 | snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
598 | snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
831 | |
599 | |
832 | /* this avoids any hacking here */ |
600 | /* this avoids any hacking here */ |
833 | |
601 | |
834 | switch (pl->state) |
602 | switch (ns->state) |
835 | { |
603 | { |
836 | case ST_PLAYING: |
604 | case ST_PLAYING: |
837 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
605 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
838 | break; |
606 | break; |
839 | |
607 | |
840 | case ST_PLAY_AGAIN: |
|
|
841 | /* We can check this for return value (2==quit). Maybe we |
|
|
842 | * should, and do something appropriate? |
|
|
843 | */ |
|
|
844 | receive_play_again (pl->ob, buf[0]); |
|
|
845 | break; |
|
|
846 | |
|
|
847 | case ST_ROLL_STAT: |
|
|
848 | key_roll_stat (pl->ob, buf[0]); |
|
|
849 | break; |
|
|
850 | |
|
|
851 | case ST_CHANGE_CLASS: |
|
|
852 | |
|
|
853 | key_change_class (pl->ob, buf[0]); |
|
|
854 | break; |
|
|
855 | |
|
|
856 | case ST_CONFIRM_QUIT: |
|
|
857 | key_confirm_quit (pl->ob, buf[0]); |
|
|
858 | break; |
|
|
859 | |
|
|
860 | case ST_CONFIGURE: |
|
|
861 | LOG (llevError, "In client input handling, but into configure state\n"); |
|
|
862 | pl->state = ST_PLAYING; |
|
|
863 | break; |
|
|
864 | |
|
|
865 | case ST_GET_NAME: |
|
|
866 | receive_player_name (pl->ob, 13); |
|
|
867 | break; |
|
|
868 | |
|
|
869 | case ST_GET_PASSWORD: |
|
|
870 | case ST_CONFIRM_PASSWORD: |
|
|
871 | receive_player_password (pl->ob, 13); |
|
|
872 | break; |
|
|
873 | |
|
|
874 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
608 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
875 | receive_party_password (pl->ob, 13); |
609 | receive_party_password (pl->ob, 13); |
876 | break; |
610 | break; |
877 | |
611 | |
878 | default: |
612 | default: |
879 | LOG (llevError, "Unknown input state: %d\n", pl->state); |
613 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
880 | } |
614 | } |
881 | } |
615 | } |
882 | |
616 | |
883 | /** |
617 | /** |
884 | * Client tells its version. If there is a mismatch, we close the |
618 | * Client tells its version. If there is a mismatch, we close the |
… | |
… | |
899 | ns->cs_version = atoi (buf); |
633 | ns->cs_version = atoi (buf); |
900 | ns->sc_version = ns->cs_version; |
634 | ns->sc_version = ns->cs_version; |
901 | |
635 | |
902 | LOG (llevDebug, "connection from client <%s>\n", buf); |
636 | LOG (llevDebug, "connection from client <%s>\n", buf); |
903 | |
637 | |
904 | |
|
|
905 | //TODO: should log here just for statistics |
638 | //TODO: should log here just for statistics |
906 | |
639 | |
907 | //if (VERSION_CS != ns->cs_version) |
640 | //if (VERSION_CS != ns->cs_version) |
908 | // unchecked; |
641 | // unchecked; |
909 | |
642 | |
… | |
… | |
918 | |
651 | |
919 | cp = strchr (cp + 1, ' '); |
652 | cp = strchr (cp + 1, ' '); |
920 | |
653 | |
921 | if (cp) |
654 | if (cp) |
922 | { |
655 | { |
923 | assign (ns->version, cp + 1); |
656 | ns->version = cp + 1; |
924 | |
657 | |
925 | if (ns->sc_version < 1026) |
658 | if (ns->sc_version < 1026) |
926 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
659 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
927 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
660 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
928 | } |
661 | } |
… | |
… | |
934 | { |
667 | { |
935 | ns->sound = atoi (buf); |
668 | ns->sound = atoi (buf); |
936 | } |
669 | } |
937 | |
670 | |
938 | /** client wants the map resent */ |
671 | /** client wants the map resent */ |
939 | |
|
|
940 | void |
672 | void |
941 | MapRedrawCmd (char *buf, int len, player *pl) |
673 | MapRedrawCmd (char *buf, int len, player *pl) |
942 | { |
674 | { |
943 | /* This function is currently disabled; just clearing the map state results in |
675 | /* This function is currently disabled; just clearing the map state results in |
944 | * display errors. It should clear the cache and send a newmap command. |
676 | * display errors. It should clear the cache and send a newmap command. |
… | |
… | |
989 | /** |
721 | /** |
990 | * Asks the client to query the user. This way, the client knows |
722 | * Asks the client to query the user. This way, the client knows |
991 | * it needs to send something back (vs just printing out a message) |
723 | * it needs to send something back (vs just printing out a message) |
992 | */ |
724 | */ |
993 | void |
725 | void |
994 | send_query (client *ns, uint8 flags, char *text) |
726 | send_query (client *ns, uint8 flags, const char *text) |
995 | { |
727 | { |
996 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
728 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
|
|
729 | } |
|
|
730 | |
|
|
731 | /** |
|
|
732 | * Get player's current range attack in obuf. |
|
|
733 | */ |
|
|
734 | static void |
|
|
735 | rangetostring (player *pl, char *obuf) |
|
|
736 | { |
|
|
737 | dynbuf_text buf; |
|
|
738 | |
|
|
739 | if (pl->ranged_ob) |
|
|
740 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
|
|
741 | |
|
|
742 | if (pl->combat_ob) |
|
|
743 | buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
|
|
744 | |
|
|
745 | //TODO: maybe golem should become the current_weapon, quite simply? |
|
|
746 | if (pl->golem) |
|
|
747 | buf << " Golem*: " << pl->golem->name; |
|
|
748 | |
|
|
749 | buf.linearise (obuf); |
|
|
750 | obuf [buf.size ()] = 0; |
997 | } |
751 | } |
998 | |
752 | |
999 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
753 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
1000 | Old = New; \ |
754 | Old = New; \ |
1001 | sl << uint8 (Type) << uint64 (New); \ |
755 | sl << uint8 (Type) << uint64 (New); \ |
… | |
… | |
1031 | esrv_update_stats (player *pl) |
785 | esrv_update_stats (player *pl) |
1032 | { |
786 | { |
1033 | char buf[MAX_BUF]; |
787 | char buf[MAX_BUF]; |
1034 | uint16 flags; |
788 | uint16 flags; |
1035 | |
789 | |
1036 | packet sl; |
790 | client *ns = pl->ns; |
1037 | sl << "stats "; |
791 | if (!ns) |
|
|
792 | return; |
1038 | |
793 | |
|
|
794 | object *ob = pl->ob; |
1039 | if (pl->ob) |
795 | if (!ob) |
1040 | { |
796 | return; |
|
|
797 | |
|
|
798 | packet sl ("stats"); |
|
|
799 | |
1041 | AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); |
800 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
1042 | AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); |
801 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
1043 | AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); |
802 | AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP); |
1044 | AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); |
803 | AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP); |
1045 | AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); |
804 | AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE); |
1046 | AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); |
805 | AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE); |
1047 | AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); |
806 | AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR); |
1048 | AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT); |
|
|
1049 | AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW); |
|
|
1050 | AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS); |
|
|
1051 | AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); |
807 | AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX); |
1052 | AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); |
808 | AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON); |
|
|
809 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
|
|
810 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
|
|
811 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
1053 | AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); |
812 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
1054 | } |
|
|
1055 | |
813 | |
1056 | if (pl->socket->exp64) |
|
|
1057 | for (int s = 0; s < NUM_SKILLS; s++) |
814 | for (int s = 0; s < NUM_SKILLS; s++) |
1058 | if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) |
815 | if (object *skill = pl->last_skill_ob[s]) |
|
|
816 | if (skill->stats.exp != ns->last_skill_exp [s]) |
1059 | { |
817 | { |
|
|
818 | ns->last_skill_exp [s] = skill->stats.exp; |
|
|
819 | |
1060 | /* Always send along the level if exp changes. This is only |
820 | /* Always send along the level if exp changes. This is only |
1061 | * 1 extra byte, but keeps processing simpler. |
821 | * 1 extra byte, but keeps processing simpler. |
1062 | */ |
822 | */ |
1063 | sl << uint8 (s + CS_STAT_SKILLINFO) |
823 | sl << uint8 (s + CS_STAT_SKILLINFO) |
1064 | << uint8 (pl->last_skill_ob[s]->level) |
824 | << uint8 (skill->level) |
1065 | << uint64 (pl->last_skill_ob[s]->stats.exp); |
825 | << uint64 (skill->stats.exp); |
1066 | |
|
|
1067 | pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; |
|
|
1068 | } |
826 | } |
1069 | |
827 | |
1070 | if (pl->socket->exp64) |
|
|
1071 | { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } |
828 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
1072 | else |
|
|
1073 | { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } |
|
|
1074 | |
|
|
1075 | AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); |
829 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
1076 | AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); |
830 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
1077 | AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); |
831 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
1078 | AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); |
832 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
1079 | AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); |
833 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); |
1080 | AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); |
834 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
1081 | AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
835 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
1082 | AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); |
836 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
|
|
837 | |
1083 | flags = 0; |
838 | flags = 0; |
1084 | |
839 | |
1085 | if (pl->fire_on) |
840 | if (pl->fire_on) |
1086 | flags |= SF_FIREON; |
841 | flags |= SF_FIREON; |
1087 | |
842 | |
1088 | if (pl->run_on) |
843 | if (pl->run_on) |
1089 | flags |= SF_RUNON; |
844 | flags |= SF_RUNON; |
1090 | |
845 | |
1091 | AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); |
846 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
1092 | |
847 | |
1093 | if (pl->socket->sc_version < 1025) |
848 | if (ns->sc_version < 1025) |
1094 | { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
849 | { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
1095 | else |
850 | else |
1096 | for (int i = 0; i < NROFATTACKS; i++) |
851 | for (int i = 0; i < NROFATTACKS; i++) |
1097 | { |
852 | { |
1098 | /* Skip ones we won't send */ |
853 | /* Skip ones we won't send */ |
1099 | if (atnr_cs_stat[i] == -1) |
854 | if (atnr_cs_stat[i] == -1) |
1100 | continue; |
855 | continue; |
1101 | |
856 | |
1102 | AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); |
857 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
1103 | } |
858 | } |
1104 | |
859 | |
1105 | if (pl->socket->monitor_spells) |
860 | if (pl->ns->monitor_spells) |
1106 | { |
861 | { |
1107 | AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
862 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1108 | AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); |
863 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
1109 | AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); |
864 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
1110 | } |
865 | } |
1111 | |
866 | |
1112 | rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ |
867 | rangetostring (pl, buf); /* we want use the new fire & run system in new client */ |
1113 | AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); |
868 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
1114 | set_title (pl->ob, buf); |
869 | set_title (ob, buf); |
1115 | AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); |
870 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
1116 | |
871 | |
1117 | /* Only send it away if we have some actual data */ |
872 | /* Only send it away if we have some actual data */ |
1118 | if (sl.length () > 6) |
873 | if (sl.length () > 6) |
1119 | pl->socket->send_packet (sl); |
874 | ns->send_packet (sl); |
1120 | } |
875 | } |
1121 | |
876 | |
1122 | /** |
877 | /** |
1123 | * Tells the client that here is a player it should start using. |
878 | * Tells the client that here is a player it should start using. |
1124 | */ |
879 | */ |
1125 | void |
880 | void |
1126 | esrv_new_player (player *pl, uint32 weight) |
881 | esrv_new_player (player *pl, uint32 weight) |
1127 | { |
882 | { |
1128 | pl->last_weight = weight; |
883 | packet sl ("player"); |
1129 | |
|
|
1130 | packet sl; |
|
|
1131 | sl << "player "; |
|
|
1132 | |
884 | |
1133 | sl << uint32 (pl->ob->count) |
885 | sl << uint32 (pl->ob->count) |
1134 | << uint32 (weight) |
886 | << uint32 (weight) |
1135 | << uint32 (pl->ob->face->number) |
887 | << uint32 (pl->ob->face) |
1136 | << data8 (pl->ob->name); |
888 | << data8 (pl->ob->name); |
1137 | |
889 | |
|
|
890 | pl->ns->last_weight = weight; |
1138 | pl->socket->send_packet (sl); |
891 | pl->ns->send_packet (sl); |
1139 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
892 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
1140 | } |
893 | } |
1141 | |
|
|
1142 | /** |
|
|
1143 | * Need to send an animation sequence to the client. |
|
|
1144 | * We will send appropriate face commands to the client if we haven't |
|
|
1145 | * sent them the face yet (this can become quite costly in terms of |
|
|
1146 | * how much we are sending - on the other hand, this should only happen |
|
|
1147 | * when the player logs in and picks stuff up. |
|
|
1148 | */ |
|
|
1149 | void |
|
|
1150 | esrv_send_animation (client * ns, short anim_num) |
|
|
1151 | { |
|
|
1152 | /* Do some checking on the anim_num we got. Note that the animations |
|
|
1153 | * are added in contigous order, so if the number is in the valid |
|
|
1154 | * range, it must be a valid animation. |
|
|
1155 | */ |
|
|
1156 | if (anim_num < 0 || anim_num > num_animations) |
|
|
1157 | { |
|
|
1158 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
|
|
1159 | return; |
|
|
1160 | } |
|
|
1161 | |
|
|
1162 | packet sl; |
|
|
1163 | |
|
|
1164 | sl << "anim " |
|
|
1165 | << uint16 (anim_num) |
|
|
1166 | << uint16 (0); /* flags - not used right now */ |
|
|
1167 | |
|
|
1168 | /* Build up the list of faces. Also, send any information (ie, the |
|
|
1169 | * the face itself) down to the client. |
|
|
1170 | */ |
|
|
1171 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
|
|
1172 | { |
|
|
1173 | if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) |
|
|
1174 | esrv_send_face (ns, animations[anim_num].faces[i], 0); |
|
|
1175 | |
|
|
1176 | sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
|
|
1177 | } |
|
|
1178 | |
|
|
1179 | ns->send_packet (sl); |
|
|
1180 | |
|
|
1181 | ns->anims_sent[anim_num] = 1; |
|
|
1182 | } |
|
|
1183 | |
|
|
1184 | |
894 | |
1185 | /****************************************************************************** |
895 | /****************************************************************************** |
1186 | * |
896 | * |
1187 | * Start of map related commands. |
897 | * Start of map related commands. |
1188 | * |
898 | * |
1189 | ******************************************************************************/ |
899 | ******************************************************************************/ |
1190 | |
900 | |
1191 | /** |
|
|
1192 | * This adds face_num to a map cell at x,y. If the client doesn't have |
|
|
1193 | * the face yet, we will also send it. |
|
|
1194 | */ |
|
|
1195 | static void |
|
|
1196 | esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap) |
|
|
1197 | { |
|
|
1198 | if (newmap->cells[x][y].count >= MAP_LAYERS) |
|
|
1199 | { |
|
|
1200 | //TODO: one or the other, can't both have abort and return, verify and act |
|
|
1201 | LOG (llevError, "Too many faces in map cell %d %d\n", x, y); |
|
|
1202 | return; |
|
|
1203 | abort (); |
|
|
1204 | } |
|
|
1205 | |
|
|
1206 | newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; |
|
|
1207 | newmap->cells[x][y].count++; |
|
|
1208 | |
|
|
1209 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
|
|
1210 | esrv_send_face (ns, face_num, 0); |
|
|
1211 | } |
|
|
1212 | |
|
|
1213 | /** Clears a map cell */ |
901 | /** Clears a map cell */ |
1214 | static void |
902 | static void |
1215 | map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) |
903 | map_clearcell (struct MapCell *cell, int count) |
1216 | { |
904 | { |
1217 | cell->faces[0] = face0; |
905 | cell->faces[0] = 0; |
1218 | cell->faces[1] = face1; |
906 | cell->faces[1] = 0; |
1219 | cell->faces[2] = face2; |
907 | cell->faces[2] = 0; |
|
|
908 | cell->smooth[0] = 0; |
|
|
909 | cell->smooth[1] = 0; |
|
|
910 | cell->smooth[2] = 0; |
1220 | cell->count = count; |
911 | cell->count = count; |
1221 | cell->stat_hp = 0; |
912 | cell->stat_hp = 0; |
1222 | cell->flags = 0; |
913 | cell->flags = 0; |
1223 | cell->player = 0; |
914 | cell->player = 0; |
1224 | } |
915 | } |
1225 | |
916 | |
1226 | #define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y) |
|
|
1227 | #define MAX_LAYERS 3 |
917 | #define MAX_LAYERS 3 |
1228 | |
|
|
1229 | /* Using a global really isn't a good approach, but saves the over head of |
|
|
1230 | * allocating and deallocating such a block of data each time run through, |
|
|
1231 | * and saves the space of allocating this in the socket object when we only |
|
|
1232 | * need it for this cycle. If the server is ever threaded, this needs to be |
|
|
1233 | * re-examined. |
|
|
1234 | */ |
|
|
1235 | static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; |
|
|
1236 | |
|
|
1237 | /** |
|
|
1238 | * Returns true if any of the heads for this |
|
|
1239 | * space is set. Returns false if all are blank - this is used |
|
|
1240 | * for empty space checking. |
|
|
1241 | */ |
|
|
1242 | static inline int |
|
|
1243 | have_head (int ax, int ay) |
|
|
1244 | { |
|
|
1245 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || |
|
|
1246 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) |
|
|
1247 | return 1; |
|
|
1248 | |
|
|
1249 | return 0; |
|
|
1250 | } |
|
|
1251 | |
|
|
1252 | /** |
|
|
1253 | * check_head is a bit simplistic version of update_space below. |
|
|
1254 | * basically, it only checks the that the head on space ax,ay at layer |
|
|
1255 | * needs to get sent - if so, it adds the data, sending the head |
|
|
1256 | * if needed, and returning 1. If this no data needs to get |
|
|
1257 | * sent, it returns zero. |
|
|
1258 | */ |
|
|
1259 | static int |
|
|
1260 | check_head (packet &sl, client &ns, int ax, int ay, int layer) |
|
|
1261 | { |
|
|
1262 | short face_num; |
|
|
1263 | |
|
|
1264 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) |
|
|
1265 | face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; |
|
|
1266 | else |
|
|
1267 | face_num = 0; |
|
|
1268 | |
|
|
1269 | if (face_num != ns.lastmap.cells[ax][ay].faces[layer]) |
|
|
1270 | { |
|
|
1271 | sl << uint16 (face_num); |
|
|
1272 | if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE)) |
|
|
1273 | esrv_send_face (&ns, face_num, 0); |
|
|
1274 | |
|
|
1275 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL; |
|
|
1276 | ns.lastmap.cells[ax][ay].faces[layer] = face_num; |
|
|
1277 | return 1; |
|
|
1278 | } |
|
|
1279 | |
|
|
1280 | return 0; /* No change */ |
|
|
1281 | } |
|
|
1282 | |
918 | |
1283 | /** |
919 | /** |
1284 | * Removes the need to replicate the same code for each layer. |
920 | * Removes the need to replicate the same code for each layer. |
1285 | * this returns true if this space is now in fact different than |
921 | * this returns true if this space is now in fact different than |
1286 | * it was. |
922 | * it was. |
1287 | * sl is the socklist this data is going into. |
923 | * sl is the socklist this data is going into. |
1288 | * ns is the socket we are working on - all the info we care |
924 | * ns is the socket we are working on - all the info we care |
1289 | * about is in this socket structure, so now need not pass the |
925 | * about is in this socket structure, so now need not pass the |
1290 | * entire player object. |
926 | * entire player object. |
1291 | * mx and my are map coordinate offsets for map mp |
|
|
1292 | * sx and sy are the offsets into the socket structure that |
|
|
1293 | * holds the old values. |
|
|
1294 | * layer is the layer to update, with 2 being the floor and 0 the |
927 | * layer is the layer to update, with 2 being the floor and 0 the |
1295 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
928 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
1296 | * take. Interesting to note that before this function, the map1 function |
929 | * take. Interesting to note that before this function, the map1 function |
1297 | * numbers the spaces differently - I think this was a leftover from |
930 | * numbers the spaces differently - I think this was a leftover from |
1298 | * the map command, where the faces stack up. Sinces that is no longer |
931 | * the map command, where the faces stack up. Sinces that is no longer |
1299 | * the case, it seems to make more sense to have these layer values |
932 | * the case, it seems to make more sense to have these layer values |
1300 | * actually match. |
933 | * actually match. |
1301 | */ |
934 | */ |
1302 | static int |
935 | static int |
1303 | update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
936 | update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer) |
1304 | { |
937 | { |
1305 | object *ob, *head; |
938 | object *ob = ms.faces_obj [layer]; |
1306 | uint16 face_num; |
|
|
1307 | int bx, by, i; |
|
|
1308 | |
|
|
1309 | /* If there is a multipart object stored away, treat that as more important. |
|
|
1310 | * If not, then do the normal processing. |
|
|
1311 | */ |
|
|
1312 | head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer]; |
|
|
1313 | |
|
|
1314 | /* Check to see if this head is part of the set of objects |
|
|
1315 | * we would normally send for this space. If so, then |
|
|
1316 | * don't use the head value. We need to do the check |
|
|
1317 | * here and not when setting up the heads[] value for two reasons - |
|
|
1318 | * 1) the heads[] values will get used even if the space is not visible. |
|
|
1319 | * 2) its possible the head is not on the same map as a part, and I'd |
|
|
1320 | * rather not need to do the map translation overhead. |
|
|
1321 | * 3) We need to do some extra checking to make sure that we will |
|
|
1322 | * otherwise send the image as this layer, eg, either it matches |
|
|
1323 | * the head value, or is not multipart. |
|
|
1324 | */ |
|
|
1325 | if (head && !head->more) |
|
|
1326 | { |
|
|
1327 | for (i = 0; i < MAP_LAYERS; i++) |
|
|
1328 | { |
|
|
1329 | ob = GET_MAP_FACE_OBJ (mp, mx, my, i); |
|
|
1330 | if (!ob) |
|
|
1331 | continue; |
|
|
1332 | |
|
|
1333 | if (ob->head) |
|
|
1334 | ob = ob->head; |
|
|
1335 | |
|
|
1336 | if (ob == head) |
|
|
1337 | { |
|
|
1338 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL; |
|
|
1339 | head = NULL; |
|
|
1340 | break; |
|
|
1341 | } |
|
|
1342 | } |
|
|
1343 | } |
|
|
1344 | |
|
|
1345 | ob = head; |
|
|
1346 | if (!ob) |
|
|
1347 | ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); |
|
|
1348 | |
939 | |
1349 | /* If there is no object for this space, or if the face for the object |
940 | /* If there is no object for this space, or if the face for the object |
1350 | * is the blank face, set the face number to zero. |
941 | * is the blank face, set the face number to zero. |
1351 | * else if we have the stored head object for this space, that takes |
942 | * else if we have the stored head object for this space, that takes |
1352 | * precedence over the other object for this space. |
943 | * precedence over the other object for this space. |
1353 | * otherwise, we do special head processing |
944 | * otherwise, we do special head processing |
1354 | */ |
945 | */ |
1355 | if (!ob || ob->face == blank_face) |
946 | uint16 face_num = ob && ob->face != blank_face ? ob->face : 0; |
1356 | face_num = 0; |
|
|
1357 | else if (head) |
|
|
1358 | { |
|
|
1359 | /* if this is a head that had previously been stored */ |
|
|
1360 | face_num = ob->face->number; |
|
|
1361 | } |
|
|
1362 | else |
|
|
1363 | { |
|
|
1364 | /* if the faces for the different parts of a multipart object |
|
|
1365 | * are the same, we only want to send the bottom right most |
|
|
1366 | * portion of the object. That info is in the tail_.. values |
|
|
1367 | * of the head. Note that for the head itself, ob->head will |
|
|
1368 | * be null, so we only do this block if we are working on |
|
|
1369 | * a tail piece. |
|
|
1370 | */ |
|
|
1371 | |
|
|
1372 | /* tail_x and tail_y will only be set in the head object. If |
|
|
1373 | * this is the head object and these are set, we proceed |
|
|
1374 | * with logic to only send bottom right. Similarly, if |
|
|
1375 | * this is one of the more parts but the head has those values |
|
|
1376 | * set, we want to do the processing. There can be cases where |
|
|
1377 | * the head is not visible but one of its parts is, so we just |
|
|
1378 | * can always expect that ob->arch->tail_x will be true for all |
|
|
1379 | * object we may want to display. |
|
|
1380 | */ |
|
|
1381 | if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y))) |
|
|
1382 | { |
|
|
1383 | |
|
|
1384 | if (ob->head) |
|
|
1385 | head = ob->head; |
|
|
1386 | else |
|
|
1387 | head = ob; |
|
|
1388 | |
|
|
1389 | /* Basically figure out where the offset is from where we are right |
|
|
1390 | * now. the ob->arch->clone.{x,y} values hold the offset that this current |
|
|
1391 | * piece is from the head, and the tail is where the tail is from the |
|
|
1392 | * head. Note that bx and by will equal sx and sy if we are already working |
|
|
1393 | * on the bottom right corner. If ob is the head, the clone values |
|
|
1394 | * will be zero, so the right thing will still happen. |
|
|
1395 | */ |
|
|
1396 | bx = sx + head->arch->tail_x - ob->arch->clone.x; |
|
|
1397 | by = sy + head->arch->tail_y - ob->arch->clone.y; |
|
|
1398 | |
|
|
1399 | /* I don't think this can ever happen, but better to check for it just |
|
|
1400 | * in case. |
|
|
1401 | */ |
|
|
1402 | if (bx < sx || by < sy) |
|
|
1403 | { |
|
|
1404 | LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy); |
|
|
1405 | face_num = 0; |
|
|
1406 | } |
|
|
1407 | /* single part object, multipart object with non merged faces, |
|
|
1408 | * of multipart object already at lower right. |
|
|
1409 | */ |
|
|
1410 | else if (bx == sx && by == sy) |
|
|
1411 | { |
|
|
1412 | face_num = ob->face->number; |
|
|
1413 | |
|
|
1414 | /* if this face matches one stored away, clear that one away. |
|
|
1415 | * this code relies on the fact that the map1 commands |
|
|
1416 | * goes from 2 down to 0. |
|
|
1417 | */ |
|
|
1418 | for (i = 0; i < MAP_LAYERS; i++) |
|
|
1419 | if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] && |
|
|
1420 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num) |
|
|
1421 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL; |
|
|
1422 | } |
|
|
1423 | else |
|
|
1424 | { |
|
|
1425 | /* If this head is stored away, clear it - otherwise, |
|
|
1426 | * there can be cases where a object is on multiple layers - |
|
|
1427 | * we only want to send it once. |
|
|
1428 | */ |
|
|
1429 | face_num = head->face->number; |
|
|
1430 | for (i = 0; i < MAP_LAYERS; i++) |
|
|
1431 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] && |
|
|
1432 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num) |
|
|
1433 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL; |
|
|
1434 | |
|
|
1435 | /* First, try to put the new head on the same layer. If that is used up, |
|
|
1436 | * then find another layer. |
|
|
1437 | */ |
|
|
1438 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL) |
|
|
1439 | { |
|
|
1440 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head; |
|
|
1441 | } |
|
|
1442 | else |
|
|
1443 | for (i = 0; i < MAX_LAYERS; i++) |
|
|
1444 | { |
|
|
1445 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL || |
|
|
1446 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head) |
|
|
1447 | { |
|
|
1448 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head; |
|
|
1449 | } |
|
|
1450 | } |
|
|
1451 | face_num = 0; /* Don't send this object - we'll send the head later */ |
|
|
1452 | } |
|
|
1453 | } |
|
|
1454 | else |
|
|
1455 | { |
|
|
1456 | /* In this case, we are already at the lower right or single part object, |
|
|
1457 | * so nothing special |
|
|
1458 | */ |
|
|
1459 | face_num = ob->face->number; |
|
|
1460 | |
|
|
1461 | /* clear out any head entries that have the same face as this one */ |
|
|
1462 | for (bx = 0; bx < layer; bx++) |
|
|
1463 | if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] && |
|
|
1464 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num) |
|
|
1465 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL; |
|
|
1466 | } |
|
|
1467 | } /* else not already head object or blank face */ |
|
|
1468 | |
|
|
1469 | /* This is a real hack. Basically, if we have nothing to send for this layer, |
|
|
1470 | * but there is a head on the next layer, send that instead. |
|
|
1471 | * Without this, what happens is you can get the case where the player stands |
|
|
1472 | * on the same space as the head. However, if you have overlapping big objects |
|
|
1473 | * of the same type, what happens then is it doesn't think it needs to send |
|
|
1474 | * This tends to make stacking also work/look better. |
|
|
1475 | */ |
|
|
1476 | if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]) |
|
|
1477 | { |
|
|
1478 | face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number; |
|
|
1479 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL; |
|
|
1480 | } |
|
|
1481 | |
|
|
1482 | /* Another hack - because of heads and whatnot, this face may match one |
|
|
1483 | * we already sent for a lower layer. In that case, don't send |
|
|
1484 | * this one. |
|
|
1485 | */ |
|
|
1486 | if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num) |
|
|
1487 | face_num = 0; |
|
|
1488 | |
947 | |
1489 | /* We've gotten what face we want to use for the object. Now see if |
948 | /* We've gotten what face we want to use for the object. Now see if |
1490 | * if it has changed since we last sent it to the client. |
949 | * if it has changed since we last sent it to the client. |
1491 | */ |
950 | */ |
1492 | if (ns.lastmap.cells[sx][sy].faces[layer] != face_num) |
951 | if (lastcell.faces[layer] != face_num) |
1493 | { |
952 | { |
1494 | ns.lastmap.cells[sx][sy].faces[layer] = face_num; |
953 | lastcell.faces[layer] = face_num; |
|
|
954 | |
1495 | if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE)) |
955 | if (!ns.faces_sent[face_num]) |
|
|
956 | if (ob) |
|
|
957 | ns.send_faces (ob); |
|
|
958 | else |
1496 | esrv_send_face (&ns, face_num, 0); |
959 | ns.send_face (face_num); |
1497 | |
960 | |
1498 | sl << uint16 (face_num); |
961 | sl << uint16 (face_num); |
1499 | return 1; |
|
|
1500 | } |
|
|
1501 | |
|
|
1502 | /* Nothing changed */ |
|
|
1503 | return 0; |
|
|
1504 | } |
|
|
1505 | |
|
|
1506 | /** |
|
|
1507 | * This function is mainly a copy of update_space, |
|
|
1508 | * except it handles update of the smoothing updates, |
|
|
1509 | * not the face updates. |
|
|
1510 | * Removes the need to replicate the same code for each layer. |
|
|
1511 | * this returns true if this smooth is now in fact different |
|
|
1512 | * than it was. |
|
|
1513 | * sl is the socklist this data is going into. |
|
|
1514 | * ns is the socket we are working on - all the info we care |
|
|
1515 | * about is in this socket structure, so know need to pass the |
|
|
1516 | * entire player object. |
|
|
1517 | * mx and my are map coordinate offsets for map mp |
|
|
1518 | * sx and sy are the offsets into the socket structure that |
|
|
1519 | * holds the old values. |
|
|
1520 | * layer is the layer to update, with 2 being the floor and 0 the |
|
|
1521 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ |
|
|
1522 | * take. |
|
|
1523 | */ |
|
|
1524 | |
|
|
1525 | static inline int |
|
|
1526 | update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
|
|
1527 | { |
|
|
1528 | object *ob; |
|
|
1529 | int smoothlevel; /* old face_num; */ |
|
|
1530 | |
|
|
1531 | ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); |
|
|
1532 | |
|
|
1533 | /* If there is no object for this space, or if the face for the object |
|
|
1534 | * is the blank face, set the smoothlevel to zero. |
|
|
1535 | */ |
|
|
1536 | if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp)) |
|
|
1537 | smoothlevel = 0; |
|
|
1538 | else |
|
|
1539 | { |
|
|
1540 | smoothlevel = ob->smoothlevel; |
|
|
1541 | if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) |
|
|
1542 | SendSmooth (&ns, ob->face->number); |
|
|
1543 | } /* else not already head object or blank face */ |
|
|
1544 | |
|
|
1545 | /* We've gotten what face we want to use for the object. Now see if |
|
|
1546 | * if it has changed since we last sent it to the client. |
|
|
1547 | */ |
|
|
1548 | if (smoothlevel > 255) |
|
|
1549 | smoothlevel = 255; |
|
|
1550 | else if (smoothlevel < 0) |
|
|
1551 | smoothlevel = 0; |
|
|
1552 | |
|
|
1553 | if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel) |
|
|
1554 | { |
|
|
1555 | ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel; |
|
|
1556 | sl << uint8 (smoothlevel); |
|
|
1557 | return 1; |
962 | return 1; |
1558 | } |
963 | } |
1559 | |
964 | |
1560 | /* Nothing changed */ |
965 | /* Nothing changed */ |
1561 | return 0; |
966 | return 0; |
… | |
… | |
1576 | if (ns->EMI_smooth) |
981 | if (ns->EMI_smooth) |
1577 | result += 1; /*One byte for smoothlevel */ |
982 | result += 1; /*One byte for smoothlevel */ |
1578 | } |
983 | } |
1579 | |
984 | |
1580 | return result; |
985 | return result; |
|
|
986 | } |
|
|
987 | |
|
|
988 | // prefetch (and touch) all maps within a specific distancd |
|
|
989 | static void |
|
|
990 | prefetch_surrounding_maps (maptile *map, int distance) |
|
|
991 | { |
|
|
992 | map->last_access = runtime; |
|
|
993 | |
|
|
994 | if (--distance) |
|
|
995 | for (int dir = 4; --dir; ) |
|
|
996 | if (const shstr &path = map->tile_path [dir]) |
|
|
997 | if (maptile *&neigh = map->tile_map [dir]) |
|
|
998 | prefetch_surrounding_maps (neigh, distance); |
|
|
999 | else |
|
|
1000 | neigh = maptile::find_async (path, map); |
|
|
1001 | } |
|
|
1002 | |
|
|
1003 | // prefetch a generous area around the player |
|
|
1004 | static void |
|
|
1005 | prefetch_surrounding_maps (object *op) |
|
|
1006 | { |
|
|
1007 | prefetch_surrounding_maps (op->map, 3); |
1581 | } |
1008 | } |
1582 | |
1009 | |
1583 | /** |
1010 | /** |
1584 | * This function uses the new map1 protocol command to send the map |
1011 | * This function uses the new map1 protocol command to send the map |
1585 | * to the client. It is necessary because the old map command supports |
1012 | * to the client. It is necessary because the old map command supports |
… | |
… | |
1591 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1018 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1592 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1019 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1593 | * and use the other 4 bits for other informatiion. For full documentation |
1020 | * and use the other 4 bits for other informatiion. For full documentation |
1594 | * of what we send, see the doc/Protocol file. |
1021 | * of what we send, see the doc/Protocol file. |
1595 | * I will describe internally what we do: |
1022 | * I will describe internally what we do: |
1596 | * the socket->lastmap shows how the map last looked when sent to the client. |
1023 | * the ns->lastmap shows how the map last looked when sent to the client. |
1597 | * in the lastmap structure, there is a cells array, which is set to the |
1024 | * in the lastmap structure, there is a cells array, which is set to the |
1598 | * maximum viewable size (As set in config.h). |
1025 | * maximum viewable size (As set in config.h). |
1599 | * in the cells, there are faces and a count value. |
1026 | * in the cells, there are faces and a count value. |
1600 | * we use the count value to hold the darkness value. If -1, then this space |
1027 | * we use the count value to hold the darkness value. If -1, then this space |
1601 | * is not viewable. |
1028 | * is not viewable. |
… | |
… | |
1603 | * look like. |
1030 | * look like. |
1604 | */ |
1031 | */ |
1605 | void |
1032 | void |
1606 | draw_client_map1 (object *pl) |
1033 | draw_client_map1 (object *pl) |
1607 | { |
1034 | { |
1608 | int x, y, ax, ay, d, startlen, max_x, max_y, oldlen; |
1035 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1609 | sint16 nx, ny; |
1036 | sint16 nx, ny; |
1610 | int estartlen, eoldlen; |
1037 | int estartlen, eoldlen; |
1611 | uint16 mask, emask; |
|
|
1612 | uint8 eentrysize; |
1038 | uint8 eentrysize; |
1613 | uint16 ewhatstart, ewhatflag; |
1039 | uint16 ewhatstart, ewhatflag; |
1614 | uint8 extendedinfos; |
1040 | uint8 extendedinfos; |
1615 | maptile *m; |
1041 | maptile *m; |
1616 | |
1042 | |
1617 | client &socket = *pl->contr->socket; |
1043 | client &socket = *pl->contr->ns; |
|
|
1044 | |
|
|
1045 | if (!pl->active) |
|
|
1046 | return; |
1618 | |
1047 | |
1619 | check_map_change (pl->contr); |
1048 | check_map_change (pl->contr); |
|
|
1049 | prefetch_surrounding_maps (pl); |
1620 | |
1050 | |
1621 | packet sl; |
1051 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1622 | packet esl; |
1052 | packet esl; |
1623 | |
1053 | |
1624 | sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a "); |
|
|
1625 | startlen = sl.length (); |
1054 | startlen = sl.length (); |
1626 | |
1055 | |
1627 | /*Extendedmapinfo structure initialisation */ |
1056 | /*Extendedmapinfo structure initialisation */ |
1628 | if (socket.ext_mapinfos) |
1057 | if (socket.ext_mapinfos) |
1629 | { |
1058 | { |
… | |
… | |
1640 | << uint8 (extendedinfos) |
1069 | << uint8 (extendedinfos) |
1641 | << uint8 (eentrysize); |
1070 | << uint8 (eentrysize); |
1642 | |
1071 | |
1643 | estartlen = esl.length (); |
1072 | estartlen = esl.length (); |
1644 | } |
1073 | } |
1645 | else |
|
|
1646 | { |
|
|
1647 | /* suppress compiler warnings */ |
|
|
1648 | ewhatstart = 0; |
|
|
1649 | ewhatflag = 0; |
|
|
1650 | estartlen = 0; |
|
|
1651 | } |
|
|
1652 | |
|
|
1653 | /* Init data to zero */ |
|
|
1654 | memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS); |
|
|
1655 | |
1074 | |
1656 | /* x,y are the real map locations. ax, ay are viewport relative |
1075 | /* x,y are the real map locations. ax, ay are viewport relative |
1657 | * locations. |
1076 | * locations. |
1658 | */ |
1077 | */ |
1659 | ay = 0; |
1078 | ay = 0; |
… | |
… | |
1662 | * but that started to get a bit messy to look at. |
1081 | * but that started to get a bit messy to look at. |
1663 | */ |
1082 | */ |
1664 | max_x = pl->x + (socket.mapx + 1) / 2; |
1083 | max_x = pl->x + (socket.mapx + 1) / 2; |
1665 | max_y = pl->y + (socket.mapy + 1) / 2; |
1084 | max_y = pl->y + (socket.mapy + 1) / 2; |
1666 | |
1085 | |
1667 | if (socket.mapmode == Map1aCmd) |
1086 | maptile *plmap = pl->map; |
1668 | { |
|
|
1669 | max_x += MAX_HEAD_OFFSET; |
|
|
1670 | max_y += MAX_HEAD_OFFSET; |
|
|
1671 | } |
|
|
1672 | |
1087 | |
1673 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1088 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1674 | { |
1089 | { |
1675 | ax = 0; |
1090 | ax = 0; |
1676 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1091 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1677 | { |
1092 | { |
1678 | |
1093 | int emask, mask; |
1679 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1094 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1680 | |
1095 | |
1681 | /* If this space is out of the normal viewable area, we only check |
|
|
1682 | * the heads value ax or ay will only be greater than what |
|
|
1683 | * the client wants if using the map1a command - this is because |
|
|
1684 | * if the map1a command is not used, max_x and max_y will be |
|
|
1685 | * set to lower values. |
|
|
1686 | */ |
|
|
1687 | if (ax >= socket.mapx || ay >= socket.mapy) |
|
|
1688 | { |
|
|
1689 | int i, got_one; |
|
|
1690 | |
|
|
1691 | oldlen = sl.length (); |
|
|
1692 | |
|
|
1693 | sl << uint16 (mask); |
|
|
1694 | |
|
|
1695 | if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4; |
|
|
1696 | if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2; |
|
|
1697 | if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1; |
|
|
1698 | |
|
|
1699 | /* If all we are doing is sending 0 (blank) faces, we don't |
|
|
1700 | * actually need to send that - just the coordinates |
|
|
1701 | * with no faces tells the client to blank out the |
|
|
1702 | * space. |
|
|
1703 | */ |
|
|
1704 | got_one = 0; |
|
|
1705 | for (i = oldlen + 2; i < sl.length (); i++) |
|
|
1706 | if (sl[i]) |
|
|
1707 | got_one = 1; |
|
|
1708 | |
|
|
1709 | if (got_one && (mask & 0xf)) |
|
|
1710 | sl[oldlen + 1] = mask & 0xff; |
|
|
1711 | else |
|
|
1712 | { /*either all faces blank, either no face at all */ |
|
|
1713 | if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */ |
|
|
1714 | sl.reset (oldlen + 2); |
|
|
1715 | else |
|
|
1716 | sl.reset (oldlen); |
|
|
1717 | } |
|
|
1718 | |
|
|
1719 | /*What concerns extendinfos, nothing to be done for now |
|
|
1720 | * (perhaps effects layer later) |
|
|
1721 | */ |
|
|
1722 | continue; /* don't do processing below */ |
|
|
1723 | } |
|
|
1724 | |
|
|
1725 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1096 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1726 | |
|
|
1727 | d = pl->contr->blocked_los[ax][ay]; |
|
|
1728 | |
1097 | |
1729 | /* If the coordinates are not valid, or it is too dark to see, |
1098 | /* If the coordinates are not valid, or it is too dark to see, |
1730 | * we tell the client as such |
1099 | * we tell the client as such |
1731 | */ |
1100 | */ |
1732 | nx = x; |
1101 | nx = x; |
1733 | ny = y; |
1102 | ny = y; |
1734 | m = get_map_from_coord (pl->map, &nx, &ny); |
1103 | m = get_map_from_coord (plmap, &nx, &ny); |
1735 | |
1104 | |
1736 | if (!m) |
1105 | if (!m) |
1737 | { |
1106 | { |
1738 | /* space is out of map. Update space and clear values |
1107 | /* space is out of map. Update space and clear values |
1739 | * if this hasn't already been done. If the space is out |
1108 | * if this hasn't already been done. If the space is out |
1740 | * of the map, it shouldn't have a head |
1109 | * of the map, it shouldn't have a head |
1741 | */ |
1110 | */ |
1742 | if (lastcell.count != -1) |
1111 | if (lastcell.count != -1) |
1743 | { |
1112 | { |
1744 | sl << uint16 (mask); |
1113 | sl << uint16 (mask); |
1745 | map_clearcell (&lastcell, 0, 0, 0, -1); |
1114 | map_clearcell (&lastcell, -1); |
1746 | } |
1115 | } |
|
|
1116 | |
|
|
1117 | continue; |
1747 | } |
1118 | } |
|
|
1119 | |
|
|
1120 | m->touch (); |
|
|
1121 | |
|
|
1122 | int d = pl->contr->blocked_los[ax][ay]; |
|
|
1123 | |
1748 | else if (d > 3) |
1124 | if (d > 3) |
1749 | { |
1125 | { |
|
|
1126 | |
1750 | int need_send = 0, count; |
1127 | int need_send = 0, count; |
1751 | |
1128 | |
1752 | /* This block deals with spaces that are not visible for whatever |
1129 | /* This block deals with spaces that are not visible for whatever |
1753 | * reason. Still may need to send the head for this space. |
1130 | * reason. Still may need to send the head for this space. |
1754 | */ |
1131 | */ |
1755 | |
1132 | |
1756 | oldlen = sl.length (); |
1133 | oldlen = sl.length (); |
1757 | |
1134 | |
1758 | sl << uint16 (mask); |
1135 | sl << uint16 (mask); |
… | |
… | |
1760 | if (lastcell.count != -1) |
1137 | if (lastcell.count != -1) |
1761 | need_send = 1; |
1138 | need_send = 1; |
1762 | |
1139 | |
1763 | count = -1; |
1140 | count = -1; |
1764 | |
1141 | |
1765 | if (socket.mapmode == Map1aCmd && have_head (ax, ay)) |
|
|
1766 | { |
|
|
1767 | /* Now check to see if any heads need to be sent */ |
|
|
1768 | |
|
|
1769 | if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4; |
|
|
1770 | if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2; |
|
|
1771 | if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1; |
|
|
1772 | |
|
|
1773 | lastcell.count = count; |
|
|
1774 | } |
|
|
1775 | else |
|
|
1776 | { |
|
|
1777 | /* properly clear a previously sent big face */ |
1142 | /* properly clear a previously sent big face */ |
1778 | if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0 |
1143 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1779 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1144 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1780 | need_send = 1; |
1145 | need_send = 1; |
1781 | |
1146 | |
1782 | map_clearcell (&lastcell, 0, 0, 0, count); |
1147 | map_clearcell (&lastcell, count); |
1783 | } |
|
|
1784 | |
1148 | |
1785 | if ((mask & 0xf) || need_send) |
1149 | if ((mask & 0xf) || need_send) |
1786 | sl[oldlen + 1] = mask & 0xff; |
1150 | sl[oldlen + 1] = mask & 0xff; |
1787 | else |
1151 | else |
1788 | sl.reset (oldlen); |
1152 | sl.reset (oldlen); |
1789 | } |
1153 | } |
1790 | else |
1154 | else |
1791 | { |
1155 | { |
1792 | /* In this block, the space is visible or there are head objects |
1156 | /* In this block, the space is visible. |
1793 | * we need to send. |
|
|
1794 | */ |
1157 | */ |
1795 | |
1158 | |
1796 | /* Rather than try to figure out what everything that we might |
1159 | /* Rather than try to figure out what everything that we might |
1797 | * need to send is, then form the packet after that, |
1160 | * need to send is, then form the packet after that, |
1798 | * we presume that we will in fact form a packet, and update |
1161 | * we presume that we will in fact form a packet, and update |
… | |
… | |
1801 | * is done. |
1164 | * is done. |
1802 | * I think this is simpler than doing a bunch of checks to see |
1165 | * I think this is simpler than doing a bunch of checks to see |
1803 | * what if anything we need to send, setting the bits, then |
1166 | * what if anything we need to send, setting the bits, then |
1804 | * doing those checks again to add the real data. |
1167 | * doing those checks again to add the real data. |
1805 | */ |
1168 | */ |
1806 | oldlen = sl.length (); |
1169 | oldlen = sl.length (); |
1807 | mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1808 | eoldlen = esl.length (); |
1170 | eoldlen = esl.length (); |
1809 | emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1171 | |
1810 | sl << uint16 (mask); |
1172 | sl << uint16 (mask); |
1811 | |
|
|
1812 | if (socket.ext_mapinfos) |
|
|
1813 | esl << uint16 (emask); |
|
|
1814 | |
1173 | |
1815 | unsigned char dummy; |
1174 | unsigned char dummy; |
1816 | unsigned char *last_ext = &dummy; |
1175 | unsigned char *last_ext = &dummy; |
1817 | |
1176 | |
1818 | /* Darkness changed */ |
1177 | /* Darkness changed */ |
… | |
… | |
1830 | sl << uint8 (255 - 64 * d); |
1189 | sl << uint8 (255 - 64 * d); |
1831 | } |
1190 | } |
1832 | |
1191 | |
1833 | lastcell.count = d; |
1192 | lastcell.count = d; |
1834 | |
1193 | |
|
|
1194 | mapspace &ms = m->at (nx, ny); |
|
|
1195 | |
1835 | if (socket.extmap) |
1196 | if (socket.extmap) |
1836 | { |
1197 | { |
1837 | uint8 stat_hp = 0; |
1198 | uint8 stat_hp = 0; |
1838 | uint8 stat_width = 0; |
1199 | uint8 stat_width = 0; |
1839 | uint8 flags = 0; |
1200 | uint8 flags = 0; |
1840 | UUID player = 0; |
1201 | tag_t player = 0; |
1841 | |
1202 | |
1842 | // send hp information, if applicable |
1203 | // send hp information, if applicable |
1843 | if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0)) |
1204 | if (object *op = ms.faces_obj [0]) |
1844 | { |
1205 | { |
1845 | if (op->head || op->invisible) |
1206 | if (op->head || op->invisible) |
1846 | ; // do not show |
1207 | ; // do not show |
1847 | else if (op->type == PLAYER |
1208 | else if (op->type == PLAYER |
1848 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
1209 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
… | |
… | |
1886 | |
1247 | |
1887 | mask |= 0x8; |
1248 | mask |= 0x8; |
1888 | *last_ext |= 0x80; |
1249 | *last_ext |= 0x80; |
1889 | last_ext = &sl[sl.length ()]; |
1250 | last_ext = &sl[sl.length ()]; |
1890 | |
1251 | |
1891 | sl << uint8 (0x47) << uint8 (8) << (uint64)player; |
1252 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1892 | } |
1253 | } |
1893 | |
1254 | |
1894 | if (lastcell.flags != flags) |
1255 | if (lastcell.flags != flags) |
1895 | { |
1256 | { |
1896 | lastcell.flags = flags; |
1257 | lastcell.flags = flags; |
… | |
… | |
1902 | sl << uint8 (8) << uint8 (flags); |
1263 | sl << uint8 (8) << uint8 (flags); |
1903 | } |
1264 | } |
1904 | } |
1265 | } |
1905 | |
1266 | |
1906 | /* Floor face */ |
1267 | /* Floor face */ |
1907 | if (update_space (sl, socket, m, nx, ny, ax, ay, 2)) |
1268 | if (update_space (sl, socket, ms, lastcell, 2)) |
1908 | mask |= 0x4; |
1269 | mask |= 0x4; |
1909 | |
1270 | |
1910 | if (socket.EMI_smooth) |
|
|
1911 | if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2)) |
|
|
1912 | emask |= 0x4; |
|
|
1913 | |
|
|
1914 | /* Middle face */ |
1271 | /* Middle face */ |
1915 | if (update_space (sl, socket, m, nx, ny, ax, ay, 1)) |
1272 | if (update_space (sl, socket, ms, lastcell, 1)) |
1916 | mask |= 0x2; |
1273 | mask |= 0x2; |
1917 | |
1274 | |
1918 | if (socket.EMI_smooth) |
1275 | if (ms.player () == pl |
1919 | if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1)) |
1276 | && (pl->invisible & (pl->invisible < 50 ? 1 : 7))) |
1920 | emask |= 0x2; |
|
|
1921 | |
|
|
1922 | if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1)) |
|
|
1923 | { |
1277 | { |
|
|
1278 | // force player to be visible to himself if invisible |
1924 | if (lastcell.faces[0] != pl->face->number) |
1279 | if (lastcell.faces[0] != pl->face) |
1925 | { |
1280 | { |
1926 | lastcell.faces[0] = pl->face->number; |
1281 | lastcell.faces[0] = pl->face; |
|
|
1282 | |
1927 | mask |= 0x1; |
1283 | mask |= 0x1; |
1928 | |
|
|
1929 | if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE)) |
|
|
1930 | esrv_send_face (&socket, pl->face->number, 0); |
|
|
1931 | |
|
|
1932 | sl << uint16 (pl->face->number); |
1284 | sl << uint16 (pl->face); |
|
|
1285 | |
|
|
1286 | socket.send_faces (pl); |
1933 | } |
1287 | } |
1934 | } |
1288 | } |
1935 | else |
|
|
1936 | { |
|
|
1937 | /* Top face */ |
1289 | /* Top face */ |
1938 | if (update_space (sl, socket, m, nx, ny, ax, ay, 0)) |
1290 | else if (update_space (sl, socket, ms, lastcell, 0)) |
1939 | mask |= 0x1; |
1291 | mask |= 0x1; |
1940 | |
|
|
1941 | if (socket.EMI_smooth) |
|
|
1942 | if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0)) |
|
|
1943 | emask |= 0x1; |
|
|
1944 | } |
1292 | |
1945 | |
1293 | |
1946 | /* Check to see if we are in fact sending anything for this |
1294 | /* Check to see if we are in fact sending anything for this |
1947 | * space by checking the mask. If so, update the mask. |
1295 | * space by checking the mask. If so, update the mask. |
1948 | * if not, reset the len to that from before adding the mask |
1296 | * if not, reset the len to that from before adding the mask |
1949 | * value, so we don't send those bits. |
1297 | * value, so we don't send those bits. |
… | |
… | |
1951 | if (mask & 0xf) |
1299 | if (mask & 0xf) |
1952 | sl[oldlen + 1] = mask & 0xff; |
1300 | sl[oldlen + 1] = mask & 0xff; |
1953 | else |
1301 | else |
1954 | sl.reset (oldlen); |
1302 | sl.reset (oldlen); |
1955 | |
1303 | |
|
|
1304 | if (socket.ext_mapinfos) |
|
|
1305 | esl << uint16 (emask); |
|
|
1306 | |
|
|
1307 | if (socket.EMI_smooth) |
|
|
1308 | { |
|
|
1309 | for (int layer = 2+1; layer--; ) |
|
|
1310 | { |
|
|
1311 | object *ob = ms.faces_obj [layer]; |
|
|
1312 | |
|
|
1313 | // If there is no object for this space, or if the face for the object |
|
|
1314 | // is the blank face, set the smoothlevel to zero. |
|
|
1315 | int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
|
|
1316 | |
|
|
1317 | // We've gotten what face we want to use for the object. Now see if |
|
|
1318 | // if it has changed since we last sent it to the client. |
|
|
1319 | if (lastcell.smooth[layer] != smoothlevel) |
|
|
1320 | { |
|
|
1321 | lastcell.smooth[layer] = smoothlevel; |
|
|
1322 | esl << uint8 (smoothlevel); |
|
|
1323 | emask |= 1 << layer; |
|
|
1324 | } |
|
|
1325 | } |
|
|
1326 | |
1956 | if (emask & 0xf) |
1327 | if (emask & 0xf) |
1957 | esl[eoldlen + 1] = emask & 0xff; |
1328 | esl[eoldlen + 1] = emask & 0xff; |
1958 | else |
1329 | else |
1959 | esl.reset (eoldlen); |
1330 | esl.reset (eoldlen); |
|
|
1331 | } |
1960 | } /* else this is a viewable space */ |
1332 | } /* else this is a viewable space */ |
1961 | } /* for x loop */ |
1333 | } /* for x loop */ |
1962 | } /* for y loop */ |
1334 | } /* for y loop */ |
|
|
1335 | |
|
|
1336 | socket.flush_fx (); |
1963 | |
1337 | |
1964 | /* Verify that we in fact do need to send this */ |
1338 | /* Verify that we in fact do need to send this */ |
1965 | if (socket.ext_mapinfos) |
1339 | if (socket.ext_mapinfos) |
1966 | { |
1340 | { |
1967 | if (!(sl.length () > startlen || socket.sent_scroll)) |
1341 | if (!(sl.length () > startlen || socket.sent_scroll)) |
1968 | { |
1342 | { |
1969 | /* No map data will follow, so don't say the client |
1343 | /* No map data will follow, so don't say the client |
1970 | * it doesn't need draw! |
1344 | * it doesn't need draw! |
1971 | */ |
1345 | */ |
1972 | ewhatflag &= (~EMI_NOREDRAW); |
1346 | ewhatflag &= ~EMI_NOREDRAW; |
1973 | esl[ewhatstart + 1] = ewhatflag & 0xff; |
1347 | esl[ewhatstart + 1] = ewhatflag & 0xff; |
1974 | } |
1348 | } |
1975 | |
1349 | |
1976 | if (esl.length () > estartlen) |
1350 | if (esl.length () > estartlen) |
1977 | socket.send_packet (esl); |
1351 | socket.send_packet (esl); |
… | |
… | |
1989 | */ |
1363 | */ |
1990 | void |
1364 | void |
1991 | draw_client_map (object *pl) |
1365 | draw_client_map (object *pl) |
1992 | { |
1366 | { |
1993 | int i, j; |
1367 | int i, j; |
1994 | sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */ |
1368 | sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */ |
1995 | New_Face *face, *floor; |
|
|
1996 | New_Face *floor2; |
|
|
1997 | int d, mflags; |
1369 | int mflags; |
1998 | struct Map newmap; |
1370 | struct Map newmap; |
1999 | maptile *m, *pm; |
1371 | maptile *m, *pm; |
2000 | |
1372 | |
2001 | if (pl->type != PLAYER) |
1373 | if (pl->type != PLAYER) |
2002 | { |
1374 | { |
… | |
… | |
2013 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
1385 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
2014 | return; |
1386 | return; |
2015 | |
1387 | |
2016 | memset (&newmap, 0, sizeof (struct Map)); |
1388 | memset (&newmap, 0, sizeof (struct Map)); |
2017 | |
1389 | |
2018 | for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++) |
1390 | for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) |
2019 | { |
|
|
2020 | for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++) |
1391 | for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) |
2021 | { |
1392 | { |
2022 | ax = i; |
1393 | ax = i; |
2023 | ay = j; |
1394 | ay = j; |
2024 | m = pm; |
1395 | m = pm; |
2025 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
1396 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
2026 | |
1397 | |
2027 | if (mflags & P_OUT_OF_MAP) |
1398 | if (mflags & P_OUT_OF_MAP) |
2028 | continue; |
1399 | continue; |
2029 | |
1400 | |
2030 | if (mflags & P_NEED_UPDATE) |
|
|
2031 | update_position (m, ax, ay); |
|
|
2032 | |
|
|
2033 | /* If a map is visible to the player, we don't want to swap it out |
1401 | /* If a map is visible to the player, we don't want to swap it out |
2034 | * just to reload it. This should really call something like |
1402 | * just to reload it. This should really call something like |
2035 | * swap_map, but this is much more efficient and 'good enough' |
1403 | * swap_map, but this is much more efficient and 'good enough' |
2036 | */ |
1404 | */ |
2037 | if (mflags & P_NEW_MAP) |
1405 | if (mflags & P_NEW_MAP) |
2038 | m->timeout = 50; |
1406 | m->timeout = 50; |
2039 | } |
1407 | } |
2040 | } |
1408 | |
2041 | /* do LOS after calls to update_position */ |
1409 | /* do LOS after calls to update_position */ |
2042 | if (pl->contr->do_los) |
1410 | if (pl->contr->do_los) |
2043 | { |
1411 | { |
2044 | update_los (pl); |
1412 | update_los (pl); |
2045 | pl->contr->do_los = 0; |
1413 | pl->contr->do_los = 0; |
… | |
… | |
2060 | |
1428 | |
2061 | /*****************************************************************************/ |
1429 | /*****************************************************************************/ |
2062 | void |
1430 | void |
2063 | send_plugin_custom_message (object *pl, char *buf) |
1431 | send_plugin_custom_message (object *pl, char *buf) |
2064 | { |
1432 | { |
2065 | pl->contr->socket->send_packet (buf); |
1433 | pl->contr->ns->send_packet (buf); |
2066 | } |
1434 | } |
2067 | |
1435 | |
2068 | /** |
1436 | /** |
2069 | * This sends the skill number to name mapping. We ignore |
1437 | * This sends the skill number to name mapping. We ignore |
2070 | * the params - we always send the same info no matter what. |
1438 | * the params - we always send the same info no matter what. |
… | |
… | |
2115 | * it then sends an updspell packet for each spell that has changed in this way |
1483 | * it then sends an updspell packet for each spell that has changed in this way |
2116 | */ |
1484 | */ |
2117 | void |
1485 | void |
2118 | esrv_update_spells (player *pl) |
1486 | esrv_update_spells (player *pl) |
2119 | { |
1487 | { |
|
|
1488 | if (!pl->ns) |
|
|
1489 | return; |
|
|
1490 | |
2120 | if (!pl->socket->monitor_spells) |
1491 | if (!pl->ns->monitor_spells) |
2121 | return; |
1492 | return; |
2122 | |
1493 | |
2123 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1494 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
2124 | { |
1495 | { |
2125 | if (spell->type == SPELL) |
1496 | if (spell->type == SPELL) |
… | |
… | |
2155 | |
1526 | |
2156 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1527 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
2157 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1528 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
2158 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1529 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
2159 | |
1530 | |
2160 | pl->socket->send_packet (sl); |
1531 | pl->ns->send_packet (sl); |
2161 | } |
1532 | } |
2162 | } |
1533 | } |
2163 | } |
1534 | } |
2164 | } |
1535 | } |
2165 | |
1536 | |
2166 | void |
1537 | void |
2167 | esrv_remove_spell (player *pl, object *spell) |
1538 | esrv_remove_spell (player *pl, object *spell) |
2168 | { |
1539 | { |
2169 | if (!pl->socket->monitor_spells) |
1540 | if (!pl->ns->monitor_spells) |
2170 | return; |
1541 | return; |
2171 | |
1542 | |
2172 | if (!pl || !spell || spell->env != pl->ob) |
1543 | if (!pl || !spell || spell->env != pl->ob) |
2173 | { |
1544 | { |
2174 | LOG (llevError, "Invalid call to esrv_remove_spell"); |
1545 | LOG (llevError, "Invalid call to esrv_remove_spell"); |
2175 | return; |
1546 | return; |
2176 | } |
1547 | } |
2177 | |
1548 | |
2178 | packet sl; |
1549 | packet sl ("delspell"); |
2179 | |
1550 | |
2180 | sl << "delspell " |
|
|
2181 | << uint32 (spell->count); |
1551 | sl << uint32 (spell->count); |
2182 | |
1552 | |
2183 | pl->socket->send_packet (sl); |
1553 | pl->ns->send_packet (sl); |
2184 | } |
1554 | } |
2185 | |
1555 | |
2186 | /* appends the spell *spell to the Socklist we will send the data to. */ |
1556 | /* appends the spell *spell to the Socklist we will send the data to. */ |
2187 | static void |
1557 | static void |
2188 | append_spell (player *pl, packet &sl, object *spell) |
1558 | append_spell (player *pl, packet &sl, object *spell) |
2189 | { |
1559 | { |
2190 | int len, i, skill = 0; |
1560 | int i, skill = 0; |
2191 | |
1561 | |
2192 | if (!(spell->name)) |
1562 | if (!(spell->name)) |
2193 | { |
1563 | { |
2194 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1564 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
2195 | return; |
1565 | return; |
… | |
… | |
2207 | if (!strcmp (spell->skill, skill_names[i])) |
1577 | if (!strcmp (spell->skill, skill_names[i])) |
2208 | { |
1578 | { |
2209 | skill = i + CS_STAT_SKILLINFO; |
1579 | skill = i + CS_STAT_SKILLINFO; |
2210 | break; |
1580 | break; |
2211 | } |
1581 | } |
|
|
1582 | } |
|
|
1583 | |
|
|
1584 | // spells better have a face |
|
|
1585 | if (!spell->face) |
|
|
1586 | { |
|
|
1587 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
|
|
1588 | spell->face = face_find ("burnout.x11", blank_face); |
2212 | } |
1589 | } |
2213 | |
1590 | |
2214 | /* send the current values */ |
1591 | /* send the current values */ |
2215 | sl << uint32 (spell->count) |
1592 | sl << uint32 (spell->count) |
2216 | << uint16 (spell->level) |
1593 | << uint16 (spell->level) |
… | |
… | |
2218 | << uint16 (spell->last_sp) |
1595 | << uint16 (spell->last_sp) |
2219 | << uint16 (spell->last_grace) |
1596 | << uint16 (spell->last_grace) |
2220 | << uint16 (spell->last_eat) |
1597 | << uint16 (spell->last_eat) |
2221 | << uint8 (skill) |
1598 | << uint8 (skill) |
2222 | << uint32 (spell->path_attuned) |
1599 | << uint32 (spell->path_attuned) |
2223 | << uint32 (spell->face ? spell->face->number : 0) |
1600 | << uint32 (spell->face) |
2224 | << data8 (spell->name) |
1601 | << data8 (spell->name) |
2225 | << data16 (spell->msg); |
1602 | << data16 (spell->msg); |
2226 | } |
1603 | } |
2227 | |
1604 | |
2228 | /** |
1605 | /** |
… | |
… | |
2236 | { |
1613 | { |
2237 | LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
1614 | LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
2238 | return; |
1615 | return; |
2239 | } |
1616 | } |
2240 | |
1617 | |
2241 | if (!pl->socket->monitor_spells) |
1618 | if (!pl->ns->monitor_spells) |
2242 | return; |
1619 | return; |
2243 | |
1620 | |
2244 | packet sl; |
1621 | packet sl ("addspell"); |
2245 | sl << "addspell "; |
|
|
2246 | |
1622 | |
2247 | if (!spell) |
1623 | if (!spell) |
2248 | { |
1624 | { |
2249 | for (spell = pl->ob->inv; spell != NULL; spell = spell->below) |
1625 | for (spell = pl->ob->inv; spell; spell = spell->below) |
2250 | { |
1626 | { |
2251 | /* were we to simply keep appending data here, we could exceed |
1627 | /* were we to simply keep appending data here, we could exceed |
2252 | * MAXSOCKBUF if the player has enough spells to add, we know that |
1628 | * MAXSOCKBUF if the player has enough spells to add, we know that |
2253 | * append_spells will always append 19 data bytes, plus 4 length |
1629 | * append_spells will always append 19 data bytes, plus 4 length |
2254 | * bytes and 3 strings (because that is the spec) so we need to |
1630 | * bytes and 3 strings (because that is the spec) so we need to |
… | |
… | |
2264 | if (spell->type != SPELL) |
1640 | if (spell->type != SPELL) |
2265 | continue; |
1641 | continue; |
2266 | |
1642 | |
2267 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1643 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
2268 | { |
1644 | { |
2269 | pl->socket->send_packet (sl); |
1645 | pl->ns->send_packet (sl); |
2270 | |
1646 | |
2271 | sl.reset (); |
1647 | sl.reset (); |
2272 | sl << "addspell "; |
1648 | sl << "addspell "; |
2273 | } |
1649 | } |
2274 | |
1650 | |
… | |
… | |
2288 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1664 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
2289 | fatal (0); |
1665 | fatal (0); |
2290 | } |
1666 | } |
2291 | |
1667 | |
2292 | /* finally, we can send the packet */ |
1668 | /* finally, we can send the packet */ |
2293 | pl->socket->send_packet (sl); |
1669 | pl->ns->send_packet (sl); |
2294 | } |
1670 | } |
2295 | |
1671 | |