ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.32
Committed: Thu Dec 14 01:12:35 2006 UTC (17 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.31: +28 -21 lines
Log Message:
(intermediate check-in for recoverability)

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