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.94 by root, Wed Apr 2 11:13:54 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//
… …
50// optimisations/workaround for functions requiring my_perl in scope (anti-bloat) 49// optimisations/workaround for functions requiring my_perl in scope (anti-bloat)
51#undef localtime 50#undef localtime
52#undef srand48 51#undef srand48
53#undef drand48 52#undef drand48
54#undef srandom 53#undef srandom
54#undef opendir
55#undef readdir 55#undef readdir
56#undef closedir
56#undef getprotobyname 57#undef getprotobyname
57#undef gethostbyname 58#undef gethostbyname
58#undef ctime 59#undef ctime
59#undef strerror 60#undef strerror
60#undef _ 61#undef _
… …
79 80
80// some macros to simplify perl in-calls 81// some macros to simplify perl in-calls
81 82
82#define CHECK_ERROR \ 83#define CHECK_ERROR \
83 if (SvTRUE (ERRSV)) \ 84 if (SvTRUE (ERRSV)) \
84 LOG (llevError, "runtime error in %s: %s\n", __func__, SvPVutf8_nolen (ERRSV)); 85 LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV));
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); }
85 89
86#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)
87#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
88#define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) 92#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; 93#define CALL_CALL(name, flags) PUTBACK; int count = call_pvsv (name, (flags) | G_EVAL); SPAGAIN;
90#define CALL_END CHECK_ERROR; FREETMPS; LEAVE 94#define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE
91 95
92////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 96//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
93 97
94void cfperl_init (); 98void cfperl_init ();
95void cfperl_main (); 99void cfperl_main ();
96void cfperl_tick (); 100void cfperl_tick ();
97void cfperl_emergency_save (); 101void cfperl_emergency_save ();
98void cfperl_cleanup (int make_core); 102void cfperl_cleanup (int make_core);
99void cfperl_make_book (object *book, int level); 103void cfperl_make_book (object *book, int level);
100void 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);
101int 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);
102 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);
113
103////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 114//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
115
116#if IVSIZE >= 8
117 typedef IV val64;
118 typedef IV uval64;
119# define newSVval64 newSViv
120# define SvVAL64 SvIV
121# define newSVuval64 newSVuv
122# define SvUVAL64 SvUV
123#else
124 typedef double val64;
125 typedef double uval64;
126# define newSVval64 newSVnv
127# define SvVAL64 SvNV
128# define newSVuval64 newSVnv
129# define SvUVAL64 SvNV
130#endif
104 131
105extern tstamp runtime; // virtual server time, excluding time jumps and lag 132extern tstamp runtime; // virtual server time, excluding time jumps and lag
106extern tstamp NOW; // real time of current server tick 133extern tstamp NOW; // real time of current server tick
107 134
108enum event_klass 135enum event_klass
… …
165INTERFACE_CLASS (attachable) 192INTERFACE_CLASS (attachable)
166struct attachable : refcnt_base 193struct attachable : refcnt_base
167{ 194{
168 static MGVTBL vtbl; 195 static MGVTBL vtbl;
169 196
170 static unordered_vector<attachable *> mortals;
171 MTH static void check_mortals ();
172
173 enum { 197 enum {
174 F_DESTROYED = 0x01, 198 F_DESTROYED = 0x01,
175 F_DEBUG_TRACE = 0x02, 199 F_DEBUG_TRACE = 0x02,
176 }; 200 };
177 int ACC (RW, flags); 201 uint8 ACC (RW, attachable_flags);
202
203 static unordered_vector<attachable *> mortals;
204 MTH static void check_mortals ();
178 205
179 // object is delete'd after the refcount reaches 0 206 // object is delete'd after the refcount reaches 0
180 MTH int refcnt_cnt () const; 207 MTH int refcnt_cnt () const;
181 // check wether the object has died and destroy 208 // check wether the object has died and destroy
182 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } 209 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); }
… …
185 // this politely asks everybody interested the reduce 212 // this politely asks everybody interested the reduce
186 // the refcount to 0 as soon as possible. 213 // the refcount to 0 as soon as possible.
187 MTH void destroy (); 214 MTH void destroy ();
188 215
189 // return wether an object was destroyed already 216 // return wether an object was destroyed already
190 MTH bool destroyed () const { return flags & F_DESTROYED; } 217 MTH bool destroyed () const { return attachable_flags & F_DESTROYED; }
191 218
192 virtual void gather_callbacks (AV *&callbacks, event_type event) const; 219 virtual void gather_callbacks (AV *&callbacks, event_type event) const;
193 220
194#if 0 221#if 0
195private: 222private:
… …
203 230
204 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.
205 void optimise (); // possibly save some memory by destroying unneeded data 232 void optimise (); // possibly save some memory by destroying unneeded data
206 233
207 attachable () 234 attachable ()
208 : flags (0), self (0), cb (0), attach (0) 235 : attachable_flags (0), self (0), cb (0), attach (0)
209 { 236 {
210 } 237 }
211 238
212 attachable (const attachable &src) 239 attachable (const attachable &src)
213 : flags (0), self (0), cb (0), attach (src.attach) 240 : attachable_flags (0), self (0), cb (0), attach (src.attach)
214 { 241 {
215 } 242 }
216 243
217 // 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
218 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);
219 246
220 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)
221 { 248 {
222 set_key (key, value, 1); 249 set_key (key, value, 1);
223 } 250 }
224 251
225 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)
226 { 253 {
227 set_key (key, value, 0); 254 set_key (key, value, 0);
228 } 255 }
229 256
230 attachable &operator =(const attachable &src); 257 attachable &operator =(const attachable &src);
… …
259 286
260extern struct global gbl_ev; 287extern struct global gbl_ev;
261 288
262////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 289//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
263 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
264INTERFACE_CLASS(object_freezer) 315INTERFACE_CLASS(object_freezer)
265struct object_freezer : dynbuf_text 316struct object_freezer : dynbuf_text
266{ 317{
267 AV *av; 318 AV *av;
268 319
269 object_freezer (); 320 object_freezer ();
270 ~object_freezer (); 321 ~object_freezer ();
271 322
323 // serialise perl part
272 void put (attachable *ext); 324 void put_ (attachable *ext);
273 325 void put (attachable *ext)
274 // used only for user-defined key-value pairs
275 void put (const shstr &k, const shstr &v)
276 { 326 {
277 add (k); 327 if (expect_false (ext->self))
328 put_ (ext);
329 }
278 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 {
279 if (expect_true (v)) 349 if (expect_true (v))
280 add (' '), add (v); 350 put (k, keyword_string (v, strlen (v)));
281 351 else
282 add ('\n'); 352 put (k);
283 } 353 }
284 354
285 template<typename T> 355 void put (const keyword_string k, shstr_tmp v)
286 void put_kw_string (keyword k, const T &v)
287 { 356 {
288 int klen = keyword_len [k]; 357 put (k, keyword_string (v));
289 int vlen = v ? strlen (v) + 1 : 0;
290
291 char *p = (char *)alloc (klen + vlen + 1);
292
293 memcpy (p, keyword_str [k], klen); p += klen;
294
295 if (expect_true (v))
296 {
297 *p++ = ' '; vlen--;
298 memcpy (p, v, vlen); p += vlen;
299 }
300
301 *p = '\n';
302 } 358 }
303 359
304 void put (keyword k, const char *v = 0)
305 {
306 put_kw_string (k, v);
307 }
308
309 void put (keyword k, const shstr &v)
310 {
311 put_kw_string (k, v);
312 }
313
314 void put (keyword k, double v) 360 void put (const keyword_string k, double v)
315 { 361 {
316 force (MAX_KEYWORD_LEN + 2 + 32); 362 char *p = force (MAX_KEYWORD_LEN + 2 + 32);
317 fadd (keyword_str [k], keyword_len [k]); 363 memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
318 fadd (' '); 364 p += sprintf (p, "%.7g", v); *p++ = '\n';
319 falloc (sprintf (ptr, "%.7g", v)); 365 alloc (p);
320 fadd ('\n');
321 } 366 }
322 367
323 void put_(keyword k, sint64 v) 368 void put_(const keyword_string k, sint64 v)
324 { 369 {
325 force (MAX_KEYWORD_LEN + 2 + sint64_digits); 370 force (MAX_KEYWORD_LEN + 2 + sint64_digits);
326 fadd (keyword_str [k], keyword_len [k]); 371 fadd (k.s, k.l);
327 fadd (' '); 372 fadd (' ');
328 add (v); 373 add (v);
329 fadd ('\n'); 374 fadd ('\n');
330 } 375 }
331 376
332 void put_(keyword k, sint32 v) 377 void put_(const keyword_string k, sint32 v)
333 { 378 {
334 force (MAX_KEYWORD_LEN + 2 + sint32_digits); 379 force (MAX_KEYWORD_LEN + 2 + sint32_digits);
335 fadd (keyword_str [k], keyword_len [k]); 380 fadd (k.s, k.l);
336 fadd (' '); 381 fadd (' ');
337 add (v); 382 add (v);
338 fadd ('\n'); 383 fadd ('\n');
339 } 384 }
340 385
341 void put (keyword k, float v) { put (k, (double)v); } 386 void put (const keyword_string k, float v) { put (k, (double)v); }
342 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); }
343 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); }
344 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); }
345 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); }
346 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); }
347 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); }
348 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); }
349 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); }
350 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); }
351 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); }
352 397
353 void put (keyword kbeg, keyword kend, const shstr &v) 398 void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v)
354 { 399 {
355 force (MAX_KEYWORD_LEN + 1); 400 force (MAX_KEYWORD_LEN + 1);
356 fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); 401 fadd (kbeg.s, kbeg.l); fadd ('\n');
357 402
358 if (expect_true (v)) 403 if (expect_true (v))
359 { 404 {
360 add (v); 405 add (v);
361 add ('\n'); 406 add ('\n');
362 } 407 }
363 408
364 force (MAX_KEYWORD_LEN + 1); 409 force (MAX_KEYWORD_LEN + 1);
365 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); 410 fadd (kend.s, kend.l); fadd ('\n');
366 } 411 }
367 412
368 void put (keyword k, archetype *v); 413 void put (const keyword_string k, archetype *v);
369 void put (keyword k, treasurelist *v); 414 void put (const keyword_string k, treasurelist *v);
370 void put (keyword k, faceinfo *v); 415 void put (const keyword_string k, faceinfo *v);
371 416
372 template<typename T> 417 template<typename T>
373 void put (keyword k, const refptr<T> &v) 418 void put (const keyword_string k, const refptr<T> &v)
374 { 419 {
375 put (k, (T *)v); 420 put (k, (T *)v);
376 } 421 }
377 422
378 MTH bool save (const_octet_string path); 423 MTH bool save (const_octet_string path);
379 char *as_string (); // like strdup 424 utf8_string as_string (); // like strdup
380 425
381 operator bool () { return !!av; } 426 operator bool () { return !!av; }
382}; 427};
383 428
384INTERFACE_CLASS(object_thawer) 429INTERFACE_CLASS(object_thawer)
… …
394 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
395 const char *name; 440 const char *name;
396 441
397 operator bool () const { return !!text; } 442 operator bool () const { return !!text; }
398 443
399 object_thawer (const char *path = 0); 444 object_thawer (const_utf8_string path = 0);
400 object_thawer (const char *data, AV *perlav); 445 object_thawer (const_utf8_string data, AV *perlav);
401 ~object_thawer (); 446 ~object_thawer ();
402 447
403 void get (attachable *obj, int oid); 448 void get (attachable *obj, int oid);
404 449
405 // parse next line 450 // parse next line
… …
407 // skip the current key-value (usually fetch next line, for 452 // skip the current key-value (usually fetch next line, for
408 // multiline-fields, skips till the corresponding end-kw 453 // multiline-fields, skips till the corresponding end-kw
409 MTH void skip (); 454 MTH void skip ();
410 MTH void skip_block (); // skips till and over KW_end 455 MTH void skip_block (); // skips till and over KW_end
411 456
412 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
413 void get_ml (keyword kend, shstr &sh); 459 void get_ml (keyword kend, shstr &sh);
414 460
415 void get_ornull (shstr &sh) const { sh = value; } 461 void get_ornull (shstr &sh) const { sh = value; }
416 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
417 463
… …
431 void get (sint32 &i) { i = get_sint32 (); } 477 void get (sint32 &i) { i = get_sint32 (); }
432 478
433 void get (uint32 &i) { i = get_sint64 (); } 479 void get (uint32 &i) { i = get_sint64 (); }
434 void get (sint64 &i) { i = get_sint64 (); } 480 void get (sint64 &i) { i = get_sint64 (); }
435 481
436 MTH void parse_warn (const char *msg); 482 MTH void parse_warn (const_utf8_string msg);
437 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);
438 484
439 struct delayed_ref { 485 struct delayed_ref {
440 attachable *op; 486 attachable *op;
441 object_ptr *ptr; 487 object_ptr *ptr;
442 const char *ref; 488 const_utf8_string ref;
443 }; 489 };
444 std::vector<delayed_ref> delrefs; 490 std::vector<delayed_ref> delrefs;
445 491
446 void delayed_deref (attachable *op, object_ptr &ptr, const char *ref); 492 void delayed_deref (attachable *op, object_ptr &ptr, const_utf8_string ref);
447 MTH void resolve_delayed_derefs (bool deref = true); 493 MTH void resolve_delayed_derefs (bool deref = true);
448}; 494};
449 495
450//TODO: remove 496//TODO: remove
451char *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