|
|
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); |
|
|
94 | int cfperl_can_merge (object *ob1, object *ob2); |
70 | |
95 | |
71 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
96 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
72 | |
97 | |
73 | // virtual server time, excluding time jumps and lag |
98 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
74 | extern double runtime; |
99 | extern tstamp NOW; // real time of current server tick |
75 | |
100 | |
76 | enum event_klass |
101 | enum event_klass |
77 | { |
102 | { |
78 | KLASS_NONE, |
103 | KLASS_NONE, |
79 | KLASS_GLOBAL, |
104 | KLASS_GLOBAL, |
… | |
… | |
129 | int cfperl_result_INT (int idx); |
154 | int cfperl_result_INT (int idx); |
130 | |
155 | |
131 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
156 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
132 | |
157 | |
133 | INTERFACE_CLASS (attachable) |
158 | INTERFACE_CLASS (attachable) |
134 | struct attachable |
159 | struct attachable : refcnt_base |
135 | { |
160 | { |
136 | static MGVTBL vtbl; |
161 | static MGVTBL vtbl; |
137 | |
162 | |
138 | static unordered_vector<attachable *> mortals; |
163 | static unordered_vector<attachable *> mortals; |
139 | MTH static void check_mortals (); |
164 | MTH static void check_mortals (); |
140 | |
165 | |
141 | enum { |
166 | enum { |
142 | F_DESTROYED = 0x01, |
167 | F_DESTROYED = 0x01, |
143 | F_DEBUG_TRACE = 0x02, |
168 | F_DEBUG_TRACE = 0x02, |
144 | }; |
169 | }; |
|
|
170 | int ACC (RW, flags); |
145 | |
171 | |
146 | // object is delete'd after the refcount reaches 0 |
172 | // object is delete'd after the refcount reaches 0 |
147 | int ACC (RW, flags); |
|
|
148 | mutable int ACC (RW, refcnt); |
|
|
149 | |
|
|
150 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
151 | MTH void refcnt_dec () const { --refcnt; } |
|
|
152 | |
|
|
153 | MTH int refcnt_cnt () const; |
173 | MTH int refcnt_cnt () const; |
154 | // check wether the object has died and destroy |
174 | // check wether the object has died and destroy |
155 | MTH void refcnt_chk () { if (refcnt <= 0) do_check (); } |
175 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
156 | |
176 | |
157 | // destroy the object unless it was already destroyed |
177 | // destroy the object unless it was already destroyed |
158 | // this politely asks everybody interested the reduce |
178 | // this politely asks everybody interested the reduce |
159 | // the refcount to 0 as soon as possible. |
179 | // the refcount to 0 as soon as possible. |
160 | MTH void destroy (); |
180 | MTH void destroy (); |
… | |
… | |
176 | |
196 | |
177 | void sever_self (); // sever this object from its self, if it has one. |
197 | void sever_self (); // sever this object from its self, if it has one. |
178 | void optimise (); // possibly save some memory by destroying unneeded data |
198 | void optimise (); // possibly save some memory by destroying unneeded data |
179 | |
199 | |
180 | attachable () |
200 | attachable () |
181 | : flags (0), refcnt (0), self (0), cb (0), attach (0) |
201 | : flags (0), self (0), cb (0), attach (0) |
182 | { |
202 | { |
183 | } |
203 | } |
184 | |
204 | |
185 | attachable (const attachable &src) |
205 | attachable (const attachable &src) |
186 | : flags (0), refcnt (0), self (0), cb (0), attach (src.attach) |
206 | : flags (0), self (0), cb (0), attach (src.attach) |
187 | { |
207 | { |
188 | } |
208 | } |
189 | |
209 | |
190 | virtual ~attachable (); |
210 | // set a custom key to the given value, or delete it if value = 0 |
|
|
211 | void set_key (const char *key, const char *value = 0); |
191 | |
212 | |
192 | attachable &operator =(const attachable &src); |
213 | attachable &operator =(const attachable &src); |
193 | |
214 | |
194 | // used to _quickly_ device wether to shortcut the evaluation |
215 | // used to _quickly_ device wether to shortcut the evaluation |
195 | bool should_invoke (event_type event) |
216 | bool should_invoke (event_type event) |
… | |
… | |
206 | // do the real refcount checking work |
227 | // do the real refcount checking work |
207 | void do_check (); |
228 | void do_check (); |
208 | |
229 | |
209 | // the method that does the real destroy work |
230 | // the method that does the real destroy work |
210 | virtual void do_destroy (); |
231 | virtual void do_destroy (); |
|
|
232 | |
|
|
233 | // destructor is protected, should not be called by anybody |
|
|
234 | virtual ~attachable (); |
211 | }; |
235 | }; |
212 | |
236 | |
213 | // the global object is a pseudo object that cares for the global events |
237 | // the global object is a pseudo object that cares for the global events |
214 | struct global : attachable |
238 | struct global : attachable |
215 | { |
239 | { |
… | |
… | |
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); |
… | |
… | |
365 | void get (attachable *obj, int oid); |
384 | void get (attachable *obj, int oid); |
366 | |
385 | |
367 | // parse next line |
386 | // parse next line |
368 | void next (); |
387 | void next (); |
369 | // skip the current key-value (usually fetch next line, for |
388 | // skip the current key-value (usually fetch next line, for |
370 | // multiline-fields, skips untilt he corresponding end-kw |
389 | // multiline-fields, skips till the corresponding end-kw |
371 | void skip (); |
390 | void skip (); |
372 | |
|
|
373 | //TODO: remove, deprecated |
|
|
374 | keyword get_kv () |
|
|
375 | { |
|
|
376 | next (); |
|
|
377 | return kw; |
|
|
378 | } |
|
|
379 | |
391 | |
380 | char *get_str () { return value; } // may be 0 |
392 | char *get_str () { return value; } // may be 0 |
381 | void get_ml (keyword kend, shstr &sh); |
393 | void get_ml (keyword kend, shstr &sh); |
382 | |
394 | |
383 | void get_ornull (shstr &sh) const { sh = value; } |
395 | void get_ornull (shstr &sh) const { sh = value; } |
… | |
… | |
399 | void get (sint32 &i) { i = get_sint32 (); } |
411 | void get (sint32 &i) { i = get_sint32 (); } |
400 | |
412 | |
401 | void get (uint32 &i) { i = get_sint64 (); } |
413 | void get (uint32 &i) { i = get_sint64 (); } |
402 | void get (sint64 &i) { i = get_sint64 (); } |
414 | void get (sint64 &i) { i = get_sint64 (); } |
403 | |
415 | |
|
|
416 | void parse_warn (const char *msg); |
404 | bool parse_error (const char *type = 0, const char *name = 0, bool skip = true); |
417 | bool parse_error (const char *type = 0, const char *name = 0, bool skip = true); |
405 | }; |
418 | }; |
406 | |
419 | |
407 | //TODO: remove |
420 | //TODO: remove |
408 | char *fgets (char *s, int n, object_thawer &thawer); |
421 | char *fgets (char *s, int n, object_thawer &thawer); |
… | |
… | |
413 | static struct CoroAPI *GCoroAPI; |
426 | static struct CoroAPI *GCoroAPI; |
414 | |
427 | |
415 | static int nready () { return CORO_NREADY; } |
428 | static int nready () { return CORO_NREADY; } |
416 | static int cede () { return CORO_CEDE ; } |
429 | static int cede () { return CORO_CEDE ; } |
417 | |
430 | |
418 | static double (*time)(); |
|
|
419 | static double next_cede; |
431 | static tstamp next_cede; |
420 | static int cede_counter; |
432 | static int cede_counter; |
421 | |
433 | |
422 | static void do_cede_every (); |
434 | static void do_cede_every (); |
423 | static void do_cede_to_tick (); |
435 | static void do_cede_to_tick (); |
424 | static void do_cede_to_tick_every (); |
436 | static void do_cede_to_tick_every (); |
… | |
… | |
427 | { |
439 | { |
428 | if (expect_false (++cede_counter >= count)) |
440 | if (expect_false (++cede_counter >= count)) |
429 | do_cede_every (); |
441 | do_cede_every (); |
430 | } |
442 | } |
431 | |
443 | |
432 | static void cede_to_tick () |
444 | static bool cede_to_tick () |
433 | { |
445 | { |
434 | if (expect_false (time () >= next_cede)) |
446 | if (expect_true (now () < next_cede)) |
|
|
447 | return false; |
|
|
448 | |
435 | do_cede_to_tick (); |
449 | do_cede_to_tick (); |
|
|
450 | return true; |
436 | } |
451 | } |
437 | |
452 | |
438 | static void cede_to_tick_every (int count) |
453 | static bool cede_to_tick_every (int count) |
439 | { |
454 | { |
440 | if (expect_false (++cede_counter >= count)) |
455 | if (expect_true (++cede_counter < count)) |
|
|
456 | return false; |
|
|
457 | |
441 | cede_to_tick (); |
458 | return cede_to_tick (); |
442 | } |
459 | } |
443 | |
460 | |
444 | static void wait_for_tick (); |
461 | static void wait_for_tick (); |
445 | static void wait_for_tick_begin (); |
462 | static void wait_for_tick_begin (); |
446 | }; |
463 | }; |