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