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