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.97 by root, Thu May 8 20:03:50 2008 UTC vs.
Revision 1.112 by root, Wed Nov 11 23:27:57 2009 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 _
… …
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", __func__, SvPVutf8_nolen (ERRSV)); 85 LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV));
85 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
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_expand_cfpod (player *pl, std::string &msg);
101void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); 104void cfperl_send_msg (client *ns, int color, const char *type, const char *msg);
102int 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 char *expr);
109// applies the match expression and returns true if it matches
110bool match (const char *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 char *expr, object *ob, object *self = 0, object *source = 0, object *originator = 0);
103 113
104////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 114//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
105 115
106#if IVSIZE >= 8 116#if IVSIZE >= 8
107 typedef IV val64; 117 typedef IV val64;
… …
182INTERFACE_CLASS (attachable) 192INTERFACE_CLASS (attachable)
183struct attachable : refcnt_base 193struct attachable : refcnt_base
184{ 194{
185 static MGVTBL vtbl; 195 static MGVTBL vtbl;
186 196
187 static unordered_vector<attachable *> mortals;
188 MTH static void check_mortals ();
189
190 enum { 197 enum {
191 F_DESTROYED = 0x01, 198 F_DESTROYED = 0x01,
192 F_DEBUG_TRACE = 0x02, 199 F_DEBUG_TRACE = 0x02,
193 }; 200 };
194 int ACC (RW, flags); 201 uint8 ACC (RW, attachable_flags);
202
203 static unordered_vector<attachable *> mortals;
204 MTH static void check_mortals ();
195 205
196 // object is delete'd after the refcount reaches 0 206 // object is delete'd after the refcount reaches 0
197 MTH int refcnt_cnt () const; 207 MTH int refcnt_cnt () const;
198 // check wether the object has died and destroy 208 // check wether the object has died and destroy
199 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } 209 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); }
… …
202 // this politely asks everybody interested the reduce 212 // this politely asks everybody interested the reduce
203 // the refcount to 0 as soon as possible. 213 // the refcount to 0 as soon as possible.
204 MTH void destroy (); 214 MTH void destroy ();
205 215
206 // return wether an object was destroyed already 216 // return wether an object was destroyed already
207 MTH bool destroyed () const { return flags & F_DESTROYED; } 217 MTH bool destroyed () const { return attachable_flags & F_DESTROYED; }
208 218
209 virtual void gather_callbacks (AV *&callbacks, event_type event) const; 219 virtual void gather_callbacks (AV *&callbacks, event_type event) const;
210 220
211#if 0 221#if 0
212private: 222private:
… …
220 230
221 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.
222 void optimise (); // possibly save some memory by destroying unneeded data 232 void optimise (); // possibly save some memory by destroying unneeded data
223 233
224 attachable () 234 attachable ()
225 : flags (0), self (0), cb (0), attach (0) 235 : attachable_flags (0), self (0), cb (0), attach (0)
226 { 236 {
227 } 237 }
228 238
229 attachable (const attachable &src) 239 attachable (const attachable &src)
230 : flags (0), self (0), cb (0), attach (src.attach) 240 : attachable_flags (0), self (0), cb (0), attach (src.attach)
231 { 241 {
232 } 242 }
233 243
234 // 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
235 void set_key (const char *key, const char *value = 0, bool is_utf8 = 0); 245 void set_key (const char *key, const char *value = 0, bool is_utf8 = 0);
… …
276 286
277extern struct global gbl_ev; 287extern struct global gbl_ev;
278 288
279////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 289//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
280 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
281INTERFACE_CLASS(object_freezer) 315INTERFACE_CLASS(object_freezer)
282struct object_freezer : dynbuf_text 316struct object_freezer : dynbuf_text
283{ 317{
284 AV *av; 318 AV *av;
285 319
286 object_freezer (); 320 object_freezer ();
287 ~object_freezer (); 321 ~object_freezer ();
288 322
323 // serialise perl part
289 void put (attachable *ext); 324 void put_ (attachable *ext);
325 void put (attachable *ext)
326 {
327 if (expect_false (ext->self))
328 put_ (ext);
329 }
290 330
291 // used only for user-defined key-value pairs 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
292 void put (const shstr &k, const shstr &v) 347 void put (const keyword_string k, const char *v)
293 { 348 {
294 add (k);
295
296 if (expect_true (v)) 349 if (expect_true (v))
297 add (' '), add (v); 350 put (k, keyword_string (v, strlen (v)));
298 351 else
299 add ('\n'); 352 put (k);
300 } 353 }
301 354
302 template<typename T> 355 void put (const keyword_string k, shstr_tmp v)
303 void put_kw_string (keyword k, const T &v)
304 { 356 {
305 int klen = keyword_len [k]; 357 put (k, keyword_string (v));
306 int vlen = v ? strlen (v) + 1 : 0;
307
308 char *p = (char *)alloc (klen + vlen + 1);
309
310 memcpy (p, keyword_str [k], klen); p += klen;
311
312 if (expect_true (v))
313 {
314 *p++ = ' '; vlen--;
315 memcpy (p, v, vlen); p += vlen;
316 }
317
318 *p = '\n';
319 } 358 }
320 359
321 void put (keyword k, const char *v = 0)
322 {
323 put_kw_string (k, v);
324 }
325
326 void put (keyword k, const shstr &v)
327 {
328 put_kw_string (k, v);
329 }
330
331 void put (keyword k, double v) 360 void put (const keyword_string k, double v)
332 { 361 {
333 force (MAX_KEYWORD_LEN + 2 + 32); 362 char *p = force (MAX_KEYWORD_LEN + 2 + 32);
334 fadd (keyword_str [k], keyword_len [k]); 363 memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
335 fadd (' '); 364 p += sprintf (p, "%.7g", v); *p++ = '\n';
336 falloc (sprintf (ptr, "%.7g", v)); 365 alloc (p);
337 fadd ('\n');
338 } 366 }
339 367
340 void put_(keyword k, sint64 v) 368 void put_(const keyword_string k, sint64 v)
341 { 369 {
342 force (MAX_KEYWORD_LEN + 2 + sint64_digits); 370 force (MAX_KEYWORD_LEN + 2 + sint64_digits);
343 fadd (keyword_str [k], keyword_len [k]); 371 fadd (k.s, k.l);
344 fadd (' '); 372 fadd (' ');
345 add (v); 373 add (v);
346 fadd ('\n'); 374 fadd ('\n');
347 } 375 }
348 376
349 void put_(keyword k, sint32 v) 377 void put_(const keyword_string k, sint32 v)
350 { 378 {
351 force (MAX_KEYWORD_LEN + 2 + sint32_digits); 379 force (MAX_KEYWORD_LEN + 2 + sint32_digits);
352 fadd (keyword_str [k], keyword_len [k]); 380 fadd (k.s, k.l);
353 fadd (' '); 381 fadd (' ');
354 add (v); 382 add (v);
355 fadd ('\n'); 383 fadd ('\n');
356 } 384 }
357 385
358 void put (keyword k, float v) { put (k, (double)v); } 386 void put (const keyword_string k, float v) { put (k, (double)v); }
359 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); }
360 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); }
361 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); }
362 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); }
363 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); }
364 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); }
365 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); }
366 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); }
367 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); }
368 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); }
369 397
370 void put (keyword kbeg, keyword kend, const shstr &v) 398 void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v)
371 { 399 {
372 force (MAX_KEYWORD_LEN + 1); 400 force (MAX_KEYWORD_LEN + 1);
373 fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); 401 fadd (kbeg.s, kbeg.l); fadd ('\n');
374 402
375 if (expect_true (v)) 403 if (expect_true (v))
376 { 404 {
377 add (v); 405 add (v);
378 add ('\n'); 406 add ('\n');
379 } 407 }
380 408
381 force (MAX_KEYWORD_LEN + 1); 409 force (MAX_KEYWORD_LEN + 1);
382 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); 410 fadd (kend.s, kend.l); fadd ('\n');
383 } 411 }
384 412
385 void put (keyword k, archetype *v); 413 void put (const keyword_string k, archetype *v);
386 void put (keyword k, treasurelist *v); 414 void put (const keyword_string k, treasurelist *v);
387 void put (keyword k, faceinfo *v); 415 void put (const keyword_string k, faceinfo *v);
388 416
389 template<typename T> 417 template<typename T>
390 void put (keyword k, const refptr<T> &v) 418 void put (const keyword_string k, const refptr<T> &v)
391 { 419 {
392 put (k, (T *)v); 420 put (k, (T *)v);
393 } 421 }
394 422
395 MTH bool save (const_octet_string path); 423 MTH bool save (const_octet_string path);

Diff Legend

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