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 | |
|
|
30 | #include <cstdarg> |
|
|
31 | #include <cstdio> |
|
|
32 | #include <bitset> |
|
|
33 | |
28 | |
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> |
… | |
… | |
83 | |
78 | |
84 | #define CHECK_ERROR \ |
79 | #define CHECK_ERROR \ |
85 | if (SvTRUE (ERRSV)) \ |
80 | if (SvTRUE (ERRSV)) \ |
86 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
81 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
87 | |
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 | |
88 | #define CALL_BEGIN(args) dSP; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) |
86 | #define CALL_BEGIN(args) dSP; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) |
89 | #define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc |
87 | #define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc |
90 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
88 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
91 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pv (name, (flags) | G_EVAL); SPAGAIN; |
89 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pvsv (name, (flags) | G_EVAL); SPAGAIN; |
92 | #define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE |
90 | #define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE |
93 | |
91 | |
94 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
92 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
95 | |
93 | |
96 | void cfperl_init (); |
94 | void cfperl_init (); |
97 | void cfperl_main (); |
95 | void cfperl_main (); |
98 | void cfperl_tick (); |
96 | void cfperl_tick (); |
99 | void cfperl_emergency_save (); |
97 | void cfperl_emergency_save (); |
100 | void cfperl_cleanup (int make_core); |
98 | void cfperl_cleanup (int make_core); |
101 | void cfperl_make_book (object *book, int level); |
99 | void cfperl_make_book (object *book, int level); |
102 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
100 | void cfperl_send_msg (client *ns, int color, const_utf8_string type, const_utf8_string msg); |
103 | int cfperl_can_merge (object *ob1, object *ob2); |
101 | int cfperl_can_merge (object *ob1, object *ob2); |
104 | void cfperl_mapscript_activate (object *ob, bool state, object *activator, object *originator = 0); |
102 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
|
|
103 | |
|
|
104 | bool is_match_expr (const_utf8_string expr); |
|
|
105 | // applies the match expression and returns true if it matches |
|
|
106 | bool match (const_utf8_string expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
|
|
107 | // same as above, but returns the first object found, or 0 |
|
|
108 | object *match_one (const_utf8_string expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
105 | |
109 | |
106 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
110 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
107 | |
111 | |
108 | #if IVSIZE >= 8 |
112 | #if IVSIZE >= 8 |
109 | typedef IV val64; |
113 | typedef IV val64; |
… | |
… | |
188 | |
192 | |
189 | enum { |
193 | enum { |
190 | F_DESTROYED = 0x01, |
194 | F_DESTROYED = 0x01, |
191 | F_DEBUG_TRACE = 0x02, |
195 | F_DEBUG_TRACE = 0x02, |
192 | }; |
196 | }; |
193 | uint8 ACC (RW, flags); |
197 | uint8 ACC (RW, attachable_flags); |
194 | |
198 | |
195 | static unordered_vector<attachable *> mortals; |
199 | static unordered_vector<attachable *> mortals; |
196 | MTH static void check_mortals (); |
200 | MTH static void check_mortals (); |
197 | |
201 | |
198 | // object is delete'd after the refcount reaches 0 |
202 | // object is delete'd after the refcount reaches 0 |
… | |
… | |
204 | // this politely asks everybody interested the reduce |
208 | // this politely asks everybody interested the reduce |
205 | // the refcount to 0 as soon as possible. |
209 | // the refcount to 0 as soon as possible. |
206 | MTH void destroy (); |
210 | MTH void destroy (); |
207 | |
211 | |
208 | // return wether an object was destroyed already |
212 | // return wether an object was destroyed already |
209 | MTH bool destroyed () const { return flags & F_DESTROYED; } |
213 | MTH bool destroyed () const { return attachable_flags & F_DESTROYED; } |
210 | |
214 | |
211 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
215 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
212 | |
216 | |
213 | #if 0 |
217 | #if 0 |
214 | private: |
218 | private: |
… | |
… | |
222 | |
226 | |
223 | void sever_self (); // sever this object from its self, if it has one. |
227 | void sever_self (); // sever this object from its self, if it has one. |
224 | void optimise (); // possibly save some memory by destroying unneeded data |
228 | void optimise (); // possibly save some memory by destroying unneeded data |
225 | |
229 | |
226 | attachable () |
230 | attachable () |
227 | : flags (0), self (0), cb (0), attach (0) |
231 | : attachable_flags (0), self (0), cb (0), attach (0) |
228 | { |
232 | { |
229 | } |
233 | } |
230 | |
234 | |
231 | attachable (const attachable &src) |
235 | attachable (const attachable &src) |
232 | : flags (0), self (0), cb (0), attach (src.attach) |
236 | : attachable_flags (0), self (0), cb (0), attach (src.attach) |
233 | { |
237 | { |
234 | } |
238 | } |
235 | |
239 | |
236 | // set a custom key to the given value, or delete it if value = 0 |
240 | // set a custom key to the given value, or delete it if value = 0 |
237 | void set_key (const char *key, const char *value = 0, bool is_utf8 = 0); |
241 | void set_key (const_utf8_string key, const_utf8_string value = 0, bool is_utf8 = 0); |
238 | |
242 | |
239 | void set_key_text (const char *key, const char *value = 0) |
243 | void set_key_text (const_utf8_string key, const_utf8_string value = 0) |
240 | { |
244 | { |
241 | set_key (key, value, 1); |
245 | set_key (key, value, 1); |
242 | } |
246 | } |
243 | |
247 | |
244 | void set_key_data (const char *key, const char *value = 0) |
248 | void set_key_data (const_utf8_string key, const_utf8_string value = 0) |
245 | { |
249 | { |
246 | set_key (key, value, 0); |
250 | set_key (key, value, 0); |
247 | } |
251 | } |
248 | |
252 | |
249 | attachable &operator =(const attachable &src); |
253 | attachable &operator =(const attachable &src); |
250 | |
254 | |
251 | // used to _quickly_ device wether to shortcut the evaluation |
255 | // used to _quickly_ decide wether to shortcut the evaluation |
252 | bool should_invoke (event_type event) |
256 | bool should_invoke (event_type event) |
253 | { |
257 | { |
254 | return ev_want_event [event] || cb; |
258 | return ev_want_event [event] || cb; |
255 | } |
259 | } |
256 | |
260 | |
… | |
… | |
278 | |
282 | |
279 | extern struct global gbl_ev; |
283 | extern struct global gbl_ev; |
280 | |
284 | |
281 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
285 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
282 | |
286 | |
|
|
287 | // a little dirty hack, maybe unify with something else at a later time |
|
|
288 | struct keyword_string |
|
|
289 | { |
|
|
290 | const char *s; |
|
|
291 | const int l; |
|
|
292 | |
|
|
293 | keyword_string (const char *s, int l) |
|
|
294 | : s(s), l(l) |
|
|
295 | { } |
|
|
296 | |
|
|
297 | keyword_string (keyword kw) |
|
|
298 | : s(keyword_str [kw]), l(keyword_len [kw]) |
|
|
299 | { |
|
|
300 | } |
|
|
301 | |
|
|
302 | keyword_string (shstr_tmp sh) |
|
|
303 | : s(&sh), l(sh.length ()) |
|
|
304 | { |
|
|
305 | } |
|
|
306 | }; |
|
|
307 | |
|
|
308 | #define CS(keyword) keyword_string (# keyword, sizeof (# keyword) - 1) |
|
|
309 | #define KW(keyword) CS(keyword) |
|
|
310 | |
283 | INTERFACE_CLASS(object_freezer) |
311 | INTERFACE_CLASS(object_freezer) |
284 | struct object_freezer : dynbuf_text |
312 | struct object_freezer : dynbuf_text |
285 | { |
313 | { |
286 | AV *av; |
314 | AV *av; |
287 | |
315 | |
288 | object_freezer (); |
316 | object_freezer (); |
289 | ~object_freezer (); |
317 | ~object_freezer (); |
290 | |
318 | |
|
|
319 | // serialise perl part |
291 | void put (attachable *ext); |
320 | void put_ (attachable *ext); |
292 | |
321 | void put (attachable *ext) |
293 | // used only for user-defined key-value pairs |
|
|
294 | void put (shstr_tmp k, shstr_tmp v) |
|
|
295 | { |
322 | { |
296 | add (k); |
323 | if (expect_false (ext->self)) |
|
|
324 | put_ (ext); |
|
|
325 | } |
297 | |
326 | |
|
|
327 | // null value (== no space after keyword) |
|
|
328 | void put (const keyword_string k) |
|
|
329 | { |
|
|
330 | char *p = force (k.l + 1); |
|
|
331 | memcpy (p, k.s, k.l); p += k.l; *p++ = '\n'; |
|
|
332 | alloc (p); |
|
|
333 | } |
|
|
334 | |
|
|
335 | void put (const keyword_string k, const keyword_string v) |
|
|
336 | { |
|
|
337 | char *p = force (k.l + 1 + v.l + 1); |
|
|
338 | memcpy (p, k.s, k.l); p += k.l; *p++ = ' '; |
|
|
339 | memcpy (p, v.s, v.l); p += v.l; *p++ = '\n'; |
|
|
340 | alloc (p); |
|
|
341 | } |
|
|
342 | |
|
|
343 | void put (const keyword_string k, const_utf8_string v) |
|
|
344 | { |
298 | if (expect_true (v)) |
345 | if (expect_true (v)) |
299 | add (' '), add (v); |
346 | put (k, keyword_string (v, strlen (v))); |
300 | |
347 | else |
301 | add ('\n'); |
348 | put (k); |
302 | } |
349 | } |
303 | |
350 | |
304 | template<typename T> |
|
|
305 | void put_kw_string (keyword k, const T &v) |
|
|
306 | { |
|
|
307 | int klen = keyword_len [k]; |
|
|
308 | int vlen = v ? strlen (v) + 1 : 0; |
|
|
309 | |
|
|
310 | char *p = (char *)alloc (klen + vlen + 1); |
|
|
311 | |
|
|
312 | memcpy (p, keyword_str [k], klen); p += klen; |
|
|
313 | |
|
|
314 | if (expect_true (v)) |
|
|
315 | { |
|
|
316 | *p++ = ' '; vlen--; |
|
|
317 | memcpy (p, v, vlen); p += vlen; |
|
|
318 | } |
|
|
319 | |
|
|
320 | *p = '\n'; |
|
|
321 | } |
|
|
322 | |
|
|
323 | void put (keyword k, const char *v = 0) |
|
|
324 | { |
|
|
325 | put_kw_string (k, v); |
|
|
326 | } |
|
|
327 | |
|
|
328 | void put (keyword k, shstr_tmp v) |
351 | void put (const keyword_string k, shstr_tmp v) |
329 | { |
352 | { |
330 | put_kw_string (k, v); |
353 | put (k, keyword_string (v)); |
331 | } |
354 | } |
332 | |
355 | |
333 | void put (keyword k, double v) |
356 | void put (const keyword_string k, double v) |
334 | { |
357 | { |
335 | force (MAX_KEYWORD_LEN + 2 + 32); |
358 | char *p = force (MAX_KEYWORD_LEN + 2 + 32); |
336 | fadd (keyword_str [k], keyword_len [k]); |
359 | memcpy (p, k.s, k.l); p += k.l; *p++ = ' '; |
337 | fadd (' '); |
360 | p += sprintf (p, "%.7g", v); *p++ = '\n'; |
338 | falloc (sprintf (ptr, "%.7g", v)); |
361 | alloc (p); |
339 | fadd ('\n'); |
|
|
340 | } |
362 | } |
341 | |
363 | |
342 | void put_(keyword k, sint64 v) |
364 | void put_(const keyword_string k, sint64 v) |
343 | { |
365 | { |
344 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
366 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
345 | fadd (keyword_str [k], keyword_len [k]); |
367 | fadd (k.s, k.l); |
346 | fadd (' '); |
368 | fadd (' '); |
347 | add (v); |
369 | add (v); |
348 | fadd ('\n'); |
370 | fadd ('\n'); |
349 | } |
371 | } |
350 | |
372 | |
351 | void put_(keyword k, sint32 v) |
373 | void put_(const keyword_string k, sint32 v) |
352 | { |
374 | { |
353 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
375 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
354 | fadd (keyword_str [k], keyword_len [k]); |
376 | fadd (k.s, k.l); |
355 | fadd (' '); |
377 | fadd (' '); |
356 | add (v); |
378 | add (v); |
357 | fadd ('\n'); |
379 | fadd ('\n'); |
358 | } |
380 | } |
359 | |
381 | |
360 | void put (keyword k, float v) { put (k, (double)v); } |
382 | void put (const keyword_string k, float v) { put (k, (double)v); } |
361 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
383 | void put (const keyword_string k, signed char v) { put_(k, (sint32)v); } |
362 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
384 | void put (const keyword_string k, unsigned char v) { put_(k, (sint32)v); } |
363 | void put (keyword k, signed short v) { put_(k, (sint32)v); } |
385 | void put (const keyword_string k, signed short v) { put_(k, (sint32)v); } |
364 | void put (keyword k, unsigned short v) { put_(k, (sint32)v); } |
386 | void put (const keyword_string k, unsigned short v) { put_(k, (sint32)v); } |
365 | void put (keyword k, signed int v) { put_(k, (sint32)v); } |
387 | void put (const keyword_string k, signed int v) { put_(k, (sint32)v); } |
366 | void put (keyword k, unsigned int v) { put_(k, (sint64)v); } |
388 | void put (const keyword_string k, unsigned int v) { put_(k, (sint64)v); } |
367 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
389 | void put (const keyword_string k, signed long v) { put_(k, (sint64)v); } |
368 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
390 | void put (const keyword_string k, unsigned long v) { put_(k, (sint64)v); } |
369 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
391 | void put (const keyword_string k, signed long long v) { put_(k, (sint64)v); } |
370 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
392 | void put (const keyword_string k, unsigned long long v) { put_(k, (sint64)v); } |
371 | |
393 | |
372 | void put (keyword kbeg, keyword kend, shstr_tmp v) |
394 | void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v) |
373 | { |
395 | { |
374 | force (MAX_KEYWORD_LEN + 1); |
396 | force (MAX_KEYWORD_LEN + 1); |
375 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
397 | fadd (kbeg.s, kbeg.l); fadd ('\n'); |
376 | |
398 | |
377 | if (expect_true (v)) |
399 | if (expect_true (v)) |
378 | { |
400 | { |
379 | add (v); |
401 | add (v); |
380 | add ('\n'); |
402 | add ('\n'); |
381 | } |
403 | } |
382 | |
404 | |
383 | force (MAX_KEYWORD_LEN + 1); |
405 | force (MAX_KEYWORD_LEN + 1); |
384 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
406 | fadd (kend.s, kend.l); fadd ('\n'); |
385 | } |
407 | } |
386 | |
408 | |
387 | void put (keyword k, archetype *v); |
409 | void put (const keyword_string k, archetype *v); |
388 | void put (keyword k, treasurelist *v); |
410 | void put (const keyword_string k, treasurelist *v); |
389 | void put (keyword k, faceinfo *v); |
411 | void put (const keyword_string k, faceinfo *v); |
390 | |
412 | |
391 | template<typename T> |
413 | template<typename T> |
392 | void put (keyword k, const refptr<T> &v) |
414 | void put (const keyword_string k, const refptr<T> &v) |
393 | { |
415 | { |
394 | put (k, (T *)v); |
416 | put (k, (T *)v); |
395 | } |
417 | } |
396 | |
418 | |
397 | MTH bool save (const_octet_string path); |
419 | MTH bool save (const_octet_string path); |
398 | char *as_string (); // like strdup |
420 | utf8_string as_string (); // like strdup |
399 | |
421 | |
400 | operator bool () { return !!av; } |
422 | operator bool () { return !!av; } |
401 | }; |
423 | }; |
402 | |
424 | |
403 | INTERFACE_CLASS(object_thawer) |
425 | INTERFACE_CLASS(object_thawer) |
… | |
… | |
413 | const char *value_nn; // the value, or the empty string if no value |
435 | const char *value_nn; // the value, or the empty string if no value |
414 | const char *name; |
436 | const char *name; |
415 | |
437 | |
416 | operator bool () const { return !!text; } |
438 | operator bool () const { return !!text; } |
417 | |
439 | |
418 | object_thawer (const char *path = 0); |
440 | object_thawer (const_utf8_string path = 0); |
419 | object_thawer (const char *data, AV *perlav); |
441 | object_thawer (const_utf8_string data, AV *perlav); |
420 | ~object_thawer (); |
442 | ~object_thawer (); |
421 | |
443 | |
422 | void get (attachable *obj, int oid); |
444 | void get (attachable *obj, int oid); |
423 | |
445 | |
424 | // parse next line |
446 | // parse next line |
… | |
… | |
426 | // skip the current key-value (usually fetch next line, for |
448 | // skip the current key-value (usually fetch next line, for |
427 | // multiline-fields, skips till the corresponding end-kw |
449 | // multiline-fields, skips till the corresponding end-kw |
428 | MTH void skip (); |
450 | MTH void skip (); |
429 | MTH void skip_block (); // skips till and over KW_end |
451 | MTH void skip_block (); // skips till and over KW_end |
430 | |
452 | |
431 | char *get_str () { return value; } // may be 0 |
453 | bool has_value () { return value; } |
|
|
454 | const_utf8_string get_str () { return value_nn; } // empty string when missing |
432 | void get_ml (keyword kend, shstr &sh); |
455 | void get_ml (keyword kend, shstr &sh); |
433 | |
456 | |
434 | void get_ornull (shstr &sh) const { sh = value; } |
457 | void get_ornull (shstr &sh) const { sh = value; } |
435 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
458 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
436 | |
459 | |
… | |
… | |
450 | void get (sint32 &i) { i = get_sint32 (); } |
473 | void get (sint32 &i) { i = get_sint32 (); } |
451 | |
474 | |
452 | void get (uint32 &i) { i = get_sint64 (); } |
475 | void get (uint32 &i) { i = get_sint64 (); } |
453 | void get (sint64 &i) { i = get_sint64 (); } |
476 | void get (sint64 &i) { i = get_sint64 (); } |
454 | |
477 | |
455 | MTH void parse_warn (const char *msg); |
478 | MTH void parse_warn (const_utf8_string msg); |
456 | MTH bool parse_error (const char *type = 0, const char *name = 0, bool skip = true); |
479 | MTH bool parse_error (const_utf8_string type = 0, const_utf8_string name = 0, bool skip = true); |
457 | |
480 | |
458 | struct delayed_ref { |
481 | struct delayed_ref { |
459 | attachable *op; |
482 | attachable *op; |
460 | object_ptr *ptr; |
483 | object_ptr *ptr; |
461 | const char *ref; |
484 | const_utf8_string ref; |
462 | }; |
485 | }; |
463 | std::vector<delayed_ref> delrefs; |
486 | std::vector<delayed_ref> delrefs; |
464 | |
487 | |
465 | void delayed_deref (attachable *op, object_ptr &ptr, const char *ref); |
488 | void delayed_deref (attachable *op, object_ptr &ptr, const_utf8_string ref); |
466 | MTH void resolve_delayed_derefs (bool deref = true); |
489 | MTH void resolve_delayed_derefs (bool deref = true); |
467 | }; |
490 | }; |
468 | |
491 | |
469 | //TODO: remove |
492 | //TODO: remove |
470 | char *fgets (char *s, int n, object_thawer &thawer); |
493 | char *fgets (char *s, int n, object_thawer &thawer); |