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

Diff Legend

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