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.1 by elmex, Sun Aug 13 17:16:01 2006 UTC vs.
Revision 1.35 by root, Mon Jan 1 13:31:46 2007 UTC

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

Diff Legend

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