server/common/arch.C

/*
 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
 * 
 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Crossfire TRT 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 Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 * 
 * The authors can be reached via e-mail to <crossfire@schmorp.de>
 */

#include <cassert>

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

#include <tr1/functional>
#include <tr1/unordered_map>

/* The naming of these functions is really poor - they are all
 * pretty much named '.._arch_...', but they may more may not
 * return archetypes.  Some make the arch_to_object call, and thus
 * return an object.  Perhaps those should be called 'archob' functions
 * to denote they return an object derived from the archetype.
 * MSW 2003-04-29
 */

bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing

// the hashtable
typedef std::tr1::unordered_map
  <
    const char *,
    arch_ptr,
    str_hash,
    str_equal,
    slice_allocator< std::pair<const char *const, arch_ptr> >
  > HT;

static HT ht (5000);
archvec archetypes;

/**
 * GROS -  This function retrieves an archetype given the name that appears
 * during the game (for example, "writing pen" instead of "stylus").
 * It does not use the hashtable system, but browse the whole archlist each time.
 * I suggest not to use it unless you really need it because of performance issue.
 * It is currently used by scripting extensions (create-object).
 * Params:
 * - name: the name we're searching for (ex: "writing pen");
 * Return value:
 * - the archetype found or null if nothing was found.
 */
archetype *
find_archetype_by_object_name (const char *name)
{
  shstr_cmp name_cmp (name);

  for_all_archetypes (at)
    if (at->name == name_cmp)
      return at;

  return 0;
}

/**
 * This function retrieves an archetype by type and name that appears during
 * the game. It is basically the same as find_archetype_by_object_name()
 * except that it considers only items of the given type.
 */
archetype *
find_archetype_by_object_type_name (int type, const char *name)
{
  shstr_cmp name_cmp (name);

  for_all_archetypes (at)
    if (at->name == name_cmp && at->type == type)
      return at;

  return 0;
}

/* This is a lot like the above function.  Instead, we are trying to match
 * the arch->skill values.  type is the type of object to match
 * against (eg, to only match against skills or only skill objects for example).
 * If type is -1, ew don't match on type.
 */
object *
get_archetype_by_skill_name (const char *skill, int type)
{
  shstr_cmp skill_cmp (skill);

  for_all_archetypes (at)
    if (at->skill == skill_cmp && (type == -1 || type == at->type))
      return arch_to_object (at);

  return 0;
}

/* similiar to above - this returns the first archetype
 * that matches both the type and subtype.  type and subtype
 * can be -1 to say ignore, but in this case, the match it does
 * may not be very useful.  This function is most useful when
 * subtypes are known to be unique for a particular type
 * (eg, skills)
 */
archetype *
get_archetype_by_type_subtype (int type, int subtype)
{
  for_all_archetypes (at)
    if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype))
      return at;

  return 0;
}

/**
 * GROS - this returns a new object given the name that appears during the game
 * (for example, "writing pen" instead of "stylus").
 * Params:
 * - name: The name we're searching for (ex: "writing pen");
 * Return value:
 * - a corresponding object if found; a singularity object if not found.
 * Note by MSW - it appears that it takes the full name and keeps
 * shortening it until it finds a match.  I re-wrote this so that it
 * doesn't malloc it each time - not that this function is used much,
 * but it otherwise had a big memory leak.
 */
object *
get_archetype_by_object_name (const char *name)
{
  char tmpname[MAX_BUF];
  int i;

  assign (tmpname, name);

  for (i = strlen (tmpname); i > 0; i--)
    {
      tmpname[i] = 0;

      if (archetype *at = find_archetype_by_object_name (tmpname))
        return arch_to_object (at);
    }

  return create_singularity (name);
}

/* This is a subset of the parse_id command.  Basically, name can be
 * a string seperated lists of things to match, with certain keywords.
 * pl is the player (only needed to set count properly)
 * op is the item we are trying to match.  Calling function takes care
 * of what action might need to be done and if it is valid
 * (pickup, drop, etc.)  Return NONZERO if we have a match.  A higher
 * value means a better match.  0 means no match.
 *
 * Brief outline of the procedure:
 * We take apart the name variable into the individual components.
 * cases for 'all' and unpaid are pretty obvious.
 * Next, we check for a count (either specified in name, or in the
 * player object.)
 * If count is 1, make a quick check on the name.
 * IF count is >1, we need to make plural name.  Return if match.
 * Last, make a check on the full name.
 */
int
item_matched_string (object *pl, object *op, const char *name)
{
  char *cp, local_name[MAX_BUF];
  int count, retval = 0;

  assign (local_name, name);    /* strtok is destructive to name */

  for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
    {
      while (cp[0] == ' ')
        ++cp;                   /* get rid of spaces */

      /*      LOG(llevDebug,"Trying to match %s\n", cp); */
      /* All is a very generic match - low match value */
      if (!strcmp (cp, "all"))
        return 1;

      /* unpaid is a little more specific */
      if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
        return 2;
      if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED)))
        return 2;

      if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
        return 2;

      /* Allow for things like '100 arrows' */
      if ((count = atoi (cp)) != 0)
        {
          cp = strchr (cp, ' ');
          while (cp && cp[0] == ' ')
            ++cp;               /* get rid of spaces */
        }
      else
        {
          if (pl->type == PLAYER)
            count = pl->contr->count;
          else
            count = 0;
        }

      if (!cp || cp[0] == '\0' || count < 0)
        return 0;


      /* The code here should go from highest retval to lowest.  That
       * is because of the 'else' handling - we don't want to match on
       * something and set a low retval, even though it may match a higher retcal
       * later.  So keep it in descending order here, so we try for the best
       * match first, and work downward.
       */
      if (!strcasecmp (cp, query_name (op)))
        retval = 20;
      else if (!strcasecmp (cp, query_short_name (op)))
        retval = 18;
      else if (!strcasecmp (cp, query_base_name (op, 0)))
        retval = 16;
      else if (!strcasecmp (cp, query_base_name (op, 1)))
        retval = 16;
      else if (op->custom_name && !strcasecmp (cp, op->custom_name))
        retval = 15;
      else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
        retval = 14;
      else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
        retval = 14;
      /* Do substring checks, so things like 'Str+1' will match.
       * retval of these should perhaps be lower - they are lower
       * then the specific strcasecmp aboves, but still higher than
       * some other match criteria.
       */
      else if (strstr (query_base_name (op, 1), cp))
        retval = 12;
      else if (strstr (query_base_name (op, 0), cp))
        retval = 12;
      else if (strstr (query_short_name (op), cp))
        retval = 12;
      /* Check against plural/non plural based on count. */
      else if (count > 1 && !strcasecmp (cp, op->name_pl))
        retval = 6;
      else if (count == 1 && !strcasecmp (op->name, cp))
        retval = 6;
      /* base name matched - not bad */
      else if (strcasecmp (cp, op->name) == 0 && !count)
        retval = 4;
      /* Check for partial custom name, but give a real low priority */
      else if (op->custom_name && strstr (op->custom_name, cp))
        retval = 3;

      if (retval)
        {
          if (pl->type == PLAYER)
            pl->contr->count = count;

          return retval;
        }
    }

  return 0;
}

archetype::archetype (const char *name)
{
  stub = true;
  arch = this;
  this->archname = this->name = this->name_pl = name;
}

archetype::~archetype ()
{
  unlink ();
}

void
archetype::link ()
{
  ht.insert (std::make_pair (archname, this));

  if (!archetypes.contains (this))
    archetypes.insert (this);
}

void
archetype::unlink ()
{
  ht.erase (archname);
  if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D
  if (archetypes.contains (this))
    archetypes.erase (this);
}

/*
 * Finds, using the hashtable, which archetype matches the given name.
 * returns a pointer to the found archetype, otherwise NULL.
 */
archetype *
archetype::find (const char *name)
{
  if (!name)
    return 0;

  auto (i, ht.find (name));

  if (i == ht.end ())
    return 0;
  else
    return i->second;
}

archetype *
archetype::get (const char *name)
{
  if (!name)
    {
      LOG (llevError, "null archetype requested\n");
      name = "(null)";
    }

  archetype *at = find (name);

  if (!at)
    {
      at = new archetype (name);
      at->link ();
    }

  return at;
}

archetype *
archetype::read (object_thawer &f)
{
  assert (f.kw == KW_object);

  loading_arch = true; // hack to tell parse_kv et al. to behave

  std::vector<archetype *> parts;

  coroapi::cede_to_tick_every (10);

  for (;;)
    {
      // the archetype might have been referenced earlier
      // so try to find an existing stub archetype first
      archetype *at = find (f.get_str ());

      if (!at || !at->stub)
        at = new archetype (f.get_str ());

      f.next ();

#if 0
      // implementing it here in the server does neither allow multiple inheritence
      // nor does it cleanly "just override". it would allow use in map files, though,
      // and other resource files dynamically laoded (as opposed to being preprocessed).
      // not that any of this is relevant as of yet...
      if (f.kw == KW_inherit)
        {
          if (archetype *at = find (f.get_str ()))
            *op = at->clone;
          else
            LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
                 &at->archname, f.get_str ());

          f.next ();
        }
#endif

      if (!at->parse_kv (f))
        goto fail;

      at->post_load_check ();

      parts.push_back (at);

      if (f.kw != KW_more)
        break;

      f.next ();

      if (f.kw != KW_object)
        {
          f.parse_error ("more object");
          goto fail;
        }
    }

  loading_arch = false;

  {
    auto (at, parts.begin ());

    archetype *new_head = parts.front ();
    archetype *old_head = find (new_head->archname);

    if (old_head && !old_head->is_head ())
      {
        LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
             &new_head->archname, &old_head->archname);
        goto fail;
      }

    // check that all archetypes belong to the same old object or are new
    for (auto (at, parts.begin ()); at != parts.end (); ++at)
      {
        archetype *new_part = *at;
        archetype *old_part = find (new_part->archname);

        if (old_part && old_part->head_ () != old_head)
          {
            LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
                 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
            goto fail;
          }
      }

    // deactivate existing archetype
    for (archetype *at = old_head; at; at = (archetype *)at->more)
      at->unlink ();

    // assemble new chain
    new_head->min_x = new_head->max_x = new_head->x;
    new_head->min_y = new_head->max_y = new_head->y;

    archetype *less = new_head;
    for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
      {
        archetype *at = *p;

        if (at->x < new_head->min_x) new_head->min_x = at->x;
        if (at->y < new_head->min_y) new_head->min_y = at->y;
        if (at->x > new_head->max_x) new_head->max_x = at->x;
        if (at->y > new_head->max_y) new_head->max_y = at->y;

        at->head = new_head;
        less->more = at;
        less = at;
      }

    // now activate it
    for (auto (p, parts.begin ()); p != parts.end (); ++p)
      {
        archetype *at = *p;
        at->stub = false;
        at->link ();
      }

    return new_head;
  }

fail:
  for (auto (p, parts.begin ()); p != parts.end (); ++p)
    (*p)->destroy (true);

  loading_arch = false;
  return 0;
}

/*
 * Initialize global archtype pointers:
 */
void
init_archetype_pointers ()
{
  ring_arch       = archetype::find ("ring");
  amulet_arch     = archetype::find ("amulet");
  staff_arch      = archetype::find ("staff");
  crown_arch      = archetype::find ("crown");
  empty_archetype = archetype::find ("empty_archetype");
}

/*
 * Creates and returns a new object which is a copy of the given archetype.
 * This function returns NULL on failure.
 */
object *
arch_to_object (archetype *at)
{
  if (!at)
    {
      LOG (llevError, "Couldn't find archetype.\n");
      return 0;
    }

  object *op = at->clone ();
  op->arch = at;
  op->instantiate ();

  return op;
}

/*
 * Creates an object.  This function is called by get_archetype()
 * if it fails to find the appropriate archetype.
 * Thus get_archetype() will be guaranteed to always return
 * an object, and never NULL.
 */
object *
create_singularity (const char *name)
{
  LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);

  if (!strcmp (name, "bug"))
    abort ();

  char buf[MAX_BUF];
  sprintf (buf, "bug, please report (%s)", name);

  object *op = get_archetype ("bug");
  op->name = op->name_pl = buf;

  return op;
}

/*
 * Finds which archetype matches the given name, and returns a new
 * object containing a copy of the archetype.
 */
object *
get_archetype (const char *name)
{
  archetype *at = archetype::find (name);

  if (!at)
    return create_singularity (name);

  return arch_to_object (at);
}

/*
 * Returns the first archetype using the given type.
 * Used in treasure-generation.
 */
archetype *
type_to_archetype (int type)
{
  for_all_archetypes (at)
    if (at->type == type && at->head_ () != at)
      return at;

  return 0;
}

/*
 * Returns a new object copied from the first archetype matching
 * the given type.
 * Used in treasure-generation.
 */
object *
clone_arch (int type)
{
  archetype *at;

  if ((at = type_to_archetype (type)) == NULL)
    {
      LOG (llevError, "Can't clone archetype %d\n", type);
      return 0;
    }

  object *op = at->clone ();
  op->instantiate ();
  return op;
}

/*
 * member: make instance from class
 */
object *
object_create_arch (archetype *at)
{
  object *op, *prev = 0, *head = 0;

  while (at)
    {
      op = arch_to_object (at);

      op->x = at->x;
      op->y = at->y;

      if (head)
        op->head = head, prev->more = op;

      if (!head)
        head = op;

      prev = op;
      at = (archetype *)at->more;
    }

  return head;
}

Revision:	1.66
Committed:	Thu Jun 7 19:12:22 2007 UTC (16 years, 11 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.65:	+3 -3 lines
Log Message:	- new map header boolean "no_reset 1" to deny reset. - allow reset of per-player maps, effectviely implementing player-private dungeons. - re-enabled reset-on-load feature again. - remove fail-safe mechanism that prevented per-player maps from being reset. keep your fingers crossed. - fixed two bugs in archetype finding (archname vs. object name). - singularities no longer crash the server but will log a backtrace now as they are really are fatal.
#	User	Rev	Content
1	elmex	1.1	/*
2	root	1.61	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3	pippijn	1.37	*
4	root	1.61	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5			* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6			* Copyright (©) 1992,2007 Frank Tore Johansen
7	pippijn	1.37	*
8	root	1.61	* Crossfire TRT is free software; you can redistribute it and/or modify it
9			* under the terms of the GNU General Public License as published by the Free
10			* Software Foundation; either version 2 of the License, or (at your option)
11			* any later version.
12	pippijn	1.37	*
13	root	1.61	* This program is distributed in the hope that it will be useful, but
14			* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15			* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16			* for more details.
17	pippijn	1.37	*
18	root	1.61	* You should have received a copy of the GNU General Public License along
19			* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20			* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21			*
22			* The authors can be reached via e-mail to <crossfire@schmorp.de>
23	pippijn	1.37	*/
24	elmex	1.1
25	root	1.12	#include <cassert>
26
27	elmex	1.1	#include <global.h>
28			#include <funcpoint.h>
29			#include <loader.h>
30
31	root	1.38	#include <tr1/functional>
32			#include <tr1/unordered_map>
33	elmex	1.1
34			/* The naming of these functions is really poor - they are all
35			* pretty much named '.._arch_...', but they may more may not
36			* return archetypes. Some make the arch_to_object call, and thus
37			* return an object. Perhaps those should be called 'archob' functions
38			* to denote they return an object derived from the archetype.
39			* MSW 2003-04-29
40			*/
41
42	root	1.46	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
43
44	root	1.12	// the hashtable
45	root	1.18	typedef std::tr1::unordered_map
46			<
47	root	1.38	const char *,
48	root	1.26	arch_ptr,
49	root	1.38	str_hash,
50			str_equal,
51			slice_allocator< std::pair<const char *const, arch_ptr> >
52	root	1.18	> HT;
53
54	root	1.38	static HT ht (5000);
55	root	1.62	archvec archetypes;
56	root	1.12
57	elmex	1.1	/**
58			* GROS - This function retrieves an archetype given the name that appears
59			* during the game (for example, "writing pen" instead of "stylus").
60			* It does not use the hashtable system, but browse the whole archlist each time.
61			* I suggest not to use it unless you really need it because of performance issue.
62			* It is currently used by scripting extensions (create-object).
63			* Params:
64			* - name: the name we're searching for (ex: "writing pen");
65			* Return value:
66			* - the archetype found or null if nothing was found.
67			*/
68	root	1.12	archetype *
69			find_archetype_by_object_name (const char *name)
70			{
71	root	1.39	shstr_cmp name_cmp (name);
72	elmex	1.1
73	root	1.63	for_all_archetypes (at)
74	root	1.66	if (at->name == name_cmp)
75	root	1.39	return at;
76	elmex	1.1
77	root	1.39	return 0;
78	elmex	1.1	}
79
80			/**
81			* This function retrieves an archetype by type and name that appears during
82			* the game. It is basically the same as find_archetype_by_object_name()
83			* except that it considers only items of the given type.
84			*/
85	root	1.12	archetype *
86			find_archetype_by_object_type_name (int type, const char *name)
87			{
88	root	1.39	shstr_cmp name_cmp (name);
89	elmex	1.1
90	root	1.63	for_all_archetypes (at)
91	root	1.66	if (at->name == name_cmp && at->type == type)
92	root	1.39	return at;
93	elmex	1.1
94	root	1.39	return 0;
95	elmex	1.1	}
96
97			/* This is a lot like the above function. Instead, we are trying to match
98			* the arch->skill values. type is the type of object to match
99			* against (eg, to only match against skills or only skill objects for example).
100			* If type is -1, ew don't match on type.
101			*/
102	root	1.12	object *
103			get_archetype_by_skill_name (const char *skill, int type)
104			{
105	root	1.39	shstr_cmp skill_cmp (skill);
106	elmex	1.1
107	root	1.63	for_all_archetypes (at)
108			if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
109	root	1.39	return arch_to_object (at);
110	root	1.35
111			return 0;
112	elmex	1.1	}
113
114			/* similiar to above - this returns the first archetype
115			* that matches both the type and subtype. type and subtype
116			* can be -1 to say ignore, but in this case, the match it does
117			* may not be very useful. This function is most useful when
118			* subtypes are known to be unique for a particular type
119			* (eg, skills)
120			*/
121	root	1.12	archetype *
122			get_archetype_by_type_subtype (int type, int subtype)
123			{
124	root	1.63	for_all_archetypes (at)
125			if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
126	root	1.39	return at;
127	elmex	1.1
128	root	1.39	return 0;
129	elmex	1.1	}
130
131			/**
132			* GROS - this returns a new object given the name that appears during the game
133			* (for example, "writing pen" instead of "stylus").
134			* Params:
135			* - name: The name we're searching for (ex: "writing pen");
136			* Return value:
137			* - a corresponding object if found; a singularity object if not found.
138			* Note by MSW - it appears that it takes the full name and keeps
139			* shortening it until it finds a match. I re-wrote this so that it
140			* doesn't malloc it each time - not that this function is used much,
141			* but it otherwise had a big memory leak.
142			*/
143	root	1.12	object *
144			get_archetype_by_object_name (const char *name)
145			{
146	root	1.17	char tmpname[MAX_BUF];
147			int i;
148
149			assign (tmpname, name);
150	root	1.12
151			for (i = strlen (tmpname); i > 0; i--)
152			{
153			tmpname[i] = 0;
154	root	1.17
155	root	1.39	if (archetype *at = find_archetype_by_object_name (tmpname))
156	root	1.20	return arch_to_object (at);
157	elmex	1.1	}
158	root	1.17
159	root	1.12	return create_singularity (name);
160	elmex	1.1	}
161
162	root	1.65	/* This is a subset of the parse_id command. Basically, name can be
163			* a string seperated lists of things to match, with certain keywords.
164			* pl is the player (only needed to set count properly)
165			* op is the item we are trying to match. Calling function takes care
166			* of what action might need to be done and if it is valid
167			* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
168			* value means a better match. 0 means no match.
169			*
170			* Brief outline of the procedure:
171			* We take apart the name variable into the individual components.
172			* cases for 'all' and unpaid are pretty obvious.
173			* Next, we check for a count (either specified in name, or in the
174			* player object.)
175			* If count is 1, make a quick check on the name.
176			* IF count is >1, we need to make plural name. Return if match.
177			* Last, make a check on the full name.
178			*/
179	root	1.12	int
180	root	1.15	item_matched_string (object pl, object op, const char *name)
181	elmex	1.1	{
182	root	1.22	char *cp, local_name[MAX_BUF];
183			int count, retval = 0;
184	root	1.15
185	root	1.40	assign (local_name, name); /* strtok is destructive to name */
186	root	1.12
187			for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
188			{
189			while (cp[0] == ' ')
190			++cp; /* get rid of spaces */
191
192			/* LOG(llevDebug,"Trying to match %s\n", cp); */
193			/* All is a very generic match - low match value */
194			if (!strcmp (cp, "all"))
195			return 1;
196
197			/* unpaid is a little more specific */
198			if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
199			return 2;
200			if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) \|\| QUERY_FLAG (op, FLAG_DAMNED)))
201			return 2;
202
203			if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
204			return 2;
205
206			/* Allow for things like '100 arrows' */
207			if ((count = atoi (cp)) != 0)
208			{
209			cp = strchr (cp, ' ');
210			while (cp && cp[0] == ' ')
211			++cp; /* get rid of spaces */
212			}
213			else
214			{
215			if (pl->type == PLAYER)
216			count = pl->contr->count;
217			else
218			count = 0;
219			}
220
221			if (!cp \|\| cp[0] == '\0' \|\| count < 0)
222			return 0;
223
224
225			/* The code here should go from highest retval to lowest. That
226			* is because of the 'else' handling - we don't want to match on
227			* something and set a low retval, even though it may match a higher retcal
228			* later. So keep it in descending order here, so we try for the best
229			* match first, and work downward.
230			*/
231			if (!strcasecmp (cp, query_name (op)))
232			retval = 20;
233			else if (!strcasecmp (cp, query_short_name (op)))
234			retval = 18;
235			else if (!strcasecmp (cp, query_base_name (op, 0)))
236			retval = 16;
237			else if (!strcasecmp (cp, query_base_name (op, 1)))
238			retval = 16;
239			else if (op->custom_name && !strcasecmp (cp, op->custom_name))
240			retval = 15;
241			else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
242			retval = 14;
243			else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
244			retval = 14;
245			/* Do substring checks, so things like 'Str+1' will match.
246			* retval of these should perhaps be lower - they are lower
247			* then the specific strcasecmp aboves, but still higher than
248			* some other match criteria.
249			*/
250			else if (strstr (query_base_name (op, 1), cp))
251			retval = 12;
252			else if (strstr (query_base_name (op, 0), cp))
253			retval = 12;
254			else if (strstr (query_short_name (op), cp))
255			retval = 12;
256			/* Check against plural/non plural based on count. */
257			else if (count > 1 && !strcasecmp (cp, op->name_pl))
258	root	1.23	retval = 6;
259	root	1.12	else if (count == 1 && !strcasecmp (op->name, cp))
260	root	1.23	retval = 6;
261	root	1.12	/* base name matched - not bad */
262			else if (strcasecmp (cp, op->name) == 0 && !count)
263			retval = 4;
264			/* Check for partial custom name, but give a real low priority */
265			else if (op->custom_name && strstr (op->custom_name, cp))
266			retval = 3;
267
268			if (retval)
269			{
270			if (pl->type == PLAYER)
271			pl->contr->count = count;
272	root	1.23
273	root	1.12	return retval;
274	root	1.7	}
275	elmex	1.1	}
276	root	1.23
277	root	1.12	return 0;
278	elmex	1.1	}
279
280	root	1.63	archetype::archetype (const char *name)
281	root	1.12	{
282	root	1.63	stub = true;
283			arch = this;
284			this->archname = this->name = this->name_pl = name;
285	root	1.46	}
286	root	1.12
287	root	1.46	archetype::~archetype ()
288			{
289	root	1.63	unlink ();
290	elmex	1.1	}
291
292	root	1.63	void
293			archetype::link ()
294	elmex	1.1	{
295	root	1.63	ht.insert (std::make_pair (archname, this));
296	elmex	1.1
297	root	1.63	if (!archetypes.contains (this))
298			archetypes.insert (this);
299	elmex	1.1	}
300
301	root	1.46	void
302	root	1.63	archetype::unlink ()
303			{
304			ht.erase (archname);
305	root	1.64	if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D
306	root	1.63	if (archetypes.contains (this))
307			archetypes.erase (this);
308			}
309
310			/*
311			* Finds, using the hashtable, which archetype matches the given name.
312			* returns a pointer to the found archetype, otherwise NULL.
313			*/
314			archetype *
315			archetype::find (const char *name)
316			{
317			if (!name)
318			return 0;
319
320			auto (i, ht.find (name));
321
322			if (i == ht.end ())
323			return 0;
324			else
325			return i->second;
326			}
327
328			archetype *
329			archetype::get (const char *name)
330	root	1.12	{
331	root	1.63	if (!name)
332			{
333			LOG (llevError, "null archetype requested\n");
334			name = "(null)";
335			}
336	root	1.55
337	root	1.63	archetype *at = find (name);
338	root	1.49
339	root	1.64	if (!at)
340	root	1.63	{
341			at = new archetype (name);
342			at->link ();
343			}
344
345			return at;
346	elmex	1.1	}
347
348	root	1.53	archetype *
349			archetype::read (object_thawer &f)
350	root	1.12	{
351	root	1.43	assert (f.kw == KW_object);
352
353	root	1.53	loading_arch = true; // hack to tell parse_kv et al. to behave
354
355	root	1.63	std::vector<archetype *> parts;
356	root	1.12
357	root	1.63	coroapi::cede_to_tick_every (10);
358	root	1.52
359	root	1.49	for (;;)
360	root	1.43	{
361	root	1.63	// the archetype might have been referenced earlier
362			// so try to find an existing stub archetype first
363			archetype *at = find (f.get_str ());
364
365			if (!at \|\| !at->stub)
366			at = new archetype (f.get_str ());
367
368	root	1.54	f.next ();
369	root	1.49
370	root	1.56	#if 0
371	root	1.63	// implementing it here in the server does neither allow multiple inheritence
372			// nor does it cleanly "just override". it would allow use in map files, though,
373			// and other resource files dynamically laoded (as opposed to being preprocessed).
374			// not that any of this is relevant as of yet...
375	root	1.55	if (f.kw == KW_inherit)
376			{
377			if (archetype *at = find (f.get_str ()))
378			*op = at->clone;
379			else
380			LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
381	root	1.63	&at->archname, f.get_str ());
382	root	1.55
383			f.next ();
384			}
385	root	1.56	#endif
386	root	1.55
387	root	1.63	if (!at->parse_kv (f))
388	root	1.49	goto fail;
389
390	root	1.63	at->post_load_check ();
391	root	1.59
392	root	1.63	parts.push_back (at);
393	root	1.12
394	root	1.49	if (f.kw != KW_more)
395			break;
396	root	1.46
397	root	1.43	f.next ();
398	root	1.54
399			if (f.kw != KW_object)
400			{
401			f.parse_error ("more object");
402			goto fail;
403			}
404	root	1.49	}
405	root	1.43
406	root	1.63	loading_arch = false;
407
408	root	1.49	{
409	root	1.63	auto (at, parts.begin ());
410	root	1.12
411	root	1.63	archetype *new_head = parts.front ();
412			archetype *old_head = find (new_head->archname);
413
414	root	1.64	if (old_head && !old_head->is_head ())
415			{
416			LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
417			&new_head->archname, &old_head->archname);
418			goto fail;
419			}
420	root	1.63
421			// check that all archetypes belong to the same old object or are new
422			for (auto (at, parts.begin ()); at != parts.end (); ++at)
423	root	1.49	{
424	root	1.63	archetype new_part = at;
425			archetype *old_part = find (new_part->archname);
426	root	1.49
427	root	1.63	if (old_part && old_part->head_ () != old_head)
428	root	1.49	{
429	root	1.63	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
430			&new_part->archname, &((archetype *)old_part->head_ ())->archname);
431	root	1.49	goto fail;
432			}
433			}
434
435	root	1.63	// deactivate existing archetype
436			for (archetype at = old_head; at; at = (archetype )at->more)
437			at->unlink ();
438	root	1.49
439	root	1.64	// assemble new chain
440	root	1.63	new_head->min_x = new_head->max_x = new_head->x;
441			new_head->min_y = new_head->max_y = new_head->y;
442	root	1.49
443	root	1.63	archetype *less = new_head;
444	root	1.51	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
445	root	1.49	{
446	root	1.63	archetype at = p;
447	root	1.49
448	root	1.63	if (at->x < new_head->min_x) new_head->min_x = at->x;
449			if (at->y < new_head->min_y) new_head->min_y = at->y;
450			if (at->x > new_head->max_x) new_head->max_x = at->x;
451			if (at->y > new_head->max_y) new_head->max_y = at->y;
452	root	1.49
453	root	1.64	at->head = new_head;
454			less->more = at;
455			less = at;
456	root	1.63	}
457	root	1.49
458	root	1.63	// now activate it
459			for (auto (p, parts.begin ()); p != parts.end (); ++p)
460			{
461			archetype at = p;
462			at->stub = false;
463			at->link ();
464	root	1.49	}
465	root	1.53
466	root	1.63	return new_head;
467	root	1.49	}
468	root	1.43
469	root	1.49	fail:
470	root	1.51	for (auto (p, parts.begin ()); p != parts.end (); ++p)
471	root	1.63	(*p)->destroy (true);
472	root	1.43
473	root	1.53	loading_arch = false;
474			return 0;
475	root	1.43	}
476
477			/*
478	root	1.53	* Initialize global archtype pointers:
479	root	1.43	*/
480	root	1.53	void
481			init_archetype_pointers ()
482	root	1.43	{
483	root	1.53	ring_arch = archetype::find ("ring");
484			amulet_arch = archetype::find ("amulet");
485			staff_arch = archetype::find ("staff");
486			crown_arch = archetype::find ("crown");
487	root	1.48	empty_archetype = archetype::find ("empty_archetype");
488	elmex	1.1	}
489
490			/*
491			* Creates and returns a new object which is a copy of the given archetype.
492			* This function returns NULL on failure.
493			*/
494	root	1.12	object *
495	root	1.15	arch_to_object (archetype *at)
496	root	1.12	{
497	root	1.43	if (!at)
498	root	1.12	{
499	root	1.53	LOG (llevError, "Couldn't find archetype.\n");
500			return 0;
501	root	1.12	}
502	root	1.15
503	root	1.63	object *op = at->clone ();
504	root	1.15	op->arch = at;
505	root	1.2	op->instantiate ();
506	root	1.53
507	elmex	1.1	return op;
508			}
509
510			/*
511			* Creates an object. This function is called by get_archetype()
512			* if it fails to find the appropriate archetype.
513			* Thus get_archetype() will be guaranteed to always return
514			* an object, and never NULL.
515			*/
516	root	1.12	object *
517			create_singularity (const char *name)
518			{
519	root	1.65	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
520
521			if (!strcmp (name, "bug"))
522			abort ();
523
524	root	1.20	char buf[MAX_BUF];
525	root	1.66	sprintf (buf, "bug, please report (%s)", name);
526	root	1.15
527	root	1.65	object *op = get_archetype ("bug");
528	root	1.10	op->name = op->name_pl = buf;
529	root	1.65
530	elmex	1.1	return op;
531			}
532
533			/*
534			* Finds which archetype matches the given name, and returns a new
535			* object containing a copy of the archetype.
536			*/
537	root	1.12	object *
538			get_archetype (const char *name)
539			{
540	root	1.20	archetype *at = archetype::find (name);
541	root	1.15
542	root	1.20	if (!at)
543	root	1.12	return create_singularity (name);
544	root	1.15
545	root	1.12	return arch_to_object (at);
546	elmex	1.1	}
547
548			/*
549			* Returns the first archetype using the given type.
550			* Used in treasure-generation.
551			*/
552	root	1.12	archetype *
553			type_to_archetype (int type)
554			{
555	root	1.63	for_all_archetypes (at)
556			if (at->type == type && at->head_ () != at)
557	elmex	1.1	return at;
558	root	1.20
559			return 0;
560	elmex	1.1	}
561
562			/*
563			* Returns a new object copied from the first archetype matching
564			* the given type.
565			* Used in treasure-generation.
566			*/
567	root	1.12	object *
568			clone_arch (int type)
569			{
570	root	1.20	archetype *at;
571	elmex	1.1
572	root	1.12	if ((at = type_to_archetype (type)) == NULL)
573			{
574			LOG (llevError, "Can't clone archetype %d\n", type);
575	root	1.30	return 0;
576	root	1.12	}
577	root	1.20
578	root	1.63	object *op = at->clone ();
579	root	1.3	op->instantiate ();
580	elmex	1.1	return op;
581			}
582
583			/*
584			* member: make instance from class
585			*/
586	root	1.12	object *
587	root	1.15	object_create_arch (archetype *at)
588	elmex	1.1	{
589	root	1.20	object op, prev = 0, *head = 0;
590	elmex	1.1
591	root	1.12	while (at)
592			{
593			op = arch_to_object (at);
594	root	1.63
595			op->x = at->x;
596			op->y = at->y;
597	root	1.20
598	root	1.12	if (head)
599			op->head = head, prev->more = op;
600	root	1.20
601	root	1.12	if (!head)
602			head = op;
603	root	1.20
604	root	1.12	prev = op;
605	root	1.63	at = (archetype *)at->more;
606	elmex	1.1	}
607	root	1.20
608	root	1.63	return head;
609	elmex	1.1	}
610