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 (archetype *at = first_archetype; at; at = at->next)
    if (at->clone.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 (archetype *at = first_archetype; at; at = at->next)
    if (at->clone.name == name_cmp && at->clone.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 (archetype *at = first_archetype; at; at = at->next)
    if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.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 (archetype *at = first_archetype; at; at = at->next)
    if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.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 ()
{
  clone.arch = this;

  CLEAR_FLAG (&clone, FLAG_FREED);      /* This shouldn't matter, since copy_to */
  SET_FLAG (&clone, FLAG_REMOVED);      /* doesn't copy these flags... */
}

archetype::~archetype ()
{
  //TODO: nuke ->more's
}

static void
unlink (archetype *at)
{
  if (at->head)
    at = at->head;

  // destroy this archetype's link, making singletons out of its parts
  while (at)
    {
      archetype *more = at->more;
      at->clone.destroy_inv ();
      at->head = at->more = 0;
      at = more;
    }
}

// dire hack, need to rationalise
void
overwrite (archetype *at, object *op)
{
  at->clone = *op;
  at->clone.arch = at;

  at->clone.inv = op->inv; op->inv = 0;

  op->destroy ();
}

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

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

  typedef std::pair<archetype *, object *> part;
  std::vector<part> parts;

  coroapi::cede_to_tick_every (100);

  for (;;)
    {
      object *op = object::create ();
      archetype *at = get (f.get_str ());
      f.get (op->name);
      f.next ();

#if 0
      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->name, f.get_str ());

          f.next ();
        }
#endif

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

      op->post_load_check ();

      parts.push_back (std::make_pair (at, op));

      if (f.kw != KW_more)
        break;

      f.next ();

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

  {
    archetype *head = parts.front ().first;

    // check that all archetypes belong to the same object or are heads
    for (auto (p, parts.begin ()); p != parts.end (); ++p)
      {
        archetype *at = p->first;

        if (at->head != head && at->head)
          {
            LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->archname);
            goto fail;
          }

        if (at->next && at != head)
          {
            LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->archname);
            goto fail;
          }
      }

    // sever chain of existing head object
    for (archetype *more, *at = head; at; at = more)
      {
        more = at->more;

        at->head = 0;
        at->more = 0;
      }

    // replace/update head
    overwrite (head, parts.front ().second);
    head->tail_x = 0;
    head->tail_y = 0;

    // link into list of heads, if not already there
    if (!head->linked)
      {
        head->linked = true;
        head->next = first_archetype;
        first_archetype = head;
      }

    // reassemble new chain
    archetype *prev = head;
    for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
      {
        archetype *at = p->first;
        overwrite (at, p->second);

        if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
        if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;

        at->head         = head;
        at->clone.head   = &head->clone;
        prev->more       = at;
        prev->clone.more = &at->clone;

        prev = at;
      }

    loading_arch = false;
    return head;
  }

fail:
  for (auto (p, parts.begin ()); p != parts.end (); ++p)
    p->second->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.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)
{
  object *op;
  char buf[MAX_BUF];

  sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
  op = object::create ();
  op->name = op->name_pl = buf;
  SET_FLAG (op, FLAG_NO_PICK);
  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);
}

/*
 * 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)
    {
      archetypes.insert (at = new archetype);
      at->archname = at->clone.name = at->clone.name_pl = name;
      at->hash_add ();
    }

  return at;
}

/*
 * Adds an archetype to the hashtable.
 */
void
archetype::hash_add ()
{
  ht.insert (std::make_pair (archname, this));
}

void
archetype::hash_del ()
{
  ht.erase (archname);
}

/*
 * Returns the first archetype using the given type.
 * Used in treasure-generation.
 */
archetype *
type_to_archetype (int type)
{
  for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
    if (at->clone.type == type)
      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.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->clone.x;
      op->y = at->clone.y;

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

      if (!head)
        head = op;

      prev = op;
      at = at->more;
    }

  return (head);
}

Revision:	1.62
Committed:	Mon Jun 4 12:19:08 2007 UTC (16 years, 11 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.61:	+7 -7 lines
Log Message:	rename arch->name to arch->archname for preparation of subclassing object
#	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.39	for (archetype *at = first_archetype; at; at = at->next)
74			if (at->clone.name == name_cmp)
75			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.39	for (archetype *at = first_archetype; at; at = at->next)
91			if (at->clone.name == name_cmp && at->clone.type == type)
92			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.39	for (archetype *at = first_archetype; at; at = at->next)
108			if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))
109			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.39	for (archetype *at = first_archetype; at; at = at->next)
125			if ((type == -1 \|\| type == at->clone.type) && (subtype == -1 \|\| subtype == at->clone.subtype))
126			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			/* 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.46	archetype::archetype ()
281	root	1.12	{
282	root	1.46	clone.arch = this;
283	root	1.12
284	root	1.46	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
285			SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
286			}
287	root	1.12
288	root	1.46	archetype::~archetype ()
289			{
290			//TODO: nuke ->more's
291	elmex	1.1	}
292
293	root	1.46	static void
294			unlink (archetype *at)
295	elmex	1.1	{
296	root	1.46	if (at->head)
297			at = at->head;
298	elmex	1.1
299	root	1.46	// destroy this archetype's link, making singletons out of its parts
300			while (at)
301	root	1.12	{
302	root	1.46	archetype *more = at->more;
303			at->clone.destroy_inv ();
304			at->head = at->more = 0;
305			at = more;
306	elmex	1.1	}
307			}
308
309	root	1.46	// dire hack, need to rationalise
310			void
311			overwrite (archetype at, object op)
312	root	1.12	{
313	root	1.46	at->clone = *op;
314			at->clone.arch = at;
315	root	1.55
316	root	1.49	at->clone.inv = op->inv; op->inv = 0;
317
318			op->destroy ();
319	elmex	1.1	}
320
321	root	1.53	archetype *
322			archetype::read (object_thawer &f)
323	root	1.12	{
324	root	1.43	assert (f.kw == KW_object);
325
326	root	1.53	loading_arch = true; // hack to tell parse_kv et al. to behave
327
328	root	1.49	typedef std::pair<archetype , object > part;
329			std::vector<part> parts;
330	root	1.12
331	root	1.52	coroapi::cede_to_tick_every (100);
332
333	root	1.49	for (;;)
334	root	1.43	{
335	root	1.54	object *op = object::create ();
336	root	1.49	archetype *at = get (f.get_str ());
337	root	1.54	f.get (op->name);
338			f.next ();
339	root	1.49
340	root	1.56	#if 0
341	root	1.55	if (f.kw == KW_inherit)
342			{
343			if (archetype *at = find (f.get_str ()))
344			*op = at->clone;
345			else
346			LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
347			&at->name, f.get_str ());
348
349			f.next ();
350			}
351	root	1.56	#endif
352	root	1.55
353	root	1.49	if (!op->parse_kv (f))
354			goto fail;
355
356	root	1.59	op->post_load_check ();
357
358	root	1.49	parts.push_back (std::make_pair (at, op));
359	root	1.12
360	root	1.49	if (f.kw != KW_more)
361			break;
362	root	1.46
363	root	1.43	f.next ();
364	root	1.54
365			if (f.kw != KW_object)
366			{
367			f.parse_error ("more object");
368			goto fail;
369			}
370	root	1.49	}
371	root	1.43
372	root	1.49	{
373			archetype *head = parts.front ().first;
374	root	1.12
375	root	1.49	// check that all archetypes belong to the same object or are heads
376	root	1.51	for (auto (p, parts.begin ()); p != parts.end (); ++p)
377	root	1.49	{
378			archetype *at = p->first;
379
380			if (at->head != head && at->head)
381			{
382	root	1.62	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->archname);
383	root	1.49	goto fail;
384			}
385
386			if (at->next && at != head)
387			{
388	root	1.62	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->archname);
389	root	1.49	goto fail;
390			}
391			}
392
393			// sever chain of existing head object
394			for (archetype more, at = head; at; at = more)
395			{
396			more = at->more;
397
398			at->head = 0;
399			at->more = 0;
400			}
401
402			// replace/update head
403			overwrite (head, parts.front ().second);
404			head->tail_x = 0;
405			head->tail_y = 0;
406
407			// link into list of heads, if not already there
408	root	1.50	if (!head->linked)
409	root	1.49	{
410	root	1.50	head->linked = true;
411	root	1.49	head->next = first_archetype;
412			first_archetype = head;
413			}
414
415			// reassemble new chain
416			archetype *prev = head;
417	root	1.51	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
418	root	1.49	{
419			archetype *at = p->first;
420			overwrite (at, p->second);
421
422			if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
423			if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
424
425			at->head = head;
426			at->clone.head = &head->clone;
427			prev->more = at;
428			prev->clone.more = &at->clone;
429
430			prev = at;
431			}
432	root	1.53
433			loading_arch = false;
434			return head;
435	root	1.49	}
436	root	1.43
437	root	1.49	fail:
438	root	1.51	for (auto (p, parts.begin ()); p != parts.end (); ++p)
439	root	1.49	p->second->destroy (true);
440	root	1.43
441	root	1.53	loading_arch = false;
442			return 0;
443	root	1.43	}
444
445			/*
446	root	1.53	* Initialize global archtype pointers:
447	root	1.43	*/
448	root	1.53	void
449			init_archetype_pointers ()
450	root	1.43	{
451	root	1.53	ring_arch = archetype::find ("ring");
452			amulet_arch = archetype::find ("amulet");
453			staff_arch = archetype::find ("staff");
454			crown_arch = archetype::find ("crown");
455	root	1.48	empty_archetype = archetype::find ("empty_archetype");
456	elmex	1.1	}
457
458			/*
459			* Creates and returns a new object which is a copy of the given archetype.
460			* This function returns NULL on failure.
461			*/
462	root	1.12	object *
463	root	1.15	arch_to_object (archetype *at)
464	root	1.12	{
465	root	1.43	if (!at)
466	root	1.12	{
467	root	1.53	LOG (llevError, "Couldn't find archetype.\n");
468			return 0;
469	root	1.12	}
470	root	1.15
471	root	1.43	object *op = at->clone.clone ();
472	root	1.15	op->arch = at;
473	root	1.2	op->instantiate ();
474	root	1.53
475	elmex	1.1	return op;
476			}
477
478			/*
479			* Creates an object. This function is called by get_archetype()
480			* if it fails to find the appropriate archetype.
481			* Thus get_archetype() will be guaranteed to always return
482			* an object, and never NULL.
483			*/
484	root	1.12	object *
485			create_singularity (const char *name)
486			{
487	root	1.22	object *op;
488	root	1.20	char buf[MAX_BUF];
489	root	1.15
490	root	1.12	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
491	root	1.29	op = object::create ();
492	root	1.10	op->name = op->name_pl = buf;
493	root	1.12	SET_FLAG (op, FLAG_NO_PICK);
494	elmex	1.1	return op;
495			}
496
497			/*
498			* Finds which archetype matches the given name, and returns a new
499			* object containing a copy of the archetype.
500			*/
501	root	1.12	object *
502			get_archetype (const char *name)
503			{
504	root	1.20	archetype *at = archetype::find (name);
505	root	1.15
506	root	1.20	if (!at)
507	root	1.12	return create_singularity (name);
508	root	1.15
509	root	1.12	return arch_to_object (at);
510	elmex	1.1	}
511
512			/*
513			* Finds, using the hashtable, which archetype matches the given name.
514			* returns a pointer to the found archetype, otherwise NULL.
515			*/
516	root	1.12	archetype *
517	root	1.20	archetype::find (const char *name)
518	root	1.12	{
519			if (!name)
520			return 0;
521
522	root	1.51	auto (i, ht.find (name));
523	root	1.12
524			if (i == ht.end ())
525			return 0;
526			else
527			return i->second;
528	elmex	1.1	}
529
530	root	1.46	archetype *
531			archetype::get (const char *name)
532			{
533	root	1.58	if (!name)
534			{
535			LOG (llevError, "null archetype requested\n");
536			name = "(null)";
537			}
538
539	root	1.46	archetype *at = find (name);
540
541			if (!at)
542			{
543	root	1.62	archetypes.insert (at = new archetype);
544			at->archname = at->clone.name = at->clone.name_pl = name;
545	root	1.46	at->hash_add ();
546			}
547
548			return at;
549			}
550
551	elmex	1.1	/*
552			* Adds an archetype to the hashtable.
553			*/
554	root	1.26	void
555			archetype::hash_add ()
556			{
557	root	1.62	ht.insert (std::make_pair (archname, this));
558	root	1.26	}
559	elmex	1.1
560	root	1.26	void
561			archetype::hash_del ()
562	root	1.12	{
563	root	1.62	ht.erase (archname);
564	elmex	1.1	}
565
566			/*
567			* Returns the first archetype using the given type.
568			* Used in treasure-generation.
569			*/
570	root	1.12	archetype *
571			type_to_archetype (int type)
572			{
573	root	1.46	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
574	root	1.12	if (at->clone.type == type)
575	elmex	1.1	return at;
576	root	1.20
577			return 0;
578	elmex	1.1	}
579
580			/*
581			* Returns a new object copied from the first archetype matching
582			* the given type.
583			* Used in treasure-generation.
584			*/
585	root	1.12	object *
586			clone_arch (int type)
587			{
588	root	1.20	archetype *at;
589	elmex	1.1
590	root	1.12	if ((at = type_to_archetype (type)) == NULL)
591			{
592			LOG (llevError, "Can't clone archetype %d\n", type);
593	root	1.30	return 0;
594	root	1.12	}
595	root	1.20
596	root	1.30	object *op = at->clone.clone ();
597	root	1.3	op->instantiate ();
598	elmex	1.1	return op;
599			}
600
601			/*
602			* member: make instance from class
603			*/
604
605	root	1.12	object *
606	root	1.15	object_create_arch (archetype *at)
607	elmex	1.1	{
608	root	1.20	object op, prev = 0, *head = 0;
609	elmex	1.1
610	root	1.12	while (at)
611			{
612			op = arch_to_object (at);
613			op->x = at->clone.x;
614			op->y = at->clone.y;
615	root	1.20
616	root	1.12	if (head)
617			op->head = head, prev->more = op;
618	root	1.20
619	root	1.12	if (!head)
620			head = op;
621	root	1.20
622	root	1.12	prev = op;
623			at = at->more;
624	elmex	1.1	}
625	root	1.20
626	root	1.12	return (head);
627	elmex	1.1	}
628