#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*/ fputs(char *, int /*<<< orphan*/);
int /*<<< orphan*/ stdout;
int /*<<< orphan*/ usage(int /*<<< orphan*/);
void help() {
  fputs("prime"
        " - Prime checker and finder\n\n",
        stdout);
  usage(stdout);
  fputs("\n"
        "prime"
        " [-h|--help]\n\n    Show this help message and exit.\n\n"
        "prime"
        " [-s|--short] [--] <num>...\n\n    Print each prime number of the "
        "given <num>s. If --short is specified,\n    instead of printing each "
        "prime number, output a summary in the following\n    format, where P "
        "is the number of primes and T is the number of <num>s:\n\n        P "
        "of T (P/T%%)\n\n"
        "prime"
        " [-s|--short] -r|--range [<start>] <stop>\n\n    Print all primes "
        "between <start> (inclusive) and <stop> (exclusive). If not\n    "
        "specified, <start> defaults to 0. If --short is specified, instead "
        "of\n    printing each prime number, output a summary in the following "
        "format, where\n    P is the number of primes and T is the number of "
        "numbers (<stop> - <start>):\n\n        P of T (P/T%%) in [<start>, "
        "<stop>)\n",
        stdout);
}


x86 assembly (clang, -O0):
<help>:
push   %rbp
mov    %rsp,%rbp
mov    0x2eb5(%rip),%rax
mov    (%rax),%esi
lea    0xecc(%rip),%rdi
call   1030 <fputs@plt>
mov    0x2ea0(%rip),%rax
mov    (%rax),%edi
call   1040 <usage@plt>
mov    0x2e92(%rip),%rax
mov    (%rax),%esi
lea    0xecc(%rip),%rdi
call   1030 <fputs@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<help>:
push   %rbx
mov    0x2eb8(%rip),%rbx
mov    (%rbx),%esi
lea    0xecf(%rip),%rdi
call   1030 <fputs@plt>
mov    (%rbx),%edi
call   1040 <usage@plt>
mov    (%rbx),%esi
lea    0xedd(%rip),%rdi
pop    %rbx
jmp    1030 <fputs@plt>

LLVM IR (-O0):
@.str = [35 x i8] c"prime - Prime checker and finder\0A\0A\00"
@stdout = global i32 0
@.str.1 = [752 x i8] c"\0Aprime [-h|--help]\0A\0A Show this help message and exit.\0A\0Aprime [-s|--short] [--] <num>...\0A\0A Print each prime number of the given <num>s. If --short is specified,\0A instead of printing each prime number, output a summary in the following\0A format, where P is the number of primes and T is the number of <num>s:\0A\0A P of T (P/T%%)\0A\0Aprime [-s|--short] -r|--range [<start>] <stop>\0A\0A Print all primes between <start> (inclusive) and <stop> (exclusive). If not\0A specified, <start> defaults to 0. If --short is specified, instead of\0A printing each prime number, output a summary in the following format, where\0A P is the number of primes and T is the number of numbers (<stop> - <start>):\0A\0A P of T (P/T%%) in [<start>, <stop>)\0A\00"
define void @help() {
%1 = load i32, i32* @stdout
%2 = call i32 @fputs(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str, i64 0, i64 0), i32 %1)
%3 = load i32, i32* @stdout
%4 = call i32 @usage(i32 %3)
%5 = load i32, i32* @stdout
%6 = call i32 @fputs(i8* getelementptr inbounds ([752 x i8], [752 x i8]* @.str.1, i64 0, i64 0), i32 %5)
ret void
}

LLVM IR (-O2):
@.str = [35 x i8] c"prime - Prime checker and finder\0A\0A\00"
@stdout = global i32 0
@.str.1 = [752 x i8] c"\0Aprime [-h|--help]\0A\0A Show this help message and exit.\0A\0Aprime [-s|--short] [--] <num>...\0A\0A Print each prime number of the given <num>s. If --short is specified,\0A instead of printing each prime number, output a summary in the following\0A format, where P is the number of primes and T is the number of <num>s:\0A\0A P of T (P/T%%)\0A\0Aprime [-s|--short] -r|--range [<start>] <stop>\0A\0A Print all primes between <start> (inclusive) and <stop> (exclusive). If not\0A specified, <start> defaults to 0. If --short is specified, instead of\0A printing each prime number, output a summary in the following format, where\0A P is the number of primes and T is the number of numbers (<stop> - <start>):\0A\0A P of T (P/T%%) in [<start>, <stop>)\0A\00"
define void @help() {
%1 = load i32, i32* @stdout
%2 = tail call i32 @fputs(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str, i64 0, i64 0), i32 %1)
%3 = load i32, i32* @stdout
%4 = tail call i32 @usage(i32 %3)
%5 = load i32, i32* @stdout
%6 = tail call i32 @fputs(i8* getelementptr inbounds ([752 x i8], [752 x i8]* @.str.1, i64 0, i64 0), i32 %5)
ret void
}