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.4 by root, Mon Sep 4 11:07:59 2006 UTC vs.
Revision 1.47 by root, Wed Feb 7 02:04:46 2007 UTC

1/* 1/*
2 * static char *rcsid_utils_c =
3 * "$Id: utils.C,v 1.4 2006/09/04 11:07:59 root Exp $";
4 */
5
6/*
7 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
8 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
9 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
11 7 *
12 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
13 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
14 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
15 (at your option) any later version. 11 * (at your option) any later version.
16 12 *
17 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,
18 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 GNU General Public License for more details. 16 * GNU General Public License for more details.
21 17 *
22 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
23 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 21 *
26 The authors can be reached via e-mail at crossfire-devel@real-time.com 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
27*/ 23 */
28 24
29/* 25/*
30 * General convenience functions for crossfire. 26 * General convenience functions for crossfire.
31 */ 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>
32 35
33#include <global.h> 36#include <global.h>
34#include <funcpoint.h> 37#include <funcpoint.h>
35#include <material.h> 38#include <material.h>
36 39
37#include <glib.h> 40#include <glib.h>
41
42rand_gen rndm;
43
44void
45tausworthe_random_generator::seed (uint32_t seed)
46{
47 state [0] = max ( 2U, seed * 69069U);
48 state [1] = max ( 8U, state [0] * 69069U);
49 state [2] = max ( 16U, state [1] * 69069U);
50 state [3] = max (128U, state [2] * 69069U);
51
52 for (int i = 11; --i; )
53 operator ()();
54}
55
56uint32_t
57tausworthe_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
67uint32_t
68tausworthe_random_generator::get_range (uint32_t r_max)
69{
70 return next () % r_max;
71}
72
73// return a number within (min .. max)
74int
75tausworthe_random_generator::get_range (int r_min, int r_max)
76{
77 return r_min + (*this) (max (r_max - r_min + 1, 1));
78}
38 79
39/* 80/*
40 * The random functions here take luck into account when rolling random 81 * The random functions here take luck into account when rolling random
41 * 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
42 * difference becomes in the random numbers. IE, the effect is lessened 83 * difference becomes in the random numbers. IE, the effect is lessened
… …
49 * 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,
50 * 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.
51 * Generally, op should be the player/caster/hitter requesting the roll, 92 * Generally, op should be the player/caster/hitter requesting the roll,
52 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
53 */ 94 */
54 95int
55int random_roll(int min, int max, const object *op, int goodbad) { 96random_roll (int r_min, int r_max, const object *op, int goodbad)
56 int omin, diff, luck, base, ran; 97{
98 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
57 99
58 omin = min; 100 if (r_max < 1 || r_max < r_min)
59 diff = max - min + 1; 101 {
60 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
61
62 if (max < 1 || diff < 1) {
63 LOG(llevError, "Calling random_roll with min=%d max=%d\n", min, max); 102 LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
64 return(min); /* avoids a float exception */ 103 return r_min;
65 } 104 }
66 105
67 ran = RANDOM();
68
69 if (op->type != PLAYER) 106 if (op->type == PLAYER)
70 return((ran%diff)+min); 107 {
71
72 luck = op->stats.luck; 108 int luck = op->stats.luck;
73 if (RANDOM()%base < MIN(10, abs(luck))) {
74 /* we have a winner */
75 ((luck > 0) ? (luck = 1) : (luck = -1));
76 diff -= luck;
77 if (diff < 1)
78 return(omin); /*check again*/
79 ((goodbad) ? (min += luck) : (diff));
80 109
81 return(MAX(omin, MIN(max, (ran%diff)+min))); 110 if (rndm (base) < min (10, abs (luck)))
111 {
112 //TODO: take luck into account
113 }
82 } 114 }
83 return((ran%diff)+min); 115
116 return rndm (r_min, r_max);
84} 117}
85 118
86/* 119/*
87 * This is a 64 bit version of random_roll above. This is needed 120 * This is a 64 bit version of random_roll above. This is needed
88 * for exp loss calculations for players changing religions. 121 * for exp loss calculations for players changing religions.
89 */ 122 */
90 123sint64
91sint64 random_roll64(sint64 min, sint64 max, const object *op, int goodbad) { 124random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
125{
92 sint64 omin, diff, luck, ran; 126 sint64 omin, diff, luck, ran;
93 int base; 127 int base;
94 128
95 omin = min; 129 omin = min;
96 diff = max - min + 1; 130 diff = max - min + 1;
97 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 131 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
98 132
99 if (max < 1 || diff < 1) { 133 if (max < 1 || diff < 1)
100#ifndef WIN32 134 {
101 LOG(llevError, "Calling random_roll with min=%lld max=%lld\n", min, max);
102#else
103 LOG(llevError, "Calling random_roll with min=%I64d max=%I64d\n", min, max); 135 LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
104#endif
105 return(min); /* avoids a float exception */ 136 return (min); /* avoids a float exception */
106 } 137 }
107 138
108 /* Don't know of a portable call to get 64 bit random values. 139 /*
109 * So make a call to get two 32 bit random numbers, and just to 140 * Make a call to get two 32 bit unsigned random numbers, and just to
110 * a little byteshifting. Do make sure the first one is only 141 * a little bitshifting.
111 * 32 bit, so we don't get skewed results
112 */ 142 */
113 ran = (RANDOM() & 0xffffffff) | ((sint64)RANDOM() << 32); 143 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
114 144
115 if (op->type != PLAYER) 145 if (op->type != PLAYER)
116 return((ran%diff)+min); 146 return ((ran % diff) + min);
117 147
118 luck = op->stats.luck; 148 luck = op->stats.luck;
119 if (RANDOM()%base < MIN(10, abs(luck))) { 149 if (rndm (base) < MIN (10, abs (luck)))
150 {
120 /* we have a winner */ 151 /* we have a winner */
121 ((luck > 0) ? (luck = 1) : (luck = -1)); 152 ((luck > 0) ? (luck = 1) : (luck = -1));
122 diff -= luck; 153 diff -= luck;
123 if (diff < 1) 154 if (diff < 1)
124 return(omin); /*check again*/ 155 return (omin); /*check again */
125 ((goodbad) ? (min += luck) : (diff)); 156 ((goodbad) ? (min += luck) : (diff));
126 157
127 return(MAX(omin, MIN(max, (ran%diff)+min))); 158 return (MAX (omin, MIN (max, (ran % diff) + min)));
128 } 159 }
160
129 return((ran%diff)+min); 161 return ((ran % diff) + min);
130} 162}
131 163
132/* 164/*
133 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 165 * Roll a number of dice (2d3, 4d6). Uses op to determine luck,
134 * If goodbad is non-zero, luck increases the roll, if zero, it decreases. 166 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
135 * Generally, op should be the player/caster/hitter requesting the roll, 167 * Generally, op should be the player/caster/hitter requesting the roll,
136 * not the recipient (ie, the poor slob getting hit). 168 * not the recipient (ie, the poor slob getting hit).
137 * The args are num D size (ie 4d6) [garbled 20010916] 169 * The args are num D size (ie 4d6) [garbled 20010916]
138 */ 170 */
139 171
172int
140int die_roll(int num, int size, const object *op, int goodbad) { 173die_roll (int num, int size, const object *op, int goodbad)
174{
141 int min, diff, luck, total, i, gotlucky, base, ran; 175 int min, diff, luck, total, i, gotlucky, base;
142 176
143 diff = size; 177 diff = size;
144 min = 1; 178 min = 1;
145 luck = total = gotlucky = 0; 179 luck = total = gotlucky = 0;
146 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 180 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
147 if (size < 2 || diff < 1) { 181 if (size < 2 || diff < 1)
182 {
148 LOG(llevError, "Calling die_roll with num=%d size=%d\n", num, size); 183 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
149 return(num); /* avoids a float exception */ 184 return (num); /* avoids a float exception */
150 } 185 }
151 186
152 if (op->type == PLAYER) 187 if (op->type == PLAYER)
153 luck = op->stats.luck; 188 luck = op->stats.luck;
154 189
155 for (i = 0; i < num; i++) { 190 for (i = 0; i < num; i++)
191 {
156 if (RANDOM()%base < MIN(10, abs(luck)) && !gotlucky) { 192 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
193 {
157 /* we have a winner */ 194 /* we have a winner */
158 gotlucky++; 195 gotlucky++;
159 ((luck > 0) ? (luck = 1) : (luck = -1)); 196 ((luck > 0) ? (luck = 1) : (luck = -1));
160 diff -= luck; 197 diff -= luck;
161 if (diff < 1) 198 if (diff < 1)
162 return(num); /*check again*/ 199 return (num); /*check again */
163 ((goodbad) ? (min += luck) : (diff)); 200 ((goodbad) ? (min += luck) : (diff));
164 ran = RANDOM();
165 total += MAX(1, MIN(size, (ran%diff)+min)); 201 total += MAX (1, MIN (size, rndm (diff) + min));
202 }
166 } else { 203 else
167 total += RANDOM()%size+1; 204 total += rndm (size) + 1;
168 }
169 } 205 }
206
170 return(total); 207 return total;
171} 208}
172 209
173/*
174 * Another convenience function. Returns a number between min and max.
175 * It is suggested one use these functions rather than RANDOM()%, as it
176 * would appear that a number of off-by-one-errors exist due to improper
177 * use of %. This should also prevent SIGFPE.
178 */
179
180int rndm(int min, int max)
181{
182 int diff;
183
184 diff = max - min + 1;
185 if (max < 1 || diff < 1)
186 return(min);
187
188 return(RANDOM()%diff+min);
189}
190
191/* decay and destroy persihable items in a map */ 210/* decay and destroy perishable items in a map */
192 211void
193void decay_objects(mapstruct *m) 212maptile::decay_objects ()
194{ 213{
195 int x, y, destroy; 214 if (!spaces)
196 object *op, *otmp;
197
198 if (m->unique)
199 return; 215 return;
200 216
201 for (x=0; x < MAP_WIDTH(m); x++) 217 for (mapspace *ms = spaces + size (); ms-- > spaces; )
202 for (y=0; y < MAP_HEIGHT(m); y++) 218 for (object *above, *op = ms->bot; op; op = above)
203 for (op = get_map_ob(m, x, y); op; op = otmp) { 219 {
220 above = op->above;
221
204 destroy = 0; 222 bool destroy = 0;
205 otmp = op->above; 223
224 // do not decay anything above unique floor tiles (yet :)
206 if (QUERY_FLAG(op,FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE)) 225 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
207 break; 226 break;
227
208 if (QUERY_FLAG(op, FLAG_IS_FLOOR) || 228 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
209 QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) || 229 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
210 QUERY_FLAG(op, FLAG_OBJ_SAVE_ON_OVL) || 230 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
211 QUERY_FLAG(op, FLAG_UNIQUE) || 231 || QUERY_FLAG (op, FLAG_UNIQUE)
212 QUERY_FLAG(op, FLAG_OVERLAY_FLOOR) || 232 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
213 QUERY_FLAG(op, FLAG_UNPAID) || IS_LIVE(op)) 233 || QUERY_FLAG (op, FLAG_UNPAID)
214 continue; 234 || op->is_alive ())
215 /* otherwise, we decay and destroy */ 235 ; // do not decay
216 if (IS_WEAPON(op)) { 236 else if (op->is_weapon ())
237 {
217 op->stats.dam--; 238 op->stats.dam--;
218 if (op->stats.dam < 0) 239 if (op->stats.dam < 0)
219 destroy = 1; 240 destroy = 1;
220 } else if (IS_ARMOR(op)) {
221 op->stats.ac--;
222 if (op->stats.ac < 0)
223 destroy = 1;
224 } else if (op->type == FOOD) {
225 op->stats.food -= rndm(5,20);
226 if (op->stats.food < 0)
227 destroy = 1;
228 } else {
229 if (op->material & M_PAPER || op->material & M_LEATHER ||
230 op->material & M_WOOD || op->material & M_ORGANIC ||
231 op->material & M_CLOTH || op->material & M_LIQUID)
232 destroy = 1;
233 if (op->material & M_IRON && rndm(1,5) == 1)
234 destroy = 1;
235 if (op->material & M_GLASS && rndm(1,2) == 1)
236 destroy = 1;
237 if ((op->material & M_STONE || op->material & M_ADAMANT) &&
238 rndm(1,10) == 1)
239 destroy = 1;
240 if ((op->material & M_SOFT_METAL || op->material & M_BONE) &&
241 rndm(1,3) == 1)
242 destroy = 1;
243 if (op->material & M_ICE && MAP_TEMP(m) > 32)
244 destroy = 1;
245 }
246 /* adjust overall chance below */
247 if (destroy && rndm(0, 1)) {
248 remove_ob(op);
249 free_object(op);
250 }
251 } 241 }
242 else if (op->is_armor ())
243 {
244 op->stats.ac--;
245 if (op->stats.ac < 0)
246 destroy = 1;
247 }
248 else if (op->type == FOOD)
249 {
250 op->stats.food -= rndm (5, 20);
251 if (op->stats.food < 0)
252 destroy = 1;
253 }
254 else
255 {
256 int mat = op->materials;
257
258 if (mat & M_PAPER
259 || mat & M_LEATHER
260 || mat & M_WOOD
261 || mat & M_ORGANIC
262 || mat & M_CLOTH
263 || mat & M_LIQUID
264 || (mat & M_IRON && rndm (1, 5) == 1)
265 || (mat & M_GLASS && rndm (1, 2) == 1)
266 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
267 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
268 || (mat & M_ICE && temp > 32))
269 destroy = 1;
270 }
271
272 /* adjust overall chance below */
273 if (destroy && rndm (0, 1))
274 op->destroy ();
275 }
252} 276}
253 277
254/* convert materialname to materialtype_t */ 278/* convert materialname to materialtype_t */
255 279
256materialtype_t *name_to_material(const char *name) 280materialtype_t *
281name_to_material (const shstr &name)
257{ 282{
258 materialtype_t *mt, *nmt; 283 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
259 284 if (name == mt->name)
260 mt = NULL;
261 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt=nmt->next) {
262 if (strcmp(name, nmt->name) == 0) {
263 mt = nmt;
264 break;
265 }
266 }
267 return mt; 285 return mt;
286
287 return materialt;
268} 288}
269 289
270/* when doing transmutation of objects, we have to recheck the resistances, 290/* when doing transmutation of objects, we have to recheck the resistances,
271 * as some that did not apply previously, may apply now. 291 * as some that did not apply previously, may apply now.
272 */ 292 */
273 293
294void
274void transmute_materialname(object *op, const object *change) 295transmute_materialname (object *op, const object *change)
275{ 296{
276 materialtype_t *mt; 297 materialtype_t *mt;
277 int j; 298 int j;
278 299
279 if (op->materialname == NULL) 300 if (op->materialname == NULL)
280 return; 301 return;
281 302
282 if (change->materialname != NULL && 303 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
283 strcmp(op->materialname, change->materialname))
284 return; 304 return;
285 305
286 if (!IS_ARMOR(op)) 306 if (!op->is_armor ())
287 return; 307 return;
288 308
289 mt = name_to_material(op->materialname); 309 mt = name_to_material (op->materialname);
290 if (!mt) { 310 if (!mt)
311 {
291 LOG(llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname); 312 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
292 return; 313 return;
293 } 314 }
294 315
295 for (j=0; j < NROFATTACKS; j++) 316 for (j = 0; j < NROFATTACKS; j++)
296 if (op->resist[j] == 0 && change->resist[j] != 0) { 317 if (op->resist[j] == 0 && change->resist[j] != 0)
318 {
297 op->resist[j] += mt->mod[j]; 319 op->resist[j] += mt->mod[j];
298 if (op->resist[j] > 100) 320 if (op->resist[j] > 100)
299 op->resist[j] = 100; 321 op->resist[j] = 100;
300 if (op->resist[j] < -100) 322 if (op->resist[j] < -100)
301 op->resist[j] = -100; 323 op->resist[j] = -100;
302 } 324 }
303} 325}
304 326
305/* set the materialname and type for an item */ 327/* set the materialname and type for an item */
328void
306void set_materialname(object *op, int difficulty, materialtype_t *nmt) 329set_materialname (object *op, int difficulty, materialtype_t *nmt)
307{ 330{
308 materialtype_t *mt, *lmt; 331 materialtype_t *mt, *lmt;
332
333#ifdef NEW_MATERIAL_CODE
309 int j; 334 int j;
335#endif
310 336
311 if (op->materialname != NULL) 337 if (op->materialname != NULL)
312 return; 338 return;
313 339
314 340
315 341
316 if (nmt == NULL) { 342 if (nmt == NULL)
343 {
317 lmt = NULL; 344 lmt = NULL;
318#ifndef NEW_MATERIAL_CODE 345#ifndef NEW_MATERIAL_CODE
319 for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) { 346 for (mt = materialt; mt && mt->next; mt = mt->next)
347 {
320 if (op->material & mt->material) { 348 if (op->materials & mt->material)
349 {
321 lmt = mt; 350 lmt = mt;
351 break;
352 }
353 }
354
355#else
356 for (mt = materialt; mt && mt->next; mt = mt->next)
357 {
358 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
359 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
360 {
361 lmt = mt;
362 if (!(op->is_weapon () || op->is_armor ()))
322 break; 363 break;
323 } 364 }
324 } 365 }
366#endif
367 }
368 else
369 {
370 lmt = nmt;
371 }
325 372
373 if (lmt != NULL)
374 {
375#ifndef NEW_MATERIAL_CODE
376 op->materialname = lmt->name;
377 return;
326#else 378#else
327 for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) { 379
328 if (op->material & mt->material && rndm(1, 100) <= mt->chance && 380 if (op->stats.dam && op->is_weapon ())
329 difficulty >= mt->difficulty &&
330 (op->magic >= mt->magic || mt->magic == 0)) {
331 lmt = mt;
332 if (!(IS_WEAPON(op) || IS_ARMOR(op)))
333 break;
334 }
335 } 381 {
336#endif
337 } else {
338 lmt = nmt;
339 }
340
341 if (lmt != NULL) {
342#ifndef NEW_MATERIAL_CODE
343 op->materialname = lmt->name;
344 return;
345#else
346
347 if (op->stats.dam && IS_WEAPON(op)) {
348 op->stats.dam += lmt->damage; 382 op->stats.dam += lmt->damage;
349 if (op->stats.dam < 1) 383 if (op->stats.dam < 1)
350 op->stats.dam = 1; 384 op->stats.dam = 1;
351 } 385 }
386
352 if (op->stats.sp && op->type == BOW) 387 if (op->stats.sp && op->type == BOW)
353 op->stats.sp += lmt->sp; 388 op->stats.sp += lmt->sp;
354 if (op->stats.wc && IS_WEAPON(op)) 389 if (op->stats.wc && op->is_weapon ())
355 op->stats.wc += lmt->wc; 390 op->stats.wc += lmt->wc;
356 if (IS_ARMOR(op)) { 391 if (op->is_armor ())
392 {
357 if (op->stats.ac) 393 if (op->stats.ac)
358 op->stats.ac += lmt->ac; 394 op->stats.ac += lmt->ac;
359 for (j=0; j < NROFATTACKS; j++) 395 for (j = 0; j < NROFATTACKS; j++)
360 if (op->resist[j] != 0) { 396 if (op->resist[j] != 0)
397 {
361 op->resist[j] += lmt->mod[j]; 398 op->resist[j] += lmt->mod[j];
362 if (op->resist[j] > 100) 399 if (op->resist[j] > 100)
363 op->resist[j] = 100; 400 op->resist[j] = 100;
364 if (op->resist[j] < -100) 401 if (op->resist[j] < -100)
365 op->resist[j] = -100; 402 op->resist[j] = -100;
366 } 403 }
367 } 404 }
368 op->materialname = add_string(lmt->name); 405 op->materialname = lmt->name;
369 /* dont make it unstackable if it doesn't need to be */ 406 /* dont make it unstackable if it doesn't need to be */
370 if (IS_WEAPON(op) || IS_ARMOR(op)) { 407 if (op->is_weapon () || op->is_armor ())
408 {
371 op->weight = (op->weight * lmt->weight)/100; 409 op->weight = (op->weight * lmt->weight) / 100;
372 op->value = (op->value * lmt->value)/100; 410 op->value = (op->value * lmt->value) / 100;
373 } 411 }
374#endif 412#endif
375 } 413 }
376} 414}
377 415
378/* 416/*
379 * Strip out the media tags from a String. 417 * Strip out the media tags from a String.
380 * Warning the input string will contain the result string 418 * Warning the input string will contain the result string
381 */ 419 */
420void
382void strip_media_tag(char *message){ 421strip_media_tag (char *message)
422{
383 int in_tag=0; 423 int in_tag = 0;
384 char* dest; 424 char *dest;
385 char* src; 425 char *src;
426
386 src=dest=message; 427 src = dest = message;
387 while (*src!='\0'){ 428 while (*src != '\0')
429 {
388 if (*src=='['){ 430 if (*src == '[')
431 {
389 in_tag=1; 432 in_tag = 1;
433 }
390 } else if (in_tag && (*src==']')) 434 else if (in_tag && (*src == ']'))
391 in_tag=0; 435 in_tag = 0;
392 else if (!in_tag){ 436 else if (!in_tag)
437 {
393 *dest=*src; 438 *dest = *src;
394 dest++; 439 dest++;
395 } 440 }
396 src++; 441 src++;
397 } 442 }
398 *dest='\0'; 443 *dest = '\0';
399} 444}
400 445
446const char *
401const char* strrstr(const char* haystack, const char* needle){ 447strrstr (const char *haystack, const char *needle)
448{
402 const char* lastneedle; 449 const char *lastneedle;
450
403 lastneedle=NULL; 451 lastneedle = NULL;
404 while((haystack=strstr(haystack,needle))!=NULL){ 452 while ((haystack = strstr (haystack, needle)) != NULL)
453 {
405 lastneedle=haystack; 454 lastneedle = haystack;
406 haystack++; 455 haystack++;
407 } 456 }
408 return lastneedle; 457 return lastneedle;
409 458
410} 459}
460
411#define EOL_SIZE (sizeof("\n")-1) 461#define EOL_SIZE (sizeof("\n")-1)
462void
412void strip_endline(char* buf){ 463strip_endline (char *buf)
464{
413 if (strlen(buf)<sizeof("\n")){ 465 if (strlen (buf) < sizeof ("\n"))
466 {
414 return; 467 return;
415 } 468 }
416 if (!strcmp(buf+strlen(buf)-EOL_SIZE,"\n")) 469 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
417 buf[strlen(buf)-EOL_SIZE]='\0'; 470 buf[strlen (buf) - EOL_SIZE] = '\0';
418} 471}
419 472
420/** 473/**
421 * Replace in string src all occurrences of key by replacement. The resulting 474 * Replace in string src all occurrences of key by replacement. The resulting
422 * string is put into result; at most resultsize characters (including the 475 * string is put into result; at most resultsize characters (including the
423 * terminating null character) will be written to result. 476 * terminating null character) will be written to result.
424 */ 477 */
478void
425void replace(const char *src, const char *key, const char *replacement, char *result, size_t resultsize) 479replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
426{ 480{
427 size_t resultlen; 481 size_t resultlen;
428 size_t keylen; 482 size_t keylen;
429 483
430 /* special case to prevent infinite loop if key==replacement=="" */ 484 /* special case to prevent infinite loop if key==replacement=="" */
431 if(strcmp(key, replacement) == 0) 485 if (strcmp (key, replacement) == 0)
432 { 486 {
433 snprintf(result, resultsize, "%s", src); 487 snprintf (result, resultsize, "%s", src);
434 return; 488 return;
435 } 489 }
436 490
437 keylen = strlen(key); 491 keylen = strlen (key);
438 492
439 resultlen = 0; 493 resultlen = 0;
440 while(*src != '\0' && resultlen+1 < resultsize) 494 while (*src != '\0' && resultlen + 1 < resultsize)
441 { 495 {
442 if(strncmp(src, key, keylen) == 0) 496 if (strncmp (src, key, keylen) == 0)
443 { 497 {
444 snprintf(result+resultlen, resultsize-resultlen, "%s", replacement); 498 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
445 resultlen += strlen(result+resultlen); 499 resultlen += strlen (result + resultlen);
446 src += keylen; 500 src += keylen;
447 } 501 }
448 else 502 else
449 {
450 result[resultlen++] = *src++;
451 }
452 } 503 {
504 result[resultlen++] = *src++;
505 }
506 }
453 result[resultlen] = '\0'; 507 result[resultlen] = '\0';
454} 508}
455 509
456/** 510/**
457 * Taking a string as an argument, mutate it into a string that looks like a list. 511 * Taking a string as an argument, mutate it into a string that looks like a list.
458 * a 'list' for the purposes here, is a string of items, seperated by commas, except 512 * a 'list' for the purposes here, is a string of items, seperated by commas, except
459 * for the last entry, which has an 'and' before it, and a full stop (period) after it. 513 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
460 * This function will also strip all trailing non alphanumeric characters. 514 * This function will also strip all trailing non alphanumeric characters.
461 * It does not insert an oxford comma. 515 * It does not insert an oxford comma.
462 */ 516 */
463 517
518void
464void make_list_like(char *input) { 519make_list_like (char *input)
520{
465 char *p, tmp[MAX_BUF]; 521 char *p, tmp[MAX_BUF];
466 int i; 522 int i;
523
467 if (!input || strlen(input) > MAX_BUF-5) return; 524 if (!input || strlen (input) > MAX_BUF - 5)
468 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
469
470 strncpy(tmp, input, MAX_BUF-5);
471 /*trim all trailing commas, spaces etc.*/
472 for (i=strlen(tmp); !isalnum(tmp[i]) && i >= 0; i--)
473 tmp[i]='\0';
474 strcat(tmp, ".");
475
476 p=strrchr(tmp, ',');
477 if (p) {
478 *p='\0';
479 strcpy(input, tmp);
480 p++;
481 strcat(input, " and");
482 strcat(input, p);
483 }
484 else strcpy(input, tmp);
485 return; 525 return;
486} 526 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
487 527
488//TODO: overhead due to specifying size twice 528 strncpy (tmp, input, MAX_BUF - 5);
529 /*trim all trailing commas, spaces etc. */
530 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
531 tmp[i] = '\0';
532
533 strcat (tmp, ".");
534
535 p = strrchr (tmp, ',');
536 if (p)
537 {
538 *p = '\0';
539 strcpy (input, tmp);
540 p++;
541 strcat (input, " and");
542 strcat (input, p);
543 }
544 else
545 strcpy (input, tmp);
546
547 return;
548}
549
550/////////////////////////////////////////////////////////////////////////////
551
489void * 552void
490zero_initialised::operator new (size_t s) 553fork_abort (const char *msg)
491{
492 return g_slice_alloc0 (s);
493}
494
495void *
496zero_initialised::operator new [] (size_t s)
497{
498 return g_slice_alloc0 (s);
499}
500
501void
502zero_initialised::operator delete (void *p, size_t s)
503{ 554{
504 g_slice_free1 (s, p); 555 if (!fork ())
505} 556 {
557 signal (SIGABRT, SIG_DFL);
558 abort ();
559 }
506 560
507void 561 LOG (llevError, "fork abort: %s\n", msg);
508zero_initialised::operator delete [] (void *p, size_t s)
509{
510 g_slice_free1 (s, p);
511} 562}
512 563
564void *salloc_ (int n) throw (std::bad_alloc)
565{
566#ifdef PREFER_MALLOC
567 void *ptr = malloc (n);
568#else
569 void *ptr = g_slice_alloc (n);
570#endif
571
572 if (!ptr)
573 throw std::bad_alloc ();
574
575 return ptr;
576}
577
578void *salloc_ (int n, void *src) throw (std::bad_alloc)
579{
580 void *ptr = salloc_ (n);
581
582 if (src)
583 memcpy (ptr, src, n);
584 else
585 memset (ptr, 0, n);
586
587 return ptr;
588}
589
590void assign (char *dst, const char *src, int maxlen)
591{
592 if (!src)
593 src = "";
594
595 int len = strlen (src);
596
597 if (len >= maxlen - 1)
598 {
599 if (maxlen <= 4)
600 {
601 memset (dst, '.', maxlen - 1);
602 dst [maxlen - 1] = 0;
603 }
604 else
605 {
606 memcpy (dst, src, maxlen - 4);
607 memcpy (dst + maxlen - 4, "...", 4);
608 }
609 }
610 else
611 memcpy (dst, src, len + 1);
612}
613
614tstamp now ()
615{
616 struct timeval tv;
617
618 gettimeofday (&tv, 0);
619 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
620}
621
622int
623similar_direction (int a, int b)
624{
625 if (!a || !b)
626 return 0;
627
628 int diff = (b - a) & 7;
629 return diff <= 1 || diff >= 7;
630}
631

Diff Legend

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