[aarch64-port-dev ] [aarch64-port-dev] [10] RFR: 8184049 : Matching rule for ubfiz

[Andrew Haley]

On 27/07/17 21:49, Daniel Stewart wrote:
> public void run(String [] args) {
>         long sum = this.sum | (1 << 27);
>         int n = (int)sum;
>         n = xorshift32(n);
>         for (int i = 0; i < 1000; i++) {
>             //System.out.println((int)Math.random());
>             n += testI(n);
>             n += testI2(n);
>             n += testI3(n);
>             n += testI4(n);
>             n += testI5(n);
>         }
>         long n1 = (long)n;
>         for (int i = 0; i < 1000; i++) {
>             n1 += testL(n1);
>             n1 += testL2(n1);
>             n1 += testL3(n1);
>             n1 += testL4(n1);
>             n1 += testConv(n1);
>         }
>         short n2 = (short)n;
>         for (int i = 0; i < 1000; i++) {
>             n2 += testConv2((short)n2);
>         }
>         n1 += n2;
>         for (int i = 0; i< 1000; i++) {
>             n1 += testConv3(n);

This loop doesn't test the intrinsic.  I added

               n = xorshift32(n);

here.

>         }
>         this.sum += sum ^ n1;


-- 
Andrew Haley
Java Platform Lead Engineer
Red Hat UK Ltd. <https://www.redhat.com>
EAC8 43EB D3EF DB98 CC77 2FAD A5CD 6035 332F A671