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
|
/*
* Copyright (c) 2018 Samsung Electronics Co., Ltd. All Rights Reserved
*
* 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.
*/
/**
* @file Reader.h
* @brief This file contains Reader class
* @ingroup COM_AI_RUNTIME
*/
#ifndef __INTERNAL_NNAPI_TENSOR_READER_H__
#define __INTERNAL_NNAPI_TENSOR_READER_H__
#include <vector>
#include "misc/tensor/Reader.h"
namespace internal
{
namespace nnapi
{
namespace tensor
{
/**
* @brief Wrapper class to read tensor values
* @tparam T The tensor element type
*/
template <typename T> class Reader final : public nnfw::misc::tensor::Reader<T>
{
public:
/**
* @brief Construct a Reader class
* @param[in] shape Tensor shape
* @param[in] ptr The base pointer of actual data
* @param[in] len The number of bytes
*/
Reader(const ::nnfw::misc::tensor::Shape &shape, const T *ptr, size_t len)
: _shape{shape}, _ptr{ptr}
{
assert(shape.num_elements() * sizeof(T) == len);
initialize();
}
public:
/**
* @brief Get shape object
* @return The shape as const reference
*/
const nnfw::misc::tensor::Shape &shape(void) const { return _shape; }
public:
/**
* @brief Get the value on the given index
* @param[in] index_nnapi Flattened tensor index
* @return The value on the given index
*/
T at(const nnfw::misc::tensor::Index &index_nnapi) const override
{
uint32_t offset = 0;
for (int i = 0; i < _shape.rank(); i++)
offset += index_nnapi.at(i) * _stridess.at(i);
return _ptr[offset];
}
private:
/**
* @brief Initializes @c _stridess
* @return N/A
* @note Assuming that shape is [d4, .. , d1] and data is stored at a pointer ptr,
we need to calculate the offset of index [i4, .. i1] as follows:
offset = i4 * (d3 * d2 * d1) +
i3 * (d2 * d1) +
i2 * (d1) +
i1
So (d4 * d3 * d2 * d1) or (d3 * d2 * d1) or (d2 * d1) happens whenever offset is
calculate. To minimize this repetitive calculation,
_stridess[n] contains _spape[n-1]*_spape[n-2]*_spape[0]
*/
void initialize(void)
{
for (int r = 0; r < _shape.rank(); r++)
{
int elem_count = 1;
for (int k = r + 1; k < _shape.rank(); k++)
elem_count *= _shape.dim(k);
_stridess.emplace_back(elem_count);
}
}
private:
nnfw::misc::tensor::Shape _shape;
private:
const T *_ptr;
std::vector<int32_t> _stridess;
};
} // namespace tensor
} // namespace nnapi
} // namespace internal
#endif // __INTERNAL_NNAPI_TENSOR_READER_H__
|
