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.86 by root, Mon Jan 12 03:40:21 2009 UTC vs.
Revision 1.103 by root, Mon Dec 17 02:07:15 2012 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 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 6 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 7 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 8 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your 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 GNU General Public License 16 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>.
20 * 19 *
21 * 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>
22 */ 21 */
23 22
24/* 23/*
25 * General convenience functions for crossfire. 24 * General convenience functions for deliantra.
26 */ 25 */
27 26
28#include <cstdlib> 27#include <cstdlib>
29#include <sys/types.h> 28#include <sys/types.h>
30#include <unistd.h> 29#include <unistd.h>
… …
32#include <time.h> 31#include <time.h>
33#include <signal.h> 32#include <signal.h>
34 33
35#include <global.h> 34#include <global.h>
36#include <material.h> 35#include <material.h>
36#include <object.h>
37 37
38#include <sys/time.h> 38#include <sys/time.h>
39#include <sys/resource.h> 39#include <sys/resource.h>
40 40
41#include <glib.h> 41#include <glib.h>
42 42
43refcnt_base::refcnt_t refcnt_dummy; 43refcnt_base::refcnt_t refcnt_dummy;
44ssize_t slice_alloc; 44ssize_t slice_alloc;
45rand_gen rndm, rmg_rndm;
46 45
47void 46#if !GCC_VERSION(3,4)
48tausworthe_random_generator::seed (uint32_t seed) 47int least_significant_bit (uint32_t x)
49{ 48{
50 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 49 x &= -x; // this isolates the lowest bit
51 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
52 state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
53 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
54 50
55 for (int i = 11; --i; ) 51 int r = 0;
56 next ();
57}
58 52
59uint32_t 53 if (x & 0xaaaaaaaa) r += 1;
60tausworthe_random_generator::next () 54 if (x & 0xcccccccc) r += 2;
61{ 55 if (x & 0xf0f0f0f0) r += 4;
62 state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U); 56 if (x & 0xff00ff00) r += 8;
63 state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U); 57 if (x & 0xffff0000) r += 16;
64 state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
65 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
66 58
67 return state [0] ^ state [1] ^ state [2] ^ state [3]; 59 return r;
68} 60}
61#endif
69 62
70template<class generator> 63/******************************************************************************/
71uint32_t
72random_number_generator<generator>::get_range (uint32_t num)
73{
74 return (this->next () * (uint64_t)num) >> 32U;
75}
76 64
77// return a number within (min .. max) 65/* Checks a player-provided string which will become the msg property of
78template<class generator> 66 * an object for dangerous input.
79int
80random_number_generator<generator>::get_range (int r_min, int r_max)
81{
82 return r_min + get_range (max (r_max - r_min + 1, 0));
83}
84
85template struct random_number_generator<tausworthe_random_generator>;
86template struct random_number_generator<xorshift_random_generator>;
87
88/*
89 * The random functions here take luck into account when rolling random
90 * dice or numbers. This function has less of an impact the larger the
91 * difference becomes in the random numbers. IE, the effect is lessened
92 * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers,
93 * to specifically disable luck in certain rolls, simply by making the
94 * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3)
95 */ 67 */
96 68bool
97/* 69msg_is_safe (const char *msg)
98 * Roll a random number between min and max. Uses op to determine luck,
99 * and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
100 * Generally, op should be the player/caster/hitter requesting the roll,
101 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
102 */
103int
104random_roll (int r_min, int r_max, const object *op, int goodbad)
105{ 70{
106 r_max = max (r_min, r_max); 71 bool safe = true;
107 72
108 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ 73 /* Trying to cheat by getting data into the object */
74 if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
75 || strstr (msg, "\nendmsg"))
76 safe = false;
109 77
110 if (op->type == PLAYER) 78 /* Trying to make the object talk, and potentially access arbitrary code */
111 { 79 if (object::msg_has_dialogue (msg))
112 int luck = op->stats.luck; 80 safe = false;
113 81
114 if (rndm (base) < min (10, abs (luck)))
115 {
116 //TODO: take luck into account
117 }
118 }
119
120 return rndm (r_min, r_max);
121}
122
123/*
124 * This is a 64 bit version of random_roll above. This is needed
125 * for exp loss calculations for players changing religions.
126 */
127sint64
128random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
129{
130 sint64 omin = r_min;
131 sint64 range = max (0, r_max - r_min + 1);
132 int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
133
134 /*
135 * Make a call to get two 32 bit unsigned random numbers, and just to
136 * a little bitshifting.
137 */
138 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
139
140 if (op->type != PLAYER)
141 return ((ran % range) + r_min);
142
143 int luck = op->stats.luck;
144
145 if (rndm (base) < min (10, abs (luck)))
146 {
147 /* we have a winner */
148 ((luck > 0) ? (luck = 1) : (luck = -1));
149 range -= luck;
150 if (range < 1)
151 return (omin); /*check again */
152
153 ((goodbad) ? (r_min += luck) : (range));
154
155 return (max (omin, min (r_max, (ran % range) + r_min)));
156 }
157
158 return ran % range + r_min;
159}
160
161/*
162 * Roll a number of dice (2d3, 4d6). Uses op to determine luck,
163 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
164 * Generally, op should be the player/caster/hitter requesting the roll,
165 * not the recipient (ie, the poor slob getting hit).
166 * The args are num D size (ie 4d6) [garbled 20010916]
167 */
168int
169die_roll (int num, int size, const object *op, int goodbad)
170{
171 int min, luck, total, i, gotlucky;
172
173 int diff = size;
174 min = 1;
175 luck = total = gotlucky = 0;
176 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
177
178 if (size < 2 || diff < 1)
179 {
180 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
181 return num; /* avoids a float exception */
182 }
183
184 if (op->type == PLAYER)
185 luck = op->stats.luck;
186
187 for (i = 0; i < num; i++)
188 {
189 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
190 {
191 /* we have a winner */
192 gotlucky++;
193 ((luck > 0) ? (luck = 1) : (luck = -1));
194 diff -= luck;
195 if (diff < 1)
196 return (num); /*check again */
197 ((goodbad) ? (min += luck) : (diff));
198 total += MAX (1, MIN (size, rndm (diff) + min));
199 }
200 else
201 total += rndm (size) + 1;
202 }
203
204 return total;
205}
206
207/* convert materialname to materialtype_t */
208
209materialtype_t *
210name_to_material (const shstr_cmp name)
211{
212 for (materialtype_t *mt = materialt; mt; mt = mt->next)
213 if (name == mt->name)
214 return mt;
215
216 return 0; 82 return safe;
217}
218
219/* when doing transmutation of objects, we have to recheck the resistances,
220 * as some that did not apply previously, may apply now.
221 */
222void
223transmute_materialname (object *op, const object *change)
224{
225 materialtype_t *mt;
226 int j;
227
228 if (!op->materialname)
229 return;
230
231 if (op->materialname != change->materialname)
232 return;
233
234 if (!op->is_armor ())
235 return;
236
237 mt = name_to_material (op->materialname);
238 if (!mt)
239 {
240 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
241 return;
242 }
243
244 for (j = 0; j < NROFATTACKS; j++)
245 if (op->resist[j] == 0 && change->resist[j] != 0)
246 {
247 op->resist[j] += mt->mod[j];
248 if (op->resist[j] > 100)
249 op->resist[j] = 100;
250 if (op->resist[j] < -100)
251 op->resist[j] = -100;
252 }
253}
254
255/* set the materialname and type for an item */
256void
257set_materialname (object *op, int difficulty, materialtype_t *nmt)
258{
259 materialtype_t *mt, *lmt;
260
261 if (!op->materialname)
262 return;
263
264 if (nmt)
265 lmt = nmt;
266 else
267 {
268 lmt = 0;
269
270 for (mt = materialt; mt; mt = mt->next)
271 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
272 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
273 {
274 lmt = mt;
275 if (!(op->is_weapon () || op->is_armor ()))
276 break;
277 }
278 }
279
280 if (lmt)
281 {
282 if (op->stats.dam && op->is_weapon ())
283 {
284 op->stats.dam += lmt->damage;
285 if (op->stats.dam < 1)
286 op->stats.dam = 1;
287 }
288
289 if (op->stats.sp && op->type == BOW)
290 op->stats.sp += lmt->sp;
291 if (op->stats.wc && op->is_weapon ())
292 op->stats.wc += lmt->wc;
293 if (op->is_armor ())
294 {
295 if (op->stats.ac)
296 op->stats.ac += lmt->ac;
297
298 for (int j = 0; j < NROFATTACKS; j++)
299 if (op->resist[j] != 0)
300 {
301 op->resist[j] += lmt->mod[j];
302 if (op->resist[j] > 100)
303 op->resist[j] = 100;
304 if (op->resist[j] < -100)
305 op->resist[j] = -100;
306 }
307 }
308
309 op->materialname = lmt->name;
310 /* dont make it unstackable if it doesn't need to be */
311 if (op->is_weapon () || op->is_armor ())
312 {
313 op->weight = (op->weight * lmt->weight) / 100;
314 op->value = (op->value * lmt->value) / 100;
315 }
316 }
317}
318
319/*
320 * Strip out the media tags from a String.
321 * Warning the input string will contain the result string
322 */
323void
324strip_media_tag (char *message)
325{
326 int in_tag = 0;
327 char *dest;
328 char *src;
329
330 src = dest = message;
331 while (*src != '\0')
332 {
333 if (*src == '[')
334 {
335 in_tag = 1;
336 }
337 else if (in_tag && (*src == ']'))
338 in_tag = 0;
339 else if (!in_tag)
340 {
341 *dest = *src;
342 dest++;
343 }
344 src++;
345 }
346 *dest = '\0';
347}
348
349const char *
350strrstr (const char *haystack, const char *needle)
351{
352 const char *lastneedle;
353
354 lastneedle = NULL;
355 while ((haystack = strstr (haystack, needle)) != NULL)
356 {
357 lastneedle = haystack;
358 haystack++;
359 }
360 return lastneedle;
361
362}
363
364#define EOL_SIZE (sizeof("\n")-1)
365void
366strip_endline (char *buf)
367{
368 if (strlen (buf) < sizeof ("\n"))
369 {
370 return;
371 }
372 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
373 buf[strlen (buf) - EOL_SIZE] = '\0';
374}
375
376/**
377 * Replace in string src all occurrences of key by replacement. The resulting
378 * string is put into result; at most resultsize characters (including the
379 * terminating null character) will be written to result.
380 */
381void
382replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
383{
384 size_t resultlen;
385 size_t keylen;
386
387 /* special case to prevent infinite loop if key==replacement=="" */
388 if (strcmp (key, replacement) == 0)
389 {
390 snprintf (result, resultsize, "%s", src);
391 return;
392 }
393
394 keylen = strlen (key);
395
396 resultlen = 0;
397 while (*src != '\0' && resultlen + 1 < resultsize)
398 {
399 if (strncmp (src, key, keylen) == 0)
400 {
401 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
402 resultlen += strlen (result + resultlen);
403 src += keylen;
404 }
405 else
406 {
407 result[resultlen++] = *src++;
408 }
409 }
410 result[resultlen] = '\0';
411}
412
413/**
414 * Taking a string as an argument, mutate it into a string that looks like a list.
415 * a 'list' for the purposes here, is a string of items, seperated by commas, except
416 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
417 * This function will also strip all trailing non alphanumeric characters.
418 * It does not insert an oxford comma.
419 */
420void
421make_list_like (char *input)
422{
423 char *p, tmp[MAX_BUF];
424 int i;
425
426 if (!input || strlen (input) > MAX_BUF - 5)
427 return;
428 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
429
430 strncpy (tmp, input, MAX_BUF - 5);
431 /*trim all trailing commas, spaces etc. */
432 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
433 tmp[i] = '\0';
434
435 strcat (tmp, ".");
436
437 p = strrchr (tmp, ',');
438 if (p)
439 {
440 *p = '\0';
441 strcpy (input, tmp);
442 p++;
443 strcat (input, " and");
444 strcat (input, p);
445 }
446 else
447 strcpy (input, tmp);
448
449 return;
450} 83}
451 84
452///////////////////////////////////////////////////////////////////////////// 85/////////////////////////////////////////////////////////////////////////////
453 86
454void 87void
… …
459 signal (SIGINT , SIG_IGN); 92 signal (SIGINT , SIG_IGN);
460 signal (SIGTERM, SIG_IGN); 93 signal (SIGTERM, SIG_IGN);
461 signal (SIGABRT, SIG_IGN); 94 signal (SIGABRT, SIG_IGN);
462 95
463 signal (SIGSEGV, SIG_DFL); 96 signal (SIGSEGV, SIG_DFL);
97 signal (SIGFPE , SIG_DFL);
98#ifdef SIGBUS
464 signal (SIGBUS , SIG_DFL); 99 signal (SIGBUS , SIG_DFL);
100#endif
465 signal (SIGILL , SIG_DFL); 101 signal (SIGILL , SIG_DFL);
466 signal (SIGTRAP, SIG_DFL); 102 signal (SIGTRAP, SIG_DFL);
467 103
468 // try to put corefiles into a subdirectory, if existing, to allow 104 // try to put corefiles into a subdirectory, if existing, to allow
469 // an administrator to reduce the I/O load. 105 // an administrator to reduce the I/O load.
… …
493 } 129 }
494 130
495 LOG (llevError, "fork abort: %s\n", msg); 131 LOG (llevError, "fork abort: %s\n", msg);
496} 132}
497 133
134void *
498void *salloc_ (int n) throw (std::bad_alloc) 135salloc_ (int n) throw (std::bad_alloc)
499{ 136{
500 void *ptr = g_slice_alloc (n); 137 void *ptr = g_slice_alloc (n);
501 138
502 if (!ptr) 139 if (!ptr)
503 throw std::bad_alloc (); 140 throw std::bad_alloc ();
504 141
505 slice_alloc += n; 142 slice_alloc += n;
506 return ptr; 143 return ptr;
507} 144}
508 145
146void *
509void *salloc_ (int n, void *src) throw (std::bad_alloc) 147salloc_ (int n, void *src) throw (std::bad_alloc)
510{ 148{
511 void *ptr = salloc_ (n); 149 void *ptr = salloc_ (n);
512 150
513 if (src) 151 if (src)
514 memcpy (ptr, src, n); 152 memcpy (ptr, src, n);
… …
522 160
523#if DEBUG_SALLOC 161#if DEBUG_SALLOC
524 162
525#define MAGIC 0xa1b2c35543deadLL 163#define MAGIC 0xa1b2c35543deadLL
526 164
165void *
527void *g_slice_alloc (unsigned long size) 166g_slice_alloc (unsigned long size)
528{ 167{
529 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));
530 *p++ = size ^ MAGIC; 169 *p++ = size ^ MAGIC;
531 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D 170 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
532 return (void *)p; 171 return (void *)p;
533} 172}
534 173
174void *
535void *g_slice_alloc0 (unsigned long size) 175g_slice_alloc0 (unsigned long size)
536{ 176{
537 return memset (g_slice_alloc (size), 0, size); 177 return memset (g_slice_alloc (size), 0, size);
538} 178}
539 179
180void
540void g_slice_free1 (unsigned long size, void *ptr) 181g_slice_free1 (unsigned long size, void *ptr)
541{ 182{
542 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D 183 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
543 if (expect_true (ptr)) 184 if (expect_true (ptr))
544 { 185 {
545 unsigned long *p = (unsigned long *)ptr; 186 unsigned long *p = (unsigned long *)ptr;
… …
556 (g_slice_free1)(s + sizeof (unsigned long), p); 197 (g_slice_free1)(s + sizeof (unsigned long), p);
557 } 198 }
558} 199}
559 200
560#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}
561 238
562/******************************************************************************/ 239/******************************************************************************/
563 240
564int 241int
565assign (char *dst, const char *src, int maxsize) 242assign (char *dst, const char *src, int maxsize)
… …
588 memcpy (dst, src, ++len); 265 memcpy (dst, src, ++len);
589 266
590 return len; 267 return len;
591} 268}
592 269
593const char * 270char *
271vformat (const char *format, va_list ap)
272{
273 static dynbuf_text bufs[8];
274 static int bufidx;
275
276 dynbuf_text &buf = bufs [++bufidx & 7];
277
278 buf.clear ();
279 buf.vprintf (format, ap);
280 return buf;
281}
282
283char *
594format (const char *format, ...) 284format (const char *format, ...)
595{ 285{
596 static dynbuf_text buf;
597
598 buf.clear ();
599
600 va_list ap; 286 va_list ap;
601 va_start (ap, format); 287 va_start (ap, format);
602 buf.vprintf (format, ap); 288 char *buf = vformat (format, ap);
603 va_end (ap); 289 va_end (ap);
604 290
605 return buf; 291 return buf;
606} 292}
607 293
608tstamp now () 294tstamp
295now ()
609{ 296{
610 struct timeval tv; 297 struct timeval tv;
611 298
612 gettimeofday (&tv, 0); 299 gettimeofday (&tv, 0);
613 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);
… …
678 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 365 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
679 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 366 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
680 0x2d02ef8dL 367 0x2d02ef8dL
681}; 368};
682 369
370void
683void thread::start (void *(*start_routine)(void *), void *arg) 371thread::start (void *(*start_routine)(void *), void *arg)
684{ 372{
685 pthread_attr_t attr; 373 pthread_attr_t attr;
686 374
687 pthread_attr_init (&attr); 375 pthread_attr_init (&attr);
688 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