| 1233 | } |
| 1234 | |
| 1235 | static void |
| 1236 | nc_atanh( npy_intp n, npy_complex64 *x, npy_intp sb1, npy_complex64 *r) |
| 1237 | { |
| 1238 | npy_complex64 a, b; |
| 1239 | if( sb1 == sizeof(npy_complex64) ) { // Aligned |
| 1240 | for( npy_intp I = 0; I < n; I++ ) { |
| 1241 | a = x[I]; |
| 1242 | _inline_sub( Z_1, a, r[I] ); |
| 1243 | _inline_add( Z_1, a, b ); |
| 1244 | _inline_div( b, r[I], r[I] ); |
| 1245 | _inline_log( r[I], r[I]); |
| 1246 | _inline_mul( Z_HALF, r[I], r[I] ); |
| 1247 | } |
| 1248 | } |
| 1249 | else { |
| 1250 | sb1 /= sizeof(npy_complex64); |
| 1251 | for( npy_intp I = 0; I < n; I++ ) { |
| 1252 | a = x[I*sb1]; |
| 1253 | _inline_sub( Z_1, a, r[I] ); |
| 1254 | _inline_add( Z_1, a, b ); |
| 1255 | _inline_div( b, r[I], r[I] ); |
| 1256 | _inline_log( r[I], r[I]); |
| 1257 | _inline_mul( Z_HALF, r[I], r[I] ); |
| 1258 | } |
| 1259 | } |
| 1260 | } |
| 1261 | |
| 1262 | static void |
| 1263 | nc_atanh( npy_intp n, npy_complex128 *x, npy_intp sb1, npy_complex128 *r) |
nothing calls this directly
no test coverage detected
searching dependent graphs…