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

Diff Legend

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