1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
|
|
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / 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 |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
6 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
7 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
8 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
9 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
10 | * option) any later version. |
12 | * |
11 | * |
13 | * This program is distributed in the hope that it will be useful, |
12 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
15 | * GNU General Public License for more details. |
17 | * |
16 | * |
18 | * You should have received a copy of the GNU General Public License |
17 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
18 | * and the GNU General Public License along with this program. If not, see |
|
|
19 | * <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /* |
24 | /* |
25 | * General convenience functions for crossfire. |
25 | * General convenience functions for deliantra. |
26 | */ |
26 | */ |
27 | |
27 | |
28 | #include <cstdlib> |
28 | #include <cstdlib> |
29 | #include <sys/types.h> |
29 | #include <sys/types.h> |
30 | #include <unistd.h> |
30 | #include <unistd.h> |
… | |
… | |
32 | #include <time.h> |
32 | #include <time.h> |
33 | #include <signal.h> |
33 | #include <signal.h> |
34 | |
34 | |
35 | #include <global.h> |
35 | #include <global.h> |
36 | #include <material.h> |
36 | #include <material.h> |
|
|
37 | #include <object.h> |
37 | |
38 | |
38 | #include <sys/time.h> |
39 | #include <sys/time.h> |
39 | #include <sys/resource.h> |
40 | #include <sys/resource.h> |
40 | |
41 | |
41 | #include <glib.h> |
42 | #include <glib.h> |
42 | |
43 | |
43 | refcnt_base::refcnt_t refcnt_dummy; |
44 | refcnt_base::refcnt_t refcnt_dummy; |
44 | ssize_t slice_alloc; |
45 | ssize_t slice_alloc; |
45 | rand_gen rndm, rmg_rndm; |
|
|
46 | |
46 | |
47 | void |
47 | /******************************************************************************/ |
48 | tausworthe_random_generator::seed (uint32_t seed) |
|
|
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 | |
48 | |
55 | for (int i = 11; --i; ) |
49 | /* Checks a player-provided string which will become the msg property of |
56 | operator ()(); |
50 | * an object for dangerous input. |
57 | } |
|
|
58 | |
|
|
59 | uint32_t |
|
|
60 | tausworthe_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 | |
|
|
70 | uint32_t |
|
|
71 | tausworthe_random_generator::get_range (uint32_t num) |
|
|
72 | { |
|
|
73 | return (next () * (uint64_t)num) >> 32U; |
|
|
74 | } |
|
|
75 | |
|
|
76 | // return a number within (min .. max) |
|
|
77 | int |
|
|
78 | tausworthe_random_generator::get_range (int r_min, int r_max) |
|
|
79 | { |
|
|
80 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
|
|
81 | } |
|
|
82 | |
|
|
83 | /* |
|
|
84 | * The random functions here take luck into account when rolling random |
|
|
85 | * dice or numbers. This function has less of an impact the larger the |
|
|
86 | * difference becomes in the random numbers. IE, the effect is lessened |
|
|
87 | * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers, |
|
|
88 | * to specifically disable luck in certain rolls, simply by making the |
|
|
89 | * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3) |
|
|
90 | */ |
51 | */ |
91 | |
52 | bool |
92 | /* |
53 | msg_is_safe (const char *msg) |
93 | * Roll a random number between min and max. Uses op to determine luck, |
|
|
94 | * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
|
|
95 | * Generally, op should be the player/caster/hitter requesting the roll, |
|
|
96 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
|
|
97 | */ |
|
|
98 | int |
|
|
99 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
|
|
100 | { |
54 | { |
101 | r_max = max (r_min, r_max); |
55 | bool safe = true; |
102 | |
56 | |
103 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
57 | /* Trying to cheat by getting data into the object */ |
|
|
58 | if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1) |
|
|
59 | || strstr (msg, "\nendmsg")) |
|
|
60 | safe = false; |
104 | |
61 | |
105 | if (op->type == PLAYER) |
62 | /* Trying to make the object talk, and potentially access arbitrary code */ |
106 | { |
63 | if (object::msg_has_dialogue (msg)) |
107 | int luck = op->stats.luck; |
64 | safe = false; |
108 | |
65 | |
109 | if (rndm (base) < min (10, abs (luck))) |
|
|
110 | { |
|
|
111 | //TODO: take luck into account |
|
|
112 | } |
|
|
113 | } |
|
|
114 | |
|
|
115 | return rndm (r_min, r_max); |
|
|
116 | } |
|
|
117 | |
|
|
118 | /* |
|
|
119 | * This is a 64 bit version of random_roll above. This is needed |
|
|
120 | * for exp loss calculations for players changing religions. |
|
|
121 | */ |
|
|
122 | sint64 |
|
|
123 | random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad) |
|
|
124 | { |
|
|
125 | sint64 omin = r_min; |
|
|
126 | sint64 range = max (0, r_max - r_min + 1); |
|
|
127 | int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
|
|
128 | |
|
|
129 | /* |
|
|
130 | * Make a call to get two 32 bit unsigned random numbers, and just to |
|
|
131 | * a little bitshifting. |
|
|
132 | */ |
|
|
133 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
|
|
134 | |
|
|
135 | if (op->type != PLAYER) |
|
|
136 | return ((ran % range) + r_min); |
|
|
137 | |
|
|
138 | int luck = op->stats.luck; |
|
|
139 | |
|
|
140 | if (rndm (base) < min (10, abs (luck))) |
|
|
141 | { |
|
|
142 | /* we have a winner */ |
|
|
143 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
|
|
144 | range -= luck; |
|
|
145 | if (range < 1) |
|
|
146 | return (omin); /*check again */ |
|
|
147 | |
|
|
148 | ((goodbad) ? (r_min += luck) : (range)); |
|
|
149 | |
|
|
150 | return (max (omin, min (r_max, (ran % range) + r_min))); |
|
|
151 | } |
|
|
152 | |
|
|
153 | return ran % range + r_min; |
|
|
154 | } |
|
|
155 | |
|
|
156 | /* |
|
|
157 | * Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
|
|
158 | * If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
|
|
159 | * Generally, op should be the player/caster/hitter requesting the roll, |
|
|
160 | * not the recipient (ie, the poor slob getting hit). |
|
|
161 | * The args are num D size (ie 4d6) [garbled 20010916] |
|
|
162 | */ |
|
|
163 | int |
|
|
164 | die_roll (int num, int size, const object *op, int goodbad) |
|
|
165 | { |
|
|
166 | int min, luck, total, i, gotlucky; |
|
|
167 | |
|
|
168 | int diff = size; |
|
|
169 | min = 1; |
|
|
170 | luck = total = gotlucky = 0; |
|
|
171 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
|
|
172 | |
|
|
173 | if (size < 2 || diff < 1) |
|
|
174 | { |
|
|
175 | LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size); |
|
|
176 | return num; /* avoids a float exception */ |
|
|
177 | } |
|
|
178 | |
|
|
179 | if (op->type == PLAYER) |
|
|
180 | luck = op->stats.luck; |
|
|
181 | |
|
|
182 | for (i = 0; i < num; i++) |
|
|
183 | { |
|
|
184 | if (rndm (base) < MIN (10, abs (luck)) && !gotlucky) |
|
|
185 | { |
|
|
186 | /* we have a winner */ |
|
|
187 | gotlucky++; |
|
|
188 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
|
|
189 | diff -= luck; |
|
|
190 | if (diff < 1) |
|
|
191 | return (num); /*check again */ |
|
|
192 | ((goodbad) ? (min += luck) : (diff)); |
|
|
193 | total += MAX (1, MIN (size, rndm (diff) + min)); |
|
|
194 | } |
|
|
195 | else |
|
|
196 | total += rndm (size) + 1; |
|
|
197 | } |
|
|
198 | |
|
|
199 | return total; |
|
|
200 | } |
|
|
201 | |
|
|
202 | /* convert materialname to materialtype_t */ |
|
|
203 | |
|
|
204 | materialtype_t * |
|
|
205 | name_to_material (const shstr &name) |
|
|
206 | { |
|
|
207 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
|
|
208 | if (name == mt->name) |
|
|
209 | return mt; |
|
|
210 | |
|
|
211 | return 0; |
66 | return safe; |
212 | } |
|
|
213 | |
|
|
214 | /* when doing transmutation of objects, we have to recheck the resistances, |
|
|
215 | * as some that did not apply previously, may apply now. |
|
|
216 | */ |
|
|
217 | void |
|
|
218 | transmute_materialname (object *op, const object *change) |
|
|
219 | { |
|
|
220 | materialtype_t *mt; |
|
|
221 | int j; |
|
|
222 | |
|
|
223 | if (op->materialname == NULL) |
|
|
224 | return; |
|
|
225 | |
|
|
226 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
|
|
227 | return; |
|
|
228 | |
|
|
229 | if (!op->is_armor ()) |
|
|
230 | return; |
|
|
231 | |
|
|
232 | mt = name_to_material (op->materialname); |
|
|
233 | if (!mt) |
|
|
234 | { |
|
|
235 | LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname); |
|
|
236 | return; |
|
|
237 | } |
|
|
238 | |
|
|
239 | for (j = 0; j < NROFATTACKS; j++) |
|
|
240 | if (op->resist[j] == 0 && change->resist[j] != 0) |
|
|
241 | { |
|
|
242 | op->resist[j] += mt->mod[j]; |
|
|
243 | if (op->resist[j] > 100) |
|
|
244 | op->resist[j] = 100; |
|
|
245 | if (op->resist[j] < -100) |
|
|
246 | op->resist[j] = -100; |
|
|
247 | } |
|
|
248 | } |
|
|
249 | |
|
|
250 | /* set the materialname and type for an item */ |
|
|
251 | void |
|
|
252 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
|
|
253 | { |
|
|
254 | materialtype_t *mt, *lmt; |
|
|
255 | |
|
|
256 | if (op->materialname != NULL) |
|
|
257 | return; |
|
|
258 | |
|
|
259 | if (nmt == NULL) |
|
|
260 | { |
|
|
261 | lmt = NULL; |
|
|
262 | |
|
|
263 | for (mt = materialt; mt && mt->next; mt = mt->next) |
|
|
264 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
|
|
265 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
|
|
266 | { |
|
|
267 | lmt = mt; |
|
|
268 | if (!(op->is_weapon () || op->is_armor ())) |
|
|
269 | break; |
|
|
270 | } |
|
|
271 | } |
|
|
272 | else |
|
|
273 | lmt = nmt; |
|
|
274 | |
|
|
275 | if (lmt != NULL) |
|
|
276 | { |
|
|
277 | if (op->stats.dam && op->is_weapon ()) |
|
|
278 | { |
|
|
279 | op->stats.dam += lmt->damage; |
|
|
280 | if (op->stats.dam < 1) |
|
|
281 | op->stats.dam = 1; |
|
|
282 | } |
|
|
283 | |
|
|
284 | if (op->stats.sp && op->type == BOW) |
|
|
285 | op->stats.sp += lmt->sp; |
|
|
286 | if (op->stats.wc && op->is_weapon ()) |
|
|
287 | op->stats.wc += lmt->wc; |
|
|
288 | if (op->is_armor ()) |
|
|
289 | { |
|
|
290 | if (op->stats.ac) |
|
|
291 | op->stats.ac += lmt->ac; |
|
|
292 | |
|
|
293 | for (int j = 0; j < NROFATTACKS; j++) |
|
|
294 | if (op->resist[j] != 0) |
|
|
295 | { |
|
|
296 | op->resist[j] += lmt->mod[j]; |
|
|
297 | if (op->resist[j] > 100) |
|
|
298 | op->resist[j] = 100; |
|
|
299 | if (op->resist[j] < -100) |
|
|
300 | op->resist[j] = -100; |
|
|
301 | } |
|
|
302 | } |
|
|
303 | |
|
|
304 | op->materialname = lmt->name; |
|
|
305 | /* dont make it unstackable if it doesn't need to be */ |
|
|
306 | if (op->is_weapon () || op->is_armor ()) |
|
|
307 | { |
|
|
308 | op->weight = (op->weight * lmt->weight) / 100; |
|
|
309 | op->value = (op->value * lmt->value) / 100; |
|
|
310 | } |
|
|
311 | } |
|
|
312 | } |
|
|
313 | |
|
|
314 | /* |
|
|
315 | * Strip out the media tags from a String. |
|
|
316 | * Warning the input string will contain the result string |
|
|
317 | */ |
|
|
318 | void |
|
|
319 | strip_media_tag (char *message) |
|
|
320 | { |
|
|
321 | int in_tag = 0; |
|
|
322 | char *dest; |
|
|
323 | char *src; |
|
|
324 | |
|
|
325 | src = dest = message; |
|
|
326 | while (*src != '\0') |
|
|
327 | { |
|
|
328 | if (*src == '[') |
|
|
329 | { |
|
|
330 | in_tag = 1; |
|
|
331 | } |
|
|
332 | else if (in_tag && (*src == ']')) |
|
|
333 | in_tag = 0; |
|
|
334 | else if (!in_tag) |
|
|
335 | { |
|
|
336 | *dest = *src; |
|
|
337 | dest++; |
|
|
338 | } |
|
|
339 | src++; |
|
|
340 | } |
|
|
341 | *dest = '\0'; |
|
|
342 | } |
|
|
343 | |
|
|
344 | const char * |
|
|
345 | strrstr (const char *haystack, const char *needle) |
|
|
346 | { |
|
|
347 | const char *lastneedle; |
|
|
348 | |
|
|
349 | lastneedle = NULL; |
|
|
350 | while ((haystack = strstr (haystack, needle)) != NULL) |
|
|
351 | { |
|
|
352 | lastneedle = haystack; |
|
|
353 | haystack++; |
|
|
354 | } |
|
|
355 | return lastneedle; |
|
|
356 | |
|
|
357 | } |
|
|
358 | |
|
|
359 | #define EOL_SIZE (sizeof("\n")-1) |
|
|
360 | void |
|
|
361 | strip_endline (char *buf) |
|
|
362 | { |
|
|
363 | if (strlen (buf) < sizeof ("\n")) |
|
|
364 | { |
|
|
365 | return; |
|
|
366 | } |
|
|
367 | if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n")) |
|
|
368 | buf[strlen (buf) - EOL_SIZE] = '\0'; |
|
|
369 | } |
|
|
370 | |
|
|
371 | /** |
|
|
372 | * Replace in string src all occurrences of key by replacement. The resulting |
|
|
373 | * string is put into result; at most resultsize characters (including the |
|
|
374 | * terminating null character) will be written to result. |
|
|
375 | */ |
|
|
376 | void |
|
|
377 | replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize) |
|
|
378 | { |
|
|
379 | size_t resultlen; |
|
|
380 | size_t keylen; |
|
|
381 | |
|
|
382 | /* special case to prevent infinite loop if key==replacement=="" */ |
|
|
383 | if (strcmp (key, replacement) == 0) |
|
|
384 | { |
|
|
385 | snprintf (result, resultsize, "%s", src); |
|
|
386 | return; |
|
|
387 | } |
|
|
388 | |
|
|
389 | keylen = strlen (key); |
|
|
390 | |
|
|
391 | resultlen = 0; |
|
|
392 | while (*src != '\0' && resultlen + 1 < resultsize) |
|
|
393 | { |
|
|
394 | if (strncmp (src, key, keylen) == 0) |
|
|
395 | { |
|
|
396 | snprintf (result + resultlen, resultsize - resultlen, "%s", replacement); |
|
|
397 | resultlen += strlen (result + resultlen); |
|
|
398 | src += keylen; |
|
|
399 | } |
|
|
400 | else |
|
|
401 | { |
|
|
402 | result[resultlen++] = *src++; |
|
|
403 | } |
|
|
404 | } |
|
|
405 | result[resultlen] = '\0'; |
|
|
406 | } |
|
|
407 | |
|
|
408 | /** |
|
|
409 | * Taking a string as an argument, mutate it into a string that looks like a list. |
|
|
410 | * a 'list' for the purposes here, is a string of items, seperated by commas, except |
|
|
411 | * for the last entry, which has an 'and' before it, and a full stop (period) after it. |
|
|
412 | * This function will also strip all trailing non alphanumeric characters. |
|
|
413 | * It does not insert an oxford comma. |
|
|
414 | */ |
|
|
415 | void |
|
|
416 | make_list_like (char *input) |
|
|
417 | { |
|
|
418 | char *p, tmp[MAX_BUF]; |
|
|
419 | int i; |
|
|
420 | |
|
|
421 | if (!input || strlen (input) > MAX_BUF - 5) |
|
|
422 | return; |
|
|
423 | /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */ |
|
|
424 | |
|
|
425 | strncpy (tmp, input, MAX_BUF - 5); |
|
|
426 | /*trim all trailing commas, spaces etc. */ |
|
|
427 | for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--) |
|
|
428 | tmp[i] = '\0'; |
|
|
429 | |
|
|
430 | strcat (tmp, "."); |
|
|
431 | |
|
|
432 | p = strrchr (tmp, ','); |
|
|
433 | if (p) |
|
|
434 | { |
|
|
435 | *p = '\0'; |
|
|
436 | strcpy (input, tmp); |
|
|
437 | p++; |
|
|
438 | strcat (input, " and"); |
|
|
439 | strcat (input, p); |
|
|
440 | } |
|
|
441 | else |
|
|
442 | strcpy (input, tmp); |
|
|
443 | |
|
|
444 | return; |
|
|
445 | } |
67 | } |
446 | |
68 | |
447 | ///////////////////////////////////////////////////////////////////////////// |
69 | ///////////////////////////////////////////////////////////////////////////// |
448 | |
70 | |
449 | void |
71 | void |
450 | fork_abort (const char *msg) |
72 | fork_abort (const char *msg) |
451 | { |
73 | { |
452 | if (!fork ()) |
74 | if (!fork ()) |
453 | { |
75 | { |
454 | fprintf (stderr, "background fork_abort in progress, remove me when debugged.\n");//D |
|
|
455 | |
|
|
456 | signal (SIGINT , SIG_IGN); |
76 | signal (SIGINT , SIG_IGN); |
457 | signal (SIGTERM, SIG_IGN); |
77 | signal (SIGTERM, SIG_IGN); |
458 | signal (SIGABRT, SIG_IGN); |
78 | signal (SIGABRT, SIG_IGN); |
459 | |
79 | |
460 | signal (SIGSEGV, SIG_DFL); |
80 | signal (SIGSEGV, SIG_DFL); |
|
|
81 | signal (SIGFPE , SIG_DFL); |
|
|
82 | #ifdef SIGBUS |
461 | signal (SIGBUS , SIG_DFL); |
83 | signal (SIGBUS , SIG_DFL); |
|
|
84 | #endif |
462 | signal (SIGILL , SIG_DFL); |
85 | signal (SIGILL , SIG_DFL); |
463 | signal (SIGTRAP, SIG_DFL); |
86 | signal (SIGTRAP, SIG_DFL); |
464 | |
87 | |
465 | // try to put corefiles into a subdirectory, if existing, to allow |
88 | // try to put corefiles into a subdirectory, if existing, to allow |
466 | // an administrator to reduce the I/O load. |
89 | // an administrator to reduce the I/O load. |
… | |
… | |
490 | } |
113 | } |
491 | |
114 | |
492 | LOG (llevError, "fork abort: %s\n", msg); |
115 | LOG (llevError, "fork abort: %s\n", msg); |
493 | } |
116 | } |
494 | |
117 | |
495 | void *salloc_ (int n) throw (std::bad_alloc) |
118 | void * |
|
|
119 | salloc_ (int n) |
496 | { |
120 | { |
497 | void *ptr = g_slice_alloc (n); |
121 | void *ptr = g_slice_alloc (n); |
498 | |
122 | |
499 | if (!ptr) |
123 | if (!ptr) |
500 | throw std::bad_alloc (); |
124 | throw std::bad_alloc (); |
501 | |
125 | |
502 | slice_alloc += n; |
126 | slice_alloc += n; |
503 | return ptr; |
127 | return ptr; |
504 | } |
128 | } |
505 | |
129 | |
506 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
130 | void * |
|
|
131 | salloc_ (int n, void *src) |
507 | { |
132 | { |
508 | void *ptr = salloc_ (n); |
133 | void *ptr = salloc_ (n); |
509 | |
134 | |
510 | if (src) |
135 | if (src) |
511 | memcpy (ptr, src, n); |
136 | memcpy (ptr, src, n); |
… | |
… | |
519 | |
144 | |
520 | #if DEBUG_SALLOC |
145 | #if DEBUG_SALLOC |
521 | |
146 | |
522 | #define MAGIC 0xa1b2c35543deadLL |
147 | #define MAGIC 0xa1b2c35543deadLL |
523 | |
148 | |
|
|
149 | void * |
524 | void *g_slice_alloc (unsigned long size) |
150 | g_slice_alloc (unsigned long size) |
525 | { |
151 | { |
526 | unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); |
152 | unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); |
527 | *p++ = size ^ MAGIC; |
153 | *p++ = size ^ MAGIC; |
528 | //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D |
154 | //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D |
529 | return (void *)p; |
155 | return (void *)p; |
530 | } |
156 | } |
531 | |
157 | |
|
|
158 | void * |
532 | void *g_slice_alloc0 (unsigned long size) |
159 | g_slice_alloc0 (unsigned long size) |
533 | { |
160 | { |
534 | return memset (g_slice_alloc (size), 0, size); |
161 | return memset (g_slice_alloc (size), 0, size); |
535 | } |
162 | } |
536 | |
163 | |
|
|
164 | void |
537 | void g_slice_free1 (unsigned long size, void *ptr) |
165 | g_slice_free1 (unsigned long size, void *ptr) |
538 | { |
166 | { |
539 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
167 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
540 | if (expect_true (ptr)) |
168 | if (expect_true (ptr)) |
541 | { |
169 | { |
542 | unsigned long *p = (unsigned long *)ptr; |
170 | unsigned long *p = (unsigned long *)ptr; |
… | |
… | |
556 | |
184 | |
557 | #endif |
185 | #endif |
558 | |
186 | |
559 | /******************************************************************************/ |
187 | /******************************************************************************/ |
560 | |
188 | |
|
|
189 | refcnt_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 | |
|
|
197 | refcnt_buf::refcnt_buf (void *data, size_t size) |
|
|
198 | { |
|
|
199 | _alloc (size); |
|
|
200 | memcpy (this->data, data, size); |
|
|
201 | } |
|
|
202 | |
|
|
203 | refcnt_buf::~refcnt_buf () |
|
|
204 | { |
|
|
205 | dec (); |
|
|
206 | } |
|
|
207 | |
|
|
208 | void |
|
|
209 | refcnt_buf::_dealloc () |
|
|
210 | { |
|
|
211 | sfree<char> (data - overhead, size () + overhead); |
|
|
212 | } |
|
|
213 | |
|
|
214 | refcnt_buf & |
|
|
215 | refcnt_buf::operator =(const refcnt_buf &src) |
|
|
216 | { |
|
|
217 | dec (); |
|
|
218 | data = src.data; |
|
|
219 | inc (); |
|
|
220 | return *this; |
|
|
221 | } |
|
|
222 | |
|
|
223 | /******************************************************************************/ |
|
|
224 | |
|
|
225 | int |
561 | void assign (char *dst, const char *src, int maxlen) |
226 | assign (char *dst, const char *src, int maxsize) |
562 | { |
227 | { |
563 | if (!src) |
228 | if (!src) |
564 | src = ""; |
229 | src = ""; |
565 | |
230 | |
566 | int len = strlen (src); |
231 | int len = strlen (src); |
567 | |
232 | |
568 | if (len >= maxlen - 1) |
233 | if (len >= maxsize) |
569 | { |
234 | { |
570 | if (maxlen <= 4) |
235 | if (maxsize <= 4) |
571 | { |
236 | { |
572 | memset (dst, '.', maxlen - 1); |
237 | memset (dst, '.', maxsize - 2); |
573 | dst [maxlen - 1] = 0; |
238 | dst [maxsize - 1] = 0; |
574 | } |
239 | } |
575 | else |
240 | else |
576 | { |
241 | { |
577 | memcpy (dst, src, maxlen - 4); |
242 | memcpy (dst, src, maxsize - 4); |
578 | memcpy (dst + maxlen - 4, "...", 4); |
243 | memcpy (dst + maxsize - 4, "...", 4); |
579 | } |
244 | } |
|
|
245 | |
|
|
246 | len = maxsize; |
580 | } |
247 | } |
581 | else |
248 | else |
582 | memcpy (dst, src, len + 1); |
249 | memcpy (dst, src, ++len); |
583 | } |
|
|
584 | |
250 | |
585 | const char * |
251 | return len; |
|
|
252 | } |
|
|
253 | |
|
|
254 | char * |
|
|
255 | vformat (const char *format, va_list ap) |
|
|
256 | { |
|
|
257 | static dynbuf_text bufs[8]; |
|
|
258 | static int bufidx; |
|
|
259 | |
|
|
260 | dynbuf_text &buf = bufs [++bufidx & 7]; |
|
|
261 | |
|
|
262 | buf.clear (); |
|
|
263 | buf.vprintf (format, ap); |
|
|
264 | return buf; |
|
|
265 | } |
|
|
266 | |
|
|
267 | char * |
586 | format (const char *format, ...) |
268 | format (const char *format, ...) |
587 | { |
269 | { |
588 | static dynbuf_text buf; |
|
|
589 | |
|
|
590 | buf.clear (); |
|
|
591 | |
|
|
592 | va_list ap; |
270 | va_list ap; |
593 | va_start (ap, format); |
271 | va_start (ap, format); |
594 | buf.vprintf (format, ap); |
272 | char *buf = vformat (format, ap); |
595 | va_end (ap); |
273 | va_end (ap); |
596 | |
274 | |
597 | return buf; |
275 | return buf; |
598 | } |
276 | } |
599 | |
277 | |
600 | tstamp now () |
278 | tstamp |
|
|
279 | now () |
601 | { |
280 | { |
602 | struct timeval tv; |
281 | struct timeval tv; |
603 | |
282 | |
604 | gettimeofday (&tv, 0); |
283 | gettimeofday (&tv, 0); |
605 | return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); |
284 | return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); |
… | |
… | |
670 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
349 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
671 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
350 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
672 | 0x2d02ef8dL |
351 | 0x2d02ef8dL |
673 | }; |
352 | }; |
674 | |
353 | |
|
|
354 | void |
675 | void thread::start (void *(*start_routine)(void *), void *arg) |
355 | thread::start (void *(*start_routine)(void *), void *arg) |
676 | { |
356 | { |
677 | pthread_attr_t attr; |
357 | pthread_attr_t attr; |
678 | |
358 | |
679 | pthread_attr_init (&attr); |
359 | pthread_attr_init (&attr); |
680 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
360 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |