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

Diff Legend

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