ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/cfperl.h
(Generate patch)

Comparing deliantra/server/include/cfperl.h (file contents):
Revision 1.98 by root, Thu Jun 19 09:08:22 2008 UTC vs.
Revision 1.120 by root, Mon Apr 12 05:22:38 2010 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines