|
|
1 | /* |
|
|
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
|
|
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 |
|
|
9 | * it under the terms of the GNU General Public License as published by |
|
|
10 | * the Free Software Foundation, either version 3 of the License, or |
|
|
11 | * (at your option) any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, |
|
|
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
16 | * GNU General Public License for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License |
|
|
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
|
|
20 | * |
|
|
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
|
|
22 | */ |
|
|
23 | |
1 | // |
24 | // |
2 | // cfperl.h perl interface |
25 | // cfperl.h perl interface |
3 | // |
26 | // |
4 | #ifndef CFPERL_H__ |
27 | #ifndef CFPERL_H__ |
5 | #define CFPERL_H__ |
28 | #define CFPERL_H__ |
… | |
… | |
65 | void cfperl_init (); |
88 | void cfperl_init (); |
66 | void cfperl_main (); |
89 | void cfperl_main (); |
67 | void cfperl_emergency_save (); |
90 | void cfperl_emergency_save (); |
68 | void cfperl_cleanup (int make_core); |
91 | void cfperl_cleanup (int make_core); |
69 | void cfperl_make_book (object *book, int level); |
92 | void cfperl_make_book (object *book, int level); |
|
|
93 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
70 | |
94 | |
71 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
95 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
72 | |
96 | |
73 | // virtual server time, excluding time jumps and lag |
97 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
74 | extern double runtime; |
98 | extern tstamp NOW; // real time of current server tick |
75 | |
99 | |
76 | enum event_klass |
100 | enum event_klass |
77 | { |
101 | { |
78 | KLASS_NONE, |
102 | KLASS_NONE, |
79 | KLASS_GLOBAL, |
103 | KLASS_GLOBAL, |
… | |
… | |
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 | add (' '); |
|
|
248 | add (sint32 (v)); |
|
|
249 | add ('\n'); |
|
|
250 | } |
|
|
251 | |
|
|
252 | template<typename T> |
267 | template<typename T> |
253 | void put_string (keyword k, const T &v) |
268 | void put_kw_string (keyword k, const T &v) |
254 | { |
269 | { |
255 | int klen = keyword_len [k]; |
270 | int klen = keyword_len [k]; |
256 | int vlen = v ? strlen (v) + 1 : 0; |
271 | int vlen = v ? strlen (v) + 1 : 0; |
257 | |
272 | |
258 | char *p = (char *)alloc (klen + vlen + 1); |
273 | char *p = (char *)alloc (klen + vlen + 1); |
… | |
… | |
268 | *p = '\n'; |
283 | *p = '\n'; |
269 | } |
284 | } |
270 | |
285 | |
271 | void put (keyword k, const char *v = 0) |
286 | void put (keyword k, const char *v = 0) |
272 | { |
287 | { |
273 | put_string (k, v); |
288 | put_kw_string (k, v); |
274 | } |
289 | } |
275 | |
290 | |
276 | void put (keyword k, const shstr &v) |
291 | void put (keyword k, const shstr &v) |
277 | { |
292 | { |
278 | put_string (k, v); |
293 | put_kw_string (k, v); |
279 | } |
294 | } |
280 | |
295 | |
281 | void put (keyword k, double v) |
296 | void put (keyword k, double v) |
282 | { |
297 | { |
283 | char buf [128]; |
298 | force (MAX_KEYWORD_LEN + 2 + 32); |
284 | |
299 | fadd (keyword_str [k], keyword_len [k]); |
285 | snprintf (buf, 128, "%.7g", v); |
300 | fadd (' '); |
286 | |
301 | falloc (sprintf (ptr, "%.7g", v)); |
287 | put (k, (const char *)buf); |
302 | fadd ('\n'); |
288 | } |
303 | } |
289 | |
304 | |
290 | void put_(keyword k, sint64 v) |
305 | void put_(keyword k, sint64 v) |
291 | { |
306 | { |
|
|
307 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
292 | add (keyword_str [k], keyword_len [k]); |
308 | fadd (keyword_str [k], keyword_len [k]); |
293 | add (' '); |
309 | fadd (' '); |
294 | add (v); |
310 | add (v); |
295 | add ('\n'); |
311 | fadd ('\n'); |
296 | } |
312 | } |
297 | |
313 | |
298 | void put_(keyword k, sint32 v) |
314 | void put_(keyword k, sint32 v) |
299 | { |
315 | { |
|
|
316 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
300 | add (keyword_str [k], keyword_len [k]); |
317 | fadd (keyword_str [k], keyword_len [k]); |
301 | add (' '); |
318 | fadd (' '); |
302 | add (v); |
319 | add (v); |
303 | add ('\n'); |
320 | fadd ('\n'); |
304 | } |
|
|
305 | |
|
|
306 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
307 | { |
|
|
308 | add (keyword_str [kbeg], keyword_len [kbeg]); add ('\n'); |
|
|
309 | |
|
|
310 | if (expect_true (v)) |
|
|
311 | { |
|
|
312 | add (v); |
|
|
313 | add ('\n'); |
|
|
314 | } |
|
|
315 | |
|
|
316 | add (keyword_str [kend], keyword_len [kend]); add ('\n'); |
|
|
317 | } |
321 | } |
318 | |
322 | |
319 | void put (keyword k, float v) { put (k, (double)v); } |
323 | void put (keyword k, float v) { put (k, (double)v); } |
320 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
324 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
321 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
325 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
… | |
… | |
326 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
330 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
327 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
331 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
328 | 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); } |
329 | 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); } |
330 | |
334 | |
331 | template<typename T> |
335 | void put (keyword kbeg, keyword kend, const shstr &v) |
332 | void put (keyword k, const T *v) |
|
|
333 | { |
336 | { |
|
|
337 | force (MAX_KEYWORD_LEN + 1); |
|
|
338 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
339 | |
334 | if (expect_true (v)) |
340 | if (expect_true (v)) |
335 | put (k, v->name); |
341 | { |
336 | else |
342 | add (v); |
337 | 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'); |
338 | } |
348 | } |
|
|
349 | |
|
|
350 | void put (keyword k, archetype *v); |
|
|
351 | void put (keyword k, treasurelist *v); |
|
|
352 | void put (keyword k, faceinfo *v); |
339 | |
353 | |
340 | template<typename T> |
354 | template<typename T> |
341 | void put (keyword k, const refptr<T> &v) |
355 | void put (keyword k, const refptr<T> &v) |
342 | { |
356 | { |
343 | put (k, (T *)v); |
357 | put (k, (T *)v); |
… | |
… | |
346 | bool save (const char *path); |
360 | bool save (const char *path); |
347 | char *as_string (); // like strdup |
361 | char *as_string (); // like strdup |
348 | |
362 | |
349 | operator bool () { return !!av; } |
363 | operator bool () { return !!av; } |
350 | }; |
364 | }; |
351 | |
|
|
352 | // compatibility support, should be removed when no longer needed |
|
|
353 | void fprintf (object_freezer &freezer, const char *format, ...); |
|
|
354 | void fputs (const char *s, object_freezer &freezer); |
|
|
355 | |
365 | |
356 | struct object_thawer |
366 | struct object_thawer |
357 | { |
367 | { |
358 | char *line; // current beginning of line |
368 | char *line; // current beginning of line |
359 | SV *text; // text part |
369 | SV *text; // text part |
… | |
… | |
374 | void get (attachable *obj, int oid); |
384 | void get (attachable *obj, int oid); |
375 | |
385 | |
376 | // parse next line |
386 | // parse next line |
377 | void next (); |
387 | void next (); |
378 | // skip the current key-value (usually fetch next line, for |
388 | // skip the current key-value (usually fetch next line, for |
379 | // multiline-fields, skips untilt he corresponding end-kw |
389 | // multiline-fields, skips till the corresponding end-kw |
380 | void skip (); |
390 | void skip (); |
381 | |
|
|
382 | //TODO: remove, deprecated |
|
|
383 | keyword get_kv () |
|
|
384 | { |
|
|
385 | next (); |
|
|
386 | return kw; |
|
|
387 | } |
|
|
388 | |
391 | |
389 | char *get_str () { return value; } // may be 0 |
392 | char *get_str () { return value; } // may be 0 |
390 | void get_ml (keyword kend, shstr &sh); |
393 | void get_ml (keyword kend, shstr &sh); |
391 | |
394 | |
392 | void get_ornull (shstr &sh) const { sh = value; } |
395 | void get_ornull (shstr &sh) const { sh = value; } |
393 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
396 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
394 | |
397 | |
395 | bool get_bool () const { return *value_nn == '1'; } |
398 | bool get_bool () const { return *value_nn == '1'; } |
396 | sint32 get_sint32 () const; |
399 | sint32 get_sint32 () const; |
397 | sint64 get_sint64 () const { return atoll (value_nn); } |
400 | sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); } |
398 | double get_double () const { return atof (value_nn); } |
401 | double get_double () const { return strtod (value_nn, 0); } |
399 | |
402 | |
400 | void get (float &v) { v = get_double (); } |
403 | void get (float &v) { v = get_double (); } |
401 | void get (double &v) { v = get_double (); } |
404 | void get (double &v) { v = get_double (); } |
402 | |
405 | |
403 | void get (bool &i) { i = get_bool (); } |
406 | void get (bool &i) { i = get_bool (); } |
… | |
… | |
422 | static struct CoroAPI *GCoroAPI; |
425 | static struct CoroAPI *GCoroAPI; |
423 | |
426 | |
424 | static int nready () { return CORO_NREADY; } |
427 | static int nready () { return CORO_NREADY; } |
425 | static int cede () { return CORO_CEDE ; } |
428 | static int cede () { return CORO_CEDE ; } |
426 | |
429 | |
427 | static double (*time)(); |
|
|
428 | static double next_cede; |
430 | static tstamp next_cede; |
429 | static int cede_counter; |
431 | static int cede_counter; |
430 | |
432 | |
431 | static void do_cede_every (); |
433 | static void do_cede_every (); |
432 | static void do_cede_to_tick (); |
434 | static void do_cede_to_tick (); |
433 | static void do_cede_to_tick_every (); |
435 | static void do_cede_to_tick_every (); |
… | |
… | |
436 | { |
438 | { |
437 | if (expect_false (++cede_counter >= count)) |
439 | if (expect_false (++cede_counter >= count)) |
438 | do_cede_every (); |
440 | do_cede_every (); |
439 | } |
441 | } |
440 | |
442 | |
441 | static void cede_to_tick () |
443 | static bool cede_to_tick () |
442 | { |
444 | { |
443 | if (expect_false (time () >= next_cede)) |
445 | if (expect_true (now () < next_cede)) |
|
|
446 | return false; |
|
|
447 | |
444 | do_cede_to_tick (); |
448 | do_cede_to_tick (); |
|
|
449 | return true; |
445 | } |
450 | } |
446 | |
451 | |
447 | static void cede_to_tick_every (int count) |
452 | static bool cede_to_tick_every (int count) |
448 | { |
453 | { |
449 | if (expect_false (++cede_counter >= count)) |
454 | if (expect_true (++cede_counter < count)) |
|
|
455 | return false; |
|
|
456 | |
450 | cede_to_tick (); |
457 | return cede_to_tick (); |
451 | } |
458 | } |
452 | |
459 | |
453 | static void wait_for_tick (); |
460 | static void wait_for_tick (); |
454 | static void wait_for_tick_begin (); |
461 | static void wait_for_tick_begin (); |
455 | }; |
462 | }; |