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) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | 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 |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | 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> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* |
25 | /* |
25 | * General convenience functions for crossfire. |
26 | * General convenience functions for crossfire. |
26 | */ |
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> |
27 | |
35 | |
28 | #include <global.h> |
36 | #include <global.h> |
29 | #include <funcpoint.h> |
37 | #include <funcpoint.h> |
30 | #include <material.h> |
38 | #include <material.h> |
31 | |
39 | |
32 | #include <sys/time.h> |
|
|
33 | #include <time.h> |
|
|
34 | #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 | } |
35 | |
65 | |
36 | /* |
66 | /* |
37 | * The random functions here take luck into account when rolling random |
67 | * The random functions here take luck into account when rolling random |
38 | * 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 |
39 | * difference becomes in the random numbers. IE, the effect is lessened |
69 | * difference becomes in the random numbers. IE, the effect is lessened |
… | |
… | |
46 | * 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, |
47 | * 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. |
48 | * Generally, op should be the player/caster/hitter requesting the roll, |
78 | * Generally, op should be the player/caster/hitter requesting the roll, |
49 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
79 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
50 | */ |
80 | */ |
51 | |
|
|
52 | int |
81 | int |
53 | random_roll (int min, int max, const object *op, int goodbad) |
82 | random_roll (int min, int max, const object *op, int goodbad) |
54 | { |
83 | { |
55 | int omin, diff, luck, base, ran; |
84 | int omin, diff, luck, base, ran; |
56 | |
85 | |
… | |
… | |
176 | } |
205 | } |
177 | } |
206 | } |
178 | return (total); |
207 | return (total); |
179 | } |
208 | } |
180 | |
209 | |
181 | /* |
|
|
182 | * Another convenience function. Returns a number between min and max. |
|
|
183 | * It is suggested one use these functions rather than RANDOM()%, as it |
|
|
184 | * would appear that a number of off-by-one-errors exist due to improper |
|
|
185 | * use of %. This should also prevent SIGFPE. |
|
|
186 | */ |
|
|
187 | |
|
|
188 | int |
|
|
189 | rndm (int min, int max) |
|
|
190 | { |
|
|
191 | int diff; |
|
|
192 | |
|
|
193 | diff = max - min + 1; |
|
|
194 | if (max < 1 || diff < 1) |
|
|
195 | return (min); |
|
|
196 | |
|
|
197 | return (RANDOM () % diff + min); |
|
|
198 | } |
|
|
199 | |
|
|
200 | /* decay and destroy persihable items in a map */ |
210 | /* decay and destroy perishable items in a map */ |
201 | |
|
|
202 | void |
211 | void |
203 | decay_objects (maptile *m) |
212 | maptile::decay_objects () |
204 | { |
213 | { |
205 | int x, y, destroy; |
214 | if (!spaces) |
206 | object *op, *otmp; |
|
|
207 | |
|
|
208 | if (m->unique) |
|
|
209 | return; |
215 | return; |
210 | |
216 | |
211 | for (x = 0; x < m->width; x++) |
217 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
212 | for (y = 0; y < m->height; y++) |
218 | for (object *above, *op = ms->bot; op; op = above) |
213 | for (op = GET_MAP_OB (m, x, y); op; op = otmp) |
|
|
214 | { |
219 | { |
|
|
220 | above = op->above; |
|
|
221 | |
215 | destroy = 0; |
222 | bool destroy = 0; |
216 | otmp = op->above; |
223 | |
|
|
224 | // do not decay anything above unique floor tiles (yet :) |
217 | 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)) |
218 | break; |
226 | break; |
|
|
227 | |
219 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
228 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
220 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
229 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
221 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
230 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
222 | || QUERY_FLAG (op, FLAG_UNIQUE) |
231 | || QUERY_FLAG (op, FLAG_UNIQUE) |
223 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
232 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
224 | || QUERY_FLAG (op, FLAG_UNPAID) |
233 | || QUERY_FLAG (op, FLAG_UNPAID) |
225 | || op->is_alive ()) |
234 | || op->is_alive ()) |
226 | continue; |
235 | ; // do not decay |
227 | |
|
|
228 | /* otherwise, we decay and destroy */ |
|
|
229 | if (op->is_weapon ()) |
236 | else if (op->is_weapon ()) |
230 | { |
237 | { |
231 | op->stats.dam--; |
238 | op->stats.dam--; |
232 | if (op->stats.dam < 0) |
239 | if (op->stats.dam < 0) |
233 | destroy = 1; |
240 | destroy = 1; |
234 | } |
241 | } |
235 | else if (op->is_armor ()) |
242 | else if (op->is_armor ()) |
236 | { |
243 | { |
237 | op->stats.ac--; |
244 | op->stats.ac--; |
238 | if (op->stats.ac < 0) |
245 | if (op->stats.ac < 0) |
239 | destroy = 1; |
246 | destroy = 1; |
240 | } |
247 | } |
241 | else if (op->type == FOOD) |
248 | else if (op->type == FOOD) |
242 | { |
249 | { |
243 | op->stats.food -= rndm (5, 20); |
250 | op->stats.food -= rndm (5, 20); |
244 | if (op->stats.food < 0) |
251 | if (op->stats.food < 0) |
245 | destroy = 1; |
252 | destroy = 1; |
246 | } |
253 | } |
247 | else |
254 | else |
248 | { |
255 | { |
249 | if (op->material & M_PAPER || op->material & M_LEATHER || |
256 | int mat = op->material; |
250 | 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)) |
251 | destroy = 1; |
269 | destroy = 1; |
252 | if (op->material & M_IRON && rndm (1, 5) == 1) |
|
|
253 | destroy = 1; |
|
|
254 | if (op->material & M_GLASS && rndm (1, 2) == 1) |
|
|
255 | destroy = 1; |
|
|
256 | if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
257 | destroy = 1; |
|
|
258 | if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1) |
|
|
259 | destroy = 1; |
|
|
260 | if (op->material & M_ICE && m->temp > 32) |
|
|
261 | destroy = 1; |
|
|
262 | } |
270 | } |
|
|
271 | |
263 | /* adjust overall chance below */ |
272 | /* adjust overall chance below */ |
264 | if (destroy && rndm (0, 1)) |
273 | if (destroy && rndm (0, 1)) |
265 | op->destroy (); |
274 | op->destroy (); |
266 | } |
275 | } |
267 | } |
276 | } |
268 | |
277 | |
269 | /* convert materialname to materialtype_t */ |
278 | /* convert materialname to materialtype_t */ |
270 | |
279 | |
271 | materialtype_t * |
280 | materialtype_t * |
… | |
… | |
544 | return; |
553 | return; |
545 | } |
554 | } |
546 | |
555 | |
547 | ///////////////////////////////////////////////////////////////////////////// |
556 | ///////////////////////////////////////////////////////////////////////////// |
548 | |
557 | |
|
|
558 | void |
|
|
559 | fork_abort (const char *msg) |
|
|
560 | { |
|
|
561 | if (!fork ()) |
|
|
562 | { |
|
|
563 | signal (SIGABRT, SIG_DFL); |
|
|
564 | abort (); |
|
|
565 | } |
|
|
566 | |
|
|
567 | LOG (llevError, "fork abort: %s\n", msg); |
|
|
568 | } |
|
|
569 | |
549 | void *salloc_ (int n) throw (std::bad_alloc) |
570 | void *salloc_ (int n) throw (std::bad_alloc) |
550 | { |
571 | { |
551 | void *ptr = g_slice_alloc (n); |
572 | void *ptr = g_slice_alloc (n); |
552 | |
573 | |
553 | if (!ptr) |
574 | if (!ptr) |
… | |
… | |
598 | |
619 | |
599 | gettimeofday (&tv, 0); |
620 | gettimeofday (&tv, 0); |
600 | return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); |
621 | return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); |
601 | } |
622 | } |
602 | |
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 | |