ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
(Generate patch)

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.4 by root, Fri Aug 18 02:23:28 2006 UTC vs.
Revision 1.142 by root, Sat Dec 20 02:32:31 2008 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines