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