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