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