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
|
/*! \file stringbuf.c
* \brief Implemetation of the dynamic string buffer helper object.
*
* \author Rainer Gerhards <rgerhards@adiscon.com>
* \date 2003-08-08
* Initial version begun.
*
* Copyright 2002-2003
* Rainer Gerhards and Adiscon GmbH. All Rights Reserved.
*
* 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.
*
* * Neither the name of Adiscon GmbH or Rainer Gerhards
* nor the names of its contributors may 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 <stdlib.h
#include <assert.h>
#include <string.h>
#include "liblogging-stub.h"
#include "stringbuf.h"
#include "srUtils.h"
/* ################################################################# *
* private members *
* ################################################################# */
/* ################################################################# *
* public members *
* ################################################################# */
sbStrBObj *sbStrBConstruct(void)
{
sbStrBObj *pThis;
if((pThis = (sbStrBObj*) calloc(1, sizeof(sbStrBObj))) == NULL)
return NULL;
pThis->OID = OIDsbStrB;
pThis->pBuf = NULL;
pThis->iBufSize = 0;
pThis->iBufPtr = 0;
pThis->iAllocIncrement = STRINGBUF_ALLOC_INCREMENT;
return pThis;
}
void sbStrBDestruct(sbStrBObj *pThis)
{
# if STRINGBUF_TRIM_ALLOCSIZE == 1
/* in this mode, a new buffer already was allocated,
* so we need to free the old one.
*/
if(pThis->pBuf != NULL) {
free(pThis->pBuf);
}
# endif
SRFREEOBJ(pThis);
}
srRetVal sbStrBAppendStr(sbStrBObj *pThis, char* psz)
{
srRetVal iRet;
sbSTRBCHECKVALIDOBJECT(pThis);
assert(psz != NULL);
while(*psz)
if((iRet = sbStrBAppendChar(pThis, *psz++)) != SR_RET_OK)
return iRet;
return SR_RET_OK;
}
srRetVal sbStrBAppendInt(sbStrBObj *pThis, int i)
{
srRetVal iRet;
char szBuf[32];
sbSTRBCHECKVALIDOBJECT(pThis);
if((iRet = srUtilItoA(szBuf, sizeof(szBuf), i)) != SR_RET_OK)
return iRet;
return sbStrBAppendStr(pThis, szBuf);
}
srRetVal sbStrBAppendChar(sbStrBObj *pThis, char c)
{
char* pNewBuf;
sbSTRBCHECKVALIDOBJECT(pThis);
if(pThis->iBufPtr >= pThis->iBufSize)
{ /* need more memory! */
if((pNewBuf = (char*) malloc((pThis->iBufSize + pThis->iAllocIncrement) * sizeof(char))) == NULL)
return SR_RET_OUT_OF_MEMORY;
memcpy(pNewBuf, pThis->pBuf, pThis->iBufSize);
pThis->iBufSize += pThis->iAllocIncrement;
if(pThis->pBuf != NULL) {
free(pThis->pBuf);
}
pThis->pBuf = pNewBuf;
}
/* ok, when we reach this, we have sufficient memory */
*(pThis->pBuf + pThis->iBufPtr++) = c;
return SR_RET_OK;
}
char* sbStrBFinish(sbStrBObj *pThis)
{
char* pRetBuf;
sbSTRBCHECKVALIDOBJECT(pThis);
sbStrBAppendChar(pThis, '\0');
# if STRINGBUF_TRIM_ALLOCSIZE == 1
/* in this mode, we need to trim the string. To do
* so, we must allocate a new buffer of the exact
* string size, and then copy the old one over.
* This new buffer is then to be returned.
*/
if((pRetBuf = malloc((pThis->iBufSize + 1) * sizeof(char))) == NULL)
{ /* OK, in this case we use the previous buffer. At least
* we have it ;)
*/
pRetBuf = pThis->pBuf;
}
else
{ /* got the new buffer, so let's use it */
memcpy(pRetBuf, pThis->pBuf, pThis->iBufPtr + 1);
}
# else
/* here, we can simply return a pointer to the
* currently existing buffer. We don't care about
* the extra memory, as we achieve a big performance
* gain.
*/
pRetBuf = pThis->pBuf;
# endif
sbStrBDestruct(pThis);
return(pRetBuf);
}
void sbStrBSetAllocIncrement(sbStrBObj *pThis, int iNewIncrement)
{
sbSTRBCHECKVALIDOBJECT(pThis);
assert(iNewIncrement > 0);
pThis->iAllocIncrement = iNewIncrement;
}
|
