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.99 by root, Tue May 22 10:50:01 2007 UTC vs.
Revision 1.144 by root, Fri Dec 26 10:36:42 2008 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 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]) flags |= 1;
165 if (ob->map->tile_path[1]) flags |= 2;
166 if (ob->map->tile_path[2]) flags |= 4;
167 if (ob->map->tile_path[3]) flags |= 8;
168
169 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
170 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
171 }
172 else
173 snprintf (buf, MAX_BUF, "mapinfo current");
174
175 socket.send_packet (buf);
176 }
177 } 207 }
178 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)
179 { 209 {
180 int dx = ob->x - socket.current_x; 210 int dx = ob->x - socket.current_x;
181 int dy = ob->y - socket.current_y; 211 int dy = ob->y - socket.current_y;
… …
189 } 219 }
190 } 220 }
191 221
192 socket.current_x = ob->x; 222 socket.current_x = ob->x;
193 socket.current_y = ob->y; 223 socket.current_y = ob->y;
194
195 region *reg = ob->region ();
196 if (socket.current_region != reg)
197 {
198 socket.current_region = reg;
199 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
200 }
201} 224}
202 225
203/** 226/**
204 * RequestInfo is sort of a meta command. There is some specific 227 * RequestInfo is sort of a meta command. There is some specific
205 * request of information, but we call other functions to provide 228 * request of information, but we call other functions to provide
206 * that information. 229 * that information.
207 */ 230 */
208void 231void
209RequestInfo (char *buf, int len, client * ns) 232RequestInfo (char *buf, int len, client *ns)
210{ 233{
211 char *params = NULL, *cp; 234 char *params;
212
213 /* No match */
214 char bigbuf[MAX_BUF];
215 int slen;
216
217 /* Set up replyinfo before we modify any of the buffers - this is used
218 * if we don't find a match.
219 */
220 strcpy (bigbuf, "replyinfo ");
221 slen = strlen (bigbuf);
222 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
223 235
224 /* find the first space, make it null, and update the 236 /* find the first space, make it null, and update the
225 * params pointer. 237 * params pointer.
226 */ 238 */
227 for (cp = buf; *cp != '\0'; cp++) 239 for (params = buf; *params; params++)
228 if (*cp == ' ') 240 if (*params == ' ')
229 { 241 {
230 *cp = '\0';
231 params = cp + 1; 242 *params++ = 0;
232 break; 243 break;
233 } 244 }
234 245
235 if (!strcmp (buf, "image_info")) 246 if (!strcmp (buf, "image_info"))
236 send_image_info (ns, params); 247 send_image_info (ns, params);
… …
239 else if (!strcmp (buf, "skill_info")) 250 else if (!strcmp (buf, "skill_info"))
240 send_skill_info (ns, params); 251 send_skill_info (ns, params);
241 else if (!strcmp (buf, "spell_paths")) 252 else if (!strcmp (buf, "spell_paths"))
242 send_spell_paths (ns, params); 253 send_spell_paths (ns, params);
243 else 254 else
244 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 }
245} 262}
246 263
247void 264void
248ExtCmd (char *buf, int len, player *pl) 265ExtCmd (char *buf, int len, player *pl)
249{ 266{
… …
252 269
253void 270void
254ExtiCmd (char *buf, int len, client *ns) 271ExtiCmd (char *buf, int len, client *ns)
255{ 272{
256 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;
257} 360}
258 361
259void 362void
260MapInfoCmd (char *buf, int len, player *pl) 363MapInfoCmd (char *buf, int len, player *pl)
261{ 364{
262 // <mapinfo tag spatial tile-path 365 // <mapinfo tag spatial tile-path
263 // >mapinfo tag spatial flags x y w h hash 366 // >mapinfo tag spatial flags x y w h hash
264 367
265 char bigbuf[MAX_BUF], *token;
266
267 token = buf; 368 char *token = buf;
268 // copy token 369
269 if (!(buf = strchr (buf, ' '))) 370 if (!(buf = strchr (buf, ' ')))
270 return; 371 return;
271 372
272 *buf++ = 0;
273
274 if (!strncmp (buf, "spatial ", 8)) 373 if (!strncmp (buf, " spatial ", 9))
275 { 374 {
276 buf += 8; 375 char *copy = strdup (token);
376 copy [buf - token] = 0;
277 377
278 // initial map and its origin 378#if 0
279 maptile *map = pl->ob->map; 379 // this makes only sense when we flush the buffer immediately
280 sint16 dx, dy; 380 if (pl->ns->mapinfo_try (copy))
281 int mapx = pl->ns->mapx / 2 - pl->ob->x; 381 free (copy);
282 int mapy = pl->ns->mapy / 2 - pl->ob->y;
283 int max_distance = 8; // limit maximum path length to something generous
284
285 while (*buf && map && max_distance)
286 {
287 int dir = *buf++;
288
289 switch (dir)
290 {
291 case '1':
292 dx = 0;
293 dy = -1;
294 map = map->xy_find (dx, dy);
295 map && (mapy -= map->height);
296 break;
297 case '2':
298 mapx += map->width;
299 dx = map->width;
300 dy = 0;
301 map = map->xy_find (dx, dy);
302 break;
303 case '3':
304 mapy += map->height;
305 dx = 0;
306 dy = map->height;
307 map = map->xy_find (dx, dy);
308 break;
309 case '4':
310 dx = -1;
311 dy = 0;
312 map = map->xy_find (dx, dy);
313 map && (mapx -= map->width);
314 break;
315 }
316
317 --max_distance;
318 }
319
320 if (!max_distance)
321 snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
322 else if (map && map->path[0])
323 {
324 int flags = 0;
325
326 if (map->tile_path[0]) flags |= 1;
327 if (map->tile_path[1]) flags |= 2;
328 if (map->tile_path[2]) flags |= 4;
329 if (map->tile_path[3]) flags |= 8;
330
331 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
332 }
333 else 382 else
334 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 383#endif
384 pl->ns->mapinfo_queue.push_back (copy);
335 } 385 }
336 else 386 else
337 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 387 pl->ns->send_packet_printf ("mapinfo %s unsupported", token);
338
339 pl->ns->send_packet (bigbuf);
340} 388}
341 389
342/** This is the Setup cmd */ 390/** This is the Setup cmd */
343void 391void
344SetUp (char *buf, int len, client * ns) 392SetUp (char *buf, int len, client * ns)
… …
473 521
474 ns->send_packet (cmdback); 522 ns->send_packet (cmdback);
475} 523}
476 524
477/** 525/**
478 * client requested an image. send it rate-limited
479 * before flushing.
480 */
481void
482AskFaceCmd (char *buf, int len, client *ns)
483{
484 ns->askface.push_back (atoi (buf));
485}
486
487/**
488 * Tells client the picture it has to use
489 * to smooth a picture number given as argument.
490 */
491void
492AskSmooth (char *buf, int len, client *ns)
493{
494 ns->send_face (atoi (buf));
495 ns->flush_fx ();
496}
497
498/**
499 * 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,
500 * etc.) 527 * etc.)
501 */ 528 */
502void 529void
503PlayerCmd (char *buf, int len, player *pl) 530PlayerCmd (char *buf, int len, player *pl)
… …
524 * commands. 551 * commands.
525 */ 552 */
526 pl->count = 0; 553 pl->count = 0;
527} 554}
528 555
529
530/** 556/**
531 * 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,
532 * 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
533 * '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
534 * can throttle. 560 * can throttle.
… …
536void 562void
537NewPlayerCmd (char *buf, int len, player *pl) 563NewPlayerCmd (char *buf, int len, player *pl)
538{ 564{
539 if (len <= 6) 565 if (len <= 6)
540 { 566 {
541 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);
542 return; 568 return;
543 } 569 }
544 570
545 uint16 cmdid = net_uint16 ((uint8 *)buf); 571 uint16 cmdid = net_uint16 ((uint8 *)buf);
546 sint32 repeat = net_sint32 ((uint8 *)buf + 2); 572 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
… …
684 * syntax is: move (to) (tag) (nrof) 710 * syntax is: move (to) (tag) (nrof)
685 */ 711 */
686void 712void
687MoveCmd (char *buf, int len, player *pl) 713MoveCmd (char *buf, int len, player *pl)
688{ 714{
689 int vals[3], i; 715 int to, tag, nrof;
690 716
691 /* A little funky here. We only cycle for 2 records, because 717 if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
692 * we obviously are not going to find a space after the third
693 * record. Perhaps we should just replace this with a
694 * sscanf?
695 */
696 for (i = 0; i < 2; i++)
697 { 718 {
698 vals[i] = atoi (buf);
699
700 if (!(buf = strchr (buf, ' ')))
701 {
702 LOG (llevError, "Incomplete move command: %s\n", buf); 719 LOG (llevError, "Incomplete move command: %s\n", buf);
703 return; 720 return;
704 }
705
706 buf++;
707 } 721 }
708 722
709 vals[2] = atoi (buf); 723 esrv_move_object (pl->ob, to, tag, nrof);
710
711/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
712 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
713} 724}
714 725
715/****************************************************************************** 726/******************************************************************************
716 * 727 *
717 * Start of commands the server sends to the client. 728 * Start of commands the server sends to the client.
… …
740 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; 751 buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
741 752
742 if (pl->combat_ob) 753 if (pl->combat_ob)
743 buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; 754 buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
744 755
756#if 0
745 //TODO: remove this when slot system is working, this is only for debugging 757 //TODO: remove this when slot system is working, this is only for debugging
746 if (pl->ob->chosen_skill) 758 if (pl->ob->chosen_skill)
747 buf << " Skill*: " << pl->ob->chosen_skill->name; 759 buf << " Skill*: " << pl->ob->chosen_skill->name;
760#endif
748 761
749 //TODO: maybe golem should become the current_weapon, quite simply? 762 //TODO: maybe golem should become the current_weapon, quite simply?
750 if (pl->golem) 763 if (pl->golem)
751 buf << " Golem*: " << pl->golem->name; 764 buf << " Golem*: " << pl->golem->name;
752 765
766 buf << '\0';
753 buf.linearise (obuf); 767 buf.linearise (obuf);
754 obuf [buf.size ()] = 0;
755} 768}
756 769
757#define AddIfInt64(Old,New,Type) if (Old != New) {\ 770#define AddIfInt64(Old,New,Type) if (Old != New) {\
758 Old = New; \ 771 Old = New; \
759 sl << uint8 (Type) << uint64 (New); \ 772 sl << uint8 (Type) << uint64 (New); \
… …
793 806
794 client *ns = pl->ns; 807 client *ns = pl->ns;
795 if (!ns) 808 if (!ns)
796 return; 809 return;
797 810
798 object *ob = pl->ob; 811 object *ob = pl->observe;
799 if (!ob) 812 if (!ob)
800 return; 813 return;
814
815 player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl;
801 816
802 packet sl ("stats"); 817 packet sl ("stats");
803 818
804 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); 819 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
805 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); 820 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
… …
814 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); 829 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
815 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); 830 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
816 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); 831 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
817 832
818 for (int s = 0; s < NUM_SKILLS; s++) 833 for (int s = 0; s < NUM_SKILLS; s++)
819 if (object *skill = pl->last_skill_ob[s]) 834 if (object *skill = opl->last_skill_ob [s])
820 if (skill->stats.exp != ns->last_skill_exp [s]) 835 if (skill->stats.exp != ns->last_skill_exp [s])
821 { 836 {
822 ns->last_skill_exp [s] = skill->stats.exp; 837 ns->last_skill_exp [s] = skill->stats.exp;
823 838
824 /* Always send along the level if exp changes. This is only 839 /* Always send along the level if exp changes. This is only
… …
839 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK); 854 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
840 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);
841 856
842 flags = 0; 857 flags = 0;
843 858
844 if (pl->fire_on) 859 if (opl->fire_on)
845 flags |= SF_FIREON; 860 flags |= SF_FIREON;
846 861
847 if (pl->run_on) 862 if (opl->run_on)
848 flags |= SF_RUNON; 863 flags |= SF_RUNON;
849 864
850 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); 865 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
851 866
852 if (ns->sc_version < 1025) 867 if (ns->sc_version < 1025)
… …
866 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);
867 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);
868 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);
869 } 884 }
870 885
871 rangetostring (pl, 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 */
872 AddIfString (ns->stats.range, buf, CS_STAT_RANGE); 887 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
873 set_title (ob, buf); 888 set_title (ob, buf);
874 AddIfString (ns->stats.title, buf, CS_STAT_TITLE); 889 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
875 890
876 /* Only send it away if we have some actual data */ 891 /* Only send it away if we have some actual data */
… …
880 895
881/** 896/**
882 * 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.
883 */ 898 */
884void 899void
885esrv_new_player (player *pl, uint32 weight) 900esrv_new_player (player *pl)
886{ 901{
902 sint32 weight = pl->ob->client_weight ();
903
887 packet sl ("player"); 904 packet sl ("player");
888 905
889 sl << uint32 (pl->ob->count) 906 sl << uint32 (pl->ob->count)
890 << uint32 (weight) 907 << uint32 (weight)
891 << uint32 (pl->ob->face) 908 << uint32 (pl->ob->face)
892 << data8 (pl->ob->name); 909 << data8 (pl->ob->name);
893 910
894 pl->ns->last_weight = weight; 911 pl->ns->last_weight = weight;
895 pl->ns->send_packet (sl); 912 pl->ns->send_packet (sl);
896 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
897} 913}
898 914
899/****************************************************************************** 915/******************************************************************************
900 * 916 *
901 * Start of map related commands. 917 * Start of map related commands.
… …
958 974
959 if (!ns.faces_sent[face_num]) 975 if (!ns.faces_sent[face_num])
960 if (ob) 976 if (ob)
961 ns.send_faces (ob); 977 ns.send_faces (ob);
962 else 978 else
963 ns.send_face (face_num); 979 ns.send_face (face_num, 10);
964 980
965 sl << uint16 (face_num); 981 sl << uint16 (face_num);
966 return 1; 982 return 1;
967 } 983 }
968 984
… …
1010{ 1026{
1011 prefetch_surrounding_maps (op->map, 3); 1027 prefetch_surrounding_maps (op->map, 3);
1012} 1028}
1013 1029
1014/** 1030/**
1015 * This function uses the new map1 protocol command to send the map 1031 * Draws client map.
1016 * to the client. It is necessary because the old map command supports
1017 * a maximum map size of 15x15.
1018 * This function is much simpler than the old one. This is because
1019 * the old function optimized to send as few face identifiers as possible,
1020 * at the expense of sending more coordinate location (coordinates were
1021 * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1022 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1023 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1024 * and use the other 4 bits for other informatiion. For full documentation
1025 * of what we send, see the doc/Protocol file.
1026 * I will describe internally what we do:
1027 * the ns->lastmap shows how the map last looked when sent to the client.
1028 * in the lastmap structure, there is a cells array, which is set to the
1029 * maximum viewable size (As set in config.h).
1030 * in the cells, there are faces and a count value.
1031 * we use the count value to hold the darkness value. If -1, then this space
1032 * is not viewable.
1033 * we use faces[0] faces[1] faces[2] to hold what the three layers
1034 * look like.
1035 */ 1032 */
1036void 1033void
1037draw_client_map1 (object *pl) 1034draw_client_map (player *pl)
1038{ 1035{
1039 int x, y, ax, ay, startlen, max_x, max_y, oldlen; 1036 object *ob = pl->observe;
1040 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;
1041 int estartlen, eoldlen; 1048 int estartlen, eoldlen;
1042 uint8 eentrysize; 1049 uint8 eentrysize;
1043 uint16 ewhatstart, ewhatflag; 1050 uint16 ewhatstart, ewhatflag;
1044 uint8 extendedinfos; 1051 uint8 extendedinfos;
1045 maptile *m;
1046 1052
1047 client &socket = *pl->contr->ns;
1048
1049 if (!pl->active)
1050 return;
1051
1052 check_map_change (pl->contr); 1053 check_map_change (pl);
1053 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;
1054 1088
1055 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); 1089 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1056 packet esl; 1090 packet esl;
1057 1091
1058 startlen = sl.length (); 1092 startlen = sl.length ();
… …
1074 << uint8 (eentrysize); 1108 << uint8 (eentrysize);
1075 1109
1076 estartlen = esl.length (); 1110 estartlen = esl.length ();
1077 } 1111 }
1078 1112
1079 /* x,y are the real map locations. ax, ay are viewport relative 1113 int hx = socket.mapx / 2;
1080 * locations. 1114 int hy = socket.mapy / 2;
1081 */
1082 ay = 0;
1083 1115
1084 /* We could do this logic as conditionals in the if statement, 1116 ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
1085 * but that started to get a bit messy to look at. 1117 int ax = dx + hx;
1086 */ 1118 int ay = dy + hy;
1087 max_x = pl->x + (socket.mapx + 1) / 2;
1088 max_y = pl->y + (socket.mapy + 1) / 2;
1089 1119
1090 maptile *plmap = pl->map;
1091
1092 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1093 {
1094 ax = 0;
1095 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1096 {
1097 int emask, mask; 1120 int emask, mask;
1098 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1121 emask = mask = (ax << 10) | (ay << 4);
1099 1122
1100 MapCell &lastcell = socket.lastmap.cells[ax][ay]; 1123 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1101 1124
1102 /* If the coordinates are not valid, or it is too dark to see, 1125 /* If the coordinates are not valid, or it is too dark to see,
1103 * we tell the client as such 1126 * we tell the client as such
1104 */ 1127 */
1105 nx = x;
1106 ny = y;
1107 m = get_map_from_coord (plmap, &nx, &ny);
1108
1109 if (!m) 1128 if (!m)
1110 { 1129 {
1111 /* space is out of map. Update space and clear values 1130 /* space is out of map. Update space and clear values
1112 * if this hasn't already been done. If the space is out 1131 * if this hasn't already been done. If the space is out
1113 * of the map, it shouldn't have a head 1132 * of the map, it shouldn't have a head.
1114 */ 1133 */
1115 if (lastcell.count != -1) 1134 if (lastcell.count != -1)
1135 {
1136 sl << uint16 (mask);
1137 map_clearcell (&lastcell, -1);
1138 }
1139
1140 continue;
1141 }
1142
1143 int d = pl->blocked_los_uc (dx, dy);
1144
1145 if (d > 3)
1146 {
1147 /* This block deals with spaces that are not visible for whatever
1148 * reason. Still may need to send the head for this space.
1149 */
1150 if (lastcell.count != -1
1151 || lastcell.faces[0]
1152 || lastcell.faces[1]
1153 || lastcell.faces[2]
1154 || lastcell.stat_hp
1155 || lastcell.flags
1156 || lastcell.player)
1157 sl << uint16 (mask);
1158
1159 /* properly clear a previously sent big face */
1160 map_clearcell (&lastcell, -1);
1161 }
1162 else
1163 {
1164 /* In this block, the space is visible.
1165 */
1166
1167 /* Rather than try to figure out what everything that we might
1168 * need to send is, then form the packet after that,
1169 * we presume that we will in fact form a packet, and update
1170 * the bits by what we do actually send. If we send nothing,
1171 * we just back out sl.length () to the old value, and no harm
1172 * is done.
1173 * I think this is simpler than doing a bunch of checks to see
1174 * what if anything we need to send, setting the bits, then
1175 * doing those checks again to add the real data.
1176 */
1177 oldlen = sl.length ();
1178 eoldlen = esl.length ();
1179
1180 sl << uint16 (mask);
1181
1182 unsigned char dummy;
1183 unsigned char *last_ext = &dummy;
1184
1185 /* Darkness changed */
1186 if (lastcell.count != d && socket.darkness)
1187 {
1188 mask |= 0x8;
1189
1190 if (socket.extmap)
1191 {
1192 *last_ext |= 0x80;
1193 last_ext = &sl[sl.length ()];
1194 sl << uint8 (d);
1195 }
1196 else
1197 sl << uint8 (255 - 64 * d);
1198 }
1199
1200 lastcell.count = d;
1201
1202 mapspace &ms = m->at (nx, ny);
1203 ms.update ();
1204
1205 if (expect_true (socket.extmap))
1206 {
1207 uint8 stat_hp = 0;
1208 uint8 stat_width = 0;
1209 uint8 flags = 0;
1210 tag_t player = 0;
1211
1212 // send hp information, if applicable
1213 if (object *op = ms.faces_obj [0])
1214 if (op->is_head () && !op->invisible)
1116 { 1215 {
1117 sl << uint16 (mask); 1216 if (op->stats.maxhp > op->stats.hp
1118 map_clearcell (&lastcell, -1); 1217 && op->stats.maxhp > 0
1218 && (op->type == PLAYER
1219 || op->type == DOOR // does not work, have maxhp 0
1220 || QUERY_FLAG (op, FLAG_MONSTER)
1221 || QUERY_FLAG (op, FLAG_ALIVE)
1222 || QUERY_FLAG (op, FLAG_GENERATOR)))
1223 {
1224 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1225 stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1226 }
1227
1228 if (expect_false (op->has_dialogue ()))
1229 flags |= 1;
1230
1231 if (expect_false (op->type == PLAYER))
1232 player = op == ob ? pl->ob->count
1233 : op == pl->ob ? ob->count
1234 : op->count;
1119 } 1235 }
1120 1236
1121 continue; 1237 if (expect_false (lastcell.stat_hp != stat_hp))
1122 }
1123
1124 m->touch ();
1125
1126 int d = pl->contr->blocked_los[ax][ay];
1127
1128 if (d > 3)
1129 {
1130
1131 int need_send = 0, count;
1132
1133 /* This block deals with spaces that are not visible for whatever
1134 * reason. Still may need to send the head for this space.
1135 */
1136
1137 oldlen = sl.length ();
1138
1139 sl << uint16 (mask);
1140
1141 if (lastcell.count != -1)
1142 need_send = 1;
1143
1144 count = -1;
1145
1146 /* properly clear a previously sent big face */
1147 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1148 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1149 need_send = 1;
1150
1151 map_clearcell (&lastcell, count);
1152
1153 if ((mask & 0xf) || need_send)
1154 sl[oldlen + 1] = mask & 0xff;
1155 else
1156 sl.reset (oldlen);
1157 }
1158 else
1159 {
1160 /* In this block, the space is visible.
1161 */
1162
1163 /* Rather than try to figure out what everything that we might
1164 * need to send is, then form the packet after that,
1165 * we presume that we will in fact form a packet, and update
1166 * the bits by what we do actually send. If we send nothing,
1167 * we just back out sl.length () to the old value, and no harm
1168 * is done.
1169 * I think this is simpler than doing a bunch of checks to see
1170 * what if anything we need to send, setting the bits, then
1171 * doing those checks again to add the real data.
1172 */
1173 oldlen = sl.length ();
1174 eoldlen = esl.length ();
1175
1176 sl << uint16 (mask);
1177
1178 unsigned char dummy;
1179 unsigned char *last_ext = &dummy;
1180
1181 /* Darkness changed */
1182 if (lastcell.count != d && socket.darkness)
1183 { 1238 {
1239 lastcell.stat_hp = stat_hp;
1240
1184 mask |= 0x8; 1241 mask |= 0x8;
1242 *last_ext |= 0x80;
1243 last_ext = &sl[sl.length ()];
1185 1244
1186 if (socket.extmap) 1245 sl << uint8 (5) << uint8 (stat_hp);
1246
1247 if (stat_width > 1)
1187 { 1248 {
1188 *last_ext |= 0x80; 1249 *last_ext |= 0x80;
1189 last_ext = &sl[sl.length ()]; 1250 last_ext = &sl[sl.length ()];
1190 sl << uint8 (d);
1191 }
1192 else
1193 sl << uint8 (255 - 64 * d);
1194 }
1195 1251
1196 lastcell.count = d;
1197
1198 mapspace &ms = m->at (nx, ny);
1199
1200 if (socket.extmap)
1201 {
1202 uint8 stat_hp = 0;
1203 uint8 stat_width = 0;
1204 uint8 flags = 0;
1205 tag_t player = 0;
1206
1207 // send hp information, if applicable
1208 if (object *op = ms.faces_obj [0])
1209 {
1210 if (op->head || op->invisible)
1211 ; // do not show
1212 else if (op->type == PLAYER
1213 || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1214 {
1215 if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1216 {
1217 stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1218 stat_width = op->arch->tail_x;
1219 }
1220 }
1221
1222 if (op->msg && op->msg[0] == '@')
1223 flags |= 1;
1224
1225 if (op->type == PLAYER && op != pl)
1226 player = op->count;
1227 }
1228
1229 if (lastcell.stat_hp != stat_hp)
1230 {
1231 lastcell.stat_hp = stat_hp;
1232
1233 mask |= 0x8;
1234 *last_ext |= 0x80;
1235 last_ext = &sl[sl.length ()];
1236
1237 sl << uint8 (5) << uint8 (stat_hp);
1238
1239 if (stat_width > 1)
1240 {
1241 *last_ext |= 0x80;
1242 last_ext = &sl[sl.length ()];
1243
1244 sl << uint8 (6) << uint8 (stat_width); 1252 sl << uint8 (6) << uint8 (stat_width);
1245 }
1246 } 1253 }
1247
1248 if (lastcell.player != player)
1249 {
1250 lastcell.player = player;
1251
1252 mask |= 0x8;
1253 *last_ext |= 0x80;
1254 last_ext = &sl[sl.length ()];
1255
1256 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1257 }
1258
1259 if (lastcell.flags != flags)
1260 {
1261 lastcell.flags = flags;
1262
1263 mask |= 0x8;
1264 *last_ext |= 0x80;
1265 last_ext = &sl[sl.length ()];
1266
1267 sl << uint8 (8) << uint8 (flags);
1268 }
1269 } 1254 }
1270 1255
1271 /* Floor face */ 1256 if (expect_false (lastcell.player != player))
1272 if (update_space (sl, socket, ms, lastcell, 2)) 1257 {
1258 lastcell.player = player;
1259
1273 mask |= 0x4; 1260 mask |= 0x8;
1261 *last_ext |= 0x80;
1262 last_ext = &sl[sl.length ()];
1274 1263
1275 /* Middle face */ 1264 sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1276 if (update_space (sl, socket, ms, lastcell, 1)) 1265 }
1266
1267 if (expect_false (lastcell.flags != flags))
1268 {
1269 lastcell.flags = flags;
1270
1277 mask |= 0x2; 1271 mask |= 0x8;
1272 *last_ext |= 0x80;
1273 last_ext = &sl[sl.length ()];
1278 1274
1279 if (ms.player () == pl 1275 sl << uint8 (8) << uint8 (flags);
1280 && (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1281 { 1276 }
1277 }
1278
1279 /* Floor face */
1280 if (update_space (sl, socket, ms, lastcell, 2))
1281 mask |= 0x4;
1282
1283 /* Middle face */
1284 if (update_space (sl, socket, ms, lastcell, 1))
1285 mask |= 0x2;
1286
1287 if (expect_false (ob->invisible)
1288 && ob->invisible & (ob->invisible < 50 ? 1 : 7)
1289 && ms.player () == ob)
1290 {
1282 // force player to be visible to himself if invisible 1291 // force player to be visible to himself if invisible
1283 if (lastcell.faces[0] != pl->face) 1292 if (lastcell.faces[0] != ob->face)
1284 { 1293 {
1285 lastcell.faces[0] = pl->face; 1294 lastcell.faces[0] = ob->face;
1286 1295
1287 mask |= 0x1;
1288 sl << uint16 (pl->face);
1289
1290 socket.send_faces (pl);
1291 }
1292 }
1293 /* Top face */
1294 else if (update_space (sl, socket, ms, lastcell, 0))
1295 mask |= 0x1; 1296 mask |= 0x1;
1297 sl << uint16 (ob->face);
1298
1299 socket.send_faces (ob);
1296 1300 }
1301 }
1302 /* Top face */
1303 else if (update_space (sl, socket, ms, lastcell, 0))
1304 mask |= 0x1;
1297 1305
1298 /* Check to see if we are in fact sending anything for this 1306 /* Check to see if we are in fact sending anything for this
1299 * space by checking the mask. If so, update the mask. 1307 * space by checking the mask. If so, update the mask.
1300 * if not, reset the len to that from before adding the mask 1308 * if not, reset the len to that from before adding the mask
1301 * value, so we don't send those bits. 1309 * value, so we don't send those bits.
1302 */ 1310 */
1303 if (mask & 0xf) 1311 if (mask & 0xf)
1304 sl[oldlen + 1] = mask & 0xff; 1312 sl[oldlen + 1] = mask & 0xff;
1305 else 1313 else
1306 sl.reset (oldlen); 1314 sl.reset (oldlen);
1307 1315
1308 if (socket.ext_mapinfos) 1316 if (socket.ext_mapinfos)
1309 esl << uint16 (emask); 1317 esl << uint16 (emask);
1310 1318
1311 if (socket.EMI_smooth) 1319 if (socket.EMI_smooth)
1320 {
1321 for (int layer = 2+1; layer--; )
1312 { 1322 {
1313 for (int layer = 2+1; layer--; )
1314 {
1315 object *ob = ms.faces_obj [layer]; 1323 object *ob = ms.faces_obj [layer];
1316 1324
1317 // If there is no object for this space, or if the face for the object 1325 // If there is no object for this space, or if the face for the object
1318 // is the blank face, set the smoothlevel to zero. 1326 // is the blank face, set the smoothlevel to zero.
1319 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; 1327 int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1320 1328
1321 // We've gotten what face we want to use for the object. Now see if 1329 // We've gotten what face we want to use for the object. Now see if
1322 // if it has changed since we last sent it to the client. 1330 // if it has changed since we last sent it to the client.
1323 if (lastcell.smooth[layer] != smoothlevel) 1331 if (lastcell.smooth[layer] != smoothlevel)
1324 { 1332 {
1325 lastcell.smooth[layer] = smoothlevel; 1333 lastcell.smooth[layer] = smoothlevel;
1326 esl << uint8 (smoothlevel); 1334 esl << uint8 (smoothlevel);
1327 emask |= 1 << layer; 1335 emask |= 1 << layer;
1328 }
1329 } 1336 }
1337 }
1330 1338
1331 if (emask & 0xf) 1339 if (emask & 0xf)
1332 esl[eoldlen + 1] = emask & 0xff; 1340 esl[eoldlen + 1] = emask & 0xff;
1333 else 1341 else
1334 esl.reset (eoldlen); 1342 esl.reset (eoldlen);
1335 } 1343 }
1336 } /* else this is a viewable space */ 1344 } /* else this is a viewable space */
1337 } /* for x loop */ 1345 ordered_mapwalk_end
1338 } /* for y loop */
1339 1346
1340 socket.flush_fx (); 1347 socket.flush_fx ();
1341 1348
1342 /* Verify that we in fact do need to send this */ 1349 /* Verify that we in fact do need to send this */
1343 if (socket.ext_mapinfos) 1350 if (socket.ext_mapinfos)
… …
1360 socket.send_packet (sl); 1367 socket.send_packet (sl);
1361 socket.sent_scroll = 0; 1368 socket.sent_scroll = 0;
1362 } 1369 }
1363} 1370}
1364 1371
1365/**
1366 * Draws client map.
1367 */
1368void
1369draw_client_map (object *pl)
1370{
1371 int i, j;
1372 sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1373 int mflags;
1374 struct Map newmap;
1375 maptile *m, *pm;
1376
1377 if (pl->type != PLAYER)
1378 {
1379 LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1380 return;
1381 }
1382
1383 pm = pl->map;
1384
1385 /* If player is just joining the game, he isn't here yet, so the map
1386 * can get swapped out. If so, don't try to send them a map. All will
1387 * be OK once they really log in.
1388 */
1389 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
1390 return;
1391
1392 memset (&newmap, 0, sizeof (struct Map));
1393
1394 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
1395 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
1396 {
1397 ax = i;
1398 ay = j;
1399 m = pm;
1400 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1401
1402 if (mflags & P_OUT_OF_MAP)
1403 continue;
1404
1405 /* If a map is visible to the player, we don't want to swap it out
1406 * just to reload it. This should really call something like
1407 * swap_map, but this is much more efficient and 'good enough'
1408 */
1409 if (mflags & P_NEW_MAP)
1410 m->timeout = 50;
1411 }
1412
1413 /* do LOS after calls to update_position */
1414 if (pl->contr->do_los)
1415 {
1416 update_los (pl);
1417 pl->contr->do_los = 0;
1418 }
1419
1420 /* Big maps need a different drawing mechanism to work */
1421 draw_client_map1 (pl);
1422}
1423
1424
1425/*****************************************************************************/ 1372/*****************************************************************************/
1426
1427/* GROS: The following one is used to allow a plugin to send a generic cmd to*/ 1373/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1428
1429/* a player. Of course, the client need to know the command to be able to */ 1374/* a player. Of course, the client need to know the command to be able to */
1430
1431/* manage it ! */ 1375/* manage it ! */
1432
1433/*****************************************************************************/ 1376/*****************************************************************************/
1434void 1377void
1435send_plugin_custom_message (object *pl, char *buf) 1378send_plugin_custom_message (object *pl, char *buf)
1436{ 1379{
1437 pl->contr->ns->send_packet (buf); 1380 pl->contr->ns->send_packet (buf);
… …
1446{ 1389{
1447 packet sl; 1390 packet sl;
1448 sl << "replyinfo skill_info\n"; 1391 sl << "replyinfo skill_info\n";
1449 1392
1450 for (int i = 1; i < NUM_SKILLS; i++) 1393 for (int i = 1; i < NUM_SKILLS; i++)
1451 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); 1394 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1452 1395
1453 if (sl.length () >= MAXSOCKBUF) 1396 if (sl.length () > MAXSOCKBUF)
1454 { 1397 {
1455 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 1398 LOG (llevError, "Buffer overflow in send_skill_info!\n");
1456 fatal (0); 1399 fatal (0);
1457 } 1400 }
1458 1401
… …
1471 sl << "replyinfo spell_paths\n"; 1414 sl << "replyinfo spell_paths\n";
1472 1415
1473 for (int i = 0; i < NRSPELLPATHS; i++) 1416 for (int i = 0; i < NRSPELLPATHS; i++)
1474 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); 1417 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1475 1418
1476 if (sl.length () >= MAXSOCKBUF) 1419 if (sl.length () > MAXSOCKBUF)
1477 { 1420 {
1478 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 1421 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1479 fatal (0); 1422 fatal (0);
1480 } 1423 }
1481 1424
… …
1500 if (spell->type == SPELL) 1443 if (spell->type == SPELL)
1501 { 1444 {
1502 int flags = 0; 1445 int flags = 0;
1503 1446
1504 /* check if we need to update it */ 1447 /* check if we need to update it */
1505 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) 1448 if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
1506 { 1449 {
1507 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1450 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1508 flags |= UPD_SP_MANA; 1451 flags |= UPD_SP_MANA;
1509 } 1452 }
1510 1453
1511 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) 1454 if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
1512 { 1455 {
1513 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1456 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1514 flags |= UPD_SP_GRACE; 1457 flags |= UPD_SP_GRACE;
1515 } 1458 }
1516 1459
1517 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) 1460 if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
1518 { 1461 {
1519 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1462 spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1520 flags |= UPD_SP_DAMAGE; 1463 flags |= UPD_SP_DAMAGE;
1521 } 1464 }
1522 1465
1523 if (flags) 1466 if (flags)
1524 { 1467 {
… …
1526 1469
1527 sl << "updspell " 1470 sl << "updspell "
1528 << uint8 (flags) 1471 << uint8 (flags)
1529 << uint32 (spell->count); 1472 << uint32 (spell->count);
1530 1473
1531 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 1474 if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1532 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 1475 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);
1533 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 1476 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);
1534 1477
1535 pl->ns->send_packet (sl); 1478 pl->ns->send_packet (sl);
1536 } 1479 }
1537 } 1480 }
1538 } 1481 }
… …
1568 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1511 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1569 return; 1512 return;
1570 } 1513 }
1571 1514
1572 /* store costs and damage in the object struct, to compare to later */ 1515 /* store costs and damage in the object struct, to compare to later */
1573 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 1516 spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1574 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 1517 spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1575 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 1518 spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1576 1519
1577 /* figure out which skill it uses, if it uses one */ 1520 /* figure out which skill it uses, if it uses one */
1578 if (spell->skill) 1521 if (spell->skill)
1579 { 1522 if (object *tmp = pl->find_skill (spell->skill))
1580 for (i = 1; i < NUM_SKILLS; i++)
1581 if (!strcmp (spell->skill, skill_names[i]))
1582 {
1583 skill = i + CS_STAT_SKILLINFO; 1523 skill = tmp->subtype + CS_STAT_SKILLINFO;
1584 break;
1585 }
1586 }
1587 1524
1588 // spells better have a face 1525 // spells better have a face
1589 if (!spell->face) 1526 if (!spell->face)
1590 { 1527 {
1591 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); 1528 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1592 spell->face = face_find ("burnout.x11", blank_face); 1529 spell->face = face_find ("burnout.x11", blank_face);
1593 } 1530 }
1531
1532 pl->ns->send_face (spell->face);
1594 1533
1595 /* send the current values */ 1534 /* send the current values */
1596 sl << uint32 (spell->count) 1535 sl << uint32 (spell->count)
1597 << uint16 (spell->level) 1536 << uint16 (spell->level)
1598 << uint16 (spell->casting_time) 1537 << uint16 (spell->casting_time)
1599 << uint16 (spell->last_sp) 1538 << uint16 (spell->cached_sp)
1600 << uint16 (spell->last_grace) 1539 << uint16 (spell->cached_grace)
1601 << uint16 (spell->last_eat) 1540 << uint16 (spell->cached_eat)
1602 << uint8 (skill) 1541 << uint8 (skill)
1603 << uint32 (spell->path_attuned) 1542 << uint32 (spell->path_attuned)
1604 << uint32 (spell->face) 1543 << uint32 (spell->face)
1605 << data8 (spell->name) 1544 << data8 (spell->name)
1606 << data16 (spell->msg); 1545 << data16 (spell->msg);
… …
1634 * bytes and 3 strings (because that is the spec) so we need to 1573 * bytes and 3 strings (because that is the spec) so we need to
1635 * check that the length of those 3 strings, plus the 23 bytes, 1574 * check that the length of those 3 strings, plus the 23 bytes,
1636 * won't take us over the length limit for the socket, if it does, 1575 * won't take us over the length limit for the socket, if it does,
1637 * we need to send what we already have, and restart packet formation 1576 * we need to send what we already have, and restart packet formation
1638 */ 1577 */
1578 if (spell->type != SPELL)
1579 continue;
1580
1639 /* Seeing crashes by overflowed buffers. Quick arithemetic seems 1581 /* Seeing crashes by overflowed buffers. Quick arithemetic seems
1640 * to show add_spell is 26 bytes + 2 strings. However, the overun 1582 * to show add_spell is 26 bytes + 2 strings. However, the overun
1641 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem 1583 * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem
1642 * like it will fix this 1584 * like it will fix this
1643 */ 1585 */
1644 if (spell->type != SPELL)
1645 continue;
1646
1647 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 1586 if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
1648 { 1587 {
1588 pl->ns->flush_fx ();
1649 pl->ns->send_packet (sl); 1589 pl->ns->send_packet (sl);
1650 1590
1651 sl.reset (); 1591 sl.reset ();
1652 sl << "addspell "; 1592 sl << "addspell ";
1653 } 1593 }
… …
1661 return; 1601 return;
1662 } 1602 }
1663 else 1603 else
1664 append_spell (pl, sl, spell); 1604 append_spell (pl, sl, spell);
1665 1605
1666 if (sl.length () >= MAXSOCKBUF) 1606 if (sl.length () > MAXSOCKBUF)
1667 { 1607 {
1668 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 1608 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
1669 fatal (0); 1609 fatal (0);
1670 } 1610 }
1671 1611
1672 /* finally, we can send the packet */ 1612 /* finally, we can send the packet */
1613 pl->ns->flush_fx ();
1673 pl->ns->send_packet (sl); 1614 pl->ns->send_packet (sl);
1674} 1615}
1675 1616

Diff Legend

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