ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.28
Committed: Wed Dec 13 18:51:50 2006 UTC (17 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.27: +144 -179 lines
Log Message:
started simplifying network code

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