1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra is free software: you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
7 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
9 | * option) any later version. |
12 | * |
10 | * |
13 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License 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 |
16 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
20 | * |
19 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
21 | */ |
23 | |
22 | |
24 | // |
23 | // |
25 | // cfperl.h perl interface |
24 | // cfperl.h perl interface |
26 | // |
25 | // |
27 | #ifndef CFPERL_H__ |
26 | #ifndef CFPERL_H__ |
28 | #define CFPERL_H__ |
27 | #define CFPERL_H__ |
29 | |
28 | |
30 | #include <cstdarg> |
|
|
31 | #include <cstdio> |
|
|
32 | #include <bitset> |
|
|
33 | |
|
|
34 | using namespace std; |
29 | using namespace std; |
35 | |
30 | |
36 | #include <EXTERN.h> |
31 | #include <EXTERN.h> |
37 | #include <perl.h> |
32 | #include <perl.h> |
38 | #include <XSUB.h> |
33 | #include <XSUB.h> |
… | |
… | |
50 | // optimisations/workaround for functions requiring my_perl in scope (anti-bloat) |
45 | // optimisations/workaround for functions requiring my_perl in scope (anti-bloat) |
51 | #undef localtime |
46 | #undef localtime |
52 | #undef srand48 |
47 | #undef srand48 |
53 | #undef drand48 |
48 | #undef drand48 |
54 | #undef srandom |
49 | #undef srandom |
|
|
50 | #undef opendir |
55 | #undef readdir |
51 | #undef readdir |
|
|
52 | #undef closedir |
56 | #undef getprotobyname |
53 | #undef getprotobyname |
57 | #undef gethostbyname |
54 | #undef gethostbyname |
58 | #undef ctime |
55 | #undef ctime |
59 | #undef strerror |
56 | #undef strerror |
60 | #undef _ |
57 | #undef _ |
… | |
… | |
81 | |
78 | |
82 | #define CHECK_ERROR \ |
79 | #define CHECK_ERROR \ |
83 | if (SvTRUE (ERRSV)) \ |
80 | if (SvTRUE (ERRSV)) \ |
84 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
81 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
85 | |
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 |
86 | #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) |
87 | #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 |
88 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
91 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
89 | #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; |
90 | #define CALL_END CHECK_ERROR; FREETMPS; LEAVE |
93 | #define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE; CALL_POP |
91 | |
94 | |
92 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
95 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
93 | |
96 | |
94 | void cfperl_init (); |
97 | void cfperl_init (); |
95 | void cfperl_main (); |
98 | void cfperl_main (); |
96 | void cfperl_tick (); |
99 | void cfperl_tick (); |
97 | void cfperl_emergency_save (); |
100 | void cfperl_emergency_save (); |
98 | void cfperl_cleanup (int make_core); |
101 | void cfperl_cleanup (int make_core); |
99 | void cfperl_make_book (object *book, int level); |
102 | void cfperl_make_book (object *book, int level); |
100 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
103 | void cfperl_send_msg (client *ns, int color, const_utf8_string type, const_utf8_string msg); |
101 | int cfperl_can_merge (object *ob1, object *ob2); |
104 | int cfperl_can_merge (object *ob1, object *ob2); |
|
|
105 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
|
|
106 | |
|
|
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); |
102 | |
112 | |
103 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
113 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
104 | |
114 | |
105 | #if IVSIZE >= 8 |
115 | #if IVSIZE >= 8 |
106 | typedef IV val64; |
116 | typedef IV val64; |
… | |
… | |
109 | # define SvVAL64 SvIV |
119 | # define SvVAL64 SvIV |
110 | # define newSVuval64 newSVuv |
120 | # define newSVuval64 newSVuv |
111 | # define SvUVAL64 SvUV |
121 | # define SvUVAL64 SvUV |
112 | #else |
122 | #else |
113 | typedef double val64; |
123 | typedef double val64; |
|
|
124 | typedef double uval64; |
114 | # define newSVval64 newSVnv |
125 | # define newSVval64 newSVnv |
115 | # define SvVAL64 SvNV |
126 | # define SvVAL64 SvNV |
116 | # define newSVuval64 newSVnv |
127 | # define newSVuval64 newSVnv |
117 | # define SvUVAL64 SvNV |
128 | # define SvUVAL64 SvNV |
118 | #endif |
129 | #endif |
… | |
… | |
180 | INTERFACE_CLASS (attachable) |
191 | INTERFACE_CLASS (attachable) |
181 | struct attachable : refcnt_base |
192 | struct attachable : refcnt_base |
182 | { |
193 | { |
183 | static MGVTBL vtbl; |
194 | static MGVTBL vtbl; |
184 | |
195 | |
185 | static unordered_vector<attachable *> mortals; |
|
|
186 | MTH static void check_mortals (); |
|
|
187 | |
|
|
188 | enum { |
196 | enum { |
189 | F_DESTROYED = 0x01, |
197 | F_DESTROYED = 0x01, |
190 | F_DEBUG_TRACE = 0x02, |
198 | F_DEBUG_TRACE = 0x02, |
191 | }; |
199 | }; |
192 | int ACC (RW, flags); |
200 | uint8 ACC (RW, attachable_flags); |
|
|
201 | |
|
|
202 | static unordered_vector<attachable *> mortals; |
|
|
203 | MTH static void check_mortals (); |
193 | |
204 | |
194 | // object is delete'd after the refcount reaches 0 |
205 | // object is delete'd after the refcount reaches 0 |
195 | MTH int refcnt_cnt () const; |
206 | MTH int refcnt_cnt () const; |
196 | // check wether the object has died and destroy |
207 | // check wether the object has died and destroy |
197 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
208 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
… | |
… | |
200 | // this politely asks everybody interested the reduce |
211 | // this politely asks everybody interested the reduce |
201 | // the refcount to 0 as soon as possible. |
212 | // the refcount to 0 as soon as possible. |
202 | MTH void destroy (); |
213 | MTH void destroy (); |
203 | |
214 | |
204 | // return wether an object was destroyed already |
215 | // return wether an object was destroyed already |
205 | 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 (); |
206 | |
220 | |
207 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
221 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
208 | |
222 | |
209 | #if 0 |
223 | #if 0 |
210 | private: |
224 | private: |
… | |
… | |
218 | |
232 | |
219 | 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. |
220 | void optimise (); // possibly save some memory by destroying unneeded data |
234 | void optimise (); // possibly save some memory by destroying unneeded data |
221 | |
235 | |
222 | attachable () |
236 | attachable () |
223 | : flags (0), self (0), cb (0), attach (0) |
237 | : attachable_flags (0), self (0), cb (0), attach (0) |
224 | { |
238 | { |
225 | } |
239 | } |
226 | |
240 | |
227 | attachable (const attachable &src) |
241 | attachable (const attachable &src) |
228 | : flags (0), self (0), cb (0), attach (src.attach) |
242 | : attachable_flags (0), self (0), cb (0), attach (src.attach) |
229 | { |
243 | { |
230 | } |
244 | } |
231 | |
245 | |
232 | // set a custom key to the given value, or delete it if value = 0 |
246 | // set a custom key to the given value, or delete it if value = 0 |
233 | void set_key (const char *key, const char *value = 0, bool is_utf8 = 0); |
247 | void set_key (const_utf8_string key, const_utf8_string value = 0, bool is_utf8 = 0); |
234 | |
248 | |
235 | void set_key_text (const char *key, const char *value = 0) |
249 | void set_key_text (const_utf8_string key, const_utf8_string value = 0) |
236 | { |
250 | { |
237 | set_key (key, value, 1); |
251 | set_key (key, value, 1); |
238 | } |
252 | } |
239 | |
253 | |
240 | void set_key_data (const char *key, const char *value = 0) |
254 | void set_key_data (const_utf8_string key, const_utf8_string value = 0) |
241 | { |
255 | { |
242 | set_key (key, value, 0); |
256 | set_key (key, value, 0); |
243 | } |
257 | } |
244 | |
258 | |
245 | attachable &operator =(const attachable &src); |
259 | attachable &operator =(const attachable &src); |
246 | |
260 | |
247 | // used to _quickly_ device wether to shortcut the evaluation |
261 | // used to _quickly_ decide wether to shortcut the evaluation |
248 | bool should_invoke (event_type event) |
262 | bool should_invoke (event_type event) |
249 | { |
263 | { |
250 | return ev_want_event [event] || cb; |
264 | return ev_want_event [event] || cb; |
251 | } |
265 | } |
252 | |
266 | |
… | |
… | |
274 | |
288 | |
275 | extern struct global gbl_ev; |
289 | extern struct global gbl_ev; |
276 | |
290 | |
277 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
291 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
278 | |
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 | |
279 | INTERFACE_CLASS(object_freezer) |
317 | INTERFACE_CLASS(object_freezer) |
280 | struct object_freezer : dynbuf_text |
318 | struct object_freezer : dynbuf_text |
281 | { |
319 | { |
282 | AV *av; |
320 | AV *av; |
283 | |
321 | |
284 | object_freezer (); |
322 | object_freezer (); |
285 | ~object_freezer (); |
323 | ~object_freezer (); |
286 | |
324 | |
|
|
325 | // serialise perl part |
287 | void put (attachable *ext); |
326 | void put_ (attachable *ext); |
288 | |
327 | void put (attachable *ext) |
289 | // used only for user-defined key-value pairs |
|
|
290 | void put (const shstr &k, const shstr &v) |
|
|
291 | { |
328 | { |
292 | add (k); |
329 | if (expect_false (ext->self)) |
|
|
330 | put_ (ext); |
|
|
331 | } |
293 | |
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 | { |
294 | if (expect_true (v)) |
351 | if (expect_true (v)) |
295 | add (' '), add (v); |
352 | put (k, keyword_string (v, strlen (v))); |
296 | |
353 | else |
297 | add ('\n'); |
354 | put (k); |
298 | } |
355 | } |
299 | |
356 | |
300 | template<typename T> |
357 | void put (const keyword_string k, shstr_tmp v) |
301 | void put_kw_string (keyword k, const T &v) |
|
|
302 | { |
358 | { |
303 | int klen = keyword_len [k]; |
359 | put (k, keyword_string (v)); |
304 | int vlen = v ? strlen (v) + 1 : 0; |
|
|
305 | |
|
|
306 | char *p = (char *)alloc (klen + vlen + 1); |
|
|
307 | |
|
|
308 | memcpy (p, keyword_str [k], klen); p += klen; |
|
|
309 | |
|
|
310 | if (expect_true (v)) |
|
|
311 | { |
|
|
312 | *p++ = ' '; vlen--; |
|
|
313 | memcpy (p, v, vlen); p += vlen; |
|
|
314 | } |
|
|
315 | |
|
|
316 | *p = '\n'; |
|
|
317 | } |
360 | } |
318 | |
361 | |
319 | void put (keyword k, const char *v = 0) |
|
|
320 | { |
|
|
321 | put_kw_string (k, v); |
|
|
322 | } |
|
|
323 | |
|
|
324 | void put (keyword k, const shstr &v) |
|
|
325 | { |
|
|
326 | put_kw_string (k, v); |
|
|
327 | } |
|
|
328 | |
|
|
329 | void put (keyword k, double v) |
362 | void put (const keyword_string k, double v) |
330 | { |
363 | { |
331 | force (MAX_KEYWORD_LEN + 2 + 32); |
364 | char *p = force (MAX_KEYWORD_LEN + 2 + 32); |
332 | fadd (keyword_str [k], keyword_len [k]); |
365 | memcpy (p, k.s, k.l); p += k.l; *p++ = ' '; |
333 | fadd (' '); |
366 | p += sprintf (p, "%.7g", v); *p++ = '\n'; |
334 | falloc (sprintf (ptr, "%.7g", v)); |
367 | alloc (p); |
335 | fadd ('\n'); |
|
|
336 | } |
368 | } |
337 | |
369 | |
338 | void put_(keyword k, sint64 v) |
370 | void put_(const keyword_string k, sint64 v) |
339 | { |
371 | { |
340 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
372 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
341 | fadd (keyword_str [k], keyword_len [k]); |
373 | fadd (k.s, k.l); |
342 | fadd (' '); |
374 | fadd (' '); |
343 | add (v); |
375 | add (v); |
344 | fadd ('\n'); |
376 | fadd ('\n'); |
345 | } |
377 | } |
346 | |
378 | |
347 | void put_(keyword k, sint32 v) |
379 | void put_(const keyword_string k, sint32 v) |
348 | { |
380 | { |
349 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
381 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
350 | fadd (keyword_str [k], keyword_len [k]); |
382 | fadd (k.s, k.l); |
351 | fadd (' '); |
383 | fadd (' '); |
352 | add (v); |
384 | add (v); |
353 | fadd ('\n'); |
385 | fadd ('\n'); |
354 | } |
386 | } |
355 | |
387 | |
356 | void put (keyword k, float v) { put (k, (double)v); } |
388 | void put (const keyword_string k, float v) { put (k, (double)v); } |
357 | 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); } |
358 | 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); } |
359 | 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); } |
360 | 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); } |
361 | 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); } |
362 | 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); } |
363 | 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); } |
364 | 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); } |
365 | 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); } |
366 | 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); } |
367 | |
399 | |
368 | void put (keyword kbeg, keyword kend, const shstr &v) |
400 | void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v) |
369 | { |
401 | { |
370 | force (MAX_KEYWORD_LEN + 1); |
402 | force (MAX_KEYWORD_LEN + 1); |
371 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
403 | fadd (kbeg.s, kbeg.l); fadd ('\n'); |
372 | |
404 | |
373 | if (expect_true (v)) |
405 | if (expect_true (v)) |
374 | { |
406 | { |
375 | add (v); |
407 | add (v); |
376 | add ('\n'); |
408 | add ('\n'); |
377 | } |
409 | } |
378 | |
410 | |
379 | force (MAX_KEYWORD_LEN + 1); |
411 | force (MAX_KEYWORD_LEN + 1); |
380 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
412 | fadd (kend.s, kend.l); fadd ('\n'); |
381 | } |
413 | } |
382 | |
414 | |
383 | void put (keyword k, archetype *v); |
415 | void put (const keyword_string k, archetype *v); |
384 | void put (keyword k, treasurelist *v); |
416 | void put (const keyword_string k, treasurelist *v); |
385 | void put (keyword k, faceinfo *v); |
417 | void put (const keyword_string k, faceinfo *v); |
386 | |
418 | |
387 | template<typename T> |
419 | template<typename T> |
388 | void put (keyword k, const refptr<T> &v) |
420 | void put (const keyword_string k, const refptr<T> &v) |
389 | { |
421 | { |
390 | put (k, (T *)v); |
422 | put (k, (T *)v); |
391 | } |
423 | } |
392 | |
424 | |
393 | MTH bool save (const_octet_string path); |
425 | MTH bool save (const_octet_string path); |
394 | char *as_string (); // like strdup |
426 | utf8_string as_string (); // like strdup |
395 | |
427 | |
396 | operator bool () { return !!av; } |
428 | operator bool () { return !!av; } |
397 | }; |
429 | }; |
398 | |
430 | |
399 | INTERFACE_CLASS(object_thawer) |
431 | INTERFACE_CLASS(object_thawer) |
… | |
… | |
409 | const 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 |
410 | const char *name; |
442 | const char *name; |
411 | |
443 | |
412 | operator bool () const { return !!text; } |
444 | operator bool () const { return !!text; } |
413 | |
445 | |
414 | object_thawer (const char *path = 0); |
446 | object_thawer (const_utf8_string path = 0); |
415 | object_thawer (const char *data, AV *perlav); |
447 | object_thawer (const_utf8_string data, AV *perlav); |
416 | ~object_thawer (); |
448 | ~object_thawer (); |
417 | |
449 | |
418 | void get (attachable *obj, int oid); |
450 | void get (attachable *obj, int oid); |
419 | |
451 | |
420 | // parse next line |
452 | // parse next line |
… | |
… | |
422 | // skip the current key-value (usually fetch next line, for |
454 | // skip the current key-value (usually fetch next line, for |
423 | // multiline-fields, skips till the corresponding end-kw |
455 | // multiline-fields, skips till the corresponding end-kw |
424 | MTH void skip (); |
456 | MTH void skip (); |
425 | MTH void skip_block (); // skips till and over KW_end |
457 | MTH void skip_block (); // skips till and over KW_end |
426 | |
458 | |
427 | 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 |
428 | void get_ml (keyword kend, shstr &sh); |
461 | void get_ml (keyword kend, shstr &sh); |
429 | |
462 | |
430 | void get_ornull (shstr &sh) const { sh = value; } |
463 | void get_ornull (shstr &sh) const { sh = value; } |
431 | 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 |
432 | |
465 | |
… | |
… | |
446 | void get (sint32 &i) { i = get_sint32 (); } |
479 | void get (sint32 &i) { i = get_sint32 (); } |
447 | |
480 | |
448 | void get (uint32 &i) { i = get_sint64 (); } |
481 | void get (uint32 &i) { i = get_sint64 (); } |
449 | void get (sint64 &i) { i = get_sint64 (); } |
482 | void get (sint64 &i) { i = get_sint64 (); } |
450 | |
483 | |
451 | MTH void parse_warn (const char *msg); |
484 | MTH void parse_warn (const_utf8_string msg); |
452 | MTH 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); |
453 | |
486 | |
454 | struct delayed_ref { |
487 | struct delayed_ref { |
455 | attachable *op; |
488 | attachable *op; |
456 | object_ptr *ptr; |
489 | object_ptr *ptr; |
457 | const char *ref; |
490 | const_utf8_string ref; |
458 | }; |
491 | }; |
459 | std::vector<delayed_ref> delrefs; |
492 | std::vector<delayed_ref> delrefs; |
460 | |
493 | |
461 | void delayed_deref (attachable *op, object_ptr &ptr, const char *ref); |
494 | void delayed_deref (attachable *op, object_ptr &ptr, const_utf8_string ref); |
462 | MTH void resolve_delayed_derefs (bool deref = true); |
495 | MTH void resolve_delayed_derefs (bool deref = true); |
463 | }; |
496 | }; |
464 | |
497 | |
465 | //TODO: remove |
498 | //TODO: remove |
466 | char *fgets (char *s, int n, object_thawer &thawer); |
499 | char *fgets (char *s, int n, object_thawer &thawer); |