ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.35
Committed: Thu Dec 14 02:37:37 2006 UTC (17 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.34: +23 -23 lines
Log Message:
moar\! rewrite\!

File Contents

# User Rev Content
1 elmex 1.1 /*
2     CrossFire, A Multiplayer game for X-windows
3    
4     Copyright (C) 2001 Mark Wedel
5     Copyright (C) 1992 Frank Tore Johansen
6    
7     This program is free software; you can redistribute it and/or modify
8     it under the terms of the GNU General Public License as published by
9     the Free Software Foundation; either version 2 of the License, or
10     (at your option) any later version.
11    
12     This program is distributed in the hope that it will be useful,
13     but WITHOUT ANY WARRANTY; without even the implied warranty of
14     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15     GNU General Public License for more details.
16    
17     You should have received a copy of the GNU General Public License
18     along with this program; if not, write to the Free Software
19     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20    
21 root 1.19 The author can be reached via e-mail to <crossfire@schmorp.de>
22 elmex 1.1 */
23    
24     /**
25     * \file
26     * Client handling.
27     *
28     * \date 2003-12-02
29     *
30     * This file implements all of the goo on the server side for handling
31     * clients. It's got a bunch of global variables for keeping track of
32     * each of the clients.
33     *
34     * Note: All functions that are used to process data from the client
35     * have the prototype of (char *data, int datalen, int client_num). This
36     * way, we can use one dispatch table.
37     *
38     * esrv_map_new starts updating the map
39     *
40     * esrv_map_setbelow allows filling in all of the faces for the map.
41     * if a face has not already been sent to the client, it is sent now.
42     *
43     * mapcellchanged, compactlayer, compactstack, perform the map compressing
44     * operations
45     *
46     */
47    
48     #include <global.h>
49     #include <sproto.h>
50    
51     #include <newclient.h>
52     #include <newserver.h>
53     #include <living.h>
54     #include <commands.h>
55    
56     /* This block is basically taken from socket.c - I assume if it works there,
57     * it should work here.
58     */
59 pippijn 1.26 #include <sys/types.h>
60     #include <sys/time.h>
61     #include <sys/socket.h>
62     #include <netinet/in.h>
63     #include <netdb.h>
64 elmex 1.1
65     #ifdef HAVE_UNISTD_H
66 root 1.16 # include <unistd.h>
67 elmex 1.1 #endif
68    
69     #ifdef HAVE_SYS_TIME_H
70 root 1.16 # include <sys/time.h>
71 elmex 1.1 #endif
72    
73     #include "sounds.h"
74    
75     /**
76     * This table translates the attack numbers as used within the
77     * program to the value we use when sending STATS command to the
78     * client. If a value is -1, then we don't send that to the
79     * client.
80     */
81 root 1.16 short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,
82     CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,
83     CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,
84     CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,
85     CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,
86     CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,
87     CS_STAT_RES_FEAR, -1 /* Cancellation */ ,
88     CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH,
89     -1 /* Chaos */ , -1 /* Counterspell */ ,
90     -1 /* Godpower */ , CS_STAT_RES_HOLYWORD,
91     CS_STAT_RES_BLIND,
92     -1, /* Internal */
93     -1, /* life stealing */
94     -1 /* Disease - not fully done yet */
95 elmex 1.1 };
96    
97 root 1.2 static void
98 root 1.35 socket_map_scroll (client_socket * ns, int dx, int dy)
99 root 1.2 {
100 root 1.16 struct Map newmap;
101     int x, y, mx, my;
102 root 1.2
103 root 1.16 {
104 root 1.33 packet sl;
105 root 1.2
106 root 1.32 sl.printf ("map_scroll %d %d", dx, dy);
107     ns->send_packet (sl);
108 root 1.16 }
109 root 1.2
110 root 1.16 /* If we are using the Map1aCmd, we may in fact send
111     * head information that is outside the viewable map.
112     * So set the mx,my to the max value we want to
113     * look for. Removed code to do so - it caused extra
114     * complexities for the client, and probably doesn't make
115     * that much difference in bandwidth.
116     */
117     mx = ns->mapx;
118     my = ns->mapy;
119 root 1.2
120 root 1.16 if (ns->mapmode == Map1aCmd)
121     {
122     mx += MAX_HEAD_OFFSET;
123     my += MAX_HEAD_OFFSET;
124 root 1.2 }
125    
126 root 1.16 /* the x and y here are coordinates for the new map, i.e. if we moved
127     * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
128     * if the destination x or y coordinate is outside the viewable
129     * area, we clear the values - otherwise, the old values
130     * are preserved, and the check_head thinks it needs to clear them.
131     */
132     for (x = 0; x < mx; x++)
133     {
134     for (y = 0; y < my; y++)
135     {
136     if (x >= ns->mapx || y >= ns->mapy)
137 root 1.25 /* clear cells outside the viewable area */
138     memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
139 root 1.16 else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)
140 root 1.25 /* clear newly visible tiles within the viewable area */
141     memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
142 root 1.16 else
143 root 1.25 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
144 root 1.12 }
145 root 1.2 }
146    
147 root 1.16 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
148 root 1.2
149 root 1.16 /* Make sure that the next "map1" command will be sent (even if it is
150     * empty).
151     */
152     ns->sent_scroll = 1;
153 root 1.2 }
154    
155 root 1.7 static void
156     clear_map (player *pl)
157     {
158 root 1.35 client_socket & socket = pl->socket;
159 root 1.7
160     memset (&socket.lastmap, 0, sizeof (socket.lastmap));
161    
162     if (socket.newmapcmd == 1)
163 root 1.32 socket.send_packet ("newmap");
164 root 1.7
165 root 1.16 socket.update_look = 1;
166 root 1.7 socket.look_position = 0;
167     }
168    
169 elmex 1.1 /** check for map change and send new map data */
170     static void
171     check_map_change (player *pl)
172     {
173 root 1.35 client_socket & socket = pl->socket;
174 root 1.2 object *ob = pl->ob;
175 root 1.16 char buf[MAX_BUF]; /* eauugggh */
176 elmex 1.1
177 root 1.2 if (socket.current_map != ob->map)
178     {
179     socket.current_map = ob->map;
180 elmex 1.1
181 root 1.7 clear_map (pl);
182 elmex 1.1
183 root 1.2 if (socket.mapinfocmd)
184 elmex 1.1 {
185 root 1.16 if (ob->map && ob->map->path[0])
186 root 1.2 {
187     int flags = 0;
188 elmex 1.1
189 root 1.16 if (ob->map->tile_path[0])
190     flags |= 1;
191     if (ob->map->tile_path[1])
192     flags |= 2;
193     if (ob->map->tile_path[2])
194     flags |= 4;
195     if (ob->map->tile_path[3])
196     flags |= 8;
197 root 1.2
198     snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
199 root 1.16 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path);
200 root 1.2 }
201     else
202     snprintf (buf, MAX_BUF, "mapinfo current");
203 elmex 1.1
204 root 1.32 socket.send_packet (buf);
205 root 1.16 }
206 elmex 1.1 }
207 root 1.2 else if (socket.current_x != ob->x || socket.current_y != ob->y)
208     {
209 root 1.7 int dx = ob->x - socket.current_x;
210     int dy = ob->y - socket.current_y;
211    
212     if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
213 root 1.16 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
214 root 1.7 else
215     {
216     socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
217     socket.update_look = 1;
218     socket.look_position = 0;
219     }
220 root 1.2 }
221    
222     socket.current_x = ob->x;
223     socket.current_y = ob->y;
224 elmex 1.1 }
225    
226 root 1.16 void
227     ExtCmd (char *buf, int len, player *pl)
228 elmex 1.1 {
229 root 1.10 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
230 elmex 1.1 }
231    
232 root 1.16 void
233     MapInfoCmd (char *buf, int len, player *pl)
234 elmex 1.1 {
235     // <mapinfo tag spatial tile-path
236     // >mapinfo tag spatial flags x y w h hash
237 root 1.16
238 pippijn 1.15 char bigbuf[MAX_BUF], *token;
239 elmex 1.1
240     token = buf;
241     // copy token
242     if (!(buf = strchr (buf, ' ')))
243     return;
244    
245     *buf++ = 0;
246    
247     if (!strncmp (buf, "spatial ", 8))
248     {
249     buf += 8;
250    
251     // initial map and its origin
252 root 1.21 maptile *map = pl->ob->map;
253 elmex 1.1 sint16 dx, dy;
254     int mapx = pl->socket.mapx / 2 - pl->ob->x;
255     int mapy = pl->socket.mapy / 2 - pl->ob->y;
256 root 1.16 int max_distance = 8; // limit maximum path length to something generous
257 elmex 1.1
258     while (*buf && map && max_distance)
259     {
260     int dir = *buf++;
261    
262     switch (dir)
263     {
264 root 1.16 case '1':
265     dx = 0;
266     dy = -1;
267     map = get_map_from_coord (map, &dx, &dy);
268     map && (mapy -= map->height);
269     break;
270     case '2':
271     mapx += map->width;
272     dx = map->width;
273     dy = 0;
274     map = get_map_from_coord (map, &dx, &dy);
275     break;
276     case '3':
277     mapy += map->height;
278     dx = 0;
279     dy = map->height;
280     map = get_map_from_coord (map, &dx, &dy);
281     break;
282     case '4':
283     dx = -1;
284     dy = 0;
285     map = get_map_from_coord (map, &dx, &dy);
286     map && (mapx -= map->width);
287     break;
288 elmex 1.1 }
289    
290     --max_distance;
291     }
292    
293     if (!max_distance)
294     snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
295 root 1.16 else if (map && map->path[0])
296 elmex 1.1 {
297     int flags = 0;
298    
299 root 1.16 if (map->tile_path[0])
300     flags |= 1;
301     if (map->tile_path[1])
302     flags |= 2;
303     if (map->tile_path[2])
304     flags |= 4;
305     if (map->tile_path[3])
306     flags |= 8;
307    
308     snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path);
309 elmex 1.1 }
310     else
311     snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
312     }
313     else
314     snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
315 root 1.16
316 root 1.32 pl->socket.send_packet (bigbuf);
317 elmex 1.1 }
318    
319     /** This is the Setup cmd - easy first implementation */
320 root 1.16 void
321 root 1.35 SetUp (char *buf, int len, client_socket * ns)
322 elmex 1.1 {
323 root 1.16 int s, slen;
324     char *cmd, *param, cmdback[HUGE_BUF];
325    
326     /* run through the cmds of setup
327     * syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ...
328     *
329     * we send the status of the cmd back, or a FALSE is the cmd is the server unknown
330     * The client then must sort this out
331     */
332    
333 root 1.32 //LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
334    
335 root 1.16 strcpy (cmdback, "setup");
336 root 1.32 for (s = 0; s < len; )
337 root 1.16 {
338     cmd = &buf[s];
339 root 1.12
340 root 1.16 /* find the next space, and put a null there */
341 root 1.32 for (; buf[s] && buf[s] != ' '; s++)
342     ;
343    
344 root 1.16 buf[s++] = 0;
345 root 1.32
346 root 1.16 while (buf[s] == ' ')
347     s++;
348    
349     if (s >= len)
350     break;
351    
352     param = &buf[s];
353 root 1.12
354 root 1.32 for (; buf[s] && buf[s] != ' '; s++)
355     ;
356    
357 root 1.16 buf[s++] = 0;
358 root 1.32
359 root 1.16 while (buf[s] == ' ')
360     s++;
361    
362     slen = strlen (cmdback);
363     safe_strcat (cmdback, " ", &slen, HUGE_BUF);
364     safe_strcat (cmdback, cmd, &slen, HUGE_BUF);
365     safe_strcat (cmdback, " ", &slen, HUGE_BUF);
366 root 1.12
367 root 1.16 if (!strcmp (cmd, "sound"))
368     {
369     ns->sound = atoi (param);
370     safe_strcat (cmdback, param, &slen, HUGE_BUF);
371     }
372     else if (!strcmp (cmd, "exp64"))
373     {
374     ns->exp64 = atoi (param);
375     safe_strcat (cmdback, param, &slen, HUGE_BUF);
376     }
377     else if (!strcmp (cmd, "spellmon"))
378     {
379     ns->monitor_spells = atoi (param);
380     safe_strcat (cmdback, param, &slen, HUGE_BUF);
381     }
382     else if (!strcmp (cmd, "darkness"))
383     {
384     ns->darkness = atoi (param);
385     safe_strcat (cmdback, param, &slen, HUGE_BUF);
386     }
387     else if (!strcmp (cmd, "map1cmd"))
388     {
389     if (atoi (param))
390     ns->mapmode = Map1Cmd;
391     /* if beyond this size, need to use map1cmd no matter what */
392     if (ns->mapx > 11 || ns->mapy > 11)
393     ns->mapmode = Map1Cmd;
394     safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF);
395     }
396     else if (!strcmp (cmd, "map1acmd"))
397     {
398     if (atoi (param))
399     ns->mapmode = Map1aCmd;
400     /* if beyond this size, need to use map1acmd no matter what */
401     if (ns->mapx > 11 || ns->mapy > 11)
402     ns->mapmode = Map1aCmd;
403     safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF);
404     }
405     else if (!strcmp (cmd, "newmapcmd"))
406     {
407     ns->newmapcmd = atoi (param);
408     safe_strcat (cmdback, param, &slen, HUGE_BUF);
409 elmex 1.1 // } else if (!strcmp(cmd,"plugincmd")) {
410     // ns->plugincmd = atoi(param);
411 root 1.16 // safe_strcat(cmdback, param, &slen, HUGE_BUF);
412     }
413     else if (!strcmp (cmd, "mapinfocmd"))
414     {
415     ns->mapinfocmd = atoi (param);
416     safe_strcat (cmdback, "1", &slen, HUGE_BUF);
417     }
418     else if (!strcmp (cmd, "extcmd"))
419     {
420     ns->extcmd = atoi (param);
421     safe_strcat (cmdback, "1", &slen, HUGE_BUF);
422     }
423     else if (!strcmp (cmd, "extmap"))
424     {
425     ns->extmap = atoi (param);
426     safe_strcat (cmdback, "1", &slen, HUGE_BUF);
427     }
428     else if (!strcmp (cmd, "facecache"))
429     {
430     ns->facecache = atoi (param);
431     safe_strcat (cmdback, param, &slen, HUGE_BUF);
432     }
433     else if (!strcmp (cmd, "faceset"))
434     {
435     char tmpbuf[20];
436     int q = atoi (param);
437    
438     if (is_valid_faceset (q))
439     ns->faceset = q;
440     sprintf (tmpbuf, "%d", ns->faceset);
441     safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
442     /* if the client is using faceset, it knows about image2 command */
443     ns->image2 = 1;
444     }
445     else if (!strcmp (cmd, "itemcmd"))
446     {
447     /* Version of the item protocol command to use. Currently,
448     * only supported versions are 1 and 2. Using a numeric
449     * value will make it very easy to extend this in the future.
450     */
451     char tmpbuf[20];
452     int q = atoi (param);
453    
454     if (q < 1 || q > 2)
455     {
456     strcpy (tmpbuf, "FALSE");
457     }
458     else
459     {
460     ns->itemcmd = q;
461     sprintf (tmpbuf, "%d", ns->itemcmd);
462     }
463     safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
464     }
465     else if (!strcmp (cmd, "mapsize"))
466     {
467     int x, y = 0;
468     char tmpbuf[MAX_BUF], *cp;
469    
470     x = atoi (param);
471     for (cp = param; *cp != 0; cp++)
472     if (*cp == 'x' || *cp == 'X')
473     {
474     y = atoi (cp + 1);
475     break;
476     }
477     if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
478     {
479     sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
480     safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
481     }
482     else
483     {
484     ns->mapx = x;
485     ns->mapy = y;
486     /* better to send back what we are really using and not the
487     * param as given to us in case it gets parsed differently.
488     */
489     sprintf (tmpbuf, "%dx%d", x, y);
490     safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
491     /* If beyond this size and still using orig map command, need to
492     * go to map1cmd.
493     */
494     if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd)
495     ns->mapmode = Map1Cmd;
496     }
497     }
498     else if (!strcmp (cmd, "extendedMapInfos"))
499     {
500     /* Added by tchize
501     * prepare to use the mapextended command
502     */
503     char tmpbuf[20];
504    
505     ns->ext_mapinfos = (atoi (param));
506     sprintf (tmpbuf, "%d", ns->ext_mapinfos);
507     safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
508     }
509     else if (!strcmp (cmd, "extendedTextInfos"))
510     {
511     /* Added by tchize
512     * prepare to use the extended text commands
513     * Client toggle this to non zero to get exttext
514     */
515     char tmpbuf[20];
516    
517     ns->has_readable_type = (atoi (param));
518     sprintf (tmpbuf, "%d", ns->has_readable_type);
519     safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
520     }
521     else
522     {
523     /* Didn't get a setup command we understood -
524     * report a failure to the client.
525     */
526     safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
527     }
528     } /* for processing all the setup commands */
529 root 1.32
530 root 1.16 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
531 root 1.32 ns->send_packet (cmdback);
532 elmex 1.1 }
533    
534     /**
535     * The client has requested to be added to the game.
536     * This is what takes care of it. We tell the client how things worked out.
537     * I am not sure if this file is the best place for this function. however,
538     * it either has to be here or init_sockets needs to be exported.
539     */
540 root 1.16 void
541 root 1.35 AddMeCmd (char *buf, int len, client_socket * ns)
542 elmex 1.1 {
543 root 1.16 Settings oldsettings;
544    
545     oldsettings = settings;
546     if (ns->status != Ns_Add || add_player (ns))
547 root 1.32 ns->send_packet ("addme_failed");
548 root 1.16 else
549     {
550     /* Basically, the add_player copies the socket structure into
551     * the player structure, so this one (which is from init_sockets)
552     * is not needed anymore. The write below should still work, as the
553     * stuff in ns is still relevant.
554     */
555 root 1.32 ns->send_packet ("addme_success");
556 root 1.16 socket_info.nconns--;
557     ns->status = Ns_Avail;
558 elmex 1.1 }
559 root 1.32
560 root 1.16 settings = oldsettings;
561 elmex 1.1 }
562    
563     /** Reply to ExtendedInfos command */
564 root 1.16 void
565 root 1.35 ToggleExtendedInfos (char *buf, int len, client_socket * ns)
566 root 1.16 {
567     char cmdback[MAX_BUF];
568     char command[50];
569     int info, nextinfo;
570    
571     cmdback[0] = '\0';
572     nextinfo = 0;
573 root 1.17
574 root 1.16 while (1)
575     {
576     /* 1. Extract an info */
577     info = nextinfo;
578 root 1.17
579 root 1.16 while ((info < len) && (buf[info] == ' '))
580     info++;
581 root 1.17
582 root 1.16 if (info >= len)
583     break;
584 root 1.17
585 root 1.16 nextinfo = info + 1;
586 root 1.17
587 root 1.16 while ((nextinfo < len) && (buf[nextinfo] != ' '))
588     nextinfo++;
589 root 1.17
590 root 1.16 if (nextinfo - info >= 49) /*Erroneous info asked */
591     continue;
592 root 1.17
593 root 1.16 strncpy (command, &(buf[info]), nextinfo - info);
594 root 1.17
595 root 1.16 /* 2. Interpret info */
596     if (!strcmp ("smooth", command))
597 root 1.17 /* Toggle smoothing */
598     ns->EMI_smooth = !ns->EMI_smooth;
599 root 1.16 else
600 root 1.17 /*bad value */;
601    
602 root 1.16 /*3. Next info */
603     }
604 root 1.17
605 root 1.16 strcpy (cmdback, "ExtendedInfoSet");
606 root 1.17
607 root 1.16 if (ns->EMI_smooth)
608     {
609     strcat (cmdback, " ");
610     strcat (cmdback, "smoothing");
611     }
612 root 1.17
613 root 1.32 ns->send_packet (cmdback);
614 elmex 1.1 }
615 root 1.16
616 elmex 1.1 /*
617     #define MSG_TYPE_BOOK 1
618     #define MSG_TYPE_CARD 2
619     #define MSG_TYPE_PAPER 3
620     #define MSG_TYPE_SIGN 4
621     #define MSG_TYPE_MONUMENT 5
622     #define MSG_TYPE_SCRIPTED_DIALOG 6*/
623 root 1.16
624 elmex 1.1 /** Reply to ExtendedInfos command */
625 root 1.16 void
626 root 1.35 ToggleExtendedText (char *buf, int len, client_socket * ns)
627 root 1.16 {
628     char cmdback[MAX_BUF];
629     char temp[10];
630     char command[50];
631     int info, nextinfo, i, flag;
632    
633     cmdback[0] = '\0';
634 root 1.17
635 root 1.16 nextinfo = 0;
636     while (1)
637     {
638     /* 1. Extract an info */
639     info = nextinfo;
640 root 1.17
641 root 1.16 while ((info < len) && (buf[info] == ' '))
642     info++;
643 root 1.17
644 root 1.16 if (info >= len)
645     break;
646 root 1.17
647 root 1.16 nextinfo = info + 1;
648 root 1.17
649 root 1.16 while ((nextinfo < len) && (buf[nextinfo] != ' '))
650     nextinfo++;
651 root 1.17
652 root 1.16 if (nextinfo - info >= 49) /*Erroneous info asked */
653     continue;
654 root 1.17
655 root 1.16 strncpy (command, &(buf[info]), nextinfo - info);
656     command[nextinfo - info] = '\0';
657     /* 2. Interpret info */
658     i = sscanf (command, "%d", &flag);
659 root 1.17
660 root 1.16 if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
661     ns->supported_readables |= (1 << flag);
662     /*3. Next info */
663     }
664 root 1.17
665 root 1.16 /* Send resulting state */
666     strcpy (cmdback, "ExtendedTextSet");
667 root 1.17
668 root 1.16 for (i = 0; i <= MSG_TYPE_LAST; i++)
669     if (ns->supported_readables & (1 << i))
670     {
671     strcat (cmdback, " ");
672     snprintf (temp, sizeof (temp), "%d", i);
673     strcat (cmdback, temp);
674     }
675 root 1.17
676 root 1.32 ns->send_packet (cmdback);
677 elmex 1.1 }
678    
679     /**
680     * A lot like the old AskSmooth (in fact, now called by AskSmooth).
681     * Basically, it makes no sense to wait for the client to request a
682     * a piece of data from us that we know the client wants. So
683     * if we know the client wants it, might as well push it to the
684     * client.
685     */
686 root 1.16 static void
687 root 1.35 SendSmooth (client_socket * ns, uint16 face)
688 root 1.16 {
689     uint16 smoothface;
690    
691     /* If we can't find a face, return and set it so we won't try to send this
692     * again.
693     */
694     if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface)))
695     {
696    
697     LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name);
698     ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
699     return;
700     }
701    
702     if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
703     esrv_send_face (ns, smoothface, 0);
704    
705     ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
706    
707 root 1.33 packet sl;
708 root 1.27
709 root 1.28 sl << "smooth "
710     << uint16 (face)
711     << uint16 (smoothface);
712 root 1.27
713 root 1.16 Send_With_Handling (ns, &sl);
714 elmex 1.1 }
715    
716     /**
717     * Tells client the picture it has to use
718     * to smooth a picture number given as argument.
719     */
720 root 1.16 void
721 root 1.35 AskSmooth (char *buf, int len, client_socket * ns)
722 root 1.16 {
723     uint16 facenbr;
724 elmex 1.1
725 root 1.16 facenbr = atoi (buf);
726     SendSmooth (ns, facenbr);
727 elmex 1.1 }
728    
729     /**
730     * This handles the general commands from the client (ie, north, fire, cast,
731     * etc.)
732     */
733 root 1.16 void
734     PlayerCmd (char *buf, int len, player *pl)
735 elmex 1.1 {
736    
737 root 1.16 /* The following should never happen with a proper or honest client.
738     * Therefore, the error message doesn't have to be too clear - if
739     * someone is playing with a hacked/non working client, this gives them
740     * an idea of the problem, but they deserve what they get
741     */
742     if (pl->state != ST_PLAYING)
743     {
744     new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
745     return;
746     }
747     /* Check if there is a count. In theory, a zero count could also be
748     * sent, so check for that also.
749     */
750     if (atoi (buf) || buf[0] == '0')
751     {
752     pl->count = atoi ((char *) buf);
753     buf = strchr (buf, ' '); /* advance beyond the numbers */
754     if (!buf)
755     {
756 elmex 1.1 #ifdef ESRV_DEBUG
757 root 1.16 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
758 elmex 1.1 #endif
759 root 1.16 return;
760 root 1.12 }
761 root 1.16 buf++;
762 elmex 1.1 }
763 root 1.16 /* This should not happen anymore. */
764     if (pl->ob->speed_left < -1.0)
765     {
766     LOG (llevError, "Player has negative time - shouldn't do command.\n");
767     }
768     /* In c_new.c */
769     execute_newserver_command (pl->ob, (char *) buf);
770     /* Perhaps something better should be done with a left over count.
771     * Cleaning up the input should probably be done first - all actions
772     * for the command that issued the count should be done before any other
773     * commands.
774     */
775 elmex 1.1
776 root 1.16 pl->count = 0;
777 elmex 1.1
778     }
779    
780    
781     /**
782     * This handles the general commands from the client (ie, north, fire, cast,
783     * etc.). It is a lot like PlayerCmd above, but is called with the
784     * 'ncom' method which gives more information back to the client so it
785     * can throttle.
786     */
787 root 1.16 void
788     NewPlayerCmd (uint8 * buf, int len, player *pl)
789 elmex 1.1 {
790 root 1.16 int time, repeat;
791 root 1.28 char command[MAX_BUF];
792 root 1.33 int pktlen;
793 root 1.16
794     if (len < 7)
795     {
796     LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
797     return;
798     }
799    
800 root 1.33 pktlen = net_uint16 (buf);
801 root 1.30 repeat = net_uint32 (buf + 2);
802    
803 root 1.16 /* -1 is special - no repeat, but don't update */
804     if (repeat != -1)
805 root 1.28 pl->count = repeat;
806    
807 root 1.16 if ((len - 4) >= MAX_BUF)
808     len = MAX_BUF - 5;
809    
810     strncpy ((char *) command, (char *) buf + 6, len - 4);
811     command[len - 4] = '\0';
812    
813     /* The following should never happen with a proper or honest client.
814     * Therefore, the error message doesn't have to be too clear - if
815     * someone is playing with a hacked/non working client, this gives them
816     * an idea of the problem, but they deserve what they get
817     */
818     if (pl->state != ST_PLAYING)
819     {
820     new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
821     return;
822     }
823    
824     /* This should not happen anymore. */
825     if (pl->ob->speed_left < -1.0)
826 root 1.28 LOG (llevError, "Player has negative time - shouldn't do command.\n");
827    
828 root 1.16 /* In c_new.c */
829     execute_newserver_command (pl->ob, (char *) command);
830     /* Perhaps something better should be done with a left over count.
831     * Cleaning up the input should probably be done first - all actions
832     * for the command that issued the count should be done before any other
833     * commands.
834     */
835     pl->count = 0;
836    
837     if (FABS (pl->ob->speed) < 0.001)
838     time = MAX_TIME * 100;
839     else
840     time = (int) (MAX_TIME / FABS (pl->ob->speed));
841 root 1.27
842 root 1.28 /* Send confirmation of command execution now */
843 root 1.27
844 root 1.33 packet sl;
845     sl << "comc " << uint16 (pktlen) << uint32 (time);
846 root 1.16 Send_With_Handling (&pl->socket, &sl);
847 elmex 1.1 }
848    
849    
850     /** This is a reply to a previous query. */
851 root 1.16 void
852     ReplyCmd (char *buf, int len, player *pl)
853 elmex 1.1 {
854 root 1.16 /* This is to synthesize how the data would be stored if it
855     * was normally entered. A bit of a hack, and should be cleaned up
856     * once all the X11 code is removed from the server.
857     *
858     * We pass 13 to many of the functions because this way they
859     * think it was the carriage return that was entered, and the
860     * function then does not try to do additional input.
861     */
862     snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
863    
864     /* this avoids any hacking here */
865    
866     switch (pl->state)
867     {
868 root 1.12 case ST_PLAYING:
869 root 1.16 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
870     break;
871 root 1.12
872     case ST_PLAY_AGAIN:
873 root 1.16 /* We can check this for return value (2==quit). Maybe we
874     * should, and do something appropriate?
875     */
876     receive_play_again (pl->ob, buf[0]);
877     break;
878 elmex 1.1
879 root 1.12 case ST_ROLL_STAT:
880 root 1.16 key_roll_stat (pl->ob, buf[0]);
881     break;
882 root 1.12
883     case ST_CHANGE_CLASS:
884 elmex 1.1
885 root 1.16 key_change_class (pl->ob, buf[0]);
886     break;
887 elmex 1.1
888 root 1.12 case ST_CONFIRM_QUIT:
889 root 1.16 key_confirm_quit (pl->ob, buf[0]);
890     break;
891 root 1.12
892     case ST_CONFIGURE:
893 root 1.16 LOG (llevError, "In client input handling, but into configure state\n");
894     pl->state = ST_PLAYING;
895     break;
896 root 1.12
897     case ST_GET_NAME:
898 root 1.16 receive_player_name (pl->ob, 13);
899     break;
900 root 1.12
901     case ST_GET_PASSWORD:
902     case ST_CONFIRM_PASSWORD:
903 root 1.16 receive_player_password (pl->ob, 13);
904     break;
905 root 1.12
906 root 1.16 case ST_GET_PARTY_PASSWORD: /* Get password for party */
907     receive_party_password (pl->ob, 13);
908     break;
909 elmex 1.1
910 root 1.12 default:
911 root 1.16 LOG (llevError, "Unknown input state: %d\n", pl->state);
912 elmex 1.1 }
913     }
914    
915     /**
916     * Client tells its version. If there is a mismatch, we close the
917     * socket. In real life, all we should care about is the client having
918     * something older than the server. If we assume the client will be
919     * backwards compatible, having it be a later version should not be a
920     * problem.
921     */
922 root 1.16 void
923 root 1.35 VersionCmd (char *buf, int len, client_socket * ns)
924 elmex 1.1 {
925 root 1.16 char *cp;
926     char version_warning[256];
927    
928     if (!buf)
929     {
930     LOG (llevError, "CS: received corrupted version command\n");
931     return;
932 elmex 1.1 }
933    
934 root 1.16 ns->cs_version = atoi (buf);
935     ns->sc_version = ns->cs_version;
936     if (VERSION_CS != ns->cs_version)
937     {
938 elmex 1.1 #ifdef ESRV_DEBUG
939 root 1.16 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
940 elmex 1.1 #endif
941     }
942 root 1.16 cp = strchr (buf + 1, ' ');
943     if (!cp)
944     return;
945     ns->sc_version = atoi (cp);
946     if (VERSION_SC != ns->sc_version)
947     {
948 elmex 1.1 #ifdef ESRV_DEBUG
949 root 1.16 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
950 elmex 1.1 #endif
951     }
952 root 1.16 cp = strchr (cp + 1, ' ');
953     if (cp)
954     {
955     LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host);
956    
957     snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
958    
959     /* This is first implementation - i skip all beta DX clients with it
960     * Add later stuff here for other clients
961     */
962    
963     /* these are old dxclients */
964     /* Version 1024 added support for singular + plural name values -
965     * requiing this minimal value reduces complexity of that code, and it
966     * has been around for a long time.
967     */
968 root 1.29 if (ns->sc_version < 1026)
969 root 1.12 {
970 root 1.16 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
971     "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
972 root 1.32 ns->send_packet (version_warning);
973 root 1.12 }
974 elmex 1.1
975     }
976     }
977    
978     /** sound related functions. */
979 root 1.16
980     void
981 root 1.35 SetSound (char *buf, int len, client_socket * ns)
982 elmex 1.1 {
983 root 1.16 ns->sound = atoi (buf);
984 elmex 1.1 }
985    
986     /** client wants the map resent */
987    
988 root 1.16 void
989     MapRedrawCmd (char *buf, int len, player *pl)
990 elmex 1.1 {
991 root 1.16
992 elmex 1.1 /* This function is currently disabled; just clearing the map state results in
993     * display errors. It should clear the cache and send a newmap command.
994     * Unfortunately this solution does not work because some client versions send
995     * a mapredraw command after receiving a newmap command.
996     */
997     #if 0
998 root 1.16 /* Okay, this is MAJOR UGLY. but the only way I know how to
999     * clear the "cache"
1000     */
1001     memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1002     draw_client_map (pl->ob);
1003 elmex 1.1 #endif
1004     }
1005    
1006     /**
1007     * Moves an object (typically, container to inventory).
1008     * syntax is: move (to) (tag) (nrof)
1009     */
1010 root 1.16 void
1011     MoveCmd (char *buf, int len, player *pl)
1012 elmex 1.1 {
1013 root 1.16 int vals[3], i;
1014 elmex 1.1
1015 root 1.16 /* A little funky here. We only cycle for 2 records, because
1016     * we obviously am not going to find a space after the third
1017     * record. Perhaps we should just replace this with a
1018     * sscanf?
1019     */
1020     for (i = 0; i < 2; i++)
1021     {
1022     vals[i] = atoi (buf);
1023     if (!(buf = strchr (buf, ' ')))
1024     {
1025     LOG (llevError, "Incomplete move command: %s\n", buf);
1026     return;
1027 root 1.12 }
1028 root 1.16 buf++;
1029 elmex 1.1 }
1030 root 1.16 vals[2] = atoi (buf);
1031 elmex 1.1
1032     /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1033 root 1.16 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1034 elmex 1.1 }
1035    
1036    
1037    
1038     /******************************************************************************
1039     *
1040     * Start of commands the server sends to the client.
1041     *
1042     ******************************************************************************/
1043    
1044     /**
1045     * Asks the client to query the user. This way, the client knows
1046     * it needs to send something back (vs just printing out a message)
1047     */
1048 root 1.16 void
1049 root 1.35 send_query (client_socket * ns, uint8 flags, char *text)
1050 elmex 1.1 {
1051 root 1.16 char buf[MAX_BUF];
1052 elmex 1.1
1053 root 1.16 sprintf (buf, "query %d %s", flags, text ? text : "");
1054 root 1.32 ns->send_packet (buf);
1055 elmex 1.1 }
1056    
1057     #define AddIfInt64(Old,New,Type) if (Old != New) {\
1058 root 1.12 Old = New; \
1059 root 1.28 sl << uint8 (Type) << uint64 (New); \
1060 root 1.12 }
1061 elmex 1.1
1062     #define AddIfInt(Old,New,Type) if (Old != New) {\
1063 root 1.12 Old = New; \
1064 root 1.28 sl << uint8 (Type) << uint32 (New); \
1065 root 1.12 }
1066 elmex 1.1
1067     #define AddIfShort(Old,New,Type) if (Old != New) {\
1068 root 1.12 Old = New; \
1069 root 1.28 sl << uint8 (Type) << uint16 (New); \
1070 root 1.12 }
1071 elmex 1.1
1072     #define AddIfFloat(Old,New,Type) if (Old != New) {\
1073 root 1.12 Old = New; \
1074 root 1.28 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \
1075 root 1.12 }
1076 elmex 1.1
1077     #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
1078 root 1.28 free(Old); Old = strdup (New);\
1079     sl << uint8 (Type) << data8 (New); \
1080 root 1.12 }
1081 elmex 1.1
1082     /**
1083     * Sends a statistics update. We look at the old values,
1084     * and only send what has changed. Stat mapping values are in newclient.h
1085     * Since this gets sent a lot, this is actually one of the few binary
1086     * commands for now.
1087     */
1088 root 1.16 void
1089     esrv_update_stats (player *pl)
1090 elmex 1.1 {
1091 root 1.16 char buf[MAX_BUF];
1092     uint16 flags;
1093    
1094 root 1.33 packet sl;
1095 root 1.28 sl << "stats ";
1096 elmex 1.1
1097 root 1.16 if (pl->ob != NULL)
1098     {
1099     AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1100     AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1101     AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1102     AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
1103     AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE);
1104     AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE);
1105     AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR);
1106     AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1107     AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1108     AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1109     AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);
1110     AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1111     AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1112     }
1113 root 1.22
1114 root 1.16 if (pl->socket.exp64)
1115     {
1116     uint8 s;
1117    
1118     for (s = 0; s < NUM_SKILLS; s++)
1119     {
1120     if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1121     {
1122     /* Always send along the level if exp changes. This is only
1123     * 1 extra byte, but keeps processing simpler.
1124     */
1125 root 1.28 sl << uint8 (s + CS_STAT_SKILLINFO)
1126     << uint8 (pl->last_skill_ob[s]->level)
1127     << uint64 (pl->last_skill_ob[s]->stats.exp);
1128    
1129 root 1.16 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1130     }
1131     }
1132     }
1133 root 1.22
1134 root 1.16 if (pl->socket.exp64)
1135 root 1.23 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1136 root 1.16 else
1137 root 1.23 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1138 root 1.22
1139 root 1.16 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
1140     AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC);
1141     AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC);
1142     AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM);
1143     AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED);
1144     AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD);
1145     AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1146     AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM);
1147     flags = 0;
1148 root 1.22
1149 root 1.16 if (pl->fire_on)
1150     flags |= SF_FIREON;
1151 root 1.22
1152 root 1.16 if (pl->run_on)
1153     flags |= SF_RUNON;
1154    
1155     AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1156 root 1.22
1157 root 1.16 if (pl->socket.sc_version < 1025)
1158 root 1.23 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1159 root 1.16 else
1160     {
1161     int i;
1162    
1163     for (i = 0; i < NROFATTACKS; i++)
1164     {
1165     /* Skip ones we won't send */
1166     if (atnr_cs_stat[i] == -1)
1167     continue;
1168 root 1.23
1169 root 1.16 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1170     }
1171     }
1172 root 1.22
1173 root 1.16 if (pl->socket.monitor_spells)
1174     {
1175     AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1176     AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
1177     AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);
1178     }
1179 root 1.22
1180 root 1.16 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */
1181     AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE);
1182     set_title (pl->ob, buf);
1183     AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE);
1184    
1185     /* Only send it away if we have some actual data */
1186 root 1.34 if (sl.length () > 6)
1187     Send_With_Handling (&pl->socket, &sl);
1188 elmex 1.1 }
1189    
1190     /**
1191     * Tells the client that here is a player it should start using.
1192     */
1193 root 1.16 void
1194     esrv_new_player (player *pl, uint32 weight)
1195 elmex 1.1 {
1196 root 1.16 pl->last_weight = weight;
1197 elmex 1.1
1198 root 1.33 packet sl;
1199 root 1.28 sl << "player ";
1200 elmex 1.1
1201 root 1.28 sl << uint32 (pl->ob->count)
1202     << uint32 (weight)
1203     << uint32 (pl->ob->face->number)
1204     << data8 (pl->ob->name);
1205 root 1.16
1206     Send_With_Handling (&pl->socket, &sl);
1207     SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1208 elmex 1.1 }
1209    
1210     /**
1211     * Need to send an animation sequence to the client.
1212     * We will send appropriate face commands to the client if we haven't
1213     * sent them the face yet (this can become quite costly in terms of
1214     * how much we are sending - on the other hand, this should only happen
1215     * when the player logs in and picks stuff up.
1216     */
1217 root 1.16 void
1218 root 1.35 esrv_send_animation (client_socket * ns, short anim_num)
1219 elmex 1.1 {
1220 root 1.16 int i;
1221 elmex 1.1
1222 root 1.16 /* Do some checking on the anim_num we got. Note that the animations
1223     * are added in contigous order, so if the number is in the valid
1224     * range, it must be a valid animation.
1225     */
1226     if (anim_num < 0 || anim_num > num_animations)
1227     {
1228     LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1229     return;
1230     }
1231    
1232 root 1.33 packet sl;
1233 root 1.28
1234     sl << "anim "
1235     << uint16 (anim_num)
1236     << uint16 (0); /* flags - not used right now */
1237    
1238 root 1.16 /* Build up the list of faces. Also, send any information (ie, the
1239     * the face itself) down to the client.
1240     */
1241     for (i = 0; i < animations[anim_num].num_animations; i++)
1242     {
1243     if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1244     esrv_send_face (ns, animations[anim_num].faces[i], 0);
1245 root 1.28 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1246 root 1.16 }
1247 root 1.28
1248 root 1.16 Send_With_Handling (ns, &sl);
1249 root 1.28
1250 root 1.16 ns->anims_sent[anim_num] = 1;
1251 elmex 1.1 }
1252    
1253    
1254     /******************************************************************************
1255     *
1256     * Start of map related commands.
1257     *
1258     ******************************************************************************/
1259    
1260     /**
1261     * This adds face_num to a map cell at x,y. If the client doesn't have
1262     * the face yet, we will also send it.
1263     */
1264 root 1.16 static void
1265 root 1.35 esrv_map_setbelow (client_socket * ns, int x, int y, short face_num, struct Map *newmap)
1266 elmex 1.1 {
1267 root 1.16 if (newmap->cells[x][y].count >= MAP_LAYERS)
1268     {
1269     LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1270     return;
1271     abort ();
1272 elmex 1.1 }
1273 root 1.28
1274 root 1.16 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1275     newmap->cells[x][y].count++;
1276 root 1.28
1277 root 1.16 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1278     esrv_send_face (ns, face_num, 0);
1279 elmex 1.1 }
1280    
1281 root 1.16 struct LayerCell
1282     {
1283 elmex 1.1 uint16 xy;
1284     short face;
1285     };
1286    
1287 root 1.16 struct MapLayer
1288     {
1289 elmex 1.1 int count;
1290     struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1291     };
1292    
1293     /** Checkes if map cells have changed */
1294 root 1.16 static int
1295 root 1.35 mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap)
1296 elmex 1.1 {
1297     int k;
1298    
1299     if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1300     return 1;
1301 root 1.16 for (k = 0; k < newmap->cells[i][j].count; k++)
1302     {
1303     if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1304     {
1305     return 1;
1306     }
1307 elmex 1.1 }
1308     return 0;
1309     }
1310    
1311     /**
1312     * Basically, what this does is pack the data into layers.
1313     * cnum is the client number, cur is the the buffer we put all of
1314     * this data into. we return the end of the data. layers is
1315     * how many layers of data we should back.
1316 root 1.16 */
1317     static uint8 *
1318 root 1.35 compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1319 root 1.16 {
1320     int x, y, k;
1321     int face;
1322     unsigned char *fcur;
1323     struct MapLayer layers[MAP_LAYERS];
1324    
1325     for (k = 0; k < MAP_LAYERS; k++)
1326     layers[k].count = 0;
1327     fcur = cur;
1328     for (x = 0; x < ns->mapx; x++)
1329     {
1330     for (y = 0; y < ns->mapy; y++)
1331     {
1332     if (!mapcellchanged (ns, x, y, newmap))
1333     continue;
1334     if (newmap->cells[x][y].count == 0)
1335     {
1336     *cur = x * ns->mapy + y; /* mark empty space */
1337     cur++;
1338     continue;
1339     }
1340     for (k = 0; k < newmap->cells[x][y].count; k++)
1341     {
1342     layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1343     layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1344     layers[k].count++;
1345 root 1.12 }
1346     }
1347 elmex 1.1 }
1348 root 1.16 /* If no data, return now. */
1349     if (fcur == cur && layers[0].count == 0)
1350     return cur;
1351     *cur = 255; /* mark end of explicitly cleared cells */
1352     cur++;
1353     /* First pack by layers. */
1354     for (k = 0; k < numlayers; k++)
1355     {
1356     if (layers[k].count == 0)
1357     break; /* once a layer is entirely empty, no layer below it can
1358     have anything in it either */
1359     /* Pack by entries in thie layer */
1360     for (x = 0; x < layers[k].count;)
1361     {
1362     fcur = cur;
1363     *cur = layers[k].lcells[x].face >> 8;
1364     cur++;
1365     *cur = layers[k].lcells[x].face & 0xFF;
1366     cur++;
1367     face = layers[k].lcells[x].face;
1368     /* Now, we back the redundant data into 1 byte xy pairings */
1369     for (y = x; y < layers[k].count; y++)
1370     {
1371     if (layers[k].lcells[y].face == face)
1372     {
1373     *cur = (uint8) layers[k].lcells[y].xy;
1374     cur++;
1375     layers[k].lcells[y].face = -1;
1376 root 1.12 }
1377     }
1378 root 1.16 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1379     /* forward over the now redundant data */
1380     while (x < layers[k].count && layers[k].lcells[x].face == -1)
1381     x++;
1382 root 1.12 }
1383 root 1.16 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1384 elmex 1.1 }
1385 root 1.16 return cur;
1386 elmex 1.1 }
1387    
1388     /** Clears a map cell */
1389 root 1.16 static void
1390     map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
1391 elmex 1.1 {
1392 root 1.16 cell->faces[0] = face0;
1393     cell->faces[1] = face1;
1394     cell->faces[2] = face2;
1395 root 1.25 cell->count = count;
1396     cell->stat_hp = 0;
1397     cell->flags = 0;
1398     cell->player = 0;
1399 elmex 1.1 }
1400    
1401     #define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1402     #define MAX_LAYERS 3
1403    
1404     /* Using a global really isn't a good approach, but saves the over head of
1405     * allocating and deallocating such a block of data each time run through,
1406     * and saves the space of allocating this in the socket object when we only
1407     * need it for this cycle. If the serve is ever threaded, this needs to be
1408     * re-examined.
1409     */
1410    
1411 root 1.16 static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1412 elmex 1.1
1413     /**
1414     * Returns true if any of the heads for this
1415     * space is set. Returns false if all are blank - this is used
1416     * for empty space checking.
1417     */
1418 root 1.16 static inline int
1419     have_head (int ax, int ay)
1420     {
1421 elmex 1.1
1422 root 1.16 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1423     heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1424     return 1;
1425     return 0;
1426 elmex 1.1 }
1427    
1428     /**
1429     * check_head is a bit simplistic version of update_space below.
1430     * basically, it only checks the that the head on space ax,ay at layer
1431     * needs to get sent - if so, it adds the data, sending the head
1432     * if needed, and returning 1. If this no data needs to get
1433     * sent, it returns zero.
1434     */
1435 root 1.16 static int
1436 root 1.35 check_head (packet &sl, client_socket &ns, int ax, int ay, int layer)
1437 elmex 1.1 {
1438 root 1.16 short face_num;
1439 elmex 1.1
1440 root 1.16 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1441     face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1442     else
1443     face_num = 0;
1444 elmex 1.1
1445 root 1.16 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1446     {
1447 root 1.31 sl << uint16 (face_num);
1448 root 1.16 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1449     esrv_send_face (&ns, face_num, 0);
1450 root 1.28
1451 root 1.16 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1452     ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1453     return 1;
1454 elmex 1.1 }
1455    
1456 root 1.16 return 0; /* No change */
1457 elmex 1.1 }
1458    
1459     /**
1460     * Removes the need to replicate the same code for each layer.
1461     * this returns true if this space is now in fact different than
1462     * it was.
1463     * sl is the socklist this data is going into.
1464     * ns is the socket we are working on - all the info we care
1465     * about is in this socket structure, so now need not pass the
1466     * entire player object.
1467     * mx and my are map coordinate offsets for map mp
1468     * sx and sy are the offsets into the socket structure that
1469     * holds the old values.
1470     * layer is the layer to update, with 2 being the floor and 0 the
1471     * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1472     * take. Interesting to note that before this function, the map1 function
1473     * numbers the spaces differently - I think this was a leftover from
1474     * the map command, where the faces stack up. Sinces that is no longer
1475     * the case, it seems to make more sense to have these layer values
1476     * actually match.
1477     */
1478    
1479 root 1.16 static int
1480 root 1.35 update_space (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1481 elmex 1.1 {
1482 root 1.16 object *ob, *head;
1483     uint16 face_num;
1484     int bx, by, i;
1485    
1486     /* If there is a multipart object stored away, treat that as more important.
1487     * If not, then do the normal processing.
1488     */
1489     head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1490    
1491     /* Check to see if this head is part of the set of objects
1492     * we would normally send for this space. If so, then
1493     * don't use the head value. We need to do the check
1494     * here and not when setting up the heads[] value for two reasons -
1495     * 1) the heads[] values will get used even if the space is not visible.
1496     * 2) its possible the head is not on the same map as a part, and I'd
1497     * rather not need to do the map translation overhead.
1498     * 3) We need to do some extra checking to make sure that we will
1499     * otherwise send the image as this layer, eg, either it matches
1500     * the head value, or is not multipart.
1501     */
1502     if (head && !head->more)
1503     {
1504     for (i = 0; i < MAP_LAYERS; i++)
1505     {
1506     ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1507     if (!ob)
1508     continue;
1509    
1510     if (ob->head)
1511     ob = ob->head;
1512    
1513     if (ob == head)
1514     {
1515     heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1516     head = NULL;
1517     break;
1518     }
1519     }
1520     }
1521    
1522     ob = head;
1523     if (!ob)
1524     ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1525    
1526     /* If there is no object for this space, or if the face for the object
1527     * is the blank face, set the face number to zero.
1528     * else if we have the stored head object for this space, that takes
1529     * precedence over the other object for this space.
1530     * otherwise, we do special head processing
1531     */
1532     if (!ob || ob->face == blank_face)
1533     face_num = 0;
1534     else if (head)
1535     {
1536     /* if this is a head that had previously been stored */
1537     face_num = ob->face->number;
1538     }
1539     else
1540     {
1541     /* if the faces for the different parts of a multipart object
1542     * are the same, we only want to send the bottom right most
1543     * portion of the object. That info is in the tail_.. values
1544     * of the head. Note that for the head itself, ob->head will
1545     * be null, so we only do this block if we are working on
1546     * a tail piece.
1547     */
1548    
1549     /* tail_x and tail_y will only be set in the head object. If
1550     * this is the head object and these are set, we proceed
1551     * with logic to only send bottom right. Similarly, if
1552     * this is one of the more parts but the head has those values
1553     * set, we want to do the processing. There can be cases where
1554     * the head is not visible but one of its parts is, so we just
1555     * can always expect that ob->arch->tail_x will be true for all
1556     * object we may want to display.
1557     */
1558     if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1559     {
1560    
1561     if (ob->head)
1562     head = ob->head;
1563     else
1564     head = ob;
1565    
1566     /* Basically figure out where the offset is from where we are right
1567     * now. the ob->arch->clone.{x,y} values hold the offset that this current
1568     * piece is from the head, and the tail is where the tail is from the
1569     * head. Note that bx and by will equal sx and sy if we are already working
1570     * on the bottom right corner. If ob is the head, the clone values
1571     * will be zero, so the right thing will still happen.
1572     */
1573     bx = sx + head->arch->tail_x - ob->arch->clone.x;
1574     by = sy + head->arch->tail_y - ob->arch->clone.y;
1575    
1576     /* I don't think this can ever happen, but better to check for it just
1577     * in case.
1578     */
1579     if (bx < sx || by < sy)
1580     {
1581     LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1582     face_num = 0;
1583     }
1584     /* single part object, multipart object with non merged faces,
1585     * of multipart object already at lower right.
1586     */
1587     else if (bx == sx && by == sy)
1588     {
1589     face_num = ob->face->number;
1590    
1591     /* if this face matches one stored away, clear that one away.
1592     * this code relies on the fact that the map1 commands
1593     * goes from 2 down to 0.
1594     */
1595     for (i = 0; i < MAP_LAYERS; i++)
1596     if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1597     heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1598     heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1599     }
1600     else
1601     {
1602     /* If this head is stored away, clear it - otherwise,
1603     * there can be cases where a object is on multiple layers -
1604     * we only want to send it once.
1605     */
1606     face_num = head->face->number;
1607     for (i = 0; i < MAP_LAYERS; i++)
1608     if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1609     heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1610     heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1611    
1612     /* First, try to put the new head on the same layer. If that is used up,
1613     * then find another layer.
1614     */
1615     if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1616     {
1617     heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1618     }
1619     else
1620     for (i = 0; i < MAX_LAYERS; i++)
1621     {
1622 root 1.12 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1623 root 1.16 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1624     {
1625     heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1626     }
1627     }
1628     face_num = 0; /* Don't send this object - we'll send the head later */
1629 root 1.12 }
1630 root 1.16 }
1631     else
1632     {
1633     /* In this case, we are already at the lower right or single part object,
1634     * so nothing special
1635     */
1636     face_num = ob->face->number;
1637    
1638     /* clear out any head entries that have the same face as this one */
1639     for (bx = 0; bx < layer; bx++)
1640     if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1641     heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1642     heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1643     }
1644     } /* else not already head object or blank face */
1645    
1646     /* This is a real hack. Basically, if we have nothing to send for this layer,
1647     * but there is a head on the next layer, send that instead.
1648     * Without this, what happens is you can get the case where the player stands
1649     * on the same space as the head. However, if you have overlapping big objects
1650     * of the same type, what happens then is it doesn't think it needs to send
1651     * This tends to make stacking also work/look better.
1652     */
1653     if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1654     {
1655     face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1656     heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1657     }
1658    
1659     /* Another hack - because of heads and whatnot, this face may match one
1660     * we already sent for a lower layer. In that case, don't send
1661     * this one.
1662     */
1663 root 1.28 if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1664     face_num = 0;
1665 root 1.16
1666     /* We've gotten what face we want to use for the object. Now see if
1667     * if it has changed since we last sent it to the client.
1668     */
1669 root 1.28 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)
1670 root 1.16 {
1671 root 1.28 ns.lastmap.cells[sx][sy].faces[layer] = face_num;
1672     if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1673     esrv_send_face (&ns, face_num, 0);
1674    
1675     sl << uint16 (face_num);
1676 root 1.16 return 1;
1677 elmex 1.1 }
1678 root 1.28
1679 root 1.16 /* Nothing changed */
1680     return 0;
1681 elmex 1.1 }
1682    
1683     /**
1684     * This function is mainly a copy of update_space,
1685     * except it handles update of the smoothing updates,
1686     * not the face updates.
1687     * Removes the need to replicate the same code for each layer.
1688     * this returns true if this smooth is now in fact different
1689     * than it was.
1690     * sl is the socklist this data is going into.
1691     * ns is the socket we are working on - all the info we care
1692     * about is in this socket structure, so know need to pass the
1693     * entire player object.
1694     * mx and my are map coordinate offsets for map mp
1695     * sx and sy are the offsets into the socket structure that
1696     * holds the old values.
1697     * layer is the layer to update, with 2 being the floor and 0 the
1698     * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1699     * take.
1700     */
1701    
1702 root 1.16 static inline int
1703 root 1.35 update_smooth (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1704 elmex 1.1 {
1705 root 1.16 object *ob;
1706     int smoothlevel; /* old face_num; */
1707 elmex 1.1
1708 root 1.16 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1709 elmex 1.1
1710 root 1.16 /* If there is no object for this space, or if the face for the object
1711     * is the blank face, set the smoothlevel to zero.
1712     */
1713     if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp))
1714     smoothlevel = 0;
1715     else
1716     {
1717     smoothlevel = ob->smoothlevel;
1718 root 1.28 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1719     SendSmooth (&ns, ob->face->number);
1720 root 1.16 } /* else not already head object or blank face */
1721    
1722     /* We've gotten what face we want to use for the object. Now see if
1723     * if it has changed since we last sent it to the client.
1724     */
1725     if (smoothlevel > 255)
1726     smoothlevel = 255;
1727     else if (smoothlevel < 0)
1728     smoothlevel = 0;
1729 root 1.28
1730     if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1731 root 1.16 {
1732 root 1.28 ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1733     sl << uint8 (smoothlevel);
1734 root 1.16 return 1;
1735 elmex 1.1 }
1736 root 1.28
1737 root 1.16 /* Nothing changed */
1738     return 0;
1739 elmex 1.1 }
1740    
1741     /**
1742     * Returns the size of a data for a map square as returned by
1743     * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1744     * available.
1745     */
1746 root 1.16 int
1747 root 1.35 getExtendedMapInfoSize (client_socket * ns)
1748 root 1.16 {
1749     int result = 0;
1750    
1751     if (ns->ext_mapinfos)
1752     {
1753     if (ns->EMI_smooth)
1754     result += 1; /*One byte for smoothlevel */
1755 elmex 1.1 }
1756 root 1.16 return result;
1757 elmex 1.1 }
1758 root 1.16
1759 elmex 1.1 /**
1760     * This function uses the new map1 protocol command to send the map
1761     * to the client. It is necessary because the old map command supports
1762     * a maximum map size of 15x15.
1763     * This function is much simpler than the old one. This is because
1764     * the old function optimized to send as few face identifiers as possible,
1765     * at the expense of sending more coordinate location (coordinates were
1766     * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1767     * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1768     * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1769     * and use the other 4 bits for other informatiion. For full documentation
1770     * of what we send, see the doc/Protocol file.
1771     * I will describe internally what we do:
1772     * the socket->lastmap shows how the map last looked when sent to the client.
1773     * in the lastmap structure, there is a cells array, which is set to the
1774     * maximum viewable size (As set in config.h).
1775     * in the cells, there are faces and a count value.
1776     * we use the count value to hold the darkness value. If -1, then this space
1777     * is not viewable.
1778     * we use faces[0] faces[1] faces[2] to hold what the three layers
1779     * look like.
1780     */
1781 root 1.16 void
1782     draw_client_map1 (object *pl)
1783 elmex 1.1 {
1784 root 1.16 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen;
1785     sint16 nx, ny;
1786     int estartlen, eoldlen;
1787     uint16 mask, emask;
1788     uint8 eentrysize;
1789     uint16 ewhatstart, ewhatflag;
1790     uint8 extendedinfos;
1791 root 1.21 maptile *m;
1792 root 1.16
1793 root 1.35 client_socket &socket = pl->contr->socket;
1794 root 1.16
1795     check_map_change (pl->contr);
1796    
1797 root 1.33 packet sl;
1798     packet esl;
1799 root 1.28
1800     sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1801 root 1.34 startlen = sl.length ();
1802 root 1.25
1803 root 1.16 /*Extendedmapinfo structure initialisation */
1804     if (socket.ext_mapinfos)
1805     {
1806     extendedinfos = EMI_NOREDRAW;
1807 root 1.25
1808 root 1.16 if (socket.EMI_smooth)
1809     extendedinfos |= EMI_SMOOTH;
1810 root 1.25
1811 root 1.34 ewhatstart = esl.length ();
1812 root 1.16 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1813     could need to be taken away */
1814     eentrysize = getExtendedMapInfoSize (&socket);
1815 root 1.28 esl << "mapextended "
1816     << uint8 (extendedinfos)
1817     << uint8 (eentrysize);
1818 root 1.34
1819     estartlen = esl.length ();
1820 root 1.16 }
1821     else
1822     {
1823     /* suppress compiler warnings */
1824     ewhatstart = 0;
1825     ewhatflag = 0;
1826     estartlen = 0;
1827     }
1828 root 1.25
1829 root 1.16 /* Init data to zero */
1830     memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1831    
1832     /* x,y are the real map locations. ax, ay are viewport relative
1833     * locations.
1834     */
1835     ay = 0;
1836    
1837     /* We could do this logic as conditionals in the if statement,
1838     * but that started to get a bit messy to look at.
1839     */
1840     max_x = pl->x + (socket.mapx + 1) / 2;
1841     max_y = pl->y + (socket.mapy + 1) / 2;
1842 root 1.25
1843 root 1.16 if (socket.mapmode == Map1aCmd)
1844     {
1845     max_x += MAX_HEAD_OFFSET;
1846     max_y += MAX_HEAD_OFFSET;
1847     }
1848 elmex 1.1
1849 root 1.16 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1850     {
1851     ax = 0;
1852     for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1853     {
1854    
1855     emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1856    
1857     /* If this space is out of the normal viewable area, we only check
1858     * the heads value ax or ay will only be greater than what
1859     * the client wants if using the map1a command - this is because
1860     * if the map1a command is not used, max_x and max_y will be
1861     * set to lower values.
1862     */
1863     if (ax >= socket.mapx || ay >= socket.mapy)
1864     {
1865     int i, got_one;
1866 root 1.12
1867 root 1.34 oldlen = sl.length ();
1868 root 1.12
1869 root 1.28 sl << uint16 (mask);
1870 root 1.12
1871 root 1.28 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1872     if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1873     if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1874 root 1.16
1875     /* If all we are doing is sending 0 (blank) faces, we don't
1876     * actually need to send that - just the coordinates
1877     * with no faces tells the client to blank out the
1878     * space.
1879     */
1880     got_one = 0;
1881 root 1.34 for (i = oldlen + 2; i < sl.length (); i++)
1882 root 1.25 if (sl.buf[i])
1883     got_one = 1;
1884 root 1.12
1885 root 1.16 if (got_one && (mask & 0xf))
1886 root 1.25 sl.buf[oldlen + 1] = mask & 0xff;
1887 root 1.16 else
1888     { /*either all faces blank, either no face at all */
1889     if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1890 root 1.34 sl.reset (oldlen + 2);
1891 root 1.3 else
1892 root 1.34 sl.reset (oldlen);
1893 root 1.12 }
1894 root 1.25
1895 root 1.16 /*What concerns extendinfos, nothing to be done for now
1896     * (perhaps effects layer later)
1897     */
1898     continue; /* don't do processing below */
1899     }
1900    
1901 root 1.25 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1902 root 1.16
1903     d = pl->contr->blocked_los[ax][ay];
1904    
1905     /* If the coordinates are not valid, or it is too dark to see,
1906     * we tell the client as such
1907     */
1908     nx = x;
1909     ny = y;
1910     m = get_map_from_coord (pl->map, &nx, &ny);
1911 root 1.25
1912 root 1.16 if (!m)
1913     {
1914     /* space is out of map. Update space and clear values
1915     * if this hasn't already been done. If the space is out
1916     * of the map, it shouldn't have a head
1917     */
1918     if (lastcell.count != -1)
1919     {
1920 root 1.28 sl << uint16 (mask);
1921 root 1.16 map_clearcell (&lastcell, 0, 0, 0, -1);
1922 root 1.12 }
1923 root 1.16 }
1924     else if (d > 3)
1925     {
1926     int need_send = 0, count;
1927    
1928     /* This block deals with spaces that are not visible for whatever
1929     * reason. Still may need to send the head for this space.
1930     */
1931 root 1.12
1932 root 1.34 oldlen = sl.length ();
1933 root 1.3
1934 root 1.28 sl << uint16 (mask);
1935 root 1.25
1936 root 1.16 if (lastcell.count != -1)
1937     need_send = 1;
1938 root 1.25
1939 root 1.16 count = -1;
1940 root 1.3
1941 root 1.16 if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1942     {
1943     /* Now check to see if any heads need to be sent */
1944 root 1.3
1945 root 1.28 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1946     if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1947     if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1948 root 1.3
1949 root 1.16 lastcell.count = count;
1950     }
1951     else
1952     {
1953     /* properly clear a previously sent big face */
1954 root 1.25 if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0
1955     || lastcell.stat_hp || lastcell.flags || lastcell.player)
1956 root 1.16 need_send = 1;
1957 root 1.25
1958 root 1.16 map_clearcell (&lastcell, 0, 0, 0, count);
1959     }
1960 root 1.3
1961 root 1.16 if ((mask & 0xf) || need_send)
1962 root 1.25 sl.buf[oldlen + 1] = mask & 0xff;
1963 root 1.16 else
1964 root 1.34 sl.reset (oldlen);
1965 root 1.16 }
1966     else
1967     {
1968     /* In this block, the space is visible or there are head objects
1969     * we need to send.
1970     */
1971    
1972     /* Rather than try to figure out what everything that we might
1973     * need to send is, then form the packet after that,
1974     * we presume that we will in fact form a packet, and update
1975     * the bits by what we do actually send. If we send nothing,
1976 root 1.34 * we just back out sl.length () to the old value, and no harm
1977 root 1.16 * is done.
1978     * I think this is simpler than doing a bunch of checks to see
1979     * what if anything we need to send, setting the bits, then
1980     * doing those checks again to add the real data.
1981     */
1982 root 1.34 oldlen = sl.length ();
1983 root 1.16 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1984 root 1.34 eoldlen = esl.length ();
1985 root 1.16 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1986 root 1.28 sl << uint16 (mask);
1987 root 1.16
1988     if (socket.ext_mapinfos)
1989 root 1.28 esl << uint16 (emask);
1990 root 1.16
1991     unsigned char dummy;
1992     unsigned char *last_ext = &dummy;
1993    
1994     /* Darkness changed */
1995     if (lastcell.count != d && socket.darkness)
1996     {
1997     mask |= 0x8;
1998    
1999     if (socket.extmap)
2000     {
2001     *last_ext |= 0x80;
2002 root 1.34 last_ext = sl.buf + sl.length ();
2003 root 1.28 sl << uint8 (d);
2004 root 1.16 }
2005     else
2006 root 1.28 sl << uint8 (255 - 64 * d);
2007 root 1.16 }
2008 root 1.3
2009 root 1.16 lastcell.count = d;
2010 root 1.8
2011 root 1.16 if (socket.extmap)
2012     {
2013     uint8 stat_hp = 0;
2014     uint8 stat_width = 0;
2015 root 1.24 uint8 flags = 0;
2016 root 1.27 UUID player = 0;
2017 root 1.16
2018     // send hp information, if applicable
2019     if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0))
2020     {
2021     if (op->head || op->invisible)
2022     ; // do not show
2023     else if (op->type == PLAYER
2024     || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
2025     {
2026     if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
2027     {
2028     stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
2029     stat_width = op->arch->tail_x;
2030     }
2031     }
2032 elmex 1.1
2033 root 1.24 if (op->msg && op->msg[0] == '@')
2034     flags |= 1;
2035    
2036 root 1.16 if (op->type == PLAYER && op != pl)
2037     player = op->count;
2038     }
2039 root 1.12
2040 root 1.16 if (lastcell.stat_hp != stat_hp)
2041     {
2042     lastcell.stat_hp = stat_hp;
2043    
2044     mask |= 0x8;
2045     *last_ext |= 0x80;
2046 root 1.34 last_ext = sl.buf + sl.length ();
2047 root 1.27
2048     sl << uint8 (5) << uint8 (stat_hp);
2049 root 1.16
2050     if (stat_width > 1)
2051     {
2052     *last_ext |= 0x80;
2053 root 1.34 last_ext = sl.buf + sl.length ();
2054 root 1.27
2055     sl << uint8 (6) << uint8 (stat_width);
2056 root 1.16 }
2057     }
2058 root 1.12
2059 root 1.20 if (lastcell.player != player)
2060 root 1.16 {
2061     lastcell.player = player;
2062    
2063     mask |= 0x8;
2064     *last_ext |= 0x80;
2065 root 1.34 last_ext = sl.buf + sl.length ();
2066 root 1.27
2067     sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2068 root 1.16 }
2069 root 1.24
2070     if (lastcell.flags != flags)
2071     {
2072     lastcell.flags = flags;
2073    
2074     mask |= 0x8;
2075     *last_ext |= 0x80;
2076 root 1.34 last_ext = sl.buf + sl.length ();
2077 root 1.27
2078     sl << uint8 (8) << uint8 (flags);
2079 root 1.24 }
2080 root 1.16 }
2081 root 1.12
2082 root 1.16 /* Floor face */
2083 root 1.28 if (update_space (sl, socket, m, nx, ny, ax, ay, 2))
2084 root 1.16 mask |= 0x4;
2085    
2086     if (socket.EMI_smooth)
2087 root 1.28 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
2088 root 1.16 emask |= 0x4;
2089    
2090     /* Middle face */
2091 root 1.28 if (update_space (sl, socket, m, nx, ny, ax, ay, 1))
2092 root 1.16 mask |= 0x2;
2093    
2094     if (socket.EMI_smooth)
2095 root 1.28 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))
2096 root 1.16 emask |= 0x2;
2097    
2098     if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
2099     {
2100     if (lastcell.faces[0] != pl->face->number)
2101     {
2102     lastcell.faces[0] = pl->face->number;
2103     mask |= 0x1;
2104 root 1.25
2105 root 1.16 if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))
2106     esrv_send_face (&socket, pl->face->number, 0);
2107 root 1.25
2108 root 1.27 sl << uint16 (pl->face->number);
2109 root 1.12 }
2110     }
2111 root 1.16 else
2112     {
2113 root 1.25 /* Top face */
2114 root 1.28 if (update_space (sl, socket, m, nx, ny, ax, ay, 0))
2115 root 1.16 mask |= 0x1;
2116 root 1.25
2117 root 1.16 if (socket.EMI_smooth)
2118 root 1.28 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
2119 root 1.25 emask |= 0x1;
2120 root 1.16 }
2121 root 1.25
2122 root 1.16 /* Check to see if we are in fact sending anything for this
2123     * space by checking the mask. If so, update the mask.
2124     * if not, reset the len to that from before adding the mask
2125     * value, so we don't send those bits.
2126     */
2127     if (mask & 0xf)
2128 root 1.25 sl.buf[oldlen + 1] = mask & 0xff;
2129 root 1.16 else
2130 root 1.34 sl.reset (oldlen);
2131 root 1.25
2132 root 1.16 if (emask & 0xf)
2133 root 1.25 esl.buf[eoldlen + 1] = emask & 0xff;
2134 root 1.16 else
2135 root 1.34 esl.reset (eoldlen);
2136 root 1.16 } /* else this is a viewable space */
2137     } /* for x loop */
2138     } /* for y loop */
2139    
2140     /* Verify that we in fact do need to send this */
2141     if (socket.ext_mapinfos)
2142     {
2143 root 1.34 if (!(sl.length () > startlen || socket.sent_scroll))
2144 root 1.16 {
2145     /* No map data will follow, so don't say the client
2146     * it doesn't need draw!
2147     */
2148     ewhatflag &= (~EMI_NOREDRAW);
2149     esl.buf[ewhatstart + 1] = ewhatflag & 0xff;
2150     }
2151 root 1.18
2152 root 1.34 if (esl.length () > estartlen)
2153 root 1.18 Send_With_Handling (&socket, &esl);
2154 root 1.16 }
2155 root 1.18
2156 root 1.34 if (sl.length () > startlen || socket.sent_scroll)
2157 root 1.16 {
2158     Send_With_Handling (&socket, &sl);
2159     socket.sent_scroll = 0;
2160 elmex 1.1 }
2161     }
2162    
2163     /**
2164     * Draws client map.
2165     */
2166 root 1.16 void
2167     draw_client_map (object *pl)
2168 elmex 1.1 {
2169 root 1.16 int i, j;
2170     sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */
2171     New_Face *face, *floor;
2172     New_Face *floor2;
2173     int d, mflags;
2174     struct Map newmap;
2175 root 1.21 maptile *m, *pm;
2176 root 1.16
2177     if (pl->type != PLAYER)
2178     {
2179     LOG (llevError, "draw_client_map called with non player/non eric-server\n");
2180     return;
2181     }
2182    
2183     pm = pl->map;
2184    
2185     /* If player is just joining the game, he isn't here yet, so the map
2186     * can get swapped out. If so, don't try to send them a map. All will
2187     * be OK once they really log in.
2188     */
2189     if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2190     return;
2191    
2192     memset (&newmap, 0, sizeof (struct Map));
2193    
2194     for (j = (pl->y - pl->contr->socket.mapy / 2); j < (pl->y + (pl->contr->socket.mapy + 1) / 2); j++)
2195     {
2196     for (i = (pl->x - pl->contr->socket.mapx / 2); i < (pl->x + (pl->contr->socket.mapx + 1) / 2); i++)
2197     {
2198     ax = i;
2199     ay = j;
2200     m = pm;
2201     mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2202     if (mflags & P_OUT_OF_MAP)
2203     continue;
2204     if (mflags & P_NEED_UPDATE)
2205     update_position (m, ax, ay);
2206     /* If a map is visible to the player, we don't want to swap it out
2207     * just to reload it. This should really call something like
2208     * swap_map, but this is much more efficient and 'good enough'
2209     */
2210     if (mflags & P_NEW_MAP)
2211     m->timeout = 50;
2212     }
2213     }
2214     /* do LOS after calls to update_position */
2215     if (pl->contr->do_los)
2216     {
2217     update_los (pl);
2218     pl->contr->do_los = 0;
2219     }
2220    
2221 root 1.34 /* Big maps need a different drawing mechanism to work */
2222     draw_client_map1 (pl);
2223 elmex 1.1 }
2224    
2225    
2226     /*****************************************************************************/
2227 root 1.16
2228 elmex 1.1 /* GROS: The following one is used to allow a plugin to send a generic cmd to*/
2229 root 1.16
2230 elmex 1.1 /* a player. Of course, the client need to know the command to be able to */
2231 root 1.16
2232 elmex 1.1 /* manage it ! */
2233 root 1.16
2234 elmex 1.1 /*****************************************************************************/
2235 root 1.16 void
2236     send_plugin_custom_message (object *pl, char *buf)
2237 elmex 1.1 {
2238 root 1.32 pl->contr->socket.send_packet (buf);
2239 elmex 1.1 }
2240    
2241     /**
2242     * This sends the skill number to name mapping. We ignore
2243     * the params - we always send the same info no matter what.
2244     */
2245 root 1.16 void
2246 root 1.35 send_skill_info (client_socket *ns, char *params)
2247 elmex 1.1 {
2248 root 1.33 packet sl;
2249 root 1.28 sl << "replyinfo skill_info\n";
2250    
2251     for (int i = 1; i < NUM_SKILLS; i++)
2252 root 1.29 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
2253 elmex 1.1
2254 root 1.34 if (sl.length () >= MAXSOCKBUF)
2255 root 1.16 {
2256     LOG (llevError, "Buffer overflow in send_skill_info!\n");
2257     fatal (0);
2258 elmex 1.1 }
2259 root 1.28
2260 root 1.16 Send_With_Handling (ns, &sl);
2261 elmex 1.1 }
2262    
2263     /**
2264     * This sends the spell path to name mapping. We ignore
2265     * the params - we always send the same info no matter what.
2266     */
2267 root 1.16 void
2268 root 1.35 send_spell_paths (client_socket * ns, char *params)
2269 root 1.16 {
2270 root 1.33 packet sl;
2271 root 1.28
2272     sl << "replyinfo spell_paths\n";
2273    
2274     for (int i = 0; i < NRSPELLPATHS; i++)
2275 root 1.29 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2276 root 1.16
2277 root 1.34 if (sl.length () >= MAXSOCKBUF)
2278 root 1.16 {
2279     LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2280     fatal (0);
2281 elmex 1.1 }
2282 root 1.28
2283 root 1.16 Send_With_Handling (ns, &sl);
2284 elmex 1.1 }
2285    
2286     /**
2287     * This looks for any spells the player may have that have changed their stats.
2288     * it then sends an updspell packet for each spell that has changed in this way
2289     */
2290 root 1.16 void
2291     esrv_update_spells (player *pl)
2292     {
2293     if (!pl->socket.monitor_spells)
2294     return;
2295 root 1.28
2296     for (object *spell = pl->ob->inv; spell; spell = spell->below)
2297 root 1.16 {
2298     if (spell->type == SPELL)
2299     {
2300 root 1.28 int flags = 0;
2301    
2302 root 1.16 /* check if we need to update it */
2303     if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
2304     {
2305     spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
2306     flags |= UPD_SP_MANA;
2307     }
2308 root 1.28
2309 root 1.16 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
2310     {
2311     spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
2312     flags |= UPD_SP_GRACE;
2313     }
2314 root 1.28
2315 root 1.16 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
2316     {
2317     spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
2318     flags |= UPD_SP_DAMAGE;
2319     }
2320 root 1.28
2321     if (flags)
2322 root 1.16 {
2323 root 1.33 packet sl;
2324 root 1.27
2325 root 1.28 sl << "updspell "
2326     << uint8 (flags)
2327     << uint32 (spell->count);
2328 root 1.27
2329     if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2330     if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2331     if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2332    
2333 root 1.16 Send_With_Handling (&pl->socket, &sl);
2334 root 1.12 }
2335     }
2336 elmex 1.1 }
2337     }
2338    
2339 root 1.16 void
2340     esrv_remove_spell (player *pl, object *spell)
2341     {
2342     if (!pl->socket.monitor_spells)
2343     return;
2344 root 1.28
2345 root 1.16 if (!pl || !spell || spell->env != pl->ob)
2346     {
2347     LOG (llevError, "Invalid call to esrv_remove_spell");
2348     return;
2349     }
2350 root 1.27
2351 root 1.33 packet sl;
2352 root 1.28
2353     sl << "delspell "
2354     << uint32 (spell->count);
2355 root 1.27
2356 root 1.16 Send_With_Handling (&pl->socket, &sl);
2357 elmex 1.1 }
2358    
2359     /* appends the spell *spell to the Socklist we will send the data to. */
2360 root 1.16 static void
2361 root 1.33 append_spell (player *pl, packet &sl, object *spell)
2362 root 1.16 {
2363     int len, i, skill = 0;
2364    
2365     if (!(spell->name))
2366     {
2367     LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2368     return;
2369     }
2370 root 1.27
2371 root 1.16 /* store costs and damage in the object struct, to compare to later */
2372 root 1.27 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
2373 root 1.16 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
2374 root 1.27 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
2375 elmex 1.1
2376 root 1.16 /* figure out which skill it uses, if it uses one */
2377     if (spell->skill)
2378     {
2379     for (i = 1; i < NUM_SKILLS; i++)
2380     if (!strcmp (spell->skill, skill_names[i]))
2381     {
2382     skill = i + CS_STAT_SKILLINFO;
2383     break;
2384     }
2385 elmex 1.1 }
2386    
2387 root 1.27 /* send the current values */
2388     sl << uint32 (spell->count)
2389     << uint16 (spell->level)
2390     << uint16 (spell->casting_time)
2391     << uint16 (spell->last_sp)
2392     << uint16 (spell->last_grace)
2393     << uint16 (spell->last_eat)
2394     << uint8 (skill)
2395     << uint32 (spell->path_attuned)
2396     << uint32 (spell->face ? spell->face->number : 0)
2397     << data8 (spell->name)
2398     << data16 (spell->msg);
2399 elmex 1.1 }
2400    
2401     /**
2402     * This tells the client to add the spell *ob, if *ob is NULL, then add
2403     * all spells in the player's inventory.
2404     */
2405 root 1.16 void
2406     esrv_add_spells (player *pl, object *spell)
2407     {
2408     if (!pl)
2409     {
2410     LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2411     return;
2412     }
2413 root 1.28
2414 root 1.16 if (!pl->socket.monitor_spells)
2415     return;
2416 root 1.28
2417 root 1.33 packet sl;
2418 root 1.28
2419     sl << "addspell ";
2420    
2421 root 1.16 if (!spell)
2422     {
2423     for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2424     {
2425     /* were we to simply keep appending data here, we could exceed
2426     * MAXSOCKBUF if the player has enough spells to add, we know that
2427     * append_spells will always append 19 data bytes, plus 4 length
2428     * bytes and 3 strings (because that is the spec) so we need to
2429     * check that the length of those 3 strings, plus the 23 bytes,
2430     * won't take us over the length limit for the socket, if it does,
2431     * we need to send what we already have, and restart packet formation
2432     */
2433     /* Seeing crashes by overflowed buffers. Quick arithemetic seems
2434     * to show add_spell is 26 bytes + 2 strings. However, the overun
2435     * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
2436     * like it will fix this
2437     */
2438     if (spell->type != SPELL)
2439     continue;
2440 root 1.27
2441 root 1.34 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2442 root 1.16 {
2443     Send_With_Handling (&pl->socket, &sl);
2444 root 1.34
2445     sl.reset ();
2446     sl << "addspell ";
2447 root 1.16 }
2448 root 1.27
2449     append_spell (pl, sl, spell);
2450 root 1.16 }
2451     }
2452     else if (spell->type != SPELL)
2453     {
2454     LOG (llevError, "Asked to send a non-spell object as a spell");
2455     return;
2456     }
2457     else
2458 root 1.27 append_spell (pl, sl, spell);
2459    
2460 root 1.28 if (sl.length () >= MAXSOCKBUF)
2461 root 1.16 {
2462     LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2463     fatal (0);
2464     }
2465 root 1.27
2466 root 1.16 /* finally, we can send the packet */
2467     Send_With_Handling (&pl->socket, &sl);
2468 root 1.28
2469 elmex 1.1 }
2470 root 1.28