// 
// Decompiled by Procyon v0.6.0
// 

package org.bouncycastle.math.ec.rfc8032;

abstract class Wnaf
{
    static void getSignedVar(final int[] array, final int n, final byte[] array2) {
        final int[] array3 = new int[array.length * 2];
        int n2 = array[array.length - 1] >> 31;
        int length = array.length;
        int length2 = array3.length;
        while (--length >= 0) {
            final int n3 = array[length];
            array3[--length2] = (n3 >>> 16 | n2 << 16);
            n2 = (array3[--length2] = n3);
        }
        final int n4 = 32 - n;
        int i = 0;
        int n5 = 0;
        for (int j = 0; j < array3.length; ++j, i -= 16) {
            final int n6 = array3[j];
            while (i < 16) {
                final int n7 = n6 >>> i;
                if ((n7 & 0x1) == n5) {
                    ++i;
                }
                else {
                    final int n8 = (n7 | 0x1) << n4;
                    n5 = n8 >>> 31;
                    array2[(j << 4) + i] = (byte)(n8 >> n4);
                    i += n;
                }
            }
        }
    }
}