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.40 by root, Thu Jan 18 19:32:37 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 (time (0));
43
44tausworthe_random_generator::tausworthe_random_generator (uint32_t seed)
45{
46 state [0] = max ( 2, seed * 69069U);
47 state [1] = max ( 8, state [0] * 69069U);
48 state [2] = max ( 16, state [1] * 69069U);
49 state [3] = max (128, state [2] * 69069U);
50
51 for (int i = 11; --i; )
52 operator ()();
53}
54
55uint32_t
56tausworthe_random_generator::next ()
57{
58 state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U);
59 state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U);
60 state [2] = ((state [2] & 0xFFFFFFF0U) << 7U) ^ (((state [2] << 13U) ^ state [2]) >> 21U);
61 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
62
63 return state [0] ^ state [1] ^ state [2] ^ state [3];
64}
38 65
39/* 66/*
40 * The random functions here take luck into account when rolling random 67 * 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 68 * 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 69 * 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, 76 * 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. 77 * 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, 78 * Generally, op should be the player/caster/hitter requesting the roll,
52 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 79 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
53 */ 80 */
54 81int
55int random_roll(int min, int max, const object *op, int goodbad) { 82random_roll (int min, int max, const object *op, int goodbad)
83{
56 int omin, diff, luck, base, ran; 84 int omin, diff, luck, base, ran;
57 85
58 omin = min; 86 omin = min;
59 diff = max - min + 1; 87 diff = max - min + 1;
60 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 88 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
61 89
62 if (max < 1 || diff < 1) { 90 if (max < 1 || diff < 1)
91 {
63 LOG(llevError, "Calling random_roll with min=%d max=%d\n", min, max); 92 LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);
64 return(min); /* avoids a float exception */ 93 return (min); /* avoids a float exception */
65 } 94 }
66 95
67 ran = RANDOM(); 96 ran = RANDOM ();
68 97
69 if (op->type != PLAYER) 98 if (op->type != PLAYER)
70 return((ran%diff)+min); 99 return ((ran % diff) + min);
71 100
72 luck = op->stats.luck; 101 luck = op->stats.luck;
73 if (RANDOM()%base < MIN(10, abs(luck))) { 102 if (RANDOM () % base < MIN (10, abs (luck)))
103 {
74 /* we have a winner */ 104 /* we have a winner */
75 ((luck > 0) ? (luck = 1) : (luck = -1)); 105 ((luck > 0) ? (luck = 1) : (luck = -1));
76 diff -= luck; 106 diff -= luck;
77 if (diff < 1) 107 if (diff < 1)
78 return(omin); /*check again*/ 108 return (omin); /*check again */
79 ((goodbad) ? (min += luck) : (diff)); 109 ((goodbad) ? (min += luck) : (diff));
80 110
81 return(MAX(omin, MIN(max, (ran%diff)+min))); 111 return (MAX (omin, MIN (max, (ran % diff) + min)));
82 } 112 }
83 return((ran%diff)+min); 113 return ((ran % diff) + min);
84} 114}
85 115
86/* 116/*
87 * This is a 64 bit version of random_roll above. This is needed 117 * This is a 64 bit version of random_roll above. This is needed
88 * for exp loss calculations for players changing religions. 118 * for exp loss calculations for players changing religions.
89 */ 119 */
90 120
121sint64
91sint64 random_roll64(sint64 min, sint64 max, const object *op, int goodbad) { 122random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
123{
92 sint64 omin, diff, luck, ran; 124 sint64 omin, diff, luck, ran;
93 int base; 125 int base;
94 126
95 omin = min; 127 omin = min;
96 diff = max - min + 1; 128 diff = max - min + 1;
97 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 129 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
98 130
99 if (max < 1 || diff < 1) { 131 if (max < 1 || diff < 1)
100#ifndef WIN32 132 {
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); 133 LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
104#endif
105 return(min); /* avoids a float exception */ 134 return (min); /* avoids a float exception */
106 } 135 }
107 136
108 /* Don't know of a portable call to get 64 bit random values. 137 /* Don't know of a portable call to get 64 bit random values.
109 * So make a call to get two 32 bit random numbers, and just to 138 * So make a call to get two 32 bit random numbers, and just to
110 * a little byteshifting. Do make sure the first one is only 139 * a little byteshifting. Do make sure the first one is only
111 * 32 bit, so we don't get skewed results 140 * 32 bit, so we don't get skewed results
112 */ 141 */
113 ran = (RANDOM() & 0xffffffff) | ((sint64)RANDOM() << 32); 142 ran = (RANDOM () & 0xffffffff) | ((sint64) RANDOM () << 32);
114 143
115 if (op->type != PLAYER) 144 if (op->type != PLAYER)
116 return((ran%diff)+min); 145 return ((ran % diff) + min);
117 146
118 luck = op->stats.luck; 147 luck = op->stats.luck;
119 if (RANDOM()%base < MIN(10, abs(luck))) { 148 if (RANDOM () % base < MIN (10, abs (luck)))
149 {
120 /* we have a winner */ 150 /* we have a winner */
121 ((luck > 0) ? (luck = 1) : (luck = -1)); 151 ((luck > 0) ? (luck = 1) : (luck = -1));
122 diff -= luck; 152 diff -= luck;
123 if (diff < 1) 153 if (diff < 1)
124 return(omin); /*check again*/ 154 return (omin); /*check again */
125 ((goodbad) ? (min += luck) : (diff)); 155 ((goodbad) ? (min += luck) : (diff));
126 156
127 return(MAX(omin, MIN(max, (ran%diff)+min))); 157 return (MAX (omin, MIN (max, (ran % diff) + min)));
128 } 158 }
129 return((ran%diff)+min); 159 return ((ran % diff) + min);
130} 160}
131 161
132/* 162/*
133 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 163 * 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. 164 * 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, 165 * Generally, op should be the player/caster/hitter requesting the roll,
136 * not the recipient (ie, the poor slob getting hit). 166 * not the recipient (ie, the poor slob getting hit).
137 * The args are num D size (ie 4d6) [garbled 20010916] 167 * The args are num D size (ie 4d6) [garbled 20010916]
138 */ 168 */
139 169
170int
140int die_roll(int num, int size, const object *op, int goodbad) { 171die_roll (int num, int size, const object *op, int goodbad)
172{
141 int min, diff, luck, total, i, gotlucky, base, ran; 173 int min, diff, luck, total, i, gotlucky, base, ran;
142 174
143 diff = size; 175 diff = size;
144 min = 1; 176 min = 1;
145 luck = total = gotlucky = 0; 177 luck = total = gotlucky = 0;
146 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 178 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
147 if (size < 2 || diff < 1) { 179 if (size < 2 || diff < 1)
180 {
148 LOG(llevError, "Calling die_roll with num=%d size=%d\n", num, size); 181 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
149 return(num); /* avoids a float exception */ 182 return (num); /* avoids a float exception */
150 } 183 }
151 184
152 if (op->type == PLAYER) 185 if (op->type == PLAYER)
153 luck = op->stats.luck; 186 luck = op->stats.luck;
154 187
155 for (i = 0; i < num; i++) { 188 for (i = 0; i < num; i++)
189 {
156 if (RANDOM()%base < MIN(10, abs(luck)) && !gotlucky) { 190 if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)
191 {
157 /* we have a winner */ 192 /* we have a winner */
158 gotlucky++; 193 gotlucky++;
159 ((luck > 0) ? (luck = 1) : (luck = -1)); 194 ((luck > 0) ? (luck = 1) : (luck = -1));
160 diff -= luck; 195 diff -= luck;
161 if (diff < 1) 196 if (diff < 1)
162 return(num); /*check again*/ 197 return (num); /*check again */
163 ((goodbad) ? (min += luck) : (diff)); 198 ((goodbad) ? (min += luck) : (diff));
164 ran = RANDOM(); 199 ran = RANDOM ();
165 total += MAX(1, MIN(size, (ran%diff)+min)); 200 total += MAX (1, MIN (size, (ran % diff) + min));
201 }
166 } else { 202 else
203 {
167 total += RANDOM()%size+1; 204 total += RANDOM () % size + 1;
168 } 205 }
169 } 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->material;
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
280materialtype_t *
256materialtype_t *name_to_material(const char *name) 281name_to_material (const char *name)
257{ 282{
258 materialtype_t *mt, *nmt; 283 materialtype_t *mt, *nmt;
259 284
260 mt = NULL; 285 mt = NULL;
261 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt=nmt->next) { 286 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
287 {
262 if (strcmp(name, nmt->name) == 0) { 288 if (strcmp (name, nmt->name) == 0)
289 {
263 mt = nmt; 290 mt = nmt;
264 break; 291 break;
265 } 292 }
266 } 293 }
267 return mt; 294 return mt;
268} 295}
269 296
270/* when doing transmutation of objects, we have to recheck the resistances, 297/* when doing transmutation of objects, we have to recheck the resistances,
271 * as some that did not apply previously, may apply now. 298 * as some that did not apply previously, may apply now.
272 */ 299 */
273 300
301void
274void transmute_materialname(object *op, const object *change) 302transmute_materialname (object *op, const object *change)
275{ 303{
276 materialtype_t *mt; 304 materialtype_t *mt;
277 int j; 305 int j;
278 306
279 if (op->materialname == NULL) 307 if (op->materialname == NULL)
280 return; 308 return;
281 309
282 if (change->materialname != NULL && 310 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
283 strcmp(op->materialname, change->materialname))
284 return; 311 return;
285 312
286 if (!IS_ARMOR(op)) 313 if (!op->is_armor ())
287 return; 314 return;
288 315
289 mt = name_to_material(op->materialname); 316 mt = name_to_material (op->materialname);
290 if (!mt) { 317 if (!mt)
318 {
291 LOG(llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname); 319 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
292 return; 320 return;
293 } 321 }
294 322
295 for (j=0; j < NROFATTACKS; j++) 323 for (j = 0; j < NROFATTACKS; j++)
296 if (op->resist[j] == 0 && change->resist[j] != 0) { 324 if (op->resist[j] == 0 && change->resist[j] != 0)
325 {
297 op->resist[j] += mt->mod[j]; 326 op->resist[j] += mt->mod[j];
298 if (op->resist[j] > 100) 327 if (op->resist[j] > 100)
299 op->resist[j] = 100; 328 op->resist[j] = 100;
300 if (op->resist[j] < -100) 329 if (op->resist[j] < -100)
301 op->resist[j] = -100; 330 op->resist[j] = -100;
302 } 331 }
303} 332}
304 333
305/* set the materialname and type for an item */ 334/* set the materialname and type for an item */
335void
306void set_materialname(object *op, int difficulty, materialtype_t *nmt) 336set_materialname (object *op, int difficulty, materialtype_t *nmt)
307{ 337{
308 materialtype_t *mt, *lmt; 338 materialtype_t *mt, *lmt;
339
340#ifdef NEW_MATERIAL_CODE
309 int j; 341 int j;
342#endif
310 343
311 if (op->materialname != NULL) 344 if (op->materialname != NULL)
312 return; 345 return;
313 346
314 347
315 348
316 if (nmt == NULL) { 349 if (nmt == NULL)
350 {
317 lmt = NULL; 351 lmt = NULL;
318#ifndef NEW_MATERIAL_CODE 352#ifndef NEW_MATERIAL_CODE
319 for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) { 353 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
354 {
320 if (op->material & mt->material) { 355 if (op->material & mt->material)
356 {
321 lmt = mt; 357 lmt = mt;
358 break;
359 }
360 }
361
362#else
363 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
364 {
365 if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
366 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
367 {
368 lmt = mt;
369 if (!(op->is_weapon () || op->is_armor ()))
322 break; 370 break;
323 } 371 }
324 } 372 }
373#endif
374 }
375 else
376 {
377 lmt = nmt;
378 }
325 379
380 if (lmt != NULL)
381 {
382#ifndef NEW_MATERIAL_CODE
383 op->materialname = lmt->name;
384 return;
326#else 385#else
327 for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) { 386
328 if (op->material & mt->material && rndm(1, 100) <= mt->chance && 387 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 } 388 {
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; 389 op->stats.dam += lmt->damage;
349 if (op->stats.dam < 1) 390 if (op->stats.dam < 1)
350 op->stats.dam = 1; 391 op->stats.dam = 1;
351 } 392 }
352 if (op->stats.sp && op->type == BOW) 393 if (op->stats.sp && op->type == BOW)
353 op->stats.sp += lmt->sp; 394 op->stats.sp += lmt->sp;
354 if (op->stats.wc && IS_WEAPON(op)) 395 if (op->stats.wc && op->is_weapon ())
355 op->stats.wc += lmt->wc; 396 op->stats.wc += lmt->wc;
356 if (IS_ARMOR(op)) { 397 if (op->is_armor ())
398 {
357 if (op->stats.ac) 399 if (op->stats.ac)
358 op->stats.ac += lmt->ac; 400 op->stats.ac += lmt->ac;
359 for (j=0; j < NROFATTACKS; j++) 401 for (j = 0; j < NROFATTACKS; j++)
360 if (op->resist[j] != 0) { 402 if (op->resist[j] != 0)
403 {
361 op->resist[j] += lmt->mod[j]; 404 op->resist[j] += lmt->mod[j];
362 if (op->resist[j] > 100) 405 if (op->resist[j] > 100)
363 op->resist[j] = 100; 406 op->resist[j] = 100;
364 if (op->resist[j] < -100) 407 if (op->resist[j] < -100)
365 op->resist[j] = -100; 408 op->resist[j] = -100;
366 } 409 }
367 } 410 }
368 op->materialname = add_string(lmt->name); 411 op->materialname = add_string (lmt->name);
369 /* dont make it unstackable if it doesn't need to be */ 412 /* dont make it unstackable if it doesn't need to be */
370 if (IS_WEAPON(op) || IS_ARMOR(op)) { 413 if (op->is_weapon () || op->is_armor ())
414 {
371 op->weight = (op->weight * lmt->weight)/100; 415 op->weight = (op->weight * lmt->weight) / 100;
372 op->value = (op->value * lmt->value)/100; 416 op->value = (op->value * lmt->value) / 100;
373 } 417 }
374#endif 418#endif
375 } 419 }
376} 420}
377 421
378/* 422/*
379 * Strip out the media tags from a String. 423 * Strip out the media tags from a String.
380 * Warning the input string will contain the result string 424 * Warning the input string will contain the result string
381 */ 425 */
426void
382void strip_media_tag(char *message){ 427strip_media_tag (char *message)
428{
383 int in_tag=0; 429 int in_tag = 0;
384 char* dest; 430 char *dest;
385 char* src; 431 char *src;
432
386 src=dest=message; 433 src = dest = message;
387 while (*src!='\0'){ 434 while (*src != '\0')
435 {
388 if (*src=='['){ 436 if (*src == '[')
437 {
389 in_tag=1; 438 in_tag = 1;
439 }
390 } else if (in_tag && (*src==']')) 440 else if (in_tag && (*src == ']'))
391 in_tag=0; 441 in_tag = 0;
392 else if (!in_tag){ 442 else if (!in_tag)
443 {
393 *dest=*src; 444 *dest = *src;
394 dest++; 445 dest++;
395 } 446 }
396 src++; 447 src++;
397 } 448 }
398 *dest='\0'; 449 *dest = '\0';
399} 450}
400 451
452const char *
401const char* strrstr(const char* haystack, const char* needle){ 453strrstr (const char *haystack, const char *needle)
454{
402 const char* lastneedle; 455 const char *lastneedle;
456
403 lastneedle=NULL; 457 lastneedle = NULL;
404 while((haystack=strstr(haystack,needle))!=NULL){ 458 while ((haystack = strstr (haystack, needle)) != NULL)
459 {
405 lastneedle=haystack; 460 lastneedle = haystack;
406 haystack++; 461 haystack++;
407 } 462 }
408 return lastneedle; 463 return lastneedle;
409 464
410} 465}
466
411#define EOL_SIZE (sizeof("\n")-1) 467#define EOL_SIZE (sizeof("\n")-1)
468void
412void strip_endline(char* buf){ 469strip_endline (char *buf)
470{
413 if (strlen(buf)<sizeof("\n")){ 471 if (strlen (buf) < sizeof ("\n"))
472 {
414 return; 473 return;
415 } 474 }
416 if (!strcmp(buf+strlen(buf)-EOL_SIZE,"\n")) 475 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
417 buf[strlen(buf)-EOL_SIZE]='\0'; 476 buf[strlen (buf) - EOL_SIZE] = '\0';
418} 477}
419 478
420/** 479/**
421 * Replace in string src all occurrences of key by replacement. The resulting 480 * Replace in string src all occurrences of key by replacement. The resulting
422 * string is put into result; at most resultsize characters (including the 481 * string is put into result; at most resultsize characters (including the
423 * terminating null character) will be written to result. 482 * terminating null character) will be written to result.
424 */ 483 */
484void
425void replace(const char *src, const char *key, const char *replacement, char *result, size_t resultsize) 485replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
426{ 486{
427 size_t resultlen; 487 size_t resultlen;
428 size_t keylen; 488 size_t keylen;
429 489
430 /* special case to prevent infinite loop if key==replacement=="" */ 490 /* special case to prevent infinite loop if key==replacement=="" */
431 if(strcmp(key, replacement) == 0) 491 if (strcmp (key, replacement) == 0)
432 { 492 {
433 snprintf(result, resultsize, "%s", src); 493 snprintf (result, resultsize, "%s", src);
434 return; 494 return;
435 } 495 }
436 496
437 keylen = strlen(key); 497 keylen = strlen (key);
438 498
439 resultlen = 0; 499 resultlen = 0;
440 while(*src != '\0' && resultlen+1 < resultsize) 500 while (*src != '\0' && resultlen + 1 < resultsize)
441 { 501 {
442 if(strncmp(src, key, keylen) == 0) 502 if (strncmp (src, key, keylen) == 0)
443 { 503 {
444 snprintf(result+resultlen, resultsize-resultlen, "%s", replacement); 504 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
445 resultlen += strlen(result+resultlen); 505 resultlen += strlen (result + resultlen);
446 src += keylen; 506 src += keylen;
447 } 507 }
448 else 508 else
449 {
450 result[resultlen++] = *src++;
451 }
452 } 509 {
510 result[resultlen++] = *src++;
511 }
512 }
453 result[resultlen] = '\0'; 513 result[resultlen] = '\0';
454} 514}
455 515
456/** 516/**
457 * Taking a string as an argument, mutate it into a string that looks like a list. 517 * 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 518 * 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. 519 * 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. 520 * This function will also strip all trailing non alphanumeric characters.
461 * It does not insert an oxford comma. 521 * It does not insert an oxford comma.
462 */ 522 */
463 523
524void
464void make_list_like(char *input) { 525make_list_like (char *input)
526{
465 char *p, tmp[MAX_BUF]; 527 char *p, tmp[MAX_BUF];
466 int i; 528 int i;
529
467 if (!input || strlen(input) > MAX_BUF-5) return; 530 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; 531 return;
486} 532 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
487 533
488//TODO: overhead due to specifying size twice 534 strncpy (tmp, input, MAX_BUF - 5);
535 /*trim all trailing commas, spaces etc. */
536 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
537 tmp[i] = '\0';
538
539 strcat (tmp, ".");
540
541 p = strrchr (tmp, ',');
542 if (p)
543 {
544 *p = '\0';
545 strcpy (input, tmp);
546 p++;
547 strcat (input, " and");
548 strcat (input, p);
549 }
550 else
551 strcpy (input, tmp);
552
553 return;
554}
555
556/////////////////////////////////////////////////////////////////////////////
557
489void * 558void
490zero_initialised::operator new (size_t s) 559fork_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{ 560{
504 g_slice_free1 (s, p); 561 if (!fork ())
505} 562 {
563 signal (SIGABRT, SIG_DFL);
564 abort ();
565 }
506 566
507void 567 LOG (llevError, "fork abort: %s\n", msg);
508zero_initialised::operator delete [] (void *p, size_t s)
509{
510 g_slice_free1 (s, p);
511} 568}
512 569
570void *salloc_ (int n) throw (std::bad_alloc)
571{
572 void *ptr = g_slice_alloc (n);
573
574 if (!ptr)
575 throw std::bad_alloc ();
576
577 return ptr;
578}
579
580void *salloc_ (int n, void *src) throw (std::bad_alloc)
581{
582 void *ptr = salloc_ (n);
583
584 if (src)
585 memcpy (ptr, src, n);
586 else
587 memset (ptr, 0, n);
588
589 return ptr;
590}
591
592void assign (char *dst, const char *src, int maxlen)
593{
594 if (!src)
595 src = "";
596
597 int len = strlen (src);
598
599 if (len >= maxlen - 1)
600 {
601 if (maxlen <= 4)
602 {
603 memset (dst, '.', maxlen - 1);
604 dst [maxlen - 1] = 0;
605 }
606 else
607 {
608 memcpy (dst, src, maxlen - 4);
609 memcpy (dst + maxlen - 4, "...", 4);
610 }
611 }
612 else
613 memcpy (dst, src, len + 1);
614}
615
616tstamp now ()
617{
618 struct timeval tv;
619
620 gettimeofday (&tv, 0);
621 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
622}
623
624int
625similar_direction (int a, int b)
626{
627 if (!a || !b)
628 return 0;
629
630 int diff = (b - a) & 7;
631 return diff <= 1 || diff >= 7;
632}
633

Diff Legend

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