| 1 | /* |
1 | /* |
| 2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
| 3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
| 4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
| 5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
| 6 | |
7 | * |
| 7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
| 8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
| 9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
| 10 | (at your option) any later version. |
11 | * (at your option) any later version. |
| 11 | |
12 | * |
| 12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
| 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
| 16 | |
17 | * |
| 17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
| 18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
| 19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 20 | |
21 | * |
| 21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
| 22 | */ |
23 | */ |
| 23 | |
24 | |
| 24 | /* |
25 | /* |
| 25 | * General convenience functions for crossfire. |
26 | * General convenience functions for crossfire. |
| 26 | */ |
27 | */ |
|
|
28 | |
|
|
29 | #include <cstdlib> |
|
|
30 | #include <sys/types.h> |
|
|
31 | #include <unistd.h> |
|
|
32 | #include <sys/time.h> |
|
|
33 | #include <time.h> |
|
|
34 | #include <signal.h> |
| 27 | |
35 | |
| 28 | #include <global.h> |
36 | #include <global.h> |
| 29 | #include <funcpoint.h> |
37 | #include <funcpoint.h> |
| 30 | #include <material.h> |
38 | #include <material.h> |
| 31 | |
39 | |
| 32 | #include <glib.h> |
40 | #include <glib.h> |
|
|
41 | |
|
|
42 | rand_gen rndm; |
|
|
43 | |
|
|
44 | void |
|
|
45 | tausworthe_random_generator::seed (uint32_t seed) |
|
|
46 | { |
|
|
47 | state [0] = max ( 2, seed * 69069U); |
|
|
48 | state [1] = max ( 8, state [0] * 69069U); |
|
|
49 | state [2] = max ( 16, state [1] * 69069U); |
|
|
50 | state [3] = max (128, state [2] * 69069U); |
|
|
51 | |
|
|
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 | uint32_t |
|
|
68 | tausworthe_random_generator::get_range (uint32_t r_max) |
|
|
69 | { |
|
|
70 | return next () % r_max; |
|
|
71 | } |
|
|
72 | |
|
|
73 | // return a number within (min .. max) |
|
|
74 | int |
|
|
75 | tausworthe_random_generator::get_range (int r_min, int r_max) |
|
|
76 | { |
|
|
77 | return r_min + (*this) (max (r_max - r_min + 1, 1)); |
|
|
78 | } |
| 33 | |
79 | |
| 34 | /* |
80 | /* |
| 35 | * The random functions here take luck into account when rolling random |
81 | * The random functions here take luck into account when rolling random |
| 36 | * dice or numbers. This function has less of an impact the larger the |
82 | * dice or numbers. This function has less of an impact the larger the |
| 37 | * difference becomes in the random numbers. IE, the effect is lessened |
83 | * difference becomes in the random numbers. IE, the effect is lessened |
| … | |
… | |
| 44 | * Roll a random number between min and max. Uses op to determine luck, |
90 | * Roll a random number between min and max. Uses op to determine luck, |
| 45 | * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
91 | * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
| 46 | * Generally, op should be the player/caster/hitter requesting the roll, |
92 | * Generally, op should be the player/caster/hitter requesting the roll, |
| 47 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
93 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
| 48 | */ |
94 | */ |
| 49 | |
|
|
| 50 | int |
95 | int |
| 51 | random_roll (int min, int max, const object *op, int goodbad) |
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
| 52 | { |
97 | { |
|
|
98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
|
|
99 | |
|
|
100 | if (r_max < 1 || r_max < r_min) |
|
|
101 | { |
|
|
102 | LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
|
|
103 | return r_min; |
|
|
104 | } |
|
|
105 | |
|
|
106 | if (op->type == PLAYER) |
|
|
107 | { |
|
|
108 | int luck = op->stats.luck; |
|
|
109 | |
|
|
110 | if (rndm (base) < min (10, abs (luck))) |
|
|
111 | { |
|
|
112 | //TODO: take luck into account |
|
|
113 | } |
|
|
114 | } |
|
|
115 | |
|
|
116 | return rndm (r_min, r_max); |
|
|
117 | } |
|
|
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 | |
|
|
124 | sint64 |
|
|
125 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
|
|
126 | { |
| 53 | int omin, diff, luck, base, ran; |
127 | sint64 omin, diff, luck, ran; |
|
|
128 | int base; |
| 54 | |
129 | |
| 55 | omin = min; |
130 | omin = min; |
| 56 | diff = max - min + 1; |
131 | diff = max - min + 1; |
| 57 | ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ |
132 | ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ |
| 58 | |
133 | |
| 59 | if (max < 1 || diff < 1) |
134 | if (max < 1 || diff < 1) |
| 60 | { |
135 | { |
| 61 | LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max); |
|
|
| 62 | return (min); /* avoids a float exception */ |
|
|
| 63 | } |
|
|
| 64 | |
|
|
| 65 | ran = RANDOM (); |
|
|
| 66 | |
|
|
| 67 | if (op->type != PLAYER) |
|
|
| 68 | return ((ran % diff) + min); |
|
|
| 69 | |
|
|
| 70 | luck = op->stats.luck; |
|
|
| 71 | if (RANDOM () % base < MIN (10, abs (luck))) |
|
|
| 72 | { |
|
|
| 73 | /* we have a winner */ |
|
|
| 74 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
|
|
| 75 | diff -= luck; |
|
|
| 76 | if (diff < 1) |
|
|
| 77 | return (omin); /*check again */ |
|
|
| 78 | ((goodbad) ? (min += luck) : (diff)); |
|
|
| 79 | |
|
|
| 80 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
|
|
| 81 | } |
|
|
| 82 | return ((ran % diff) + min); |
|
|
| 83 | } |
|
|
| 84 | |
|
|
| 85 | /* |
|
|
| 86 | * This is a 64 bit version of random_roll above. This is needed |
|
|
| 87 | * for exp loss calculations for players changing religions. |
|
|
| 88 | */ |
|
|
| 89 | |
|
|
| 90 | sint64 |
|
|
| 91 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
|
|
| 92 | { |
|
|
| 93 | sint64 omin, diff, luck, ran; |
|
|
| 94 | int base; |
|
|
| 95 | |
|
|
| 96 | omin = min; |
|
|
| 97 | diff = max - min + 1; |
|
|
| 98 | ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ |
|
|
| 99 | |
|
|
| 100 | if (max < 1 || diff < 1) |
|
|
| 101 | { |
|
|
| 102 | LOG (llevError, "Calling random_roll with min=%" I64_PFd " max=%" I64_PFd "\n", min, max); |
136 | LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
| 103 | return (min); /* avoids a float exception */ |
137 | return (min); /* avoids a float exception */ |
| 104 | } |
138 | } |
| 105 | |
139 | |
| 106 | /* Don't know of a portable call to get 64 bit random values. |
140 | /* Don't know of a portable call to get 64 bit random values. |
| 107 | * So make a call to get two 32 bit random numbers, and just to |
141 | * So make a call to get two 32 bit random numbers, and just to |
| … | |
… | |
| 174 | } |
208 | } |
| 175 | } |
209 | } |
| 176 | return (total); |
210 | return (total); |
| 177 | } |
211 | } |
| 178 | |
212 | |
| 179 | /* |
|
|
| 180 | * Another convenience function. Returns a number between min and max. |
|
|
| 181 | * It is suggested one use these functions rather than RANDOM()%, as it |
|
|
| 182 | * would appear that a number of off-by-one-errors exist due to improper |
|
|
| 183 | * use of %. This should also prevent SIGFPE. |
|
|
| 184 | */ |
|
|
| 185 | |
|
|
| 186 | int |
|
|
| 187 | rndm (int min, int max) |
|
|
| 188 | { |
|
|
| 189 | int diff; |
|
|
| 190 | |
|
|
| 191 | diff = max - min + 1; |
|
|
| 192 | if (max < 1 || diff < 1) |
|
|
| 193 | return (min); |
|
|
| 194 | |
|
|
| 195 | return (RANDOM () % diff + min); |
|
|
| 196 | } |
|
|
| 197 | |
|
|
| 198 | /* decay and destroy persihable items in a map */ |
213 | /* decay and destroy perishable items in a map */ |
| 199 | |
|
|
| 200 | void |
214 | void |
| 201 | decay_objects (maptile *m) |
215 | maptile::decay_objects () |
| 202 | { |
216 | { |
| 203 | int x, y, destroy; |
217 | if (!spaces) |
| 204 | object *op, *otmp; |
|
|
| 205 | |
|
|
| 206 | if (m->unique) |
|
|
| 207 | return; |
218 | return; |
| 208 | |
219 | |
| 209 | for (x = 0; x < MAP_WIDTH (m); x++) |
220 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 210 | for (y = 0; y < MAP_HEIGHT (m); y++) |
221 | for (object *above, *op = ms->bot; op; op = above) |
| 211 | for (op = get_map_ob (m, x, y); op; op = otmp) |
|
|
| 212 | { |
222 | { |
|
|
223 | above = op->above; |
|
|
224 | |
| 213 | destroy = 0; |
225 | bool destroy = 0; |
| 214 | otmp = op->above; |
226 | |
|
|
227 | // do not decay anything above unique floor tiles (yet :) |
| 215 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
228 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
| 216 | break; |
229 | break; |
|
|
230 | |
| 217 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) || |
231 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
| 218 | QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) || |
232 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
| 219 | QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) || |
233 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
| 220 | QUERY_FLAG (op, FLAG_UNIQUE) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) || QUERY_FLAG (op, FLAG_UNPAID) || IS_LIVE (op)) |
234 | || QUERY_FLAG (op, FLAG_UNIQUE) |
| 221 | continue; |
235 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
| 222 | /* otherwise, we decay and destroy */ |
236 | || QUERY_FLAG (op, FLAG_UNPAID) |
| 223 | if (IS_WEAPON (op)) |
237 | || op->is_alive ()) |
|
|
238 | ; // do not decay |
|
|
239 | else if (op->is_weapon ()) |
| 224 | { |
240 | { |
| 225 | op->stats.dam--; |
241 | op->stats.dam--; |
| 226 | if (op->stats.dam < 0) |
242 | if (op->stats.dam < 0) |
| 227 | destroy = 1; |
243 | destroy = 1; |
| 228 | } |
244 | } |
| 229 | else if (IS_ARMOR (op)) |
245 | else if (op->is_armor ()) |
| 230 | { |
246 | { |
| 231 | op->stats.ac--; |
247 | op->stats.ac--; |
| 232 | if (op->stats.ac < 0) |
248 | if (op->stats.ac < 0) |
| 233 | destroy = 1; |
249 | destroy = 1; |
| 234 | } |
250 | } |
| 235 | else if (op->type == FOOD) |
251 | else if (op->type == FOOD) |
| 236 | { |
252 | { |
| 237 | op->stats.food -= rndm (5, 20); |
253 | op->stats.food -= rndm (5, 20); |
| 238 | if (op->stats.food < 0) |
254 | if (op->stats.food < 0) |
| 239 | destroy = 1; |
255 | destroy = 1; |
| 240 | } |
256 | } |
| 241 | else |
257 | else |
| 242 | { |
258 | { |
| 243 | if (op->material & M_PAPER || op->material & M_LEATHER || |
259 | int mat = op->material; |
| 244 | op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID) |
260 | |
|
|
261 | if (mat & M_PAPER |
|
|
262 | || mat & M_LEATHER |
|
|
263 | || mat & M_WOOD |
|
|
264 | || mat & M_ORGANIC |
|
|
265 | || mat & M_CLOTH |
|
|
266 | || mat & M_LIQUID |
|
|
267 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
268 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
269 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
270 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
271 | || (mat & M_ICE && temp > 32)) |
| 245 | destroy = 1; |
272 | destroy = 1; |
| 246 | if (op->material & M_IRON && rndm (1, 5) == 1) |
|
|
| 247 | destroy = 1; |
|
|
| 248 | if (op->material & M_GLASS && rndm (1, 2) == 1) |
|
|
| 249 | destroy = 1; |
|
|
| 250 | if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
| 251 | destroy = 1; |
|
|
| 252 | if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1) |
|
|
| 253 | destroy = 1; |
|
|
| 254 | if (op->material & M_ICE && MAP_TEMP (m) > 32) |
|
|
| 255 | destroy = 1; |
|
|
| 256 | } |
273 | } |
|
|
274 | |
| 257 | /* adjust overall chance below */ |
275 | /* adjust overall chance below */ |
| 258 | if (destroy && rndm (0, 1)) |
276 | if (destroy && rndm (0, 1)) |
| 259 | { |
277 | op->destroy (); |
| 260 | remove_ob (op); |
|
|
| 261 | free_object (op); |
|
|
| 262 | } |
|
|
| 263 | } |
278 | } |
| 264 | } |
279 | } |
| 265 | |
280 | |
| 266 | /* convert materialname to materialtype_t */ |
281 | /* convert materialname to materialtype_t */ |
| 267 | |
282 | |
| 268 | materialtype_t * |
283 | materialtype_t * |
| … | |
… | |
| 296 | return; |
311 | return; |
| 297 | |
312 | |
| 298 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
313 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
| 299 | return; |
314 | return; |
| 300 | |
315 | |
| 301 | if (!IS_ARMOR (op)) |
316 | if (!op->is_armor ()) |
| 302 | return; |
317 | return; |
| 303 | |
318 | |
| 304 | mt = name_to_material (op->materialname); |
319 | mt = name_to_material (op->materialname); |
| 305 | if (!mt) |
320 | if (!mt) |
| 306 | { |
321 | { |
| … | |
… | |
| 352 | { |
367 | { |
| 353 | if (op->material & mt->material && rndm (1, 100) <= mt->chance && |
368 | if (op->material & mt->material && rndm (1, 100) <= mt->chance && |
| 354 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
369 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
| 355 | { |
370 | { |
| 356 | lmt = mt; |
371 | lmt = mt; |
| 357 | if (!(IS_WEAPON (op) || IS_ARMOR (op))) |
372 | if (!(op->is_weapon () || op->is_armor ())) |
| 358 | break; |
373 | break; |
| 359 | } |
374 | } |
| 360 | } |
375 | } |
| 361 | #endif |
376 | #endif |
| 362 | } |
377 | } |
| … | |
… | |
| 370 | #ifndef NEW_MATERIAL_CODE |
385 | #ifndef NEW_MATERIAL_CODE |
| 371 | op->materialname = lmt->name; |
386 | op->materialname = lmt->name; |
| 372 | return; |
387 | return; |
| 373 | #else |
388 | #else |
| 374 | |
389 | |
| 375 | if (op->stats.dam && IS_WEAPON (op)) |
390 | if (op->stats.dam && op->is_weapon ()) |
| 376 | { |
391 | { |
| 377 | op->stats.dam += lmt->damage; |
392 | op->stats.dam += lmt->damage; |
| 378 | if (op->stats.dam < 1) |
393 | if (op->stats.dam < 1) |
| 379 | op->stats.dam = 1; |
394 | op->stats.dam = 1; |
| 380 | } |
395 | } |
| 381 | if (op->stats.sp && op->type == BOW) |
396 | if (op->stats.sp && op->type == BOW) |
| 382 | op->stats.sp += lmt->sp; |
397 | op->stats.sp += lmt->sp; |
| 383 | if (op->stats.wc && IS_WEAPON (op)) |
398 | if (op->stats.wc && op->is_weapon ()) |
| 384 | op->stats.wc += lmt->wc; |
399 | op->stats.wc += lmt->wc; |
| 385 | if (IS_ARMOR (op)) |
400 | if (op->is_armor ()) |
| 386 | { |
401 | { |
| 387 | if (op->stats.ac) |
402 | if (op->stats.ac) |
| 388 | op->stats.ac += lmt->ac; |
403 | op->stats.ac += lmt->ac; |
| 389 | for (j = 0; j < NROFATTACKS; j++) |
404 | for (j = 0; j < NROFATTACKS; j++) |
| 390 | if (op->resist[j] != 0) |
405 | if (op->resist[j] != 0) |
| … | |
… | |
| 396 | op->resist[j] = -100; |
411 | op->resist[j] = -100; |
| 397 | } |
412 | } |
| 398 | } |
413 | } |
| 399 | op->materialname = add_string (lmt->name); |
414 | op->materialname = add_string (lmt->name); |
| 400 | /* dont make it unstackable if it doesn't need to be */ |
415 | /* dont make it unstackable if it doesn't need to be */ |
| 401 | if (IS_WEAPON (op) || IS_ARMOR (op)) |
416 | if (op->is_weapon () || op->is_armor ()) |
| 402 | { |
417 | { |
| 403 | op->weight = (op->weight * lmt->weight) / 100; |
418 | op->weight = (op->weight * lmt->weight) / 100; |
| 404 | op->value = (op->value * lmt->value) / 100; |
419 | op->value = (op->value * lmt->value) / 100; |
| 405 | } |
420 | } |
| 406 | #endif |
421 | #endif |
| … | |
… | |
| 541 | return; |
556 | return; |
| 542 | } |
557 | } |
| 543 | |
558 | |
| 544 | ///////////////////////////////////////////////////////////////////////////// |
559 | ///////////////////////////////////////////////////////////////////////////// |
| 545 | |
560 | |
| 546 | #if 0 |
561 | void |
| 547 | refcounted *refcounted::rc_first; |
562 | fork_abort (const char *msg) |
| 548 | |
|
|
| 549 | refcounted::refcounted () |
|
|
| 550 | { |
563 | { |
| 551 | refcnt = 0; |
564 | if (!fork ()) |
| 552 | rc_next = rc_first; |
565 | { |
| 553 | rc_first = this; |
566 | signal (SIGABRT, SIG_DFL); |
| 554 | } |
567 | abort (); |
|
|
568 | } |
| 555 | |
569 | |
| 556 | refcounted::~refcounted () |
570 | LOG (llevError, "fork abort: %s\n", msg); |
| 557 | { |
|
|
| 558 | assert (!rc_next); |
|
|
| 559 | assert (!refcnt); |
|
|
| 560 | } |
571 | } |
| 561 | #endif |
|
|
| 562 | |
572 | |
| 563 | void *alloc (int s) throw (std::bad_alloc) |
573 | void *salloc_ (int n) throw (std::bad_alloc) |
| 564 | { |
574 | { |
| 565 | void *p = g_slice_alloc (s); |
575 | void *ptr = g_slice_alloc (n); |
| 566 | |
576 | |
| 567 | if (!p) |
577 | if (!ptr) |
| 568 | throw std::bad_alloc (); |
578 | throw std::bad_alloc (); |
| 569 | |
579 | |
| 570 | return p; |
580 | return ptr; |
|
|
581 | } |
|
|
582 | |
|
|
583 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
|
|
584 | { |
|
|
585 | void *ptr = salloc_ (n); |
|
|
586 | |
|
|
587 | if (src) |
|
|
588 | memcpy (ptr, src, n); |
|
|
589 | else |
|
|
590 | memset (ptr, 0, n); |
|
|
591 | |
|
|
592 | return ptr; |
| 571 | } |
593 | } |
| 572 | |
594 | |
| 573 | void assign (char *dst, const char *src, int maxlen) |
595 | void assign (char *dst, const char *src, int maxlen) |
| 574 | { |
596 | { |
| 575 | if (!src) |
597 | if (!src) |
| … | |
… | |
| 592 | } |
614 | } |
| 593 | else |
615 | else |
| 594 | memcpy (dst, src, len + 1); |
616 | memcpy (dst, src, len + 1); |
| 595 | } |
617 | } |
| 596 | |
618 | |
|
|
619 | tstamp now () |
|
|
620 | { |
|
|
621 | struct timeval tv; |
| 597 | |
622 | |
|
|
623 | gettimeofday (&tv, 0); |
|
|
624 | return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); |
|
|
625 | } |
|
|
626 | |
|
|
627 | int |
|
|
628 | similar_direction (int a, int b) |
|
|
629 | { |
|
|
630 | if (!a || !b) |
|
|
631 | return 0; |
|
|
632 | |
|
|
633 | int diff = (b - a) & 7; |
|
|
634 | return diff <= 1 || diff >= 7; |
|
|
635 | } |
|
|
636 | |
