aboutsummaryrefslogtreecommitdiff
path: root/src/unstable/blobbuilder.cpp
blob: fd62cb0a51c491ac8079f801e9c2b2be56ec78f7 (plain)
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
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
/*
 * Copyright (C) 2007-2019 Xagasoft, All rights reserved.
 *
 * This file is part of the libbu++ library and is released under the
 * terms of the license contained in the file LICENSE.
 */

#include "bu/blobbuilder.h"
#include "bu/blob.h"
#include "bu/exceptionbase.h"

#define PAGE_SIZE 8

/////
// BlobBuilderCore::Chunk
//

Bu::BlobBuilderCore::Chunk::Chunk( const char *pSrc, int32_t iLength ) :
    iLength( iLength ),
    pData( 0 ),
    pNext( 0 )
{
    if( iLength < PAGE_SIZE )
    {
        pData = new char[PAGE_SIZE];
    }
    else
    {
        pData = new char[iLength];
    }
    memcpy( pData, pSrc, iLength );
}

Bu::BlobBuilderCore::Chunk::~Chunk()
{
    delete[] pData;
    pData = 0;
    pNext = 0;

    // Why not delete pNext here? A BlobBuilder could easily wind up having
    // quite a few chunks, and if it does, deleting the linked list from here
    // could actually exhaust the program stack.  Instead these are all deleted
    // in the core down below.
}

void Bu::BlobBuilderCore::Chunk::append( const char *&pSrc, int32_t &iLength )
{
    if( this->iLength >= PAGE_SIZE )
    {
        // This chunk is full, just return.
        return;
    }
    int32_t iCopy = PAGE_SIZE-this->iLength;
    if( iCopy > iLength )
    {
        iCopy = iLength;
    }
    memcpy( pData+this->iLength, pSrc, iCopy );
    this->iLength += iCopy;
    pSrc += iCopy;
    iLength -= iCopy;
}

Bu::BlobBuilderCore::Chunk *Bu::BlobBuilderCore::Chunk::split( int32_t iIndex )
{
    if( iIndex == 0 )
        return NULL;

    if( iIndex >= iLength )
        return NULL;

    Chunk *pNew = new Chunk( pData+iIndex, iLength-iIndex );
    iLength -= iIndex;
    pNew->pNext = pNext;
    pNext = pNew;

    return pNew;
}

/////
// BlobBuilderCore
//

Bu::BlobBuilderCore::BlobBuilderCore() : 
    pFirst( 0 ),
    pLast( 0 ),
    iLength( 0 )
{
}

Bu::BlobBuilderCore::BlobBuilderCore( const Bu::BlobBuilderCore &rSrc ) :
    pFirst( 0 ),
    pLast( 0 ),
    iLength( rSrc.iLength )
{
    throw Bu::ExceptionBase("Not yet implemented.");
}

Bu::BlobBuilderCore::~BlobBuilderCore()
{
    clear();
}

void Bu::BlobBuilderCore::clear()
{
    Chunk *pCur = pFirst;
    while( pCur )
    {
        Chunk *pNext = pCur->pNext;
        delete pCur;
        pCur = pNext;
    }
    pFirst = pLast = 0;
    iLength = 0;
}

void Bu::BlobBuilderCore::append( const char *pSrc, int32_t iLength )
{
    this->iLength += iLength;
    if( pFirst == 0 )
    {
        // Nothing in the list, just add a chunk.
        pFirst = pLast = new Chunk( pSrc, iLength );
        return;
    }
    else if( pLast->iLength < PAGE_SIZE )
    {
        // Append to the last chunk first, this will modify pSrc & iLength.
        pLast->append( pSrc, iLength );
    }

    // If there's unused data at the end, append it now.
    if( iLength > 0 )
    {
        pLast->pNext = new Chunk( pSrc, iLength );
        pLast = pLast->pNext;
    }
}

void Bu::BlobBuilderCore::prepend( const char *pSrc, int32_t iLength )
{
    if( pFirst == 0 )
    {
        pFirst = pLast = new Chunk( pSrc, iLength );
    }
    else
    {
        Chunk *pNew = new Chunk( pSrc, iLength );
        pNew->pNext = pFirst;
        pFirst = pNew;
    }
    this->iLength += iLength;
}

void Bu::BlobBuilderCore::insert( int32_t iBefore, const char *pSrc,
        int32_t iLength )
{
    if( iBefore <= 0 )
    {
        prepend( pSrc, iLength );
        return;
    }
    if( iBefore >= this->iLength )
    {
        append( pSrc, iLength );
        return;
    }

    Chunk *pCur = pFirst;
    while( pCur )
    {
        if( iBefore == 0 )
        {
            // Insert between chunks, no splitting required.
            Chunk *pNew = new Chunk( pSrc, iLength );
            pNew->pNext = pCur->pNext;
            pCur->pNext = pNew;
            if( pLast == pCur )
                pLast = pNew;
        }
        if( iBefore < pCur->iLength )
        {
            // This is the chunk we need to split.
            Chunk *pNew = pCur->split( iBefore );
            if( pLast == pCur )
                pLast = pNew;
            continue;
        }
        pCur = pCur->pNext;
    }
    this->iLength += iLength;
}

void Bu::BlobBuilderCore::set( const char *pSrc, int32_t iLength )
{
    clear();
    append( pSrc, iLength );
}

void Bu::BlobBuilderCore::copyTo( void *pDestRaw, int32_t iLength ) const
{
    char *pDest = reinterpret_cast<char *>(pDestRaw);

    Chunk *pCur = pFirst;
    while( pCur && iLength )
    {
        int32_t iChunkLen = pCur->iLength;
        if( iChunkLen > iLength )
            iChunkLen = iLength;

        memcpy( pDest, pCur->pData, iChunkLen );
        pDest += iChunkLen;
        iLength -= iChunkLen;

        pCur = pCur->pNext;
    }
}

char Bu::BlobBuilderCore::getAt( int32_t iIndex ) const
{
    if( iIndex < 0 || iIndex >= iLength )
        throw Bu::ExceptionBase("Requseted index is out of range.");

    Chunk *pCur = pFirst;
    while( iIndex >= pCur->iLength )
    {
        iIndex -= pCur->iLength;
        pCur = pCur->pNext;
    }

    return pCur->pData[iIndex];
}

//////
// BlobBuilder
//

Bu::BlobBuilder::BlobBuilder()
{
}

Bu::BlobBuilder::BlobBuilder( const Bu::BlobBuilder &rSrc ) :
    Bu::SharedCore<Bu::BlobBuilder, Bu::BlobBuilderCore>( rSrc )
{
}

Bu::BlobBuilder::~BlobBuilder()
{
}

void Bu::BlobBuilder::set( const Blob &rSrc )
{
    _hardCopy();
    core->set( rSrc.getData(), rSrc.getSize() );
}

void Bu::BlobBuilder::set( const char *pSrc, int32_t iLength )
{
    _hardCopy();
    core->set( pSrc, iLength );
}

void Bu::BlobBuilder::set( const char *pSrc )
{
    _hardCopy();
    set( pSrc, strlen( pSrc ) );
}

void Bu::BlobBuilder::append( const Blob &rSrc )
{
    _hardCopy();
    core->append( rSrc.getData(), rSrc.getSize() );
}

void Bu::BlobBuilder::append( const char *pSrc, int32_t iLength )
{
    _hardCopy();
    core->append( pSrc, iLength );
}

void Bu::BlobBuilder::append( const char *pSrc )
{
    _hardCopy();
    append( pSrc, strlen( pSrc ) );
}

void Bu::BlobBuilder::prepend( const Blob &rSrc )
{
    _hardCopy();
    core->prepend( rSrc.getData(), rSrc.getSize() );
}

void Bu::BlobBuilder::prepend( const char *pSrc, int32_t iLength )
{
    _hardCopy();
    core->prepend( pSrc, iLength );
}

void Bu::BlobBuilder::prepend( const char *pSrc )
{
    _hardCopy();
    prepend( pSrc, strlen( pSrc ) );
}

void Bu::BlobBuilder::insert( int32_t iBefore, const Blob &rSrc )
{
    _hardCopy();
    core->insert( iBefore, rSrc.getData(), rSrc.getSize() );
}

void Bu::BlobBuilder::insert( int32_t iBefore, const char *pSrc,
        int32_t iLength )
{
    _hardCopy();
    core->insert( iBefore, pSrc, iLength );
}

void Bu::BlobBuilder::insert( int32_t iBefore, const char *pSrc )
{
    _hardCopy();
    insert( iBefore, pSrc, strlen( pSrc ) );
}

void Bu::BlobBuilder::clear()
{
    _hardCopy();
    core->clear();
}

int32_t Bu::BlobBuilder::getSize() const
{
    return core->iLength;
}

Bu::Blob Bu::BlobBuilder::getBlob() const
{
    return Blob( *this );
}

void Bu::BlobBuilder::copyTo( void *pDestRaw, int32_t iDestSize ) const
{
    core->copyTo( pDestRaw, iDestSize );
}

char Bu::BlobBuilder::operator[]( int32_t iIndex ) const
{
    return core->getAt( iIndex );
}

Bu::BlobBuilder &Bu::BlobBuilder::operator=( const Blob &rSrc )
{
    set( rSrc );
    return *this;
}

Bu::BlobBuilder &Bu::BlobBuilder::operator=( const char *pSrc )
{
    set( pSrc );
    return *this;
}

Bu::BlobBuilder &Bu::BlobBuilder::operator=( const char chr )
{
    set( &chr, 1 );
    return *this;
}

Bu::BlobBuilder &Bu::BlobBuilder::operator+=( const Blob &rSrc )
{
    append( rSrc );
    return *this;
}

Bu::BlobBuilder &Bu::BlobBuilder::operator+=( const char *pSrc )
{
    append( pSrc );
    return *this;
}

Bu::BlobBuilder &Bu::BlobBuilder::operator+=( const char chr )
{
    append( &chr, 1 );
    return *this;
}