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

Comparing deliantra/server/common/shstr.C (file contents):
Revision 1.9 by root, Mon Sep 4 17:16:19 2006 UTC vs.
Revision 1.13 by root, Sun Sep 10 16:00:23 2006 UTC

1
1/* 2/*
2 * shstr.C 3 * shstr.C
3 */ 4 */
4 5
5#include <cstring> 6#include <cstring>
6#include <cstdlib> 7#include <cstdlib>
7 8
9#include <glib.h>
10
8#include <tr1/unordered_set> 11#include <tr1/unordered_set>
9 12
10#include "shstr.h" 13#include "shstr.h"
11#include "util.h" 14#include "util.h"
12 15
13typedef std::tr1::unordered_set<const char *, str_hash, str_equal> HT; 16typedef
17std::tr1::unordered_set < const char *,
18 str_hash,
19 str_equal >
20 HT;
14 21
15static HT ht; 22static HT
23 ht;
16 24
17static const char *makevec (const char *s) 25static const char *
26makevec (const char *s)
18{ 27{
28 int
19 int len = strlen (s); 29 len = strlen (s);
20 30
31 const char *
21 const char *v = (const char *)(2 + (int *)malloc (sizeof (int) * 2 + len + 1)); 32 v = (const char *) (2 + (int *) g_slice_alloc (sizeof (int) * 2 + len + 1));
22 33
23 shstr::length (v) = len; 34 shstr::length (v) = len;
24 shstr::refcnt (v) = 1; 35 shstr::refcnt (v) = 1;
25 36
26 memcpy ((char *)v, s, len + 1); 37 memcpy ((char *) v, s, len + 1);
27 38
28 return v; 39 return v;
29} 40}
30 41
42const char *
31const char *shstr::null = makevec ("<nil>"); 43 shstr::null = makevec ("<nil>");
32 44
33// what weird misoptimisation is this again? 45// what weird misoptimisation is this again?
34const shstr undead_name ("undead"); 46const shstr undead_name ("undead");
35 47
36const char * 48const char *
… …
39 if (!s) 51 if (!s)
40 return s; 52 return s;
41 53
42 HT::iterator i = ht.find (s); 54 HT::iterator i = ht.find (s);
43 55
44 return i != ht.end () 56 return i != ht.end ()? *i : 0;
45 ? *i
46 : 0;
47} 57}
48 58
49const char * 59const char *
50shstr::intern (const char *s) 60shstr::intern (const char *s)
51{ 61{
… …
89 break; 99 break;
90 else if (!refcnt (*i)) 100 else if (!refcnt (*i))
91 { 101 {
92 HT::iterator o = i++; 102 HT::iterator o = i++;
93 const char *s = *o; 103 const char *s = *o;
104
94 ht.erase (o); 105 ht.erase (o);
95 106
96 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); 107 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
97 free (-2 + (int *)s); 108 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s);
98 } 109 }
99 else 110 else
100 ++i; 111 ++i;
101 } 112 }
102 113
103 curpos = *i; 114 curpos = *i;
104} 115}
105 116
106//TODO: this should of course not be here 117//TODO: this should of course not be here
118
107/* buf_overflow() - we don't want to exceed the buffer size of 119/* buf_overflow() - we don't want to exceed the buffer size of
108 * buf1 by adding on buf2! Returns true if overflow will occur. 120 * buf1 by adding on buf2! Returns true if overflow will occur.
109 */ 121 */
110 122
111int 123int
112buf_overflow (const char *buf1, const char *buf2, int bufsize) 124buf_overflow (const char *buf1, const char *buf2, int bufsize)
113{ 125{
114 int len1 = 0, len2 = 0; 126 int len1 = 0, len2 = 0;
115 127
116 if (buf1) 128 if (buf1)
117 len1 = strlen (buf1); 129 len1 = strlen (buf1);
118 if (buf2) 130 if (buf2)
119 len2 = strlen (buf2); 131 len2 = strlen (buf2);
120 if ((len1 + len2) >= bufsize) 132 if ((len1 + len2) >= bufsize)
121 return 1;
122 return 0; 133 return 1;
134 return 0;
123} 135}
124

Diff Legend

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