server/common/utils.C

/*
    CrossFire, A Multiplayer game for X-windows

    Copyright (C) 2002 Mark Wedel & Crossfire Development Team
    Copyright (C) 1992 Frank Tore Johansen

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

    The authors can be reached via e-mail at <crossfire@schmorp.de>
*/

/*
 * General convenience functions for crossfire.
 */

#include <global.h>
#include <funcpoint.h>
#include <material.h>

#include <sys/time.h>
#include <time.h>
#include <glib.h>

/*
 * The random functions here take luck into account when rolling random
 * dice or numbers.  This function has less of an impact the larger the
 * difference becomes in the random numbers.  IE, the effect is lessened
 * on a 1-1000 roll, vs a 1-6 roll.  This can be used by crafty programmers,
 * to specifically disable luck in certain rolls, simply by making the
 * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3)
 */

/*
 * Roll a random number between min and max.  Uses op to determine luck,
 * and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
 * Generally, op should be the player/caster/hitter requesting the roll,
 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
 */

int
random_roll (int min, int max, const object *op, int goodbad)
{
  int omin, diff, luck, base, ran;

  omin = min;
  diff = max - min + 1;
  ((diff > 2) ? (base = 20) : (base = 50));     /* d2 and d3 are corner cases */

  if (max < 1 || diff < 1)
    {
      LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);
      return (min);             /* avoids a float exception */
    }

  ran = RANDOM ();

  if (op->type != PLAYER)
    return ((ran % diff) + min);

  luck = op->stats.luck;
  if (RANDOM () % base < MIN (10, abs (luck)))
    {
      /* we have a winner */
      ((luck > 0) ? (luck = 1) : (luck = -1));
      diff -= luck;
      if (diff < 1)
        return (omin);          /*check again */
      ((goodbad) ? (min += luck) : (diff));

      return (MAX (omin, MIN (max, (ran % diff) + min)));
    }
  return ((ran % diff) + min);
}

/*
 * This is a 64 bit version of random_roll above.  This is needed
 * for exp loss calculations for players changing religions.
 */

sint64
random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
{
  sint64 omin, diff, luck, ran;
  int base;

  omin = min;
  diff = max - min + 1;
  ((diff > 2) ? (base = 20) : (base = 50));     /* d2 and d3 are corner cases */

  if (max < 1 || diff < 1)
    {
      LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
      return (min);             /* avoids a float exception */
    }

  /* Don't know of a portable call to get 64 bit random values.
   * So make a call to get two 32 bit random numbers, and just to
   * a little byteshifting.  Do make sure the first one is only
   * 32 bit, so we don't get skewed results
   */
  ran = (RANDOM () & 0xffffffff) | ((sint64) RANDOM () << 32);

  if (op->type != PLAYER)
    return ((ran % diff) + min);

  luck = op->stats.luck;
  if (RANDOM () % base < MIN (10, abs (luck)))
    {
      /* we have a winner */
      ((luck > 0) ? (luck = 1) : (luck = -1));
      diff -= luck;
      if (diff < 1)
        return (omin);          /*check again */
      ((goodbad) ? (min += luck) : (diff));

      return (MAX (omin, MIN (max, (ran % diff) + min)));
    }
  return ((ran % diff) + min);
}

/*
 * Roll a number of dice (2d3, 4d6).  Uses op to determine luck,
 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
 * Generally, op should be the player/caster/hitter requesting the roll,
 * not the recipient (ie, the poor slob getting hit).
 * The args are num D size (ie 4d6)  [garbled 20010916]
 */

int
die_roll (int num, int size, const object *op, int goodbad)
{
  int min, diff, luck, total, i, gotlucky, base, ran;

  diff = size;
  min = 1;
  luck = total = gotlucky = 0;
  ((diff > 2) ? (base = 20) : (base = 50));     /* d2 and d3 are corner cases */
  if (size < 2 || diff < 1)
    {
      LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
      return (num);             /* avoids a float exception */
    }

  if (op->type == PLAYER)
    luck = op->stats.luck;

  for (i = 0; i < num; i++)
    {
      if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)
        {
          /* we have a winner */
          gotlucky++;
          ((luck > 0) ? (luck = 1) : (luck = -1));
          diff -= luck;
          if (diff < 1)
            return (num);       /*check again */
          ((goodbad) ? (min += luck) : (diff));
          ran = RANDOM ();
          total += MAX (1, MIN (size, (ran % diff) + min));
        }
      else
        {
          total += RANDOM () % size + 1;
        }
    }
  return (total);
}

/*
 * Another convenience function.  Returns a number between min and max.
 * It is suggested one use these functions rather than RANDOM()%, as it
 * would appear that a number of off-by-one-errors exist due to improper
 * use of %.  This should also prevent SIGFPE.
 */

int
rndm (int min, int max)
{
  int diff;

  diff = max - min + 1;
  if (max < 1 || diff < 1)
    return (min);

  return (RANDOM () % diff + min);
}

/* decay and destroy perishable items in a map */
void
maptile::decay_objects ()
{
  int x, y, destroy;
  object *op, *otmp;

  for (x = 0; x < width; x++)
    for (y = 0; y < height; y++)
      for (op = at (x, y).bot; op; op = otmp)
        {
          destroy = 0;
          otmp = op->above;

          if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
            break;

          if (QUERY_FLAG (op, FLAG_IS_FLOOR)
              || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
              || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
              || QUERY_FLAG (op, FLAG_UNIQUE)
              || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
              || QUERY_FLAG (op, FLAG_UNPAID)
              || op->is_alive ())
            continue;

          /* otherwise, we decay and destroy */
          if (op->is_weapon ())
            {
              op->stats.dam--;
              if (op->stats.dam < 0)
                destroy = 1;
            }
          else if (op->is_armor ())
            {
              op->stats.ac--;
              if (op->stats.ac < 0)
                destroy = 1;
            }
          else if (op->type == FOOD)
            {
              op->stats.food -= rndm (5, 20);
              if (op->stats.food < 0)
                destroy = 1;
            }
          else
            {
              if (op->material & M_PAPER || op->material & M_LEATHER ||
                  op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID)
                destroy = 1;

              if (op->material & M_IRON && rndm (1, 5) == 1)
                destroy = 1;

              if (op->material & M_GLASS && rndm (1, 2) == 1)
                destroy = 1;

              if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1)
                destroy = 1;

              if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1)
                destroy = 1;

              if (op->material & M_ICE && temp > 32)
                destroy = 1;
            }

          /* adjust overall chance below */
          if (destroy && rndm (0, 1))
            op->destroy ();
        }
}

/* convert materialname to materialtype_t */

materialtype_t *
name_to_material (const char *name)
{
  materialtype_t *mt, *nmt;

  mt = NULL;
  for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
    {
      if (strcmp (name, nmt->name) == 0)
        {
          mt = nmt;
          break;
        }
    }
  return mt;
}

/* when doing transmutation of objects, we have to recheck the resistances,
 * as some that did not apply previously, may apply now.
 */

void
transmute_materialname (object *op, const object *change)
{
  materialtype_t *mt;
  int j;

  if (op->materialname == NULL)
    return;

  if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
    return;

  if (!op->is_armor ())
    return;

  mt = name_to_material (op->materialname);
  if (!mt)
    {
      LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
      return;
    }

  for (j = 0; j < NROFATTACKS; j++)
    if (op->resist[j] == 0 && change->resist[j] != 0)
      {
        op->resist[j] += mt->mod[j];
        if (op->resist[j] > 100)
          op->resist[j] = 100;
        if (op->resist[j] < -100)
          op->resist[j] = -100;
      }
}

/* set the materialname and type for an item */
void
set_materialname (object *op, int difficulty, materialtype_t *nmt)
{
  materialtype_t *mt, *lmt;

#ifdef NEW_MATERIAL_CODE
  int j;
#endif

  if (op->materialname != NULL)
    return;


  if (nmt == NULL)
    {
      lmt = NULL;
#ifndef NEW_MATERIAL_CODE
      for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
        {
          if (op->material & mt->material)
            {
              lmt = mt;
              break;
            }
        }

#else
      for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
        {
          if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
              difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
            {
              lmt = mt;
              if (!(op->is_weapon () || op->is_armor ()))
                break;
            }
        }
#endif
    }
  else
    {
      lmt = nmt;
    }

  if (lmt != NULL)
    {
#ifndef NEW_MATERIAL_CODE
      op->materialname = lmt->name;
      return;
#else

      if (op->stats.dam && op->is_weapon ())
        {
          op->stats.dam += lmt->damage;
          if (op->stats.dam < 1)
            op->stats.dam = 1;
        }
      if (op->stats.sp && op->type == BOW)
        op->stats.sp += lmt->sp;
      if (op->stats.wc && op->is_weapon ())
        op->stats.wc += lmt->wc;
      if (op->is_armor ())
        {
          if (op->stats.ac)
            op->stats.ac += lmt->ac;
          for (j = 0; j < NROFATTACKS; j++)
            if (op->resist[j] != 0)
              {
                op->resist[j] += lmt->mod[j];
                if (op->resist[j] > 100)
                  op->resist[j] = 100;
                if (op->resist[j] < -100)
                  op->resist[j] = -100;
              }
        }
      op->materialname = add_string (lmt->name);
      /* dont make it unstackable if it doesn't need to be */
      if (op->is_weapon () || op->is_armor ())
        {
          op->weight = (op->weight * lmt->weight) / 100;
          op->value = (op->value * lmt->value) / 100;
        }
#endif
    }
}

/*
 * Strip out the media tags from a String.
 * Warning the input string will contain the result string
 */
void
strip_media_tag (char *message)
{
  int in_tag = 0;
  char *dest;
  char *src;

  src = dest = message;
  while (*src != '\0')
    {
      if (*src == '[')
        {
          in_tag = 1;
        }
      else if (in_tag && (*src == ']'))
        in_tag = 0;
      else if (!in_tag)
        {
          *dest = *src;
          dest++;
        }
      src++;
    }
  *dest = '\0';
}

const char *
strrstr (const char *haystack, const char *needle)
{
  const char *lastneedle;

  lastneedle = NULL;
  while ((haystack = strstr (haystack, needle)) != NULL)
    {
      lastneedle = haystack;
      haystack++;
    }
  return lastneedle;

}

#define EOL_SIZE (sizeof("\n")-1)
void
strip_endline (char *buf)
{
  if (strlen (buf) < sizeof ("\n"))
    {
      return;
    }
  if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
    buf[strlen (buf) - EOL_SIZE] = '\0';
}

/**
 * Replace in string src all occurrences of key by replacement. The resulting
 * string is put into result; at most resultsize characters (including the
 * terminating null character) will be written to result.
 */
void
replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
{
  size_t resultlen;
  size_t keylen;

  /* special case to prevent infinite loop if key==replacement=="" */
  if (strcmp (key, replacement) == 0)
    {
      snprintf (result, resultsize, "%s", src);
      return;
    }

  keylen = strlen (key);

  resultlen = 0;
  while (*src != '\0' && resultlen + 1 < resultsize)
    {
      if (strncmp (src, key, keylen) == 0)
        {
          snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
          resultlen += strlen (result + resultlen);
          src += keylen;
        }
      else
        {
          result[resultlen++] = *src++;
        }
    }
  result[resultlen] = '\0';
}

/**
 * Taking a string as an argument, mutate it into a string that looks like a list.
 * a 'list' for the purposes here, is a string of items, seperated by commas, except
 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
 * This function will also strip all trailing non alphanumeric characters.
 * It does not insert an oxford comma.
 */

void
make_list_like (char *input)
{
  char *p, tmp[MAX_BUF];
  int i;

  if (!input || strlen (input) > MAX_BUF - 5)
    return;
  /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */

  strncpy (tmp, input, MAX_BUF - 5);
  /*trim all trailing commas, spaces etc. */
  for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
    tmp[i] = '\0';

  strcat (tmp, ".");

  p = strrchr (tmp, ',');
  if (p)
    {
      *p = '\0';
      strcpy (input, tmp);
      p++;
      strcat (input, " and");
      strcat (input, p);
    }
  else
    strcpy (input, tmp);

  return;
}

/////////////////////////////////////////////////////////////////////////////

void *salloc_ (int n) throw (std::bad_alloc)
{
  void *ptr = g_slice_alloc (n);

  if (!ptr)
    throw std::bad_alloc ();

  return ptr;
}

void *salloc_ (int n, void *src) throw (std::bad_alloc)
{
  void *ptr = salloc_ (n);

  if (src)
    memcpy (ptr, src, n);
  else
    memset (ptr, 0, n);

  return ptr;
}

void assign (char *dst, const char *src, int maxlen)
{
  if (!src)
    src = "";

  int len = strlen (src);

  if (len >= maxlen - 1)
    {
      if (maxlen <= 4)
        {
          memset (dst, '.', maxlen - 1);
          dst [maxlen - 1] = 0;
        }
      else
        {
          memcpy (dst, src, maxlen - 4);
          memcpy (dst + maxlen - 4, "...", 4);
        }
    }
  else
    memcpy (dst, src, len + 1);
}

tstamp now ()
{
  struct timeval tv;

  gettimeofday (&tv, 0);
  return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
}

int
similar_direction (int a, int b)
{
  if (!a || !b)
    return 0;

  int diff = (b - a) & 7;
  return diff <= 1 || diff >= 7;
}

Revision:	1.33
Committed:	Sun Dec 31 18:10:40 2006 UTC (17 years, 4 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.32:	+1 -1 lines
Log Message:	- style maps need very special treatment - cf has a nonzero chance of crashing in a random map
#	User	Rev	Content
1	elmex	1.1	/*
2			CrossFire, A Multiplayer game for X-windows
3
4			Copyright (C) 2002 Mark Wedel & Crossfire Development Team
5			Copyright (C) 1992 Frank Tore Johansen
6
7			This program is free software; you can redistribute it and/or modify
8			it under the terms of the GNU General Public License as published by
9			the Free Software Foundation; either version 2 of the License, or
10			(at your option) any later version.
11
12			This program is distributed in the hope that it will be useful,
13			but WITHOUT ANY WARRANTY; without even the implied warranty of
14			MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15			GNU General Public License for more details.
16
17			You should have received a copy of the GNU General Public License
18			along with this program; if not, write to the Free Software
19			Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20
21	root	1.15	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	elmex	1.1	*/
23
24			/*
25			* General convenience functions for crossfire.
26			*/
27
28			#include <global.h>
29			#include <funcpoint.h>
30			#include <material.h>
31
32	root	1.23	#include <sys/time.h>
33			#include <time.h>
34	root	1.4	#include <glib.h>
35
36	elmex	1.1	/*
37			* The random functions here take luck into account when rolling random
38			* dice or numbers. This function has less of an impact the larger the
39			* difference becomes in the random numbers. IE, the effect is lessened
40			* on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers,
41			* to specifically disable luck in certain rolls, simply by making the
42			* numbers larger (ie, 1d1000 > 500 vs 1d6 > 3)
43			*/
44
45			/*
46			* Roll a random number between min and max. Uses op to determine luck,
47			* and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
48			* Generally, op should be the player/caster/hitter requesting the roll,
49			* not the recipient (ie, the poor slob getting hit). [garbled 20010916]
50			*/
51
52	root	1.9	int
53			random_roll (int min, int max, const object *op, int goodbad)
54			{
55			int omin, diff, luck, base, ran;
56	elmex	1.1
57	root	1.9	omin = min;
58			diff = max - min + 1;
59			((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
60	elmex	1.1
61	root	1.9	if (max < 1 \|\| diff < 1)
62			{
63			LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);
64			return (min); /* avoids a float exception */
65	elmex	1.1	}
66
67	root	1.9	ran = RANDOM ();
68	elmex	1.1
69	root	1.9	if (op->type != PLAYER)
70			return ((ran % diff) + min);
71	elmex	1.1
72	root	1.9	luck = op->stats.luck;
73			if (RANDOM () % base < MIN (10, abs (luck)))
74			{
75			/* we have a winner */
76			((luck > 0) ? (luck = 1) : (luck = -1));
77			diff -= luck;
78			if (diff < 1)
79			return (omin); /check again /
80			((goodbad) ? (min += luck) : (diff));
81	elmex	1.1
82	root	1.9	return (MAX (omin, MIN (max, (ran % diff) + min)));
83	elmex	1.1	}
84	root	1.9	return ((ran % diff) + min);
85	elmex	1.1	}
86
87			/*
88			* This is a 64 bit version of random_roll above. This is needed
89			* for exp loss calculations for players changing religions.
90			*/
91
92	root	1.9	sint64
93			random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
94			{
95			sint64 omin, diff, luck, ran;
96			int base;
97
98			omin = min;
99			diff = max - min + 1;
100			((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
101	elmex	1.1
102	root	1.9	if (max < 1 \|\| diff < 1)
103			{
104	root	1.20	LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
105	root	1.9	return (min); /* avoids a float exception */
106	elmex	1.1	}
107
108	root	1.9	/* 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
110			* a little byteshifting. Do make sure the first one is only
111			* 32 bit, so we don't get skewed results
112			*/
113			ran = (RANDOM () & 0xffffffff) \| ((sint64) RANDOM () << 32);
114
115			if (op->type != PLAYER)
116			return ((ran % diff) + min);
117
118			luck = op->stats.luck;
119			if (RANDOM () % base < MIN (10, abs (luck)))
120			{
121			/* we have a winner */
122			((luck > 0) ? (luck = 1) : (luck = -1));
123			diff -= luck;
124			if (diff < 1)
125			return (omin); /check again /
126			((goodbad) ? (min += luck) : (diff));
127	elmex	1.1
128	root	1.9	return (MAX (omin, MIN (max, (ran % diff) + min)));
129	elmex	1.1	}
130	root	1.9	return ((ran % diff) + min);
131	elmex	1.1	}
132
133			/*
134			* Roll a number of dice (2d3, 4d6). Uses op to determine luck,
135			* If goodbad is non-zero, luck increases the roll, if zero, it decreases.
136			* Generally, op should be the player/caster/hitter requesting the roll,
137			* not the recipient (ie, the poor slob getting hit).
138			* The args are num D size (ie 4d6) [garbled 20010916]
139			*/
140
141	root	1.9	int
142			die_roll (int num, int size, const object *op, int goodbad)
143			{
144			int min, diff, luck, total, i, gotlucky, base, ran;
145
146			diff = size;
147			min = 1;
148			luck = total = gotlucky = 0;
149			((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
150			if (size < 2 \|\| diff < 1)
151			{
152			LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
153			return (num); /* avoids a float exception */
154			}
155	elmex	1.1
156	root	1.9	if (op->type == PLAYER)
157			luck = op->stats.luck;
158
159			for (i = 0; i < num; i++)
160			{
161			if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)
162			{
163			/* we have a winner */
164			gotlucky++;
165			((luck > 0) ? (luck = 1) : (luck = -1));
166			diff -= luck;
167			if (diff < 1)
168			return (num); /check again /
169			((goodbad) ? (min += luck) : (diff));
170			ran = RANDOM ();
171			total += MAX (1, MIN (size, (ran % diff) + min));
172			}
173			else
174			{
175			total += RANDOM () % size + 1;
176	root	1.2	}
177	elmex	1.1	}
178	root	1.9	return (total);
179	elmex	1.1	}
180
181			/*
182			* Another convenience function. Returns a number between min and max.
183			* It is suggested one use these functions rather than RANDOM()%, as it
184			* would appear that a number of off-by-one-errors exist due to improper
185			* use of %. This should also prevent SIGFPE.
186			*/
187
188	root	1.9	int
189			rndm (int min, int max)
190	elmex	1.1	{
191			int diff;
192
193			diff = max - min + 1;
194			if (max < 1 \|\| diff < 1)
195	root	1.9	return (min);
196	elmex	1.1
197	root	1.9	return (RANDOM () % diff + min);
198	elmex	1.1	}
199
200	root	1.33	/* decay and destroy perishable items in a map */
201	root	1.9	void
202	root	1.32	maptile::decay_objects ()
203	elmex	1.1	{
204	root	1.9	int x, y, destroy;
205			object op, otmp;
206	elmex	1.1
207	root	1.32	for (x = 0; x < width; x++)
208			for (y = 0; y < height; y++)
209			for (op = at (x, y).bot; op; op = otmp)
210	root	1.9	{
211			destroy = 0;
212			otmp = op->above;
213	root	1.32
214	root	1.9	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
215			break;
216	root	1.32
217	root	1.26	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	root	1.9	continue;
225	root	1.26
226	root	1.9	/* otherwise, we decay and destroy */
227	root	1.26	if (op->is_weapon ())
228	root	1.9	{
229			op->stats.dam--;
230			if (op->stats.dam < 0)
231			destroy = 1;
232	root	1.2	}
233	root	1.26	else if (op->is_armor ())
234	root	1.9	{
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	root	1.32
251	root	1.9	if (op->material & M_IRON && rndm (1, 5) == 1)
252			destroy = 1;
253	root	1.32
254	root	1.9	if (op->material & M_GLASS && rndm (1, 2) == 1)
255			destroy = 1;
256	root	1.32
257	root	1.9	if ((op->material & M_STONE \|\| op->material & M_ADAMANT) && rndm (1, 10) == 1)
258			destroy = 1;
259	root	1.32
260	root	1.9	if ((op->material & M_SOFT_METAL \|\| op->material & M_BONE) && rndm (1, 3) == 1)
261			destroy = 1;
262	root	1.32
263			if (op->material & M_ICE && temp > 32)
264	root	1.9	destroy = 1;
265			}
266	root	1.32
267	root	1.9	/* adjust overall chance below */
268			if (destroy && rndm (0, 1))
269	root	1.22	op->destroy ();
270	root	1.9	}
271	elmex	1.1	}
272
273			/* convert materialname to materialtype_t */
274
275	root	1.9	materialtype_t *
276			name_to_material (const char *name)
277	elmex	1.1	{
278	root	1.9	materialtype_t mt, nmt;
279	elmex	1.1
280	root	1.9	mt = NULL;
281			for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
282			{
283			if (strcmp (name, nmt->name) == 0)
284			{
285			mt = nmt;
286			break;
287	root	1.2	}
288	elmex	1.1	}
289	root	1.9	return mt;
290	elmex	1.1	}
291
292			/* when doing transmutation of objects, we have to recheck the resistances,
293			* as some that did not apply previously, may apply now.
294			*/
295
296	root	1.9	void
297			transmute_materialname (object op, const object change)
298	elmex	1.1	{
299	root	1.9	materialtype_t *mt;
300			int j;
301	elmex	1.1
302	root	1.9	if (op->materialname == NULL)
303			return;
304	elmex	1.1
305	root	1.9	if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
306			return;
307
308	root	1.26	if (!op->is_armor ())
309	root	1.9	return;
310
311			mt = name_to_material (op->materialname);
312			if (!mt)
313			{
314			LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
315			return;
316			}
317
318			for (j = 0; j < NROFATTACKS; j++)
319			if (op->resist[j] == 0 && change->resist[j] != 0)
320			{
321			op->resist[j] += mt->mod[j];
322			if (op->resist[j] > 100)
323			op->resist[j] = 100;
324			if (op->resist[j] < -100)
325			op->resist[j] = -100;
326			}
327	elmex	1.1	}
328
329			/* set the materialname and type for an item */
330	root	1.9	void
331			set_materialname (object op, int difficulty, materialtype_t nmt)
332	elmex	1.1	{
333	root	1.9	materialtype_t mt, lmt;
334
335	pippijn	1.5	#ifdef NEW_MATERIAL_CODE
336	root	1.9	int j;
337	pippijn	1.5	#endif
338	elmex	1.1
339	root	1.9	if (op->materialname != NULL)
340			return;
341	elmex	1.1
342
343
344	root	1.9	if (nmt == NULL)
345			{
346			lmt = NULL;
347	elmex	1.1	#ifndef NEW_MATERIAL_CODE
348	root	1.9	for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
349			{
350			if (op->material & mt->material)
351			{
352			lmt = mt;
353			break;
354	root	1.2	}
355			}
356	elmex	1.1
357			#else
358	root	1.9	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	root	1.26	if (!(op->is_weapon () \|\| op->is_armor ()))
365	root	1.9	break;
366	root	1.2	}
367			}
368	elmex	1.1	#endif
369	root	1.9	}
370			else
371			{
372			lmt = nmt;
373	elmex	1.1	}
374
375	root	1.9	if (lmt != NULL)
376			{
377	elmex	1.1	#ifndef NEW_MATERIAL_CODE
378	root	1.9	op->materialname = lmt->name;
379			return;
380	elmex	1.1	#else
381
382	root	1.26	if (op->stats.dam && op->is_weapon ())
383	root	1.9	{
384			op->stats.dam += lmt->damage;
385			if (op->stats.dam < 1)
386			op->stats.dam = 1;
387			}
388			if (op->stats.sp && op->type == BOW)
389			op->stats.sp += lmt->sp;
390	root	1.26	if (op->stats.wc && op->is_weapon ())
391	root	1.9	op->stats.wc += lmt->wc;
392	root	1.26	if (op->is_armor ())
393	root	1.9	{
394			if (op->stats.ac)
395			op->stats.ac += lmt->ac;
396			for (j = 0; j < NROFATTACKS; j++)
397			if (op->resist[j] != 0)
398			{
399			op->resist[j] += lmt->mod[j];
400			if (op->resist[j] > 100)
401			op->resist[j] = 100;
402			if (op->resist[j] < -100)
403			op->resist[j] = -100;
404			}
405			}
406			op->materialname = add_string (lmt->name);
407			/* dont make it unstackable if it doesn't need to be */
408	root	1.26	if (op->is_weapon () \|\| op->is_armor ())
409	root	1.9	{
410			op->weight = (op->weight * lmt->weight) / 100;
411			op->value = (op->value * lmt->value) / 100;
412	root	1.2	}
413	elmex	1.1	#endif
414			}
415			}
416
417			/*
418			* Strip out the media tags from a String.
419			* Warning the input string will contain the result string
420			*/
421	root	1.9	void
422			strip_media_tag (char *message)
423			{
424			int in_tag = 0;
425			char *dest;
426			char *src;
427
428			src = dest = message;
429			while (*src != '\0')
430			{
431			if (*src == '[')
432			{
433			in_tag = 1;
434			}
435			else if (in_tag && (*src == ']'))
436			in_tag = 0;
437			else if (!in_tag)
438			{
439			dest = src;
440			dest++;
441			}
442			src++;
443			}
444			*dest = '\0';
445			}
446
447			const char *
448			strrstr (const char haystack, const char needle)
449			{
450			const char *lastneedle;
451
452			lastneedle = NULL;
453			while ((haystack = strstr (haystack, needle)) != NULL)
454			{
455			lastneedle = haystack;
456			haystack++;
457	elmex	1.1	}
458	root	1.9	return lastneedle;
459
460	elmex	1.1	}
461	root	1.9
462	elmex	1.1	#define EOL_SIZE (sizeof("\n")-1)
463	root	1.9	void
464			strip_endline (char *buf)
465			{
466			if (strlen (buf) < sizeof ("\n"))
467			{
468			return;
469	elmex	1.1	}
470	root	1.9	if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
471			buf[strlen (buf) - EOL_SIZE] = '\0';
472	elmex	1.1	}
473
474			/**
475			* Replace in string src all occurrences of key by replacement. The resulting
476			* string is put into result; at most resultsize characters (including the
477			* terminating null character) will be written to result.
478			*/
479	root	1.9	void
480			replace (const char src, const char key, const char replacement, char result, size_t resultsize)
481	elmex	1.1	{
482	root	1.9	size_t resultlen;
483			size_t keylen;
484	elmex	1.1
485	root	1.9	/* special case to prevent infinite loop if key==replacement=="" */
486			if (strcmp (key, replacement) == 0)
487			{
488			snprintf (result, resultsize, "%s", src);
489			return;
490			}
491
492			keylen = strlen (key);
493
494			resultlen = 0;
495			while (*src != '\0' && resultlen + 1 < resultsize)
496			{
497			if (strncmp (src, key, keylen) == 0)
498	root	1.2	{
499	root	1.9	snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
500			resultlen += strlen (result + resultlen);
501			src += keylen;
502	root	1.2	}
503	root	1.9	else
504	root	1.2	{
505	root	1.9	result[resultlen++] = *src++;
506	root	1.2	}
507	root	1.9	}
508			result[resultlen] = '\0';
509	elmex	1.1	}
510
511			/**
512			* Taking a string as an argument, mutate it into a string that looks like a list.
513			* a 'list' for the purposes here, is a string of items, seperated by commas, except
514			* for the last entry, which has an 'and' before it, and a full stop (period) after it.
515			* This function will also strip all trailing non alphanumeric characters.
516			* It does not insert an oxford comma.
517			*/
518
519	root	1.9	void
520			make_list_like (char *input)
521			{
522			char *p, tmp[MAX_BUF];
523			int i;
524
525			if (!input \|\| strlen (input) > MAX_BUF - 5)
526	elmex	1.1	return;
527	root	1.9	/* 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	root	1.11
534	root	1.9	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	root	1.11
548	root	1.9	return;
549	elmex	1.1	}
550	root	1.3
551	root	1.14	/////////////////////////////////////////////////////////////////////////////
552
553	root	1.25	void *salloc_ (int n) throw (std::bad_alloc)
554	root	1.10	{
555	root	1.25	void *ptr = g_slice_alloc (n);
556	root	1.13
557	root	1.23	if (!ptr)
558	root	1.13	throw std::bad_alloc ();
559	root	1.4
560	root	1.23	return ptr;
561			}
562
563	root	1.25	void salloc_ (int n, void src) throw (std::bad_alloc)
564	root	1.23	{
565	root	1.25	void *ptr = salloc_ (n);
566	root	1.23
567	root	1.24	if (src)
568	root	1.25	memcpy (ptr, src, n);
569	root	1.24	else
570	root	1.25	memset (ptr, 0, n);
571	root	1.23
572			return ptr;
573	root	1.3	}
574	root	1.11
575			void 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
599	root	1.23	tstamp 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	root	1.17
607	root	1.32	int
608			similar_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