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.75 by root, Sun Jun 3 11:22:02 2007 UTC vs.
Revision 1.86 by root, Mon Aug 6 10:54:12 2007 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it 8 * Crossfire TRT is free software: you can redistribute it and/or modify
9 * under the terms of the GNU General Public License as published by the Free 9 * it under the terms of the GNU General Public License as published by
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * the Free Software Foundation, either version 3 of the License, or
11 * any later version. 11 * (at your option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License along 18 * You should have received a copy of the GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 20 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25// 24//
… …
89void cfperl_init (); 88void cfperl_init ();
90void cfperl_main (); 89void cfperl_main ();
91void cfperl_emergency_save (); 90void cfperl_emergency_save ();
92void cfperl_cleanup (int make_core); 91void cfperl_cleanup (int make_core);
93void 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);
94int cfperl_can_merge (object *ob1, object *ob2);
94 95
95////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 96//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
96 97
97// virtual server time, excluding time jumps and lag 98extern tstamp runtime; // virtual server time, excluding time jumps and lag
98extern double runtime; 99extern tstamp NOW; // real time of current server tick
99 100
100enum event_klass 101enum event_klass
101{ 102{
102 KLASS_NONE, 103 KLASS_NONE,
103 KLASS_GLOBAL, 104 KLASS_GLOBAL,
… …
153int cfperl_result_INT (int idx); 154int cfperl_result_INT (int idx);
154 155
155////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 156//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
156 157
157INTERFACE_CLASS (attachable) 158INTERFACE_CLASS (attachable)
158struct attachable 159struct attachable : refcnt_base
159{ 160{
160 static MGVTBL vtbl; 161 static MGVTBL vtbl;
161 162
162 static unordered_vector<attachable *> mortals; 163 static unordered_vector<attachable *> mortals;
163 MTH static void check_mortals (); 164 MTH static void check_mortals ();
164 165
165 enum { 166 enum {
166 F_DESTROYED = 0x01, 167 F_DESTROYED = 0x01,
167 F_DEBUG_TRACE = 0x02, 168 F_DEBUG_TRACE = 0x02,
168 }; 169 };
170 int ACC (RW, flags);
169 171
170 // object is delete'd after the refcount reaches 0 172 // object is delete'd after the refcount reaches 0
171 int ACC (RW, flags);
172 mutable int ACC (RW, refcnt);
173
174 MTH void refcnt_inc () const { ++refcnt; }
175 MTH void refcnt_dec () const { --refcnt; }
176
177 MTH int refcnt_cnt () const; 173 MTH int refcnt_cnt () const;
178 // check wether the object has died and destroy 174 // check wether the object has died and destroy
179 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } 175 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); }
180 176
181 // destroy the object unless it was already destroyed 177 // destroy the object unless it was already destroyed
… …
200 196
201 void sever_self (); // sever this object from its self, if it has one. 197 void sever_self (); // sever this object from its self, if it has one.
202 void optimise (); // possibly save some memory by destroying unneeded data 198 void optimise (); // possibly save some memory by destroying unneeded data
203 199
204 attachable () 200 attachable ()
205 : flags (0), refcnt (0), self (0), cb (0), attach (0) 201 : flags (0), self (0), cb (0), attach (0)
206 { 202 {
207 } 203 }
208 204
209 attachable (const attachable &src) 205 attachable (const attachable &src)
210 : flags (0), refcnt (0), self (0), cb (0), attach (src.attach) 206 : flags (0), self (0), cb (0), attach (src.attach)
211 { 207 {
212 } 208 }
213 209
214 virtual ~attachable (); 210 // set a custom key to the given value, or delete it if value = 0
211 void set_key (const char *key, const char *value = 0);
215 212
216 attachable &operator =(const attachable &src); 213 attachable &operator =(const attachable &src);
217 214
218 // used to _quickly_ device wether to shortcut the evaluation 215 // used to _quickly_ device wether to shortcut the evaluation
219 bool should_invoke (event_type event) 216 bool should_invoke (event_type event)
… …
230 // do the real refcount checking work 227 // do the real refcount checking work
231 void do_check (); 228 void do_check ();
232 229
233 // the method that does the real destroy work 230 // the method that does the real destroy work
234 virtual void do_destroy (); 231 virtual void do_destroy ();
232
233 // destructor is protected, should not be called by anybody
234 virtual ~attachable ();
235}; 235};
236 236
237// the global object is a pseudo object that cares for the global events 237// the global object is a pseudo object that cares for the global events
238struct global : attachable 238struct global : attachable
239{ 239{
… …
263 263
264 add ('\n'); 264 add ('\n');
265 } 265 }
266 266
267 template<typename T> 267 template<typename T>
268 void put_string (keyword k, const T &v) 268 void put_kw_string (keyword k, const T &v)
269 { 269 {
270 int klen = keyword_len [k]; 270 int klen = keyword_len [k];
271 int vlen = v ? strlen (v) + 1 : 0; 271 int vlen = v ? strlen (v) + 1 : 0;
272 272
273 char *p = (char *)alloc (klen + vlen + 1); 273 char *p = (char *)alloc (klen + vlen + 1);
… …
283 *p = '\n'; 283 *p = '\n';
284 } 284 }
285 285
286 void put (keyword k, const char *v = 0) 286 void put (keyword k, const char *v = 0)
287 { 287 {
288 put_string (k, v); 288 put_kw_string (k, v);
289 } 289 }
290 290
291 void put (keyword k, const shstr &v) 291 void put (keyword k, const shstr &v)
292 { 292 {
293 put_string (k, v); 293 put_kw_string (k, v);
294 } 294 }
295 295
296 void put (keyword k, double v) 296 void put (keyword k, double v)
297 { 297 {
298 force (MAX_KEYWORD_LEN + 2 + 32); 298 force (MAX_KEYWORD_LEN + 2 + 32);
… …
345 345
346 force (MAX_KEYWORD_LEN + 1); 346 force (MAX_KEYWORD_LEN + 1);
347 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); 347 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n');
348 } 348 }
349 349
350 template<typename T> 350 void put (keyword k, archetype *v);
351 void put (keyword k, treasurelist *v);
351 void put (keyword k, const T *v) 352 void put (keyword k, faceinfo *v);
352 {
353 if (v)
354 put (k, v->name);
355 else
356 put (k, (const char *)0);
357 }
358 353
359 template<typename T> 354 template<typename T>
360 void put (keyword k, const refptr<T> &v) 355 void put (keyword k, const refptr<T> &v)
361 { 356 {
362 put (k, (T *)v); 357 put (k, (T *)v);
… …
416 void get (sint32 &i) { i = get_sint32 (); } 411 void get (sint32 &i) { i = get_sint32 (); }
417 412
418 void get (uint32 &i) { i = get_sint64 (); } 413 void get (uint32 &i) { i = get_sint64 (); }
419 void get (sint64 &i) { i = get_sint64 (); } 414 void get (sint64 &i) { i = get_sint64 (); }
420 415
416 void parse_warn (const char *msg);
421 bool parse_error (const char *type = 0, const char *name = 0, bool skip = true); 417 bool parse_error (const char *type = 0, const char *name = 0, bool skip = true);
422}; 418};
423 419
424//TODO: remove 420//TODO: remove
425char *fgets (char *s, int n, object_thawer &thawer); 421char *fgets (char *s, int n, object_thawer &thawer);
… …
430 static struct CoroAPI *GCoroAPI; 426 static struct CoroAPI *GCoroAPI;
431 427
432 static int nready () { return CORO_NREADY; } 428 static int nready () { return CORO_NREADY; }
433 static int cede () { return CORO_CEDE ; } 429 static int cede () { return CORO_CEDE ; }
434 430
435 static double (*time)();
436 static double next_cede; 431 static tstamp next_cede;
437 static int cede_counter; 432 static int cede_counter;
438 433
439 static void do_cede_every (); 434 static void do_cede_every ();
440 static void do_cede_to_tick (); 435 static void do_cede_to_tick ();
441 static void do_cede_to_tick_every (); 436 static void do_cede_to_tick_every ();
… …
444 { 439 {
445 if (expect_false (++cede_counter >= count)) 440 if (expect_false (++cede_counter >= count))
446 do_cede_every (); 441 do_cede_every ();
447 } 442 }
448 443
449 static void cede_to_tick () 444 static bool cede_to_tick ()
450 { 445 {
451 if (expect_false (time () >= next_cede)) 446 if (expect_true (now () < next_cede))
447 return false;
448
452 do_cede_to_tick (); 449 do_cede_to_tick ();
450 return true;
453 } 451 }
454 452
455 static void cede_to_tick_every (int count) 453 static bool cede_to_tick_every (int count)
456 { 454 {
457 if (expect_false (++cede_counter >= count)) 455 if (expect_true (++cede_counter < count))
456 return false;
457
458 cede_to_tick (); 458 return cede_to_tick ();
459 } 459 }
460 460
461 static void wait_for_tick (); 461 static void wait_for_tick ();
462 static void wait_for_tick_begin (); 462 static void wait_for_tick_begin ();
463}; 463};

Diff Legend

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