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.28 by root, Sat Dec 23 16:05:19 2006 UTC vs.
Revision 1.41 by root, Thu Jan 18 22:19:59 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 (time (0));
43
44tausworthe_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
55uint32_t
56tausworthe_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
52int 81int
53random_roll (int min, int max, const object *op, int goodbad) 82random_roll (int r_min, int r_max, const object *op, int goodbad)
54{ 83{
55 int omin, diff, luck, base, ran; 84 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
56 85
57 omin = min; 86 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 { 87 {
63 LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max); 88 LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
64 return (min); /* avoids a float exception */ 89 return r_min;
65 } 90 }
66 91
67 ran = RANDOM ();
68
69 if (op->type != PLAYER) 92 if (op->type == PLAYER)
70 return ((ran % diff) + min); 93 {
71
72 luck = op->stats.luck; 94 int luck = op->stats.luck;
73 if (RANDOM () % base < MIN (10, abs (luck))) 95
96 if (rndm (base) < min (10, abs (luck)))
97 {
98 //TODO: take luck into account
99 }
74 { 100 }
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 101
82 return (MAX (omin, MIN (max, (ran % diff) + min))); 102 return rndm (r_min, r_max);
83 }
84 return ((ran % diff) + min);
85} 103}
86 104
87/* 105/*
88 * This is a 64 bit version of random_roll above. This is needed 106 * This is a 64 bit version of random_roll above. This is needed
89 * for exp loss calculations for players changing religions. 107 * for exp loss calculations for players changing religions.
… …
176 } 194 }
177 } 195 }
178 return (total); 196 return (total);
179} 197}
180 198
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 */ 199/* decay and destroy perishable items in a map */
201
202void 200void
203decay_objects (maptile *m) 201maptile::decay_objects ()
204{ 202{
205 int x, y, destroy; 203 if (!spaces)
206 object *op, *otmp;
207
208 if (m->unique)
209 return; 204 return;
210 205
211 for (x = 0; x < MAP_WIDTH (m); x++) 206 for (mapspace *ms = spaces + size (); ms-- > spaces; )
212 for (y = 0; y < MAP_HEIGHT (m); y++) 207 for (object *above, *op = ms->bot; op; op = above)
213 for (op = GET_MAP_OB (m, x, y); op; op = otmp)
214 { 208 {
209 above = op->above;
210
215 destroy = 0; 211 bool destroy = 0;
216 otmp = op->above; 212
213 // do not decay anything above unique floor tiles (yet :)
217 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 214 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
218 break; 215 break;
216
219 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 217 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
220 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) 218 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
221 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) 219 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
222 || QUERY_FLAG (op, FLAG_UNIQUE) 220 || QUERY_FLAG (op, FLAG_UNIQUE)
223 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) 221 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
224 || QUERY_FLAG (op, FLAG_UNPAID) 222 || QUERY_FLAG (op, FLAG_UNPAID)
225 || op->is_alive ()) 223 || op->is_alive ())
226 continue; 224 ; // do not decay
227
228 /* otherwise, we decay and destroy */
229 if (op->is_weapon ()) 225 else if (op->is_weapon ())
230 { 226 {
231 op->stats.dam--; 227 op->stats.dam--;
232 if (op->stats.dam < 0) 228 if (op->stats.dam < 0)
233 destroy = 1; 229 destroy = 1;
234 } 230 }
235 else if (op->is_armor ()) 231 else if (op->is_armor ())
236 { 232 {
237 op->stats.ac--; 233 op->stats.ac--;
238 if (op->stats.ac < 0) 234 if (op->stats.ac < 0)
239 destroy = 1; 235 destroy = 1;
240 } 236 }
241 else if (op->type == FOOD) 237 else if (op->type == FOOD)
242 { 238 {
243 op->stats.food -= rndm (5, 20); 239 op->stats.food -= rndm (5, 20);
244 if (op->stats.food < 0) 240 if (op->stats.food < 0)
245 destroy = 1; 241 destroy = 1;
246 } 242 }
247 else 243 else
248 { 244 {
249 if (op->material & M_PAPER || op->material & M_LEATHER || 245 int mat = op->material;
250 op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID) 246
247 if (mat & M_PAPER
248 || mat & M_LEATHER
249 || mat & M_WOOD
250 || mat & M_ORGANIC
251 || mat & M_CLOTH
252 || mat & M_LIQUID
253 || (mat & M_IRON && rndm (1, 5) == 1)
254 || (mat & M_GLASS && rndm (1, 2) == 1)
255 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
256 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
257 || (mat & M_ICE && temp > 32))
251 destroy = 1; 258 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 } 259 }
260
263 /* adjust overall chance below */ 261 /* adjust overall chance below */
264 if (destroy && rndm (0, 1)) 262 if (destroy && rndm (0, 1))
265 op->destroy (); 263 op->destroy ();
266 } 264 }
267} 265}
268 266
269/* convert materialname to materialtype_t */ 267/* convert materialname to materialtype_t */
270 268
271materialtype_t * 269materialtype_t *
… …
544 return; 542 return;
545} 543}
546 544
547///////////////////////////////////////////////////////////////////////////// 545/////////////////////////////////////////////////////////////////////////////
548 546
549#if 0 547void
550refcounted *refcounted::rc_first; 548fork_abort (const char *msg)
551
552refcounted::refcounted ()
553{ 549{
554 refcnt = 0; 550 if (!fork ())
555 rc_next = rc_first; 551 {
556 rc_first = this; 552 signal (SIGABRT, SIG_DFL);
557} 553 abort ();
558#endif 554 }
559 555
560refcounted::~refcounted () 556 LOG (llevError, "fork abort: %s\n", msg);
561{
562#if 0
563 assert (!rc_next);
564 assert (!refcnt);
565#endif
566} 557}
567 558
568void *salloc_ (int n) throw (std::bad_alloc) 559void *salloc_ (int n) throw (std::bad_alloc)
569{ 560{
570 void *ptr = g_slice_alloc (n); 561 void *ptr = g_slice_alloc (n);
… …
617 608
618 gettimeofday (&tv, 0); 609 gettimeofday (&tv, 0);
619 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 610 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
620} 611}
621 612
613int
614similar_direction (int a, int b)
615{
616 if (!a || !b)
617 return 0;
618
619 int diff = (b - a) & 7;
620 return diff <= 1 || diff >= 7;
621}
622

Diff Legend

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