ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/utils.C
(Generate patch)

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.29 by root, Mon Dec 25 11:25:49 2006 UTC vs.
Revision 1.44 by root, Thu Jan 25 03:54:44 2007 UTC

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
42rand_gen rndm;
43
44void
45tausworthe_random_generator::seed (uint32_t seed)
46{
47 state [0] = max ( 2U, seed * 69069U);
48 state [1] = max ( 8U, state [0] * 69069U);
49 state [2] = max ( 16U, state [1] * 69069U);
50 state [3] = max (128U, state [2] * 69069U);
51
52 for (int i = 11; --i; )
53 operator ()();
54}
55
56uint32_t
57tausworthe_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
67uint32_t
68tausworthe_random_generator::get_range (uint32_t r_max)
69{
70 return next () % r_max;
71}
72
73// return a number within (min .. max)
74int
75tausworthe_random_generator::get_range (int r_min, int r_max)
76{
77 return r_min + (*this) (max (r_max - r_min + 1, 1));
78}
35 79
36/* 80/*
37 * The random functions here take luck into account when rolling random 81 * 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 82 * 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 83 * 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, 90 * 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. 91 * 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, 92 * Generally, op should be the player/caster/hitter requesting the roll,
49 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
50 */ 94 */
51
52int 95int
53random_roll (int min, int max, const object *op, int goodbad) 96random_roll (int r_min, int r_max, const object *op, int goodbad)
54{ 97{
55 int omin, diff, luck, base, ran; 98 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
56 99
57 omin = min; 100 if (r_max < 1 || r_max < r_min)
58 diff = max - min + 1;
59 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
60
61 if (max < 1 || diff < 1)
62 { 101 {
63 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);
64 return (min); /* avoids a float exception */ 103 return r_min;
65 } 104 }
66 105
67 ran = RANDOM ();
68
69 if (op->type != PLAYER) 106 if (op->type == PLAYER)
70 return ((ran % diff) + min); 107 {
71
72 luck = op->stats.luck; 108 int luck = op->stats.luck;
73 if (RANDOM () % base < MIN (10, abs (luck))) 109
110 if (rndm (base) < min (10, abs (luck)))
111 {
112 //TODO: take luck into account
113 }
74 { 114 }
75 /* we have a winner */
76 ((luck > 0) ? (luck = 1) : (luck = -1));
77 diff -= luck;
78 if (diff < 1)
79 return (omin); /*check again */
80 ((goodbad) ? (min += luck) : (diff));
81 115
82 return (MAX (omin, MIN (max, (ran % diff) + min))); 116 return rndm (r_min, r_max);
83 }
84 return ((ran % diff) + min);
85} 117}
86 118
87/* 119/*
88 * 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
89 * for exp loss calculations for players changing religions. 121 * for exp loss calculations for players changing religions.
… …
176 } 208 }
177 } 209 }
178 return (total); 210 return (total);
179} 211}
180 212
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
188int
189rndm (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 */ 213/* decay and destroy perishable items in a map */
201
202void 214void
203decay_objects (maptile *m) 215maptile::decay_objects ()
204{ 216{
205 int x, y, destroy; 217 if (!spaces)
206 object *op, *otmp;
207
208 if (m->unique)
209 return; 218 return;
210 219
211 for (x = 0; x < MAP_WIDTH (m); x++) 220 for (mapspace *ms = spaces + size (); ms-- > spaces; )
212 for (y = 0; y < MAP_HEIGHT (m); y++) 221 for (object *above, *op = ms->bot; op; op = above)
213 for (op = GET_MAP_OB (m, x, y); op; op = otmp)
214 { 222 {
223 above = op->above;
224
215 destroy = 0; 225 bool destroy = 0;
216 otmp = op->above; 226
227 // do not decay anything above unique floor tiles (yet :)
217 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 228 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
218 break; 229 break;
230
219 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 231 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
220 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) 232 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
221 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) 233 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
222 || QUERY_FLAG (op, FLAG_UNIQUE) 234 || QUERY_FLAG (op, FLAG_UNIQUE)
223 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) 235 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
224 || QUERY_FLAG (op, FLAG_UNPAID) 236 || QUERY_FLAG (op, FLAG_UNPAID)
225 || op->is_alive ()) 237 || op->is_alive ())
226 continue; 238 ; // do not decay
227
228 /* otherwise, we decay and destroy */
229 if (op->is_weapon ()) 239 else if (op->is_weapon ())
230 { 240 {
231 op->stats.dam--; 241 op->stats.dam--;
232 if (op->stats.dam < 0) 242 if (op->stats.dam < 0)
233 destroy = 1; 243 destroy = 1;
234 } 244 }
235 else if (op->is_armor ()) 245 else if (op->is_armor ())
236 { 246 {
237 op->stats.ac--; 247 op->stats.ac--;
238 if (op->stats.ac < 0) 248 if (op->stats.ac < 0)
239 destroy = 1; 249 destroy = 1;
240 } 250 }
241 else if (op->type == FOOD) 251 else if (op->type == FOOD)
242 { 252 {
243 op->stats.food -= rndm (5, 20); 253 op->stats.food -= rndm (5, 20);
244 if (op->stats.food < 0) 254 if (op->stats.food < 0)
245 destroy = 1; 255 destroy = 1;
246 } 256 }
247 else 257 else
248 { 258 {
249 if (op->material & M_PAPER || op->material & M_LEATHER || 259 int mat = op->material;
250 op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID) 260
261 if (mat & M_PAPER
262 || mat & M_LEATHER
263 || mat & M_WOOD
264 || mat & M_ORGANIC
265 || mat & M_CLOTH
266 || mat & M_LIQUID
267 || (mat & M_IRON && rndm (1, 5) == 1)
268 || (mat & M_GLASS && rndm (1, 2) == 1)
269 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
270 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
271 || (mat & M_ICE && temp > 32))
251 destroy = 1; 272 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 && MAP_TEMP (m) > 32)
261 destroy = 1;
262 } 273 }
274
263 /* adjust overall chance below */ 275 /* adjust overall chance below */
264 if (destroy && rndm (0, 1)) 276 if (destroy && rndm (0, 1))
265 op->destroy (); 277 op->destroy ();
266 } 278 }
267} 279}
268 280
269/* convert materialname to materialtype_t */ 281/* convert materialname to materialtype_t */
270 282
271materialtype_t * 283materialtype_t *
… …
544 return; 556 return;
545} 557}
546 558
547///////////////////////////////////////////////////////////////////////////// 559/////////////////////////////////////////////////////////////////////////////
548 560
561void
562fork_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
549void *salloc_ (int n) throw (std::bad_alloc) 573void *salloc_ (int n) throw (std::bad_alloc)
550{ 574{
575#ifdef PREFER_MALLOC
576 void *ptr = malloc (n);
577#else
551 void *ptr = g_slice_alloc (n); 578 void *ptr = g_slice_alloc (n);
579#endif
552 580
553 if (!ptr) 581 if (!ptr)
554 throw std::bad_alloc (); 582 throw std::bad_alloc ();
555 583
556 return ptr; 584 return ptr;
… …
598 626
599 gettimeofday (&tv, 0); 627 gettimeofday (&tv, 0);
600 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 628 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
601} 629}
602 630
631int
632similar_direction (int a, int b)
633{
634 if (!a || !b)
635 return 0;
636
637 int diff = (b - a) & 7;
638 return diff <= 1 || diff >= 7;
639}
640

Diff Legend

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