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.7 by root, Fri Sep 8 17:34:02 2006 UTC vs.
Revision 1.32 by root, Sat Dec 30 10:16:10 2006 UTC

1/*
2 * static char *rcsid_utils_c =
3 * "$Id: utils.C,v 1.7 2006/09/08 17:34:02 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 201void
193void decay_objects(mapstruct *m) 202maptile::decay_objects ()
194{ 203{
195 int x, y, destroy; 204 int x, y, destroy;
196 object *op, *otmp; 205 object *op, *otmp;
197 206
198 if (m->unique) 207 for (x = 0; x < width; x++)
199 return; 208 for (y = 0; y < height; y++)
200
201 for (x=0; x < MAP_WIDTH(m); x++)
202 for (y=0; y < MAP_HEIGHT(m); y++)
203 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)
204 destroy = 0; 231 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 } 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 }
252} 271}
253 272
254/* convert materialname to materialtype_t */ 273/* convert materialname to materialtype_t */
255 274
275materialtype_t *
256materialtype_t *name_to_material(const char *name) 276name_to_material (const char *name)
257{ 277{
258 materialtype_t *mt, *nmt; 278 materialtype_t *mt, *nmt;
259 279
260 mt = NULL; 280 mt = NULL;
261 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt=nmt->next) { 281 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
282 {
262 if (strcmp(name, nmt->name) == 0) { 283 if (strcmp (name, nmt->name) == 0)
284 {
263 mt = nmt; 285 mt = nmt;
264 break; 286 break;
265 } 287 }
266 } 288 }
267 return mt; 289 return mt;
268} 290}
269 291
270/* when doing transmutation of objects, we have to recheck the resistances, 292/* when doing transmutation of objects, we have to recheck the resistances,
271 * as some that did not apply previously, may apply now. 293 * as some that did not apply previously, may apply now.
272 */ 294 */
273 295
296void
274void transmute_materialname(object *op, const object *change) 297transmute_materialname (object *op, const object *change)
275{ 298{
276 materialtype_t *mt; 299 materialtype_t *mt;
277 int j; 300 int j;
278 301
279 if (op->materialname == NULL) 302 if (op->materialname == NULL)
280 return; 303 return;
281 304
282 if (change->materialname != NULL && 305 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
283 strcmp(op->materialname, change->materialname))
284 return; 306 return;
285 307
286 if (!IS_ARMOR(op)) 308 if (!op->is_armor ())
287 return; 309 return;
288 310
289 mt = name_to_material(op->materialname); 311 mt = name_to_material (op->materialname);
290 if (!mt) { 312 if (!mt)
313 {
291 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);
292 return; 315 return;
293 } 316 }
294 317
295 for (j=0; j < NROFATTACKS; j++) 318 for (j = 0; j < NROFATTACKS; j++)
296 if (op->resist[j] == 0 && change->resist[j] != 0) { 319 if (op->resist[j] == 0 && change->resist[j] != 0)
320 {
297 op->resist[j] += mt->mod[j]; 321 op->resist[j] += mt->mod[j];
298 if (op->resist[j] > 100) 322 if (op->resist[j] > 100)
299 op->resist[j] = 100; 323 op->resist[j] = 100;
300 if (op->resist[j] < -100) 324 if (op->resist[j] < -100)
301 op->resist[j] = -100; 325 op->resist[j] = -100;
302 } 326 }
303} 327}
304 328
305/* set the materialname and type for an item */ 329/* set the materialname and type for an item */
330void
306void set_materialname(object *op, int difficulty, materialtype_t *nmt) 331set_materialname (object *op, int difficulty, materialtype_t *nmt)
307{ 332{
308 materialtype_t *mt, *lmt; 333 materialtype_t *mt, *lmt;
334
309#ifdef NEW_MATERIAL_CODE 335#ifdef NEW_MATERIAL_CODE
310 int j; 336 int j;
311#endif 337#endif
312 338
313 if (op->materialname != NULL) 339 if (op->materialname != NULL)
314 return; 340 return;
315 341
316 342
317 343
318 if (nmt == NULL) { 344 if (nmt == NULL)
345 {
319 lmt = NULL; 346 lmt = NULL;
320#ifndef NEW_MATERIAL_CODE 347#ifndef NEW_MATERIAL_CODE
321 for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) { 348 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
349 {
322 if (op->material & mt->material) { 350 if (op->material & mt->material)
351 {
323 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 ()))
324 break; 365 break;
325 } 366 }
326 } 367 }
368#endif
369 }
370 else
371 {
372 lmt = nmt;
373 }
327 374
375 if (lmt != NULL)
376 {
377#ifndef NEW_MATERIAL_CODE
378 op->materialname = lmt->name;
379 return;
328#else 380#else
329 for (mt = materialt; mt != NULL && mt->next != NULL; mt=mt->next) { 381
330 if (op->material & mt->material && rndm(1, 100) <= mt->chance && 382 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 } 383 {
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; 384 op->stats.dam += lmt->damage;
351 if (op->stats.dam < 1) 385 if (op->stats.dam < 1)
352 op->stats.dam = 1; 386 op->stats.dam = 1;
353 } 387 }
354 if (op->stats.sp && op->type == BOW) 388 if (op->stats.sp && op->type == BOW)
355 op->stats.sp += lmt->sp; 389 op->stats.sp += lmt->sp;
356 if (op->stats.wc && IS_WEAPON(op)) 390 if (op->stats.wc && op->is_weapon ())
357 op->stats.wc += lmt->wc; 391 op->stats.wc += lmt->wc;
358 if (IS_ARMOR(op)) { 392 if (op->is_armor ())
393 {
359 if (op->stats.ac) 394 if (op->stats.ac)
360 op->stats.ac += lmt->ac; 395 op->stats.ac += lmt->ac;
361 for (j=0; j < NROFATTACKS; j++) 396 for (j = 0; j < NROFATTACKS; j++)
362 if (op->resist[j] != 0) { 397 if (op->resist[j] != 0)
398 {
363 op->resist[j] += lmt->mod[j]; 399 op->resist[j] += lmt->mod[j];
364 if (op->resist[j] > 100) 400 if (op->resist[j] > 100)
365 op->resist[j] = 100; 401 op->resist[j] = 100;
366 if (op->resist[j] < -100) 402 if (op->resist[j] < -100)
367 op->resist[j] = -100; 403 op->resist[j] = -100;
368 } 404 }
369 } 405 }
370 op->materialname = add_string(lmt->name); 406 op->materialname = add_string (lmt->name);
371 /* dont make it unstackable if it doesn't need to be */ 407 /* dont make it unstackable if it doesn't need to be */
372 if (IS_WEAPON(op) || IS_ARMOR(op)) { 408 if (op->is_weapon () || op->is_armor ())
409 {
373 op->weight = (op->weight * lmt->weight)/100; 410 op->weight = (op->weight * lmt->weight) / 100;
374 op->value = (op->value * lmt->value)/100; 411 op->value = (op->value * lmt->value) / 100;
375 } 412 }
376#endif 413#endif
377 } 414 }
378} 415}
379 416
380/* 417/*
381 * Strip out the media tags from a String. 418 * Strip out the media tags from a String.
382 * Warning the input string will contain the result string 419 * Warning the input string will contain the result string
383 */ 420 */
421void
384void strip_media_tag(char *message){ 422strip_media_tag (char *message)
423{
385 int in_tag=0; 424 int in_tag = 0;
386 char* dest; 425 char *dest;
387 char* src; 426 char *src;
427
388 src=dest=message; 428 src = dest = message;
389 while (*src!='\0'){ 429 while (*src != '\0')
430 {
390 if (*src=='['){ 431 if (*src == '[')
432 {
391 in_tag=1; 433 in_tag = 1;
434 }
392 } else if (in_tag && (*src==']')) 435 else if (in_tag && (*src == ']'))
393 in_tag=0; 436 in_tag = 0;
394 else if (!in_tag){ 437 else if (!in_tag)
438 {
395 *dest=*src; 439 *dest = *src;
396 dest++; 440 dest++;
397 } 441 }
398 src++; 442 src++;
399 } 443 }
400 *dest='\0'; 444 *dest = '\0';
401} 445}
402 446
447const char *
403const char* strrstr(const char* haystack, const char* needle){ 448strrstr (const char *haystack, const char *needle)
449{
404 const char* lastneedle; 450 const char *lastneedle;
451
405 lastneedle=NULL; 452 lastneedle = NULL;
406 while((haystack=strstr(haystack,needle))!=NULL){ 453 while ((haystack = strstr (haystack, needle)) != NULL)
454 {
407 lastneedle=haystack; 455 lastneedle = haystack;
408 haystack++; 456 haystack++;
409 } 457 }
410 return lastneedle; 458 return lastneedle;
411 459
412} 460}
461
413#define EOL_SIZE (sizeof("\n")-1) 462#define EOL_SIZE (sizeof("\n")-1)
463void
414void strip_endline(char* buf){ 464strip_endline (char *buf)
465{
415 if (strlen(buf)<sizeof("\n")){ 466 if (strlen (buf) < sizeof ("\n"))
467 {
416 return; 468 return;
417 } 469 }
418 if (!strcmp(buf+strlen(buf)-EOL_SIZE,"\n")) 470 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
419 buf[strlen(buf)-EOL_SIZE]='\0'; 471 buf[strlen (buf) - EOL_SIZE] = '\0';
420} 472}
421 473
422/** 474/**
423 * 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
424 * string is put into result; at most resultsize characters (including the 476 * string is put into result; at most resultsize characters (including the
425 * terminating null character) will be written to result. 477 * terminating null character) will be written to result.
426 */ 478 */
479void
427void 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)
428{ 481{
429 size_t resultlen; 482 size_t resultlen;
430 size_t keylen; 483 size_t keylen;
431 484
432 /* special case to prevent infinite loop if key==replacement=="" */ 485 /* special case to prevent infinite loop if key==replacement=="" */
433 if(strcmp(key, replacement) == 0) 486 if (strcmp (key, replacement) == 0)
434 { 487 {
435 snprintf(result, resultsize, "%s", src); 488 snprintf (result, resultsize, "%s", src);
436 return; 489 return;
437 } 490 }
438 491
439 keylen = strlen(key); 492 keylen = strlen (key);
440 493
441 resultlen = 0; 494 resultlen = 0;
442 while(*src != '\0' && resultlen+1 < resultsize) 495 while (*src != '\0' && resultlen + 1 < resultsize)
443 { 496 {
444 if(strncmp(src, key, keylen) == 0) 497 if (strncmp (src, key, keylen) == 0)
445 { 498 {
446 snprintf(result+resultlen, resultsize-resultlen, "%s", replacement); 499 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
447 resultlen += strlen(result+resultlen); 500 resultlen += strlen (result + resultlen);
448 src += keylen; 501 src += keylen;
449 } 502 }
450 else 503 else
451 {
452 result[resultlen++] = *src++;
453 }
454 } 504 {
505 result[resultlen++] = *src++;
506 }
507 }
455 result[resultlen] = '\0'; 508 result[resultlen] = '\0';
456} 509}
457 510
458/** 511/**
459 * 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.
460 * 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
461 * 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.
462 * This function will also strip all trailing non alphanumeric characters. 515 * This function will also strip all trailing non alphanumeric characters.
463 * It does not insert an oxford comma. 516 * It does not insert an oxford comma.
464 */ 517 */
465 518
519void
466void make_list_like(char *input) { 520make_list_like (char *input)
521{
467 char *p, tmp[MAX_BUF]; 522 char *p, tmp[MAX_BUF];
468 int i; 523 int i;
524
469 if (!input || strlen(input) > MAX_BUF-5) return; 525 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; 526 return;
488} 527 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
489 528
490void * 529 strncpy (tmp, input, MAX_BUF - 5);
491zero_initialised::operator new (size_t s) 530 /*trim all trailing commas, spaces etc. */
492{ 531 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
493 return g_slice_alloc0 (s); 532 tmp[i] = '\0';
494}
495 533
496void * 534 strcat (tmp, ".");
497zero_initialised::operator new [] (size_t s)
498{
499 return g_slice_alloc0 (s);
500}
501 535
502void 536 p = strrchr (tmp, ',');
503zero_initialised::operator delete (void *p, size_t s) 537 if (p)
504{ 538 {
505 g_slice_free1 (s, p); 539 *p = '\0';
506} 540 strcpy (input, tmp);
541 p++;
542 strcat (input, " and");
543 strcat (input, p);
544 }
545 else
546 strcpy (input, tmp);
507 547
508void 548 return;
509zero_initialised::operator delete [] (void *p, size_t s)
510{
511 g_slice_free1 (s, p);
512} 549}
513 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