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.5 by root, Mon Apr 23 18:21:54 2007 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>
6 29
30#include "util.h"
7#include "shstr.h" 31#include "shstr.h"
8 32
9// this is a "buffer" that can grow fast 33// this is a "buffer" that can grow fast
10// and is still somewhat space-efficient. 34// and is still somewhat space-efficient.
11// unlike obstacks or other data structures, 35// unlike obstacks or other data structures,
… …
21 int alloc; 45 int alloc;
22 int size; 46 int size;
23 char data[0]; 47 char data[0];
24 }; 48 };
25 49
26 char *ptr; 50 char *ptr, *end;
27 int room;
28 int ext; 51 int ext;
29 int _size; 52 int _size;
30 53
31 chunk *first, *last; 54 chunk *first, *last;
32 55
33 void _reserve (int size); 56 void _reserve (int size);
57 void _clear ();
34 void clear (); 58 void clear ();
35 void finish (); 59 void finish ();
36 60
37public: 61public:
38 62
39 dynbuf (int initial = 4096, int extend = 16384); 63 dynbuf (int initial = 4096, int extend = 16384);
40 ~dynbuf (); 64 ~dynbuf ();
41 65
42 int size () { return _size + (ptr - last->data); } 66 int size () const { return _size + (ptr - last->data); }
67 bool empty () const { return !size (); }
43 68
44 void linearise (void *data); 69 void linearise (void *data);
45 char *linearise (); 70 char *linearise (); // does not 0-terminate(!)
71
72 int room () const { return end - ptr; }
46 73
47 char *force (int size) 74 char *force (int size)
48 { 75 {
49 if (room < size) 76 if (expect_false (ptr + size >= end))
50 _reserve (size); 77 _reserve (size);
51 78
52 return ptr; 79 return ptr;
53 } 80 }
54 81
55 char *alloc (int size) 82 char *falloc (int size)
56 { 83 {
57 char *res = force (size); 84 char *res = ptr;
58
59 room -= size;
60 ptr += size; 85 ptr += size;
61
62 return res; 86 return res;
63 } 87 }
64 88
89 char *alloc (int size)
90 {
91 force (size);
92 return falloc (size);
93 }
94
65 void fadd (char c) { --room; *ptr++ = c; } 95 void fadd (char c) { *ptr++ = c; }
66 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 }
67 101
68 void add (const void *p, int len) 102 void add (const void *p, int len)
69 { 103 {
70 memcpy (alloc (len), p, len); 104 force (len);
105 fadd (p, len);
71 } 106 }
72 107
73 void add (char c) 108 void add (char c)
74 { 109 {
75 alloc (1)[0] = c; 110 alloc (1)[0] = c;
… …
89 //void add_destructive (dynbuf &buf); 124 //void add_destructive (dynbuf &buf);
90 125
91 dynbuf &operator << (char c) { add (c); return *this; } 126 dynbuf &operator << (char c) { add (c); return *this; }
92 dynbuf &operator << (unsigned char c) { return *this << char (c); } 127 dynbuf &operator << (unsigned char c) { return *this << char (c); }
93 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; }
94 dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; } 130 dynbuf &operator << (const std::string &s) { add (s.data(), s.size ()); return *this; }
95 131
96 operator std::string (); 132 operator std::string ();
97}; 133};
98 134
… …
102 : dynbuf (initial, extend) 138 : dynbuf (initial, extend)
103 { } 139 { }
104 140
105 using dynbuf::add; 141 using dynbuf::add;
106 142
107 static const int max_sint32_size = 11;
108 static const int max_sint64_size = 20;
109
110 void add (sint32 i); 143 void add (sint32 i);
111 void add (sint64 i); 144 void add (sint64 i);
112 145
113 void printf (const char *format, ...); 146 void printf (const char *format, ...);
114}; 147};
115 148
116#endif 149#endif
150

Diff Legend

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