|
|
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 (); |
… | |
… | |
187 | { |
211 | { |
188 | } |
212 | } |
189 | |
213 | |
190 | virtual ~attachable (); |
214 | virtual ~attachable (); |
191 | |
215 | |
|
|
216 | // set a custom key to the given value, or delete it if value = 0 |
|
|
217 | void set_key (const char *key, const char *value = 0); |
|
|
218 | |
192 | attachable &operator =(const attachable &src); |
219 | attachable &operator =(const attachable &src); |
193 | |
220 | |
194 | // used to _quickly_ device wether to shortcut the evaluation |
221 | // used to _quickly_ device wether to shortcut the evaluation |
195 | bool should_invoke (event_type event) |
222 | bool should_invoke (event_type event) |
196 | { |
223 | { |
… | |
… | |
239 | |
266 | |
240 | add ('\n'); |
267 | add ('\n'); |
241 | } |
268 | } |
242 | |
269 | |
243 | template<typename T> |
270 | template<typename T> |
244 | void put_string (keyword k, const T &v) |
271 | void put_kw_string (keyword k, const T &v) |
245 | { |
272 | { |
246 | int klen = keyword_len [k]; |
273 | int klen = keyword_len [k]; |
247 | int vlen = v ? strlen (v) + 1 : 0; |
274 | int vlen = v ? strlen (v) + 1 : 0; |
248 | |
275 | |
249 | char *p = (char *)alloc (klen + vlen + 1); |
276 | char *p = (char *)alloc (klen + vlen + 1); |
… | |
… | |
259 | *p = '\n'; |
286 | *p = '\n'; |
260 | } |
287 | } |
261 | |
288 | |
262 | void put (keyword k, const char *v = 0) |
289 | void put (keyword k, const char *v = 0) |
263 | { |
290 | { |
264 | put_string (k, v); |
291 | put_kw_string (k, v); |
265 | } |
292 | } |
266 | |
293 | |
267 | void put (keyword k, const shstr &v) |
294 | void put (keyword k, const shstr &v) |
268 | { |
295 | { |
269 | put_string (k, v); |
296 | put_kw_string (k, v); |
270 | } |
297 | } |
271 | |
298 | |
272 | void put (keyword k, double v) |
299 | void put (keyword k, double v) |
273 | { |
300 | { |
274 | force (MAX_KEYWORD_LEN + 2 + 32); |
301 | force (MAX_KEYWORD_LEN + 2 + 32); |
… | |
… | |
292 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
319 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
293 | fadd (keyword_str [k], keyword_len [k]); |
320 | fadd (keyword_str [k], keyword_len [k]); |
294 | fadd (' '); |
321 | fadd (' '); |
295 | add (v); |
322 | add (v); |
296 | fadd ('\n'); |
323 | 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 | } |
324 | } |
313 | |
325 | |
314 | void put (keyword k, float v) { put (k, (double)v); } |
326 | void put (keyword k, float v) { put (k, (double)v); } |
315 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
327 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
316 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
328 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
… | |
… | |
321 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
333 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
322 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
334 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
323 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
335 | 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); } |
336 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
325 | |
337 | |
326 | template<typename T> |
338 | void put (keyword kbeg, keyword kend, const shstr &v) |
327 | void put (keyword k, const T *v) |
|
|
328 | { |
339 | { |
|
|
340 | force (MAX_KEYWORD_LEN + 1); |
|
|
341 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
342 | |
329 | if (expect_true (v)) |
343 | if (expect_true (v)) |
330 | put (k, v->name); |
344 | { |
331 | else |
345 | add (v); |
332 | put (k, (const char *)0); |
346 | add ('\n'); |
|
|
347 | } |
|
|
348 | |
|
|
349 | force (MAX_KEYWORD_LEN + 1); |
|
|
350 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
333 | } |
351 | } |
|
|
352 | |
|
|
353 | void put (keyword k, archetype *v); |
|
|
354 | void put (keyword k, treasurelist *v); |
|
|
355 | void put (keyword k, faceinfo *v); |
334 | |
356 | |
335 | template<typename T> |
357 | template<typename T> |
336 | void put (keyword k, const refptr<T> &v) |
358 | void put (keyword k, const refptr<T> &v) |
337 | { |
359 | { |
338 | put (k, (T *)v); |
360 | put (k, (T *)v); |
… | |
… | |
365 | void get (attachable *obj, int oid); |
387 | void get (attachable *obj, int oid); |
366 | |
388 | |
367 | // parse next line |
389 | // parse next line |
368 | void next (); |
390 | void next (); |
369 | // skip the current key-value (usually fetch next line, for |
391 | // skip the current key-value (usually fetch next line, for |
370 | // multiline-fields, skips untilt he corresponding end-kw |
392 | // multiline-fields, skips till the corresponding end-kw |
371 | void skip (); |
393 | void skip (); |
372 | |
|
|
373 | //TODO: remove, deprecated |
|
|
374 | keyword get_kv () |
|
|
375 | { |
|
|
376 | next (); |
|
|
377 | return kw; |
|
|
378 | } |
|
|
379 | |
394 | |
380 | char *get_str () { return value; } // may be 0 |
395 | char *get_str () { return value; } // may be 0 |
381 | void get_ml (keyword kend, shstr &sh); |
396 | void get_ml (keyword kend, shstr &sh); |
382 | |
397 | |
383 | void get_ornull (shstr &sh) const { sh = value; } |
398 | void get_ornull (shstr &sh) const { sh = value; } |
… | |
… | |
413 | static struct CoroAPI *GCoroAPI; |
428 | static struct CoroAPI *GCoroAPI; |
414 | |
429 | |
415 | static int nready () { return CORO_NREADY; } |
430 | static int nready () { return CORO_NREADY; } |
416 | static int cede () { return CORO_CEDE ; } |
431 | static int cede () { return CORO_CEDE ; } |
417 | |
432 | |
418 | static double (*time)(); |
|
|
419 | static double next_cede; |
433 | static tstamp next_cede; |
420 | static int cede_counter; |
434 | static int cede_counter; |
421 | |
435 | |
422 | static void do_cede_every (); |
436 | static void do_cede_every (); |
423 | static void do_cede_to_tick (); |
437 | static void do_cede_to_tick (); |
424 | static void do_cede_to_tick_every (); |
438 | static void do_cede_to_tick_every (); |
… | |
… | |
427 | { |
441 | { |
428 | if (expect_false (++cede_counter >= count)) |
442 | if (expect_false (++cede_counter >= count)) |
429 | do_cede_every (); |
443 | do_cede_every (); |
430 | } |
444 | } |
431 | |
445 | |
432 | static void cede_to_tick () |
446 | static bool cede_to_tick () |
433 | { |
447 | { |
434 | if (expect_false (time () >= next_cede)) |
448 | if (expect_true (now () < next_cede)) |
|
|
449 | return false; |
|
|
450 | |
435 | do_cede_to_tick (); |
451 | do_cede_to_tick (); |
|
|
452 | return true; |
436 | } |
453 | } |
437 | |
454 | |
438 | static void cede_to_tick_every (int count) |
455 | static bool cede_to_tick_every (int count) |
439 | { |
456 | { |
440 | if (expect_false (++cede_counter >= count)) |
457 | if (expect_true (++cede_counter < count)) |
|
|
458 | return false; |
|
|
459 | |
441 | cede_to_tick (); |
460 | return cede_to_tick (); |
442 | } |
461 | } |
443 | |
462 | |
444 | static void wait_for_tick (); |
463 | static void wait_for_tick (); |
445 | static void wait_for_tick_begin (); |
464 | static void wait_for_tick_begin (); |
446 | }; |
465 | }; |