blob: 1a49b08959b92a843336fdeb03ee61a1bcc37b0d (
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
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
|
/*****************************************************************************
Licensed to Accellera Systems Initiative Inc. (Accellera) under one or
more contributor license agreements. See the NOTICE file distributed
with this work for additional information regarding copyright ownership.
Accellera licenses this file to you 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.
*****************************************************************************/
#ifndef TLM_CORE_TLM2_TLM_ARRAY_H_INCLUDED_
#define TLM_CORE_TLM2_TLM_ARRAY_H_INCLUDED_
#include <vector>
#if defined(_MSC_VER) && !defined(SC_WIN_DLL_WARN)
#pragma warning(push)
#pragma warning(disable: 4251) // DLL import for std::string,vector
#endif
namespace tlm {
//
// To the LRM writer: the below class is an artifact of the tlm_generic_payload
// implementation and not part of the core TLM standard
//
// This implements a lean and fast array class that supports array expansion on
// request. The class is primarily used in the tlm_generic_payload class for
// storing the pointers to the extensions.
//
// Individual array elements can be accessed through the [] operators, and the
// array length is returned by the size() method.
//
// The size can be dynamically expanded using the expand(uint) method. There
// is no shrinking mechanism implemented, because the extension mechanism
// does not require this feature. Bear in mind that calling the expand method
// may invalidate all direct pointers into the array.
//the tlm_array shall always be used with T=tlm_extension_base*
template <typename T>
class tlm_array
: private std::vector<T>
{
typedef std::vector<T> base_type;
typedef typename base_type::size_type size_type;
public:
// constructor:
tlm_array(size_type size = 0)
: base_type(size)
, m_entries()
{
//m_entries.reserve(size); // optional
}
// copy constructor:
// tlm_array(const tlm_array& orig) = default;
// destructor:
// ~tlm_array() = default;
// operators for dereferencing:
using base_type::operator[];
// array size:
using base_type::size;
// expand the array if needed:
void expand(size_type new_size)
{
if (new_size > size())
{
base_type::resize(new_size);
//m_entries.reserve(new_size); // optional
}
}
static const char* const kind_string;
const char* kind() const { return kind_string; }
//this function shall get a pointer to a array slot
// it stores this slot in a cache of active slots
void insert_in_cache(T* p)
{
//sc_assert( (p-&(*this)[0]) < size() );
m_entries.push_back( p-&(*this)[0] );
}
//this functions clears all active slots of the array
void free_entire_cache()
{
while(m_entries.size())
{
if ((*this)[m_entries.back()]) //we make sure no one cleared the slot manually
(*this)[m_entries.back()]->free();//...and then we call free on the content of the slot
(*this)[m_entries.back()]=0; //afterwards we set the slot to NULL
m_entries.pop_back();
}
}
protected:
std::vector<size_type> m_entries;
};
template <typename T>
const char* const tlm_array<T>::kind_string = "tlm_array";
#if defined(_MSC_VER) && !defined(SC_WIN_DLL_WARN)
#pragma warning(pop)
#endif
} // namespace tlm
#endif /* TLM_CORE_TLM2_TLM_ARRAY_H_INCLUDED_ */
|
