|
|
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 (); |
… | |
… | |
239 | |
263 | |
240 | add ('\n'); |
264 | add ('\n'); |
241 | } |
265 | } |
242 | |
266 | |
243 | template<typename T> |
267 | template<typename T> |
244 | void put_string (keyword k, const T &v) |
268 | void put_kw_string (keyword k, const T &v) |
245 | { |
269 | { |
246 | int klen = keyword_len [k]; |
270 | int klen = keyword_len [k]; |
247 | int vlen = v ? strlen (v) + 1 : 0; |
271 | int vlen = v ? strlen (v) + 1 : 0; |
248 | |
272 | |
249 | char *p = (char *)alloc (klen + vlen + 1); |
273 | char *p = (char *)alloc (klen + vlen + 1); |
… | |
… | |
259 | *p = '\n'; |
283 | *p = '\n'; |
260 | } |
284 | } |
261 | |
285 | |
262 | void put (keyword k, const char *v = 0) |
286 | void put (keyword k, const char *v = 0) |
263 | { |
287 | { |
264 | put_string (k, v); |
288 | put_kw_string (k, v); |
265 | } |
289 | } |
266 | |
290 | |
267 | void put (keyword k, const shstr &v) |
291 | void put (keyword k, const shstr &v) |
268 | { |
292 | { |
269 | put_string (k, v); |
293 | put_kw_string (k, v); |
270 | } |
294 | } |
271 | |
295 | |
272 | void put (keyword k, double v) |
296 | void put (keyword k, double v) |
273 | { |
297 | { |
274 | force (MAX_KEYWORD_LEN + 2 + 32); |
298 | force (MAX_KEYWORD_LEN + 2 + 32); |
… | |
… | |
292 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
316 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
293 | fadd (keyword_str [k], keyword_len [k]); |
317 | fadd (keyword_str [k], keyword_len [k]); |
294 | fadd (' '); |
318 | fadd (' '); |
295 | add (v); |
319 | add (v); |
296 | fadd ('\n'); |
320 | fadd ('\n'); |
297 | } |
|
|
298 | |
|
|
299 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
300 | { |
|
|
301 | force (MAX_KEYWORD_LEN + 1); |
|
|
302 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
303 | |
|
|
304 | if (expect_true (v)) |
|
|
305 | { |
|
|
306 | add (v); |
|
|
307 | add ('\n'); |
|
|
308 | } |
|
|
309 | |
|
|
310 | force (MAX_KEYWORD_LEN + 1); |
|
|
311 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
312 | } |
321 | } |
313 | |
322 | |
314 | void put (keyword k, float v) { put (k, (double)v); } |
323 | void put (keyword k, float v) { put (k, (double)v); } |
315 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
324 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
316 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
325 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
… | |
… | |
321 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
330 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
322 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
331 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
323 | 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); } |
324 | 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); } |
325 | |
334 | |
326 | template<typename T> |
335 | void put (keyword kbeg, keyword kend, const shstr &v) |
327 | void put (keyword k, const T *v) |
|
|
328 | { |
336 | { |
|
|
337 | force (MAX_KEYWORD_LEN + 1); |
|
|
338 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
339 | |
329 | if (expect_true (v)) |
340 | if (expect_true (v)) |
330 | put (k, v->name); |
341 | { |
331 | else |
342 | add (v); |
332 | put (k, (const char *)0); |
343 | add ('\n'); |
|
|
344 | } |
|
|
345 | |
|
|
346 | force (MAX_KEYWORD_LEN + 1); |
|
|
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
333 | } |
348 | } |
|
|
349 | |
|
|
350 | void put (keyword k, archetype *v); |
|
|
351 | void put (keyword k, treasurelist *v); |
|
|
352 | void put (keyword k, faceinfo *v); |
334 | |
353 | |
335 | template<typename T> |
354 | template<typename T> |
336 | void put (keyword k, const refptr<T> &v) |
355 | void put (keyword k, const refptr<T> &v) |
337 | { |
356 | { |
338 | put (k, (T *)v); |
357 | put (k, (T *)v); |
… | |
… | |
365 | void get (attachable *obj, int oid); |
384 | void get (attachable *obj, int oid); |
366 | |
385 | |
367 | // parse next line |
386 | // parse next line |
368 | void next (); |
387 | void next (); |
369 | // skip the current key-value (usually fetch next line, for |
388 | // skip the current key-value (usually fetch next line, for |
370 | // multiline-fields, skips untilt he corresponding end-kw |
389 | // multiline-fields, skips till the corresponding end-kw |
371 | void skip (); |
390 | void skip (); |
372 | |
|
|
373 | //TODO: remove, deprecated |
|
|
374 | keyword get_kv () |
|
|
375 | { |
|
|
376 | next (); |
|
|
377 | return kw; |
|
|
378 | } |
|
|
379 | |
391 | |
380 | char *get_str () { return value; } // may be 0 |
392 | char *get_str () { return value; } // may be 0 |
381 | void get_ml (keyword kend, shstr &sh); |
393 | void get_ml (keyword kend, shstr &sh); |
382 | |
394 | |
383 | void get_ornull (shstr &sh) const { sh = value; } |
395 | void get_ornull (shstr &sh) const { sh = value; } |
… | |
… | |
427 | { |
439 | { |
428 | if (expect_false (++cede_counter >= count)) |
440 | if (expect_false (++cede_counter >= count)) |
429 | do_cede_every (); |
441 | do_cede_every (); |
430 | } |
442 | } |
431 | |
443 | |
432 | static void cede_to_tick () |
444 | static bool cede_to_tick () |
433 | { |
445 | { |
434 | if (expect_false (time () >= next_cede)) |
446 | if (expect_true (time () < next_cede)) |
|
|
447 | return false; |
|
|
448 | |
435 | do_cede_to_tick (); |
449 | do_cede_to_tick (); |
|
|
450 | return true; |
436 | } |
451 | } |
437 | |
452 | |
438 | static void cede_to_tick_every (int count) |
453 | static bool cede_to_tick_every (int count) |
439 | { |
454 | { |
440 | if (expect_false (++cede_counter >= count)) |
455 | if (expect_true (++cede_counter < count)) |
|
|
456 | return false; |
|
|
457 | |
441 | cede_to_tick (); |
458 | return cede_to_tick (); |
442 | } |
459 | } |
443 | |
460 | |
444 | static void wait_for_tick (); |
461 | static void wait_for_tick (); |
445 | static void wait_for_tick_begin (); |
462 | static void wait_for_tick_begin (); |
446 | }; |
463 | }; |