File: chunk_storage.cpp

package info (click to toggle)
indigo 1.2.3-1
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 28,256 kB
  • sloc: ansic: 309,316; cpp: 137,636; cs: 9,118; asm: 8,011; java: 7,195; sql: 6,697; xml: 4,352; python: 3,426; sh: 207; php: 56; makefile: 49
file content (78 lines) | stat: -rw-r--r-- 1,782 bytes parent folder | download | duplicates (3)
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
/****************************************************************************
 * Copyright (C) 2009-2015 EPAM Systems
 *
 * This file is part of Indigo toolkit.
 *
 * This file may be distributed and/or modified under the terms of the
 * GNU General Public License version 3 as published by the Free Software
 * Foundation and appearing in the file LICENSE.GPL included in the
 * packaging of this file.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 ***************************************************************************/

#include "base_cpp/chunk_storage.h"

using namespace indigo;

IMPL_ERROR(ChunkStorage, "chunk storage");

ChunkStorage::ChunkStorage ()
{
   _offset.push(0);
}

void ChunkStorage::clear ()
{
   _arr.clear();
   _offset.clear();
   _offset.push(0);
}

byte* ChunkStorage::add (int n_bytes)
{
   int prev_size = _offset.top();
   _arr.resize(prev_size + n_bytes);
   _offset.push(prev_size + n_bytes);
   return _arr.ptr() + prev_size;
}

void ChunkStorage::add (const byte *data, int n_bytes)
{
   byte *ptr = add(n_bytes);
   memcpy(ptr, data, n_bytes);
}

void ChunkStorage::add (const Array<char> &data)
{
   add((const byte *)data.ptr(), data.size());
}

void ChunkStorage::add (const char *str)
{
   add((const byte *)str, strlen(str) + 1);
}

byte* ChunkStorage::get (int i)
{
   return _arr.ptr() + _offset[i];
}

int ChunkStorage::getSize (int i)
{
   return _offset[i + 1] - _offset[i];
}

int ChunkStorage::count (void)
{
   return _offset.size() - 1;
}

void ChunkStorage::pop ()
{
   if (count() == 0)
      throw Error("Cannot pop element from empty chunk storage");
   _offset.pop();
   _arr.resize(_offset[_offset.size() - 1]);
}