Parent: [180d2e] (diff)

Download this file

SDU.cc    201 lines (171 with data), 4.7 kB

  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
// The MIT License (MIT)
//
// Copyright (c) 2014-2016 Brno University of Technology, PRISTINE project
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
/**
* @file SDU.cc
* @author Marcel Marek (imarek@fit.vutbr.cz)
* @date Apr 29, 2014
* @brief
* @detail
*/
#include <SDU.h>
SDU::SDU(const char *name, int kind) : SDU_Base(name, kind)
{
fSeqNum_var = seqNum_var = fOffset_var = fSize_var = this->offset_var = this->size_var = 0;
}
SDU::SDU(const SDU& other): SDU_Base(other){
copy(other);
}
void SDU::copy(const SDU& other){
mUserDataType::const_iterator it;
for(it = other.mUserData_var.begin(); it != other.mUserData_var.end(); ++it){
cPacket *cdap = (*it)->dup();
take(cdap);
mUserData_var.push_back(cdap);
}
}
/*
* This size returns size depending on @var dataType_var
*/
unsigned int SDU::getSize() const
{
if (dataType_var == SDU_COMPLETE_TYPE)
{
return size_var;
}
else if (dataType_var == SDU_FRAGMENT_TYPE)
{
return fSize_var;
}else{
return 0; //PANIC!
}
}
/*
* This method returns the absolute size of the SDU.
*/
unsigned int SDU::getAbsoluteSize() const
{
return size_var;
}
unsigned int SDU::getRestSize()const
{
return size_var - offset_var;
}
void SDU::setSize(unsigned int size)
{
if(userData !=NULL){
unsigned char *tmp = new unsigned char[size];
memcpy(tmp,userData, (this->size_var < size) ? this->size_var : size);
this->size_var = size;
free(userData);
userData = tmp;
}else{
this->size_var = size;
userData = new unsigned char[size];
}
}
unsigned char* SDU::getUserData() const
{
return &userData[offset_var];
}
const unsigned char* SDU::getUserData(unsigned int size)
{
offset_var += size;
return &userData[offset_var - size];
}
void SDU::setUserData(unsigned char* userData, unsigned int size)
{
if(this->userData != NULL){
free(this->userData);
this->offset_var = 0;
}
this->size_var = size;
this->userData = new unsigned char[size];
memcpy(this->userData, userData, size);
// this->userData = userData;
}
bool SDU::addUserData(cPacket* msg){
// if(msg->getSize() > MAXSDUSIZE){
// return false;
// }
//TODO A1 check current SDU size
take(msg);
this->mUserData_var.push_back(msg);
size_var += msg->getByteLength();
return true;
}
cPacket* SDU::getUserData(){
if (!mUserData_var.empty())
{
cPacket* cdap;
cdap = mUserData_var.front();
mUserData_var.erase(mUserData_var.begin());
drop(cdap);
return cdap;
}
else
{
return NULL;
}
}
/**
* Returns SDU Fragments vector of specified size
*
*/
std::vector<SDU*> SDU::fragment(unsigned int size){
std::vector<SDU*> frags;
SDU* tmp;
for(unsigned int i = 0; i* size < this->size_var; i++){
tmp = this->genFragment(size, i, i*size);
frags.push_back(tmp);
}
return frags;
}
SDU* SDU::genFragment(unsigned int size, unsigned int fSeqNum, unsigned int fOffset){
SDU* tmp = this->dup();
tmp = new SDU(*this);
tmp->setFragment(size, fSeqNum, fOffset);
return tmp;
}
void SDU::setFragment(unsigned int fSize, unsigned int fSeqNum, unsigned int fOffset){
fSize_var = fSize;
fSeqNum_var = fSeqNum;
fOffset_var = fOffset;
dataType_var = SDU_FRAGMENT_TYPE;
if(fSeqNum == 0){
fragType_var = SDU_FRAG_FIRST;
}else if(fSize + fOffset == this->size_var){
fragType_var = SDU_FRAG_LAST;
}else{
fragType_var = SDU_FRAG_MIDDLE;
}
}
SDU::~SDU()
{
std::vector<cPacket*>::iterator it;
for(it = mUserData_var.begin(); it != mUserData_var.end();){
if((*it) != NULL){
drop((*it));
delete (*it);
}
it = mUserData_var.erase(it);
}
}