#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ sprintf(char *, char *, int, int);
int /*<<< orphan*/ strcat(char *, char *);
int /*<<< orphan*/ warning(char *);
void overspill_message(int overspill, int total_dists) {
  char err_mess[1024] = "";
  sprintf(err_mess, "%d of the distances out of a total of %d", (int)overspill,
          (int)total_dists);
  strcat(err_mess, "\n were out of range for the distance correction.");
  strcat(err_mess, "\n");
  strcat(err_mess, "\n SUGGESTIONS: 1) remove the most distant sequences");
  strcat(err_mess, "\n           or 2) use the PHYLIP package");
  strcat(err_mess, "\n           or 3) turn off the correction.");
  strcat(err_mess, "\n Note: Use option 3 with caution! With this degree");
  strcat(err_mess, "\n of divergence you will have great difficulty");
  strcat(err_mess, "\n getting robust and reliable trees.");
  strcat(err_mess, "\n\n");
  warning(err_mess);
}


x86 assembly (clang, -O0):
<overspill_message>:
push   %rbp
mov    %rsp,%rbp
sub    $0x410,%rsp
mov    %edi,-0x4(%rbp)
mov    %esi,-0x8(%rbp)
lea    -0x410(%rbp),%rdi
xor    %esi,%esi
mov    $0x400,%edx
call   1040 <memset@plt>
lea    -0x410(%rbp),%rdi
mov    -0x4(%rbp),%edx
mov    -0x8(%rbp),%ecx
lea    0xe88(%rip),%rsi
call   1060 <sprintf@plt>
lea    -0x410(%rbp),%rdi
lea    0xe9e(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
lea    0xfcd(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
lea    0xea9(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
lea    0xeca(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
lea    0xee0(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
lea    0xef8(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
lea    0xf19(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
lea    0xf35(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
lea    0xf47(%rip),%rsi
call   1050 <strcat@plt>
lea    -0x410(%rbp),%rdi
call   1030 <warning@plt>
add    $0x410,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<overspill_message>:
push   %rbp
push   %r14
push   %rbx
sub    $0x400,%rsp
mov    %esi,%r14d
mov    %edi,%ebp
mov    %rsp,%rbx
mov    $0x400,%edx
mov    %rbx,%rdi
xor    %esi,%esi
call   1040 <memset@plt>
lea    0xe97(%rip),%rsi
mov    %rbx,%rdi
mov    %ebp,%edx
mov    %r14d,%ecx
call   1060 <sprintf@plt>
lea    0xeac(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
lea    0xfdf(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
lea    0xebf(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
lea    0xee4(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
lea    0xefe(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
lea    0xf1a(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
lea    0xf3f(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
lea    0xf5f(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
lea    0xf75(%rip),%rsi
mov    %rbx,%rdi
call   1050 <strcat@plt>
mov    %rbx,%rdi
call   1030 <warning@plt>
add    $0x400,%rsp
pop    %rbx
pop    %r14
pop    %rbp
ret

LLVM IR (-O0):
@.str = [41 x i8] c"%d of the distances out of a total of %d\00"
@.str.1 = [49 x i8] c"\0A were out of range for the distance correction.\00"
@.str.2 = [2 x i8] c"\0A\00"
@.str.3 = [52 x i8] c"\0A SUGGESTIONS: 1) remove the most distant sequences\00"
@.str.4 = [41 x i8] c"\0A or 2) use the PHYLIP package\00"
@.str.5 = [43 x i8] c"\0A or 3) turn off the correction.\00"
@.str.6 = [52 x i8] c"\0A Note: Use option 3 with caution! With this degree\00"
@.str.7 = [47 x i8] c"\0A of divergence you will have great difficulty\00"
@.str.8 = [37 x i8] c"\0A getting robust and reliable trees.\00"
@.str.9 = [3 x i8] c"\0A\0A\00"
define void @overspill_message(i32 %0, i32 %1) {
%3 = alloca i32
%4 = alloca i32
%5 = alloca [1024 x i8]
store i32 %0, i32* %3
store i32 %1, i32* %4
%6 = bitcast [1024 x i8]* %5 to i8*
%7 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%8 = load i32, i32* %3
%9 = load i32, i32* %4
%10 = call i32 @sprintf(i8* %7, i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str, i64 0, i64 0), i32 %8, i32 %9)
%11 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%12 = call i32 @strcat(i8* %11, i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.1, i64 0, i64 0))
%13 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%14 = call i32 @strcat(i8* %13, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%15 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%16 = call i32 @strcat(i8* %15, i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.3, i64 0, i64 0))
%17 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%18 = call i32 @strcat(i8* %17, i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.4, i64 0, i64 0))
%19 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%20 = call i32 @strcat(i8* %19, i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.5, i64 0, i64 0))
%21 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%22 = call i32 @strcat(i8* %21, i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.6, i64 0, i64 0))
%23 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%24 = call i32 @strcat(i8* %23, i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.7, i64 0, i64 0))
%25 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%26 = call i32 @strcat(i8* %25, i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.8, i64 0, i64 0))
%27 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%28 = call i32 @strcat(i8* %27, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.9, i64 0, i64 0))
%29 = getelementptr inbounds [1024 x i8], [1024 x i8]* %5, i64 0, i64 0
%30 = call i32 @warning(i8* %29)
ret void
}

LLVM IR (-O2):
@.str = [41 x i8] c"%d of the distances out of a total of %d\00"
@.str.1 = [49 x i8] c"\0A were out of range for the distance correction.\00"
@.str.2 = [2 x i8] c"\0A\00"
@.str.3 = [52 x i8] c"\0A SUGGESTIONS: 1) remove the most distant sequences\00"
@.str.4 = [41 x i8] c"\0A or 2) use the PHYLIP package\00"
@.str.5 = [43 x i8] c"\0A or 3) turn off the correction.\00"
@.str.6 = [52 x i8] c"\0A Note: Use option 3 with caution! With this degree\00"
@.str.7 = [47 x i8] c"\0A of divergence you will have great difficulty\00"
@.str.8 = [37 x i8] c"\0A getting robust and reliable trees.\00"
@.str.9 = [3 x i8] c"\0A\0A\00"
define void @overspill_message(i32 %0, i32 %1) {
%3 = alloca [1024 x i8]
%4 = getelementptr inbounds [1024 x i8], [1024 x i8]* %3, i64 0, i64 0
%5 = call i32 @sprintf(i8* %4, i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @.str, i64 0, i64 0), i32 %0, i32 %1)
%6 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.1, i64 0, i64 0))
%7 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%8 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.3, i64 0, i64 0))
%9 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.4, i64 0, i64 0))
%10 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.5, i64 0, i64 0))
%11 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.6, i64 0, i64 0))
%12 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.7, i64 0, i64 0))
%13 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.8, i64 0, i64 0))
%14 = call i32 @strcat(i8* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.9, i64 0, i64 0))
%15 = call i32 @warning(i8* %4)
ret void
}