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.29 by root, Wed Dec 13 21:27:09 2006 UTC vs.
Revision 1.195 by root, Sat Nov 17 23:40:05 2018 UTC

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

Diff Legend

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