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.12 by root, Mon Feb 5 02:07:40 2007 UTC

1#ifndef SHSTR_H__ 1#ifndef SHSTR_H__
2#define SHSTR_H__ 2#define SHSTR_H__
3 3
4//// OLD STUFF 4#include "util.h"
5 5
6/* The size of the shared strings hashtable. This must be smaller than 6extern int buf_overflow (const char *buf1, const char *buf2, int bufsize);
7 * 32767, but 947 ought to be plenty enough.
8 */
9#define TABLESIZE 4133
10 7
11/* This specifies how many characters the hashing routine should look at.
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
19/* In the unlikely occurence that 16383 references to a string are too
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
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 8struct shstr
91{ 9{
10 static const char *null;
11
92 const char *s; 12 const char *s;
13
14 static int &refcnt (const char *s)
15 {
16 return *((int *)s - 1);
17 }
18
19 static int &length (const char *s)
20 {
21 return *((int *)s - 2);
22 }
23
24 int &refcnt () const
25 {
26 return refcnt (s);
27 }
28
29 int length () const
30 {
31 return length (s);
32 }
33
34 static const char *find (const char *s);
35 static const char *intern (const char *s);
36
37 static void gc (); // garbage collect a few strings
38
39 // this is used for informational messages and the like
40 const char *operator &() const { return s; }
41
42 const char &operator [](int i) const { return s[i]; }
93 operator const char *() const { return s; }; 43 operator const char *() const { return s == null ? 0 : s; }
44
45 shstr ()
46 : s (null)
47 {
48 }
49
50 shstr (const shstr &sh)
51 : s (sh.s)
52 {
53 ++refcnt ();
54 }
55
56 explicit shstr (const char *s)
57 : s (intern (s))
58 {
59 }
60
61 ~shstr ()
62 {
63 --refcnt ();
64 }
65
66 const shstr &operator =(const shstr &sh)
67 {
68 --refcnt ();
69 s = sh.s;
70 ++refcnt ();
71
72 return *this;
73 }
74
94 shstr &operator =(const char *str) { s = str; }; 75 const shstr &operator =(const char *str)
76 {
77 --refcnt ();
78
79 // this optimises the important case of str == constant 0
80 if (is_constant (str))
81 s = str ? intern (str) : null;
82 else
83 s = intern (str);
84
85 return *this;
86 }
87
88 bool operator ==(const shstr &b)
89 {
90 return s == b.s;
91 }
92
93 bool operator !=(const shstr &b)
94 {
95 return !(*this == b);
96 }
95}; 97};
96#else 98
97typedef const char *shstr; 99inline int strlen (const shstr &sh)
100{
101 return sh.length ();
102}
103
104inline int strcmp (const shstr &a, const shstr &b)
105{
106 // TODO: use this to find all the occurences of people using strcmp
107 // all uses should be bogus, as we should be never interested in
108 // comparing shstr's alphabetically
109#if 0
110 extern void do_not_use_strcmp_to_compare_shstr_values ();
111 do_not_use_strcmp_to_compare_shstr_values ();
98#endif 112#endif
113 return a != b;
114}
115
116// only good for mass comparisons to shstr objects
117struct shstr_cmp
118{
119 const char *s;
120
121 explicit shstr_cmp (const char *s)
122 : s (shstr::find (s))
123 {
124 }
125
126 shstr_cmp (const shstr_cmp &sh)
127 : s (sh.s)
128 {
129 }
130
131 shstr_cmp &operator =(const shstr_cmp sh) { s = sh.s; return *this; }
132 operator const char *() const { return s; }
133};
134
135inline bool operator ==(const shstr_cmp &a, const shstr &b)
136{
137 return a.s == b.s;
138}
139
140inline bool operator ==(const shstr &a, const shstr_cmp &b)
141{
142 return b == a;
143}
144
145extern const shstr undead_name; /* Used in hit_player() in main.c */
99 146
100#endif 147#endif
101 148

Diff Legend

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