#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*/ fprintf(int /*<<< orphan*/, char *);
int /*<<< orphan*/ stdout;
void show_help(void) {
  fprintf(stdout,
          "perform a merge sort over a multi-GB gz compressed file\n\n"
          "use: gz-sort [-u] [-S n] [-P n] source.gz dest.gz\n\n"
          "options:\n"
          "   -h: help\n"
          "   -u: unique\n"
          "   -S n: size of presort, supports k/M/G suffix\n"
          "         a traditional in-memory sort (default n=1M)\n"
          "   -P n: use multiple threads (experimental, default disabled)\n"
          "   -T: pass through (debugging/benchmarks)\n\n"
          "estimating run time, crudely:\n"
          "    time gzip -dc data.gz | gzip > /dev/null\n"
          "    unthreaded: seconds * entropy * (log2(uncompressed_size/S)+2)\n"
          "    (where 'entropy' is a fudge-factor between 1.5 for an \n"
          "    already sorted file and 3 for a shuffled file)\n"
          "    S and P are the corresponding settings\n"
          "    multithreaded: maybe unthreaded/sqrt(P) ?\n\n"
          "estimated disk use:\n"
          "    2x source.gz\n"
          "\n");
}


x86 assembly (clang, -O0):
<show_help>:
push   %rbp
mov    %rsp,%rbp
mov    0x2ec5(%rip),%rax
mov    (%rax),%edi
lea    0xedc(%rip),%rsi
call   1030 <fprintf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<show_help>:
mov    0x2ec9(%rip),%rax
mov    (%rax),%edi
lea    0xee0(%rip),%rsi
jmp    1030 <fprintf@plt>

LLVM IR (-O0):
@stdout = global i32 0
@.str = [731 x i8] c"perform a merge sort over a multi-GB gz compressed file\0A\0Ause: gz-sort [-u] [-S n] [-P n] source.gz dest.gz\0A\0Aoptions:\0A -h: help\0A -u: unique\0A -S n: size of presort, supports k/M/G suffix\0A a traditional in-memory sort (default n=1M)\0A -P n: use multiple threads (experimental, default disabled)\0A -T: pass through (debugging/benchmarks)\0A\0Aestimating run time, crudely:\0A time gzip -dc data.gz | gzip > /dev/null\0A unthreaded: seconds * entropy * (log2(uncompressed_size/S)+2)\0A (where 'entropy' is a fudge-factor between 1.5 for an \0A already sorted file and 3 for a shuffled file)\0A S and P are the corresponding settings\0A multithreaded: maybe unthreaded/sqrt(P) ?\0A\0Aestimated disk use:\0A 2x source.gz\0A\0A\00"
define void @show_help() {
%1 = load i32, i32* @stdout
%2 = call i32 @fprintf(i32 %1, i8* getelementptr inbounds ([731 x i8], [731 x i8]* @.str, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@stdout = global i32 0
@.str = [731 x i8] c"perform a merge sort over a multi-GB gz compressed file\0A\0Ause: gz-sort [-u] [-S n] [-P n] source.gz dest.gz\0A\0Aoptions:\0A -h: help\0A -u: unique\0A -S n: size of presort, supports k/M/G suffix\0A a traditional in-memory sort (default n=1M)\0A -P n: use multiple threads (experimental, default disabled)\0A -T: pass through (debugging/benchmarks)\0A\0Aestimating run time, crudely:\0A time gzip -dc data.gz | gzip > /dev/null\0A unthreaded: seconds * entropy * (log2(uncompressed_size/S)+2)\0A (where 'entropy' is a fudge-factor between 1.5 for an \0A already sorted file and 3 for a shuffled file)\0A S and P are the corresponding settings\0A multithreaded: maybe unthreaded/sqrt(P) ?\0A\0Aestimated disk use:\0A 2x source.gz\0A\0A\00"
define void @show_help() {
%1 = load i32, i32* @stdout
%2 = tail call i32 @fprintf(i32 %1, i8* getelementptr inbounds ([731 x i8], [731 x i8]* @.str, i64 0, i64 0))
ret void
}