1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247
|
/* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Libhashkit library
*
* Copyright (C) 2011-2012 Data Differential, http://datadifferential.com/
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
*
* * The names of its contributors may not be used to endorse or
* promote products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#include <libhashkit/common.h>
#include <cassert>
#include <cstring>
#define HASHKIT_BLOCK_SIZE 1024
struct hashkit_string_st {
char *end;
size_t current_size;
char *string;
};
inline static bool _string_check(hashkit_string_st *string, size_t need)
{
if (need and need > (size_t)(string->current_size - (size_t)(string->end - string->string)))
{
size_t current_offset= (size_t) (string->end - string->string);
/* This is the block multiplier. To keep it larger and surive division errors we must round it up */
size_t adjust= (need - (size_t)(string->current_size - (size_t)(string->end - string->string))) / HASHKIT_BLOCK_SIZE;
adjust++;
size_t new_size= sizeof(char) * (size_t)((adjust * HASHKIT_BLOCK_SIZE) + string->current_size);
/* Test for overflow */
if (new_size < need)
{
return false;
}
char *new_value= (char*)realloc(string->string, new_size);
if (new_value == NULL)
{
return false;
}
string->string= new_value;
string->end= string->string + current_offset;
string->current_size+= (HASHKIT_BLOCK_SIZE * adjust);
}
return true;
}
static inline void _init_string(hashkit_string_st *self)
{
self->current_size= 0;
self->end= self->string= NULL;
}
hashkit_string_st *hashkit_string_create(size_t initial_size)
{
hashkit_string_st* self= (hashkit_string_st*)calloc(1, sizeof(hashkit_string_st));
if (self)
{
if (_string_check(self, initial_size) == false)
{
free(self);
return NULL;
}
}
return self;
}
#if 0
static bool hashkit_string_append_null(hashkit_string_st *string)
{
if (_string_check(string, 1) == false)
{
return false;
}
*string->end= 0;
return true;
}
#endif
bool hashkit_string_append_character(hashkit_string_st *string,
char character)
{
if (_string_check(string, 1) == false)
{
return false;
}
*string->end= character;
string->end++;
return true;
}
bool hashkit_string_append(hashkit_string_st *string,
const char *value, size_t length)
{
if (_string_check(string, length) == false)
{
return false;
}
assert(length <= string->current_size);
assert(string->string);
assert(string->end >= string->string);
memcpy(string->end, value, length);
string->end+= length;
return true;
}
char *hashkit_string_c_copy(hashkit_string_st *string)
{
if (hashkit_string_length(string) == 0)
{
return NULL;
}
char *c_ptr= static_cast<char *>(malloc((hashkit_string_length(string)+1) * sizeof(char)));
if (c_ptr == NULL)
{
return NULL;
}
memcpy(c_ptr, hashkit_string_c_str(string), hashkit_string_length(string));
c_ptr[hashkit_string_length(string)]= 0;
return c_ptr;
}
void hashkit_string_reset(hashkit_string_st *string)
{
string->end= string->string;
}
void hashkit_string_free(hashkit_string_st *ptr)
{
if (ptr == NULL)
{
return;
}
if (ptr->string)
{
free(ptr->string);
}
free(ptr);
}
bool hashkit_string_resize(hashkit_string_st& string, const size_t need)
{
return _string_check(&string, need);
}
size_t hashkit_string_length(const hashkit_string_st *self)
{
return size_t(self->end -self->string);
}
size_t hashkit_string_max_size(const hashkit_string_st *self)
{
return self->current_size;
}
char *hashkit_string_take(hashkit_string_st *self)
{
assert(self);
if (self == NULL)
{
return NULL;
}
char *value= self->string;
_init_string(self);
return value;
}
char *hashkit_string_c_str_mutable(hashkit_string_st *self)
{
assert(self);
if (self == NULL)
{
return NULL;
}
return self->string;
}
const char *hashkit_string_c_str(const hashkit_string_st* self)
{
assert(self);
if (self == NULL)
{
return NULL;
}
return self->string;
}
void hashkit_string_set_length(hashkit_string_st *self, size_t length)
{
assert(self);
if (self and _string_check(self, length))
{
self->end= self->string +length;
}
}
|