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

Diff Legend

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