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

Comparing deliantra/server/common/player.C (file contents):
Revision 1.26 by root, Tue May 1 05:48:20 2007 UTC vs.
Revision 1.44 by root, Tue Sep 9 10:51:59 2008 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25#include <global.h> 24#include <global.h>
26#include <funcpoint.h>
27 25
28/* Determine if the attacktype represented by the 26/* Determine if the attacktype represented by the
29 * specified attack-number is enabled for dragon players. 27 * specified attack-number is enabled for dragon players.
30 * A dragon player (quetzal) can gain resistances for 28 * A dragon player (quetzal) can gain resistances for
31 * all enabled attacktypes. 29 * all enabled attacktypes.
… …
48is_dragon_pl (const object *op) 46is_dragon_pl (const object *op)
49{ 47{
50 if (op 48 if (op
51 && op->type == PLAYER 49 && op->type == PLAYER
52 && op->arch 50 && op->arch
53 && op->arch->clone.race 51 && op->arch->race
54 && !strcmp (op->arch->clone.race, "dragon")) 52 && !strcmp (op->arch->race, "dragon"))
55 return 1; 53 return 1;
56 54
57 return 0; 55 return 0;
58} 56}
59 57
… …
77#define PL_OUT(k) freezer.put (KW_ ## k, k) 75#define PL_OUT(k) freezer.put (KW_ ## k, k)
78#define PL_OUT2(k,v) freezer.put (KW_ ## k, v) 76#define PL_OUT2(k,v) freezer.put (KW_ ## k, v)
79 77
80 PL_OUT (password); 78 PL_OUT (password);
81 PL_OUT2 (title, own_title); 79 PL_OUT2 (title, own_title);
80 PL_OUT (gender);
81 PL_OUT (hintmode);
82 PL_OUT (gen_hp); 82 PL_OUT (gen_hp);
83 PL_OUT (gen_sp); 83 PL_OUT (gen_sp);
84 PL_OUT (gen_grace); 84 PL_OUT (gen_grace);
85 PL_OUT (listening);
86 PL_OUT (bowtype); 85 PL_OUT (bowtype);
87 PL_OUT (petmode); 86 PL_OUT (petmode);
88 PL_OUT (peaceful); 87 PL_OUT (peaceful);
89 PL_OUT (digestion); 88 PL_OUT (digestion);
90 PL_OUT2 (pickup, mode); 89 PL_OUT2 (pickup, mode);
… …
97 PL_OUT2 (map, maplevel); 96 PL_OUT2 (map, maplevel);
98 PL_OUT (savebed_map); 97 PL_OUT (savebed_map);
99 PL_OUT (bed_x); 98 PL_OUT (bed_x);
100 PL_OUT (bed_y); 99 PL_OUT (bed_y);
101 PL_OUT (weapon_sp); 100 PL_OUT (weapon_sp);
101 PL_OUT (weapon_sp_left);
102 PL_OUT2 (Str, orig_stats.Str); 102 PL_OUT2 (Str, orig_stats.Str);
103 PL_OUT2 (Dex, orig_stats.Dex); 103 PL_OUT2 (Dex, orig_stats.Dex);
104 PL_OUT2 (Con, orig_stats.Con); 104 PL_OUT2 (Con, orig_stats.Con);
105 PL_OUT2 (Int, orig_stats.Int); 105 PL_OUT2 (Int, orig_stats.Int);
106 PL_OUT2 (Pow, orig_stats.Pow); 106 PL_OUT2 (Pow, orig_stats.Pow);
… …
109 109
110 PL_OUT2 (lev_array, 10); 110 PL_OUT2 (lev_array, 10);
111 111
112 for (int i = 1; i <= 10; i++) 112 for (int i = 1; i <= 10; i++)
113 { 113 {
114 fprintf (freezer, "%d\n", levhp [i]); 114 freezer.add (levhp [i]); freezer.add ('\n');
115 fprintf (freezer, "%d\n", levsp [i]); 115 freezer.add (levsp [i]); freezer.add ('\n');
116 fprintf (freezer, "%d\n", levgrace[i]); 116 freezer.add (levgrace[i]); freezer.add ('\n');
117 } 117 }
118 118
119 freezer.put (ob->contr); 119 freezer.put (ob->contr);
120 freezer.put (KW_endplst); 120 freezer.put (KW_endplst);
121 121
… …
189 case KW_oid: f.get (pl, f.get_sint32 ()); break; 189 case KW_oid: f.get (pl, f.get_sint32 ()); break;
190 case KW_password: assign (pl->password , f.get_str ()); break; 190 case KW_password: assign (pl->password , f.get_str ()); break;
191 case KW_title: assign (pl->own_title, f.get_str ()); break; 191 case KW_title: assign (pl->own_title, f.get_str ()); break;
192 case KW_bowtype: pl->bowtype = (bowtype_t) f.get_sint32 (); break; 192 case KW_bowtype: pl->bowtype = (bowtype_t) f.get_sint32 (); break;
193 case KW_petmode: pl->petmode = (petmode_t) f.get_sint32 (); break; 193 case KW_petmode: pl->petmode = (petmode_t) f.get_sint32 (); break;
194 case KW_listening: f.get (pl->listening); break; 194 case KW_gender: f.get (pl->gender); break;
195 case KW_hintmode: f.get (pl->hintmode); break;
196 case KW_listening: /*TODO*/; break;
195 case KW_peaceful: f.get (pl->peaceful); break; 197 case KW_peaceful: f.get (pl->peaceful); break;
196 case KW_digestion: f.get (pl->digestion); break; 198 case KW_digestion: f.get (pl->digestion); break;
197 case KW_pickup: f.get (pl->mode); break; 199 case KW_pickup: f.get (pl->mode); break;
198 case KW_outputs_sync: f.get (pl->outputs_sync); break; 200 case KW_outputs_sync: f.get (pl->outputs_sync); break;
199 case KW_outputs_count: f.get (pl->outputs_count); break; 201 case KW_outputs_count: f.get (pl->outputs_count); break;
200 case KW_map: f.get (pl->maplevel); break; 202 case KW_map: f.get (pl->maplevel); break;
201 case KW_savebed_map: f.get (pl->savebed_map); break; 203 case KW_savebed_map: f.get (pl->savebed_map); break;
202 case KW_bed_x: f.get (pl->bed_x); break; 204 case KW_bed_x: f.get (pl->bed_x); break;
203 case KW_bed_y: f.get (pl->bed_y); break; 205 case KW_bed_y: f.get (pl->bed_y); break;
204 case KW_weapon_sp: f.get (pl->weapon_sp); break; 206 case KW_weapon_sp: f.get (pl->weapon_sp); break;
207 case KW_weapon_sp_left:f.get (pl->weapon_sp_left); break;
205 case KW_Str: f.get (pl->orig_stats.Str); break; 208 case KW_Str: f.get (pl->orig_stats.Str); break;
206 case KW_Dex: f.get (pl->orig_stats.Dex); break; 209 case KW_Dex: f.get (pl->orig_stats.Dex); break;
207 case KW_Con: f.get (pl->orig_stats.Con); break; 210 case KW_Con: f.get (pl->orig_stats.Con); break;
208 case KW_Int: f.get (pl->orig_stats.Int); break; 211 case KW_Int: f.get (pl->orig_stats.Int); break;
209 case KW_Pow: f.get (pl->orig_stats.Pow); break; 212 case KW_Pow: f.get (pl->orig_stats.Pow); break;
… …
263 pl->destroy (); 266 pl->destroy ();
264 267
265 return 0; 268 return 0;
266} 269}
267 270
268player * 271const char *
269player::load_pl (const char *path) 272player::killer_name () const
270{ 273{
271 object_thawer f (path); 274 static char buf [2048];
272 275
273 if (!f) 276 if (!killer)
277 return "a dungeon collapse";
278 else if (killer->contr)
279 snprintf (buf, sizeof (buf), "%s the %s", &killer->name,
280 *killer->contr->own_title ? killer->contr->own_title : killer->contr->title);
281 else if (killer->type == DEEP_SWAMP)
282 snprintf (buf, sizeof (buf), "drowning in a %s", &killer->name);
283 else if (killer->owner)
284 snprintf (buf, sizeof (buf), "%s's %s", &killer->outer_owner ()->name, &killer->name);
285 else
286 return &killer->name;
287
274 return 0; 288 return buf;
275
276 f.next ();
277
278 return load_pl (f);
279} 289}
280 290
291// expand one level of cfpod
292// end == -2, till '\n'
293// end == -1, till '>'
294// end == 0, till eos
295// end >= 1, levels of " >>>"
296static const char *
297expand_cfpod (const player *pl, dynbuf_text &buf, const char *cfpod, int end = 0)
298{
299 static dynbuf_text nest(128, 128);
300
301 for (;;)
302 switch (char ch = *cfpod++)
303 {
304 case 0:
305 return cfpod - 1;
306
307 case ' ':
308 // verbatim block?
309 if (!buf.size () && !end)
310 {
311 --cfpod;
312 goto verbatim;
313 }
314
315 if (end < 1)
316 goto passthrough;
317
318 for (int i = 0; i < end; ++i)
319 if (cfpod [i] != '>')
320 goto passthrough;
321
322 return cfpod + end;
323
324 case '>':
325 if (end != -1)
326 {
327 buf << "&gt;";
328 break;
329 }
330
331 return cfpod;
332
333 case '&':
334 buf << "&amp;";
335 break;
336
337 case '<':
338 buf << "&lt;";
339 break;
340
341 case '\r':
342 buf << '\n';
343 break;
344
345 case '\n':
346 if (end == -2)
347 return cfpod;
348
349 // \n\ => newline, tt
350 // \n\n => \n\n
351 // \n => single space
352
353 // two or more newlines will be copied verbatim, one is replaced by space
354 if (*cfpod == '\n')
355 {
356 --cfpod;
357 do
358 buf << *cfpod++;
359 while (*cfpod == '\n');
360 }
361 else if (*cfpod != ' ')
362 buf << ' ';
363
364 // verbatim block?
365 if (*cfpod == ' ')
366 goto verbatim;
367
368 break;
369
370 case 'B': case 'C': case 'E': case 'G':
371 case 'H': case 'I': case 'T': case 'U':
372 case 'Z':
373 {
374 int end = 0;
375
376 while (cfpod [end] == '<')
377 ++end;
378
379 if (!end)
380 goto passthrough;
381
382 if (end == 1 || cfpod [end] != ' ')
383 {
384 end = -1;
385 ++cfpod;
386 }
387 else
388 cfpod += end + 1;
389
390 const char *pfx, *sfx;
391
392 switch (ch)
393 {
394 case 'B': pfx = "<b>" ; sfx = "</b>" ; break;
395 case 'C': pfx = "<tt>" ; sfx = "</tt>" ; break;
396 case 'E': pfx = "&" ; sfx = ";" ; break;
397 case 'I': pfx = "<i>" ; sfx = "</i>" ; break;
398 case 'U': pfx = "<u>" ; sfx = "</u>" ; break;
399 case 'T': pfx = "<big><b>"; sfx = "</b></big>"; break;
400
401 case 'H': // hint
402 {
403 if (pl->hintmode)
404 {
405 cfpod = expand_cfpod (pl, nest, cfpod, end);
406 nest.clear ();
407
408 if (pl->hintmode == 1)
409 buf << "<fg name=\"lightblue\">[Hint suppressed, see hintmode]</fg>";
410 else
411 while (*cfpod == ' ') // eat trailing whitespace
412 ++cfpod;
413
414 goto skip;
415 }
416 else
417 {
418 pfx = "<fg name=\"lightblue\">[";
419 sfx = " (Use hintmode to suppress hints)]</fg>";
420 }
421 }
422 break;
423
424 case 'G': // gender
425 {
426 expand_cfpod (pl, nest, cfpod, end);
427 nest << '\0'; // zero-terminate
428
429 const char *str = nest.linearise ();
430 const char *sep = strchr (str, '|');
431
432 if (sep)
433 {
434 if (pl->gender || 1)
435 buf.add (sep + 1, nest.size () - (sep - str) - 2);
436 else
437 buf.add (str, sep - str);
438 }
439
440 nest.clear ();
441
442 goto skip;
443 }
444 }
445
446 buf << pfx;
447 cfpod = expand_cfpod (pl, buf, cfpod, end);
448 buf << sfx;
449 }
450
451 break;
452
453 default:
454 passthrough:
455 buf << ch;
456 skip:
457 break;
458
459 verbatim:
460 // elements cannot currently span multiple lines
461 do
462 {
463 buf << "<tt>";
464 cfpod = expand_cfpod (pl, buf, cfpod, -2);
465 buf << "</tt>\n";
466 }
467 while (*cfpod == ' ');
468
469 while (*cfpod == '\n')
470 buf << *cfpod++;
471
472 break;
473 }
474}
475
476dynbuf_text *
477player::expand_cfpod (const char *cfpod) const
478{
479 static dynbuf_text buf(1024, 1024);
480 buf.clear ();
481
482 ::expand_cfpod (this, buf, cfpod);
483
484 return &buf;
485}
486

Diff Legend

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