1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
7 | |
7 | * |
8 | 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 |
9 | 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 |
10 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
11 | (at your option) 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, |
13 | * This program is distributed in the hope that it will be useful, |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | GNU General Public License 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 |
18 | * You should have received a copy of the GNU General Public License |
19 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 | |
21 | * |
22 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* |
25 | /* |
26 | * General convenience functions for crossfire. |
26 | * General convenience functions for crossfire. |
27 | */ |
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> |
28 | |
35 | |
29 | #include <global.h> |
36 | #include <global.h> |
30 | #include <funcpoint.h> |
37 | #include <funcpoint.h> |
31 | #include <material.h> |
38 | #include <material.h> |
32 | |
39 | |
33 | #include <sys/time.h> |
|
|
34 | #include <time.h> |
|
|
35 | #include <glib.h> |
40 | #include <glib.h> |
|
|
41 | |
|
|
42 | rand_gen rndm; |
|
|
43 | |
|
|
44 | void |
|
|
45 | tausworthe_random_generator::seed (uint32_t seed) |
|
|
46 | { |
|
|
47 | state [0] = max ( 2, seed * 69069U); |
|
|
48 | state [1] = max ( 8, state [0] * 69069U); |
|
|
49 | state [2] = max ( 16, state [1] * 69069U); |
|
|
50 | state [3] = max (128, state [2] * 69069U); |
|
|
51 | |
|
|
52 | for (int i = 11; --i; ) |
|
|
53 | operator ()(); |
|
|
54 | } |
|
|
55 | |
|
|
56 | uint32_t |
|
|
57 | tausworthe_random_generator::next () |
|
|
58 | { |
|
|
59 | state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U); |
|
|
60 | state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U); |
|
|
61 | state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U); |
|
|
62 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
|
|
63 | |
|
|
64 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
|
|
65 | } |
|
|
66 | |
|
|
67 | uint32_t |
|
|
68 | tausworthe_random_generator::get_range (uint32_t r_max) |
|
|
69 | { |
|
|
70 | return next () % r_max; |
|
|
71 | } |
|
|
72 | |
|
|
73 | // return a number within (min .. max) |
|
|
74 | int |
|
|
75 | tausworthe_random_generator::get_range (int r_min, int r_max) |
|
|
76 | { |
|
|
77 | return r_min + (*this) (max (r_max - r_min + 1, 1)); |
|
|
78 | } |
36 | |
79 | |
37 | /* |
80 | /* |
38 | * The random functions here take luck into account when rolling random |
81 | * The random functions here take luck into account when rolling random |
39 | * dice or numbers. This function has less of an impact the larger the |
82 | * dice or numbers. This function has less of an impact the larger the |
40 | * difference becomes in the random numbers. IE, the effect is lessened |
83 | * difference becomes in the random numbers. IE, the effect is lessened |
… | |
… | |
47 | * Roll a random number between min and max. Uses op to determine luck, |
90 | * Roll a random number between min and max. Uses op to determine luck, |
48 | * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
91 | * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
49 | * Generally, op should be the player/caster/hitter requesting the roll, |
92 | * Generally, op should be the player/caster/hitter requesting the roll, |
50 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
93 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
51 | */ |
94 | */ |
52 | |
|
|
53 | int |
95 | int |
54 | random_roll (int min, int max, const object *op, int goodbad) |
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
55 | { |
97 | { |
56 | int omin, diff, luck, base, ran; |
98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
57 | |
99 | |
58 | omin = min; |
100 | if (r_max < 1 || r_max < r_min) |
59 | diff = max - min + 1; |
|
|
60 | ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ |
|
|
61 | |
|
|
62 | if (max < 1 || diff < 1) |
|
|
63 | { |
101 | { |
64 | LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max); |
102 | LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
65 | return (min); /* avoids a float exception */ |
103 | return r_min; |
66 | } |
104 | } |
67 | |
105 | |
68 | ran = RANDOM (); |
|
|
69 | |
|
|
70 | if (op->type != PLAYER) |
106 | if (op->type == PLAYER) |
71 | return ((ran % diff) + min); |
107 | { |
72 | |
|
|
73 | luck = op->stats.luck; |
108 | int luck = op->stats.luck; |
74 | if (RANDOM () % base < MIN (10, abs (luck))) |
109 | |
|
|
110 | if (rndm (base) < min (10, abs (luck))) |
|
|
111 | { |
|
|
112 | //TODO: take luck into account |
|
|
113 | } |
75 | { |
114 | } |
76 | /* we have a winner */ |
|
|
77 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
|
|
78 | diff -= luck; |
|
|
79 | if (diff < 1) |
|
|
80 | return (omin); /*check again */ |
|
|
81 | ((goodbad) ? (min += luck) : (diff)); |
|
|
82 | |
115 | |
83 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
116 | return rndm (r_min, r_max); |
84 | } |
|
|
85 | return ((ran % diff) + min); |
|
|
86 | } |
117 | } |
87 | |
118 | |
88 | /* |
119 | /* |
89 | * This is a 64 bit version of random_roll above. This is needed |
120 | * This is a 64 bit version of random_roll above. This is needed |
90 | * for exp loss calculations for players changing religions. |
121 | * for exp loss calculations for players changing religions. |
… | |
… | |
175 | { |
206 | { |
176 | total += RANDOM () % size + 1; |
207 | total += RANDOM () % size + 1; |
177 | } |
208 | } |
178 | } |
209 | } |
179 | return (total); |
210 | return (total); |
180 | } |
|
|
181 | |
|
|
182 | /* |
|
|
183 | * Another convenience function. Returns a number between min and max. |
|
|
184 | * It is suggested one use these functions rather than RANDOM()%, as it |
|
|
185 | * would appear that a number of off-by-one-errors exist due to improper |
|
|
186 | * use of %. This should also prevent SIGFPE. |
|
|
187 | */ |
|
|
188 | |
|
|
189 | int |
|
|
190 | rndm (int min, int max) |
|
|
191 | { |
|
|
192 | int diff; |
|
|
193 | |
|
|
194 | diff = max - min + 1; |
|
|
195 | if (max < 1 || diff < 1) |
|
|
196 | return (min); |
|
|
197 | |
|
|
198 | return (RANDOM () % diff + min); |
|
|
199 | } |
211 | } |
200 | |
212 | |
201 | /* decay and destroy perishable items in a map */ |
213 | /* decay and destroy perishable items in a map */ |
202 | void |
214 | void |
203 | maptile::decay_objects () |
215 | maptile::decay_objects () |
… | |
… | |
544 | return; |
556 | return; |
545 | } |
557 | } |
546 | |
558 | |
547 | ///////////////////////////////////////////////////////////////////////////// |
559 | ///////////////////////////////////////////////////////////////////////////// |
548 | |
560 | |
|
|
561 | void |
|
|
562 | fork_abort (const char *msg) |
|
|
563 | { |
|
|
564 | if (!fork ()) |
|
|
565 | { |
|
|
566 | signal (SIGABRT, SIG_DFL); |
|
|
567 | abort (); |
|
|
568 | } |
|
|
569 | |
|
|
570 | LOG (llevError, "fork abort: %s\n", msg); |
|
|
571 | } |
|
|
572 | |
549 | void *salloc_ (int n) throw (std::bad_alloc) |
573 | void *salloc_ (int n) throw (std::bad_alloc) |
550 | { |
574 | { |
551 | void *ptr = g_slice_alloc (n); |
575 | void *ptr = g_slice_alloc (n); |
552 | |
576 | |
553 | if (!ptr) |
577 | if (!ptr) |