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.67 by root, Sun May 27 23:14:37 2007 UTC vs.
Revision 1.80 by root, Sun Jun 24 04:09:29 2007 UTC

1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it
9 * under the terms of the GNU General Public License as published by the Free
10 * Software Foundation; either version 2 of the License, or (at your option)
11 * any later version.
12 *
13 * This program is distributed in the hope that it will be useful, but
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * for more details.
17 *
18 * You should have received a copy of the GNU General Public License along
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */
24
1// 25//
2// cfperl.h perl interface 26// cfperl.h perl interface
3// 27//
4#ifndef CFPERL_H__ 28#ifndef CFPERL_H__
5#define CFPERL_H__ 29#define CFPERL_H__
… …
65void cfperl_init (); 89void cfperl_init ();
66void cfperl_main (); 90void cfperl_main ();
67void cfperl_emergency_save (); 91void cfperl_emergency_save ();
68void cfperl_cleanup (int make_core); 92void cfperl_cleanup (int make_core);
69void cfperl_make_book (object *book, int level); 93void cfperl_make_book (object *book, int level);
94void cfperl_send_msg (client *ns, int color, const char *type, const char *msg);
70 95
71////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 96//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
72 97
73// virtual server time, excluding time jumps and lag 98extern tstamp runtime; // virtual server time, excluding time jumps and lag
74extern double runtime; 99extern tstamp NOW; // real time of current server tick
75 100
76enum event_klass 101enum event_klass
77{ 102{
78 KLASS_NONE, 103 KLASS_NONE,
79 KLASS_GLOBAL, 104 KLASS_GLOBAL,
… …
150 MTH void refcnt_inc () const { ++refcnt; } 175 MTH void refcnt_inc () const { ++refcnt; }
151 MTH void refcnt_dec () const { --refcnt; } 176 MTH void refcnt_dec () const { --refcnt; }
152 177
153 MTH int refcnt_cnt () const; 178 MTH int refcnt_cnt () const;
154 // check wether the object has died and destroy 179 // check wether the object has died and destroy
155 MTH void refcnt_chk () { if (refcnt <= 0) do_check (); } 180 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); }
156 181
157 // destroy the object unless it was already destroyed 182 // destroy the object unless it was already destroyed
158 // this politely asks everybody interested the reduce 183 // this politely asks everybody interested the reduce
159 // the refcount to 0 as soon as possible. 184 // the refcount to 0 as soon as possible.
160 MTH void destroy (); 185 MTH void destroy ();
… …
238 add (' '), add (v); 263 add (' '), add (v);
239 264
240 add ('\n'); 265 add ('\n');
241 } 266 }
242 267
243 //TODO//temporary, used only for saving body locations
244 void put (const char *k, int v)
245 {
246 add (k);
247 add (' ');
248 add (sint32 (v));
249 add ('\n');
250 }
251
252 template<typename T> 268 template<typename T>
253 void put_string (keyword k, const T &v) 269 void put_kw_string (keyword k, const T &v)
254 { 270 {
255 int klen = keyword_len [k]; 271 int klen = keyword_len [k];
256 int vlen = v ? strlen (v) + 1 : 0; 272 int vlen = v ? strlen (v) + 1 : 0;
257 273
258 char *p = (char *)alloc (klen + vlen + 1); 274 char *p = (char *)alloc (klen + vlen + 1);
… …
268 *p = '\n'; 284 *p = '\n';
269 } 285 }
270 286
271 void put (keyword k, const char *v = 0) 287 void put (keyword k, const char *v = 0)
272 { 288 {
273 put_string (k, v); 289 put_kw_string (k, v);
274 } 290 }
275 291
276 void put (keyword k, const shstr &v) 292 void put (keyword k, const shstr &v)
277 { 293 {
278 put_string (k, v); 294 put_kw_string (k, v);
279 } 295 }
280 296
281 void put (keyword k, double v) 297 void put (keyword k, double v)
282 { 298 {
283 char buf [128]; 299 force (MAX_KEYWORD_LEN + 2 + 32);
284 300 fadd (keyword_str [k], keyword_len [k]);
285 snprintf (buf, 128, "%.7g", v); 301 fadd (' ');
286 302 falloc (sprintf (ptr, "%.7g", v));
287 put (k, (const char *)buf); 303 fadd ('\n');
288 } 304 }
289 305
290 void put_(keyword k, sint64 v) 306 void put_(keyword k, sint64 v)
291 { 307 {
308 force (MAX_KEYWORD_LEN + 2 + sint64_digits);
292 add (keyword_str [k], keyword_len [k]); 309 fadd (keyword_str [k], keyword_len [k]);
293 add (' '); 310 fadd (' ');
294 add (v); 311 add (v);
295 add ('\n'); 312 fadd ('\n');
296 } 313 }
297 314
298 void put_(keyword k, sint32 v) 315 void put_(keyword k, sint32 v)
299 { 316 {
317 force (MAX_KEYWORD_LEN + 2 + sint32_digits);
300 add (keyword_str [k], keyword_len [k]); 318 fadd (keyword_str [k], keyword_len [k]);
301 add (' '); 319 fadd (' ');
302 add (v); 320 add (v);
303 add ('\n'); 321 fadd ('\n');
304 }
305
306 void put (keyword kbeg, keyword kend, const shstr &v)
307 {
308 add (keyword_str [kbeg], keyword_len [kbeg]); add ('\n');
309
310 if (expect_true (v))
311 {
312 add (v);
313 add ('\n');
314 }
315
316 add (keyword_str [kend], keyword_len [kend]); add ('\n');
317 } 322 }
318 323
319 void put (keyword k, float v) { put (k, (double)v); } 324 void put (keyword k, float v) { put (k, (double)v); }
320 void put (keyword k, signed char v) { put_(k, (sint32)v); } 325 void put (keyword k, signed char v) { put_(k, (sint32)v); }
321 void put (keyword k, unsigned char v) { put_(k, (sint32)v); } 326 void put (keyword k, unsigned char v) { put_(k, (sint32)v); }
… …
326 void put (keyword k, signed long v) { put_(k, (sint64)v); } 331 void put (keyword k, signed long v) { put_(k, (sint64)v); }
327 void put (keyword k, unsigned long v) { put_(k, (sint64)v); } 332 void put (keyword k, unsigned long v) { put_(k, (sint64)v); }
328 void put (keyword k, signed long long v) { put_(k, (sint64)v); } 333 void put (keyword k, signed long long v) { put_(k, (sint64)v); }
329 void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } 334 void put (keyword k, unsigned long long v) { put_(k, (sint64)v); }
330 335
331 template<typename T> 336 void put (keyword kbeg, keyword kend, const shstr &v)
332 void put (keyword k, const T *v)
333 { 337 {
338 force (MAX_KEYWORD_LEN + 1);
339 fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n');
340
334 if (expect_true (v)) 341 if (expect_true (v))
335 put (k, v->name); 342 {
336 else 343 add (v);
337 put (k, (const char *)0); 344 add ('\n');
345 }
346
347 force (MAX_KEYWORD_LEN + 1);
348 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n');
338 } 349 }
350
351 void put (keyword k, archetype *v);
352 void put (keyword k, treasurelist *v);
353 void put (keyword k, faceinfo *v);
339 354
340 template<typename T> 355 template<typename T>
341 void put (keyword k, const refptr<T> &v) 356 void put (keyword k, const refptr<T> &v)
342 { 357 {
343 put (k, (T *)v); 358 put (k, (T *)v);
… …
370 void get (attachable *obj, int oid); 385 void get (attachable *obj, int oid);
371 386
372 // parse next line 387 // parse next line
373 void next (); 388 void next ();
374 // skip the current key-value (usually fetch next line, for 389 // skip the current key-value (usually fetch next line, for
375 // multiline-fields, skips untilt he corresponding end-kw 390 // multiline-fields, skips till the corresponding end-kw
376 void skip (); 391 void skip ();
377
378 //TODO: remove, deprecated
379 keyword get_kv ()
380 {
381 next ();
382 return kw;
383 }
384 392
385 char *get_str () { return value; } // may be 0 393 char *get_str () { return value; } // may be 0
386 void get_ml (keyword kend, shstr &sh); 394 void get_ml (keyword kend, shstr &sh);
387 395
388 void get_ornull (shstr &sh) const { sh = value; } 396 void get_ornull (shstr &sh) const { sh = value; }
389 void get (shstr &sh) const { sh = value; } // might want to check for non-null here 397 void get (shstr &sh) const { sh = value; } // might want to check for non-null here
390 398
391 bool get_bool () const { return *value_nn == '1'; } 399 bool get_bool () const { return *value_nn == '1'; }
392 sint32 get_sint32 () const; 400 sint32 get_sint32 () const;
393 sint64 get_sint64 () const { return atoll (value_nn); } 401 sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); }
394 double get_double () const { return atof (value_nn); } 402 double get_double () const { return strtod (value_nn, 0); }
395 403
396 void get (float &v) { v = get_double (); } 404 void get (float &v) { v = get_double (); }
397 void get (double &v) { v = get_double (); } 405 void get (double &v) { v = get_double (); }
398 406
399 void get (bool &i) { i = get_bool (); } 407 void get (bool &i) { i = get_bool (); }
… …
418 static struct CoroAPI *GCoroAPI; 426 static struct CoroAPI *GCoroAPI;
419 427
420 static int nready () { return CORO_NREADY; } 428 static int nready () { return CORO_NREADY; }
421 static int cede () { return CORO_CEDE ; } 429 static int cede () { return CORO_CEDE ; }
422 430
423 static double (*time)();
424 static double next_cede; 431 static tstamp next_cede;
425 static int cede_counter; 432 static int cede_counter;
426 433
427 static void do_cede_every (); 434 static void do_cede_every ();
428 static void do_cede_to_tick (); 435 static void do_cede_to_tick ();
429 static void do_cede_to_tick_every (); 436 static void do_cede_to_tick_every ();
… …
432 { 439 {
433 if (expect_false (++cede_counter >= count)) 440 if (expect_false (++cede_counter >= count))
434 do_cede_every (); 441 do_cede_every ();
435 } 442 }
436 443
437 static void cede_to_tick () 444 static bool cede_to_tick ()
438 { 445 {
439 if (expect_false (time () >= next_cede)) 446 if (expect_true (now () < next_cede))
447 return false;
448
440 do_cede_to_tick (); 449 do_cede_to_tick ();
450 return true;
441 } 451 }
442 452
443 static void cede_to_tick_every (int count) 453 static bool cede_to_tick_every (int count)
444 { 454 {
445 if (expect_false (++cede_counter >= count)) 455 if (expect_true (++cede_counter < count))
456 return false;
457
446 cede_to_tick (); 458 return cede_to_tick ();
447 } 459 }
448 460
449 static void wait_for_tick (); 461 static void wait_for_tick ();
450 static void wait_for_tick_begin (); 462 static void wait_for_tick_begin ();
451}; 463};

Diff Legend

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