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.3 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.30 by root, Mon Dec 25 14:43:23 2006 UTC

1/*
2 * static char *rcsid_utils_c =
3 * "$Id: utils.C,v 1.3 2006/09/03 00:18:40 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>
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));
172 }
164 } else { 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 persihable items in a map */
190 201
202void
191void decay_objects(mapstruct *m) 203decay_objects (maptile *m)
192{ 204{
193 int x, y, destroy; 205 int x, y, destroy;
194 object *op, *otmp; 206 object *op, *otmp;
195 207
196 if (m->unique) 208 if (m->unique)
197 return; 209 return;
198 210
199 for (x=0; x < MAP_WIDTH(m); x++) 211 for (x = 0; x < m->width; x++)
200 for (y=0; y < MAP_HEIGHT(m); y++) 212 for (y = 0; y < m->height; y++)
201 for (op = get_map_ob(m, x, y); op; op = otmp) { 213 for (op = GET_MAP_OB (m, x, y); op; op = otmp)
214 {
215 destroy = 0;
216 otmp = op->above;
217 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
218 break;
219 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
220 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
221 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
222 || QUERY_FLAG (op, FLAG_UNIQUE)
223 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
224 || QUERY_FLAG (op, FLAG_UNPAID)
225 || op->is_alive ())
226 continue;
227
228 /* otherwise, we decay and destroy */
229 if (op->is_weapon ())
230 {
231 op->stats.dam--;
232 if (op->stats.dam < 0)
202 destroy = 0; 233 destroy = 1;
203 otmp = op->above;
204 if (QUERY_FLAG(op,FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE))
205 break;
206 if (QUERY_FLAG(op, FLAG_IS_FLOOR) ||
207 QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) ||
208 QUERY_FLAG(op, FLAG_OBJ_SAVE_ON_OVL) ||
209 QUERY_FLAG(op, FLAG_UNIQUE) ||
210 QUERY_FLAG(op, FLAG_OVERLAY_FLOOR) ||
211 QUERY_FLAG(op, FLAG_UNPAID) || IS_LIVE(op))
212 continue;
213 /* otherwise, we decay and destroy */
214 if (IS_WEAPON(op)) {
215 op->stats.dam--;
216 if (op->stats.dam < 0)
217 destroy = 1;
218 } else if (IS_ARMOR(op)) {
219 op->stats.ac--;
220 if (op->stats.ac < 0)
221 destroy = 1;
222 } else if (op->type == FOOD) {
223 op->stats.food -= rndm(5,20);
224 if (op->stats.food < 0)
225 destroy = 1;
226 } else {
227 if (op->material & M_PAPER || op->material & M_LEATHER ||
228 op->material & M_WOOD || op->material & M_ORGANIC ||
229 op->material & M_CLOTH || op->material & M_LIQUID)
230 destroy = 1;
231 if (op->material & M_IRON && rndm(1,5) == 1)
232 destroy = 1;
233 if (op->material & M_GLASS && rndm(1,2) == 1)
234 destroy = 1;
235 if ((op->material & M_STONE || op->material & M_ADAMANT) &&
236 rndm(1,10) == 1)
237 destroy = 1;
238 if ((op->material & M_SOFT_METAL || op->material & M_BONE) &&
239 rndm(1,3) == 1)
240 destroy = 1;
241 if (op->material & M_ICE && MAP_TEMP(m) > 32)
242 destroy = 1;
243 }
244 /* adjust overall chance below */
245 if (destroy && rndm(0, 1)) {
246 remove_ob(op);
247 free_object(op);
248 }
249 } 234 }
235 else if (op->is_armor ())
236 {
237 op->stats.ac--;
238 if (op->stats.ac < 0)
239 destroy = 1;
240 }
241 else if (op->type == FOOD)
242 {
243 op->stats.food -= rndm (5, 20);
244 if (op->stats.food < 0)
245 destroy = 1;
246 }
247 else
248 {
249 if (op->material & M_PAPER || op->material & M_LEATHER ||
250 op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID)
251 destroy = 1;
252 if (op->material & M_IRON && rndm (1, 5) == 1)
253 destroy = 1;
254 if (op->material & M_GLASS && rndm (1, 2) == 1)
255 destroy = 1;
256 if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1)
257 destroy = 1;
258 if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1)
259 destroy = 1;
260 if (op->material & M_ICE && MAP_TEMP (m) > 32)
261 destroy = 1;
262 }
263 /* adjust overall chance below */
264 if (destroy && rndm (0, 1))
265 op->destroy ();
266 }
250} 267}
251 268
252/* convert materialname to materialtype_t */ 269/* convert materialname to materialtype_t */
253 270
271materialtype_t *
254materialtype_t *name_to_material(const char *name) 272name_to_material (const char *name)
255{ 273{
256 materialtype_t *mt, *nmt; 274 materialtype_t *mt, *nmt;
257 275
258 mt = NULL; 276 mt = NULL;
259 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt=nmt->next) { 277 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
278 {
260 if (strcmp(name, nmt->name) == 0) { 279 if (strcmp (name, nmt->name) == 0)
280 {
261 mt = nmt; 281 mt = nmt;
262 break; 282 break;
263 } 283 }
264 } 284 }
265 return mt; 285 return mt;
266} 286}
267 287
268/* when doing transmutation of objects, we have to recheck the resistances, 288/* when doing transmutation of objects, we have to recheck the resistances,
269 * as some that did not apply previously, may apply now. 289 * as some that did not apply previously, may apply now.
270 */ 290 */
271 291
292void
272void transmute_materialname(object *op, const object *change) 293transmute_materialname (object *op, const object *change)
273{ 294{
274 materialtype_t *mt; 295 materialtype_t *mt;
275 int j; 296 int j;
276 297
277 if (op->materialname == NULL) 298 if (op->materialname == NULL)
278 return; 299 return;
279 300
280 if (change->materialname != NULL && 301 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
281 strcmp(op->materialname, change->materialname))
282 return; 302 return;
283 303
284 if (!IS_ARMOR(op)) 304 if (!op->is_armor ())
285 return; 305 return;
286 306
287 mt = name_to_material(op->materialname); 307 mt = name_to_material (op->materialname);
288 if (!mt) { 308 if (!mt)
309 {
289 LOG(llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname); 310 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
290 return; 311 return;
291 } 312 }
292 313
293 for (j=0; j < NROFATTACKS; j++) 314 for (j = 0; j < NROFATTACKS; j++)
294 if (op->resist[j] == 0 && change->resist[j] != 0) { 315 if (op->resist[j] == 0 && change->resist[j] != 0)
316 {
295 op->resist[j] += mt->mod[j]; 317 op->resist[j] += mt->mod[j];
296 if (op->resist[j] > 100) 318 if (op->resist[j] > 100)
297 op->resist[j] = 100; 319 op->resist[j] = 100;
298 if (op->resist[j] < -100) 320 if (op->resist[j] < -100)
299 op->resist[j] = -100; 321 op->resist[j] = -100;
300 } 322 }
301} 323}
302 324
303/* set the materialname and type for an item */ 325/* set the materialname and type for an item */
326void
304void set_materialname(object *op, int difficulty, materialtype_t *nmt) 327set_materialname (object *op, int difficulty, materialtype_t *nmt)
305{ 328{
306 materialtype_t *mt, *lmt; 329 materialtype_t *mt, *lmt;
330
331#ifdef NEW_MATERIAL_CODE
307 int j; 332 int j;
333#endif
308 334
309 if (op->materialname != NULL) 335 if (op->materialname != NULL)
310 return; 336 return;
311 337
312 338
313 339
314 if (nmt == NULL) { 340 if (nmt == NULL)
341 {
315 lmt = NULL; 342 lmt = NULL;
316#ifndef NEW_MATERIAL_CODE 343#ifndef NEW_MATERIAL_CODE
317 for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) { 344 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
345 {
318 if (op->material & mt->material) { 346 if (op->material & mt->material)
347 {
319 lmt = mt; 348 lmt = mt;
349 break;
350 }
351 }
352
353#else
354 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
355 {
356 if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
357 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
358 {
359 lmt = mt;
360 if (!(op->is_weapon () || op->is_armor ()))
320 break; 361 break;
321 } 362 }
322 } 363 }
364#endif
365 }
366 else
367 {
368 lmt = nmt;
369 }
323 370
371 if (lmt != NULL)
372 {
373#ifndef NEW_MATERIAL_CODE
374 op->materialname = lmt->name;
375 return;
324#else 376#else
325 for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) { 377
326 if (op->material & mt->material && rndm(1, 100) <= mt->chance && 378 if (op->stats.dam && op->is_weapon ())
327 difficulty >= mt->difficulty &&
328 (op->magic >= mt->magic || mt->magic == 0)) {
329 lmt = mt;
330 if (!(IS_WEAPON(op) || IS_ARMOR(op)))
331 break;
332 }
333 } 379 {
334#endif
335 } else {
336 lmt = nmt;
337 }
338
339 if (lmt != NULL) {
340#ifndef NEW_MATERIAL_CODE
341 op->materialname = lmt->name;
342 return;
343#else
344
345 if (op->stats.dam && IS_WEAPON(op)) {
346 op->stats.dam += lmt->damage; 380 op->stats.dam += lmt->damage;
347 if (op->stats.dam < 1) 381 if (op->stats.dam < 1)
348 op->stats.dam = 1; 382 op->stats.dam = 1;
349 } 383 }
350 if (op->stats.sp && op->type == BOW) 384 if (op->stats.sp && op->type == BOW)
351 op->stats.sp += lmt->sp; 385 op->stats.sp += lmt->sp;
352 if (op->stats.wc && IS_WEAPON(op)) 386 if (op->stats.wc && op->is_weapon ())
353 op->stats.wc += lmt->wc; 387 op->stats.wc += lmt->wc;
354 if (IS_ARMOR(op)) { 388 if (op->is_armor ())
389 {
355 if (op->stats.ac) 390 if (op->stats.ac)
356 op->stats.ac += lmt->ac; 391 op->stats.ac += lmt->ac;
357 for (j=0; j < NROFATTACKS; j++) 392 for (j = 0; j < NROFATTACKS; j++)
358 if (op->resist[j] != 0) { 393 if (op->resist[j] != 0)
394 {
359 op->resist[j] += lmt->mod[j]; 395 op->resist[j] += lmt->mod[j];
360 if (op->resist[j] > 100) 396 if (op->resist[j] > 100)
361 op->resist[j] = 100; 397 op->resist[j] = 100;
362 if (op->resist[j] < -100) 398 if (op->resist[j] < -100)
363 op->resist[j] = -100; 399 op->resist[j] = -100;
364 } 400 }
365 } 401 }
366 op->materialname = add_string(lmt->name); 402 op->materialname = add_string (lmt->name);
367 /* dont make it unstackable if it doesn't need to be */ 403 /* dont make it unstackable if it doesn't need to be */
368 if (IS_WEAPON(op) || IS_ARMOR(op)) { 404 if (op->is_weapon () || op->is_armor ())
405 {
369 op->weight = (op->weight * lmt->weight)/100; 406 op->weight = (op->weight * lmt->weight) / 100;
370 op->value = (op->value * lmt->value)/100; 407 op->value = (op->value * lmt->value) / 100;
371 } 408 }
372#endif 409#endif
373 } 410 }
374} 411}
375 412
376/* 413/*
377 * Strip out the media tags from a String. 414 * Strip out the media tags from a String.
378 * Warning the input string will contain the result string 415 * Warning the input string will contain the result string
379 */ 416 */
417void
380void strip_media_tag(char *message){ 418strip_media_tag (char *message)
419{
381 int in_tag=0; 420 int in_tag = 0;
382 char* dest; 421 char *dest;
383 char* src; 422 char *src;
423
384 src=dest=message; 424 src = dest = message;
385 while (*src!='\0'){ 425 while (*src != '\0')
426 {
386 if (*src=='['){ 427 if (*src == '[')
428 {
387 in_tag=1; 429 in_tag = 1;
430 }
388 } else if (in_tag && (*src==']')) 431 else if (in_tag && (*src == ']'))
389 in_tag=0; 432 in_tag = 0;
390 else if (!in_tag){ 433 else if (!in_tag)
434 {
391 *dest=*src; 435 *dest = *src;
392 dest++; 436 dest++;
393 } 437 }
394 src++; 438 src++;
395 } 439 }
396 *dest='\0'; 440 *dest = '\0';
397} 441}
398 442
443const char *
399const char* strrstr(const char* haystack, const char* needle){ 444strrstr (const char *haystack, const char *needle)
445{
400 const char* lastneedle; 446 const char *lastneedle;
447
401 lastneedle=NULL; 448 lastneedle = NULL;
402 while((haystack=strstr(haystack,needle))!=NULL){ 449 while ((haystack = strstr (haystack, needle)) != NULL)
450 {
403 lastneedle=haystack; 451 lastneedle = haystack;
404 haystack++; 452 haystack++;
405 } 453 }
406 return lastneedle; 454 return lastneedle;
407 455
408} 456}
457
409#define EOL_SIZE (sizeof("\n")-1) 458#define EOL_SIZE (sizeof("\n")-1)
459void
410void strip_endline(char* buf){ 460strip_endline (char *buf)
461{
411 if (strlen(buf)<sizeof("\n")){ 462 if (strlen (buf) < sizeof ("\n"))
463 {
412 return; 464 return;
413 } 465 }
414 if (!strcmp(buf+strlen(buf)-EOL_SIZE,"\n")) 466 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
415 buf[strlen(buf)-EOL_SIZE]='\0'; 467 buf[strlen (buf) - EOL_SIZE] = '\0';
416} 468}
417 469
418/** 470/**
419 * Replace in string src all occurrences of key by replacement. The resulting 471 * Replace in string src all occurrences of key by replacement. The resulting
420 * string is put into result; at most resultsize characters (including the 472 * string is put into result; at most resultsize characters (including the
421 * terminating null character) will be written to result. 473 * terminating null character) will be written to result.
422 */ 474 */
475void
423void replace(const char *src, const char *key, const char *replacement, char *result, size_t resultsize) 476replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
424{ 477{
425 size_t resultlen; 478 size_t resultlen;
426 size_t keylen; 479 size_t keylen;
427 480
428 /* special case to prevent infinite loop if key==replacement=="" */ 481 /* special case to prevent infinite loop if key==replacement=="" */
429 if(strcmp(key, replacement) == 0) 482 if (strcmp (key, replacement) == 0)
430 { 483 {
431 snprintf(result, resultsize, "%s", src); 484 snprintf (result, resultsize, "%s", src);
432 return; 485 return;
433 } 486 }
434 487
435 keylen = strlen(key); 488 keylen = strlen (key);
436 489
437 resultlen = 0; 490 resultlen = 0;
438 while(*src != '\0' && resultlen+1 < resultsize) 491 while (*src != '\0' && resultlen + 1 < resultsize)
439 { 492 {
440 if(strncmp(src, key, keylen) == 0) 493 if (strncmp (src, key, keylen) == 0)
441 { 494 {
442 snprintf(result+resultlen, resultsize-resultlen, "%s", replacement); 495 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
443 resultlen += strlen(result+resultlen); 496 resultlen += strlen (result + resultlen);
444 src += keylen; 497 src += keylen;
445 } 498 }
446 else 499 else
447 {
448 result[resultlen++] = *src++;
449 }
450 } 500 {
501 result[resultlen++] = *src++;
502 }
503 }
451 result[resultlen] = '\0'; 504 result[resultlen] = '\0';
452} 505}
453 506
454/** 507/**
455 * Taking a string as an argument, mutate it into a string that looks like a list. 508 * 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 509 * 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. 510 * 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. 511 * This function will also strip all trailing non alphanumeric characters.
459 * It does not insert an oxford comma. 512 * It does not insert an oxford comma.
460 */ 513 */
461 514
515void
462void make_list_like(char *input) { 516make_list_like (char *input)
517{
463 char *p, tmp[MAX_BUF]; 518 char *p, tmp[MAX_BUF];
464 int i; 519 int i;
520
465 if (!input || strlen(input) > MAX_BUF-5) return; 521 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; 522 return;
484} 523 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
485 524
486void * 525 strncpy (tmp, input, MAX_BUF - 5);
487zero_initialised::operator new (size_t s) 526 /*trim all trailing commas, spaces etc. */
488{ 527 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
528 tmp[i] = '\0';
529
530 strcat (tmp, ".");
531
532 p = strrchr (tmp, ',');
533 if (p)
534 {
535 *p = '\0';
536 strcpy (input, tmp);
537 p++;
538 strcat (input, " and");
539 strcat (input, p);
540 }
541 else
542 strcpy (input, tmp);
543
544 return;
545}
546
547/////////////////////////////////////////////////////////////////////////////
548
549void *salloc_ (int n) throw (std::bad_alloc)
550{
489 void *p = malloc (s); 551 void *ptr = g_slice_alloc (n);
490 552
491 memset (p, 0, s); 553 if (!ptr)
554 throw std::bad_alloc ();
555
492 return p; 556 return ptr;
493} 557}
494 558
495void 559void *salloc_ (int n, void *src) throw (std::bad_alloc)
496zero_initialised::operator delete (void *p, size_t s)
497{ 560{
498 free (p); 561 void *ptr = salloc_ (n);
499}
500 562
563 if (src)
564 memcpy (ptr, src, n);
565 else
566 memset (ptr, 0, n);
567
568 return ptr;
569}
570
571void assign (char *dst, const char *src, int maxlen)
572{
573 if (!src)
574 src = "";
575
576 int len = strlen (src);
577
578 if (len >= maxlen - 1)
579 {
580 if (maxlen <= 4)
581 {
582 memset (dst, '.', maxlen - 1);
583 dst [maxlen - 1] = 0;
584 }
585 else
586 {
587 memcpy (dst, src, maxlen - 4);
588 memcpy (dst + maxlen - 4, "...", 4);
589 }
590 }
591 else
592 memcpy (dst, src, len + 1);
593}
594
595tstamp now ()
596{
597 struct timeval tv;
598
599 gettimeofday (&tv, 0);
600 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
601}
602

Diff Legend

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