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.2 by root, Tue Aug 29 08:01:36 2006 UTC vs.
Revision 1.20 by root, Mon Dec 11 21:32:16 2006 UTC

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

Diff Legend

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