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.23 by root, Sat Dec 16 03:08:25 2006 UTC vs.
Revision 1.45 by root, Sat Jan 27 02:19:36 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{
98 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
99
100 if (r_max < 1 || r_max < r_min)
101 {
102 LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
103 return r_min;
104 }
105
106 if (op->type == PLAYER)
107 {
108 int luck = op->stats.luck;
109
110 if (rndm (base) < min (10, abs (luck)))
111 {
112 //TODO: take luck into account
113 }
114 }
115
116 return rndm (r_min, r_max);
117}
118
119/*
120 * This is a 64 bit version of random_roll above. This is needed
121 * for exp loss calculations for players changing religions.
122 */
123sint64
124random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
125{
55 int omin, diff, luck, base, ran; 126 sint64 omin, diff, luck, ran;
127 int base;
56 128
57 omin = min; 129 omin = min;
58 diff = max - min + 1; 130 diff = max - min + 1;
59 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 131 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
60 132
61 if (max < 1 || diff < 1) 133 if (max < 1 || diff < 1)
62 { 134 {
63 LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max); 135 LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
64 return (min); /* avoids a float exception */ 136 return (min); /* avoids a float exception */
65 } 137 }
66 138
67 ran = RANDOM (); 139 /*
140 * Make a call to get two 32 bit unsigned random numbers, and just to
141 * a little bitshifting.
142 */
143 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
68 144
69 if (op->type != PLAYER) 145 if (op->type != PLAYER)
70 return ((ran % diff) + min); 146 return ((ran % diff) + min);
71 147
72 luck = op->stats.luck; 148 luck = op->stats.luck;
73 if (RANDOM () % base < MIN (10, abs (luck))) 149 if (rndm (base) < MIN (10, abs (luck)))
74 { 150 {
75 /* we have a winner */ 151 /* we have a winner */
76 ((luck > 0) ? (luck = 1) : (luck = -1)); 152 ((luck > 0) ? (luck = 1) : (luck = -1));
77 diff -= luck; 153 diff -= luck;
78 if (diff < 1) 154 if (diff < 1)
79 return (omin); /*check again */ 155 return (omin); /*check again */
80 ((goodbad) ? (min += luck) : (diff)); 156 ((goodbad) ? (min += luck) : (diff));
81 157
82 return (MAX (omin, MIN (max, (ran % diff) + min))); 158 return (MAX (omin, MIN (max, (ran % diff) + min)));
83 } 159 }
84 return ((ran % diff) + min);
85}
86 160
87/*
88 * This is a 64 bit version of random_roll above. This is needed
89 * for exp loss calculations for players changing religions.
90 */
91
92sint64
93random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
94{
95 sint64 omin, diff, luck, ran;
96 int base;
97
98 omin = min;
99 diff = max - min + 1;
100 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
101
102 if (max < 1 || diff < 1)
103 {
104 LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
105 return (min); /* avoids a float exception */
106 }
107
108 /* Don't know of a portable call to get 64 bit random values.
109 * So make a call to get two 32 bit random numbers, and just to
110 * a little byteshifting. Do make sure the first one is only
111 * 32 bit, so we don't get skewed results
112 */
113 ran = (RANDOM () & 0xffffffff) | ((sint64) RANDOM () << 32);
114
115 if (op->type != PLAYER)
116 return ((ran % diff) + min);
117
118 luck = op->stats.luck;
119 if (RANDOM () % base < MIN (10, abs (luck)))
120 {
121 /* we have a winner */
122 ((luck > 0) ? (luck = 1) : (luck = -1));
123 diff -= luck;
124 if (diff < 1)
125 return (omin); /*check again */
126 ((goodbad) ? (min += luck) : (diff));
127
128 return (MAX (omin, MIN (max, (ran % diff) + min)));
129 }
130 return ((ran % diff) + min); 161 return ((ran % diff) + min);
131} 162}
132 163
133/* 164/*
134 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 165 * Roll a number of dice (2d3, 4d6). Uses op to determine luck,
… …
139 */ 170 */
140 171
141int 172int
142die_roll (int num, int size, const object *op, int goodbad) 173die_roll (int num, int size, const object *op, int goodbad)
143{ 174{
144 int min, diff, luck, total, i, gotlucky, base, ran; 175 int min, diff, luck, total, i, gotlucky, base;
145 176
146 diff = size; 177 diff = size;
147 min = 1; 178 min = 1;
148 luck = total = gotlucky = 0; 179 luck = total = gotlucky = 0;
149 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 180 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
… …
156 if (op->type == PLAYER) 187 if (op->type == PLAYER)
157 luck = op->stats.luck; 188 luck = op->stats.luck;
158 189
159 for (i = 0; i < num; i++) 190 for (i = 0; i < num; i++)
160 { 191 {
161 if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky) 192 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
162 { 193 {
163 /* we have a winner */ 194 /* we have a winner */
164 gotlucky++; 195 gotlucky++;
165 ((luck > 0) ? (luck = 1) : (luck = -1)); 196 ((luck > 0) ? (luck = 1) : (luck = -1));
166 diff -= luck; 197 diff -= luck;
167 if (diff < 1) 198 if (diff < 1)
168 return (num); /*check again */ 199 return (num); /*check again */
169 ((goodbad) ? (min += luck) : (diff)); 200 ((goodbad) ? (min += luck) : (diff));
170 ran = RANDOM ();
171 total += MAX (1, MIN (size, (ran % diff) + min)); 201 total += MAX (1, MIN (size, rndm (diff) + min));
172 } 202 }
173 else 203 else
174 {
175 total += RANDOM () % size + 1; 204 total += rndm (size) + 1;
176 }
177 } 205 }
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
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 */ 210/* decay and destroy perishable items in a map */
201
202void 211void
203decay_objects (maptile *m) 212maptile::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 < MAP_WIDTH (m); x++) 217 for (mapspace *ms = spaces + size (); ms-- > spaces; )
212 for (y = 0; y < MAP_HEIGHT (m); 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) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) || QUERY_FLAG (op, FLAG_UNPAID) || IS_LIVE (op)) 231 || QUERY_FLAG (op, FLAG_UNIQUE)
223 continue; 232 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
224 /* otherwise, we decay and destroy */ 233 || QUERY_FLAG (op, FLAG_UNPAID)
225 if (IS_WEAPON (op)) 234 || op->is_alive ())
235 ; // do not decay
236 else if (op->is_weapon ())
226 { 237 {
227 op->stats.dam--; 238 op->stats.dam--;
228 if (op->stats.dam < 0) 239 if (op->stats.dam < 0)
229 destroy = 1; 240 destroy = 1;
230 } 241 }
231 else if (IS_ARMOR (op)) 242 else if (op->is_armor ())
232 { 243 {
233 op->stats.ac--; 244 op->stats.ac--;
234 if (op->stats.ac < 0) 245 if (op->stats.ac < 0)
235 destroy = 1; 246 destroy = 1;
236 } 247 }
237 else if (op->type == FOOD) 248 else if (op->type == FOOD)
238 { 249 {
239 op->stats.food -= rndm (5, 20); 250 op->stats.food -= rndm (5, 20);
240 if (op->stats.food < 0) 251 if (op->stats.food < 0)
241 destroy = 1; 252 destroy = 1;
242 } 253 }
243 else 254 else
244 { 255 {
245 if (op->material & M_PAPER || op->material & M_LEATHER || 256 int mat = op->material;
246 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))
247 destroy = 1; 269 destroy = 1;
248 if (op->material & M_IRON && rndm (1, 5) == 1)
249 destroy = 1;
250 if (op->material & M_GLASS && rndm (1, 2) == 1)
251 destroy = 1;
252 if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1)
253 destroy = 1;
254 if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1)
255 destroy = 1;
256 if (op->material & M_ICE && MAP_TEMP (m) > 32)
257 destroy = 1;
258 } 270 }
271
259 /* adjust overall chance below */ 272 /* adjust overall chance below */
260 if (destroy && rndm (0, 1)) 273 if (destroy && rndm (0, 1))
261 op->destroy (); 274 op->destroy ();
262 } 275 }
263} 276}
264 277
265/* convert materialname to materialtype_t */ 278/* convert materialname to materialtype_t */
266 279
267materialtype_t * 280materialtype_t *
… …
295 return; 308 return;
296 309
297 if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) 310 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
298 return; 311 return;
299 312
300 if (!IS_ARMOR (op)) 313 if (!op->is_armor ())
301 return; 314 return;
302 315
303 mt = name_to_material (op->materialname); 316 mt = name_to_material (op->materialname);
304 if (!mt) 317 if (!mt)
305 { 318 {
… …
351 { 364 {
352 if (op->material & mt->material && rndm (1, 100) <= mt->chance && 365 if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
353 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) 366 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
354 { 367 {
355 lmt = mt; 368 lmt = mt;
356 if (!(IS_WEAPON (op) || IS_ARMOR (op))) 369 if (!(op->is_weapon () || op->is_armor ()))
357 break; 370 break;
358 } 371 }
359 } 372 }
360#endif 373#endif
361 } 374 }
… …
369#ifndef NEW_MATERIAL_CODE 382#ifndef NEW_MATERIAL_CODE
370 op->materialname = lmt->name; 383 op->materialname = lmt->name;
371 return; 384 return;
372#else 385#else
373 386
374 if (op->stats.dam && IS_WEAPON (op)) 387 if (op->stats.dam && op->is_weapon ())
375 { 388 {
376 op->stats.dam += lmt->damage; 389 op->stats.dam += lmt->damage;
377 if (op->stats.dam < 1) 390 if (op->stats.dam < 1)
378 op->stats.dam = 1; 391 op->stats.dam = 1;
379 } 392 }
380 if (op->stats.sp && op->type == BOW) 393 if (op->stats.sp && op->type == BOW)
381 op->stats.sp += lmt->sp; 394 op->stats.sp += lmt->sp;
382 if (op->stats.wc && IS_WEAPON (op)) 395 if (op->stats.wc && op->is_weapon ())
383 op->stats.wc += lmt->wc; 396 op->stats.wc += lmt->wc;
384 if (IS_ARMOR (op)) 397 if (op->is_armor ())
385 { 398 {
386 if (op->stats.ac) 399 if (op->stats.ac)
387 op->stats.ac += lmt->ac; 400 op->stats.ac += lmt->ac;
388 for (j = 0; j < NROFATTACKS; j++) 401 for (j = 0; j < NROFATTACKS; j++)
389 if (op->resist[j] != 0) 402 if (op->resist[j] != 0)
… …
395 op->resist[j] = -100; 408 op->resist[j] = -100;
396 } 409 }
397 } 410 }
398 op->materialname = add_string (lmt->name); 411 op->materialname = add_string (lmt->name);
399 /* dont make it unstackable if it doesn't need to be */ 412 /* dont make it unstackable if it doesn't need to be */
400 if (IS_WEAPON (op) || IS_ARMOR (op)) 413 if (op->is_weapon () || op->is_armor ())
401 { 414 {
402 op->weight = (op->weight * lmt->weight) / 100; 415 op->weight = (op->weight * lmt->weight) / 100;
403 op->value = (op->value * lmt->value) / 100; 416 op->value = (op->value * lmt->value) / 100;
404 } 417 }
405#endif 418#endif
… …
540 return; 553 return;
541} 554}
542 555
543///////////////////////////////////////////////////////////////////////////// 556/////////////////////////////////////////////////////////////////////////////
544 557
545#if 0 558void
546refcounted *refcounted::rc_first; 559fork_abort (const char *msg)
547
548refcounted::refcounted ()
549{ 560{
550 refcnt = 0; 561 if (!fork ())
551 rc_next = rc_first; 562 {
552 rc_first = this; 563 signal (SIGABRT, SIG_DFL);
553} 564 abort ();
565 }
554 566
555refcounted::~refcounted () 567 LOG (llevError, "fork abort: %s\n", msg);
556{
557 assert (!rc_next);
558 assert (!refcnt);
559} 568}
569
570void *salloc_ (int n) throw (std::bad_alloc)
571{
572#ifdef PREFER_MALLOC
573 void *ptr = malloc (n);
574#else
575 void *ptr = g_slice_alloc (n);
560#endif 576#endif
561
562void *salloc (int size) throw (std::bad_alloc)
563{
564 void *ptr = g_slice_alloc (size);
565 577
566 if (!ptr) 578 if (!ptr)
567 throw std::bad_alloc (); 579 throw std::bad_alloc ();
568 580
569 return ptr; 581 return ptr;
570} 582}
571 583
572void *salloc (int size, void *src) throw (std::bad_alloc) 584void *salloc_ (int n, void *src) throw (std::bad_alloc)
573{ 585{
574 void *ptr = salloc (size); 586 void *ptr = salloc_ (n);
575 587
588 if (src)
576 memcpy (ptr, src, size); 589 memcpy (ptr, src, n);
590 else
591 memset (ptr, 0, n);
577 592
578 return ptr; 593 return ptr;
579} 594}
580 595
581void assign (char *dst, const char *src, int maxlen) 596void assign (char *dst, const char *src, int maxlen)
… …
608 623
609 gettimeofday (&tv, 0); 624 gettimeofday (&tv, 0);
610 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 625 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
611} 626}
612 627
628int
629similar_direction (int a, int b)
630{
631 if (!a || !b)
632 return 0;
633
634 int diff = (b - a) & 7;
635 return diff <= 1 || diff >= 7;
636}
637

Diff Legend

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