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.68 by root, Sun May 27 23:22:29 2007 UTC vs.
Revision 1.83 by root, Fri Jul 13 15:54:40 2007 UTC

1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
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
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22 */
23
1// 24//
2// cfperl.h perl interface 25// cfperl.h perl interface
3// 26//
4#ifndef CFPERL_H__ 27#ifndef CFPERL_H__
5#define CFPERL_H__ 28#define CFPERL_H__
65void cfperl_init (); 88void cfperl_init ();
66void cfperl_main (); 89void cfperl_main ();
67void cfperl_emergency_save (); 90void cfperl_emergency_save ();
68void cfperl_cleanup (int make_core); 91void cfperl_cleanup (int make_core);
69void cfperl_make_book (object *book, int level); 92void cfperl_make_book (object *book, int level);
93void cfperl_send_msg (client *ns, int color, const char *type, const char *msg);
70 94
71////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 95//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
72 96
73// virtual server time, excluding time jumps and lag 97extern tstamp runtime; // virtual server time, excluding time jumps and lag
74extern double runtime; 98extern tstamp NOW; // real time of current server tick
75 99
76enum event_klass 100enum event_klass
77{ 101{
78 KLASS_NONE, 102 KLASS_NONE,
79 KLASS_GLOBAL, 103 KLASS_GLOBAL,
150 MTH void refcnt_inc () const { ++refcnt; } 174 MTH void refcnt_inc () const { ++refcnt; }
151 MTH void refcnt_dec () const { --refcnt; } 175 MTH void refcnt_dec () const { --refcnt; }
152 176
153 MTH int refcnt_cnt () const; 177 MTH int refcnt_cnt () const;
154 // check wether the object has died and destroy 178 // check wether the object has died and destroy
155 MTH void refcnt_chk () { if (refcnt <= 0) do_check (); } 179 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); }
156 180
157 // destroy the object unless it was already destroyed 181 // destroy the object unless it was already destroyed
158 // this politely asks everybody interested the reduce 182 // this politely asks everybody interested the reduce
159 // the refcount to 0 as soon as possible. 183 // the refcount to 0 as soon as possible.
160 MTH void destroy (); 184 MTH void destroy ();
185 attachable (const attachable &src) 209 attachable (const attachable &src)
186 : flags (0), refcnt (0), self (0), cb (0), attach (src.attach) 210 : flags (0), refcnt (0), self (0), cb (0), attach (src.attach)
187 { 211 {
188 } 212 }
189 213
190 virtual ~attachable (); 214 // set a custom key to the given value, or delete it if value = 0
215 void set_key (const char *key, const char *value = 0);
191 216
192 attachable &operator =(const attachable &src); 217 attachable &operator =(const attachable &src);
193 218
194 // used to _quickly_ device wether to shortcut the evaluation 219 // used to _quickly_ device wether to shortcut the evaluation
195 bool should_invoke (event_type event) 220 bool should_invoke (event_type event)
206 // do the real refcount checking work 231 // do the real refcount checking work
207 void do_check (); 232 void do_check ();
208 233
209 // the method that does the real destroy work 234 // the method that does the real destroy work
210 virtual void do_destroy (); 235 virtual void do_destroy ();
236
237 // destructor is protected, should not be called by anybody
238 virtual ~attachable ();
211}; 239};
212 240
213// the global object is a pseudo object that cares for the global events 241// the global object is a pseudo object that cares for the global events
214struct global : attachable 242struct global : attachable
215{ 243{
238 add (' '), add (v); 266 add (' '), add (v);
239 267
240 add ('\n'); 268 add ('\n');
241 } 269 }
242 270
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> 271 template<typename T>
253 void put_string (keyword k, const T &v) 272 void put_kw_string (keyword k, const T &v)
254 { 273 {
255 int klen = keyword_len [k]; 274 int klen = keyword_len [k];
256 int vlen = v ? strlen (v) + 1 : 0; 275 int vlen = v ? strlen (v) + 1 : 0;
257 276
258 char *p = (char *)alloc (klen + vlen + 1); 277 char *p = (char *)alloc (klen + vlen + 1);
268 *p = '\n'; 287 *p = '\n';
269 } 288 }
270 289
271 void put (keyword k, const char *v = 0) 290 void put (keyword k, const char *v = 0)
272 { 291 {
273 put_string (k, v); 292 put_kw_string (k, v);
274 } 293 }
275 294
276 void put (keyword k, const shstr &v) 295 void put (keyword k, const shstr &v)
277 { 296 {
278 put_string (k, v); 297 put_kw_string (k, v);
279 } 298 }
280 299
281 void put (keyword k, double v) 300 void put (keyword k, double v)
282 { 301 {
283 force (32); 302 force (MAX_KEYWORD_LEN + 2 + 32);
303 fadd (keyword_str [k], keyword_len [k]);
304 fadd (' ');
284 ptr += sprintf (ptr, "%.7g", v); 305 falloc (sprintf (ptr, "%.7g", v));
306 fadd ('\n');
285 } 307 }
286 308
287 void put_(keyword k, sint64 v) 309 void put_(keyword k, sint64 v)
288 { 310 {
311 force (MAX_KEYWORD_LEN + 2 + sint64_digits);
289 add (keyword_str [k], keyword_len [k]); 312 fadd (keyword_str [k], keyword_len [k]);
290 add (' '); 313 fadd (' ');
291 add (v); 314 add (v);
292 add ('\n'); 315 fadd ('\n');
293 } 316 }
294 317
295 void put_(keyword k, sint32 v) 318 void put_(keyword k, sint32 v)
296 { 319 {
320 force (MAX_KEYWORD_LEN + 2 + sint32_digits);
297 add (keyword_str [k], keyword_len [k]); 321 fadd (keyword_str [k], keyword_len [k]);
298 add (' '); 322 fadd (' ');
299 add (v); 323 add (v);
300 add ('\n'); 324 fadd ('\n');
301 }
302
303 void put (keyword kbeg, keyword kend, const shstr &v)
304 {
305 add (keyword_str [kbeg], keyword_len [kbeg]); add ('\n');
306
307 if (expect_true (v))
308 {
309 add (v);
310 add ('\n');
311 }
312
313 add (keyword_str [kend], keyword_len [kend]); add ('\n');
314 } 325 }
315 326
316 void put (keyword k, float v) { put (k, (double)v); } 327 void put (keyword k, float v) { put (k, (double)v); }
317 void put (keyword k, signed char v) { put_(k, (sint32)v); } 328 void put (keyword k, signed char v) { put_(k, (sint32)v); }
318 void put (keyword k, unsigned char v) { put_(k, (sint32)v); } 329 void put (keyword k, unsigned char v) { put_(k, (sint32)v); }
323 void put (keyword k, signed long v) { put_(k, (sint64)v); } 334 void put (keyword k, signed long v) { put_(k, (sint64)v); }
324 void put (keyword k, unsigned long v) { put_(k, (sint64)v); } 335 void put (keyword k, unsigned long v) { put_(k, (sint64)v); }
325 void put (keyword k, signed long long v) { put_(k, (sint64)v); } 336 void put (keyword k, signed long long v) { put_(k, (sint64)v); }
326 void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } 337 void put (keyword k, unsigned long long v) { put_(k, (sint64)v); }
327 338
328 template<typename T> 339 void put (keyword kbeg, keyword kend, const shstr &v)
329 void put (keyword k, const T *v)
330 { 340 {
341 force (MAX_KEYWORD_LEN + 1);
342 fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n');
343
331 if (expect_true (v)) 344 if (expect_true (v))
332 put (k, v->name); 345 {
333 else 346 add (v);
334 put (k, (const char *)0); 347 add ('\n');
348 }
349
350 force (MAX_KEYWORD_LEN + 1);
351 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n');
335 } 352 }
353
354 void put (keyword k, archetype *v);
355 void put (keyword k, treasurelist *v);
356 void put (keyword k, faceinfo *v);
336 357
337 template<typename T> 358 template<typename T>
338 void put (keyword k, const refptr<T> &v) 359 void put (keyword k, const refptr<T> &v)
339 { 360 {
340 put (k, (T *)v); 361 put (k, (T *)v);
367 void get (attachable *obj, int oid); 388 void get (attachable *obj, int oid);
368 389
369 // parse next line 390 // parse next line
370 void next (); 391 void next ();
371 // skip the current key-value (usually fetch next line, for 392 // skip the current key-value (usually fetch next line, for
372 // multiline-fields, skips untilt he corresponding end-kw 393 // multiline-fields, skips till the corresponding end-kw
373 void skip (); 394 void skip ();
374
375 //TODO: remove, deprecated
376 keyword get_kv ()
377 {
378 next ();
379 return kw;
380 }
381 395
382 char *get_str () { return value; } // may be 0 396 char *get_str () { return value; } // may be 0
383 void get_ml (keyword kend, shstr &sh); 397 void get_ml (keyword kend, shstr &sh);
384 398
385 void get_ornull (shstr &sh) const { sh = value; } 399 void get_ornull (shstr &sh) const { sh = value; }
386 void get (shstr &sh) const { sh = value; } // might want to check for non-null here 400 void get (shstr &sh) const { sh = value; } // might want to check for non-null here
387 401
388 bool get_bool () const { return *value_nn == '1'; } 402 bool get_bool () const { return *value_nn == '1'; }
389 sint32 get_sint32 () const; 403 sint32 get_sint32 () const;
390 sint64 get_sint64 () const { return atoll (value_nn); } 404 sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); }
391 double get_double () const { return atof (value_nn); } 405 double get_double () const { return strtod (value_nn, 0); }
392 406
393 void get (float &v) { v = get_double (); } 407 void get (float &v) { v = get_double (); }
394 void get (double &v) { v = get_double (); } 408 void get (double &v) { v = get_double (); }
395 409
396 void get (bool &i) { i = get_bool (); } 410 void get (bool &i) { i = get_bool (); }
415 static struct CoroAPI *GCoroAPI; 429 static struct CoroAPI *GCoroAPI;
416 430
417 static int nready () { return CORO_NREADY; } 431 static int nready () { return CORO_NREADY; }
418 static int cede () { return CORO_CEDE ; } 432 static int cede () { return CORO_CEDE ; }
419 433
420 static double (*time)();
421 static double next_cede; 434 static tstamp next_cede;
422 static int cede_counter; 435 static int cede_counter;
423 436
424 static void do_cede_every (); 437 static void do_cede_every ();
425 static void do_cede_to_tick (); 438 static void do_cede_to_tick ();
426 static void do_cede_to_tick_every (); 439 static void do_cede_to_tick_every ();
429 { 442 {
430 if (expect_false (++cede_counter >= count)) 443 if (expect_false (++cede_counter >= count))
431 do_cede_every (); 444 do_cede_every ();
432 } 445 }
433 446
434 static void cede_to_tick () 447 static bool cede_to_tick ()
435 { 448 {
436 if (expect_false (time () >= next_cede)) 449 if (expect_true (now () < next_cede))
450 return false;
451
437 do_cede_to_tick (); 452 do_cede_to_tick ();
453 return true;
438 } 454 }
439 455
440 static void cede_to_tick_every (int count) 456 static bool cede_to_tick_every (int count)
441 { 457 {
442 if (expect_false (++cede_counter >= count)) 458 if (expect_true (++cede_counter < count))
459 return false;
460
443 cede_to_tick (); 461 return cede_to_tick ();
444 } 462 }
445 463
446 static void wait_for_tick (); 464 static void wait_for_tick ();
447 static void wait_for_tick_begin (); 465 static void wait_for_tick_begin ();
448}; 466};

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines