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.73 by root, Mon May 28 05:35:51 2007 UTC vs.
Revision 1.82 by root, Wed Jul 11 16:55:18 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 ();
… …
187 { 211 {
188 } 212 }
189 213
190 virtual ~attachable (); 214 virtual ~attachable ();
191 215
216 // set a custom key to the given value, or delete it if value = 0
217 void set_key (const char *key, const char *value = 0);
218
192 attachable &operator =(const attachable &src); 219 attachable &operator =(const attachable &src);
193 220
194 // used to _quickly_ device wether to shortcut the evaluation 221 // used to _quickly_ device wether to shortcut the evaluation
195 bool should_invoke (event_type event) 222 bool should_invoke (event_type event)
196 { 223 {
… …
239 266
240 add ('\n'); 267 add ('\n');
241 } 268 }
242 269
243 template<typename T> 270 template<typename T>
244 void put_string (keyword k, const T &v) 271 void put_kw_string (keyword k, const T &v)
245 { 272 {
246 int klen = keyword_len [k]; 273 int klen = keyword_len [k];
247 int vlen = v ? strlen (v) + 1 : 0; 274 int vlen = v ? strlen (v) + 1 : 0;
248 275
249 char *p = (char *)alloc (klen + vlen + 1); 276 char *p = (char *)alloc (klen + vlen + 1);
… …
259 *p = '\n'; 286 *p = '\n';
260 } 287 }
261 288
262 void put (keyword k, const char *v = 0) 289 void put (keyword k, const char *v = 0)
263 { 290 {
264 put_string (k, v); 291 put_kw_string (k, v);
265 } 292 }
266 293
267 void put (keyword k, const shstr &v) 294 void put (keyword k, const shstr &v)
268 { 295 {
269 put_string (k, v); 296 put_kw_string (k, v);
270 } 297 }
271 298
272 void put (keyword k, double v) 299 void put (keyword k, double v)
273 { 300 {
274 force (MAX_KEYWORD_LEN + 2 + 32); 301 force (MAX_KEYWORD_LEN + 2 + 32);
… …
321 348
322 force (MAX_KEYWORD_LEN + 1); 349 force (MAX_KEYWORD_LEN + 1);
323 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); 350 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n');
324 } 351 }
325 352
326 template<typename T> 353 void put (keyword k, archetype *v);
354 void put (keyword k, treasurelist *v);
327 void put (keyword k, const T *v) 355 void put (keyword k, faceinfo *v);
328 {
329 if (v)
330 put (k, v->name);
331 else
332 put (k, (const char *)0);
333 }
334 356
335 template<typename T> 357 template<typename T>
336 void put (keyword k, const refptr<T> &v) 358 void put (keyword k, const refptr<T> &v)
337 { 359 {
338 put (k, (T *)v); 360 put (k, (T *)v);
… …
406 static struct CoroAPI *GCoroAPI; 428 static struct CoroAPI *GCoroAPI;
407 429
408 static int nready () { return CORO_NREADY; } 430 static int nready () { return CORO_NREADY; }
409 static int cede () { return CORO_CEDE ; } 431 static int cede () { return CORO_CEDE ; }
410 432
411 static double (*time)();
412 static double next_cede; 433 static tstamp next_cede;
413 static int cede_counter; 434 static int cede_counter;
414 435
415 static void do_cede_every (); 436 static void do_cede_every ();
416 static void do_cede_to_tick (); 437 static void do_cede_to_tick ();
417 static void do_cede_to_tick_every (); 438 static void do_cede_to_tick_every ();
… …
420 { 441 {
421 if (expect_false (++cede_counter >= count)) 442 if (expect_false (++cede_counter >= count))
422 do_cede_every (); 443 do_cede_every ();
423 } 444 }
424 445
425 static void cede_to_tick () 446 static bool cede_to_tick ()
426 { 447 {
427 if (expect_false (time () >= next_cede)) 448 if (expect_true (now () < next_cede))
449 return false;
450
428 do_cede_to_tick (); 451 do_cede_to_tick ();
452 return true;
429 } 453 }
430 454
431 static void cede_to_tick_every (int count) 455 static bool cede_to_tick_every (int count)
432 { 456 {
433 if (expect_false (++cede_counter >= count)) 457 if (expect_true (++cede_counter < count))
458 return false;
459
434 cede_to_tick (); 460 return cede_to_tick ();
435 } 461 }
436 462
437 static void wait_for_tick (); 463 static void wait_for_tick ();
438 static void wait_for_tick_begin (); 464 static void wait_for_tick_begin ();
439}; 465};

Diff Legend

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