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

Diff Legend

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