1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra 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 <support@deliantra.net> |
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) |
140 | pl->ns->send_packet ("newmap"); |
141 | pl->ns->send_packet ("newmap"); |
141 | |
142 | |
142 | pl->ns->floorbox_reset (); |
143 | pl->ns->floorbox_reset (); |
|
|
144 | } |
|
|
145 | |
|
|
146 | static void |
|
|
147 | send_map_info (player *pl) |
|
|
148 | { |
|
|
149 | client &socket = *pl->ns; |
|
|
150 | object *ob = pl->observe; |
|
|
151 | |
|
|
152 | if (socket.mapinfocmd) |
|
|
153 | { |
|
|
154 | if (ob->map && ob->map->path[0]) |
|
|
155 | { |
|
|
156 | int flags = 0; |
|
|
157 | |
|
|
158 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
159 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
160 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
161 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
162 | |
|
|
163 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
164 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
165 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
166 | } |
|
|
167 | else |
|
|
168 | socket.send_packet ("mapinfo current"); |
|
|
169 | } |
143 | } |
170 | } |
144 | |
171 | |
145 | /** check for map/region change and send new map data */ |
172 | /** check for map/region change and send new map data */ |
146 | static void |
173 | static void |
147 | check_map_change (player *pl) |
174 | check_map_change (player *pl) |
148 | { |
175 | { |
149 | client &socket = *pl->ns; |
176 | client &socket = *pl->ns; |
150 | object *ob = pl->ob; |
177 | object *ob = pl->observe; |
151 | char buf[MAX_BUF]; /* eauugggh */ |
178 | |
|
|
179 | region *reg = ob->region (); |
|
|
180 | if (socket.current_region != reg) |
|
|
181 | { |
|
|
182 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
|
|
183 | socket.current_region = reg; |
|
|
184 | } |
|
|
185 | |
|
|
186 | // first try to aovid a full newmap on tiled map scrolls |
|
|
187 | if (socket.current_map != ob->map && !socket.force_newmap) |
|
|
188 | { |
|
|
189 | rv_vector rv; |
|
|
190 | |
|
|
191 | get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0); |
|
|
192 | |
|
|
193 | // manhattan distance is very handy here |
|
|
194 | if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient |
|
|
195 | { |
|
|
196 | socket.current_map = ob->map; |
|
|
197 | socket.current_x = ob->x; |
|
|
198 | socket.current_y = ob->y; |
|
|
199 | |
|
|
200 | socket_map_scroll (&socket, rv.distance_x, rv.distance_y); |
|
|
201 | socket.floorbox_reset (); |
|
|
202 | send_map_info (pl); |
|
|
203 | } |
|
|
204 | } |
152 | |
205 | |
153 | if (socket.current_map != ob->map || socket.force_newmap) |
206 | if (socket.current_map != ob->map || socket.force_newmap) |
154 | { |
207 | { |
155 | clear_map (pl); |
208 | clear_map (pl); |
156 | socket.current_map = ob->map; |
209 | socket.current_map = ob->map; |
157 | |
210 | send_map_info (pl); |
158 | if (socket.mapinfocmd) |
|
|
159 | { |
|
|
160 | if (ob->map && ob->map->path[0]) |
|
|
161 | { |
|
|
162 | int flags = 0; |
|
|
163 | |
|
|
164 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
165 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
166 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
167 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
168 | |
|
|
169 | snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
|
|
170 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path); |
|
|
171 | } |
|
|
172 | else |
|
|
173 | snprintf (buf, MAX_BUF, "mapinfo current"); |
|
|
174 | |
|
|
175 | socket.send_packet (buf); |
|
|
176 | } |
|
|
177 | } |
211 | } |
178 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
212 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
179 | { |
213 | { |
180 | int dx = ob->x - socket.current_x; |
214 | int dx = ob->x - socket.current_x; |
181 | int dy = ob->y - socket.current_y; |
215 | int dy = ob->y - socket.current_y; |
… | |
… | |
189 | } |
223 | } |
190 | } |
224 | } |
191 | |
225 | |
192 | socket.current_x = ob->x; |
226 | socket.current_x = ob->x; |
193 | socket.current_y = ob->y; |
227 | 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 | } |
|
|
201 | } |
228 | } |
202 | |
229 | |
203 | /** |
230 | /** |
204 | * RequestInfo is sort of a meta command. There is some specific |
231 | * RequestInfo is sort of a meta command. There is some specific |
205 | * request of information, but we call other functions to provide |
232 | * request of information, but we call other functions to provide |
206 | * that information. |
233 | * that information. |
207 | */ |
234 | */ |
208 | void |
235 | void |
209 | RequestInfo (char *buf, int len, client * ns) |
236 | RequestInfo (char *buf, int len, client *ns) |
210 | { |
237 | { |
211 | char *params = NULL, *cp; |
238 | char *params; |
212 | |
|
|
213 | /* No match */ |
|
|
214 | char bigbuf[MAX_BUF]; |
|
|
215 | int slen; |
|
|
216 | |
|
|
217 | /* Set up replyinfo before we modify any of the buffers - this is used |
|
|
218 | * if we don't find a match. |
|
|
219 | */ |
|
|
220 | strcpy (bigbuf, "replyinfo "); |
|
|
221 | slen = strlen (bigbuf); |
|
|
222 | safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
|
|
223 | |
239 | |
224 | /* find the first space, make it null, and update the |
240 | /* find the first space, make it null, and update the |
225 | * params pointer. |
241 | * params pointer. |
226 | */ |
242 | */ |
227 | for (cp = buf; *cp != '\0'; cp++) |
243 | for (params = buf; *params; params++) |
228 | if (*cp == ' ') |
244 | if (*params == ' ') |
229 | { |
245 | { |
230 | *cp = '\0'; |
|
|
231 | params = cp + 1; |
246 | *params++ = 0; |
232 | break; |
247 | break; |
233 | } |
248 | } |
234 | |
249 | |
235 | if (!strcmp (buf, "image_info")) |
250 | if (!strcmp (buf, "image_info")) |
236 | send_image_info (ns, params); |
251 | send_image_info (ns, params); |
… | |
… | |
239 | else if (!strcmp (buf, "skill_info")) |
254 | else if (!strcmp (buf, "skill_info")) |
240 | send_skill_info (ns, params); |
255 | send_skill_info (ns, params); |
241 | else if (!strcmp (buf, "spell_paths")) |
256 | else if (!strcmp (buf, "spell_paths")) |
242 | send_spell_paths (ns, params); |
257 | send_spell_paths (ns, params); |
243 | else |
258 | else |
244 | ns->send_packet (bigbuf, len); |
259 | { |
|
|
260 | // undo tokenisation above and send replyinfo with the request unchanged |
|
|
261 | if (*params) |
|
|
262 | *--params = ' '; |
|
|
263 | |
|
|
264 | ns->send_packet_printf ("replyinfo %s", buf); |
|
|
265 | } |
245 | } |
266 | } |
246 | |
267 | |
247 | void |
268 | void |
248 | ExtCmd (char *buf, int len, player *pl) |
269 | ExtCmd (char *buf, int len, player *pl) |
249 | { |
270 | { |
… | |
… | |
252 | |
273 | |
253 | void |
274 | void |
254 | ExtiCmd (char *buf, int len, client *ns) |
275 | ExtiCmd (char *buf, int len, client *ns) |
255 | { |
276 | { |
256 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
277 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
|
|
278 | } |
|
|
279 | |
|
|
280 | void |
|
|
281 | client::mapinfo_queue_clear () |
|
|
282 | { |
|
|
283 | for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
|
|
284 | free (*i); |
|
|
285 | |
|
|
286 | mapinfo_queue.clear (); |
|
|
287 | } |
|
|
288 | |
|
|
289 | bool |
|
|
290 | client::mapinfo_try (char *buf) |
|
|
291 | { |
|
|
292 | char *token = buf; |
|
|
293 | buf += strlen (buf) + 9; |
|
|
294 | |
|
|
295 | // initial map and its origin |
|
|
296 | maptile *map = pl->observe->map; |
|
|
297 | int mapx = pl->ns->mapx / 2 - pl->observe->x; |
|
|
298 | int mapy = pl->ns->mapy / 2 - pl->observe->y; |
|
|
299 | int max_distance = 8; // limit maximum path length to something generous |
|
|
300 | |
|
|
301 | while (*buf && map && max_distance) |
|
|
302 | { |
|
|
303 | int dir = *buf++ - '1'; |
|
|
304 | |
|
|
305 | if (dir >= 0 && dir <= 3) |
|
|
306 | { |
|
|
307 | if (!map->tile_path [dir]) |
|
|
308 | map = 0; |
|
|
309 | else if (map->tile_available (dir, false)) |
|
|
310 | { |
|
|
311 | maptile *neigh = map->tile_map [dir]; |
|
|
312 | |
|
|
313 | switch (dir) |
|
|
314 | { |
|
|
315 | case 0: mapy -= neigh->height; break; |
|
|
316 | case 2: mapy += map ->height; break; |
|
|
317 | case 3: mapx -= neigh->width ; break; |
|
|
318 | case 1: mapx += map ->width ; break; |
|
|
319 | } |
|
|
320 | |
|
|
321 | map = neigh; |
|
|
322 | --max_distance; |
|
|
323 | } |
|
|
324 | else |
|
|
325 | return 0; |
|
|
326 | } |
|
|
327 | else |
|
|
328 | max_distance = 0; |
|
|
329 | } |
|
|
330 | |
|
|
331 | if (!max_distance) |
|
|
332 | send_packet_printf ("mapinfo %s error", token); |
|
|
333 | else if (!map || !map->path) |
|
|
334 | send_packet_printf ("mapinfo %s nomap", token); |
|
|
335 | else |
|
|
336 | { |
|
|
337 | int flags = 0; |
|
|
338 | |
|
|
339 | if (map->tile_path[0]) flags |= 1; |
|
|
340 | if (map->tile_path[1]) flags |= 2; |
|
|
341 | if (map->tile_path[2]) flags |= 4; |
|
|
342 | if (map->tile_path[3]) flags |= 8; |
|
|
343 | |
|
|
344 | send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
345 | } |
|
|
346 | |
|
|
347 | return 1; |
|
|
348 | } |
|
|
349 | |
|
|
350 | void |
|
|
351 | client::mapinfo_queue_run () |
|
|
352 | { |
|
|
353 | if (mapinfo_queue.empty () || !pl) |
|
|
354 | return; |
|
|
355 | |
|
|
356 | for (int i = 0; i < mapinfo_queue.size (); ++i) |
|
|
357 | if (mapinfo_try (mapinfo_queue [i])) |
|
|
358 | { |
|
|
359 | free (mapinfo_queue [i]); |
|
|
360 | mapinfo_queue.erase (i); |
|
|
361 | } |
|
|
362 | else |
|
|
363 | ++i; |
257 | } |
364 | } |
258 | |
365 | |
259 | void |
366 | void |
260 | MapInfoCmd (char *buf, int len, player *pl) |
367 | MapInfoCmd (char *buf, int len, player *pl) |
261 | { |
368 | { |
262 | // <mapinfo tag spatial tile-path |
369 | // <mapinfo tag spatial tile-path |
263 | // >mapinfo tag spatial flags x y w h hash |
370 | // >mapinfo tag spatial flags x y w h hash |
264 | |
371 | |
265 | char bigbuf[MAX_BUF], *token; |
|
|
266 | |
|
|
267 | token = buf; |
372 | char *token = buf; |
268 | // copy token |
373 | |
269 | if (!(buf = strchr (buf, ' '))) |
374 | if (!(buf = strchr (buf, ' '))) |
270 | return; |
375 | return; |
271 | |
376 | |
272 | *buf++ = 0; |
|
|
273 | |
|
|
274 | if (!strncmp (buf, "spatial ", 8)) |
377 | if (!strncmp (buf, " spatial ", 9)) |
275 | { |
378 | { |
276 | buf += 8; |
379 | char *copy = strdup (token); |
|
|
380 | copy [buf - token] = 0; |
277 | |
381 | |
278 | // initial map and its origin |
382 | #if 0 |
279 | maptile *map = pl->ob->map; |
383 | // this makes only sense when we flush the buffer immediately |
280 | sint16 dx, dy; |
384 | if (pl->ns->mapinfo_try (copy)) |
281 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
385 | free (copy); |
282 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
|
|
283 | int max_distance = 8; // limit maximum path length to something generous |
|
|
284 | |
|
|
285 | while (*buf && map && max_distance) |
|
|
286 | { |
|
|
287 | int dir = *buf++; |
|
|
288 | |
|
|
289 | switch (dir) |
|
|
290 | { |
|
|
291 | case '1': |
|
|
292 | dx = 0; |
|
|
293 | dy = -1; |
|
|
294 | map = map->xy_find (dx, dy); |
|
|
295 | map && (mapy -= map->height); |
|
|
296 | break; |
|
|
297 | case '2': |
|
|
298 | mapx += map->width; |
|
|
299 | dx = map->width; |
|
|
300 | dy = 0; |
|
|
301 | map = map->xy_find (dx, dy); |
|
|
302 | break; |
|
|
303 | case '3': |
|
|
304 | mapy += map->height; |
|
|
305 | dx = 0; |
|
|
306 | dy = map->height; |
|
|
307 | map = map->xy_find (dx, dy); |
|
|
308 | break; |
|
|
309 | case '4': |
|
|
310 | dx = -1; |
|
|
311 | dy = 0; |
|
|
312 | map = map->xy_find (dx, dy); |
|
|
313 | map && (mapx -= map->width); |
|
|
314 | break; |
|
|
315 | } |
|
|
316 | |
|
|
317 | --max_distance; |
|
|
318 | } |
|
|
319 | |
|
|
320 | if (!max_distance) |
|
|
321 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
|
|
322 | else if (map && map->path[0]) |
|
|
323 | { |
|
|
324 | int flags = 0; |
|
|
325 | |
|
|
326 | if (map->tile_path[0]) flags |= 1; |
|
|
327 | if (map->tile_path[1]) flags |= 2; |
|
|
328 | if (map->tile_path[2]) flags |= 4; |
|
|
329 | if (map->tile_path[3]) flags |= 8; |
|
|
330 | |
|
|
331 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
332 | } |
|
|
333 | else |
386 | else |
334 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
387 | #endif |
|
|
388 | pl->ns->mapinfo_queue.push_back (copy); |
335 | } |
389 | } |
336 | else |
390 | else |
337 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
391 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
338 | |
|
|
339 | pl->ns->send_packet (bigbuf); |
|
|
340 | } |
392 | } |
341 | |
393 | |
342 | /** This is the Setup cmd */ |
394 | /** This is the Setup cmd */ |
343 | void |
395 | void |
344 | SetUp (char *buf, int len, client * ns) |
396 | SetUp (char *buf, int len, client * ns) |
… | |
… | |
473 | |
525 | |
474 | ns->send_packet (cmdback); |
526 | ns->send_packet (cmdback); |
475 | } |
527 | } |
476 | |
528 | |
477 | /** |
529 | /** |
478 | * client requested an image. send it rate-limited |
|
|
479 | * before flushing. |
|
|
480 | */ |
|
|
481 | void |
|
|
482 | AskFaceCmd (char *buf, int len, client *ns) |
|
|
483 | { |
|
|
484 | ns->askface.push_back (atoi (buf)); |
|
|
485 | } |
|
|
486 | |
|
|
487 | /** |
|
|
488 | * Tells client the picture it has to use |
|
|
489 | * to smooth a picture number given as argument. |
|
|
490 | */ |
|
|
491 | void |
|
|
492 | AskSmooth (char *buf, int len, client *ns) |
|
|
493 | { |
|
|
494 | ns->send_face (atoi (buf)); |
|
|
495 | ns->flush_fx (); |
|
|
496 | } |
|
|
497 | |
|
|
498 | /** |
|
|
499 | * This handles the general commands from the client (ie, north, fire, cast, |
530 | * This handles the general commands from the client (ie, north, fire, cast, |
500 | * etc.) |
531 | * etc.) |
501 | */ |
532 | */ |
502 | void |
533 | void |
503 | PlayerCmd (char *buf, int len, player *pl) |
534 | PlayerCmd (char *buf, int len, player *pl) |
… | |
… | |
524 | * commands. |
555 | * commands. |
525 | */ |
556 | */ |
526 | pl->count = 0; |
557 | pl->count = 0; |
527 | } |
558 | } |
528 | |
559 | |
529 | |
|
|
530 | /** |
560 | /** |
531 | * This handles the general commands from the client (ie, north, fire, cast, |
561 | * This handles the general commands from the client (ie, north, fire, cast, |
532 | * etc.). It is a lot like PlayerCmd above, but is called with the |
562 | * etc.). It is a lot like PlayerCmd above, but is called with the |
533 | * 'ncom' method which gives more information back to the client so it |
563 | * 'ncom' method which gives more information back to the client so it |
534 | * can throttle. |
564 | * can throttle. |
… | |
… | |
536 | void |
566 | void |
537 | NewPlayerCmd (char *buf, int len, player *pl) |
567 | NewPlayerCmd (char *buf, int len, player *pl) |
538 | { |
568 | { |
539 | if (len <= 6) |
569 | if (len <= 6) |
540 | { |
570 | { |
541 | LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
571 | LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len); |
542 | return; |
572 | return; |
543 | } |
573 | } |
544 | |
574 | |
545 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
575 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
546 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
576 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
… | |
… | |
684 | * syntax is: move (to) (tag) (nrof) |
714 | * syntax is: move (to) (tag) (nrof) |
685 | */ |
715 | */ |
686 | void |
716 | void |
687 | MoveCmd (char *buf, int len, player *pl) |
717 | MoveCmd (char *buf, int len, player *pl) |
688 | { |
718 | { |
689 | int vals[3], i; |
719 | int to, tag, nrof; |
690 | |
720 | |
691 | /* A little funky here. We only cycle for 2 records, because |
721 | if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
692 | * we obviously are not going to find a space after the third |
|
|
693 | * record. Perhaps we should just replace this with a |
|
|
694 | * sscanf? |
|
|
695 | */ |
|
|
696 | for (i = 0; i < 2; i++) |
|
|
697 | { |
722 | { |
698 | vals[i] = atoi (buf); |
|
|
699 | |
|
|
700 | if (!(buf = strchr (buf, ' '))) |
|
|
701 | { |
|
|
702 | LOG (llevError, "Incomplete move command: %s\n", buf); |
723 | LOG (llevError, "Incomplete move command: %s\n", buf); |
703 | return; |
724 | return; |
704 | } |
|
|
705 | |
|
|
706 | buf++; |
|
|
707 | } |
725 | } |
708 | |
726 | |
709 | vals[2] = atoi (buf); |
727 | esrv_move_object (pl->ob, to, tag, nrof); |
710 | |
|
|
711 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
|
|
712 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
|
|
713 | } |
728 | } |
714 | |
729 | |
715 | /****************************************************************************** |
730 | /****************************************************************************** |
716 | * |
731 | * |
717 | * Start of commands the server sends to the client. |
732 | * Start of commands the server sends to the client. |
… | |
… | |
735 | rangetostring (player *pl, char *obuf) |
750 | rangetostring (player *pl, char *obuf) |
736 | { |
751 | { |
737 | dynbuf_text buf; |
752 | dynbuf_text buf; |
738 | |
753 | |
739 | if (pl->ranged_ob) |
754 | if (pl->ranged_ob) |
740 | buf << " Range: " << pl->ranged_ob->name; |
755 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
741 | |
756 | |
742 | if (pl->combat_ob) |
757 | if (pl->combat_ob) |
743 | buf << " Combat: " << pl->combat_ob->name; |
758 | buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
744 | |
759 | |
|
|
760 | #if 0 |
|
|
761 | //TODO: remove this when slot system is working, this is only for debugging |
|
|
762 | if (pl->ob->chosen_skill) |
|
|
763 | buf << " Skill*: " << pl->ob->chosen_skill->name; |
|
|
764 | #endif |
|
|
765 | |
|
|
766 | //TODO: maybe golem should become the current_weapon, quite simply? |
745 | if (pl->golem) |
767 | if (pl->golem) |
746 | buf << " Golem: " << pl->golem->name; |
768 | buf << " Golem*: " << pl->golem->name; |
747 | |
769 | |
|
|
770 | buf << '\0'; |
748 | buf.linearise (obuf); |
771 | buf.linearise (obuf); |
749 | obuf [buf.size ()] = 0; |
|
|
750 | } |
772 | } |
751 | |
773 | |
752 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
774 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
753 | Old = New; \ |
775 | Old = New; \ |
754 | sl << uint8 (Type) << uint64 (New); \ |
776 | sl << uint8 (Type) << uint64 (New); \ |
… | |
… | |
762 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
784 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
763 | Old = New; \ |
785 | Old = New; \ |
764 | sl << uint8 (Type) << uint16 (New); \ |
786 | sl << uint8 (Type) << uint16 (New); \ |
765 | } |
787 | } |
766 | |
788 | |
767 | #define AddIfFloat(Old,New,Type) if (Old != New) {\ |
789 | #define AddIfFloat(Old,New,Type,mult) if (Old != New) {\ |
768 | Old = New; \ |
790 | Old = New; \ |
769 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ |
791 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \ |
770 | } |
792 | } |
771 | |
793 | |
772 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
794 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
773 | free(Old); Old = strdup (New);\ |
795 | free(Old); Old = strdup (New);\ |
774 | sl << uint8 (Type) << data8 (New); \ |
796 | sl << uint8 (Type) << data8 (New); \ |
… | |
… | |
788 | |
810 | |
789 | client *ns = pl->ns; |
811 | client *ns = pl->ns; |
790 | if (!ns) |
812 | if (!ns) |
791 | return; |
813 | return; |
792 | |
814 | |
793 | object *ob = pl->ob; |
815 | object *ob = pl->observe; |
794 | if (!ob) |
816 | if (!ob) |
795 | return; |
817 | return; |
|
|
818 | |
|
|
819 | player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl; |
796 | |
820 | |
797 | packet sl ("stats"); |
821 | packet sl ("stats"); |
798 | |
822 | |
799 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
823 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
800 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
824 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
… | |
… | |
809 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
833 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
810 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
834 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
811 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
835 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
812 | |
836 | |
813 | for (int s = 0; s < NUM_SKILLS; s++) |
837 | for (int s = 0; s < NUM_SKILLS; s++) |
814 | if (object *skill = pl->last_skill_ob[s]) |
838 | if (object *skill = opl->last_skill_ob [s]) |
815 | if (skill->stats.exp != ns->last_skill_exp [s]) |
839 | if (skill->stats.exp != ns->last_skill_exp [s]) |
816 | { |
840 | { |
817 | ns->last_skill_exp [s] = skill->stats.exp; |
841 | ns->last_skill_exp [s] = skill->stats.exp; |
818 | |
842 | |
819 | /* Always send along the level if exp changes. This is only |
843 | /* Always send along the level if exp changes. This is only |
… | |
… | |
827 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
851 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
828 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
852 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
829 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
853 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
830 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
854 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
831 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
855 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
832 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); |
856 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK); |
833 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
857 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
834 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
858 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK); |
835 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
859 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
836 | |
860 | |
837 | flags = 0; |
861 | flags = 0; |
838 | |
862 | |
839 | if (pl->fire_on) |
863 | if (opl->fire_on) |
840 | flags |= SF_FIREON; |
864 | flags |= SF_FIREON; |
841 | |
865 | |
842 | if (pl->run_on) |
866 | if (opl->run_on) |
843 | flags |= SF_RUNON; |
867 | flags |= SF_RUNON; |
844 | |
868 | |
845 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
869 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
846 | |
870 | |
847 | if (ns->sc_version < 1025) |
871 | if (ns->sc_version < 1025) |
… | |
… | |
861 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
885 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
862 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
886 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
863 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
887 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
864 | } |
888 | } |
865 | |
889 | |
866 | rangetostring (pl, buf); /* we want use the new fire & run system in new client */ |
890 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
867 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
891 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
868 | set_title (ob, buf); |
892 | set_title (ob, buf); |
869 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
893 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
870 | |
894 | |
871 | /* Only send it away if we have some actual data */ |
895 | /* Only send it away if we have some actual data */ |
… | |
… | |
875 | |
899 | |
876 | /** |
900 | /** |
877 | * Tells the client that here is a player it should start using. |
901 | * Tells the client that here is a player it should start using. |
878 | */ |
902 | */ |
879 | void |
903 | void |
880 | esrv_new_player (player *pl, uint32 weight) |
904 | esrv_new_player (player *pl) |
881 | { |
905 | { |
|
|
906 | sint32 weight = pl->ob->client_weight (); |
|
|
907 | |
882 | packet sl ("player"); |
908 | packet sl ("player"); |
883 | |
909 | |
884 | sl << uint32 (pl->ob->count) |
910 | sl << uint32 (pl->ob->count) |
885 | << uint32 (weight) |
911 | << uint32 (weight) |
886 | << uint32 (pl->ob->face) |
912 | << uint32 (pl->ob->face) |
887 | << data8 (pl->ob->name); |
913 | << data8 (pl->ob->name); |
888 | |
914 | |
889 | pl->ns->last_weight = weight; |
915 | pl->ns->last_weight = weight; |
890 | pl->ns->send_packet (sl); |
916 | pl->ns->send_packet (sl); |
891 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
|
|
892 | } |
917 | } |
893 | |
918 | |
894 | /****************************************************************************** |
919 | /****************************************************************************** |
895 | * |
920 | * |
896 | * Start of map related commands. |
921 | * Start of map related commands. |
… | |
… | |
953 | |
978 | |
954 | if (!ns.faces_sent[face_num]) |
979 | if (!ns.faces_sent[face_num]) |
955 | if (ob) |
980 | if (ob) |
956 | ns.send_faces (ob); |
981 | ns.send_faces (ob); |
957 | else |
982 | else |
958 | ns.send_face (face_num); |
983 | ns.send_face (face_num, 10); |
959 | |
984 | |
960 | sl << uint16 (face_num); |
985 | sl << uint16 (face_num); |
961 | return 1; |
986 | return 1; |
962 | } |
987 | } |
963 | |
988 | |
… | |
… | |
1005 | { |
1030 | { |
1006 | prefetch_surrounding_maps (op->map, 3); |
1031 | prefetch_surrounding_maps (op->map, 3); |
1007 | } |
1032 | } |
1008 | |
1033 | |
1009 | /** |
1034 | /** |
1010 | * This function uses the new map1 protocol command to send the map |
1035 | * Draws client map. |
1011 | * to the client. It is necessary because the old map command supports |
|
|
1012 | * a maximum map size of 15x15. |
|
|
1013 | * This function is much simpler than the old one. This is because |
|
|
1014 | * the old function optimized to send as few face identifiers as possible, |
|
|
1015 | * at the expense of sending more coordinate location (coordinates were |
|
|
1016 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
1017 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
1018 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
1019 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
1020 | * of what we send, see the doc/Protocol file. |
|
|
1021 | * I will describe internally what we do: |
|
|
1022 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
1023 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
1024 | * maximum viewable size (As set in config.h). |
|
|
1025 | * in the cells, there are faces and a count value. |
|
|
1026 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
1027 | * is not viewable. |
|
|
1028 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
1029 | * look like. |
|
|
1030 | */ |
1036 | */ |
1031 | void |
1037 | void |
1032 | draw_client_map1 (object *pl) |
1038 | draw_client_map (player *pl) |
1033 | { |
1039 | { |
1034 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1040 | object *ob = pl->observe; |
1035 | sint16 nx, ny; |
1041 | if (!ob->active) |
|
|
1042 | return; |
|
|
1043 | |
|
|
1044 | /* If player is just joining the game, he isn't here yet, so the map |
|
|
1045 | * can get swapped out. If so, don't try to send them a map. All will |
|
|
1046 | * be OK once they really log in. |
|
|
1047 | */ |
|
|
1048 | if (!ob->map || ob->map->in_memory != MAP_ACTIVE) |
|
|
1049 | return; |
|
|
1050 | |
|
|
1051 | int startlen, oldlen; |
1036 | int estartlen, eoldlen; |
1052 | int estartlen, eoldlen; |
1037 | uint8 eentrysize; |
1053 | uint8 eentrysize; |
1038 | uint16 ewhatstart, ewhatflag; |
1054 | uint16 ewhatstart, ewhatflag; |
1039 | uint8 extendedinfos; |
1055 | uint8 extendedinfos; |
1040 | maptile *m; |
|
|
1041 | |
1056 | |
1042 | client &socket = *pl->contr->ns; |
|
|
1043 | |
|
|
1044 | if (!pl->active) |
|
|
1045 | return; |
|
|
1046 | |
|
|
1047 | check_map_change (pl->contr); |
1057 | check_map_change (pl); |
1048 | prefetch_surrounding_maps (pl); |
1058 | prefetch_surrounding_maps (pl->ob); |
|
|
1059 | |
|
|
1060 | /* do LOS after calls to update_position */ |
|
|
1061 | if (ob != pl->ob) |
|
|
1062 | clear_los (pl); |
|
|
1063 | else if (pl->do_los) |
|
|
1064 | { |
|
|
1065 | update_los (ob); |
|
|
1066 | pl->do_los = 0; |
|
|
1067 | } |
|
|
1068 | |
|
|
1069 | /** |
|
|
1070 | * This function uses the new map1 protocol command to send the map |
|
|
1071 | * to the client. It is necessary because the old map command supports |
|
|
1072 | * a maximum map size of 15x15. |
|
|
1073 | * This function is much simpler than the old one. This is because |
|
|
1074 | * the old function optimized to send as few face identifiers as possible, |
|
|
1075 | * at the expense of sending more coordinate location (coordinates were |
|
|
1076 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
1077 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
1078 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
1079 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
1080 | * of what we send, see the doc/Protocol file. |
|
|
1081 | * I will describe internally what we do: |
|
|
1082 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
1083 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
1084 | * maximum viewable size (As set in config.h). |
|
|
1085 | * in the cells, there are faces and a count value. |
|
|
1086 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
1087 | * is not viewable. |
|
|
1088 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
1089 | * look like. |
|
|
1090 | */ |
|
|
1091 | |
|
|
1092 | client &socket = *pl->ns; |
1049 | |
1093 | |
1050 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1094 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1051 | packet esl; |
1095 | packet esl; |
1052 | |
1096 | |
1053 | startlen = sl.length (); |
1097 | startlen = sl.length (); |
… | |
… | |
1069 | << uint8 (eentrysize); |
1113 | << uint8 (eentrysize); |
1070 | |
1114 | |
1071 | estartlen = esl.length (); |
1115 | estartlen = esl.length (); |
1072 | } |
1116 | } |
1073 | |
1117 | |
1074 | /* x,y are the real map locations. ax, ay are viewport relative |
|
|
1075 | * locations. |
|
|
1076 | */ |
|
|
1077 | ay = 0; |
|
|
1078 | |
|
|
1079 | /* We could do this logic as conditionals in the if statement, |
1118 | /* We could do this logic as conditionals in the if statement, |
1080 | * but that started to get a bit messy to look at. |
1119 | * but that started to get a bit messy to look at. |
1081 | */ |
1120 | */ |
1082 | max_x = pl->x + (socket.mapx + 1) / 2; |
1121 | int hx = socket.mapx / 2; |
1083 | max_y = pl->y + (socket.mapy + 1) / 2; |
1122 | int hy = socket.mapy / 2; |
1084 | |
1123 | |
1085 | maptile *plmap = pl->map; |
1124 | for (int dx = -hx; dx <= hx; dx++) |
1086 | |
|
|
1087 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
|
|
1088 | { |
1125 | { |
1089 | ax = 0; |
1126 | sint16 nx, ny; |
1090 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1127 | maptile *m = 0; |
|
|
1128 | |
|
|
1129 | for (int dy = -hy; dy <= hy; dy++) |
1091 | { |
1130 | { |
|
|
1131 | // check to see if we can simply go one down quickly |
|
|
1132 | if (m && ++ny >= m->height) |
|
|
1133 | m = 0; |
|
|
1134 | |
|
|
1135 | // no, so do it the slow way |
|
|
1136 | if (!m) |
|
|
1137 | { |
|
|
1138 | nx = ob->x + dx; ny = ob->y + dy; m = ob->map; |
|
|
1139 | |
|
|
1140 | if (xy_normalise (m, nx, ny)) |
|
|
1141 | m->touch (); |
|
|
1142 | else |
|
|
1143 | m = 0; |
|
|
1144 | } |
|
|
1145 | |
|
|
1146 | int ax = dx + hx; |
|
|
1147 | int ay = dy + hy; |
|
|
1148 | |
1092 | int emask, mask; |
1149 | int emask, mask; |
1093 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1150 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1094 | |
1151 | |
1095 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1152 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1096 | |
1153 | |
1097 | /* If the coordinates are not valid, or it is too dark to see, |
1154 | /* If the coordinates are not valid, or it is too dark to see, |
1098 | * we tell the client as such |
1155 | * we tell the client as such |
1099 | */ |
1156 | */ |
1100 | nx = x; |
|
|
1101 | ny = y; |
|
|
1102 | m = get_map_from_coord (plmap, &nx, &ny); |
|
|
1103 | |
|
|
1104 | if (!m) |
1157 | if (!m) |
1105 | { |
1158 | { |
1106 | /* space is out of map. Update space and clear values |
1159 | /* space is out of map. Update space and clear values |
1107 | * if this hasn't already been done. If the space is out |
1160 | * if this hasn't already been done. If the space is out |
1108 | * of the map, it shouldn't have a head |
1161 | * of the map, it shouldn't have a head. |
1109 | */ |
1162 | */ |
1110 | if (lastcell.count != -1) |
1163 | if (lastcell.count != -1) |
1111 | { |
1164 | { |
1112 | sl << uint16 (mask); |
1165 | sl << uint16 (mask); |
1113 | map_clearcell (&lastcell, -1); |
1166 | map_clearcell (&lastcell, -1); |
1114 | } |
1167 | } |
1115 | |
1168 | |
1116 | continue; |
1169 | continue; |
1117 | } |
1170 | } |
1118 | |
1171 | |
1119 | m->touch (); |
|
|
1120 | |
|
|
1121 | int d = pl->contr->blocked_los[ax][ay]; |
1172 | int d = pl->blocked_los_uc (dx, dy); |
1122 | |
1173 | |
1123 | if (d > 3) |
1174 | if (d > 3) |
1124 | { |
1175 | { |
1125 | |
|
|
1126 | int need_send = 0, count; |
1176 | int need_send = 0, count; |
1127 | |
1177 | |
1128 | /* This block deals with spaces that are not visible for whatever |
1178 | /* This block deals with spaces that are not visible for whatever |
1129 | * reason. Still may need to send the head for this space. |
1179 | * reason. Still may need to send the head for this space. |
1130 | */ |
1180 | */ |
… | |
… | |
1136 | if (lastcell.count != -1) |
1186 | if (lastcell.count != -1) |
1137 | need_send = 1; |
1187 | need_send = 1; |
1138 | |
1188 | |
1139 | count = -1; |
1189 | count = -1; |
1140 | |
1190 | |
1141 | /* properly clear a previously sent big face */ |
|
|
1142 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1191 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1143 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1192 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1144 | need_send = 1; |
1193 | need_send = 1; |
1145 | |
1194 | |
|
|
1195 | /* properly clear a previously sent big face */ |
1146 | map_clearcell (&lastcell, count); |
1196 | map_clearcell (&lastcell, count); |
1147 | |
1197 | |
1148 | if ((mask & 0xf) || need_send) |
1198 | if ((mask & 0xf) || need_send) |
1149 | sl[oldlen + 1] = mask & 0xff; |
1199 | sl[oldlen + 1] = mask & 0xff; |
1150 | else |
1200 | else |
… | |
… | |
1189 | } |
1239 | } |
1190 | |
1240 | |
1191 | lastcell.count = d; |
1241 | lastcell.count = d; |
1192 | |
1242 | |
1193 | mapspace &ms = m->at (nx, ny); |
1243 | mapspace &ms = m->at (nx, ny); |
|
|
1244 | ms.update (); |
1194 | |
1245 | |
1195 | if (socket.extmap) |
1246 | if (socket.extmap) |
1196 | { |
1247 | { |
1197 | uint8 stat_hp = 0; |
1248 | uint8 stat_hp = 0; |
1198 | uint8 stat_width = 0; |
1249 | uint8 stat_width = 0; |
1199 | uint8 flags = 0; |
1250 | uint8 flags = 0; |
1200 | tag_t player = 0; |
1251 | tag_t player = 0; |
1201 | |
1252 | |
1202 | // send hp information, if applicable |
1253 | // send hp information, if applicable |
1203 | if (object *op = ms.faces_obj [0]) |
1254 | if (object *op = ms.faces_obj [0]) |
1204 | { |
|
|
1205 | if (op->head || op->invisible) |
1255 | if (op->is_head () && !op->invisible) |
1206 | ; // do not show |
|
|
1207 | else if (op->type == PLAYER |
|
|
1208 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
|
|
1209 | { |
1256 | { |
1210 | if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
1257 | if (op->stats.maxhp > op->stats.hp |
|
|
1258 | && op->stats.maxhp > 0 |
|
|
1259 | && (op->type == PLAYER |
|
|
1260 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1261 | || QUERY_FLAG (op, FLAG_MONSTER) |
|
|
1262 | || QUERY_FLAG (op, FLAG_ALIVE) |
|
|
1263 | || QUERY_FLAG (op, FLAG_GENERATOR))) |
1211 | { |
1264 | { |
1212 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1265 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1213 | stat_width = op->arch->tail_x; |
1266 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
1214 | } |
1267 | } |
1215 | } |
|
|
1216 | |
1268 | |
1217 | if (op->msg && op->msg[0] == '@') |
1269 | if (op->has_dialogue ()) |
1218 | flags |= 1; |
1270 | flags |= 1; |
1219 | |
1271 | |
1220 | if (op->type == PLAYER && op != pl) |
1272 | if (op->type == PLAYER) |
1221 | player = op->count; |
1273 | player = op == ob ? pl->ob->count |
|
|
1274 | : op == pl->ob ? ob->count |
|
|
1275 | : op->count; |
1222 | } |
1276 | } |
1223 | |
1277 | |
1224 | if (lastcell.stat_hp != stat_hp) |
1278 | if (lastcell.stat_hp != stat_hp) |
1225 | { |
1279 | { |
1226 | lastcell.stat_hp = stat_hp; |
1280 | lastcell.stat_hp = stat_hp; |
1227 | |
1281 | |
… | |
… | |
1269 | |
1323 | |
1270 | /* Middle face */ |
1324 | /* Middle face */ |
1271 | if (update_space (sl, socket, ms, lastcell, 1)) |
1325 | if (update_space (sl, socket, ms, lastcell, 1)) |
1272 | mask |= 0x2; |
1326 | mask |= 0x2; |
1273 | |
1327 | |
1274 | if (ms.player () == pl |
1328 | if (ob->invisible |
1275 | && (pl->invisible & (pl->invisible < 50 ? 1 : 7))) |
1329 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
|
|
1330 | && ms.player () == ob) |
1276 | { |
1331 | { |
1277 | // force player to be visible to himself if invisible |
1332 | // force player to be visible to himself if invisible |
1278 | if (lastcell.faces[0] != pl->face) |
1333 | if (lastcell.faces[0] != ob->face) |
1279 | { |
1334 | { |
1280 | lastcell.faces[0] = pl->face; |
1335 | lastcell.faces[0] = ob->face; |
1281 | |
1336 | |
1282 | mask |= 0x1; |
1337 | mask |= 0x1; |
1283 | sl << uint16 (pl->face); |
1338 | sl << uint16 (ob->face); |
1284 | |
1339 | |
1285 | socket.send_faces (pl); |
1340 | socket.send_faces (ob); |
1286 | } |
1341 | } |
1287 | } |
1342 | } |
1288 | /* Top face */ |
1343 | /* Top face */ |
1289 | else if (update_space (sl, socket, ms, lastcell, 0)) |
1344 | else if (update_space (sl, socket, ms, lastcell, 0)) |
1290 | mask |= 0x1; |
1345 | mask |= 0x1; |
1291 | |
|
|
1292 | |
1346 | |
1293 | /* Check to see if we are in fact sending anything for this |
1347 | /* Check to see if we are in fact sending anything for this |
1294 | * space by checking the mask. If so, update the mask. |
1348 | * space by checking the mask. If so, update the mask. |
1295 | * if not, reset the len to that from before adding the mask |
1349 | * if not, reset the len to that from before adding the mask |
1296 | * value, so we don't send those bits. |
1350 | * value, so we don't send those bits. |
… | |
… | |
1355 | socket.send_packet (sl); |
1409 | socket.send_packet (sl); |
1356 | socket.sent_scroll = 0; |
1410 | socket.sent_scroll = 0; |
1357 | } |
1411 | } |
1358 | } |
1412 | } |
1359 | |
1413 | |
1360 | /** |
|
|
1361 | * Draws client map. |
|
|
1362 | */ |
|
|
1363 | void |
|
|
1364 | draw_client_map (object *pl) |
|
|
1365 | { |
|
|
1366 | int i, j; |
|
|
1367 | sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */ |
|
|
1368 | int mflags; |
|
|
1369 | struct Map newmap; |
|
|
1370 | maptile *m, *pm; |
|
|
1371 | |
|
|
1372 | if (pl->type != PLAYER) |
|
|
1373 | { |
|
|
1374 | LOG (llevError, "draw_client_map called with non player/non eric-server\n"); |
|
|
1375 | return; |
|
|
1376 | } |
|
|
1377 | |
|
|
1378 | pm = pl->map; |
|
|
1379 | |
|
|
1380 | /* If player is just joining the game, he isn't here yet, so the map |
|
|
1381 | * can get swapped out. If so, don't try to send them a map. All will |
|
|
1382 | * be OK once they really log in. |
|
|
1383 | */ |
|
|
1384 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
|
|
1385 | return; |
|
|
1386 | |
|
|
1387 | memset (&newmap, 0, sizeof (struct Map)); |
|
|
1388 | |
|
|
1389 | for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) |
|
|
1390 | for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) |
|
|
1391 | { |
|
|
1392 | ax = i; |
|
|
1393 | ay = j; |
|
|
1394 | m = pm; |
|
|
1395 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
|
|
1396 | |
|
|
1397 | if (mflags & P_OUT_OF_MAP) |
|
|
1398 | continue; |
|
|
1399 | |
|
|
1400 | /* If a map is visible to the player, we don't want to swap it out |
|
|
1401 | * just to reload it. This should really call something like |
|
|
1402 | * swap_map, but this is much more efficient and 'good enough' |
|
|
1403 | */ |
|
|
1404 | if (mflags & P_NEW_MAP) |
|
|
1405 | m->timeout = 50; |
|
|
1406 | } |
|
|
1407 | |
|
|
1408 | /* do LOS after calls to update_position */ |
|
|
1409 | if (pl->contr->do_los) |
|
|
1410 | { |
|
|
1411 | update_los (pl); |
|
|
1412 | pl->contr->do_los = 0; |
|
|
1413 | } |
|
|
1414 | |
|
|
1415 | /* Big maps need a different drawing mechanism to work */ |
|
|
1416 | draw_client_map1 (pl); |
|
|
1417 | } |
|
|
1418 | |
|
|
1419 | |
|
|
1420 | /*****************************************************************************/ |
1414 | /*****************************************************************************/ |
1421 | |
|
|
1422 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
1415 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
1423 | |
|
|
1424 | /* a player. Of course, the client need to know the command to be able to */ |
1416 | /* a player. Of course, the client need to know the command to be able to */ |
1425 | |
|
|
1426 | /* manage it ! */ |
1417 | /* manage it ! */ |
1427 | |
|
|
1428 | /*****************************************************************************/ |
1418 | /*****************************************************************************/ |
1429 | void |
1419 | void |
1430 | send_plugin_custom_message (object *pl, char *buf) |
1420 | send_plugin_custom_message (object *pl, char *buf) |
1431 | { |
1421 | { |
1432 | pl->contr->ns->send_packet (buf); |
1422 | pl->contr->ns->send_packet (buf); |
… | |
… | |
1441 | { |
1431 | { |
1442 | packet sl; |
1432 | packet sl; |
1443 | sl << "replyinfo skill_info\n"; |
1433 | sl << "replyinfo skill_info\n"; |
1444 | |
1434 | |
1445 | for (int i = 1; i < NUM_SKILLS; i++) |
1435 | for (int i = 1; i < NUM_SKILLS; i++) |
1446 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
1436 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]); |
1447 | |
1437 | |
1448 | if (sl.length () >= MAXSOCKBUF) |
1438 | if (sl.length () > MAXSOCKBUF) |
1449 | { |
1439 | { |
1450 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1440 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1451 | fatal (0); |
1441 | fatal (0); |
1452 | } |
1442 | } |
1453 | |
1443 | |
… | |
… | |
1466 | sl << "replyinfo spell_paths\n"; |
1456 | sl << "replyinfo spell_paths\n"; |
1467 | |
1457 | |
1468 | for (int i = 0; i < NRSPELLPATHS; i++) |
1458 | for (int i = 0; i < NRSPELLPATHS; i++) |
1469 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1459 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1470 | |
1460 | |
1471 | if (sl.length () >= MAXSOCKBUF) |
1461 | if (sl.length () > MAXSOCKBUF) |
1472 | { |
1462 | { |
1473 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1463 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1474 | fatal (0); |
1464 | fatal (0); |
1475 | } |
1465 | } |
1476 | |
1466 | |
… | |
… | |
1495 | if (spell->type == SPELL) |
1485 | if (spell->type == SPELL) |
1496 | { |
1486 | { |
1497 | int flags = 0; |
1487 | int flags = 0; |
1498 | |
1488 | |
1499 | /* check if we need to update it */ |
1489 | /* check if we need to update it */ |
1500 | if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1490 | if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1501 | { |
1491 | { |
1502 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1492 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1503 | flags |= UPD_SP_MANA; |
1493 | flags |= UPD_SP_MANA; |
1504 | } |
1494 | } |
1505 | |
1495 | |
1506 | if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1496 | if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1507 | { |
1497 | { |
1508 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1498 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1509 | flags |= UPD_SP_GRACE; |
1499 | flags |= UPD_SP_GRACE; |
1510 | } |
1500 | } |
1511 | |
1501 | |
1512 | if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1502 | if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1513 | { |
1503 | { |
1514 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1504 | spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1515 | flags |= UPD_SP_DAMAGE; |
1505 | flags |= UPD_SP_DAMAGE; |
1516 | } |
1506 | } |
1517 | |
1507 | |
1518 | if (flags) |
1508 | if (flags) |
1519 | { |
1509 | { |
… | |
… | |
1521 | |
1511 | |
1522 | sl << "updspell " |
1512 | sl << "updspell " |
1523 | << uint8 (flags) |
1513 | << uint8 (flags) |
1524 | << uint32 (spell->count); |
1514 | << uint32 (spell->count); |
1525 | |
1515 | |
1526 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1516 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
1527 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1517 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace); |
1528 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1518 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat); |
1529 | |
1519 | |
1530 | pl->ns->send_packet (sl); |
1520 | pl->ns->send_packet (sl); |
1531 | } |
1521 | } |
1532 | } |
1522 | } |
1533 | } |
1523 | } |
… | |
… | |
1563 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1553 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1564 | return; |
1554 | return; |
1565 | } |
1555 | } |
1566 | |
1556 | |
1567 | /* store costs and damage in the object struct, to compare to later */ |
1557 | /* store costs and damage in the object struct, to compare to later */ |
1568 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1558 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1569 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1559 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1570 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1560 | spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1571 | |
1561 | |
1572 | /* figure out which skill it uses, if it uses one */ |
1562 | /* figure out which skill it uses, if it uses one */ |
1573 | if (spell->skill) |
1563 | if (spell->skill) |
1574 | { |
1564 | if (object *tmp = pl->find_skill (spell->skill)) |
1575 | for (i = 1; i < NUM_SKILLS; i++) |
|
|
1576 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1577 | { |
|
|
1578 | skill = i + CS_STAT_SKILLINFO; |
1565 | skill = tmp->subtype + CS_STAT_SKILLINFO; |
1579 | break; |
|
|
1580 | } |
|
|
1581 | } |
|
|
1582 | |
1566 | |
1583 | // spells better have a face |
1567 | // spells better have a face |
1584 | if (!spell->face) |
1568 | if (!spell->face) |
1585 | { |
1569 | { |
1586 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1570 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1587 | spell->face = face_find ("burnout.x11", blank_face); |
1571 | spell->face = face_find ("burnout.x11", blank_face); |
1588 | } |
1572 | } |
|
|
1573 | |
|
|
1574 | pl->ns->send_face (spell->face); |
1589 | |
1575 | |
1590 | /* send the current values */ |
1576 | /* send the current values */ |
1591 | sl << uint32 (spell->count) |
1577 | sl << uint32 (spell->count) |
1592 | << uint16 (spell->level) |
1578 | << uint16 (spell->level) |
1593 | << uint16 (spell->casting_time) |
1579 | << uint16 (spell->casting_time) |
1594 | << uint16 (spell->last_sp) |
1580 | << uint16 (spell->cached_sp) |
1595 | << uint16 (spell->last_grace) |
1581 | << uint16 (spell->cached_grace) |
1596 | << uint16 (spell->last_eat) |
1582 | << uint16 (spell->cached_eat) |
1597 | << uint8 (skill) |
1583 | << uint8 (skill) |
1598 | << uint32 (spell->path_attuned) |
1584 | << uint32 (spell->path_attuned) |
1599 | << uint32 (spell->face) |
1585 | << uint32 (spell->face) |
1600 | << data8 (spell->name) |
1586 | << data8 (spell->name) |
1601 | << data16 (spell->msg); |
1587 | << data16 (spell->msg); |
… | |
… | |
1629 | * bytes and 3 strings (because that is the spec) so we need to |
1615 | * bytes and 3 strings (because that is the spec) so we need to |
1630 | * check that the length of those 3 strings, plus the 23 bytes, |
1616 | * check that the length of those 3 strings, plus the 23 bytes, |
1631 | * won't take us over the length limit for the socket, if it does, |
1617 | * won't take us over the length limit for the socket, if it does, |
1632 | * we need to send what we already have, and restart packet formation |
1618 | * we need to send what we already have, and restart packet formation |
1633 | */ |
1619 | */ |
|
|
1620 | if (spell->type != SPELL) |
|
|
1621 | continue; |
|
|
1622 | |
1634 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1623 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1635 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1624 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1636 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1625 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1637 | * like it will fix this |
1626 | * like it will fix this |
1638 | */ |
1627 | */ |
1639 | if (spell->type != SPELL) |
|
|
1640 | continue; |
|
|
1641 | |
|
|
1642 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1628 | if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1643 | { |
1629 | { |
|
|
1630 | pl->ns->flush_fx (); |
1644 | pl->ns->send_packet (sl); |
1631 | pl->ns->send_packet (sl); |
1645 | |
1632 | |
1646 | sl.reset (); |
1633 | sl.reset (); |
1647 | sl << "addspell "; |
1634 | sl << "addspell "; |
1648 | } |
1635 | } |
… | |
… | |
1656 | return; |
1643 | return; |
1657 | } |
1644 | } |
1658 | else |
1645 | else |
1659 | append_spell (pl, sl, spell); |
1646 | append_spell (pl, sl, spell); |
1660 | |
1647 | |
1661 | if (sl.length () >= MAXSOCKBUF) |
1648 | if (sl.length () > MAXSOCKBUF) |
1662 | { |
1649 | { |
1663 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1650 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1664 | fatal (0); |
1651 | fatal (0); |
1665 | } |
1652 | } |
1666 | |
1653 | |
1667 | /* finally, we can send the packet */ |
1654 | /* finally, we can send the packet */ |
|
|
1655 | pl->ns->flush_fx (); |
1668 | pl->ns->send_packet (sl); |
1656 | pl->ns->send_packet (sl); |
1669 | } |
1657 | } |
1670 | |
1658 | |