1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001 Mark Wedel |
5 | * Copyright (©) 2001 Mark Wedel |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * 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 |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * 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 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * 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> |
23 | */ |
23 | */ |
|
|
24 | |
|
|
25 | //+GPL |
24 | |
26 | |
25 | /** |
27 | /** |
26 | * \file |
28 | * \file |
27 | * Client handling. |
29 | * Client handling. |
28 | * |
30 | * |
… | |
… | |
42 | |
44 | |
43 | #include <global.h> |
45 | #include <global.h> |
44 | #include <sproto.h> |
46 | #include <sproto.h> |
45 | |
47 | |
46 | #include <living.h> |
48 | #include <living.h> |
47 | #include <commands.h> |
|
|
48 | |
49 | |
49 | /* This block is basically taken from socket.c - I assume if it works there, |
50 | /* This block is basically taken from socket.c - I assume if it works there, |
50 | * it should work here. |
51 | * it should work here. |
51 | */ |
52 | */ |
52 | #include <sys/types.h> |
53 | #include <sys/types.h> |
… | |
… | |
64 | * This table translates the attack numbers as used within the |
65 | * This table translates the attack numbers as used within the |
65 | * program to the value we use when sending STATS command to the |
66 | * program to the value we use when sending STATS command to the |
66 | * client. If a value is -1, then we don't send that to the |
67 | * client. If a value is -1, then we don't send that to the |
67 | * client. |
68 | * client. |
68 | */ |
69 | */ |
69 | short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
70 | static short atnr_cs_stat[NROFATTACKS] = |
70 | CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
71 | { |
71 | CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
72 | CS_STAT_RES_PHYS, |
72 | CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
73 | CS_STAT_RES_MAG, |
73 | CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
74 | CS_STAT_RES_FIRE, |
74 | CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
75 | CS_STAT_RES_ELEC, |
75 | CS_STAT_RES_FEAR, -1 /* Cancellation */ , |
76 | CS_STAT_RES_COLD, |
76 | CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
77 | CS_STAT_RES_CONF, |
77 | -1 /* Chaos */ , -1 /* Counterspell */ , |
78 | CS_STAT_RES_ACID, |
78 | -1 /* Godpower */ , CS_STAT_RES_HOLYWORD, |
79 | CS_STAT_RES_DRAIN, |
|
|
80 | -1 /* weaponmagic */, |
|
|
81 | CS_STAT_RES_GHOSTHIT, |
|
|
82 | CS_STAT_RES_POISON, |
|
|
83 | CS_STAT_RES_SLOW, |
|
|
84 | CS_STAT_RES_PARA, |
|
|
85 | CS_STAT_TURN_UNDEAD, |
|
|
86 | CS_STAT_RES_FEAR, |
|
|
87 | -1 /* Cancellation */, |
|
|
88 | CS_STAT_RES_DEPLETE, |
|
|
89 | CS_STAT_RES_DEATH, |
|
|
90 | -1 /* Chaos */, |
|
|
91 | -1 /* Counterspell */, |
|
|
92 | -1 /* Godpower */, |
|
|
93 | CS_STAT_RES_HOLYWORD, |
79 | CS_STAT_RES_BLIND, |
94 | CS_STAT_RES_BLIND, |
80 | -1, /* Internal */ |
95 | -1, /* Internal */ |
81 | -1, /* life stealing */ |
96 | -1, /* life stealing */ |
82 | -1 /* Disease - not fully done yet */ |
97 | -1 /* Disease - not fully done yet */ |
83 | }; |
98 | }; |
… | |
… | |
99 | */ |
114 | */ |
100 | mx = ns->mapx; |
115 | mx = ns->mapx; |
101 | my = ns->mapy; |
116 | my = ns->mapy; |
102 | |
117 | |
103 | /* the x and y here are coordinates for the new map, i.e. if we moved |
118 | /* the x and y here are coordinates for the new map, i.e. if we moved |
104 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
119 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
105 | * if the destination x or y coordinate is outside the viewable |
120 | * if the destination x or y coordinate is outside the viewable |
106 | * area, we clear the values - otherwise, the old values |
121 | * area, we clear the values - otherwise, the old values |
107 | * are preserved, and the check_head thinks it needs to clear them. |
122 | * are preserved, and the check_head thinks it needs to clear them. |
108 | */ |
123 | */ |
109 | for (x = 0; x < mx; x++) |
124 | for (x = 0; x < mx; x++) |
110 | { |
|
|
111 | for (y = 0; y < my; y++) |
125 | for (y = 0; y < my; y++) |
112 | { |
|
|
113 | if (x >= ns->mapx || y >= ns->mapy) |
126 | if (x >= ns->mapx || y >= ns->mapy) |
114 | /* clear cells outside the viewable area */ |
127 | /* clear cells outside the viewable area */ |
115 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
128 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
116 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
129 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
117 | /* clear newly visible tiles within the viewable area */ |
130 | /* clear newly visible tiles within the viewable area */ |
118 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
131 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
119 | else |
132 | else |
120 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
133 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
121 | } |
|
|
122 | } |
|
|
123 | |
134 | |
124 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
135 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
125 | |
136 | |
126 | /* Make sure that the next "map1" command will be sent (even if it is |
137 | /* Make sure that the next "map1" command will be sent (even if it is |
127 | * empty). |
138 | * empty). |
… | |
… | |
130 | } |
141 | } |
131 | |
142 | |
132 | static void |
143 | static void |
133 | clear_map (player *pl) |
144 | clear_map (player *pl) |
134 | { |
145 | { |
|
|
146 | pl->ns->mapinfo_queue_clear (); |
|
|
147 | |
135 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
148 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
|
|
149 | |
|
|
150 | pl->ns->force_newmap = false; |
136 | |
151 | |
137 | if (pl->ns->newmapcmd == 1) |
152 | if (pl->ns->newmapcmd == 1) |
138 | pl->ns->send_packet ("newmap"); |
153 | pl->ns->send_packet ("newmap"); |
139 | |
154 | |
140 | pl->ns->floorbox_reset (); |
155 | pl->ns->floorbox_reset (); |
|
|
156 | } |
|
|
157 | |
|
|
158 | static void |
|
|
159 | send_map_info (player *pl) |
|
|
160 | { |
|
|
161 | client &socket = *pl->ns; |
|
|
162 | object *ob = pl->viewpoint; |
|
|
163 | |
|
|
164 | if (socket.mapinfocmd) |
|
|
165 | { |
|
|
166 | if (ob->map && ob->map->path[0]) |
|
|
167 | { |
|
|
168 | int flags = 0; |
|
|
169 | |
|
|
170 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
171 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
172 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
173 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
174 | |
|
|
175 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
176 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
177 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
178 | } |
|
|
179 | else |
|
|
180 | socket.send_packet ("mapinfo current"); |
|
|
181 | } |
141 | } |
182 | } |
142 | |
183 | |
143 | /** check for map/region change and send new map data */ |
184 | /** check for map/region change and send new map data */ |
144 | static void |
185 | static void |
145 | check_map_change (player *pl) |
186 | check_map_change (player *pl) |
146 | { |
187 | { |
147 | client &socket = *pl->ns; |
188 | client &socket = *pl->ns; |
148 | object *ob = pl->ob; |
189 | object *ob = pl->viewpoint; |
149 | char buf[MAX_BUF]; /* eauugggh */ |
|
|
150 | |
190 | |
151 | if (socket.current_map != ob->map) |
191 | region *reg = ob->region (); |
|
|
192 | if (socket.current_region != reg) |
|
|
193 | { |
|
|
194 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
|
|
195 | socket.current_region = reg; |
152 | { |
196 | } |
|
|
197 | |
|
|
198 | // first try to aovid a full newmap on tiled map scrolls |
|
|
199 | if (socket.current_map != ob->map && !socket.force_newmap) |
|
|
200 | { |
|
|
201 | rv_vector rv; |
|
|
202 | |
|
|
203 | get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0); |
|
|
204 | |
|
|
205 | // manhattan distance is very handy here |
|
|
206 | if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient |
|
|
207 | { |
|
|
208 | socket.current_map = ob->map; |
|
|
209 | socket.current_x = ob->x; |
|
|
210 | socket.current_y = ob->y; |
|
|
211 | |
|
|
212 | socket_map_scroll (&socket, rv.distance_x, rv.distance_y); |
|
|
213 | socket.floorbox_reset (); |
|
|
214 | send_map_info (pl); |
|
|
215 | } |
|
|
216 | } |
|
|
217 | |
|
|
218 | if (socket.current_map != ob->map || socket.force_newmap) |
|
|
219 | { |
|
|
220 | clear_map (pl); |
153 | socket.current_map = ob->map; |
221 | socket.current_map = ob->map; |
154 | |
222 | send_map_info (pl); |
155 | clear_map (pl); |
|
|
156 | |
|
|
157 | if (socket.mapinfocmd) |
|
|
158 | { |
|
|
159 | if (ob->map && ob->map->path[0]) |
|
|
160 | { |
|
|
161 | int flags = 0; |
|
|
162 | |
|
|
163 | if (ob->map->tile_path[0]) |
|
|
164 | flags |= 1; |
|
|
165 | if (ob->map->tile_path[1]) |
|
|
166 | flags |= 2; |
|
|
167 | if (ob->map->tile_path[2]) |
|
|
168 | flags |= 4; |
|
|
169 | if (ob->map->tile_path[3]) |
|
|
170 | flags |= 8; |
|
|
171 | |
|
|
172 | snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
|
|
173 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path); |
|
|
174 | } |
|
|
175 | else |
|
|
176 | snprintf (buf, MAX_BUF, "mapinfo current"); |
|
|
177 | |
|
|
178 | socket.send_packet (buf); |
|
|
179 | } |
|
|
180 | } |
223 | } |
181 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
224 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
182 | { |
225 | { |
183 | int dx = ob->x - socket.current_x; |
226 | int dx = ob->x - socket.current_x; |
184 | int dy = ob->y - socket.current_y; |
227 | int dy = ob->y - socket.current_y; |
185 | |
228 | |
186 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
|
|
187 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
|
|
188 | else |
|
|
189 | { |
|
|
190 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
229 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
191 | socket.floorbox_reset (); |
230 | socket.floorbox_reset (); |
192 | } |
|
|
193 | } |
231 | } |
194 | |
232 | |
195 | socket.current_x = ob->x; |
233 | socket.current_x = ob->x; |
196 | socket.current_y = ob->y; |
234 | socket.current_y = ob->y; |
|
|
235 | } |
197 | |
236 | |
198 | region *reg = ob->region (); |
237 | /** |
199 | if (socket.current_region != reg) |
238 | * This sends the skill number to name mapping. We ignore |
200 | { |
239 | * the params - we always send the same info no matter what. |
201 | socket.current_region = reg; |
240 | */ |
202 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
241 | static void |
|
|
242 | send_skill_info (client *ns, char *params) |
|
|
243 | { |
|
|
244 | packet sl; |
|
|
245 | sl << "replyinfo skill_info\n"; |
|
|
246 | |
|
|
247 | for (int i = 0; i < skillvec.size (); ++i) |
|
|
248 | sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name); |
|
|
249 | |
|
|
250 | if (sl.length () > MAXSOCKBUF) |
203 | } |
251 | { |
|
|
252 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
|
|
253 | fatal (0); |
|
|
254 | } |
|
|
255 | |
|
|
256 | ns->send_packet (sl); |
|
|
257 | } |
|
|
258 | |
|
|
259 | /** |
|
|
260 | * This sends the spell path to name mapping. We ignore |
|
|
261 | * the params - we always send the same info no matter what. |
|
|
262 | */ |
|
|
263 | static void |
|
|
264 | send_spell_paths (client * ns, char *params) |
|
|
265 | { |
|
|
266 | packet sl; |
|
|
267 | |
|
|
268 | sl << "replyinfo spell_paths\n"; |
|
|
269 | |
|
|
270 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
271 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
272 | |
|
|
273 | if (sl.length () > MAXSOCKBUF) |
|
|
274 | { |
|
|
275 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
276 | fatal (0); |
|
|
277 | } |
|
|
278 | |
|
|
279 | ns->send_packet (sl); |
204 | } |
280 | } |
205 | |
281 | |
206 | /** |
282 | /** |
207 | * RequestInfo is sort of a meta command. There is some specific |
283 | * RequestInfo is sort of a meta command. There is some specific |
208 | * request of information, but we call other functions to provide |
284 | * request of information, but we call other functions to provide |
209 | * that information. |
285 | * that information. |
210 | */ |
286 | */ |
211 | void |
287 | void |
212 | RequestInfo (char *buf, int len, client * ns) |
288 | RequestInfo (char *buf, int len, client *ns) |
213 | { |
289 | { |
214 | char *params = NULL, *cp; |
290 | char *params; |
215 | |
|
|
216 | /* No match */ |
|
|
217 | char bigbuf[MAX_BUF]; |
|
|
218 | int slen; |
|
|
219 | |
|
|
220 | /* Set up replyinfo before we modify any of the buffers - this is used |
|
|
221 | * if we don't find a match. |
|
|
222 | */ |
|
|
223 | strcpy (bigbuf, "replyinfo "); |
|
|
224 | slen = strlen (bigbuf); |
|
|
225 | safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
|
|
226 | |
291 | |
227 | /* find the first space, make it null, and update the |
292 | /* find the first space, make it null, and update the |
228 | * params pointer. |
293 | * params pointer. |
229 | */ |
294 | */ |
230 | for (cp = buf; *cp != '\0'; cp++) |
295 | for (params = buf; *params; params++) |
231 | if (*cp == ' ') |
296 | if (*params == ' ') |
232 | { |
297 | { |
233 | *cp = '\0'; |
|
|
234 | params = cp + 1; |
298 | *params++ = 0; |
235 | break; |
299 | break; |
236 | } |
300 | } |
237 | |
301 | |
238 | if (!strcmp (buf, "image_info")) |
|
|
239 | send_image_info (ns, params); |
|
|
240 | else if (!strcmp (buf, "image_sums")) |
|
|
241 | send_image_sums (ns, params); |
|
|
242 | else if (!strcmp (buf, "skill_info")) |
302 | if (!strcmp (buf, "skill_info")) |
243 | send_skill_info (ns, params); |
303 | send_skill_info (ns, params); |
244 | else if (!strcmp (buf, "spell_paths")) |
304 | else if (!strcmp (buf, "spell_paths")) |
245 | send_spell_paths (ns, params); |
305 | send_spell_paths (ns, params); |
246 | else |
306 | else |
247 | ns->send_packet (bigbuf, len); |
307 | { |
|
|
308 | // undo tokenisation above and send replyinfo with the request unchanged |
|
|
309 | if (*params) |
|
|
310 | *--params = ' '; |
|
|
311 | |
|
|
312 | ns->send_packet_printf ("replyinfo %s", buf); |
|
|
313 | } |
248 | } |
314 | } |
249 | |
315 | |
250 | void |
316 | void |
251 | ExtCmd (char *buf, int len, player *pl) |
317 | ExtCmd (char *buf, int len, player *pl) |
252 | { |
318 | { |
… | |
… | |
255 | |
321 | |
256 | void |
322 | void |
257 | ExtiCmd (char *buf, int len, client *ns) |
323 | ExtiCmd (char *buf, int len, client *ns) |
258 | { |
324 | { |
259 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
325 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
|
|
326 | } |
|
|
327 | |
|
|
328 | //-GPL |
|
|
329 | |
|
|
330 | void |
|
|
331 | client::mapinfo_queue_clear () |
|
|
332 | { |
|
|
333 | for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
|
|
334 | free (*i); |
|
|
335 | |
|
|
336 | mapinfo_queue.clear (); |
|
|
337 | } |
|
|
338 | |
|
|
339 | bool |
|
|
340 | client::mapinfo_try (char *buf) |
|
|
341 | { |
|
|
342 | char *token = buf; |
|
|
343 | buf += strlen (buf) + 9; |
|
|
344 | |
|
|
345 | // initial map and its origin |
|
|
346 | maptile *map = pl->viewpoint->map; |
|
|
347 | int mapx = pl->ns->mapx / 2 - pl->viewpoint->x; |
|
|
348 | int mapy = pl->ns->mapy / 2 - pl->viewpoint->y; |
|
|
349 | int max_distance = 8; // limit maximum path length to something generous |
|
|
350 | |
|
|
351 | while (*buf && map && max_distance) |
|
|
352 | { |
|
|
353 | int dir = *buf++ - '1'; |
|
|
354 | |
|
|
355 | if (dir >= 0 && dir <= 3) |
|
|
356 | { |
|
|
357 | if (!map->tile_path [dir]) |
|
|
358 | map = 0; |
|
|
359 | else if (map->tile_available (dir, false)) |
|
|
360 | { |
|
|
361 | maptile *neigh = map->tile_map [dir]; |
|
|
362 | |
|
|
363 | switch (dir) |
|
|
364 | { |
|
|
365 | case 0: mapy -= neigh->height; break; |
|
|
366 | case 2: mapy += map ->height; break; |
|
|
367 | case 3: mapx -= neigh->width ; break; |
|
|
368 | case 1: mapx += map ->width ; break; |
|
|
369 | } |
|
|
370 | |
|
|
371 | map = neigh; |
|
|
372 | --max_distance; |
|
|
373 | } |
|
|
374 | else |
|
|
375 | return 0; |
|
|
376 | } |
|
|
377 | else |
|
|
378 | max_distance = 0; |
|
|
379 | } |
|
|
380 | |
|
|
381 | if (!max_distance) |
|
|
382 | send_packet_printf ("mapinfo %s error", token); |
|
|
383 | else if (!map || !map->path) |
|
|
384 | send_packet_printf ("mapinfo %s nomap", token); |
|
|
385 | else |
|
|
386 | { |
|
|
387 | int flags = 0; |
|
|
388 | |
|
|
389 | if (map->tile_path[0]) flags |= 1; |
|
|
390 | if (map->tile_path[1]) flags |= 2; |
|
|
391 | if (map->tile_path[2]) flags |= 4; |
|
|
392 | if (map->tile_path[3]) flags |= 8; |
|
|
393 | |
|
|
394 | send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
395 | } |
|
|
396 | |
|
|
397 | return 1; |
|
|
398 | } |
|
|
399 | |
|
|
400 | void |
|
|
401 | client::mapinfo_queue_run () |
|
|
402 | { |
|
|
403 | if (mapinfo_queue.empty () || !pl) |
|
|
404 | return; |
|
|
405 | |
|
|
406 | for (int i = 0; i < mapinfo_queue.size (); ++i) |
|
|
407 | if (mapinfo_try (mapinfo_queue [i])) |
|
|
408 | { |
|
|
409 | free (mapinfo_queue [i]); |
|
|
410 | mapinfo_queue.erase (i); |
|
|
411 | } |
|
|
412 | else |
|
|
413 | ++i; |
260 | } |
414 | } |
261 | |
415 | |
262 | void |
416 | void |
263 | MapInfoCmd (char *buf, int len, player *pl) |
417 | MapInfoCmd (char *buf, int len, player *pl) |
264 | { |
418 | { |
265 | // <mapinfo tag spatial tile-path |
419 | // <mapinfo tag spatial tile-path |
266 | // >mapinfo tag spatial flags x y w h hash |
420 | // >mapinfo tag spatial flags x y w h hash |
267 | |
421 | |
268 | char bigbuf[MAX_BUF], *token; |
|
|
269 | |
|
|
270 | token = buf; |
422 | char *token = buf; |
271 | // copy token |
423 | |
272 | if (!(buf = strchr (buf, ' '))) |
424 | if (!(buf = strchr (buf, ' '))) |
273 | return; |
425 | return; |
274 | |
426 | |
275 | *buf++ = 0; |
|
|
276 | |
|
|
277 | if (!strncmp (buf, "spatial ", 8)) |
427 | if (!strncmp (buf, " spatial ", 9)) |
278 | { |
428 | { |
279 | buf += 8; |
429 | char *copy = strdup (token); |
|
|
430 | copy [buf - token] = 0; |
280 | |
431 | |
281 | // initial map and its origin |
432 | #if 0 |
282 | maptile *map = pl->ob->map; |
433 | // this makes only sense when we flush the buffer immediately |
283 | sint16 dx, dy; |
434 | if (pl->ns->mapinfo_try (copy)) |
284 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
435 | free (copy); |
285 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
|
|
286 | int max_distance = 8; // limit maximum path length to something generous |
|
|
287 | |
|
|
288 | while (*buf && map && max_distance) |
|
|
289 | { |
|
|
290 | int dir = *buf++; |
|
|
291 | |
|
|
292 | switch (dir) |
|
|
293 | { |
|
|
294 | case '1': |
|
|
295 | dx = 0; |
|
|
296 | dy = -1; |
|
|
297 | map = map->xy_find (dx, dy); |
|
|
298 | map && (mapy -= map->height); |
|
|
299 | break; |
|
|
300 | case '2': |
|
|
301 | mapx += map->width; |
|
|
302 | dx = map->width; |
|
|
303 | dy = 0; |
|
|
304 | map = map->xy_find (dx, dy); |
|
|
305 | break; |
|
|
306 | case '3': |
|
|
307 | mapy += map->height; |
|
|
308 | dx = 0; |
|
|
309 | dy = map->height; |
|
|
310 | map = map->xy_find (dx, dy); |
|
|
311 | break; |
|
|
312 | case '4': |
|
|
313 | dx = -1; |
|
|
314 | dy = 0; |
|
|
315 | map = map->xy_find (dx, dy); |
|
|
316 | map && (mapx -= map->width); |
|
|
317 | break; |
|
|
318 | } |
|
|
319 | |
|
|
320 | --max_distance; |
|
|
321 | } |
|
|
322 | |
|
|
323 | if (!max_distance) |
|
|
324 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
|
|
325 | else if (map && map->path[0]) |
|
|
326 | { |
|
|
327 | int flags = 0; |
|
|
328 | |
|
|
329 | if (map->tile_path[0]) |
|
|
330 | flags |= 1; |
|
|
331 | if (map->tile_path[1]) |
|
|
332 | flags |= 2; |
|
|
333 | if (map->tile_path[2]) |
|
|
334 | flags |= 4; |
|
|
335 | if (map->tile_path[3]) |
|
|
336 | flags |= 8; |
|
|
337 | |
|
|
338 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
339 | } |
|
|
340 | else |
436 | else |
341 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
437 | #endif |
|
|
438 | pl->ns->mapinfo_queue.push_back (copy); |
342 | } |
439 | } |
343 | else |
440 | else |
344 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
441 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
345 | |
|
|
346 | pl->ns->send_packet (bigbuf); |
|
|
347 | } |
442 | } |
348 | |
443 | |
349 | /** This is the Setup cmd - easy first implementation */ |
444 | /** This is the Setup cmd */ |
350 | void |
445 | void |
351 | SetUp (char *buf, int len, client * ns) |
446 | SetUp (char *buf, int len, client * ns) |
352 | { |
447 | { |
353 | int s, slen; |
448 | INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len)); |
354 | char *cmd, *param, cmdback[HUGE_BUF]; |
|
|
355 | |
|
|
356 | /* run through the cmds of setup |
|
|
357 | * syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ... |
|
|
358 | * |
|
|
359 | * we send the status of the cmd back, or a FALSE is the cmd is the server unknown |
|
|
360 | * The client then must sort this out |
|
|
361 | */ |
|
|
362 | |
|
|
363 | //LOG (llevInfo, "Get SetupCmd:: %s\n", buf); |
|
|
364 | |
|
|
365 | strcpy (cmdback, "setup"); |
|
|
366 | for (s = 0; s < len; ) |
|
|
367 | { |
|
|
368 | cmd = &buf[s]; |
|
|
369 | |
|
|
370 | /* find the next space, and put a null there */ |
|
|
371 | for (; buf[s] && buf[s] != ' '; s++) |
|
|
372 | ; |
|
|
373 | |
|
|
374 | buf[s++] = 0; |
|
|
375 | |
|
|
376 | while (buf[s] == ' ') |
|
|
377 | s++; |
|
|
378 | |
|
|
379 | if (s >= len) |
|
|
380 | break; |
|
|
381 | |
|
|
382 | param = &buf[s]; |
|
|
383 | |
|
|
384 | for (; buf[s] && buf[s] != ' '; s++) |
|
|
385 | ; |
|
|
386 | |
|
|
387 | buf[s++] = 0; |
|
|
388 | |
|
|
389 | while (buf[s] == ' ') |
|
|
390 | s++; |
|
|
391 | |
|
|
392 | slen = strlen (cmdback); |
|
|
393 | safe_strcat (cmdback, " ", &slen, HUGE_BUF); |
|
|
394 | safe_strcat (cmdback, cmd, &slen, HUGE_BUF); |
|
|
395 | safe_strcat (cmdback, " ", &slen, HUGE_BUF); |
|
|
396 | |
|
|
397 | if (!strcmp (cmd, "sound")) |
|
|
398 | { |
|
|
399 | ns->sound = atoi (param); |
|
|
400 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
401 | } |
|
|
402 | else if (!strcmp (cmd, "exp64")) |
|
|
403 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
404 | else if (!strcmp (cmd, "spellmon")) |
|
|
405 | { |
|
|
406 | ns->monitor_spells = atoi (param); |
|
|
407 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
408 | } |
|
|
409 | else if (!strcmp (cmd, "darkness")) |
|
|
410 | { |
|
|
411 | ns->darkness = atoi (param); |
|
|
412 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
413 | } |
|
|
414 | else if (!strcmp (cmd, "map1cmd")) |
|
|
415 | { |
|
|
416 | if (atoi (param)) |
|
|
417 | ns->mapmode = Map1Cmd; |
|
|
418 | /* if beyond this size, need to use map1cmd no matter what */ |
|
|
419 | if (ns->mapx > 11 || ns->mapy > 11) |
|
|
420 | ns->mapmode = Map1Cmd; |
|
|
421 | safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF); |
|
|
422 | } |
|
|
423 | else if (!strcmp (cmd, "map1acmd")) |
|
|
424 | { |
|
|
425 | if (atoi (param)) |
|
|
426 | ns->mapmode = Map1aCmd; |
|
|
427 | /* if beyond this size, need to use map1acmd no matter what */ |
|
|
428 | if (ns->mapx > 11 || ns->mapy > 11) |
|
|
429 | ns->mapmode = Map1aCmd; |
|
|
430 | safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF); |
|
|
431 | } |
|
|
432 | else if (!strcmp (cmd, "newmapcmd")) |
|
|
433 | { |
|
|
434 | ns->newmapcmd = atoi (param); |
|
|
435 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
436 | } |
|
|
437 | else if (!strcmp (cmd, "mapinfocmd")) |
|
|
438 | { |
|
|
439 | ns->mapinfocmd = atoi (param); |
|
|
440 | safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
|
|
441 | } |
|
|
442 | else if (!strcmp (cmd, "extcmd")) |
|
|
443 | { |
|
|
444 | ns->extcmd = atoi (param); |
|
|
445 | safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
|
|
446 | } |
|
|
447 | else if (!strcmp (cmd, "extmap")) |
|
|
448 | { |
|
|
449 | ns->extmap = atoi (param); |
|
|
450 | safe_strcat (cmdback, "1", &slen, HUGE_BUF); |
|
|
451 | } |
|
|
452 | else if (!strcmp (cmd, "facecache")) |
|
|
453 | { |
|
|
454 | ns->facecache = atoi (param); |
|
|
455 | safe_strcat (cmdback, param, &slen, HUGE_BUF); |
|
|
456 | } |
|
|
457 | else if (!strcmp (cmd, "faceset")) |
|
|
458 | { |
|
|
459 | char tmpbuf[20]; |
|
|
460 | int q = atoi (param); |
|
|
461 | |
|
|
462 | if (is_valid_faceset (q)) |
|
|
463 | ns->faceset = q; |
|
|
464 | sprintf (tmpbuf, "%d", ns->faceset); |
|
|
465 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
466 | /* if the client is using faceset, it knows about image2 command */ |
|
|
467 | ns->image2 = 1; |
|
|
468 | } |
|
|
469 | else if (!strcmp (cmd, "itemcmd")) |
|
|
470 | { |
|
|
471 | /* Version of the item protocol command to use. Currently, |
|
|
472 | * only supported versions are 1 and 2. Using a numeric |
|
|
473 | * value will make it very easy to extend this in the future. |
|
|
474 | */ |
|
|
475 | char tmpbuf[20]; |
|
|
476 | int q = atoi (param); |
|
|
477 | |
|
|
478 | if (q < 1 || q > 2) |
|
|
479 | { |
|
|
480 | strcpy (tmpbuf, "FALSE"); |
|
|
481 | } |
|
|
482 | else |
|
|
483 | { |
|
|
484 | ns->itemcmd = q; |
|
|
485 | sprintf (tmpbuf, "%d", ns->itemcmd); |
|
|
486 | } |
|
|
487 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
488 | } |
|
|
489 | else if (!strcmp (cmd, "mapsize")) |
|
|
490 | { |
|
|
491 | int x, y = 0; |
|
|
492 | char tmpbuf[MAX_BUF], *cp; |
|
|
493 | |
|
|
494 | x = atoi (param); |
|
|
495 | for (cp = param; *cp != 0; cp++) |
|
|
496 | if (*cp == 'x' || *cp == 'X') |
|
|
497 | { |
|
|
498 | y = atoi (cp + 1); |
|
|
499 | break; |
|
|
500 | } |
|
|
501 | |
|
|
502 | if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y) |
|
|
503 | { |
|
|
504 | sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y); |
|
|
505 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
506 | } |
|
|
507 | else |
|
|
508 | { |
|
|
509 | ns->mapx = x; |
|
|
510 | ns->mapy = y; |
|
|
511 | /* better to send back what we are really using and not the |
|
|
512 | * param as given to us in case it gets parsed differently. |
|
|
513 | */ |
|
|
514 | sprintf (tmpbuf, "%dx%d", x, y); |
|
|
515 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
516 | /* If beyond this size and still using orig map command, need to |
|
|
517 | * go to map1cmd. |
|
|
518 | */ |
|
|
519 | if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd) |
|
|
520 | ns->mapmode = Map1Cmd; |
|
|
521 | } |
|
|
522 | } |
|
|
523 | else if (!strcmp (cmd, "extendedMapInfos")) |
|
|
524 | { |
|
|
525 | /* Added by tchize |
|
|
526 | * prepare to use the mapextended command |
|
|
527 | */ |
|
|
528 | char tmpbuf[20]; |
|
|
529 | |
|
|
530 | ns->ext_mapinfos = (atoi (param)); |
|
|
531 | sprintf (tmpbuf, "%d", ns->ext_mapinfos); |
|
|
532 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
533 | } |
|
|
534 | else if (!strcmp (cmd, "extendedTextInfos")) |
|
|
535 | { |
|
|
536 | /* Added by tchize |
|
|
537 | * prepare to use the extended text commands |
|
|
538 | * Client toggle this to non zero to get exttext |
|
|
539 | */ |
|
|
540 | char tmpbuf[20]; |
|
|
541 | |
|
|
542 | ns->has_readable_type = (atoi (param)); |
|
|
543 | sprintf (tmpbuf, "%d", ns->has_readable_type); |
|
|
544 | safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
545 | } |
|
|
546 | else |
|
|
547 | { |
|
|
548 | /* Didn't get a setup command we understood - |
|
|
549 | * report a failure to the client. |
|
|
550 | */ |
|
|
551 | safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF); |
|
|
552 | } |
|
|
553 | } /* for processing all the setup commands */ |
|
|
554 | |
|
|
555 | LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback); |
|
|
556 | ns->send_packet (cmdback); |
|
|
557 | } |
449 | } |
558 | |
450 | |
559 | /** |
451 | /** |
560 | * The client has requested to be added to the game. |
452 | * The client has requested to be added to the game. |
561 | * This is what takes care of it. We tell the client how things worked out. |
453 | * This is what takes care of it. We tell the client how things worked out. |
562 | * I am not sure if this file is the best place for this function. however, |
454 | * I am not sure if this file is the best place for this function. however, |
563 | * it either has to be here or init_sockets needs to be exported. |
455 | * it either has to be here or init_sockets needs to be exported. |
564 | */ |
456 | */ |
565 | void |
457 | void |
566 | AddMeCmd (char *buf, int len, client * ns) |
458 | AddMeCmd (char *buf, int len, client *ns) |
567 | { |
459 | { |
568 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
460 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
569 | } |
461 | } |
570 | |
462 | |
571 | /** Reply to ExtendedInfos command */ |
463 | //+GPL |
572 | void |
|
|
573 | ToggleExtendedInfos (char *buf, int len, client * ns) |
|
|
574 | { |
|
|
575 | char cmdback[MAX_BUF]; |
|
|
576 | char command[50]; |
|
|
577 | int info, nextinfo; |
|
|
578 | |
|
|
579 | cmdback[0] = '\0'; |
|
|
580 | nextinfo = 0; |
|
|
581 | |
|
|
582 | while (1) |
|
|
583 | { |
|
|
584 | /* 1. Extract an info */ |
|
|
585 | info = nextinfo; |
|
|
586 | |
|
|
587 | while ((info < len) && (buf[info] == ' ')) |
|
|
588 | info++; |
|
|
589 | |
|
|
590 | if (info >= len) |
|
|
591 | break; |
|
|
592 | |
|
|
593 | nextinfo = info + 1; |
|
|
594 | |
|
|
595 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
|
|
596 | nextinfo++; |
|
|
597 | |
|
|
598 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
|
|
599 | continue; |
|
|
600 | |
|
|
601 | strncpy (command, &(buf[info]), nextinfo - info); |
|
|
602 | |
|
|
603 | /* 2. Interpret info */ |
|
|
604 | if (!strcmp ("smooth", command)) |
|
|
605 | /* Toggle smoothing */ |
|
|
606 | ns->EMI_smooth = !ns->EMI_smooth; |
|
|
607 | else |
|
|
608 | /*bad value */; |
|
|
609 | |
|
|
610 | /*3. Next info */ |
|
|
611 | } |
|
|
612 | |
|
|
613 | strcpy (cmdback, "ExtendedInfoSet"); |
|
|
614 | |
|
|
615 | if (ns->EMI_smooth) |
|
|
616 | { |
|
|
617 | strcat (cmdback, " "); |
|
|
618 | strcat (cmdback, "smoothing"); |
|
|
619 | } |
|
|
620 | |
|
|
621 | ns->send_packet (cmdback); |
|
|
622 | } |
|
|
623 | |
|
|
624 | /* |
|
|
625 | #define MSG_TYPE_BOOK 1 |
|
|
626 | #define MSG_TYPE_CARD 2 |
|
|
627 | #define MSG_TYPE_PAPER 3 |
|
|
628 | #define MSG_TYPE_SIGN 4 |
|
|
629 | #define MSG_TYPE_MONUMENT 5 |
|
|
630 | #define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
|
|
631 | |
|
|
632 | /** Reply to ExtendedInfos command */ |
|
|
633 | void |
|
|
634 | ToggleExtendedText (char *buf, int len, client * ns) |
|
|
635 | { |
|
|
636 | char cmdback[MAX_BUF]; |
|
|
637 | char temp[10]; |
|
|
638 | char command[50]; |
|
|
639 | int info, nextinfo, i, flag; |
|
|
640 | |
|
|
641 | cmdback[0] = '\0'; |
|
|
642 | |
|
|
643 | nextinfo = 0; |
|
|
644 | while (1) |
|
|
645 | { |
|
|
646 | /* 1. Extract an info */ |
|
|
647 | info = nextinfo; |
|
|
648 | |
|
|
649 | while ((info < len) && (buf[info] == ' ')) |
|
|
650 | info++; |
|
|
651 | |
|
|
652 | if (info >= len) |
|
|
653 | break; |
|
|
654 | |
|
|
655 | nextinfo = info + 1; |
|
|
656 | |
|
|
657 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
|
|
658 | nextinfo++; |
|
|
659 | |
|
|
660 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
|
|
661 | continue; |
|
|
662 | |
|
|
663 | strncpy (command, &(buf[info]), nextinfo - info); |
|
|
664 | command[nextinfo - info] = '\0'; |
|
|
665 | /* 2. Interpret info */ |
|
|
666 | i = sscanf (command, "%d", &flag); |
|
|
667 | |
|
|
668 | if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
|
|
669 | ns->supported_readables |= (1 << flag); |
|
|
670 | /*3. Next info */ |
|
|
671 | } |
|
|
672 | |
|
|
673 | /* Send resulting state */ |
|
|
674 | strcpy (cmdback, "ExtendedTextSet"); |
|
|
675 | |
|
|
676 | for (i = 0; i <= MSG_TYPE_LAST; i++) |
|
|
677 | if (ns->supported_readables & (1 << i)) |
|
|
678 | { |
|
|
679 | strcat (cmdback, " "); |
|
|
680 | snprintf (temp, sizeof (temp), "%d", i); |
|
|
681 | strcat (cmdback, temp); |
|
|
682 | } |
|
|
683 | |
|
|
684 | ns->send_packet (cmdback); |
|
|
685 | } |
|
|
686 | |
|
|
687 | /** |
|
|
688 | * Tells client the picture it has to use |
|
|
689 | * to smooth a picture number given as argument. |
|
|
690 | */ |
|
|
691 | void |
|
|
692 | AskSmooth (char *buf, int len, client *ns) |
|
|
693 | { |
|
|
694 | ns->send_face (atoi (buf)); |
|
|
695 | } |
|
|
696 | |
464 | |
697 | /** |
465 | /** |
698 | * This handles the general commands from the client (ie, north, fire, cast, |
466 | * This handles the general commands from the client (ie, north, fire, cast, |
699 | * etc.) |
467 | * etc.) |
700 | */ |
468 | */ |
… | |
… | |
713 | return; |
481 | return; |
714 | |
482 | |
715 | buf++; |
483 | buf++; |
716 | } |
484 | } |
717 | |
485 | |
718 | execute_newserver_command (pl->ob, (char *) buf); |
486 | execute_newserver_command (pl->ob, (char *)buf); |
719 | |
487 | |
720 | /* Perhaps something better should be done with a left over count. |
488 | /* Perhaps something better should be done with a left over count. |
721 | * Cleaning up the input should probably be done first - all actions |
489 | * Cleaning up the input should probably be done first - all actions |
722 | * for the command that issued the count should be done before any other |
490 | * for the command that issued the count should be done before any other |
723 | * commands. |
491 | * commands. |
724 | */ |
492 | */ |
725 | pl->count = 0; |
493 | pl->count = 0; |
726 | } |
494 | } |
727 | |
495 | |
728 | |
|
|
729 | /** |
496 | /** |
730 | * This handles the general commands from the client (ie, north, fire, cast, |
497 | * This handles the general commands from the client (ie, north, fire, cast, |
731 | * etc.). It is a lot like PlayerCmd above, but is called with the |
498 | * etc.). It is a lot like PlayerCmd above, but is called with the |
732 | * 'ncom' method which gives more information back to the client so it |
499 | * 'ncom' method which gives more information back to the client so it |
733 | * can throttle. |
500 | * can throttle. |
… | |
… | |
735 | void |
502 | void |
736 | NewPlayerCmd (char *buf, int len, player *pl) |
503 | NewPlayerCmd (char *buf, int len, player *pl) |
737 | { |
504 | { |
738 | if (len <= 6) |
505 | if (len <= 6) |
739 | { |
506 | { |
740 | LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
507 | LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len); |
741 | return; |
508 | return; |
742 | } |
509 | } |
743 | |
510 | |
744 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
511 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
745 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
512 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
… | |
… | |
758 | * commands. |
525 | * commands. |
759 | */ |
526 | */ |
760 | pl->count = 0; |
527 | pl->count = 0; |
761 | |
528 | |
762 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
529 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
763 | int time = fabs (pl->ob->speed) < 0.001 |
530 | int time = pl->ob->has_active_speed () |
764 | ? time = MAX_TIME * 100 |
|
|
765 | : time = (int) (MAX_TIME / fabs (pl->ob->speed)); |
531 | ? (int) (MAX_TIME / pl->ob->speed) |
|
|
532 | : MAX_TIME * 100; |
766 | |
533 | |
767 | /* Send confirmation of command execution now */ |
534 | /* Send confirmation of command execution now */ |
768 | packet sl ("comc"); |
535 | packet sl ("comc"); |
769 | sl << uint16 (cmdid) << uint32 (time); |
536 | sl << uint16 (cmdid) << uint32 (time); |
770 | pl->ns->send_packet (sl); |
537 | pl->ns->send_packet (sl); |
… | |
… | |
802 | { |
569 | { |
803 | case ST_PLAYING: |
570 | case ST_PLAYING: |
804 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
571 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
805 | break; |
572 | break; |
806 | |
573 | |
807 | case ST_CHANGE_CLASS: |
|
|
808 | key_change_class (pl->ob, buf[0]); |
|
|
809 | break; |
|
|
810 | |
|
|
811 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
574 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
812 | receive_party_password (pl->ob, 13); |
575 | receive_party_password (pl->ob, 13); |
813 | break; |
576 | break; |
814 | |
577 | |
815 | default: |
578 | default: |
816 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
579 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
817 | } |
580 | } |
818 | } |
581 | } |
819 | |
582 | |
820 | /** |
583 | /** |
821 | * Client tells its version. If there is a mismatch, we close the |
584 | * Client tells its version info. |
822 | * socket. In real life, all we should care about is the client having |
|
|
823 | * something older than the server. If we assume the client will be |
|
|
824 | * backwards compatible, having it be a later version should not be a |
|
|
825 | * problem. |
|
|
826 | */ |
585 | */ |
827 | void |
586 | void |
828 | VersionCmd (char *buf, int len, client * ns) |
587 | VersionCmd (char *buf, int len, client *ns) |
829 | { |
588 | { |
830 | if (!buf) |
589 | INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len)); |
831 | { |
|
|
832 | LOG (llevError, "CS: received corrupted version command\n"); |
|
|
833 | return; |
|
|
834 | } |
|
|
835 | |
|
|
836 | ns->cs_version = atoi (buf); |
|
|
837 | ns->sc_version = ns->cs_version; |
|
|
838 | |
|
|
839 | LOG (llevDebug, "connection from client <%s>\n", buf); |
|
|
840 | |
|
|
841 | //TODO: should log here just for statistics |
|
|
842 | |
|
|
843 | //if (VERSION_CS != ns->cs_version) |
|
|
844 | // unchecked; |
|
|
845 | |
|
|
846 | char *cp = strchr (buf + 1, ' '); |
|
|
847 | if (!cp) |
|
|
848 | return; |
|
|
849 | |
|
|
850 | ns->sc_version = atoi (cp); |
|
|
851 | |
|
|
852 | //if (VERSION_SC != ns->sc_version) |
|
|
853 | // unchecked; |
|
|
854 | |
|
|
855 | cp = strchr (cp + 1, ' '); |
|
|
856 | |
|
|
857 | if (cp) |
|
|
858 | { |
|
|
859 | assign (ns->version, cp + 1); |
|
|
860 | |
|
|
861 | if (ns->sc_version < 1026) |
|
|
862 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
|
|
863 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
|
|
864 | } |
|
|
865 | } |
590 | } |
866 | |
591 | |
867 | /** sound related functions. */ |
592 | /** sound related functions. */ |
868 | void |
593 | void |
869 | SetSound (char *buf, int len, client * ns) |
594 | SetSound (char *buf, int len, client * ns) |
… | |
… | |
887 | * syntax is: move (to) (tag) (nrof) |
612 | * syntax is: move (to) (tag) (nrof) |
888 | */ |
613 | */ |
889 | void |
614 | void |
890 | MoveCmd (char *buf, int len, player *pl) |
615 | MoveCmd (char *buf, int len, player *pl) |
891 | { |
616 | { |
892 | int vals[3], i; |
617 | int to, tag, nrof; |
893 | |
618 | |
894 | /* A little funky here. We only cycle for 2 records, because |
619 | if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
895 | * we obviously are not going to find a space after the third |
|
|
896 | * record. Perhaps we should just replace this with a |
|
|
897 | * sscanf? |
|
|
898 | */ |
|
|
899 | for (i = 0; i < 2; i++) |
|
|
900 | { |
620 | { |
901 | vals[i] = atoi (buf); |
|
|
902 | |
|
|
903 | if (!(buf = strchr (buf, ' '))) |
|
|
904 | { |
|
|
905 | LOG (llevError, "Incomplete move command: %s\n", buf); |
621 | LOG (llevError, "Incomplete move command: %s\n", buf); |
906 | return; |
622 | return; |
907 | } |
|
|
908 | |
|
|
909 | buf++; |
|
|
910 | } |
623 | } |
911 | |
624 | |
912 | vals[2] = atoi (buf); |
625 | esrv_move_object (pl->ob, to, tag, nrof); |
913 | |
|
|
914 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
|
|
915 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
|
|
916 | } |
626 | } |
917 | |
627 | |
918 | /****************************************************************************** |
628 | /****************************************************************************** |
919 | * |
629 | * |
920 | * Start of commands the server sends to the client. |
630 | * Start of commands the server sends to the client. |
… | |
… | |
924 | /** |
634 | /** |
925 | * Asks the client to query the user. This way, the client knows |
635 | * Asks the client to query the user. This way, the client knows |
926 | * it needs to send something back (vs just printing out a message) |
636 | * it needs to send something back (vs just printing out a message) |
927 | */ |
637 | */ |
928 | void |
638 | void |
929 | send_query (client *ns, uint8 flags, char *text) |
639 | send_query (client *ns, uint8 flags, const char *text) |
930 | { |
640 | { |
931 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
641 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
|
|
642 | } |
|
|
643 | |
|
|
644 | /** |
|
|
645 | * Get player's current range attack in obuf. |
|
|
646 | */ |
|
|
647 | static void |
|
|
648 | rangetostring (player *pl, char *obuf) |
|
|
649 | { |
|
|
650 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
|
|
651 | |
|
|
652 | #if 0 |
|
|
653 | // print ranged/chosen_skill etc. objects every call |
|
|
654 | printf ("%s %s => %s (%s)\n", |
|
|
655 | pl->ranged_ob ? &pl->ranged_ob->name : "-", |
|
|
656 | pl->combat_ob ? &pl->combat_ob->name : "-", |
|
|
657 | pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-", |
|
|
658 | pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-" |
|
|
659 | ); |
|
|
660 | #endif |
|
|
661 | |
|
|
662 | if (pl->ranged_ob) |
|
|
663 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
|
|
664 | |
|
|
665 | if (pl->combat_ob) |
|
|
666 | buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
|
|
667 | |
|
|
668 | #if 0 |
|
|
669 | //TODO: remove this when slot system is working, this is only for debugging |
|
|
670 | if (pl->ob->chosen_skill) |
|
|
671 | buf << " Skill*: " << pl->ob->chosen_skill->name; |
|
|
672 | #endif |
|
|
673 | |
|
|
674 | //TODO: maybe golem should become the current_weapon, quite simply? |
|
|
675 | if (pl->golem) |
|
|
676 | buf << " Golem*: " << pl->golem->name; |
|
|
677 | |
|
|
678 | buf << '\0'; |
|
|
679 | buf.linearise (obuf); |
932 | } |
680 | } |
933 | |
681 | |
934 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
682 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
935 | Old = New; \ |
683 | Old = New; \ |
936 | sl << uint8 (Type) << uint64 (New); \ |
684 | sl << uint8 (Type) << uint64 (New); \ |
… | |
… | |
944 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
692 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
945 | Old = New; \ |
693 | Old = New; \ |
946 | sl << uint8 (Type) << uint16 (New); \ |
694 | sl << uint8 (Type) << uint16 (New); \ |
947 | } |
695 | } |
948 | |
696 | |
949 | #define AddIfFloat(Old,New,Type) if (Old != New) {\ |
697 | #define AddIfFloat(Old,New,Type,mult) if (Old != New) {\ |
950 | Old = New; \ |
698 | Old = New; \ |
951 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ |
699 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \ |
952 | } |
700 | } |
953 | |
701 | |
954 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
702 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
955 | free(Old); Old = strdup (New);\ |
703 | free(Old); Old = strdup (New);\ |
956 | sl << uint8 (Type) << data8 (New); \ |
704 | sl << uint8 (Type) << data8 (New); \ |
… | |
… | |
970 | |
718 | |
971 | client *ns = pl->ns; |
719 | client *ns = pl->ns; |
972 | if (!ns) |
720 | if (!ns) |
973 | return; |
721 | return; |
974 | |
722 | |
975 | object *ob = pl->ob; |
723 | object *ob = pl->observe; |
976 | if (!ob) |
724 | if (!ob) |
977 | return; |
725 | return; |
|
|
726 | |
|
|
727 | player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl; |
978 | |
728 | |
979 | packet sl ("stats"); |
729 | packet sl ("stats"); |
980 | |
730 | |
981 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
731 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
982 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
732 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
… | |
… | |
990 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
740 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
991 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
741 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
992 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
742 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
993 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
743 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
994 | |
744 | |
995 | for (int s = 0; s < NUM_SKILLS; s++) |
745 | for (int s = 0; s < CS_NUM_SKILLS; s++) |
996 | if (object *skill = pl->last_skill_ob[s]) |
746 | if (object *skill = opl->last_skill_ob [s]) |
997 | if (skill->stats.exp != ns->last_skill_exp [s]) |
747 | if (skill->stats.exp != ns->last_skill_exp [s]) |
998 | { |
748 | { |
999 | ns->last_skill_exp [s] = skill->stats.exp; |
749 | ns->last_skill_exp [s] = skill->stats.exp; |
1000 | |
750 | |
1001 | /* Always send along the level if exp changes. This is only |
751 | /* Always send along the level if exp changes. This is only |
1002 | * 1 extra byte, but keeps processing simpler. |
752 | * 1 extra byte, but keeps processing simpler. |
1003 | */ |
753 | */ |
1004 | sl << uint8 (s + CS_STAT_SKILLINFO) |
754 | sl << uint8 (CS_STAT_SKILLINFO + s) |
1005 | << uint8 (skill->level) |
755 | << uint8 (skill->level) |
1006 | << uint64 (skill->stats.exp); |
756 | << uint64 (skill->stats.exp); |
1007 | } |
757 | } |
1008 | |
758 | |
1009 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
759 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
1010 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
760 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
1011 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
761 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
1012 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
762 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
1013 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
763 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
1014 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); |
764 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK); |
1015 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
765 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
1016 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
766 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK); |
1017 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
767 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
1018 | |
768 | |
1019 | flags = 0; |
769 | flags = (opl->fire_on ? SF_FIREON : 0) |
1020 | |
770 | | (opl->run_on ? SF_RUNON : 0); |
1021 | if (pl->fire_on) |
|
|
1022 | flags |= SF_FIREON; |
|
|
1023 | |
|
|
1024 | if (pl->run_on) |
|
|
1025 | flags |= SF_RUNON; |
|
|
1026 | |
771 | |
1027 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
772 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
1028 | |
773 | |
1029 | if (ns->sc_version < 1025) |
|
|
1030 | { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
|
|
1031 | else |
|
|
1032 | for (int i = 0; i < NROFATTACKS; i++) |
774 | for (int i = 0; i < NROFATTACKS; i++) |
1033 | { |
775 | { |
1034 | /* Skip ones we won't send */ |
776 | /* Skip ones we won't send */ |
1035 | if (atnr_cs_stat[i] == -1) |
777 | if (atnr_cs_stat[i] == -1) |
1036 | continue; |
778 | continue; |
1037 | |
779 | |
1038 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
780 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
1039 | } |
781 | } |
1040 | |
782 | |
1041 | if (pl->ns->monitor_spells) |
783 | if (pl->ns->monitor_spells) |
1042 | { |
784 | { |
1043 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
785 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1044 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
786 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
1045 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
787 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
1046 | } |
788 | } |
1047 | |
789 | |
1048 | rangetostring (ob, buf); /* we want use the new fire & run system in new client */ |
790 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
1049 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
791 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
1050 | set_title (ob, buf); |
792 | set_title (ob, buf); |
1051 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
793 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
1052 | |
794 | |
1053 | /* Only send it away if we have some actual data */ |
795 | /* Only send it away if we have some actual data */ |
… | |
… | |
1057 | |
799 | |
1058 | /** |
800 | /** |
1059 | * Tells the client that here is a player it should start using. |
801 | * Tells the client that here is a player it should start using. |
1060 | */ |
802 | */ |
1061 | void |
803 | void |
1062 | esrv_new_player (player *pl, uint32 weight) |
804 | esrv_new_player (player *pl) |
1063 | { |
805 | { |
|
|
806 | sint32 weight = pl->ob->client_weight (); |
|
|
807 | |
1064 | packet sl ("player"); |
808 | packet sl ("player"); |
1065 | |
809 | |
1066 | sl << uint32 (pl->ob->count) |
810 | sl << uint32 (pl->ob->count) |
1067 | << uint32 (weight) |
811 | << uint32 (weight) |
1068 | << uint32 (pl->ob->face) |
812 | << uint32 (pl->ob->face) |
1069 | << data8 (pl->ob->name); |
813 | << data8 (pl->ob->name); |
1070 | |
814 | |
1071 | pl->ns->last_weight = weight; |
815 | pl->ns->last_weight = weight; |
1072 | pl->ns->send_packet (sl); |
816 | pl->ns->send_packet (sl); |
1073 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
|
|
1074 | } |
817 | } |
1075 | |
818 | |
1076 | /****************************************************************************** |
819 | /****************************************************************************** |
1077 | * |
820 | * |
1078 | * Start of map related commands. |
821 | * Start of map related commands. |
… | |
… | |
1135 | |
878 | |
1136 | if (!ns.faces_sent[face_num]) |
879 | if (!ns.faces_sent[face_num]) |
1137 | if (ob) |
880 | if (ob) |
1138 | ns.send_faces (ob); |
881 | ns.send_faces (ob); |
1139 | else |
882 | else |
1140 | ns.send_face (face_num); |
883 | ns.send_face (face_num, 10); |
1141 | |
884 | |
1142 | sl << uint16 (face_num); |
885 | sl << uint16 (face_num); |
1143 | return 1; |
886 | return 1; |
1144 | } |
887 | } |
1145 | |
888 | |
1146 | /* Nothing changed */ |
889 | /* Nothing changed */ |
1147 | return 0; |
890 | return 0; |
1148 | } |
891 | } |
1149 | |
892 | |
1150 | /** |
893 | //-GPL |
1151 | * Returns the size of a data for a map square as returned by |
|
|
1152 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
|
|
1153 | * available. |
|
|
1154 | */ |
|
|
1155 | int |
|
|
1156 | getExtendedMapInfoSize (client * ns) |
|
|
1157 | { |
|
|
1158 | int result = 0; |
|
|
1159 | |
|
|
1160 | if (ns->ext_mapinfos) |
|
|
1161 | { |
|
|
1162 | if (ns->EMI_smooth) |
|
|
1163 | result += 1; /*One byte for smoothlevel */ |
|
|
1164 | } |
|
|
1165 | |
|
|
1166 | return result; |
|
|
1167 | } |
|
|
1168 | |
894 | |
1169 | // prefetch (and touch) all maps within a specific distancd |
895 | // prefetch (and touch) all maps within a specific distancd |
1170 | static void |
896 | static void |
1171 | prefetch_surrounding_maps (maptile *map, int distance) |
897 | prefetch_surrounding_maps (maptile *map, int distance) |
1172 | { |
898 | { |
1173 | map->last_access = runtime; |
899 | map->touch (); |
1174 | |
900 | |
1175 | if (--distance) |
901 | if (--distance) |
1176 | for (int dir = 4; --dir; ) |
902 | for (int dir = 4; dir--; ) |
1177 | if (const shstr &path = map->tile_path [dir]) |
903 | if (const shstr &path = map->tile_path [dir]) |
1178 | if (maptile *&neigh = map->tile_map [dir]) |
904 | if (maptile *&neigh = map->tile_map [dir]) |
1179 | prefetch_surrounding_maps (neigh, distance); |
905 | prefetch_surrounding_maps (neigh, distance); |
1180 | else |
906 | else |
1181 | neigh = maptile::find_async (path, map); |
907 | neigh = maptile::find_async (path, map); |
… | |
… | |
1186 | prefetch_surrounding_maps (object *op) |
912 | prefetch_surrounding_maps (object *op) |
1187 | { |
913 | { |
1188 | prefetch_surrounding_maps (op->map, 3); |
914 | prefetch_surrounding_maps (op->map, 3); |
1189 | } |
915 | } |
1190 | |
916 | |
|
|
917 | //+GPL |
|
|
918 | |
1191 | /** |
919 | /** |
1192 | * This function uses the new map1 protocol command to send the map |
920 | * Draws client map. |
1193 | * to the client. It is necessary because the old map command supports |
|
|
1194 | * a maximum map size of 15x15. |
|
|
1195 | * This function is much simpler than the old one. This is because |
|
|
1196 | * the old function optimized to send as few face identifiers as possible, |
|
|
1197 | * at the expense of sending more coordinate location (coordinates were |
|
|
1198 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
1199 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
1200 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
1201 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
1202 | * of what we send, see the doc/Protocol file. |
|
|
1203 | * I will describe internally what we do: |
|
|
1204 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
1205 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
1206 | * maximum viewable size (As set in config.h). |
|
|
1207 | * in the cells, there are faces and a count value. |
|
|
1208 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
1209 | * is not viewable. |
|
|
1210 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
1211 | * look like. |
|
|
1212 | */ |
921 | */ |
1213 | void |
922 | void |
1214 | draw_client_map1 (object *pl) |
923 | draw_client_map (player *pl) |
1215 | { |
924 | { |
1216 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
925 | object *ob = pl->viewpoint; |
1217 | sint16 nx, ny; |
|
|
1218 | int estartlen, eoldlen; |
|
|
1219 | uint8 eentrysize; |
|
|
1220 | uint16 ewhatstart, ewhatflag; |
|
|
1221 | uint8 extendedinfos; |
|
|
1222 | maptile *m; |
|
|
1223 | |
|
|
1224 | client &socket = *pl->contr->ns; |
|
|
1225 | |
|
|
1226 | if (!pl->active) |
926 | if (!pl->observe->active) |
1227 | return; |
927 | return; |
1228 | |
|
|
1229 | check_map_change (pl->contr); |
|
|
1230 | prefetch_surrounding_maps (pl); |
|
|
1231 | |
|
|
1232 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
|
|
1233 | packet esl; |
|
|
1234 | |
|
|
1235 | startlen = sl.length (); |
|
|
1236 | |
|
|
1237 | /*Extendedmapinfo structure initialisation */ |
|
|
1238 | if (socket.ext_mapinfos) |
|
|
1239 | { |
|
|
1240 | extendedinfos = EMI_NOREDRAW; |
|
|
1241 | |
|
|
1242 | if (socket.EMI_smooth) |
|
|
1243 | extendedinfos |= EMI_SMOOTH; |
|
|
1244 | |
|
|
1245 | ewhatstart = esl.length (); |
|
|
1246 | ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit |
|
|
1247 | could need to be taken away */ |
|
|
1248 | eentrysize = getExtendedMapInfoSize (&socket); |
|
|
1249 | esl << "mapextended " |
|
|
1250 | << uint8 (extendedinfos) |
|
|
1251 | << uint8 (eentrysize); |
|
|
1252 | |
|
|
1253 | estartlen = esl.length (); |
|
|
1254 | } |
|
|
1255 | else |
|
|
1256 | { |
|
|
1257 | /* suppress compiler warnings */ |
|
|
1258 | ewhatstart = 0; |
|
|
1259 | ewhatflag = 0; |
|
|
1260 | estartlen = 0; |
|
|
1261 | } |
|
|
1262 | |
|
|
1263 | /* x,y are the real map locations. ax, ay are viewport relative |
|
|
1264 | * locations. |
|
|
1265 | */ |
|
|
1266 | ay = 0; |
|
|
1267 | |
|
|
1268 | /* We could do this logic as conditionals in the if statement, |
|
|
1269 | * but that started to get a bit messy to look at. |
|
|
1270 | */ |
|
|
1271 | max_x = pl->x + (socket.mapx + 1) / 2; |
|
|
1272 | max_y = pl->y + (socket.mapy + 1) / 2; |
|
|
1273 | |
|
|
1274 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
|
|
1275 | { |
|
|
1276 | ax = 0; |
|
|
1277 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
|
|
1278 | { |
|
|
1279 | int emask, mask; |
|
|
1280 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1281 | |
|
|
1282 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
|
|
1283 | |
|
|
1284 | /* If the coordinates are not valid, or it is too dark to see, |
|
|
1285 | * we tell the client as such |
|
|
1286 | */ |
|
|
1287 | nx = x; |
|
|
1288 | ny = y; |
|
|
1289 | m = get_map_from_coord (pl->map, &nx, &ny); |
|
|
1290 | |
|
|
1291 | if (!m) |
|
|
1292 | { |
|
|
1293 | /* space is out of map. Update space and clear values |
|
|
1294 | * if this hasn't already been done. If the space is out |
|
|
1295 | * of the map, it shouldn't have a head |
|
|
1296 | */ |
|
|
1297 | if (lastcell.count != -1) |
|
|
1298 | { |
|
|
1299 | sl << uint16 (mask); |
|
|
1300 | map_clearcell (&lastcell, -1); |
|
|
1301 | } |
|
|
1302 | |
|
|
1303 | continue; |
|
|
1304 | } |
|
|
1305 | |
|
|
1306 | m->touch (); |
|
|
1307 | |
|
|
1308 | int d = pl->contr->blocked_los[ax][ay]; |
|
|
1309 | |
|
|
1310 | if (d > 3) |
|
|
1311 | { |
|
|
1312 | |
|
|
1313 | int need_send = 0, count; |
|
|
1314 | |
|
|
1315 | /* This block deals with spaces that are not visible for whatever |
|
|
1316 | * reason. Still may need to send the head for this space. |
|
|
1317 | */ |
|
|
1318 | |
|
|
1319 | oldlen = sl.length (); |
|
|
1320 | |
|
|
1321 | sl << uint16 (mask); |
|
|
1322 | |
|
|
1323 | if (lastcell.count != -1) |
|
|
1324 | need_send = 1; |
|
|
1325 | |
|
|
1326 | count = -1; |
|
|
1327 | |
|
|
1328 | /* properly clear a previously sent big face */ |
|
|
1329 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
|
|
1330 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
|
|
1331 | need_send = 1; |
|
|
1332 | |
|
|
1333 | map_clearcell (&lastcell, count); |
|
|
1334 | |
|
|
1335 | if ((mask & 0xf) || need_send) |
|
|
1336 | sl[oldlen + 1] = mask & 0xff; |
|
|
1337 | else |
|
|
1338 | sl.reset (oldlen); |
|
|
1339 | } |
|
|
1340 | else |
|
|
1341 | { |
|
|
1342 | /* In this block, the space is visible. |
|
|
1343 | */ |
|
|
1344 | |
|
|
1345 | /* Rather than try to figure out what everything that we might |
|
|
1346 | * need to send is, then form the packet after that, |
|
|
1347 | * we presume that we will in fact form a packet, and update |
|
|
1348 | * the bits by what we do actually send. If we send nothing, |
|
|
1349 | * we just back out sl.length () to the old value, and no harm |
|
|
1350 | * is done. |
|
|
1351 | * I think this is simpler than doing a bunch of checks to see |
|
|
1352 | * what if anything we need to send, setting the bits, then |
|
|
1353 | * doing those checks again to add the real data. |
|
|
1354 | */ |
|
|
1355 | oldlen = sl.length (); |
|
|
1356 | eoldlen = esl.length (); |
|
|
1357 | |
|
|
1358 | sl << uint16 (mask); |
|
|
1359 | |
|
|
1360 | unsigned char dummy; |
|
|
1361 | unsigned char *last_ext = &dummy; |
|
|
1362 | |
|
|
1363 | /* Darkness changed */ |
|
|
1364 | if (lastcell.count != d && socket.darkness) |
|
|
1365 | { |
|
|
1366 | mask |= 0x8; |
|
|
1367 | |
|
|
1368 | if (socket.extmap) |
|
|
1369 | { |
|
|
1370 | *last_ext |= 0x80; |
|
|
1371 | last_ext = &sl[sl.length ()]; |
|
|
1372 | sl << uint8 (d); |
|
|
1373 | } |
|
|
1374 | else |
|
|
1375 | sl << uint8 (255 - 64 * d); |
|
|
1376 | } |
|
|
1377 | |
|
|
1378 | lastcell.count = d; |
|
|
1379 | |
|
|
1380 | mapspace &ms = m->at (nx, ny); |
|
|
1381 | |
|
|
1382 | if (socket.extmap) |
|
|
1383 | { |
|
|
1384 | uint8 stat_hp = 0; |
|
|
1385 | uint8 stat_width = 0; |
|
|
1386 | uint8 flags = 0; |
|
|
1387 | UUID player = 0; |
|
|
1388 | |
|
|
1389 | // send hp information, if applicable |
|
|
1390 | if (object *op = ms.faces_obj [0]) |
|
|
1391 | { |
|
|
1392 | if (op->head || op->invisible) |
|
|
1393 | ; // do not show |
|
|
1394 | else if (op->type == PLAYER |
|
|
1395 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
|
|
1396 | { |
|
|
1397 | if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
|
|
1398 | { |
|
|
1399 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1400 | stat_width = op->arch->tail_x; |
|
|
1401 | } |
|
|
1402 | } |
|
|
1403 | |
|
|
1404 | if (op->msg && op->msg[0] == '@') |
|
|
1405 | flags |= 1; |
|
|
1406 | |
|
|
1407 | if (op->type == PLAYER && op != pl) |
|
|
1408 | player = op->count; |
|
|
1409 | } |
|
|
1410 | |
|
|
1411 | if (lastcell.stat_hp != stat_hp) |
|
|
1412 | { |
|
|
1413 | lastcell.stat_hp = stat_hp; |
|
|
1414 | |
|
|
1415 | mask |= 0x8; |
|
|
1416 | *last_ext |= 0x80; |
|
|
1417 | last_ext = &sl[sl.length ()]; |
|
|
1418 | |
|
|
1419 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1420 | |
|
|
1421 | if (stat_width > 1) |
|
|
1422 | { |
|
|
1423 | *last_ext |= 0x80; |
|
|
1424 | last_ext = &sl[sl.length ()]; |
|
|
1425 | |
|
|
1426 | sl << uint8 (6) << uint8 (stat_width); |
|
|
1427 | } |
|
|
1428 | } |
|
|
1429 | |
|
|
1430 | if (lastcell.player != player) |
|
|
1431 | { |
|
|
1432 | lastcell.player = player; |
|
|
1433 | |
|
|
1434 | mask |= 0x8; |
|
|
1435 | *last_ext |= 0x80; |
|
|
1436 | last_ext = &sl[sl.length ()]; |
|
|
1437 | |
|
|
1438 | sl << uint8 (0x47) << uint8 (8) << (uint64)player; |
|
|
1439 | } |
|
|
1440 | |
|
|
1441 | if (lastcell.flags != flags) |
|
|
1442 | { |
|
|
1443 | lastcell.flags = flags; |
|
|
1444 | |
|
|
1445 | mask |= 0x8; |
|
|
1446 | *last_ext |= 0x80; |
|
|
1447 | last_ext = &sl[sl.length ()]; |
|
|
1448 | |
|
|
1449 | sl << uint8 (8) << uint8 (flags); |
|
|
1450 | } |
|
|
1451 | } |
|
|
1452 | |
|
|
1453 | /* Floor face */ |
|
|
1454 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1455 | mask |= 0x4; |
|
|
1456 | |
|
|
1457 | /* Middle face */ |
|
|
1458 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1459 | mask |= 0x2; |
|
|
1460 | |
|
|
1461 | if (ms.player () == pl |
|
|
1462 | && (pl->invisible & (pl->invisible < 50 ? 1 : 7))) |
|
|
1463 | { |
|
|
1464 | // force player to be visible to himself if invisible |
|
|
1465 | if (lastcell.faces[0] != pl->face) |
|
|
1466 | { |
|
|
1467 | lastcell.faces[0] = pl->face; |
|
|
1468 | |
|
|
1469 | mask |= 0x1; |
|
|
1470 | sl << uint16 (pl->face); |
|
|
1471 | |
|
|
1472 | socket.send_faces (pl); |
|
|
1473 | } |
|
|
1474 | } |
|
|
1475 | /* Top face */ |
|
|
1476 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1477 | mask |= 0x1; |
|
|
1478 | |
|
|
1479 | |
|
|
1480 | /* Check to see if we are in fact sending anything for this |
|
|
1481 | * space by checking the mask. If so, update the mask. |
|
|
1482 | * if not, reset the len to that from before adding the mask |
|
|
1483 | * value, so we don't send those bits. |
|
|
1484 | */ |
|
|
1485 | if (mask & 0xf) |
|
|
1486 | sl[oldlen + 1] = mask & 0xff; |
|
|
1487 | else |
|
|
1488 | sl.reset (oldlen); |
|
|
1489 | |
|
|
1490 | if (socket.ext_mapinfos) |
|
|
1491 | esl << uint16 (emask); |
|
|
1492 | |
|
|
1493 | if (socket.EMI_smooth) |
|
|
1494 | { |
|
|
1495 | for (int layer = 2+1; layer--; ) |
|
|
1496 | { |
|
|
1497 | object *ob = ms.faces_obj [layer]; |
|
|
1498 | |
|
|
1499 | // If there is no object for this space, or if the face for the object |
|
|
1500 | // is the blank face, set the smoothlevel to zero. |
|
|
1501 | int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
|
|
1502 | |
|
|
1503 | // We've gotten what face we want to use for the object. Now see if |
|
|
1504 | // if it has changed since we last sent it to the client. |
|
|
1505 | if (lastcell.smooth[layer] != smoothlevel) |
|
|
1506 | { |
|
|
1507 | lastcell.smooth[layer] = smoothlevel; |
|
|
1508 | esl << uint8 (smoothlevel); |
|
|
1509 | emask |= 1 << layer; |
|
|
1510 | } |
|
|
1511 | } |
|
|
1512 | |
|
|
1513 | if (emask & 0xf) |
|
|
1514 | esl[eoldlen + 1] = emask & 0xff; |
|
|
1515 | else |
|
|
1516 | esl.reset (eoldlen); |
|
|
1517 | } |
|
|
1518 | } /* else this is a viewable space */ |
|
|
1519 | } /* for x loop */ |
|
|
1520 | } /* for y loop */ |
|
|
1521 | |
|
|
1522 | /* Verify that we in fact do need to send this */ |
|
|
1523 | if (socket.ext_mapinfos) |
|
|
1524 | { |
|
|
1525 | if (!(sl.length () > startlen || socket.sent_scroll)) |
|
|
1526 | { |
|
|
1527 | /* No map data will follow, so don't say the client |
|
|
1528 | * it doesn't need draw! |
|
|
1529 | */ |
|
|
1530 | ewhatflag &= ~EMI_NOREDRAW; |
|
|
1531 | esl[ewhatstart + 1] = ewhatflag & 0xff; |
|
|
1532 | } |
|
|
1533 | |
|
|
1534 | if (esl.length () > estartlen) |
|
|
1535 | socket.send_packet (esl); |
|
|
1536 | } |
|
|
1537 | |
|
|
1538 | if (sl.length () > startlen || socket.sent_scroll) |
|
|
1539 | { |
|
|
1540 | socket.send_packet (sl); |
|
|
1541 | socket.sent_scroll = 0; |
|
|
1542 | } |
|
|
1543 | } |
|
|
1544 | |
|
|
1545 | /** |
|
|
1546 | * Draws client map. |
|
|
1547 | */ |
|
|
1548 | void |
|
|
1549 | draw_client_map (object *pl) |
|
|
1550 | { |
|
|
1551 | int i, j; |
|
|
1552 | sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */ |
|
|
1553 | int mflags; |
|
|
1554 | struct Map newmap; |
|
|
1555 | maptile *m, *pm; |
|
|
1556 | |
|
|
1557 | if (pl->type != PLAYER) |
|
|
1558 | { |
|
|
1559 | LOG (llevError, "draw_client_map called with non player/non eric-server\n"); |
|
|
1560 | return; |
|
|
1561 | } |
|
|
1562 | |
|
|
1563 | pm = pl->map; |
|
|
1564 | |
928 | |
1565 | /* If player is just joining the game, he isn't here yet, so the map |
929 | /* If player is just joining the game, he isn't here yet, so the map |
1566 | * can get swapped out. If so, don't try to send them a map. All will |
930 | * can get swapped out. If so, don't try to send them a map. All will |
1567 | * be OK once they really log in. |
931 | * be OK once they really log in. |
1568 | */ |
932 | */ |
1569 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
933 | if (!ob->map || ob->map->in_memory != MAP_ACTIVE) |
1570 | return; |
934 | return; |
1571 | |
935 | |
1572 | memset (&newmap, 0, sizeof (struct Map)); |
936 | int startlen, oldlen; |
1573 | |
937 | |
1574 | for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) |
938 | check_map_change (pl); |
1575 | for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) |
939 | prefetch_surrounding_maps (pl->ob); |
|
|
940 | |
|
|
941 | /* do LOS after calls to update_position */ |
|
|
942 | /* unfortunately, we need to udpate los when observing, currently */ |
|
|
943 | if (pl->do_los || pl->viewpoint != pl->ob) |
|
|
944 | { |
|
|
945 | pl->do_los = 0; |
|
|
946 | pl->update_los (); |
|
|
947 | } |
|
|
948 | |
|
|
949 | /** |
|
|
950 | * This function uses the new map1 protocol command to send the map |
|
|
951 | * to the client. It is necessary because the old map command supports |
|
|
952 | * a maximum map size of 15x15. |
|
|
953 | * This function is much simpler than the old one. This is because |
|
|
954 | * the old function optimized to send as few face identifiers as possible, |
|
|
955 | * at the expense of sending more coordinate location (coordinates were |
|
|
956 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
957 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
958 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
959 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
960 | * of what we send, see the doc/Protocol file. |
|
|
961 | * I will describe internally what we do: |
|
|
962 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
963 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
964 | * maximum viewable size (As set in config.h). |
|
|
965 | * in the cells, there are faces and a count value. |
|
|
966 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
967 | * is not viewable. |
|
|
968 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
969 | * look like. |
|
|
970 | */ |
|
|
971 | |
|
|
972 | client &socket = *pl->ns; |
|
|
973 | |
|
|
974 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
|
|
975 | |
|
|
976 | startlen = sl.length (); |
|
|
977 | |
|
|
978 | int hx = socket.mapx / 2; |
|
|
979 | int hy = socket.mapy / 2; |
|
|
980 | |
|
|
981 | ordered_mapwalk_begin (ob, -hx, -hy, hx, hy) |
|
|
982 | int ax = dx + hx; |
|
|
983 | int ay = dy + hy; |
|
|
984 | |
|
|
985 | int mask = (ax << 10) | (ay << 4); |
|
|
986 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
|
|
987 | |
|
|
988 | /* If the coordinates are not valid, or it is too dark to see, |
|
|
989 | * we tell the client as such |
|
|
990 | */ |
|
|
991 | if (!m) |
1576 | { |
992 | { |
1577 | ax = i; |
993 | /* space is out of map. Update space and clear values |
1578 | ay = j; |
994 | * if this hasn't already been done. If the space is out |
1579 | m = pm; |
995 | * of the map, it shouldn't have a head. |
1580 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
|
|
1581 | |
|
|
1582 | if (mflags & P_OUT_OF_MAP) |
|
|
1583 | continue; |
|
|
1584 | |
|
|
1585 | /* If a map is visible to the player, we don't want to swap it out |
|
|
1586 | * just to reload it. This should really call something like |
|
|
1587 | * swap_map, but this is much more efficient and 'good enough' |
|
|
1588 | */ |
996 | */ |
1589 | if (mflags & P_NEW_MAP) |
997 | if (lastcell.count != -1) |
1590 | m->timeout = 50; |
998 | { |
|
|
999 | sl << uint16 (mask); |
|
|
1000 | map_clearcell (&lastcell, -1); |
|
|
1001 | } |
|
|
1002 | |
|
|
1003 | continue; |
1591 | } |
1004 | } |
1592 | |
1005 | |
1593 | /* do LOS after calls to update_position */ |
1006 | int d = pl->blocked_los_uc (dx, dy); |
1594 | if (pl->contr->do_los) |
1007 | |
|
|
1008 | if (d > 3) |
1595 | { |
1009 | { |
1596 | update_los (pl); |
1010 | /* This block deals with spaces that are not visible for whatever |
1597 | pl->contr->do_los = 0; |
1011 | * reason. Still may need to send the head for this space. |
|
|
1012 | */ |
|
|
1013 | if (lastcell.count != -1 |
|
|
1014 | || lastcell.faces[0] |
|
|
1015 | || lastcell.faces[1] |
|
|
1016 | || lastcell.faces[2] |
|
|
1017 | || lastcell.stat_hp |
|
|
1018 | || lastcell.flags |
|
|
1019 | || lastcell.player) |
|
|
1020 | sl << uint16 (mask); |
|
|
1021 | |
|
|
1022 | /* properly clear a previously sent big face */ |
|
|
1023 | map_clearcell (&lastcell, -1); |
1598 | } |
1024 | } |
1599 | |
1025 | else |
1600 | /* Big maps need a different drawing mechanism to work */ |
|
|
1601 | draw_client_map1 (pl); |
|
|
1602 | } |
|
|
1603 | |
|
|
1604 | |
|
|
1605 | /*****************************************************************************/ |
|
|
1606 | |
|
|
1607 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
|
|
1608 | |
|
|
1609 | /* a player. Of course, the client need to know the command to be able to */ |
|
|
1610 | |
|
|
1611 | /* manage it ! */ |
|
|
1612 | |
|
|
1613 | /*****************************************************************************/ |
|
|
1614 | void |
|
|
1615 | send_plugin_custom_message (object *pl, char *buf) |
|
|
1616 | { |
|
|
1617 | pl->contr->ns->send_packet (buf); |
|
|
1618 | } |
|
|
1619 | |
|
|
1620 | /** |
|
|
1621 | * This sends the skill number to name mapping. We ignore |
|
|
1622 | * the params - we always send the same info no matter what. |
|
|
1623 | */ |
|
|
1624 | void |
|
|
1625 | send_skill_info (client *ns, char *params) |
|
|
1626 | { |
|
|
1627 | packet sl; |
|
|
1628 | sl << "replyinfo skill_info\n"; |
|
|
1629 | |
|
|
1630 | for (int i = 1; i < NUM_SKILLS; i++) |
|
|
1631 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
|
|
1632 | |
|
|
1633 | if (sl.length () >= MAXSOCKBUF) |
|
|
1634 | { |
1026 | { |
1635 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1027 | /* In this block, the space is visible. |
1636 | fatal (0); |
1028 | */ |
|
|
1029 | |
|
|
1030 | /* Rather than try to figure out what everything that we might |
|
|
1031 | * need to send is, then form the packet after that, |
|
|
1032 | * we presume that we will in fact form a packet, and update |
|
|
1033 | * the bits by what we do actually send. If we send nothing, |
|
|
1034 | * we just back out sl.length () to the old value, and no harm |
|
|
1035 | * is done. |
|
|
1036 | * I think this is simpler than doing a bunch of checks to see |
|
|
1037 | * what if anything we need to send, setting the bits, then |
|
|
1038 | * doing those checks again to add the real data. |
|
|
1039 | */ |
|
|
1040 | oldlen = sl.length (); |
|
|
1041 | |
|
|
1042 | sl << uint16 (mask); |
|
|
1043 | |
|
|
1044 | unsigned char dummy; |
|
|
1045 | unsigned char *last_ext = &dummy; |
|
|
1046 | |
|
|
1047 | /* Darkness changed */ |
|
|
1048 | if (lastcell.count != d) |
|
|
1049 | { |
|
|
1050 | mask |= 0x8; |
|
|
1051 | |
|
|
1052 | *last_ext |= 0x80; |
|
|
1053 | last_ext = &sl[sl.length ()]; |
|
|
1054 | sl << uint8 (d); |
|
|
1055 | } |
|
|
1056 | |
|
|
1057 | lastcell.count = d; |
|
|
1058 | |
|
|
1059 | mapspace &ms = m->at (nx, ny); |
|
|
1060 | ms.update (); |
|
|
1061 | |
|
|
1062 | // extmap handling |
|
|
1063 | uint8 stat_hp = 0; |
|
|
1064 | uint8 stat_width = 0; |
|
|
1065 | uint8 flags = 0; |
|
|
1066 | tag_t player = 0; |
|
|
1067 | |
|
|
1068 | // send hp information, if applicable |
|
|
1069 | if (object *op = ms.faces_obj [0]) |
|
|
1070 | if (op->is_head () && !op->invisible) |
|
|
1071 | { |
|
|
1072 | if (op->stats.maxhp > op->stats.hp |
|
|
1073 | && op->stats.maxhp > 0 |
|
|
1074 | && (op->type == PLAYER |
|
|
1075 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1076 | || op->flag [FLAG_MONSTER] |
|
|
1077 | || op->flag [FLAG_ALIVE] |
|
|
1078 | || op->flag [FLAG_GENERATOR])) |
|
|
1079 | { |
|
|
1080 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1081 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1082 | } |
|
|
1083 | |
|
|
1084 | if (expect_false (op->has_dialogue ())) |
|
|
1085 | flags |= 1; |
|
|
1086 | |
|
|
1087 | if (expect_false (op->type == PLAYER)) |
|
|
1088 | player = op == ob ? pl->ob->count |
|
|
1089 | : op == pl->ob ? ob->count |
|
|
1090 | : op->count; |
|
|
1091 | } |
|
|
1092 | |
|
|
1093 | if (expect_false (lastcell.stat_hp != stat_hp)) |
|
|
1094 | { |
|
|
1095 | lastcell.stat_hp = stat_hp; |
|
|
1096 | |
|
|
1097 | mask |= 0x8; |
|
|
1098 | *last_ext |= 0x80; |
|
|
1099 | last_ext = &sl[sl.length ()]; |
|
|
1100 | |
|
|
1101 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1102 | |
|
|
1103 | if (stat_width > 1) |
|
|
1104 | { |
|
|
1105 | *last_ext |= 0x80; |
|
|
1106 | last_ext = &sl[sl.length ()]; |
|
|
1107 | |
|
|
1108 | sl << uint8 (6) << uint8 (stat_width); |
|
|
1109 | } |
|
|
1110 | } |
|
|
1111 | |
|
|
1112 | if (expect_false (lastcell.player != player)) |
|
|
1113 | { |
|
|
1114 | lastcell.player = player; |
|
|
1115 | |
|
|
1116 | mask |= 0x8; |
|
|
1117 | *last_ext |= 0x80; |
|
|
1118 | last_ext = &sl[sl.length ()]; |
|
|
1119 | |
|
|
1120 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1121 | } |
|
|
1122 | |
|
|
1123 | if (expect_false (lastcell.flags != flags)) |
|
|
1124 | { |
|
|
1125 | lastcell.flags = flags; |
|
|
1126 | |
|
|
1127 | mask |= 0x8; |
|
|
1128 | *last_ext |= 0x80; |
|
|
1129 | last_ext = &sl[sl.length ()]; |
|
|
1130 | |
|
|
1131 | sl << uint8 (8) << uint8 (flags); |
|
|
1132 | } |
|
|
1133 | |
|
|
1134 | // faces |
|
|
1135 | |
|
|
1136 | /* Floor face */ |
|
|
1137 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1138 | mask |= 0x4; |
|
|
1139 | |
|
|
1140 | /* Middle face */ |
|
|
1141 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1142 | mask |= 0x2; |
|
|
1143 | |
|
|
1144 | if (expect_false (ob->invisible) |
|
|
1145 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
|
|
1146 | && ms.player () == ob) |
|
|
1147 | { |
|
|
1148 | // force player to be visible to himself if invisible |
|
|
1149 | if (lastcell.faces[0] != ob->face) |
|
|
1150 | { |
|
|
1151 | lastcell.faces[0] = ob->face; |
|
|
1152 | |
|
|
1153 | mask |= 0x1; |
|
|
1154 | sl << uint16 (ob->face); |
|
|
1155 | |
|
|
1156 | socket.send_faces (ob); |
|
|
1157 | } |
|
|
1158 | } |
|
|
1159 | /* Top face */ |
|
|
1160 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1161 | mask |= 0x1; |
|
|
1162 | |
|
|
1163 | /* Check to see if we are in fact sending anything for this |
|
|
1164 | * space by checking the mask. If so, update the mask. |
|
|
1165 | * if not, reset the len to that from before adding the mask |
|
|
1166 | * value, so we don't send those bits. |
|
|
1167 | */ |
|
|
1168 | if (mask & 0xf) |
|
|
1169 | sl[oldlen + 1] = mask & 0xff; |
|
|
1170 | else |
|
|
1171 | sl.reset (oldlen); |
|
|
1172 | } /* else this is a viewable space */ |
|
|
1173 | ordered_mapwalk_end |
|
|
1174 | |
|
|
1175 | socket.flush_fx (); |
|
|
1176 | |
|
|
1177 | if (sl.length () > startlen || socket.sent_scroll) |
1637 | } |
1178 | { |
1638 | |
|
|
1639 | ns->send_packet (sl); |
1179 | socket.send_packet (sl); |
1640 | } |
1180 | socket.sent_scroll = 0; |
1641 | |
|
|
1642 | /** |
|
|
1643 | * This sends the spell path to name mapping. We ignore |
|
|
1644 | * the params - we always send the same info no matter what. |
|
|
1645 | */ |
|
|
1646 | void |
|
|
1647 | send_spell_paths (client * ns, char *params) |
|
|
1648 | { |
|
|
1649 | packet sl; |
|
|
1650 | |
|
|
1651 | sl << "replyinfo spell_paths\n"; |
|
|
1652 | |
|
|
1653 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
1654 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
1655 | |
|
|
1656 | if (sl.length () >= MAXSOCKBUF) |
|
|
1657 | { |
1181 | } |
1658 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
1659 | fatal (0); |
|
|
1660 | } |
|
|
1661 | |
|
|
1662 | ns->send_packet (sl); |
|
|
1663 | } |
1182 | } |
1664 | |
1183 | |
1665 | /** |
1184 | /** |
1666 | * This looks for any spells the player may have that have changed their stats. |
1185 | * This looks for any spells the player may have that have changed their stats. |
1667 | * it then sends an updspell packet for each spell that has changed in this way |
1186 | * it then sends an updspell packet for each spell that has changed in this way |
… | |
… | |
1670 | esrv_update_spells (player *pl) |
1189 | esrv_update_spells (player *pl) |
1671 | { |
1190 | { |
1672 | if (!pl->ns) |
1191 | if (!pl->ns) |
1673 | return; |
1192 | return; |
1674 | |
1193 | |
|
|
1194 | pl->ns->update_spells = false; |
|
|
1195 | |
1675 | if (!pl->ns->monitor_spells) |
1196 | if (!pl->ns->monitor_spells) |
1676 | return; |
1197 | return; |
1677 | |
1198 | |
1678 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1199 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1679 | { |
|
|
1680 | if (spell->type == SPELL) |
1200 | if (spell->type == SPELL) |
1681 | { |
1201 | { |
1682 | int flags = 0; |
1202 | int flags = 0; |
|
|
1203 | int val; |
1683 | |
1204 | |
1684 | /* check if we need to update it */ |
1205 | /* check if we need to update it */ |
1685 | if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1206 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
|
|
1207 | if (spell->cached_sp != val) |
1686 | { |
1208 | { |
1687 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1209 | spell->cached_sp = val; |
1688 | flags |= UPD_SP_MANA; |
1210 | flags |= UPD_SP_MANA; |
1689 | } |
1211 | } |
1690 | |
1212 | |
1691 | if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1213 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
|
|
1214 | if (spell->cached_grace != val) |
1692 | { |
1215 | { |
1693 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1216 | spell->cached_grace = val; |
1694 | flags |= UPD_SP_GRACE; |
1217 | flags |= UPD_SP_GRACE; |
1695 | } |
1218 | } |
1696 | |
1219 | |
1697 | if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1220 | val = casting_level (pl->ob, spell); |
|
|
1221 | if (spell->cached_eat != val) |
1698 | { |
1222 | { |
1699 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1223 | spell->cached_eat = val; |
1700 | flags |= UPD_SP_DAMAGE; |
1224 | flags |= UPD_SP_LEVEL; |
1701 | } |
1225 | } |
1702 | |
1226 | |
1703 | if (flags) |
1227 | if (flags) |
1704 | { |
1228 | { |
1705 | packet sl; |
1229 | packet sl; |
1706 | |
1230 | |
1707 | sl << "updspell " |
1231 | sl << "updspell " |
1708 | << uint8 (flags) |
1232 | << uint8 (flags) |
1709 | << uint32 (spell->count); |
1233 | << uint32 (spell->count); |
1710 | |
1234 | |
1711 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1235 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
1712 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1236 | if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace); |
1713 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1237 | if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat); |
1714 | |
1238 | |
1715 | pl->ns->send_packet (sl); |
1239 | pl->ns->send_packet (sl); |
1716 | } |
1240 | } |
1717 | } |
1241 | } |
1718 | } |
|
|
1719 | } |
1242 | } |
1720 | |
1243 | |
1721 | void |
1244 | void |
1722 | esrv_remove_spell (player *pl, object *spell) |
1245 | esrv_remove_spell (player *pl, object *spell) |
1723 | { |
1246 | { |
… | |
… | |
1748 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1271 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1749 | return; |
1272 | return; |
1750 | } |
1273 | } |
1751 | |
1274 | |
1752 | /* store costs and damage in the object struct, to compare to later */ |
1275 | /* store costs and damage in the object struct, to compare to later */ |
1753 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1276 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1754 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1277 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1755 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1278 | spell->cached_eat = casting_level (pl->ob, spell); |
1756 | |
1279 | |
1757 | /* figure out which skill it uses, if it uses one */ |
1280 | /* figure out which skill it uses, if it uses one */ |
1758 | if (spell->skill) |
1281 | if (spell->skill) |
1759 | { |
1282 | if (object *tmp = pl->find_skill (spell->skill)) |
1760 | for (i = 1; i < NUM_SKILLS; i++) |
1283 | skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp); |
1761 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1762 | { |
|
|
1763 | skill = i + CS_STAT_SKILLINFO; |
|
|
1764 | break; |
|
|
1765 | } |
|
|
1766 | } |
|
|
1767 | |
1284 | |
1768 | // spells better have a face |
1285 | // spells better have a face |
1769 | if (!spell->face) |
1286 | if (!spell->face) |
1770 | { |
1287 | { |
1771 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1288 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1772 | spell->face = face_find ("burnout.x11", blank_face); |
1289 | spell->face = face_find ("burnout.x11", blank_face); |
1773 | } |
1290 | } |
|
|
1291 | |
|
|
1292 | pl->ns->send_face (spell->face); |
1774 | |
1293 | |
1775 | /* send the current values */ |
1294 | /* send the current values */ |
1776 | sl << uint32 (spell->count) |
1295 | sl << uint32 (spell->count) |
1777 | << uint16 (spell->level) |
1296 | << uint16 (spell->level) |
1778 | << uint16 (spell->casting_time) |
1297 | << uint16 (spell->casting_time) |
1779 | << uint16 (spell->last_sp) |
1298 | << uint16 (spell->cached_sp) |
1780 | << uint16 (spell->last_grace) |
1299 | << uint16 (spell->cached_grace) |
1781 | << uint16 (spell->last_eat) |
1300 | << uint16 (spell->cached_eat) |
1782 | << uint8 (skill) |
1301 | << uint8 (skill) |
1783 | << uint32 (spell->path_attuned) |
1302 | << uint32 (spell->path_attuned) |
1784 | << uint32 (spell->face) |
1303 | << uint32 (spell->face) |
1785 | << data8 (spell->name) |
1304 | << data8 (spell->name) |
1786 | << data16 (spell->msg); |
1305 | << data16 (spell->msg); |
… | |
… | |
1814 | * bytes and 3 strings (because that is the spec) so we need to |
1333 | * bytes and 3 strings (because that is the spec) so we need to |
1815 | * check that the length of those 3 strings, plus the 23 bytes, |
1334 | * check that the length of those 3 strings, plus the 23 bytes, |
1816 | * won't take us over the length limit for the socket, if it does, |
1335 | * won't take us over the length limit for the socket, if it does, |
1817 | * we need to send what we already have, and restart packet formation |
1336 | * we need to send what we already have, and restart packet formation |
1818 | */ |
1337 | */ |
|
|
1338 | if (spell->type != SPELL) |
|
|
1339 | continue; |
|
|
1340 | |
1819 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1341 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1820 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1342 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1821 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1343 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1822 | * like it will fix this |
1344 | * like it will fix this |
1823 | */ |
1345 | */ |
1824 | if (spell->type != SPELL) |
|
|
1825 | continue; |
|
|
1826 | |
|
|
1827 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1346 | if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1828 | { |
1347 | { |
|
|
1348 | pl->ns->flush_fx (); |
1829 | pl->ns->send_packet (sl); |
1349 | pl->ns->send_packet (sl); |
1830 | |
1350 | |
1831 | sl.reset (); |
1351 | sl.reset (); |
1832 | sl << "addspell "; |
1352 | sl << "addspell "; |
1833 | } |
1353 | } |
… | |
… | |
1841 | return; |
1361 | return; |
1842 | } |
1362 | } |
1843 | else |
1363 | else |
1844 | append_spell (pl, sl, spell); |
1364 | append_spell (pl, sl, spell); |
1845 | |
1365 | |
1846 | if (sl.length () >= MAXSOCKBUF) |
1366 | if (sl.length () > MAXSOCKBUF) |
1847 | { |
1367 | { |
1848 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1368 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1849 | fatal (0); |
1369 | fatal (0); |
1850 | } |
1370 | } |
1851 | |
1371 | |
1852 | /* finally, we can send the packet */ |
1372 | /* finally, we can send the packet */ |
|
|
1373 | pl->ns->flush_fx (); |
1853 | pl->ns->send_packet (sl); |
1374 | pl->ns->send_packet (sl); |
1854 | } |
1375 | } |
1855 | |
1376 | |
|
|
1377 | //-GPL |
|
|
1378 | |