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.83 by root, Sun Dec 28 06:59:26 2008 UTC vs.
Revision 1.100 by root, Tue Jan 3 11:25:31 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 operator ()();
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
70uint32_t 63/******************************************************************************/
71tausworthe_random_generator::get_range (uint32_t num)
72{
73 return (next () * (uint64_t)num) >> 32U;
74}
75 64
76// return a number within (min .. max) 65/* Checks a player-provided string which will become the msg property of
77int 66 * an object for dangerous input.
78tausworthe_random_generator::get_range (int r_min, int r_max)
79{
80 return r_min + get_range (max (r_max - r_min + 1, 0));
81}
82
83/*
84 * The random functions here take luck into account when rolling random
85 * dice or numbers. This function has less of an impact the larger the
86 * difference becomes in the random numbers. IE, the effect is lessened
87 * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers,
88 * to specifically disable luck in certain rolls, simply by making the
89 * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3)
90 */ 67 */
91 68bool
92/* 69msg_is_safe (const char *msg)
93 * Roll a random number between min and max. Uses op to determine luck,
94 * and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
95 * Generally, op should be the player/caster/hitter requesting the roll,
96 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
97 */
98int
99random_roll (int r_min, int r_max, const object *op, int goodbad)
100{ 70{
101 r_max = max (r_min, r_max); 71 bool safe = true;
102 72
103 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;
104 77
105 if (op->type == PLAYER) 78 /* Trying to make the object talk, and potentially access arbitrary code */
106 { 79 if (object::msg_has_dialogue (msg))
107 int luck = op->stats.luck; 80 safe = false;
108 81
109 if (rndm (base) < min (10, abs (luck)))
110 {
111 //TODO: take luck into account
112 }
113 }
114
115 return rndm (r_min, r_max);
116}
117
118/*
119 * This is a 64 bit version of random_roll above. This is needed
120 * for exp loss calculations for players changing religions.
121 */
122sint64
123random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
124{
125 sint64 omin = r_min;
126 sint64 range = max (0, r_max - r_min + 1);
127 int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
128
129 /*
130 * Make a call to get two 32 bit unsigned random numbers, and just to
131 * a little bitshifting.
132 */
133 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
134
135 if (op->type != PLAYER)
136 return ((ran % range) + r_min);
137
138 int luck = op->stats.luck;
139
140 if (rndm (base) < min (10, abs (luck)))
141 {
142 /* we have a winner */
143 ((luck > 0) ? (luck = 1) : (luck = -1));
144 range -= luck;
145 if (range < 1)
146 return (omin); /*check again */
147
148 ((goodbad) ? (r_min += luck) : (range));
149
150 return (max (omin, min (r_max, (ran % range) + r_min)));
151 }
152
153 return ran % range + r_min;
154}
155
156/*
157 * Roll a number of dice (2d3, 4d6). Uses op to determine luck,
158 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
159 * Generally, op should be the player/caster/hitter requesting the roll,
160 * not the recipient (ie, the poor slob getting hit).
161 * The args are num D size (ie 4d6) [garbled 20010916]
162 */
163int
164die_roll (int num, int size, const object *op, int goodbad)
165{
166 int min, luck, total, i, gotlucky;
167
168 int diff = size;
169 min = 1;
170 luck = total = gotlucky = 0;
171 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
172
173 if (size < 2 || diff < 1)
174 {
175 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
176 return num; /* avoids a float exception */
177 }
178
179 if (op->type == PLAYER)
180 luck = op->stats.luck;
181
182 for (i = 0; i < num; i++)
183 {
184 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
185 {
186 /* we have a winner */
187 gotlucky++;
188 ((luck > 0) ? (luck = 1) : (luck = -1));
189 diff -= luck;
190 if (diff < 1)
191 return (num); /*check again */
192 ((goodbad) ? (min += luck) : (diff));
193 total += MAX (1, MIN (size, rndm (diff) + min));
194 }
195 else
196 total += rndm (size) + 1;
197 }
198
199 return total;
200}
201
202/* convert materialname to materialtype_t */
203
204materialtype_t *
205name_to_material (const shstr_cmp name)
206{
207 for (materialtype_t *mt = materialt; mt; mt = mt->next)
208 if (name == mt->name)
209 return mt;
210
211 return 0; 82 return safe;
212}
213
214/* when doing transmutation of objects, we have to recheck the resistances,
215 * as some that did not apply previously, may apply now.
216 */
217void
218transmute_materialname (object *op, const object *change)
219{
220 materialtype_t *mt;
221 int j;
222
223 if (!op->materialname)
224 return;
225
226 if (change->materialname && strcmp (op->materialname, change->materialname))
227 return;
228
229 if (!op->is_armor ())
230 return;
231
232 mt = name_to_material (op->materialname);
233 if (!mt)
234 {
235 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
236 return;
237 }
238
239 for (j = 0; j < NROFATTACKS; j++)
240 if (op->resist[j] == 0 && change->resist[j] != 0)
241 {
242 op->resist[j] += mt->mod[j];
243 if (op->resist[j] > 100)
244 op->resist[j] = 100;
245 if (op->resist[j] < -100)
246 op->resist[j] = -100;
247 }
248}
249
250/* set the materialname and type for an item */
251void
252set_materialname (object *op, int difficulty, materialtype_t *nmt)
253{
254 materialtype_t *mt, *lmt;
255
256 if (!op->materialname)
257 return;
258
259 if (nmt)
260 lmt = nmt;
261 else
262 {
263 lmt = 0;
264
265 for (mt = materialt; mt; mt = mt->next)
266 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
267 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
268 {
269 lmt = mt;
270 if (!(op->is_weapon () || op->is_armor ()))
271 break;
272 }
273 }
274
275 if (lmt)
276 {
277 if (op->stats.dam && op->is_weapon ())
278 {
279 op->stats.dam += lmt->damage;
280 if (op->stats.dam < 1)
281 op->stats.dam = 1;
282 }
283
284 if (op->stats.sp && op->type == BOW)
285 op->stats.sp += lmt->sp;
286 if (op->stats.wc && op->is_weapon ())
287 op->stats.wc += lmt->wc;
288 if (op->is_armor ())
289 {
290 if (op->stats.ac)
291 op->stats.ac += lmt->ac;
292
293 for (int j = 0; j < NROFATTACKS; j++)
294 if (op->resist[j] != 0)
295 {
296 op->resist[j] += lmt->mod[j];
297 if (op->resist[j] > 100)
298 op->resist[j] = 100;
299 if (op->resist[j] < -100)
300 op->resist[j] = -100;
301 }
302 }
303
304 op->materialname = lmt->name;
305 /* dont make it unstackable if it doesn't need to be */
306 if (op->is_weapon () || op->is_armor ())
307 {
308 op->weight = (op->weight * lmt->weight) / 100;
309 op->value = (op->value * lmt->value) / 100;
310 }
311 }
312}
313
314/*
315 * Strip out the media tags from a String.
316 * Warning the input string will contain the result string
317 */
318void
319strip_media_tag (char *message)
320{
321 int in_tag = 0;
322 char *dest;
323 char *src;
324
325 src = dest = message;
326 while (*src != '\0')
327 {
328 if (*src == '[')
329 {
330 in_tag = 1;
331 }
332 else if (in_tag && (*src == ']'))
333 in_tag = 0;
334 else if (!in_tag)
335 {
336 *dest = *src;
337 dest++;
338 }
339 src++;
340 }
341 *dest = '\0';
342}
343
344const char *
345strrstr (const char *haystack, const char *needle)
346{
347 const char *lastneedle;
348
349 lastneedle = NULL;
350 while ((haystack = strstr (haystack, needle)) != NULL)
351 {
352 lastneedle = haystack;
353 haystack++;
354 }
355 return lastneedle;
356
357}
358
359#define EOL_SIZE (sizeof("\n")-1)
360void
361strip_endline (char *buf)
362{
363 if (strlen (buf) < sizeof ("\n"))
364 {
365 return;
366 }
367 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
368 buf[strlen (buf) - EOL_SIZE] = '\0';
369}
370
371/**
372 * Replace in string src all occurrences of key by replacement. The resulting
373 * string is put into result; at most resultsize characters (including the
374 * terminating null character) will be written to result.
375 */
376void
377replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
378{
379 size_t resultlen;
380 size_t keylen;
381
382 /* special case to prevent infinite loop if key==replacement=="" */
383 if (strcmp (key, replacement) == 0)
384 {
385 snprintf (result, resultsize, "%s", src);
386 return;
387 }
388
389 keylen = strlen (key);
390
391 resultlen = 0;
392 while (*src != '\0' && resultlen + 1 < resultsize)
393 {
394 if (strncmp (src, key, keylen) == 0)
395 {
396 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
397 resultlen += strlen (result + resultlen);
398 src += keylen;
399 }
400 else
401 {
402 result[resultlen++] = *src++;
403 }
404 }
405 result[resultlen] = '\0';
406}
407
408/**
409 * Taking a string as an argument, mutate it into a string that looks like a list.
410 * a 'list' for the purposes here, is a string of items, seperated by commas, except
411 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
412 * This function will also strip all trailing non alphanumeric characters.
413 * It does not insert an oxford comma.
414 */
415void
416make_list_like (char *input)
417{
418 char *p, tmp[MAX_BUF];
419 int i;
420
421 if (!input || strlen (input) > MAX_BUF - 5)
422 return;
423 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
424
425 strncpy (tmp, input, MAX_BUF - 5);
426 /*trim all trailing commas, spaces etc. */
427 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
428 tmp[i] = '\0';
429
430 strcat (tmp, ".");
431
432 p = strrchr (tmp, ',');
433 if (p)
434 {
435 *p = '\0';
436 strcpy (input, tmp);
437 p++;
438 strcat (input, " and");
439 strcat (input, p);
440 }
441 else
442 strcpy (input, tmp);
443
444 return;
445} 83}
446 84
447///////////////////////////////////////////////////////////////////////////// 85/////////////////////////////////////////////////////////////////////////////
448 86
449void 87void
… …
488 } 126 }
489 127
490 LOG (llevError, "fork abort: %s\n", msg); 128 LOG (llevError, "fork abort: %s\n", msg);
491} 129}
492 130
131void *
493void *salloc_ (int n) throw (std::bad_alloc) 132salloc_ (int n) throw (std::bad_alloc)
494{ 133{
495 void *ptr = g_slice_alloc (n); 134 void *ptr = g_slice_alloc (n);
496 135
497 if (!ptr) 136 if (!ptr)
498 throw std::bad_alloc (); 137 throw std::bad_alloc ();
499 138
500 slice_alloc += n; 139 slice_alloc += n;
501 return ptr; 140 return ptr;
502} 141}
503 142
143void *
504void *salloc_ (int n, void *src) throw (std::bad_alloc) 144salloc_ (int n, void *src) throw (std::bad_alloc)
505{ 145{
506 void *ptr = salloc_ (n); 146 void *ptr = salloc_ (n);
507 147
508 if (src) 148 if (src)
509 memcpy (ptr, src, n); 149 memcpy (ptr, src, n);
… …
517 157
518#if DEBUG_SALLOC 158#if DEBUG_SALLOC
519 159
520#define MAGIC 0xa1b2c35543deadLL 160#define MAGIC 0xa1b2c35543deadLL
521 161
162void *
522void *g_slice_alloc (unsigned long size) 163g_slice_alloc (unsigned long size)
523{ 164{
524 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); 165 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
525 *p++ = size ^ MAGIC; 166 *p++ = size ^ MAGIC;
526 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D 167 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
527 return (void *)p; 168 return (void *)p;
528} 169}
529 170
171void *
530void *g_slice_alloc0 (unsigned long size) 172g_slice_alloc0 (unsigned long size)
531{ 173{
532 return memset (g_slice_alloc (size), 0, size); 174 return memset (g_slice_alloc (size), 0, size);
533} 175}
534 176
177void
535void g_slice_free1 (unsigned long size, void *ptr) 178g_slice_free1 (unsigned long size, void *ptr)
536{ 179{
537 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D 180 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
538 if (expect_true (ptr)) 181 if (expect_true (ptr))
539 { 182 {
540 unsigned long *p = (unsigned long *)ptr; 183 unsigned long *p = (unsigned long *)ptr;
… …
554 197
555#endif 198#endif
556 199
557/******************************************************************************/ 200/******************************************************************************/
558 201
202refcnt_buf::refcnt_buf (size_t size)
203{
204 _alloc (size);
205}
206
207refcnt_buf::refcnt_buf (void *data, size_t size)
208{
209 _alloc (size);
210 memcpy (this->data, data, size);
211}
212
213refcnt_buf::~refcnt_buf ()
214{
215 dec ();
216}
217
218refcnt_buf &
219refcnt_buf::operator =(const refcnt_buf &src)
220{
221 dec ();
222 data = src.data;
223 ++_refcnt ();
224 return *this;
225}
226
227/******************************************************************************/
228
229int
559void assign (char *dst, const char *src, int maxlen) 230assign (char *dst, const char *src, int maxsize)
560{ 231{
561 if (!src) 232 if (!src)
562 src = ""; 233 src = "";
563 234
564 int len = strlen (src); 235 int len = strlen (src);
565 236
566 if (len >= maxlen - 1) 237 if (len >= maxsize)
567 { 238 {
568 if (maxlen <= 4) 239 if (maxsize <= 4)
569 { 240 {
570 memset (dst, '.', maxlen - 1); 241 memset (dst, '.', maxsize - 2);
571 dst [maxlen - 1] = 0; 242 dst [maxsize - 1] = 0;
572 } 243 }
573 else 244 else
574 { 245 {
575 memcpy (dst, src, maxlen - 4); 246 memcpy (dst, src, maxsize - 4);
576 memcpy (dst + maxlen - 4, "...", 4); 247 memcpy (dst + maxsize - 4, "...", 4);
577 } 248 }
249
250 len = maxsize;
578 } 251 }
579 else 252 else
580 memcpy (dst, src, len + 1); 253 memcpy (dst, src, ++len);
581}
582 254
583const char * 255 return len;
256}
257
258char *
259vformat (const char *format, va_list ap)
260{
261 static dynbuf_text bufs[8];
262 static int bufidx;
263
264 dynbuf_text &buf = bufs [++bufidx & 7];
265
266 buf.clear ();
267 buf.vprintf (format, ap);
268 return buf;
269}
270
271char *
584format (const char *format, ...) 272format (const char *format, ...)
585{ 273{
586 static dynbuf_text buf;
587
588 buf.clear ();
589
590 va_list ap; 274 va_list ap;
591 va_start (ap, format); 275 va_start (ap, format);
592 buf.vprintf (format, ap); 276 char *buf = vformat (format, ap);
593 va_end (ap); 277 va_end (ap);
594 278
595 return buf; 279 return buf;
596} 280}
597 281
598tstamp now () 282tstamp
283now ()
599{ 284{
600 struct timeval tv; 285 struct timeval tv;
601 286
602 gettimeofday (&tv, 0); 287 gettimeofday (&tv, 0);
603 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 288 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
… …
668 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 353 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
669 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 354 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
670 0x2d02ef8dL 355 0x2d02ef8dL
671}; 356};
672 357
358void
673void thread::start (void *(*start_routine)(void *), void *arg) 359thread::start (void *(*start_routine)(void *), void *arg)
674{ 360{
675 pthread_attr_t attr; 361 pthread_attr_t attr;
676 362
677 pthread_attr_init (&attr); 363 pthread_attr_init (&attr);
678 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); 364 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);

Diff Legend

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