#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*/ adjust_max_heap(int *, int, int);
int /*<<< orphan*/ build_max_heap(int *, int);
void heap_sort(int *datas, int length) {
  int i, temp;
  build_max_heap(datas, length);
  i = length;
  while (i > 1) {
    temp = datas[i];
    datas[i] = datas[1];
    datas[1] = temp;
    i--;
    adjust_max_heap(datas, i, 1);
  }
}


x86 assembly (clang, -O0):
<heap_sort>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    %rdi,-0x8(%rbp)
mov    %esi,-0xc(%rbp)
mov    -0x8(%rbp),%rdi
mov    -0xc(%rbp),%esi
call   1040 <build_max_heap@plt>
mov    -0xc(%rbp),%eax
mov    %eax,-0x10(%rbp)
cmpl   $0x1,-0x10(%rbp)
jle    1194 <heap_sort+0x74>
mov    -0x8(%rbp),%rax
movslq -0x10(%rbp),%rcx
mov    (%rax,%rcx,4),%eax
mov    %eax,-0x14(%rbp)
mov    -0x8(%rbp),%rax
mov    0x4(%rax),%edx
mov    -0x8(%rbp),%rax
movslq -0x10(%rbp),%rcx
mov    %edx,(%rax,%rcx,4)
mov    -0x14(%rbp),%ecx
mov    -0x8(%rbp),%rax
mov    %ecx,0x4(%rax)
mov    -0x10(%rbp),%eax
add    $0xffffffff,%eax
mov    %eax,-0x10(%rbp)
mov    -0x8(%rbp),%rdi
mov    -0x10(%rbp),%esi
mov    $0x1,%edx
call   1030 <adjust_max_heap@plt>
jmp    1141 <heap_sort+0x21>
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<heap_sort>:
push   %rbp
push   %r14
push   %rbx
mov    %esi,%ebp
mov    %rdi,%rbx
call   1040 <build_max_heap@plt>
cmp    $0x2,%ebp
jl     1169 <heap_sort+0x49>
mov    %ebp,%ebp
cs nopw 0x0(%rax,%rax,1)
nop
mov    (%rbx,%rbp,4),%eax
mov    0x4(%rbx),%ecx
mov    %ecx,(%rbx,%rbp,4)
mov    %eax,0x4(%rbx)
lea    -0x1(%rbp),%r14
mov    %rbx,%rdi
mov    %r14d,%esi
mov    $0x1,%edx
call   1030 <adjust_max_heap@plt>
cmp    $0x2,%rbp
mov    %r14,%rbp
ja     1140 <heap_sort+0x20>
pop    %rbx
pop    %r14
pop    %rbp
ret

LLVM IR (-O0):
define void @heap_sort(i32* %0, i32 %1) {
%3 = alloca i32*
%4 = alloca i32
%5 = alloca i32
%6 = alloca i32
store i32* %0, i32** %3
store i32 %1, i32* %4
%7 = load i32*, i32** %3
%8 = load i32, i32* %4
%9 = call i32 @build_max_heap(i32* %7, i32 %8)
%10 = load i32, i32* %4
store i32 %10, i32* %5
br label %11
11: ; preds = %14, %2
%12 = load i32, i32* %5
%13 = icmp sgt i32 %12, 1
br i1 %13, label %14, label %35
14: ; preds = %11
%15 = load i32*, i32** %3
%16 = load i32, i32* %5
%17 = sext i32 %16 to i64
%18 = getelementptr inbounds i32, i32* %15, i64 %17
%19 = load i32, i32* %18
store i32 %19, i32* %6
%20 = load i32*, i32** %3
%21 = getelementptr inbounds i32, i32* %20, i64 1
%22 = load i32, i32* %21
%23 = load i32*, i32** %3
%24 = load i32, i32* %5
%25 = sext i32 %24 to i64
%26 = getelementptr inbounds i32, i32* %23, i64 %25
store i32 %22, i32* %26
%27 = load i32, i32* %6
%28 = load i32*, i32** %3
%29 = getelementptr inbounds i32, i32* %28, i64 1
store i32 %27, i32* %29
%30 = load i32, i32* %5
%31 = add nsw i32 %30, -1
store i32 %31, i32* %5
%32 = load i32*, i32** %3
%33 = load i32, i32* %5
%34 = call i32 @adjust_max_heap(i32* %32, i32 %33, i32 1)
br label %11
35: ; preds = %11
ret void
}

LLVM IR (-O2):
define void @heap_sort(i32* %0, i32 %1) {
%3 = tail call i32 @build_max_heap(i32* %0, i32 %1)
%4 = icmp sgt i32 %1, 1
br i1 %4, label %5, label %17
5: ; preds = %2
%6 = getelementptr inbounds i32, i32* %0, i64 1
%7 = zext i32 %1 to i64
br label %8
8: ; preds = %5, %8
%9 = phi i64 [ %7, %5 ], [ %13, %8 ]
%10 = getelementptr inbounds i32, i32* %0, i64 %9
%11 = load i32, i32* %10
%12 = load i32, i32* %6
store i32 %12, i32* %10
store i32 %11, i32* %6
%13 = add nsw i64 %9, -1
%14 = trunc i64 %13 to i32
%15 = tail call i32 @adjust_max_heap(i32* %0, i32 %14, i32 1)
%16 = icmp ugt i64 %9, 2
br i1 %16, label %8, label %17
17: ; preds = %8, %2
ret void
}