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