server/include/freezethaw.h

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * 
 * 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>
 */

#ifndef FREEZETHAW_H__
#define FREEZETHAW_H__

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

// a little dirty hack, maybe unify with something else at a later time
// it is used to communicate as much info about the keyword string
// to the consuemr as possible, for maximum performance.
struct keyword_string
{
  const char *s;
  const int l;

  keyword_string (const char *s, int l)
  : s(s), l(l)
  { }

  keyword_string (keyword kw)
  : s(keyword_str [kw]), l(keyword_len [kw])
  {
  }

  keyword_string (shstr_tmp sh)
  : s(&sh), l(sh.length ())
  {
  }
};

#define CS(keyword) keyword_string (# keyword, sizeof (# keyword) - 1)
#define KW(keyword) CS(keyword)

INTERFACE_CLASS(object_freezer)
struct object_freezer : dynbuf_text
{
  AV *av;

  object_freezer ();
  ~object_freezer ();

  // serialise perl part
  void put_ (attachable *ext);
  void put (attachable *ext)
  {
    if (expect_false (ext->self))
      put_ (ext);
  }

  // null value (== no space after keyword)
  void put (const keyword_string k)
  {
    char *p = force (k.l + 1);
    memcpy (p, k.s, k.l); p += k.l; *p++ = '\n';
    alloc (p);
  }

  void put (const keyword_string k, const keyword_string v)
  {
    char *p = force (k.l + 1 + v.l + 1);
    memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
    memcpy (p, v.s, v.l); p += v.l; *p++ = '\n';
    alloc (p);
  }

  void put (const keyword_string k, const_utf8_string v)
  {
    if (expect_true (v))
      put (k, keyword_string (v, strlen (v)));
    else
      put (k);
  }

  void put (const keyword_string k, shstr_tmp v)
  {
    put (k, keyword_string (v));
  }

  void put (const keyword_string k, double v)
  {
    char *p = force (MAX_KEYWORD_LEN + 2 + 32);
    memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
    p += sprintf (p, "%.7g", v); *p++ = '\n';
    alloc (p);
  }

  void put_(const keyword_string k, sint64 v)
  {
    force (MAX_KEYWORD_LEN + 2 + sint64_digits);
    fadd (k.s, k.l);
    fadd (' ');
    add (v);
    fadd ('\n');
  }

  void put_(const keyword_string k, sint32 v)
  {
    force (MAX_KEYWORD_LEN + 2 + sint32_digits);
    fadd (k.s, k.l);
    fadd (' ');
    add (v);
    fadd ('\n');
  }

  void put (const keyword_string k,          float     v) { put (k, (double)v); }
  void put (const keyword_string k,   signed char      v) { put_(k, (sint32)v); }
  void put (const keyword_string k, unsigned char      v) { put_(k, (sint32)v); }
  void put (const keyword_string k,   signed short     v) { put_(k, (sint32)v); }
  void put (const keyword_string k, unsigned short     v) { put_(k, (sint32)v); }
  void put (const keyword_string k,   signed int       v) { put_(k, (sint32)v); }
  void put (const keyword_string k, unsigned int       v) { put_(k, (sint64)v); }
  void put (const keyword_string k,   signed long      v) { put_(k, (sint64)v); }
  void put (const keyword_string k, unsigned long      v) { put_(k, (sint64)v); }
  void put (const keyword_string k,   signed long long v) { put_(k, (sint64)v); }
  void put (const keyword_string k, unsigned long long v) { put_(k, (sint64)v); }

  void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v)
  {
    force (MAX_KEYWORD_LEN + 1);
    fadd (kbeg.s, kbeg.l); fadd ('\n');

    if (expect_true (v))
      {
        add (v);
        add ('\n');
      }

    force (MAX_KEYWORD_LEN + 1);
    fadd (kend.s, kend.l); fadd ('\n');
  }

  void put (const keyword_string k, archetype *v);
  void put (const keyword_string k, treasurelist *v);
  void put (const keyword_string k, faceinfo *v);

  template<typename T>
  void put (const keyword_string k, const refptr<T> &v)
  {
    put (k, (T *)v);
  }

  MTH bool save (const_octet_string path);
  utf8_string as_string (); // like strdup

  operator bool () { return !!av; }
};

// used as dir argument to object_thawer constructor
#define RESOURCE_DIR const_utf8_string (0)

INTERFACE_CLASS(object_thawer)
struct object_thawer
{
  static bool errors_are_fatal; // true during server startup only

  char *line; // current beginning of line
  SV *text; // text part
  AV *av;   // perl part
  int linenum;
  keyword kw;
  char *kw_str; // the keyword parsed, as string
  char *value;  // the value, or 0 if no value
  const char *value_nn; // the value, or the empty string if no value
  const char *name;

  operator bool () const { return !!text; }

  object_thawer (const_utf8_string path = 0);
  object_thawer (const_utf8_string dir, const_utf8_string file);
  object_thawer (const_utf8_string data, AV *perlav);
  ~object_thawer ();

  void get (attachable *obj, int oid);

  // parse next line as keyword-value pair
  MTH void next ();

  // parse next line, as a single value
  // skips initial whitespace and comments
  // and sets kw to KW_value on success.
  MTH bool next_line ();

  // skip the current key-value (usually fetch next line, for
  // multiline-fields, skips till the corresponding end-kw
  MTH void skip ();
  MTH void skip_block (); // skips till and over KW_end

  bool has_value () { return value; }
  const_utf8_string get_str () { return value_nn; } // empty string when missing
  void get_ml (keyword kend, shstr &sh);

  void get_ornull (shstr &sh) const { sh = value; }
  void get (shstr &sh)        const { sh = value; } // might want to check for non-null here

  bool   get_bool   () const { return *value_nn == '1'; }
  sint32 get_sint32 () const;
  sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); }
  double get_double () const { return strtod  (value_nn, 0); }

  void get (float  &v) { v = get_double (); }
  void get (double &v) { v = get_double (); }

  void get (bool   &i) { i = get_bool   (); }
  void get (sint8  &i) { i = get_sint32 (); }
  void get (uint8  &i) { i = get_sint32 (); }
  void get (sint16 &i) { i = get_sint32 (); }
  void get (uint16 &i) { i = get_sint32 (); }
  void get (sint32 &i) { i = get_sint32 (); }

  void get (uint32 &i) { i = get_sint64 (); }
  void get (sint64 &i) { i = get_sint64 (); }

  MTH void parse_warn (const_utf8_string msg);
  MTH bool parse_error (const_utf8_string type = 0, const_utf8_string name = 0, bool skip = true);

  struct delayed_ref {
    attachable *op;
    object_ptr *ptr;
    const_utf8_string ref;
  };
  std::vector<delayed_ref> delrefs;

  void delayed_deref (attachable *op, object_ptr &ptr, const_utf8_string ref);
  MTH void resolve_delayed_derefs (bool deref = true);
private:
  void new_from_path (const_utf8_string path);
};

#endif

Revision:	1.6
Committed:	Wed Apr 28 20:51:58 2010 UTC (14 years ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.5:	+3 -0 lines
Log Message:	move resource files to arch
#	User	Rev	Content
1	root	1.1	/*
2			* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3			*
4			* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5			*
6			* Deliantra is free software: you can redistribute it and/or modify it under
7			* the terms of the Affero GNU General Public License as published by the
8			* Free Software Foundation, either version 3 of the License, or (at your
9			* option) any later version.
10			*
11			* This program is distributed in the hope that it will be useful,
12			* but WITHOUT ANY WARRANTY; without even the implied warranty of
13			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14			* GNU General Public License for more details.
15			*
16			* You should have received a copy of the Affero GNU General Public License
17			* and the GNU General Public License along with this program. If not, see
18			* <http://www.gnu.org/licenses/>.
19			*
20			* The authors can be reached via e-mail to <support@deliantra.net>
21			*/
22
23			#ifndef FREEZETHAW_H__
24			#define FREEZETHAW_H__
25
26			//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
27
28			// a little dirty hack, maybe unify with something else at a later time
29			// it is used to communicate as much info about the keyword string
30			// to the consuemr as possible, for maximum performance.
31			struct keyword_string
32			{
33			const char *s;
34			const int l;
35
36			keyword_string (const char *s, int l)
37			: s(s), l(l)
38			{ }
39
40			keyword_string (keyword kw)
41			: s(keyword_str [kw]), l(keyword_len [kw])
42			{
43			}
44
45			keyword_string (shstr_tmp sh)
46			: s(&sh), l(sh.length ())
47			{
48			}
49			};
50
51			#define CS(keyword) keyword_string (# keyword, sizeof (# keyword) - 1)
52			#define KW(keyword) CS(keyword)
53
54			INTERFACE_CLASS(object_freezer)
55			struct object_freezer : dynbuf_text
56			{
57			AV *av;
58
59			object_freezer ();
60			~object_freezer ();
61
62			// serialise perl part
63			void put_ (attachable *ext);
64			void put (attachable *ext)
65			{
66			if (expect_false (ext->self))
67			put_ (ext);
68			}
69
70			// null value (== no space after keyword)
71			void put (const keyword_string k)
72			{
73			char *p = force (k.l + 1);
74			memcpy (p, k.s, k.l); p += k.l; *p++ = '\n';
75			alloc (p);
76			}
77
78			void put (const keyword_string k, const keyword_string v)
79			{
80			char *p = force (k.l + 1 + v.l + 1);
81			memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
82			memcpy (p, v.s, v.l); p += v.l; *p++ = '\n';
83			alloc (p);
84			}
85
86			void put (const keyword_string k, const_utf8_string v)
87			{
88			if (expect_true (v))
89			put (k, keyword_string (v, strlen (v)));
90			else
91			put (k);
92			}
93
94			void put (const keyword_string k, shstr_tmp v)
95			{
96			put (k, keyword_string (v));
97			}
98
99			void put (const keyword_string k, double v)
100			{
101			char *p = force (MAX_KEYWORD_LEN + 2 + 32);
102			memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
103			p += sprintf (p, "%.7g", v); *p++ = '\n';
104			alloc (p);
105			}
106
107			void put_(const keyword_string k, sint64 v)
108			{
109			force (MAX_KEYWORD_LEN + 2 + sint64_digits);
110			fadd (k.s, k.l);
111			fadd (' ');
112			add (v);
113			fadd ('\n');
114			}
115
116			void put_(const keyword_string k, sint32 v)
117			{
118			force (MAX_KEYWORD_LEN + 2 + sint32_digits);
119			fadd (k.s, k.l);
120			fadd (' ');
121			add (v);
122			fadd ('\n');
123			}
124
125			void put (const keyword_string k, float v) { put (k, (double)v); }
126			void put (const keyword_string k, signed char v) { put_(k, (sint32)v); }
127			void put (const keyword_string k, unsigned char v) { put_(k, (sint32)v); }
128			void put (const keyword_string k, signed short v) { put_(k, (sint32)v); }
129			void put (const keyword_string k, unsigned short v) { put_(k, (sint32)v); }
130			void put (const keyword_string k, signed int v) { put_(k, (sint32)v); }
131			void put (const keyword_string k, unsigned int v) { put_(k, (sint64)v); }
132			void put (const keyword_string k, signed long v) { put_(k, (sint64)v); }
133			void put (const keyword_string k, unsigned long v) { put_(k, (sint64)v); }
134			void put (const keyword_string k, signed long long v) { put_(k, (sint64)v); }
135			void put (const keyword_string k, unsigned long long v) { put_(k, (sint64)v); }
136
137			void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v)
138			{
139			force (MAX_KEYWORD_LEN + 1);
140			fadd (kbeg.s, kbeg.l); fadd ('\n');
141
142			if (expect_true (v))
143			{
144			add (v);
145			add ('\n');
146			}
147
148			force (MAX_KEYWORD_LEN + 1);
149			fadd (kend.s, kend.l); fadd ('\n');
150			}
151
152			void put (const keyword_string k, archetype *v);
153			void put (const keyword_string k, treasurelist *v);
154			void put (const keyword_string k, faceinfo *v);
155
156			template<typename T>
157			void put (const keyword_string k, const refptr<T> &v)
158			{
159			put (k, (T *)v);
160			}
161
162			MTH bool save (const_octet_string path);
163			utf8_string as_string (); // like strdup
164
165			operator bool () { return !!av; }
166			};
167
168	root	1.6	// used as dir argument to object_thawer constructor
169			#define RESOURCE_DIR const_utf8_string (0)
170
171	root	1.1	INTERFACE_CLASS(object_thawer)
172			struct object_thawer
173			{
174	root	1.4	static bool errors_are_fatal; // true during server startup only
175
176	root	1.1	char *line; // current beginning of line
177			SV *text; // text part
178			AV *av; // perl part
179			int linenum;
180			keyword kw;
181			char *kw_str; // the keyword parsed, as string
182			char *value; // the value, or 0 if no value
183			const char *value_nn; // the value, or the empty string if no value
184			const char *name;
185
186			operator bool () const { return !!text; }
187
188			object_thawer (const_utf8_string path = 0);
189	root	1.5	object_thawer (const_utf8_string dir, const_utf8_string file);
190	root	1.1	object_thawer (const_utf8_string data, AV *perlav);
191			~object_thawer ();
192
193			void get (attachable *obj, int oid);
194
195			// parse next line as keyword-value pair
196			MTH void next ();
197
198	root	1.2	// parse next line, as a single value
199			// skips initial whitespace and comments
200			// and sets kw to KW_value on success.
201	root	1.3	MTH bool next_line ();
202	root	1.1
203			// skip the current key-value (usually fetch next line, for
204			// multiline-fields, skips till the corresponding end-kw
205			MTH void skip ();
206			MTH void skip_block (); // skips till and over KW_end
207
208			bool has_value () { return value; }
209			const_utf8_string get_str () { return value_nn; } // empty string when missing
210			void get_ml (keyword kend, shstr &sh);
211
212			void get_ornull (shstr &sh) const { sh = value; }
213			void get (shstr &sh) const { sh = value; } // might want to check for non-null here
214
215			bool get_bool () const { return *value_nn == '1'; }
216			sint32 get_sint32 () const;
217			sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); }
218			double get_double () const { return strtod (value_nn, 0); }
219
220			void get (float &v) { v = get_double (); }
221			void get (double &v) { v = get_double (); }
222
223			void get (bool &i) { i = get_bool (); }
224			void get (sint8 &i) { i = get_sint32 (); }
225			void get (uint8 &i) { i = get_sint32 (); }
226			void get (sint16 &i) { i = get_sint32 (); }
227			void get (uint16 &i) { i = get_sint32 (); }
228			void get (sint32 &i) { i = get_sint32 (); }
229
230			void get (uint32 &i) { i = get_sint64 (); }
231			void get (sint64 &i) { i = get_sint64 (); }
232
233			MTH void parse_warn (const_utf8_string msg);
234			MTH bool parse_error (const_utf8_string type = 0, const_utf8_string name = 0, bool skip = true);
235
236			struct delayed_ref {
237			attachable *op;
238			object_ptr *ptr;
239			const_utf8_string ref;
240			};
241			std::vector<delayed_ref> delrefs;
242
243			void delayed_deref (attachable *op, object_ptr &ptr, const_utf8_string ref);
244			MTH void resolve_delayed_derefs (bool deref = true);
245	root	1.5	private:
246			void new_from_path (const_utf8_string path);
247	root	1.1	};
248
249			#endif
250