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.78 by root, Wed Jun 6 05:41:26 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__
… …
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 ();
… …
238 add (' '), add (v); 262 add (' '), add (v);
239 263
240 add ('\n'); 264 add ('\n');
241 } 265 }
242 266
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> 267 template<typename T>
253 void put_string (keyword k, const T &v) 268 void put_kw_string (keyword k, const T &v)
254 { 269 {
255 int klen = keyword_len [k]; 270 int klen = keyword_len [k];
256 int vlen = v ? strlen (v) + 1 : 0; 271 int vlen = v ? strlen (v) + 1 : 0;
257 272
258 char *p = (char *)alloc (klen + vlen + 1); 273 char *p = (char *)alloc (klen + vlen + 1);
… …
268 *p = '\n'; 283 *p = '\n';
269 } 284 }
270 285
271 void put (keyword k, const char *v = 0) 286 void put (keyword k, const char *v = 0)
272 { 287 {
273 put_string (k, v); 288 put_kw_string (k, v);
274 } 289 }
275 290
276 void put (keyword k, const shstr &v) 291 void put (keyword k, const shstr &v)
277 { 292 {
278 put_string (k, v); 293 put_kw_string (k, v);
279 } 294 }
280 295
281 void put (keyword k, double v) 296 void put (keyword k, double v)
282 { 297 {
283 force (32); 298 force (MAX_KEYWORD_LEN + 2 + 32);
299 fadd (keyword_str [k], keyword_len [k]);
300 fadd (' ');
284 ptr += sprintf (ptr, "%.7g", v); 301 falloc (sprintf (ptr, "%.7g", v));
302 fadd ('\n');
285 } 303 }
286 304
287 void put_(keyword k, sint64 v) 305 void put_(keyword k, sint64 v)
288 { 306 {
307 force (MAX_KEYWORD_LEN + 2 + sint64_digits);
289 add (keyword_str [k], keyword_len [k]); 308 fadd (keyword_str [k], keyword_len [k]);
290 add (' '); 309 fadd (' ');
291 add (v); 310 add (v);
292 add ('\n'); 311 fadd ('\n');
293 } 312 }
294 313
295 void put_(keyword k, sint32 v) 314 void put_(keyword k, sint32 v)
296 { 315 {
316 force (MAX_KEYWORD_LEN + 2 + sint32_digits);
297 add (keyword_str [k], keyword_len [k]); 317 fadd (keyword_str [k], keyword_len [k]);
298 add (' '); 318 fadd (' ');
299 add (v); 319 add (v);
300 add ('\n'); 320 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 } 321 }
315 322
316 void put (keyword k, float v) { put (k, (double)v); } 323 void put (keyword k, float v) { put (k, (double)v); }
317 void put (keyword k, signed char v) { put_(k, (sint32)v); } 324 void put (keyword k, signed char v) { put_(k, (sint32)v); }
318 void put (keyword k, unsigned char v) { put_(k, (sint32)v); } 325 void put (keyword k, unsigned char v) { put_(k, (sint32)v); }
… …
323 void put (keyword k, signed long v) { put_(k, (sint64)v); } 330 void put (keyword k, signed long v) { put_(k, (sint64)v); }
324 void put (keyword k, unsigned long v) { put_(k, (sint64)v); } 331 void put (keyword k, unsigned long v) { put_(k, (sint64)v); }
325 void put (keyword k, signed long long v) { put_(k, (sint64)v); } 332 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); } 333 void put (keyword k, unsigned long long v) { put_(k, (sint64)v); }
327 334
328 template<typename T> 335 void put (keyword kbeg, keyword kend, const shstr &v)
329 void put (keyword k, const T *v)
330 { 336 {
337 force (MAX_KEYWORD_LEN + 1);
338 fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n');
339
331 if (expect_true (v)) 340 if (expect_true (v))
332 put (k, v->name); 341 {
333 else 342 add (v);
334 put (k, (const char *)0); 343 add ('\n');
344 }
345
346 force (MAX_KEYWORD_LEN + 1);
347 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n');
335 } 348 }
349
350 void put (keyword k, archetype *v);
351 void put (keyword k, treasurelist *v);
352 void put (keyword k, faceinfo *v);
336 353
337 template<typename T> 354 template<typename T>
338 void put (keyword k, const refptr<T> &v) 355 void put (keyword k, const refptr<T> &v)
339 { 356 {
340 put (k, (T *)v); 357 put (k, (T *)v);
… …
367 void get (attachable *obj, int oid); 384 void get (attachable *obj, int oid);
368 385
369 // parse next line 386 // parse next line
370 void next (); 387 void next ();
371 // skip the current key-value (usually fetch next line, for 388 // skip the current key-value (usually fetch next line, for
372 // multiline-fields, skips untilt he corresponding end-kw 389 // multiline-fields, skips till the corresponding end-kw
373 void skip (); 390 void skip ();
374
375 //TODO: remove, deprecated
376 keyword get_kv ()
377 {
378 next ();
379 return kw;
380 }
381 391
382 char *get_str () { return value; } // may be 0 392 char *get_str () { return value; } // may be 0
383 void get_ml (keyword kend, shstr &sh); 393 void get_ml (keyword kend, shstr &sh);
384 394
385 void get_ornull (shstr &sh) const { sh = value; } 395 void get_ornull (shstr &sh) const { sh = value; }
386 void get (shstr &sh) const { sh = value; } // might want to check for non-null here 396 void get (shstr &sh) const { sh = value; } // might want to check for non-null here
387 397
388 bool get_bool () const { return *value_nn == '1'; } 398 bool get_bool () const { return *value_nn == '1'; }
389 sint32 get_sint32 () const; 399 sint32 get_sint32 () const;
390 sint64 get_sint64 () const { return atoll (value_nn); } 400 sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); }
391 double get_double () const { return atof (value_nn); } 401 double get_double () const { return strtod (value_nn, 0); }
392 402
393 void get (float &v) { v = get_double (); } 403 void get (float &v) { v = get_double (); }
394 void get (double &v) { v = get_double (); } 404 void get (double &v) { v = get_double (); }
395 405
396 void get (bool &i) { i = get_bool (); } 406 void get (bool &i) { i = get_bool (); }
… …
429 { 439 {
430 if (expect_false (++cede_counter >= count)) 440 if (expect_false (++cede_counter >= count))
431 do_cede_every (); 441 do_cede_every ();
432 } 442 }
433 443
434 static void cede_to_tick () 444 static bool cede_to_tick ()
435 { 445 {
436 if (expect_false (time () >= next_cede)) 446 if (expect_true (time () < next_cede))
447 return false;
448
437 do_cede_to_tick (); 449 do_cede_to_tick ();
450 return true;
438 } 451 }
439 452
440 static void cede_to_tick_every (int count) 453 static bool cede_to_tick_every (int count)
441 { 454 {
442 if (expect_false (++cede_counter >= count)) 455 if (expect_true (++cede_counter < count))
456 return false;
457
443 cede_to_tick (); 458 return cede_to_tick ();
444 } 459 }
445 460
446 static void wait_for_tick (); 461 static void wait_for_tick ();
447 static void wait_for_tick_begin (); 462 static void wait_for_tick_begin ();
448}; 463};

Diff Legend

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