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.107 by root, Sat Nov 17 23:33:17 2018 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,2013,2014,2015,2016 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
47#if !GCC_VERSION(3,4)
48int least_significant_bit (uint32_t x)
49{
50 x &= -x; // this isolates the lowest bit
51
52 int r = 0;
53
54 if (x & 0xaaaaaaaa) r += 1;
55 if (x & 0xcccccccc) r += 2;
56 if (x & 0xf0f0f0f0) r += 4;
57 if (x & 0xff00ff00) r += 8;
58 if (x & 0xffff0000) r += 16;
59
60 return r;
61}
62#endif
63
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 45
105/******************************************************************************/ 46/******************************************************************************/
106 47
107/* Checks a player-provided string which will become the msg property of 48/* Checks a player-provided string which will become the msg property of
108 * an object for dangerous input. 49 * an object for dangerous input.
109 */ 50 */
110bool 51bool
111msg_is_safe (const char *msg) 52msg_is_safe (const char *msg)
112{ 53{
113 bool safe = true; 54 bool safe = true;
114 55
115 /* Trying to cheat by getting data into the object */ 56 /* Trying to cheat by getting data into the object */
… …
134 signal (SIGINT , SIG_IGN); 75 signal (SIGINT , SIG_IGN);
135 signal (SIGTERM, SIG_IGN); 76 signal (SIGTERM, SIG_IGN);
136 signal (SIGABRT, SIG_IGN); 77 signal (SIGABRT, SIG_IGN);
137 78
138 signal (SIGSEGV, SIG_DFL); 79 signal (SIGSEGV, SIG_DFL);
80 signal (SIGFPE , SIG_DFL);
81#ifdef SIGBUS
139 signal (SIGBUS , SIG_DFL); 82 signal (SIGBUS , SIG_DFL);
83#endif
140 signal (SIGILL , SIG_DFL); 84 signal (SIGILL , SIG_DFL);
141 signal (SIGTRAP, SIG_DFL); 85 signal (SIGTRAP, SIG_DFL);
142 86
143 // try to put corefiles into a subdirectory, if existing, to allow 87 // try to put corefiles into a subdirectory, if existing, to allow
144 // an administrator to reduce the I/O load. 88 // an administrator to reduce the I/O load.
… …
168 } 112 }
169 113
170 LOG (llevError, "fork abort: %s\n", msg); 114 LOG (llevError, "fork abort: %s\n", msg);
171} 115}
172 116
173void *salloc_ (int n) throw (std::bad_alloc) 117void *
118salloc_ (int n)
174{ 119{
175 void *ptr = g_slice_alloc (n); 120 void *ptr = g_slice_alloc (n);
176 121
177 if (!ptr) 122 if (!ptr)
178 throw std::bad_alloc (); 123 throw std::bad_alloc ();
179 124
180 slice_alloc += n; 125 slice_alloc += n;
181 return ptr; 126 return ptr;
182} 127}
183 128
184void *salloc_ (int n, void *src) throw (std::bad_alloc) 129void *
130salloc_ (int n, void *src)
185{ 131{
186 void *ptr = salloc_ (n); 132 void *ptr = salloc_ (n);
187 133
188 if (src) 134 if (src)
189 memcpy (ptr, src, n); 135 memcpy (ptr, src, n);
… …
197 143
198#if DEBUG_SALLOC 144#if DEBUG_SALLOC
199 145
200#define MAGIC 0xa1b2c35543deadLL 146#define MAGIC 0xa1b2c35543deadLL
201 147
148void *
202void *g_slice_alloc (unsigned long size) 149g_slice_alloc (unsigned long size)
203{ 150{
204 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); 151 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
205 *p++ = size ^ MAGIC; 152 *p++ = size ^ MAGIC;
206 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D 153 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
207 return (void *)p; 154 return (void *)p;
208} 155}
209 156
157void *
210void *g_slice_alloc0 (unsigned long size) 158g_slice_alloc0 (unsigned long size)
211{ 159{
212 return memset (g_slice_alloc (size), 0, size); 160 return memset (g_slice_alloc (size), 0, size);
213} 161}
214 162
163void
215void g_slice_free1 (unsigned long size, void *ptr) 164g_slice_free1 (unsigned long size, void *ptr)
216{ 165{
217 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D 166 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
218 if (expect_true (ptr)) 167 if (expect_true (ptr))
219 { 168 {
220 unsigned long *p = (unsigned long *)ptr; 169 unsigned long *p = (unsigned long *)ptr;
… …
231 (g_slice_free1)(s + sizeof (unsigned long), p); 180 (g_slice_free1)(s + sizeof (unsigned long), p);
232 } 181 }
233} 182}
234 183
235#endif 184#endif
185
186/******************************************************************************/
187
188refcnt_buf::refcnt_buf (size_t size)
189{
190 static uint32_t empty_buf [2] = { 0, 1 }; // 2 == never deallocated
191 data = (char *)empty_buf + overhead;
192 assert (overhead == sizeof (empty_buf));
193 inc ();
194}
195
196refcnt_buf::refcnt_buf (void *data, size_t size)
197{
198 _alloc (size);
199 memcpy (this->data, data, size);
200}
201
202refcnt_buf::~refcnt_buf ()
203{
204 dec ();
205}
206
207void
208refcnt_buf::_dealloc ()
209{
210 sfree<char> (data - overhead, size () + overhead);
211}
212
213refcnt_buf &
214refcnt_buf::operator =(const refcnt_buf &src)
215{
216 dec ();
217 data = src.data;
218 inc ();
219 return *this;
220}
236 221
237/******************************************************************************/ 222/******************************************************************************/
238 223
239int 224int
240assign (char *dst, const char *src, int maxsize) 225assign (char *dst, const char *src, int maxsize)
… …
287 va_end (ap); 272 va_end (ap);
288 273
289 return buf; 274 return buf;
290} 275}
291 276
292tstamp now () 277tstamp
278now ()
293{ 279{
294 struct timeval tv; 280 struct timeval tv;
295 281
296 gettimeofday (&tv, 0); 282 gettimeofday (&tv, 0);
297 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 283 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
… …
362 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 348 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
363 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 349 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
364 0x2d02ef8dL 350 0x2d02ef8dL
365}; 351};
366 352
353void
367void thread::start (void *(*start_routine)(void *), void *arg) 354thread::start (void *(*start_routine)(void *), void *arg)
368{ 355{
369 pthread_attr_t attr; 356 pthread_attr_t attr;
370 357
371 pthread_attr_init (&attr); 358 pthread_attr_init (&attr);
372 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); 359 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);

Diff Legend

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