File: nnbuffer.cpp

package info (click to toggle)
museek%2B 1%3A0.2%2Bsvn20100315.r1208-1
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 7,664 kB
  • ctags: 6,895
  • sloc: cpp: 28,853; python: 28,014; ansic: 538; makefile: 128; sh: 117
file content (73 lines) | stat: -rw-r--r-- 1,956 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
/*  NewNet - A networking framework in C++
    Copyright (C) 2006-2007 Ingmar K. Steen (iksteen@gmail.com)
    Copyright 2008 little blue poney <lbponey@users.sourceforge.net>

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

 */

#include "nnbuffer.h"
#include "platform.h"

#define CHUNK_SIZE 8192

NewNet::Buffer::Buffer() : m_Ptr(0), m_Pos(0), m_Count(0), m_Left(0)
{
}

NewNet::Buffer::Buffer(const Buffer & that) : m_Ptr(0), m_Pos(0), m_Count(0), m_Left(0)
{
  append(that.data(), that.count());
}

NewNet::Buffer &
NewNet::Buffer::operator=(const Buffer & that)
{
  m_Left += m_Pos + m_Count;
  m_Pos = m_Count = 0;
  append(that.data(), that.count());
  return *this;
}

NewNet::Buffer::~Buffer()
{
  free(m_Ptr);
}

void
NewNet::Buffer::append(const unsigned char * data, size_t n)
{
  if(m_Left < n)
  {
    if(m_Pos + m_Left >= n)
    {
      memmove(m_Ptr, m_Ptr + m_Pos, m_Count);
      m_Left += m_Pos;
      m_Pos = 0;
    }
    else
    {
      int newSize = (((n + m_Count + m_Pos) / CHUNK_SIZE) + 1) * CHUNK_SIZE;
      unsigned char * newPtr = (unsigned char *)realloc(m_Ptr, newSize);
      assert(newPtr != 0);
      m_Ptr = newPtr;
      m_Left = newSize - m_Count - m_Pos;
    }
  }

  memcpy(m_Ptr + m_Pos + m_Count, data, n);
  m_Count += n;
  m_Left -= n;
}