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.92 by root, Tue Nov 3 23:18:23 2009 UTC vs.
Revision 1.105 by root, Thu Jan 19 21:51:43 2017 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 5 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 6 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 7 * the terms of the Affero GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your 8 * Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version. 9 * option) any later version.
12 * 10 *
13 * This program is distributed in the hope that it will be useful, 11 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 14 * GNU General Public License for more details.
17 * 15 *
18 * You should have received a copy of the Affero GNU General Public License 16 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see 17 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 18 * <http://www.gnu.org/licenses/>.
21 * 19 *
22 * The authors can be reached via e-mail to <support@deliantra.net> 20 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 21 */
24 22
25/* 23/*
26 * General convenience functions for deliantra. 24 * General convenience functions for deliantra.
… …
42 40
43#include <glib.h> 41#include <glib.h>
44 42
45refcnt_base::refcnt_t refcnt_dummy; 43refcnt_base::refcnt_t refcnt_dummy;
46ssize_t slice_alloc; 44ssize_t slice_alloc;
47rand_gen rndm, rmg_rndm;
48 45
49void 46#if !GCC_VERSION(3,4)
50tausworthe_random_generator::seed (uint32_t seed) 47int least_significant_bit (uint32_t x)
51{ 48{
52 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 49 x &= -x; // this isolates the lowest bit
53 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
54 state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
55 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
56 50
57 for (int i = 11; --i; ) 51 int r = 0;
58 next ();
59}
60 52
61uint32_t 53 if (x & 0xaaaaaaaa) r += 1;
62tausworthe_random_generator::next () 54 if (x & 0xcccccccc) r += 2;
63{ 55 if (x & 0xf0f0f0f0) r += 4;
64 state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U); 56 if (x & 0xff00ff00) r += 8;
65 state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U); 57 if (x & 0xffff0000) r += 16;
66 state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
67 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
68 58
69 return state [0] ^ state [1] ^ state [2] ^ state [3];
70}
71
72template<class generator>
73uint32_t
74random_number_generator<generator>::get_range (uint32_t num)
75{
76 return (this->next () * (uint64_t)num) >> 32U;
77}
78
79// return a number within (min .. max)
80template<class generator>
81int
82random_number_generator<generator>::get_range (int r_min, int r_max)
83{
84 return r_min + get_range (max (r_max - r_min + 1, 0));
85}
86
87template struct random_number_generator<tausworthe_random_generator>;
88template struct random_number_generator<xorshift_random_generator>;
89
90/*
91 * The random functions here take luck into account when rolling random
92 * dice or numbers. This function has less of an impact the larger the
93 * difference becomes in the random numbers. IE, the effect is lessened
94 * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers,
95 * to specifically disable luck in certain rolls, simply by making the
96 * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3)
97 */
98
99/*
100 * Roll a random number between min and max. Uses op to determine luck,
101 * and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
102 * Generally, op should be the player/caster/hitter requesting the roll,
103 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
104 */
105int
106random_roll (int r_min, int r_max, const object *op, int goodbad)
107{
108 r_max = max (r_min, r_max);
109
110 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
111
112 if (op->type == PLAYER)
113 {
114 int luck = op->stats.luck;
115
116 if (rndm (base) < min (10, abs (luck)))
117 {
118 //TODO: take luck into account
119 }
120 }
121
122 return rndm (r_min, r_max);
123}
124
125/*
126 * This is a 64 bit version of random_roll above. This is needed
127 * for exp loss calculations for players changing religions.
128 */
129sint64
130random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
131{
132 sint64 omin = r_min;
133 sint64 range = max (0, r_max - r_min + 1);
134 int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
135
136 /*
137 * Make a call to get two 32 bit unsigned random numbers, and just to
138 * a little bitshifting.
139 */
140 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
141
142 if (op->type != PLAYER)
143 return ((ran % range) + r_min);
144
145 int luck = op->stats.luck;
146
147 if (rndm (base) < min (10, abs (luck)))
148 {
149 /* we have a winner */
150 ((luck > 0) ? (luck = 1) : (luck = -1));
151 range -= luck;
152 if (range < 1)
153 return (omin); /*check again */
154
155 ((goodbad) ? (r_min += luck) : (range));
156
157 return (max (omin, min (r_max, (ran % range) + r_min)));
158 }
159
160 return ran % range + r_min;
161}
162
163/*
164 * Roll a number of dice (2d3, 4d6). Uses op to determine luck,
165 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
166 * Generally, op should be the player/caster/hitter requesting the roll,
167 * not the recipient (ie, the poor slob getting hit).
168 * The args are num D size (ie 4d6) [garbled 20010916]
169 */
170int
171die_roll (int num, int size, const object *op, int goodbad)
172{
173 int min, luck, total, i, gotlucky;
174
175 int diff = size;
176 min = 1;
177 luck = total = gotlucky = 0;
178 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
179
180 if (size < 2 || diff < 1)
181 {
182 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
183 return num; /* avoids a float exception */
184 }
185
186 if (op->type == PLAYER)
187 luck = op->stats.luck;
188
189 for (i = 0; i < num; i++)
190 {
191 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
192 {
193 /* we have a winner */
194 gotlucky++;
195 ((luck > 0) ? (luck = 1) : (luck = -1));
196 diff -= luck;
197 if (diff < 1)
198 return (num); /*check again */
199 ((goodbad) ? (min += luck) : (diff));
200 total += MAX (1, MIN (size, rndm (diff) + min));
201 }
202 else
203 total += rndm (size) + 1;
204 }
205
206 return total;
207}
208
209/* convert materialname to materialtype_t */
210
211materialtype_t *
212name_to_material (const shstr_cmp name)
213{
214 for (materialtype_t *mt = materialt; mt; mt = mt->next)
215 if (name == mt->name)
216 return mt;
217
218 return 0; 59 return r;
219} 60}
220 61#endif
221/* when doing transmutation of objects, we have to recheck the resistances,
222 * as some that did not apply previously, may apply now.
223 */
224void
225transmute_materialname (object *op, const object *change)
226{
227 materialtype_t *mt;
228 int j;
229
230 if (!op->materialname)
231 return;
232
233 if (op->materialname != change->materialname)
234 return;
235
236 if (!op->is_armor ())
237 return;
238
239 mt = name_to_material (op->materialname);
240 if (!mt)
241 {
242 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
243 return;
244 }
245
246 for (j = 0; j < NROFATTACKS; j++)
247 if (op->resist[j] == 0 && change->resist[j] != 0)
248 {
249 op->resist[j] += mt->mod[j];
250 if (op->resist[j] > 100)
251 op->resist[j] = 100;
252 if (op->resist[j] < -100)
253 op->resist[j] = -100;
254 }
255}
256
257/* set the materialname and type for an item */
258void
259set_materialname (object *op, int difficulty, materialtype_t *nmt)
260{
261 materialtype_t *mt, *lmt;
262
263 if (!op->materialname)
264 return;
265
266 if (nmt)
267 lmt = nmt;
268 else
269 {
270 lmt = 0;
271
272 for (mt = materialt; mt; mt = mt->next)
273 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
274 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
275 {
276 lmt = mt;
277 if (!(op->is_weapon () || op->is_armor ()))
278 break;
279 }
280 }
281
282 if (lmt)
283 {
284 if (op->stats.dam && op->is_weapon ())
285 {
286 op->stats.dam += lmt->damage;
287 if (op->stats.dam < 1)
288 op->stats.dam = 1;
289 }
290
291 if (op->stats.sp && op->type == BOW)
292 op->stats.sp += lmt->sp;
293 if (op->stats.wc && op->is_weapon ())
294 op->stats.wc += lmt->wc;
295 if (op->is_armor ())
296 {
297 if (op->stats.ac)
298 op->stats.ac += lmt->ac;
299
300 for (int j = 0; j < NROFATTACKS; j++)
301 if (op->resist[j] != 0)
302 {
303 op->resist[j] += lmt->mod[j];
304 if (op->resist[j] > 100)
305 op->resist[j] = 100;
306 if (op->resist[j] < -100)
307 op->resist[j] = -100;
308 }
309 }
310
311 op->materialname = lmt->name;
312 /* dont make it unstackable if it doesn't need to be */
313 if (op->is_weapon () || op->is_armor ())
314 {
315 op->weight = (op->weight * lmt->weight) / 100;
316 op->value = (op->value * lmt->value) / 100;
317 }
318 }
319}
320
321/*
322 * Strip out the media tags from a String.
323 * Warning the input string will contain the result string
324 */
325void
326strip_media_tag (char *message)
327{
328 int in_tag = 0;
329 char *dest;
330 char *src;
331
332 src = dest = message;
333 while (*src != '\0')
334 {
335 if (*src == '[')
336 {
337 in_tag = 1;
338 }
339 else if (in_tag && (*src == ']'))
340 in_tag = 0;
341 else if (!in_tag)
342 {
343 *dest = *src;
344 dest++;
345 }
346 src++;
347 }
348 *dest = '\0';
349}
350
351const char *
352strrstr (const char *haystack, const char *needle)
353{
354 const char *lastneedle;
355
356 lastneedle = NULL;
357 while ((haystack = strstr (haystack, needle)) != NULL)
358 {
359 lastneedle = haystack;
360 haystack++;
361 }
362 return lastneedle;
363
364}
365
366#define EOL_SIZE (sizeof("\n")-1)
367void
368strip_endline (char *buf)
369{
370 if (strlen (buf) < sizeof ("\n"))
371 {
372 return;
373 }
374 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
375 buf[strlen (buf) - EOL_SIZE] = '\0';
376}
377
378/**
379 * Replace in string src all occurrences of key by replacement. The resulting
380 * string is put into result; at most resultsize characters (including the
381 * terminating null character) will be written to result.
382 */
383void
384replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
385{
386 size_t resultlen;
387 size_t keylen;
388
389 /* special case to prevent infinite loop if key==replacement=="" */
390 if (strcmp (key, replacement) == 0)
391 {
392 snprintf (result, resultsize, "%s", src);
393 return;
394 }
395
396 keylen = strlen (key);
397
398 resultlen = 0;
399 while (*src != '\0' && resultlen + 1 < resultsize)
400 {
401 if (strncmp (src, key, keylen) == 0)
402 {
403 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
404 resultlen += strlen (result + resultlen);
405 src += keylen;
406 }
407 else
408 {
409 result[resultlen++] = *src++;
410 }
411 }
412 result[resultlen] = '\0';
413}
414 62
415/******************************************************************************/ 63/******************************************************************************/
416 64
417/* Checks a player-provided string which will become the msg property of 65/* Checks a player-provided string which will become the msg property of
418 * an object for dangerous input. 66 * an object for dangerous input.
419 */ 67 */
420bool 68bool
421msg_is_safe (const char *msg) 69msg_is_safe (const char *msg)
422{ 70{
423 bool safe = true; 71 bool safe = true;
424 72
425 /* Trying to cheat by getting data into the object */ 73 /* Trying to cheat by getting data into the object */
… …
444 signal (SIGINT , SIG_IGN); 92 signal (SIGINT , SIG_IGN);
445 signal (SIGTERM, SIG_IGN); 93 signal (SIGTERM, SIG_IGN);
446 signal (SIGABRT, SIG_IGN); 94 signal (SIGABRT, SIG_IGN);
447 95
448 signal (SIGSEGV, SIG_DFL); 96 signal (SIGSEGV, SIG_DFL);
97 signal (SIGFPE , SIG_DFL);
98#ifdef SIGBUS
449 signal (SIGBUS , SIG_DFL); 99 signal (SIGBUS , SIG_DFL);
100#endif
450 signal (SIGILL , SIG_DFL); 101 signal (SIGILL , SIG_DFL);
451 signal (SIGTRAP, SIG_DFL); 102 signal (SIGTRAP, SIG_DFL);
452 103
453 // try to put corefiles into a subdirectory, if existing, to allow 104 // try to put corefiles into a subdirectory, if existing, to allow
454 // an administrator to reduce the I/O load. 105 // an administrator to reduce the I/O load.
… …
478 } 129 }
479 130
480 LOG (llevError, "fork abort: %s\n", msg); 131 LOG (llevError, "fork abort: %s\n", msg);
481} 132}
482 133
134void *
483void *salloc_ (int n) throw (std::bad_alloc) 135salloc_ (int n) throw (std::bad_alloc)
484{ 136{
485 void *ptr = g_slice_alloc (n); 137 void *ptr = g_slice_alloc (n);
486 138
487 if (!ptr) 139 if (!ptr)
488 throw std::bad_alloc (); 140 throw std::bad_alloc ();
489 141
490 slice_alloc += n; 142 slice_alloc += n;
491 return ptr; 143 return ptr;
492} 144}
493 145
146void *
494void *salloc_ (int n, void *src) throw (std::bad_alloc) 147salloc_ (int n, void *src) throw (std::bad_alloc)
495{ 148{
496 void *ptr = salloc_ (n); 149 void *ptr = salloc_ (n);
497 150
498 if (src) 151 if (src)
499 memcpy (ptr, src, n); 152 memcpy (ptr, src, n);
… …
507 160
508#if DEBUG_SALLOC 161#if DEBUG_SALLOC
509 162
510#define MAGIC 0xa1b2c35543deadLL 163#define MAGIC 0xa1b2c35543deadLL
511 164
165void *
512void *g_slice_alloc (unsigned long size) 166g_slice_alloc (unsigned long size)
513{ 167{
514 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); 168 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
515 *p++ = size ^ MAGIC; 169 *p++ = size ^ MAGIC;
516 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D 170 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
517 return (void *)p; 171 return (void *)p;
518} 172}
519 173
174void *
520void *g_slice_alloc0 (unsigned long size) 175g_slice_alloc0 (unsigned long size)
521{ 176{
522 return memset (g_slice_alloc (size), 0, size); 177 return memset (g_slice_alloc (size), 0, size);
523} 178}
524 179
180void
525void g_slice_free1 (unsigned long size, void *ptr) 181g_slice_free1 (unsigned long size, void *ptr)
526{ 182{
527 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D 183 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
528 if (expect_true (ptr)) 184 if (expect_true (ptr))
529 { 185 {
530 unsigned long *p = (unsigned long *)ptr; 186 unsigned long *p = (unsigned long *)ptr;
… …
541 (g_slice_free1)(s + sizeof (unsigned long), p); 197 (g_slice_free1)(s + sizeof (unsigned long), p);
542 } 198 }
543} 199}
544 200
545#endif 201#endif
202
203/******************************************************************************/
204
205refcnt_buf::refcnt_buf (size_t size)
206{
207 static uint32_t empty_buf [2] = { 0, 1 }; // 2 == never deallocated
208 data = (char *)empty_buf + overhead;
209 assert (overhead == sizeof (empty_buf));
210 inc ();
211}
212
213refcnt_buf::refcnt_buf (void *data, size_t size)
214{
215 _alloc (size);
216 memcpy (this->data, data, size);
217}
218
219refcnt_buf::~refcnt_buf ()
220{
221 dec ();
222}
223
224void
225refcnt_buf::_dealloc ()
226{
227 sfree<char> (data - overhead, size () + overhead);
228}
229
230refcnt_buf &
231refcnt_buf::operator =(const refcnt_buf &src)
232{
233 dec ();
234 data = src.data;
235 inc ();
236 return *this;
237}
546 238
547/******************************************************************************/ 239/******************************************************************************/
548 240
549int 241int
550assign (char *dst, const char *src, int maxsize) 242assign (char *dst, const char *src, int maxsize)
… …
576} 268}
577 269
578char * 270char *
579vformat (const char *format, va_list ap) 271vformat (const char *format, va_list ap)
580{ 272{
581 static dynbuf_text buf; buf.clear (); 273 static dynbuf_text bufs[8];
274 static int bufidx;
275
276 dynbuf_text &buf = bufs [++bufidx & 7];
277
278 buf.clear ();
582 buf.vprintf (format, ap); 279 buf.vprintf (format, ap);
583 return buf; 280 return buf;
584} 281}
585 282
586char * 283char *
… …
592 va_end (ap); 289 va_end (ap);
593 290
594 return buf; 291 return buf;
595} 292}
596 293
597tstamp now () 294tstamp
295now ()
598{ 296{
599 struct timeval tv; 297 struct timeval tv;
600 298
601 gettimeofday (&tv, 0); 299 gettimeofday (&tv, 0);
602 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 300 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
… …
667 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 365 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
668 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 366 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
669 0x2d02ef8dL 367 0x2d02ef8dL
670}; 368};
671 369
370void
672void thread::start (void *(*start_routine)(void *), void *arg) 371thread::start (void *(*start_routine)(void *), void *arg)
673{ 372{
674 pthread_attr_t attr; 373 pthread_attr_t attr;
675 374
676 pthread_attr_init (&attr); 375 pthread_attr_init (&attr);
677 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); 376 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);

Diff Legend

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