// File: /workspace/github_c_makefile_star2_O2/BernardTatin[P]s7sh/s7.c
// Function: string_to_double_with_radix_1
static s7_double string_to_double_with_radix_1(const char *ur_str, int32_t radix)
#endif
        {
            /* strtod follows LANG which is not what we want (only "." is decimal point in Scheme).
             *   To overcome LANG in strtod would require screwing around with setlocale which never works.
             *   So we use our own code -- according to valgrind, this function is much faster than strtod.
             * comma as decimal point causes ambiguities: `(+ ,1 2) etc
             */

            int32_t i, sign = 1, frac_len, int_len, dig, max_len, exponent = 0;
            int64_t int_part = 0, frac_part = 0;
            char *str;
            char *ipart, *fpart;
            s7_double dval = 0.0;

            /* there's an ambiguity in number notation here if we allow "1e1" or "1.e1" in base 16 (or 15) -- is e a digit or an exponent marker?
             *   but 1e+1, for example disambiguates it -- kind of messy! -- the scheme spec says "e" can only occur in base 10.
             * '@' can now be used as the exponent marker (26-Mar-12).
             * Another slight ambiguity: 1+1/2i is parsed as 1 + 0.5i, not 1+1/(2i), or (1+1)/(2i) or (1+1/2)i etc
             */

            max_len = s7_int_digits_by_radix[radix];
            str = (char *)ur_str;

            if (*str == '+')
                str++;
            else
            {
                if (*str == '-')
                {
                    str++;
                    sign = -1;
                }
            }
            while (*str == '0') {str++;};

            ipart = str;
            while (digits[(int32_t)(*str)] < radix) str++;
            int_len = str - ipart;

            if (*str == '.') str++;
            fpart = str;
            while (digits[(int32_t)(*str)] < radix) str++;
            frac_len = str - fpart;

            if ((*str) && (exponent_table[(uint8_t)(*str)]))
            {
                int32_t exp_negative = false;
                str++;
                if (*str == '+')
                    str++;
                else
                {
                    if (*str == '-')
                    {
                        str++;
                        exp_negative = true;
                    }
                }
                while ((dig = digits[(int32_t)(*str++)]) < 10) /* exponent itself is always base 10 */
                {
#if HAVE_OVERFLOW_CHECKS
                    if ((int32_multiply_overflow(exponent, 10, &exponent)) ||
                            (int32_add_overflow(exponent, dig, &exponent)))
                    {
                        exponent = 1000000; /* see below */
                        break;
                    }
#else
                    exponent = dig + (exponent * 10);
#endif
                }
#if (!defined(__GNUC__)) || (__GNUC__ < 5)
                if (exponent < 0)         /* we overflowed, so make sure we notice it below (need to check for 0.0e... first) (Brian Damgaard) */
                    exponent = 1000000;     /*   see below for examples -- this number needs to be very big but not too big for add */
#endif
                if (exp_negative)
                    exponent = -exponent;

                /*           2e12341234123123123123213123123123 -> 0.0
                 * but exp len is not the decider: 2e00000000000000000000000000000000000000001 -> 20.0
                 * first zero: 2e123412341231231231231
                 * then:     2e12341234123123123123123123 -> inf
                 * then:     2e123412341231231231231231231231231231 -> 0.0
                 *           2e-123412341231231231231 -> inf
                 * but:      0e123412341231231231231231231231231231
                 */
            }

#if WITH_GMP
            /* 9007199254740995.0 */
            if (int_len + frac_len >= max_len)
            {
                (*overflow) = true;
                return(0.0);
            }
#endif

            str = ipart;
            if ((int_len + exponent) > max_len)
            {
                /*  12341234.56789e12                   12341234567889999872.0              1.234123456789e+19
                 * -1234567890123456789.0              -1234567890123456768.0              -1.2345678901235e+18
                 *  12345678901234567890.0              12345678901234567168.0              1.2345678901235e+19
                 *  123.456e30                          123456000000000012741097792995328.0 1.23456e+32
                 *  12345678901234567890.0e12           12345678901234569054409354903552.0  1.2345678901235e+31
                 *  1.234567890123456789012e30          1234567890123456849145940148224.0   1.2345678901235e+30
                 *  1e20                                100000000000000000000.0             1e+20
                 *  1234567890123456789.0               1234567890123456768.0               1.2345678901235e+18
                 *  123.456e16                          1234560000000000000.0               1.23456e+18
                 *  98765432101234567890987654321.0e-5  987654321012345728401408.0          9.8765432101235e+23
                 *  98765432101234567890987654321.0e-10 9876543210123456512.0               9.8765432101235e+18
                 *  0.00000000000000001234e20           1234.0
                 *  0.000000000000000000000000001234e30 1234.0
                 *  0.0000000000000000000000000000000000001234e40 1234.0
                 *  0.000000000012345678909876543210e15 12345.678909877
                 *  0e1000                              0.0
                 */

                for (i = 0; i < max_len; i++)
                {
                    dig = digits[(int32_t)(*str++)];
                    if (dig < radix)
                        int_part = dig + (int_part * radix);
                    else break;
                }

                /* if the exponent is huge, check for 0 int_part and frac_part before complaining (0e1000 or 0.0e1000)
                */
                if ((int_part == 0) &&
                        (exponent > max_len))
                {
                    /* if frac_part is also 0, return 0.0 */
                    if (frac_len == 0)
                        return(0.0);

                    str = fpart;
                    while ((dig = digits[(int32_t)(*str++)]) < radix)
                        frac_part = dig + (frac_part * radix);
                    if (frac_part == 0)
                        return(0.0);

#if WITH_GMP
                    (*overflow) = true;
#endif
                }

#if WITH_GMP
                (*overflow) = ((int_part > 0) || (exponent > 20));    /* .1e310 is a tricky case */
#endif

                if (int_part != 0) /* 0.<310 zeros here>1e310 for example --
                                    *   pow (via dpow) thinks it has to be too big, returns Nan,
                                    *   then Nan * 0 -> Nan and the NaN propagates
                                    */
                {
                    if (int_len <= max_len)
                        dval = int_part * dpow(radix, exponent);
                    else dval = int_part * dpow(radix, exponent + int_len - max_len);
                }
                else dval = 0.0;

                /* shift by exponent, but if int_len > max_len then we assumed (see below) int_len - max_len 0's on the left */
                /*   using int_to_int or table lookups here instead of pow did not make any difference in speed */

                if (int_len < max_len)
                {
                    int32_t k, flen;
                    str = fpart;

                    for (k = 0; (frac_len > 0) && (k < exponent); k += max_len)
                    {
                        if (frac_len > max_len) flen = max_len; else flen = frac_len;
                        frac_len -= max_len;

                        frac_part = 0;
                        for (i = 0; i < flen; i++)
                            frac_part = digits[(int32_t)(*str++)] + (frac_part * radix);

                        if (frac_part != 0)                                /* same pow->NaN problem as above can occur here */
                            dval += frac_part * dpow(radix, exponent - flen - k);
                    }
                }
                else
                {
                    /* some of the fraction is in the integer part before the negative exponent shifts it over */
                    if (int_len > max_len)
                    {
                        int32_t ilen;
                        /* str should be at the last digit we read */
                        ilen = int_len - max_len;                          /* we read these above */
                        if (ilen > max_len)
                            ilen = max_len;

                        for (i = 0; i < ilen; i++)
                            frac_part = digits[(int32_t)(*str++)] + (frac_part * radix);

                        dval += frac_part * dpow(radix, exponent - ilen);
                    }
                }

                return(sign * dval);
            }

            /* int_len + exponent <= max_len */

            if (int_len <= max_len)
            {
                int32_t int_exponent;

                /* a better algorithm (since the inaccuracies are in the radix^exponent portion):
                 *   strip off leading zeros and possible sign,
                 *   strip off digits beyond max_len, then remove any trailing zeros.
                 *     (maybe fiddle with the lowest order digit here for rounding, but I doubt it matters)
                 *   read digits until end of number or max_len reached, ignoring the decimal point
                 *   get exponent and use it and decimal point location to position the current result integer
                 * this always combines the same integer and the same exponent no matter how the number is expressed.
                 */

                int_exponent = exponent;
                if (int_len > 0)
                {
                    char *iend;
                    iend = (char *)(str + int_len - 1);
                    while ((*iend == '0') && (iend != str)) {iend--; int_exponent++;}

                    while (str <= iend)
                        int_part = digits[(int32_t)(*str++)] + (int_part * radix);
                }
                if (int_exponent != 0)
                    dval = int_part * dpow(radix, int_exponent);
                else dval = (s7_double)int_part;
            }
            else
            {
                int32_t len, flen;
                int64_t frpart = 0;

                /* 98765432101234567890987654321.0e-20    987654321.012346
                 * 98765432101234567890987654321.0e-29    0.98765432101235
                 * 98765432101234567890987654321.0e-30    0.098765432101235
                 * 98765432101234567890987654321.0e-28    9.8765432101235
                 */

                len = int_len + exponent;
                for (i = 0; i < len; i++)
                    int_part = digits[(int32_t)(*str++)] + (int_part * radix);

                flen = -exponent;
                if (flen > max_len)
                    flen = max_len;

                for (i = 0; i < flen; i++)
                    frpart = digits[(int32_t)(*str++)] + (frpart * radix);

                if (len <= 0)
                    dval = int_part + frpart * dpow(radix, len - flen);
                else dval = int_part + frpart * dpow(radix, -flen);
            }

            if (frac_len > 0)
            {
                str = fpart;
                if (frac_len <= max_len)
                {
                    /* splitting out base 10 case saves very little here */
                    /* this ignores trailing zeros, so that 0.3 equals 0.300 */
                    char *fend;

                    fend = (char *)(str + frac_len - 1);
                    while ((*fend == '0') && (fend != str)) {fend--; frac_len--;} /* (= .6 0.6000) */

                    if ((frac_len & 1) == 0)
                    {
                        while (str <= fend)
                        {
                            frac_part = digits[(int32_t)(*str++)] + (frac_part * radix);
                            frac_part = digits[(int32_t)(*str++)] + (frac_part * radix);
                        }
                    }
                    else
                    {
                        while (str <= fend)
                            frac_part = digits[(int32_t)(*str++)] + (frac_part * radix);
                    }
                    dval += frac_part * dpow(radix, exponent - frac_len);

                    /* 0.6:    frac:    6, exp: 0.10000000000000000555, val: 0.60000000000000008882
                     * 0.60:   frac:   60, exp: 0.01000000000000000021, val: 0.59999999999999997780
                     * 0.6000: frac: 6000, exp: 0.00010000000000000000, val: 0.59999999999999997780
                     * (= 0.6 0.60): #f
                     * (= #i3/5 0.6): #f
                     * so (string->number (number->string num)) == num only if both num's are the same text (or you get lucky)
                     * (= 0.6 6e-1): #t ; but not 60e-2
                     * to fix the 0.60 case, we need to ignore trailing post-dot zeros.
                     */
                }
                else
                {
                    if (exponent <= 0)
                    {
                        for (i = 0; i < max_len; i++)
                            frac_part = digits[(int32_t)(*str++)] + (frac_part * radix);

                        dval += frac_part * dpow(radix, exponent - max_len);
                    }
                    else
                    {
                        /* 1.0123456789876543210e1         10.12345678987654373771
                         * 1.0123456789876543210e10        10123456789.87654304504394531250
                         * 0.000000010000000000000000e10   100.0
                         * 0.000000010000000000000000000000000000000000000e10 100.0
                         * 0.000000012222222222222222222222222222222222222e10 122.22222222222222
                         * 0.000000012222222222222222222222222222222222222e17 1222222222.222222
                         */

                        int_part = 0;
                        for (i = 0; i < exponent; i++)
                            int_part = digits[(int32_t)(*str++)] + (int_part * radix);

                        frac_len -= exponent;
                        if (frac_len > max_len)
                            frac_len = max_len;

                        for (i = 0; i < frac_len; i++)
                            frac_part = digits[(int32_t)(*str++)] + (frac_part * radix);

                        dval += int_part + frac_part * dpow(radix, -frac_len);
                    }
                }
            }

#if WITH_GMP
            if ((int_part == 0) &&
                    (frac_part == 0))
                return(0.0);
            (*overflow) = ((frac_len - exponent) > max_len);
#endif

            return(sign * dval);
        }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
movslq %esi, %rdx
leaq 0xab3a3(%rip), %rax     # 0x1212e0
movzbl (%rdi), %ecx
cmpl $0x2d, %ecx
je 0x75f5d
movsd 0x5c0e3(%rip), %xmm0    # 0xd2030
movsd %xmm0, 0x50(%rsp)
cmpl $0x2b, %ecx
jne 0x75f6e
incq %rdi
jmp 0x75f6e
incq %rdi
movsd 0x5c0e8(%rip), %xmm0    # 0xd2050
movsd %xmm0, 0x50(%rsp)
movl %esi, 0xc(%rsp)
movq %rdx, 0x48(%rsp)
movl (%rax,%rdx,4), %esi
leaq 0x1(%rdi), %rdx
leaq -0x1(%rdi), %rcx
leaq -0x2(%rdi), %r8
movq %rdi, %rbp
movq %rdx, %r15
movq %rcx, %r14
movq %r8, %r12
incq %rdi
incq %rdx
incq %rcx
incq %r8
cmpb $0x30, (%rbp)
je 0x75f86
movq %rcx, 0x38(%rsp)
movl %esi, 0x20(%rsp)
negl %esi
xorl %r10d, %r10d
movl $0x7fffffff, %r13d      # imm = 0x7FFFFFFF
movq %rbp, 0x10(%rsp)
leaq 0xae69c(%rip), %rdi     # 0x124660
movl 0xc(%rsp), %edx
movq %rbp, %rcx
movl %r10d, %r9d
movl %esi, %ebx
movq %r15, %rax
movsbq (%rbp), %r11
incq %rbp
leal 0x1(%r9), %r10d
leal 0x1(%rbx), %esi
incq %r15
incq %r14
incq %r12
incl %r13d
cmpl %edx, (%rdi,%r11,4)
jl 0x75fc8
movq %rax, %rdx
movq %rbx, 0x60(%rsp)
movq %rcx, %rsi
subq 0x10(%rsp), %rsi
movq %rsi, 0x28(%rsp)
xorl %esi, %esi
cmpb $0x2e, %r11b
sete %sil
leaq (%rcx,%rsi), %r10
movq %rsi, 0x40(%rsp)
addq %rsi, %r15
xorl %ebp, %ebp
movl 0xc(%rsp), %edi
leaq 0xae634(%rip), %r11     # 0x124660
movq %rcx, 0x58(%rsp)
movsbq -0x2(%r15,%rbp), %rsi
incq %rbp
cmpl %edi, (%r11,%rsi,4)
jl 0x76031
movq %r10, 0x30(%rsp)
movzbl %sil, %esi
movq $0x0, 0x18(%rsp)
testq %rsi, %rsi
je 0x76091
leaq 0xaec02(%rip), %r10     # 0x124c60
cmpb $0x1, (%rsi,%r10)
movq 0x38(%rsp), %rcx
jne 0x760f5
leaq (%r15,%rbp), %rsi
addq $-0x2, %rsi
movzbl (%rsi), %r10d
cmpl $0x2b, %r10d
je 0x76098
cmpl $0x2d, %r10d
jne 0x7609f
leaq (%r15,%rbp), %rsi
decq %rsi
xorl %ebx, %ebx
jmp 0x760a1
movq 0x38(%rsp), %rcx
jmp 0x760f5
leaq (%r15,%rbp), %rsi
decq %rsi
movb $0x1, %bl
xorl %r10d, %r10d
leaq 0xae5b5(%rip), %rdi     # 0x124660
movl $0xf4240, %r11d         # imm = 0xF4240
movsbq (%rsi), %rax
movl (%rdi,%rax,4), %eax
cmpl $0x9, %eax
jg 0x760cd
imull $0xa, %r10d, %r10d
jo 0x760da
incq %rsi
addl %eax, %r10d
jno 0x760b1
jmp 0x760da
testl %r10d, %r10d
movl $0xf4240, %r11d         # imm = 0xF4240
cmovnsl %r10d, %r11d
movl %r11d, %eax
negl %eax
testb %bl, %bl
cmovnel %r11d, %eax
movq %rax, 0x18(%rsp)
movl 0xc(%rsp), %edi
leaq 0xae56b(%rip), %r11     # 0x124660
leaq -0x1(%rbp), %rax
movq %rax, 0x38(%rsp)
movq 0x18(%rsp), %rax
movq 0x28(%rsp), %rbx
addl %ebx, %eax
movl %eax, %esi
movl 0x20(%rsp), %r10d
subl %r10d, %esi
jle 0x7614f
xorl %eax, %eax
testl %r10d, %r10d
movl $0x0, %ecx
cmovgl %r10d, %ecx
movq 0x48(%rsp), %r12
movl %r10d, %r13d
movq 0x10(%rsp), %r9
subl $0x1, %ecx
jb 0x76187
movsbq (%r9), %r8
movslq (%r11,%r8,4), %r8
incq %r9
cmpl %edi, %r8d
jge 0x76187
imulq %r12, %rax
addq %r8, %rax
jmp 0x76131
cmpl %r10d, %ebx
jle 0x761cf
addl 0x18(%rsp), %r9d
xorl %edx, %edx
testl %r9d, %r9d
cmovlel %edx, %r9d
xorl %edi, %edi
movq 0x48(%rsp), %r13
cmpl %edx, %r9d
je 0x76236
movsbq (%rcx,%rdx), %rsi
movslq (%r11,%rsi,4), %rsi
imulq %r13, %rdi
addq %rsi, %rdi
incq %rdx
jmp 0x76169
xorl %ebx, %ebx
testq %rax, %rax
movq 0x40(%rsp), %r8
jne 0x762c2
cmpl %r13d, 0x18(%rsp)
jle 0x762c2
xorpd %xmm0, %xmm0
cmpl $0x1, %ebp
je 0x7665f
xorl %ebx, %ebx
movsbq -0x1(%rdx,%r8), %rcx
movslq (%r11,%rcx,4), %rcx
cmpl %edi, %ecx
jge 0x762b3
imulq %r12, %rbx
addq %rcx, %rbx
incq %rdx
jmp 0x761b1
testl %ebx, %ebx
jle 0x76411
andl $0x7fffffff, %r13d      # imm = 0x7FFFFFFF
addq %r13, %r8
pushq $0x1
popq %rdx
subq %r13, %rdx
xorl %esi, %esi
leaq -0x1(%rsi), %rax
cmpb $0x30, (%r8,%rsi)
jne 0x761fc
cmpq %rsi, %rdx
movq %rax, %rsi
jne 0x761e9
movq 0x18(%rsp), %rdx
leal -0x1(%rdx), %esi
subq %rax, %rsi
addq %r13, %rcx
addq %rax, %rcx
xorl %eax, %eax
movq 0x48(%rsp), %r13
movq 0x10(%rsp), %r8
cmpq %rcx, %r8
ja 0x762a9
movsbq (%r8), %rdx
incq %r8
movslq (%r11,%rdx,4), %rdx
imulq %r13, %rax
addq %rdx, %rax
jmp 0x76219
movq 0x18(%rsp), %rsi
negl %esi
movl 0x20(%rsp), %r8d
cmpl %esi, %r8d
cmovll %r8d, %esi
xorl %r8d, %r8d
testl %esi, %esi
movl $0x0, %r9d
cmovgl %esi, %r9d
xorl %r10d, %r10d
leaq 0xae3fe(%rip), %r15     # 0x124660
cmpl %r8d, %r9d
je 0x76280
leaq (%rcx,%r8), %r11
movsbq (%r11,%rdx), %r11
movslq (%r15,%r11,4), %r11
imulq %r13, %r10
addq %r11, %r10
incq %r8
jmp 0x76262
cvtsi2sd %rdi, %xmm0
movsd %xmm0, 0x28(%rsp)
cvtsi2sd %r10, %xmm0
movsd %xmm0, 0x10(%rsp)
testl %eax, %eax
jle 0x7643a
negl %esi
movl 0xc(%rsp), %edi
jmp 0x76442
cvtsi2sd %rax, %xmm1
jmp 0x7641f
testq %rbx, %rbx
je 0x7665f
addq %r8, %rdx
movq %rdx, %r9
movq %r9, %r15
testq %rax, %rax
je 0x76307
movq 0x28(%rsp), %r14
cmpl %r13d, %r14d
cvtsi2sd %rax, %xmm0
movsd %xmm0, 0x10(%rsp)
movq 0x18(%rsp), %rbp
cmovlel %ebp, %esi
callq 0x73b57
leaq 0xae36f(%rip), %r11     # 0x124660
movapd %xmm0, %xmm1
mulsd 0x10(%rsp), %xmm1
movq 0x30(%rsp), %r8
movq 0x38(%rsp), %r9
jmp 0x7631f
xorpd %xmm1, %xmm1
movq 0x18(%rsp), %rbp
movq 0x30(%rsp), %r8
movq 0x38(%rsp), %r9
movq 0x28(%rsp), %r14
subl %r13d, %r14d
jge 0x763d4
xorl %ebx, %ebx
movl 0xc(%rsp), %edi
cmpl %r9d, %r13d
movl %r9d, %eax
cmovll %r13d, %eax
testl %eax, %eax
movl $0x0, %r14d
cmovgl %eax, %r14d
testl %r9d, %r9d
jle 0x76655
cmpl %ebp, %ebx
jge 0x76655
subl %r13d, %r9d
xorl %edx, %edx
xorl %ecx, %ecx
cmpl %edx, %r14d
je 0x76376
movsbq (%r8,%rdx), %rsi
movslq (%r11,%rsi,4), %rsi
imulq %r12, %rcx
addq %rsi, %rcx
incq %rdx
jmp 0x7635c
testq %rcx, %rcx
je 0x763c9
cvtsi2sd %rcx, %xmm0
movsd %xmm0, 0x10(%rsp)
addl %ebx, %eax
movl %ebp, %esi
subl %eax, %esi
movq %r8, %r15
movq %rbp, %r13
movq %r9, %rbp
movsd %xmm1, 0x18(%rsp)
callq 0x73b57
movsd 0x18(%rsp), %xmm1
movq %rbp, %r9
movq %r13, %rbp
movl 0x20(%rsp), %r13d
movq %r15, %r8
leaq 0xae2a5(%rip), %r11     # 0x124660
movl 0xc(%rsp), %edi
mulsd 0x10(%rsp), %xmm0
addsd %xmm0, %xmm1
addq %r14, %r8
addl %r13d, %ebx
jmp 0x7632e
movl 0xc(%rsp), %edi
jle 0x76655
movq %r14, %rsi
movq 0x60(%rsp), %rdx
cmpl %edx, %r13d
cmovll %r13d, %edx
xorl %eax, %eax
testl %edx, %edx
cmovlel %eax, %edx
cmpl %eax, %edx
je 0x765d3
movsbq (%r15,%rax), %rcx
movslq (%r11,%rcx,4), %rcx
imulq %r12, %rbx
addq %rcx, %rbx
incq %rax
jmp 0x763f4
xorpd %xmm1, %xmm1
movq 0x18(%rsp), %rsi
movq 0x48(%rsp), %r13
testl %esi, %esi
je 0x76457
movsd %xmm1, 0x10(%rsp)
callq 0x73b57
movsd 0x10(%rsp), %xmm1
mulsd %xmm0, %xmm1
jmp 0x76457
subl %esi, %eax
movl 0xc(%rsp), %edi
movl %eax, %esi
callq 0x73b57
movsd 0x10(%rsp), %xmm1
mulsd %xmm0, %xmm1
addsd 0x28(%rsp), %xmm1
movq 0x30(%rsp), %r10
movq 0x40(%rsp), %r8
movq 0x38(%rsp), %rcx
testl %ecx, %ecx
jle 0x76655
cmpl %ecx, 0x20(%rsp)
movsd %xmm1, 0x10(%rsp)
jge 0x764b3
movq 0x18(%rsp), %rsi
testl %esi, %esi
movl 0xc(%rsp), %edi
leaq 0xae1d4(%rip), %r9      # 0x124660
jle 0x76603
xorl %eax, %eax
movl %esi, %ecx
subl $0x1, %ecx
jb 0x76561
movsbq (%r10), %rdx
incq %r10
movslq (%r9,%rdx,4), %rdx
imulq %r13, %rax
addq %rdx, %rax
jmp 0x76496
andl $0x7fffffff, %ecx       # imm = 0x7FFFFFFF
addq %r8, %r12
movl 0xc(%rsp), %edi
leaq 0xae199(%rip), %rdx     # 0x124660
decl %ebp
leaq -0x1(%rcx), %rax
cmpb $0x30, (%r12,%rcx)
jne 0x764dd
cmpq $0x1, %rcx
movq %rax, %rcx
jne 0x764c7
addq %r8, %r14
addq %rax, %r14
xorl %eax, %eax
testb $0x1, %bpl
jne 0x76520
movq 0x58(%rsp), %rsi
leaq (%rsi,%r8), %rcx
cmpq %r14, %rcx
ja 0x76539
movsbq (%rsi,%r8), %rcx
movslq (%rdx,%rcx,4), %rcx
imulq %r13, %rax
addq %rcx, %rax
movsbq 0x1(%rsi,%r8), %rcx
movslq (%rdx,%rcx,4), %rcx
imulq %r13, %rax
addq %rcx, %rax
addq $0x2, %rsi
jmp 0x764f0
cmpq %r14, %r10
ja 0x76539
movsbq (%r10), %rcx
incq %r10
movslq (%rdx,%rcx,4), %rcx
imulq %r13, %rax
addq %rcx, %rax
jmp 0x76520
cvtsi2sd %rax, %xmm0
movsd %xmm0, 0x20(%rsp)
movq 0x18(%rsp), %rsi
subl %ebp, %esi
callq 0x73b57
mulsd 0x20(%rsp), %xmm0
movsd 0x10(%rsp), %xmm1
jmp 0x76651
movq 0x18(%rsp), %rcx
negl %ecx
addq %rbp, %rcx
decq %rcx
movl 0x20(%rsp), %edx
cmpl %ecx, %edx
movl %ecx, %esi
cmovll %edx, %esi
xorl %edx, %edx
testl %esi, %esi
cmovlel %edx, %esi
subl $0x1, %esi
jb 0x76599
movsbq (%r10), %r8
incq %r10
movslq (%r9,%r8,4), %r8
imulq %r13, %rdx
addq %r8, %rdx
jmp 0x76580
movl 0x20(%rsp), %esi
cmpl %esi, %ecx
cmovll %ecx, %esi
cvtsi2sd %rax, %xmm0
movsd %xmm0, 0x18(%rsp)
cvtsi2sd %rdx, %xmm0
movsd %xmm0, 0x20(%rsp)
negl %esi
callq 0x73b57
movsd 0x10(%rsp), %xmm1
mulsd 0x20(%rsp), %xmm0
addsd 0x18(%rsp), %xmm0
jmp 0x76651
cmpl %r13d, %esi
cmovll %esi, %r13d
cvtsi2sd %rbx, %xmm0
movsd %xmm0, 0x10(%rsp)
subl %r13d, %ebp
movl %ebp, %esi
movsd %xmm1, 0x18(%rsp)
callq 0x73b57
movsd 0x18(%rsp), %xmm1
mulsd 0x10(%rsp), %xmm0
jmp 0x76651
xorl %eax, %eax
movl 0x20(%rsp), %edx
testl %edx, %edx
movl $0x0, %ecx
cmovgl %edx, %ecx
addq %r8, %r14
xorl %edx, %edx
cmpl %eax, %ecx
je 0x76631
movsbq (%r14,%rax), %r8
movslq (%r9,%r8,4), %r8
imulq %r13, %rdx
addq %r8, %rdx
incq %rax
jmp 0x76618
cvtsi2sd %rdx, %xmm0
movsd %xmm0, 0x28(%rsp)
subl 0x20(%rsp), %esi
callq 0x73b57
movsd 0x10(%rsp), %xmm1
mulsd 0x28(%rsp), %xmm0
addsd %xmm0, %xmm1
movsd 0x50(%rsp), %xmm0
mulsd %xmm1, %xmm0
addq $0x68, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq