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

Diff Legend

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