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