1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel |
5 | * Copyright (©) 2001,2007 Mark Wedel |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT 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 3 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, |
… | |
… | |
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, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /** |
24 | /** |
25 | * \file |
25 | * \file |
26 | * Client handling. |
26 | * Client handling. |
… | |
… | |
129 | } |
129 | } |
130 | |
130 | |
131 | static void |
131 | static void |
132 | clear_map (player *pl) |
132 | clear_map (player *pl) |
133 | { |
133 | { |
|
|
134 | pl->ns->mapinfo_queue_clear (); |
|
|
135 | |
134 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
136 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
135 | |
137 | |
136 | pl->ns->force_newmap = false; |
138 | pl->ns->force_newmap = false; |
137 | |
139 | |
138 | if (pl->ns->newmapcmd == 1) |
140 | if (pl->ns->newmapcmd == 1) |
139 | pl->ns->send_packet ("newmap"); |
141 | pl->ns->send_packet ("newmap"); |
140 | |
142 | |
141 | 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 | } |
142 | } |
170 | } |
143 | |
171 | |
144 | /** check for map/region change and send new map data */ |
172 | /** check for map/region change and send new map data */ |
145 | static void |
173 | static void |
146 | check_map_change (player *pl) |
174 | check_map_change (player *pl) |
147 | { |
175 | { |
148 | client &socket = *pl->ns; |
176 | client &socket = *pl->ns; |
149 | object *ob = pl->observe; |
177 | object *ob = pl->observe; |
150 | |
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 | } |
|
|
205 | |
151 | if (socket.current_map != ob->map || socket.force_newmap) |
206 | if (socket.current_map != ob->map || socket.force_newmap) |
152 | { |
207 | { |
153 | clear_map (pl); |
208 | clear_map (pl); |
154 | socket.current_map = ob->map; |
209 | socket.current_map = ob->map; |
155 | |
210 | send_map_info (pl); |
156 | if (socket.mapinfocmd) |
|
|
157 | { |
|
|
158 | if (ob->map && ob->map->path[0]) |
|
|
159 | { |
|
|
160 | int flags = 0; |
|
|
161 | |
|
|
162 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
163 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
164 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
165 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
166 | |
|
|
167 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
168 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
169 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
170 | } |
|
|
171 | else |
|
|
172 | socket.send_packet ("mapinfo current"); |
|
|
173 | } |
|
|
174 | } |
211 | } |
175 | 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) |
176 | { |
213 | { |
177 | int dx = ob->x - socket.current_x; |
214 | int dx = ob->x - socket.current_x; |
178 | int dy = ob->y - socket.current_y; |
215 | int dy = ob->y - socket.current_y; |
… | |
… | |
186 | } |
223 | } |
187 | } |
224 | } |
188 | |
225 | |
189 | socket.current_x = ob->x; |
226 | socket.current_x = ob->x; |
190 | socket.current_y = ob->y; |
227 | socket.current_y = ob->y; |
191 | |
|
|
192 | region *reg = ob->region (); |
|
|
193 | if (socket.current_region != reg) |
|
|
194 | { |
|
|
195 | socket.current_region = reg; |
|
|
196 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
|
|
197 | } |
|
|
198 | } |
228 | } |
199 | |
229 | |
200 | /** |
230 | /** |
201 | * RequestInfo is sort of a meta command. There is some specific |
231 | * RequestInfo is sort of a meta command. There is some specific |
202 | * request of information, but we call other functions to provide |
232 | * request of information, but we call other functions to provide |
203 | * that information. |
233 | * that information. |
204 | */ |
234 | */ |
205 | void |
235 | void |
206 | RequestInfo (char *buf, int len, client * ns) |
236 | RequestInfo (char *buf, int len, client *ns) |
207 | { |
237 | { |
208 | char *params = NULL, *cp; |
238 | char *params; |
209 | |
|
|
210 | /* No match */ |
|
|
211 | char bigbuf[MAX_BUF]; |
|
|
212 | int slen; |
|
|
213 | |
|
|
214 | /* Set up replyinfo before we modify any of the buffers - this is used |
|
|
215 | * if we don't find a match. |
|
|
216 | */ |
|
|
217 | strcpy (bigbuf, "replyinfo "); |
|
|
218 | slen = strlen (bigbuf); |
|
|
219 | safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
|
|
220 | |
239 | |
221 | /* find the first space, make it null, and update the |
240 | /* find the first space, make it null, and update the |
222 | * params pointer. |
241 | * params pointer. |
223 | */ |
242 | */ |
224 | for (cp = buf; *cp != '\0'; cp++) |
243 | for (params = buf; *params; params++) |
225 | if (*cp == ' ') |
244 | if (*params == ' ') |
226 | { |
245 | { |
227 | *cp = '\0'; |
|
|
228 | params = cp + 1; |
246 | *params++ = 0; |
229 | break; |
247 | break; |
230 | } |
248 | } |
231 | |
249 | |
232 | if (!strcmp (buf, "image_info")) |
250 | if (!strcmp (buf, "image_info")) |
233 | send_image_info (ns, params); |
251 | send_image_info (ns, params); |
… | |
… | |
236 | else if (!strcmp (buf, "skill_info")) |
254 | else if (!strcmp (buf, "skill_info")) |
237 | send_skill_info (ns, params); |
255 | send_skill_info (ns, params); |
238 | else if (!strcmp (buf, "spell_paths")) |
256 | else if (!strcmp (buf, "spell_paths")) |
239 | send_spell_paths (ns, params); |
257 | send_spell_paths (ns, params); |
240 | else |
258 | else |
241 | 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 | } |
242 | } |
266 | } |
243 | |
267 | |
244 | void |
268 | void |
245 | ExtCmd (char *buf, int len, player *pl) |
269 | ExtCmd (char *buf, int len, player *pl) |
246 | { |
270 | { |
… | |
… | |
249 | |
273 | |
250 | void |
274 | void |
251 | ExtiCmd (char *buf, int len, client *ns) |
275 | ExtiCmd (char *buf, int len, client *ns) |
252 | { |
276 | { |
253 | 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; |
254 | } |
364 | } |
255 | |
365 | |
256 | void |
366 | void |
257 | MapInfoCmd (char *buf, int len, player *pl) |
367 | MapInfoCmd (char *buf, int len, player *pl) |
258 | { |
368 | { |
259 | // <mapinfo tag spatial tile-path |
369 | // <mapinfo tag spatial tile-path |
260 | // >mapinfo tag spatial flags x y w h hash |
370 | // >mapinfo tag spatial flags x y w h hash |
261 | |
371 | |
262 | char bigbuf[MAX_BUF], *token; |
|
|
263 | |
|
|
264 | token = buf; |
372 | char *token = buf; |
265 | // copy token |
373 | |
266 | if (!(buf = strchr (buf, ' '))) |
374 | if (!(buf = strchr (buf, ' '))) |
267 | return; |
375 | return; |
268 | |
376 | |
269 | *buf++ = 0; |
|
|
270 | |
|
|
271 | if (!strncmp (buf, "spatial ", 8)) |
377 | if (!strncmp (buf, " spatial ", 9)) |
272 | { |
378 | { |
273 | buf += 8; |
379 | char *copy = strdup (token); |
|
|
380 | copy [buf - token] = 0; |
274 | |
381 | |
275 | // initial map and its origin |
382 | #if 0 |
276 | maptile *map = pl->ob->map; |
383 | // this makes only sense when we flush the buffer immediately |
277 | sint16 dx, dy; |
384 | if (pl->ns->mapinfo_try (copy)) |
278 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
385 | free (copy); |
279 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
|
|
280 | int max_distance = 8; // limit maximum path length to something generous |
|
|
281 | |
|
|
282 | while (*buf && map && max_distance) |
|
|
283 | { |
|
|
284 | int dir = *buf++; |
|
|
285 | |
|
|
286 | switch (dir) |
|
|
287 | { |
|
|
288 | case '1': |
|
|
289 | dx = 0; |
|
|
290 | dy = -1; |
|
|
291 | map = map->xy_find (dx, dy); |
|
|
292 | map && (mapy -= map->height); |
|
|
293 | break; |
|
|
294 | case '2': |
|
|
295 | mapx += map->width; |
|
|
296 | dx = map->width; |
|
|
297 | dy = 0; |
|
|
298 | map = map->xy_find (dx, dy); |
|
|
299 | break; |
|
|
300 | case '3': |
|
|
301 | mapy += map->height; |
|
|
302 | dx = 0; |
|
|
303 | dy = map->height; |
|
|
304 | map = map->xy_find (dx, dy); |
|
|
305 | break; |
|
|
306 | case '4': |
|
|
307 | dx = -1; |
|
|
308 | dy = 0; |
|
|
309 | map = map->xy_find (dx, dy); |
|
|
310 | map && (mapx -= map->width); |
|
|
311 | break; |
|
|
312 | } |
|
|
313 | |
|
|
314 | --max_distance; |
|
|
315 | } |
|
|
316 | |
|
|
317 | if (!max_distance) |
|
|
318 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
|
|
319 | else if (map && map->path[0]) |
|
|
320 | { |
|
|
321 | int flags = 0; |
|
|
322 | |
|
|
323 | if (map->tile_path[0]) flags |= 1; |
|
|
324 | if (map->tile_path[1]) flags |= 2; |
|
|
325 | if (map->tile_path[2]) flags |= 4; |
|
|
326 | if (map->tile_path[3]) flags |= 8; |
|
|
327 | |
|
|
328 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
329 | } |
|
|
330 | else |
386 | else |
331 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
387 | #endif |
|
|
388 | pl->ns->mapinfo_queue.push_back (copy); |
332 | } |
389 | } |
333 | else |
390 | else |
334 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
391 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
335 | |
|
|
336 | pl->ns->send_packet (bigbuf); |
|
|
337 | } |
392 | } |
338 | |
393 | |
339 | /** This is the Setup cmd */ |
394 | /** This is the Setup cmd */ |
340 | void |
395 | void |
341 | SetUp (char *buf, int len, client * ns) |
396 | SetUp (char *buf, int len, client * ns) |
… | |
… | |
511 | void |
566 | void |
512 | NewPlayerCmd (char *buf, int len, player *pl) |
567 | NewPlayerCmd (char *buf, int len, player *pl) |
513 | { |
568 | { |
514 | if (len <= 6) |
569 | if (len <= 6) |
515 | { |
570 | { |
516 | 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); |
517 | return; |
572 | return; |
518 | } |
573 | } |
519 | |
574 | |
520 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
575 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
521 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
576 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
… | |
… | |
659 | * syntax is: move (to) (tag) (nrof) |
714 | * syntax is: move (to) (tag) (nrof) |
660 | */ |
715 | */ |
661 | void |
716 | void |
662 | MoveCmd (char *buf, int len, player *pl) |
717 | MoveCmd (char *buf, int len, player *pl) |
663 | { |
718 | { |
664 | int vals[3], i; |
719 | int to, tag, nrof; |
665 | |
720 | |
666 | /* A little funky here. We only cycle for 2 records, because |
721 | if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
667 | * we obviously are not going to find a space after the third |
|
|
668 | * record. Perhaps we should just replace this with a |
|
|
669 | * sscanf? |
|
|
670 | */ |
|
|
671 | for (i = 0; i < 2; i++) |
|
|
672 | { |
722 | { |
673 | vals[i] = atoi (buf); |
|
|
674 | |
|
|
675 | if (!(buf = strchr (buf, ' '))) |
|
|
676 | { |
|
|
677 | LOG (llevError, "Incomplete move command: %s\n", buf); |
723 | LOG (llevError, "Incomplete move command: %s\n", buf); |
678 | return; |
724 | return; |
679 | } |
|
|
680 | |
|
|
681 | buf++; |
|
|
682 | } |
725 | } |
683 | |
726 | |
684 | vals[2] = atoi (buf); |
727 | esrv_move_object (pl->ob, to, tag, nrof); |
685 | |
|
|
686 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
|
|
687 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
|
|
688 | } |
728 | } |
689 | |
729 | |
690 | /****************************************************************************** |
730 | /****************************************************************************** |
691 | * |
731 | * |
692 | * Start of commands the server sends to the client. |
732 | * Start of commands the server sends to the client. |
… | |
… | |
793 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
833 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
794 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
834 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
795 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
835 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
796 | |
836 | |
797 | for (int s = 0; s < NUM_SKILLS; s++) |
837 | for (int s = 0; s < NUM_SKILLS; s++) |
798 | if (object *skill = opl->last_skill_ob[s]) |
838 | if (object *skill = opl->last_skill_ob [s]) |
799 | if (skill->stats.exp != ns->last_skill_exp [s]) |
839 | if (skill->stats.exp != ns->last_skill_exp [s]) |
800 | { |
840 | { |
801 | ns->last_skill_exp [s] = skill->stats.exp; |
841 | ns->last_skill_exp [s] = skill->stats.exp; |
802 | |
842 | |
803 | /* Always send along the level if exp changes. This is only |
843 | /* Always send along the level if exp changes. This is only |
… | |
… | |
859 | |
899 | |
860 | /** |
900 | /** |
861 | * 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. |
862 | */ |
902 | */ |
863 | void |
903 | void |
864 | esrv_new_player (player *pl, uint32 weight) |
904 | esrv_new_player (player *pl) |
865 | { |
905 | { |
|
|
906 | sint32 weight = pl->ob->client_weight (); |
|
|
907 | |
866 | packet sl ("player"); |
908 | packet sl ("player"); |
867 | |
909 | |
868 | sl << uint32 (pl->ob->count) |
910 | sl << uint32 (pl->ob->count) |
869 | << uint32 (weight) |
911 | << uint32 (weight) |
870 | << uint32 (pl->ob->face) |
912 | << uint32 (pl->ob->face) |
871 | << data8 (pl->ob->name); |
913 | << data8 (pl->ob->name); |
872 | |
914 | |
873 | pl->ns->last_weight = weight; |
915 | pl->ns->last_weight = weight; |
874 | pl->ns->send_packet (sl); |
916 | pl->ns->send_packet (sl); |
875 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
|
|
876 | } |
917 | } |
877 | |
918 | |
878 | /****************************************************************************** |
919 | /****************************************************************************** |
879 | * |
920 | * |
880 | * Start of map related commands. |
921 | * Start of map related commands. |
… | |
… | |
937 | |
978 | |
938 | if (!ns.faces_sent[face_num]) |
979 | if (!ns.faces_sent[face_num]) |
939 | if (ob) |
980 | if (ob) |
940 | ns.send_faces (ob); |
981 | ns.send_faces (ob); |
941 | else |
982 | else |
942 | ns.send_face (face_num); |
983 | ns.send_face (face_num, 10); |
943 | |
984 | |
944 | sl << uint16 (face_num); |
985 | sl << uint16 (face_num); |
945 | return 1; |
986 | return 1; |
946 | } |
987 | } |
947 | |
988 | |
… | |
… | |
998 | { |
1039 | { |
999 | object *ob = pl->observe; |
1040 | object *ob = pl->observe; |
1000 | if (!ob->active) |
1041 | if (!ob->active) |
1001 | return; |
1042 | return; |
1002 | |
1043 | |
1003 | maptile *plmap = ob->map; |
|
|
1004 | |
|
|
1005 | /* If player is just joining the game, he isn't here yet, so the map |
1044 | /* If player is just joining the game, he isn't here yet, so the map |
1006 | * can get swapped out. If so, don't try to send them a map. All will |
1045 | * can get swapped out. If so, don't try to send them a map. All will |
1007 | * be OK once they really log in. |
1046 | * be OK once they really log in. |
1008 | */ |
1047 | */ |
1009 | if (!plmap || plmap->in_memory != MAP_IN_MEMORY) |
1048 | if (!ob->map || ob->map->in_memory != MAP_ACTIVE) |
1010 | return; |
1049 | return; |
1011 | |
1050 | |
1012 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1051 | int startlen, oldlen; |
1013 | int estartlen, eoldlen; |
1052 | int estartlen, eoldlen; |
1014 | uint8 eentrysize; |
1053 | uint8 eentrysize; |
1015 | uint16 ewhatstart, ewhatflag; |
1054 | uint16 ewhatstart, ewhatflag; |
1016 | uint8 extendedinfos; |
1055 | uint8 extendedinfos; |
1017 | |
1056 | |
… | |
… | |
1074 | << uint8 (eentrysize); |
1113 | << uint8 (eentrysize); |
1075 | |
1114 | |
1076 | estartlen = esl.length (); |
1115 | estartlen = esl.length (); |
1077 | } |
1116 | } |
1078 | |
1117 | |
1079 | /* x,y are the real map locations. ax, ay are viewport relative |
|
|
1080 | * locations. |
|
|
1081 | */ |
|
|
1082 | ay = 0; |
|
|
1083 | |
|
|
1084 | /* We could do this logic as conditionals in the if statement, |
1118 | /* We could do this logic as conditionals in the if statement, |
1085 | * but that started to get a bit messy to look at. |
1119 | * but that started to get a bit messy to look at. |
1086 | */ |
1120 | */ |
1087 | max_x = ob->x + (socket.mapx + 1) / 2; |
1121 | int hx = socket.mapx / 2; |
1088 | max_y = ob->y + (socket.mapy + 1) / 2; |
1122 | int hy = socket.mapy / 2; |
1089 | |
1123 | |
1090 | for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++) |
1124 | for (int dx = -hx; dx <= hx; dx++) |
1091 | { |
1125 | { |
1092 | sint16 nx, ny; |
1126 | sint16 nx, ny; |
1093 | maptile *m = 0; |
1127 | maptile *m = 0; |
1094 | |
1128 | |
1095 | ax = 0; |
1129 | for (int dy = -hy; dy <= hy; dy++) |
1096 | for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++) |
|
|
1097 | { |
1130 | { |
1098 | // check to see if we can simply go one right quickly |
1131 | // check to see if we can simply go one down quickly |
1099 | ++nx; |
|
|
1100 | if (m && nx >= m->width) |
1132 | if (m && ++ny >= m->height) |
1101 | m = 0; |
1133 | m = 0; |
1102 | |
1134 | |
|
|
1135 | // no, so do it the slow way |
1103 | if (!m) |
1136 | if (!m) |
1104 | { |
1137 | { |
1105 | nx = x; ny = y; m = plmap; |
1138 | nx = ob->x + dx; ny = ob->y + dy; m = ob->map; |
1106 | |
1139 | |
1107 | if (!xy_normalise (m, nx, ny)) |
1140 | if (xy_normalise (m, nx, ny)) |
|
|
1141 | m->touch (); |
|
|
1142 | else |
1108 | m = 0; |
1143 | m = 0; |
1109 | } |
1144 | } |
|
|
1145 | |
|
|
1146 | int ax = dx + hx; |
|
|
1147 | int ay = dy + hy; |
1110 | |
1148 | |
1111 | int emask, mask; |
1149 | int emask, mask; |
1112 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1150 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1113 | |
1151 | |
1114 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1152 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
… | |
… | |
1116 | /* 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, |
1117 | * we tell the client as such |
1155 | * we tell the client as such |
1118 | */ |
1156 | */ |
1119 | if (!m) |
1157 | if (!m) |
1120 | { |
1158 | { |
1121 | /* space is out of map. Update space and clear values |
1159 | /* space is out of map. Update space and clear values |
1122 | * 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 |
1123 | * of the map, it shouldn't have a head |
1161 | * of the map, it shouldn't have a head. |
1124 | */ |
1162 | */ |
1125 | if (lastcell.count != -1) |
1163 | if (lastcell.count != -1) |
1126 | { |
1164 | { |
1127 | sl << uint16 (mask); |
1165 | sl << uint16 (mask); |
1128 | map_clearcell (&lastcell, -1); |
1166 | map_clearcell (&lastcell, -1); |
1129 | } |
1167 | } |
1130 | |
1168 | |
1131 | continue; |
1169 | continue; |
1132 | } |
1170 | } |
1133 | |
1171 | |
1134 | m->touch (); |
|
|
1135 | |
|
|
1136 | int d = pl->blocked_los[ax][ay]; |
1172 | int d = pl->blocked_los_uc (dx, dy); |
1137 | |
1173 | |
1138 | if (d > 3) |
1174 | if (d > 3) |
1139 | { |
1175 | { |
1140 | |
|
|
1141 | int need_send = 0, count; |
1176 | int need_send = 0, count; |
1142 | |
1177 | |
1143 | /* This block deals with spaces that are not visible for whatever |
1178 | /* This block deals with spaces that are not visible for whatever |
1144 | * reason. Still may need to send the head for this space. |
1179 | * reason. Still may need to send the head for this space. |
1145 | */ |
1180 | */ |
… | |
… | |
1151 | if (lastcell.count != -1) |
1186 | if (lastcell.count != -1) |
1152 | need_send = 1; |
1187 | need_send = 1; |
1153 | |
1188 | |
1154 | count = -1; |
1189 | count = -1; |
1155 | |
1190 | |
1156 | /* properly clear a previously sent big face */ |
|
|
1157 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1191 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1158 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1192 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1159 | need_send = 1; |
1193 | need_send = 1; |
1160 | |
1194 | |
|
|
1195 | /* properly clear a previously sent big face */ |
1161 | map_clearcell (&lastcell, count); |
1196 | map_clearcell (&lastcell, count); |
1162 | |
1197 | |
1163 | if ((mask & 0xf) || need_send) |
1198 | if ((mask & 0xf) || need_send) |
1164 | sl[oldlen + 1] = mask & 0xff; |
1199 | sl[oldlen + 1] = mask & 0xff; |
1165 | else |
1200 | else |
… | |
… | |
1215 | uint8 flags = 0; |
1250 | uint8 flags = 0; |
1216 | tag_t player = 0; |
1251 | tag_t player = 0; |
1217 | |
1252 | |
1218 | // send hp information, if applicable |
1253 | // send hp information, if applicable |
1219 | if (object *op = ms.faces_obj [0]) |
1254 | if (object *op = ms.faces_obj [0]) |
1220 | { |
|
|
1221 | if (op->head || op->invisible) |
1255 | if (op->is_head () && !op->invisible) |
1222 | ; // do not show |
|
|
1223 | else if (op->type == PLAYER |
|
|
1224 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
|
|
1225 | { |
1256 | { |
1226 | 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))) |
1227 | { |
1264 | { |
1228 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1265 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1229 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
1266 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
1230 | } |
1267 | } |
1231 | } |
|
|
1232 | |
1268 | |
1233 | if (op->msg && op->msg[0] == '@') |
1269 | if (op->has_dialogue ()) |
1234 | flags |= 1; |
1270 | flags |= 1; |
1235 | |
1271 | |
1236 | if (op->type == PLAYER && op != ob) |
1272 | if (op->type == PLAYER) |
1237 | player = op->count; |
1273 | player = op == ob ? pl->ob->count |
|
|
1274 | : op == pl->ob ? ob->count |
|
|
1275 | : op->count; |
1238 | } |
1276 | } |
1239 | |
1277 | |
1240 | if (lastcell.stat_hp != stat_hp) |
1278 | if (lastcell.stat_hp != stat_hp) |
1241 | { |
1279 | { |
1242 | lastcell.stat_hp = stat_hp; |
1280 | lastcell.stat_hp = stat_hp; |
1243 | |
1281 | |
… | |
… | |
1285 | |
1323 | |
1286 | /* Middle face */ |
1324 | /* Middle face */ |
1287 | if (update_space (sl, socket, ms, lastcell, 1)) |
1325 | if (update_space (sl, socket, ms, lastcell, 1)) |
1288 | mask |= 0x2; |
1326 | mask |= 0x2; |
1289 | |
1327 | |
|
|
1328 | if (ob->invisible |
|
|
1329 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
1290 | if (ms.player () == ob |
1330 | && ms.player () == ob) |
1291 | && (ob->invisible & (ob->invisible < 50 ? 1 : 7))) |
|
|
1292 | { |
1331 | { |
1293 | // force player to be visible to himself if invisible |
1332 | // force player to be visible to himself if invisible |
1294 | if (lastcell.faces[0] != ob->face) |
1333 | if (lastcell.faces[0] != ob->face) |
1295 | { |
1334 | { |
1296 | lastcell.faces[0] = ob->face; |
1335 | lastcell.faces[0] = ob->face; |
… | |
… | |
1392 | { |
1431 | { |
1393 | packet sl; |
1432 | packet sl; |
1394 | sl << "replyinfo skill_info\n"; |
1433 | sl << "replyinfo skill_info\n"; |
1395 | |
1434 | |
1396 | for (int i = 1; i < NUM_SKILLS; i++) |
1435 | for (int i = 1; i < NUM_SKILLS; i++) |
1397 | 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]); |
1398 | |
1437 | |
1399 | if (sl.length () >= MAXSOCKBUF) |
1438 | if (sl.length () > MAXSOCKBUF) |
1400 | { |
1439 | { |
1401 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1440 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1402 | fatal (0); |
1441 | fatal (0); |
1403 | } |
1442 | } |
1404 | |
1443 | |
… | |
… | |
1417 | sl << "replyinfo spell_paths\n"; |
1456 | sl << "replyinfo spell_paths\n"; |
1418 | |
1457 | |
1419 | for (int i = 0; i < NRSPELLPATHS; i++) |
1458 | for (int i = 0; i < NRSPELLPATHS; i++) |
1420 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1459 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1421 | |
1460 | |
1422 | if (sl.length () >= MAXSOCKBUF) |
1461 | if (sl.length () > MAXSOCKBUF) |
1423 | { |
1462 | { |
1424 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1463 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1425 | fatal (0); |
1464 | fatal (0); |
1426 | } |
1465 | } |
1427 | |
1466 | |
… | |
… | |
1446 | if (spell->type == SPELL) |
1485 | if (spell->type == SPELL) |
1447 | { |
1486 | { |
1448 | int flags = 0; |
1487 | int flags = 0; |
1449 | |
1488 | |
1450 | /* check if we need to update it */ |
1489 | /* check if we need to update it */ |
1451 | 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)) |
1452 | { |
1491 | { |
1453 | 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); |
1454 | flags |= UPD_SP_MANA; |
1493 | flags |= UPD_SP_MANA; |
1455 | } |
1494 | } |
1456 | |
1495 | |
1457 | 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)) |
1458 | { |
1497 | { |
1459 | 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); |
1460 | flags |= UPD_SP_GRACE; |
1499 | flags |= UPD_SP_GRACE; |
1461 | } |
1500 | } |
1462 | |
1501 | |
1463 | 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)) |
1464 | { |
1503 | { |
1465 | 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); |
1466 | flags |= UPD_SP_DAMAGE; |
1505 | flags |= UPD_SP_DAMAGE; |
1467 | } |
1506 | } |
1468 | |
1507 | |
1469 | if (flags) |
1508 | if (flags) |
1470 | { |
1509 | { |
… | |
… | |
1472 | |
1511 | |
1473 | sl << "updspell " |
1512 | sl << "updspell " |
1474 | << uint8 (flags) |
1513 | << uint8 (flags) |
1475 | << uint32 (spell->count); |
1514 | << uint32 (spell->count); |
1476 | |
1515 | |
1477 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1516 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
1478 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1517 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace); |
1479 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1518 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat); |
1480 | |
1519 | |
1481 | pl->ns->send_packet (sl); |
1520 | pl->ns->send_packet (sl); |
1482 | } |
1521 | } |
1483 | } |
1522 | } |
1484 | } |
1523 | } |
… | |
… | |
1514 | 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); |
1515 | return; |
1554 | return; |
1516 | } |
1555 | } |
1517 | |
1556 | |
1518 | /* 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 */ |
1519 | 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); |
1520 | 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); |
1521 | 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); |
1522 | |
1561 | |
1523 | /* figure out which skill it uses, if it uses one */ |
1562 | /* figure out which skill it uses, if it uses one */ |
1524 | if (spell->skill) |
1563 | if (spell->skill) |
1525 | { |
1564 | if (object *tmp = pl->find_skill (spell->skill)) |
1526 | for (i = 1; i < NUM_SKILLS; i++) |
|
|
1527 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1528 | { |
|
|
1529 | skill = i + CS_STAT_SKILLINFO; |
1565 | skill = tmp->subtype + CS_STAT_SKILLINFO; |
1530 | break; |
|
|
1531 | } |
|
|
1532 | } |
|
|
1533 | |
1566 | |
1534 | // spells better have a face |
1567 | // spells better have a face |
1535 | if (!spell->face) |
1568 | if (!spell->face) |
1536 | { |
1569 | { |
1537 | 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); |
1538 | spell->face = face_find ("burnout.x11", blank_face); |
1571 | spell->face = face_find ("burnout.x11", blank_face); |
1539 | } |
1572 | } |
|
|
1573 | |
|
|
1574 | pl->ns->send_face (spell->face); |
1540 | |
1575 | |
1541 | /* send the current values */ |
1576 | /* send the current values */ |
1542 | sl << uint32 (spell->count) |
1577 | sl << uint32 (spell->count) |
1543 | << uint16 (spell->level) |
1578 | << uint16 (spell->level) |
1544 | << uint16 (spell->casting_time) |
1579 | << uint16 (spell->casting_time) |
1545 | << uint16 (spell->last_sp) |
1580 | << uint16 (spell->cached_sp) |
1546 | << uint16 (spell->last_grace) |
1581 | << uint16 (spell->cached_grace) |
1547 | << uint16 (spell->last_eat) |
1582 | << uint16 (spell->cached_eat) |
1548 | << uint8 (skill) |
1583 | << uint8 (skill) |
1549 | << uint32 (spell->path_attuned) |
1584 | << uint32 (spell->path_attuned) |
1550 | << uint32 (spell->face) |
1585 | << uint32 (spell->face) |
1551 | << data8 (spell->name) |
1586 | << data8 (spell->name) |
1552 | << data16 (spell->msg); |
1587 | << data16 (spell->msg); |
… | |
… | |
1580 | * 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 |
1581 | * 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, |
1582 | * 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, |
1583 | * 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 |
1584 | */ |
1619 | */ |
|
|
1620 | if (spell->type != SPELL) |
|
|
1621 | continue; |
|
|
1622 | |
1585 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1623 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1586 | * 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 |
1587 | * 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 |
1588 | * like it will fix this |
1626 | * like it will fix this |
1589 | */ |
1627 | */ |
1590 | if (spell->type != SPELL) |
|
|
1591 | continue; |
|
|
1592 | |
|
|
1593 | 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)))) |
1594 | { |
1629 | { |
|
|
1630 | pl->ns->flush_fx (); |
1595 | pl->ns->send_packet (sl); |
1631 | pl->ns->send_packet (sl); |
1596 | |
1632 | |
1597 | sl.reset (); |
1633 | sl.reset (); |
1598 | sl << "addspell "; |
1634 | sl << "addspell "; |
1599 | } |
1635 | } |
… | |
… | |
1607 | return; |
1643 | return; |
1608 | } |
1644 | } |
1609 | else |
1645 | else |
1610 | append_spell (pl, sl, spell); |
1646 | append_spell (pl, sl, spell); |
1611 | |
1647 | |
1612 | if (sl.length () >= MAXSOCKBUF) |
1648 | if (sl.length () > MAXSOCKBUF) |
1613 | { |
1649 | { |
1614 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1650 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1615 | fatal (0); |
1651 | fatal (0); |
1616 | } |
1652 | } |
1617 | |
1653 | |
1618 | /* finally, we can send the packet */ |
1654 | /* finally, we can send the packet */ |
|
|
1655 | pl->ns->flush_fx (); |
1619 | pl->ns->send_packet (sl); |
1656 | pl->ns->send_packet (sl); |
1620 | } |
1657 | } |
1621 | |
1658 | |