| 1 |
/* |
| 2 |
* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
| 3 |
* |
| 4 |
* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
| 5 |
* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
| 6 |
* Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 |
* |
| 8 |
* Crossfire TRT is free software; you can redistribute it and/or modify it |
| 9 |
* under the terms of the GNU General Public License as published by the Free |
| 10 |
* Software Foundation; either version 2 of the License, or (at your option) |
| 11 |
* any later version. |
| 12 |
* |
| 13 |
* This program is distributed in the hope that it will be useful, but |
| 14 |
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
| 15 |
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 16 |
* for more details. |
| 17 |
* |
| 18 |
* You should have received a copy of the GNU General Public License along |
| 19 |
* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
| 20 |
* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
| 21 |
* |
| 22 |
* The authors can be reached via e-mail to <crossfire@schmorp.de> |
| 23 |
*/ |
| 24 |
|
| 25 |
/* |
| 26 |
* General convenience functions for crossfire. |
| 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> |
| 35 |
|
| 36 |
#include <global.h> |
| 37 |
#include <funcpoint.h> |
| 38 |
#include <material.h> |
| 39 |
|
| 40 |
#include <glib.h> |
| 41 |
|
| 42 |
rand_gen rndm; |
| 43 |
|
| 44 |
void |
| 45 |
tausworthe_random_generator::seed (uint32_t seed) |
| 46 |
{ |
| 47 |
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 |
|
| 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 num) |
| 69 |
{ |
| 70 |
return (next () * (uint64_t)num) >> 32U; |
| 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 + get_range (max (r_max - r_min + 1, 0)); |
| 78 |
} |
| 79 |
|
| 80 |
/* |
| 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 |
int |
| 96 |
random_roll (int r_min, int r_max, const object *op, int goodbad) |
| 97 |
{ |
| 98 |
int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
| 99 |
|
| 100 |
if (r_max < r_min) |
| 101 |
{ |
| 102 |
LOG (llevError | logBacktrace, "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 |
sint64 |
| 124 |
random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
| 125 |
{ |
| 126 |
sint64 omin = min; |
| 127 |
sint64 diff = max - min + 1; |
| 128 |
int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
| 129 |
|
| 130 |
if (diff < 0) |
| 131 |
{ |
| 132 |
LOG (llevError | logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
| 133 |
return (min); /* avoids a float exception */ |
| 134 |
} |
| 135 |
|
| 136 |
/* |
| 137 |
* Make a call to get two 32 bit unsigned random numbers, and just to |
| 138 |
* a little bitshifting. |
| 139 |
*/ |
| 140 |
sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
| 141 |
|
| 142 |
if (op->type != PLAYER) |
| 143 |
return ((ran % diff) + min); |
| 144 |
|
| 145 |
int luck = op->stats.luck; |
| 146 |
|
| 147 |
if (rndm (base) < MIN (10, abs (luck))) |
| 148 |
{ |
| 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 |
|
| 155 |
((goodbad) ? (min += luck) : (diff)); |
| 156 |
|
| 157 |
return (MAX (omin, MIN (max, (ran % diff) + min))); |
| 158 |
} |
| 159 |
|
| 160 |
return ran % diff + min; |
| 161 |
} |
| 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 |
int |
| 171 |
die_roll (int num, int size, const object *op, int goodbad) |
| 172 |
{ |
| 173 |
int min, luck, total, i, gotlucky; |
| 174 |
|
| 175 |
int diff = size; |
| 176 |
min = 1; |
| 177 |
luck = total = gotlucky = 0; |
| 178 |
int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
| 179 |
|
| 180 |
if (size < 2 || diff < 1) |
| 181 |
{ |
| 182 |
LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size); |
| 183 |
return num; /* avoids a float exception */ |
| 184 |
} |
| 185 |
|
| 186 |
if (op->type == PLAYER) |
| 187 |
luck = op->stats.luck; |
| 188 |
|
| 189 |
for (i = 0; i < num; i++) |
| 190 |
{ |
| 191 |
if (rndm (base) < MIN (10, abs (luck)) && !gotlucky) |
| 192 |
{ |
| 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 |
total += MAX (1, MIN (size, rndm (diff) + min)); |
| 201 |
} |
| 202 |
else |
| 203 |
total += rndm (size) + 1; |
| 204 |
} |
| 205 |
|
| 206 |
return total; |
| 207 |
} |
| 208 |
|
| 209 |
/* convert materialname to materialtype_t */ |
| 210 |
|
| 211 |
materialtype_t * |
| 212 |
name_to_material (const shstr &name) |
| 213 |
{ |
| 214 |
for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
| 215 |
if (name == mt->name) |
| 216 |
return mt; |
| 217 |
|
| 218 |
return materialt; |
| 219 |
} |
| 220 |
|
| 221 |
/* when doing transmutation of objects, we have to recheck the resistances, |
| 222 |
* as some that did not apply previously, may apply now. |
| 223 |
*/ |
| 224 |
|
| 225 |
void |
| 226 |
transmute_materialname (object *op, const object *change) |
| 227 |
{ |
| 228 |
materialtype_t *mt; |
| 229 |
int j; |
| 230 |
|
| 231 |
if (op->materialname == NULL) |
| 232 |
return; |
| 233 |
|
| 234 |
if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
| 235 |
return; |
| 236 |
|
| 237 |
if (!op->is_armor ()) |
| 238 |
return; |
| 239 |
|
| 240 |
mt = name_to_material (op->materialname); |
| 241 |
if (!mt) |
| 242 |
{ |
| 243 |
LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname); |
| 244 |
return; |
| 245 |
} |
| 246 |
|
| 247 |
for (j = 0; j < NROFATTACKS; j++) |
| 248 |
if (op->resist[j] == 0 && change->resist[j] != 0) |
| 249 |
{ |
| 250 |
op->resist[j] += mt->mod[j]; |
| 251 |
if (op->resist[j] > 100) |
| 252 |
op->resist[j] = 100; |
| 253 |
if (op->resist[j] < -100) |
| 254 |
op->resist[j] = -100; |
| 255 |
} |
| 256 |
} |
| 257 |
|
| 258 |
/* set the materialname and type for an item */ |
| 259 |
void |
| 260 |
set_materialname (object *op, int difficulty, materialtype_t *nmt) |
| 261 |
{ |
| 262 |
materialtype_t *mt, *lmt; |
| 263 |
|
| 264 |
#ifdef NEW_MATERIAL_CODE |
| 265 |
int j; |
| 266 |
#endif |
| 267 |
|
| 268 |
if (op->materialname != NULL) |
| 269 |
return; |
| 270 |
|
| 271 |
|
| 272 |
|
| 273 |
if (nmt == NULL) |
| 274 |
{ |
| 275 |
lmt = NULL; |
| 276 |
#ifndef NEW_MATERIAL_CODE |
| 277 |
for (mt = materialt; mt && mt->next; mt = mt->next) |
| 278 |
{ |
| 279 |
if (op->materials & mt->material) |
| 280 |
{ |
| 281 |
lmt = mt; |
| 282 |
break; |
| 283 |
} |
| 284 |
} |
| 285 |
|
| 286 |
#else |
| 287 |
for (mt = materialt; mt && mt->next; mt = mt->next) |
| 288 |
{ |
| 289 |
if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
| 290 |
difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
| 291 |
{ |
| 292 |
lmt = mt; |
| 293 |
if (!(op->is_weapon () || op->is_armor ())) |
| 294 |
break; |
| 295 |
} |
| 296 |
} |
| 297 |
#endif |
| 298 |
} |
| 299 |
else |
| 300 |
{ |
| 301 |
lmt = nmt; |
| 302 |
} |
| 303 |
|
| 304 |
if (lmt != NULL) |
| 305 |
{ |
| 306 |
#ifndef NEW_MATERIAL_CODE |
| 307 |
op->materialname = lmt->name; |
| 308 |
return; |
| 309 |
#else |
| 310 |
|
| 311 |
if (op->stats.dam && op->is_weapon ()) |
| 312 |
{ |
| 313 |
op->stats.dam += lmt->damage; |
| 314 |
if (op->stats.dam < 1) |
| 315 |
op->stats.dam = 1; |
| 316 |
} |
| 317 |
|
| 318 |
if (op->stats.sp && op->type == BOW) |
| 319 |
op->stats.sp += lmt->sp; |
| 320 |
if (op->stats.wc && op->is_weapon ()) |
| 321 |
op->stats.wc += lmt->wc; |
| 322 |
if (op->is_armor ()) |
| 323 |
{ |
| 324 |
if (op->stats.ac) |
| 325 |
op->stats.ac += lmt->ac; |
| 326 |
for (j = 0; j < NROFATTACKS; j++) |
| 327 |
if (op->resist[j] != 0) |
| 328 |
{ |
| 329 |
op->resist[j] += lmt->mod[j]; |
| 330 |
if (op->resist[j] > 100) |
| 331 |
op->resist[j] = 100; |
| 332 |
if (op->resist[j] < -100) |
| 333 |
op->resist[j] = -100; |
| 334 |
} |
| 335 |
} |
| 336 |
op->materialname = lmt->name; |
| 337 |
/* dont make it unstackable if it doesn't need to be */ |
| 338 |
if (op->is_weapon () || op->is_armor ()) |
| 339 |
{ |
| 340 |
op->weight = (op->weight * lmt->weight) / 100; |
| 341 |
op->value = (op->value * lmt->value) / 100; |
| 342 |
} |
| 343 |
#endif |
| 344 |
} |
| 345 |
} |
| 346 |
|
| 347 |
/* |
| 348 |
* Strip out the media tags from a String. |
| 349 |
* Warning the input string will contain the result string |
| 350 |
*/ |
| 351 |
void |
| 352 |
strip_media_tag (char *message) |
| 353 |
{ |
| 354 |
int in_tag = 0; |
| 355 |
char *dest; |
| 356 |
char *src; |
| 357 |
|
| 358 |
src = dest = message; |
| 359 |
while (*src != '\0') |
| 360 |
{ |
| 361 |
if (*src == '[') |
| 362 |
{ |
| 363 |
in_tag = 1; |
| 364 |
} |
| 365 |
else if (in_tag && (*src == ']')) |
| 366 |
in_tag = 0; |
| 367 |
else if (!in_tag) |
| 368 |
{ |
| 369 |
*dest = *src; |
| 370 |
dest++; |
| 371 |
} |
| 372 |
src++; |
| 373 |
} |
| 374 |
*dest = '\0'; |
| 375 |
} |
| 376 |
|
| 377 |
const char * |
| 378 |
strrstr (const char *haystack, const char *needle) |
| 379 |
{ |
| 380 |
const char *lastneedle; |
| 381 |
|
| 382 |
lastneedle = NULL; |
| 383 |
while ((haystack = strstr (haystack, needle)) != NULL) |
| 384 |
{ |
| 385 |
lastneedle = haystack; |
| 386 |
haystack++; |
| 387 |
} |
| 388 |
return lastneedle; |
| 389 |
|
| 390 |
} |
| 391 |
|
| 392 |
#define EOL_SIZE (sizeof("\n")-1) |
| 393 |
void |
| 394 |
strip_endline (char *buf) |
| 395 |
{ |
| 396 |
if (strlen (buf) < sizeof ("\n")) |
| 397 |
{ |
| 398 |
return; |
| 399 |
} |
| 400 |
if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n")) |
| 401 |
buf[strlen (buf) - EOL_SIZE] = '\0'; |
| 402 |
} |
| 403 |
|
| 404 |
/** |
| 405 |
* Replace in string src all occurrences of key by replacement. The resulting |
| 406 |
* string is put into result; at most resultsize characters (including the |
| 407 |
* terminating null character) will be written to result. |
| 408 |
*/ |
| 409 |
void |
| 410 |
replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize) |
| 411 |
{ |
| 412 |
size_t resultlen; |
| 413 |
size_t keylen; |
| 414 |
|
| 415 |
/* special case to prevent infinite loop if key==replacement=="" */ |
| 416 |
if (strcmp (key, replacement) == 0) |
| 417 |
{ |
| 418 |
snprintf (result, resultsize, "%s", src); |
| 419 |
return; |
| 420 |
} |
| 421 |
|
| 422 |
keylen = strlen (key); |
| 423 |
|
| 424 |
resultlen = 0; |
| 425 |
while (*src != '\0' && resultlen + 1 < resultsize) |
| 426 |
{ |
| 427 |
if (strncmp (src, key, keylen) == 0) |
| 428 |
{ |
| 429 |
snprintf (result + resultlen, resultsize - resultlen, "%s", replacement); |
| 430 |
resultlen += strlen (result + resultlen); |
| 431 |
src += keylen; |
| 432 |
} |
| 433 |
else |
| 434 |
{ |
| 435 |
result[resultlen++] = *src++; |
| 436 |
} |
| 437 |
} |
| 438 |
result[resultlen] = '\0'; |
| 439 |
} |
| 440 |
|
| 441 |
/** |
| 442 |
* Taking a string as an argument, mutate it into a string that looks like a list. |
| 443 |
* a 'list' for the purposes here, is a string of items, seperated by commas, except |
| 444 |
* for the last entry, which has an 'and' before it, and a full stop (period) after it. |
| 445 |
* This function will also strip all trailing non alphanumeric characters. |
| 446 |
* It does not insert an oxford comma. |
| 447 |
*/ |
| 448 |
|
| 449 |
void |
| 450 |
make_list_like (char *input) |
| 451 |
{ |
| 452 |
char *p, tmp[MAX_BUF]; |
| 453 |
int i; |
| 454 |
|
| 455 |
if (!input || strlen (input) > MAX_BUF - 5) |
| 456 |
return; |
| 457 |
/* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */ |
| 458 |
|
| 459 |
strncpy (tmp, input, MAX_BUF - 5); |
| 460 |
/*trim all trailing commas, spaces etc. */ |
| 461 |
for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--) |
| 462 |
tmp[i] = '\0'; |
| 463 |
|
| 464 |
strcat (tmp, "."); |
| 465 |
|
| 466 |
p = strrchr (tmp, ','); |
| 467 |
if (p) |
| 468 |
{ |
| 469 |
*p = '\0'; |
| 470 |
strcpy (input, tmp); |
| 471 |
p++; |
| 472 |
strcat (input, " and"); |
| 473 |
strcat (input, p); |
| 474 |
} |
| 475 |
else |
| 476 |
strcpy (input, tmp); |
| 477 |
|
| 478 |
return; |
| 479 |
} |
| 480 |
|
| 481 |
///////////////////////////////////////////////////////////////////////////// |
| 482 |
|
| 483 |
void |
| 484 |
fork_abort (const char *msg) |
| 485 |
{ |
| 486 |
if (!fork ()) |
| 487 |
{ |
| 488 |
signal (SIGABRT, SIG_DFL); |
| 489 |
// try to put corefiles into a subdirectory, if existing, to allow |
| 490 |
// an administrator to reduce the I/O load. |
| 491 |
chdir ("cores"); |
| 492 |
abort (); |
| 493 |
} |
| 494 |
|
| 495 |
LOG (llevError, "fork abort: %s\n", msg); |
| 496 |
} |
| 497 |
|
| 498 |
void *salloc_ (int n) throw (std::bad_alloc) |
| 499 |
{ |
| 500 |
#ifdef PREFER_MALLOC |
| 501 |
void *ptr = malloc (n); |
| 502 |
#else |
| 503 |
void *ptr = g_slice_alloc (n); |
| 504 |
#endif |
| 505 |
|
| 506 |
if (!ptr) |
| 507 |
throw std::bad_alloc (); |
| 508 |
|
| 509 |
return ptr; |
| 510 |
} |
| 511 |
|
| 512 |
void *salloc_ (int n, void *src) throw (std::bad_alloc) |
| 513 |
{ |
| 514 |
void *ptr = salloc_ (n); |
| 515 |
|
| 516 |
if (src) |
| 517 |
memcpy (ptr, src, n); |
| 518 |
else |
| 519 |
memset (ptr, 0, n); |
| 520 |
|
| 521 |
return ptr; |
| 522 |
} |
| 523 |
|
| 524 |
void assign (char *dst, const char *src, int maxlen) |
| 525 |
{ |
| 526 |
if (!src) |
| 527 |
src = ""; |
| 528 |
|
| 529 |
int len = strlen (src); |
| 530 |
|
| 531 |
if (len >= maxlen - 1) |
| 532 |
{ |
| 533 |
if (maxlen <= 4) |
| 534 |
{ |
| 535 |
memset (dst, '.', maxlen - 1); |
| 536 |
dst [maxlen - 1] = 0; |
| 537 |
} |
| 538 |
else |
| 539 |
{ |
| 540 |
memcpy (dst, src, maxlen - 4); |
| 541 |
memcpy (dst + maxlen - 4, "...", 4); |
| 542 |
} |
| 543 |
} |
| 544 |
else |
| 545 |
memcpy (dst, src, len + 1); |
| 546 |
} |
| 547 |
|
| 548 |
const std::string |
| 549 |
format (const char *format, ...) |
| 550 |
{ |
| 551 |
int len; |
| 552 |
|
| 553 |
{ |
| 554 |
char buf[128]; |
| 555 |
|
| 556 |
va_list ap; |
| 557 |
va_start (ap, format); |
| 558 |
len = vsnprintf (buf, sizeof (buf), format, ap); |
| 559 |
va_end (ap); |
| 560 |
|
| 561 |
assert (len >= 0); // shield againstz broken vsnprintf's |
| 562 |
|
| 563 |
// was our static buffer short enough? |
| 564 |
if (len < sizeof (buf)) |
| 565 |
return std::string (buf, len); |
| 566 |
} |
| 567 |
|
| 568 |
{ |
| 569 |
// longer, try harder |
| 570 |
char *buf = salloc<char> (len + 1); |
| 571 |
|
| 572 |
va_list ap; |
| 573 |
va_start (ap, format); |
| 574 |
vsnprintf (buf, len + 1, format, ap); |
| 575 |
va_end (ap); |
| 576 |
|
| 577 |
const std::string s (buf, len); |
| 578 |
sfree<char> (buf, len + 1); |
| 579 |
|
| 580 |
return buf; |
| 581 |
} |
| 582 |
} |
| 583 |
|
| 584 |
tstamp now () |
| 585 |
{ |
| 586 |
struct timeval tv; |
| 587 |
|
| 588 |
gettimeofday (&tv, 0); |
| 589 |
return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); |
| 590 |
} |
| 591 |
|
| 592 |
int |
| 593 |
similar_direction (int a, int b) |
| 594 |
{ |
| 595 |
if (!a || !b) |
| 596 |
return 0; |
| 597 |
|
| 598 |
int diff = (b - a) & 7; |
| 599 |
return diff <= 1 || diff >= 7; |
| 600 |
} |
| 601 |
|
| 602 |
/* crc32 0xdebb20e3 table and supplementary functions. */ |
| 603 |
extern const uint32_t crc_32_tab[256] = |
| 604 |
{ |
| 605 |
0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL, |
| 606 |
0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL, |
| 607 |
0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL, |
| 608 |
0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL, |
| 609 |
0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL, |
| 610 |
0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL, |
| 611 |
0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL, |
| 612 |
0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL, |
| 613 |
0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL, |
| 614 |
0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL, |
| 615 |
0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL, |
| 616 |
0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL, |
| 617 |
0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL, |
| 618 |
0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL, |
| 619 |
0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL, |
| 620 |
0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL, |
| 621 |
0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL, |
| 622 |
0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL, |
| 623 |
0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL, |
| 624 |
0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL, |
| 625 |
0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL, |
| 626 |
0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL, |
| 627 |
0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL, |
| 628 |
0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL, |
| 629 |
0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL, |
| 630 |
0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL, |
| 631 |
0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL, |
| 632 |
0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL, |
| 633 |
0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL, |
| 634 |
0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL, |
| 635 |
0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL, |
| 636 |
0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL, |
| 637 |
0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL, |
| 638 |
0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL, |
| 639 |
0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL, |
| 640 |
0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL, |
| 641 |
0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL, |
| 642 |
0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL, |
| 643 |
0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL, |
| 644 |
0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL, |
| 645 |
0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL, |
| 646 |
0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL, |
| 647 |
0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL, |
| 648 |
0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL, |
| 649 |
0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL, |
| 650 |
0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL, |
| 651 |
0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL, |
| 652 |
0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL, |
| 653 |
0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL, |
| 654 |
0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
| 655 |
0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
| 656 |
0x2d02ef8dL |
| 657 |
}; |
| 658 |
|
| 659 |
|
