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.24 by root, Mon Dec 25 11:25:50 2006 UTC vs.
Revision 1.44 by root, Tue Jun 5 13:05:03 2007 UTC

1
2/* 1/*
3 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
4 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software; you can redistribute it and/or modify it
9 it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 (at your option) any later version. 11 * any later version.
12 12 *
13 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful, but
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 GNU General Public License for more details. 16 * for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License along
19 along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 21 *
22 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23*/ 23 */
24 24
25/** 25/**
26 * \file 26 * \file
27 * Basic client output functions. 27 * Basic client output functions.
28 * 28 *
… …
86 86
87 if (pl->type == PLAYER) 87 if (pl->type == PLAYER)
88 esrv_print_msg (pl->contr->ns, colr, (char *) tmp); 88 esrv_print_msg (pl->contr->ns, colr, (char *) tmp);
89} 89}
90 90
91/** 91bool
92 * Prints out the contents of specified buffer structures, 92client::msg_suppressed (const char *msg)
93 * and clears the string.
94 */
95void
96flush_output_element (const object *pl, Output_Buf * outputs)
97{ 93{
98 char tbuf[MAX_BUF]; 94 if (!pl)
99
100 if (outputs->buf == NULL)
101 return; 95 return false;
102 if (outputs->count > 1) 96
103 { 97 if (pl->outputs_count <= 1 || !pl->outputs_sync)
104 snprintf (tbuf, MAX_BUF, "%d times %s", outputs->count, &outputs->buf); 98 return false;
105 print_message (NDI_BLACK, pl, tbuf); 99
100 int len = strlen (msg);
101
102 if (len > MSG_BUF_SIZE)
103 return false;
104
105 msg_buf *lru = msgbuf;
106 for (msg_buf *buf = msgbuf; buf < msgbuf + MSG_BUF_COUNT; ++buf)
106 } 107 {
107 else 108 if (len == buf->len && !memcmp (msg, buf->msg, len))
108 print_message (NDI_BLACK, pl, &outputs->buf);
109
110 outputs->buf = NULL;
111 outputs->first_update = 0; /* This way, it will be reused */
112}
113
114/**
115 * Sends message to player through output buffers.
116 * \param pl player to send message
117 * \param buf message to send
118 *
119 * If player's output_count is 1, sends message directly.
120 *
121 * Else checks output buffers for specified message.
122 *
123 * If found, checks if message should be sent now.
124 *
125 * If message not already in buffers, flushes olders buffer,
126 * and adds message to queue.
127 */
128static void
129check_output_buffers (const object *pl, const char *buf)
130{
131 int i, oldest = 0;
132
133 if (pl->contr->outputs_count < 2)
134 {
135 print_message (NDI_BLACK, pl, buf);
136 return;
137 }
138 else
139 {
140 for (i = 0; i < NUM_OUTPUT_BUFS; i++)
141 { 109 {
142 if (pl->contr->outputs[i].buf && !strcmp (buf, pl->contr->outputs[i].buf)) 110 // found matching buf, see if expired
111 if (buf->expire <= pticks || !buf->count)
143 break; 112 {
144 else if (pl->contr->outputs[i].first_update < pl->contr->outputs[oldest].first_update) 113 // yes, take over matching buffer, print
145 oldest = i; 114 buf->expire = pticks + pl->outputs_sync;
115 buf->count = pl->outputs_count;
116
117 return false;
118 }
119
120 // no, suppress
121 --buf->count;
122 return true;
146 } 123 }
147 /* We found a match */
148 if (i < NUM_OUTPUT_BUFS)
149 {
150 pl->contr->outputs[i].count++;
151 if (pl->contr->outputs[i].count >= pl->contr->outputs_count)
152 {
153 flush_output_element (pl, &pl->contr->outputs[i]);
154 }
155 }
156 /* No match - flush the oldest, and put the new one in */
157 else
158 {
159 flush_output_element (pl, &pl->contr->outputs[oldest]);
160 124
161 pl->contr->outputs[oldest].first_update = pticks; 125 if (lru->expire > buf->expire)
162 pl->contr->outputs[oldest].count = 1; 126 lru = buf;
163 pl->contr->outputs[oldest].buf = buf;
164 }
165 } 127 }
128
129 // new message, evoke oldest buffer
130 lru->expire = pticks + pl->outputs_sync;
131 lru->count = pl->outputs_count;
132 lru->len = len;
133 memcpy (lru->msg, msg, len);
134
135 return false;
166} 136}
167 137
168/** 138/**
169 * Sends message to player(s). 139 * Sends message to player(s).
170 * 140 *
… …
179 * in the flags. 149 * in the flags.
180 * 150 *
181 * If message is black, and not NDI_UNIQUE, gets sent through output buffers. 151 * If message is black, and not NDI_UNIQUE, gets sent through output buffers.
182 * 152 *
183 */ 153 */
184
185void 154void
186new_draw_info (int flags, int pri, const object *pl, const char *buf) 155new_draw_info (int flags, int pri, const object *op, const char *buf)
187{ 156{
188 if (flags & NDI_ALL) 157 if (flags & NDI_ALL)
189 { 158 {
190 player *tmppl;
191
192 for_all_players (pl) 159 for_all_players (pl)
193 new_draw_info ((flags & ~NDI_ALL), pri, tmppl->ob, buf); 160 new_draw_info (flags & ~NDI_ALL, pri, pl->ob, buf);
194
195 return;
196 }
197
198 if (!pl || (pl->type == PLAYER && pl->contr == NULL))
199 { 161 }
200 /* Write to the socket? */
201 print_message (0, NULL, buf);
202 return;
203 }
204
205 if (pl->type != PLAYER)
206 return;
207
208 if (pri >= pl->contr->listening)
209 return;
210
211 if ((flags & NDI_COLOR_MASK) == NDI_BLACK && !(flags & NDI_UNIQUE))
212 /* following prints stuff out, as appropriate */
213 check_output_buffers (pl, buf);
214 else 162 else
163 {
164 if (!op || !op->contr || !op->contr->ns)
165 return;
166
167 if (pri >= op->contr->listening)
168 return;
169
170 if ((flags & (NDI_COLOR_MASK | NDI_UNIQUE)) != NDI_BLACK
171 || !op->contr->ns->msg_suppressed (buf))
215 print_message (flags & NDI_COLOR_MASK, pl, buf); 172 print_message (flags & NDI_COLOR_MASK, op, buf);
173 }
216} 174}
217 175
218/** 176/**
219 * Wrapper for new_draw_info printf-like. 177 * Wrapper for new_draw_info printf-like.
220 * 178 *
… …
227new_draw_info_format (int flags, int pri, const object *pl, const char *format, ...) 185new_draw_info_format (int flags, int pri, const object *pl, const char *format, ...)
228{ 186{
229 char buf[HUGE_BUF]; 187 char buf[HUGE_BUF];
230 188
231 va_list ap; 189 va_list ap;
232
233 va_start (ap, format); 190 va_start (ap, format);
234
235 vsnprintf (buf, HUGE_BUF, format, ap); 191 vsnprintf (buf, HUGE_BUF, format, ap);
236
237 va_end (ap); 192 va_end (ap);
238 193
239 new_draw_info (flags, pri, pl, buf); 194 new_draw_info (flags, pri, pl, buf);
240} 195}
241 196
… …
268} 223}
269 224
270void 225void
271draw_ext_info_format (int flags, int pri, const object *pl, uint8 type, uint8 subtype, const char *old_format, char *new_format, ...) 226draw_ext_info_format (int flags, int pri, const object *pl, uint8 type, uint8 subtype, const char *old_format, char *new_format, ...)
272{ 227{
273
274 char buf[HUGE_BUF]; 228 char buf[HUGE_BUF];
275 229
276 if (!pl || (pl->type != PLAYER) || (pl->contr == NULL)) 230 if (!pl || (pl->type != PLAYER) || (pl->contr == NULL))
277 return; 231 return;
278 232
… …
307 */ 261 */
308 262
309void 263void
310new_info_map_except (int color, maptile * map, object *op, const char *str) 264new_info_map_except (int color, maptile * map, object *op, const char *str)
311{ 265{
312 player *pl;
313
314 for_all_players (pl) 266 for_all_players (pl)
315 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op) 267 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op)
316 {
317 new_draw_info (color, 0, pl->ob, str); 268 new_draw_info (color, 0, pl->ob, str);
318 }
319} 269}
320 270
321/** 271/**
322 * Writes to everyone on the map except op1 and op2 272 * Writes to everyone on the map except op1 and op2
323 */ 273 */
324
325void 274void
326new_info_map_except2 (int color, maptile * map, object *op1, object *op2, const char *str) 275new_info_map_except2 (int color, maptile * map, object *op1, object *op2, const char *str)
327{ 276{
328 player *pl;
329
330 for_all_players (pl) 277 for_all_players (pl)
331 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op1 && pl->ob != op2) 278 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op1 && pl->ob != op2)
332 {
333 new_draw_info (color, 0, pl->ob, str); 279 new_draw_info (color, 0, pl->ob, str);
334 }
335} 280}
336 281
337/** 282/**
338 * Writes to everyone on the specified map 283 * Writes to everyone on the specified map
339 */ 284 */
340
341void 285void
342new_info_map (int color, maptile * map, const char *str) 286new_info_map (int color, maptile * map, const char *str)
343{ 287{
344 player *pl;
345
346 for_all_players (pl) 288 for_all_players (pl)
347 if (pl->ob != NULL && pl->ob->map == map) 289 if (pl->ob != NULL && pl->ob->map == map)
348 {
349 new_draw_info (color, 0, pl->ob, str); 290 new_draw_info (color, 0, pl->ob, str);
350 }
351}
352
353
354/**
355 * This does nothing now. However, in theory, we should probably send
356 * something to the client and let the client figure out how it might want
357 * to handle this
358 */
359void
360clear_win_info (object *op)
361{
362}
363
364/**
365 * Get player's current range attack in obuf.
366 */
367void
368rangetostring (object *pl, char *obuf)
369{
370 switch (pl->contr->shoottype)
371 {
372 case range_none:
373 strcpy (obuf, "Range: nothing");
374 break;
375
376 case range_bow:
377 {
378 object *op;
379
380 for (op = pl->inv; op; op = op->below)
381 if (op->type == BOW && QUERY_FLAG (op, FLAG_APPLIED))
382 break;
383
384 if (op == NULL)
385 break;
386
387 sprintf (obuf, "Range: %s (%s)", query_base_name (op, 0), op->race ? (const char *) op->race : "nothing");
388 }
389 break;
390
391 case range_magic:
392 if (settings.casting_time == TRUE)
393 {
394 if (pl->casting_time > -1)
395 {
396 if (pl->casting_time == 0)
397 sprintf (obuf, "Range: Holding spell (%s)", &pl->spell->name);
398 else
399 sprintf (obuf, "Range: Casting spell (%s)", &pl->spell->name);
400 }
401 else
402 sprintf (obuf, "Range: spell (%s)", &pl->contr->ranges[range_magic]->name);
403 }
404 else
405 sprintf (obuf, "Range: spell (%s)", &pl->contr->ranges[range_magic]->name);
406 break;
407
408 case range_misc:
409 sprintf (obuf, "Range: %s", pl->contr->ranges[range_misc] ? query_base_name (pl->contr->ranges[range_misc], 0) : "none");
410 break;
411
412 /* range_scroll is only used for controlling golems. If the
413 * the player does not have a golem, reset some things.
414 */
415 case range_golem:
416 if (pl->contr->ranges[range_golem] != NULL)
417 sprintf (obuf, "Range: golem (%s)", &pl->contr->ranges[range_golem]->name);
418 else
419 {
420 pl->contr->shoottype = range_none;
421 strcpy (obuf, "Range: nothing");
422 }
423 break;
424
425 case range_skill:
426 sprintf (obuf, "Skill: %s", pl->chosen_skill != NULL ? (const char *) pl->chosen_skill->name : "none");
427 break;
428
429 case range_builder:
430 sprintf (obuf, "Builder: %s", query_base_name (pl->contr->ranges[range_builder], 0));
431 break;
432
433 default:
434 strcpy (obuf, "Range: illegal");
435 }
436} 291}
437 292
438/** 293/**
439 * Sets player title. 294 * Sets player title.
440 */ 295 */
… …
446 sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title); 301 sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title);
447 else 302 else
448 sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title); 303 sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title);
449} 304}
450 305
306// formerly a macro, used only by magic map, so optimised it out
307static inline faceidx
308GET_MAP_FACE (maptile *m, int x, int y, int layer)
309{
310 if (object *op = GET_MAP_FACE_OBJ (m, x, y, layer))
311 return op->face;
312 else
313 return 0;
314}
451 315
452/** 316/**
453 * Helper for magic map creation. 317 * Helper for magic map creation.
454 * 318 *
455 * Takes a player, the map_mark array and an x and y starting position. 319 * Takes a player, the map_mark array and an x and y starting position.
… …
464magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py) 328magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py)
465{ 329{
466 int x, y, dx, dy, mflags; 330 int x, y, dx, dy, mflags;
467 sint16 nx, ny; 331 sint16 nx, ny;
468 maptile *mp; 332 maptile *mp;
469 New_Face *f;
470 333
471 for (dx = -1; dx <= 1; dx++) 334 for (dx = -1; dx <= 1; dx++)
472 { 335 {
473 for (dy = -1; dy <= 1; dy++) 336 for (dy = -1; dy <= 1; dy++)
474 { 337 {
… …
486 if (mflags & P_OUT_OF_MAP) 349 if (mflags & P_OUT_OF_MAP)
487 continue; 350 continue;
488 351
489 if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0) 352 if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0)
490 { 353 {
491 f = GET_MAP_FACE (mp, nx, ny, 0); 354 int f = GET_MAP_FACE (mp, nx, ny, 0);
492 if (f == blank_face) 355 if (f == blank_face)
356 {
493 f = GET_MAP_FACE (mp, nx, ny, 1); 357 f = GET_MAP_FACE (mp, nx, ny, 1);
494 if (f == blank_face) 358 if (f == blank_face)
495 f = GET_MAP_FACE (mp, nx, ny, 2); 359 f = GET_MAP_FACE (mp, nx, ny, 2);
360 }
361
362 int magicmap = faces [f].magicmap;
496 363
497 /* Should probably have P_NO_MAGIC here also, but then shops don't 364 /* Should probably have P_NO_MAGIC here also, but then shops don't
498 * work. 365 * work.
499 */ 366 */
500 if (mflags & P_BLOCKSVIEW) 367 if (mflags & P_BLOCKSVIEW)
501 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | (f ? f->magicmap : 0); 368 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap;
502 else 369 else
503 { 370 {
504 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f ? f->magicmap : 0); 371 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap;
505 magic_mapping_mark_recursive (pl, map_mark, x, y); 372 magic_mapping_mark_recursive (pl, map_mark, x, y);
506 } 373 }
507 } 374 }
508 } 375 }
509 } 376 }
510} 377}
511 378
512
513/** 379/**
514 * Creates magic map for player. 380 * Creates magic map for player.
515 * 381 *
516 * Note: For improved magic mapping display, the space that blocks 382 * Note: For improved magic mapping display, the space that blocks
517 * the view is now marked with value 2. Any dependencies of map_mark 383 * the view is now marked with value 2. Any dependencies of map_mark
518 * being nonzero have been changed to check for 1. Also, since 384 * being nonzero have been changed to check for 1. Also, since
519 * map_mark is a char value, putting 2 in should cause no problems. 385 * map_mark is a char value, putting 2 in should cause no problems.
520 * 386 *
521 * This function examines the map the player is on, and determines what 387 * This function examines the map the player is on, and determines what
522 * is visible. 2 is set for walls or objects that blocks view. 1 388 * is visible. 2 is set for walls or objects that blocks view. 1
523 * is for open spaces. map_mark should already have been initialized 389 * is for open spaces. map_mark should already have been initialised
524 * to zero before this is called. 390 * to zero before this is called.
525 * strength is an initial strength*2 rectangular area that we automatically 391 * strength is an initial strength*2 rectangular area that we automatically
526 * see in/penetrate through. 392 * see in/penetrate through.
527 */ 393 */
528
529void 394void
530magic_mapping_mark (object *pl, char *map_mark, int strength) 395magic_mapping_mark (object *pl, char *map_mark, int strength)
531{ 396{
532 int x, y, mflags; 397 int x, y, mflags;
533 sint16 nx, ny; 398 sint16 nx, ny;
534 maptile *mp; 399 maptile *mp;
535 New_Face *f;
536 400
537 for (x = -strength; x < strength; x++) 401 for (x = -strength; x < strength; x++)
538 { 402 {
539 for (y = -strength; y < strength; y++) 403 for (y = -strength; y < strength; y++)
540 { 404 {
541 mp = pl->map; 405 mp = pl->map;
542 nx = pl->x + x; 406 nx = pl->x + x;
543 ny = pl->y + y; 407 ny = pl->y + y;
408
544 mflags = get_map_flags (pl->map, &mp, nx, ny, &nx, &ny); 409 mflags = get_map_flags (pl->map, &mp, nx, ny, &nx, &ny);
545 if (mflags & P_OUT_OF_MAP) 410 if (mflags & P_OUT_OF_MAP)
546 continue; 411 continue;
547 else 412
413 int f = GET_MAP_FACE (mp, nx, ny, 0);
414 if (f == blank_face)
548 { 415 {
549 f = GET_MAP_FACE (mp, nx, ny, 0);
550 if (f == blank_face)
551 f = GET_MAP_FACE (mp, nx, ny, 1); 416 f = GET_MAP_FACE (mp, nx, ny, 1);
552 if (f == blank_face) 417 if (f == blank_face)
553 f = GET_MAP_FACE (mp, nx, ny, 2); 418 f = GET_MAP_FACE (mp, nx, ny, 2);
554 } 419 }
555 420
421 int magicmap = faces [f].magicmap;
422
556 if (mflags & P_BLOCKSVIEW) 423 if (mflags & P_BLOCKSVIEW)
557 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | (f ? f->magicmap : 0); 424 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap;
558 else 425 else
559 { 426 {
560 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f ? f->magicmap : 0); 427 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap;
561 magic_mapping_mark_recursive (pl, map_mark, x, y); 428 magic_mapping_mark_recursive (pl, map_mark, x, y);
562 } 429 }
563 } 430 }
564 } 431 }
565} 432}
… …
570 * The following function is a lot messier than it really should be, 437 * The following function is a lot messier than it really should be,
571 * but there is no real easy solution. 438 * but there is no real easy solution.
572 * 439 *
573 * Mark Wedel 440 * Mark Wedel
574 */ 441 */
575
576void 442void
577draw_magic_map (object *pl) 443draw_magic_map (object *pl)
578{ 444{
579 char *map_mark = (char *)calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1); 445 char *map_mark = (char *)calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1);
580 int xmin, xmax, ymin, ymax; 446 int xmin, xmax, ymin, ymax;
… …
598 xmax = 0; 464 xmax = 0;
599 ymax = 0; 465 ymax = 0;
600 466
601 for (int x = 0; x < MAGIC_MAP_SIZE; x++) 467 for (int x = 0; x < MAGIC_MAP_SIZE; x++)
602 for (int y = 0; y < MAGIC_MAP_SIZE; y++) 468 for (int y = 0; y < MAGIC_MAP_SIZE; y++)
603 if (map_mark[x + MAP_WIDTH (pl->map) * y] | FACE_FLOOR) 469 if (map_mark[x + pl->map->width * y] | FACE_FLOOR)
604 { 470 {
605 xmin = x < xmin ? x : xmin; 471 xmin = x < xmin ? x : xmin;
606 xmax = x > xmax ? x : xmax; 472 xmax = x > xmax ? x : xmax;
607 ymin = y < ymin ? y : ymin; 473 ymin = y < ymin ? y : ymin;
608 ymax = y > ymax ? y : ymax; 474 ymax = y > ymax ? y : ymax;

Diff Legend

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