ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.52
Committed: Sat Dec 23 09:41:55 2006 UTC (17 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.51: +13 -21 lines
Log Message:
- reorder stuff so that the endlessly sucky gcfclient doesn't get confused

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