1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel |
5 | * Copyright (©) 2001,2007 Mark Wedel |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT 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 3 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, |
… | |
… | |
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, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /** |
24 | /** |
25 | * \file |
25 | * \file |
26 | * Client handling. |
26 | * Client handling. |
… | |
… | |
98 | */ |
98 | */ |
99 | mx = ns->mapx; |
99 | mx = ns->mapx; |
100 | my = ns->mapy; |
100 | my = ns->mapy; |
101 | |
101 | |
102 | /* 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 |
103 | * (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, |
104 | * if the destination x or y coordinate is outside the viewable |
104 | * if the destination x or y coordinate is outside the viewable |
105 | * area, we clear the values - otherwise, the old values |
105 | * area, we clear the values - otherwise, the old values |
106 | * 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. |
107 | */ |
107 | */ |
108 | for (x = 0; x < mx; x++) |
108 | for (x = 0; x < mx; x++) |
109 | { |
|
|
110 | for (y = 0; y < my; y++) |
109 | for (y = 0; y < my; y++) |
111 | { |
|
|
112 | if (x >= ns->mapx || y >= ns->mapy) |
110 | if (x >= ns->mapx || y >= ns->mapy) |
113 | /* clear cells outside the viewable area */ |
111 | /* clear cells outside the viewable area */ |
114 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
112 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
115 | 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) |
116 | /* clear newly visible tiles within the viewable area */ |
114 | /* clear newly visible tiles within the viewable area */ |
117 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
115 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
118 | else |
116 | else |
119 | 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)); |
120 | } |
|
|
121 | } |
|
|
122 | |
118 | |
123 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
119 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
124 | |
120 | |
125 | /* 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 |
126 | * empty). |
122 | * empty). |
… | |
… | |
129 | } |
125 | } |
130 | |
126 | |
131 | static void |
127 | static void |
132 | clear_map (player *pl) |
128 | clear_map (player *pl) |
133 | { |
129 | { |
|
|
130 | pl->ns->mapinfo_queue_clear (); |
|
|
131 | |
134 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
132 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
135 | |
133 | |
136 | pl->ns->force_newmap = false; |
134 | pl->ns->force_newmap = false; |
137 | |
135 | |
138 | if (pl->ns->newmapcmd == 1) |
136 | if (pl->ns->newmapcmd == 1) |
139 | pl->ns->send_packet ("newmap"); |
137 | pl->ns->send_packet ("newmap"); |
140 | |
138 | |
141 | 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 | } |
142 | } |
166 | } |
143 | |
167 | |
144 | /** check for map/region change and send new map data */ |
168 | /** check for map/region change and send new map data */ |
145 | static void |
169 | static void |
146 | check_map_change (player *pl) |
170 | check_map_change (player *pl) |
147 | { |
171 | { |
148 | client &socket = *pl->ns; |
172 | client &socket = *pl->ns; |
149 | object *ob = pl->observe; |
173 | object *ob = pl->observe; |
150 | |
174 | |
|
|
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; |
|
|
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 | |
151 | if (socket.current_map != ob->map || socket.force_newmap) |
202 | if (socket.current_map != ob->map || socket.force_newmap) |
152 | { |
203 | { |
153 | clear_map (pl); |
204 | clear_map (pl); |
154 | socket.current_map = ob->map; |
205 | socket.current_map = ob->map; |
155 | |
206 | send_map_info (pl); |
156 | if (socket.mapinfocmd) |
|
|
157 | { |
|
|
158 | if (ob->map && ob->map->path[0]) |
|
|
159 | { |
|
|
160 | int flags = 0; |
|
|
161 | |
|
|
162 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
163 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
164 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
165 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
166 | |
|
|
167 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
168 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
169 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
170 | } |
|
|
171 | else |
|
|
172 | socket.send_packet ("mapinfo current"); |
|
|
173 | } |
|
|
174 | } |
207 | } |
175 | 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) |
176 | { |
209 | { |
177 | int dx = ob->x - socket.current_x; |
210 | int dx = ob->x - socket.current_x; |
178 | int dy = ob->y - socket.current_y; |
211 | int dy = ob->y - socket.current_y; |
… | |
… | |
186 | } |
219 | } |
187 | } |
220 | } |
188 | |
221 | |
189 | socket.current_x = ob->x; |
222 | socket.current_x = ob->x; |
190 | socket.current_y = ob->y; |
223 | socket.current_y = ob->y; |
191 | |
|
|
192 | region *reg = ob->region (); |
|
|
193 | if (socket.current_region != reg) |
|
|
194 | { |
|
|
195 | socket.current_region = reg; |
|
|
196 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
|
|
197 | } |
|
|
198 | } |
224 | } |
199 | |
225 | |
200 | /** |
226 | /** |
201 | * RequestInfo is sort of a meta command. There is some specific |
227 | * RequestInfo is sort of a meta command. There is some specific |
202 | * request of information, but we call other functions to provide |
228 | * request of information, but we call other functions to provide |
… | |
… | |
246 | { |
272 | { |
247 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
273 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
248 | } |
274 | } |
249 | |
275 | |
250 | void |
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; |
|
|
360 | } |
|
|
361 | |
|
|
362 | void |
251 | MapInfoCmd (char *buf, int len, player *pl) |
363 | MapInfoCmd (char *buf, int len, player *pl) |
252 | { |
364 | { |
253 | // <mapinfo tag spatial tile-path |
365 | // <mapinfo tag spatial tile-path |
254 | // >mapinfo tag spatial flags x y w h hash |
366 | // >mapinfo tag spatial flags x y w h hash |
255 | |
367 | |
256 | char bigbuf[MAX_BUF], *token; |
|
|
257 | |
|
|
258 | token = buf; |
368 | char *token = buf; |
259 | // copy token |
369 | |
260 | if (!(buf = strchr (buf, ' '))) |
370 | if (!(buf = strchr (buf, ' '))) |
261 | return; |
371 | return; |
262 | |
372 | |
263 | *buf++ = 0; |
|
|
264 | |
|
|
265 | if (!strncmp (buf, "spatial ", 8)) |
373 | if (!strncmp (buf, " spatial ", 9)) |
266 | { |
374 | { |
267 | buf += 8; |
375 | char *copy = strdup (token); |
|
|
376 | copy [buf - token] = 0; |
268 | |
377 | |
269 | // initial map and its origin |
378 | #if 0 |
270 | maptile *map = pl->ob->map; |
379 | // this makes only sense when we flush the buffer immediately |
271 | sint16 dx, dy; |
380 | if (pl->ns->mapinfo_try (copy)) |
272 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
381 | free (copy); |
273 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
|
|
274 | int max_distance = 8; // limit maximum path length to something generous |
|
|
275 | |
|
|
276 | while (*buf && map && max_distance) |
|
|
277 | { |
|
|
278 | int dir = *buf++; |
|
|
279 | |
|
|
280 | switch (dir) |
|
|
281 | { |
|
|
282 | case '1': |
|
|
283 | dx = 0; |
|
|
284 | dy = -1; |
|
|
285 | map = map->xy_find (dx, dy); |
|
|
286 | map && (mapy -= map->height); |
|
|
287 | break; |
|
|
288 | case '2': |
|
|
289 | mapx += map->width; |
|
|
290 | dx = map->width; |
|
|
291 | dy = 0; |
|
|
292 | map = map->xy_find (dx, dy); |
|
|
293 | break; |
|
|
294 | case '3': |
|
|
295 | mapy += map->height; |
|
|
296 | dx = 0; |
|
|
297 | dy = map->height; |
|
|
298 | map = map->xy_find (dx, dy); |
|
|
299 | break; |
|
|
300 | case '4': |
|
|
301 | dx = -1; |
|
|
302 | dy = 0; |
|
|
303 | map = map->xy_find (dx, dy); |
|
|
304 | map && (mapx -= map->width); |
|
|
305 | break; |
|
|
306 | } |
|
|
307 | |
|
|
308 | --max_distance; |
|
|
309 | } |
|
|
310 | |
|
|
311 | if (!max_distance) |
|
|
312 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
|
|
313 | else if (map && map->path[0]) |
|
|
314 | { |
|
|
315 | int flags = 0; |
|
|
316 | |
|
|
317 | if (map->tile_path[0]) flags |= 1; |
|
|
318 | if (map->tile_path[1]) flags |= 2; |
|
|
319 | if (map->tile_path[2]) flags |= 4; |
|
|
320 | if (map->tile_path[3]) flags |= 8; |
|
|
321 | |
|
|
322 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
323 | } |
|
|
324 | else |
382 | else |
325 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
383 | #endif |
|
|
384 | pl->ns->mapinfo_queue.push_back (copy); |
326 | } |
385 | } |
327 | else |
386 | else |
328 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
387 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
329 | |
|
|
330 | pl->ns->send_packet (bigbuf); |
|
|
331 | } |
388 | } |
332 | |
389 | |
333 | /** This is the Setup cmd */ |
390 | /** This is the Setup cmd */ |
334 | void |
391 | void |
335 | SetUp (char *buf, int len, client * ns) |
392 | SetUp (char *buf, int len, client * ns) |
… | |
… | |
653 | * syntax is: move (to) (tag) (nrof) |
710 | * syntax is: move (to) (tag) (nrof) |
654 | */ |
711 | */ |
655 | void |
712 | void |
656 | MoveCmd (char *buf, int len, player *pl) |
713 | MoveCmd (char *buf, int len, player *pl) |
657 | { |
714 | { |
658 | int vals[3], i; |
715 | int to, tag, nrof; |
659 | |
716 | |
660 | /* A little funky here. We only cycle for 2 records, because |
717 | if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
661 | * we obviously are not going to find a space after the third |
|
|
662 | * record. Perhaps we should just replace this with a |
|
|
663 | * sscanf? |
|
|
664 | */ |
|
|
665 | for (i = 0; i < 2; i++) |
|
|
666 | { |
718 | { |
667 | vals[i] = atoi (buf); |
|
|
668 | |
|
|
669 | if (!(buf = strchr (buf, ' '))) |
|
|
670 | { |
|
|
671 | LOG (llevError, "Incomplete move command: %s\n", buf); |
719 | LOG (llevError, "Incomplete move command: %s\n", buf); |
672 | return; |
720 | return; |
673 | } |
|
|
674 | |
|
|
675 | buf++; |
|
|
676 | } |
721 | } |
677 | |
722 | |
678 | vals[2] = atoi (buf); |
723 | esrv_move_object (pl->ob, to, tag, nrof); |
679 | |
|
|
680 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
|
|
681 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
|
|
682 | } |
724 | } |
683 | |
725 | |
684 | /****************************************************************************** |
726 | /****************************************************************************** |
685 | * |
727 | * |
686 | * Start of commands the server sends to the client. |
728 | * Start of commands the server sends to the client. |
… | |
… | |
787 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
829 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
788 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
830 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
789 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
831 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
790 | |
832 | |
791 | for (int s = 0; s < NUM_SKILLS; s++) |
833 | for (int s = 0; s < NUM_SKILLS; s++) |
792 | if (object *skill = opl->last_skill_ob[s]) |
834 | if (object *skill = opl->last_skill_ob [s]) |
793 | if (skill->stats.exp != ns->last_skill_exp [s]) |
835 | if (skill->stats.exp != ns->last_skill_exp [s]) |
794 | { |
836 | { |
795 | ns->last_skill_exp [s] = skill->stats.exp; |
837 | ns->last_skill_exp [s] = skill->stats.exp; |
796 | |
838 | |
797 | /* Always send along the level if exp changes. This is only |
839 | /* Always send along the level if exp changes. This is only |
… | |
… | |
853 | |
895 | |
854 | /** |
896 | /** |
855 | * Tells the client that here is a player it should start using. |
897 | * Tells the client that here is a player it should start using. |
856 | */ |
898 | */ |
857 | void |
899 | void |
858 | esrv_new_player (player *pl, uint32 weight) |
900 | esrv_new_player (player *pl) |
859 | { |
901 | { |
|
|
902 | sint32 weight = pl->ob->client_weight (); |
|
|
903 | |
860 | packet sl ("player"); |
904 | packet sl ("player"); |
861 | |
905 | |
862 | sl << uint32 (pl->ob->count) |
906 | sl << uint32 (pl->ob->count) |
863 | << uint32 (weight) |
907 | << uint32 (weight) |
864 | << uint32 (pl->ob->face) |
908 | << uint32 (pl->ob->face) |
865 | << data8 (pl->ob->name); |
909 | << data8 (pl->ob->name); |
866 | |
910 | |
867 | pl->ns->last_weight = weight; |
911 | pl->ns->last_weight = weight; |
868 | pl->ns->send_packet (sl); |
912 | pl->ns->send_packet (sl); |
869 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
|
|
870 | } |
913 | } |
871 | |
914 | |
872 | /****************************************************************************** |
915 | /****************************************************************************** |
873 | * |
916 | * |
874 | * Start of map related commands. |
917 | * Start of map related commands. |
… | |
… | |
931 | |
974 | |
932 | if (!ns.faces_sent[face_num]) |
975 | if (!ns.faces_sent[face_num]) |
933 | if (ob) |
976 | if (ob) |
934 | ns.send_faces (ob); |
977 | ns.send_faces (ob); |
935 | else |
978 | else |
936 | ns.send_face (face_num); |
979 | ns.send_face (face_num, 10); |
937 | |
980 | |
938 | sl << uint16 (face_num); |
981 | sl << uint16 (face_num); |
939 | return 1; |
982 | return 1; |
940 | } |
983 | } |
941 | |
984 | |
… | |
… | |
992 | { |
1035 | { |
993 | object *ob = pl->observe; |
1036 | object *ob = pl->observe; |
994 | if (!ob->active) |
1037 | if (!ob->active) |
995 | return; |
1038 | return; |
996 | |
1039 | |
997 | maptile *plmap = ob->map; |
|
|
998 | |
|
|
999 | /* If player is just joining the game, he isn't here yet, so the map |
1040 | /* If player is just joining the game, he isn't here yet, so the map |
1000 | * can get swapped out. If so, don't try to send them a map. All will |
1041 | * can get swapped out. If so, don't try to send them a map. All will |
1001 | * be OK once they really log in. |
1042 | * be OK once they really log in. |
1002 | */ |
1043 | */ |
1003 | if (!plmap || plmap->in_memory != MAP_IN_MEMORY) |
1044 | if (!ob->map || ob->map->in_memory != MAP_ACTIVE) |
1004 | return; |
1045 | return; |
1005 | |
1046 | |
1006 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1047 | int startlen, oldlen; |
1007 | int estartlen, eoldlen; |
1048 | int estartlen, eoldlen; |
1008 | uint8 eentrysize; |
1049 | uint8 eentrysize; |
1009 | uint16 ewhatstart, ewhatflag; |
1050 | uint16 ewhatstart, ewhatflag; |
1010 | uint8 extendedinfos; |
1051 | uint8 extendedinfos; |
1011 | |
1052 | |
1012 | check_map_change (pl); |
1053 | check_map_change (pl); |
1013 | prefetch_surrounding_maps (pl->ob); |
1054 | prefetch_surrounding_maps (pl->ob); |
1014 | |
1055 | |
1015 | /* do LOS after calls to update_position */ |
1056 | /* do LOS after calls to update_position */ |
1016 | if (ob != pl->ob) |
1057 | /* unfortunately, we need to udpate los when observing, currently */ |
1017 | clear_los (pl); |
1058 | if (pl->do_los || pl->observe != pl->ob) |
1018 | else if (pl->do_los) |
|
|
1019 | { |
1059 | { |
1020 | update_los (ob); |
|
|
1021 | pl->do_los = 0; |
1060 | pl->do_los = 0; |
|
|
1061 | pl->update_los (); |
1022 | } |
1062 | } |
1023 | |
1063 | |
1024 | /** |
1064 | /** |
1025 | * This function uses the new map1 protocol command to send the map |
1065 | * This function uses the new map1 protocol command to send the map |
1026 | * to the client. It is necessary because the old map command supports |
1066 | * to the client. It is necessary because the old map command supports |
… | |
… | |
1068 | << uint8 (eentrysize); |
1108 | << uint8 (eentrysize); |
1069 | |
1109 | |
1070 | estartlen = esl.length (); |
1110 | estartlen = esl.length (); |
1071 | } |
1111 | } |
1072 | |
1112 | |
1073 | /* x,y are the real map locations. ax, ay are viewport relative |
1113 | int hx = socket.mapx / 2; |
1074 | * locations. |
1114 | int hy = socket.mapy / 2; |
1075 | */ |
|
|
1076 | ay = 0; |
|
|
1077 | |
1115 | |
1078 | /* We could do this logic as conditionals in the if statement, |
1116 | ordered_mapwalk_begin (ob, -hx, -hy, hx, hy) |
1079 | * but that started to get a bit messy to look at. |
1117 | int ax = dx + hx; |
1080 | */ |
1118 | int ay = dy + hy; |
1081 | max_x = ob->x + (socket.mapx + 1) / 2; |
|
|
1082 | max_y = ob->y + (socket.mapy + 1) / 2; |
|
|
1083 | |
1119 | |
1084 | for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++) |
|
|
1085 | { |
|
|
1086 | sint16 nx, ny; |
|
|
1087 | maptile *m = 0; |
|
|
1088 | |
|
|
1089 | ax = 0; |
|
|
1090 | for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++) |
|
|
1091 | { |
|
|
1092 | // check to see if we can simply go one right quickly |
|
|
1093 | ++nx; |
|
|
1094 | if (m && nx >= m->width) |
|
|
1095 | m = 0; |
|
|
1096 | |
|
|
1097 | if (!m) |
|
|
1098 | { |
|
|
1099 | nx = x; ny = y; m = plmap; |
|
|
1100 | |
|
|
1101 | if (!xy_normalise (m, nx, ny)) |
|
|
1102 | m = 0; |
|
|
1103 | } |
|
|
1104 | |
|
|
1105 | int emask, mask; |
1120 | int emask, mask; |
1106 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1121 | emask = mask = (ax << 10) | (ay << 4); |
1107 | |
1122 | |
1108 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1123 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1109 | |
1124 | |
1110 | /* If the coordinates are not valid, or it is too dark to see, |
1125 | /* If the coordinates are not valid, or it is too dark to see, |
1111 | * we tell the client as such |
1126 | * we tell the client as such |
1112 | */ |
1127 | */ |
1113 | if (!m) |
1128 | if (!m) |
1114 | { |
1129 | { |
1115 | /* space is out of map. Update space and clear values |
1130 | /* space is out of map. Update space and clear values |
1116 | * if this hasn't already been done. If the space is out |
1131 | * if this hasn't already been done. If the space is out |
1117 | * of the map, it shouldn't have a head |
1132 | * of the map, it shouldn't have a head. |
1118 | */ |
1133 | */ |
1119 | if (lastcell.count != -1) |
1134 | if (lastcell.count != -1) |
|
|
1135 | { |
|
|
1136 | sl << uint16 (mask); |
|
|
1137 | map_clearcell (&lastcell, -1); |
|
|
1138 | } |
|
|
1139 | |
|
|
1140 | continue; |
|
|
1141 | } |
|
|
1142 | |
|
|
1143 | int d = pl->blocked_los_uc (dx, dy); |
|
|
1144 | |
|
|
1145 | if (d > 3) |
|
|
1146 | { |
|
|
1147 | /* This block deals with spaces that are not visible for whatever |
|
|
1148 | * reason. Still may need to send the head for this space. |
|
|
1149 | */ |
|
|
1150 | if (lastcell.count != -1 |
|
|
1151 | || lastcell.faces[0] |
|
|
1152 | || lastcell.faces[1] |
|
|
1153 | || lastcell.faces[2] |
|
|
1154 | || lastcell.stat_hp |
|
|
1155 | || lastcell.flags |
|
|
1156 | || lastcell.player) |
|
|
1157 | sl << uint16 (mask); |
|
|
1158 | |
|
|
1159 | /* properly clear a previously sent big face */ |
|
|
1160 | map_clearcell (&lastcell, -1); |
|
|
1161 | } |
|
|
1162 | else |
|
|
1163 | { |
|
|
1164 | /* In this block, the space is visible. |
|
|
1165 | */ |
|
|
1166 | |
|
|
1167 | /* Rather than try to figure out what everything that we might |
|
|
1168 | * need to send is, then form the packet after that, |
|
|
1169 | * we presume that we will in fact form a packet, and update |
|
|
1170 | * the bits by what we do actually send. If we send nothing, |
|
|
1171 | * we just back out sl.length () to the old value, and no harm |
|
|
1172 | * is done. |
|
|
1173 | * I think this is simpler than doing a bunch of checks to see |
|
|
1174 | * what if anything we need to send, setting the bits, then |
|
|
1175 | * doing those checks again to add the real data. |
|
|
1176 | */ |
|
|
1177 | oldlen = sl.length (); |
|
|
1178 | eoldlen = esl.length (); |
|
|
1179 | |
|
|
1180 | sl << uint16 (mask); |
|
|
1181 | |
|
|
1182 | unsigned char dummy; |
|
|
1183 | unsigned char *last_ext = &dummy; |
|
|
1184 | |
|
|
1185 | /* Darkness changed */ |
|
|
1186 | if (lastcell.count != d && socket.darkness) |
|
|
1187 | { |
|
|
1188 | mask |= 0x8; |
|
|
1189 | |
|
|
1190 | if (socket.extmap) |
|
|
1191 | { |
|
|
1192 | *last_ext |= 0x80; |
|
|
1193 | last_ext = &sl[sl.length ()]; |
|
|
1194 | sl << uint8 (d); |
|
|
1195 | } |
|
|
1196 | else |
|
|
1197 | sl << uint8 (255 - 64 * d); |
|
|
1198 | } |
|
|
1199 | |
|
|
1200 | lastcell.count = d; |
|
|
1201 | |
|
|
1202 | mapspace &ms = m->at (nx, ny); |
|
|
1203 | ms.update (); |
|
|
1204 | |
|
|
1205 | if (expect_true (socket.extmap)) |
|
|
1206 | { |
|
|
1207 | uint8 stat_hp = 0; |
|
|
1208 | uint8 stat_width = 0; |
|
|
1209 | uint8 flags = 0; |
|
|
1210 | tag_t player = 0; |
|
|
1211 | |
|
|
1212 | // send hp information, if applicable |
|
|
1213 | if (object *op = ms.faces_obj [0]) |
|
|
1214 | if (op->is_head () && !op->invisible) |
1120 | { |
1215 | { |
1121 | sl << uint16 (mask); |
1216 | if (op->stats.maxhp > op->stats.hp |
1122 | map_clearcell (&lastcell, -1); |
1217 | && op->stats.maxhp > 0 |
|
|
1218 | && (op->type == PLAYER |
|
|
1219 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1220 | || QUERY_FLAG (op, FLAG_MONSTER) |
|
|
1221 | || QUERY_FLAG (op, FLAG_ALIVE) |
|
|
1222 | || QUERY_FLAG (op, FLAG_GENERATOR))) |
|
|
1223 | { |
|
|
1224 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1225 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1226 | } |
|
|
1227 | |
|
|
1228 | if (expect_false (op->has_dialogue ())) |
|
|
1229 | flags |= 1; |
|
|
1230 | |
|
|
1231 | if (expect_false (op->type == PLAYER)) |
|
|
1232 | player = op == ob ? pl->ob->count |
|
|
1233 | : op == pl->ob ? ob->count |
|
|
1234 | : op->count; |
1123 | } |
1235 | } |
1124 | |
1236 | |
1125 | continue; |
1237 | if (expect_false (lastcell.stat_hp != stat_hp)) |
1126 | } |
|
|
1127 | |
|
|
1128 | m->touch (); |
|
|
1129 | |
|
|
1130 | int d = pl->blocked_los[ax][ay]; |
|
|
1131 | |
|
|
1132 | if (d > 3) |
|
|
1133 | { |
|
|
1134 | |
|
|
1135 | int need_send = 0, count; |
|
|
1136 | |
|
|
1137 | /* This block deals with spaces that are not visible for whatever |
|
|
1138 | * reason. Still may need to send the head for this space. |
|
|
1139 | */ |
|
|
1140 | |
|
|
1141 | oldlen = sl.length (); |
|
|
1142 | |
|
|
1143 | sl << uint16 (mask); |
|
|
1144 | |
|
|
1145 | if (lastcell.count != -1) |
|
|
1146 | need_send = 1; |
|
|
1147 | |
|
|
1148 | count = -1; |
|
|
1149 | |
|
|
1150 | /* properly clear a previously sent big face */ |
|
|
1151 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
|
|
1152 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
|
|
1153 | need_send = 1; |
|
|
1154 | |
|
|
1155 | map_clearcell (&lastcell, count); |
|
|
1156 | |
|
|
1157 | if ((mask & 0xf) || need_send) |
|
|
1158 | sl[oldlen + 1] = mask & 0xff; |
|
|
1159 | else |
|
|
1160 | sl.reset (oldlen); |
|
|
1161 | } |
|
|
1162 | else |
|
|
1163 | { |
|
|
1164 | /* In this block, the space is visible. |
|
|
1165 | */ |
|
|
1166 | |
|
|
1167 | /* Rather than try to figure out what everything that we might |
|
|
1168 | * need to send is, then form the packet after that, |
|
|
1169 | * we presume that we will in fact form a packet, and update |
|
|
1170 | * the bits by what we do actually send. If we send nothing, |
|
|
1171 | * we just back out sl.length () to the old value, and no harm |
|
|
1172 | * is done. |
|
|
1173 | * I think this is simpler than doing a bunch of checks to see |
|
|
1174 | * what if anything we need to send, setting the bits, then |
|
|
1175 | * doing those checks again to add the real data. |
|
|
1176 | */ |
|
|
1177 | oldlen = sl.length (); |
|
|
1178 | eoldlen = esl.length (); |
|
|
1179 | |
|
|
1180 | sl << uint16 (mask); |
|
|
1181 | |
|
|
1182 | unsigned char dummy; |
|
|
1183 | unsigned char *last_ext = &dummy; |
|
|
1184 | |
|
|
1185 | /* Darkness changed */ |
|
|
1186 | if (lastcell.count != d && socket.darkness) |
|
|
1187 | { |
1238 | { |
|
|
1239 | lastcell.stat_hp = stat_hp; |
|
|
1240 | |
1188 | mask |= 0x8; |
1241 | mask |= 0x8; |
|
|
1242 | *last_ext |= 0x80; |
|
|
1243 | last_ext = &sl[sl.length ()]; |
1189 | |
1244 | |
1190 | if (socket.extmap) |
1245 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1246 | |
|
|
1247 | if (stat_width > 1) |
1191 | { |
1248 | { |
1192 | *last_ext |= 0x80; |
1249 | *last_ext |= 0x80; |
1193 | last_ext = &sl[sl.length ()]; |
1250 | last_ext = &sl[sl.length ()]; |
1194 | sl << uint8 (d); |
|
|
1195 | } |
|
|
1196 | else |
|
|
1197 | sl << uint8 (255 - 64 * d); |
|
|
1198 | } |
|
|
1199 | |
1251 | |
1200 | lastcell.count = d; |
|
|
1201 | |
|
|
1202 | mapspace &ms = m->at (nx, ny); |
|
|
1203 | ms.update (); |
|
|
1204 | |
|
|
1205 | if (socket.extmap) |
|
|
1206 | { |
|
|
1207 | uint8 stat_hp = 0; |
|
|
1208 | uint8 stat_width = 0; |
|
|
1209 | uint8 flags = 0; |
|
|
1210 | tag_t player = 0; |
|
|
1211 | |
|
|
1212 | // send hp information, if applicable |
|
|
1213 | if (object *op = ms.faces_obj [0]) |
|
|
1214 | { |
|
|
1215 | if (op->head || op->invisible) |
|
|
1216 | ; // do not show |
|
|
1217 | else if (op->type == PLAYER |
|
|
1218 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
|
|
1219 | { |
|
|
1220 | if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
|
|
1221 | { |
|
|
1222 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1223 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1224 | } |
|
|
1225 | } |
|
|
1226 | |
|
|
1227 | if (op->msg && op->msg[0] == '@') |
|
|
1228 | flags |= 1; |
|
|
1229 | |
|
|
1230 | if (op->type == PLAYER && op != ob) |
|
|
1231 | player = op->count; |
|
|
1232 | } |
|
|
1233 | |
|
|
1234 | if (lastcell.stat_hp != stat_hp) |
|
|
1235 | { |
|
|
1236 | lastcell.stat_hp = stat_hp; |
|
|
1237 | |
|
|
1238 | mask |= 0x8; |
|
|
1239 | *last_ext |= 0x80; |
|
|
1240 | last_ext = &sl[sl.length ()]; |
|
|
1241 | |
|
|
1242 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1243 | |
|
|
1244 | if (stat_width > 1) |
|
|
1245 | { |
|
|
1246 | *last_ext |= 0x80; |
|
|
1247 | last_ext = &sl[sl.length ()]; |
|
|
1248 | |
|
|
1249 | sl << uint8 (6) << uint8 (stat_width); |
1252 | sl << uint8 (6) << uint8 (stat_width); |
1250 | } |
|
|
1251 | } |
1253 | } |
1252 | |
|
|
1253 | if (lastcell.player != player) |
|
|
1254 | { |
|
|
1255 | lastcell.player = player; |
|
|
1256 | |
|
|
1257 | mask |= 0x8; |
|
|
1258 | *last_ext |= 0x80; |
|
|
1259 | last_ext = &sl[sl.length ()]; |
|
|
1260 | |
|
|
1261 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1262 | } |
|
|
1263 | |
|
|
1264 | if (lastcell.flags != flags) |
|
|
1265 | { |
|
|
1266 | lastcell.flags = flags; |
|
|
1267 | |
|
|
1268 | mask |= 0x8; |
|
|
1269 | *last_ext |= 0x80; |
|
|
1270 | last_ext = &sl[sl.length ()]; |
|
|
1271 | |
|
|
1272 | sl << uint8 (8) << uint8 (flags); |
|
|
1273 | } |
|
|
1274 | } |
1254 | } |
1275 | |
1255 | |
1276 | /* Floor face */ |
1256 | if (expect_false (lastcell.player != player)) |
1277 | if (update_space (sl, socket, ms, lastcell, 2)) |
1257 | { |
|
|
1258 | lastcell.player = player; |
|
|
1259 | |
1278 | mask |= 0x4; |
1260 | mask |= 0x8; |
|
|
1261 | *last_ext |= 0x80; |
|
|
1262 | last_ext = &sl[sl.length ()]; |
1279 | |
1263 | |
1280 | /* Middle face */ |
1264 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1281 | if (update_space (sl, socket, ms, lastcell, 1)) |
1265 | } |
|
|
1266 | |
|
|
1267 | if (expect_false (lastcell.flags != flags)) |
|
|
1268 | { |
|
|
1269 | lastcell.flags = flags; |
|
|
1270 | |
1282 | mask |= 0x2; |
1271 | mask |= 0x8; |
|
|
1272 | *last_ext |= 0x80; |
|
|
1273 | last_ext = &sl[sl.length ()]; |
1283 | |
1274 | |
1284 | if (ms.player () == ob |
1275 | sl << uint8 (8) << uint8 (flags); |
1285 | && (ob->invisible & (ob->invisible < 50 ? 1 : 7))) |
|
|
1286 | { |
1276 | } |
|
|
1277 | } |
|
|
1278 | |
|
|
1279 | /* Floor face */ |
|
|
1280 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1281 | mask |= 0x4; |
|
|
1282 | |
|
|
1283 | /* Middle face */ |
|
|
1284 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1285 | mask |= 0x2; |
|
|
1286 | |
|
|
1287 | if (expect_false (ob->invisible) |
|
|
1288 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
|
|
1289 | && ms.player () == ob) |
|
|
1290 | { |
1287 | // force player to be visible to himself if invisible |
1291 | // force player to be visible to himself if invisible |
1288 | if (lastcell.faces[0] != ob->face) |
1292 | if (lastcell.faces[0] != ob->face) |
1289 | { |
1293 | { |
1290 | lastcell.faces[0] = ob->face; |
1294 | lastcell.faces[0] = ob->face; |
1291 | |
1295 | |
1292 | mask |= 0x1; |
|
|
1293 | sl << uint16 (ob->face); |
|
|
1294 | |
|
|
1295 | socket.send_faces (ob); |
|
|
1296 | } |
|
|
1297 | } |
|
|
1298 | /* Top face */ |
|
|
1299 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1300 | mask |= 0x1; |
1296 | mask |= 0x1; |
|
|
1297 | sl << uint16 (ob->face); |
1301 | |
1298 | |
|
|
1299 | socket.send_faces (ob); |
|
|
1300 | } |
|
|
1301 | } |
|
|
1302 | /* Top face */ |
|
|
1303 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1304 | mask |= 0x1; |
|
|
1305 | |
1302 | /* Check to see if we are in fact sending anything for this |
1306 | /* Check to see if we are in fact sending anything for this |
1303 | * space by checking the mask. If so, update the mask. |
1307 | * space by checking the mask. If so, update the mask. |
1304 | * if not, reset the len to that from before adding the mask |
1308 | * if not, reset the len to that from before adding the mask |
1305 | * value, so we don't send those bits. |
1309 | * value, so we don't send those bits. |
1306 | */ |
1310 | */ |
1307 | if (mask & 0xf) |
1311 | if (mask & 0xf) |
1308 | sl[oldlen + 1] = mask & 0xff; |
1312 | sl[oldlen + 1] = mask & 0xff; |
1309 | else |
1313 | else |
1310 | sl.reset (oldlen); |
1314 | sl.reset (oldlen); |
1311 | |
1315 | |
1312 | if (socket.ext_mapinfos) |
1316 | if (socket.ext_mapinfos) |
1313 | esl << uint16 (emask); |
1317 | esl << uint16 (emask); |
1314 | |
1318 | |
1315 | if (socket.EMI_smooth) |
1319 | if (socket.EMI_smooth) |
|
|
1320 | { |
|
|
1321 | for (int layer = 2+1; layer--; ) |
1316 | { |
1322 | { |
1317 | for (int layer = 2+1; layer--; ) |
|
|
1318 | { |
|
|
1319 | object *ob = ms.faces_obj [layer]; |
1323 | object *ob = ms.faces_obj [layer]; |
1320 | |
1324 | |
1321 | // If there is no object for this space, or if the face for the object |
1325 | // If there is no object for this space, or if the face for the object |
1322 | // is the blank face, set the smoothlevel to zero. |
1326 | // is the blank face, set the smoothlevel to zero. |
1323 | int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
1327 | int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
1324 | |
1328 | |
1325 | // We've gotten what face we want to use for the object. Now see if |
1329 | // We've gotten what face we want to use for the object. Now see if |
1326 | // if it has changed since we last sent it to the client. |
1330 | // if it has changed since we last sent it to the client. |
1327 | if (lastcell.smooth[layer] != smoothlevel) |
1331 | if (lastcell.smooth[layer] != smoothlevel) |
1328 | { |
1332 | { |
1329 | lastcell.smooth[layer] = smoothlevel; |
1333 | lastcell.smooth[layer] = smoothlevel; |
1330 | esl << uint8 (smoothlevel); |
1334 | esl << uint8 (smoothlevel); |
1331 | emask |= 1 << layer; |
1335 | emask |= 1 << layer; |
1332 | } |
|
|
1333 | } |
1336 | } |
|
|
1337 | } |
1334 | |
1338 | |
1335 | if (emask & 0xf) |
1339 | if (emask & 0xf) |
1336 | esl[eoldlen + 1] = emask & 0xff; |
1340 | esl[eoldlen + 1] = emask & 0xff; |
1337 | else |
1341 | else |
1338 | esl.reset (eoldlen); |
1342 | esl.reset (eoldlen); |
1339 | } |
1343 | } |
1340 | } /* else this is a viewable space */ |
1344 | } /* else this is a viewable space */ |
1341 | } /* for x loop */ |
1345 | ordered_mapwalk_end |
1342 | } /* for y loop */ |
|
|
1343 | |
1346 | |
1344 | socket.flush_fx (); |
1347 | socket.flush_fx (); |
1345 | |
1348 | |
1346 | /* Verify that we in fact do need to send this */ |
1349 | /* Verify that we in fact do need to send this */ |
1347 | if (socket.ext_mapinfos) |
1350 | if (socket.ext_mapinfos) |
… | |
… | |
1386 | { |
1389 | { |
1387 | packet sl; |
1390 | packet sl; |
1388 | sl << "replyinfo skill_info\n"; |
1391 | sl << "replyinfo skill_info\n"; |
1389 | |
1392 | |
1390 | for (int i = 1; i < NUM_SKILLS; i++) |
1393 | for (int i = 1; i < NUM_SKILLS; i++) |
1391 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
1394 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]); |
1392 | |
1395 | |
1393 | if (sl.length () >= MAXSOCKBUF) |
1396 | if (sl.length () > MAXSOCKBUF) |
1394 | { |
1397 | { |
1395 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1398 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1396 | fatal (0); |
1399 | fatal (0); |
1397 | } |
1400 | } |
1398 | |
1401 | |
… | |
… | |
1411 | sl << "replyinfo spell_paths\n"; |
1414 | sl << "replyinfo spell_paths\n"; |
1412 | |
1415 | |
1413 | for (int i = 0; i < NRSPELLPATHS; i++) |
1416 | for (int i = 0; i < NRSPELLPATHS; i++) |
1414 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1417 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
1415 | |
1418 | |
1416 | if (sl.length () >= MAXSOCKBUF) |
1419 | if (sl.length () > MAXSOCKBUF) |
1417 | { |
1420 | { |
1418 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1421 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
1419 | fatal (0); |
1422 | fatal (0); |
1420 | } |
1423 | } |
1421 | |
1424 | |
… | |
… | |
1440 | if (spell->type == SPELL) |
1443 | if (spell->type == SPELL) |
1441 | { |
1444 | { |
1442 | int flags = 0; |
1445 | int flags = 0; |
1443 | |
1446 | |
1444 | /* check if we need to update it */ |
1447 | /* check if we need to update it */ |
1445 | if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1448 | if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1446 | { |
1449 | { |
1447 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1450 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1448 | flags |= UPD_SP_MANA; |
1451 | flags |= UPD_SP_MANA; |
1449 | } |
1452 | } |
1450 | |
1453 | |
1451 | if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1454 | if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1452 | { |
1455 | { |
1453 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1456 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1454 | flags |= UPD_SP_GRACE; |
1457 | flags |= UPD_SP_GRACE; |
1455 | } |
1458 | } |
1456 | |
1459 | |
1457 | if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1460 | if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1458 | { |
1461 | { |
1459 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1462 | spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1460 | flags |= UPD_SP_DAMAGE; |
1463 | flags |= UPD_SP_DAMAGE; |
1461 | } |
1464 | } |
1462 | |
1465 | |
1463 | if (flags) |
1466 | if (flags) |
1464 | { |
1467 | { |
… | |
… | |
1466 | |
1469 | |
1467 | sl << "updspell " |
1470 | sl << "updspell " |
1468 | << uint8 (flags) |
1471 | << uint8 (flags) |
1469 | << uint32 (spell->count); |
1472 | << uint32 (spell->count); |
1470 | |
1473 | |
1471 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1474 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
1472 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1475 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace); |
1473 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1476 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat); |
1474 | |
1477 | |
1475 | pl->ns->send_packet (sl); |
1478 | pl->ns->send_packet (sl); |
1476 | } |
1479 | } |
1477 | } |
1480 | } |
1478 | } |
1481 | } |
… | |
… | |
1508 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1511 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1509 | return; |
1512 | return; |
1510 | } |
1513 | } |
1511 | |
1514 | |
1512 | /* store costs and damage in the object struct, to compare to later */ |
1515 | /* store costs and damage in the object struct, to compare to later */ |
1513 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1516 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1514 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1517 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1515 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1518 | spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1516 | |
1519 | |
1517 | /* figure out which skill it uses, if it uses one */ |
1520 | /* figure out which skill it uses, if it uses one */ |
1518 | if (spell->skill) |
1521 | if (spell->skill) |
1519 | { |
1522 | if (object *tmp = pl->find_skill (spell->skill)) |
1520 | for (i = 1; i < NUM_SKILLS; i++) |
|
|
1521 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1522 | { |
|
|
1523 | skill = i + CS_STAT_SKILLINFO; |
1523 | skill = tmp->subtype + CS_STAT_SKILLINFO; |
1524 | break; |
|
|
1525 | } |
|
|
1526 | } |
|
|
1527 | |
1524 | |
1528 | // spells better have a face |
1525 | // spells better have a face |
1529 | if (!spell->face) |
1526 | if (!spell->face) |
1530 | { |
1527 | { |
1531 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1528 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1532 | spell->face = face_find ("burnout.x11", blank_face); |
1529 | spell->face = face_find ("burnout.x11", blank_face); |
1533 | } |
1530 | } |
|
|
1531 | |
|
|
1532 | pl->ns->send_face (spell->face); |
1534 | |
1533 | |
1535 | /* send the current values */ |
1534 | /* send the current values */ |
1536 | sl << uint32 (spell->count) |
1535 | sl << uint32 (spell->count) |
1537 | << uint16 (spell->level) |
1536 | << uint16 (spell->level) |
1538 | << uint16 (spell->casting_time) |
1537 | << uint16 (spell->casting_time) |
1539 | << uint16 (spell->last_sp) |
1538 | << uint16 (spell->cached_sp) |
1540 | << uint16 (spell->last_grace) |
1539 | << uint16 (spell->cached_grace) |
1541 | << uint16 (spell->last_eat) |
1540 | << uint16 (spell->cached_eat) |
1542 | << uint8 (skill) |
1541 | << uint8 (skill) |
1543 | << uint32 (spell->path_attuned) |
1542 | << uint32 (spell->path_attuned) |
1544 | << uint32 (spell->face) |
1543 | << uint32 (spell->face) |
1545 | << data8 (spell->name) |
1544 | << data8 (spell->name) |
1546 | << data16 (spell->msg); |
1545 | << data16 (spell->msg); |
… | |
… | |
1574 | * bytes and 3 strings (because that is the spec) so we need to |
1573 | * bytes and 3 strings (because that is the spec) so we need to |
1575 | * check that the length of those 3 strings, plus the 23 bytes, |
1574 | * check that the length of those 3 strings, plus the 23 bytes, |
1576 | * won't take us over the length limit for the socket, if it does, |
1575 | * won't take us over the length limit for the socket, if it does, |
1577 | * we need to send what we already have, and restart packet formation |
1576 | * we need to send what we already have, and restart packet formation |
1578 | */ |
1577 | */ |
|
|
1578 | if (spell->type != SPELL) |
|
|
1579 | continue; |
|
|
1580 | |
1579 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1581 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1580 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1582 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1581 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1583 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1582 | * like it will fix this |
1584 | * like it will fix this |
1583 | */ |
1585 | */ |
1584 | if (spell->type != SPELL) |
|
|
1585 | continue; |
|
|
1586 | |
|
|
1587 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1586 | if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1588 | { |
1587 | { |
|
|
1588 | pl->ns->flush_fx (); |
1589 | pl->ns->send_packet (sl); |
1589 | pl->ns->send_packet (sl); |
1590 | |
1590 | |
1591 | sl.reset (); |
1591 | sl.reset (); |
1592 | sl << "addspell "; |
1592 | sl << "addspell "; |
1593 | } |
1593 | } |
… | |
… | |
1601 | return; |
1601 | return; |
1602 | } |
1602 | } |
1603 | else |
1603 | else |
1604 | append_spell (pl, sl, spell); |
1604 | append_spell (pl, sl, spell); |
1605 | |
1605 | |
1606 | if (sl.length () >= MAXSOCKBUF) |
1606 | if (sl.length () > MAXSOCKBUF) |
1607 | { |
1607 | { |
1608 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1608 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1609 | fatal (0); |
1609 | fatal (0); |
1610 | } |
1610 | } |
1611 | |
1611 | |
1612 | /* finally, we can send the packet */ |
1612 | /* finally, we can send the packet */ |
|
|
1613 | pl->ns->flush_fx (); |
1613 | pl->ns->send_packet (sl); |
1614 | pl->ns->send_packet (sl); |
1614 | } |
1615 | } |
1615 | |
1616 | |