ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/info.C
(Generate patch)

Comparing deliantra/server/socket/info.C (file contents):
Revision 1.4 by root, Sun Sep 3 00:18:43 2006 UTC vs.
Revision 1.59 by root, Fri Mar 26 00:59:22 2010 UTC

1/* 1/*
2 * static char *rcsid_sock_info_c = 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * "$Id: info.C,v 1.4 2006/09/03 00:18:43 root Exp $"; 3 *
4 */ 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5
6/*
7 CrossFire, A Multiplayer game for X-windows
8
9 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
11 7 *
12 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
13 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
14 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
15 (at your option) any later version. 11 * option) any later version.
16 12 *
17 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
18 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 GNU General Public License for more details. 16 * GNU General Public License for more details.
21 17 *
22 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
23 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
25 21 *
26 The authors can be reached via e-mail at crossfire-devel@real-time.com 22 * The authors can be reached via e-mail to <support@deliantra.net>
27*/ 23 */
28 24
29/** 25/**
30 * \file 26 * \file
31 * Basic client output functions. 27 * Basic client output functions.
32 * 28 *
… …
40#include <sproto.h> 36#include <sproto.h>
41#include <stdarg.h> 37#include <stdarg.h>
42#include <spells.h> 38#include <spells.h>
43#include <skills.h> 39#include <skills.h>
44 40
41#include <cstring>
42
45/** 43/**
46 * Draws a normal message on the client. It is pretty 44 * Draws a normal message on the client. It is pretty
47 * much the same thing as the draw_info above, but takes a color 45 * much the same thing as the draw_info above, but takes a color
48 * parameter. the esrv_drawinfo functions should probably be 46 * parameter. the esrv_drawinfo functions should probably be
49 * replaced with this, just using black as the color. 47 * replaced with this, just using black as the color.
50 */ 48 */
49static void
51static void esrv_print_msg(NewSocket *ns,int color, const char *str) 50esrv_print_msg (client *ns, int color, const char *str)
52{ 51{
53 char buf[HUGE_BUF]; 52 ns->send_msg (color, "info", str);
54
55 if (ns->status == Ns_Old) {
56 snprintf(buf,HUGE_BUF,"%s\n", str);
57 } else {
58 snprintf(buf,HUGE_BUF, "drawinfo %d %s", color, str);
59 }
60/* LOG(llevDebug,"sending %s to socket, len=%d\n", buf, strlen(buf));*/
61 Write_String_To_Socket(ns, buf, strlen(buf));
62}
63
64/**
65 * Draws an extended message on the client.
66 * ns the socket to send message to
67 * color color informations (used mainly if client does not support message type)
68 * type,
69 * subtype type and subtype of text message
70 * intro Intro message to send with main message if client does not support the message type
71 * message The main message
72 */
73static void esrv_print_ext_msg(NewSocket *ns,int color,uint8 type, uint8 subtype, const char *message)
74{
75 char buf[HUGE_BUF];
76 snprintf(buf,HUGE_BUF, "drawextinfo %d %hhu %hhu %s", color, type, subtype, message);
77 Write_String_To_Socket(ns, buf, strlen(buf));
78/* LOG(llevDebug,"sending %s to socket, len=%d", buf, strlen(buf));*/
79
80} 53}
81 54
82/** 55/**
83 * Frontend for esrv_print_msg 56 * Frontend for esrv_print_msg
84 * \param colr message color 57 * \param colr message color
… …
87 * 60 *
88 * If pl is NULL or without contr set, writes message to log. 61 * If pl is NULL or without contr set, writes message to log.
89 * 62 *
90 * Else sends message to player via esrv_print_msg 63 * Else sends message to player via esrv_print_msg
91 */ 64 */
92 65static void
93static void print_message(int colr, const object *pl, const char *tmp) { 66print_message (int colr, const object *pl, const char *tmp)
94 67{
95 if(tmp == (char *) NULL) { 68 if (!tmp)
96 tmp="[NULL]"; 69 tmp = "[NULL]";
97 }
98 70
99 if (!pl || (pl->type == PLAYER && pl->contr == NULL)) 71 if (!pl || (pl->type == PLAYER && pl->contr == NULL))
100 return; 72 return;
101 73
102 if (pl->type == PLAYER) { 74 if (pl->type == PLAYER)
103 esrv_print_msg(&pl->contr->socket,colr,(char*) tmp); 75 esrv_print_msg (pl->contr->ns, colr, (char *)tmp);
76}
77
78bool
79client::msg_suppressed (const char *msg)
80{
81 if (!pl)
104 return; 82 return false;
105 }
106}
107 83
84 if (pl->outputs_count <= 1 || !pl->outputs_sync)
85 return false;
108 86
109/** 87 int len = strlen (msg);
110 * Prints out the contents of specified buffer structures,
111 * and clears the string.
112 */
113 88
114void flush_output_element(const object *pl, Output_Buf *outputs) 89 if (len > MSG_BUF_SIZE)
115{ 90 return false;
116 char tbuf[MAX_BUF];
117 91
118 if (outputs->buf==NULL) return; 92 msg_buf *lru = msgbuf;
119 if (outputs->count > 1) { 93 for (msg_buf *buf = msgbuf; buf < msgbuf + MSG_BUF_COUNT; ++buf)
120 snprintf(tbuf,MAX_BUF, "%d times %s", outputs->count, &outputs->buf); 94 {
121 print_message(NDI_BLACK, pl, tbuf); 95 if (len == buf->len && !memcmp (msg, buf->msg, len))
122 } else 96 {
123 print_message(NDI_BLACK, pl, &outputs->buf); 97 // found matching buf, see if expired
98 if (buf->expire <= pticks || !buf->count)
99 {
100 // yes, take over matching buffer, print
101 buf->expire = pticks + pl->outputs_sync;
102 buf->count = pl->outputs_count;
124 103
125 outputs->buf=NULL; 104 return false;
126 outputs->first_update=0; /* This way, it will be reused */ 105 }
127}
128 106
129/** 107 // no, suppress
130 * Sends message to player through output buffers. 108 --buf->count;
131 * \param pl player to send message
132 * \param buf message to send
133 *
134 * If player's output_count is 1, sends message directly.
135 *
136 * Else checks output buffers for specified message.
137 *
138 * If found, checks if message should be sent now.
139 *
140 * If message not already in buffers, flushes olders buffer,
141 * and adds message to queue.
142 */
143
144static void check_output_buffers(const object *pl, const char *buf)
145{
146 int i, oldest=0;
147
148 if (pl->contr->outputs_count<2) {
149 print_message(NDI_BLACK, pl, buf);
150 return; 109 return true;
151 }
152 else {
153 for (i=0; i<NUM_OUTPUT_BUFS; i++) {
154 if (pl->contr->outputs[i].buf &&
155 !strcmp(buf, pl->contr->outputs[i].buf)) break;
156 else if (pl->contr->outputs[i].first_update <
157 pl->contr->outputs[oldest].first_update)
158 oldest=i;
159 } 110 }
160 /* We found a match */
161 if (i<NUM_OUTPUT_BUFS) {
162 pl->contr->outputs[i].count++;
163 if (pl->contr->outputs[i].count>=pl->contr->outputs_count) {
164 flush_output_element(pl, &pl->contr->outputs[i]);
165 }
166 }
167 /* No match - flush the oldest, and put the new one in */
168 else {
169 flush_output_element(pl, &pl->contr->outputs[oldest]);
170 111
171 pl->contr->outputs[oldest].first_update = pticks; 112 if (lru->expire > buf->expire)
172 pl->contr->outputs[oldest].count = 1; 113 lru = buf;
173 pl->contr->outputs[oldest].buf = buf;
174 }
175 } 114 }
176}
177
178 115
116 // new message, evoke oldest buffer
117 lru->expire = pticks + pl->outputs_sync;
118 lru->count = pl->outputs_count;
119 lru->len = len;
120 memcpy (lru->msg, msg, len);
121
122 return false;
123}
179 124
180/** 125/**
181 * Sends message to player(s). 126 * Sends message to player(s).
182 * 127 *
183 * flags is various flags - mostly color, plus a few specials. 128 * flags is various flags - mostly color, plus a few specials.
184 * 129 *
185 * pri is priority. It is a little odd - the lower the value, the more 130 * pri is unused.
186 * important it is. Thus, 0 gets sent no matter what. Otherwise, the
187 * value must be less than the listening level that the player has set.
188 * Unfortunately, there is no clear guideline on what each level does what.
189 * 131 *
190 * pl can be passed as NULL - in fact, this will be done if NDI_ALL is set 132 * pl can be passed as NULL - in fact, this will be done if NDI_ALL is set
191 * in the flags. 133 * in the flags.
192 * 134 *
193 * If message is black, and not NDI_UNIQUE, gets sent through output buffers. 135 * If message is black, and not NDI_UNIQUE, gets sent through output buffers.
194 * 136 *
195 */ 137 */
196 138void
197void new_draw_info(int flags, int pri, const object *pl, const char *buf) 139new_draw_info (int flags, int pri, const object *op, const char *buf)
198{ 140{
199
200 if (flags & NDI_ALL) { 141 if (flags & NDI_ALL)
201 player *tmppl; 142 {
202 int i; 143 for_all_players (pl)
203
204 for (tmppl=first_player; tmppl!=NULL; tmppl=tmppl->next)
205 new_draw_info((flags & ~NDI_ALL), pri, tmppl->ob, buf); 144 new_draw_info (flags & ~NDI_ALL, 0, pl->ob, buf);
206 145 }
207 for (i=1; i<socket_info.allocated_sockets; i++) { 146 else
208 if (init_sockets[i].status == Ns_Old && init_sockets[i].old_mode != Old_Listen && pri< 10) { 147 {
209 cs_write_string(&init_sockets[i], buf, strlen(buf)); 148 if (!op || !op->contr || !op->contr->ns)
210 /* Most messages don't have a newline, so add one */
211 cs_write_string(&init_sockets[i], "\n", 1);
212 }
213 }
214
215 return; 149 return;
216 }
217 if(!pl || (pl->type==PLAYER && pl->contr==NULL)) {
218 /* Write to the socket? */
219 print_message(0, NULL, buf);
220 return;
221 }
222 if (pl->type!=PLAYER) return;
223 if (pri>=pl->contr->listening) return;
224 150
225 if ((flags&NDI_COLOR_MASK)==NDI_BLACK && !(flags &NDI_UNIQUE)) { 151 if ((flags & (NDI_COLOR_MASK | NDI_UNIQUE)) != NDI_BLACK
226 /* following prints stuff out, as appropriate */ 152 || !op->contr->ns->msg_suppressed (buf))
227 check_output_buffers(pl, buf);
228 }
229 else {
230 print_message(flags&NDI_COLOR_MASK, pl, buf); 153 print_message (flags & NDI_COLOR_MASK, op, buf);
231 } 154 }
232} 155}
233 156
234/** 157/**
235 * Wrapper for new_draw_info printf-like. 158 * Wrapper for new_draw_info printf-like.
… …
237 * This is a pretty trivial function, but it allows us to use printf style 160 * This is a pretty trivial function, but it allows us to use printf style
238 * formatting, so instead of the calling function having to do it, we do 161 * formatting, so instead of the calling function having to do it, we do
239 * it here. It may also have advantages in the future for reduction of 162 * it here. It may also have advantages in the future for reduction of
240 * client/server bandwidth (client could keep track of various strings 163 * client/server bandwidth (client could keep track of various strings
241 */ 164 */
242 165void
243void new_draw_info_format(int flags, int pri, const object *pl, const char *format, ...) 166new_draw_info_format (int flags, int pri, const object *pl, const char *format, ...)
244{ 167{
245 char buf[HUGE_BUF];
246
247 va_list ap; 168 va_list ap;
248 va_start(ap, format); 169 va_start (ap, format);
249 170 new_draw_info (flags, pri, pl, vformat (format, ap));
250 vsnprintf(buf, HUGE_BUF, format, ap);
251
252 va_end(ap); 171 va_end (ap);
253
254 new_draw_info(flags, pri, pl, buf);
255} 172}
256 173
257
258void draw_ext_info(
259 int flags, int pri, const object *pl, uint8 type,
260 uint8 subtype, const char* message, const char* oldmessage){
261
262 if(!pl || (pl->type!=PLAYER) || (pl->contr==NULL))
263 return;
264
265 if (pri>=pl->contr->listening) return;
266 if (!CLIENT_SUPPORT_READABLES(&pl->contr->socket,type)){
267 char *buf = (char*)malloc(strlen(oldmessage==NULL?message:oldmessage)+1);
268 if (buf==NULL)
269 LOG(llevError,"info::draw_ext_info -> Out of memory!");
270 else{
271 strcpy(buf,oldmessage==NULL?message:oldmessage);
272 strip_media_tag(buf);
273 new_draw_info(flags, pri, pl, buf);
274 free(buf);
275 }
276 }else{
277 esrv_print_ext_msg(&pl->contr->socket,flags&NDI_COLOR_MASK,type,subtype,message);
278 }
279}
280
281void draw_ext_info_format(
282 int flags, int pri, const object *pl, uint8 type,
283 uint8 subtype, const char* old_format,
284 char* new_format, ...){
285
286 char buf[HUGE_BUF];
287 if(!pl || (pl->type!=PLAYER) || (pl->contr==NULL))
288 return;
289
290 if (pri>=pl->contr->listening) return;
291 if (!CLIENT_SUPPORT_READABLES(&pl->contr->socket,type)){
292 va_list ap;
293 LOG(llevDebug,"Non supported extension text type for client.\n");
294 va_start(ap, new_format);
295 vsnprintf(buf, HUGE_BUF, old_format, ap);
296 va_end(ap);
297 new_draw_info(flags, pri, pl, buf);
298 return;
299 }else{
300 va_list ap;
301 va_start(ap, new_format);
302 vsnprintf(buf, HUGE_BUF, new_format, ap);
303 va_end(ap);
304 strip_media_tag(buf);
305 esrv_print_ext_msg(&pl->contr->socket,flags&NDI_COLOR_MASK,type,subtype,buf);
306 }
307}
308/** 174/**
309 * Writes to everyone on the map *except* op. This is useful for emotions. 175 * Writes to everyone on the map *except* op. This is useful for emotions.
310 */ 176 */
311 177void
312void new_info_map_except(int color, mapstruct *map, object *op, const char *str) { 178new_info_map_except (int color, maptile * map, object *op, const char *str)
313 player *pl; 179{
314 180 for_all_players (pl)
315 for(pl = first_player; pl != NULL; pl = pl->next)
316 if(pl->ob != NULL && pl->ob->map == map && pl->ob != op) { 181 if (pl->ob->map == map && pl->ob != op)
317 new_draw_info(color, 0, pl->ob, str); 182 new_draw_info (color, 0, pl->ob, str);
318 }
319}
320
321/**
322 * Writes to everyone on the map except op1 and op2
323 */
324
325void new_info_map_except2(int color, mapstruct *map, object *op1, object *op2,
326 const char *str) {
327 player *pl;
328
329 for(pl = first_player; pl != NULL; pl = pl->next)
330 if(pl->ob != NULL && pl->ob->map == map
331 && pl->ob != op1 && pl->ob != op2) {
332 new_draw_info(color, 0, pl->ob, str);
333 }
334} 183}
335 184
336/** 185/**
337 * Writes to everyone on the specified map 186 * Writes to everyone on the specified map
338 */ 187 */
339 188void
340void new_info_map(int color, mapstruct *map, const char *str) { 189new_info_map (int color, maptile * map, const char *str)
341 player *pl; 190{
342 191 for_all_players (pl)
343 for(pl = first_player; pl != NULL; pl = pl->next) 192 if (pl->ob->map == map)
344 if(pl->ob != NULL && pl->ob->map == map) {
345 new_draw_info(color, 0, pl->ob, str); 193 new_draw_info (color, 0, pl->ob, str);
346 }
347}
348
349
350/**
351 * This does nothing now. However, in theory, we should probably send
352 * something to the client and let the client figure out how it might want
353 * to handle this
354 */
355void clear_win_info(object *op)
356{
357}
358
359/**
360 * Get player's current range attack in obuf.
361 */
362void rangetostring(object *pl,char *obuf)
363{
364 switch(pl->contr->shoottype) {
365 case range_none:
366 strcpy(obuf,"Range: nothing");
367 break;
368
369 case range_bow:
370 {
371 object *op;
372
373 for (op = pl->inv; op; op=op->below)
374 if (op->type == BOW && QUERY_FLAG (op, FLAG_APPLIED))
375 break;
376 if(op==NULL) break;
377
378 sprintf (obuf, "Range: %s (%s)", query_base_name(op, 0),
379 op->race ? (const char *)op->race : "nothing");
380 }
381 break;
382
383 case range_magic:
384 if (settings.casting_time == TRUE) {
385 if (pl->casting_time > -1) {
386 if (pl->casting_time == 0)
387 sprintf(obuf,"Range: Holding spell (%s)",
388 (const char *)pl->spell->name);
389 else
390 sprintf(obuf,"Range: Casting spell (%s)",
391 (const char *)pl->spell->name);
392 } else
393 sprintf(obuf,"Range: spell (%s)", &pl->contr->ranges[range_magic]->name);
394 } else
395 sprintf(obuf,"Range: spell (%s)", &pl->contr->ranges[range_magic]->name);
396 break;
397
398 case range_misc:
399 sprintf(obuf,"Range: %s", pl->contr->ranges[range_misc] ?
400 query_base_name(pl->contr->ranges[range_misc],0) : "none");
401 break;
402
403 /* range_scroll is only used for controlling golems. If the
404 * the player does not have a golem, reset some things.
405 */
406 case range_golem:
407 if (pl->contr->ranges[range_golem]!=NULL)
408 sprintf(obuf,"Range: golem (%s)", &pl->contr->ranges[range_golem]->name);
409 else {
410 pl->contr->shoottype = range_none;
411 strcpy(obuf,"Range: nothing");
412 }
413 break;
414
415 case range_skill:
416 sprintf(obuf,"Skill: %s", pl->chosen_skill!=NULL ?
417 (const char *)pl->chosen_skill->name : "none");
418 break;
419
420 case range_builder:
421 sprintf( obuf, "Builder: %s", query_base_name( pl->contr->ranges[ range_builder ], 0 ) );
422 break;
423
424 default:
425 strcpy(obuf,"Range: illegal");
426 }
427} 194}
428 195
429/** 196/**
430 * Sets player title. 197 * Sets player title.
431 */ 198 */
199void
432void set_title(object *pl, char *buf) 200set_title (object *pl, char *buf)
433{ 201{
434 /* Eneq(@csd.uu.se): Let players define their own titles. */ 202 /* Eneq(@csd.uu.se): Let players define their own titles. */
435 if (pl->contr->own_title[0]=='\0') 203 if (pl->contr->own_title[0] == '\0')
436 sprintf(buf,"Player: %s the %s",(const char *)pl->name,(const char *)pl->contr->title); 204 sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title);
437 else 205 else
438 sprintf(buf,"Player: %s %s",(const char *)pl->name,(const char *)pl->contr->own_title); 206 sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title);
439} 207}
440 208
209// formerly a macro, used only by magic map, so optimised it out
210static inline faceidx
211GET_MAP_FACE (mapspace &ms, int layer)
212{
213 if (object *op = ms.faces_obj [layer])
214 return op->face;
215 else
216 return 0;
217}
441 218
442/** 219/**
443 * Helper for magic map creation. 220 * Helper for magic map creation.
444 * 221 *
445 * Takes a player, the map_mark array and an x and y starting position. 222 * Takes a player, the map_mark array and an x and y starting position.
… …
448 * 225 *
449 * This function examines all the adjacant spaces next to px, py. 226 * This function examines all the adjacant spaces next to px, py.
450 * It updates the map_mark arrow with the color and high bits set 227 * It updates the map_mark arrow with the color and high bits set
451 * for various code values. 228 * for various code values.
452 */ 229 */
230static void
453static void magic_mapping_mark_recursive(object *pl, char *map_mark, int px, int py) 231magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py)
454{ 232{
455 int x, y, dx, dy,mflags;
456 sint16 nx, ny;
457 mapstruct *mp;
458 New_Face *f;
459
460 for (dx = -1; dx <= 1; dx++) { 233 for (int dx = -1; dx <= 1; dx++)
234 {
461 for (dy = -1; dy <= 1; dy++) { 235 for (int dy = -1; dy <= 1; dy++)
236 {
462 x = px + dx; 237 int x = px + dx;
463 y = py + dy; 238 int y = py + dy;
464 239
465 if (FABS(x) >= MAGIC_MAP_HALF || FABS(y) >= MAGIC_MAP_HALF) continue; 240 if (abs (x) >= MAGIC_MAP_HALF || abs (y) >= MAGIC_MAP_HALF)
241 continue;
466 242
467 mp = pl->map; 243 mapxy pos (pl);
468 nx = pl->x + x; 244 pos.move (x, y);
469 ny = pl->y + y;
470 245
471 mflags = get_map_flags(pl->map, &mp, nx, ny, &nx, &ny); 246 if (!pos.normalise ())
472 if (mflags & P_OUT_OF_MAP) continue; 247 continue;
473 248
249 mapspace &ms = pos.ms ();
250
474 if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE* (MAGIC_MAP_HALF + y)] == 0) { 251 if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0)
252 {
253 int mflags = ms.flags ();
254
475 f= GET_MAP_FACE(mp, nx, ny, 0); 255 int f = GET_MAP_FACE (ms, 0);
256 if (f == blank_face)
257 {
258 f = GET_MAP_FACE (ms, 1);
476 if (f == blank_face) 259 if (f == blank_face)
477 f= GET_MAP_FACE(mp, nx, ny, 1);
478 if (f == blank_face)
479 f= GET_MAP_FACE(mp, nx, ny, 2); 260 f = GET_MAP_FACE (ms, 2);
261 }
480 262
263 int magicmap = faces [f].magicmap;
264
481 /* Should probably have P_NO_MAGIC here also, but then shops don't 265 /* Should probably have P_NO_MAGIC here also, but then shops don't
482 * work. 266 * work.
483 */ 267 */
484 if (mflags & P_BLOCKSVIEW) 268 if (mflags & P_BLOCKSVIEW)
485 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE* (MAGIC_MAP_HALF + y)] = FACE_WALL | (f?f->magicmap:0); 269 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap;
486 else { 270 else
271 {
487 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE* (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f?f->magicmap:0); 272 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap;
488 magic_mapping_mark_recursive(pl, map_mark, x, y); 273 magic_mapping_mark_recursive (pl, map_mark, x, y);
489 } 274 }
490 } 275 }
491 } 276 }
492 } 277 }
493} 278}
494 279
495
496/** 280/**
497 * Creates magic map for player. 281 * Creates magic map for player.
498 * 282 *
499 * Note: For improved magic mapping display, the space that blocks 283 * Note: For improved magic mapping display, the space that blocks
500 * the view is now marked with value 2. Any dependencies of map_mark 284 * the view is now marked with value 2. Any dependencies of map_mark
501 * being nonzero have been changed to check for 1. Also, since 285 * being nonzero have been changed to check for 1. Also, since
502 * map_mark is a char value, putting 2 in should cause no problems. 286 * map_mark is a char value, putting 2 in should cause no problems.
503 * 287 *
504 * This function examines the map the player is on, and determines what 288 * This function examines the map the player is on, and determines what
505 * is visible. 2 is set for walls or objects that blocks view. 1 289 * is visible. 2 is set for walls or objects that blocks view. 1
506 * is for open spaces. map_mark should already have been initialized 290 * is for open spaces. map_mark should already have been initialised
507 * to zero before this is called. 291 * to zero before this is called.
508 * strength is an initial strength*2 rectangular area that we automatically 292 * strength is an initial strength*2 rectangular area that we automatically
509 * see in/penetrate through. 293 * see in/penetrate through.
510 */ 294 */
511 295static void
512void magic_mapping_mark(object *pl, char *map_mark, int strength) 296magic_mapping_mark (object *pl, char *map_mark, int strength)
513{ 297{
514 int x, y, mflags;
515 sint16 nx, ny;
516 mapstruct *mp;
517 New_Face *f;
518
519 for (x = -strength; x <strength; x++) { 298 for (int x = -strength; x < strength; x++)
299 {
520 for (y = -strength; y <strength; y++) { 300 for (int y = -strength; y < strength; y++)
521 mp = pl->map; 301 {
522 nx = pl->x + x; 302 mapxy pos (pl);
523 ny = pl->y + y; 303 pos.move (x, y);
524 mflags = get_map_flags(pl->map, &mp, nx, ny, &nx, &ny); 304
525 if (mflags & P_OUT_OF_MAP) 305 if (!pos.normalise ())
526 continue; 306 continue;
307
308 mapspace &ms = pos.ms ();
309
310 int mflags = ms.flags ();
311
312 int f = GET_MAP_FACE (ms, 0);
313 if (f == blank_face)
527 else { 314 {
528 f= GET_MAP_FACE(mp, nx, ny, 0); 315 f = GET_MAP_FACE (ms, 1);
529 if (f == blank_face) 316 if (f == blank_face)
530 f= GET_MAP_FACE(mp, nx, ny, 1);
531 if (f == blank_face)
532 f= GET_MAP_FACE(mp, nx, ny, 2); 317 f = GET_MAP_FACE (ms, 2);
533 } 318 }
534 319
320 int magicmap = faces [f].magicmap;
321
535 if (mflags & P_BLOCKSVIEW) 322 if (mflags & P_BLOCKSVIEW)
536 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE* (MAGIC_MAP_HALF + y)] = FACE_WALL | (f?f->magicmap:0); 323 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap;
537 else { 324 else
325 {
538 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE* (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f?f->magicmap:0); 326 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap;
539 magic_mapping_mark_recursive(pl, map_mark, x, y); 327 magic_mapping_mark_recursive (pl, map_mark, x, y);
540 } 328 }
541 } 329 }
542 } 330 }
543} 331}
544 332
545
546/** 333/**
547 * Creates and sends magic map to player. 334 * Creates and sends magic map to player.
548 * 335 *
549 * The following function is a lot messier than it really should be, 336 * The following function is a lot messier than it really should be,
550 * but there is no real easy solution. 337 * but there is no real easy solution.
551 * 338 *
552 * Mark Wedel 339 * Mark Wedel
553 */ 340 */
554 341void
555void draw_magic_map(object *pl) 342draw_magic_map (object *pl)
556{ 343{
557 int x,y;
558 char *map_mark = (char *) calloc(MAGIC_MAP_SIZE*MAGIC_MAP_SIZE, 1); 344 char *map_mark = (char *)calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1);
559 int xmin, xmax, ymin, ymax; 345 int xmin, xmax, ymin, ymax;
560 SockList sl;
561 346
562 if (pl->type!=PLAYER) { 347 if (pl->type != PLAYER)
348 {
563 LOG(llevError,"Non player object called draw_map.\n"); 349 LOG (llevError, "Non player object called draw_map.\n");
564 return; 350 return;
565 }
566 351 }
352
567 /* First, we figure out what spaces are 'reachable' by the player */ 353 /* First, we figure out what spaces are 'reachable' by the player */
568 magic_mapping_mark(pl, map_mark, 3); 354 magic_mapping_mark (pl, map_mark, 3);
569 355
570 /* We now go through and figure out what spaces have been 356 /* We now go through and figure out what spaces have been
571 * marked, and thus figure out rectangular region we send 357 * marked, and thus figure out rectangular region we send
572 * to the client (eg, if only a 10x10 area is visible, we only 358 * to the client (eg, if only a 10x10 area is visible, we only
573 * want to send those 100 spaces.) 359 * want to send those 100 spaces.)
574 */ 360 */
575 xmin = MAGIC_MAP_SIZE; 361 xmin = MAGIC_MAP_SIZE;
576 ymin = MAGIC_MAP_SIZE; 362 ymin = MAGIC_MAP_SIZE;
577 xmax = 0; 363 xmax = 0;
578 ymax = 0; 364 ymax = 0;
365
579 for(x = 0; x < MAGIC_MAP_SIZE ; x++) { 366 for (int x = 0; x < MAGIC_MAP_SIZE; x++)
580 for(y = 0; y < MAGIC_MAP_SIZE; y++) { 367 for (int y = 0; y < MAGIC_MAP_SIZE; y++)
581 if (map_mark[x + MAP_WIDTH(pl->map) * y] | FACE_FLOOR) { 368 if (map_mark[x + pl->map->width * y] | FACE_FLOOR)
369 {
582 xmin = x < xmin ? x : xmin; 370 xmin = x < xmin ? x : xmin;
583 xmax = x > xmax ? x : xmax; 371 xmax = x > xmax ? x : xmax;
584 ymin = y < ymin ? y : ymin; 372 ymin = y < ymin ? y : ymin;
585 ymax = y > ymax ? y : ymax; 373 ymax = y > ymax ? y : ymax;
586 }
587 } 374 }
588 }
589 375
590 sl.buf= (unsigned char*) malloc(MAXSOCKBUF); 376 packet sl;
591 snprintf((char*)sl.buf, MAXSOCKBUF, "magicmap %d %d %d %d ", (xmax-xmin+1), (ymax-ymin+1), 377 sl.printf ("magicmap %d %d %d %d ", (xmax - xmin + 1), (ymax - ymin + 1),
592 MAGIC_MAP_HALF - xmin, MAGIC_MAP_HALF - ymin); 378 MAGIC_MAP_HALF - xmin, MAGIC_MAP_HALF - ymin);
593 sl.len=strlen((char*)sl.buf); 379
594
595 for (y = ymin; y <= ymax; y++) { 380 for (int y = ymin; y <= ymax; y++)
596 for (x = xmin; x <= xmax; x++) { 381 for (int x = xmin; x <= xmax; x++)
597 sl.buf[sl.len++]= map_mark[x+MAGIC_MAP_SIZE*y] & ~FACE_FLOOR; 382 sl << uint8 (map_mark[x + MAGIC_MAP_SIZE * y] & ~FACE_FLOOR);
598 } /* x loop */ 383
599 } /* y loop */ 384 pl->contr->ns->send_packet (sl);
600 385
601 Send_With_Handling(&pl->contr->socket, &sl);
602 free(sl.buf);
603 free(map_mark); 386 free (map_mark);
604} 387}
605 388
606
607/**
608 * Send a kill log record to sockets
609 */
610
611void Log_Kill(const char *Who,
612 const char *What, int WhatType,
613 const char *With, int WithType)
614{
615 int i;
616 size_t len;
617 char buf[MAX_BUF];
618
619 if (With!=NULL) {
620 snprintf(buf, MAX_BUF, "%s\t%s\t%d\t%s\t%d\n",Who,What,WhatType,With,WithType);
621 }
622 else {
623 snprintf(buf,MAX_BUF, "%s\t%s\t%d\n",Who,What,WhatType);
624 }
625 len=strlen(buf);
626 for(i=1; i<socket_info.allocated_sockets; i++) {
627 if (init_sockets[i].old_mode == Old_Listen) {
628 cs_write_string(&init_sockets[i], buf, len);
629 }
630 }
631}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines