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

Diff Legend

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