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.87 by root, Thu Apr 19 11:12:46 2007 UTC vs.
Revision 1.143 by root, Tue Dec 23 06:58:24 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.
… …
99 */ 98 */
100 mx = ns->mapx; 99 mx = ns->mapx;
101 my = ns->mapy; 100 my = ns->mapy;
102 101
103 /* 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
104 * (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,
105 * if the destination x or y coordinate is outside the viewable 104 * if the destination x or y coordinate is outside the viewable
106 * area, we clear the values - otherwise, the old values 105 * area, we clear the values - otherwise, the old values
107 * 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.
108 */ 107 */
109 for (x = 0; x < mx; x++) 108 for (x = 0; x < mx; x++)
110 {
111 for (y = 0; y < my; y++) 109 for (y = 0; y < my; y++)
112 {
113 if (x >= ns->mapx || y >= ns->mapy) 110 if (x >= ns->mapx || y >= ns->mapy)
114 /* clear cells outside the viewable area */ 111 /* clear cells outside the viewable area */
115 memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); 112 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) 113 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 */ 114 /* clear newly visible tiles within the viewable area */
118 memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); 115 memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
119 else 116 else
120 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); 117 memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
121 }
122 }
123 118
124 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); 119 memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
125 120
126 /* Make sure that the next "map1" command will be sent (even if it is 121 /* Make sure that the next "map1" command will be sent (even if it is
127 * empty). 122 * empty).
… …
130} 125}
131 126
132static void 127static void
133clear_map (player *pl) 128clear_map (player *pl)
134{ 129{
130 pl->ns->mapinfo_queue_clear ();
131
135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); 132 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
136 133
137 pl->ns->force_newmap = false; 134 pl->ns->force_newmap = false;
138 135
139 if (pl->ns->newmapcmd == 1) 136 if (pl->ns->newmapcmd == 1)
140 pl->ns->send_packet ("newmap"); 137 pl->ns->send_packet ("newmap");
141 138
142 pl->ns->floorbox_reset (); 139 pl->ns->floorbox_reset ();
140}
141
142static void
143send_map_info (player *pl)
144{
145 client &socket = *pl->ns;
146 object *ob = pl->observe;
147
148 if (socket.mapinfocmd)
149 {
150 if (ob->map && ob->map->path[0])
151 {
152 int flags = 0;
153
154 if (ob->map->tile_path[0]) flags |= 1;
155 if (ob->map->tile_path[1]) flags |= 2;
156 if (ob->map->tile_path[2]) flags |= 4;
157 if (ob->map->tile_path[3]) flags |= 8;
158
159 socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
160 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
161 ob->map->width, ob->map->height, &ob->map->path);
162 }
163 else
164 socket.send_packet ("mapinfo current");
165 }
143} 166}
144 167
145/** check for map/region change and send new map data */ 168/** check for map/region change and send new map data */
146static void 169static void
147check_map_change (player *pl) 170check_map_change (player *pl)
148{ 171{
149 client &socket = *pl->ns; 172 client &socket = *pl->ns;
150 object *ob = pl->ob; 173 object *ob = pl->observe;
151 char buf[MAX_BUF]; /* eauugggh */ 174
175 region *reg = ob->region ();
176 if (socket.current_region != reg)
177 {
178 INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
179 socket.current_region = reg;
180 }
181
182 // first try to aovid a full newmap on tiled map scrolls
183 if (socket.current_map != ob->map && !socket.force_newmap)
184 {
185 rv_vector rv;
186
187 get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
188
189 // manhattan distance is very handy here
190 if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
191 {
192 socket.current_map = ob->map;
193 socket.current_x = ob->x;
194 socket.current_y = ob->y;
195
196 socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
197 socket.floorbox_reset ();
198 send_map_info (pl);
199 }
200 }
152 201
153 if (socket.current_map != ob->map || socket.force_newmap) 202 if (socket.current_map != ob->map || socket.force_newmap)
154 { 203 {
155 clear_map (pl); 204 clear_map (pl);
156 socket.current_map = ob->map; 205 socket.current_map = ob->map;
157 206 send_map_info (pl);
158 if (socket.mapinfocmd)
159 {
160 if (ob->map && ob->map->path[0])
161 {
162 int flags = 0;
163
164 if (ob->map->tile_path[0])
165 flags |= 1;
166 if (ob->map->tile_path[1])
167 flags |= 2;
168 if (ob->map->tile_path[2])
169 flags |= 4;
170 if (ob->map->tile_path[3])
171 flags |= 8;
172
173 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
174 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
175 }
176 else
177 snprintf (buf, MAX_BUF, "mapinfo current");
178
179 socket.send_packet (buf);
180 }
181 } 207 }
182 else if (socket.current_x != ob->x || socket.current_y != ob->y) 208 else if (socket.current_x != ob->x || socket.current_y != ob->y)
183 { 209 {
184 int dx = ob->x - socket.current_x; 210 int dx = ob->x - socket.current_x;
185 int dy = ob->y - socket.current_y; 211 int dy = ob->y - socket.current_y;
… …
193 } 219 }
194 } 220 }
195 221
196 socket.current_x = ob->x; 222 socket.current_x = ob->x;
197 socket.current_y = ob->y; 223 socket.current_y = ob->y;
198
199 region *reg = ob->region ();
200 if (socket.current_region != reg)
201 {
202 socket.current_region = reg;
203 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
204 }
205} 224}
206 225
207/** 226/**
208 * RequestInfo is sort of a meta command. There is some specific 227 * RequestInfo is sort of a meta command. There is some specific
209 * request of information, but we call other functions to provide 228 * request of information, but we call other functions to provide
210 * that information. 229 * that information.
211 */ 230 */
212void 231void
213RequestInfo (char *buf, int len, client * ns) 232RequestInfo (char *buf, int len, client *ns)
214{ 233{
215 char *params = NULL, *cp; 234 char *params;
216
217 /* No match */
218 char bigbuf[MAX_BUF];
219 int slen;
220
221 /* Set up replyinfo before we modify any of the buffers - this is used
222 * if we don't find a match.
223 */
224 strcpy (bigbuf, "replyinfo ");
225 slen = strlen (bigbuf);
226 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
227 235
228 /* find the first space, make it null, and update the 236 /* find the first space, make it null, and update the
229 * params pointer. 237 * params pointer.
230 */ 238 */
231 for (cp = buf; *cp != '\0'; cp++) 239 for (params = buf; *params; params++)
232 if (*cp == ' ') 240 if (*params == ' ')
233 { 241 {
234 *cp = '\0';
235 params = cp + 1; 242 *params++ = 0;
236 break; 243 break;
237 } 244 }
238 245
239 if (!strcmp (buf, "image_info")) 246 if (!strcmp (buf, "image_info"))
240 send_image_info (ns, params); 247 send_image_info (ns, params);
… …
243 else if (!strcmp (buf, "skill_info")) 250 else if (!strcmp (buf, "skill_info"))
244 send_skill_info (ns, params); 251 send_skill_info (ns, params);
245 else if (!strcmp (buf, "spell_paths")) 252 else if (!strcmp (buf, "spell_paths"))
246 send_spell_paths (ns, params); 253 send_spell_paths (ns, params);
247 else 254 else
248 ns->send_packet (bigbuf, len); 255 {
256 // undo tokenisation above and send replyinfo with the request unchanged
257 if (*params)
258 *--params = ' ';
259
260 ns->send_packet_printf ("replyinfo %s", buf);
261 }
249} 262}
250 263
251void 264void
252ExtCmd (char *buf, int len, player *pl) 265ExtCmd (char *buf, int len, player *pl)
253{ 266{
… …
256 269
257void 270void
258ExtiCmd (char *buf, int len, client *ns) 271ExtiCmd (char *buf, int len, client *ns)
259{ 272{
260 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); 273 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
274}
275
276void
277client::mapinfo_queue_clear ()
278{
279 for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
280 free (*i);
281
282 mapinfo_queue.clear ();
283}
284
285bool
286client::mapinfo_try (char *buf)
287{
288 char *token = buf;
289 buf += strlen (buf) + 9;
290
291 // initial map and its origin
292 maptile *map = pl->observe->map;
293 int mapx = pl->ns->mapx / 2 - pl->observe->x;
294 int mapy = pl->ns->mapy / 2 - pl->observe->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++ - '1';
300
301 if (dir >= 0 && dir <= 3)
302 {
303 if (!map->tile_path [dir])
304 map = 0;
305 else if (map->tile_available (dir, false))
306 {
307 maptile *neigh = map->tile_map [dir];
308
309 switch (dir)
310 {
311 case 0: mapy -= neigh->height; break;
312 case 2: mapy += map ->height; break;
313 case 3: mapx -= neigh->width ; break;
314 case 1: mapx += map ->width ; break;
315 }
316
317 map = neigh;
318 --max_distance;
319 }
320 else
321 return 0;
322 }
323 else
324 max_distance = 0;
325 }
326
327 if (!max_distance)
328 send_packet_printf ("mapinfo %s error", token);
329 else if (!map || !map->path)
330 send_packet_printf ("mapinfo %s nomap", token);
331 else
332 {
333 int flags = 0;
334
335 if (map->tile_path[0]) flags |= 1;
336 if (map->tile_path[1]) flags |= 2;
337 if (map->tile_path[2]) flags |= 4;
338 if (map->tile_path[3]) flags |= 8;
339
340 send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
341 }
342
343 return 1;
344}
345
346void
347client::mapinfo_queue_run ()
348{
349 if (mapinfo_queue.empty () || !pl)
350 return;
351
352 for (int i = 0; i < mapinfo_queue.size (); ++i)
353 if (mapinfo_try (mapinfo_queue [i]))
354 {
355 free (mapinfo_queue [i]);
356 mapinfo_queue.erase (i);
357 }
358 else
359 ++i;
261} 360}
262 361
263void 362void
264MapInfoCmd (char *buf, int len, player *pl) 363MapInfoCmd (char *buf, int len, player *pl)
265{ 364{
266 // <mapinfo tag spatial tile-path 365 // <mapinfo tag spatial tile-path
267 // >mapinfo tag spatial flags x y w h hash 366 // >mapinfo tag spatial flags x y w h hash
268 367
269 char bigbuf[MAX_BUF], *token;
270
271 token = buf; 368 char *token = buf;
272 // copy token 369
273 if (!(buf = strchr (buf, ' '))) 370 if (!(buf = strchr (buf, ' ')))
274 return; 371 return;
275 372
276 *buf++ = 0;
277
278 if (!strncmp (buf, "spatial ", 8)) 373 if (!strncmp (buf, " spatial ", 9))
279 { 374 {
280 buf += 8; 375 char *copy = strdup (token);
376 copy [buf - token] = 0;
281 377
282 // initial map and its origin 378#if 0
283 maptile *map = pl->ob->map; 379 // this makes only sense when we flush the buffer immediately
284 sint16 dx, dy; 380 if (pl->ns->mapinfo_try (copy))
285 int mapx = pl->ns->mapx / 2 - pl->ob->x; 381 free (copy);
286 int mapy = pl->ns->mapy / 2 - pl->ob->y;
287 int max_distance = 8; // limit maximum path length to something generous
288
289 while (*buf && map && max_distance)
290 {
291 int dir = *buf++;
292
293 switch (dir)
294 {
295 case '1':
296 dx = 0;
297 dy = -1;
298 map = map->xy_find (dx, dy);
299 map && (mapy -= map->height);
300 break;
301 case '2':
302 mapx += map->width;
303 dx = map->width;
304 dy = 0;
305 map = map->xy_find (dx, dy);
306 break;
307 case '3':
308 mapy += map->height;
309 dx = 0;
310 dy = map->height;
311 map = map->xy_find (dx, dy);
312 break;
313 case '4':
314 dx = -1;
315 dy = 0;
316 map = map->xy_find (dx, dy);
317 map && (mapx -= map->width);
318 break;
319 }
320
321 --max_distance;
322 }
323
324 if (!max_distance)
325 snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
326 else if (map && map->path[0])
327 {
328 int flags = 0;
329
330 if (map->tile_path[0])
331 flags |= 1;
332 if (map->tile_path[1])
333 flags |= 2;
334 if (map->tile_path[2])
335 flags |= 4;
336 if (map->tile_path[3])
337 flags |= 8;
338
339 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
340 }
341 else 382 else
342 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 383#endif
384 pl->ns->mapinfo_queue.push_back (copy);
343 } 385 }
344 else 386 else
345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 387 pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
346
347 pl->ns->send_packet (bigbuf);
348} 388}
349 389
350/** This is the Setup cmd */ 390/** This is the Setup cmd */
351void 391void
352SetUp (char *buf, int len, client * ns) 392SetUp (char *buf, int len, client * ns)
… …
481 521
482 ns->send_packet (cmdback); 522 ns->send_packet (cmdback);
483} 523}
484 524
485/** 525/**
486 * client requested an image. send it rate-limited
487 * before flushing.
488 */
489void
490AskFaceCmd (char *buf, int len, client *ns)
491{
492 ns->askface.push_back (atoi (buf));
493}
494
495/**
496 * Tells client the picture it has to use
497 * to smooth a picture number given as argument.
498 */
499void
500AskSmooth (char *buf, int len, client *ns)
501{
502 ns->send_face (atoi (buf));
503 ns->flush_fx ();
504}
505
506/**
507 * This handles the general commands from the client (ie, north, fire, cast, 526 * This handles the general commands from the client (ie, north, fire, cast,
508 * etc.) 527 * etc.)
509 */ 528 */
510void 529void
511PlayerCmd (char *buf, int len, player *pl) 530PlayerCmd (char *buf, int len, player *pl)
… …
532 * commands. 551 * commands.
533 */ 552 */
534 pl->count = 0; 553 pl->count = 0;
535} 554}
536 555
537
538/** 556/**
539 * This handles the general commands from the client (ie, north, fire, cast, 557 * This handles the general commands from the client (ie, north, fire, cast,
540 * etc.). It is a lot like PlayerCmd above, but is called with the 558 * etc.). It is a lot like PlayerCmd above, but is called with the
541 * 'ncom' method which gives more information back to the client so it 559 * 'ncom' method which gives more information back to the client so it
542 * can throttle. 560 * can throttle.
… …
544void 562void
545NewPlayerCmd (char *buf, int len, player *pl) 563NewPlayerCmd (char *buf, int len, player *pl)
546{ 564{
547 if (len <= 6) 565 if (len <= 6)
548 { 566 {
549 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 567 LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len);
550 return; 568 return;
551 } 569 }
552 570
553 uint16 cmdid = net_uint16 ((uint8 *)buf); 571 uint16 cmdid = net_uint16 ((uint8 *)buf);
554 sint32 repeat = net_sint32 ((uint8 *)buf + 2); 572 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
… …
611 { 629 {
612 case ST_PLAYING: 630 case ST_PLAYING:
613 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 631 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
614 break; 632 break;
615 633
616 case ST_CHANGE_CLASS:
617 key_change_class (pl->ob, buf[0]);
618 break;
619
620 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 634 case ST_GET_PARTY_PASSWORD: /* Get password for party */
621 receive_party_password (pl->ob, 13); 635 receive_party_password (pl->ob, 13);
622 break; 636 break;
623 637
624 default: 638 default:
… …
663 677
664 cp = strchr (cp + 1, ' '); 678 cp = strchr (cp + 1, ' ');
665 679
666 if (cp) 680 if (cp)
667 { 681 {
668 assign (ns->version, cp + 1); 682 ns->version = cp + 1;
669 683
670 if (ns->sc_version < 1026) 684 if (ns->sc_version < 1026)
671 ns->send_packet_printf ("drawinfo %d %s", NDI_RED, 685 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
672 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 686 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
673 } 687 }
… …
696 * syntax is: move (to) (tag) (nrof) 710 * syntax is: move (to) (tag) (nrof)
697 */ 711 */
698void 712void
699MoveCmd (char *buf, int len, player *pl) 713MoveCmd (char *buf, int len, player *pl)
700{ 714{
701 int vals[3], i; 715 int to, tag, nrof;
702 716
703 /* A little funky here. We only cycle for 2 records, because 717 if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
704 * we obviously are not going to find a space after the third
705 * record. Perhaps we should just replace this with a
706 * sscanf?
707 */
708 for (i = 0; i < 2; i++)
709 { 718 {
710 vals[i] = atoi (buf);
711
712 if (!(buf = strchr (buf, ' ')))
713 {
714 LOG (llevError, "Incomplete move command: %s\n", buf); 719 LOG (llevError, "Incomplete move command: %s\n", buf);
715 return; 720 return;
716 }
717
718 buf++;
719 } 721 }
720 722
721 vals[2] = atoi (buf); 723 esrv_move_object (pl->ob, to, tag, nrof);
722
723/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
724 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
725} 724}
726 725
727/****************************************************************************** 726/******************************************************************************
728 * 727 *
729 * Start of commands the server sends to the client. 728 * Start of commands the server sends to the client.
… …
738send_query (client *ns, uint8 flags, const char *text) 737send_query (client *ns, uint8 flags, const char *text)
739{ 738{
740 ns->send_packet_printf ("query %d %s", flags, text ? text : ""); 739 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
741} 740}
742 741
742/**
743 * Get player's current range attack in obuf.
744 */
745static void
746rangetostring (player *pl, char *obuf)
747{
748 dynbuf_text buf;
749
750 if (pl->ranged_ob)
751 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
752
753 if (pl->combat_ob)
754 buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
755
756#if 0
757 //TODO: remove this when slot system is working, this is only for debugging
758 if (pl->ob->chosen_skill)
759 buf << " Skill*: " << pl->ob->chosen_skill->name;
760#endif
761
762 //TODO: maybe golem should become the current_weapon, quite simply?
763 if (pl->golem)
764 buf << " Golem*: " << pl->golem->name;
765
766 buf << '\0';
767 buf.linearise (obuf);
768}
769
743#define AddIfInt64(Old,New,Type) if (Old != New) {\ 770#define AddIfInt64(Old,New,Type) if (Old != New) {\
744 Old = New; \ 771 Old = New; \
745 sl << uint8 (Type) << uint64 (New); \ 772 sl << uint8 (Type) << uint64 (New); \
746 } 773 }
747 774
… …
753#define AddIfShort(Old,New,Type) if (Old != New) {\ 780#define AddIfShort(Old,New,Type) if (Old != New) {\
754 Old = New; \ 781 Old = New; \
755 sl << uint8 (Type) << uint16 (New); \ 782 sl << uint8 (Type) << uint16 (New); \
756 } 783 }
757 784
758#define AddIfFloat(Old,New,Type) if (Old != New) {\ 785#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
759 Old = New; \ 786 Old = New; \
760 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ 787 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
761 } 788 }
762 789
763#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ 790#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
764 free(Old); Old = strdup (New);\ 791 free(Old); Old = strdup (New);\
765 sl << uint8 (Type) << data8 (New); \ 792 sl << uint8 (Type) << data8 (New); \
… …
779 806
780 client *ns = pl->ns; 807 client *ns = pl->ns;
781 if (!ns) 808 if (!ns)
782 return; 809 return;
783 810
784 object *ob = pl->ob; 811 object *ob = pl->observe;
785 if (!ob) 812 if (!ob)
786 return; 813 return;
814
815 player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
787 816
788 packet sl ("stats"); 817 packet sl ("stats");
789 818
790 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); 819 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
791 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); 820 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
… …
800 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); 829 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
801 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); 830 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
802 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); 831 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
803 832
804 for (int s = 0; s < NUM_SKILLS; s++) 833 for (int s = 0; s < NUM_SKILLS; s++)
805 if (object *skill = pl->last_skill_ob[s]) 834 if (object *skill = opl->last_skill_ob [s])
806 if (skill->stats.exp != ns->last_skill_exp [s]) 835 if (skill->stats.exp != ns->last_skill_exp [s])
807 { 836 {
808 ns->last_skill_exp [s] = skill->stats.exp; 837 ns->last_skill_exp [s] = skill->stats.exp;
809 838
810 /* Always send along the level if exp changes. This is only 839 /* Always send along the level if exp changes. This is only
… …
818 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); 847 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
819 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); 848 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
820 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); 849 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
821 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); 850 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
822 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); 851 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
823 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); 852 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);
824 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); 853 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
825 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 854 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
826 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); 855 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
827 856
828 flags = 0; 857 flags = 0;
829 858
830 if (pl->fire_on) 859 if (opl->fire_on)
831 flags |= SF_FIREON; 860 flags |= SF_FIREON;
832 861
833 if (pl->run_on) 862 if (opl->run_on)
834 flags |= SF_RUNON; 863 flags |= SF_RUNON;
835 864
836 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); 865 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
837 866
838 if (ns->sc_version < 1025) 867 if (ns->sc_version < 1025)
… …
852 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); 881 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
853 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); 882 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
854 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); 883 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
855 } 884 }
856 885
857 rangetostring (ob, buf); /* we want use the new fire & run system in new client */ 886 rangetostring (opl, buf); /* we want use the new fire & run system in new client */
858 AddIfString (ns->stats.range, buf, CS_STAT_RANGE); 887 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
859 set_title (ob, buf); 888 set_title (ob, buf);
860 AddIfString (ns->stats.title, buf, CS_STAT_TITLE); 889 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
861 890
862 /* Only send it away if we have some actual data */ 891 /* Only send it away if we have some actual data */
… …
866 895
867/** 896/**
868 * Tells the client that here is a player it should start using. 897 * Tells the client that here is a player it should start using.
869 */ 898 */
870void 899void
871esrv_new_player (player *pl, uint32 weight) 900esrv_new_player (player *pl)
872{ 901{
902 sint32 weight = pl->ob->client_weight ();
903
873 packet sl ("player"); 904 packet sl ("player");
874 905
875 sl << uint32 (pl->ob->count) 906 sl << uint32 (pl->ob->count)
876 << uint32 (weight) 907 << uint32 (weight)
877 << uint32 (pl->ob->face) 908 << uint32 (pl->ob->face)
878 << data8 (pl->ob->name); 909 << data8 (pl->ob->name);
879 910
880 pl->ns->last_weight = weight; 911 pl->ns->last_weight = weight;
881 pl->ns->send_packet (sl); 912 pl->ns->send_packet (sl);
882 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
883} 913}
884 914
885/****************************************************************************** 915/******************************************************************************
886 * 916 *
887 * Start of map related commands. 917 * Start of map related commands.
… …
944 974
945 if (!ns.faces_sent[face_num]) 975 if (!ns.faces_sent[face_num])
946 if (ob) 976 if (ob)
947 ns.send_faces (ob); 977 ns.send_faces (ob);
948 else 978 else
949 ns.send_face (face_num); 979 ns.send_face (face_num, 10);
950 980
951 sl << uint16 (face_num); 981 sl << uint16 (face_num);
952 return 1; 982 return 1;
953 } 983 }
954 984
… …
996{ 1026{
997 prefetch_surrounding_maps (op->map, 3); 1027 prefetch_surrounding_maps (op->map, 3);
998} 1028}
999 1029
1000/** 1030/**
1001 * This function uses the new map1 protocol command to send the map 1031 * Draws client map.
1002 * to the client. It is necessary because the old map command supports
1003 * a maximum map size of 15x15.
1004 * This function is much simpler than the old one. This is because
1005 * the old function optimized to send as few face identifiers as possible,
1006 * at the expense of sending more coordinate location (coordinates were
1007 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1008 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1009 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1010 * and use the other 4 bits for other informatiion. For full documentation
1011 * of what we send, see the doc/Protocol file.
1012 * I will describe internally what we do:
1013 * the ns->lastmap shows how the map last looked when sent to the client.
1014 * in the lastmap structure, there is a cells array, which is set to the
1015 * maximum viewable size (As set in config.h).
1016 * in the cells, there are faces and a count value.
1017 * we use the count value to hold the darkness value. If -1, then this space
1018 * is not viewable.
1019 * we use faces[0] faces[1] faces[2] to hold what the three layers
1020 * look like.
1021 */ 1032 */
1022void 1033void
1023draw_client_map1 (object *pl) 1034draw_client_map (player *pl)
1024{ 1035{
1025 int x, y, ax, ay, startlen, max_x, max_y, oldlen; 1036 object *ob = pl->observe;
1026 sint16 nx, ny; 1037 if (!ob->active)
1038 return;
1039
1040 /* If player is just joining the game, he isn't here yet, so the map
1041 * can get swapped out. If so, don't try to send them a map. All will
1042 * be OK once they really log in.
1043 */
1044 if (!ob->map || ob->map->in_memory != MAP_ACTIVE)
1045 return;
1046
1047 int startlen, oldlen;
1027 int estartlen, eoldlen; 1048 int estartlen, eoldlen;
1028 uint8 eentrysize; 1049 uint8 eentrysize;
1029 uint16 ewhatstart, ewhatflag; 1050 uint16 ewhatstart, ewhatflag;
1030 uint8 extendedinfos; 1051 uint8 extendedinfos;
1031 maptile *m;
1032 1052
1033 client &socket = *pl->contr->ns;
1034
1035 if (!pl->active)
1036 return;
1037
1038 check_map_change (pl->contr); 1053 check_map_change (pl);
1039 prefetch_surrounding_maps (pl); 1054 prefetch_surrounding_maps (pl->ob);
1055
1056 /* do LOS after calls to update_position */
1057 /* unfortunately, we need to udpate los when observing, currently */
1058 if (pl->do_los || pl->observe != pl->ob)
1059 {
1060 pl->do_los = 0;
1061 pl->update_los ();
1062 }
1063
1064 /**
1065 * This function uses the new map1 protocol command to send the map
1066 * to the client. It is necessary because the old map command supports
1067 * a maximum map size of 15x15.
1068 * This function is much simpler than the old one. This is because
1069 * the old function optimized to send as few face identifiers as possible,
1070 * at the expense of sending more coordinate location (coordinates were
1071 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1072 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1073 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1074 * and use the other 4 bits for other informatiion. For full documentation
1075 * of what we send, see the doc/Protocol file.
1076 * I will describe internally what we do:
1077 * the ns->lastmap shows how the map last looked when sent to the client.
1078 * in the lastmap structure, there is a cells array, which is set to the
1079 * maximum viewable size (As set in config.h).
1080 * in the cells, there are faces and a count value.
1081 * we use the count value to hold the darkness value. If -1, then this space
1082 * is not viewable.
1083 * we use faces[0] faces[1] faces[2] to hold what the three layers
1084 * look like.
1085 */
1086
1087 client &socket = *pl->ns;
1040 1088
1041 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); 1089 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1042 packet esl; 1090 packet esl;
1043 1091
1044 startlen = sl.length (); 1092 startlen = sl.length ();
… …
1060 << uint8 (eentrysize); 1108 << uint8 (eentrysize);
1061 1109
1062 estartlen = esl.length (); 1110 estartlen = esl.length ();
1063 } 1111 }
1064 1112
1065 /* x,y are the real map locations. ax, ay are viewport relative
1066 * locations.
1067 */
1068 ay = 0;
1069
1070 /* We could do this logic as conditionals in the if statement, 1113 /* We could do this logic as conditionals in the if statement,
1071 * but that started to get a bit messy to look at. 1114 * but that started to get a bit messy to look at.
1072 */ 1115 */
1073 max_x = pl->x + (socket.mapx + 1) / 2; 1116 int hx = socket.mapx / 2;
1074 max_y = pl->y + (socket.mapy + 1) / 2; 1117 int hy = socket.mapy / 2;
1075 1118
1076 maptile *plmap = pl->map; 1119 for (int dx = -hx; dx <= hx; dx++)
1077
1078 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1079 { 1120 {
1080 ax = 0; 1121 sint16 nx, ny;
1081 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1122 maptile *m = 0;
1123
1124 for (int dy = -hy; dy <= hy; dy++)
1082 { 1125 {
1126 // check to see if we can simply go one down quickly
1127 if (m && ++ny >= m->height)
1128 m = 0;
1129
1130 // no, so do it the slow way
1131 if (!m)
1132 {
1133 nx = ob->x + dx; ny = ob->y + dy; m = ob->map;
1134
1135 if (xy_normalise (m, nx, ny))
1136 m->touch ();
1137 else
1138 m = 0;
1139 }
1140
1141 int ax = dx + hx;
1142 int ay = dy + hy;
1143
1083 int emask, mask; 1144 int emask, mask;
1084 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1145 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1085 1146
1086 MapCell &lastcell = socket.lastmap.cells[ax][ay]; 1147 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1087 1148
1088 /* If the coordinates are not valid, or it is too dark to see, 1149 /* If the coordinates are not valid, or it is too dark to see,
1089 * we tell the client as such 1150 * we tell the client as such
1090 */ 1151 */
1091 nx = x;
1092 ny = y;
1093 m = get_map_from_coord (plmap, &nx, &ny);
1094
1095 if (!m) 1152 if (!m)
1096 { 1153 {
1097 /* space is out of map. Update space and clear values 1154 /* space is out of map. Update space and clear values
1098 * if this hasn't already been done. If the space is out 1155 * if this hasn't already been done. If the space is out
1099 * of the map, it shouldn't have a head 1156 * of the map, it shouldn't have a head.
1100 */ 1157 */
1101 if (lastcell.count != -1) 1158 if (lastcell.count != -1)
1102 { 1159 {
1103 sl << uint16 (mask); 1160 sl << uint16 (mask);
1104 map_clearcell (&lastcell, -1); 1161 map_clearcell (&lastcell, -1);
1105 } 1162 }
1106 1163
1107 continue; 1164 continue;
1108 } 1165 }
1109 1166
1110 m->touch ();
1111
1112 int d = pl->contr->blocked_los[ax][ay]; 1167 int d = pl->blocked_los_uc (dx, dy);
1113 1168
1114 if (d > 3) 1169 if (d > 3)
1115 { 1170 {
1116
1117 int need_send = 0, count; 1171 int need_send = 0, count;
1118 1172
1119 /* This block deals with spaces that are not visible for whatever 1173 /* This block deals with spaces that are not visible for whatever
1120 * reason. Still may need to send the head for this space. 1174 * reason. Still may need to send the head for this space.
1121 */ 1175 */
… …
1127 if (lastcell.count != -1) 1181 if (lastcell.count != -1)
1128 need_send = 1; 1182 need_send = 1;
1129 1183
1130 count = -1; 1184 count = -1;
1131 1185
1132 /* properly clear a previously sent big face */
1133 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] 1186 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1134 || lastcell.stat_hp || lastcell.flags || lastcell.player) 1187 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1135 need_send = 1; 1188 need_send = 1;
1136 1189
1190 /* properly clear a previously sent big face */
1137 map_clearcell (&lastcell, count); 1191 map_clearcell (&lastcell, count);
1138 1192
1139 if ((mask & 0xf) || need_send) 1193 if ((mask & 0xf) || need_send)
1140 sl[oldlen + 1] = mask & 0xff; 1194 sl[oldlen + 1] = mask & 0xff;
1141 else 1195 else
… …
1180 } 1234 }
1181 1235
1182 lastcell.count = d; 1236 lastcell.count = d;
1183 1237
1184 mapspace &ms = m->at (nx, ny); 1238 mapspace &ms = m->at (nx, ny);
1239 ms.update ();
1185 1240
1186 if (socket.extmap) 1241 if (socket.extmap)
1187 { 1242 {
1188 uint8 stat_hp = 0; 1243 uint8 stat_hp = 0;
1189 uint8 stat_width = 0; 1244 uint8 stat_width = 0;
1190 uint8 flags = 0; 1245 uint8 flags = 0;
1191 tag_t player = 0; 1246 tag_t player = 0;
1192 1247
1193 // send hp information, if applicable 1248 // send hp information, if applicable
1194 if (object *op = ms.faces_obj [0]) 1249 if (object *op = ms.faces_obj [0])
1195 {
1196 if (op->head || op->invisible) 1250 if (op->is_head () && !op->invisible)
1197 ; // do not show
1198 else if (op->type == PLAYER
1199 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1200 { 1251 {
1201 if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) 1252 if (op->stats.maxhp > op->stats.hp
1253 && op->stats.maxhp > 0
1254 && (op->type == PLAYER
1255 || op->type == DOOR // does not work, have maxhp 0
1256 || QUERY_FLAG (op, FLAG_MONSTER)
1257 || QUERY_FLAG (op, FLAG_ALIVE)
1258 || QUERY_FLAG (op, FLAG_GENERATOR)))
1202 { 1259 {
1203 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; 1260 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1204 stat_width = op->arch->tail_x; 1261 stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1205 } 1262 }
1206 }
1207 1263
1208 if (op->msg && op->msg[0] == '@') 1264 if (op->has_dialogue ())
1209 flags |= 1; 1265 flags |= 1;
1210 1266
1211 if (op->type == PLAYER && op != pl) 1267 if (op->type == PLAYER)
1212 player = op->count; 1268 player = op == ob ? pl->ob->count
1269 : op == pl->ob ? ob->count
1270 : op->count;
1213 } 1271 }
1214 1272
1215 if (lastcell.stat_hp != stat_hp) 1273 if (lastcell.stat_hp != stat_hp)
1216 { 1274 {
1217 lastcell.stat_hp = stat_hp; 1275 lastcell.stat_hp = stat_hp;
1218 1276
… …
1260 1318
1261 /* Middle face */ 1319 /* Middle face */
1262 if (update_space (sl, socket, ms, lastcell, 1)) 1320 if (update_space (sl, socket, ms, lastcell, 1))
1263 mask |= 0x2; 1321 mask |= 0x2;
1264 1322
1265 if (ms.player () == pl 1323 if (ob->invisible
1266 && (pl->invisible & (pl->invisible < 50 ? 1 : 7))) 1324 && ob->invisible & (ob->invisible < 50 ? 1 : 7)
1325 && ms.player () == ob)
1267 { 1326 {
1268 // force player to be visible to himself if invisible 1327 // force player to be visible to himself if invisible
1269 if (lastcell.faces[0] != pl->face) 1328 if (lastcell.faces[0] != ob->face)
1270 { 1329 {
1271 lastcell.faces[0] = pl->face; 1330 lastcell.faces[0] = ob->face;
1272 1331
1273 mask |= 0x1; 1332 mask |= 0x1;
1274 sl << uint16 (pl->face); 1333 sl << uint16 (ob->face);
1275 1334
1276 socket.send_faces (pl); 1335 socket.send_faces (ob);
1277 } 1336 }
1278 } 1337 }
1279 /* Top face */ 1338 /* Top face */
1280 else if (update_space (sl, socket, ms, lastcell, 0)) 1339 else if (update_space (sl, socket, ms, lastcell, 0))
1281 mask |= 0x1; 1340 mask |= 0x1;
1282
1283 1341
1284 /* Check to see if we are in fact sending anything for this 1342 /* Check to see if we are in fact sending anything for this
1285 * space by checking the mask. If so, update the mask. 1343 * space by checking the mask. If so, update the mask.
1286 * if not, reset the len to that from before adding the mask 1344 * if not, reset the len to that from before adding the mask
1287 * value, so we don't send those bits. 1345 * value, so we don't send those bits.
… …
1346 socket.send_packet (sl); 1404 socket.send_packet (sl);
1347 socket.sent_scroll = 0; 1405 socket.sent_scroll = 0;
1348 } 1406 }
1349} 1407}
1350 1408
1351/**
1352 * Draws client map.
1353 */
1354void
1355draw_client_map (object *pl)
1356{
1357 int i, j;
1358 sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1359 int mflags;
1360 struct Map newmap;
1361 maptile *m, *pm;
1362
1363 if (pl->type != PLAYER)
1364 {
1365 LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1366 return;
1367 }
1368
1369 pm = pl->map;
1370
1371 /* If player is just joining the game, he isn't here yet, so the map
1372 * can get swapped out. If so, don't try to send them a map. All will
1373 * be OK once they really log in.
1374 */
1375 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
1376 return;
1377
1378 memset (&newmap, 0, sizeof (struct Map));
1379
1380 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
1381 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
1382 {
1383 ax = i;
1384 ay = j;
1385 m = pm;
1386 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1387
1388 if (mflags & P_OUT_OF_MAP)
1389 continue;
1390
1391 /* If a map is visible to the player, we don't want to swap it out
1392 * just to reload it. This should really call something like
1393 * swap_map, but this is much more efficient and 'good enough'
1394 */
1395 if (mflags & P_NEW_MAP)
1396 m->timeout = 50;
1397 }
1398
1399 /* do LOS after calls to update_position */
1400 if (pl->contr->do_los)
1401 {
1402 update_los (pl);
1403 pl->contr->do_los = 0;
1404 }
1405
1406 /* Big maps need a different drawing mechanism to work */
1407 draw_client_map1 (pl);
1408}
1409
1410
1411/*****************************************************************************/ 1409/*****************************************************************************/
1412
1413/* GROS: The following one is used to allow a plugin to send a generic cmd to*/ 1410/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1414
1415/* a player. Of course, the client need to know the command to be able to */ 1411/* a player. Of course, the client need to know the command to be able to */
1416
1417/* manage it ! */ 1412/* manage it ! */
1418
1419/*****************************************************************************/ 1413/*****************************************************************************/
1420void 1414void
1421send_plugin_custom_message (object *pl, char *buf) 1415send_plugin_custom_message (object *pl, char *buf)
1422{ 1416{
1423 pl->contr->ns->send_packet (buf); 1417 pl->contr->ns->send_packet (buf);
… …
1432{ 1426{
1433 packet sl; 1427 packet sl;
1434 sl << "replyinfo skill_info\n"; 1428 sl << "replyinfo skill_info\n";
1435 1429
1436 for (int i = 1; i < NUM_SKILLS; i++) 1430 for (int i = 1; i < NUM_SKILLS; i++)
1437 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); 1431 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1438 1432
1439 if (sl.length () >= MAXSOCKBUF) 1433 if (sl.length () > MAXSOCKBUF)
1440 { 1434 {
1441 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 1435 LOG (llevError, "Buffer overflow in send_skill_info!\n");
1442 fatal (0); 1436 fatal (0);
1443 } 1437 }
1444 1438
… …
1457 sl << "replyinfo spell_paths\n"; 1451 sl << "replyinfo spell_paths\n";
1458 1452
1459 for (int i = 0; i < NRSPELLPATHS; i++) 1453 for (int i = 0; i < NRSPELLPATHS; i++)
1460 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); 1454 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1461 1455
1462 if (sl.length () >= MAXSOCKBUF) 1456 if (sl.length () > MAXSOCKBUF)
1463 { 1457 {
1464 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 1458 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1465 fatal (0); 1459 fatal (0);
1466 } 1460 }
1467 1461
… …
1486 if (spell->type == SPELL) 1480 if (spell->type == SPELL)
1487 { 1481 {
1488 int flags = 0; 1482 int flags = 0;
1489 1483
1490 /* check if we need to update it */ 1484 /* check if we need to update it */
1491 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) 1485 if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
1492 { 1486 {
1493 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1487 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1494 flags |= UPD_SP_MANA; 1488 flags |= UPD_SP_MANA;
1495 } 1489 }
1496 1490
1497 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) 1491 if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
1498 { 1492 {
1499 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1493 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1500 flags |= UPD_SP_GRACE; 1494 flags |= UPD_SP_GRACE;
1501 } 1495 }
1502 1496
1503 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) 1497 if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
1504 { 1498 {
1505 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1499 spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1506 flags |= UPD_SP_DAMAGE; 1500 flags |= UPD_SP_DAMAGE;
1507 } 1501 }
1508 1502
1509 if (flags) 1503 if (flags)
1510 { 1504 {
… …
1512 1506
1513 sl << "updspell " 1507 sl << "updspell "
1514 << uint8 (flags) 1508 << uint8 (flags)
1515 << uint32 (spell->count); 1509 << uint32 (spell->count);
1516 1510
1517 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 1511 if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1518 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 1512 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);
1519 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 1513 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);
1520 1514
1521 pl->ns->send_packet (sl); 1515 pl->ns->send_packet (sl);
1522 } 1516 }
1523 } 1517 }
1524 } 1518 }
… …
1554 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1548 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1555 return; 1549 return;
1556 } 1550 }
1557 1551
1558 /* store costs and damage in the object struct, to compare to later */ 1552 /* store costs and damage in the object struct, to compare to later */
1559 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1553 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1560 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1554 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1561 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1555 spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1562 1556
1563 /* figure out which skill it uses, if it uses one */ 1557 /* figure out which skill it uses, if it uses one */
1564 if (spell->skill) 1558 if (spell->skill)
1565 { 1559 if (object *tmp = pl->find_skill (spell->skill))
1566 for (i = 1; i < NUM_SKILLS; i++)
1567 if (!strcmp (spell->skill, skill_names[i]))
1568 {
1569 skill = i + CS_STAT_SKILLINFO; 1560 skill = tmp->subtype + CS_STAT_SKILLINFO;
1570 break;
1571 }
1572 }
1573 1561
1574 // spells better have a face 1562 // spells better have a face
1575 if (!spell->face) 1563 if (!spell->face)
1576 { 1564 {
1577 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); 1565 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1578 spell->face = face_find ("burnout.x11", blank_face); 1566 spell->face = face_find ("burnout.x11", blank_face);
1579 } 1567 }
1568
1569 pl->ns->send_face (spell->face);
1580 1570
1581 /* send the current values */ 1571 /* send the current values */
1582 sl << uint32 (spell->count) 1572 sl << uint32 (spell->count)
1583 << uint16 (spell->level) 1573 << uint16 (spell->level)
1584 << uint16 (spell->casting_time) 1574 << uint16 (spell->casting_time)
1585 << uint16 (spell->last_sp) 1575 << uint16 (spell->cached_sp)
1586 << uint16 (spell->last_grace) 1576 << uint16 (spell->cached_grace)
1587 << uint16 (spell->last_eat) 1577 << uint16 (spell->cached_eat)
1588 << uint8 (skill) 1578 << uint8 (skill)
1589 << uint32 (spell->path_attuned) 1579 << uint32 (spell->path_attuned)
1590 << uint32 (spell->face) 1580 << uint32 (spell->face)
1591 << data8 (spell->name) 1581 << data8 (spell->name)
1592 << data16 (spell->msg); 1582 << data16 (spell->msg);
… …
1620 * bytes and 3 strings (because that is the spec) so we need to 1610 * bytes and 3 strings (because that is the spec) so we need to
1621 * check that the length of those 3 strings, plus the 23 bytes, 1611 * check that the length of those 3 strings, plus the 23 bytes,
1622 * won't take us over the length limit for the socket, if it does, 1612 * won't take us over the length limit for the socket, if it does,
1623 * we need to send what we already have, and restart packet formation 1613 * we need to send what we already have, and restart packet formation
1624 */ 1614 */
1615 if (spell->type != SPELL)
1616 continue;
1617
1625 /* Seeing crashes by overflowed buffers. Quick arithemetic seems 1618 /* Seeing crashes by overflowed buffers. Quick arithemetic seems
1626 * to show add_spell is 26 bytes + 2 strings. However, the overun 1619 * to show add_spell is 26 bytes + 2 strings. However, the overun
1627 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem 1620 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1628 * like it will fix this 1621 * like it will fix this
1629 */ 1622 */
1630 if (spell->type != SPELL)
1631 continue;
1632
1633 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 1623 if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1634 { 1624 {
1625 pl->ns->flush_fx ();
1635 pl->ns->send_packet (sl); 1626 pl->ns->send_packet (sl);
1636 1627
1637 sl.reset (); 1628 sl.reset ();
1638 sl << "addspell "; 1629 sl << "addspell ";
1639 } 1630 }
… …
1647 return; 1638 return;
1648 } 1639 }
1649 else 1640 else
1650 append_spell (pl, sl, spell); 1641 append_spell (pl, sl, spell);
1651 1642
1652 if (sl.length () >= MAXSOCKBUF) 1643 if (sl.length () > MAXSOCKBUF)
1653 { 1644 {
1654 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 1645 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1655 fatal (0); 1646 fatal (0);
1656 } 1647 }
1657 1648
1658 /* finally, we can send the packet */ 1649 /* finally, we can send the packet */
1650 pl->ns->flush_fx ();
1659 pl->ns->send_packet (sl); 1651 pl->ns->send_packet (sl);
1660} 1652}
1661 1653

Diff Legend

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