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