Scalar implementation for int8 stream, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0, SplitInt8<a,10,160,64,16>::filter3 takes 1649 cycles SplitInt8<a,10,160,64,-32>filter2 takes 1237 cycles.
#include <split.h>
|
|
void | filter8 (input_stream< TT > *in, output_window< TT > *out0, output_window< TT > *out1, output_window< TT > *out2, output_window< TT > *out3, output_window< TT > *out4, output_window< TT > *out5, output_window< TT > *out6, output_window< TT > *out7) |
| |
|
void | filter7 (input_stream< TT > *in, output_window< TT > *out0, output_window< TT > *out1, output_window< TT > *out2, output_window< TT > *out3, output_window< TT > *out4, output_window< TT > *out5, output_window< TT > *out6) |
| |
|
void | filter6 (input_stream< TT > *in, output_window< TT > *out0, output_window< TT > *out1, output_window< TT > *out2, output_window< TT > *out3, output_window< TT > *out4, output_window< TT > *out5) |
| |
|
void | filter5 (input_stream< TT > *in, output_window< TT > *out0, output_window< TT > *out1, output_window< TT > *out2, output_window< TT > *out3, output_window< TT > *out4) |
| |
|
void | filter4 (input_stream< TT > *in, output_window< TT > *out0, output_window< TT > *out1, output_window< TT > *out2, output_window< TT > *out3) |
| |
|
void | filter3 (input_stream< TT > *in, output_window< TT > *out0, output_window< TT > *out1, output_window< TT > *out2) |
| |
|
void | filter2 (input_stream< TT > *in, output_window< TT > *out0, output_window< TT > *out1) |
| |
|
void | filter1 (input_stream< TT > *in, output_window< TT > *out0) |
| |
|
|
static void | registerKernelClass () |
| |
The documentation for this class was generated from the following files:
- design/aie_src/split.h
- design/aie_src/split.cc