#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*/ printf(char *);
void print_description(void) {
  printf("This program will repeatedly run the initialization, training\n");
  printf("and testing cycle for Self-Organizing Map algorithm.\n");
  printf("\n");
  printf("In the following the training file name, the test file name\n");
  printf("(that can be the same) and the map save file name are asked.\n");
  printf("After them the type of map topology is asked, as well as\n");
  printf("the type of neighborhood function. The x- and y-dimension\n");
  printf("of the map should be integers and prefereably x-dimension\n");
  printf("should be larger than y-dimension.\n");
  printf("\n");
  printf("The training is done in two parts. First an ordering phase\n");
  printf("that is usually shorter than the following converging phase.\n");
  printf("The number of training cycles, the training rates and\n");
  printf("the radius of the adaptation area are asked separately for\n");
  printf("both phases. The fixed point qualifiers and weighting qualifiers\n");
  printf("are used if the corresponding parameters were given.\n");
  printf("\n");
  printf("The quantization error is computed for each map and\n");
  printf("the best map (smallest quantization error) is saved to\n");
  printf("the given file. If the verbose parameter allows the quantization\n");
  printf("error is given for each separate trial.\n");
  printf("\n");
  printf("After the answers have been given the training begins\n");
  printf("and depending on the size of problem it may take a long time.\n");
  printf("\n");
}


x86 assembly (clang, -O0):
<print_description>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xf18(%rip),%rdi
call   1030 <printf@plt>
lea    0xfbb(%rip),%rdi
call   1030 <printf@plt>
lea    0xf36(%rip),%rdi
call   1030 <printf@plt>
lea    0xf67(%rip),%rdi
call   1030 <printf@plt>
lea    0xf99(%rip),%rdi
call   1030 <printf@plt>
lea    0xfc7(%rip),%rdi
call   1030 <printf@plt>
lea    0xff6(%rip),%rdi
call   1030 <printf@plt>
lea    0x1025(%rip),%rdi
call   1030 <printf@plt>
lea    0xf67(%rip),%rdi
call   1030 <printf@plt>
lea    0x1031(%rip),%rdi
call   1030 <printf@plt>
lea    0x1061(%rip),%rdi
call   1030 <printf@plt>
lea    0x1093(%rip),%rdi
call   1030 <printf@plt>
lea    0x10be(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ee(%rip),%rdi
call   1030 <printf@plt>
lea    0x1124(%rip),%rdi
call   1030 <printf@plt>
lea    0xf13(%rip),%rdi
call   1030 <printf@plt>
lea    0x1142(%rip),%rdi
call   1030 <printf@plt>
lea    0x116b(%rip),%rdi
call   1030 <printf@plt>
lea    0x1197(%rip),%rdi
call   1030 <printf@plt>
lea    0x11cd(%rip),%rdi
call   1030 <printf@plt>
lea    0xed7(%rip),%rdi
call   1030 <printf@plt>
lea    0x11de(%rip),%rdi
call   1030 <printf@plt>
lea    0x1209(%rip),%rdi
call   1030 <printf@plt>
lea    0xeb3(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_description>:
push   %rax
lea    0xed8(%rip),%rdi
call   1040 <puts@plt>
lea    0xf0a(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xf29(%rip),%rdi
call   1040 <puts@plt>
lea    0xf59(%rip),%rdi
call   1040 <puts@plt>
lea    0xf8a(%rip),%rdi
call   1040 <puts@plt>
lea    0xfb7(%rip),%rdi
call   1040 <puts@plt>
lea    0xfe5(%rip),%rdi
call   1040 <puts@plt>
lea    0x1013(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1020(%rip),%rdi
call   1040 <puts@plt>
lea    0x104f(%rip),%rdi
call   1040 <puts@plt>
lea    0x1080(%rip),%rdi
call   1040 <puts@plt>
lea    0x10aa(%rip),%rdi
call   1040 <puts@plt>
lea    0x10d9(%rip),%rdi
call   1040 <puts@plt>
lea    0x110e(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x112d(%rip),%rdi
call   1040 <puts@plt>
lea    0x1155(%rip),%rdi
call   1040 <puts@plt>
lea    0x1180(%rip),%rdi
call   1040 <puts@plt>
lea    0x11b5(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x11c7(%rip),%rdi
call   1040 <puts@plt>
lea    0x11f1(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
pop    %rax
jmp    1030 <putchar@plt>

LLVM IR (-O0):
@.str = [63 x i8] c"This program will repeatedly run the initialization, training\0A\00"
@.str.1 = [54 x i8] c"and testing cycle for Self-Organizing Map algorithm.\0A\00"
@.str.2 = [2 x i8] c"\0A\00"
@.str.3 = [61 x i8] c"In the following the training file name, the test file name\0A\00"
@.str.4 = [62 x i8] c"(that can be the same) and the map save file name are asked.\0A\00"
@.str.5 = [58 x i8] c"After them the type of map topology is asked, as well as\0A\00"
@.str.6 = [59 x i8] c"the type of neighborhood function. The x- and y-dimension\0A\00"
@.str.7 = [59 x i8] c"of the map should be integers and prefereably x-dimension\0A\00"
@.str.8 = [36 x i8] c"should be larger than y-dimension.\0A\00"
@.str.9 = [60 x i8] c"The training is done in two parts. First an ordering phase\0A\00"
@.str.10 = [62 x i8] c"that is usually shorter than the following converging phase.\0A\00"
@.str.11 = [55 x i8] c"The number of training cycles, the training rates and\0A\00"
@.str.12 = [60 x i8] c"the radius of the adaptation area are asked separately for\0A\00"
@.str.13 = [66 x i8] c"both phases. The fixed point qualifiers and weighting qualifiers\0A\00"
@.str.14 = [54 x i8] c"are used if the corresponding parameters were given.\0A\00"
@.str.15 = [53 x i8] c"The quantization error is computed for each map and\0A\00"
@.str.16 = [56 x i8] c"the best map (smallest quantization error) is saved to\0A\00"
@.str.17 = [66 x i8] c"the given file. If the verbose parameter allows the quantization\0A\00"
@.str.18 = [41 x i8] c"error is given for each separate trial.\0A\00"
@.str.19 = [55 x i8] c"After the answers have been given the training begins\0A\00"
@.str.20 = [63 x i8] c"and depending on the size of problem it may take a long time.\0A\00"
define void @print_description() {
%1 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.9, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.10, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.11, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.12, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.13, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.14, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.15, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.16, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.17, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.18, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.19, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.20, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [62 x i8] c"This program will repeatedly run the initialization, training\00"
@str.21 = [53 x i8] c"and testing cycle for Self-Organizing Map algorithm.\00"
@str.22 = [60 x i8] c"In the following the training file name, the test file name\00"
@str.23 = [61 x i8] c"(that can be the same) and the map save file name are asked.\00"
@str.24 = [57 x i8] c"After them the type of map topology is asked, as well as\00"
@str.25 = [58 x i8] c"the type of neighborhood function. The x- and y-dimension\00"
@str.26 = [58 x i8] c"of the map should be integers and prefereably x-dimension\00"
@str.27 = [35 x i8] c"should be larger than y-dimension.\00"
@str.28 = [59 x i8] c"The training is done in two parts. First an ordering phase\00"
@str.29 = [61 x i8] c"that is usually shorter than the following converging phase.\00"
@str.30 = [54 x i8] c"The number of training cycles, the training rates and\00"
@str.31 = [59 x i8] c"the radius of the adaptation area are asked separately for\00"
@str.32 = [65 x i8] c"both phases. The fixed point qualifiers and weighting qualifiers\00"
@str.33 = [53 x i8] c"are used if the corresponding parameters were given.\00"
@str.34 = [52 x i8] c"The quantization error is computed for each map and\00"
@str.35 = [55 x i8] c"the best map (smallest quantization error) is saved to\00"
@str.36 = [65 x i8] c"the given file. If the verbose parameter allows the quantization\00"
@str.37 = [40 x i8] c"error is given for each separate trial.\00"
@str.38 = [54 x i8] c"After the answers have been given the training begins\00"
@str.39 = [62 x i8] c"and depending on the size of problem it may take a long time.\00"
define void @print_description() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @str.21, i64 0, i64 0))
%3 = tail call i32 @putchar(i32 10)
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.22, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.23, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.24, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.25, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.26, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.27, i64 0, i64 0))
%10 = tail call i32 @putchar(i32 10)
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.28, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.29, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.30, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.31, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.32, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @str.33, i64 0, i64 0))
%17 = tail call i32 @putchar(i32 10)
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.34, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.35, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.36, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.37, i64 0, i64 0))
%22 = tail call i32 @putchar(i32 10)
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.38, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.39, i64 0, i64 0))
%25 = tail call i32 @putchar(i32 10)
ret void
}