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,2011,2012 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 | * |
|
|
18 | * You should have received a copy of the GNU General Public License |
|
|
19 | * along with this program; if not, write to the Free Software |
|
|
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
17 | * |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
18 | * You should have received a copy of the Affero GNU General Public License |
|
|
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
23 | */ |
21 | * |
|
|
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
|
|
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)); |
136 | |
149 | |
137 | if (pl->ns->newmapcmd == 1) |
150 | pl->ns->force_newmap = false; |
138 | pl->ns->send_packet ("newmap"); |
151 | pl->ns->send_packet ("newmap"); |
139 | |
|
|
140 | pl->ns->floorbox_reset (); |
152 | pl->ns->floorbox_reset (); |
|
|
153 | } |
|
|
154 | |
|
|
155 | static void |
|
|
156 | send_map_info (player *pl) |
|
|
157 | { |
|
|
158 | client &socket = *pl->ns; |
|
|
159 | object *ob = pl->viewpoint; |
|
|
160 | |
|
|
161 | if (socket.mapinfocmd) |
|
|
162 | { |
|
|
163 | if (ob->map && ob->map->path) |
|
|
164 | { |
|
|
165 | int flags = 0; |
|
|
166 | |
|
|
167 | // due to historical glitches, the bit ordering and map index ordering differs |
|
|
168 | if (ob->map->tile_path [TILE_NORTH]) flags |= 0x01; |
|
|
169 | if (ob->map->tile_path [TILE_EAST ]) flags |= 0x02; |
|
|
170 | if (ob->map->tile_path [TILE_SOUTH]) flags |= 0x04; |
|
|
171 | if (ob->map->tile_path [TILE_WEST ]) flags |= 0x08; |
|
|
172 | // these two are debatable |
|
|
173 | if (ob->map->tile_path [TILE_UP ]) flags |= 0x10; |
|
|
174 | if (ob->map->tile_path [TILE_DOWN ]) flags |= 0x20; |
|
|
175 | |
|
|
176 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
177 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
178 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
179 | } |
|
|
180 | else |
|
|
181 | socket.send_packet ("mapinfo current"); |
|
|
182 | } |
141 | } |
183 | } |
142 | |
184 | |
143 | /** check for map/region change and send new map data */ |
185 | /** check for map/region change and send new map data */ |
144 | static void |
186 | static void |
145 | check_map_change (player *pl) |
187 | check_map_change (player *pl) |
146 | { |
188 | { |
147 | client &socket = *pl->ns; |
189 | client &socket = *pl->ns; |
148 | object *ob = pl->ob; |
190 | object *ob = pl->viewpoint; |
149 | char buf[MAX_BUF]; /* eauugggh */ |
|
|
150 | |
191 | |
151 | if (socket.current_map != ob->map) |
192 | region *reg = ob->region (); |
|
|
193 | if (socket.current_region != reg) |
|
|
194 | { |
|
|
195 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
|
|
196 | socket.current_region = reg; |
152 | { |
197 | } |
|
|
198 | |
|
|
199 | // first try to avoid a full newmap on tiled map scrolls |
|
|
200 | if (socket.current_map != ob->map && !socket.force_newmap) |
|
|
201 | { |
|
|
202 | rv_vector rv; |
|
|
203 | |
|
|
204 | get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0); |
|
|
205 | |
|
|
206 | // manhattan distance is very handy here |
|
|
207 | if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient |
|
|
208 | { |
|
|
209 | socket.current_map = ob->map; |
|
|
210 | socket.current_x = ob->x; |
|
|
211 | socket.current_y = ob->y; |
|
|
212 | |
|
|
213 | socket_map_scroll (&socket, rv.distance_x, rv.distance_y); |
|
|
214 | socket.floorbox_reset (); |
|
|
215 | send_map_info (pl); |
|
|
216 | } |
|
|
217 | } |
|
|
218 | |
|
|
219 | if (socket.current_map != ob->map || socket.force_newmap) |
|
|
220 | { |
|
|
221 | clear_map (pl); |
153 | socket.current_map = ob->map; |
222 | socket.current_map = ob->map; |
154 | |
223 | 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 | } |
224 | } |
181 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
225 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
182 | { |
226 | { |
183 | int dx = ob->x - socket.current_x; |
227 | int dx = ob->x - socket.current_x; |
184 | int dy = ob->y - socket.current_y; |
228 | int dy = ob->y - socket.current_y; |
185 | |
229 | |
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); |
230 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
191 | socket.floorbox_reset (); |
231 | socket.floorbox_reset (); |
192 | } |
|
|
193 | } |
232 | } |
194 | |
233 | |
195 | socket.current_x = ob->x; |
234 | socket.current_x = ob->x; |
196 | socket.current_y = ob->y; |
235 | socket.current_y = ob->y; |
|
|
236 | } |
197 | |
237 | |
198 | region *reg = ob->region (); |
238 | /** |
199 | if (socket.current_region != reg) |
239 | * This sends the skill number to name mapping. We ignore |
200 | { |
240 | * the params - we always send the same info no matter what. |
201 | socket.current_region = reg; |
241 | */ |
202 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
242 | static void |
203 | } |
243 | send_skill_info (client *ns, char *params) |
|
|
244 | { |
|
|
245 | packet sl; |
|
|
246 | sl << "replyinfo skill_info\n"; |
|
|
247 | |
|
|
248 | for (int i = 0; i < skillvec.size (); ++i) |
|
|
249 | sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name); |
|
|
250 | |
|
|
251 | if (sl.length () > MAXSOCKBUF) |
|
|
252 | cleanup ("buffer overflow in send_skill_info!"); |
|
|
253 | |
|
|
254 | ns->send_packet (sl); |
|
|
255 | } |
|
|
256 | |
|
|
257 | /** |
|
|
258 | * This sends the spell path to name mapping. We ignore |
|
|
259 | * the params - we always send the same info no matter what. |
|
|
260 | */ |
|
|
261 | static void |
|
|
262 | send_spell_paths (client * ns, char *params) |
|
|
263 | { |
|
|
264 | packet sl; |
|
|
265 | |
|
|
266 | sl << "replyinfo spell_paths\n"; |
|
|
267 | |
|
|
268 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
269 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
270 | |
|
|
271 | if (sl.length () > MAXSOCKBUF) |
|
|
272 | cleanup ("buffer overflow in send_spell_paths!"); |
|
|
273 | |
|
|
274 | ns->send_packet (sl); |
204 | } |
275 | } |
205 | |
276 | |
206 | /** |
277 | /** |
207 | * RequestInfo is sort of a meta command. There is some specific |
278 | * RequestInfo is sort of a meta command. There is some specific |
208 | * request of information, but we call other functions to provide |
279 | * request of information, but we call other functions to provide |
209 | * that information. |
280 | * that information. |
|
|
281 | * requestinfo is completely deprecated, use resource exti request |
|
|
282 | * and the fxix or http protocols. |
210 | */ |
283 | */ |
211 | void |
284 | void |
212 | RequestInfo (char *buf, int len, client * ns) |
285 | RequestInfo (char *buf, int len, client *ns) |
213 | { |
286 | { |
214 | char *params = NULL, *cp; |
287 | 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 | |
288 | |
227 | /* find the first space, make it null, and update the |
289 | /* find the first space, make it null, and update the |
228 | * params pointer. |
290 | * params pointer. |
229 | */ |
291 | */ |
230 | for (cp = buf; *cp != '\0'; cp++) |
292 | for (params = buf; *params; params++) |
231 | if (*cp == ' ') |
293 | if (*params == ' ') |
232 | { |
294 | { |
233 | *cp = '\0'; |
|
|
234 | params = cp + 1; |
295 | *params++ = 0; |
235 | break; |
296 | break; |
236 | } |
297 | } |
237 | |
298 | |
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")) |
299 | if (!strcmp (buf, "skill_info")) |
243 | send_skill_info (ns, params); |
300 | send_skill_info (ns, params); |
244 | else if (!strcmp (buf, "spell_paths")) |
301 | else if (!strcmp (buf, "spell_paths")) |
245 | send_spell_paths (ns, params); |
302 | send_spell_paths (ns, params); |
246 | else |
303 | else |
247 | ns->send_packet (bigbuf, len); |
304 | { |
|
|
305 | // undo tokenisation above and send replyinfo with the request unchanged |
|
|
306 | if (*params) |
|
|
307 | *--params = ' '; |
|
|
308 | |
|
|
309 | ns->send_packet_printf ("replyinfo %s", buf); |
|
|
310 | } |
248 | } |
311 | } |
249 | |
312 | |
250 | void |
313 | void |
251 | ExtCmd (char *buf, int len, player *pl) |
314 | ExtCmd (char *buf, int len, player *pl) |
252 | { |
315 | { |
… | |
… | |
255 | |
318 | |
256 | void |
319 | void |
257 | ExtiCmd (char *buf, int len, client *ns) |
320 | ExtiCmd (char *buf, int len, client *ns) |
258 | { |
321 | { |
259 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
322 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
|
|
323 | } |
|
|
324 | |
|
|
325 | //-GPL |
|
|
326 | |
|
|
327 | void |
|
|
328 | client::mapinfo_queue_clear () |
|
|
329 | { |
|
|
330 | for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
|
|
331 | free (*i); |
|
|
332 | |
|
|
333 | mapinfo_queue.clear (); |
|
|
334 | } |
|
|
335 | |
|
|
336 | bool |
|
|
337 | client::mapinfo_try (char *buf) |
|
|
338 | { |
|
|
339 | char *token = buf; |
|
|
340 | buf += strlen (buf) + 9; |
|
|
341 | |
|
|
342 | // initial map and its origin |
|
|
343 | maptile *map = pl->viewpoint->map; |
|
|
344 | int mapx = pl->ns->mapx / 2 - pl->viewpoint->x; |
|
|
345 | int mapy = pl->ns->mapy / 2 - pl->viewpoint->y; |
|
|
346 | int max_distance = 8; // limit maximum path length to something generous |
|
|
347 | |
|
|
348 | while (*buf && map && max_distance) |
|
|
349 | { |
|
|
350 | int dir = *buf++ - '1'; |
|
|
351 | |
|
|
352 | // due to historical glitches, the mapinfo index and tile index differs |
|
|
353 | static unsigned char dirmap [] = { TILE_NORTH, TILE_EAST, TILE_SOUTH, TILE_WEST, TILE_UP, TILE_DOWN }; |
|
|
354 | |
|
|
355 | // maybe we should only allow the four flat directions |
|
|
356 | if (IN_RANGE_EXC (dir, 0, array_length (dirmap))) |
|
|
357 | { |
|
|
358 | dir = dirmap [dir]; |
|
|
359 | |
|
|
360 | if (!map->tile_path [dir]) |
|
|
361 | map = 0; |
|
|
362 | else if (map->tile_available (dir, false)) |
|
|
363 | { |
|
|
364 | maptile *neigh = map->tile_map [dir]; |
|
|
365 | |
|
|
366 | switch (dir) |
|
|
367 | { |
|
|
368 | case 0: mapy -= neigh->height; break; |
|
|
369 | case 2: mapy += map ->height; break; |
|
|
370 | case 3: mapx -= neigh->width ; break; |
|
|
371 | case 1: mapx += map ->width ; break; |
|
|
372 | } |
|
|
373 | |
|
|
374 | map = neigh; |
|
|
375 | --max_distance; |
|
|
376 | } |
|
|
377 | else |
|
|
378 | return 0; |
|
|
379 | } |
|
|
380 | else |
|
|
381 | max_distance = 0; |
|
|
382 | } |
|
|
383 | |
|
|
384 | if (!max_distance) |
|
|
385 | send_packet_printf ("mapinfo %s error", token); |
|
|
386 | else if (!map || !map->path) |
|
|
387 | send_packet_printf ("mapinfo %s nomap", token); |
|
|
388 | else |
|
|
389 | { |
|
|
390 | int flags = 0; |
|
|
391 | |
|
|
392 | // due to historical glitches, the bit ordering and map index ordering differs |
|
|
393 | if (map->tile_path [TILE_NORTH]) flags |= 0x01; |
|
|
394 | if (map->tile_path [TILE_EAST ]) flags |= 0x02; |
|
|
395 | if (map->tile_path [TILE_SOUTH]) flags |= 0x04; |
|
|
396 | if (map->tile_path [TILE_WEST ]) flags |= 0x08; |
|
|
397 | // these two are debatable |
|
|
398 | if (map->tile_path [TILE_UP ]) flags |= 0x10; |
|
|
399 | if (map->tile_path [TILE_DOWN ]) flags |= 0x20; |
|
|
400 | |
|
|
401 | send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
402 | } |
|
|
403 | |
|
|
404 | return 1; |
|
|
405 | } |
|
|
406 | |
|
|
407 | void |
|
|
408 | client::mapinfo_queue_run () |
|
|
409 | { |
|
|
410 | if (mapinfo_queue.empty () || !pl) |
|
|
411 | return; |
|
|
412 | |
|
|
413 | for (int i = 0; i < mapinfo_queue.size (); ++i) |
|
|
414 | if (mapinfo_try (mapinfo_queue [i])) |
|
|
415 | { |
|
|
416 | free (mapinfo_queue [i]); |
|
|
417 | mapinfo_queue.erase (i); |
|
|
418 | } |
|
|
419 | else |
|
|
420 | ++i; |
260 | } |
421 | } |
261 | |
422 | |
262 | void |
423 | void |
263 | MapInfoCmd (char *buf, int len, player *pl) |
424 | MapInfoCmd (char *buf, int len, player *pl) |
264 | { |
425 | { |
265 | // <mapinfo tag spatial tile-path |
426 | // <mapinfo tag spatial tile-path |
266 | // >mapinfo tag spatial flags x y w h hash |
427 | // >mapinfo tag spatial flags x y w h hash |
267 | |
428 | |
268 | char bigbuf[MAX_BUF], *token; |
|
|
269 | |
|
|
270 | token = buf; |
429 | char *token = buf; |
271 | // copy token |
430 | |
272 | if (!(buf = strchr (buf, ' '))) |
431 | if (!(buf = strchr (buf, ' '))) |
273 | return; |
432 | return; |
274 | |
433 | |
275 | *buf++ = 0; |
|
|
276 | |
|
|
277 | if (!strncmp (buf, "spatial ", 8)) |
434 | if (!strncmp (buf, " spatial ", 9)) |
278 | { |
435 | { |
279 | buf += 8; |
436 | char *copy = strdup (token); |
|
|
437 | copy [buf - token] = 0; |
280 | |
438 | |
281 | // initial map and its origin |
439 | #if 0 |
282 | maptile *map = pl->ob->map; |
440 | // this makes only sense when we flush the buffer immediately |
283 | sint16 dx, dy; |
441 | if (pl->ns->mapinfo_try (copy)) |
284 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
442 | 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 |
443 | else |
341 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
444 | #endif |
|
|
445 | pl->ns->mapinfo_queue.push_back (copy); |
342 | } |
446 | } |
343 | else |
447 | else |
344 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
448 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
345 | |
|
|
346 | pl->ns->send_packet (bigbuf); |
|
|
347 | } |
449 | } |
348 | |
450 | |
349 | /** This is the Setup cmd - easy first implementation */ |
451 | /** This is the Setup cmd */ |
350 | void |
452 | void |
351 | SetUp (char *buf, int len, client * ns) |
453 | SetUp (char *buf, int len, client * ns) |
352 | { |
454 | { |
353 | int s, slen; |
455 | 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 | } |
456 | } |
558 | |
457 | |
559 | /** |
458 | /** |
560 | * The client has requested to be added to the game. |
459 | * 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. |
460 | * 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, |
461 | * 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. |
462 | * it either has to be here or init_sockets needs to be exported. |
564 | */ |
463 | */ |
565 | void |
464 | void |
566 | AddMeCmd (char *buf, int len, client * ns) |
465 | AddMeCmd (char *buf, int len, client *ns) |
567 | { |
466 | { |
568 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
467 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
569 | } |
468 | } |
570 | |
469 | |
571 | /** Reply to ExtendedInfos command */ |
470 | //+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 | |
471 | |
697 | /** |
472 | /** |
698 | * This handles the general commands from the client (ie, north, fire, cast, |
473 | * This handles the general commands from the client (ie, north, fire, cast, |
699 | * etc.) |
474 | * etc.) |
700 | */ |
475 | */ |
… | |
… | |
713 | return; |
488 | return; |
714 | |
489 | |
715 | buf++; |
490 | buf++; |
716 | } |
491 | } |
717 | |
492 | |
718 | execute_newserver_command (pl->ob, (char *) buf); |
493 | execute_newserver_command (pl->ob, (char *)buf); |
719 | |
494 | |
720 | /* Perhaps something better should be done with a left over count. |
495 | /* Perhaps something better should be done with a left over count. |
721 | * Cleaning up the input should probably be done first - all actions |
496 | * 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 |
497 | * for the command that issued the count should be done before any other |
723 | * commands. |
498 | * commands. |
724 | */ |
499 | */ |
725 | pl->count = 0; |
500 | pl->count = 0; |
726 | } |
|
|
727 | |
|
|
728 | |
|
|
729 | /** |
|
|
730 | * 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 |
|
|
732 | * 'ncom' method which gives more information back to the client so it |
|
|
733 | * can throttle. |
|
|
734 | */ |
|
|
735 | void |
|
|
736 | NewPlayerCmd (char *buf, int len, player *pl) |
|
|
737 | { |
|
|
738 | if (len <= 6) |
|
|
739 | { |
|
|
740 | LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
|
|
741 | return; |
|
|
742 | } |
|
|
743 | |
|
|
744 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
|
|
745 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
|
|
746 | |
|
|
747 | /* -1 is special - no repeat, but don't update */ |
|
|
748 | if (repeat != -1) |
|
|
749 | pl->count = repeat; |
|
|
750 | |
|
|
751 | buf += 6; //len -= 6; |
|
|
752 | |
|
|
753 | execute_newserver_command (pl->ob, buf); |
|
|
754 | |
|
|
755 | /* Perhaps something better should be done with a left over count. |
|
|
756 | * Cleaning up the input should probably be done first - all actions |
|
|
757 | * for the command that issued the count should be done before any other |
|
|
758 | * commands. |
|
|
759 | */ |
|
|
760 | pl->count = 0; |
|
|
761 | |
|
|
762 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
|
|
763 | int time = fabs (pl->ob->speed) < 0.001 |
|
|
764 | ? time = MAX_TIME * 100 |
|
|
765 | : time = (int) (MAX_TIME / fabs (pl->ob->speed)); |
|
|
766 | |
|
|
767 | /* Send confirmation of command execution now */ |
|
|
768 | packet sl ("comc"); |
|
|
769 | sl << uint16 (cmdid) << uint32 (time); |
|
|
770 | pl->ns->send_packet (sl); |
|
|
771 | } |
501 | } |
772 | |
502 | |
773 | /** This is a reply to a previous query. */ |
503 | /** This is a reply to a previous query. */ |
774 | void |
504 | void |
775 | ReplyCmd (char *buf, int len, client *ns) |
505 | ReplyCmd (char *buf, int len, client *ns) |
… | |
… | |
802 | { |
532 | { |
803 | case ST_PLAYING: |
533 | case ST_PLAYING: |
804 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
534 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
805 | break; |
535 | break; |
806 | |
536 | |
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 */ |
537 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
812 | receive_party_password (pl->ob, 13); |
538 | receive_party_password (pl->ob, 13); |
813 | break; |
539 | break; |
814 | |
540 | |
815 | default: |
541 | default: |
816 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
542 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
817 | } |
543 | } |
818 | } |
544 | } |
819 | |
545 | |
820 | /** |
546 | /** |
821 | * Client tells its version. If there is a mismatch, we close the |
547 | * 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 | */ |
548 | */ |
827 | void |
549 | void |
828 | VersionCmd (char *buf, int len, client * ns) |
550 | VersionCmd (char *buf, int len, client *ns) |
829 | { |
551 | { |
830 | if (!buf) |
552 | 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 | } |
553 | } |
866 | |
554 | |
867 | /** sound related functions. */ |
555 | /** sound related functions. */ |
868 | void |
556 | void |
869 | SetSound (char *buf, int len, client * ns) |
557 | SetSound (char *buf, int len, client * ns) |
… | |
… | |
887 | * syntax is: move (to) (tag) (nrof) |
575 | * syntax is: move (to) (tag) (nrof) |
888 | */ |
576 | */ |
889 | void |
577 | void |
890 | MoveCmd (char *buf, int len, player *pl) |
578 | MoveCmd (char *buf, int len, player *pl) |
891 | { |
579 | { |
892 | int vals[3], i; |
580 | int to, tag, nrof; |
893 | |
581 | |
894 | /* A little funky here. We only cycle for 2 records, because |
582 | 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 | { |
583 | { |
901 | vals[i] = atoi (buf); |
|
|
902 | |
|
|
903 | if (!(buf = strchr (buf, ' '))) |
|
|
904 | { |
|
|
905 | LOG (llevError, "Incomplete move command: %s\n", buf); |
584 | LOG (llevError, "Incomplete move command: %s\n", buf); |
906 | return; |
585 | return; |
907 | } |
|
|
908 | |
|
|
909 | buf++; |
|
|
910 | } |
586 | } |
911 | |
587 | |
912 | vals[2] = atoi (buf); |
588 | 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 | } |
589 | } |
917 | |
590 | |
918 | /****************************************************************************** |
591 | /****************************************************************************** |
919 | * |
592 | * |
920 | * Start of commands the server sends to the client. |
593 | * Start of commands the server sends to the client. |
… | |
… | |
924 | /** |
597 | /** |
925 | * Asks the client to query the user. This way, the client knows |
598 | * 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) |
599 | * it needs to send something back (vs just printing out a message) |
927 | */ |
600 | */ |
928 | void |
601 | void |
929 | send_query (client *ns, uint8 flags, char *text) |
602 | send_query (client *ns, uint8 flags, const char *text) |
930 | { |
603 | { |
931 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
604 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
|
|
605 | } |
|
|
606 | |
|
|
607 | /** |
|
|
608 | * Get player's current range attack in obuf. |
|
|
609 | */ |
|
|
610 | static void |
|
|
611 | rangetostring (player *pl, char *obuf) |
|
|
612 | { |
|
|
613 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
|
|
614 | |
|
|
615 | #if 0 |
|
|
616 | // print ranged/chosen_skill etc. objects every call |
|
|
617 | printf ("%s %s => %s (%s)\n", |
|
|
618 | pl->ranged_ob ? &pl->ranged_ob->name : "-", |
|
|
619 | pl->combat_ob ? &pl->combat_ob->name : "-", |
|
|
620 | pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-", |
|
|
621 | pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-" |
|
|
622 | ); |
|
|
623 | #endif |
|
|
624 | |
|
|
625 | if (pl->ranged_ob) |
|
|
626 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
|
|
627 | |
|
|
628 | if (pl->combat_ob) |
|
|
629 | buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
|
|
630 | |
|
|
631 | #if 0 |
|
|
632 | //TODO: remove this when slot system is working, this is only for debugging |
|
|
633 | if (pl->ob->chosen_skill) |
|
|
634 | buf << " Skill*: " << pl->ob->chosen_skill->name; |
|
|
635 | #endif |
|
|
636 | |
|
|
637 | //TODO: maybe golem should become the current_weapon, quite simply? |
|
|
638 | if (pl->golem) |
|
|
639 | buf << " Golem*: " << pl->golem->name; |
|
|
640 | |
|
|
641 | buf << '\0'; |
|
|
642 | buf.linearise (obuf); |
932 | } |
643 | } |
933 | |
644 | |
934 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
645 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
935 | Old = New; \ |
646 | Old = New; \ |
936 | sl << uint8 (Type) << uint64 (New); \ |
647 | sl << uint8 (Type) << uint64 (New); \ |
… | |
… | |
944 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
655 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
945 | Old = New; \ |
656 | Old = New; \ |
946 | sl << uint8 (Type) << uint16 (New); \ |
657 | sl << uint8 (Type) << uint16 (New); \ |
947 | } |
658 | } |
948 | |
659 | |
949 | #define AddIfFloat(Old,New,Type) if (Old != New) {\ |
660 | #define AddIfFloat(Old,New,Type,mult) if (Old != New) {\ |
950 | Old = New; \ |
661 | Old = New; \ |
951 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ |
662 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \ |
952 | } |
663 | } |
953 | |
664 | |
954 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
665 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
955 | free(Old); Old = strdup (New);\ |
666 | free(Old); Old = strdup (New);\ |
956 | sl << uint8 (Type) << data8 (New); \ |
667 | sl << uint8 (Type) << data8 (New); \ |
… | |
… | |
963 | * commands for now. |
674 | * commands for now. |
964 | */ |
675 | */ |
965 | void |
676 | void |
966 | esrv_update_stats (player *pl) |
677 | esrv_update_stats (player *pl) |
967 | { |
678 | { |
968 | char buf[MAX_BUF]; |
|
|
969 | uint16 flags; |
|
|
970 | |
|
|
971 | client *ns = pl->ns; |
679 | client *ns = pl->ns; |
972 | if (!ns) |
680 | if (!ns) |
973 | return; |
681 | return; |
974 | |
682 | |
975 | object *ob = pl->ob; |
683 | object *ob = pl->observe; |
976 | if (!ob) |
684 | if (!ob) |
977 | return; |
685 | return; |
|
|
686 | |
|
|
687 | player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl; |
978 | |
688 | |
979 | packet sl ("stats"); |
689 | packet sl ("stats"); |
980 | |
690 | |
981 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
691 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
982 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
692 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
… | |
… | |
990 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
700 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
991 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
701 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
992 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
702 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
993 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
703 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
994 | |
704 | |
995 | for (int s = 0; s < NUM_SKILLS; s++) |
705 | for (int s = 0; s < CS_NUM_SKILLS; s++) |
996 | if (object *skill = pl->last_skill_ob[s]) |
706 | if (object *skill = opl->last_skill_ob [s]) |
997 | if (skill->stats.exp != ns->last_skill_exp [s]) |
707 | if (skill->stats.exp != ns->last_skill_exp [s]) |
998 | { |
708 | { |
999 | ns->last_skill_exp [s] = skill->stats.exp; |
709 | ns->last_skill_exp [s] = skill->stats.exp; |
1000 | |
710 | |
1001 | /* Always send along the level if exp changes. This is only |
711 | /* Always send along the level if exp changes. This is only |
1002 | * 1 extra byte, but keeps processing simpler. |
712 | * 1 extra byte, but keeps processing simpler. |
1003 | */ |
713 | */ |
1004 | sl << uint8 (s + CS_STAT_SKILLINFO) |
714 | sl << uint8 (CS_STAT_SKILLINFO + s) |
1005 | << uint8 (skill->level) |
715 | << uint8 (skill->level) |
1006 | << uint64 (skill->stats.exp); |
716 | << uint64 (skill->stats.exp); |
1007 | } |
717 | } |
1008 | |
718 | |
1009 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
719 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
1010 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
720 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
1011 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
721 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
1012 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
722 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
1013 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
723 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
1014 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); |
724 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK); |
1015 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
725 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
1016 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
726 | 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); |
727 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
1018 | |
728 | |
1019 | flags = 0; |
729 | int flags = (opl->fire_on ? SF_FIREON : 0) |
1020 | |
730 | | (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 | |
731 | |
1027 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
732 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
1028 | |
733 | |
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++) |
734 | for (int i = 0; i < NROFATTACKS; i++) |
1033 | { |
|
|
1034 | /* Skip ones we won't send */ |
735 | /* Skip ones we won't send */ |
1035 | if (atnr_cs_stat[i] == -1) |
736 | if (atnr_cs_stat[i] >= 0) |
1036 | continue; |
|
|
1037 | |
|
|
1038 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
737 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
1039 | } |
|
|
1040 | |
738 | |
1041 | if (pl->ns->monitor_spells) |
739 | if (pl->ns->monitor_spells) |
1042 | { |
740 | { |
1043 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
741 | 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); |
742 | 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); |
743 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
1046 | } |
744 | } |
1047 | |
745 | |
|
|
746 | char buf[MAX_BUF]; |
1048 | rangetostring (ob, buf); /* we want use the new fire & run system in new client */ |
747 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
1049 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
748 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
1050 | set_title (ob, buf); |
749 | set_title (ob, buf); |
1051 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
750 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
1052 | |
751 | |
1053 | /* Only send it away if we have some actual data */ |
752 | /* Only send it away if we have some actual data */ |
… | |
… | |
1057 | |
756 | |
1058 | /** |
757 | /** |
1059 | * Tells the client that here is a player it should start using. |
758 | * Tells the client that here is a player it should start using. |
1060 | */ |
759 | */ |
1061 | void |
760 | void |
1062 | esrv_new_player (player *pl, uint32 weight) |
761 | esrv_new_player (player *pl) |
1063 | { |
762 | { |
|
|
763 | sint32 weight = pl->ob->client_weight (); |
|
|
764 | |
1064 | packet sl ("player"); |
765 | packet sl ("player"); |
1065 | |
766 | |
1066 | sl << uint32 (pl->ob->count) |
767 | sl << uint32 (pl->ob->count) |
1067 | << uint32 (weight) |
768 | << uint32 (weight) |
1068 | << uint32 (pl->ob->face) |
769 | << uint32 (pl->ob->face) |
1069 | << data8 (pl->ob->name); |
770 | << data8 (pl->ob->name); |
1070 | |
771 | |
1071 | pl->ns->last_weight = weight; |
772 | pl->ns->last_weight = weight; |
1072 | pl->ns->send_packet (sl); |
773 | pl->ns->send_packet (sl); |
1073 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
|
|
1074 | } |
774 | } |
1075 | |
775 | |
1076 | /****************************************************************************** |
776 | /****************************************************************************** |
1077 | * |
777 | * |
1078 | * Start of map related commands. |
778 | * Start of map related commands. |
… | |
… | |
1135 | |
835 | |
1136 | if (!ns.faces_sent[face_num]) |
836 | if (!ns.faces_sent[face_num]) |
1137 | if (ob) |
837 | if (ob) |
1138 | ns.send_faces (ob); |
838 | ns.send_faces (ob); |
1139 | else |
839 | else |
1140 | ns.send_face (face_num); |
840 | ns.send_face (face_num, 10); |
1141 | |
841 | |
1142 | sl << uint16 (face_num); |
842 | sl << uint16 (face_num); |
1143 | return 1; |
843 | return 1; |
1144 | } |
844 | } |
1145 | |
845 | |
1146 | /* Nothing changed */ |
846 | /* Nothing changed */ |
1147 | return 0; |
847 | return 0; |
1148 | } |
848 | } |
1149 | |
849 | |
1150 | /** |
850 | /** |
1151 | * Returns the size of a data for a map square as returned by |
851 | * Draws client map. |
1152 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
|
|
1153 | * available. |
|
|
1154 | */ |
852 | */ |
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 | |
|
|
1169 | // prefetch (and touch) all maps within a specific distancd |
|
|
1170 | static void |
|
|
1171 | prefetch_surrounding_maps (maptile *map, int distance) |
|
|
1172 | { |
|
|
1173 | map->last_access = runtime; |
|
|
1174 | |
|
|
1175 | if (--distance) |
|
|
1176 | for (int dir = 4; --dir; ) |
|
|
1177 | if (const shstr &path = map->tile_path [dir]) |
|
|
1178 | if (maptile *&neigh = map->tile_map [dir]) |
|
|
1179 | prefetch_surrounding_maps (neigh, distance); |
|
|
1180 | else |
|
|
1181 | neigh = maptile::find_async (path, map); |
|
|
1182 | } |
|
|
1183 | |
|
|
1184 | // prefetch a generous area around the player |
|
|
1185 | static void |
|
|
1186 | prefetch_surrounding_maps (object *op) |
|
|
1187 | { |
|
|
1188 | prefetch_surrounding_maps (op->map, 3); |
|
|
1189 | } |
|
|
1190 | |
|
|
1191 | /** |
|
|
1192 | * This function uses the new map1 protocol command to send the 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 | */ |
|
|
1213 | void |
853 | void |
1214 | draw_client_map1 (object *pl) |
854 | draw_client_map (player *pl) |
1215 | { |
855 | { |
1216 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
856 | 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) |
857 | if (!pl->observe->active) |
1227 | return; |
858 | 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 | |
859 | |
1565 | /* If player is just joining the game, he isn't here yet, so the map |
860 | /* 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 |
861 | * can get swapped out. If so, don't try to send them a map. All will |
1567 | * be OK once they really log in. |
862 | * be OK once they really log in. |
1568 | */ |
863 | */ |
1569 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
864 | if (!ob->map || ob->map->state != MAP_ACTIVE) |
1570 | return; |
865 | return; |
1571 | |
866 | |
1572 | memset (&newmap, 0, sizeof (struct Map)); |
867 | int startlen, oldlen; |
1573 | |
868 | |
1574 | for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) |
869 | check_map_change (pl); |
1575 | for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) |
870 | pl->ob->prefetch_surrounding_maps (); |
|
|
871 | |
|
|
872 | /* do LOS after calls to update_position */ |
|
|
873 | /* unfortunately, we need to udpate los when observing, currently */ |
|
|
874 | if (pl->do_los || pl->viewpoint != pl->ob) |
|
|
875 | { |
|
|
876 | pl->do_los = 0; |
|
|
877 | pl->update_los (); |
|
|
878 | } |
|
|
879 | |
|
|
880 | /** |
|
|
881 | * This function uses the new map1 protocol command to send the map |
|
|
882 | * to the client. It is necessary because the old map command supports |
|
|
883 | * a maximum map size of 15x15. |
|
|
884 | * This function is much simpler than the old one. This is because |
|
|
885 | * the old function optimized to send as few face identifiers as possible, |
|
|
886 | * at the expense of sending more coordinate location (coordinates were |
|
|
887 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
888 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
889 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
890 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
891 | * of what we send, see the doc/Protocol file. |
|
|
892 | * I will describe internally what we do: |
|
|
893 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
894 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
895 | * maximum viewable size (As set in config.h). |
|
|
896 | * in the cells, there are faces and a count value. |
|
|
897 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
898 | * is not viewable. |
|
|
899 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
900 | * look like. |
|
|
901 | */ |
|
|
902 | |
|
|
903 | client &socket = *pl->ns; |
|
|
904 | |
|
|
905 | packet sl ("map1a"); |
|
|
906 | |
|
|
907 | startlen = sl.length (); |
|
|
908 | |
|
|
909 | int hx = socket.mapx / 2; |
|
|
910 | int hy = socket.mapy / 2; |
|
|
911 | |
|
|
912 | ordered_mapwalk_begin (ob, -hx, -hy, hx, hy) |
|
|
913 | int ax = dx + hx; |
|
|
914 | int ay = dy + hy; |
|
|
915 | |
|
|
916 | int mask = (ax << 10) | (ay << 4); |
|
|
917 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
|
|
918 | |
|
|
919 | /* If the coordinates are not valid, or it is too dark to see, |
|
|
920 | * we tell the client as such |
|
|
921 | */ |
|
|
922 | if (!m) |
1576 | { |
923 | { |
1577 | ax = i; |
924 | /* space is out of map. Update space and clear values |
1578 | ay = j; |
925 | * if this hasn't already been done. If the space is out |
1579 | m = pm; |
926 | * 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 | */ |
927 | */ |
1589 | if (mflags & P_NEW_MAP) |
928 | if (lastcell.count != -1) |
1590 | m->timeout = 50; |
929 | { |
|
|
930 | sl << uint16 (mask); |
|
|
931 | map_clearcell (&lastcell, -1); |
|
|
932 | } |
|
|
933 | |
|
|
934 | continue; |
1591 | } |
935 | } |
1592 | |
936 | |
1593 | /* do LOS after calls to update_position */ |
937 | int d = pl->blocked_los_uc (dx, dy); |
1594 | if (pl->contr->do_los) |
938 | |
|
|
939 | if (d > 3) |
1595 | { |
940 | { |
1596 | update_los (pl); |
941 | /* This block deals with spaces that are not visible for whatever |
1597 | pl->contr->do_los = 0; |
942 | * reason. Still may need to send the head for this space. |
|
|
943 | */ |
|
|
944 | if (lastcell.count != -1 |
|
|
945 | || lastcell.faces[0] |
|
|
946 | || lastcell.faces[1] |
|
|
947 | || lastcell.faces[2] |
|
|
948 | || lastcell.stat_hp |
|
|
949 | || lastcell.flags |
|
|
950 | || lastcell.player) |
|
|
951 | sl << uint16 (mask); |
|
|
952 | |
|
|
953 | /* properly clear a previously sent big face */ |
|
|
954 | map_clearcell (&lastcell, -1); |
1598 | } |
955 | } |
1599 | |
956 | 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 | { |
957 | { |
1635 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
958 | /* In this block, the space is visible. |
1636 | fatal (0); |
959 | */ |
|
|
960 | |
|
|
961 | /* Rather than try to figure out what everything that we might |
|
|
962 | * need to send is, then form the packet after that, |
|
|
963 | * we presume that we will in fact form a packet, and update |
|
|
964 | * the bits by what we do actually send. If we send nothing, |
|
|
965 | * we just back out sl.length () to the old value, and no harm |
|
|
966 | * is done. |
|
|
967 | * I think this is simpler than doing a bunch of checks to see |
|
|
968 | * what if anything we need to send, setting the bits, then |
|
|
969 | * doing those checks again to add the real data. |
|
|
970 | */ |
|
|
971 | oldlen = sl.length (); |
|
|
972 | |
|
|
973 | sl << uint16 (mask); |
|
|
974 | |
|
|
975 | unsigned char dummy; |
|
|
976 | unsigned char *last_ext = &dummy; |
|
|
977 | |
|
|
978 | /* Darkness changed */ |
|
|
979 | if (lastcell.count != d) |
|
|
980 | { |
|
|
981 | mask |= 0x8; |
|
|
982 | |
|
|
983 | *last_ext |= 0x80; |
|
|
984 | last_ext = &sl[sl.length ()]; |
|
|
985 | sl << uint8 (d); |
|
|
986 | } |
|
|
987 | |
|
|
988 | lastcell.count = d; |
|
|
989 | |
|
|
990 | mapspace &ms = m->at (nx, ny); |
|
|
991 | ms.update (); |
|
|
992 | |
|
|
993 | // extmap handling |
|
|
994 | uint8 stat_hp = 0; |
|
|
995 | uint8 stat_width = 0; |
|
|
996 | uint8 flags = 0; |
|
|
997 | tag_t player = 0; |
|
|
998 | |
|
|
999 | // send hp information, if applicable |
|
|
1000 | if (object *op = ms.faces_obj [0]) |
|
|
1001 | if (op->is_head () && !op->invisible) |
|
|
1002 | { |
|
|
1003 | if (op->stats.maxhp > op->stats.hp |
|
|
1004 | && op->stats.maxhp > 0 |
|
|
1005 | && (op->type == PLAYER |
|
|
1006 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1007 | || op->flag [FLAG_MONSTER] |
|
|
1008 | || op->flag [FLAG_ALIVE] |
|
|
1009 | || op->flag [FLAG_GENERATOR])) |
|
|
1010 | { |
|
|
1011 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1012 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1013 | } |
|
|
1014 | |
|
|
1015 | if (expect_false (op->has_dialogue ())) |
|
|
1016 | flags |= 1; |
|
|
1017 | |
|
|
1018 | if (expect_false (op->type == PLAYER)) |
|
|
1019 | player = op == ob ? pl->ob->count |
|
|
1020 | : op == pl->ob ? ob->count |
|
|
1021 | : op->count; |
|
|
1022 | } |
|
|
1023 | |
|
|
1024 | if (expect_false (lastcell.stat_hp != stat_hp)) |
|
|
1025 | { |
|
|
1026 | lastcell.stat_hp = stat_hp; |
|
|
1027 | |
|
|
1028 | mask |= 0x8; |
|
|
1029 | *last_ext |= 0x80; |
|
|
1030 | last_ext = &sl[sl.length ()]; |
|
|
1031 | |
|
|
1032 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1033 | |
|
|
1034 | if (stat_width > 1) |
|
|
1035 | { |
|
|
1036 | *last_ext |= 0x80; |
|
|
1037 | last_ext = &sl[sl.length ()]; |
|
|
1038 | |
|
|
1039 | sl << uint8 (6) << uint8 (stat_width); |
|
|
1040 | } |
|
|
1041 | } |
|
|
1042 | |
|
|
1043 | if (expect_false (lastcell.player != player)) |
|
|
1044 | { |
|
|
1045 | lastcell.player = player; |
|
|
1046 | |
|
|
1047 | mask |= 0x8; |
|
|
1048 | *last_ext |= 0x80; |
|
|
1049 | last_ext = &sl[sl.length ()]; |
|
|
1050 | |
|
|
1051 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1052 | } |
|
|
1053 | |
|
|
1054 | if (expect_false (lastcell.flags != flags)) |
|
|
1055 | { |
|
|
1056 | lastcell.flags = flags; |
|
|
1057 | |
|
|
1058 | mask |= 0x8; |
|
|
1059 | *last_ext |= 0x80; |
|
|
1060 | last_ext = &sl[sl.length ()]; |
|
|
1061 | |
|
|
1062 | sl << uint8 (8) << uint8 (flags); |
|
|
1063 | } |
|
|
1064 | |
|
|
1065 | // faces |
|
|
1066 | |
|
|
1067 | /* Floor face */ |
|
|
1068 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1069 | mask |= 0x4; |
|
|
1070 | |
|
|
1071 | /* Middle face */ |
|
|
1072 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1073 | mask |= 0x2; |
|
|
1074 | |
|
|
1075 | if (expect_false (ob->invisible) |
|
|
1076 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
|
|
1077 | && ms.player () == ob) |
|
|
1078 | { |
|
|
1079 | // force player to be visible to himself if invisible |
|
|
1080 | if (lastcell.faces[0] != ob->face) |
|
|
1081 | { |
|
|
1082 | lastcell.faces[0] = ob->face; |
|
|
1083 | |
|
|
1084 | mask |= 0x1; |
|
|
1085 | sl << uint16 (ob->face); |
|
|
1086 | |
|
|
1087 | socket.send_faces (ob); |
|
|
1088 | } |
|
|
1089 | } |
|
|
1090 | /* Top face */ |
|
|
1091 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1092 | mask |= 0x1; |
|
|
1093 | |
|
|
1094 | /* Check to see if we are in fact sending anything for this |
|
|
1095 | * space by checking the mask. If so, update the mask. |
|
|
1096 | * if not, reset the len to that from before adding the mask |
|
|
1097 | * value, so we don't send those bits. |
|
|
1098 | */ |
|
|
1099 | if (mask & 0xf) |
|
|
1100 | sl[oldlen + 1] = mask & 0xff; |
|
|
1101 | else |
|
|
1102 | sl.reset (oldlen); |
|
|
1103 | } /* else this is a viewable space */ |
|
|
1104 | ordered_mapwalk_end |
|
|
1105 | |
|
|
1106 | socket.flush_fx (); |
|
|
1107 | |
|
|
1108 | if (sl.length () > startlen || socket.sent_scroll) |
1637 | } |
1109 | { |
1638 | |
|
|
1639 | ns->send_packet (sl); |
1110 | socket.send_packet (sl); |
1640 | } |
1111 | 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 | { |
1112 | } |
1658 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
1659 | fatal (0); |
|
|
1660 | } |
|
|
1661 | |
|
|
1662 | ns->send_packet (sl); |
|
|
1663 | } |
1113 | } |
1664 | |
1114 | |
1665 | /** |
1115 | /** |
1666 | * This looks for any spells the player may have that have changed their stats. |
1116 | * 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 |
1117 | * it then sends an updspell packet for each spell that has changed in this way |
… | |
… | |
1670 | esrv_update_spells (player *pl) |
1120 | esrv_update_spells (player *pl) |
1671 | { |
1121 | { |
1672 | if (!pl->ns) |
1122 | if (!pl->ns) |
1673 | return; |
1123 | return; |
1674 | |
1124 | |
|
|
1125 | pl->ns->update_spells = false; |
|
|
1126 | |
1675 | if (!pl->ns->monitor_spells) |
1127 | if (!pl->ns->monitor_spells) |
1676 | return; |
1128 | return; |
1677 | |
1129 | |
1678 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1130 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1679 | { |
|
|
1680 | if (spell->type == SPELL) |
1131 | if (spell->type == SPELL) |
1681 | { |
1132 | { |
1682 | int flags = 0; |
1133 | int flags = 0; |
|
|
1134 | int val; |
1683 | |
1135 | |
1684 | /* check if we need to update it */ |
1136 | /* check if we need to update it */ |
1685 | if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1137 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
|
|
1138 | if (spell->cached_sp != val) |
1686 | { |
1139 | { |
1687 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1140 | spell->cached_sp = val; |
1688 | flags |= UPD_SP_MANA; |
1141 | flags |= UPD_SP_MANA; |
1689 | } |
1142 | } |
1690 | |
1143 | |
1691 | if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1144 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
|
|
1145 | if (spell->cached_grace != val) |
1692 | { |
1146 | { |
1693 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1147 | spell->cached_grace = val; |
1694 | flags |= UPD_SP_GRACE; |
1148 | flags |= UPD_SP_GRACE; |
1695 | } |
1149 | } |
1696 | |
1150 | |
1697 | if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1151 | val = casting_level (pl->ob, spell); |
|
|
1152 | if (spell->cached_eat != val) |
1698 | { |
1153 | { |
1699 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1154 | spell->cached_eat = val; |
1700 | flags |= UPD_SP_DAMAGE; |
1155 | flags |= UPD_SP_LEVEL; |
1701 | } |
1156 | } |
1702 | |
1157 | |
1703 | if (flags) |
1158 | if (flags) |
1704 | { |
1159 | { |
1705 | packet sl; |
1160 | packet sl; |
1706 | |
1161 | |
1707 | sl << "updspell " |
1162 | sl << "updspell " |
1708 | << uint8 (flags) |
1163 | << uint8 (flags) |
1709 | << uint32 (spell->count); |
1164 | << uint32 (spell->count); |
1710 | |
1165 | |
1711 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1166 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
1712 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1167 | if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace); |
1713 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1168 | if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat); |
1714 | |
1169 | |
1715 | pl->ns->send_packet (sl); |
1170 | pl->ns->send_packet (sl); |
1716 | } |
1171 | } |
1717 | } |
1172 | } |
1718 | } |
|
|
1719 | } |
1173 | } |
1720 | |
1174 | |
1721 | void |
1175 | void |
1722 | esrv_remove_spell (player *pl, object *spell) |
1176 | esrv_remove_spell (player *pl, object *spell) |
1723 | { |
1177 | { |
… | |
… | |
1739 | |
1193 | |
1740 | /* appends the spell *spell to the Socklist we will send the data to. */ |
1194 | /* appends the spell *spell to the Socklist we will send the data to. */ |
1741 | static void |
1195 | static void |
1742 | append_spell (player *pl, packet &sl, object *spell) |
1196 | append_spell (player *pl, packet &sl, object *spell) |
1743 | { |
1197 | { |
1744 | int i, skill = 0; |
1198 | int skill = 0; |
1745 | |
1199 | |
1746 | if (!(spell->name)) |
1200 | if (!(spell->name)) |
1747 | { |
1201 | { |
1748 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1202 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1749 | return; |
1203 | return; |
1750 | } |
1204 | } |
1751 | |
1205 | |
1752 | /* store costs and damage in the object struct, to compare to later */ |
1206 | /* 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); |
1207 | 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); |
1208 | 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); |
1209 | spell->cached_eat = casting_level (pl->ob, spell); |
1756 | |
1210 | |
1757 | /* figure out which skill it uses, if it uses one */ |
1211 | /* figure out which skill it uses, if it uses one */ |
1758 | if (spell->skill) |
1212 | if (spell->skill) |
1759 | { |
1213 | if (object *tmp = pl->find_skill (spell->skill)) |
1760 | for (i = 1; i < NUM_SKILLS; i++) |
1214 | 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 | |
1215 | |
1768 | // spells better have a face |
1216 | // spells better have a face |
1769 | if (!spell->face) |
1217 | if (!spell->face) |
1770 | { |
1218 | { |
1771 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1219 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1772 | spell->face = face_find ("burnout.x11", blank_face); |
1220 | spell->face = face_find ("burnout.x11", blank_face); |
1773 | } |
1221 | } |
|
|
1222 | |
|
|
1223 | pl->ns->send_face (spell->face); |
1774 | |
1224 | |
1775 | /* send the current values */ |
1225 | /* send the current values */ |
1776 | sl << uint32 (spell->count) |
1226 | sl << uint32 (spell->count) |
1777 | << uint16 (spell->level) |
1227 | << uint16 (spell->level) |
1778 | << uint16 (spell->casting_time) |
1228 | << uint16 (spell->casting_time) |
1779 | << uint16 (spell->last_sp) |
1229 | << uint16 (spell->cached_sp) |
1780 | << uint16 (spell->last_grace) |
1230 | << uint16 (spell->cached_grace) |
1781 | << uint16 (spell->last_eat) |
1231 | << uint16 (spell->cached_eat) |
1782 | << uint8 (skill) |
1232 | << uint8 (skill) |
1783 | << uint32 (spell->path_attuned) |
1233 | << uint32 (spell->path_attuned) |
1784 | << uint32 (spell->face) |
1234 | << uint32 (spell->face) |
1785 | << data8 (spell->name) |
1235 | << data8 (spell->name) |
1786 | << data16 (spell->msg); |
1236 | << data16 (spell->msg); |
… | |
… | |
1814 | * bytes and 3 strings (because that is the spec) so we need to |
1264 | * 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, |
1265 | * 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, |
1266 | * 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 |
1267 | * we need to send what we already have, and restart packet formation |
1818 | */ |
1268 | */ |
|
|
1269 | if (spell->type != SPELL) |
|
|
1270 | continue; |
|
|
1271 | |
1819 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1272 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1820 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1273 | * 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 |
1274 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1822 | * like it will fix this |
1275 | * like it will fix this |
1823 | */ |
1276 | */ |
1824 | if (spell->type != SPELL) |
|
|
1825 | continue; |
|
|
1826 | |
|
|
1827 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1277 | if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1828 | { |
1278 | { |
|
|
1279 | pl->ns->flush_fx (); |
1829 | pl->ns->send_packet (sl); |
1280 | pl->ns->send_packet (sl); |
1830 | |
1281 | |
1831 | sl.reset (); |
1282 | sl.reset (); |
1832 | sl << "addspell "; |
1283 | sl << "addspell "; |
1833 | } |
1284 | } |
… | |
… | |
1841 | return; |
1292 | return; |
1842 | } |
1293 | } |
1843 | else |
1294 | else |
1844 | append_spell (pl, sl, spell); |
1295 | append_spell (pl, sl, spell); |
1845 | |
1296 | |
1846 | if (sl.length () >= MAXSOCKBUF) |
1297 | if (sl.length () > MAXSOCKBUF) |
1847 | { |
|
|
1848 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1298 | cleanup ("buffer overflow in esrv_add_spells!"); |
1849 | fatal (0); |
|
|
1850 | } |
|
|
1851 | |
1299 | |
1852 | /* finally, we can send the packet */ |
1300 | /* finally, we can send the packet */ |
|
|
1301 | pl->ns->flush_fx (); |
1853 | pl->ns->send_packet (sl); |
1302 | pl->ns->send_packet (sl); |
1854 | } |
1303 | } |
1855 | |
1304 | |
|
|
1305 | //-GPL |
|
|
1306 | |