1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
|
|
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * and the GNU General Public License along with this program. If not, see |
|
|
21 | * <http://www.gnu.org/licenses/>. |
20 | * |
22 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
24 | */ |
23 | |
25 | |
24 | #include <global.h> |
26 | #include <global.h> |
|
|
27 | |
|
|
28 | //+GPL |
25 | |
29 | |
26 | /* Determine if the attacktype represented by the |
30 | /* Determine if the attacktype represented by the |
27 | * specified attack-number is enabled for dragon players. |
31 | * specified attack-number is enabled for dragon players. |
28 | * A dragon player (quetzal) can gain resistances for |
32 | * A dragon player (quetzal) can gain resistances for |
29 | * all enabled attacktypes. |
33 | * all enabled attacktypes. |
… | |
… | |
37 | |
41 | |
38 | return 0; |
42 | return 0; |
39 | } |
43 | } |
40 | |
44 | |
41 | /* |
45 | /* |
42 | * returns true if the adressed object 'ob' is a player |
|
|
43 | * of the dragon race. |
|
|
44 | */ |
|
|
45 | int |
|
|
46 | is_dragon_pl (const object *op) |
|
|
47 | { |
|
|
48 | if (op |
|
|
49 | && op->type == PLAYER |
|
|
50 | && op->arch |
|
|
51 | && op->arch->race |
|
|
52 | && !strcmp (op->arch->race, "dragon")) |
|
|
53 | return 1; |
|
|
54 | |
|
|
55 | return 0; |
|
|
56 | } |
|
|
57 | |
|
|
58 | /* |
|
|
59 | * If final is set, it a clean/final save, not a backup, ie dont remove objects from inventory |
46 | * If final is set, it a clean/final save, not a backup, ie dont remove objects from inventory |
60 | */ |
47 | */ |
61 | bool |
48 | bool |
62 | player::save_pl (object_freezer &freezer) |
49 | player::save_pl (object_freezer &freezer) |
63 | { |
50 | { |
64 | INVOKE_PLAYER (SAVE, ob->contr); |
51 | INVOKE_PLAYER (SAVE, ob->contr); |
65 | |
52 | |
66 | int wiz = ob->flag [FLAG_WIZ]; |
53 | int wiz = ob->flag [FLAG_WIZ]; |
67 | |
54 | |
68 | /* Eneq(@csd.uu.se): If we have an open container hide it. */ |
55 | /* Eneq(@csd.uu.se): If we have an open container hide it. */ |
69 | object *container = ob->container; |
56 | object *container = ob->container_ (); |
70 | ob->container = 0; |
57 | ob->container = 0; |
71 | |
58 | |
72 | if (ob->map) |
59 | if (ob->map) |
73 | maplevel = ob->map->path; |
60 | maplevel = ob->map->path; |
74 | |
61 | |
75 | #define PL_OUT(k) freezer.put (KW_ ## k, k) |
62 | #define PL_OUT(k) freezer.put (KW(k), k) |
76 | #define PL_OUT2(k,v) freezer.put (KW_ ## k, v) |
63 | #define PL_OUT2(k,v) freezer.put (KW(k), v) |
77 | |
64 | |
78 | PL_OUT (password); |
65 | PL_OUT (password); |
79 | PL_OUT2 (title, own_title); |
66 | PL_OUT2 (title, own_title); |
80 | PL_OUT (gender); |
67 | PL_OUT (gender); |
81 | PL_OUT (hintmode); |
68 | PL_OUT (hintmode); |
… | |
… | |
88 | PL_OUT (digestion); |
75 | PL_OUT (digestion); |
89 | PL_OUT2 (pickup, mode); |
76 | PL_OUT2 (pickup, mode); |
90 | PL_OUT (outputs_sync); |
77 | PL_OUT (outputs_sync); |
91 | PL_OUT (outputs_count); |
78 | PL_OUT (outputs_count); |
92 | |
79 | |
93 | freezer.put (KW_usekeys, usekeys == key_inventory ? "key_inventory" : (usekeys == keyrings ? "keyrings" : "containers")); |
80 | freezer.put (KW(usekeys), usekeys == key_inventory ? CS(key_inventory) : (usekeys == keyrings ? CS(keyrings) : CS(containers))); |
94 | freezer.put (KW_unapply, unapply == unapply_nochoice ? "unapply_nochoice" : (unapply == unapply_never ? "unapply_never" : "unapply_always")); |
81 | freezer.put (KW(unapply), unapply == unapply_nochoice ? CS(unapply_nochoice) : (unapply == unapply_never ? CS(unapply_never) : CS(unapply_always))); |
95 | |
82 | |
96 | PL_OUT2 (map, maplevel); |
83 | PL_OUT2 (map, maplevel); |
97 | PL_OUT (savebed_map); |
84 | PL_OUT (savebed_map); |
98 | PL_OUT (bed_x); |
85 | PL_OUT (bed_x); |
99 | PL_OUT (bed_y); |
86 | PL_OUT (bed_y); |
100 | PL_OUT (weapon_sp); |
87 | PL_OUT (weapon_sp); |
101 | PL_OUT (weapon_sp_left); |
88 | PL_OUT (weapon_sp_left); |
102 | PL_OUT2 (Str, orig_stats.Str); |
89 | PL_OUT2 (str, orig_stats.Str); |
103 | PL_OUT2 (Dex, orig_stats.Dex); |
90 | PL_OUT2 (dex, orig_stats.Dex); |
104 | PL_OUT2 (Con, orig_stats.Con); |
91 | PL_OUT2 (con, orig_stats.Con); |
105 | PL_OUT2 (Int, orig_stats.Int); |
92 | PL_OUT2 (int, orig_stats.Int); |
106 | PL_OUT2 (Pow, orig_stats.Pow); |
93 | PL_OUT2 (pow, orig_stats.Pow); |
107 | PL_OUT2 (Wis, orig_stats.Wis); |
94 | PL_OUT2 (wis, orig_stats.Wis); |
108 | PL_OUT2 (Cha, orig_stats.Cha); |
95 | PL_OUT2 (cha, orig_stats.Cha); |
109 | |
96 | |
110 | PL_OUT2 (lev_array, 10); |
97 | PL_OUT2 (lev_array, 10); |
111 | |
98 | |
112 | for (int i = 1; i <= 10; i++) |
99 | for (int i = 1; i <= 10; i++) |
113 | { |
100 | { |
… | |
… | |
115 | freezer.add (levsp [i]); freezer.add ('\n'); |
102 | freezer.add (levsp [i]); freezer.add ('\n'); |
116 | freezer.add (levgrace[i]); freezer.add ('\n'); |
103 | freezer.add (levgrace[i]); freezer.add ('\n'); |
117 | } |
104 | } |
118 | |
105 | |
119 | freezer.put (ob->contr); |
106 | freezer.put (ob->contr); |
120 | freezer.put (KW_endplst); |
107 | freezer.put (KW(endplst)); |
121 | |
108 | |
122 | SET_FLAG (ob, FLAG_NO_FIX_PLAYER); |
109 | ob->clr_flag (FLAG_WIZ); |
123 | CLEAR_FLAG (ob, FLAG_WIZ); |
|
|
124 | ob->write (freezer); |
110 | ob->write (freezer); |
125 | |
|
|
126 | CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER); |
|
|
127 | |
111 | |
128 | /* Eneq(@csd.uu.se): Reveal the container if we have one. */ |
112 | /* Eneq(@csd.uu.se): Reveal the container if we have one. */ |
129 | ob->container = container; |
113 | ob->container = container; |
130 | |
114 | |
131 | ob->flag [FLAG_WIZ] = wiz; |
115 | ob->flag [FLAG_WIZ] = wiz; |
132 | |
116 | |
133 | INVOKE_PLAYER (SAVE_DONE, ob->contr); |
117 | INVOKE_PLAYER (SAVE_DONE, ob->contr); |
134 | |
118 | |
135 | return true; |
119 | return true; |
136 | } |
120 | } |
|
|
121 | |
|
|
122 | //-GPL |
137 | |
123 | |
138 | bool |
124 | bool |
139 | player::save_pl (const char *path) |
125 | player::save_pl (const char *path) |
140 | { |
126 | { |
141 | object_freezer freezer; |
127 | object_freezer freezer; |
… | |
… | |
187 | return pl; |
173 | return pl; |
188 | |
174 | |
189 | case KW_oid: f.get (pl, f.get_sint32 ()); break; |
175 | case KW_oid: f.get (pl, f.get_sint32 ()); break; |
190 | case KW_password: assign (pl->password , f.get_str ()); break; |
176 | case KW_password: assign (pl->password , f.get_str ()); break; |
191 | case KW_title: assign (pl->own_title, f.get_str ()); break; |
177 | case KW_title: assign (pl->own_title, f.get_str ()); break; |
192 | case KW_bowtype: pl->bowtype = (bowtype_t) f.get_sint32 (); break; |
178 | case KW_bowtype: pl->bowtype = (bowtype_t) f.get_sint32 (); break; |
193 | case KW_petmode: pl->petmode = (petmode_t) f.get_sint32 (); break; |
179 | case KW_petmode: pl->petmode = (petmode_t) f.get_sint32 (); break; |
194 | case KW_gender: f.get (pl->gender); break; |
180 | case KW_gender: f.get (pl->gender); break; |
195 | case KW_hintmode: f.get (pl->hintmode); break; |
181 | case KW_hintmode: f.get (pl->hintmode); break; |
196 | case KW_listening: /*TODO*/; break; |
182 | case KW_listening: /*TODO*/; break; |
197 | case KW_peaceful: f.get (pl->peaceful); break; |
183 | case KW_peaceful: f.get (pl->peaceful); break; |
198 | case KW_digestion: f.get (pl->digestion); break; |
184 | case KW_digestion: f.get (pl->digestion); break; |
… | |
… | |
203 | case KW_savebed_map: f.get (pl->savebed_map); break; |
189 | case KW_savebed_map: f.get (pl->savebed_map); break; |
204 | case KW_bed_x: f.get (pl->bed_x); break; |
190 | case KW_bed_x: f.get (pl->bed_x); break; |
205 | case KW_bed_y: f.get (pl->bed_y); break; |
191 | case KW_bed_y: f.get (pl->bed_y); break; |
206 | case KW_weapon_sp: f.get (pl->weapon_sp); break; |
192 | case KW_weapon_sp: f.get (pl->weapon_sp); break; |
207 | case KW_weapon_sp_left:f.get (pl->weapon_sp_left); break; |
193 | case KW_weapon_sp_left:f.get (pl->weapon_sp_left); break; |
|
|
194 | |
|
|
195 | case KW_Str: // uppercase alias |
208 | case KW_Str: f.get (pl->orig_stats.Str); break; |
196 | case KW_str: f.get (pl->orig_stats.Str); break; |
|
|
197 | case KW_Dex: // uppercase alias |
209 | case KW_Dex: f.get (pl->orig_stats.Dex); break; |
198 | case KW_dex: f.get (pl->orig_stats.Dex); break; |
|
|
199 | case KW_Con: // uppercase alias |
210 | case KW_Con: f.get (pl->orig_stats.Con); break; |
200 | case KW_con: f.get (pl->orig_stats.Con); break; |
|
|
201 | case KW_Int: // uppercase alias |
211 | case KW_Int: f.get (pl->orig_stats.Int); break; |
202 | case KW_int: f.get (pl->orig_stats.Int); break; |
|
|
203 | case KW_Pow: // uppercase alias |
212 | case KW_Pow: f.get (pl->orig_stats.Pow); break; |
204 | case KW_pow: f.get (pl->orig_stats.Pow); break; |
|
|
205 | case KW_Wis: // uppercase alias |
213 | case KW_Wis: f.get (pl->orig_stats.Wis); break; |
206 | case KW_wis: f.get (pl->orig_stats.Wis); break; |
|
|
207 | case KW_Cha: // uppercase alias |
214 | case KW_Cha: f.get (pl->orig_stats.Cha); break; |
208 | case KW_cha: f.get (pl->orig_stats.Cha); break; |
|
|
209 | |
215 | case KW_gen_hp: f.get (pl->gen_hp); break; |
210 | case KW_gen_hp: f.get (pl->gen_hp); break; |
216 | case KW_gen_sp: f.get (pl->gen_sp); break; |
211 | case KW_gen_sp: f.get (pl->gen_sp); break; |
217 | case KW_gen_grace: f.get (pl->gen_grace); break; |
212 | case KW_gen_grace: f.get (pl->gen_grace); break; |
218 | |
213 | |
219 | case KW_usekeys: |
214 | case KW_usekeys: |
… | |
… | |
242 | { |
237 | { |
243 | int count = f.get_sint32 (); |
238 | int count = f.get_sint32 (); |
244 | |
239 | |
245 | for (int i = 1; i <= count; i++) |
240 | for (int i = 1; i <= count; i++) |
246 | { |
241 | { |
247 | char line [32]; |
242 | f.next_line (); f.get (pl->levhp [i]); |
248 | |
243 | f.next_line (); f.get (pl->levsp [i]); |
249 | fgets (line, 32, f); pl->levhp [i] = atoi (line); |
244 | f.next_line (); f.get (pl->levgrace[i]); |
250 | fgets (line, 32, f); pl->levsp [i] = atoi (line); |
|
|
251 | fgets (line, 32, f); pl->levgrace[i] = atoi (line); |
|
|
252 | } |
245 | } |
253 | } |
246 | } |
254 | break; |
247 | break; |
255 | } |
248 | } |
256 | |
249 | |
… | |
… | |
259 | |
252 | |
260 | failure: |
253 | failure: |
261 | LOG (llevError, "%s: too many or too grave errors, aborting player load.\n", f.name); |
254 | LOG (llevError, "%s: too many or too grave errors, aborting player load.\n", f.name); |
262 | |
255 | |
263 | if (pl->ob) |
256 | if (pl->ob) |
264 | pl->ob->destroy (true); |
257 | pl->ob->destroy (); |
265 | |
258 | |
266 | pl->destroy (); |
259 | pl->destroy (); |
267 | |
260 | |
268 | return 0; |
261 | return 0; |
269 | } |
262 | } |
270 | |
263 | |
271 | const char * |
264 | const_utf8_string |
272 | player::killer_name () const |
265 | player::killer_name () const |
273 | { |
266 | { |
274 | static char buf [2048]; |
267 | static char buf [2048]; |
275 | |
268 | |
276 | if (!killer) |
269 | if (!killer) |
… | |
… | |
291 | // expand one level of cfpod |
284 | // expand one level of cfpod |
292 | // end == -2, till '\n' |
285 | // end == -2, till '\n' |
293 | // end == -1, till '>' |
286 | // end == -1, till '>' |
294 | // end == 0, till eos |
287 | // end == 0, till eos |
295 | // end >= 1, levels of " >>>" |
288 | // end >= 1, levels of " >>>" |
|
|
289 | // pod sequences not handled: F, S, X |
296 | static const char * |
290 | static const char * |
297 | expand_cfpod (const player *pl, dynbuf_text &buf, const char *cfpod, int end = 0) |
291 | expand_cfpod (int hintmode, int gender, dynbuf_text &buf, const char *cfpod, int end = 0) |
298 | { |
292 | { |
299 | static dynbuf_text nest(128, 128); |
293 | static dynbuf_text nest(128, 128); |
300 | |
294 | |
301 | for (;;) |
295 | for (;;) |
302 | switch (char ch = *cfpod++) |
296 | switch (char ch = *cfpod++) |
… | |
… | |
338 | buf << "<"; |
332 | buf << "<"; |
339 | break; |
333 | break; |
340 | |
334 | |
341 | case '\r': |
335 | case '\r': |
342 | buf << '\n'; |
336 | buf << '\n'; |
|
|
337 | /* \r\n+ becomes one or more newlines */ |
|
|
338 | while (*cfpod == '\n') |
|
|
339 | buf << *cfpod++; |
343 | break; |
340 | break; |
344 | |
341 | |
345 | case '\n': |
342 | case '\n': |
346 | if (end == -2) |
343 | if (end == -2) |
347 | return cfpod; |
344 | return cfpod; |
… | |
… | |
356 | --cfpod; |
353 | --cfpod; |
357 | do |
354 | do |
358 | buf << *cfpod++; |
355 | buf << *cfpod++; |
359 | while (*cfpod == '\n'); |
356 | while (*cfpod == '\n'); |
360 | } |
357 | } |
361 | else if (*cfpod != ' ') |
358 | else if (*cfpod == ' ') |
|
|
359 | buf << '\n'; |
|
|
360 | else |
362 | buf << ' '; |
361 | buf << ' '; |
363 | |
362 | |
364 | // verbatim block? |
363 | // verbatim block? |
365 | if (*cfpod == ' ') |
364 | if (*cfpod == ' ') |
366 | goto verbatim; |
365 | goto verbatim; |
367 | |
366 | |
368 | break; |
367 | break; |
369 | |
368 | |
370 | case 'B': case 'C': case 'E': case 'G': |
369 | case 'B': case 'C': case 'E': case 'G': case 'H': |
371 | case 'H': case 'I': case 'T': case 'U': |
370 | case 'I': case 'L': case 'T': case 'U': case 'Z': |
372 | case 'Z': |
|
|
373 | { |
371 | { |
374 | int end = 0; |
372 | int end = 0; |
375 | |
373 | |
376 | while (cfpod [end] == '<') |
374 | while (cfpod [end] == '<') |
377 | ++end; |
375 | ++end; |
… | |
… | |
395 | case 'C': pfx = "<tt>" ; sfx = "</tt>" ; break; |
393 | case 'C': pfx = "<tt>" ; sfx = "</tt>" ; break; |
396 | case 'E': pfx = "&" ; sfx = ";" ; break; |
394 | case 'E': pfx = "&" ; sfx = ";" ; break; |
397 | case 'I': pfx = "<i>" ; sfx = "</i>" ; break; |
395 | case 'I': pfx = "<i>" ; sfx = "</i>" ; break; |
398 | case 'U': pfx = "<u>" ; sfx = "</u>" ; break; |
396 | case 'U': pfx = "<u>" ; sfx = "</u>" ; break; |
399 | case 'T': pfx = "<big><b>"; sfx = "</b></big>"; break; |
397 | case 'T': pfx = "<big><b>"; sfx = "</b></big>"; break; |
|
|
398 | case 'Z': pfx = "" ; sfx = "" ; break; |
|
|
399 | |
|
|
400 | case 'L': // link, not really supported - always use first (or only) component |
|
|
401 | { |
|
|
402 | cfpod = expand_cfpod (hintmode, gender, nest, cfpod, end); |
|
|
403 | nest << '\0'; // zero-terminate |
|
|
404 | |
|
|
405 | const char *str = nest.linearise (); |
|
|
406 | const char *sep = strchr (str, '|'); |
|
|
407 | |
|
|
408 | buf.add (str, sep ? sep - str : nest.size ()); |
|
|
409 | |
|
|
410 | nest.clear (); |
|
|
411 | |
|
|
412 | goto skip; |
|
|
413 | } |
400 | |
414 | |
401 | case 'H': // hint |
415 | case 'H': // hint |
402 | { |
416 | { |
403 | if (pl->hintmode) |
417 | if (hintmode) |
404 | { |
418 | { |
405 | cfpod = expand_cfpod (pl, nest, cfpod, end); |
419 | cfpod = expand_cfpod (hintmode, gender, nest, cfpod, end); |
406 | nest.clear (); |
420 | nest.clear (); |
407 | |
421 | |
408 | if (pl->hintmode == 1) |
422 | if (hintmode == 1) |
409 | buf << "<fg name=\"lightblue\">[Hint suppressed, see hintmode]</fg>"; |
423 | buf << "<fg name=\"lightblue\">[Hint available]</fg>"; |
410 | else |
424 | else |
411 | while (*cfpod == ' ') // eat trailing whitespace |
425 | while (*cfpod <= ' '&& *cfpod) // eat trailing whitespace |
412 | ++cfpod; |
426 | ++cfpod; |
413 | |
427 | |
414 | goto skip; |
428 | goto skip; |
415 | } |
429 | } |
416 | else |
430 | else |
417 | { |
431 | { |
418 | pfx = "<fg name=\"lightblue\">["; |
432 | pfx = "<fg name=\"lightblue\">[Hint: "; |
419 | sfx = " (Use hintmode to suppress hints)]</fg>"; |
433 | sfx = "]</fg>"; |
420 | } |
434 | } |
421 | } |
435 | } |
422 | break; |
436 | break; |
423 | |
437 | |
424 | case 'G': // gender |
438 | case 'G': // gender |
425 | { |
439 | { |
426 | cfpod = expand_cfpod (pl, nest, cfpod, end); |
440 | cfpod = expand_cfpod (hintmode, gender, nest, cfpod, end); |
427 | nest << '\0'; // zero-terminate |
441 | nest << '\0'; // zero-terminate |
428 | |
442 | |
429 | const char *str = nest.linearise (); |
443 | const char *str = nest.linearise (); |
430 | const char *sep = strchr (str, '|'); |
444 | const char *sep = strchr (str, '|'); |
431 | |
445 | |
432 | if (sep) |
446 | if (sep) |
433 | { |
447 | { |
434 | if (pl->gender) |
448 | if (gender) |
435 | buf.add (sep + 1, nest.size () - (sep - str) - 2); |
449 | buf.add (sep + 1, nest.size () - (sep - str) - 2); |
436 | else |
450 | else |
437 | buf.add (str, sep - str); |
451 | buf.add (str, sep - str); |
438 | } |
452 | } |
439 | |
453 | |
440 | nest.clear (); |
454 | nest.clear (); |
441 | |
455 | |
442 | goto skip; |
456 | goto skip; |
443 | } |
457 | } |
|
|
458 | |
|
|
459 | default: |
|
|
460 | pfx = "UNKNOWN_DIRECTIVE{"; |
|
|
461 | sfx = "}"; |
|
|
462 | break; |
444 | } |
463 | } |
445 | |
464 | |
446 | buf << pfx; |
465 | buf << pfx; |
447 | cfpod = expand_cfpod (pl, buf, cfpod, end); |
466 | cfpod = expand_cfpod (hintmode, gender, buf, cfpod, end); |
448 | buf << sfx; |
467 | buf << sfx; |
449 | } |
468 | } |
450 | |
469 | |
451 | break; |
470 | break; |
452 | |
471 | |
… | |
… | |
459 | verbatim: |
478 | verbatim: |
460 | // elements cannot currently span multiple lines |
479 | // elements cannot currently span multiple lines |
461 | do |
480 | do |
462 | { |
481 | { |
463 | buf << "<tt>"; |
482 | buf << "<tt>"; |
464 | cfpod = expand_cfpod (pl, buf, cfpod, -2); |
483 | cfpod = expand_cfpod (hintmode, gender, buf, cfpod, -2); |
465 | buf << "</tt>\n"; |
484 | buf << "</tt>\n"; |
|
|
485 | |
|
|
486 | while (*cfpod == '\n') |
|
|
487 | buf << *cfpod++; |
466 | } |
488 | } |
467 | while (*cfpod == ' '); |
489 | while (*cfpod == ' '); |
468 | |
490 | |
469 | while (*cfpod == '\n') |
|
|
470 | buf << *cfpod++; |
|
|
471 | |
|
|
472 | break; |
491 | break; |
473 | } |
492 | } |
474 | } |
493 | } |
475 | |
494 | |
476 | dynbuf_text * |
495 | dynbuf_text * |
477 | player::expand_cfpod (const char *cfpod) const |
496 | player::expand_cfpod (int hintmode, int gender, const_utf8_string cfpod) |
478 | { |
497 | { |
479 | static dynbuf_text buf(1024, 1024); |
498 | static dynbuf_text buf(65536, 1024); |
480 | buf.clear (); |
499 | buf.clear (); |
481 | |
500 | |
482 | ::expand_cfpod (this, buf, cfpod); |
501 | ::expand_cfpod (hintmode, gender, buf, cfpod); |
483 | |
502 | |
484 | return &buf; |
503 | return &buf; |
485 | } |
504 | } |
486 | |
505 | |
|
|
506 | dynbuf_text * |
|
|
507 | player::expand_cfpod (const_utf8_string cfpod) const |
|
|
508 | { |
|
|
509 | return expand_cfpod (hintmode, gender, cfpod); |
|
|
510 | } |
|
|
511 | |