1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | // |
24 | // |
… | |
… | |
89 | void cfperl_init (); |
88 | void cfperl_init (); |
90 | void cfperl_main (); |
89 | void cfperl_main (); |
91 | void cfperl_emergency_save (); |
90 | void cfperl_emergency_save (); |
92 | void cfperl_cleanup (int make_core); |
91 | void cfperl_cleanup (int make_core); |
93 | 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); |
94 | |
94 | |
95 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
95 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
96 | |
96 | |
97 | // virtual server time, excluding time jumps and lag |
97 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
98 | extern double runtime; |
98 | extern tstamp NOW; // real time of current server tick |
99 | |
99 | |
100 | enum event_klass |
100 | enum event_klass |
101 | { |
101 | { |
102 | KLASS_NONE, |
102 | KLASS_NONE, |
103 | KLASS_GLOBAL, |
103 | KLASS_GLOBAL, |
… | |
… | |
174 | MTH void refcnt_inc () const { ++refcnt; } |
174 | MTH void refcnt_inc () const { ++refcnt; } |
175 | MTH void refcnt_dec () const { --refcnt; } |
175 | MTH void refcnt_dec () const { --refcnt; } |
176 | |
176 | |
177 | MTH int refcnt_cnt () const; |
177 | MTH int refcnt_cnt () const; |
178 | // check wether the object has died and destroy |
178 | // check wether the object has died and destroy |
179 | MTH void refcnt_chk () { if (refcnt <= 0) do_check (); } |
179 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
180 | |
180 | |
181 | // destroy the object unless it was already destroyed |
181 | // destroy the object unless it was already destroyed |
182 | // this politely asks everybody interested the reduce |
182 | // this politely asks everybody interested the reduce |
183 | // the refcount to 0 as soon as possible. |
183 | // the refcount to 0 as soon as possible. |
184 | MTH void destroy (); |
184 | MTH void destroy (); |
… | |
… | |
263 | |
263 | |
264 | add ('\n'); |
264 | add ('\n'); |
265 | } |
265 | } |
266 | |
266 | |
267 | template<typename T> |
267 | template<typename T> |
268 | void put_string (keyword k, const T &v) |
268 | void put_kw_string (keyword k, const T &v) |
269 | { |
269 | { |
270 | int klen = keyword_len [k]; |
270 | int klen = keyword_len [k]; |
271 | int vlen = v ? strlen (v) + 1 : 0; |
271 | int vlen = v ? strlen (v) + 1 : 0; |
272 | |
272 | |
273 | char *p = (char *)alloc (klen + vlen + 1); |
273 | char *p = (char *)alloc (klen + vlen + 1); |
… | |
… | |
283 | *p = '\n'; |
283 | *p = '\n'; |
284 | } |
284 | } |
285 | |
285 | |
286 | void put (keyword k, const char *v = 0) |
286 | void put (keyword k, const char *v = 0) |
287 | { |
287 | { |
288 | put_string (k, v); |
288 | put_kw_string (k, v); |
289 | } |
289 | } |
290 | |
290 | |
291 | void put (keyword k, const shstr &v) |
291 | void put (keyword k, const shstr &v) |
292 | { |
292 | { |
293 | put_string (k, v); |
293 | put_kw_string (k, v); |
294 | } |
294 | } |
295 | |
295 | |
296 | void put (keyword k, double v) |
296 | void put (keyword k, double v) |
297 | { |
297 | { |
298 | force (MAX_KEYWORD_LEN + 2 + 32); |
298 | force (MAX_KEYWORD_LEN + 2 + 32); |
… | |
… | |
345 | |
345 | |
346 | force (MAX_KEYWORD_LEN + 1); |
346 | force (MAX_KEYWORD_LEN + 1); |
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
348 | } |
348 | } |
349 | |
349 | |
350 | template<typename T> |
350 | void put (keyword k, archetype *v); |
|
|
351 | void put (keyword k, treasurelist *v); |
351 | void put (keyword k, const T *v) |
352 | void put (keyword k, faceinfo *v); |
352 | { |
|
|
353 | if (v) |
|
|
354 | put (k, v->name); |
|
|
355 | else |
|
|
356 | put (k, (const char *)0); |
|
|
357 | } |
|
|
358 | |
353 | |
359 | template<typename T> |
354 | template<typename T> |
360 | void put (keyword k, const refptr<T> &v) |
355 | void put (keyword k, const refptr<T> &v) |
361 | { |
356 | { |
362 | put (k, (T *)v); |
357 | put (k, (T *)v); |
… | |
… | |
430 | static struct CoroAPI *GCoroAPI; |
425 | static struct CoroAPI *GCoroAPI; |
431 | |
426 | |
432 | static int nready () { return CORO_NREADY; } |
427 | static int nready () { return CORO_NREADY; } |
433 | static int cede () { return CORO_CEDE ; } |
428 | static int cede () { return CORO_CEDE ; } |
434 | |
429 | |
435 | static double (*time)(); |
|
|
436 | static double next_cede; |
430 | static tstamp next_cede; |
437 | static int cede_counter; |
431 | static int cede_counter; |
438 | |
432 | |
439 | static void do_cede_every (); |
433 | static void do_cede_every (); |
440 | static void do_cede_to_tick (); |
434 | static void do_cede_to_tick (); |
441 | static void do_cede_to_tick_every (); |
435 | static void do_cede_to_tick_every (); |
… | |
… | |
444 | { |
438 | { |
445 | if (expect_false (++cede_counter >= count)) |
439 | if (expect_false (++cede_counter >= count)) |
446 | do_cede_every (); |
440 | do_cede_every (); |
447 | } |
441 | } |
448 | |
442 | |
449 | static void cede_to_tick () |
443 | static bool cede_to_tick () |
450 | { |
444 | { |
451 | if (expect_false (time () >= next_cede)) |
445 | if (expect_true (now () < next_cede)) |
|
|
446 | return false; |
|
|
447 | |
452 | do_cede_to_tick (); |
448 | do_cede_to_tick (); |
|
|
449 | return true; |
453 | } |
450 | } |
454 | |
451 | |
455 | static void cede_to_tick_every (int count) |
452 | static bool cede_to_tick_every (int count) |
456 | { |
453 | { |
457 | if (expect_false (++cede_counter >= count)) |
454 | if (expect_true (++cede_counter < count)) |
|
|
455 | return false; |
|
|
456 | |
458 | cede_to_tick (); |
457 | return cede_to_tick (); |
459 | } |
458 | } |
460 | |
459 | |
461 | static void wait_for_tick (); |
460 | static void wait_for_tick (); |
462 | static void wait_for_tick_begin (); |
461 | static void wait_for_tick_begin (); |
463 | }; |
462 | }; |