|
|
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, |
… | |
… | |
110 | #define ARG_CLIENT(o) DT_CLIENT, (void *)(static_cast<client *> (o)) |
134 | #define ARG_CLIENT(o) DT_CLIENT, (void *)(static_cast<client *> (o)) |
111 | #define ARG_PARTY(o) DT_PARTY , (void *)(static_cast<party *> (o)) |
135 | #define ARG_PARTY(o) DT_PARTY , (void *)(static_cast<party *> (o)) |
112 | #define ARG_REGION(o) DT_REGION, (void *)(static_cast<region *> (o)) |
136 | #define ARG_REGION(o) DT_REGION, (void *)(static_cast<region *> (o)) |
113 | |
137 | |
114 | // the ", ## __VA_ARGS" is, unfortunately, a gnu-cpp extension |
138 | // the ", ## __VA_ARGS" is, unfortunately, a gnu-cpp extension |
115 | |
139 | #define INVOKE(obj,event, ...) (expect_false ((obj)->should_invoke (event)) ? (obj)->invoke (event, ## __VA_ARGS__, DT_END) : 0) |
116 | // all these return true when the normal event processing should be skipped (if any) |
|
|
117 | #define INVOKE_GLOBAL(event, ...) gbl_ev.invoke (EVENT_ ## GLOBAL ## _ ## event, ## __VA_ARGS__, DT_END) |
140 | #define INVOKE_GLOBAL(event, ...) INVOKE (&gbl_ev, EVENT_ ## GLOBAL ## _ ## event, ## __VA_ARGS__) |
118 | #define INVOKE_ATTACHABLE(event, obj, ...) (obj)->invoke (EVENT_ ## ATTACHABLE ## _ ## event, ## __VA_ARGS__, DT_END) |
141 | #define INVOKE_ATTACHABLE(event, obj, ...) INVOKE (obj , EVENT_ ## ATTACHABLE ## _ ## event, ## __VA_ARGS__) |
119 | #define INVOKE_OBJECT(event, obj, ...) (obj)->invoke (EVENT_ ## OBJECT ## _ ## event, ## __VA_ARGS__, DT_END) |
142 | #define INVOKE_OBJECT(event, obj, ...) INVOKE (obj , EVENT_ ## OBJECT ## _ ## event, ## __VA_ARGS__) |
120 | #define INVOKE_CLIENT(event, obj, ...) (obj)->invoke (EVENT_ ## CLIENT ## _ ## event, ## __VA_ARGS__, DT_END) |
143 | #define INVOKE_CLIENT(event, obj, ...) INVOKE (obj , EVENT_ ## CLIENT ## _ ## event, ## __VA_ARGS__) |
121 | #define INVOKE_PLAYER(event, obj, ...) (obj)->invoke (EVENT_ ## PLAYER ## _ ## event, ## __VA_ARGS__, DT_END) |
144 | #define INVOKE_PLAYER(event, obj, ...) INVOKE (obj , EVENT_ ## PLAYER ## _ ## event, ## __VA_ARGS__) |
122 | #define INVOKE_MAP(event, obj, ...) (obj)->invoke (EVENT_ ## MAP ## _ ## event, ## __VA_ARGS__, DT_END) |
145 | #define INVOKE_MAP(event, obj, ...) INVOKE (obj , EVENT_ ## MAP ## _ ## event, ## __VA_ARGS__) |
123 | |
146 | |
124 | //TODO should index into @result |
147 | //TODO should index into @result |
125 | #define RESULT(idx,type) cfperl_result_ ## type (idx) |
148 | #define RESULT(idx,type) cfperl_result_ ## type (idx) |
126 | #define RESULT_DOUBLE(idx) RESULT(idx, DOUBLE) |
149 | #define RESULT_DOUBLE(idx) RESULT(idx, DOUBLE) |
127 | #define RESULT_INT(idx) RESULT(idx, INT) |
150 | #define RESULT_INT(idx) RESULT(idx, INT) |
… | |
… | |
151 | MTH void refcnt_inc () const { ++refcnt; } |
174 | MTH void refcnt_inc () const { ++refcnt; } |
152 | MTH void refcnt_dec () const { --refcnt; } |
175 | MTH void refcnt_dec () const { --refcnt; } |
153 | |
176 | |
154 | MTH int refcnt_cnt () const; |
177 | MTH int refcnt_cnt () const; |
155 | // check wether the object has died and destroy |
178 | // check wether the object has died and destroy |
156 | MTH void refcnt_chk () { if (refcnt <= 0) do_check (); } |
179 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
157 | |
180 | |
158 | // destroy the object unless it was already destroyed |
181 | // destroy the object unless it was already destroyed |
159 | // this politely asks everybody interested the reduce |
182 | // this politely asks everybody interested the reduce |
160 | // the refcount to 0 as soon as possible. |
183 | // the refcount to 0 as soon as possible. |
161 | MTH void destroy (); |
184 | MTH void destroy (); |
… | |
… | |
188 | { |
211 | { |
189 | } |
212 | } |
190 | |
213 | |
191 | virtual ~attachable (); |
214 | virtual ~attachable (); |
192 | |
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 | |
193 | attachable &operator =(const attachable &src); |
219 | attachable &operator =(const attachable &src); |
194 | |
220 | |
195 | bool vinvoke (event_type event, va_list &ap); |
221 | // used to _quickly_ device wether to shortcut the evaluation |
|
|
222 | bool should_invoke (event_type event) |
|
|
223 | { |
|
|
224 | return ev_want_event [event] || cb; |
|
|
225 | } |
|
|
226 | |
196 | bool invoke (event_type event, ...) |
227 | bool invoke (event_type event, ...); |
197 | { |
|
|
198 | if (ev_want_event [event] || cb) |
|
|
199 | { |
|
|
200 | va_list ap; |
|
|
201 | va_start (ap, event); |
|
|
202 | vinvoke (event, ap); |
|
|
203 | va_end (ap); |
|
|
204 | } |
|
|
205 | } |
|
|
206 | |
228 | |
207 | MTH void instantiate (); |
229 | MTH void instantiate (); |
208 | void reattach (); |
230 | void reattach (); |
209 | |
231 | |
210 | protected: |
232 | protected: |
… | |
… | |
237 | // used only for user-defined key-value pairs |
259 | // used only for user-defined key-value pairs |
238 | void put (const shstr &k, const shstr &v) |
260 | void put (const shstr &k, const shstr &v) |
239 | { |
261 | { |
240 | add (k); |
262 | add (k); |
241 | |
263 | |
242 | if (v) |
264 | if (expect_true (v)) |
243 | add (' '), add (v); |
265 | add (' '), add (v); |
244 | |
266 | |
245 | add ('\n'); |
267 | add ('\n'); |
246 | } |
268 | } |
247 | |
269 | |
248 | //TODO//temporary, used only for saving body locations |
|
|
249 | void put (const char *k, int v) |
|
|
250 | { |
|
|
251 | add (k); |
|
|
252 | add (' '); |
|
|
253 | add (sint32 (v)); |
|
|
254 | add ('\n'); |
|
|
255 | } |
|
|
256 | |
|
|
257 | template<typename T> |
270 | template<typename T> |
258 | void put_string (keyword k, const T &v) |
271 | void put_kw_string (keyword k, const T &v) |
259 | { |
272 | { |
260 | int klen = keyword_len [k]; |
273 | int klen = keyword_len [k]; |
261 | int vlen = v ? strlen (v) + 1 : 0; |
274 | int vlen = v ? strlen (v) + 1 : 0; |
262 | |
275 | |
263 | char *p = (char *)alloc (klen + vlen + 1); |
276 | char *p = (char *)alloc (klen + vlen + 1); |
264 | |
277 | |
265 | memcpy (p, keyword_str [k], klen); p += klen; |
278 | memcpy (p, keyword_str [k], klen); p += klen; |
266 | |
279 | |
267 | if (v) |
280 | if (expect_true (v)) |
268 | { |
281 | { |
269 | *p++ = ' '; vlen--; |
282 | *p++ = ' '; vlen--; |
270 | memcpy (p, v, vlen); p += vlen; |
283 | memcpy (p, v, vlen); p += vlen; |
271 | } |
284 | } |
272 | |
285 | |
273 | *p = '\n'; |
286 | *p = '\n'; |
274 | } |
287 | } |
275 | |
288 | |
276 | void put (keyword k, const char *v = 0) |
289 | void put (keyword k, const char *v = 0) |
277 | { |
290 | { |
278 | put_string (k, v); |
291 | put_kw_string (k, v); |
279 | } |
292 | } |
280 | |
293 | |
281 | void put (keyword k, const shstr &v) |
294 | void put (keyword k, const shstr &v) |
282 | { |
295 | { |
283 | put_string (k, v); |
296 | put_kw_string (k, v); |
284 | } |
297 | } |
285 | |
298 | |
286 | void put (keyword k, double v) |
299 | void put (keyword k, double v) |
287 | { |
300 | { |
288 | char buf [128]; |
301 | force (MAX_KEYWORD_LEN + 2 + 32); |
289 | |
302 | fadd (keyword_str [k], keyword_len [k]); |
290 | snprintf (buf, 128, "%.7g", v); |
303 | fadd (' '); |
291 | |
304 | falloc (sprintf (ptr, "%.7g", v)); |
292 | put (k, (const char *)buf); |
305 | fadd ('\n'); |
293 | } |
306 | } |
294 | |
307 | |
295 | void put_(keyword k, sint64 v) |
308 | void put_(keyword k, sint64 v) |
296 | { |
309 | { |
|
|
310 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
297 | add (keyword_str [k], keyword_len [k]); |
311 | fadd (keyword_str [k], keyword_len [k]); |
298 | add (' '); |
312 | fadd (' '); |
299 | add (v); |
313 | add (v); |
300 | add ('\n'); |
314 | fadd ('\n'); |
301 | } |
315 | } |
302 | |
316 | |
303 | void put_(keyword k, sint32 v) |
317 | void put_(keyword k, sint32 v) |
304 | { |
318 | { |
|
|
319 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
305 | add (keyword_str [k], keyword_len [k]); |
320 | fadd (keyword_str [k], keyword_len [k]); |
306 | add (' '); |
321 | fadd (' '); |
307 | add (v); |
322 | add (v); |
308 | add ('\n'); |
323 | fadd ('\n'); |
309 | } |
|
|
310 | |
|
|
311 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
312 | { |
|
|
313 | add (keyword_str [kbeg], keyword_len [kbeg]); add ('\n'); |
|
|
314 | |
|
|
315 | if (v) |
|
|
316 | { |
|
|
317 | add (v); |
|
|
318 | add ('\n'); |
|
|
319 | } |
|
|
320 | |
|
|
321 | add (keyword_str [kend], keyword_len [kend]); add ('\n'); |
|
|
322 | } |
324 | } |
323 | |
325 | |
324 | void put (keyword k, float v) { put (k, (double)v); } |
326 | void put (keyword k, float v) { put (k, (double)v); } |
325 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
327 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
326 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
328 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
… | |
… | |
331 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
333 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
332 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
334 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
333 | 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); } |
334 | 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); } |
335 | |
337 | |
336 | template<typename T> |
338 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
339 | { |
|
|
340 | force (MAX_KEYWORD_LEN + 1); |
|
|
341 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
342 | |
|
|
343 | if (expect_true (v)) |
|
|
344 | { |
|
|
345 | add (v); |
|
|
346 | add ('\n'); |
|
|
347 | } |
|
|
348 | |
|
|
349 | force (MAX_KEYWORD_LEN + 1); |
|
|
350 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
351 | } |
|
|
352 | |
|
|
353 | void put (keyword k, archetype *v); |
|
|
354 | void put (keyword k, treasurelist *v); |
337 | void put (keyword k, const T *v) |
355 | void put (keyword k, faceinfo *v); |
338 | { |
|
|
339 | if (v) |
|
|
340 | put (k, v->name); |
|
|
341 | else |
|
|
342 | put (k, (const char *)0); |
|
|
343 | } |
|
|
344 | |
356 | |
345 | template<typename T> |
357 | template<typename T> |
346 | void put (keyword k, const refptr<T> &v) |
358 | void put (keyword k, const refptr<T> &v) |
347 | { |
359 | { |
348 | put (k, (T *)v); |
360 | put (k, (T *)v); |
… | |
… | |
352 | char *as_string (); // like strdup |
364 | char *as_string (); // like strdup |
353 | |
365 | |
354 | operator bool () { return !!av; } |
366 | operator bool () { return !!av; } |
355 | }; |
367 | }; |
356 | |
368 | |
357 | // compatibility support, should be removed when no longer needed |
|
|
358 | void fprintf (object_freezer &freezer, const char *format, ...); |
|
|
359 | void fputs (const char *s, object_freezer &freezer); |
|
|
360 | |
|
|
361 | struct object_thawer |
369 | struct object_thawer |
362 | { |
370 | { |
|
|
371 | char *line; // current beginning of line |
363 | SV *text; // text part |
372 | SV *text; // text part |
364 | AV *av; // perl part |
373 | AV *av; // perl part |
365 | int linenum; |
374 | int linenum; |
366 | char *line; // current beginning of line |
|
|
367 | keyword kw; |
375 | keyword kw; |
368 | char *kw_str, *value; |
376 | char *kw_str; // the keyword parsed, as string |
|
|
377 | char *value; // the value, or 0 if no value |
|
|
378 | char *value_nn; // the value, or the empty string if no value |
369 | const char *name; |
379 | const char *name; |
370 | |
380 | |
371 | operator bool () { return !!text; } |
381 | operator bool () { return !!text; } |
372 | |
382 | |
373 | object_thawer (const char *path = 0); |
383 | object_thawer (const char *path = 0); |
… | |
… | |
377 | void get (attachable *obj, int oid); |
387 | void get (attachable *obj, int oid); |
378 | |
388 | |
379 | // parse next line |
389 | // parse next line |
380 | void next (); |
390 | void next (); |
381 | // skip the current key-value (usually fetch next line, for |
391 | // skip the current key-value (usually fetch next line, for |
382 | // multiline-fields, skips untilt he corresponding end-kw |
392 | // multiline-fields, skips till the corresponding end-kw |
383 | void skip (); |
393 | void skip (); |
384 | |
394 | |
385 | //TODO: remove, deprecated |
|
|
386 | keyword get_kv () |
|
|
387 | { |
|
|
388 | next (); |
|
|
389 | return kw; |
|
|
390 | } |
|
|
391 | |
|
|
392 | char *get_str () { return value; } // may be 0 |
395 | char *get_str () { return value; } // may be 0 |
|
|
396 | void get_ml (keyword kend, shstr &sh); |
393 | |
397 | |
394 | void get (shstr &sh) const; |
|
|
395 | void get_ornull (shstr &sh) const { sh = value; } |
398 | void get_ornull (shstr &sh) const { sh = value; } |
396 | void get_ml (keyword kend, shstr &sh); |
399 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
397 | |
400 | |
|
|
401 | bool get_bool () const { return *value_nn == '1'; } |
398 | sint32 get_sint32 () const; |
402 | sint32 get_sint32 () const; |
399 | sint64 get_sint64 () const; |
403 | sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); } |
400 | double get_double () const; |
404 | double get_double () const { return strtod (value_nn, 0); } |
401 | |
405 | |
402 | void get (float &v) { v = get_double (); } |
406 | void get (float &v) { v = get_double (); } |
403 | void get (double &v) { v = get_double (); } |
407 | void get (double &v) { v = get_double (); } |
404 | |
408 | |
405 | void get (bool &i) { i = get_sint32 (); } |
409 | void get (bool &i) { i = get_bool (); } |
406 | void get (sint8 &i) { i = get_sint32 (); } |
410 | void get (sint8 &i) { i = get_sint32 (); } |
407 | void get (uint8 &i) { i = get_sint32 (); } |
411 | void get (uint8 &i) { i = get_sint32 (); } |
408 | void get (sint16 &i) { i = get_sint32 (); } |
412 | void get (sint16 &i) { i = get_sint32 (); } |
409 | void get (uint16 &i) { i = get_sint32 (); } |
413 | void get (uint16 &i) { i = get_sint32 (); } |
410 | void get (sint32 &i) { i = get_sint32 (); } |
414 | void get (sint32 &i) { i = get_sint32 (); } |
… | |
… | |
424 | static struct CoroAPI *GCoroAPI; |
428 | static struct CoroAPI *GCoroAPI; |
425 | |
429 | |
426 | static int nready () { return CORO_NREADY; } |
430 | static int nready () { return CORO_NREADY; } |
427 | static int cede () { return CORO_CEDE ; } |
431 | static int cede () { return CORO_CEDE ; } |
428 | |
432 | |
429 | static double (*time)(); |
|
|
430 | static double next_cede; |
433 | static tstamp next_cede; |
431 | static int cede_counter; |
434 | static int cede_counter; |
432 | |
435 | |
433 | static void do_cede_every (); |
436 | static void do_cede_every (); |
434 | static void do_cede_to_tick (); |
437 | static void do_cede_to_tick (); |
435 | static void do_cede_to_tick_every (); |
438 | static void do_cede_to_tick_every (); |
436 | |
439 | |
437 | static void cede_every (int count) |
440 | static void cede_every (int count) |
438 | { |
441 | { |
439 | if (++cede_counter >= count) |
442 | if (expect_false (++cede_counter >= count)) |
440 | do_cede_every (); |
443 | do_cede_every (); |
441 | } |
444 | } |
442 | |
445 | |
443 | static void cede_to_tick () |
446 | static bool cede_to_tick () |
444 | { |
447 | { |
445 | if (time () >= next_cede) |
448 | if (expect_true (now () < next_cede)) |
|
|
449 | return false; |
|
|
450 | |
446 | do_cede_to_tick (); |
451 | do_cede_to_tick (); |
|
|
452 | return true; |
447 | } |
453 | } |
448 | |
454 | |
449 | static void cede_to_tick_every (int count) |
455 | static bool cede_to_tick_every (int count) |
450 | { |
456 | { |
451 | if (++cede_counter >= count) |
457 | if (expect_true (++cede_counter < count)) |
|
|
458 | return false; |
|
|
459 | |
452 | cede_to_tick (); |
460 | return cede_to_tick (); |
453 | } |
461 | } |
454 | |
462 | |
455 | static void wait_for_tick (); |
463 | static void wait_for_tick (); |
456 | static void wait_for_tick_begin (); |
464 | static void wait_for_tick_begin (); |
457 | }; |
465 | }; |