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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/import/hwpf/fapi2/src/array.C $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2012,2016 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or */
/* implied. See the License for the specific language governing */
/* permissions and limitations under the License. */
/* */
/* IBM_PROLOG_END_TAG */
/**
* @file array.C
* @brief fapi2 arrays
*/
#include <stdint.h>
#include <array.H>
namespace fapi2
{
/// @brief Create an array
array::array(const uint32_t i_size, element_type* i_data):
iv_size(i_size),
iv_data(i_data)
{
assert(iv_size <= size_limit);
if (iv_data == nullptr)
{
iv_data = new element_type[iv_size]();
iv_size |= delete_bit;
}
// If the caller passed in a pointer, leave it be. Don't
// initialize it or anything. That will allow a placement
// operation where generic memory can use fapi2::array
// methods without much overhead.
}
/// @brief Destroy an array
array::~array(void)
{
if ((iv_size & delete_bit) != 0)
{
delete[] iv_data;
}
}
/// @brief operator[]
array::element_type& array::operator[](const uint32_t i_index)
{
assert(i_index < size());
return iv_data[i_index];
}
/// @brief operator=()
array& array::operator=(const array& i_other)
{
// Check to make sure it'll fit.
assert(i_other.size() <= size());
// Our new size will be the other's size.
// Save of whether we should delete our iv_data ...
uint64_t l_our_delete_state = iv_size | delete_bit;
// ... our new size is the size (minus the delete state) of i_other
iv_size = i_other.size();
// ... do the copy ...
memcpy(iv_data, i_other.iv_data, iv_size * sizeof(element_type));
// ... and record our old delete state.
iv_size |= l_our_delete_state;
return *this;
}
/// @brief move operator=()
array& array::operator=(array&& i_other)
{
iv_size = i_other.iv_size;
// Make sure to clear the delete bit in the other. We
// don't want our memory to be deleted.
i_other.iv_size = i_other.size();
iv_data = std::move(i_other.iv_data);
return *this;
}
/// @brief operator==()
bool array::operator==(const array& i_other)
{
// If they're not the same size, they're not the same
if (size() != i_other.size())
{
return false;
}
// If they're the same size and point to the same memory, they're the same.
if (iv_data == i_other.iv_data)
{
return true;
}
auto oitr = i_other.begin();
auto iter = begin();
for(; iter != end(); ++iter, ++oitr)
{
if (*iter != *oitr)
{
return false;
}
}
return true;
}
}
|
