1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
5 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * under the terms of the GNU General Public License as published by the Free |
7 | * the terms of the Affero GNU General Public License as published by the |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * any later version. |
9 | * option) any later version. |
12 | * |
10 | * |
13 | * This program is distributed in the hope that it will be useful, but |
11 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * for more details. |
14 | * GNU General Public License for more details. |
17 | * |
15 | * |
18 | * You should have received a copy of the GNU General Public License along |
16 | * You should have received a copy of the Affero GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
17 | * and the GNU General Public License along with this program. If not, see |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
18 | * <http://www.gnu.org/licenses/>. |
21 | * |
19 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
21 | */ |
24 | |
22 | |
25 | // |
23 | // |
26 | // cfperl.h perl interface |
24 | // cfperl.h perl interface |
27 | // |
25 | // |
28 | #ifndef CFPERL_H__ |
26 | #ifndef CFPERL_H__ |
29 | #define CFPERL_H__ |
27 | #define CFPERL_H__ |
30 | |
28 | |
31 | #include <cstdarg> |
|
|
32 | #include <cstdio> |
|
|
33 | #include <bitset> |
|
|
34 | |
|
|
35 | using namespace std; |
29 | using namespace std; |
36 | |
30 | |
37 | #include <EXTERN.h> |
31 | #include <EXTERN.h> |
38 | #include <perl.h> |
32 | #include <perl.h> |
39 | #include <XSUB.h> |
33 | #include <XSUB.h> |
40 | |
34 | |
41 | #include <EventAPI.h> |
35 | #include <EVAPI.h> |
42 | #include <CoroAPI.h> |
36 | #include <CoroAPI.h> |
43 | |
37 | |
44 | #include "util.h" |
38 | #include "util.h" |
45 | #include "keyword.h" |
39 | #include "keyword.h" |
46 | #include "dynbuf.h" |
40 | #include "dynbuf.h" |
… | |
… | |
51 | // optimisations/workaround for functions requiring my_perl in scope (anti-bloat) |
45 | // optimisations/workaround for functions requiring my_perl in scope (anti-bloat) |
52 | #undef localtime |
46 | #undef localtime |
53 | #undef srand48 |
47 | #undef srand48 |
54 | #undef drand48 |
48 | #undef drand48 |
55 | #undef srandom |
49 | #undef srandom |
|
|
50 | #undef opendir |
56 | #undef readdir |
51 | #undef readdir |
|
|
52 | #undef closedir |
57 | #undef getprotobyname |
53 | #undef getprotobyname |
58 | #undef gethostbyname |
54 | #undef gethostbyname |
59 | #undef ctime |
55 | #undef ctime |
60 | #undef strerror |
56 | #undef strerror |
|
|
57 | #undef _ |
61 | |
58 | |
62 | // same here, massive symbol spamming |
59 | // same here, massive symbol spamming |
63 | #undef do_open |
60 | #undef do_open |
64 | #undef do_close |
61 | #undef do_close |
65 | #undef ref |
62 | #undef ref |
… | |
… | |
70 | #undef random |
67 | #undef random |
71 | #undef crypt |
68 | #undef crypt |
72 | |
69 | |
73 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
70 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
74 | |
71 | |
|
|
72 | #define _(msg) (msg) |
|
|
73 | #define N_(msg) (msg) |
|
|
74 | |
|
|
75 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
|
|
76 | |
75 | // some macros to simplify perl in-calls |
77 | // some macros to simplify perl in-calls |
76 | |
78 | |
77 | #define CHECK_ERROR \ |
79 | #define CHECK_ERROR \ |
78 | if (SvTRUE (ERRSV)) \ |
80 | if (SvTRUE (ERRSV)) \ |
79 | LOG (llevError, "runtime error in %s: %s\n", __func__, SvPVutf8_nolen (ERRSV)); |
81 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
80 | |
82 | |
|
|
83 | inline int call_pvsv (const char *ob, I32 flags) { return call_pv (ob, flags); } |
|
|
84 | inline int call_pvsv (SV *ob, I32 flags) { return call_sv (ob, flags); } |
|
|
85 | |
|
|
86 | // TODO: temporarily enabled pushstack/popstack for all calls from the core, to maybe fix object memleak? |
|
|
87 | #define CALL_PUSH PUSHSTACKi (PERLSI_UNKNOWN) |
|
|
88 | #define CALL_POP PUTBACK; POPSTACK; SPAGAIN |
81 | #define CALL_BEGIN(args) dSP; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) |
89 | #define CALL_BEGIN(args) dSP; CALL_PUSH; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) |
82 | #define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc |
90 | #define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc |
83 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
91 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
84 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pv (name, (flags) | G_EVAL); SPAGAIN; |
92 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pvsv (name, (flags) | G_EVAL); SPAGAIN; |
85 | #define CALL_END CHECK_ERROR; FREETMPS; LEAVE |
93 | #define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE; CALL_POP |
86 | |
94 | |
87 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
95 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
88 | |
96 | |
89 | void cfperl_init (); |
97 | void cfperl_init (); |
90 | void cfperl_main (); |
98 | void cfperl_main (); |
|
|
99 | void cfperl_tick (); |
91 | void cfperl_emergency_save (); |
100 | void cfperl_emergency_save (); |
92 | void cfperl_cleanup (int make_core); |
101 | void cfperl_cleanup (int make_core); |
93 | void cfperl_make_book (object *book, int level); |
102 | void cfperl_make_book (object *book, int level); |
|
|
103 | void cfperl_send_msg (client *ns, int color, const_utf8_string type, const_utf8_string msg); |
|
|
104 | int cfperl_can_merge (object *ob1, object *ob2); |
|
|
105 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
94 | |
106 | |
95 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
107 | bool is_match_expr (const_utf8_string expr); |
|
|
108 | // applies the match expression and returns true if it matches |
|
|
109 | bool match (const_utf8_string expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
|
|
110 | // same as above, but returns the first object found, or 0 |
|
|
111 | object *match_one (const_utf8_string expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
96 | |
112 | |
|
|
113 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
|
|
114 | |
|
|
115 | #if IVSIZE >= 8 |
|
|
116 | typedef IV val64; |
|
|
117 | typedef IV uval64; |
|
|
118 | # define newSVval64 newSViv |
|
|
119 | # define SvVAL64 SvIV |
|
|
120 | # define newSVuval64 newSVuv |
|
|
121 | # define SvUVAL64 SvUV |
|
|
122 | #else |
|
|
123 | typedef double val64; |
|
|
124 | typedef double uval64; |
|
|
125 | # define newSVval64 newSVnv |
|
|
126 | # define SvVAL64 SvNV |
|
|
127 | # define newSVuval64 newSVnv |
|
|
128 | # define SvUVAL64 SvNV |
|
|
129 | #endif |
|
|
130 | |
97 | // virtual server time, excluding time jumps and lag |
131 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
98 | extern double runtime; |
132 | extern tstamp NOW; // real time of current server tick |
99 | |
133 | |
100 | enum event_klass |
134 | enum event_klass |
101 | { |
135 | { |
102 | KLASS_NONE, |
136 | KLASS_NONE, |
103 | KLASS_GLOBAL, |
137 | KLASS_GLOBAL, |
… | |
… | |
153 | int cfperl_result_INT (int idx); |
187 | int cfperl_result_INT (int idx); |
154 | |
188 | |
155 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
189 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
156 | |
190 | |
157 | INTERFACE_CLASS (attachable) |
191 | INTERFACE_CLASS (attachable) |
158 | struct attachable |
192 | struct attachable : refcnt_base |
159 | { |
193 | { |
160 | static MGVTBL vtbl; |
194 | static MGVTBL vtbl; |
161 | |
|
|
162 | static unordered_vector<attachable *> mortals; |
|
|
163 | MTH static void check_mortals (); |
|
|
164 | |
195 | |
165 | enum { |
196 | enum { |
166 | F_DESTROYED = 0x01, |
197 | F_DESTROYED = 0x01, |
167 | F_DEBUG_TRACE = 0x02, |
198 | F_DEBUG_TRACE = 0x02, |
168 | }; |
199 | }; |
|
|
200 | uint8 ACC (RW, attachable_flags); |
|
|
201 | |
|
|
202 | static unordered_vector<attachable *> mortals; |
|
|
203 | MTH static void check_mortals (); |
169 | |
204 | |
170 | // object is delete'd after the refcount reaches 0 |
205 | // object is delete'd after the refcount reaches 0 |
171 | int ACC (RW, flags); |
|
|
172 | mutable int ACC (RW, refcnt); |
|
|
173 | |
|
|
174 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
175 | MTH void refcnt_dec () const { --refcnt; } |
|
|
176 | |
|
|
177 | MTH int refcnt_cnt () const; |
206 | MTH int refcnt_cnt () const; |
178 | // check wether the object has died and destroy |
207 | // check wether the object has died and destroy |
179 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
208 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
180 | |
209 | |
181 | // destroy the object unless it was already destroyed |
210 | // destroy the object unless it was already destroyed |
182 | // this politely asks everybody interested the reduce |
211 | // this politely asks everybody interested the reduce |
183 | // the refcount to 0 as soon as possible. |
212 | // the refcount to 0 as soon as possible. |
184 | MTH void destroy (); |
213 | MTH void destroy (); |
185 | |
214 | |
186 | // return wether an object was destroyed already |
215 | // return wether an object was destroyed already |
187 | MTH bool destroyed () const { return flags & F_DESTROYED; } |
216 | MTH bool destroyed () const { return attachable_flags & F_DESTROYED; } |
|
|
217 | |
|
|
218 | // destruct and free the memory for this object |
|
|
219 | virtual void do_delete (); |
188 | |
220 | |
189 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
221 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
190 | |
222 | |
191 | #if 0 |
223 | #if 0 |
192 | private: |
224 | private: |
… | |
… | |
200 | |
232 | |
201 | void sever_self (); // sever this object from its self, if it has one. |
233 | void sever_self (); // sever this object from its self, if it has one. |
202 | void optimise (); // possibly save some memory by destroying unneeded data |
234 | void optimise (); // possibly save some memory by destroying unneeded data |
203 | |
235 | |
204 | attachable () |
236 | attachable () |
205 | : flags (0), refcnt (0), self (0), cb (0), attach (0) |
237 | : attachable_flags (0), self (0), cb (0), attach (0) |
206 | { |
238 | { |
207 | } |
239 | } |
208 | |
240 | |
209 | attachable (const attachable &src) |
241 | attachable (const attachable &src) |
210 | : flags (0), refcnt (0), self (0), cb (0), attach (src.attach) |
242 | : attachable_flags (0), self (0), cb (0), attach (src.attach) |
211 | { |
243 | { |
212 | } |
244 | } |
213 | |
245 | |
214 | virtual ~attachable (); |
246 | // set a custom key to the given value, or delete it if value = 0 |
|
|
247 | void set_key (const_utf8_string key, const_utf8_string value = 0, bool is_utf8 = 0); |
|
|
248 | |
|
|
249 | void set_key_text (const_utf8_string key, const_utf8_string value = 0) |
|
|
250 | { |
|
|
251 | set_key (key, value, 1); |
|
|
252 | } |
|
|
253 | |
|
|
254 | void set_key_data (const_utf8_string key, const_utf8_string value = 0) |
|
|
255 | { |
|
|
256 | set_key (key, value, 0); |
|
|
257 | } |
215 | |
258 | |
216 | attachable &operator =(const attachable &src); |
259 | attachable &operator =(const attachable &src); |
217 | |
260 | |
218 | // used to _quickly_ device wether to shortcut the evaluation |
261 | // used to _quickly_ decide wether to shortcut the evaluation |
219 | bool should_invoke (event_type event) |
262 | bool should_invoke (event_type event) |
220 | { |
263 | { |
221 | return ev_want_event [event] || cb; |
264 | return ev_want_event [event] || cb; |
222 | } |
265 | } |
223 | |
266 | |
… | |
… | |
230 | // do the real refcount checking work |
273 | // do the real refcount checking work |
231 | void do_check (); |
274 | void do_check (); |
232 | |
275 | |
233 | // the method that does the real destroy work |
276 | // the method that does the real destroy work |
234 | virtual void do_destroy (); |
277 | virtual void do_destroy (); |
|
|
278 | |
|
|
279 | // destructor is protected, should not be called by anybody |
|
|
280 | virtual ~attachable (); |
235 | }; |
281 | }; |
236 | |
282 | |
237 | // the global object is a pseudo object that cares for the global events |
283 | // the global object is a pseudo object that cares for the global events |
238 | struct global : attachable |
284 | struct global : attachable |
239 | { |
285 | { |
… | |
… | |
242 | |
288 | |
243 | extern struct global gbl_ev; |
289 | extern struct global gbl_ev; |
244 | |
290 | |
245 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
291 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
246 | |
292 | |
|
|
293 | // a little dirty hack, maybe unify with something else at a later time |
|
|
294 | struct keyword_string |
|
|
295 | { |
|
|
296 | const char *s; |
|
|
297 | const int l; |
|
|
298 | |
|
|
299 | keyword_string (const char *s, int l) |
|
|
300 | : s(s), l(l) |
|
|
301 | { } |
|
|
302 | |
|
|
303 | keyword_string (keyword kw) |
|
|
304 | : s(keyword_str [kw]), l(keyword_len [kw]) |
|
|
305 | { |
|
|
306 | } |
|
|
307 | |
|
|
308 | keyword_string (shstr_tmp sh) |
|
|
309 | : s(&sh), l(sh.length ()) |
|
|
310 | { |
|
|
311 | } |
|
|
312 | }; |
|
|
313 | |
|
|
314 | #define CS(keyword) keyword_string (# keyword, sizeof (# keyword) - 1) |
|
|
315 | #define KW(keyword) CS(keyword) |
|
|
316 | |
|
|
317 | INTERFACE_CLASS(object_freezer) |
247 | struct object_freezer : dynbuf_text |
318 | struct object_freezer : dynbuf_text |
248 | { |
319 | { |
249 | AV *av; |
320 | AV *av; |
250 | |
321 | |
251 | object_freezer (); |
322 | object_freezer (); |
252 | ~object_freezer (); |
323 | ~object_freezer (); |
253 | |
324 | |
|
|
325 | // serialise perl part |
254 | void put (attachable *ext); |
326 | void put_ (attachable *ext); |
255 | |
327 | void put (attachable *ext) |
256 | // used only for user-defined key-value pairs |
|
|
257 | void put (const shstr &k, const shstr &v) |
|
|
258 | { |
328 | { |
259 | add (k); |
329 | if (expect_false (ext->self)) |
|
|
330 | put_ (ext); |
|
|
331 | } |
260 | |
332 | |
|
|
333 | // null value (== no space after keyword) |
|
|
334 | void put (const keyword_string k) |
|
|
335 | { |
|
|
336 | char *p = force (k.l + 1); |
|
|
337 | memcpy (p, k.s, k.l); p += k.l; *p++ = '\n'; |
|
|
338 | alloc (p); |
|
|
339 | } |
|
|
340 | |
|
|
341 | void put (const keyword_string k, const keyword_string v) |
|
|
342 | { |
|
|
343 | char *p = force (k.l + 1 + v.l + 1); |
|
|
344 | memcpy (p, k.s, k.l); p += k.l; *p++ = ' '; |
|
|
345 | memcpy (p, v.s, v.l); p += v.l; *p++ = '\n'; |
|
|
346 | alloc (p); |
|
|
347 | } |
|
|
348 | |
|
|
349 | void put (const keyword_string k, const_utf8_string v) |
|
|
350 | { |
261 | if (expect_true (v)) |
351 | if (expect_true (v)) |
262 | add (' '), add (v); |
352 | put (k, keyword_string (v, strlen (v))); |
263 | |
353 | else |
264 | add ('\n'); |
354 | put (k); |
265 | } |
355 | } |
266 | |
356 | |
267 | template<typename T> |
357 | void put (const keyword_string k, shstr_tmp v) |
268 | void put_string (keyword k, const T &v) |
|
|
269 | { |
358 | { |
270 | int klen = keyword_len [k]; |
359 | put (k, keyword_string (v)); |
271 | int vlen = v ? strlen (v) + 1 : 0; |
|
|
272 | |
|
|
273 | char *p = (char *)alloc (klen + vlen + 1); |
|
|
274 | |
|
|
275 | memcpy (p, keyword_str [k], klen); p += klen; |
|
|
276 | |
|
|
277 | if (expect_true (v)) |
|
|
278 | { |
|
|
279 | *p++ = ' '; vlen--; |
|
|
280 | memcpy (p, v, vlen); p += vlen; |
|
|
281 | } |
|
|
282 | |
|
|
283 | *p = '\n'; |
|
|
284 | } |
360 | } |
285 | |
361 | |
286 | void put (keyword k, const char *v = 0) |
|
|
287 | { |
|
|
288 | put_string (k, v); |
|
|
289 | } |
|
|
290 | |
|
|
291 | void put (keyword k, const shstr &v) |
|
|
292 | { |
|
|
293 | put_string (k, v); |
|
|
294 | } |
|
|
295 | |
|
|
296 | void put (keyword k, double v) |
362 | void put (const keyword_string k, double v) |
297 | { |
363 | { |
298 | force (MAX_KEYWORD_LEN + 2 + 32); |
364 | char *p = force (MAX_KEYWORD_LEN + 2 + 32); |
299 | fadd (keyword_str [k], keyword_len [k]); |
365 | memcpy (p, k.s, k.l); p += k.l; *p++ = ' '; |
300 | fadd (' '); |
366 | p += sprintf (p, "%.7g", v); *p++ = '\n'; |
301 | falloc (sprintf (ptr, "%.7g", v)); |
367 | alloc (p); |
302 | fadd ('\n'); |
|
|
303 | } |
368 | } |
304 | |
369 | |
305 | void put_(keyword k, sint64 v) |
370 | void put_(const keyword_string k, sint64 v) |
306 | { |
371 | { |
307 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
372 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
308 | fadd (keyword_str [k], keyword_len [k]); |
373 | fadd (k.s, k.l); |
309 | fadd (' '); |
374 | fadd (' '); |
310 | add (v); |
375 | add (v); |
311 | fadd ('\n'); |
376 | fadd ('\n'); |
312 | } |
377 | } |
313 | |
378 | |
314 | void put_(keyword k, sint32 v) |
379 | void put_(const keyword_string k, sint32 v) |
315 | { |
380 | { |
316 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
381 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
317 | fadd (keyword_str [k], keyword_len [k]); |
382 | fadd (k.s, k.l); |
318 | fadd (' '); |
383 | fadd (' '); |
319 | add (v); |
384 | add (v); |
320 | fadd ('\n'); |
385 | fadd ('\n'); |
321 | } |
386 | } |
322 | |
387 | |
323 | void put (keyword k, float v) { put (k, (double)v); } |
388 | void put (const keyword_string k, float v) { put (k, (double)v); } |
324 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
389 | void put (const keyword_string k, signed char v) { put_(k, (sint32)v); } |
325 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
390 | void put (const keyword_string k, unsigned char v) { put_(k, (sint32)v); } |
326 | void put (keyword k, signed short v) { put_(k, (sint32)v); } |
391 | void put (const keyword_string k, signed short v) { put_(k, (sint32)v); } |
327 | void put (keyword k, unsigned short v) { put_(k, (sint32)v); } |
392 | void put (const keyword_string k, unsigned short v) { put_(k, (sint32)v); } |
328 | void put (keyword k, signed int v) { put_(k, (sint32)v); } |
393 | void put (const keyword_string k, signed int v) { put_(k, (sint32)v); } |
329 | void put (keyword k, unsigned int v) { put_(k, (sint64)v); } |
394 | void put (const keyword_string k, unsigned int v) { put_(k, (sint64)v); } |
330 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
395 | void put (const keyword_string k, signed long v) { put_(k, (sint64)v); } |
331 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
396 | void put (const keyword_string k, unsigned long v) { put_(k, (sint64)v); } |
332 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
397 | void put (const keyword_string k, signed long long v) { put_(k, (sint64)v); } |
333 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
398 | void put (const keyword_string k, unsigned long long v) { put_(k, (sint64)v); } |
334 | |
399 | |
335 | void put (keyword kbeg, keyword kend, const shstr &v) |
400 | void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v) |
336 | { |
401 | { |
337 | force (MAX_KEYWORD_LEN + 1); |
402 | force (MAX_KEYWORD_LEN + 1); |
338 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
403 | fadd (kbeg.s, kbeg.l); fadd ('\n'); |
339 | |
404 | |
340 | if (expect_true (v)) |
405 | if (expect_true (v)) |
341 | { |
406 | { |
342 | add (v); |
407 | add (v); |
343 | add ('\n'); |
408 | add ('\n'); |
344 | } |
409 | } |
345 | |
410 | |
346 | force (MAX_KEYWORD_LEN + 1); |
411 | force (MAX_KEYWORD_LEN + 1); |
347 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
412 | fadd (kend.s, kend.l); fadd ('\n'); |
348 | } |
413 | } |
|
|
414 | |
|
|
415 | void put (const keyword_string k, archetype *v); |
|
|
416 | void put (const keyword_string k, treasurelist *v); |
|
|
417 | void put (const keyword_string k, faceinfo *v); |
349 | |
418 | |
350 | template<typename T> |
419 | template<typename T> |
351 | void put (keyword k, const T *v) |
|
|
352 | { |
|
|
353 | put (k, v ? &v->name : (const char *)0); |
|
|
354 | } |
|
|
355 | |
|
|
356 | template<typename T> |
|
|
357 | void put (keyword k, const refptr<T> &v) |
420 | void put (const keyword_string k, const refptr<T> &v) |
358 | { |
421 | { |
359 | put (k, (T *)v); |
422 | put (k, (T *)v); |
360 | } |
423 | } |
361 | |
424 | |
362 | bool save (const char *path); |
425 | MTH bool save (const_octet_string path); |
363 | char *as_string (); // like strdup |
426 | utf8_string as_string (); // like strdup |
364 | |
427 | |
365 | operator bool () { return !!av; } |
428 | operator bool () { return !!av; } |
366 | }; |
429 | }; |
367 | |
430 | |
|
|
431 | INTERFACE_CLASS(object_thawer) |
368 | struct object_thawer |
432 | struct object_thawer |
369 | { |
433 | { |
370 | char *line; // current beginning of line |
434 | char *line; // current beginning of line |
371 | SV *text; // text part |
435 | SV *text; // text part |
372 | AV *av; // perl part |
436 | AV *av; // perl part |
373 | int linenum; |
437 | int linenum; |
374 | keyword kw; |
438 | keyword kw; |
375 | char *kw_str; // the keyword parsed, as string |
439 | char *kw_str; // the keyword parsed, as string |
376 | char *value; // the value, or 0 if no value |
440 | char *value; // the value, or 0 if no value |
377 | char *value_nn; // the value, or the empty string if no value |
441 | const char *value_nn; // the value, or the empty string if no value |
378 | const char *name; |
442 | const char *name; |
379 | |
443 | |
380 | operator bool () { return !!text; } |
444 | operator bool () const { return !!text; } |
381 | |
445 | |
382 | object_thawer (const char *path = 0); |
446 | object_thawer (const_utf8_string path = 0); |
383 | object_thawer (const char *data, AV *perlav); |
447 | object_thawer (const_utf8_string data, AV *perlav); |
384 | ~object_thawer (); |
448 | ~object_thawer (); |
385 | |
449 | |
386 | void get (attachable *obj, int oid); |
450 | void get (attachable *obj, int oid); |
387 | |
451 | |
388 | // parse next line |
452 | // parse next line |
389 | void next (); |
453 | MTH void next (); |
390 | // skip the current key-value (usually fetch next line, for |
454 | // skip the current key-value (usually fetch next line, for |
391 | // multiline-fields, skips till the corresponding end-kw |
455 | // multiline-fields, skips till the corresponding end-kw |
392 | void skip (); |
456 | MTH void skip (); |
|
|
457 | MTH void skip_block (); // skips till and over KW_end |
393 | |
458 | |
394 | char *get_str () { return value; } // may be 0 |
459 | bool has_value () { return value; } |
|
|
460 | const_utf8_string get_str () { return value_nn; } // empty string when missing |
395 | void get_ml (keyword kend, shstr &sh); |
461 | void get_ml (keyword kend, shstr &sh); |
396 | |
462 | |
397 | void get_ornull (shstr &sh) const { sh = value; } |
463 | void get_ornull (shstr &sh) const { sh = value; } |
398 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
464 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
399 | |
465 | |
… | |
… | |
413 | void get (sint32 &i) { i = get_sint32 (); } |
479 | void get (sint32 &i) { i = get_sint32 (); } |
414 | |
480 | |
415 | void get (uint32 &i) { i = get_sint64 (); } |
481 | void get (uint32 &i) { i = get_sint64 (); } |
416 | void get (sint64 &i) { i = get_sint64 (); } |
482 | void get (sint64 &i) { i = get_sint64 (); } |
417 | |
483 | |
|
|
484 | MTH void parse_warn (const_utf8_string msg); |
418 | bool parse_error (const char *type = 0, const char *name = 0, bool skip = true); |
485 | MTH bool parse_error (const_utf8_string type = 0, const_utf8_string name = 0, bool skip = true); |
|
|
486 | |
|
|
487 | struct delayed_ref { |
|
|
488 | attachable *op; |
|
|
489 | object_ptr *ptr; |
|
|
490 | const_utf8_string ref; |
|
|
491 | }; |
|
|
492 | std::vector<delayed_ref> delrefs; |
|
|
493 | |
|
|
494 | void delayed_deref (attachable *op, object_ptr &ptr, const_utf8_string ref); |
|
|
495 | MTH void resolve_delayed_derefs (bool deref = true); |
419 | }; |
496 | }; |
420 | |
497 | |
421 | //TODO: remove |
498 | //TODO: remove |
422 | char *fgets (char *s, int n, object_thawer &thawer); |
499 | char *fgets (char *s, int n, object_thawer &thawer); |
423 | |
500 | |
424 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
501 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
425 | |
502 | |
426 | struct coroapi { |
503 | struct coroapi { |
427 | static struct CoroAPI *GCoroAPI; |
504 | static struct CoroAPI *GCoroAPI; |
428 | |
505 | |
|
|
506 | static EV_ATOMIC_T cede_pending; |
|
|
507 | |
429 | static int nready () { return CORO_NREADY; } |
508 | static int nready () { return CORO_NREADY; } |
430 | static int cede () { return CORO_CEDE ; } |
509 | static int cede () { cede_pending = 0; return CORO_CEDE ; } |
431 | |
510 | |
432 | static double (*time)(); |
|
|
433 | static double next_cede; |
|
|
434 | static int cede_counter; |
|
|
435 | |
|
|
436 | static void do_cede_every (); |
|
|
437 | static void do_cede_to_tick (); |
511 | static void do_cede_to_tick (); |
438 | static void do_cede_to_tick_every (); |
|
|
439 | |
512 | |
440 | static void cede_every (int count) |
513 | // actually cede's far more often |
441 | { |
|
|
442 | if (expect_false (++cede_counter >= count)) |
|
|
443 | do_cede_every (); |
|
|
444 | } |
|
|
445 | |
|
|
446 | static void cede_to_tick () |
514 | static bool cede_to_tick () |
447 | { |
515 | { |
448 | if (expect_false (time () >= next_cede)) |
516 | if (expect_true (!cede_pending)) |
|
|
517 | return false; |
|
|
518 | |
449 | do_cede_to_tick (); |
519 | do_cede_to_tick (); |
450 | } |
520 | return true; |
451 | |
|
|
452 | static void cede_to_tick_every (int count) |
|
|
453 | { |
|
|
454 | if (expect_false (++cede_counter >= count)) |
|
|
455 | cede_to_tick (); |
|
|
456 | } |
521 | } |
457 | |
522 | |
458 | static void wait_for_tick (); |
523 | static void wait_for_tick (); |
459 | static void wait_for_tick_begin (); |
524 | static void wait_for_tick_begin (); |
460 | }; |
525 | }; |
461 | |
526 | |
462 | struct watcher_base |
527 | struct evapi |
463 | { |
528 | { |
464 | static struct EventAPI *GEventAPI; |
529 | static struct EVAPI *GEVAPI; |
465 | }; |
530 | }; |
466 | |
531 | |
467 | template<class base> |
|
|
468 | struct watcher : watcher_base |
|
|
469 | { |
|
|
470 | base *pe; |
|
|
471 | |
|
|
472 | void start (bool repeat = false) { GEventAPI->start ((pe_watcher *)pe, repeat); } |
|
|
473 | void stop (bool cancel_events = false) { GEventAPI->stop ((pe_watcher *)pe, cancel_events); } |
|
|
474 | void now () { GEventAPI->now ((pe_watcher *)pe); } |
|
|
475 | void suspend () { GEventAPI->suspend ((pe_watcher *)pe); } |
|
|
476 | void resume () { GEventAPI->resume ((pe_watcher *)pe); } |
|
|
477 | |
|
|
478 | void prio (int new_prio) { ((pe_watcher *)pe)->prio = new_prio; } |
|
|
479 | |
|
|
480 | ~watcher () |
|
|
481 | { |
|
|
482 | cancel (); |
|
|
483 | } |
|
|
484 | |
|
|
485 | private: |
|
|
486 | void cancel () { GEventAPI->cancel ((pe_watcher *)pe); } // private |
|
|
487 | }; |
|
|
488 | |
|
|
489 | struct iw : watcher<pe_idle>, callback<void (iw &)> |
|
|
490 | { |
|
|
491 | template<class O, class M> |
|
|
492 | iw (O object, M method) |
|
|
493 | : callback<void (iw &)> (object, method) |
|
|
494 | { |
|
|
495 | alloc (); |
|
|
496 | } |
|
|
497 | |
|
|
498 | private: |
|
|
499 | void alloc (); |
|
|
500 | }; |
|
|
501 | |
|
|
502 | struct iow : watcher<pe_io>, callback<void (iow &, int)> |
532 | struct iow : ev_io, evapi, callback<void (iow &, int)> |
503 | { |
533 | { |
|
|
534 | static void thunk (EV_P_ struct ev_io *w_, int revents) |
|
|
535 | { |
|
|
536 | iow &w = *static_cast<iow *>(w_); |
|
|
537 | |
|
|
538 | w (w, revents); |
|
|
539 | } |
|
|
540 | |
504 | template<class O, class M> |
541 | template<class O, class M> |
505 | iow (O object, M method) |
542 | iow (O object, M method) |
506 | : callback<void (iow &, int)> (object, method) |
543 | : callback<void (iow &, int)> (object, method) |
507 | { |
544 | { |
508 | alloc (); |
545 | ev_init ((ev_io *)this, thunk); |
509 | } |
546 | } |
510 | |
547 | |
511 | void fd (int fd); |
548 | void prio (int prio) |
512 | int poll (); |
549 | { |
|
|
550 | ev_set_priority ((ev_io *)this, prio); |
|
|
551 | } |
|
|
552 | |
|
|
553 | void set (int fd, int events) |
|
|
554 | { |
|
|
555 | ev_io_set ((ev_io *)this, fd, events); |
|
|
556 | } |
|
|
557 | |
|
|
558 | int poll () const { return events; } |
|
|
559 | |
513 | void poll (int events); |
560 | void poll (int events); |
514 | |
561 | |
515 | private: |
562 | void start () |
516 | void alloc (); |
563 | { |
|
|
564 | ev_io_start (EV_DEFAULT, (ev_io *)this); |
|
|
565 | } |
|
|
566 | |
|
|
567 | void stop () |
|
|
568 | { |
|
|
569 | ev_io_stop (EV_DEFAULT, (ev_io *)this); |
|
|
570 | } |
|
|
571 | |
|
|
572 | ~iow () |
|
|
573 | { |
|
|
574 | stop (); |
|
|
575 | } |
|
|
576 | }; |
|
|
577 | |
|
|
578 | struct asyncw : ev_async, evapi, callback<void (ev_async &, int)> |
|
|
579 | { |
|
|
580 | static void thunk (EV_P_ struct ev_async *w_, int revents) |
|
|
581 | { |
|
|
582 | asyncw &w = *static_cast<asyncw *>(w_); |
|
|
583 | |
|
|
584 | w (w, revents); |
|
|
585 | } |
|
|
586 | |
|
|
587 | template<class O, class M> |
|
|
588 | asyncw (O object, M method) |
|
|
589 | : callback<void (asyncw &, int)> (object, method) |
|
|
590 | { |
|
|
591 | ev_init ((ev_async *)this, thunk); |
|
|
592 | } |
|
|
593 | |
|
|
594 | void start () |
|
|
595 | { |
|
|
596 | ev_async_start (EV_DEFAULT, (ev_async *)this); |
|
|
597 | } |
|
|
598 | |
|
|
599 | void stop () |
|
|
600 | { |
|
|
601 | ev_async_stop (EV_DEFAULT, (ev_async *)this); |
|
|
602 | } |
|
|
603 | |
|
|
604 | ~asyncw () |
|
|
605 | { |
|
|
606 | stop (); |
|
|
607 | } |
517 | }; |
608 | }; |
518 | |
609 | |
519 | #endif |
610 | #endif |
520 | |
611 | |