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

Comparing deliantra/server/include/dynbuf.h (file contents):
Revision 1.3 by root, Tue Sep 19 22:05:55 2006 UTC vs.
Revision 1.12 by root, Sun Jul 1 05:00:18 2007 UTC

1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your 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 GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22 */
23
1#ifndef DYNBUF_H__ 24#ifndef DYNBUF_H__
2#define DYNBUF_H__ 25#define DYNBUF_H__
3 26
4#include <cstring> 27#include <cstring>
5#include <cassert> 28#include <cassert>
29
30#include "util.h"
31#include "shstr.h"
6 32
7// this is a "buffer" that can grow fast 33// this is a "buffer" that can grow fast
8// and is still somewhat space-efficient. 34// and is still somewhat space-efficient.
9// unlike obstacks or other data structures, 35// unlike obstacks or other data structures,
10// it never moves data around. basically, 36// it never moves data around. basically,
11// this is a fast strstream without the overhead. 37// this is a fast strstream without the overhead.
12 38
13class dynbuf 39struct dynbuf
14{ 40{
41protected:
15 struct chunk 42 struct chunk
16 { 43 {
17 chunk *next; 44 chunk *next;
45 int alloc;
18 int size; 46 int size;
19 char data[0]; 47 char data[0];
20 }; 48 };
21 49
22 char *ptr; 50 char *ptr, *end;
23 int room;
24 int ext; 51 int ext;
25 int _size; 52 int _size;
26 53
27 chunk *first, *last; 54 chunk *first, *last;
28 55
29 void _reserve (int size); 56 void _reserve (int size);
57 void _clear ();
30 void clear (); 58 void clear ();
31 void finish (); 59 void finish ();
32 60
33public: 61public:
34 62
35 dynbuf (int initial = 4096, int extend = 16384); 63 dynbuf (int initial = 4096, int extend = 16384);
36 ~dynbuf (); 64 ~dynbuf ();
37 65
38 int size () { return _size + (ptr - last->data); } 66 int size () const { return _size + (ptr - last->data); }
67 bool empty () const { return !size (); }
39 68
40 void linearise (void *data); 69 void linearise (void *data);
41 char *linearise (); 70 char *linearise (); // does not 0-terminate(!)
71
72 int room () const { return end - ptr; }
42 73
43 char *force (int size) 74 char *force (int size)
44 { 75 {
45 if (room < size) 76 if (expect_false (ptr + size >= end))
46 _reserve (size); 77 _reserve (size);
47 78
48 return ptr; 79 return ptr;
49 } 80 }
50 81
51 char *alloc (int size) 82 char *falloc (int size)
52 { 83 {
53 char *res = force (size); 84 char *res = ptr;
54
55 room -= size;
56 ptr += size; 85 ptr += size;
57
58 return res; 86 return res;
59 } 87 }
60 88
89 char *alloc (int size)
90 {
91 force (size);
92 return falloc (size);
93 }
94
61 void fadd (char c) { --room; *ptr++ = c; } 95 void fadd (char c) { *ptr++ = c; }
62 void fadd (unsigned char c) { fadd (char (c)); } 96 void fadd (unsigned char c) { fadd (char (c)); }
97 void fadd (const void *p, int len)
98 {
99 memcpy (falloc (len), p, len);
100 }
63 101
64 void add (const void *p, int len) 102 void add (const void *p, int len)
65 { 103 {
66 memcpy (alloc (len), p, len); 104 force (len);
105 fadd (p, len);
67 } 106 }
68 107
69 void add (char c) 108 void add (char c)
70 { 109 {
71 alloc (1)[0] = c; 110 alloc (1)[0] = c;
… …
74 void add (const char *s) 113 void add (const char *s)
75 { 114 {
76 add (s, strlen (s)); 115 add (s, strlen (s));
77 } 116 }
78 117
79 static const int max_sint32_size = 11; 118 void add (const shstr &s)
80 static const int max_sint64_size = 20; 119 {
81 120 add (s.s, s.length ());
82 void add (sint32 i); 121 }
83 void add (sint64 i);
84 122
85 //TODO 123 //TODO
86 //void add_destructive (dynbuf &buf); 124 //void add_destructive (dynbuf &buf);
87 125
88 dynbuf &operator << (char c) { add (c); return *this; } 126 dynbuf &operator << (char c) { add (c); return *this; }
89 dynbuf &operator << (unsigned char c) { return *this << char (c); } 127 dynbuf &operator << (unsigned char c) { return *this << char (c); }
90 dynbuf &operator << (const char *s) { add (s); return *this; } 128 dynbuf &operator << (const char *s) { add (s); return *this; }
129 dynbuf &operator << (const shstr &s) { add (s); return *this; }
130 dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; }
131
132 operator std::string ();
133};
134
135struct dynbuf_text : dynbuf
136{
137 dynbuf_text (int initial = 4096, int extend = 16384)
138 : dynbuf (initial, extend)
139 { }
140
141 using dynbuf::add;
142
143 void add (sint32 i);
144 void add (sint64 i);
145
146 void printf (const char *format, ...);
91}; 147};
92 148
93#endif 149#endif
150

Diff Legend

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