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