blob: 1e46466b7a72030ae94167b0784c3803814d1f6a (
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
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/usr/devicefw/assoccontain.C $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2011
//
// p1
//
// Object Code Only (OCO) source materials
// Licensed Internal Code Source Materials
// IBM HostBoot Licensed Internal Code
//
// The source code for this program is not published or other-
// wise divested of its trade secrets, irrespective of what has
// been deposited with the U.S. Copyright Office.
//
// Origin: 30
//
// IBM_PROLOG_END
#include "assoccontain.H"
#include <assert.h>
#include <stdlib.h>
#include <string.h>
namespace DeviceFW
{
AssociationContainer::AssociationContainer()
: iv_data(NULL), iv_size(0)
{
}
AssociationContainer::~AssociationContainer()
{
if (NULL != iv_data)
{
free(iv_data);
}
}
AssociationData* AssociationContainer::operator[](size_t i_pos) const
{
if (i_pos >= iv_size)
{
return NULL;
}
return &iv_data[i_pos];
}
size_t AssociationContainer::allocate(size_t i_size)
{
size_t cur_pos = iv_size;
// Resize buffer to have space for request.
iv_size += i_size;
iv_data =
static_cast<AssociationData*>(
realloc(iv_data,
sizeof(AssociationData) * (iv_size)
)
);
// Clear out newly allocated space.
memset(this->operator[](cur_pos), '\0',
sizeof(AssociationData) * i_size);
return cur_pos;
}
};
|