#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*/ quick_sort(int *, int /*<<< orphan*/, int);
int makeArrayIncreasing(int *arr1, int arr1Size, int *arr2, int arr2Size) {
  int step = -1, index = 0;
  quick_sort(arr2, 0, arr2Size - 1);
  for (int i = 1; i < arr1Size; i++) {
    if (arr1[i - 1] >= arr1[i]) {
    }
  }
  return step;
}


x86 assembly (clang, -O0):
<makeArrayIncreasing>:
push   %rbp
mov    %rsp,%rbp
sub    $0x30,%rsp
mov    %rdi,-0x8(%rbp)
mov    %esi,-0xc(%rbp)
mov    %rdx,-0x18(%rbp)
mov    %ecx,-0x1c(%rbp)
movl   $0xffffffff,-0x20(%rbp)
movl   $0x0,-0x24(%rbp)
mov    -0x18(%rbp),%rdi
mov    -0x1c(%rbp),%edx
sub    $0x1,%edx
xor    %esi,%esi
call   1030 <quick_sort@plt>
movl   $0x1,-0x28(%rbp)
mov    -0x28(%rbp),%eax
cmp    -0xc(%rbp),%eax
jge    1191 <makeArrayIncreasing+0x81>
mov    -0x8(%rbp),%rax
mov    -0x28(%rbp),%ecx
sub    $0x1,%ecx
movslq %ecx,%rcx
mov    (%rax,%rcx,4),%eax
mov    -0x8(%rbp),%rcx
movslq -0x28(%rbp),%rdx
cmp    (%rcx,%rdx,4),%eax
jl     117e <makeArrayIncreasing+0x6e>
jmp    117e <makeArrayIncreasing+0x6e>
jmp    1183 <makeArrayIncreasing+0x73>
mov    -0x28(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x28(%rbp)
jmp    114c <makeArrayIncreasing+0x3c>
mov    -0x20(%rbp),%eax
add    $0x30,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<makeArrayIncreasing>:
push   %rax
mov    %rdx,%rdi
lea    -0x1(%rcx),%edx
xor    %esi,%esi
call   1030 <quick_sort@plt>
mov    $0xffffffff,%eax
pop    %rcx
ret

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

LLVM IR (-O2):
define i32 @makeArrayIncreasing(i32* nocapture readnone %0, i32 %1, i32* %2, i32 %3) {
%5 = add nsw i32 %3, -1
%6 = tail call i32 @quick_sort(i32* %2, i32 0, i32 %5)
ret i32 -1
}