ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.3
Committed: Fri Aug 18 02:06:58 2006 UTC (17 years, 9 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.2: +102 -97 lines
Log Message:
support health stats in an extensible way in map1

File Contents

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