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.83 by root, Mon Apr 2 18:04:47 2007 UTC vs.
Revision 1.171 by root, Sun Apr 11 00:34:07 2010 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001 Mark Wedel 5 * Copyright (©) 2001 Mark Wedel
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The author can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24
25//+GPL
24 26
25/** 27/**
26 * \file 28 * \file
27 * Client handling. 29 * Client handling.
28 * 30 *
… …
42 44
43#include <global.h> 45#include <global.h>
44#include <sproto.h> 46#include <sproto.h>
45 47
46#include <living.h> 48#include <living.h>
47#include <commands.h>
48 49
49/* This block is basically taken from socket.c - I assume if it works there, 50/* This block is basically taken from socket.c - I assume if it works there,
50 * it should work here. 51 * it should work here.
51 */ 52 */
52#include <sys/types.h> 53#include <sys/types.h>
… …
64 * This table translates the attack numbers as used within the 65 * This table translates the attack numbers as used within the
65 * program to the value we use when sending STATS command to the 66 * program to the value we use when sending STATS command to the
66 * client. If a value is -1, then we don't send that to the 67 * client. If a value is -1, then we don't send that to the
67 * client. 68 * client.
68 */ 69 */
69short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, 70static short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,
70 CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, 71 CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,
71 CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, 72 CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,
72 CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , 73 CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,
73 CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, 74 CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,
74 CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, 75 CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,
… …
99 */ 100 */
100 mx = ns->mapx; 101 mx = ns->mapx;
101 my = ns->mapy; 102 my = ns->mapy;
102 103
103 /* the x and y here are coordinates for the new map, i.e. if we moved 104 /* the x and y here are coordinates for the new map, i.e. if we moved
104 * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, 105 * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
105 * if the destination x or y coordinate is outside the viewable 106 * if the destination x or y coordinate is outside the viewable
106 * area, we clear the values - otherwise, the old values 107 * area, we clear the values - otherwise, the old values
107 * are preserved, and the check_head thinks it needs to clear them. 108 * are preserved, and the check_head thinks it needs to clear them.
108 */ 109 */
109 for (x = 0; x < mx; x++) 110 for (x = 0; x < mx; x++)
110 {
111 for (y = 0; y < my; y++) 111 for (y = 0; y < my; y++)
112 {
113 if (x >= ns->mapx || y >= ns->mapy) 112 if (x >= ns->mapx || y >= ns->mapy)
114 /* clear cells outside the viewable area */ 113 /* clear cells outside the viewable area */
115 memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); 114 memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
116 else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) 115 else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy)
117 /* clear newly visible tiles within the viewable area */ 116 /* clear newly visible tiles within the viewable area */
118 memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); 117 memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
119 else 118 else
120 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); 119 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
121 }
122 }
123 120
124 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); 121 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
125 122
126 /* Make sure that the next "map1" command will be sent (even if it is 123 /* Make sure that the next "map1" command will be sent (even if it is
127 * empty). 124 * empty).
… …
130} 127}
131 128
132static void 129static void
133clear_map (player *pl) 130clear_map (player *pl)
134{ 131{
132 pl->ns->mapinfo_queue_clear ();
133
135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); 134 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
136 135
137 pl->ns->force_newmap = false; 136 pl->ns->force_newmap = false;
138 137
139 if (pl->ns->newmapcmd == 1) 138 if (pl->ns->newmapcmd == 1)
140 pl->ns->send_packet ("newmap"); 139 pl->ns->send_packet ("newmap");
141 140
142 pl->ns->floorbox_reset (); 141 pl->ns->floorbox_reset ();
142}
143
144static void
145send_map_info (player *pl)
146{
147 client &socket = *pl->ns;
148 object *ob = pl->viewpoint;
149
150 if (socket.mapinfocmd)
151 {
152 if (ob->map && ob->map->path[0])
153 {
154 int flags = 0;
155
156 if (ob->map->tile_path[0]) flags |= 1;
157 if (ob->map->tile_path[1]) flags |= 2;
158 if (ob->map->tile_path[2]) flags |= 4;
159 if (ob->map->tile_path[3]) flags |= 8;
160
161 socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
162 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
163 ob->map->width, ob->map->height, &ob->map->path);
164 }
165 else
166 socket.send_packet ("mapinfo current");
167 }
143} 168}
144 169
145/** check for map/region change and send new map data */ 170/** check for map/region change and send new map data */
146static void 171static void
147check_map_change (player *pl) 172check_map_change (player *pl)
148{ 173{
149 client &socket = *pl->ns; 174 client &socket = *pl->ns;
150 object *ob = pl->ob; 175 object *ob = pl->viewpoint;
151 char buf[MAX_BUF]; /* eauugggh */
152 176
153 if (socket.force_newmap) 177 region *reg = ob->region ();
178 if (socket.current_region != reg)
179 {
180 INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
181 socket.current_region = reg;
154 { 182 }
155 // force newmap is used for clients that do not redraw their map 183
156 // after image uploads. 184 // first try to aovid a full newmap on tiled map scrolls
185 if (socket.current_map != ob->map && !socket.force_newmap)
186 {
187 rv_vector rv;
188
189 get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
190
191 // manhattan distance is very handy here
192 if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
193 {
157 socket.current_map = ob->map; 194 socket.current_map = ob->map;
158 clear_map (pl); 195 socket.current_x = ob->x;
196 socket.current_y = ob->y;
197
198 socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
199 socket.floorbox_reset ();
200 send_map_info (pl);
201 }
159 } 202 }
160 else if (socket.current_map != ob->map) 203
204 if (socket.current_map != ob->map || socket.force_newmap)
161 { 205 {
162 clear_map (pl); 206 clear_map (pl);
163 socket.current_map = ob->map; 207 socket.current_map = ob->map;
164 208 send_map_info (pl);
165 if (socket.mapinfocmd)
166 {
167 if (ob->map && ob->map->path[0])
168 {
169 int flags = 0;
170
171 if (ob->map->tile_path[0])
172 flags |= 1;
173 if (ob->map->tile_path[1])
174 flags |= 2;
175 if (ob->map->tile_path[2])
176 flags |= 4;
177 if (ob->map->tile_path[3])
178 flags |= 8;
179
180 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
181 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
182 }
183 else
184 snprintf (buf, MAX_BUF, "mapinfo current");
185
186 socket.send_packet (buf);
187 }
188 } 209 }
189 else if (socket.current_x != ob->x || socket.current_y != ob->y) 210 else if (socket.current_x != ob->x || socket.current_y != ob->y)
190 { 211 {
191 int dx = ob->x - socket.current_x; 212 int dx = ob->x - socket.current_x;
192 int dy = ob->y - socket.current_y; 213 int dy = ob->y - socket.current_y;
193 214
194 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
195 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
196 else
197 {
198 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 215 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
199 socket.floorbox_reset (); 216 socket.floorbox_reset ();
200 }
201 } 217 }
202 218
203 socket.current_x = ob->x; 219 socket.current_x = ob->x;
204 socket.current_y = ob->y; 220 socket.current_y = ob->y;
221}
205 222
206 region *reg = ob->region (); 223/**
207 if (socket.current_region != reg) 224 * This sends the skill number to name mapping. We ignore
208 { 225 * the params - we always send the same info no matter what.
209 socket.current_region = reg; 226 */
210 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname); 227static void
228send_skill_info (client *ns, char *params)
229{
230 packet sl;
231 sl << "replyinfo skill_info\n";
232
233 for (int i = 1; i < NUM_SKILLS; i++)
234 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
235
236 if (sl.length () > MAXSOCKBUF)
211 } 237 {
238 LOG (llevError, "Buffer overflow in send_skill_info!\n");
239 fatal (0);
240 }
241
242 ns->send_packet (sl);
243}
244
245/**
246 * This sends the spell path to name mapping. We ignore
247 * the params - we always send the same info no matter what.
248 */
249static void
250send_spell_paths (client * ns, char *params)
251{
252 packet sl;
253
254 sl << "replyinfo spell_paths\n";
255
256 for (int i = 0; i < NRSPELLPATHS; i++)
257 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
258
259 if (sl.length () > MAXSOCKBUF)
260 {
261 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
262 fatal (0);
263 }
264
265 ns->send_packet (sl);
212} 266}
213 267
214/** 268/**
215 * RequestInfo is sort of a meta command. There is some specific 269 * RequestInfo is sort of a meta command. There is some specific
216 * request of information, but we call other functions to provide 270 * request of information, but we call other functions to provide
217 * that information. 271 * that information.
218 */ 272 */
219void 273void
220RequestInfo (char *buf, int len, client * ns) 274RequestInfo (char *buf, int len, client *ns)
221{ 275{
222 char *params = NULL, *cp; 276 char *params;
223
224 /* No match */
225 char bigbuf[MAX_BUF];
226 int slen;
227
228 /* Set up replyinfo before we modify any of the buffers - this is used
229 * if we don't find a match.
230 */
231 strcpy (bigbuf, "replyinfo ");
232 slen = strlen (bigbuf);
233 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
234 277
235 /* find the first space, make it null, and update the 278 /* find the first space, make it null, and update the
236 * params pointer. 279 * params pointer.
237 */ 280 */
238 for (cp = buf; *cp != '\0'; cp++) 281 for (params = buf; *params; params++)
239 if (*cp == ' ') 282 if (*params == ' ')
240 { 283 {
241 *cp = '\0';
242 params = cp + 1; 284 *params++ = 0;
243 break; 285 break;
244 } 286 }
245 287
246 if (!strcmp (buf, "image_info"))
247 send_image_info (ns, params);
248 else if (!strcmp (buf, "image_sums"))
249 send_image_sums (ns, params);
250 else if (!strcmp (buf, "skill_info")) 288 if (!strcmp (buf, "skill_info"))
251 send_skill_info (ns, params); 289 send_skill_info (ns, params);
252 else if (!strcmp (buf, "spell_paths")) 290 else if (!strcmp (buf, "spell_paths"))
253 send_spell_paths (ns, params); 291 send_spell_paths (ns, params);
254 else 292 else
255 ns->send_packet (bigbuf, len); 293 {
294 // undo tokenisation above and send replyinfo with the request unchanged
295 if (*params)
296 *--params = ' ';
297
298 ns->send_packet_printf ("replyinfo %s", buf);
299 }
256} 300}
257 301
258void 302void
259ExtCmd (char *buf, int len, player *pl) 303ExtCmd (char *buf, int len, player *pl)
260{ 304{
… …
263 307
264void 308void
265ExtiCmd (char *buf, int len, client *ns) 309ExtiCmd (char *buf, int len, client *ns)
266{ 310{
267 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); 311 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
312}
313
314//-GPL
315
316void
317client::mapinfo_queue_clear ()
318{
319 for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
320 free (*i);
321
322 mapinfo_queue.clear ();
323}
324
325bool
326client::mapinfo_try (char *buf)
327{
328 char *token = buf;
329 buf += strlen (buf) + 9;
330
331 // initial map and its origin
332 maptile *map = pl->viewpoint->map;
333 int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
334 int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
335 int max_distance = 8; // limit maximum path length to something generous
336
337 while (*buf && map && max_distance)
338 {
339 int dir = *buf++ - '1';
340
341 if (dir >= 0 && dir <= 3)
342 {
343 if (!map->tile_path [dir])
344 map = 0;
345 else if (map->tile_available (dir, false))
346 {
347 maptile *neigh = map->tile_map [dir];
348
349 switch (dir)
350 {
351 case 0: mapy -= neigh->height; break;
352 case 2: mapy += map ->height; break;
353 case 3: mapx -= neigh->width ; break;
354 case 1: mapx += map ->width ; break;
355 }
356
357 map = neigh;
358 --max_distance;
359 }
360 else
361 return 0;
362 }
363 else
364 max_distance = 0;
365 }
366
367 if (!max_distance)
368 send_packet_printf ("mapinfo %s error", token);
369 else if (!map || !map->path)
370 send_packet_printf ("mapinfo %s nomap", token);
371 else
372 {
373 int flags = 0;
374
375 if (map->tile_path[0]) flags |= 1;
376 if (map->tile_path[1]) flags |= 2;
377 if (map->tile_path[2]) flags |= 4;
378 if (map->tile_path[3]) flags |= 8;
379
380 send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
381 }
382
383 return 1;
384}
385
386void
387client::mapinfo_queue_run ()
388{
389 if (mapinfo_queue.empty () || !pl)
390 return;
391
392 for (int i = 0; i < mapinfo_queue.size (); ++i)
393 if (mapinfo_try (mapinfo_queue [i]))
394 {
395 free (mapinfo_queue [i]);
396 mapinfo_queue.erase (i);
397 }
398 else
399 ++i;
268} 400}
269 401
270void 402void
271MapInfoCmd (char *buf, int len, player *pl) 403MapInfoCmd (char *buf, int len, player *pl)
272{ 404{
273 // <mapinfo tag spatial tile-path 405 // <mapinfo tag spatial tile-path
274 // >mapinfo tag spatial flags x y w h hash 406 // >mapinfo tag spatial flags x y w h hash
275 407
276 char bigbuf[MAX_BUF], *token;
277
278 token = buf; 408 char *token = buf;
279 // copy token 409
280 if (!(buf = strchr (buf, ' '))) 410 if (!(buf = strchr (buf, ' ')))
281 return; 411 return;
282 412
283 *buf++ = 0;
284
285 if (!strncmp (buf, "spatial ", 8)) 413 if (!strncmp (buf, " spatial ", 9))
286 { 414 {
287 buf += 8; 415 char *copy = strdup (token);
416 copy [buf - token] = 0;
288 417
289 // initial map and its origin 418#if 0
290 maptile *map = pl->ob->map; 419 // this makes only sense when we flush the buffer immediately
291 sint16 dx, dy; 420 if (pl->ns->mapinfo_try (copy))
292 int mapx = pl->ns->mapx / 2 - pl->ob->x; 421 free (copy);
293 int mapy = pl->ns->mapy / 2 - pl->ob->y;
294 int max_distance = 8; // limit maximum path length to something generous
295
296 while (*buf && map && max_distance)
297 {
298 int dir = *buf++;
299
300 switch (dir)
301 {
302 case '1':
303 dx = 0;
304 dy = -1;
305 map = map->xy_find (dx, dy);
306 map && (mapy -= map->height);
307 break;
308 case '2':
309 mapx += map->width;
310 dx = map->width;
311 dy = 0;
312 map = map->xy_find (dx, dy);
313 break;
314 case '3':
315 mapy += map->height;
316 dx = 0;
317 dy = map->height;
318 map = map->xy_find (dx, dy);
319 break;
320 case '4':
321 dx = -1;
322 dy = 0;
323 map = map->xy_find (dx, dy);
324 map && (mapx -= map->width);
325 break;
326 }
327
328 --max_distance;
329 }
330
331 if (!max_distance)
332 snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
333 else if (map && map->path[0])
334 {
335 int flags = 0;
336
337 if (map->tile_path[0])
338 flags |= 1;
339 if (map->tile_path[1])
340 flags |= 2;
341 if (map->tile_path[2])
342 flags |= 4;
343 if (map->tile_path[3])
344 flags |= 8;
345
346 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
347 }
348 else 422 else
349 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 423#endif
424 pl->ns->mapinfo_queue.push_back (copy);
350 } 425 }
351 else 426 else
352 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 427 pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
353
354 pl->ns->send_packet (bigbuf);
355} 428}
356 429
357/** This is the Setup cmd */ 430/** This is the Setup cmd */
358void 431void
359SetUp (char *buf, int len, client * ns) 432SetUp (char *buf, int len, client * ns)
… …
371AddMeCmd (char *buf, int len, client *ns) 444AddMeCmd (char *buf, int len, client *ns)
372{ 445{
373 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); 446 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
374} 447}
375 448
376/** Reply to ExtendedInfos command */ 449//+GPL
377void
378ToggleExtendedInfos (char *buf, int len, client * ns)
379{
380 char cmdback[MAX_BUF];
381 char command[50];
382 int info, nextinfo;
383
384 cmdback[0] = '\0';
385 nextinfo = 0;
386
387 while (1)
388 {
389 /* 1. Extract an info */
390 info = nextinfo;
391
392 while ((info < len) && (buf[info] == ' '))
393 info++;
394
395 if (info >= len)
396 break;
397
398 nextinfo = info + 1;
399
400 while ((nextinfo < len) && (buf[nextinfo] != ' '))
401 nextinfo++;
402
403 if (nextinfo - info >= 49) /*Erroneous info asked */
404 continue;
405
406 strncpy (command, &(buf[info]), nextinfo - info);
407
408 /* 2. Interpret info */
409 if (!strcmp ("smooth", command))
410 /* Toggle smoothing */
411 ns->EMI_smooth = !ns->EMI_smooth;
412 else
413 /*bad value */;
414
415 /*3. Next info */
416 }
417
418 strcpy (cmdback, "ExtendedInfoSet");
419
420 if (ns->EMI_smooth)
421 {
422 strcat (cmdback, " ");
423 strcat (cmdback, "smoothing");
424 }
425
426 ns->send_packet (cmdback);
427}
428
429/*
430#define MSG_TYPE_BOOK 1
431#define MSG_TYPE_CARD 2
432#define MSG_TYPE_PAPER 3
433#define MSG_TYPE_SIGN 4
434#define MSG_TYPE_MONUMENT 5
435#define MSG_TYPE_SCRIPTED_DIALOG 6*/
436
437/** Reply to ExtendedInfos command */
438void
439ToggleExtendedText (char *buf, int len, client * ns)
440{
441 char cmdback[MAX_BUF];
442 char temp[10];
443 char command[50];
444 int info, nextinfo, i, flag;
445
446 cmdback[0] = '\0';
447
448 nextinfo = 0;
449 while (1)
450 {
451 /* 1. Extract an info */
452 info = nextinfo;
453
454 while ((info < len) && (buf[info] == ' '))
455 info++;
456
457 if (info >= len)
458 break;
459
460 nextinfo = info + 1;
461
462 while ((nextinfo < len) && (buf[nextinfo] != ' '))
463 nextinfo++;
464
465 if (nextinfo - info >= 49) /*Erroneous info asked */
466 continue;
467
468 strncpy (command, &(buf[info]), nextinfo - info);
469 command[nextinfo - info] = '\0';
470 /* 2. Interpret info */
471 i = sscanf (command, "%d", &flag);
472
473 if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
474 ns->supported_readables |= (1 << flag);
475 /*3. Next info */
476 }
477
478 /* Send resulting state */
479 strcpy (cmdback, "ExtendedTextSet");
480
481 for (i = 0; i <= MSG_TYPE_LAST; i++)
482 if (ns->supported_readables & (1 << i))
483 {
484 strcat (cmdback, " ");
485 snprintf (temp, sizeof (temp), "%d", i);
486 strcat (cmdback, temp);
487 }
488
489 ns->send_packet (cmdback);
490}
491
492/**
493 * client requested an image. send it rate-limited
494 * before flushing.
495 */
496void
497AskFaceCmd (char *buf, int len, client *ns)
498{
499 ns->askface.push_back (atoi (buf));
500}
501
502/**
503 * Tells client the picture it has to use
504 * to smooth a picture number given as argument.
505 */
506void
507AskSmooth (char *buf, int len, client *ns)
508{
509 ns->send_face (atoi (buf));
510}
511 450
512/** 451/**
513 * This handles the general commands from the client (ie, north, fire, cast, 452 * This handles the general commands from the client (ie, north, fire, cast,
514 * etc.) 453 * etc.)
515 */ 454 */
… …
528 return; 467 return;
529 468
530 buf++; 469 buf++;
531 } 470 }
532 471
533 execute_newserver_command (pl->ob, (char *) buf); 472 execute_newserver_command (pl->ob, (char *)buf);
534 473
535 /* Perhaps something better should be done with a left over count. 474 /* Perhaps something better should be done with a left over count.
536 * Cleaning up the input should probably be done first - all actions 475 * Cleaning up the input should probably be done first - all actions
537 * for the command that issued the count should be done before any other 476 * for the command that issued the count should be done before any other
538 * commands. 477 * commands.
539 */ 478 */
540 pl->count = 0; 479 pl->count = 0;
541} 480}
542 481
543
544/** 482/**
545 * This handles the general commands from the client (ie, north, fire, cast, 483 * This handles the general commands from the client (ie, north, fire, cast,
546 * etc.). It is a lot like PlayerCmd above, but is called with the 484 * etc.). It is a lot like PlayerCmd above, but is called with the
547 * 'ncom' method which gives more information back to the client so it 485 * 'ncom' method which gives more information back to the client so it
548 * can throttle. 486 * can throttle.
… …
550void 488void
551NewPlayerCmd (char *buf, int len, player *pl) 489NewPlayerCmd (char *buf, int len, player *pl)
552{ 490{
553 if (len <= 6) 491 if (len <= 6)
554 { 492 {
555 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 493 LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
556 return; 494 return;
557 } 495 }
558 496
559 uint16 cmdid = net_uint16 ((uint8 *)buf); 497 uint16 cmdid = net_uint16 ((uint8 *)buf);
560 sint32 repeat = net_sint32 ((uint8 *)buf + 2); 498 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
… …
573 * commands. 511 * commands.
574 */ 512 */
575 pl->count = 0; 513 pl->count = 0;
576 514
577 //TODO: schmorp thinks whatever this calculates, it makes no sense at all 515 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
578 int time = fabs (pl->ob->speed) < 0.001 516 int time = pl->ob->has_active_speed ()
579 ? time = MAX_TIME * 100
580 : time = (int) (MAX_TIME / fabs (pl->ob->speed)); 517 ? (int) (MAX_TIME / pl->ob->speed)
518 : MAX_TIME * 100;
581 519
582 /* Send confirmation of command execution now */ 520 /* Send confirmation of command execution now */
583 packet sl ("comc"); 521 packet sl ("comc");
584 sl << uint16 (cmdid) << uint32 (time); 522 sl << uint16 (cmdid) << uint32 (time);
585 pl->ns->send_packet (sl); 523 pl->ns->send_packet (sl);
… …
617 { 555 {
618 case ST_PLAYING: 556 case ST_PLAYING:
619 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 557 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
620 break; 558 break;
621 559
622 case ST_CHANGE_CLASS:
623 key_change_class (pl->ob, buf[0]);
624 break;
625
626 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 560 case ST_GET_PARTY_PASSWORD: /* Get password for party */
627 receive_party_password (pl->ob, 13); 561 receive_party_password (pl->ob, 13);
628 break; 562 break;
629 563
630 default: 564 default:
631 LOG (llevError, "Unknown input state: %d\n", ns->state); 565 LOG (llevError, "Unknown input state: %d\n", ns->state);
632 } 566 }
633} 567}
634 568
635/** 569/**
636 * Client tells its version. If there is a mismatch, we close the 570 * Client tells its version info.
637 * socket. In real life, all we should care about is the client having
638 * something older than the server. If we assume the client will be
639 * backwards compatible, having it be a later version should not be a
640 * problem.
641 */ 571 */
642void 572void
643VersionCmd (char *buf, int len, client * ns) 573VersionCmd (char *buf, int len, client *ns)
644{ 574{
645 if (!buf) 575 INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
646 {
647 LOG (llevError, "CS: received corrupted version command\n");
648 return;
649 }
650
651 ns->cs_version = atoi (buf);
652 ns->sc_version = ns->cs_version;
653
654 LOG (llevDebug, "connection from client <%s>\n", buf);
655
656 //TODO: should log here just for statistics
657
658 //if (VERSION_CS != ns->cs_version)
659 // unchecked;
660
661 char *cp = strchr (buf + 1, ' ');
662 if (!cp)
663 return;
664
665 ns->sc_version = atoi (cp);
666
667 //if (VERSION_SC != ns->sc_version)
668 // unchecked;
669
670 cp = strchr (cp + 1, ' ');
671
672 if (cp)
673 {
674 assign (ns->version, cp + 1);
675
676 if (ns->sc_version < 1026)
677 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
678 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
679 }
680} 576}
681 577
682/** sound related functions. */ 578/** sound related functions. */
683void 579void
684SetSound (char *buf, int len, client * ns) 580SetSound (char *buf, int len, client * ns)
… …
702 * syntax is: move (to) (tag) (nrof) 598 * syntax is: move (to) (tag) (nrof)
703 */ 599 */
704void 600void
705MoveCmd (char *buf, int len, player *pl) 601MoveCmd (char *buf, int len, player *pl)
706{ 602{
707 int vals[3], i; 603 int to, tag, nrof;
708 604
709 /* A little funky here. We only cycle for 2 records, because 605 if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
710 * we obviously are not going to find a space after the third
711 * record. Perhaps we should just replace this with a
712 * sscanf?
713 */
714 for (i = 0; i < 2; i++)
715 { 606 {
716 vals[i] = atoi (buf);
717
718 if (!(buf = strchr (buf, ' ')))
719 {
720 LOG (llevError, "Incomplete move command: %s\n", buf); 607 LOG (llevError, "Incomplete move command: %s\n", buf);
721 return; 608 return;
722 }
723
724 buf++;
725 } 609 }
726 610
727 vals[2] = atoi (buf); 611 esrv_move_object (pl->ob, to, tag, nrof);
728
729/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
730 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
731} 612}
732 613
733/****************************************************************************** 614/******************************************************************************
734 * 615 *
735 * Start of commands the server sends to the client. 616 * Start of commands the server sends to the client.
… …
744send_query (client *ns, uint8 flags, const char *text) 625send_query (client *ns, uint8 flags, const char *text)
745{ 626{
746 ns->send_packet_printf ("query %d %s", flags, text ? text : ""); 627 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
747} 628}
748 629
630/**
631 * Get player's current range attack in obuf.
632 */
633static void
634rangetostring (player *pl, char *obuf)
635{
636 dynbuf_text &buf = msg_dynbuf; buf.clear ();
637
638#if 0
639 // print ranged/chosen_skill etc. objects every call
640 printf ("%s %s => %s (%s)\n",
641 pl->ranged_ob ? &pl->ranged_ob->name : "-",
642 pl->combat_ob ? &pl->combat_ob->name : "-",
643 pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-",
644 pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-"
645 );
646#endif
647
648 if (pl->ranged_ob)
649 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
650
651 if (pl->combat_ob)
652 buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
653
654#if 0
655 //TODO: remove this when slot system is working, this is only for debugging
656 if (pl->ob->chosen_skill)
657 buf << " Skill*: " << pl->ob->chosen_skill->name;
658#endif
659
660 //TODO: maybe golem should become the current_weapon, quite simply?
661 if (pl->golem)
662 buf << " Golem*: " << pl->golem->name;
663
664 buf << '\0';
665 buf.linearise (obuf);
666}
667
749#define AddIfInt64(Old,New,Type) if (Old != New) {\ 668#define AddIfInt64(Old,New,Type) if (Old != New) {\
750 Old = New; \ 669 Old = New; \
751 sl << uint8 (Type) << uint64 (New); \ 670 sl << uint8 (Type) << uint64 (New); \
752 } 671 }
753 672
… …
759#define AddIfShort(Old,New,Type) if (Old != New) {\ 678#define AddIfShort(Old,New,Type) if (Old != New) {\
760 Old = New; \ 679 Old = New; \
761 sl << uint8 (Type) << uint16 (New); \ 680 sl << uint8 (Type) << uint16 (New); \
762 } 681 }
763 682
764#define AddIfFloat(Old,New,Type) if (Old != New) {\ 683#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
765 Old = New; \ 684 Old = New; \
766 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ 685 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
767 } 686 }
768 687
769#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ 688#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
770 free(Old); Old = strdup (New);\ 689 free(Old); Old = strdup (New);\
771 sl << uint8 (Type) << data8 (New); \ 690 sl << uint8 (Type) << data8 (New); \
… …
785 704
786 client *ns = pl->ns; 705 client *ns = pl->ns;
787 if (!ns) 706 if (!ns)
788 return; 707 return;
789 708
790 object *ob = pl->ob; 709 object *ob = pl->observe;
791 if (!ob) 710 if (!ob)
792 return; 711 return;
712
713 player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
793 714
794 packet sl ("stats"); 715 packet sl ("stats");
795 716
796 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); 717 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
797 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); 718 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
… …
806 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); 727 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
807 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); 728 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
808 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); 729 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
809 730
810 for (int s = 0; s < NUM_SKILLS; s++) 731 for (int s = 0; s < NUM_SKILLS; s++)
811 if (object *skill = pl->last_skill_ob[s]) 732 if (object *skill = opl->last_skill_ob [s])
812 if (skill->stats.exp != ns->last_skill_exp [s]) 733 if (skill->stats.exp != ns->last_skill_exp [s])
813 { 734 {
814 ns->last_skill_exp [s] = skill->stats.exp; 735 ns->last_skill_exp [s] = skill->stats.exp;
815 736
816 /* Always send along the level if exp changes. This is only 737 /* Always send along the level if exp changes. This is only
… …
824 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); 745 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
825 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); 746 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
826 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); 747 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
827 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); 748 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
828 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); 749 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
829 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); 750 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
830 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); 751 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
831 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 752 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
832 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); 753 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
833 754
834 flags = 0; 755 flags = 0;
835 756
836 if (pl->fire_on) 757 if (opl->fire_on)
837 flags |= SF_FIREON; 758 flags |= SF_FIREON;
838 759
839 if (pl->run_on) 760 if (opl->run_on)
840 flags |= SF_RUNON; 761 flags |= SF_RUNON;
841 762
842 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); 763 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
843 764
844 if (ns->sc_version < 1025)
845 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
846 else
847 for (int i = 0; i < NROFATTACKS; i++) 765 for (int i = 0; i < NROFATTACKS; i++)
848 { 766 {
849 /* Skip ones we won't send */ 767 /* Skip ones we won't send */
850 if (atnr_cs_stat[i] == -1) 768 if (atnr_cs_stat[i] == -1)
851 continue; 769 continue;
852 770
853 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); 771 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
854 } 772 }
855 773
856 if (pl->ns->monitor_spells) 774 if (pl->ns->monitor_spells)
857 { 775 {
858 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); 776 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
859 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); 777 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
860 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); 778 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
861 } 779 }
862 780
863 rangetostring (ob, buf); /* we want use the new fire & run system in new client */ 781 rangetostring (opl, buf); /* we want use the new fire & run system in new client */
864 AddIfString (ns->stats.range, buf, CS_STAT_RANGE); 782 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
865 set_title (ob, buf); 783 set_title (ob, buf);
866 AddIfString (ns->stats.title, buf, CS_STAT_TITLE); 784 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
867 785
868 /* Only send it away if we have some actual data */ 786 /* Only send it away if we have some actual data */
… …
872 790
873/** 791/**
874 * Tells the client that here is a player it should start using. 792 * Tells the client that here is a player it should start using.
875 */ 793 */
876void 794void
877esrv_new_player (player *pl, uint32 weight) 795esrv_new_player (player *pl)
878{ 796{
797 sint32 weight = pl->ob->client_weight ();
798
879 packet sl ("player"); 799 packet sl ("player");
880 800
881 sl << uint32 (pl->ob->count) 801 sl << uint32 (pl->ob->count)
882 << uint32 (weight) 802 << uint32 (weight)
883 << uint32 (pl->ob->face) 803 << uint32 (pl->ob->face)
884 << data8 (pl->ob->name); 804 << data8 (pl->ob->name);
885 805
886 pl->ns->last_weight = weight; 806 pl->ns->last_weight = weight;
887 pl->ns->send_packet (sl); 807 pl->ns->send_packet (sl);
888 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
889} 808}
890 809
891/****************************************************************************** 810/******************************************************************************
892 * 811 *
893 * Start of map related commands. 812 * Start of map related commands.
… …
950 869
951 if (!ns.faces_sent[face_num]) 870 if (!ns.faces_sent[face_num])
952 if (ob) 871 if (ob)
953 ns.send_faces (ob); 872 ns.send_faces (ob);
954 else 873 else
955 ns.send_face (face_num); 874 ns.send_face (face_num, 10);
956 875
957 sl << uint16 (face_num); 876 sl << uint16 (face_num);
958 return 1; 877 return 1;
959 } 878 }
960 879
961 /* Nothing changed */ 880 /* Nothing changed */
962 return 0; 881 return 0;
963} 882}
964 883
965/** 884//-GPL
966 * Returns the size of a data for a map square as returned by
967 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
968 * available.
969 */
970int
971getExtendedMapInfoSize (client * ns)
972{
973 int result = 0;
974
975 if (ns->ext_mapinfos)
976 {
977 if (ns->EMI_smooth)
978 result += 1; /*One byte for smoothlevel */
979 }
980
981 return result;
982}
983 885
984// prefetch (and touch) all maps within a specific distancd 886// prefetch (and touch) all maps within a specific distancd
985static void 887static void
986prefetch_surrounding_maps (maptile *map, int distance) 888prefetch_surrounding_maps (maptile *map, int distance)
987{ 889{
988 map->last_access = runtime; 890 map->touch ();
989 891
990 if (--distance) 892 if (--distance)
991 for (int dir = 4; --dir; ) 893 for (int dir = 4; dir--; )
992 if (const shstr &path = map->tile_path [dir]) 894 if (const shstr &path = map->tile_path [dir])
993 if (maptile *&neigh = map->tile_map [dir]) 895 if (maptile *&neigh = map->tile_map [dir])
994 prefetch_surrounding_maps (neigh, distance); 896 prefetch_surrounding_maps (neigh, distance);
995 else 897 else
996 neigh = maptile::find_async (path, map); 898 neigh = maptile::find_async (path, map);
… …
1001prefetch_surrounding_maps (object *op) 903prefetch_surrounding_maps (object *op)
1002{ 904{
1003 prefetch_surrounding_maps (op->map, 3); 905 prefetch_surrounding_maps (op->map, 3);
1004} 906}
1005 907
908//+GPL
909
1006/** 910/**
1007 * This function uses the new map1 protocol command to send the map 911 * Draws client map.
1008 * to the client. It is necessary because the old map command supports
1009 * a maximum map size of 15x15.
1010 * This function is much simpler than the old one. This is because
1011 * the old function optimized to send as few face identifiers as possible,
1012 * at the expense of sending more coordinate location (coordinates were
1013 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1014 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1015 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1016 * and use the other 4 bits for other informatiion. For full documentation
1017 * of what we send, see the doc/Protocol file.
1018 * I will describe internally what we do:
1019 * the ns->lastmap shows how the map last looked when sent to the client.
1020 * in the lastmap structure, there is a cells array, which is set to the
1021 * maximum viewable size (As set in config.h).
1022 * in the cells, there are faces and a count value.
1023 * we use the count value to hold the darkness value. If -1, then this space
1024 * is not viewable.
1025 * we use faces[0] faces[1] faces[2] to hold what the three layers
1026 * look like.
1027 */ 912 */
1028void 913void
1029draw_client_map1 (object *pl) 914draw_client_map (player *pl)
1030{ 915{
1031 int x, y, ax, ay, startlen, max_x, max_y, oldlen; 916 object *ob = pl->viewpoint;
1032 sint16 nx, ny;
1033 int estartlen, eoldlen;
1034 uint8 eentrysize;
1035 uint16 ewhatstart, ewhatflag;
1036 uint8 extendedinfos;
1037 maptile *m;
1038
1039 client &socket = *pl->contr->ns;
1040
1041 if (!pl->active) 917 if (!pl->observe->active)
1042 return; 918 return;
1043
1044 check_map_change (pl->contr);
1045 prefetch_surrounding_maps (pl);
1046
1047 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1048 packet esl;
1049
1050 startlen = sl.length ();
1051
1052 /*Extendedmapinfo structure initialisation */
1053 if (socket.ext_mapinfos)
1054 {
1055 extendedinfos = EMI_NOREDRAW;
1056
1057 if (socket.EMI_smooth)
1058 extendedinfos |= EMI_SMOOTH;
1059
1060 ewhatstart = esl.length ();
1061 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1062 could need to be taken away */
1063 eentrysize = getExtendedMapInfoSize (&socket);
1064 esl << "mapextended "
1065 << uint8 (extendedinfos)
1066 << uint8 (eentrysize);
1067
1068 estartlen = esl.length ();
1069 }
1070
1071 /* x,y are the real map locations. ax, ay are viewport relative
1072 * locations.
1073 */
1074 ay = 0;
1075
1076 /* We could do this logic as conditionals in the if statement,
1077 * but that started to get a bit messy to look at.
1078 */
1079 max_x = pl->x + (socket.mapx + 1) / 2;
1080 max_y = pl->y + (socket.mapy + 1) / 2;
1081
1082 maptile *plmap = pl->map;
1083
1084 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1085 {
1086 ax = 0;
1087 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1088 {
1089 int emask, mask;
1090 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1091
1092 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1093
1094 /* If the coordinates are not valid, or it is too dark to see,
1095 * we tell the client as such
1096 */
1097 nx = x;
1098 ny = y;
1099 m = get_map_from_coord (plmap, &nx, &ny);
1100
1101 if (!m)
1102 {
1103 /* space is out of map. Update space and clear values
1104 * if this hasn't already been done. If the space is out
1105 * of the map, it shouldn't have a head
1106 */
1107 if (lastcell.count != -1)
1108 {
1109 sl << uint16 (mask);
1110 map_clearcell (&lastcell, -1);
1111 }
1112
1113 continue;
1114 }
1115
1116 m->touch ();
1117
1118 int d = pl->contr->blocked_los[ax][ay];
1119
1120 if (d > 3)
1121 {
1122
1123 int need_send = 0, count;
1124
1125 /* This block deals with spaces that are not visible for whatever
1126 * reason. Still may need to send the head for this space.
1127 */
1128
1129 oldlen = sl.length ();
1130
1131 sl << uint16 (mask);
1132
1133 if (lastcell.count != -1)
1134 need_send = 1;
1135
1136 count = -1;
1137
1138 /* properly clear a previously sent big face */
1139 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1140 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1141 need_send = 1;
1142
1143 map_clearcell (&lastcell, count);
1144
1145 if ((mask & 0xf) || need_send)
1146 sl[oldlen + 1] = mask & 0xff;
1147 else
1148 sl.reset (oldlen);
1149 }
1150 else
1151 {
1152 /* In this block, the space is visible.
1153 */
1154
1155 /* Rather than try to figure out what everything that we might
1156 * need to send is, then form the packet after that,
1157 * we presume that we will in fact form a packet, and update
1158 * the bits by what we do actually send. If we send nothing,
1159 * we just back out sl.length () to the old value, and no harm
1160 * is done.
1161 * I think this is simpler than doing a bunch of checks to see
1162 * what if anything we need to send, setting the bits, then
1163 * doing those checks again to add the real data.
1164 */
1165 oldlen = sl.length ();
1166 eoldlen = esl.length ();
1167
1168 sl << uint16 (mask);
1169
1170 unsigned char dummy;
1171 unsigned char *last_ext = &dummy;
1172
1173 /* Darkness changed */
1174 if (lastcell.count != d && socket.darkness)
1175 {
1176 mask |= 0x8;
1177
1178 if (socket.extmap)
1179 {
1180 *last_ext |= 0x80;
1181 last_ext = &sl[sl.length ()];
1182 sl << uint8 (d);
1183 }
1184 else
1185 sl << uint8 (255 - 64 * d);
1186 }
1187
1188 lastcell.count = d;
1189
1190 mapspace &ms = m->at (nx, ny);
1191
1192 if (socket.extmap)
1193 {
1194 uint8 stat_hp = 0;
1195 uint8 stat_width = 0;
1196 uint8 flags = 0;
1197 UUID player = 0;
1198
1199 // send hp information, if applicable
1200 if (object *op = ms.faces_obj [0])
1201 {
1202 if (op->head || op->invisible)
1203 ; // do not show
1204 else if (op->type == PLAYER
1205 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1206 {
1207 if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1208 {
1209 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1210 stat_width = op->arch->tail_x;
1211 }
1212 }
1213
1214 if (op->msg && op->msg[0] == '@')
1215 flags |= 1;
1216
1217 if (op->type == PLAYER && op != pl)
1218 player = op->count;
1219 }
1220
1221 if (lastcell.stat_hp != stat_hp)
1222 {
1223 lastcell.stat_hp = stat_hp;
1224
1225 mask |= 0x8;
1226 *last_ext |= 0x80;
1227 last_ext = &sl[sl.length ()];
1228
1229 sl << uint8 (5) << uint8 (stat_hp);
1230
1231 if (stat_width > 1)
1232 {
1233 *last_ext |= 0x80;
1234 last_ext = &sl[sl.length ()];
1235
1236 sl << uint8 (6) << uint8 (stat_width);
1237 }
1238 }
1239
1240 if (lastcell.player != player)
1241 {
1242 lastcell.player = player;
1243
1244 mask |= 0x8;
1245 *last_ext |= 0x80;
1246 last_ext = &sl[sl.length ()];
1247
1248 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
1249 }
1250
1251 if (lastcell.flags != flags)
1252 {
1253 lastcell.flags = flags;
1254
1255 mask |= 0x8;
1256 *last_ext |= 0x80;
1257 last_ext = &sl[sl.length ()];
1258
1259 sl << uint8 (8) << uint8 (flags);
1260 }
1261 }
1262
1263 /* Floor face */
1264 if (update_space (sl, socket, ms, lastcell, 2))
1265 mask |= 0x4;
1266
1267 /* Middle face */
1268 if (update_space (sl, socket, ms, lastcell, 1))
1269 mask |= 0x2;
1270
1271 if (ms.player () == pl
1272 && (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1273 {
1274 // force player to be visible to himself if invisible
1275 if (lastcell.faces[0] != pl->face)
1276 {
1277 lastcell.faces[0] = pl->face;
1278
1279 mask |= 0x1;
1280 sl << uint16 (pl->face);
1281
1282 socket.send_faces (pl);
1283 }
1284 }
1285 /* Top face */
1286 else if (update_space (sl, socket, ms, lastcell, 0))
1287 mask |= 0x1;
1288
1289
1290 /* Check to see if we are in fact sending anything for this
1291 * space by checking the mask. If so, update the mask.
1292 * if not, reset the len to that from before adding the mask
1293 * value, so we don't send those bits.
1294 */
1295 if (mask & 0xf)
1296 sl[oldlen + 1] = mask & 0xff;
1297 else
1298 sl.reset (oldlen);
1299
1300 if (socket.ext_mapinfos)
1301 esl << uint16 (emask);
1302
1303 if (socket.EMI_smooth)
1304 {
1305 for (int layer = 2+1; layer--; )
1306 {
1307 object *ob = ms.faces_obj [layer];
1308
1309 // If there is no object for this space, or if the face for the object
1310 // is the blank face, set the smoothlevel to zero.
1311 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1312
1313 // We've gotten what face we want to use for the object. Now see if
1314 // if it has changed since we last sent it to the client.
1315 if (lastcell.smooth[layer] != smoothlevel)
1316 {
1317 lastcell.smooth[layer] = smoothlevel;
1318 esl << uint8 (smoothlevel);
1319 emask |= 1 << layer;
1320 }
1321 }
1322
1323 if (emask & 0xf)
1324 esl[eoldlen + 1] = emask & 0xff;
1325 else
1326 esl.reset (eoldlen);
1327 }
1328 } /* else this is a viewable space */
1329 } /* for x loop */
1330 } /* for y loop */
1331
1332 /* Verify that we in fact do need to send this */
1333 if (socket.ext_mapinfos)
1334 {
1335 if (!(sl.length () > startlen || socket.sent_scroll))
1336 {
1337 /* No map data will follow, so don't say the client
1338 * it doesn't need draw!
1339 */
1340 ewhatflag &= ~EMI_NOREDRAW;
1341 esl[ewhatstart + 1] = ewhatflag & 0xff;
1342 }
1343
1344 if (esl.length () > estartlen)
1345 socket.send_packet (esl);
1346 }
1347
1348 if (sl.length () > startlen || socket.sent_scroll)
1349 {
1350 socket.send_packet (sl);
1351 socket.sent_scroll = 0;
1352 }
1353}
1354
1355/**
1356 * Draws client map.
1357 */
1358void
1359draw_client_map (object *pl)
1360{
1361 int i, j;
1362 sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1363 int mflags;
1364 struct Map newmap;
1365 maptile *m, *pm;
1366
1367 if (pl->type != PLAYER)
1368 {
1369 LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1370 return;
1371 }
1372
1373 pm = pl->map;
1374 919
1375 /* If player is just joining the game, he isn't here yet, so the map 920 /* If player is just joining the game, he isn't here yet, so the map
1376 * can get swapped out. If so, don't try to send them a map. All will 921 * can get swapped out. If so, don't try to send them a map. All will
1377 * be OK once they really log in. 922 * be OK once they really log in.
1378 */ 923 */
1379 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 924 if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1380 return; 925 return;
1381 926
1382 memset (&newmap, 0, sizeof (struct Map)); 927 int startlen, oldlen;
1383 928
1384 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) 929 check_map_change (pl);
1385 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) 930 prefetch_surrounding_maps (pl->ob);
931
932 /* do LOS after calls to update_position */
933 /* unfortunately, we need to udpate los when observing, currently */
934 if (pl->do_los || pl->viewpoint != pl->ob)
935 {
936 pl->do_los = 0;
937 pl->update_los ();
938 }
939
940 /**
941 * This function uses the new map1 protocol command to send the map
942 * to the client. It is necessary because the old map command supports
943 * a maximum map size of 15x15.
944 * This function is much simpler than the old one. This is because
945 * the old function optimized to send as few face identifiers as possible,
946 * at the expense of sending more coordinate location (coordinates were
947 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
948 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
949 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
950 * and use the other 4 bits for other informatiion. For full documentation
951 * of what we send, see the doc/Protocol file.
952 * I will describe internally what we do:
953 * the ns->lastmap shows how the map last looked when sent to the client.
954 * in the lastmap structure, there is a cells array, which is set to the
955 * maximum viewable size (As set in config.h).
956 * in the cells, there are faces and a count value.
957 * we use the count value to hold the darkness value. If -1, then this space
958 * is not viewable.
959 * we use faces[0] faces[1] faces[2] to hold what the three layers
960 * look like.
961 */
962
963 client &socket = *pl->ns;
964
965 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
966
967 startlen = sl.length ();
968
969 int hx = socket.mapx / 2;
970 int hy = socket.mapy / 2;
971
972 ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
973 int ax = dx + hx;
974 int ay = dy + hy;
975
976 int mask = (ax << 10) | (ay << 4);
977 MapCell &lastcell = socket.lastmap.cells[ax][ay];
978
979 /* If the coordinates are not valid, or it is too dark to see,
980 * we tell the client as such
981 */
982 if (!m)
1386 { 983 {
1387 ax = i; 984 /* space is out of map. Update space and clear values
1388 ay = j; 985 * if this hasn't already been done. If the space is out
1389 m = pm; 986 * of the map, it shouldn't have a head.
1390 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1391
1392 if (mflags & P_OUT_OF_MAP)
1393 continue;
1394
1395 /* If a map is visible to the player, we don't want to swap it out
1396 * just to reload it. This should really call something like
1397 * swap_map, but this is much more efficient and 'good enough'
1398 */ 987 */
1399 if (mflags & P_NEW_MAP) 988 if (lastcell.count != -1)
1400 m->timeout = 50; 989 {
990 sl << uint16 (mask);
991 map_clearcell (&lastcell, -1);
992 }
993
994 continue;
1401 } 995 }
1402 996
1403 /* do LOS after calls to update_position */ 997 int d = pl->blocked_los_uc (dx, dy);
1404 if (pl->contr->do_los) 998
999 if (d > 3)
1405 { 1000 {
1406 update_los (pl); 1001 /* This block deals with spaces that are not visible for whatever
1407 pl->contr->do_los = 0; 1002 * reason. Still may need to send the head for this space.
1003 */
1004 if (lastcell.count != -1
1005 || lastcell.faces[0]
1006 || lastcell.faces[1]
1007 || lastcell.faces[2]
1008 || lastcell.stat_hp
1009 || lastcell.flags
1010 || lastcell.player)
1011 sl << uint16 (mask);
1012
1013 /* properly clear a previously sent big face */
1014 map_clearcell (&lastcell, -1);
1408 } 1015 }
1409 1016 else
1410 /* Big maps need a different drawing mechanism to work */
1411 draw_client_map1 (pl);
1412}
1413
1414
1415/*****************************************************************************/
1416
1417/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1418
1419/* a player. Of course, the client need to know the command to be able to */
1420
1421/* manage it ! */
1422
1423/*****************************************************************************/
1424void
1425send_plugin_custom_message (object *pl, char *buf)
1426{
1427 pl->contr->ns->send_packet (buf);
1428}
1429
1430/**
1431 * This sends the skill number to name mapping. We ignore
1432 * the params - we always send the same info no matter what.
1433 */
1434void
1435send_skill_info (client *ns, char *params)
1436{
1437 packet sl;
1438 sl << "replyinfo skill_info\n";
1439
1440 for (int i = 1; i < NUM_SKILLS; i++)
1441 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
1442
1443 if (sl.length () >= MAXSOCKBUF)
1444 { 1017 {
1445 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 1018 /* In this block, the space is visible.
1446 fatal (0); 1019 */
1020
1021 /* Rather than try to figure out what everything that we might
1022 * need to send is, then form the packet after that,
1023 * we presume that we will in fact form a packet, and update
1024 * the bits by what we do actually send. If we send nothing,
1025 * we just back out sl.length () to the old value, and no harm
1026 * is done.
1027 * I think this is simpler than doing a bunch of checks to see
1028 * what if anything we need to send, setting the bits, then
1029 * doing those checks again to add the real data.
1030 */
1031 oldlen = sl.length ();
1032
1033 sl << uint16 (mask);
1034
1035 unsigned char dummy;
1036 unsigned char *last_ext = &dummy;
1037
1038 /* Darkness changed */
1039 if (lastcell.count != d)
1040 {
1041 mask |= 0x8;
1042
1043 *last_ext |= 0x80;
1044 last_ext = &sl[sl.length ()];
1045 sl << uint8 (d);
1046 }
1047
1048 lastcell.count = d;
1049
1050 mapspace &ms = m->at (nx, ny);
1051 ms.update ();
1052
1053 // extmap handling
1054 uint8 stat_hp = 0;
1055 uint8 stat_width = 0;
1056 uint8 flags = 0;
1057 tag_t player = 0;
1058
1059 // send hp information, if applicable
1060 if (object *op = ms.faces_obj [0])
1061 if (op->is_head () && !op->invisible)
1062 {
1063 if (op->stats.maxhp > op->stats.hp
1064 && op->stats.maxhp > 0
1065 && (op->type == PLAYER
1066 || op->type == DOOR // does not work, have maxhp 0
1067 || op->flag [FLAG_MONSTER]
1068 || op->flag [FLAG_ALIVE]
1069 || op->flag [FLAG_GENERATOR]))
1070 {
1071 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1072 stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1073 }
1074
1075 if (expect_false (op->has_dialogue ()))
1076 flags |= 1;
1077
1078 if (expect_false (op->type == PLAYER))
1079 player = op == ob ? pl->ob->count
1080 : op == pl->ob ? ob->count
1081 : op->count;
1082 }
1083
1084 if (expect_false (lastcell.stat_hp != stat_hp))
1085 {
1086 lastcell.stat_hp = stat_hp;
1087
1088 mask |= 0x8;
1089 *last_ext |= 0x80;
1090 last_ext = &sl[sl.length ()];
1091
1092 sl << uint8 (5) << uint8 (stat_hp);
1093
1094 if (stat_width > 1)
1095 {
1096 *last_ext |= 0x80;
1097 last_ext = &sl[sl.length ()];
1098
1099 sl << uint8 (6) << uint8 (stat_width);
1100 }
1101 }
1102
1103 if (expect_false (lastcell.player != player))
1104 {
1105 lastcell.player = player;
1106
1107 mask |= 0x8;
1108 *last_ext |= 0x80;
1109 last_ext = &sl[sl.length ()];
1110
1111 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1112 }
1113
1114 if (expect_false (lastcell.flags != flags))
1115 {
1116 lastcell.flags = flags;
1117
1118 mask |= 0x8;
1119 *last_ext |= 0x80;
1120 last_ext = &sl[sl.length ()];
1121
1122 sl << uint8 (8) << uint8 (flags);
1123 }
1124
1125 // faces
1126
1127 /* Floor face */
1128 if (update_space (sl, socket, ms, lastcell, 2))
1129 mask |= 0x4;
1130
1131 /* Middle face */
1132 if (update_space (sl, socket, ms, lastcell, 1))
1133 mask |= 0x2;
1134
1135 if (expect_false (ob->invisible)
1136 && ob->invisible & (ob->invisible < 50 ? 1 : 7)
1137 && ms.player () == ob)
1138 {
1139 // force player to be visible to himself if invisible
1140 if (lastcell.faces[0] != ob->face)
1141 {
1142 lastcell.faces[0] = ob->face;
1143
1144 mask |= 0x1;
1145 sl << uint16 (ob->face);
1146
1147 socket.send_faces (ob);
1148 }
1149 }
1150 /* Top face */
1151 else if (update_space (sl, socket, ms, lastcell, 0))
1152 mask |= 0x1;
1153
1154 /* Check to see if we are in fact sending anything for this
1155 * space by checking the mask. If so, update the mask.
1156 * if not, reset the len to that from before adding the mask
1157 * value, so we don't send those bits.
1158 */
1159 if (mask & 0xf)
1160 sl[oldlen + 1] = mask & 0xff;
1161 else
1162 sl.reset (oldlen);
1163 } /* else this is a viewable space */
1164 ordered_mapwalk_end
1165
1166 socket.flush_fx ();
1167
1168 if (sl.length () > startlen || socket.sent_scroll)
1447 } 1169 {
1448
1449 ns->send_packet (sl); 1170 socket.send_packet (sl);
1450} 1171 socket.sent_scroll = 0;
1451
1452/**
1453 * This sends the spell path to name mapping. We ignore
1454 * the params - we always send the same info no matter what.
1455 */
1456void
1457send_spell_paths (client * ns, char *params)
1458{
1459 packet sl;
1460
1461 sl << "replyinfo spell_paths\n";
1462
1463 for (int i = 0; i < NRSPELLPATHS; i++)
1464 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1465
1466 if (sl.length () >= MAXSOCKBUF)
1467 { 1172 }
1468 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1469 fatal (0);
1470 }
1471
1472 ns->send_packet (sl);
1473} 1173}
1474 1174
1475/** 1175/**
1476 * This looks for any spells the player may have that have changed their stats. 1176 * This looks for any spells the player may have that have changed their stats.
1477 * it then sends an updspell packet for each spell that has changed in this way 1177 * it then sends an updspell packet for each spell that has changed in this way
… …
1480esrv_update_spells (player *pl) 1180esrv_update_spells (player *pl)
1481{ 1181{
1482 if (!pl->ns) 1182 if (!pl->ns)
1483 return; 1183 return;
1484 1184
1185 pl->ns->update_spells = false;
1186
1485 if (!pl->ns->monitor_spells) 1187 if (!pl->ns->monitor_spells)
1486 return; 1188 return;
1487 1189
1488 for (object *spell = pl->ob->inv; spell; spell = spell->below) 1190 for (object *spell = pl->ob->inv; spell; spell = spell->below)
1489 {
1490 if (spell->type == SPELL) 1191 if (spell->type == SPELL)
1491 { 1192 {
1492 int flags = 0; 1193 int flags = 0;
1194 int val;
1493 1195
1494 /* check if we need to update it */ 1196 /* check if we need to update it */
1495 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) 1197 val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1198 if (spell->cached_sp != val)
1496 { 1199 {
1497 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1200 spell->cached_sp = val;
1498 flags |= UPD_SP_MANA; 1201 flags |= UPD_SP_MANA;
1499 } 1202 }
1500 1203
1501 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) 1204 val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1205 if (spell->cached_grace != val)
1502 { 1206 {
1503 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1207 spell->cached_grace = val;
1504 flags |= UPD_SP_GRACE; 1208 flags |= UPD_SP_GRACE;
1505 } 1209 }
1506 1210
1507 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) 1211 val = casting_level (pl->ob, spell);
1212 if (spell->cached_eat != val)
1508 { 1213 {
1509 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1214 spell->cached_eat = val;
1510 flags |= UPD_SP_DAMAGE; 1215 flags |= UPD_SP_LEVEL;
1511 } 1216 }
1512 1217
1513 if (flags) 1218 if (flags)
1514 { 1219 {
1515 packet sl; 1220 packet sl;
1516 1221
1517 sl << "updspell " 1222 sl << "updspell "
1518 << uint8 (flags) 1223 << uint8 (flags)
1519 << uint32 (spell->count); 1224 << uint32 (spell->count);
1520 1225
1521 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 1226 if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1522 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 1227 if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1523 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 1228 if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1524 1229
1525 pl->ns->send_packet (sl); 1230 pl->ns->send_packet (sl);
1526 } 1231 }
1527 } 1232 }
1528 }
1529} 1233}
1530 1234
1531void 1235void
1532esrv_remove_spell (player *pl, object *spell) 1236esrv_remove_spell (player *pl, object *spell)
1533{ 1237{
… …
1558 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1262 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1559 return; 1263 return;
1560 } 1264 }
1561 1265
1562 /* store costs and damage in the object struct, to compare to later */ 1266 /* store costs and damage in the object struct, to compare to later */
1563 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1267 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1564 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1268 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1565 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1269 spell->cached_eat = casting_level (pl->ob, spell);
1566 1270
1567 /* figure out which skill it uses, if it uses one */ 1271 /* figure out which skill it uses, if it uses one */
1568 if (spell->skill) 1272 if (spell->skill)
1569 { 1273 if (object *tmp = pl->find_skill (spell->skill))
1570 for (i = 1; i < NUM_SKILLS; i++)
1571 if (!strcmp (spell->skill, skill_names[i]))
1572 {
1573 skill = i + CS_STAT_SKILLINFO; 1274 skill = tmp->subtype + CS_STAT_SKILLINFO;
1574 break;
1575 }
1576 }
1577 1275
1578 // spells better have a face 1276 // spells better have a face
1579 if (!spell->face) 1277 if (!spell->face)
1580 { 1278 {
1581 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); 1279 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1582 spell->face = face_find ("burnout.x11", blank_face); 1280 spell->face = face_find ("burnout.x11", blank_face);
1583 } 1281 }
1282
1283 pl->ns->send_face (spell->face);
1584 1284
1585 /* send the current values */ 1285 /* send the current values */
1586 sl << uint32 (spell->count) 1286 sl << uint32 (spell->count)
1587 << uint16 (spell->level) 1287 << uint16 (spell->level)
1588 << uint16 (spell->casting_time) 1288 << uint16 (spell->casting_time)
1589 << uint16 (spell->last_sp) 1289 << uint16 (spell->cached_sp)
1590 << uint16 (spell->last_grace) 1290 << uint16 (spell->cached_grace)
1591 << uint16 (spell->last_eat) 1291 << uint16 (spell->cached_eat)
1592 << uint8 (skill) 1292 << uint8 (skill)
1593 << uint32 (spell->path_attuned) 1293 << uint32 (spell->path_attuned)
1594 << uint32 (spell->face) 1294 << uint32 (spell->face)
1595 << data8 (spell->name) 1295 << data8 (spell->name)
1596 << data16 (spell->msg); 1296 << data16 (spell->msg);
… …
1624 * bytes and 3 strings (because that is the spec) so we need to 1324 * bytes and 3 strings (because that is the spec) so we need to
1625 * check that the length of those 3 strings, plus the 23 bytes, 1325 * check that the length of those 3 strings, plus the 23 bytes,
1626 * won't take us over the length limit for the socket, if it does, 1326 * won't take us over the length limit for the socket, if it does,
1627 * we need to send what we already have, and restart packet formation 1327 * we need to send what we already have, and restart packet formation
1628 */ 1328 */
1329 if (spell->type != SPELL)
1330 continue;
1331
1629 /* Seeing crashes by overflowed buffers. Quick arithemetic seems 1332 /* Seeing crashes by overflowed buffers. Quick arithemetic seems
1630 * to show add_spell is 26 bytes + 2 strings. However, the overun 1333 * to show add_spell is 26 bytes + 2 strings. However, the overun
1631 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem 1334 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1632 * like it will fix this 1335 * like it will fix this
1633 */ 1336 */
1634 if (spell->type != SPELL)
1635 continue;
1636
1637 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 1337 if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1638 { 1338 {
1339 pl->ns->flush_fx ();
1639 pl->ns->send_packet (sl); 1340 pl->ns->send_packet (sl);
1640 1341
1641 sl.reset (); 1342 sl.reset ();
1642 sl << "addspell "; 1343 sl << "addspell ";
1643 } 1344 }
… …
1651 return; 1352 return;
1652 } 1353 }
1653 else 1354 else
1654 append_spell (pl, sl, spell); 1355 append_spell (pl, sl, spell);
1655 1356
1656 if (sl.length () >= MAXSOCKBUF) 1357 if (sl.length () > MAXSOCKBUF)
1657 { 1358 {
1658 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 1359 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1659 fatal (0); 1360 fatal (0);
1660 } 1361 }
1661 1362
1662 /* finally, we can send the packet */ 1363 /* finally, we can send the packet */
1364 pl->ns->flush_fx ();
1663 pl->ns->send_packet (sl); 1365 pl->ns->send_packet (sl);
1664} 1366}
1665 1367
1368//-GPL
1369

Diff Legend

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