ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
Revision: 1.60
Committed: Sun Jan 7 02:39:15 2007 UTC (17 years, 4 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.59: +1 -5 lines
Log Message:
""

File Contents

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