ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/utils.C
(Generate patch)

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.96 by root, Mon Apr 5 20:33:13 2010 UTC vs.
Revision 1.103 by root, Mon Dec 17 02:07:15 2012 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,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 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.
10 * 10 *
11 * This program is distributed in the hope that it will be useful, 11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details. 14 * GNU General Public License for more details.
15 * 15 *
16 * You should have received a copy of the Affero GNU General Public License 16 * You should have received a copy of the Affero GNU General Public License
17 * and the GNU General Public License along with this program. If not, see 17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>. 18 * <http://www.gnu.org/licenses/>.
19 * 19 *
20 * The authors can be reached via e-mail to <support@deliantra.net> 20 * The authors can be reached via e-mail to <support@deliantra.net>
21 */ 21 */
22 22
23/* 23/*
24 * General convenience functions for deliantra. 24 * General convenience functions for deliantra.
40 40
41#include <glib.h> 41#include <glib.h>
42 42
43refcnt_base::refcnt_t refcnt_dummy; 43refcnt_base::refcnt_t refcnt_dummy;
44ssize_t slice_alloc; 44ssize_t slice_alloc;
45rand_gen rndm, rmg_rndm;
46 45
47#if !GCC_VERSION(3,4) 46#if !GCC_VERSION(3,4)
48int least_significant_bit (uint32_t x) 47int least_significant_bit (uint32_t x)
49{ 48{
50 x &= -x; // this isolates the lowest bit 49 x &= -x; // this isolates the lowest bit
59 58
60 return r; 59 return r;
61} 60}
62#endif 61#endif
63 62
64void
65tausworthe_random_generator::seed (uint32_t seed)
66{
67 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
68 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
69 state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
70 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
71
72 for (int i = 11; --i; )
73 next ();
74}
75
76uint32_t
77tausworthe_random_generator::next ()
78{
79 state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U);
80 state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U);
81 state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
82 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
83
84 return state [0] ^ state [1] ^ state [2] ^ state [3];
85}
86
87template<class generator>
88uint32_t
89random_number_generator<generator>::get_range (uint32_t num)
90{
91 return (this->next () * (uint64_t)num) >> 32U;
92}
93
94// return a number within (min .. max)
95template<class generator>
96int
97random_number_generator<generator>::get_range (int r_min, int r_max)
98{
99 return r_min + get_range (max (r_max - r_min + 1, 0));
100}
101
102template struct random_number_generator<tausworthe_random_generator>;
103template struct random_number_generator<xorshift_random_generator>;
104
105/******************************************************************************/ 63/******************************************************************************/
106 64
107/* Checks a player-provided string which will become the msg property of 65/* Checks a player-provided string which will become the msg property of
108 * an object for dangerous input. 66 * an object for dangerous input.
109 */ 67 */
134 signal (SIGINT , SIG_IGN); 92 signal (SIGINT , SIG_IGN);
135 signal (SIGTERM, SIG_IGN); 93 signal (SIGTERM, SIG_IGN);
136 signal (SIGABRT, SIG_IGN); 94 signal (SIGABRT, SIG_IGN);
137 95
138 signal (SIGSEGV, SIG_DFL); 96 signal (SIGSEGV, SIG_DFL);
97 signal (SIGFPE , SIG_DFL);
98#ifdef SIGBUS
139 signal (SIGBUS , SIG_DFL); 99 signal (SIGBUS , SIG_DFL);
100#endif
140 signal (SIGILL , SIG_DFL); 101 signal (SIGILL , SIG_DFL);
141 signal (SIGTRAP, SIG_DFL); 102 signal (SIGTRAP, SIG_DFL);
142 103
143 // try to put corefiles into a subdirectory, if existing, to allow 104 // try to put corefiles into a subdirectory, if existing, to allow
144 // an administrator to reduce the I/O load. 105 // an administrator to reduce the I/O load.
168 } 129 }
169 130
170 LOG (llevError, "fork abort: %s\n", msg); 131 LOG (llevError, "fork abort: %s\n", msg);
171} 132}
172 133
134void *
173void *salloc_ (int n) throw (std::bad_alloc) 135salloc_ (int n) throw (std::bad_alloc)
174{ 136{
175 void *ptr = g_slice_alloc (n); 137 void *ptr = g_slice_alloc (n);
176 138
177 if (!ptr) 139 if (!ptr)
178 throw std::bad_alloc (); 140 throw std::bad_alloc ();
179 141
180 slice_alloc += n; 142 slice_alloc += n;
181 return ptr; 143 return ptr;
182} 144}
183 145
146void *
184void *salloc_ (int n, void *src) throw (std::bad_alloc) 147salloc_ (int n, void *src) throw (std::bad_alloc)
185{ 148{
186 void *ptr = salloc_ (n); 149 void *ptr = salloc_ (n);
187 150
188 if (src) 151 if (src)
189 memcpy (ptr, src, n); 152 memcpy (ptr, src, n);
197 160
198#if DEBUG_SALLOC 161#if DEBUG_SALLOC
199 162
200#define MAGIC 0xa1b2c35543deadLL 163#define MAGIC 0xa1b2c35543deadLL
201 164
165void *
202void *g_slice_alloc (unsigned long size) 166g_slice_alloc (unsigned long size)
203{ 167{
204 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); 168 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
205 *p++ = size ^ MAGIC; 169 *p++ = size ^ MAGIC;
206 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D 170 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
207 return (void *)p; 171 return (void *)p;
208} 172}
209 173
174void *
210void *g_slice_alloc0 (unsigned long size) 175g_slice_alloc0 (unsigned long size)
211{ 176{
212 return memset (g_slice_alloc (size), 0, size); 177 return memset (g_slice_alloc (size), 0, size);
213} 178}
214 179
180void
215void g_slice_free1 (unsigned long size, void *ptr) 181g_slice_free1 (unsigned long size, void *ptr)
216{ 182{
217 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D 183 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
218 if (expect_true (ptr)) 184 if (expect_true (ptr))
219 { 185 {
220 unsigned long *p = (unsigned long *)ptr; 186 unsigned long *p = (unsigned long *)ptr;
231 (g_slice_free1)(s + sizeof (unsigned long), p); 197 (g_slice_free1)(s + sizeof (unsigned long), p);
232 } 198 }
233} 199}
234 200
235#endif 201#endif
202
203/******************************************************************************/
204
205refcnt_buf::refcnt_buf (size_t size)
206{
207 static uint32_t empty_buf [2] = { 0, 1 }; // 2 == never deallocated
208 data = (char *)empty_buf + overhead;
209 assert (overhead == sizeof (empty_buf));
210 inc ();
211}
212
213refcnt_buf::refcnt_buf (void *data, size_t size)
214{
215 _alloc (size);
216 memcpy (this->data, data, size);
217}
218
219refcnt_buf::~refcnt_buf ()
220{
221 dec ();
222}
223
224void
225refcnt_buf::_dealloc ()
226{
227 sfree<char> (data - overhead, size () + overhead);
228}
229
230refcnt_buf &
231refcnt_buf::operator =(const refcnt_buf &src)
232{
233 dec ();
234 data = src.data;
235 inc ();
236 return *this;
237}
236 238
237/******************************************************************************/ 239/******************************************************************************/
238 240
239int 241int
240assign (char *dst, const char *src, int maxsize) 242assign (char *dst, const char *src, int maxsize)
287 va_end (ap); 289 va_end (ap);
288 290
289 return buf; 291 return buf;
290} 292}
291 293
292tstamp now () 294tstamp
295now ()
293{ 296{
294 struct timeval tv; 297 struct timeval tv;
295 298
296 gettimeofday (&tv, 0); 299 gettimeofday (&tv, 0);
297 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 300 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
362 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 365 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
363 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 366 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
364 0x2d02ef8dL 367 0x2d02ef8dL
365}; 368};
366 369
370void
367void thread::start (void *(*start_routine)(void *), void *arg) 371thread::start (void *(*start_routine)(void *), void *arg)
368{ 372{
369 pthread_attr_t attr; 373 pthread_attr_t attr;
370 374
371 pthread_attr_init (&attr); 375 pthread_attr_init (&attr);
372 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); 376 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines