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.16 by root, Sun Sep 10 13:43:33 2006 UTC vs.
Revision 1.176 by root, Thu Apr 29 15:59:10 2010 UTC

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

Diff Legend

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