#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*/ msglist(char **);
History() {
  static char *hist[] = {
      "The program attempts to discriminate among",
      "   FLAWs, like lack of a sticky bit,",
      "   Serious DEFECTs, like lack of a guard digit, and",
      "   FAILUREs, like 2+2 == 5 .",
      "Failures may confound subsequent diagnoses.\n",
      "The diagnostic capabilities of this program go beyond an earlier",
      "program called `MACHAR', which can be found at the end of the",
      "book  `Software Manual for the Elementary Functions' (1980) by",
      "W. J. Cody and W. Waite. Although both programs try to discover",
      "the Radix, Precision and range (over/underflow thresholds)",
      "of the arithmetic, this program tries to cope with a wider variety",
      "of pathologies, and to say how well the arithmetic is implemented.",
      "\nThe program is based upon a conventional radix representation for",
      "floating-point numbers, but also allows logarithmic encoding",
      "as used by certain early WANG machines.\n",
      "BASIC version of this program (C) 1983 by Prof. W. M. Kahan;",
      "see source comments for more history.",
      0};
  msglist(hist);
}


x86 assembly (clang, -O0):
<History>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
lea    0x2f11(%rip),%rdi
call   1030 <msglist@plt>
mov    -0x4(%rbp),%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<History>:
lea    0x2f19(%rip),%rdi
jmp    1030 <msglist@plt>

LLVM IR (-O0):
@History.hist = internal global [18 x i8*] [i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str, i32 0, i32 0), i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.1, i32 0, i32 0), i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.2, i32 0, i32 0), i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.3, i32 0, i32 0), i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.4, i32 0, i32 0), i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.5, i32 0, i32 0), i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.6, i32 0, i32 0), i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.7, i32 0, i32 0), i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.8, i32 0, i32 0), i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.9, i32 0, i32 0), i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.10, i32 0, i32 0), i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.11, i32 0, i32 0), i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.12, i32 0, i32 0), i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.13, i32 0, i32 0), i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.14, i32 0, i32 0), i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.15, i32 0, i32 0), i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.16, i32 0, i32 0), i8* null]
@.str = [43 x i8] c"The program attempts to discriminate among\00"
@.str.1 = [37 x i8] c" FLAWs, like lack of a sticky bit,\00"
@.str.2 = [52 x i8] c" Serious DEFECTs, like lack of a guard digit, and\00"
@.str.3 = [29 x i8] c" FAILUREs, like 2+2 == 5 .\00"
@.str.4 = [45 x i8] c"Failures may confound subsequent diagnoses.\0A\00"
@.str.5 = [65 x i8] c"The diagnostic capabilities of this program go beyond an earlier\00"
@.str.6 = [62 x i8] c"program called `MACHAR', which can be found at the end of the\00"
@.str.7 = [63 x i8] c"book `Software Manual for the Elementary Functions' (1980) by\00"
@.str.8 = [64 x i8] c"W. J. Cody and W. Waite. Although both programs try to discover\00"
@.str.9 = [59 x i8] c"the Radix, Precision and range (over/underflow thresholds)\00"
@.str.10 = [67 x i8] c"of the arithmetic, this program tries to cope with a wider variety\00"
@.str.11 = [67 x i8] c"of pathologies, and to say how well the arithmetic is implemented.\00"
@.str.12 = [67 x i8] c"\0AThe program is based upon a conventional radix representation for\00"
@.str.13 = [61 x i8] c"floating-point numbers, but also allows logarithmic encoding\00"
@.str.14 = [41 x i8] c"as used by certain early WANG machines.\0A\00"
@.str.15 = [61 x i8] c"BASIC version of this program (C) 1983 by Prof. W. M. Kahan;\00"
@.str.16 = [38 x i8] c"see source comments for more history.\00"
define i32 @History() {
%1 = alloca i32
%2 = call i32 @msglist(i8** getelementptr inbounds ([18 x i8*], [18 x i8*]* @History.hist, i64 0, i64 0))
%3 = load i32, i32* %1
ret i32 %3
}

LLVM IR (-O2):
@History.hist = internal global [18 x i8*] [i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str, i32 0, i32 0), i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.1, i32 0, i32 0), i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.2, i32 0, i32 0), i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.3, i32 0, i32 0), i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.4, i32 0, i32 0), i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.5, i32 0, i32 0), i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.6, i32 0, i32 0), i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.7, i32 0, i32 0), i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.8, i32 0, i32 0), i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.9, i32 0, i32 0), i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.10, i32 0, i32 0), i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.11, i32 0, i32 0), i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.12, i32 0, i32 0), i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.13, i32 0, i32 0), i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.14, i32 0, i32 0), i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.15, i32 0, i32 0), i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.16, i32 0, i32 0), i8* null]
@.str = [43 x i8] c"The program attempts to discriminate among\00"
@.str.1 = [37 x i8] c" FLAWs, like lack of a sticky bit,\00"
@.str.2 = [52 x i8] c" Serious DEFECTs, like lack of a guard digit, and\00"
@.str.3 = [29 x i8] c" FAILUREs, like 2+2 == 5 .\00"
@.str.4 = [45 x i8] c"Failures may confound subsequent diagnoses.\0A\00"
@.str.5 = [65 x i8] c"The diagnostic capabilities of this program go beyond an earlier\00"
@.str.6 = [62 x i8] c"program called `MACHAR', which can be found at the end of the\00"
@.str.7 = [63 x i8] c"book `Software Manual for the Elementary Functions' (1980) by\00"
@.str.8 = [64 x i8] c"W. J. Cody and W. Waite. Although both programs try to discover\00"
@.str.9 = [59 x i8] c"the Radix, Precision and range (over/underflow thresholds)\00"
@.str.10 = [67 x i8] c"of the arithmetic, this program tries to cope with a wider variety\00"
@.str.11 = [67 x i8] c"of pathologies, and to say how well the arithmetic is implemented.\00"
@.str.12 = [67 x i8] c"\0AThe program is based upon a conventional radix representation for\00"
@.str.13 = [61 x i8] c"floating-point numbers, but also allows logarithmic encoding\00"
@.str.14 = [41 x i8] c"as used by certain early WANG machines.\0A\00"
@.str.15 = [61 x i8] c"BASIC version of this program (C) 1983 by Prof. W. M. Kahan;\00"
@.str.16 = [38 x i8] c"see source comments for more history.\00"
define i32 @History() {
%1 = tail call i32 @msglist(i8** getelementptr inbounds ([18 x i8*], [18 x i8*]* @History.hist, i64 0, i64 0))
ret i32 undef
}