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

Diff Legend

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