-
Notifications
You must be signed in to change notification settings - Fork 67
/
eltwise.hpp
95 lines (89 loc) · 4.07 KB
/
eltwise.hpp
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
/******************************************************************************
* Copyright (c) 2022, Xilinx, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION). HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
******************************************************************************/
/******************************************************************************
* @brief
* Templatized streaming elementwise operator, consuming two streams and
* producing a third. The operator and datatypes can be customized.
* @author Yaman Umuroglu <[email protected]>
******************************************************************************/
#ifndef ELTWISE_HPP
#define ELTWISE_HPP
#include <hls_stream.h>
/**
* \brief StreamingEltwise function
*
* The function performs a generic eltwise function on two streams and
* produces an output stream.
*
* \tparam Channels Number of channels for eltwise operation
* \tparam PE Number of channels for eltwise operation computed in parallel
* \tparam N Total number of elements to process
* \tparam SliceIn0 Data slicer for input 0 type
* \tparam SliceIn1 Data slicer for input 1 type
* \tparam SliceOut Data slicer for output type
* \tparam TStrmIn0 Type of the input 0 stream - safely deducible from the paramaters
* \tparam TStrmIn1 Type of the input 1 stream - safely deducible from the paramaters
* \tparam TStrmOut Type of the output - safely deducible from the paramaters
* \tparam TFxn Type of the function class (e.g. Max, Avg, Sum) - safely deducible from the paramaters
*
* \param in Input stream
* \param out Output stream
* \param function Function to apply, derived from EltwiseFunction
*/
template<
unsigned Channels, unsigned PE, unsigned N,
typename SliceIn0, typename SliceIn1, typename SliceOut,
typename TStrmIn0, typename TStrmIn1, typename TStrmOut,
typename Fxn
>
void StreamingEltwise(
hls::stream<TStrmIn0> &in0,
hls::stream<TStrmIn1> &in1,
hls::stream<TStrmOut> &out,
Fxn &&f
) {
constexpr unsigned TOTAL_FOLD = (Channels / PE) * N;
// everything merged into a common iteration space (one big loop instead
// of smaller nested loops) to get the pipelining the way we want
for(unsigned i = 0; i < TOTAL_FOLD; i++) {
#pragma HLS pipeline style=flp II=1
auto const in0_slice_channels = SliceIn0()(in0.read(), 0);
auto const in1_slice_channels = SliceIn1()(in1.read(), 0);
auto outElem = SliceOut().template operator()<TStrmOut>();
for(unsigned pe = 0; pe < PE; pe++) {
#pragma HLS UNROLL
outElem(pe, 0, 1) = f(in0_slice_channels(pe, 0), in1_slice_channels(pe, 0));
}
out.write(outElem);
}
};
#endif