| 939 | } |
| 940 | |
| 941 | static void |
| 942 | nc_acos( npy_intp n, npy_complex64 *x, npy_intp sb1, npy_complex64 *r) |
| 943 | { |
| 944 | npy_complex64 a; |
| 945 | if( sb1 == sizeof(npy_complex64) ) { // Aligned |
| 946 | for( npy_intp I = 0; I < n; I++ ) { |
| 947 | a = x[I]; |
| 948 | _inline_mul( x[I], x[I], r[I] ); |
| 949 | _inline_sub( Z_1, r[I], r[I] ); |
| 950 | _inline_sqrt( r[I], r[I] ); |
| 951 | _inline_muli( r[I], r[I] ); |
| 952 | _inline_add( a, r[I], r[I] ); |
| 953 | _inline_log( r[I] , r[I] ); |
| 954 | _inline_muli( r[I], r[I] ); |
| 955 | _inline_neg( r[I], r[I]); |
| 956 | } |
| 957 | } |
| 958 | else { |
| 959 | sb1 /= sizeof(npy_complex64); |
| 960 | for( npy_intp I = 0; I < n; I++ ) { |
| 961 | a = x[I*sb1]; |
| 962 | _inline_mul( x[I*sb1], x[I*sb1], r[I] ); |
| 963 | _inline_sub( Z_1, r[I], r[I] ); |
| 964 | _inline_sqrt( r[I], r[I] ); |
| 965 | _inline_muli( r[I], r[I] ); |
| 966 | _inline_add( a, r[I], r[I] ); |
| 967 | _inline_log( r[I] , r[I] ); |
| 968 | _inline_muli( r[I], r[I] ); |
| 969 | _inline_neg( r[I], r[I]); |
| 970 | } |
| 971 | } |
| 972 | } |
| 973 | |
| 974 | static void |
| 975 | nc_acos( npy_intp n, npy_complex128 *x, npy_intp sb1, npy_complex128 *r) |
nothing calls this directly
no test coverage detected
searching dependent graphs…