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.113 by root, Mon Nov 16 22:31:14 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//
… …
105void 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);
106int cfperl_can_merge (object *ob1, object *ob2); 105int cfperl_can_merge (object *ob1, object *ob2);
107void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); 106void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0);
108 107
109bool is_match_expr (const char *expr); 108bool is_match_expr (const char *expr);
110/* applies the match expression and returns true if it matches */ 109// 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); 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);
112 113
113////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 114//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
114 115
115#if IVSIZE >= 8 116#if IVSIZE >= 8
116 typedef IV val64; 117 typedef IV val64;
… …
195 196
196 enum { 197 enum {
197 F_DESTROYED = 0x01, 198 F_DESTROYED = 0x01,
198 F_DEBUG_TRACE = 0x02, 199 F_DEBUG_TRACE = 0x02,
199 }; 200 };
200 uint8 ACC (RW, flags); 201 uint8 ACC (RW, attachable_flags);
201 202
202 static unordered_vector<attachable *> mortals; 203 static unordered_vector<attachable *> mortals;
203 MTH static void check_mortals (); 204 MTH static void check_mortals ();
204 205
205 // object is delete'd after the refcount reaches 0 206 // object is delete'd after the refcount reaches 0
… …
211 // this politely asks everybody interested the reduce 212 // this politely asks everybody interested the reduce
212 // the refcount to 0 as soon as possible. 213 // the refcount to 0 as soon as possible.
213 MTH void destroy (); 214 MTH void destroy ();
214 215
215 // return wether an object was destroyed already 216 // return wether an object was destroyed already
216 MTH bool destroyed () const { return flags & F_DESTROYED; } 217 MTH bool destroyed () const { return attachable_flags & F_DESTROYED; }
217 218
218 virtual void gather_callbacks (AV *&callbacks, event_type event) const; 219 virtual void gather_callbacks (AV *&callbacks, event_type event) const;
219 220
220#if 0 221#if 0
221private: 222private:
… …
229 230
230 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.
231 void optimise (); // possibly save some memory by destroying unneeded data 232 void optimise (); // possibly save some memory by destroying unneeded data
232 233
233 attachable () 234 attachable ()
234 : flags (0), self (0), cb (0), attach (0) 235 : attachable_flags (0), self (0), cb (0), attach (0)
235 { 236 {
236 } 237 }
237 238
238 attachable (const attachable &src) 239 attachable (const attachable &src)
239 : flags (0), self (0), cb (0), attach (src.attach) 240 : attachable_flags (0), self (0), cb (0), attach (src.attach)
240 { 241 {
241 } 242 }
242 243
243 // 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
244 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);
… …
285 286
286extern struct global gbl_ev; 287extern struct global gbl_ev;
287 288
288////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 289//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
289 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
290INTERFACE_CLASS(object_freezer) 315INTERFACE_CLASS(object_freezer)
291struct object_freezer : dynbuf_text 316struct object_freezer : dynbuf_text
292{ 317{
293 AV *av; 318 AV *av;
294 319
295 object_freezer (); 320 object_freezer ();
296 ~object_freezer (); 321 ~object_freezer ();
297 322
323 // serialise perl part
298 void put (attachable *ext); 324 void put_ (attachable *ext);
299 325 void put (attachable *ext)
300 // used only for user-defined key-value pairs
301 void put (shstr_tmp k, shstr_tmp v)
302 { 326 {
303 add (k); 327 if (expect_false (ext->self))
328 put_ (ext);
329 }
304 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 char *v)
348 {
305 if (expect_true (v)) 349 if (expect_true (v))
306 add (' '), add (v); 350 put (k, keyword_string (v, strlen (v)));
307 351 else
308 add ('\n'); 352 put (k);
309 } 353 }
310 354
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) 355 void put (const keyword_string k, shstr_tmp v)
336 { 356 {
337 put_kw_string (k, v); 357 put (k, keyword_string (v));
338 } 358 }
339 359
340 void put (keyword k, double v) 360 void put (const keyword_string k, double v)
341 { 361 {
342 force (MAX_KEYWORD_LEN + 2 + 32); 362 char *p = force (MAX_KEYWORD_LEN + 2 + 32);
343 fadd (keyword_str [k], keyword_len [k]); 363 memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
344 fadd (' '); 364 p += sprintf (p, "%.7g", v); *p++ = '\n';
345 falloc (sprintf (ptr, "%.7g", v)); 365 alloc (p);
346 fadd ('\n');
347 } 366 }
348 367
349 void put_(keyword k, sint64 v) 368 void put_(const keyword_string k, sint64 v)
350 { 369 {
351 force (MAX_KEYWORD_LEN + 2 + sint64_digits); 370 force (MAX_KEYWORD_LEN + 2 + sint64_digits);
352 fadd (keyword_str [k], keyword_len [k]); 371 fadd (k.s, k.l);
353 fadd (' '); 372 fadd (' ');
354 add (v); 373 add (v);
355 fadd ('\n'); 374 fadd ('\n');
356 } 375 }
357 376
358 void put_(keyword k, sint32 v) 377 void put_(const keyword_string k, sint32 v)
359 { 378 {
360 force (MAX_KEYWORD_LEN + 2 + sint32_digits); 379 force (MAX_KEYWORD_LEN + 2 + sint32_digits);
361 fadd (keyword_str [k], keyword_len [k]); 380 fadd (k.s, k.l);
362 fadd (' '); 381 fadd (' ');
363 add (v); 382 add (v);
364 fadd ('\n'); 383 fadd ('\n');
365 } 384 }
366 385
367 void put (keyword k, float v) { put (k, (double)v); } 386 void put (const keyword_string k, float v) { put (k, (double)v); }
368 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); }
369 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); }
370 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); }
371 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); }
372 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); }
373 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); }
374 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); }
375 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); }
376 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); }
377 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); }
378 397
379 void put (keyword kbeg, keyword kend, shstr_tmp v) 398 void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v)
380 { 399 {
381 force (MAX_KEYWORD_LEN + 1); 400 force (MAX_KEYWORD_LEN + 1);
382 fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); 401 fadd (kbeg.s, kbeg.l); fadd ('\n');
383 402
384 if (expect_true (v)) 403 if (expect_true (v))
385 { 404 {
386 add (v); 405 add (v);
387 add ('\n'); 406 add ('\n');
388 } 407 }
389 408
390 force (MAX_KEYWORD_LEN + 1); 409 force (MAX_KEYWORD_LEN + 1);
391 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); 410 fadd (kend.s, kend.l); fadd ('\n');
392 } 411 }
393 412
394 void put (keyword k, archetype *v); 413 void put (const keyword_string k, archetype *v);
395 void put (keyword k, treasurelist *v); 414 void put (const keyword_string k, treasurelist *v);
396 void put (keyword k, faceinfo *v); 415 void put (const keyword_string k, faceinfo *v);
397 416
398 template<typename T> 417 template<typename T>
399 void put (keyword k, const refptr<T> &v) 418 void put (const keyword_string k, const refptr<T> &v)
400 { 419 {
401 put (k, (T *)v); 420 put (k, (T *)v);
402 } 421 }
403 422
404 MTH bool save (const_octet_string path); 423 MTH bool save (const_octet_string path);
… …
433 // skip the current key-value (usually fetch next line, for 452 // skip the current key-value (usually fetch next line, for
434 // multiline-fields, skips till the corresponding end-kw 453 // multiline-fields, skips till the corresponding end-kw
435 MTH void skip (); 454 MTH void skip ();
436 MTH void skip_block (); // skips till and over KW_end 455 MTH void skip_block (); // skips till and over KW_end
437 456
438 char *get_str () { return value; } // may be 0 457 bool has_value () { return value; }
458 const char *get_str () { return value_nn; } // empty string when missing
439 void get_ml (keyword kend, shstr &sh); 459 void get_ml (keyword kend, shstr &sh);
440 460
441 void get_ornull (shstr &sh) const { sh = value; } 461 void get_ornull (shstr &sh) const { sh = value; }
442 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
443 463

Diff Legend

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