ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/shstr.h
(Generate patch)

Comparing deliantra/server/include/shstr.h (file contents):
Revision 1.4 by root, Thu Aug 31 17:54:14 2006 UTC vs.
Revision 1.20 by root, Thu Nov 8 19:43:25 2007 UTC

1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 *
6 * Deliantra is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your 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 GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 *
19 * The authors can be reached via e-mail to <support@deliantra.net>
20 */
21
1#ifndef SHSTR_H__ 22#ifndef SHSTR_H__
2#define SHSTR_H__ 23#define SHSTR_H__
3 24
4//// OLD STUFF 25#include <sstream>
5 26
6/* The size of the shared strings hashtable. This must be smaller than 27#include "util.h"
7 * 32767, but 947 ought to be plenty enough.
8 */
9#define TABLESIZE 4133
10 28
11/* This specifies how many characters the hashing routine should look at. 29extern size_t shstr_alloc;
12 * You may actually save CPU by increasing this number if the typical string
13 * is large.
14 */
15#ifndef MAXSTRING
16#define MAXSTRING 20
17#endif
18 30
19/* In the unlikely occurence that 16383 references to a string are too 31extern int buf_overflow (const char *buf1, const char *buf2, int bufsize);
20 * few, you can modify the below type to something bigger.
21 * (The top bit of "refcount" is used to signify that "u.array" points
22 * at the array entry.)
23 */
24#define REFCOUNT_TYPE int
25 32
26/* The offsetof macro is part of ANSI C, but many compilers lack it, for
27 * example "gcc -ansi"
28 */
29#if !defined (offsetof)
30#define offsetof(type, member) (int)&(((type *)0)->member)
31#endif
32
33/* SS(string) will return the address of the shared_string struct which
34 * contains "string".
35 */
36#define SS(x) ((shared_string *) ((x) - offsetof(shared_string, string)))
37
38#define SS_STATISTICS
39
40#define SS_DUMP_TABLE 1
41#define SS_DUMP_TOTALS 2
42
43#ifdef SS_STATISTICS
44static struct statistics {
45 int calls;
46 int hashed;
47 int strcmps;
48 int search;
49 int linked;
50} add_stats, add_ref_stats, free_stats, find_stats, hash_stats;
51#define GATHER(n) (++n)
52#else /* !SS_STATISTICS */
53#define GATHER(n)
54#endif /* SS_STATISTICS */
55
56#define TOPBIT ((unsigned REFCOUNT_TYPE) 1 << (sizeof(REFCOUNT_TYPE) * CHAR_BIT - 1))
57
58#define PADDING ((2 * sizeof(long) - sizeof(REFCOUNT_TYPE)) % sizeof(long)) + 1
59
60typedef struct _shared_string {
61 union {
62 struct _shared_string **array;
63 struct _shared_string *previous;
64 } u;
65 struct _shared_string *next;
66 /* The top bit of "refcount" is used to signify that "u.array" points
67 * at the array entry.
68 */
69 unsigned REFCOUNT_TYPE refcount;
70 /* Padding will be unused memory, since we can't know how large
71 * the padding when allocating memory. We assume here that
72 * sizeof(long) is a good boundary.
73 */
74 char string[PADDING];
75} shared_string;
76
77extern void init_hash_table(void);
78extern const char *add_string(const char *str);
79extern const char *add_refcount(const char *str);
80extern int query_refcount(const char *str);
81extern const char *find_string(const char *str);
82extern void free_string(const char *str);
83extern void ss_dump_statistics(void);
84extern const char *ss_dump_table(int what);
85extern int buf_overflow(const char *buf1, const char *buf2, int bufsize);
86
87//// NEW STUFF
88
89#if 0
90struct shstr 33struct shstr
91{ 34{
35 static const char *null;
36
92 const char *s; 37 const char *s;
38
39 static int &refcnt (const char *s)
40 {
41 return *((int *)s - 1);
42 }
43
44 static int &length (const char *s)
45 {
46 return *((int *)s - 2);
47 }
48
49 int &refcnt () const
50 {
51 return refcnt (s);
52 }
53
54 int length () const
55 {
56 return length (s);
57 }
58
59 // returns wether this shared string begins with the given prefix,
60 // used mainly for searched when users give only the start of a name.
61 bool begins_with (const char *prefix) const
62 {
63 int plen = strlen (prefix);
64 return !strncasecmp (s, prefix, plen) && length () >= plen;
65 }
66
67 static const char *find (const char *s);
68 static const char *intern (const char *s);
69
70 static void gc (); // garbage collect a few strings
71
72 // this is used for informational messages and the like
73 const char *operator &() const { return s; }
74
75 const char &operator [](int i) const { return s[i]; }
93 operator const char *() const { return s; }; 76 operator const char *() const { return s == null ? 0 : s; }
77
78 shstr ()
79 : s (null)
80 {
81 }
82
83 shstr (const shstr &sh)
84 : s (sh.s)
85 {
86 ++refcnt ();
87 }
88
89 explicit shstr (const char *s)
90 : s (intern (s))
91 {
92 }
93
94 ~shstr ()
95 {
96 --refcnt ();
97 }
98
99 const shstr &operator =(const shstr &sh)
100 {
101 --refcnt ();
102 s = sh.s;
103 ++refcnt ();
104
105 return *this;
106 }
107
94 shstr &operator =(const char *str) { s = str; }; 108 const shstr &operator =(const char *str)
109 {
110 --refcnt ();
111
112 // this optimises the important case of str == constant 0
113 if (is_constant (str))
114 s = str ? intern (str) : null;
115 else
116 s = intern (str);
117
118 return *this;
119 }
120
121 bool operator ==(const shstr &b)
122 {
123 return s == b.s;
124 }
125
126 bool operator !=(const shstr &b)
127 {
128 return !(*this == b);
129 }
95}; 130};
96#else 131
97typedef const char *shstr; 132inline int strlen (const shstr &sh)
133{
134 return sh.length ();
135}
136
137inline int strcmp (const shstr &a, const shstr &b)
138{
139 // TODO: use this to find all the occurences of people using strcmp
140 // all uses should be bogus, as we should be never interested in
141 // comparing shstr's alphabetically
142#if 0
143 extern void do_not_use_strcmp_to_compare_shstr_values ();
144 do_not_use_strcmp_to_compare_shstr_values ();
98#endif 145#endif
146 return a != b;
147}
148
149static std::ostream &operator <<(std::ostream &o, const shstr &sh)
150{
151 o.write (sh.s, sh.length ());
152 return o;
153}
154
155// only good for mass comparisons to shstr objects
156struct shstr_cmp
157{
158 const char *s;
159
160 explicit shstr_cmp (const char *s)
161 : s (shstr::find (s))
162 {
163 }
164
165 shstr_cmp (const shstr_cmp &sh)
166 : s (sh.s)
167 {
168 }
169
170 shstr_cmp &operator =(const shstr_cmp sh) { s = sh.s; return *this; }
171 operator const char *() const { return s; }
172};
173
174inline bool operator ==(const shstr_cmp &a, const shstr &b)
175{
176 return a.s == b.s;
177}
178
179inline bool operator ==(const shstr &a, const shstr_cmp &b)
180{
181 return b == a;
182}
183
184#define def(str) extern const shstr shstr_ ## str;
185# include "shstrinc.h"
186#undef def
99 187
100#endif 188#endif
101 189

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines