1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2001 Mark Wedel |
5 | * Copyright (©) 2001,2007 Mark Wedel |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * 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 |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * 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 |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /** |
24 | /** |
26 | * \file |
25 | * \file |
27 | * Client handling. |
26 | * Client handling. |
… | |
… | |
130 | } |
129 | } |
131 | |
130 | |
132 | static void |
131 | static void |
133 | clear_map (player *pl) |
132 | clear_map (player *pl) |
134 | { |
133 | { |
|
|
134 | pl->ns->mapinfo_queue_clear (); |
|
|
135 | |
135 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
136 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
136 | |
137 | |
137 | pl->ns->force_newmap = false; |
138 | pl->ns->force_newmap = false; |
138 | |
139 | |
139 | if (pl->ns->newmapcmd == 1) |
140 | if (pl->ns->newmapcmd == 1) |
… | |
… | |
145 | /** check for map/region change and send new map data */ |
146 | /** check for map/region change and send new map data */ |
146 | static void |
147 | static void |
147 | check_map_change (player *pl) |
148 | check_map_change (player *pl) |
148 | { |
149 | { |
149 | client &socket = *pl->ns; |
150 | client &socket = *pl->ns; |
150 | object *ob = pl->ob; |
151 | object *ob = pl->observe; |
151 | char buf[MAX_BUF]; /* eauugggh */ |
|
|
152 | |
152 | |
153 | if (socket.force_newmap) |
153 | if (socket.current_map != ob->map || socket.force_newmap) |
154 | { |
|
|
155 | // force newmap is used for clients that do not redraw their map |
|
|
156 | // after image uploads. |
|
|
157 | socket.current_map = ob->map; |
|
|
158 | clear_map (pl); |
|
|
159 | } |
|
|
160 | else if (socket.current_map != ob->map) |
|
|
161 | { |
154 | { |
162 | clear_map (pl); |
155 | clear_map (pl); |
163 | socket.current_map = ob->map; |
156 | socket.current_map = ob->map; |
164 | |
157 | |
165 | if (socket.mapinfocmd) |
158 | if (socket.mapinfocmd) |
166 | { |
159 | { |
167 | if (ob->map && ob->map->path[0]) |
160 | if (ob->map && ob->map->path[0]) |
168 | { |
161 | { |
169 | int flags = 0; |
162 | int flags = 0; |
170 | |
163 | |
171 | if (ob->map->tile_path[0]) |
164 | if (ob->map->tile_path[0]) flags |= 1; |
172 | flags |= 1; |
|
|
173 | if (ob->map->tile_path[1]) |
165 | if (ob->map->tile_path[1]) flags |= 2; |
174 | flags |= 2; |
|
|
175 | if (ob->map->tile_path[2]) |
166 | if (ob->map->tile_path[2]) flags |= 4; |
176 | flags |= 4; |
|
|
177 | if (ob->map->tile_path[3]) |
167 | if (ob->map->tile_path[3]) flags |= 8; |
178 | flags |= 8; |
|
|
179 | |
168 | |
180 | snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
169 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
181 | 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, |
|
|
171 | ob->map->width, ob->map->height, &ob->map->path); |
182 | } |
172 | } |
183 | else |
173 | else |
184 | snprintf (buf, MAX_BUF, "mapinfo current"); |
|
|
185 | |
|
|
186 | socket.send_packet (buf); |
174 | socket.send_packet ("mapinfo current"); |
187 | } |
175 | } |
188 | } |
176 | } |
189 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
177 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
190 | { |
178 | { |
191 | int dx = ob->x - socket.current_x; |
179 | int dx = ob->x - socket.current_x; |
… | |
… | |
204 | socket.current_y = ob->y; |
192 | socket.current_y = ob->y; |
205 | |
193 | |
206 | region *reg = ob->region (); |
194 | region *reg = ob->region (); |
207 | if (socket.current_region != reg) |
195 | if (socket.current_region != reg) |
208 | { |
196 | { |
|
|
197 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
209 | socket.current_region = reg; |
198 | socket.current_region = reg; |
210 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
|
|
211 | } |
199 | } |
212 | } |
200 | } |
213 | |
201 | |
214 | /** |
202 | /** |
215 | * RequestInfo is sort of a meta command. There is some specific |
203 | * RequestInfo is sort of a meta command. There is some specific |
216 | * request of information, but we call other functions to provide |
204 | * request of information, but we call other functions to provide |
217 | * that information. |
205 | * that information. |
218 | */ |
206 | */ |
219 | void |
207 | void |
220 | RequestInfo (char *buf, int len, client * ns) |
208 | RequestInfo (char *buf, int len, client *ns) |
221 | { |
209 | { |
222 | char *params = NULL, *cp; |
210 | char *params; |
223 | |
|
|
224 | /* No match */ |
|
|
225 | char bigbuf[MAX_BUF]; |
|
|
226 | int slen; |
|
|
227 | |
|
|
228 | /* Set up replyinfo before we modify any of the buffers - this is used |
|
|
229 | * if we don't find a match. |
|
|
230 | */ |
|
|
231 | strcpy (bigbuf, "replyinfo "); |
|
|
232 | slen = strlen (bigbuf); |
|
|
233 | safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
|
|
234 | |
211 | |
235 | /* find the first space, make it null, and update the |
212 | /* find the first space, make it null, and update the |
236 | * params pointer. |
213 | * params pointer. |
237 | */ |
214 | */ |
238 | for (cp = buf; *cp != '\0'; cp++) |
215 | for (params = buf; *params; params++) |
239 | if (*cp == ' ') |
216 | if (*params == ' ') |
240 | { |
217 | { |
241 | *cp = '\0'; |
|
|
242 | params = cp + 1; |
218 | *params++ = 0; |
243 | break; |
219 | break; |
244 | } |
220 | } |
245 | |
221 | |
246 | if (!strcmp (buf, "image_info")) |
222 | if (!strcmp (buf, "image_info")) |
247 | send_image_info (ns, params); |
223 | send_image_info (ns, params); |
… | |
… | |
250 | else if (!strcmp (buf, "skill_info")) |
226 | else if (!strcmp (buf, "skill_info")) |
251 | send_skill_info (ns, params); |
227 | send_skill_info (ns, params); |
252 | else if (!strcmp (buf, "spell_paths")) |
228 | else if (!strcmp (buf, "spell_paths")) |
253 | send_spell_paths (ns, params); |
229 | send_spell_paths (ns, params); |
254 | else |
230 | else |
255 | ns->send_packet (bigbuf, len); |
231 | { |
|
|
232 | // undo tokenisation above and send replyinfo with the request unchanged |
|
|
233 | if (*params) |
|
|
234 | *--params = ' '; |
|
|
235 | |
|
|
236 | ns->send_packet_printf ("replyinfo %s", buf); |
|
|
237 | } |
256 | } |
238 | } |
257 | |
239 | |
258 | void |
240 | void |
259 | ExtCmd (char *buf, int len, player *pl) |
241 | ExtCmd (char *buf, int len, player *pl) |
260 | { |
242 | { |
… | |
… | |
263 | |
245 | |
264 | void |
246 | void |
265 | ExtiCmd (char *buf, int len, client *ns) |
247 | ExtiCmd (char *buf, int len, client *ns) |
266 | { |
248 | { |
267 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
249 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
|
|
250 | } |
|
|
251 | |
|
|
252 | void |
|
|
253 | client::mapinfo_queue_clear () |
|
|
254 | { |
|
|
255 | for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
|
|
256 | free (*i); |
|
|
257 | |
|
|
258 | mapinfo_queue.clear (); |
|
|
259 | } |
|
|
260 | |
|
|
261 | bool |
|
|
262 | client::mapinfo_try (char *buf) |
|
|
263 | { |
|
|
264 | char *token = buf; |
|
|
265 | buf += strlen (buf) + 9; |
|
|
266 | |
|
|
267 | // initial map and its origin |
|
|
268 | maptile *map = pl->ob->map; |
|
|
269 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
|
|
270 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
|
|
271 | int max_distance = 8; // limit maximum path length to something generous |
|
|
272 | |
|
|
273 | while (*buf && map && max_distance) |
|
|
274 | { |
|
|
275 | int dir = *buf++ - '1'; |
|
|
276 | |
|
|
277 | if (dir >= 0 && dir <= 3) |
|
|
278 | { |
|
|
279 | if (!map->tile_path [dir]) |
|
|
280 | map = 0; |
|
|
281 | else if (map->tile_available (dir)) |
|
|
282 | { |
|
|
283 | maptile *neigh = map->tile_map [dir]; |
|
|
284 | |
|
|
285 | switch (dir) |
|
|
286 | { |
|
|
287 | case 0: mapy -= neigh->height; break; |
|
|
288 | case 2: mapy += map ->height; break; |
|
|
289 | case 3: mapx -= neigh->width ; break; |
|
|
290 | case 1: mapx += map ->width ; break; |
|
|
291 | } |
|
|
292 | |
|
|
293 | map = neigh; |
|
|
294 | --max_distance; |
|
|
295 | } |
|
|
296 | else |
|
|
297 | return 0; |
|
|
298 | } |
|
|
299 | else |
|
|
300 | max_distance = 0; |
|
|
301 | } |
|
|
302 | |
|
|
303 | if (!max_distance) |
|
|
304 | send_packet_printf ("mapinfo %s error", token); |
|
|
305 | else if (!map || !map->path[0]) |
|
|
306 | send_packet_printf ("mapinfo %s nomap", token); |
|
|
307 | else |
|
|
308 | { |
|
|
309 | int flags = 0; |
|
|
310 | |
|
|
311 | if (map->tile_path[0]) flags |= 1; |
|
|
312 | if (map->tile_path[1]) flags |= 2; |
|
|
313 | if (map->tile_path[2]) flags |= 4; |
|
|
314 | if (map->tile_path[3]) flags |= 8; |
|
|
315 | |
|
|
316 | send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
317 | } |
|
|
318 | |
|
|
319 | return 1; |
|
|
320 | } |
|
|
321 | |
|
|
322 | void |
|
|
323 | client::mapinfo_queue_run () |
|
|
324 | { |
|
|
325 | if (mapinfo_queue.empty () || !pl) |
|
|
326 | return; |
|
|
327 | |
|
|
328 | for (int i = 0; i < mapinfo_queue.size (); ++i) |
|
|
329 | if (mapinfo_try (mapinfo_queue [i])) |
|
|
330 | { |
|
|
331 | free (mapinfo_queue [i]); |
|
|
332 | mapinfo_queue.erase (i); |
|
|
333 | } |
|
|
334 | else |
|
|
335 | ++i; |
268 | } |
336 | } |
269 | |
337 | |
270 | void |
338 | void |
271 | MapInfoCmd (char *buf, int len, player *pl) |
339 | MapInfoCmd (char *buf, int len, player *pl) |
272 | { |
340 | { |
273 | // <mapinfo tag spatial tile-path |
341 | // <mapinfo tag spatial tile-path |
274 | // >mapinfo tag spatial flags x y w h hash |
342 | // >mapinfo tag spatial flags x y w h hash |
275 | |
343 | |
276 | char bigbuf[MAX_BUF], *token; |
|
|
277 | |
|
|
278 | token = buf; |
344 | char *token = buf; |
279 | // copy token |
345 | |
280 | if (!(buf = strchr (buf, ' '))) |
346 | if (!(buf = strchr (buf, ' '))) |
281 | return; |
347 | return; |
282 | |
348 | |
283 | *buf++ = 0; |
|
|
284 | |
|
|
285 | if (!strncmp (buf, "spatial ", 8)) |
349 | if (!strncmp (buf, " spatial ", 9)) |
286 | { |
350 | { |
287 | buf += 8; |
351 | char *copy = strdup (token); |
|
|
352 | copy [buf - token] = 0; |
288 | |
353 | |
289 | // initial map and its origin |
354 | #if 0 |
290 | maptile *map = pl->ob->map; |
355 | // this makes only sense when we flush the buffer immediately |
291 | sint16 dx, dy; |
356 | if (pl->ns->mapinfo_try (copy)) |
292 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
357 | free (copy); |
293 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
|
|
294 | int max_distance = 8; // limit maximum path length to something generous |
|
|
295 | |
|
|
296 | while (*buf && map && max_distance) |
|
|
297 | { |
|
|
298 | int dir = *buf++; |
|
|
299 | |
|
|
300 | switch (dir) |
|
|
301 | { |
|
|
302 | case '1': |
|
|
303 | dx = 0; |
|
|
304 | dy = -1; |
|
|
305 | map = map->xy_find (dx, dy); |
|
|
306 | map && (mapy -= map->height); |
|
|
307 | break; |
|
|
308 | case '2': |
|
|
309 | mapx += map->width; |
|
|
310 | dx = map->width; |
|
|
311 | dy = 0; |
|
|
312 | map = map->xy_find (dx, dy); |
|
|
313 | break; |
|
|
314 | case '3': |
|
|
315 | mapy += map->height; |
|
|
316 | dx = 0; |
|
|
317 | dy = map->height; |
|
|
318 | map = map->xy_find (dx, dy); |
|
|
319 | break; |
|
|
320 | case '4': |
|
|
321 | dx = -1; |
|
|
322 | dy = 0; |
|
|
323 | map = map->xy_find (dx, dy); |
|
|
324 | map && (mapx -= map->width); |
|
|
325 | break; |
|
|
326 | } |
|
|
327 | |
|
|
328 | --max_distance; |
|
|
329 | } |
|
|
330 | |
|
|
331 | if (!max_distance) |
|
|
332 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
|
|
333 | else if (map && map->path[0]) |
|
|
334 | { |
|
|
335 | int flags = 0; |
|
|
336 | |
|
|
337 | if (map->tile_path[0]) |
|
|
338 | flags |= 1; |
|
|
339 | if (map->tile_path[1]) |
|
|
340 | flags |= 2; |
|
|
341 | if (map->tile_path[2]) |
|
|
342 | flags |= 4; |
|
|
343 | if (map->tile_path[3]) |
|
|
344 | flags |= 8; |
|
|
345 | |
|
|
346 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
347 | } |
|
|
348 | else |
358 | else |
349 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
359 | #endif |
|
|
360 | pl->ns->mapinfo_queue.push_back (copy); |
350 | } |
361 | } |
351 | else |
362 | else |
352 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
363 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
353 | |
|
|
354 | pl->ns->send_packet (bigbuf); |
|
|
355 | } |
364 | } |
356 | |
365 | |
357 | /** This is the Setup cmd */ |
366 | /** This is the Setup cmd */ |
358 | void |
367 | void |
359 | SetUp (char *buf, int len, client * ns) |
368 | SetUp (char *buf, int len, client * ns) |
… | |
… | |
488 | |
497 | |
489 | ns->send_packet (cmdback); |
498 | ns->send_packet (cmdback); |
490 | } |
499 | } |
491 | |
500 | |
492 | /** |
501 | /** |
493 | * client requested an image. send it rate-limited |
|
|
494 | * before flushing. |
|
|
495 | */ |
|
|
496 | void |
|
|
497 | AskFaceCmd (char *buf, int len, client *ns) |
|
|
498 | { |
|
|
499 | ns->askface.push_back (atoi (buf)); |
|
|
500 | } |
|
|
501 | |
|
|
502 | /** |
|
|
503 | * Tells client the picture it has to use |
|
|
504 | * to smooth a picture number given as argument. |
|
|
505 | */ |
|
|
506 | void |
|
|
507 | AskSmooth (char *buf, int len, client *ns) |
|
|
508 | { |
|
|
509 | ns->send_face (atoi (buf)); |
|
|
510 | ns->flush_fx (); |
|
|
511 | } |
|
|
512 | |
|
|
513 | /** |
|
|
514 | * This handles the general commands from the client (ie, north, fire, cast, |
502 | * This handles the general commands from the client (ie, north, fire, cast, |
515 | * etc.) |
503 | * etc.) |
516 | */ |
504 | */ |
517 | void |
505 | void |
518 | PlayerCmd (char *buf, int len, player *pl) |
506 | PlayerCmd (char *buf, int len, player *pl) |
… | |
… | |
539 | * commands. |
527 | * commands. |
540 | */ |
528 | */ |
541 | pl->count = 0; |
529 | pl->count = 0; |
542 | } |
530 | } |
543 | |
531 | |
544 | |
|
|
545 | /** |
532 | /** |
546 | * This handles the general commands from the client (ie, north, fire, cast, |
533 | * This handles the general commands from the client (ie, north, fire, cast, |
547 | * etc.). It is a lot like PlayerCmd above, but is called with the |
534 | * etc.). It is a lot like PlayerCmd above, but is called with the |
548 | * 'ncom' method which gives more information back to the client so it |
535 | * 'ncom' method which gives more information back to the client so it |
549 | * can throttle. |
536 | * can throttle. |
… | |
… | |
551 | void |
538 | void |
552 | NewPlayerCmd (char *buf, int len, player *pl) |
539 | NewPlayerCmd (char *buf, int len, player *pl) |
553 | { |
540 | { |
554 | if (len <= 6) |
541 | if (len <= 6) |
555 | { |
542 | { |
556 | LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
543 | LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len); |
557 | return; |
544 | return; |
558 | } |
545 | } |
559 | |
546 | |
560 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
547 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
561 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
548 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
… | |
… | |
618 | { |
605 | { |
619 | case ST_PLAYING: |
606 | case ST_PLAYING: |
620 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
607 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
621 | break; |
608 | break; |
622 | |
609 | |
623 | case ST_CHANGE_CLASS: |
|
|
624 | key_change_class (pl->ob, buf[0]); |
|
|
625 | break; |
|
|
626 | |
|
|
627 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
610 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
628 | receive_party_password (pl->ob, 13); |
611 | receive_party_password (pl->ob, 13); |
629 | break; |
612 | break; |
630 | |
613 | |
631 | default: |
614 | default: |
… | |
… | |
670 | |
653 | |
671 | cp = strchr (cp + 1, ' '); |
654 | cp = strchr (cp + 1, ' '); |
672 | |
655 | |
673 | if (cp) |
656 | if (cp) |
674 | { |
657 | { |
675 | assign (ns->version, cp + 1); |
658 | ns->version = cp + 1; |
676 | |
659 | |
677 | if (ns->sc_version < 1026) |
660 | if (ns->sc_version < 1026) |
678 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
661 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
679 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
662 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
680 | } |
663 | } |
… | |
… | |
745 | send_query (client *ns, uint8 flags, const char *text) |
728 | send_query (client *ns, uint8 flags, const char *text) |
746 | { |
729 | { |
747 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
730 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
748 | } |
731 | } |
749 | |
732 | |
|
|
733 | /** |
|
|
734 | * Get player's current range attack in obuf. |
|
|
735 | */ |
|
|
736 | static void |
|
|
737 | rangetostring (player *pl, char *obuf) |
|
|
738 | { |
|
|
739 | dynbuf_text buf; |
|
|
740 | |
|
|
741 | if (pl->ranged_ob) |
|
|
742 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
|
|
743 | |
|
|
744 | if (pl->combat_ob) |
|
|
745 | buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
|
|
746 | |
|
|
747 | #if 0 |
|
|
748 | //TODO: remove this when slot system is working, this is only for debugging |
|
|
749 | if (pl->ob->chosen_skill) |
|
|
750 | buf << " Skill*: " << pl->ob->chosen_skill->name; |
|
|
751 | #endif |
|
|
752 | |
|
|
753 | //TODO: maybe golem should become the current_weapon, quite simply? |
|
|
754 | if (pl->golem) |
|
|
755 | buf << " Golem*: " << pl->golem->name; |
|
|
756 | |
|
|
757 | buf << '\0'; |
|
|
758 | buf.linearise (obuf); |
|
|
759 | } |
|
|
760 | |
750 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
761 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
751 | Old = New; \ |
762 | Old = New; \ |
752 | sl << uint8 (Type) << uint64 (New); \ |
763 | sl << uint8 (Type) << uint64 (New); \ |
753 | } |
764 | } |
754 | |
765 | |
… | |
… | |
760 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
771 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
761 | Old = New; \ |
772 | Old = New; \ |
762 | sl << uint8 (Type) << uint16 (New); \ |
773 | sl << uint8 (Type) << uint16 (New); \ |
763 | } |
774 | } |
764 | |
775 | |
765 | #define AddIfFloat(Old,New,Type) if (Old != New) {\ |
776 | #define AddIfFloat(Old,New,Type,mult) if (Old != New) {\ |
766 | Old = New; \ |
777 | Old = New; \ |
767 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ |
778 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \ |
768 | } |
779 | } |
769 | |
780 | |
770 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
781 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
771 | free(Old); Old = strdup (New);\ |
782 | free(Old); Old = strdup (New);\ |
772 | sl << uint8 (Type) << data8 (New); \ |
783 | sl << uint8 (Type) << data8 (New); \ |
… | |
… | |
786 | |
797 | |
787 | client *ns = pl->ns; |
798 | client *ns = pl->ns; |
788 | if (!ns) |
799 | if (!ns) |
789 | return; |
800 | return; |
790 | |
801 | |
791 | object *ob = pl->ob; |
802 | object *ob = pl->observe; |
792 | if (!ob) |
803 | if (!ob) |
793 | return; |
804 | return; |
|
|
805 | |
|
|
806 | player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl; |
794 | |
807 | |
795 | packet sl ("stats"); |
808 | packet sl ("stats"); |
796 | |
809 | |
797 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
810 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
798 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
811 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
… | |
… | |
807 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
820 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
808 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
821 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
809 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
822 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
810 | |
823 | |
811 | for (int s = 0; s < NUM_SKILLS; s++) |
824 | for (int s = 0; s < NUM_SKILLS; s++) |
812 | if (object *skill = pl->last_skill_ob[s]) |
825 | if (object *skill = opl->last_skill_ob[s]) |
813 | if (skill->stats.exp != ns->last_skill_exp [s]) |
826 | if (skill->stats.exp != ns->last_skill_exp [s]) |
814 | { |
827 | { |
815 | ns->last_skill_exp [s] = skill->stats.exp; |
828 | ns->last_skill_exp [s] = skill->stats.exp; |
816 | |
829 | |
817 | /* Always send along the level if exp changes. This is only |
830 | /* Always send along the level if exp changes. This is only |
… | |
… | |
825 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
838 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
826 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
839 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
827 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
840 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
828 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
841 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
829 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
842 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
830 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); |
843 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK); |
831 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
844 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
832 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
845 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK); |
833 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
846 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
834 | |
847 | |
835 | flags = 0; |
848 | flags = 0; |
836 | |
849 | |
837 | if (pl->fire_on) |
850 | if (opl->fire_on) |
838 | flags |= SF_FIREON; |
851 | flags |= SF_FIREON; |
839 | |
852 | |
840 | if (pl->run_on) |
853 | if (opl->run_on) |
841 | flags |= SF_RUNON; |
854 | flags |= SF_RUNON; |
842 | |
855 | |
843 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
856 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
844 | |
857 | |
845 | if (ns->sc_version < 1025) |
858 | if (ns->sc_version < 1025) |
… | |
… | |
859 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
872 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
860 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
873 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
861 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
874 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
862 | } |
875 | } |
863 | |
876 | |
864 | rangetostring (ob, buf); /* we want use the new fire & run system in new client */ |
877 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
865 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
878 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
866 | set_title (ob, buf); |
879 | set_title (ob, buf); |
867 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
880 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
868 | |
881 | |
869 | /* Only send it away if we have some actual data */ |
882 | /* Only send it away if we have some actual data */ |
… | |
… | |
951 | |
964 | |
952 | if (!ns.faces_sent[face_num]) |
965 | if (!ns.faces_sent[face_num]) |
953 | if (ob) |
966 | if (ob) |
954 | ns.send_faces (ob); |
967 | ns.send_faces (ob); |
955 | else |
968 | else |
956 | ns.send_face (face_num); |
969 | ns.send_face (face_num, 10); |
957 | |
970 | |
958 | sl << uint16 (face_num); |
971 | sl << uint16 (face_num); |
959 | return 1; |
972 | return 1; |
960 | } |
973 | } |
961 | |
974 | |
… | |
… | |
1003 | { |
1016 | { |
1004 | prefetch_surrounding_maps (op->map, 3); |
1017 | prefetch_surrounding_maps (op->map, 3); |
1005 | } |
1018 | } |
1006 | |
1019 | |
1007 | /** |
1020 | /** |
1008 | * This function uses the new map1 protocol command to send the map |
1021 | * Draws client map. |
1009 | * to the client. It is necessary because the old map command supports |
|
|
1010 | * a maximum map size of 15x15. |
|
|
1011 | * This function is much simpler than the old one. This is because |
|
|
1012 | * the old function optimized to send as few face identifiers as possible, |
|
|
1013 | * at the expense of sending more coordinate location (coordinates were |
|
|
1014 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
1015 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
1016 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
1017 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
1018 | * of what we send, see the doc/Protocol file. |
|
|
1019 | * I will describe internally what we do: |
|
|
1020 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
1021 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
1022 | * maximum viewable size (As set in config.h). |
|
|
1023 | * in the cells, there are faces and a count value. |
|
|
1024 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
1025 | * is not viewable. |
|
|
1026 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
1027 | * look like. |
|
|
1028 | */ |
1022 | */ |
1029 | void |
1023 | void |
1030 | draw_client_map1 (object *pl) |
1024 | draw_client_map (player *pl) |
1031 | { |
1025 | { |
|
|
1026 | object *ob = pl->observe; |
|
|
1027 | if (!ob->active) |
|
|
1028 | return; |
|
|
1029 | |
|
|
1030 | maptile *plmap = ob->map; |
|
|
1031 | |
|
|
1032 | /* If player is just joining the game, he isn't here yet, so the map |
|
|
1033 | * can get swapped out. If so, don't try to send them a map. All will |
|
|
1034 | * be OK once they really log in. |
|
|
1035 | */ |
|
|
1036 | if (!plmap || plmap->in_memory != MAP_IN_MEMORY) |
|
|
1037 | return; |
|
|
1038 | |
1032 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1039 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1033 | sint16 nx, ny; |
|
|
1034 | int estartlen, eoldlen; |
1040 | int estartlen, eoldlen; |
1035 | uint8 eentrysize; |
1041 | uint8 eentrysize; |
1036 | uint16 ewhatstart, ewhatflag; |
1042 | uint16 ewhatstart, ewhatflag; |
1037 | uint8 extendedinfos; |
1043 | uint8 extendedinfos; |
1038 | maptile *m; |
|
|
1039 | |
1044 | |
1040 | client &socket = *pl->contr->ns; |
|
|
1041 | |
|
|
1042 | if (!pl->active) |
|
|
1043 | return; |
|
|
1044 | |
|
|
1045 | check_map_change (pl->contr); |
1045 | check_map_change (pl); |
1046 | prefetch_surrounding_maps (pl); |
1046 | prefetch_surrounding_maps (pl->ob); |
|
|
1047 | |
|
|
1048 | /* do LOS after calls to update_position */ |
|
|
1049 | if (ob != pl->ob) |
|
|
1050 | clear_los (pl); |
|
|
1051 | else if (pl->do_los) |
|
|
1052 | { |
|
|
1053 | update_los (ob); |
|
|
1054 | pl->do_los = 0; |
|
|
1055 | } |
|
|
1056 | |
|
|
1057 | /** |
|
|
1058 | * This function uses the new map1 protocol command to send the map |
|
|
1059 | * to the client. It is necessary because the old map command supports |
|
|
1060 | * a maximum map size of 15x15. |
|
|
1061 | * This function is much simpler than the old one. This is because |
|
|
1062 | * the old function optimized to send as few face identifiers as possible, |
|
|
1063 | * at the expense of sending more coordinate location (coordinates were |
|
|
1064 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
1065 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
1066 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
1067 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
1068 | * of what we send, see the doc/Protocol file. |
|
|
1069 | * I will describe internally what we do: |
|
|
1070 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
1071 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
1072 | * maximum viewable size (As set in config.h). |
|
|
1073 | * in the cells, there are faces and a count value. |
|
|
1074 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
1075 | * is not viewable. |
|
|
1076 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
1077 | * look like. |
|
|
1078 | */ |
|
|
1079 | |
|
|
1080 | client &socket = *pl->ns; |
1047 | |
1081 | |
1048 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1082 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1049 | packet esl; |
1083 | packet esl; |
1050 | |
1084 | |
1051 | startlen = sl.length (); |
1085 | startlen = sl.length (); |
… | |
… | |
1075 | ay = 0; |
1109 | ay = 0; |
1076 | |
1110 | |
1077 | /* We could do this logic as conditionals in the if statement, |
1111 | /* We could do this logic as conditionals in the if statement, |
1078 | * but that started to get a bit messy to look at. |
1112 | * but that started to get a bit messy to look at. |
1079 | */ |
1113 | */ |
1080 | max_x = pl->x + (socket.mapx + 1) / 2; |
1114 | max_x = ob->x + (socket.mapx + 1) / 2; |
1081 | max_y = pl->y + (socket.mapy + 1) / 2; |
1115 | max_y = ob->y + (socket.mapy + 1) / 2; |
1082 | |
1116 | |
1083 | maptile *plmap = pl->map; |
|
|
1084 | |
|
|
1085 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1117 | for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++) |
1086 | { |
1118 | { |
|
|
1119 | sint16 nx, ny; |
|
|
1120 | maptile *m = 0; |
|
|
1121 | |
1087 | ax = 0; |
1122 | ax = 0; |
1088 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1123 | for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++) |
1089 | { |
1124 | { |
|
|
1125 | // check to see if we can simply go one right quickly |
|
|
1126 | ++nx; |
|
|
1127 | if (m && nx >= m->width) |
|
|
1128 | m = 0; |
|
|
1129 | |
|
|
1130 | if (!m) |
|
|
1131 | { |
|
|
1132 | nx = x; ny = y; m = plmap; |
|
|
1133 | |
|
|
1134 | if (!xy_normalise (m, nx, ny)) |
|
|
1135 | m = 0; |
|
|
1136 | } |
|
|
1137 | |
1090 | int emask, mask; |
1138 | int emask, mask; |
1091 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1139 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1092 | |
1140 | |
1093 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1141 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1094 | |
1142 | |
1095 | /* If the coordinates are not valid, or it is too dark to see, |
1143 | /* If the coordinates are not valid, or it is too dark to see, |
1096 | * we tell the client as such |
1144 | * we tell the client as such |
1097 | */ |
1145 | */ |
1098 | nx = x; |
|
|
1099 | ny = y; |
|
|
1100 | m = get_map_from_coord (plmap, &nx, &ny); |
|
|
1101 | |
|
|
1102 | if (!m) |
1146 | if (!m) |
1103 | { |
1147 | { |
1104 | /* space is out of map. Update space and clear values |
1148 | /* space is out of map. Update space and clear values |
1105 | * if this hasn't already been done. If the space is out |
1149 | * if this hasn't already been done. If the space is out |
1106 | * of the map, it shouldn't have a head |
1150 | * of the map, it shouldn't have a head |
… | |
… | |
1114 | continue; |
1158 | continue; |
1115 | } |
1159 | } |
1116 | |
1160 | |
1117 | m->touch (); |
1161 | m->touch (); |
1118 | |
1162 | |
1119 | int d = pl->contr->blocked_los[ax][ay]; |
1163 | int d = pl->blocked_los[ax][ay]; |
1120 | |
1164 | |
1121 | if (d > 3) |
1165 | if (d > 3) |
1122 | { |
1166 | { |
1123 | |
1167 | |
1124 | int need_send = 0, count; |
1168 | int need_send = 0, count; |
… | |
… | |
1187 | } |
1231 | } |
1188 | |
1232 | |
1189 | lastcell.count = d; |
1233 | lastcell.count = d; |
1190 | |
1234 | |
1191 | mapspace &ms = m->at (nx, ny); |
1235 | mapspace &ms = m->at (nx, ny); |
|
|
1236 | ms.update (); |
1192 | |
1237 | |
1193 | if (socket.extmap) |
1238 | if (socket.extmap) |
1194 | { |
1239 | { |
1195 | uint8 stat_hp = 0; |
1240 | uint8 stat_hp = 0; |
1196 | uint8 stat_width = 0; |
1241 | uint8 stat_width = 0; |
1197 | uint8 flags = 0; |
1242 | uint8 flags = 0; |
1198 | UUID player = 0; |
1243 | tag_t player = 0; |
1199 | |
1244 | |
1200 | // send hp information, if applicable |
1245 | // send hp information, if applicable |
1201 | if (object *op = ms.faces_obj [0]) |
1246 | if (object *op = ms.faces_obj [0]) |
1202 | { |
1247 | { |
1203 | if (op->head || op->invisible) |
1248 | if (op->head || op->invisible) |
… | |
… | |
1206 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
1251 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
1207 | { |
1252 | { |
1208 | if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
1253 | if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
1209 | { |
1254 | { |
1210 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1255 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1211 | stat_width = op->arch->tail_x; |
1256 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
1212 | } |
1257 | } |
1213 | } |
1258 | } |
1214 | |
1259 | |
1215 | if (op->msg && op->msg[0] == '@') |
1260 | if (op->msg && op->msg[0] == '@') |
1216 | flags |= 1; |
1261 | flags |= 1; |
1217 | |
1262 | |
1218 | if (op->type == PLAYER && op != pl) |
1263 | if (op->type == PLAYER && op != ob) |
1219 | player = op->count; |
1264 | player = op->count; |
1220 | } |
1265 | } |
1221 | |
1266 | |
1222 | if (lastcell.stat_hp != stat_hp) |
1267 | if (lastcell.stat_hp != stat_hp) |
1223 | { |
1268 | { |
… | |
… | |
1244 | |
1289 | |
1245 | mask |= 0x8; |
1290 | mask |= 0x8; |
1246 | *last_ext |= 0x80; |
1291 | *last_ext |= 0x80; |
1247 | last_ext = &sl[sl.length ()]; |
1292 | last_ext = &sl[sl.length ()]; |
1248 | |
1293 | |
1249 | sl << uint8 (0x47) << uint8 (8) << (uint64)player; |
1294 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1250 | } |
1295 | } |
1251 | |
1296 | |
1252 | if (lastcell.flags != flags) |
1297 | if (lastcell.flags != flags) |
1253 | { |
1298 | { |
1254 | lastcell.flags = flags; |
1299 | lastcell.flags = flags; |
… | |
… | |
1267 | |
1312 | |
1268 | /* Middle face */ |
1313 | /* Middle face */ |
1269 | if (update_space (sl, socket, ms, lastcell, 1)) |
1314 | if (update_space (sl, socket, ms, lastcell, 1)) |
1270 | mask |= 0x2; |
1315 | mask |= 0x2; |
1271 | |
1316 | |
1272 | if (ms.player () == pl |
1317 | if (ms.player () == ob |
1273 | && (pl->invisible & (pl->invisible < 50 ? 1 : 7))) |
1318 | && (ob->invisible & (ob->invisible < 50 ? 1 : 7))) |
1274 | { |
1319 | { |
1275 | // force player to be visible to himself if invisible |
1320 | // force player to be visible to himself if invisible |
1276 | if (lastcell.faces[0] != pl->face) |
1321 | if (lastcell.faces[0] != ob->face) |
1277 | { |
1322 | { |
1278 | lastcell.faces[0] = pl->face; |
1323 | lastcell.faces[0] = ob->face; |
1279 | |
1324 | |
1280 | mask |= 0x1; |
1325 | mask |= 0x1; |
1281 | sl << uint16 (pl->face); |
1326 | sl << uint16 (ob->face); |
1282 | |
1327 | |
1283 | socket.send_faces (pl); |
1328 | socket.send_faces (ob); |
1284 | } |
1329 | } |
1285 | } |
1330 | } |
1286 | /* Top face */ |
1331 | /* Top face */ |
1287 | else if (update_space (sl, socket, ms, lastcell, 0)) |
1332 | else if (update_space (sl, socket, ms, lastcell, 0)) |
1288 | mask |= 0x1; |
1333 | mask |= 0x1; |
1289 | |
|
|
1290 | |
1334 | |
1291 | /* Check to see if we are in fact sending anything for this |
1335 | /* Check to see if we are in fact sending anything for this |
1292 | * space by checking the mask. If so, update the mask. |
1336 | * space by checking the mask. If so, update the mask. |
1293 | * if not, reset the len to that from before adding the mask |
1337 | * if not, reset the len to that from before adding the mask |
1294 | * value, so we don't send those bits. |
1338 | * value, so we don't send those bits. |
… | |
… | |
1353 | socket.send_packet (sl); |
1397 | socket.send_packet (sl); |
1354 | socket.sent_scroll = 0; |
1398 | socket.sent_scroll = 0; |
1355 | } |
1399 | } |
1356 | } |
1400 | } |
1357 | |
1401 | |
1358 | /** |
|
|
1359 | * Draws client map. |
|
|
1360 | */ |
|
|
1361 | void |
|
|
1362 | draw_client_map (object *pl) |
|
|
1363 | { |
|
|
1364 | int i, j; |
|
|
1365 | sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */ |
|
|
1366 | int mflags; |
|
|
1367 | struct Map newmap; |
|
|
1368 | maptile *m, *pm; |
|
|
1369 | |
|
|
1370 | if (pl->type != PLAYER) |
|
|
1371 | { |
|
|
1372 | LOG (llevError, "draw_client_map called with non player/non eric-server\n"); |
|
|
1373 | return; |
|
|
1374 | } |
|
|
1375 | |
|
|
1376 | pm = pl->map; |
|
|
1377 | |
|
|
1378 | /* If player is just joining the game, he isn't here yet, so the map |
|
|
1379 | * can get swapped out. If so, don't try to send them a map. All will |
|
|
1380 | * be OK once they really log in. |
|
|
1381 | */ |
|
|
1382 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
|
|
1383 | return; |
|
|
1384 | |
|
|
1385 | memset (&newmap, 0, sizeof (struct Map)); |
|
|
1386 | |
|
|
1387 | for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) |
|
|
1388 | for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) |
|
|
1389 | { |
|
|
1390 | ax = i; |
|
|
1391 | ay = j; |
|
|
1392 | m = pm; |
|
|
1393 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
|
|
1394 | |
|
|
1395 | if (mflags & P_OUT_OF_MAP) |
|
|
1396 | continue; |
|
|
1397 | |
|
|
1398 | /* If a map is visible to the player, we don't want to swap it out |
|
|
1399 | * just to reload it. This should really call something like |
|
|
1400 | * swap_map, but this is much more efficient and 'good enough' |
|
|
1401 | */ |
|
|
1402 | if (mflags & P_NEW_MAP) |
|
|
1403 | m->timeout = 50; |
|
|
1404 | } |
|
|
1405 | |
|
|
1406 | /* do LOS after calls to update_position */ |
|
|
1407 | if (pl->contr->do_los) |
|
|
1408 | { |
|
|
1409 | update_los (pl); |
|
|
1410 | pl->contr->do_los = 0; |
|
|
1411 | } |
|
|
1412 | |
|
|
1413 | /* Big maps need a different drawing mechanism to work */ |
|
|
1414 | draw_client_map1 (pl); |
|
|
1415 | } |
|
|
1416 | |
|
|
1417 | |
|
|
1418 | /*****************************************************************************/ |
1402 | /*****************************************************************************/ |
1419 | |
|
|
1420 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
1403 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
1421 | |
|
|
1422 | /* a player. Of course, the client need to know the command to be able to */ |
1404 | /* a player. Of course, the client need to know the command to be able to */ |
1423 | |
|
|
1424 | /* manage it ! */ |
1405 | /* manage it ! */ |
1425 | |
|
|
1426 | /*****************************************************************************/ |
1406 | /*****************************************************************************/ |
1427 | void |
1407 | void |
1428 | send_plugin_custom_message (object *pl, char *buf) |
1408 | send_plugin_custom_message (object *pl, char *buf) |
1429 | { |
1409 | { |
1430 | pl->contr->ns->send_packet (buf); |
1410 | pl->contr->ns->send_packet (buf); |
… | |
… | |
1441 | sl << "replyinfo skill_info\n"; |
1421 | sl << "replyinfo skill_info\n"; |
1442 | |
1422 | |
1443 | for (int i = 1; i < NUM_SKILLS; i++) |
1423 | for (int i = 1; i < NUM_SKILLS; i++) |
1444 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
1424 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
1445 | |
1425 | |
1446 | if (sl.length () >= MAXSOCKBUF) |
1426 | if (sl.length () > MAXSOCKBUF) |
1447 | { |
1427 | { |
1448 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1428 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1449 | fatal (0); |
1429 | fatal (0); |
1450 | } |
1430 | } |
1451 | |
1431 | |
… | |
… | |
1464 | sl << "replyinfo spell_paths\n"; |
1444 | sl << "replyinfo spell_paths\n"; |
1465 | |
1445 | |
1466 | for (int i = 0; i < NRSPELLPATHS; i++) |
1446 | for (int i = 0; i < NRSPELLPATHS; i++) |
1467 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1447 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1468 | |
1448 | |
1469 | if (sl.length () >= MAXSOCKBUF) |
1449 | if (sl.length () > MAXSOCKBUF) |
1470 | { |
1450 | { |
1471 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1451 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1472 | fatal (0); |
1452 | fatal (0); |
1473 | } |
1453 | } |
1474 | |
1454 | |
… | |
… | |
1582 | if (!spell->face) |
1562 | if (!spell->face) |
1583 | { |
1563 | { |
1584 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1564 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1585 | spell->face = face_find ("burnout.x11", blank_face); |
1565 | spell->face = face_find ("burnout.x11", blank_face); |
1586 | } |
1566 | } |
|
|
1567 | |
|
|
1568 | pl->ns->send_face (spell->face); |
1587 | |
1569 | |
1588 | /* send the current values */ |
1570 | /* send the current values */ |
1589 | sl << uint32 (spell->count) |
1571 | sl << uint32 (spell->count) |
1590 | << uint16 (spell->level) |
1572 | << uint16 (spell->level) |
1591 | << uint16 (spell->casting_time) |
1573 | << uint16 (spell->casting_time) |
… | |
… | |
1627 | * bytes and 3 strings (because that is the spec) so we need to |
1609 | * bytes and 3 strings (because that is the spec) so we need to |
1628 | * check that the length of those 3 strings, plus the 23 bytes, |
1610 | * check that the length of those 3 strings, plus the 23 bytes, |
1629 | * won't take us over the length limit for the socket, if it does, |
1611 | * won't take us over the length limit for the socket, if it does, |
1630 | * we need to send what we already have, and restart packet formation |
1612 | * we need to send what we already have, and restart packet formation |
1631 | */ |
1613 | */ |
|
|
1614 | if (spell->type != SPELL) |
|
|
1615 | continue; |
|
|
1616 | |
1632 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1617 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1633 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1618 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1634 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1619 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1635 | * like it will fix this |
1620 | * like it will fix this |
1636 | */ |
1621 | */ |
1637 | if (spell->type != SPELL) |
|
|
1638 | continue; |
|
|
1639 | |
|
|
1640 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1622 | if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1641 | { |
1623 | { |
|
|
1624 | pl->ns->flush_fx (); |
1642 | pl->ns->send_packet (sl); |
1625 | pl->ns->send_packet (sl); |
1643 | |
1626 | |
1644 | sl.reset (); |
1627 | sl.reset (); |
1645 | sl << "addspell "; |
1628 | sl << "addspell "; |
1646 | } |
1629 | } |
… | |
… | |
1654 | return; |
1637 | return; |
1655 | } |
1638 | } |
1656 | else |
1639 | else |
1657 | append_spell (pl, sl, spell); |
1640 | append_spell (pl, sl, spell); |
1658 | |
1641 | |
1659 | if (sl.length () >= MAXSOCKBUF) |
1642 | if (sl.length () > MAXSOCKBUF) |
1660 | { |
1643 | { |
1661 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1644 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1662 | fatal (0); |
1645 | fatal (0); |
1663 | } |
1646 | } |
1664 | |
1647 | |
1665 | /* finally, we can send the packet */ |
1648 | /* finally, we can send the packet */ |
|
|
1649 | pl->ns->flush_fx (); |
1666 | pl->ns->send_packet (sl); |
1650 | pl->ns->send_packet (sl); |
1667 | } |
1651 | } |
1668 | |
1652 | |