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.74 by root, Wed Mar 14 01:19:10 2007 UTC vs.
Revision 1.155 by root, Thu Nov 5 16:03:07 2009 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001 Mark Wedel 5 * Copyright (©) 2001,2007 Mark Wedel
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 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 *
99 */ 101 */
100 mx = ns->mapx; 102 mx = ns->mapx;
101 my = ns->mapy; 103 my = ns->mapy;
102 104
103 /* the x and y here are coordinates for the new map, i.e. if we moved 105 /* 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, 106 * (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 107 * if the destination x or y coordinate is outside the viewable
106 * area, we clear the values - otherwise, the old values 108 * area, we clear the values - otherwise, the old values
107 * are preserved, and the check_head thinks it needs to clear them. 109 * are preserved, and the check_head thinks it needs to clear them.
108 */ 110 */
109 for (x = 0; x < mx; x++) 111 for (x = 0; x < mx; x++)
110 {
111 for (y = 0; y < my; y++) 112 for (y = 0; y < my; y++)
112 {
113 if (x >= ns->mapx || y >= ns->mapy) 113 if (x >= ns->mapx || y >= ns->mapy)
114 /* clear cells outside the viewable area */ 114 /* clear cells outside the viewable area */
115 memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); 115 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) 116 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 */ 117 /* clear newly visible tiles within the viewable area */
118 memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); 118 memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
119 else 119 else
120 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); 120 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
121 }
122 }
123 121
124 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); 122 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
125 123
126 /* Make sure that the next "map1" command will be sent (even if it is 124 /* Make sure that the next "map1" command will be sent (even if it is
127 * empty). 125 * empty).
130} 128}
131 129
132static void 130static void
133clear_map (player *pl) 131clear_map (player *pl)
134{ 132{
133 pl->ns->mapinfo_queue_clear ();
134
135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); 135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
136
137 pl->ns->force_newmap = false;
136 138
137 if (pl->ns->newmapcmd == 1) 139 if (pl->ns->newmapcmd == 1)
138 pl->ns->send_packet ("newmap"); 140 pl->ns->send_packet ("newmap");
139 141
140 pl->ns->floorbox_reset (); 142 pl->ns->floorbox_reset ();
143}
144
145static void
146send_map_info (player *pl)
147{
148 client &socket = *pl->ns;
149 object *ob = pl->viewpoint;
150
151 if (socket.mapinfocmd)
152 {
153 if (ob->map && ob->map->path[0])
154 {
155 int flags = 0;
156
157 if (ob->map->tile_path[0]) flags |= 1;
158 if (ob->map->tile_path[1]) flags |= 2;
159 if (ob->map->tile_path[2]) flags |= 4;
160 if (ob->map->tile_path[3]) flags |= 8;
161
162 socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
163 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
164 ob->map->width, ob->map->height, &ob->map->path);
165 }
166 else
167 socket.send_packet ("mapinfo current");
168 }
141} 169}
142 170
143/** check for map/region change and send new map data */ 171/** check for map/region change and send new map data */
144static void 172static void
145check_map_change (player *pl) 173check_map_change (player *pl)
146{ 174{
147 client &socket = *pl->ns; 175 client &socket = *pl->ns;
148 object *ob = pl->ob; 176 object *ob = pl->viewpoint;
149 char buf[MAX_BUF]; /* eauugggh */
150 177
151 if (socket.current_map != ob->map) 178 region *reg = ob->region ();
179 if (socket.current_region != reg)
180 {
181 INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
182 socket.current_region = reg;
152 { 183 }
184
185 // first try to aovid a full newmap on tiled map scrolls
186 if (socket.current_map != ob->map && !socket.force_newmap)
187 {
188 rv_vector rv;
189
190 get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
191
192 // manhattan distance is very handy here
193 if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
194 {
195 socket.current_map = ob->map;
196 socket.current_x = ob->x;
197 socket.current_y = ob->y;
198
199 socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
200 socket.floorbox_reset ();
201 send_map_info (pl);
202 }
203 }
204
205 if (socket.current_map != ob->map || socket.force_newmap)
206 {
207 clear_map (pl);
153 socket.current_map = ob->map; 208 socket.current_map = ob->map;
154 209 send_map_info (pl);
155 clear_map (pl);
156
157 if (socket.mapinfocmd)
158 {
159 if (ob->map && ob->map->path[0])
160 {
161 int flags = 0;
162
163 if (ob->map->tile_path[0])
164 flags |= 1;
165 if (ob->map->tile_path[1])
166 flags |= 2;
167 if (ob->map->tile_path[2])
168 flags |= 4;
169 if (ob->map->tile_path[3])
170 flags |= 8;
171
172 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
173 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
174 }
175 else
176 snprintf (buf, MAX_BUF, "mapinfo current");
177
178 socket.send_packet (buf);
179 }
180 } 210 }
181 else if (socket.current_x != ob->x || socket.current_y != ob->y) 211 else if (socket.current_x != ob->x || socket.current_y != ob->y)
182 { 212 {
183 int dx = ob->x - socket.current_x; 213 int dx = ob->x - socket.current_x;
184 int dy = ob->y - socket.current_y; 214 int dy = ob->y - socket.current_y;
185 215
186 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
187 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
188 else
189 {
190 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 216 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
191 socket.floorbox_reset (); 217 socket.floorbox_reset ();
192 }
193 } 218 }
194 219
195 socket.current_x = ob->x; 220 socket.current_x = ob->x;
196 socket.current_y = ob->y; 221 socket.current_y = ob->y;
197
198 region *reg = ob->region ();
199 if (socket.current_region != reg)
200 {
201 socket.current_region = reg;
202 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
203 }
204} 222}
205 223
206/** 224/**
207 * RequestInfo is sort of a meta command. There is some specific 225 * RequestInfo is sort of a meta command. There is some specific
208 * request of information, but we call other functions to provide 226 * request of information, but we call other functions to provide
209 * that information. 227 * that information.
210 */ 228 */
211void 229void
212RequestInfo (char *buf, int len, client * ns) 230RequestInfo (char *buf, int len, client *ns)
213{ 231{
214 char *params = NULL, *cp; 232 char *params;
215
216 /* No match */
217 char bigbuf[MAX_BUF];
218 int slen;
219
220 /* Set up replyinfo before we modify any of the buffers - this is used
221 * if we don't find a match.
222 */
223 strcpy (bigbuf, "replyinfo ");
224 slen = strlen (bigbuf);
225 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
226 233
227 /* find the first space, make it null, and update the 234 /* find the first space, make it null, and update the
228 * params pointer. 235 * params pointer.
229 */ 236 */
230 for (cp = buf; *cp != '\0'; cp++) 237 for (params = buf; *params; params++)
231 if (*cp == ' ') 238 if (*params == ' ')
232 { 239 {
233 *cp = '\0';
234 params = cp + 1; 240 *params++ = 0;
235 break; 241 break;
236 } 242 }
237 243
238 if (!strcmp (buf, "image_info"))
239 send_image_info (ns, params);
240 else if (!strcmp (buf, "image_sums"))
241 send_image_sums (ns, params);
242 else if (!strcmp (buf, "skill_info")) 244 if (!strcmp (buf, "skill_info"))
243 send_skill_info (ns, params); 245 send_skill_info (ns, params);
244 else if (!strcmp (buf, "spell_paths")) 246 else if (!strcmp (buf, "spell_paths"))
245 send_spell_paths (ns, params); 247 send_spell_paths (ns, params);
246 else 248 else
247 ns->send_packet (bigbuf, len); 249 {
250 // undo tokenisation above and send replyinfo with the request unchanged
251 if (*params)
252 *--params = ' ';
253
254 ns->send_packet_printf ("replyinfo %s", buf);
255 }
248} 256}
249 257
250void 258void
251ExtCmd (char *buf, int len, player *pl) 259ExtCmd (char *buf, int len, player *pl)
252{ 260{
255 263
256void 264void
257ExtiCmd (char *buf, int len, client *ns) 265ExtiCmd (char *buf, int len, client *ns)
258{ 266{
259 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); 267 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
268}
269
270//-GPL
271
272void
273client::mapinfo_queue_clear ()
274{
275 for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
276 free (*i);
277
278 mapinfo_queue.clear ();
279}
280
281bool
282client::mapinfo_try (char *buf)
283{
284 char *token = buf;
285 buf += strlen (buf) + 9;
286
287 // initial map and its origin
288 maptile *map = pl->viewpoint->map;
289 int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
290 int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
291 int max_distance = 8; // limit maximum path length to something generous
292
293 while (*buf && map && max_distance)
294 {
295 int dir = *buf++ - '1';
296
297 if (dir >= 0 && dir <= 3)
298 {
299 if (!map->tile_path [dir])
300 map = 0;
301 else if (map->tile_available (dir, false))
302 {
303 maptile *neigh = map->tile_map [dir];
304
305 switch (dir)
306 {
307 case 0: mapy -= neigh->height; break;
308 case 2: mapy += map ->height; break;
309 case 3: mapx -= neigh->width ; break;
310 case 1: mapx += map ->width ; break;
311 }
312
313 map = neigh;
314 --max_distance;
315 }
316 else
317 return 0;
318 }
319 else
320 max_distance = 0;
321 }
322
323 if (!max_distance)
324 send_packet_printf ("mapinfo %s error", token);
325 else if (!map || !map->path)
326 send_packet_printf ("mapinfo %s nomap", token);
327 else
328 {
329 int flags = 0;
330
331 if (map->tile_path[0]) flags |= 1;
332 if (map->tile_path[1]) flags |= 2;
333 if (map->tile_path[2]) flags |= 4;
334 if (map->tile_path[3]) flags |= 8;
335
336 send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
337 }
338
339 return 1;
340}
341
342void
343client::mapinfo_queue_run ()
344{
345 if (mapinfo_queue.empty () || !pl)
346 return;
347
348 for (int i = 0; i < mapinfo_queue.size (); ++i)
349 if (mapinfo_try (mapinfo_queue [i]))
350 {
351 free (mapinfo_queue [i]);
352 mapinfo_queue.erase (i);
353 }
354 else
355 ++i;
260} 356}
261 357
262void 358void
263MapInfoCmd (char *buf, int len, player *pl) 359MapInfoCmd (char *buf, int len, player *pl)
264{ 360{
265 // <mapinfo tag spatial tile-path 361 // <mapinfo tag spatial tile-path
266 // >mapinfo tag spatial flags x y w h hash 362 // >mapinfo tag spatial flags x y w h hash
267 363
268 char bigbuf[MAX_BUF], *token;
269
270 token = buf; 364 char *token = buf;
271 // copy token 365
272 if (!(buf = strchr (buf, ' '))) 366 if (!(buf = strchr (buf, ' ')))
273 return; 367 return;
274 368
275 *buf++ = 0;
276
277 if (!strncmp (buf, "spatial ", 8)) 369 if (!strncmp (buf, " spatial ", 9))
278 { 370 {
279 buf += 8; 371 char *copy = strdup (token);
372 copy [buf - token] = 0;
280 373
281 // initial map and its origin 374#if 0
282 maptile *map = pl->ob->map; 375 // this makes only sense when we flush the buffer immediately
283 sint16 dx, dy; 376 if (pl->ns->mapinfo_try (copy))
284 int mapx = pl->ns->mapx / 2 - pl->ob->x; 377 free (copy);
285 int mapy = pl->ns->mapy / 2 - pl->ob->y;
286 int max_distance = 8; // limit maximum path length to something generous
287
288 while (*buf && map && max_distance)
289 {
290 int dir = *buf++;
291
292 switch (dir)
293 {
294 case '1':
295 dx = 0;
296 dy = -1;
297 map = map->xy_find (dx, dy);
298 map && (mapy -= map->height);
299 break;
300 case '2':
301 mapx += map->width;
302 dx = map->width;
303 dy = 0;
304 map = map->xy_find (dx, dy);
305 break;
306 case '3':
307 mapy += map->height;
308 dx = 0;
309 dy = map->height;
310 map = map->xy_find (dx, dy);
311 break;
312 case '4':
313 dx = -1;
314 dy = 0;
315 map = map->xy_find (dx, dy);
316 map && (mapx -= map->width);
317 break;
318 }
319
320 --max_distance;
321 }
322
323 if (!max_distance)
324 snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
325 else if (map && map->path[0])
326 {
327 int flags = 0;
328
329 if (map->tile_path[0])
330 flags |= 1;
331 if (map->tile_path[1])
332 flags |= 2;
333 if (map->tile_path[2])
334 flags |= 4;
335 if (map->tile_path[3])
336 flags |= 8;
337
338 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
339 }
340 else 378 else
341 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 379#endif
380 pl->ns->mapinfo_queue.push_back (copy);
342 } 381 }
343 else 382 else
344 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 383 pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
345
346 pl->ns->send_packet (bigbuf);
347} 384}
348 385
349/** This is the Setup cmd - easy first implementation */ 386/** This is the Setup cmd */
350void 387void
351SetUp (char *buf, int len, client * ns) 388SetUp (char *buf, int len, client * ns)
352{ 389{
353 int s, slen; 390 INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len));
354 char *cmd, *param, cmdback[HUGE_BUF];
355
356 /* run through the cmds of setup
357 * syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ...
358 *
359 * we send the status of the cmd back, or a FALSE is the cmd is the server unknown
360 * The client then must sort this out
361 */
362
363 //LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
364
365 strcpy (cmdback, "setup");
366 for (s = 0; s < len; )
367 {
368 cmd = &buf[s];
369
370 /* find the next space, and put a null there */
371 for (; buf[s] && buf[s] != ' '; s++)
372 ;
373
374 buf[s++] = 0;
375
376 while (buf[s] == ' ')
377 s++;
378
379 if (s >= len)
380 break;
381
382 param = &buf[s];
383
384 for (; buf[s] && buf[s] != ' '; s++)
385 ;
386
387 buf[s++] = 0;
388
389 while (buf[s] == ' ')
390 s++;
391
392 slen = strlen (cmdback);
393 safe_strcat (cmdback, " ", &slen, HUGE_BUF);
394 safe_strcat (cmdback, cmd, &slen, HUGE_BUF);
395 safe_strcat (cmdback, " ", &slen, HUGE_BUF);
396
397 if (!strcmp (cmd, "sound"))
398 {
399 ns->sound = atoi (param);
400 safe_strcat (cmdback, param, &slen, HUGE_BUF);
401 }
402 else if (!strcmp (cmd, "exp64"))
403 safe_strcat (cmdback, param, &slen, HUGE_BUF);
404 else if (!strcmp (cmd, "spellmon"))
405 {
406 ns->monitor_spells = atoi (param);
407 safe_strcat (cmdback, param, &slen, HUGE_BUF);
408 }
409 else if (!strcmp (cmd, "darkness"))
410 {
411 ns->darkness = atoi (param);
412 safe_strcat (cmdback, param, &slen, HUGE_BUF);
413 }
414 else if (!strcmp (cmd, "map1cmd"))
415 {
416 if (atoi (param))
417 ns->mapmode = Map1Cmd;
418 /* if beyond this size, need to use map1cmd no matter what */
419 if (ns->mapx > 11 || ns->mapy > 11)
420 ns->mapmode = Map1Cmd;
421 safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF);
422 }
423 else if (!strcmp (cmd, "map1acmd"))
424 {
425 if (atoi (param))
426 ns->mapmode = Map1aCmd;
427 /* if beyond this size, need to use map1acmd no matter what */
428 if (ns->mapx > 11 || ns->mapy > 11)
429 ns->mapmode = Map1aCmd;
430 safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF);
431 }
432 else if (!strcmp (cmd, "newmapcmd"))
433 {
434 ns->newmapcmd = atoi (param);
435 safe_strcat (cmdback, param, &slen, HUGE_BUF);
436 }
437 else if (!strcmp (cmd, "mapinfocmd"))
438 {
439 ns->mapinfocmd = atoi (param);
440 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
441 }
442 else if (!strcmp (cmd, "extcmd"))
443 {
444 ns->extcmd = atoi (param);
445 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
446 }
447 else if (!strcmp (cmd, "extmap"))
448 {
449 ns->extmap = atoi (param);
450 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
451 }
452 else if (!strcmp (cmd, "facecache"))
453 {
454 ns->facecache = atoi (param);
455 safe_strcat (cmdback, param, &slen, HUGE_BUF);
456 }
457 else if (!strcmp (cmd, "faceset"))
458 {
459 char tmpbuf[20];
460 int q = atoi (param);
461
462 if (is_valid_faceset (q))
463 ns->faceset = q;
464 sprintf (tmpbuf, "%d", ns->faceset);
465 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
466 /* if the client is using faceset, it knows about image2 command */
467 ns->image2 = 1;
468 }
469 else if (!strcmp (cmd, "itemcmd"))
470 {
471 /* Version of the item protocol command to use. Currently,
472 * only supported versions are 1 and 2. Using a numeric
473 * value will make it very easy to extend this in the future.
474 */
475 char tmpbuf[20];
476 int q = atoi (param);
477
478 if (q < 1 || q > 2)
479 {
480 strcpy (tmpbuf, "FALSE");
481 }
482 else
483 {
484 ns->itemcmd = q;
485 sprintf (tmpbuf, "%d", ns->itemcmd);
486 }
487 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
488 }
489 else if (!strcmp (cmd, "mapsize"))
490 {
491 int x, y = 0;
492 char tmpbuf[MAX_BUF], *cp;
493
494 x = atoi (param);
495 for (cp = param; *cp != 0; cp++)
496 if (*cp == 'x' || *cp == 'X')
497 {
498 y = atoi (cp + 1);
499 break;
500 }
501
502 if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
503 {
504 sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
505 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
506 }
507 else
508 {
509 ns->mapx = x;
510 ns->mapy = y;
511 /* better to send back what we are really using and not the
512 * param as given to us in case it gets parsed differently.
513 */
514 sprintf (tmpbuf, "%dx%d", x, y);
515 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
516 /* If beyond this size and still using orig map command, need to
517 * go to map1cmd.
518 */
519 if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd)
520 ns->mapmode = Map1Cmd;
521 }
522 }
523 else if (!strcmp (cmd, "extendedMapInfos"))
524 {
525 /* Added by tchize
526 * prepare to use the mapextended command
527 */
528 char tmpbuf[20];
529
530 ns->ext_mapinfos = (atoi (param));
531 sprintf (tmpbuf, "%d", ns->ext_mapinfos);
532 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
533 }
534 else if (!strcmp (cmd, "extendedTextInfos"))
535 {
536 /* Added by tchize
537 * prepare to use the extended text commands
538 * Client toggle this to non zero to get exttext
539 */
540 char tmpbuf[20];
541
542 ns->has_readable_type = (atoi (param));
543 sprintf (tmpbuf, "%d", ns->has_readable_type);
544 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
545 }
546 else
547 {
548 /* Didn't get a setup command we understood -
549 * report a failure to the client.
550 */
551 safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
552 }
553 } /* for processing all the setup commands */
554
555 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
556 ns->send_packet (cmdback);
557} 391}
558 392
559/** 393/**
560 * The client has requested to be added to the game. 394 * The client has requested to be added to the game.
561 * This is what takes care of it. We tell the client how things worked out. 395 * This is what takes care of it. We tell the client how things worked out.
562 * I am not sure if this file is the best place for this function. however, 396 * I am not sure if this file is the best place for this function. however,
563 * it either has to be here or init_sockets needs to be exported. 397 * it either has to be here or init_sockets needs to be exported.
564 */ 398 */
565void 399void
566AddMeCmd (char *buf, int len, client * ns) 400AddMeCmd (char *buf, int len, client *ns)
567{ 401{
568 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); 402 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
569} 403}
570 404
571/** Reply to ExtendedInfos command */ 405//+GPL
572void
573ToggleExtendedInfos (char *buf, int len, client * ns)
574{
575 char cmdback[MAX_BUF];
576 char command[50];
577 int info, nextinfo;
578
579 cmdback[0] = '\0';
580 nextinfo = 0;
581
582 while (1)
583 {
584 /* 1. Extract an info */
585 info = nextinfo;
586
587 while ((info < len) && (buf[info] == ' '))
588 info++;
589
590 if (info >= len)
591 break;
592
593 nextinfo = info + 1;
594
595 while ((nextinfo < len) && (buf[nextinfo] != ' '))
596 nextinfo++;
597
598 if (nextinfo - info >= 49) /*Erroneous info asked */
599 continue;
600
601 strncpy (command, &(buf[info]), nextinfo - info);
602
603 /* 2. Interpret info */
604 if (!strcmp ("smooth", command))
605 /* Toggle smoothing */
606 ns->EMI_smooth = !ns->EMI_smooth;
607 else
608 /*bad value */;
609
610 /*3. Next info */
611 }
612
613 strcpy (cmdback, "ExtendedInfoSet");
614
615 if (ns->EMI_smooth)
616 {
617 strcat (cmdback, " ");
618 strcat (cmdback, "smoothing");
619 }
620
621 ns->send_packet (cmdback);
622}
623 406
624/* 407/*
625#define MSG_TYPE_BOOK 1 408#define MSG_TYPE_BOOK 1
626#define MSG_TYPE_CARD 2 409#define MSG_TYPE_CARD 2
627#define MSG_TYPE_PAPER 3 410#define MSG_TYPE_PAPER 3
644 while (1) 427 while (1)
645 { 428 {
646 /* 1. Extract an info */ 429 /* 1. Extract an info */
647 info = nextinfo; 430 info = nextinfo;
648 431
649 while ((info < len) && (buf[info] == ' ')) 432 while ((info < len) && (buf [info] == ' '))
650 info++; 433 info++;
651 434
652 if (info >= len) 435 if (info >= len)
653 break; 436 break;
654 437
655 nextinfo = info + 1; 438 nextinfo = info + 1;
656 439
657 while ((nextinfo < len) && (buf[nextinfo] != ' ')) 440 while ((nextinfo < len) && (buf [nextinfo] != ' '))
658 nextinfo++; 441 nextinfo++;
659 442
660 if (nextinfo - info >= 49) /*Erroneous info asked */ 443 if (nextinfo - info >= 49) /*Erroneous info asked */
661 continue; 444 continue;
662 445
663 strncpy (command, &(buf[info]), nextinfo - info); 446 memcpy (command, buf + info, nextinfo - info);
664 command[nextinfo - info] = '\0'; 447 command [nextinfo - info] = 0;
448
665 /* 2. Interpret info */ 449 /* 2. Interpret info */
666 i = sscanf (command, "%d", &flag); 450 i = sscanf (command, "%d", &flag);
667 451
668 if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) 452 if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
669 ns->supported_readables |= (1 << flag); 453 ns->supported_readables |= (1 << flag);
683 467
684 ns->send_packet (cmdback); 468 ns->send_packet (cmdback);
685} 469}
686 470
687/** 471/**
688 * Tells client the picture it has to use
689 * to smooth a picture number given as argument.
690 */
691void
692AskSmooth (char *buf, int len, client *ns)
693{
694 ns->send_face (atoi (buf));
695}
696
697/**
698 * This handles the general commands from the client (ie, north, fire, cast, 472 * This handles the general commands from the client (ie, north, fire, cast,
699 * etc.) 473 * etc.)
700 */ 474 */
701void 475void
702PlayerCmd (char *buf, int len, player *pl) 476PlayerCmd (char *buf, int len, player *pl)
713 return; 487 return;
714 488
715 buf++; 489 buf++;
716 } 490 }
717 491
718 execute_newserver_command (pl->ob, (char *) buf); 492 execute_newserver_command (pl->ob, (char *)buf);
719 493
720 /* Perhaps something better should be done with a left over count. 494 /* Perhaps something better should be done with a left over count.
721 * Cleaning up the input should probably be done first - all actions 495 * Cleaning up the input should probably be done first - all actions
722 * for the command that issued the count should be done before any other 496 * for the command that issued the count should be done before any other
723 * commands. 497 * commands.
724 */ 498 */
725 pl->count = 0; 499 pl->count = 0;
726} 500}
727 501
728
729/** 502/**
730 * This handles the general commands from the client (ie, north, fire, cast, 503 * This handles the general commands from the client (ie, north, fire, cast,
731 * etc.). It is a lot like PlayerCmd above, but is called with the 504 * etc.). It is a lot like PlayerCmd above, but is called with the
732 * 'ncom' method which gives more information back to the client so it 505 * 'ncom' method which gives more information back to the client so it
733 * can throttle. 506 * can throttle.
735void 508void
736NewPlayerCmd (char *buf, int len, player *pl) 509NewPlayerCmd (char *buf, int len, player *pl)
737{ 510{
738 if (len <= 6) 511 if (len <= 6)
739 { 512 {
740 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 513 LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
741 return; 514 return;
742 } 515 }
743 516
744 uint16 cmdid = net_uint16 ((uint8 *)buf); 517 uint16 cmdid = net_uint16 ((uint8 *)buf);
745 sint32 repeat = net_sint32 ((uint8 *)buf + 2); 518 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
802 { 575 {
803 case ST_PLAYING: 576 case ST_PLAYING:
804 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 577 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
805 break; 578 break;
806 579
807 case ST_CHANGE_CLASS:
808 key_change_class (pl->ob, buf[0]);
809 break;
810
811 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 580 case ST_GET_PARTY_PASSWORD: /* Get password for party */
812 receive_party_password (pl->ob, 13); 581 receive_party_password (pl->ob, 13);
813 break; 582 break;
814 583
815 default: 584 default:
854 623
855 cp = strchr (cp + 1, ' '); 624 cp = strchr (cp + 1, ' ');
856 625
857 if (cp) 626 if (cp)
858 { 627 {
859 assign (ns->version, cp + 1); 628 ns->version = cp + 1;
860 629
861 if (ns->sc_version < 1026) 630 if (ns->sc_version < 1026)
862 ns->send_packet_printf ("drawinfo %d %s", NDI_RED, 631 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
863 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 632 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
864 } 633 }
887 * syntax is: move (to) (tag) (nrof) 656 * syntax is: move (to) (tag) (nrof)
888 */ 657 */
889void 658void
890MoveCmd (char *buf, int len, player *pl) 659MoveCmd (char *buf, int len, player *pl)
891{ 660{
892 int vals[3], i; 661 int to, tag, nrof;
893 662
894 /* A little funky here. We only cycle for 2 records, because 663 if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
895 * we obviously are not going to find a space after the third
896 * record. Perhaps we should just replace this with a
897 * sscanf?
898 */
899 for (i = 0; i < 2; i++)
900 { 664 {
901 vals[i] = atoi (buf);
902
903 if (!(buf = strchr (buf, ' ')))
904 {
905 LOG (llevError, "Incomplete move command: %s\n", buf); 665 LOG (llevError, "Incomplete move command: %s\n", buf);
906 return; 666 return;
907 }
908
909 buf++;
910 } 667 }
911 668
912 vals[2] = atoi (buf); 669 esrv_move_object (pl->ob, to, tag, nrof);
913
914/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
915 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
916} 670}
917 671
918/****************************************************************************** 672/******************************************************************************
919 * 673 *
920 * Start of commands the server sends to the client. 674 * Start of commands the server sends to the client.
924/** 678/**
925 * Asks the client to query the user. This way, the client knows 679 * Asks the client to query the user. This way, the client knows
926 * it needs to send something back (vs just printing out a message) 680 * it needs to send something back (vs just printing out a message)
927 */ 681 */
928void 682void
929send_query (client *ns, uint8 flags, char *text) 683send_query (client *ns, uint8 flags, const char *text)
930{ 684{
931 ns->send_packet_printf ("query %d %s", flags, text ? text : ""); 685 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
686}
687
688/**
689 * Get player's current range attack in obuf.
690 */
691static void
692rangetostring (player *pl, char *obuf)
693{
694 dynbuf_text &buf = msg_dynbuf; buf.clear ();
695
696 if (pl->ranged_ob)
697 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
698
699 if (pl->combat_ob)
700 buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
701
702#if 0
703 //TODO: remove this when slot system is working, this is only for debugging
704 if (pl->ob->chosen_skill)
705 buf << " Skill*: " << pl->ob->chosen_skill->name;
706#endif
707
708 //TODO: maybe golem should become the current_weapon, quite simply?
709 if (pl->golem)
710 buf << " Golem*: " << pl->golem->name;
711
712 buf << '\0';
713 buf.linearise (obuf);
932} 714}
933 715
934#define AddIfInt64(Old,New,Type) if (Old != New) {\ 716#define AddIfInt64(Old,New,Type) if (Old != New) {\
935 Old = New; \ 717 Old = New; \
936 sl << uint8 (Type) << uint64 (New); \ 718 sl << uint8 (Type) << uint64 (New); \
944#define AddIfShort(Old,New,Type) if (Old != New) {\ 726#define AddIfShort(Old,New,Type) if (Old != New) {\
945 Old = New; \ 727 Old = New; \
946 sl << uint8 (Type) << uint16 (New); \ 728 sl << uint8 (Type) << uint16 (New); \
947 } 729 }
948 730
949#define AddIfFloat(Old,New,Type) if (Old != New) {\ 731#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
950 Old = New; \ 732 Old = New; \
951 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ 733 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
952 } 734 }
953 735
954#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ 736#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
955 free(Old); Old = strdup (New);\ 737 free(Old); Old = strdup (New);\
956 sl << uint8 (Type) << data8 (New); \ 738 sl << uint8 (Type) << data8 (New); \
970 752
971 client *ns = pl->ns; 753 client *ns = pl->ns;
972 if (!ns) 754 if (!ns)
973 return; 755 return;
974 756
975 object *ob = pl->ob; 757 object *ob = pl->observe;
976 if (!ob) 758 if (!ob)
977 return; 759 return;
760
761 player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
978 762
979 packet sl ("stats"); 763 packet sl ("stats");
980 764
981 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); 765 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
982 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); 766 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
991 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); 775 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
992 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); 776 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
993 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); 777 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
994 778
995 for (int s = 0; s < NUM_SKILLS; s++) 779 for (int s = 0; s < NUM_SKILLS; s++)
996 if (object *skill = pl->last_skill_ob[s]) 780 if (object *skill = opl->last_skill_ob [s])
997 if (skill->stats.exp != ns->last_skill_exp [s]) 781 if (skill->stats.exp != ns->last_skill_exp [s])
998 { 782 {
999 ns->last_skill_exp [s] = skill->stats.exp; 783 ns->last_skill_exp [s] = skill->stats.exp;
1000 784
1001 /* Always send along the level if exp changes. This is only 785 /* Always send along the level if exp changes. This is only
1009 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); 793 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1010 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); 794 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1011 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); 795 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1012 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); 796 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1013 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); 797 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1014 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); 798 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);
1015 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); 799 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1016 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 800 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
1017 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); 801 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
1018 802
1019 flags = 0; 803 flags = 0;
1020 804
1021 if (pl->fire_on) 805 if (opl->fire_on)
1022 flags |= SF_FIREON; 806 flags |= SF_FIREON;
1023 807
1024 if (pl->run_on) 808 if (opl->run_on)
1025 flags |= SF_RUNON; 809 flags |= SF_RUNON;
1026 810
1027 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); 811 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1028 812
1029 if (ns->sc_version < 1025) 813 if (ns->sc_version < 1025)
1043 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); 827 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1044 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); 828 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1045 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); 829 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1046 } 830 }
1047 831
1048 rangetostring (ob, buf); /* we want use the new fire & run system in new client */ 832 rangetostring (opl, buf); /* we want use the new fire & run system in new client */
1049 AddIfString (ns->stats.range, buf, CS_STAT_RANGE); 833 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1050 set_title (ob, buf); 834 set_title (ob, buf);
1051 AddIfString (ns->stats.title, buf, CS_STAT_TITLE); 835 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1052 836
1053 /* Only send it away if we have some actual data */ 837 /* Only send it away if we have some actual data */
1057 841
1058/** 842/**
1059 * Tells the client that here is a player it should start using. 843 * Tells the client that here is a player it should start using.
1060 */ 844 */
1061void 845void
1062esrv_new_player (player *pl, uint32 weight) 846esrv_new_player (player *pl)
1063{ 847{
848 sint32 weight = pl->ob->client_weight ();
849
1064 packet sl ("player"); 850 packet sl ("player");
1065 851
1066 sl << uint32 (pl->ob->count) 852 sl << uint32 (pl->ob->count)
1067 << uint32 (weight) 853 << uint32 (weight)
1068 << uint32 (pl->ob->face) 854 << uint32 (pl->ob->face)
1069 << data8 (pl->ob->name); 855 << data8 (pl->ob->name);
1070 856
1071 pl->ns->last_weight = weight; 857 pl->ns->last_weight = weight;
1072 pl->ns->send_packet (sl); 858 pl->ns->send_packet (sl);
1073 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1074} 859}
1075 860
1076/****************************************************************************** 861/******************************************************************************
1077 * 862 *
1078 * Start of map related commands. 863 * Start of map related commands.
1081 866
1082/** Clears a map cell */ 867/** Clears a map cell */
1083static void 868static void
1084map_clearcell (struct MapCell *cell, int count) 869map_clearcell (struct MapCell *cell, int count)
1085{ 870{
1086 cell->faces[0] = 0; 871 cell->faces[0] = 0;
1087 cell->faces[1] = 0; 872 cell->faces[1] = 0;
1088 cell->faces[2] = 0; 873 cell->faces[2] = 0;
874 cell->smooth[0] = 0;
875 cell->smooth[1] = 0;
876 cell->smooth[2] = 0;
1089 cell->count = count; 877 cell->count = count;
1090 cell->stat_hp = 0; 878 cell->stat_hp = 0;
1091 cell->flags = 0; 879 cell->flags = 0;
1092 cell->player = 0; 880 cell->player = 0;
1093} 881}
1094 882
1095#define MAX_LAYERS 3 883#define MAX_LAYERS 3
1096 884
1097/** 885/**
1100 * it was. 888 * it was.
1101 * sl is the socklist this data is going into. 889 * sl is the socklist this data is going into.
1102 * ns is the socket we are working on - all the info we care 890 * ns is the socket we are working on - all the info we care
1103 * about is in this socket structure, so now need not pass the 891 * about is in this socket structure, so now need not pass the
1104 * entire player object. 892 * entire player object.
1105 * mx and my are map coordinate offsets for map mp
1106 * sx and sy are the offsets into the socket structure that
1107 * holds the old values.
1108 * layer is the layer to update, with 2 being the floor and 0 the 893 * layer is the layer to update, with 2 being the floor and 0 the
1109 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) 894 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1110 * take. Interesting to note that before this function, the map1 function 895 * take. Interesting to note that before this function, the map1 function
1111 * numbers the spaces differently - I think this was a leftover from 896 * numbers the spaces differently - I think this was a leftover from
1112 * the map command, where the faces stack up. Sinces that is no longer 897 * the map command, where the faces stack up. Sinces that is no longer
1113 * the case, it seems to make more sense to have these layer values 898 * the case, it seems to make more sense to have these layer values
1114 * actually match. 899 * actually match.
1115 */ 900 */
1116static int 901static int
1117update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 902update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
1118{ 903{
1119 uint16 face_num; 904 object *ob = ms.faces_obj [layer];
1120 int bx, by, i;
1121
1122 object *ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1123 905
1124 /* If there is no object for this space, or if the face for the object 906 /* If there is no object for this space, or if the face for the object
1125 * is the blank face, set the face number to zero. 907 * is the blank face, set the face number to zero.
1126 * else if we have the stored head object for this space, that takes 908 * else if we have the stored head object for this space, that takes
1127 * precedence over the other object for this space. 909 * precedence over the other object for this space.
1128 * otherwise, we do special head processing 910 * otherwise, we do special head processing
1129 */ 911 */
1130 if (!ob || ob->face == blank_face) 912 uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
1131 face_num = 0;
1132 else
1133 /* In this case, we are already at the lower right or single part object,
1134 * so nothing special
1135 */
1136 face_num = ob->face;
1137 913
1138 /* We've gotten what face we want to use for the object. Now see if 914 /* We've gotten what face we want to use for the object. Now see if
1139 * if it has changed since we last sent it to the client. 915 * if it has changed since we last sent it to the client.
1140 */ 916 */
1141 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num) 917 if (lastcell.faces[layer] != face_num)
1142 { 918 {
1143 ns.lastmap.cells[sx][sy].faces[layer] = face_num; 919 lastcell.faces[layer] = face_num;
1144 920
1145 if (!ns.faces_sent[face_num]) 921 if (!ns.faces_sent[face_num])
1146 if (ob) 922 if (ob)
1147 ns.send_faces (ob); 923 ns.send_faces (ob);
1148 else 924 else
1149 ns.send_face (face_num); 925 ns.send_face (face_num, 10);
1150 926
1151 sl << uint16 (face_num); 927 sl << uint16 (face_num);
1152 return 1; 928 return 1;
1153 } 929 }
1154 930
1155 /* Nothing changed */ 931 /* Nothing changed */
1156 return 0; 932 return 0;
1157} 933}
1158 934
1159/** 935//-GPL
1160 * This function is mainly a copy of update_space,
1161 * except it handles update of the smoothing updates,
1162 * not the face updates.
1163 * Removes the need to replicate the same code for each layer.
1164 * this returns true if this smooth is now in fact different
1165 * than it was.
1166 * sl is the socklist this data is going into.
1167 * ns is the socket we are working on - all the info we care
1168 * about is in this socket structure, so know need to pass the
1169 * entire player object.
1170 * mx and my are map coordinate offsets for map mp
1171 * sx and sy are the offsets into the socket structure that
1172 * holds the old values.
1173 * layer is the layer to update, with 2 being the floor and 0 the
1174 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1175 * take.
1176 */
1177static inline int
1178update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1179{
1180 object *ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1181
1182 /* If there is no object for this space, or if the face for the object
1183 * is the blank face, set the smoothlevel to zero.
1184 */
1185 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1186
1187 /* We've gotten what face we want to use for the object. Now see if
1188 * if it has changed since we last sent it to the client.
1189 */
1190 if (smoothlevel > 255)
1191 smoothlevel = 255;
1192 else if (smoothlevel < 0)
1193 smoothlevel = 0;
1194
1195 if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1196 {
1197 ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1198 sl << uint8 (smoothlevel);
1199 return 1;
1200 }
1201
1202 /* Nothing changed */
1203 return 0;
1204}
1205
1206/**
1207 * Returns the size of a data for a map square as returned by
1208 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1209 * available.
1210 */
1211int
1212getExtendedMapInfoSize (client * ns)
1213{
1214 int result = 0;
1215
1216 if (ns->ext_mapinfos)
1217 {
1218 if (ns->EMI_smooth)
1219 result += 1; /*One byte for smoothlevel */
1220 }
1221
1222 return result;
1223}
1224 936
1225// prefetch (and touch) all maps within a specific distancd 937// prefetch (and touch) all maps within a specific distancd
1226static void 938static void
1227prefetch_surrounding_maps (maptile *map, int distance) 939prefetch_surrounding_maps (maptile *map, int distance)
1228{ 940{
1229 map->last_access = runtime; 941 map->touch ();
1230 942
1231 if (--distance) 943 if (--distance)
1232 for (int dir = 4; --dir; ) 944 for (int dir = 4; --dir; )
1233 if (const shstr &path = map->tile_path [dir]) 945 if (const shstr &path = map->tile_path [dir])
1234 if (maptile *&neigh = map->tile_map [dir]) 946 if (maptile *&neigh = map->tile_map [dir])
1242prefetch_surrounding_maps (object *op) 954prefetch_surrounding_maps (object *op)
1243{ 955{
1244 prefetch_surrounding_maps (op->map, 3); 956 prefetch_surrounding_maps (op->map, 3);
1245} 957}
1246 958
959//+GPL
960
1247/** 961/**
1248 * This function uses the new map1 protocol command to send the map 962 * Draws client map.
1249 * to the client. It is necessary because the old map command supports
1250 * a maximum map size of 15x15.
1251 * This function is much simpler than the old one. This is because
1252 * the old function optimized to send as few face identifiers as possible,
1253 * at the expense of sending more coordinate location (coordinates were
1254 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1255 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1256 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1257 * and use the other 4 bits for other informatiion. For full documentation
1258 * of what we send, see the doc/Protocol file.
1259 * I will describe internally what we do:
1260 * the ns->lastmap shows how the map last looked when sent to the client.
1261 * in the lastmap structure, there is a cells array, which is set to the
1262 * maximum viewable size (As set in config.h).
1263 * in the cells, there are faces and a count value.
1264 * we use the count value to hold the darkness value. If -1, then this space
1265 * is not viewable.
1266 * we use faces[0] faces[1] faces[2] to hold what the three layers
1267 * look like.
1268 */ 963 */
1269void 964void
1270draw_client_map1 (object *pl) 965draw_client_map (player *pl)
1271{ 966{
1272 int x, y, ax, ay, startlen, max_x, max_y, oldlen; 967 object *ob = pl->viewpoint;
1273 sint16 nx, ny;
1274 int estartlen, eoldlen;
1275 uint8 eentrysize;
1276 uint16 ewhatstart, ewhatflag;
1277 uint8 extendedinfos;
1278 maptile *m;
1279
1280 client &socket = *pl->contr->ns;
1281
1282 if (!pl->active) 968 if (!pl->observe->active)
1283 return; 969 return;
1284
1285 check_map_change (pl->contr);
1286 prefetch_surrounding_maps (pl);
1287
1288 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1289 packet esl;
1290
1291 startlen = sl.length ();
1292
1293 /*Extendedmapinfo structure initialisation */
1294 if (socket.ext_mapinfos)
1295 {
1296 extendedinfos = EMI_NOREDRAW;
1297
1298 if (socket.EMI_smooth)
1299 extendedinfos |= EMI_SMOOTH;
1300
1301 ewhatstart = esl.length ();
1302 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1303 could need to be taken away */
1304 eentrysize = getExtendedMapInfoSize (&socket);
1305 esl << "mapextended "
1306 << uint8 (extendedinfos)
1307 << uint8 (eentrysize);
1308
1309 estartlen = esl.length ();
1310 }
1311 else
1312 {
1313 /* suppress compiler warnings */
1314 ewhatstart = 0;
1315 ewhatflag = 0;
1316 estartlen = 0;
1317 }
1318
1319 /* x,y are the real map locations. ax, ay are viewport relative
1320 * locations.
1321 */
1322 ay = 0;
1323
1324 /* We could do this logic as conditionals in the if statement,
1325 * but that started to get a bit messy to look at.
1326 */
1327 max_x = pl->x + (socket.mapx + 1) / 2;
1328 max_y = pl->y + (socket.mapy + 1) / 2;
1329
1330 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1331 {
1332 ax = 0;
1333 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1334 {
1335 int emask, mask;
1336 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1337
1338 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1339
1340 /* If the coordinates are not valid, or it is too dark to see,
1341 * we tell the client as such
1342 */
1343 nx = x;
1344 ny = y;
1345 m = get_map_from_coord (pl->map, &nx, &ny);
1346
1347 if (!m)
1348 {
1349 /* space is out of map. Update space and clear values
1350 * if this hasn't already been done. If the space is out
1351 * of the map, it shouldn't have a head
1352 */
1353 if (lastcell.count != -1)
1354 {
1355 sl << uint16 (mask);
1356 map_clearcell (&lastcell, -1);
1357 }
1358
1359 continue;
1360 }
1361
1362 m->touch ();
1363
1364 int d = pl->contr->blocked_los[ax][ay];
1365
1366 if (d > 3)
1367 {
1368
1369 int need_send = 0, count;
1370
1371 /* This block deals with spaces that are not visible for whatever
1372 * reason. Still may need to send the head for this space.
1373 */
1374
1375 oldlen = sl.length ();
1376
1377 sl << uint16 (mask);
1378
1379 if (lastcell.count != -1)
1380 need_send = 1;
1381
1382 count = -1;
1383
1384 /* properly clear a previously sent big face */
1385 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1386 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1387 need_send = 1;
1388
1389 map_clearcell (&lastcell, count);
1390
1391 if ((mask & 0xf) || need_send)
1392 sl[oldlen + 1] = mask & 0xff;
1393 else
1394 sl.reset (oldlen);
1395 }
1396 else
1397 {
1398 /* In this block, the space is visible.
1399 */
1400
1401 /* Rather than try to figure out what everything that we might
1402 * need to send is, then form the packet after that,
1403 * we presume that we will in fact form a packet, and update
1404 * the bits by what we do actually send. If we send nothing,
1405 * we just back out sl.length () to the old value, and no harm
1406 * is done.
1407 * I think this is simpler than doing a bunch of checks to see
1408 * what if anything we need to send, setting the bits, then
1409 * doing those checks again to add the real data.
1410 */
1411 oldlen = sl.length ();
1412 eoldlen = esl.length ();
1413
1414 sl << uint16 (mask);
1415
1416 if (socket.ext_mapinfos)
1417 esl << uint16 (emask);
1418
1419 unsigned char dummy;
1420 unsigned char *last_ext = &dummy;
1421
1422 /* Darkness changed */
1423 if (lastcell.count != d && socket.darkness)
1424 {
1425 mask |= 0x8;
1426
1427 if (socket.extmap)
1428 {
1429 *last_ext |= 0x80;
1430 last_ext = &sl[sl.length ()];
1431 sl << uint8 (d);
1432 }
1433 else
1434 sl << uint8 (255 - 64 * d);
1435 }
1436
1437 lastcell.count = d;
1438
1439 if (socket.extmap)
1440 {
1441 uint8 stat_hp = 0;
1442 uint8 stat_width = 0;
1443 uint8 flags = 0;
1444 UUID player = 0;
1445
1446 // send hp information, if applicable
1447 if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0))
1448 {
1449 if (op->head || op->invisible)
1450 ; // do not show
1451 else if (op->type == PLAYER
1452 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1453 {
1454 if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1455 {
1456 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1457 stat_width = op->arch->tail_x;
1458 }
1459 }
1460
1461 if (op->msg && op->msg[0] == '@')
1462 flags |= 1;
1463
1464 if (op->type == PLAYER && op != pl)
1465 player = op->count;
1466 }
1467
1468 if (lastcell.stat_hp != stat_hp)
1469 {
1470 lastcell.stat_hp = stat_hp;
1471
1472 mask |= 0x8;
1473 *last_ext |= 0x80;
1474 last_ext = &sl[sl.length ()];
1475
1476 sl << uint8 (5) << uint8 (stat_hp);
1477
1478 if (stat_width > 1)
1479 {
1480 *last_ext |= 0x80;
1481 last_ext = &sl[sl.length ()];
1482
1483 sl << uint8 (6) << uint8 (stat_width);
1484 }
1485 }
1486
1487 if (lastcell.player != player)
1488 {
1489 lastcell.player = player;
1490
1491 mask |= 0x8;
1492 *last_ext |= 0x80;
1493 last_ext = &sl[sl.length ()];
1494
1495 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
1496 }
1497
1498 if (lastcell.flags != flags)
1499 {
1500 lastcell.flags = flags;
1501
1502 mask |= 0x8;
1503 *last_ext |= 0x80;
1504 last_ext = &sl[sl.length ()];
1505
1506 sl << uint8 (8) << uint8 (flags);
1507 }
1508 }
1509
1510 /* Floor face */
1511 if (update_space (sl, socket, m, nx, ny, ax, ay, 2))
1512 mask |= 0x4;
1513
1514 if (socket.EMI_smooth)
1515 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
1516 emask |= 0x4;
1517
1518 /* Middle face */
1519 if (update_space (sl, socket, m, nx, ny, ax, ay, 1))
1520 mask |= 0x2;
1521
1522 if (socket.EMI_smooth)
1523 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))
1524 emask |= 0x2;
1525
1526 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
1527 {
1528 if (lastcell.faces[0] != pl->face)
1529 {
1530 lastcell.faces[0] = pl->face;
1531 mask |= 0x1;
1532
1533 socket.send_faces (pl);
1534
1535 sl << uint16 (pl->face);
1536 }
1537 }
1538 else
1539 {
1540 /* Top face */
1541 if (update_space (sl, socket, m, nx, ny, ax, ay, 0))
1542 mask |= 0x1;
1543
1544 if (socket.EMI_smooth)
1545 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
1546 emask |= 0x1;
1547 }
1548
1549 /* Check to see if we are in fact sending anything for this
1550 * space by checking the mask. If so, update the mask.
1551 * if not, reset the len to that from before adding the mask
1552 * value, so we don't send those bits.
1553 */
1554 if (mask & 0xf)
1555 sl[oldlen + 1] = mask & 0xff;
1556 else
1557 sl.reset (oldlen);
1558
1559 if (emask & 0xf)
1560 esl[eoldlen + 1] = emask & 0xff;
1561 else
1562 esl.reset (eoldlen);
1563 } /* else this is a viewable space */
1564 } /* for x loop */
1565 } /* for y loop */
1566
1567 /* Verify that we in fact do need to send this */
1568 if (socket.ext_mapinfos)
1569 {
1570 if (!(sl.length () > startlen || socket.sent_scroll))
1571 {
1572 /* No map data will follow, so don't say the client
1573 * it doesn't need draw!
1574 */
1575 ewhatflag &= ~EMI_NOREDRAW;
1576 esl[ewhatstart + 1] = ewhatflag & 0xff;
1577 }
1578
1579 if (esl.length () > estartlen)
1580 socket.send_packet (esl);
1581 }
1582
1583 if (sl.length () > startlen || socket.sent_scroll)
1584 {
1585 socket.send_packet (sl);
1586 socket.sent_scroll = 0;
1587 }
1588}
1589
1590/**
1591 * Draws client map.
1592 */
1593void
1594draw_client_map (object *pl)
1595{
1596 int i, j;
1597 sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1598 int mflags;
1599 struct Map newmap;
1600 maptile *m, *pm;
1601
1602 if (pl->type != PLAYER)
1603 {
1604 LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1605 return;
1606 }
1607
1608 pm = pl->map;
1609 970
1610 /* If player is just joining the game, he isn't here yet, so the map 971 /* If player is just joining the game, he isn't here yet, so the map
1611 * can get swapped out. If so, don't try to send them a map. All will 972 * can get swapped out. If so, don't try to send them a map. All will
1612 * be OK once they really log in. 973 * be OK once they really log in.
1613 */ 974 */
1614 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 975 if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1615 return; 976 return;
1616 977
1617 memset (&newmap, 0, sizeof (struct Map)); 978 int startlen, oldlen;
1618 979
1619 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) 980 check_map_change (pl);
1620 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) 981 prefetch_surrounding_maps (pl->ob);
982
983 /* do LOS after calls to update_position */
984 /* unfortunately, we need to udpate los when observing, currently */
985 if (pl->do_los || pl->viewpoint != pl->ob)
986 {
987 pl->do_los = 0;
988 pl->update_los ();
989 }
990
991 /**
992 * This function uses the new map1 protocol command to send the map
993 * to the client. It is necessary because the old map command supports
994 * a maximum map size of 15x15.
995 * This function is much simpler than the old one. This is because
996 * the old function optimized to send as few face identifiers as possible,
997 * at the expense of sending more coordinate location (coordinates were
998 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
999 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1000 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1001 * and use the other 4 bits for other informatiion. For full documentation
1002 * of what we send, see the doc/Protocol file.
1003 * I will describe internally what we do:
1004 * the ns->lastmap shows how the map last looked when sent to the client.
1005 * in the lastmap structure, there is a cells array, which is set to the
1006 * maximum viewable size (As set in config.h).
1007 * in the cells, there are faces and a count value.
1008 * we use the count value to hold the darkness value. If -1, then this space
1009 * is not viewable.
1010 * we use faces[0] faces[1] faces[2] to hold what the three layers
1011 * look like.
1012 */
1013
1014 client &socket = *pl->ns;
1015
1016 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1017
1018 startlen = sl.length ();
1019
1020 int hx = socket.mapx / 2;
1021 int hy = socket.mapy / 2;
1022
1023 ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
1024 int ax = dx + hx;
1025 int ay = dy + hy;
1026
1027 int mask = (ax << 10) | (ay << 4);
1028 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1029
1030 /* If the coordinates are not valid, or it is too dark to see,
1031 * we tell the client as such
1032 */
1033 if (!m)
1621 { 1034 {
1622 ax = i; 1035 /* space is out of map. Update space and clear values
1623 ay = j; 1036 * if this hasn't already been done. If the space is out
1624 m = pm; 1037 * of the map, it shouldn't have a head.
1625 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1626
1627 if (mflags & P_OUT_OF_MAP)
1628 continue;
1629
1630 /* If a map is visible to the player, we don't want to swap it out
1631 * just to reload it. This should really call something like
1632 * swap_map, but this is much more efficient and 'good enough'
1633 */ 1038 */
1634 if (mflags & P_NEW_MAP) 1039 if (lastcell.count != -1)
1635 m->timeout = 50; 1040 {
1041 sl << uint16 (mask);
1042 map_clearcell (&lastcell, -1);
1043 }
1044
1045 continue;
1636 } 1046 }
1047
1048 int d = pl->blocked_los_uc (dx, dy);
1637 1049
1638 /* do LOS after calls to update_position */ 1050 if (d > 3)
1639 if (pl->contr->do_los)
1640 { 1051 {
1641 update_los (pl); 1052 /* This block deals with spaces that are not visible for whatever
1642 pl->contr->do_los = 0; 1053 * reason. Still may need to send the head for this space.
1054 */
1055 if (lastcell.count != -1
1056 || lastcell.faces[0]
1057 || lastcell.faces[1]
1058 || lastcell.faces[2]
1059 || lastcell.stat_hp
1060 || lastcell.flags
1061 || lastcell.player)
1062 sl << uint16 (mask);
1063
1064 /* properly clear a previously sent big face */
1065 map_clearcell (&lastcell, -1);
1643 } 1066 }
1067 else
1068 {
1069 /* In this block, the space is visible.
1070 */
1644 1071
1645 /* Big maps need a different drawing mechanism to work */ 1072 /* Rather than try to figure out what everything that we might
1646 draw_client_map1 (pl); 1073 * need to send is, then form the packet after that,
1647} 1074 * we presume that we will in fact form a packet, and update
1075 * the bits by what we do actually send. If we send nothing,
1076 * we just back out sl.length () to the old value, and no harm
1077 * is done.
1078 * I think this is simpler than doing a bunch of checks to see
1079 * what if anything we need to send, setting the bits, then
1080 * doing those checks again to add the real data.
1081 */
1082 oldlen = sl.length ();
1648 1083
1084 sl << uint16 (mask);
1085
1086 unsigned char dummy;
1087 unsigned char *last_ext = &dummy;
1088
1089 /* Darkness changed */
1090 if (lastcell.count != d)
1091 {
1092 mask |= 0x8;
1093
1094 *last_ext |= 0x80;
1095 last_ext = &sl[sl.length ()];
1096 sl << uint8 (d);
1097 }
1098
1099 lastcell.count = d;
1100
1101 mapspace &ms = m->at (nx, ny);
1102 ms.update ();
1103
1104 // extmap handling
1105 uint8 stat_hp = 0;
1106 uint8 stat_width = 0;
1107 uint8 flags = 0;
1108 tag_t player = 0;
1109
1110 // send hp information, if applicable
1111 if (object *op = ms.faces_obj [0])
1112 if (op->is_head () && !op->invisible)
1113 {
1114 if (op->stats.maxhp > op->stats.hp
1115 && op->stats.maxhp > 0
1116 && (op->type == PLAYER
1117 || op->type == DOOR // does not work, have maxhp 0
1118 || QUERY_FLAG (op, FLAG_MONSTER)
1119 || QUERY_FLAG (op, FLAG_ALIVE)
1120 || QUERY_FLAG (op, FLAG_GENERATOR)))
1121 {
1122 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1123 stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1124 }
1125
1126 if (expect_false (op->has_dialogue ()))
1127 flags |= 1;
1128
1129 if (expect_false (op->type == PLAYER))
1130 player = op == ob ? pl->ob->count
1131 : op == pl->ob ? ob->count
1132 : op->count;
1133 }
1134
1135 if (expect_false (lastcell.stat_hp != stat_hp))
1136 {
1137 lastcell.stat_hp = stat_hp;
1138
1139 mask |= 0x8;
1140 *last_ext |= 0x80;
1141 last_ext = &sl[sl.length ()];
1142
1143 sl << uint8 (5) << uint8 (stat_hp);
1144
1145 if (stat_width > 1)
1146 {
1147 *last_ext |= 0x80;
1148 last_ext = &sl[sl.length ()];
1149
1150 sl << uint8 (6) << uint8 (stat_width);
1151 }
1152 }
1153
1154 if (expect_false (lastcell.player != player))
1155 {
1156 lastcell.player = player;
1157
1158 mask |= 0x8;
1159 *last_ext |= 0x80;
1160 last_ext = &sl[sl.length ()];
1161
1162 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1163 }
1164
1165 if (expect_false (lastcell.flags != flags))
1166 {
1167 lastcell.flags = flags;
1168
1169 mask |= 0x8;
1170 *last_ext |= 0x80;
1171 last_ext = &sl[sl.length ()];
1172
1173 sl << uint8 (8) << uint8 (flags);
1174 }
1175
1176 // faces
1177
1178 /* Floor face */
1179 if (update_space (sl, socket, ms, lastcell, 2))
1180 mask |= 0x4;
1181
1182 /* Middle face */
1183 if (update_space (sl, socket, ms, lastcell, 1))
1184 mask |= 0x2;
1185
1186 if (expect_false (ob->invisible)
1187 && ob->invisible & (ob->invisible < 50 ? 1 : 7)
1188 && ms.player () == ob)
1189 {
1190 // force player to be visible to himself if invisible
1191 if (lastcell.faces[0] != ob->face)
1192 {
1193 lastcell.faces[0] = ob->face;
1194
1195 mask |= 0x1;
1196 sl << uint16 (ob->face);
1197
1198 socket.send_faces (ob);
1199 }
1200 }
1201 /* Top face */
1202 else if (update_space (sl, socket, ms, lastcell, 0))
1203 mask |= 0x1;
1204
1205 /* Check to see if we are in fact sending anything for this
1206 * space by checking the mask. If so, update the mask.
1207 * if not, reset the len to that from before adding the mask
1208 * value, so we don't send those bits.
1209 */
1210 if (mask & 0xf)
1211 sl[oldlen + 1] = mask & 0xff;
1212 else
1213 sl.reset (oldlen);
1214 } /* else this is a viewable space */
1215 ordered_mapwalk_end
1216
1217 socket.flush_fx ();
1218
1219 if (sl.length () > startlen || socket.sent_scroll)
1220 {
1221 socket.send_packet (sl);
1222 socket.sent_scroll = 0;
1223 }
1224}
1649 1225
1650/*****************************************************************************/ 1226/*****************************************************************************/
1651
1652/* GROS: The following one is used to allow a plugin to send a generic cmd to*/ 1227/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1653
1654/* a player. Of course, the client need to know the command to be able to */ 1228/* a player. Of course, the client need to know the command to be able to */
1655
1656/* manage it ! */ 1229/* manage it ! */
1657
1658/*****************************************************************************/ 1230/*****************************************************************************/
1659void 1231void
1660send_plugin_custom_message (object *pl, char *buf) 1232send_plugin_custom_message (object *pl, char *buf)
1661{ 1233{
1662 pl->contr->ns->send_packet (buf); 1234 pl->contr->ns->send_packet (buf);
1671{ 1243{
1672 packet sl; 1244 packet sl;
1673 sl << "replyinfo skill_info\n"; 1245 sl << "replyinfo skill_info\n";
1674 1246
1675 for (int i = 1; i < NUM_SKILLS; i++) 1247 for (int i = 1; i < NUM_SKILLS; i++)
1676 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); 1248 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1677 1249
1678 if (sl.length () >= MAXSOCKBUF) 1250 if (sl.length () > MAXSOCKBUF)
1679 { 1251 {
1680 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 1252 LOG (llevError, "Buffer overflow in send_skill_info!\n");
1681 fatal (0); 1253 fatal (0);
1682 } 1254 }
1683 1255
1696 sl << "replyinfo spell_paths\n"; 1268 sl << "replyinfo spell_paths\n";
1697 1269
1698 for (int i = 0; i < NRSPELLPATHS; i++) 1270 for (int i = 0; i < NRSPELLPATHS; i++)
1699 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); 1271 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1700 1272
1701 if (sl.length () >= MAXSOCKBUF) 1273 if (sl.length () > MAXSOCKBUF)
1702 { 1274 {
1703 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 1275 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1704 fatal (0); 1276 fatal (0);
1705 } 1277 }
1706 1278
1725 if (spell->type == SPELL) 1297 if (spell->type == SPELL)
1726 { 1298 {
1727 int flags = 0; 1299 int flags = 0;
1728 1300
1729 /* check if we need to update it */ 1301 /* check if we need to update it */
1730 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) 1302 if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
1731 { 1303 {
1732 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1304 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1733 flags |= UPD_SP_MANA; 1305 flags |= UPD_SP_MANA;
1734 } 1306 }
1735 1307
1736 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) 1308 if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
1737 { 1309 {
1738 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1310 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1739 flags |= UPD_SP_GRACE; 1311 flags |= UPD_SP_GRACE;
1740 } 1312 }
1741 1313
1742 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) 1314 if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
1743 { 1315 {
1744 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1316 spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1745 flags |= UPD_SP_DAMAGE; 1317 flags |= UPD_SP_DAMAGE;
1746 } 1318 }
1747 1319
1748 if (flags) 1320 if (flags)
1749 { 1321 {
1751 1323
1752 sl << "updspell " 1324 sl << "updspell "
1753 << uint8 (flags) 1325 << uint8 (flags)
1754 << uint32 (spell->count); 1326 << uint32 (spell->count);
1755 1327
1756 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 1328 if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1757 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 1329 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);
1758 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 1330 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);
1759 1331
1760 pl->ns->send_packet (sl); 1332 pl->ns->send_packet (sl);
1761 } 1333 }
1762 } 1334 }
1763 } 1335 }
1793 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1365 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1794 return; 1366 return;
1795 } 1367 }
1796 1368
1797 /* store costs and damage in the object struct, to compare to later */ 1369 /* store costs and damage in the object struct, to compare to later */
1798 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1370 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1799 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1371 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1800 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1372 spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1801 1373
1802 /* figure out which skill it uses, if it uses one */ 1374 /* figure out which skill it uses, if it uses one */
1803 if (spell->skill) 1375 if (spell->skill)
1804 { 1376 if (object *tmp = pl->find_skill (spell->skill))
1805 for (i = 1; i < NUM_SKILLS; i++)
1806 if (!strcmp (spell->skill, skill_names[i]))
1807 {
1808 skill = i + CS_STAT_SKILLINFO; 1377 skill = tmp->subtype + CS_STAT_SKILLINFO;
1809 break;
1810 }
1811 }
1812 1378
1813 // spells better have a face 1379 // spells better have a face
1814 if (!spell->face) 1380 if (!spell->face)
1815 { 1381 {
1816 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); 1382 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1817 spell->face = face_find ("burnout.x11", blank_face); 1383 spell->face = face_find ("burnout.x11", blank_face);
1818 } 1384 }
1385
1386 pl->ns->send_face (spell->face);
1819 1387
1820 /* send the current values */ 1388 /* send the current values */
1821 sl << uint32 (spell->count) 1389 sl << uint32 (spell->count)
1822 << uint16 (spell->level) 1390 << uint16 (spell->level)
1823 << uint16 (spell->casting_time) 1391 << uint16 (spell->casting_time)
1824 << uint16 (spell->last_sp) 1392 << uint16 (spell->cached_sp)
1825 << uint16 (spell->last_grace) 1393 << uint16 (spell->cached_grace)
1826 << uint16 (spell->last_eat) 1394 << uint16 (spell->cached_eat)
1827 << uint8 (skill) 1395 << uint8 (skill)
1828 << uint32 (spell->path_attuned) 1396 << uint32 (spell->path_attuned)
1829 << uint32 (spell->face) 1397 << uint32 (spell->face)
1830 << data8 (spell->name) 1398 << data8 (spell->name)
1831 << data16 (spell->msg); 1399 << data16 (spell->msg);
1859 * bytes and 3 strings (because that is the spec) so we need to 1427 * bytes and 3 strings (because that is the spec) so we need to
1860 * check that the length of those 3 strings, plus the 23 bytes, 1428 * check that the length of those 3 strings, plus the 23 bytes,
1861 * won't take us over the length limit for the socket, if it does, 1429 * won't take us over the length limit for the socket, if it does,
1862 * we need to send what we already have, and restart packet formation 1430 * we need to send what we already have, and restart packet formation
1863 */ 1431 */
1432 if (spell->type != SPELL)
1433 continue;
1434
1864 /* Seeing crashes by overflowed buffers. Quick arithemetic seems 1435 /* Seeing crashes by overflowed buffers. Quick arithemetic seems
1865 * to show add_spell is 26 bytes + 2 strings. However, the overun 1436 * to show add_spell is 26 bytes + 2 strings. However, the overun
1866 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem 1437 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1867 * like it will fix this 1438 * like it will fix this
1868 */ 1439 */
1869 if (spell->type != SPELL)
1870 continue;
1871
1872 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 1440 if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1873 { 1441 {
1442 pl->ns->flush_fx ();
1874 pl->ns->send_packet (sl); 1443 pl->ns->send_packet (sl);
1875 1444
1876 sl.reset (); 1445 sl.reset ();
1877 sl << "addspell "; 1446 sl << "addspell ";
1878 } 1447 }
1886 return; 1455 return;
1887 } 1456 }
1888 else 1457 else
1889 append_spell (pl, sl, spell); 1458 append_spell (pl, sl, spell);
1890 1459
1891 if (sl.length () >= MAXSOCKBUF) 1460 if (sl.length () > MAXSOCKBUF)
1892 { 1461 {
1893 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 1462 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1894 fatal (0); 1463 fatal (0);
1895 } 1464 }
1896 1465
1897 /* finally, we can send the packet */ 1466 /* finally, we can send the packet */
1467 pl->ns->flush_fx ();
1898 pl->ns->send_packet (sl); 1468 pl->ns->send_packet (sl);
1899} 1469}
1900 1470
1471//-GPL
1472

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines