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.20 by root, Mon Dec 11 21:32:16 2006 UTC vs.
Revision 1.95 by root, Fri Mar 26 01:04:44 2010 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 Copyright (C) 1992 Frank Tore Johansen 5 *
6 6 * Deliantra is free software: you can redistribute it and/or modify it under
7 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 7 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 8 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 9 * option) any later version.
11 10 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 14 * GNU General Public License for more details.
16 15 *
17 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
18 along with this program; if not, write to the Free Software 17 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 18 * <http://www.gnu.org/licenses/>.
20 19 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 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
27#include <cstdlib>
28#include <sys/types.h>
29#include <unistd.h>
30#include <sys/time.h>
31#include <time.h>
32#include <signal.h>
33
28#include <global.h> 34#include <global.h>
29#include <funcpoint.h>
30#include <material.h> 35#include <material.h>
36#include <object.h>
37
38#include <sys/time.h>
39#include <sys/resource.h>
31 40
32#include <glib.h> 41#include <glib.h>
33 42
34/* 43refcnt_base::refcnt_t refcnt_dummy;
35 * The random functions here take luck into account when rolling random 44ssize_t slice_alloc;
36 * dice or numbers. This function has less of an impact the larger the 45rand_gen rndm, rmg_rndm;
37 * difference becomes in the random numbers. IE, the effect is lessened 46
38 * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers, 47#if !GCC_VERSION(3,4)
39 * to specifically disable luck in certain rolls, simply by making the 48int least_significant_bit (uint32_t x)
40 * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3) 49{
50 x &= -x; // this isolates the lowest bit
51
52 int r = 0;
53
54 if (x & 0xaaaaaaaa) r += 1;
55 if (x & 0xcccccccc) r += 2;
56 if (x & 0xf0f0f0f0) r += 4;
57 if (x & 0xff00ff00) r += 8;
58 if (x & 0xffff0000) r += 16;
59
60 return r;
61}
62#endif
63
64void
65tausworthe_random_generator::seed (uint32_t seed)
66{
67 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
68 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
69 state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
70 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
71
72 for (int i = 11; --i; )
73 next ();
74}
75
76uint32_t
77tausworthe_random_generator::next ()
78{
79 state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U);
80 state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U);
81 state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
82 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
83
84 return state [0] ^ state [1] ^ state [2] ^ state [3];
85}
86
87template<class generator>
88uint32_t
89random_number_generator<generator>::get_range (uint32_t num)
90{
91 return (this->next () * (uint64_t)num) >> 32U;
92}
93
94// return a number within (min .. max)
95template<class generator>
96int
97random_number_generator<generator>::get_range (int r_min, int r_max)
98{
99 return r_min + get_range (max (r_max - r_min + 1, 0));
100}
101
102template struct random_number_generator<tausworthe_random_generator>;
103template struct random_number_generator<xorshift_random_generator>;
104
105/******************************************************************************/
106
107/* Checks a player-provided string which will become the msg property of
108 * an object for dangerous input.
41 */ 109 */
110bool
111msg_is_safe (const char *msg)
112{
113 bool safe = true;
42 114
43/* 115 /* Trying to cheat by getting data into the object */
44 * Roll a random number between min and max. Uses op to determine luck, 116 if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
45 * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. 117 || strstr (msg, "\nendmsg"))
46 * Generally, op should be the player/caster/hitter requesting the roll, 118 safe = false;
47 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 119
48 */ 120 /* Trying to make the object talk, and potentially access arbitrary code */
121 if (object::msg_has_dialogue (msg))
122 safe = false;
123
124 return safe;
125}
126
127/////////////////////////////////////////////////////////////////////////////
128
129void
130fork_abort (const char *msg)
131{
132 if (!fork ())
133 {
134 signal (SIGINT , SIG_IGN);
135 signal (SIGTERM, SIG_IGN);
136 signal (SIGABRT, SIG_IGN);
137
138 signal (SIGSEGV, SIG_DFL);
139 signal (SIGBUS , SIG_DFL);
140 signal (SIGILL , SIG_DFL);
141 signal (SIGTRAP, SIG_DFL);
142
143 // try to put corefiles into a subdirectory, if existing, to allow
144 // an administrator to reduce the I/O load.
145 chdir ("cores");
146
147 // try to detach us from as many external dependencies as possible
148 // as coredumping can take time by closing all fd's.
149 {
150 struct rlimit lim;
151
152 if (getrlimit (RLIMIT_NOFILE, &lim))
153 lim.rlim_cur = 1024;
154
155 for (int i = 0; i < lim.rlim_cur; ++i)
156 close (i);
157 }
158
159 {
160 sigset_t empty;
161 sigemptyset (&empty);
162 sigprocmask (SIG_SETMASK, &empty, 0);
163 }
164
165 // try to coredump with SIGTRAP
166 kill (getpid (), SIGTRAP);
167 abort ();
168 }
169
170 LOG (llevError, "fork abort: %s\n", msg);
171}
172
173void *salloc_ (int n) throw (std::bad_alloc)
174{
175 void *ptr = g_slice_alloc (n);
176
177 if (!ptr)
178 throw std::bad_alloc ();
179
180 slice_alloc += n;
181 return ptr;
182}
183
184void *salloc_ (int n, void *src) throw (std::bad_alloc)
185{
186 void *ptr = salloc_ (n);
187
188 if (src)
189 memcpy (ptr, src, n);
190 else
191 memset (ptr, 0, n);
192
193 return ptr;
194}
195
196/******************************************************************************/
197
198#if DEBUG_SALLOC
199
200#define MAGIC 0xa1b2c35543deadLL
201
202void *g_slice_alloc (unsigned long size)
203{
204 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
205 *p++ = size ^ MAGIC;
206 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
207 return (void *)p;
208}
209
210void *g_slice_alloc0 (unsigned long size)
211{
212 return memset (g_slice_alloc (size), 0, size);
213}
214
215void g_slice_free1 (unsigned long size, void *ptr)
216{
217 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
218 if (expect_true (ptr))
219 {
220 unsigned long *p = (unsigned long *)ptr;
221 unsigned long s = *--p ^ MAGIC;
222
223 if (size != (unsigned long)(*p ^ MAGIC))
224 {
225 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
226 abort ();
227 }
228
229 *p = MAGIC;
230
231 (g_slice_free1)(s + sizeof (unsigned long), p);
232 }
233}
234
235#endif
236
237/******************************************************************************/
49 238
50int 239int
51random_roll (int min, int max, const object *op, int goodbad) 240assign (char *dst, const char *src, int maxsize)
52{ 241{
53 int omin, diff, luck, base, ran; 242 if (!src)
243 src = "";
54 244
55 omin = min; 245 int len = strlen (src);
56 diff = max - min + 1;
57 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
58 246
59 if (max < 1 || diff < 1) 247 if (len >= maxsize)
60 { 248 {
61 LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max); 249 if (maxsize <= 4)
62 return (min); /* avoids a float exception */
63 }
64
65 ran = RANDOM ();
66
67 if (op->type != PLAYER)
68 return ((ran % diff) + min);
69
70 luck = op->stats.luck;
71 if (RANDOM () % base < MIN (10, abs (luck)))
72 {
73 /* we have a winner */
74 ((luck > 0) ? (luck = 1) : (luck = -1));
75 diff -= luck;
76 if (diff < 1)
77 return (omin); /*check again */
78 ((goodbad) ? (min += luck) : (diff));
79
80 return (MAX (omin, MIN (max, (ran % diff) + min)));
81 }
82 return ((ran % diff) + min);
83}
84
85/*
86 * This is a 64 bit version of random_roll above. This is needed
87 * for exp loss calculations for players changing religions.
88 */
89
90sint64
91random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
92{
93 sint64 omin, diff, luck, ran;
94 int base;
95
96 omin = min;
97 diff = max - min + 1;
98 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
99
100 if (max < 1 || diff < 1)
101 {
102 LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
103 return (min); /* avoids a float exception */
104 }
105
106 /* Don't know of a portable call to get 64 bit random values.
107 * So make a call to get two 32 bit random numbers, and just to
108 * a little byteshifting. Do make sure the first one is only
109 * 32 bit, so we don't get skewed results
110 */
111 ran = (RANDOM () & 0xffffffff) | ((sint64) RANDOM () << 32);
112
113 if (op->type != PLAYER)
114 return ((ran % diff) + min);
115
116 luck = op->stats.luck;
117 if (RANDOM () % base < MIN (10, abs (luck)))
118 {
119 /* we have a winner */
120 ((luck > 0) ? (luck = 1) : (luck = -1));
121 diff -= luck;
122 if (diff < 1)
123 return (omin); /*check again */
124 ((goodbad) ? (min += luck) : (diff));
125
126 return (MAX (omin, MIN (max, (ran % diff) + min)));
127 }
128 return ((ran % diff) + min);
129}
130
131/*
132 * Roll a number of dice (2d3, 4d6). Uses op to determine luck,
133 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
134 * Generally, op should be the player/caster/hitter requesting the roll,
135 * not the recipient (ie, the poor slob getting hit).
136 * The args are num D size (ie 4d6) [garbled 20010916]
137 */
138
139int
140die_roll (int num, int size, const object *op, int goodbad)
141{
142 int min, diff, luck, total, i, gotlucky, base, ran;
143
144 diff = size;
145 min = 1;
146 luck = total = gotlucky = 0;
147 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
148 if (size < 2 || diff < 1)
149 {
150 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
151 return (num); /* avoids a float exception */
152 }
153
154 if (op->type == PLAYER)
155 luck = op->stats.luck;
156
157 for (i = 0; i < num; i++)
158 {
159 if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)
160 { 250 {
161 /* we have a winner */ 251 memset (dst, '.', maxsize - 2);
162 gotlucky++; 252 dst [maxsize - 1] = 0;
163 ((luck > 0) ? (luck = 1) : (luck = -1));
164 diff -= luck;
165 if (diff < 1)
166 return (num); /*check again */
167 ((goodbad) ? (min += luck) : (diff));
168 ran = RANDOM ();
169 total += MAX (1, MIN (size, (ran % diff) + min));
170 } 253 }
171 else 254 else
172 { 255 {
173 total += RANDOM () % size + 1; 256 memcpy (dst, src, maxsize - 4);
257 memcpy (dst + maxsize - 4, "...", 4);
174 } 258 }
175 }
176 return (total);
177}
178 259
179/* 260 len = maxsize;
180 * Another convenience function. Returns a number between min and max.
181 * It is suggested one use these functions rather than RANDOM()%, as it
182 * would appear that a number of off-by-one-errors exist due to improper
183 * use of %. This should also prevent SIGFPE.
184 */
185
186int
187rndm (int min, int max)
188{
189 int diff;
190
191 diff = max - min + 1;
192 if (max < 1 || diff < 1)
193 return (min);
194
195 return (RANDOM () % diff + min);
196}
197
198/* decay and destroy persihable items in a map */
199
200void
201decay_objects (maptile *m)
202{
203 int x, y, destroy;
204 object *op, *otmp;
205
206 if (m->unique)
207 return;
208
209 for (x = 0; x < MAP_WIDTH (m); x++)
210 for (y = 0; y < MAP_HEIGHT (m); y++)
211 for (op = get_map_ob (m, x, y); op; op = otmp)
212 {
213 destroy = 0;
214 otmp = op->above;
215 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
216 break;
217 if (QUERY_FLAG (op, FLAG_IS_FLOOR) ||
218 QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) ||
219 QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) ||
220 QUERY_FLAG (op, FLAG_UNIQUE) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) || QUERY_FLAG (op, FLAG_UNPAID) || IS_LIVE (op))
221 continue;
222 /* otherwise, we decay and destroy */
223 if (IS_WEAPON (op))
224 {
225 op->stats.dam--;
226 if (op->stats.dam < 0)
227 destroy = 1;
228 }
229 else if (IS_ARMOR (op))
230 {
231 op->stats.ac--;
232 if (op->stats.ac < 0)
233 destroy = 1;
234 }
235 else if (op->type == FOOD)
236 {
237 op->stats.food -= rndm (5, 20);
238 if (op->stats.food < 0)
239 destroy = 1;
240 }
241 else
242 {
243 if (op->material & M_PAPER || op->material & M_LEATHER ||
244 op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID)
245 destroy = 1;
246 if (op->material & M_IRON && rndm (1, 5) == 1)
247 destroy = 1;
248 if (op->material & M_GLASS && rndm (1, 2) == 1)
249 destroy = 1;
250 if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1)
251 destroy = 1;
252 if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1)
253 destroy = 1;
254 if (op->material & M_ICE && MAP_TEMP (m) > 32)
255 destroy = 1;
256 }
257 /* adjust overall chance below */
258 if (destroy && rndm (0, 1))
259 {
260 remove_ob (op);
261 free_object (op);
262 }
263 }
264}
265
266/* convert materialname to materialtype_t */
267
268materialtype_t *
269name_to_material (const char *name)
270{
271 materialtype_t *mt, *nmt;
272
273 mt = NULL;
274 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
275 {
276 if (strcmp (name, nmt->name) == 0)
277 {
278 mt = nmt;
279 break;
280 }
281 }
282 return mt;
283}
284
285/* when doing transmutation of objects, we have to recheck the resistances,
286 * as some that did not apply previously, may apply now.
287 */
288
289void
290transmute_materialname (object *op, const object *change)
291{
292 materialtype_t *mt;
293 int j;
294
295 if (op->materialname == NULL)
296 return;
297
298 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
299 return;
300
301 if (!IS_ARMOR (op))
302 return;
303
304 mt = name_to_material (op->materialname);
305 if (!mt)
306 {
307 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
308 return;
309 }
310
311 for (j = 0; j < NROFATTACKS; j++)
312 if (op->resist[j] == 0 && change->resist[j] != 0)
313 {
314 op->resist[j] += mt->mod[j];
315 if (op->resist[j] > 100)
316 op->resist[j] = 100;
317 if (op->resist[j] < -100)
318 op->resist[j] = -100;
319 }
320}
321
322/* set the materialname and type for an item */
323void
324set_materialname (object *op, int difficulty, materialtype_t *nmt)
325{
326 materialtype_t *mt, *lmt;
327
328#ifdef NEW_MATERIAL_CODE
329 int j;
330#endif
331
332 if (op->materialname != NULL)
333 return;
334
335
336
337 if (nmt == NULL)
338 {
339 lmt = NULL;
340#ifndef NEW_MATERIAL_CODE
341 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
342 {
343 if (op->material & mt->material)
344 {
345 lmt = mt;
346 break;
347 }
348 }
349
350#else
351 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
352 {
353 if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
354 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
355 {
356 lmt = mt;
357 if (!(IS_WEAPON (op) || IS_ARMOR (op)))
358 break;
359 }
360 }
361#endif
362 } 261 }
363 else 262 else
364 { 263 memcpy (dst, src, ++len);
365 lmt = nmt;
366 }
367 264
368 if (lmt != NULL) 265 return len;
369 { 266}
370#ifndef NEW_MATERIAL_CODE 267
371 op->materialname = lmt->name; 268char *
269vformat (const char *format, va_list ap)
270{
271 static dynbuf_text buf; buf.clear ();
272 buf.vprintf (format, ap);
273 return buf;
274}
275
276char *
277format (const char *format, ...)
278{
279 va_list ap;
280 va_start (ap, format);
281 char *buf = vformat (format, ap);
282 va_end (ap);
283
284 return buf;
285}
286
287tstamp now ()
288{
289 struct timeval tv;
290
291 gettimeofday (&tv, 0);
292 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
293}
294
295int
296similar_direction (int a, int b)
297{
298 if (!a || !b)
372 return; 299 return 0;
373#else
374 300
375 if (op->stats.dam && IS_WEAPON (op)) 301 int diff = (b - a) & 7;
376 { 302 return diff <= 1 || diff >= 7;
377 op->stats.dam += lmt->damage; 303}
378 if (op->stats.dam < 1) 304
379 op->stats.dam = 1; 305/* crc32 0xdebb20e3 table and supplementary functions. */
380 } 306extern const uint32_t crc_32_tab[256] =
381 if (op->stats.sp && op->type == BOW) 307{
382 op->stats.sp += lmt->sp; 308 0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
383 if (op->stats.wc && IS_WEAPON (op)) 309 0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
384 op->stats.wc += lmt->wc; 310 0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
385 if (IS_ARMOR (op)) 311 0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
386 { 312 0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
387 if (op->stats.ac) 313 0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
388 op->stats.ac += lmt->ac; 314 0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
389 for (j = 0; j < NROFATTACKS; j++) 315 0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
390 if (op->resist[j] != 0) 316 0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
391 { 317 0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
392 op->resist[j] += lmt->mod[j]; 318 0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
393 if (op->resist[j] > 100) 319 0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
394 op->resist[j] = 100; 320 0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
395 if (op->resist[j] < -100) 321 0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
396 op->resist[j] = -100; 322 0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
397 } 323 0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
398 } 324 0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
399 op->materialname = add_string (lmt->name); 325 0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
400 /* dont make it unstackable if it doesn't need to be */ 326 0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
401 if (IS_WEAPON (op) || IS_ARMOR (op)) 327 0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
402 { 328 0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
403 op->weight = (op->weight * lmt->weight) / 100; 329 0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
404 op->value = (op->value * lmt->value) / 100; 330 0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
405 } 331 0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
332 0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
333 0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
334 0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
335 0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
336 0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
337 0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
338 0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
339 0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
340 0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
341 0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
342 0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
343 0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
344 0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
345 0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
346 0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
347 0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
348 0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
349 0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
350 0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
351 0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
352 0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
353 0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
354 0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
355 0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
356 0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
357 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
358 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
359 0x2d02ef8dL
360};
361
362void thread::start (void *(*start_routine)(void *), void *arg)
363{
364 pthread_attr_t attr;
365
366 pthread_attr_init (&attr);
367 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
368 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
369 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
370#ifdef PTHREAD_SCOPE_PROCESS
371 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
406#endif 372#endif
407 }
408}
409 373
410/* 374 sigset_t fullsigset, oldsigset;
411 * Strip out the media tags from a String. 375 sigfillset (&fullsigset);
412 * Warning the input string will contain the result string
413 */
414void
415strip_media_tag (char *message)
416{
417 int in_tag = 0;
418 char *dest;
419 char *src;
420 376
421 src = dest = message; 377 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
422 while (*src != '\0')
423 {
424 if (*src == '[')
425 {
426 in_tag = 1;
427 }
428 else if (in_tag && (*src == ']'))
429 in_tag = 0;
430 else if (!in_tag)
431 {
432 *dest = *src;
433 dest++;
434 }
435 src++;
436 }
437 *dest = '\0';
438}
439 378
440const char * 379 if (pthread_create (&id, &attr, start_routine, arg))
441strrstr (const char *haystack, const char *needle) 380 cleanup ("unable to create a new thread");
442{
443 const char *lastneedle;
444 381
445 lastneedle = NULL; 382 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
446 while ((haystack = strstr (haystack, needle)) != NULL)
447 {
448 lastneedle = haystack;
449 haystack++;
450 }
451 return lastneedle;
452
453} 383}
454 384
455#define EOL_SIZE (sizeof("\n")-1)
456void
457strip_endline (char *buf)
458{
459 if (strlen (buf) < sizeof ("\n"))
460 {
461 return;
462 }
463 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
464 buf[strlen (buf) - EOL_SIZE] = '\0';
465}
466
467/**
468 * Replace in string src all occurrences of key by replacement. The resulting
469 * string is put into result; at most resultsize characters (including the
470 * terminating null character) will be written to result.
471 */
472void
473replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
474{
475 size_t resultlen;
476 size_t keylen;
477
478 /* special case to prevent infinite loop if key==replacement=="" */
479 if (strcmp (key, replacement) == 0)
480 {
481 snprintf (result, resultsize, "%s", src);
482 return;
483 }
484
485 keylen = strlen (key);
486
487 resultlen = 0;
488 while (*src != '\0' && resultlen + 1 < resultsize)
489 {
490 if (strncmp (src, key, keylen) == 0)
491 {
492 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
493 resultlen += strlen (result + resultlen);
494 src += keylen;
495 }
496 else
497 {
498 result[resultlen++] = *src++;
499 }
500 }
501 result[resultlen] = '\0';
502}
503
504/**
505 * Taking a string as an argument, mutate it into a string that looks like a list.
506 * a 'list' for the purposes here, is a string of items, seperated by commas, except
507 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
508 * This function will also strip all trailing non alphanumeric characters.
509 * It does not insert an oxford comma.
510 */
511
512void
513make_list_like (char *input)
514{
515 char *p, tmp[MAX_BUF];
516 int i;
517
518 if (!input || strlen (input) > MAX_BUF - 5)
519 return;
520 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
521
522 strncpy (tmp, input, MAX_BUF - 5);
523 /*trim all trailing commas, spaces etc. */
524 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
525 tmp[i] = '\0';
526
527 strcat (tmp, ".");
528
529 p = strrchr (tmp, ',');
530 if (p)
531 {
532 *p = '\0';
533 strcpy (input, tmp);
534 p++;
535 strcat (input, " and");
536 strcat (input, p);
537 }
538 else
539 strcpy (input, tmp);
540
541 return;
542}
543
544/////////////////////////////////////////////////////////////////////////////
545
546#if 0
547refcounted *refcounted::rc_first;
548
549refcounted::refcounted ()
550{
551 refcnt = 0;
552 rc_next = rc_first;
553 rc_first = this;
554}
555
556refcounted::~refcounted ()
557{
558 assert (!rc_next);
559 assert (!refcnt);
560}
561#endif
562
563void *alloc (int s) throw (std::bad_alloc)
564{
565 void *p = g_slice_alloc (s);
566
567 if (!p)
568 throw std::bad_alloc ();
569
570 return p;
571}
572
573void assign (char *dst, const char *src, int maxlen)
574{
575 if (!src)
576 src = "";
577
578 int len = strlen (src);
579
580 if (len >= maxlen - 1)
581 {
582 if (maxlen <= 4)
583 {
584 memset (dst, '.', maxlen - 1);
585 dst [maxlen - 1] = 0;
586 }
587 else
588 {
589 memcpy (dst, src, maxlen - 4);
590 memcpy (dst + maxlen - 4, "...", 4);
591 }
592 }
593 else
594 memcpy (dst, src, len + 1);
595}
596
597

Diff Legend

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