| 1 | |
|
|
| 2 | /* |
1 | /* |
| 3 | * static char *rcsid_utils_c = |
|
|
| 4 | * "$Id: utils.C,v 1.11 2006/09/12 19:20:06 root Exp $"; |
|
|
| 5 | */ |
|
|
| 6 | |
|
|
| 7 | /* |
|
|
| 8 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
| 9 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
| 10 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
| 11 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
| 12 | |
7 | * |
| 13 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
| 14 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
| 15 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
| 16 | (at your option) any later version. |
11 | * (at your option) any later version. |
| 17 | |
12 | * |
| 18 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
| 19 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 21 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
| 22 | |
17 | * |
| 23 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
| 24 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
| 25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 26 | |
21 | * |
| 27 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
| 28 | */ |
23 | */ |
| 29 | |
24 | |
| 30 | /* |
25 | /* |
| 31 | * General convenience functions for crossfire. |
26 | * General convenience functions for crossfire. |
| 32 | */ |
27 | */ |
|
|
28 | |
|
|
29 | #include <cstdlib> |
|
|
30 | #include <sys/types.h> |
|
|
31 | #include <unistd.h> |
|
|
32 | #include <sys/time.h> |
|
|
33 | #include <time.h> |
|
|
34 | #include <signal.h> |
| 33 | |
35 | |
| 34 | #include <global.h> |
36 | #include <global.h> |
| 35 | #include <funcpoint.h> |
37 | #include <funcpoint.h> |
| 36 | #include <material.h> |
38 | #include <material.h> |
| 37 | |
39 | |
| 38 | #include <glib.h> |
40 | #include <glib.h> |
|
|
41 | |
|
|
42 | rand_gen rndm (time (0)); |
|
|
43 | |
|
|
44 | tausworthe_random_generator::tausworthe_random_generator (uint32_t seed) |
|
|
45 | { |
|
|
46 | state [0] = max ( 2, seed * 69069U); |
|
|
47 | state [1] = max ( 8, state [0] * 69069U); |
|
|
48 | state [2] = max ( 16, state [1] * 69069U); |
|
|
49 | state [3] = max (128, state [2] * 69069U); |
|
|
50 | |
|
|
51 | for (int i = 11; --i; ) |
|
|
52 | operator ()(); |
|
|
53 | } |
|
|
54 | |
|
|
55 | uint32_t |
|
|
56 | tausworthe_random_generator::next () |
|
|
57 | { |
|
|
58 | state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U); |
|
|
59 | state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U); |
|
|
60 | state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U); |
|
|
61 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
|
|
62 | |
|
|
63 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
|
|
64 | } |
| 39 | |
65 | |
| 40 | /* |
66 | /* |
| 41 | * The random functions here take luck into account when rolling random |
67 | * The random functions here take luck into account when rolling random |
| 42 | * dice or numbers. This function has less of an impact the larger the |
68 | * dice or numbers. This function has less of an impact the larger the |
| 43 | * difference becomes in the random numbers. IE, the effect is lessened |
69 | * difference becomes in the random numbers. IE, the effect is lessened |
| … | |
… | |
| 50 | * Roll a random number between min and max. Uses op to determine luck, |
76 | * Roll a random number between min and max. Uses op to determine luck, |
| 51 | * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
77 | * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
| 52 | * Generally, op should be the player/caster/hitter requesting the roll, |
78 | * Generally, op should be the player/caster/hitter requesting the roll, |
| 53 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
79 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
| 54 | */ |
80 | */ |
| 55 | |
|
|
| 56 | int |
81 | int |
| 57 | random_roll (int min, int max, const object *op, int goodbad) |
82 | random_roll (int min, int max, const object *op, int goodbad) |
| 58 | { |
83 | { |
| 59 | int omin, diff, luck, base, ran; |
84 | int omin, diff, luck, base, ran; |
| 60 | |
85 | |
| … | |
… | |
| 103 | diff = max - min + 1; |
128 | diff = max - min + 1; |
| 104 | ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ |
129 | ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ |
| 105 | |
130 | |
| 106 | if (max < 1 || diff < 1) |
131 | if (max < 1 || diff < 1) |
| 107 | { |
132 | { |
| 108 | #ifndef WIN32 |
|
|
| 109 | LOG (llevError, "Calling random_roll with min=%lld max=%lld\n", min, max); |
|
|
| 110 | #else |
|
|
| 111 | LOG (llevError, "Calling random_roll with min=%I64d max=%I64d\n", min, max); |
133 | LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
| 112 | #endif |
|
|
| 113 | return (min); /* avoids a float exception */ |
134 | return (min); /* avoids a float exception */ |
| 114 | } |
135 | } |
| 115 | |
136 | |
| 116 | /* Don't know of a portable call to get 64 bit random values. |
137 | /* Don't know of a portable call to get 64 bit random values. |
| 117 | * So make a call to get two 32 bit random numbers, and just to |
138 | * So make a call to get two 32 bit random numbers, and just to |
| … | |
… | |
| 184 | } |
205 | } |
| 185 | } |
206 | } |
| 186 | return (total); |
207 | return (total); |
| 187 | } |
208 | } |
| 188 | |
209 | |
| 189 | /* |
|
|
| 190 | * Another convenience function. Returns a number between min and max. |
|
|
| 191 | * It is suggested one use these functions rather than RANDOM()%, as it |
|
|
| 192 | * would appear that a number of off-by-one-errors exist due to improper |
|
|
| 193 | * use of %. This should also prevent SIGFPE. |
|
|
| 194 | */ |
|
|
| 195 | |
|
|
| 196 | int |
|
|
| 197 | rndm (int min, int max) |
|
|
| 198 | { |
|
|
| 199 | int diff; |
|
|
| 200 | |
|
|
| 201 | diff = max - min + 1; |
|
|
| 202 | if (max < 1 || diff < 1) |
|
|
| 203 | return (min); |
|
|
| 204 | |
|
|
| 205 | return (RANDOM () % diff + min); |
|
|
| 206 | } |
|
|
| 207 | |
|
|
| 208 | /* decay and destroy persihable items in a map */ |
210 | /* decay and destroy perishable items in a map */ |
| 209 | |
|
|
| 210 | void |
211 | void |
| 211 | decay_objects (mapstruct *m) |
212 | maptile::decay_objects () |
| 212 | { |
213 | { |
| 213 | int x, y, destroy; |
214 | if (!spaces) |
| 214 | object *op, *otmp; |
|
|
| 215 | |
|
|
| 216 | if (m->unique) |
|
|
| 217 | return; |
215 | return; |
| 218 | |
216 | |
| 219 | for (x = 0; x < MAP_WIDTH (m); x++) |
217 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 220 | for (y = 0; y < MAP_HEIGHT (m); y++) |
218 | for (object *above, *op = ms->bot; op; op = above) |
| 221 | for (op = get_map_ob (m, x, y); op; op = otmp) |
|
|
| 222 | { |
219 | { |
|
|
220 | above = op->above; |
|
|
221 | |
| 223 | destroy = 0; |
222 | bool destroy = 0; |
| 224 | otmp = op->above; |
223 | |
|
|
224 | // do not decay anything above unique floor tiles (yet :) |
| 225 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
225 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
| 226 | break; |
226 | break; |
|
|
227 | |
| 227 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) || |
228 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
| 228 | QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) || |
229 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
| 229 | QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) || |
230 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
| 230 | QUERY_FLAG (op, FLAG_UNIQUE) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) || QUERY_FLAG (op, FLAG_UNPAID) || IS_LIVE (op)) |
231 | || QUERY_FLAG (op, FLAG_UNIQUE) |
| 231 | continue; |
232 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
| 232 | /* otherwise, we decay and destroy */ |
233 | || QUERY_FLAG (op, FLAG_UNPAID) |
| 233 | if (IS_WEAPON (op)) |
234 | || op->is_alive ()) |
|
|
235 | ; // do not decay |
|
|
236 | else if (op->is_weapon ()) |
| 234 | { |
237 | { |
| 235 | op->stats.dam--; |
238 | op->stats.dam--; |
| 236 | if (op->stats.dam < 0) |
239 | if (op->stats.dam < 0) |
| 237 | destroy = 1; |
240 | destroy = 1; |
| 238 | } |
241 | } |
| 239 | else if (IS_ARMOR (op)) |
242 | else if (op->is_armor ()) |
| 240 | { |
243 | { |
| 241 | op->stats.ac--; |
244 | op->stats.ac--; |
| 242 | if (op->stats.ac < 0) |
245 | if (op->stats.ac < 0) |
| 243 | destroy = 1; |
246 | destroy = 1; |
| 244 | } |
247 | } |
| 245 | else if (op->type == FOOD) |
248 | else if (op->type == FOOD) |
| 246 | { |
249 | { |
| 247 | op->stats.food -= rndm (5, 20); |
250 | op->stats.food -= rndm (5, 20); |
| 248 | if (op->stats.food < 0) |
251 | if (op->stats.food < 0) |
| 249 | destroy = 1; |
252 | destroy = 1; |
| 250 | } |
253 | } |
| 251 | else |
254 | else |
| 252 | { |
255 | { |
| 253 | if (op->material & M_PAPER || op->material & M_LEATHER || |
256 | int mat = op->material; |
| 254 | op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID) |
257 | |
|
|
258 | if (mat & M_PAPER |
|
|
259 | || mat & M_LEATHER |
|
|
260 | || mat & M_WOOD |
|
|
261 | || mat & M_ORGANIC |
|
|
262 | || mat & M_CLOTH |
|
|
263 | || mat & M_LIQUID |
|
|
264 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
265 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
266 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
267 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
268 | || (mat & M_ICE && temp > 32)) |
| 255 | destroy = 1; |
269 | destroy = 1; |
| 256 | if (op->material & M_IRON && rndm (1, 5) == 1) |
|
|
| 257 | destroy = 1; |
|
|
| 258 | if (op->material & M_GLASS && rndm (1, 2) == 1) |
|
|
| 259 | destroy = 1; |
|
|
| 260 | if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
| 261 | destroy = 1; |
|
|
| 262 | if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1) |
|
|
| 263 | destroy = 1; |
|
|
| 264 | if (op->material & M_ICE && MAP_TEMP (m) > 32) |
|
|
| 265 | destroy = 1; |
|
|
| 266 | } |
270 | } |
|
|
271 | |
| 267 | /* adjust overall chance below */ |
272 | /* adjust overall chance below */ |
| 268 | if (destroy && rndm (0, 1)) |
273 | if (destroy && rndm (0, 1)) |
| 269 | { |
274 | op->destroy (); |
| 270 | remove_ob (op); |
|
|
| 271 | free_object (op); |
|
|
| 272 | } |
|
|
| 273 | } |
275 | } |
| 274 | } |
276 | } |
| 275 | |
277 | |
| 276 | /* convert materialname to materialtype_t */ |
278 | /* convert materialname to materialtype_t */ |
| 277 | |
279 | |
| 278 | materialtype_t * |
280 | materialtype_t * |
| … | |
… | |
| 306 | return; |
308 | return; |
| 307 | |
309 | |
| 308 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
310 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
| 309 | return; |
311 | return; |
| 310 | |
312 | |
| 311 | if (!IS_ARMOR (op)) |
313 | if (!op->is_armor ()) |
| 312 | return; |
314 | return; |
| 313 | |
315 | |
| 314 | mt = name_to_material (op->materialname); |
316 | mt = name_to_material (op->materialname); |
| 315 | if (!mt) |
317 | if (!mt) |
| 316 | { |
318 | { |
| … | |
… | |
| 362 | { |
364 | { |
| 363 | if (op->material & mt->material && rndm (1, 100) <= mt->chance && |
365 | if (op->material & mt->material && rndm (1, 100) <= mt->chance && |
| 364 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
366 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
| 365 | { |
367 | { |
| 366 | lmt = mt; |
368 | lmt = mt; |
| 367 | if (!(IS_WEAPON (op) || IS_ARMOR (op))) |
369 | if (!(op->is_weapon () || op->is_armor ())) |
| 368 | break; |
370 | break; |
| 369 | } |
371 | } |
| 370 | } |
372 | } |
| 371 | #endif |
373 | #endif |
| 372 | } |
374 | } |
| … | |
… | |
| 380 | #ifndef NEW_MATERIAL_CODE |
382 | #ifndef NEW_MATERIAL_CODE |
| 381 | op->materialname = lmt->name; |
383 | op->materialname = lmt->name; |
| 382 | return; |
384 | return; |
| 383 | #else |
385 | #else |
| 384 | |
386 | |
| 385 | if (op->stats.dam && IS_WEAPON (op)) |
387 | if (op->stats.dam && op->is_weapon ()) |
| 386 | { |
388 | { |
| 387 | op->stats.dam += lmt->damage; |
389 | op->stats.dam += lmt->damage; |
| 388 | if (op->stats.dam < 1) |
390 | if (op->stats.dam < 1) |
| 389 | op->stats.dam = 1; |
391 | op->stats.dam = 1; |
| 390 | } |
392 | } |
| 391 | if (op->stats.sp && op->type == BOW) |
393 | if (op->stats.sp && op->type == BOW) |
| 392 | op->stats.sp += lmt->sp; |
394 | op->stats.sp += lmt->sp; |
| 393 | if (op->stats.wc && IS_WEAPON (op)) |
395 | if (op->stats.wc && op->is_weapon ()) |
| 394 | op->stats.wc += lmt->wc; |
396 | op->stats.wc += lmt->wc; |
| 395 | if (IS_ARMOR (op)) |
397 | if (op->is_armor ()) |
| 396 | { |
398 | { |
| 397 | if (op->stats.ac) |
399 | if (op->stats.ac) |
| 398 | op->stats.ac += lmt->ac; |
400 | op->stats.ac += lmt->ac; |
| 399 | for (j = 0; j < NROFATTACKS; j++) |
401 | for (j = 0; j < NROFATTACKS; j++) |
| 400 | if (op->resist[j] != 0) |
402 | if (op->resist[j] != 0) |
| … | |
… | |
| 406 | op->resist[j] = -100; |
408 | op->resist[j] = -100; |
| 407 | } |
409 | } |
| 408 | } |
410 | } |
| 409 | op->materialname = add_string (lmt->name); |
411 | op->materialname = add_string (lmt->name); |
| 410 | /* dont make it unstackable if it doesn't need to be */ |
412 | /* dont make it unstackable if it doesn't need to be */ |
| 411 | if (IS_WEAPON (op) || IS_ARMOR (op)) |
413 | if (op->is_weapon () || op->is_armor ()) |
| 412 | { |
414 | { |
| 413 | op->weight = (op->weight * lmt->weight) / 100; |
415 | op->weight = (op->weight * lmt->weight) / 100; |
| 414 | op->value = (op->value * lmt->value) / 100; |
416 | op->value = (op->value * lmt->value) / 100; |
| 415 | } |
417 | } |
| 416 | #endif |
418 | #endif |
| … | |
… | |
| 549 | strcpy (input, tmp); |
551 | strcpy (input, tmp); |
| 550 | |
552 | |
| 551 | return; |
553 | return; |
| 552 | } |
554 | } |
| 553 | |
555 | |
|
|
556 | ///////////////////////////////////////////////////////////////////////////// |
|
|
557 | |
| 554 | void * |
558 | void |
| 555 | zero_initialised::operator new (size_t s, void *p) |
559 | fork_abort (const char *msg) |
| 556 | { |
560 | { |
| 557 | memset (p, 0, s); |
561 | if (!fork ()) |
|
|
562 | { |
|
|
563 | signal (SIGABRT, SIG_DFL); |
|
|
564 | abort (); |
|
|
565 | } |
|
|
566 | |
|
|
567 | LOG (llevError, "fork abort: %s\n", msg); |
|
|
568 | } |
|
|
569 | |
|
|
570 | void *salloc_ (int n) throw (std::bad_alloc) |
|
|
571 | { |
|
|
572 | void *ptr = g_slice_alloc (n); |
|
|
573 | |
|
|
574 | if (!ptr) |
|
|
575 | throw std::bad_alloc (); |
|
|
576 | |
| 558 | return p; |
577 | return ptr; |
| 559 | } |
578 | } |
| 560 | |
579 | |
| 561 | void * |
580 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
| 562 | zero_initialised::operator new (size_t s) |
|
|
| 563 | { |
581 | { |
| 564 | //return calloc (1, s); |
582 | void *ptr = salloc_ (n); |
| 565 | return g_slice_alloc0 (s); |
|
|
| 566 | } |
|
|
| 567 | |
583 | |
| 568 | void * |
584 | if (src) |
| 569 | zero_initialised::operator new[] (size_t s) |
585 | memcpy (ptr, src, n); |
| 570 | { |
586 | else |
| 571 | //return calloc (1, s); |
587 | memset (ptr, 0, n); |
| 572 | return g_slice_alloc0 (s); |
|
|
| 573 | } |
|
|
| 574 | |
588 | |
| 575 | void |
589 | return ptr; |
| 576 | zero_initialised::operator delete (void *p, size_t s) |
|
|
| 577 | { |
|
|
| 578 | //free (p); return; |
|
|
| 579 | g_slice_free1 (s, p); |
|
|
| 580 | } |
|
|
| 581 | |
|
|
| 582 | void |
|
|
| 583 | zero_initialised::operator delete[] (void *p, size_t s) |
|
|
| 584 | { |
|
|
| 585 | //free (p); return; |
|
|
| 586 | g_slice_free1 (s, p); |
|
|
| 587 | } |
590 | } |
| 588 | |
591 | |
| 589 | void assign (char *dst, const char *src, int maxlen) |
592 | void assign (char *dst, const char *src, int maxlen) |
| 590 | { |
593 | { |
| 591 | if (!src) |
594 | if (!src) |
| … | |
… | |
| 608 | } |
611 | } |
| 609 | else |
612 | else |
| 610 | memcpy (dst, src, len + 1); |
613 | memcpy (dst, src, len + 1); |
| 611 | } |
614 | } |
| 612 | |
615 | |
|
|
616 | tstamp now () |
|
|
617 | { |
|
|
618 | struct timeval tv; |
|
|
619 | |
|
|
620 | gettimeofday (&tv, 0); |
|
|
621 | return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); |
|
|
622 | } |
|
|
623 | |
|
|
624 | int |
|
|
625 | similar_direction (int a, int b) |
|
|
626 | { |
|
|
627 | if (!a || !b) |
|
|
628 | return 0; |
|
|
629 | |
|
|
630 | int diff = (b - a) & 7; |
|
|
631 | return diff <= 1 || diff >= 7; |
|
|
632 | } |
|
|
633 | |
