ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.c
Revision: 1.5
Committed: Mon Apr 17 06:11:41 2006 UTC (18 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.4: +82 -6 lines
Log Message:
first round of mapinfo command and response, rationalised the coordinate system

File Contents

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