ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.40
Committed: Fri Dec 15 04:21:29 2006 UTC (17 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.39: +44 -0 lines
Log Message:
while goofing around, trying to understand the command code
- did some reindentation
- which lead me to find some dead code
- which lead me to some optimisations and more dead code

fun.

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