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.58 by root, Mon Jun 4 12:19:08 2007 UTC vs.
Revision 1.65 by root, Thu Aug 16 06:36:56 2007 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it 8 * Crossfire TRT is free software: you can redistribute it and/or modify
9 * under the terms of the GNU General Public License as published by the Free 9 * it under the terms of the GNU General Public License as published by
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * the Free Software Foundation, either version 3 of the License, or
11 * any later version. 11 * (at your option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License along 18 * You should have received a copy of the GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 20 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25/* 24/*
… …
36#include <global.h> 35#include <global.h>
37#include <funcpoint.h> 36#include <funcpoint.h>
38#include <material.h> 37#include <material.h>
39 38
40#include <glib.h> 39#include <glib.h>
40
41refcnt_base::refcnt_t refcnt_dummy;
41 42
42rand_gen rndm; 43rand_gen rndm;
43 44
44void 45void
45tausworthe_random_generator::seed (uint32_t seed) 46tausworthe_random_generator::seed (uint32_t seed)
… …
204 } 205 }
205 206
206 return total; 207 return total;
207} 208}
208 209
209/* decay and destroy perishable items in a map */
210void
211maptile::decay_objects ()
212{
213 if (!spaces)
214 return;
215
216 for (mapspace *ms = spaces + size (); ms-- > spaces; )
217 for (object *above, *op = ms->bot; op; op = above)
218 {
219 above = op->above;
220
221 bool destroy = 0;
222
223 // do not decay anything above unique floor tiles (yet :)
224 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
225 break;
226
227 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
228 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
229 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
230 || QUERY_FLAG (op, FLAG_UNIQUE)
231 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
232 || QUERY_FLAG (op, FLAG_UNPAID)
233 || op->is_alive ())
234 ; // do not decay
235 else if (op->is_weapon ())
236 {
237 op->stats.dam--;
238 if (op->stats.dam < 0)
239 destroy = 1;
240 }
241 else if (op->is_armor ())
242 {
243 op->stats.ac--;
244 if (op->stats.ac < 0)
245 destroy = 1;
246 }
247 else if (op->type == FOOD)
248 {
249 op->stats.food -= rndm (5, 20);
250 if (op->stats.food < 0)
251 destroy = 1;
252 }
253 else
254 {
255 int mat = op->materials;
256
257 if (mat & M_PAPER
258 || mat & M_LEATHER
259 || mat & M_WOOD
260 || mat & M_ORGANIC
261 || mat & M_CLOTH
262 || mat & M_LIQUID
263 || (mat & M_IRON && rndm (1, 5) == 1)
264 || (mat & M_GLASS && rndm (1, 2) == 1)
265 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
266 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
267 || (mat & M_ICE && temp > 32))
268 destroy = 1;
269 }
270
271 /* adjust overall chance below */
272 if (destroy && rndm (0, 1))
273 op->destroy ();
274 }
275}
276
277/* convert materialname to materialtype_t */ 210/* convert materialname to materialtype_t */
278 211
279materialtype_t * 212materialtype_t *
280name_to_material (const shstr &name) 213name_to_material (const shstr &name)
281{ 214{
282 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 215 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
283 if (name == mt->name) 216 if (name == mt->name)
284 return mt; 217 return mt;
285 218
286 return materialt; 219 return 0;
287} 220}
288 221
289/* when doing transmutation of objects, we have to recheck the resistances, 222/* when doing transmutation of objects, we have to recheck the resistances,
290 * as some that did not apply previously, may apply now. 223 * as some that did not apply previously, may apply now.
291 */ 224 */
292
293void 225void
294transmute_materialname (object *op, const object *change) 226transmute_materialname (object *op, const object *change)
295{ 227{
296 materialtype_t *mt; 228 materialtype_t *mt;
297 int j; 229 int j;
… …
327void 259void
328set_materialname (object *op, int difficulty, materialtype_t *nmt) 260set_materialname (object *op, int difficulty, materialtype_t *nmt)
329{ 261{
330 materialtype_t *mt, *lmt; 262 materialtype_t *mt, *lmt;
331 263
332#ifdef NEW_MATERIAL_CODE
333 int j;
334#endif
335
336 if (op->materialname != NULL) 264 if (op->materialname != NULL)
337 return; 265 return;
338 266
339
340
341 if (nmt == NULL) 267 if (nmt == NULL)
342 { 268 {
343 lmt = NULL; 269 lmt = NULL;
344#ifndef NEW_MATERIAL_CODE 270
345 for (mt = materialt; mt && mt->next; mt = mt->next) 271 for (mt = materialt; mt && mt->next; mt = mt->next)
346 { 272 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
347 if (op->materials & mt->material) 273 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
348 { 274 {
349 lmt = mt; 275 lmt = mt;
276 if (!(op->is_weapon () || op->is_armor ()))
350 break; 277 break;
351 } 278 }
352 }
353
354#else
355 for (mt = materialt; mt && mt->next; mt = mt->next)
356 {
357 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
358 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
359 {
360 lmt = mt;
361 if (!(op->is_weapon () || op->is_armor ()))
362 break;
363 }
364 }
365#endif
366 } 279 }
367 else 280 else
368 {
369 lmt = nmt; 281 lmt = nmt;
370 }
371 282
372 if (lmt != NULL) 283 if (lmt != NULL)
373 { 284 {
374#ifndef NEW_MATERIAL_CODE
375 op->materialname = lmt->name;
376 return;
377#else
378
379 if (op->stats.dam && op->is_weapon ()) 285 if (op->stats.dam && op->is_weapon ())
380 { 286 {
381 op->stats.dam += lmt->damage; 287 op->stats.dam += lmt->damage;
382 if (op->stats.dam < 1) 288 if (op->stats.dam < 1)
383 op->stats.dam = 1; 289 op->stats.dam = 1;
… …
389 op->stats.wc += lmt->wc; 295 op->stats.wc += lmt->wc;
390 if (op->is_armor ()) 296 if (op->is_armor ())
391 { 297 {
392 if (op->stats.ac) 298 if (op->stats.ac)
393 op->stats.ac += lmt->ac; 299 op->stats.ac += lmt->ac;
300
394 for (j = 0; j < NROFATTACKS; j++) 301 for (int j = 0; j < NROFATTACKS; j++)
395 if (op->resist[j] != 0) 302 if (op->resist[j] != 0)
396 { 303 {
397 op->resist[j] += lmt->mod[j]; 304 op->resist[j] += lmt->mod[j];
398 if (op->resist[j] > 100) 305 if (op->resist[j] > 100)
399 op->resist[j] = 100; 306 op->resist[j] = 100;
400 if (op->resist[j] < -100) 307 if (op->resist[j] < -100)
401 op->resist[j] = -100; 308 op->resist[j] = -100;
402 } 309 }
403 } 310 }
311
404 op->materialname = lmt->name; 312 op->materialname = lmt->name;
405 /* dont make it unstackable if it doesn't need to be */ 313 /* dont make it unstackable if it doesn't need to be */
406 if (op->is_weapon () || op->is_armor ()) 314 if (op->is_weapon () || op->is_armor ())
407 { 315 {
408 op->weight = (op->weight * lmt->weight) / 100; 316 op->weight = (op->weight * lmt->weight) / 100;
409 op->value = (op->value * lmt->value) / 100; 317 op->value = (op->value * lmt->value) / 100;
410 } 318 }
411#endif
412 } 319 }
413} 320}
414 321
415/* 322/*
416 * Strip out the media tags from a String. 323 * Strip out the media tags from a String.
… …
511 * a 'list' for the purposes here, is a string of items, seperated by commas, except 418 * a 'list' for the purposes here, is a string of items, seperated by commas, except
512 * for the last entry, which has an 'and' before it, and a full stop (period) after it. 419 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
513 * This function will also strip all trailing non alphanumeric characters. 420 * This function will also strip all trailing non alphanumeric characters.
514 * It does not insert an oxford comma. 421 * It does not insert an oxford comma.
515 */ 422 */
516
517void 423void
518make_list_like (char *input) 424make_list_like (char *input)
519{ 425{
520 char *p, tmp[MAX_BUF]; 426 char *p, tmp[MAX_BUF];
521 int i; 427 int i;
… …
611 } 517 }
612 else 518 else
613 memcpy (dst, src, len + 1); 519 memcpy (dst, src, len + 1);
614} 520}
615 521
616const std::string 522const char *
617format (const char *format, ...) 523format (const char *format, ...)
618{ 524{
619 int len; 525 static dynbuf_text buf;
620 526
621 { 527 buf.clear ();
622 char buf[128];
623 528
624 va_list ap; 529 va_list ap;
625 va_start (ap, format); 530 va_start (ap, format);
626 len = vsnprintf (buf, sizeof (buf), format, ap); 531 buf.vprintf (format, ap);
627 va_end (ap); 532 va_end (ap);
628 533
629 assert (len >= 0); // shield againstz broken vsnprintf's
630
631 // was our static buffer short enough?
632 if (len < sizeof (buf))
633 return std::string (buf, len);
634 }
635
636 {
637 // longer, try harder
638 char *buf = salloc<char> (len + 1);
639
640 va_list ap;
641 va_start (ap, format);
642 vsnprintf (buf, len + 1, format, ap);
643 va_end (ap);
644
645 const std::string s (buf, len);
646 sfree<char> (buf, len + 1);
647
648 return buf; 534 return buf;
649 }
650} 535}
651 536
652tstamp now () 537tstamp now ()
653{ 538{
654 struct timeval tv; 539 struct timeval tv;
… …
722 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 607 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
723 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 608 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
724 0x2d02ef8dL 609 0x2d02ef8dL
725}; 610};
726 611
612#if 0
613void xyzzy (object_ptr &a, object_ptr &o)
614{
615 asm volatile ("int3");
616 a = o;
617 asm volatile ("int3");
618}
619#endif
727 620

Diff Legend

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