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.3 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.108 by root, Sat Nov 17 23:40:00 2018 UTC

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

Diff Legend

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