| 239 | } |
| 240 | |
| 241 | void ap::vmove(double *vdst, int stride_dst, const double* vsrc, int stride_src, int n) |
| 242 | { |
| 243 | int i; |
| 244 | if( stride_dst!=1 || stride_src!=1 ) |
| 245 | { |
| 246 | // |
| 247 | // general unoptimized case |
| 248 | // |
| 249 | for(i=0; i<n; i++, vdst+=stride_dst, vsrc+=stride_src) |
| 250 | *vdst = *vsrc; |
| 251 | } |
| 252 | else |
| 253 | { |
| 254 | // |
| 255 | // highly optimized case |
| 256 | // |
| 257 | int n2 = n/2; |
| 258 | for(i=0; i<n2; i++, vdst+=2, vsrc+=2) |
| 259 | { |
| 260 | vdst[0] = vsrc[0]; |
| 261 | vdst[1] = vsrc[1]; |
| 262 | } |
| 263 | if( n%2!=0 ) |
| 264 | vdst[0] = vsrc[0]; |
| 265 | } |
| 266 | } |
| 267 | |
| 268 | void ap::vmove(ap::complex *vdst, int stride_dst, const ap::complex* vsrc, int stride_src, const char *conj_src, int n) |
| 269 | { |
nothing calls this directly
no outgoing calls
no test coverage detected