|
|
1 | /* |
|
|
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
|
|
9 | * under the terms of the GNU General Public License as published by the Free |
|
|
10 | * Software Foundation; either version 2 of the License, or (at your option) |
|
|
11 | * any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, but |
|
|
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
|
|
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 | * for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License along |
|
|
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
|
|
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
|
|
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
|
|
23 | */ |
|
|
24 | |
1 | // |
25 | // |
2 | // cfperl.h perl interface |
26 | // cfperl.h perl interface |
3 | // |
27 | // |
4 | #ifndef CFPERL_H__ |
28 | #ifndef CFPERL_H__ |
5 | #define CFPERL_H__ |
29 | #define CFPERL_H__ |
… | |
… | |
150 | MTH void refcnt_inc () const { ++refcnt; } |
174 | MTH void refcnt_inc () const { ++refcnt; } |
151 | MTH void refcnt_dec () const { --refcnt; } |
175 | MTH void refcnt_dec () const { --refcnt; } |
152 | |
176 | |
153 | MTH int refcnt_cnt () const; |
177 | MTH int refcnt_cnt () const; |
154 | // check wether the object has died and destroy |
178 | // check wether the object has died and destroy |
155 | MTH void refcnt_chk () { if (refcnt <= 0) do_check (); } |
179 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
156 | |
180 | |
157 | // destroy the object unless it was already destroyed |
181 | // destroy the object unless it was already destroyed |
158 | // this politely asks everybody interested the reduce |
182 | // this politely asks everybody interested the reduce |
159 | // the refcount to 0 as soon as possible. |
183 | // the refcount to 0 as soon as possible. |
160 | MTH void destroy (); |
184 | MTH void destroy (); |
… | |
… | |
238 | add (' '), add (v); |
262 | add (' '), add (v); |
239 | |
263 | |
240 | add ('\n'); |
264 | add ('\n'); |
241 | } |
265 | } |
242 | |
266 | |
243 | //TODO//temporary, used only for saving body locations |
|
|
244 | void put (const char *k, int v) |
|
|
245 | { |
|
|
246 | add (k); |
|
|
247 | force (2 + sint32_digits); |
|
|
248 | fadd (' '); |
|
|
249 | add (sint32 (v)); |
|
|
250 | fadd ('\n'); |
|
|
251 | } |
|
|
252 | |
|
|
253 | template<typename T> |
267 | template<typename T> |
254 | void put_string (keyword k, const T &v) |
268 | void put_string (keyword k, const T &v) |
255 | { |
269 | { |
256 | int klen = keyword_len [k]; |
270 | int klen = keyword_len [k]; |
257 | int vlen = v ? strlen (v) + 1 : 0; |
271 | int vlen = v ? strlen (v) + 1 : 0; |
… | |
… | |
302 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
316 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
303 | fadd (keyword_str [k], keyword_len [k]); |
317 | fadd (keyword_str [k], keyword_len [k]); |
304 | fadd (' '); |
318 | fadd (' '); |
305 | add (v); |
319 | add (v); |
306 | fadd ('\n'); |
320 | fadd ('\n'); |
307 | } |
|
|
308 | |
|
|
309 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
310 | { |
|
|
311 | force (MAX_KEYWORD_LEN + 1); |
|
|
312 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
313 | |
|
|
314 | if (expect_true (v)) |
|
|
315 | { |
|
|
316 | add (v); |
|
|
317 | add ('\n'); |
|
|
318 | } |
|
|
319 | |
|
|
320 | force (MAX_KEYWORD_LEN + 1); |
|
|
321 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
322 | } |
321 | } |
323 | |
322 | |
324 | void put (keyword k, float v) { put (k, (double)v); } |
323 | void put (keyword k, float v) { put (k, (double)v); } |
325 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
324 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
326 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
325 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
… | |
… | |
331 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
330 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
332 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
331 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
333 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
332 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
334 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
333 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
335 | |
334 | |
|
|
335 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
336 | { |
|
|
337 | force (MAX_KEYWORD_LEN + 1); |
|
|
338 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
339 | |
|
|
340 | if (expect_true (v)) |
|
|
341 | { |
|
|
342 | add (v); |
|
|
343 | add ('\n'); |
|
|
344 | } |
|
|
345 | |
|
|
346 | force (MAX_KEYWORD_LEN + 1); |
|
|
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
348 | } |
|
|
349 | |
336 | template<typename T> |
350 | template<typename T> |
337 | void put (keyword k, const T *v) |
351 | void put (keyword k, const T *v) |
338 | { |
352 | { |
339 | if (expect_true (v)) |
353 | if (v) |
340 | put (k, v->name); |
354 | put (k, v->name); |
341 | else |
355 | else |
342 | put (k, (const char *)0); |
356 | put (k, (const char *)0); |
343 | } |
357 | } |
344 | |
358 | |
… | |
… | |
375 | void get (attachable *obj, int oid); |
389 | void get (attachable *obj, int oid); |
376 | |
390 | |
377 | // parse next line |
391 | // parse next line |
378 | void next (); |
392 | void next (); |
379 | // skip the current key-value (usually fetch next line, for |
393 | // skip the current key-value (usually fetch next line, for |
380 | // multiline-fields, skips untilt he corresponding end-kw |
394 | // multiline-fields, skips till the corresponding end-kw |
381 | void skip (); |
395 | void skip (); |
382 | |
|
|
383 | //TODO: remove, deprecated |
|
|
384 | keyword get_kv () |
|
|
385 | { |
|
|
386 | next (); |
|
|
387 | return kw; |
|
|
388 | } |
|
|
389 | |
396 | |
390 | char *get_str () { return value; } // may be 0 |
397 | char *get_str () { return value; } // may be 0 |
391 | void get_ml (keyword kend, shstr &sh); |
398 | void get_ml (keyword kend, shstr &sh); |
392 | |
399 | |
393 | void get_ornull (shstr &sh) const { sh = value; } |
400 | void get_ornull (shstr &sh) const { sh = value; } |
394 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
401 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
395 | |
402 | |
396 | bool get_bool () const { return *value_nn == '1'; } |
403 | bool get_bool () const { return *value_nn == '1'; } |
397 | sint32 get_sint32 () const; |
404 | sint32 get_sint32 () const; |
398 | sint64 get_sint64 () const { return atoll (value_nn); } |
405 | sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); } |
399 | double get_double () const { return atof (value_nn); } |
406 | double get_double () const { return strtod (value_nn, 0); } |
400 | |
407 | |
401 | void get (float &v) { v = get_double (); } |
408 | void get (float &v) { v = get_double (); } |
402 | void get (double &v) { v = get_double (); } |
409 | void get (double &v) { v = get_double (); } |
403 | |
410 | |
404 | void get (bool &i) { i = get_bool (); } |
411 | void get (bool &i) { i = get_bool (); } |