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.8 by root, Sat Sep 9 21:48:28 2006 UTC vs.
Revision 1.34 by root, Mon Jan 1 12:28:46 2007 UTC

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

Diff Legend

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