|
|
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 (); |
… | |
… | |
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); |
… | |
… | |
321 | |
345 | |
322 | force (MAX_KEYWORD_LEN + 1); |
346 | force (MAX_KEYWORD_LEN + 1); |
323 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
324 | } |
348 | } |
325 | |
349 | |
326 | template<typename T> |
350 | void put (keyword k, archetype *v); |
|
|
351 | void put (keyword k, treasurelist *v); |
327 | void put (keyword k, const T *v) |
352 | void put (keyword k, faceinfo *v); |
328 | { |
|
|
329 | if (v) |
|
|
330 | put (k, v->name); |
|
|
331 | else |
|
|
332 | put (k, (const char *)0); |
|
|
333 | } |
|
|
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); |
… | |
… | |
406 | static struct CoroAPI *GCoroAPI; |
425 | static struct CoroAPI *GCoroAPI; |
407 | |
426 | |
408 | static int nready () { return CORO_NREADY; } |
427 | static int nready () { return CORO_NREADY; } |
409 | static int cede () { return CORO_CEDE ; } |
428 | static int cede () { return CORO_CEDE ; } |
410 | |
429 | |
411 | static double (*time)(); |
|
|
412 | static double next_cede; |
430 | static tstamp next_cede; |
413 | static int cede_counter; |
431 | static int cede_counter; |
414 | |
432 | |
415 | static void do_cede_every (); |
433 | static void do_cede_every (); |
416 | static void do_cede_to_tick (); |
434 | static void do_cede_to_tick (); |
417 | static void do_cede_to_tick_every (); |
435 | static void do_cede_to_tick_every (); |
… | |
… | |
420 | { |
438 | { |
421 | if (expect_false (++cede_counter >= count)) |
439 | if (expect_false (++cede_counter >= count)) |
422 | do_cede_every (); |
440 | do_cede_every (); |
423 | } |
441 | } |
424 | |
442 | |
425 | static void cede_to_tick () |
443 | static bool cede_to_tick () |
426 | { |
444 | { |
427 | if (expect_false (time () >= next_cede)) |
445 | if (expect_true (now () < next_cede)) |
|
|
446 | return false; |
|
|
447 | |
428 | do_cede_to_tick (); |
448 | do_cede_to_tick (); |
|
|
449 | return true; |
429 | } |
450 | } |
430 | |
451 | |
431 | static void cede_to_tick_every (int count) |
452 | static bool cede_to_tick_every (int count) |
432 | { |
453 | { |
433 | if (expect_false (++cede_counter >= count)) |
454 | if (expect_true (++cede_counter < count)) |
|
|
455 | return false; |
|
|
456 | |
434 | cede_to_tick (); |
457 | return cede_to_tick (); |
435 | } |
458 | } |
436 | |
459 | |
437 | static void wait_for_tick (); |
460 | static void wait_for_tick (); |
438 | static void wait_for_tick_begin (); |
461 | static void wait_for_tick_begin (); |
439 | }; |
462 | }; |