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