server/common/region.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero GNU General Public License as published by the
 * Free Software Foundation, either version 3 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 Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

#include <global.h>
#include <unistd.h>

regionvec regions;

region *
region::default_region ()
{
  for_all_regions (rgn)
    if (rgn->fallback)
      return rgn;

  return regions [0];
}

/* 
 * Pass a char array, returns a pointer to the region of the same name.
 * if it can't find a region of the same name it returns the first region
 * with the 'fallback' property set.
 * if it can't find a matching name /or/ a fallback region it logs an info message 
 * message and returns NULL
 * used by the map parsing code. 
 */
region *
region::find (shstr_cmp name)
{
  for_all_regions (rgn)
    if (rgn->name == name)
      return rgn;

  LOG (llevError, "region called %s requested, but not found, using fallback.\n", &name);

  return default_region ();
}

void
region::do_destroy ()
{
  regions.erase (this);

  attachable::do_destroy ();

  refcnt_dec ();
}

/* 
 * returns 1 if the player is in the region reg, or a child region thereof
 * otherwise returns 0
 * if passed a NULL region returns -1
 */
static int
region_is_child_of_region (const region * child, const region * r)
{
  if (!r)
    return -1;

  if (!child)
    return 0;

  if (child->name == r->name)
    return 1;

  if (child->parent)
    return region_is_child_of_region (child->parent, r);

  return 0;
}

/** Returns an object which is an exit through which the player represented by op should be
 *  sent in order to be imprisoned. If there is no suitable place to which an exit can be 
 *  constructed, then NULL will be returned. The caller is responsible for freeing the object
 *  created by this function.
 */
object *
get_jail_exit (object *op)
{
  if (op->type != PLAYER)
    {
      LOG (llevError, "region.c: get_jail_exit called against non-player object.\n");
      return NULL;
    }

  region *reg = op->region ();
  while (reg)
    {
      if (reg->jailmap)
        {
          object *exit = object::create ();
          EXIT_PATH (exit) = reg->jailmap;
          /* damned exits reset savebed and remove teleports, so the prisoner can't escape */
          SET_FLAG (exit, FLAG_DAMNED);
          EXIT_X (exit) = reg->jailx;
          EXIT_Y (exit) = reg->jaily;
          return exit;
        }
      else
        reg = reg->parent;
    }

  LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name);

  return 0;
}

region *
region::read (object_thawer &f)
{
  assert (f.kw == KW_region);

  region *rgn = new region;
  rgn->refcnt_inc ();

  f.get (rgn->name);
  f.next ();

  for (;;)
    {
      switch (f.kw)
        {
          case KW_parent:
            rgn->parent = region::find (f.get_str ());
            break;

          case KW_msg:        f.get_ml (KW_endmsg, rgn->msg); break;
          case KW_longname:   f.get (rgn->longname); break;
          case KW_jail_map:   f.get (rgn->jailmap);  break;
          case KW_jail_x:     f.get (rgn->jailx);    break;
          case KW_jail_y:     f.get (rgn->jaily);    break;
          case KW_portal_map: f.get (rgn->portalmap);break;
          case KW_portal_x:   f.get (rgn->portalx);  break;
          case KW_portal_y:   f.get (rgn->portaly);  break;
          case KW_fallback:   f.get (rgn->fallback); break;
          case KW_chance:     f.get (rgn->treasure_density); break;

          case KW_randomitems:
            rgn->treasure = treasurelist::get (f.get_str ());
            break;

          case KW_end:
            f.next ();

            // cannot use find as that will request the default region
            for_all_regions (old)
              if (old->name == rgn->name)
                {
                  old->destroy ();
                  break;
                }

            // just append
            regions.push_back (rgn);
            return rgn;

          case KW_ERROR:
            rgn->set_key_text (f.kw_str, f.value);
            //fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D
            break;

          default:
            if (!f.parse_error ("region", rgn->name))
              {
                rgn->destroy ();
                return 0;
              }
            break;
        }

      f.next ();
    }
}

/*
 * First initialises the archtype hash-table (init_archetable()).
 * Reads and parses the archetype file (with the first and second-pass
 * functions).
 */
void
init_regions (void)
{
  if (!regions.size ())
    {
      // make sure one region is always available
      region *rgn = new region;
      rgn->name = "<builtin>";
      rgn->longname = "Built-in Region";
      regions.push_back (rgn);
    }
}

Revision:	1.43
Committed:	Mon Oct 12 14:00:57 2009 UTC (14 years, 7 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_82, rel-2_81
Changes since 1.42:	+7 -6 lines
Log Message:	clarify license
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*
8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the
10	* Free Software Foundation, either version 3 of the License, or (at your
11	* option) any later version.
12	*
13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.
17	*
18	* You should have received a copy of the Affero GNU General Public License
19	* and the GNU General Public License along with this program. If not, see
20	* <http://www.gnu.org/licenses/>.
21	*
22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/
24
25	#include <global.h>
26	#include <unistd.h>
27
28	regionvec regions;
29
30	region *
31	region::default_region ()
32	{
33	for_all_regions (rgn)
34	if (rgn->fallback)
35	return rgn;
36
37	return regions [0];
38	}
39
40	/*
41	* Pass a char array, returns a pointer to the region of the same name.
42	* if it can't find a region of the same name it returns the first region
43	* with the 'fallback' property set.
44	* if it can't find a matching name /or/ a fallback region it logs an info message
45	* message and returns NULL
46	* used by the map parsing code.
47	*/
48	region *
49	region::find (shstr_cmp name)
50	{
51	for_all_regions (rgn)
52	if (rgn->name == name)
53	return rgn;
54
55	LOG (llevError, "region called %s requested, but not found, using fallback.\n", &name);
56
57	return default_region ();
58	}
59
60	void
61	region::do_destroy ()
62	{
63	regions.erase (this);
64
65	attachable::do_destroy ();
66
67	refcnt_dec ();
68	}
69
70	/*
71	* returns 1 if the player is in the region reg, or a child region thereof
72	* otherwise returns 0
73	* if passed a NULL region returns -1
74	*/
75	static int
76	region_is_child_of_region (const region * child, const region * r)
77	{
78	if (!r)
79	return -1;
80
81	if (!child)
82	return 0;
83
84	if (child->name == r->name)
85	return 1;
86
87	if (child->parent)
88	return region_is_child_of_region (child->parent, r);
89
90	return 0;
91	}
92
93	/** Returns an object which is an exit through which the player represented by op should be
94	* sent in order to be imprisoned. If there is no suitable place to which an exit can be
95	* constructed, then NULL will be returned. The caller is responsible for freeing the object
96	* created by this function.
97	*/
98	object *
99	get_jail_exit (object *op)
100	{
101	if (op->type != PLAYER)
102	{
103	LOG (llevError, "region.c: get_jail_exit called against non-player object.\n");
104	return NULL;
105	}
106
107	region *reg = op->region ();
108	while (reg)
109	{
110	if (reg->jailmap)
111	{
112	object *exit = object::create ();
113	EXIT_PATH (exit) = reg->jailmap;
114	/* damned exits reset savebed and remove teleports, so the prisoner can't escape */
115	SET_FLAG (exit, FLAG_DAMNED);
116	EXIT_X (exit) = reg->jailx;
117	EXIT_Y (exit) = reg->jaily;
118	return exit;
119	}
120	else
121	reg = reg->parent;
122	}
123
124	LOG (llevError, "No suitable jailmap for region %s was found.\n", &reg->name);
125
126	return 0;
127	}
128
129	region *
130	region::read (object_thawer &f)
131	{
132	assert (f.kw == KW_region);
133
134	region *rgn = new region;
135	rgn->refcnt_inc ();
136
137	f.get (rgn->name);
138	f.next ();
139
140	for (;;)
141	{
142	switch (f.kw)
143	{
144	case KW_parent:
145	rgn->parent = region::find (f.get_str ());
146	break;
147
148	case KW_msg: f.get_ml (KW_endmsg, rgn->msg); break;
149	case KW_longname: f.get (rgn->longname); break;
150	case KW_jail_map: f.get (rgn->jailmap); break;
151	case KW_jail_x: f.get (rgn->jailx); break;
152	case KW_jail_y: f.get (rgn->jaily); break;
153	case KW_portal_map: f.get (rgn->portalmap);break;
154	case KW_portal_x: f.get (rgn->portalx); break;
155	case KW_portal_y: f.get (rgn->portaly); break;
156	case KW_fallback: f.get (rgn->fallback); break;
157	case KW_chance: f.get (rgn->treasure_density); break;
158
159	case KW_randomitems:
160	rgn->treasure = treasurelist::get (f.get_str ());
161	break;
162
163	case KW_end:
164	f.next ();
165
166	// cannot use find as that will request the default region
167	for_all_regions (old)
168	if (old->name == rgn->name)
169	{
170	old->destroy ();
171	break;
172	}
173
174	// just append
175	regions.push_back (rgn);
176	return rgn;
177
178	case KW_ERROR:
179	rgn->set_key_text (f.kw_str, f.value);
180	//fprintf (stderr, "region addkv(%s,%s)\n", f.kw_str, f.value);//D
181	break;
182
183	default:
184	if (!f.parse_error ("region", rgn->name))
185	{
186	rgn->destroy ();
187	return 0;
188	}
189	break;
190	}
191
192	f.next ();
193	}
194	}
195
196	/*
197	* First initialises the archtype hash-table (init_archetable()).
198	* Reads and parses the archetype file (with the first and second-pass
199	* functions).
200	*/
201	void
202	init_regions (void)
203	{
204	if (!regions.size ())
205	{
206	// make sure one region is always available
207	region *rgn = new region;
208	rgn->name = "<builtin>";
209	rgn->longname = "Built-in Region";
210	regions.push_back (rgn);
211	}
212	}
213