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.45 by root, Tue Dec 19 04:58:05 2006 UTC vs.
Revision 1.164 by root, Fri Mar 26 00:59:22 2010 UTC

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

Diff Legend

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