| 1129 | } |
| 1130 | |
| 1131 | static void |
| 1132 | nc_asinh( npy_intp n, npy_complex64 *x, npy_intp sb1, npy_complex64 *r) |
| 1133 | { |
| 1134 | npy_complex64 a; |
| 1135 | if( sb1 == sizeof(npy_complex64) ) { // Aligned |
| 1136 | for( npy_intp I = 0; I < n; I++ ) { |
| 1137 | a = x[I]; |
| 1138 | _inline_mul( x[I], x[I], r[I]); |
| 1139 | _inline_add( Z_1, r[I], r[I]); |
| 1140 | _inline_sqrt( r[I], r[I] ); |
| 1141 | _inline_add( r[I], a, r[I] ); |
| 1142 | _inline_log( r[I], r[I] ); |
| 1143 | } |
| 1144 | } |
| 1145 | else { |
| 1146 | sb1 /= sizeof(npy_complex64); |
| 1147 | for( npy_intp I = 0; I < n; I++ ) { |
| 1148 | a = x[I*sb1]; |
| 1149 | _inline_mul( x[I*sb1], x[I*sb1], r[I]); |
| 1150 | _inline_add( Z_1, r[I], r[I]); |
| 1151 | _inline_sqrt( r[I], r[I] ); |
| 1152 | _inline_add( r[I], a, r[I] ); |
| 1153 | _inline_log( r[I], r[I] ); |
| 1154 | } |
| 1155 | } |
| 1156 | } |
| 1157 | |
| 1158 | static void |
| 1159 | nc_asinh( npy_intp n, npy_complex128 *x, npy_intp sb1, npy_complex128 *r) |
nothing calls this directly
no test coverage detected
searching dependent graphs…