ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/util.h
(Generate patch)

Comparing deliantra/server/include/util.h (file contents):
Revision 1.95 by root, Tue Nov 10 00:01:31 2009 UTC vs.
Revision 1.99 by root, Fri Apr 9 02:45:16 2010 UTC

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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * 5 *
6 * Deliantra is free software: you can redistribute it and/or modify it under 6 * Deliantra is free software: you can redistribute it and/or modify it under
7 * the terms of the Affero GNU General Public License as published by the 7 * the terms of the Affero GNU General Public License as published by the
8 * Free Software Foundation, either version 3 of the License, or (at your 8 * Free Software Foundation, either version 3 of the License, or (at your
9 * option) any later version. 9 * option) any later version.
… …
99 99
100// sign0 returns -1, 0 or +1 100// sign0 returns -1, 0 or +1
101template<typename T> 101template<typename T>
102static inline T sign0 (T v) { return v ? sign (v) : 0; } 102static inline T sign0 (T v) { return v ? sign (v) : 0; }
103 103
104template<typename T, typename U>
105static inline T copysign (T a, U b) { return a > 0 ? b : -b; }
106
104// div* only work correctly for div > 0 107// div* only work correctly for div > 0
105// div, with correct rounding (< 0.5 downwards, >=0.5 upwards) 108// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
106template<typename T> static inline T div (T val, T div) 109template<typename T> static inline T div (T val, T div)
107{ 110{
108 return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; 111 return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div;
… …
240absdir (int d) 243absdir (int d)
241{ 244{
242 return ((d - 1) & 7) + 1; 245 return ((d - 1) & 7) + 1;
243} 246}
244 247
248// avoid ctz name because netbsd or freebsd spams it's namespace with it
249#if GCC_VERSION(3,4)
250static inline int least_significant_bit (uint32_t x)
251{
252 return __builtin_ctz (x);
253}
254#else
255int least_significant_bit (uint32_t x);
256#endif
257
258#define for_all_bits_sparse_32(mask, idxvar) \
259 for (uint32_t idxvar, mask_ = mask; \
260 mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);)
261
245extern ssize_t slice_alloc; // statistics 262extern ssize_t slice_alloc; // statistics
246 263
247void *salloc_ (int n) throw (std::bad_alloc); 264void *salloc_ (int n) throw (std::bad_alloc);
248void *salloc_ (int n, void *src) throw (std::bad_alloc); 265void *salloc_ (int n, void *src) throw (std::bad_alloc);
249 266
… …
559 // FNV-1a is faster on many cpus because the multiplication 576 // FNV-1a is faster on many cpus because the multiplication
560 // runs concurrently with the looping logic. 577 // runs concurrently with the looping logic.
561 uint32_t hash = STRHSH_NULL; 578 uint32_t hash = STRHSH_NULL;
562 579
563 while (*s) 580 while (*s)
564 hash = (hash ^ *s++) * 16777619; 581 hash = (hash ^ *s++) * 16777619U;
565 582
566 return hash; 583 return hash;
567} 584}
568 585
569static inline uint32_t 586static inline uint32_t
570memhsh (const char *s, size_t len) 587memhsh (const char *s, size_t len)
571{ 588{
572 uint32_t hash = STRHSH_NULL; 589 uint32_t hash = STRHSH_NULL;
573 590
574 while (len--) 591 while (len--)
575 hash = (hash ^ *s++) * 16777619; 592 hash = (hash ^ *s++) * 16777619U;
576 593
577 return hash; 594 return hash;
578} 595}
579 596
580struct str_hash 597struct str_hash

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines