| 18 | // ----------------------------------------------------------------------------------- |
| 19 | |
| 20 | void multiply ( |
| 21 | bool add_to, |
| 22 | tensor& dest, |
| 23 | const tensor& src1, |
| 24 | const tensor& src2 |
| 25 | ) |
| 26 | { |
| 27 | DLIB_CASSERT(dest.k() == src1.k() && src1.k() == src2.k() && |
| 28 | dest.nr() == src1.nr() && src1.nr() == src2.nr() && |
| 29 | dest.nc() == src1.nc() && src1.nc() == src2.nc() ); |
| 30 | const long MD = std::max(std::max(dest.num_samples(),src1.num_samples()),src2.num_samples()); |
| 31 | DLIB_CASSERT((dest.num_samples()==1 || dest.num_samples()==MD) && |
| 32 | (src1.num_samples()==1 || src1.num_samples()==MD) && |
| 33 | (src2.num_samples()==1 || src2.num_samples()==MD) ); |
| 34 | |
| 35 | if (dest.size() == 0) |
| 36 | return; |
| 37 | |
| 38 | const size_t max_size = std::max(std::max(dest.size(),src1.size()),src2.size()); |
| 39 | const auto d = dest.host(); |
| 40 | const auto s1 = src1.host(); |
| 41 | const auto s2 = src2.host(); |
| 42 | if (dest.size() == src1.size() && src1.size() == src2.size()) |
| 43 | { |
| 44 | if (add_to) |
| 45 | { |
| 46 | for (size_t i = 0; i < src1.size(); ++i) |
| 47 | d[i] += s1[i]*s2[i]; |
| 48 | } |
| 49 | else |
| 50 | { |
| 51 | for (size_t i = 0; i < src1.size(); ++i) |
| 52 | d[i] = s1[i]*s2[i]; |
| 53 | } |
| 54 | } |
| 55 | else if (dest.num_samples() == 1) |
| 56 | { |
| 57 | if (!add_to) |
| 58 | { |
| 59 | for (size_t i = 0; i < dest.size(); ++i) |
| 60 | d[i] = 0; |
| 61 | } |
| 62 | for (size_t i = 0; i < max_size; ++i) |
| 63 | d[i%dest.size()] += s1[i%src1.size()]*s2[i%src2.size()]; |
| 64 | } |
| 65 | else |
| 66 | { |
| 67 | if (add_to) |
| 68 | { |
| 69 | for (size_t i = 0; i < max_size; ++i) |
| 70 | d[i] += s1[i%src1.size()]*s2[i%src2.size()]; |
| 71 | } |
| 72 | else |
| 73 | { |
| 74 | for (size_t i = 0; i < max_size; ++i) |
| 75 | d[i] = s1[i%src1.size()]*s2[i%src2.size()]; |
| 76 | } |
| 77 | } |