#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 */
typedef int /*<<< orphan*/ FILE;

/* Variables and functions */
int /*<<< orphan*/ fprintf(int /*<<< orphan*/ *, char *, char *, ...);
void op_min_in_interval_usage(char *name, FILE *f, char *indent) {
  if (indent == NULL)
    indent = "";
  fprintf(f,
          "%sFind the minimum value in each of a set of intervals. The "
          "intervals are\n",
          indent);
  fprintf(f,
          "%sreplaced by infinity everywhere except at their single trough "
          "position. Ties\n",
          indent);
  fprintf(f,
          "%sare broken by the position nearest the center of the interval. "
          "Any bases\n",
          indent);
  fprintf(f, "%soutside the intervals are also replaced by infinity.\n",
          indent);
  fprintf(f, "%s\n", indent);
  fprintf(f, "%susage: %s <filename> [options]\n", indent, name);
  fprintf(
      f,
      "%s  --origin=one             input intervals are origin-one, closed\n",
      indent);
  fprintf(f,
          "%s  --origin=zero            input intervals are origin-zero, "
          "half-open\n",
          indent);
  fprintf(f, "%s  --infinity=<value>       value to fill non-minima\n", indent);
  fprintf(f, "%s                           (default is +inf)\n", indent);
  fprintf(f, "%s\n", indent);
  fprintf(f,
          "%sThe input intervals are required to be sorted along each "
          "chromosome, and\n",
          indent);
  fprintf(f, "%snon-overlapping)\n", indent);
}


x86 assembly (clang, -O0):
<op_min_in_interval_usage>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    %rdi,-0x8(%rbp)
mov    %rsi,-0x10(%rbp)
mov    %rdx,-0x18(%rbp)
cmpq   $0x0,-0x18(%rbp)
jne    113a <op_min_in_interval_usage+0x2a>
lea    0x1103(%rip),%rax
mov    %rax,-0x18(%rbp)
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xeb7(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xeec(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xf26(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xf5c(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xf7e(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
mov    -0x8(%rbp),%rcx
lea    0xf68(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xf74(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xfa3(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xfd6(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xff7(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xef6(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0xffb(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rdx
lea    0x1031(%rip),%rsi
mov    $0x0,%al
call   1030 <fprintf@plt>
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<op_min_in_interval_usage>:
push   %r15
push   %r14
push   %r12
push   %rbx
push   %rax
mov    %rdx,%rbx
mov    %rsi,%r14
mov    %rdi,%r15
test   %rdx,%rdx
lea    0x110e(%rip),%rax
cmove  %rax,%rbx
lea    0xeca(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0xf01(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0xf3d(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0xf75(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0xf99(%rip),%r12
mov    %r14,%rdi
mov    %r12,%rsi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0xf86(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
mov    %r15,%rcx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0xf91(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0xfc2(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0xff7(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0x101a(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
mov    %r14,%rdi
mov    %r12,%rsi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0x1026(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
call   1030 <fprintf@plt>
lea    0x105e(%rip),%rsi
mov    %r14,%rdi
mov    %rbx,%rdx
xor    %eax,%eax
add    $0x8,%rsp
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
jmp    1030 <fprintf@plt>

LLVM IR (-O0):
@.str = [1 x i8] zeroinitializer
@.str.1 = [75 x i8] c"%sFind the minimum value in each of a set of intervals. The intervals are\0A\00"
@.str.2 = [80 x i8] c"%sreplaced by infinity everywhere except at their single trough position. Ties\0A\00"
@.str.3 = [76 x i8] c"%sare broken by the position nearest the center of the interval. Any bases\0A\00"
@.str.4 = [56 x i8] c"%soutside the intervals are also replaced by infinity.\0A\00"
@.str.5 = [4 x i8] c"%s\0A\00"
@.str.6 = [34 x i8] c"%susage: %s <filename> [options]\0A\00"
@.str.7 = [69 x i8] c"%s --origin=one input intervals are origin-one, closed\0A\00"
@.str.8 = [73 x i8] c"%s --origin=zero input intervals are origin-zero, half-open\0A\00"
@.str.9 = [55 x i8] c"%s --infinity=<value> value to fill non-minima\0A\00"
@.str.10 = [48 x i8] c"%s (default is +inf)\0A\00"
@.str.11 = [76 x i8] c"%sThe input intervals are required to be sorted along each chromosome, and\0A\00"
@.str.12 = [20 x i8] c"%snon-overlapping)\0A\00"
define void @op_min_in_interval_usage(i8* %0, i32* %1, i8* %2) {
%4 = alloca i8*
%5 = alloca i32*
%6 = alloca i8*
store i8* %0, i8** %4
store i32* %1, i32** %5
store i8* %2, i8** %6
%7 = load i8*, i8** %6
%8 = icmp eq i8* %7, null
br i1 %8, label %9, label %10
9: ; preds = %3
store i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str, i64 0, i64 0), i8** %6
br label %10
10: ; preds = %9, %3
%11 = load i32*, i32** %5
%12 = load i8*, i8** %6
%13 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %11, i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.1, i64 0, i64 0), i8* %12)
%14 = load i32*, i32** %5
%15 = load i8*, i8** %6
%16 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %14, i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.2, i64 0, i64 0), i8* %15)
%17 = load i32*, i32** %5
%18 = load i8*, i8** %6
%19 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %17, i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.3, i64 0, i64 0), i8* %18)
%20 = load i32*, i32** %5
%21 = load i8*, i8** %6
%22 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %20, i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.4, i64 0, i64 0), i8* %21)
%23 = load i32*, i32** %5
%24 = load i8*, i8** %6
%25 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %23, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.5, i64 0, i64 0), i8* %24)
%26 = load i32*, i32** %5
%27 = load i8*, i8** %6
%28 = load i8*, i8** %4
%29 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %26, i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.6, i64 0, i64 0), i8* %27, i8* %28)
%30 = load i32*, i32** %5
%31 = load i8*, i8** %6
%32 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %30, i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.7, i64 0, i64 0), i8* %31)
%33 = load i32*, i32** %5
%34 = load i8*, i8** %6
%35 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %33, i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.8, i64 0, i64 0), i8* %34)
%36 = load i32*, i32** %5
%37 = load i8*, i8** %6
%38 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %36, i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.9, i64 0, i64 0), i8* %37)
%39 = load i32*, i32** %5
%40 = load i8*, i8** %6
%41 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %39, i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.10, i64 0, i64 0), i8* %40)
%42 = load i32*, i32** %5
%43 = load i8*, i8** %6
%44 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %42, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.5, i64 0, i64 0), i8* %43)
%45 = load i32*, i32** %5
%46 = load i8*, i8** %6
%47 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %45, i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.11, i64 0, i64 0), i8* %46)
%48 = load i32*, i32** %5
%49 = load i8*, i8** %6
%50 = call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %48, i8* getelementptr inbounds ([20 x i8], [20 x i8]* @.str.12, i64 0, i64 0), i8* %49)
ret void
}

LLVM IR (-O2):
@.str = [1 x i8] zeroinitializer
@.str.1 = [75 x i8] c"%sFind the minimum value in each of a set of intervals. The intervals are\0A\00"
@.str.2 = [80 x i8] c"%sreplaced by infinity everywhere except at their single trough position. Ties\0A\00"
@.str.3 = [76 x i8] c"%sare broken by the position nearest the center of the interval. Any bases\0A\00"
@.str.4 = [56 x i8] c"%soutside the intervals are also replaced by infinity.\0A\00"
@.str.5 = [4 x i8] c"%s\0A\00"
@.str.6 = [34 x i8] c"%susage: %s <filename> [options]\0A\00"
@.str.7 = [69 x i8] c"%s --origin=one input intervals are origin-one, closed\0A\00"
@.str.8 = [73 x i8] c"%s --origin=zero input intervals are origin-zero, half-open\0A\00"
@.str.9 = [55 x i8] c"%s --infinity=<value> value to fill non-minima\0A\00"
@.str.10 = [48 x i8] c"%s (default is +inf)\0A\00"
@.str.11 = [76 x i8] c"%sThe input intervals are required to be sorted along each chromosome, and\0A\00"
@.str.12 = [20 x i8] c"%snon-overlapping)\0A\00"
define void @op_min_in_interval_usage(i8* %0, i32* nocapture %1, i8* %2) {
%4 = icmp eq i8* %2, null
%5 = select i1 %4, i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str, i64 0, i64 0), i8* %2
%6 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.1, i64 0, i64 0), i8* %5)
%7 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.2, i64 0, i64 0), i8* %5)
%8 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.3, i64 0, i64 0), i8* %5)
%9 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.4, i64 0, i64 0), i8* %5)
%10 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.5, i64 0, i64 0), i8* %5)
%11 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.6, i64 0, i64 0), i8* %5, i8* %0)
%12 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.7, i64 0, i64 0), i8* %5)
%13 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.8, i64 0, i64 0), i8* %5)
%14 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.9, i64 0, i64 0), i8* %5)
%15 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.10, i64 0, i64 0), i8* %5)
%16 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.5, i64 0, i64 0), i8* %5)
%17 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.11, i64 0, i64 0), i8* %5)
%18 = tail call i32 (i32*, i8*, i8*, ...) @fprintf(i32* %1, i8* getelementptr inbounds ([20 x i8], [20 x i8]* @.str.12, i64 0, i64 0), i8* %5)
ret void
}