1 |
elmex |
1.1 |
/* |
2 |
pippijn |
1.39 |
* CrossFire, A Multiplayer game for X-windows |
3 |
|
|
* |
4 |
|
|
* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 |
|
|
* Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
6 |
|
|
* Copyright (C) 1992 Frank Tore Johansen |
7 |
|
|
* |
8 |
|
|
* This program is free software; you can redistribute it and/or modify |
9 |
|
|
* it under the terms of the GNU General Public License as published by |
10 |
|
|
* the Free Software Foundation; either version 2 of the License, or |
11 |
|
|
* (at your option) any later version. |
12 |
|
|
* |
13 |
|
|
* This program is distributed in the hope that it will be useful, |
14 |
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
|
|
* GNU General Public License for more details. |
17 |
|
|
* |
18 |
|
|
* You should have received a copy of the GNU General Public License |
19 |
|
|
* along with this program; if not, write to the Free Software |
20 |
|
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 |
|
|
* |
22 |
|
|
* The authors can be reached via e-mail at <crossfire@schmorp.de> |
23 |
|
|
*/ |
24 |
elmex |
1.1 |
|
25 |
|
|
/* |
26 |
|
|
* General convenience functions for crossfire. |
27 |
|
|
*/ |
28 |
|
|
|
29 |
root |
1.37 |
#include <cstdlib> |
30 |
|
|
#include <sys/types.h> |
31 |
|
|
#include <unistd.h> |
32 |
|
|
#include <sys/time.h> |
33 |
|
|
#include <time.h> |
34 |
|
|
#include <signal.h> |
35 |
|
|
|
36 |
elmex |
1.1 |
#include <global.h> |
37 |
|
|
#include <funcpoint.h> |
38 |
|
|
#include <material.h> |
39 |
|
|
|
40 |
root |
1.4 |
#include <glib.h> |
41 |
|
|
|
42 |
root |
1.42 |
rand_gen rndm; |
43 |
root |
1.40 |
|
44 |
root |
1.42 |
void |
45 |
|
|
tausworthe_random_generator::seed (uint32_t seed) |
46 |
root |
1.40 |
{ |
47 |
root |
1.49 |
state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
48 |
|
|
state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
49 |
|
|
state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U; |
50 |
|
|
state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U; |
51 |
root |
1.40 |
|
52 |
|
|
for (int i = 11; --i; ) |
53 |
|
|
operator ()(); |
54 |
|
|
} |
55 |
|
|
|
56 |
|
|
uint32_t |
57 |
|
|
tausworthe_random_generator::next () |
58 |
|
|
{ |
59 |
|
|
state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U); |
60 |
|
|
state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U); |
61 |
|
|
state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U); |
62 |
|
|
state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
63 |
|
|
|
64 |
|
|
return state [0] ^ state [1] ^ state [2] ^ state [3]; |
65 |
|
|
} |
66 |
|
|
|
67 |
root |
1.42 |
uint32_t |
68 |
root |
1.50 |
tausworthe_random_generator::get_range (uint32_t num) |
69 |
root |
1.42 |
{ |
70 |
root |
1.50 |
return (next () * (uint64_t)num) >> 32U; |
71 |
root |
1.42 |
} |
72 |
|
|
|
73 |
|
|
// return a number within (min .. max) |
74 |
|
|
int |
75 |
|
|
tausworthe_random_generator::get_range (int r_min, int r_max) |
76 |
|
|
{ |
77 |
root |
1.50 |
return r_min + get_range (max (r_max - r_min + 1, 0)); |
78 |
root |
1.42 |
} |
79 |
|
|
|
80 |
elmex |
1.1 |
/* |
81 |
|
|
* The random functions here take luck into account when rolling random |
82 |
|
|
* dice or numbers. This function has less of an impact the larger the |
83 |
|
|
* difference becomes in the random numbers. IE, the effect is lessened |
84 |
|
|
* on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers, |
85 |
|
|
* to specifically disable luck in certain rolls, simply by making the |
86 |
|
|
* numbers larger (ie, 1d1000 > 500 vs 1d6 > 3) |
87 |
|
|
*/ |
88 |
|
|
|
89 |
|
|
/* |
90 |
|
|
* Roll a random number between min and max. Uses op to determine luck, |
91 |
|
|
* and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
92 |
|
|
* Generally, op should be the player/caster/hitter requesting the roll, |
93 |
|
|
* not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
94 |
|
|
*/ |
95 |
root |
1.9 |
int |
96 |
root |
1.41 |
random_roll (int r_min, int r_max, const object *op, int goodbad) |
97 |
root |
1.9 |
{ |
98 |
root |
1.41 |
int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
99 |
elmex |
1.1 |
|
100 |
root |
1.55 |
if (r_max < r_min) |
101 |
root |
1.9 |
{ |
102 |
root |
1.54 |
LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
103 |
root |
1.41 |
return r_min; |
104 |
elmex |
1.1 |
} |
105 |
|
|
|
106 |
root |
1.41 |
if (op->type == PLAYER) |
107 |
root |
1.9 |
{ |
108 |
root |
1.41 |
int luck = op->stats.luck; |
109 |
elmex |
1.1 |
|
110 |
root |
1.41 |
if (rndm (base) < min (10, abs (luck))) |
111 |
|
|
{ |
112 |
|
|
//TODO: take luck into account |
113 |
|
|
} |
114 |
elmex |
1.1 |
} |
115 |
root |
1.41 |
|
116 |
|
|
return rndm (r_min, r_max); |
117 |
elmex |
1.1 |
} |
118 |
|
|
|
119 |
|
|
/* |
120 |
|
|
* This is a 64 bit version of random_roll above. This is needed |
121 |
|
|
* for exp loss calculations for players changing religions. |
122 |
|
|
*/ |
123 |
root |
1.9 |
sint64 |
124 |
|
|
random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
125 |
|
|
{ |
126 |
root |
1.55 |
sint64 omin = min; |
127 |
|
|
sint64 diff = max - min + 1; |
128 |
|
|
int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
129 |
root |
1.9 |
|
130 |
root |
1.55 |
if (diff < 0) |
131 |
root |
1.9 |
{ |
132 |
root |
1.54 |
LOG (llevError | logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
133 |
root |
1.9 |
return (min); /* avoids a float exception */ |
134 |
elmex |
1.1 |
} |
135 |
|
|
|
136 |
root |
1.45 |
/* |
137 |
|
|
* Make a call to get two 32 bit unsigned random numbers, and just to |
138 |
|
|
* a little bitshifting. |
139 |
root |
1.9 |
*/ |
140 |
root |
1.55 |
sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
141 |
root |
1.9 |
|
142 |
|
|
if (op->type != PLAYER) |
143 |
|
|
return ((ran % diff) + min); |
144 |
|
|
|
145 |
root |
1.55 |
int luck = op->stats.luck; |
146 |
|
|
|
147 |
root |
1.45 |
if (rndm (base) < MIN (10, abs (luck))) |
148 |
root |
1.9 |
{ |
149 |
|
|
/* we have a winner */ |
150 |
|
|
((luck > 0) ? (luck = 1) : (luck = -1)); |
151 |
|
|
diff -= luck; |
152 |
|
|
if (diff < 1) |
153 |
|
|
return (omin); /*check again */ |
154 |
root |
1.55 |
|
155 |
root |
1.9 |
((goodbad) ? (min += luck) : (diff)); |
156 |
elmex |
1.1 |
|
157 |
root |
1.9 |
return (MAX (omin, MIN (max, (ran % diff) + min))); |
158 |
elmex |
1.1 |
} |
159 |
root |
1.45 |
|
160 |
root |
1.55 |
return ran % diff + min; |
161 |
elmex |
1.1 |
} |
162 |
|
|
|
163 |
|
|
/* |
164 |
|
|
* Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
165 |
|
|
* If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
166 |
|
|
* Generally, op should be the player/caster/hitter requesting the roll, |
167 |
|
|
* not the recipient (ie, the poor slob getting hit). |
168 |
|
|
* The args are num D size (ie 4d6) [garbled 20010916] |
169 |
|
|
*/ |
170 |
root |
1.9 |
int |
171 |
|
|
die_roll (int num, int size, const object *op, int goodbad) |
172 |
|
|
{ |
173 |
root |
1.55 |
int min, luck, total, i, gotlucky; |
174 |
root |
1.9 |
|
175 |
root |
1.55 |
int diff = size; |
176 |
root |
1.9 |
min = 1; |
177 |
|
|
luck = total = gotlucky = 0; |
178 |
root |
1.55 |
int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
179 |
|
|
|
180 |
root |
1.9 |
if (size < 2 || diff < 1) |
181 |
|
|
{ |
182 |
|
|
LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size); |
183 |
root |
1.55 |
return num; /* avoids a float exception */ |
184 |
root |
1.9 |
} |
185 |
elmex |
1.1 |
|
186 |
root |
1.9 |
if (op->type == PLAYER) |
187 |
|
|
luck = op->stats.luck; |
188 |
|
|
|
189 |
|
|
for (i = 0; i < num; i++) |
190 |
|
|
{ |
191 |
root |
1.45 |
if (rndm (base) < MIN (10, abs (luck)) && !gotlucky) |
192 |
root |
1.9 |
{ |
193 |
|
|
/* we have a winner */ |
194 |
|
|
gotlucky++; |
195 |
|
|
((luck > 0) ? (luck = 1) : (luck = -1)); |
196 |
|
|
diff -= luck; |
197 |
|
|
if (diff < 1) |
198 |
|
|
return (num); /*check again */ |
199 |
|
|
((goodbad) ? (min += luck) : (diff)); |
200 |
root |
1.45 |
total += MAX (1, MIN (size, rndm (diff) + min)); |
201 |
root |
1.9 |
} |
202 |
|
|
else |
203 |
root |
1.45 |
total += rndm (size) + 1; |
204 |
elmex |
1.1 |
} |
205 |
root |
1.45 |
|
206 |
|
|
return total; |
207 |
elmex |
1.1 |
} |
208 |
|
|
|
209 |
root |
1.33 |
/* decay and destroy perishable items in a map */ |
210 |
root |
1.9 |
void |
211 |
root |
1.32 |
maptile::decay_objects () |
212 |
elmex |
1.1 |
{ |
213 |
root |
1.35 |
if (!spaces) |
214 |
|
|
return; |
215 |
|
|
|
216 |
|
|
for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
217 |
|
|
for (object *above, *op = ms->bot; op; op = above) |
218 |
|
|
{ |
219 |
|
|
above = op->above; |
220 |
|
|
|
221 |
|
|
bool destroy = 0; |
222 |
root |
1.32 |
|
223 |
root |
1.35 |
// do not decay anything above unique floor tiles (yet :) |
224 |
|
|
if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
225 |
|
|
break; |
226 |
root |
1.32 |
|
227 |
root |
1.35 |
if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
228 |
|
|
|| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
229 |
|
|
|| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
230 |
|
|
|| QUERY_FLAG (op, FLAG_UNIQUE) |
231 |
|
|
|| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
232 |
|
|
|| QUERY_FLAG (op, FLAG_UNPAID) |
233 |
|
|
|| op->is_alive ()) |
234 |
|
|
; // do not decay |
235 |
|
|
else if (op->is_weapon ()) |
236 |
|
|
{ |
237 |
|
|
op->stats.dam--; |
238 |
|
|
if (op->stats.dam < 0) |
239 |
|
|
destroy = 1; |
240 |
|
|
} |
241 |
|
|
else if (op->is_armor ()) |
242 |
|
|
{ |
243 |
|
|
op->stats.ac--; |
244 |
|
|
if (op->stats.ac < 0) |
245 |
|
|
destroy = 1; |
246 |
|
|
} |
247 |
|
|
else if (op->type == FOOD) |
248 |
|
|
{ |
249 |
|
|
op->stats.food -= rndm (5, 20); |
250 |
|
|
if (op->stats.food < 0) |
251 |
|
|
destroy = 1; |
252 |
|
|
} |
253 |
|
|
else |
254 |
|
|
{ |
255 |
root |
1.47 |
int mat = op->materials; |
256 |
root |
1.35 |
|
257 |
|
|
if (mat & M_PAPER |
258 |
|
|
|| mat & M_LEATHER |
259 |
|
|
|| mat & M_WOOD |
260 |
|
|
|| mat & M_ORGANIC |
261 |
|
|
|| mat & M_CLOTH |
262 |
|
|
|| mat & M_LIQUID |
263 |
|
|
|| (mat & M_IRON && rndm (1, 5) == 1) |
264 |
|
|
|| (mat & M_GLASS && rndm (1, 2) == 1) |
265 |
|
|
|| ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
266 |
|
|
|| ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
267 |
|
|
|| (mat & M_ICE && temp > 32)) |
268 |
|
|
destroy = 1; |
269 |
|
|
} |
270 |
|
|
|
271 |
|
|
/* adjust overall chance below */ |
272 |
|
|
if (destroy && rndm (0, 1)) |
273 |
|
|
op->destroy (); |
274 |
|
|
} |
275 |
elmex |
1.1 |
} |
276 |
|
|
|
277 |
|
|
/* convert materialname to materialtype_t */ |
278 |
|
|
|
279 |
root |
1.9 |
materialtype_t * |
280 |
root |
1.47 |
name_to_material (const shstr &name) |
281 |
elmex |
1.1 |
{ |
282 |
root |
1.47 |
for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
283 |
|
|
if (name == mt->name) |
284 |
|
|
return mt; |
285 |
elmex |
1.1 |
|
286 |
root |
1.47 |
return materialt; |
287 |
elmex |
1.1 |
} |
288 |
|
|
|
289 |
|
|
/* when doing transmutation of objects, we have to recheck the resistances, |
290 |
|
|
* as some that did not apply previously, may apply now. |
291 |
|
|
*/ |
292 |
|
|
|
293 |
root |
1.9 |
void |
294 |
|
|
transmute_materialname (object *op, const object *change) |
295 |
elmex |
1.1 |
{ |
296 |
root |
1.9 |
materialtype_t *mt; |
297 |
|
|
int j; |
298 |
elmex |
1.1 |
|
299 |
root |
1.9 |
if (op->materialname == NULL) |
300 |
|
|
return; |
301 |
elmex |
1.1 |
|
302 |
root |
1.9 |
if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
303 |
|
|
return; |
304 |
|
|
|
305 |
root |
1.26 |
if (!op->is_armor ()) |
306 |
root |
1.9 |
return; |
307 |
|
|
|
308 |
|
|
mt = name_to_material (op->materialname); |
309 |
|
|
if (!mt) |
310 |
|
|
{ |
311 |
|
|
LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname); |
312 |
|
|
return; |
313 |
|
|
} |
314 |
|
|
|
315 |
|
|
for (j = 0; j < NROFATTACKS; j++) |
316 |
|
|
if (op->resist[j] == 0 && change->resist[j] != 0) |
317 |
|
|
{ |
318 |
|
|
op->resist[j] += mt->mod[j]; |
319 |
|
|
if (op->resist[j] > 100) |
320 |
|
|
op->resist[j] = 100; |
321 |
|
|
if (op->resist[j] < -100) |
322 |
|
|
op->resist[j] = -100; |
323 |
|
|
} |
324 |
elmex |
1.1 |
} |
325 |
|
|
|
326 |
|
|
/* set the materialname and type for an item */ |
327 |
root |
1.9 |
void |
328 |
|
|
set_materialname (object *op, int difficulty, materialtype_t *nmt) |
329 |
elmex |
1.1 |
{ |
330 |
root |
1.9 |
materialtype_t *mt, *lmt; |
331 |
|
|
|
332 |
pippijn |
1.5 |
#ifdef NEW_MATERIAL_CODE |
333 |
root |
1.9 |
int j; |
334 |
pippijn |
1.5 |
#endif |
335 |
elmex |
1.1 |
|
336 |
root |
1.9 |
if (op->materialname != NULL) |
337 |
|
|
return; |
338 |
elmex |
1.1 |
|
339 |
|
|
|
340 |
|
|
|
341 |
root |
1.9 |
if (nmt == NULL) |
342 |
|
|
{ |
343 |
|
|
lmt = NULL; |
344 |
elmex |
1.1 |
#ifndef NEW_MATERIAL_CODE |
345 |
root |
1.47 |
for (mt = materialt; mt && mt->next; mt = mt->next) |
346 |
root |
1.9 |
{ |
347 |
root |
1.47 |
if (op->materials & mt->material) |
348 |
root |
1.9 |
{ |
349 |
|
|
lmt = mt; |
350 |
|
|
break; |
351 |
root |
1.2 |
} |
352 |
|
|
} |
353 |
elmex |
1.1 |
|
354 |
|
|
#else |
355 |
root |
1.47 |
for (mt = materialt; mt && mt->next; mt = mt->next) |
356 |
root |
1.9 |
{ |
357 |
root |
1.47 |
if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
358 |
root |
1.9 |
difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
359 |
|
|
{ |
360 |
|
|
lmt = mt; |
361 |
root |
1.26 |
if (!(op->is_weapon () || op->is_armor ())) |
362 |
root |
1.9 |
break; |
363 |
root |
1.2 |
} |
364 |
|
|
} |
365 |
elmex |
1.1 |
#endif |
366 |
root |
1.9 |
} |
367 |
|
|
else |
368 |
|
|
{ |
369 |
|
|
lmt = nmt; |
370 |
elmex |
1.1 |
} |
371 |
|
|
|
372 |
root |
1.9 |
if (lmt != NULL) |
373 |
|
|
{ |
374 |
elmex |
1.1 |
#ifndef NEW_MATERIAL_CODE |
375 |
root |
1.9 |
op->materialname = lmt->name; |
376 |
|
|
return; |
377 |
elmex |
1.1 |
#else |
378 |
|
|
|
379 |
root |
1.26 |
if (op->stats.dam && op->is_weapon ()) |
380 |
root |
1.9 |
{ |
381 |
|
|
op->stats.dam += lmt->damage; |
382 |
|
|
if (op->stats.dam < 1) |
383 |
|
|
op->stats.dam = 1; |
384 |
|
|
} |
385 |
root |
1.46 |
|
386 |
root |
1.9 |
if (op->stats.sp && op->type == BOW) |
387 |
|
|
op->stats.sp += lmt->sp; |
388 |
root |
1.26 |
if (op->stats.wc && op->is_weapon ()) |
389 |
root |
1.9 |
op->stats.wc += lmt->wc; |
390 |
root |
1.26 |
if (op->is_armor ()) |
391 |
root |
1.9 |
{ |
392 |
|
|
if (op->stats.ac) |
393 |
|
|
op->stats.ac += lmt->ac; |
394 |
|
|
for (j = 0; j < NROFATTACKS; j++) |
395 |
|
|
if (op->resist[j] != 0) |
396 |
|
|
{ |
397 |
|
|
op->resist[j] += lmt->mod[j]; |
398 |
|
|
if (op->resist[j] > 100) |
399 |
|
|
op->resist[j] = 100; |
400 |
|
|
if (op->resist[j] < -100) |
401 |
|
|
op->resist[j] = -100; |
402 |
|
|
} |
403 |
|
|
} |
404 |
root |
1.46 |
op->materialname = lmt->name; |
405 |
root |
1.9 |
/* dont make it unstackable if it doesn't need to be */ |
406 |
root |
1.26 |
if (op->is_weapon () || op->is_armor ()) |
407 |
root |
1.9 |
{ |
408 |
|
|
op->weight = (op->weight * lmt->weight) / 100; |
409 |
|
|
op->value = (op->value * lmt->value) / 100; |
410 |
root |
1.2 |
} |
411 |
elmex |
1.1 |
#endif |
412 |
|
|
} |
413 |
|
|
} |
414 |
|
|
|
415 |
|
|
/* |
416 |
|
|
* Strip out the media tags from a String. |
417 |
|
|
* Warning the input string will contain the result string |
418 |
|
|
*/ |
419 |
root |
1.9 |
void |
420 |
|
|
strip_media_tag (char *message) |
421 |
|
|
{ |
422 |
|
|
int in_tag = 0; |
423 |
|
|
char *dest; |
424 |
|
|
char *src; |
425 |
|
|
|
426 |
|
|
src = dest = message; |
427 |
|
|
while (*src != '\0') |
428 |
|
|
{ |
429 |
|
|
if (*src == '[') |
430 |
|
|
{ |
431 |
|
|
in_tag = 1; |
432 |
|
|
} |
433 |
|
|
else if (in_tag && (*src == ']')) |
434 |
|
|
in_tag = 0; |
435 |
|
|
else if (!in_tag) |
436 |
|
|
{ |
437 |
|
|
*dest = *src; |
438 |
|
|
dest++; |
439 |
|
|
} |
440 |
|
|
src++; |
441 |
|
|
} |
442 |
|
|
*dest = '\0'; |
443 |
|
|
} |
444 |
|
|
|
445 |
|
|
const char * |
446 |
|
|
strrstr (const char *haystack, const char *needle) |
447 |
|
|
{ |
448 |
|
|
const char *lastneedle; |
449 |
|
|
|
450 |
|
|
lastneedle = NULL; |
451 |
|
|
while ((haystack = strstr (haystack, needle)) != NULL) |
452 |
|
|
{ |
453 |
|
|
lastneedle = haystack; |
454 |
|
|
haystack++; |
455 |
elmex |
1.1 |
} |
456 |
root |
1.9 |
return lastneedle; |
457 |
|
|
|
458 |
elmex |
1.1 |
} |
459 |
root |
1.9 |
|
460 |
elmex |
1.1 |
#define EOL_SIZE (sizeof("\n")-1) |
461 |
root |
1.9 |
void |
462 |
|
|
strip_endline (char *buf) |
463 |
|
|
{ |
464 |
|
|
if (strlen (buf) < sizeof ("\n")) |
465 |
|
|
{ |
466 |
|
|
return; |
467 |
elmex |
1.1 |
} |
468 |
root |
1.9 |
if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n")) |
469 |
|
|
buf[strlen (buf) - EOL_SIZE] = '\0'; |
470 |
elmex |
1.1 |
} |
471 |
|
|
|
472 |
|
|
/** |
473 |
|
|
* Replace in string src all occurrences of key by replacement. The resulting |
474 |
|
|
* string is put into result; at most resultsize characters (including the |
475 |
|
|
* terminating null character) will be written to result. |
476 |
|
|
*/ |
477 |
root |
1.9 |
void |
478 |
|
|
replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize) |
479 |
elmex |
1.1 |
{ |
480 |
root |
1.9 |
size_t resultlen; |
481 |
|
|
size_t keylen; |
482 |
elmex |
1.1 |
|
483 |
root |
1.9 |
/* special case to prevent infinite loop if key==replacement=="" */ |
484 |
|
|
if (strcmp (key, replacement) == 0) |
485 |
|
|
{ |
486 |
|
|
snprintf (result, resultsize, "%s", src); |
487 |
|
|
return; |
488 |
|
|
} |
489 |
|
|
|
490 |
|
|
keylen = strlen (key); |
491 |
|
|
|
492 |
|
|
resultlen = 0; |
493 |
|
|
while (*src != '\0' && resultlen + 1 < resultsize) |
494 |
|
|
{ |
495 |
|
|
if (strncmp (src, key, keylen) == 0) |
496 |
root |
1.2 |
{ |
497 |
root |
1.9 |
snprintf (result + resultlen, resultsize - resultlen, "%s", replacement); |
498 |
|
|
resultlen += strlen (result + resultlen); |
499 |
|
|
src += keylen; |
500 |
root |
1.2 |
} |
501 |
root |
1.9 |
else |
502 |
root |
1.2 |
{ |
503 |
root |
1.9 |
result[resultlen++] = *src++; |
504 |
root |
1.2 |
} |
505 |
root |
1.9 |
} |
506 |
|
|
result[resultlen] = '\0'; |
507 |
elmex |
1.1 |
} |
508 |
|
|
|
509 |
|
|
/** |
510 |
|
|
* Taking a string as an argument, mutate it into a string that looks like a list. |
511 |
|
|
* a 'list' for the purposes here, is a string of items, seperated by commas, except |
512 |
|
|
* for the last entry, which has an 'and' before it, and a full stop (period) after it. |
513 |
|
|
* This function will also strip all trailing non alphanumeric characters. |
514 |
|
|
* It does not insert an oxford comma. |
515 |
|
|
*/ |
516 |
|
|
|
517 |
root |
1.9 |
void |
518 |
|
|
make_list_like (char *input) |
519 |
|
|
{ |
520 |
|
|
char *p, tmp[MAX_BUF]; |
521 |
|
|
int i; |
522 |
|
|
|
523 |
|
|
if (!input || strlen (input) > MAX_BUF - 5) |
524 |
elmex |
1.1 |
return; |
525 |
root |
1.9 |
/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */ |
526 |
|
|
|
527 |
|
|
strncpy (tmp, input, MAX_BUF - 5); |
528 |
|
|
/*trim all trailing commas, spaces etc. */ |
529 |
|
|
for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--) |
530 |
|
|
tmp[i] = '\0'; |
531 |
root |
1.11 |
|
532 |
root |
1.9 |
strcat (tmp, "."); |
533 |
|
|
|
534 |
|
|
p = strrchr (tmp, ','); |
535 |
|
|
if (p) |
536 |
|
|
{ |
537 |
|
|
*p = '\0'; |
538 |
|
|
strcpy (input, tmp); |
539 |
|
|
p++; |
540 |
|
|
strcat (input, " and"); |
541 |
|
|
strcat (input, p); |
542 |
|
|
} |
543 |
|
|
else |
544 |
|
|
strcpy (input, tmp); |
545 |
root |
1.11 |
|
546 |
root |
1.9 |
return; |
547 |
elmex |
1.1 |
} |
548 |
root |
1.3 |
|
549 |
root |
1.14 |
///////////////////////////////////////////////////////////////////////////// |
550 |
|
|
|
551 |
root |
1.37 |
void |
552 |
|
|
fork_abort (const char *msg) |
553 |
|
|
{ |
554 |
|
|
if (!fork ()) |
555 |
|
|
{ |
556 |
|
|
signal (SIGABRT, SIG_DFL); |
557 |
root |
1.52 |
// try to put corefiles into a subdirectory, if existing, to allow |
558 |
|
|
// an administrator to reduce the I/O load. |
559 |
|
|
chdir ("cores"); |
560 |
root |
1.37 |
abort (); |
561 |
|
|
} |
562 |
|
|
|
563 |
root |
1.38 |
LOG (llevError, "fork abort: %s\n", msg); |
564 |
root |
1.37 |
} |
565 |
root |
1.38 |
|
566 |
root |
1.25 |
void *salloc_ (int n) throw (std::bad_alloc) |
567 |
root |
1.10 |
{ |
568 |
root |
1.44 |
#ifdef PREFER_MALLOC |
569 |
|
|
void *ptr = malloc (n); |
570 |
|
|
#else |
571 |
root |
1.25 |
void *ptr = g_slice_alloc (n); |
572 |
root |
1.44 |
#endif |
573 |
root |
1.13 |
|
574 |
root |
1.23 |
if (!ptr) |
575 |
root |
1.13 |
throw std::bad_alloc (); |
576 |
root |
1.4 |
|
577 |
root |
1.23 |
return ptr; |
578 |
|
|
} |
579 |
|
|
|
580 |
root |
1.25 |
void *salloc_ (int n, void *src) throw (std::bad_alloc) |
581 |
root |
1.23 |
{ |
582 |
root |
1.25 |
void *ptr = salloc_ (n); |
583 |
root |
1.23 |
|
584 |
root |
1.24 |
if (src) |
585 |
root |
1.25 |
memcpy (ptr, src, n); |
586 |
root |
1.24 |
else |
587 |
root |
1.25 |
memset (ptr, 0, n); |
588 |
root |
1.23 |
|
589 |
|
|
return ptr; |
590 |
root |
1.3 |
} |
591 |
root |
1.11 |
|
592 |
|
|
void assign (char *dst, const char *src, int maxlen) |
593 |
|
|
{ |
594 |
|
|
if (!src) |
595 |
|
|
src = ""; |
596 |
|
|
|
597 |
|
|
int len = strlen (src); |
598 |
|
|
|
599 |
|
|
if (len >= maxlen - 1) |
600 |
|
|
{ |
601 |
|
|
if (maxlen <= 4) |
602 |
|
|
{ |
603 |
|
|
memset (dst, '.', maxlen - 1); |
604 |
|
|
dst [maxlen - 1] = 0; |
605 |
|
|
} |
606 |
|
|
else |
607 |
|
|
{ |
608 |
|
|
memcpy (dst, src, maxlen - 4); |
609 |
|
|
memcpy (dst + maxlen - 4, "...", 4); |
610 |
|
|
} |
611 |
|
|
} |
612 |
|
|
else |
613 |
|
|
memcpy (dst, src, len + 1); |
614 |
|
|
} |
615 |
|
|
|
616 |
root |
1.51 |
const std::string |
617 |
|
|
format (const char *format, ...) |
618 |
|
|
{ |
619 |
|
|
int len; |
620 |
|
|
|
621 |
|
|
{ |
622 |
|
|
char buf[128]; |
623 |
|
|
|
624 |
|
|
va_list ap; |
625 |
|
|
va_start (ap, format); |
626 |
|
|
len = vsnprintf (buf, sizeof (buf), format, ap); |
627 |
|
|
va_end (ap); |
628 |
|
|
|
629 |
|
|
assert (len >= 0); // shield againstz broken vsnprintf's |
630 |
|
|
|
631 |
|
|
// was our static buffer short enough? |
632 |
|
|
if (len < sizeof (buf)) |
633 |
|
|
return std::string (buf, len); |
634 |
|
|
} |
635 |
|
|
|
636 |
|
|
{ |
637 |
|
|
// longer, try harder |
638 |
|
|
char *buf = salloc<char> (len + 1); |
639 |
|
|
|
640 |
|
|
va_list ap; |
641 |
|
|
va_start (ap, format); |
642 |
|
|
vsnprintf (buf, len + 1, format, ap); |
643 |
|
|
va_end (ap); |
644 |
|
|
|
645 |
|
|
const std::string s (buf, len); |
646 |
|
|
sfree<char> (buf, len + 1); |
647 |
|
|
|
648 |
|
|
return buf; |
649 |
|
|
} |
650 |
|
|
} |
651 |
|
|
|
652 |
root |
1.23 |
tstamp now () |
653 |
|
|
{ |
654 |
|
|
struct timeval tv; |
655 |
|
|
|
656 |
|
|
gettimeofday (&tv, 0); |
657 |
|
|
return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); |
658 |
|
|
} |
659 |
root |
1.17 |
|
660 |
root |
1.32 |
int |
661 |
|
|
similar_direction (int a, int b) |
662 |
|
|
{ |
663 |
|
|
if (!a || !b) |
664 |
|
|
return 0; |
665 |
|
|
|
666 |
|
|
int diff = (b - a) & 7; |
667 |
|
|
return diff <= 1 || diff >= 7; |
668 |
|
|
} |
669 |
|
|
|
670 |
root |
1.48 |
/* crc32 0xdebb20e3 table and supplementary functions. */ |
671 |
|
|
extern const uint32_t crc_32_tab[256] = |
672 |
|
|
{ |
673 |
|
|
0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL, |
674 |
|
|
0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL, |
675 |
|
|
0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL, |
676 |
|
|
0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL, |
677 |
|
|
0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL, |
678 |
|
|
0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL, |
679 |
|
|
0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL, |
680 |
|
|
0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL, |
681 |
|
|
0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL, |
682 |
|
|
0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL, |
683 |
|
|
0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL, |
684 |
|
|
0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL, |
685 |
|
|
0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL, |
686 |
|
|
0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL, |
687 |
|
|
0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL, |
688 |
|
|
0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL, |
689 |
|
|
0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL, |
690 |
|
|
0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL, |
691 |
|
|
0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL, |
692 |
|
|
0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL, |
693 |
|
|
0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL, |
694 |
|
|
0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL, |
695 |
|
|
0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL, |
696 |
|
|
0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL, |
697 |
|
|
0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL, |
698 |
|
|
0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL, |
699 |
|
|
0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL, |
700 |
|
|
0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL, |
701 |
|
|
0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL, |
702 |
|
|
0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL, |
703 |
|
|
0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL, |
704 |
|
|
0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL, |
705 |
|
|
0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL, |
706 |
|
|
0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL, |
707 |
|
|
0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL, |
708 |
|
|
0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL, |
709 |
|
|
0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL, |
710 |
|
|
0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL, |
711 |
|
|
0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL, |
712 |
|
|
0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL, |
713 |
|
|
0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL, |
714 |
|
|
0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL, |
715 |
|
|
0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL, |
716 |
|
|
0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL, |
717 |
|
|
0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL, |
718 |
|
|
0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL, |
719 |
|
|
0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL, |
720 |
|
|
0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL, |
721 |
|
|
0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL, |
722 |
|
|
0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
723 |
|
|
0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
724 |
|
|
0x2d02ef8dL |
725 |
|
|
}; |
726 |
|
|
|
727 |
|
|
|