	.file	"71456.c"
	.intel_syntax noprefix
	.text
	.globl	avl_tree_new
	.type	avl_tree_new, @function
avl_tree_new:
.LFB6:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	edi, 24
	call	malloc@PLT
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L2
	mov	eax, 0
	jmp	.L3
.L2:
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], 0
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR -24[rbp]
	mov	QWORD PTR 8[rax], rdx
	mov	rax, QWORD PTR -8[rbp]
	mov	DWORD PTR 16[rax], 0
	mov	rax, QWORD PTR -8[rbp]
.L3:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE6:
	.size	avl_tree_new, .-avl_tree_new
	.type	avl_tree_free_subtree, @function
avl_tree_free_subtree:
.LFB7:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	mov	QWORD PTR -8[rbp], rdi
	mov	QWORD PTR -16[rbp], rsi
	cmp	QWORD PTR -16[rbp], 0
	je	.L7
	mov	rax, QWORD PTR -16[rbp]
	mov	rdx, QWORD PTR [rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_free_subtree
	mov	rax, QWORD PTR -16[rbp]
	mov	rdx, QWORD PTR 8[rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_free_subtree
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	free@PLT
	jmp	.L4
.L7:
	nop
.L4:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE7:
	.size	avl_tree_free_subtree, .-avl_tree_free_subtree
	.globl	avl_tree_free
	.type	avl_tree_free, @function
avl_tree_free:
.LFB8:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR [rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_free_subtree
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	free@PLT
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE8:
	.size	avl_tree_free, .-avl_tree_free
	.globl	avl_tree_subtree_height
	.type	avl_tree_subtree_height, @function
avl_tree_subtree_height:
.LFB9:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	cmp	QWORD PTR -8[rbp], 0
	jne	.L10
	mov	eax, 0
	jmp	.L11
.L10:
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR 40[rax]
.L11:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE9:
	.size	avl_tree_subtree_height, .-avl_tree_subtree_height
	.type	avl_tree_update_height, @function
avl_tree_update_height:
.LFB10:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 40
	mov	QWORD PTR -40[rbp], rdi
	mov	rax, QWORD PTR -40[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -40[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	mov	DWORD PTR -24[rbp], eax
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	mov	DWORD PTR -20[rbp], eax
	mov	eax, DWORD PTR -24[rbp]
	cmp	eax, DWORD PTR -20[rbp]
	jle	.L13
	mov	eax, DWORD PTR -24[rbp]
	lea	edx, 1[rax]
	mov	rax, QWORD PTR -40[rbp]
	mov	DWORD PTR 40[rax], edx
	jmp	.L15
.L13:
	mov	eax, DWORD PTR -20[rbp]
	lea	edx, 1[rax]
	mov	rax, QWORD PTR -40[rbp]
	mov	DWORD PTR 40[rax], edx
.L15:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE10:
	.size	avl_tree_update_height, .-avl_tree_update_height
	.type	avl_tree_node_parent_side, @function
avl_tree_node_parent_side:
.LFB11:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rax, QWORD PTR [rax]
	cmp	QWORD PTR -8[rbp], rax
	jne	.L17
	mov	eax, 0
	jmp	.L18
.L17:
	mov	eax, 1
.L18:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE11:
	.size	avl_tree_node_parent_side, .-avl_tree_node_parent_side
	.type	avl_tree_node_replace, @function
avl_tree_node_replace:
.LFB12:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 40
	mov	QWORD PTR -24[rbp], rdi
	mov	QWORD PTR -32[rbp], rsi
	mov	QWORD PTR -40[rbp], rdx
	cmp	QWORD PTR -40[rbp], 0
	je	.L20
	mov	rax, QWORD PTR -32[rbp]
	mov	rdx, QWORD PTR 16[rax]
	mov	rax, QWORD PTR -40[rbp]
	mov	QWORD PTR 16[rax], rdx
.L20:
	mov	rax, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	jne	.L21
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR -40[rbp]
	mov	QWORD PTR [rax], rdx
	jmp	.L23
.L21:
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	avl_tree_node_parent_side
	mov	DWORD PTR -4[rbp], eax
	mov	rax, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	edx, DWORD PTR -4[rbp]
	movsx	rdx, edx
	mov	rcx, QWORD PTR -40[rbp]
	mov	QWORD PTR [rax+rdx*8], rcx
	mov	rax, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	avl_tree_update_height
.L23:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE12:
	.size	avl_tree_node_replace, .-avl_tree_node_replace
	.type	avl_tree_rotate, @function
avl_tree_rotate:
.LFB13:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 40
	mov	QWORD PTR -24[rbp], rdi
	mov	QWORD PTR -32[rbp], rsi
	mov	DWORD PTR -36[rbp], edx
	mov	eax, 1
	sub	eax, DWORD PTR -36[rbp]
	mov	edx, eax
	mov	rax, QWORD PTR -32[rbp]
	mov	edx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	mov	QWORD PTR -8[rbp], rax
	mov	rdx, QWORD PTR -8[rbp]
	mov	rcx, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_node_replace
	mov	eax, 1
	sub	eax, DWORD PTR -36[rbp]
	mov	ecx, eax
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR -36[rbp]
	mov	rdx, QWORD PTR [rax+rdx*8]
	mov	rax, QWORD PTR -32[rbp]
	mov	ecx, ecx
	mov	QWORD PTR [rax+rcx*8], rdx
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR -36[rbp]
	mov	rcx, QWORD PTR -32[rbp]
	mov	QWORD PTR [rax+rdx*8], rcx
	mov	rax, QWORD PTR -32[rbp]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rax], rdx
	mov	eax, 1
	sub	eax, DWORD PTR -36[rbp]
	mov	edx, eax
	mov	rax, QWORD PTR -32[rbp]
	mov	edx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	test	rax, rax
	je	.L25
	mov	eax, 1
	sub	eax, DWORD PTR -36[rbp]
	mov	edx, eax
	mov	rax, QWORD PTR -32[rbp]
	mov	edx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	mov	rdx, QWORD PTR -32[rbp]
	mov	QWORD PTR 16[rax], rdx
.L25:
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	avl_tree_update_height
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	avl_tree_update_height
	mov	rax, QWORD PTR -8[rbp]
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE13:
	.size	avl_tree_rotate, .-avl_tree_rotate
	.type	avl_tree_node_balance, @function
avl_tree_node_balance:
.LFB14:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	push	rbx
	sub	rsp, 48
	.cfi_offset 3, -24
	mov	QWORD PTR -48[rbp], rdi
	mov	QWORD PTR -56[rbp], rsi
	mov	rax, QWORD PTR -56[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -32[rbp], rax
	mov	rax, QWORD PTR -56[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -24[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	mov	ebx, eax
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	mov	edx, eax
	mov	eax, ebx
	sub	eax, edx
	mov	DWORD PTR -36[rbp], eax
	cmp	DWORD PTR -36[rbp], 1
	jle	.L28
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdi, rax
	call	avl_tree_subtree_height
	mov	ebx, eax
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rdi, rax
	call	avl_tree_subtree_height
	cmp	ebx, eax
	jge	.L29
	mov	rcx, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR -48[rbp]
	mov	edx, 1
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_rotate
.L29:
	mov	rcx, QWORD PTR -56[rbp]
	mov	rax, QWORD PTR -48[rbp]
	mov	edx, 0
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_rotate
	mov	QWORD PTR -56[rbp], rax
	jmp	.L30
.L28:
	cmp	DWORD PTR -36[rbp], -1
	jge	.L30
	mov	rax, QWORD PTR -56[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rdi, rax
	call	avl_tree_subtree_height
	mov	ebx, eax
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdi, rax
	call	avl_tree_subtree_height
	cmp	ebx, eax
	jge	.L31
	mov	rcx, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR -48[rbp]
	mov	edx, 0
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_rotate
.L31:
	mov	rcx, QWORD PTR -56[rbp]
	mov	rax, QWORD PTR -48[rbp]
	mov	edx, 1
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_rotate
	mov	QWORD PTR -56[rbp], rax
.L30:
	mov	rax, QWORD PTR -56[rbp]
	mov	rdi, rax
	call	avl_tree_update_height
	mov	rax, QWORD PTR -56[rbp]
	mov	rbx, QWORD PTR -8[rbp]
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE14:
	.size	avl_tree_node_balance, .-avl_tree_node_balance
	.type	avl_tree_balance_to_root, @function
avl_tree_balance_to_root:
.LFB15:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	QWORD PTR -32[rbp], rsi
	mov	rax, QWORD PTR -32[rbp]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L34
.L35:
	mov	rdx, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_node_balance
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -8[rbp], rax
.L34:
	cmp	QWORD PTR -8[rbp], 0
	jne	.L35
	nop
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE15:
	.size	avl_tree_balance_to_root, .-avl_tree_balance_to_root
	.globl	avl_tree_insert
	.type	avl_tree_insert, @function
avl_tree_insert:
.LFB16:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 64
	mov	QWORD PTR -40[rbp], rdi
	mov	QWORD PTR -48[rbp], rsi
	mov	QWORD PTR -56[rbp], rdx
	mov	rax, QWORD PTR -40[rbp]
	mov	QWORD PTR -24[rbp], rax
	mov	QWORD PTR -16[rbp], 0
	jmp	.L37
.L39:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -40[rbp]
	mov	rcx, QWORD PTR 8[rax]
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rdx, QWORD PTR 24[rax]
	mov	rax, QWORD PTR -48[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	rcx
	test	eax, eax
	jns	.L38
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -24[rbp], rax
	jmp	.L37
.L38:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	add	rax, 8
	mov	QWORD PTR -24[rbp], rax
.L37:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L39
	mov	edi, 48
	call	malloc@PLT
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L40
	mov	eax, 0
	jmp	.L41
.L40:
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], 0
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR 8[rax], 0
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR -16[rbp]
	mov	QWORD PTR 16[rax], rdx
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR -48[rbp]
	mov	QWORD PTR 24[rax], rdx
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR -56[rbp]
	mov	QWORD PTR 32[rax], rdx
	mov	rax, QWORD PTR -8[rbp]
	mov	DWORD PTR 40[rax], 1
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], rdx
	mov	rdx, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR -40[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_balance_to_root
	mov	rax, QWORD PTR -40[rbp]
	mov	eax, DWORD PTR 16[rax]
	lea	edx, 1[rax]
	mov	rax, QWORD PTR -40[rbp]
	mov	DWORD PTR 16[rax], edx
	mov	rax, QWORD PTR -8[rbp]
.L41:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE16:
	.size	avl_tree_insert, .-avl_tree_insert
	.type	avl_tree_node_get_replacement, @function
avl_tree_node_get_replacement:
.LFB17:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 64
	mov	QWORD PTR -56[rbp], rdi
	mov	QWORD PTR -64[rbp], rsi
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -24[rbp], rax
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -24[rbp], 0
	jne	.L43
	cmp	QWORD PTR -16[rbp], 0
	jne	.L43
	mov	eax, 0
	jmp	.L44
.L43:
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	mov	DWORD PTR -40[rbp], eax
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	mov	DWORD PTR -36[rbp], eax
	mov	eax, DWORD PTR -40[rbp]
	cmp	eax, DWORD PTR -36[rbp]
	jge	.L45
	mov	DWORD PTR -44[rbp], 1
	jmp	.L46
.L45:
	mov	DWORD PTR -44[rbp], 0
.L46:
	mov	rax, QWORD PTR -64[rbp]
	mov	edx, DWORD PTR -44[rbp]
	movsx	rdx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	mov	QWORD PTR -32[rbp], rax
	jmp	.L47
.L48:
	mov	eax, 1
	sub	eax, DWORD PTR -44[rbp]
	mov	edx, eax
	mov	rax, QWORD PTR -32[rbp]
	movsx	rdx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	mov	QWORD PTR -32[rbp], rax
.L47:
	mov	eax, 1
	sub	eax, DWORD PTR -44[rbp]
	mov	edx, eax
	mov	rax, QWORD PTR -32[rbp]
	movsx	rdx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	test	rax, rax
	jne	.L48
	mov	rax, QWORD PTR -32[rbp]
	mov	edx, DWORD PTR -44[rbp]
	movsx	rdx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	mov	QWORD PTR -8[rbp], rax
	mov	rdx, QWORD PTR -8[rbp]
	mov	rcx, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR -56[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_node_replace
	mov	rax, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	avl_tree_update_height
	mov	rax, QWORD PTR -32[rbp]
.L44:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE17:
	.size	avl_tree_node_get_replacement, .-avl_tree_node_get_replacement
	.globl	avl_tree_remove_node
	.type	avl_tree_remove_node, @function
avl_tree_remove_node:
.LFB18:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 48
	mov	QWORD PTR -40[rbp], rdi
	mov	QWORD PTR -48[rbp], rsi
	mov	rdx, QWORD PTR -48[rbp]
	mov	rax, QWORD PTR -40[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_node_get_replacement
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L50
	mov	rcx, QWORD PTR -48[rbp]
	mov	rax, QWORD PTR -40[rbp]
	mov	edx, 0
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_node_replace
	mov	rax, QWORD PTR -48[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -16[rbp], rax
	jmp	.L51
.L50:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -48[rbp], rax
	jne	.L52
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR -16[rbp], rax
	jmp	.L53
.L52:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -16[rbp], rax
.L53:
	mov	DWORD PTR -20[rbp], 0
	jmp	.L54
.L56:
	mov	rax, QWORD PTR -48[rbp]
	mov	edx, DWORD PTR -20[rbp]
	movsx	rdx, edx
	mov	rcx, QWORD PTR [rax+rdx*8]
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR -20[rbp]
	movsx	rdx, edx
	mov	QWORD PTR [rax+rdx*8], rcx
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR -20[rbp]
	movsx	rdx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	test	rax, rax
	je	.L55
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR -20[rbp]
	movsx	rdx, edx
	mov	rax, QWORD PTR [rax+rdx*8]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rax], rdx
.L55:
	add	DWORD PTR -20[rbp], 1
.L54:
	cmp	DWORD PTR -20[rbp], 1
	jle	.L56
	mov	rax, QWORD PTR -48[rbp]
	mov	edx, DWORD PTR 40[rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	DWORD PTR 40[rax], edx
	mov	rdx, QWORD PTR -8[rbp]
	mov	rcx, QWORD PTR -48[rbp]
	mov	rax, QWORD PTR -40[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_node_replace
.L51:
	mov	rax, QWORD PTR -48[rbp]
	mov	rdi, rax
	call	free@PLT
	mov	rax, QWORD PTR -40[rbp]
	mov	eax, DWORD PTR 16[rax]
	lea	edx, -1[rax]
	mov	rax, QWORD PTR -40[rbp]
	mov	DWORD PTR 16[rax], edx
	mov	rdx, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR -40[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_balance_to_root
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE18:
	.size	avl_tree_remove_node, .-avl_tree_remove_node
	.globl	avl_tree_remove
	.type	avl_tree_remove, @function
avl_tree_remove:
.LFB19:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	QWORD PTR -32[rbp], rsi
	mov	rdx, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup_node
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L58
	mov	eax, 0
	jmp	.L59
.L58:
	mov	rdx, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_remove_node
	mov	eax, 1
.L59:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE19:
	.size	avl_tree_remove, .-avl_tree_remove
	.globl	avl_tree_lookup_node
	.type	avl_tree_lookup_node, @function
avl_tree_lookup_node:
.LFB20:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	QWORD PTR -32[rbp], rsi
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L61
.L65:
	mov	rax, QWORD PTR -24[rbp]
	mov	rcx, QWORD PTR 8[rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR 24[rax]
	mov	rax, QWORD PTR -32[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	rcx
	mov	DWORD PTR -12[rbp], eax
	cmp	DWORD PTR -12[rbp], 0
	jne	.L62
	mov	rax, QWORD PTR -8[rbp]
	jmp	.L63
.L62:
	cmp	DWORD PTR -12[rbp], 0
	jns	.L64
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L61
.L64:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
.L61:
	cmp	QWORD PTR -8[rbp], 0
	jne	.L65
	mov	eax, 0
.L63:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE20:
	.size	avl_tree_lookup_node, .-avl_tree_lookup_node
	.globl	avl_tree_lookup
	.type	avl_tree_lookup, @function
avl_tree_lookup:
.LFB21:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	QWORD PTR -32[rbp], rsi
	mov	rdx, QWORD PTR -32[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup_node
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L67
	mov	eax, 0
	jmp	.L68
.L67:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 32[rax]
.L68:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE21:
	.size	avl_tree_lookup, .-avl_tree_lookup
	.globl	avl_tree_root_node
	.type	avl_tree_root_node, @function
avl_tree_root_node:
.LFB22:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE22:
	.size	avl_tree_root_node, .-avl_tree_root_node
	.globl	avl_tree_node_key
	.type	avl_tree_node_key, @function
avl_tree_node_key:
.LFB23:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 24[rax]
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE23:
	.size	avl_tree_node_key, .-avl_tree_node_key
	.globl	avl_tree_node_value
	.type	avl_tree_node_value, @function
avl_tree_node_value:
.LFB24:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 32[rax]
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE24:
	.size	avl_tree_node_value, .-avl_tree_node_value
	.globl	avl_tree_node_child
	.type	avl_tree_node_child, @function
avl_tree_node_child:
.LFB25:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	mov	DWORD PTR -12[rbp], esi
	cmp	DWORD PTR -12[rbp], 0
	je	.L76
	cmp	DWORD PTR -12[rbp], 1
	jne	.L77
.L76:
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR -12[rbp]
	mov	rax, QWORD PTR [rax+rdx*8]
	jmp	.L78
.L77:
	mov	eax, 0
.L78:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE25:
	.size	avl_tree_node_child, .-avl_tree_node_child
	.globl	avl_tree_node_parent
	.type	avl_tree_node_parent, @function
avl_tree_node_parent:
.LFB26:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE26:
	.size	avl_tree_node_parent, .-avl_tree_node_parent
	.globl	avl_tree_num_entries
	.type	avl_tree_num_entries, @function
avl_tree_num_entries:
.LFB27:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR 16[rax]
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE27:
	.size	avl_tree_num_entries, .-avl_tree_num_entries
	.type	avl_tree_to_array_add_subtree, @function
avl_tree_to_array_add_subtree:
.LFB28:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -8[rbp], rdi
	mov	QWORD PTR -16[rbp], rsi
	mov	QWORD PTR -24[rbp], rdx
	cmp	QWORD PTR -8[rbp], 0
	je	.L86
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rdx, QWORD PTR -24[rbp]
	mov	rcx, QWORD PTR -16[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_to_array_add_subtree
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR [rax]
	cdqe
	lea	rdx, 0[0+rax*8]
	mov	rax, QWORD PTR -16[rbp]
	add	rdx, rax
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 24[rax]
	mov	QWORD PTR [rdx], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR [rax]
	lea	edx, 1[rax]
	mov	rax, QWORD PTR -24[rbp]
	mov	DWORD PTR [rax], edx
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdx, QWORD PTR -24[rbp]
	mov	rcx, QWORD PTR -16[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_to_array_add_subtree
	jmp	.L83
.L86:
	nop
.L83:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE28:
	.size	avl_tree_to_array_add_subtree, .-avl_tree_to_array_add_subtree
	.globl	avl_tree_to_array
	.type	avl_tree_to_array, @function
avl_tree_to_array:
.LFB29:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 48
	mov	QWORD PTR -40[rbp], rdi
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	mov	rax, QWORD PTR -40[rbp]
	mov	eax, DWORD PTR 16[rax]
	cdqe
	sal	rax, 3
	mov	rdi, rax
	call	malloc@PLT
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -16[rbp], 0
	jne	.L88
	mov	eax, 0
	jmp	.L90
.L88:
	mov	DWORD PTR -20[rbp], 0
	mov	rax, QWORD PTR -40[rbp]
	mov	rax, QWORD PTR [rax]
	lea	rdx, -20[rbp]
	mov	rcx, QWORD PTR -16[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_to_array_add_subtree
	mov	rax, QWORD PTR -16[rbp]
.L90:
	mov	rsi, QWORD PTR -8[rbp]
	sub	rsi, QWORD PTR fs:40
	je	.L91
	call	__stack_chk_fail@PLT
.L91:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE29:
	.size	avl_tree_to_array, .-avl_tree_to_array
	.globl	test_array
	.bss
	.align 32
	.type	test_array, @object
	.size	test_array, 512
test_array:
	.zero	512
	.text
	.globl	find_subtree_height
	.type	find_subtree_height, @function
find_subtree_height:
.LFB30:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 48
	mov	QWORD PTR -40[rbp], rdi
	cmp	QWORD PTR -40[rbp], 0
	jne	.L93
	mov	eax, 0
	jmp	.L94
.L93:
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, 0
	mov	rdi, rax
	call	avl_tree_node_child
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, 1
	mov	rdi, rax
	call	avl_tree_node_child
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	find_subtree_height
	mov	DWORD PTR -24[rbp], eax
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	find_subtree_height
	mov	DWORD PTR -20[rbp], eax
	mov	eax, DWORD PTR -24[rbp]
	cmp	eax, DWORD PTR -20[rbp]
	jle	.L95
	mov	eax, DWORD PTR -24[rbp]
	add	eax, 1
	jmp	.L94
.L95:
	mov	eax, DWORD PTR -20[rbp]
	add	eax, 1
.L94:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE30:
	.size	find_subtree_height, .-find_subtree_height
	.globl	counter
	.bss
	.align 4
	.type	counter, @object
	.size	counter, 4
counter:
	.zero	4
	.section	.rodata
.LC0:
	.string	"the_stack_data/71456.c"
	.align 8
.LC1:
	.string	"avl_tree_node_parent(left_node) == node"
	.align 8
.LC2:
	.string	"avl_tree_node_parent(right_node) == node"
.LC3:
	.string	"*key > counter"
	.align 8
.LC4:
	.string	"avl_tree_subtree_height(left_node) == left_height"
	.align 8
.LC5:
	.string	"avl_tree_subtree_height(right_node) == right_height"
	.align 8
.LC6:
	.string	"left_height - right_height < 2 && right_height - left_height < 2"
	.text
	.globl	validate_subtree
	.type	validate_subtree, @function
validate_subtree:
.LFB31:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 48
	mov	QWORD PTR -40[rbp], rdi
	cmp	QWORD PTR -40[rbp], 0
	jne	.L97
	mov	eax, 0
	jmp	.L98
.L97:
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, 0
	mov	rdi, rax
	call	avl_tree_node_child
	mov	QWORD PTR -24[rbp], rax
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, 1
	mov	rdi, rax
	call	avl_tree_node_child
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -24[rbp], 0
	je	.L99
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	avl_tree_node_parent
	cmp	QWORD PTR -40[rbp], rax
	je	.L99
	lea	rcx, __PRETTY_FUNCTION__.6[rip]
	mov	edx, 929
	lea	rsi, .LC0[rip]
	lea	rdi, .LC1[rip]
	call	__assert_fail@PLT
.L99:
	cmp	QWORD PTR -16[rbp], 0
	je	.L100
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	avl_tree_node_parent
	cmp	QWORD PTR -40[rbp], rax
	je	.L100
	lea	rcx, __PRETTY_FUNCTION__.6[rip]
	mov	edx, 932
	lea	rsi, .LC0[rip]
	lea	rdi, .LC2[rip]
	call	__assert_fail@PLT
.L100:
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	validate_subtree
	mov	DWORD PTR -32[rbp], eax
	mov	rax, QWORD PTR -40[rbp]
	mov	rdi, rax
	call	avl_tree_node_key
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR [rax]
	mov	eax, DWORD PTR counter[rip]
	cmp	edx, eax
	jg	.L101
	lea	rcx, __PRETTY_FUNCTION__.6[rip]
	mov	edx, 944
	lea	rsi, .LC0[rip]
	lea	rdi, .LC3[rip]
	call	__assert_fail@PLT
.L101:
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	mov	DWORD PTR counter[rip], eax
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	validate_subtree
	mov	DWORD PTR -28[rbp], eax
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	cmp	DWORD PTR -32[rbp], eax
	je	.L102
	lea	rcx, __PRETTY_FUNCTION__.6[rip]
	mov	edx, 952
	lea	rsi, .LC0[rip]
	lea	rdi, .LC4[rip]
	call	__assert_fail@PLT
.L102:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	cmp	DWORD PTR -28[rbp], eax
	je	.L103
	lea	rcx, __PRETTY_FUNCTION__.6[rip]
	mov	edx, 953
	lea	rsi, .LC0[rip]
	lea	rdi, .LC5[rip]
	call	__assert_fail@PLT
.L103:
	mov	eax, DWORD PTR -32[rbp]
	sub	eax, DWORD PTR -28[rbp]
	cmp	eax, 1
	jg	.L104
	mov	eax, DWORD PTR -28[rbp]
	sub	eax, DWORD PTR -32[rbp]
	cmp	eax, 1
	jle	.L107
.L104:
	lea	rcx, __PRETTY_FUNCTION__.6[rip]
	mov	edx, 957
	lea	rsi, .LC0[rip]
	lea	rdi, .LC6[rip]
	call	__assert_fail@PLT
.L107:
	mov	eax, DWORD PTR -32[rbp]
	cmp	eax, DWORD PTR -28[rbp]
	jle	.L106
	mov	eax, DWORD PTR -32[rbp]
	add	eax, 1
	jmp	.L98
.L106:
	mov	eax, DWORD PTR -28[rbp]
	add	eax, 1
.L98:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE31:
	.size	validate_subtree, .-validate_subtree
	.section	.rodata
	.align 8
.LC7:
	.string	"avl_tree_subtree_height(root_node) == height"
	.text
	.globl	validate_tree
	.type	validate_tree, @function
validate_tree:
.LFB32:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	avl_tree_root_node
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	je	.L109
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	find_subtree_height
	mov	DWORD PTR -12[rbp], eax
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	avl_tree_subtree_height
	cmp	DWORD PTR -12[rbp], eax
	je	.L109
	lea	rcx, __PRETTY_FUNCTION__.5[rip]
	mov	edx, 977
	lea	rsi, .LC0[rip]
	lea	rdi, .LC7[rip]
	call	__assert_fail@PLT
.L109:
	mov	DWORD PTR counter[rip], -1
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	validate_subtree
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE32:
	.size	validate_tree, .-validate_tree
	.globl	create_tree
	.type	create_tree, @function
create_tree:
.LFB33:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	lea	rdi, int_compare[rip]
	call	avl_tree_new
	mov	QWORD PTR -8[rbp], rax
	mov	DWORD PTR -12[rbp], 0
	jmp	.L111
.L112:
	mov	eax, DWORD PTR -12[rbp]
	cdqe
	lea	rcx, 0[0+rax*4]
	lea	rdx, test_array[rip]
	mov	eax, DWORD PTR -12[rbp]
	mov	DWORD PTR [rcx+rdx], eax
	mov	eax, DWORD PTR -12[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	lea	rax, test_array[rip]
	add	rdx, rax
	mov	eax, DWORD PTR -12[rbp]
	cdqe
	lea	rcx, 0[0+rax*4]
	lea	rax, test_array[rip]
	add	rcx, rax
	mov	rax, QWORD PTR -8[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_insert
	add	DWORD PTR -12[rbp], 1
.L111:
	cmp	DWORD PTR -12[rbp], 127
	jle	.L112
	mov	rax, QWORD PTR -8[rbp]
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE33:
	.size	create_tree, .-create_tree
	.section	.rodata
	.align 8
.LC8:
	.string	"avl_tree_num_entries(tree) == i + 1"
	.align 8
.LC9:
	.string	"avl_tree_root_node(tree) != NULL"
.LC10:
	.string	"node != NULL"
.LC11:
	.string	"*value == i"
	.align 8
.LC12:
	.string	"avl_tree_lookup_node(tree, &i) == NULL"
	.text
	.globl	test_avl_tree_insert_lookup
	.type	test_avl_tree_insert_lookup, @function
test_avl_tree_insert_lookup:
.LFB34:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 48
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	lea	rdi, int_compare[rip]
	call	avl_tree_new
	mov	QWORD PTR -32[rbp], rax
	mov	DWORD PTR -36[rbp], 0
	jmp	.L115
.L117:
	mov	edx, DWORD PTR -36[rbp]
	mov	eax, DWORD PTR -36[rbp]
	movsx	rdx, edx
	lea	rcx, 0[0+rdx*4]
	lea	rdx, test_array[rip]
	mov	DWORD PTR [rcx+rdx], eax
	mov	eax, DWORD PTR -36[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	lea	rax, test_array[rip]
	add	rdx, rax
	mov	eax, DWORD PTR -36[rbp]
	cdqe
	lea	rcx, 0[0+rax*4]
	lea	rax, test_array[rip]
	add	rcx, rax
	mov	rax, QWORD PTR -32[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_insert
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	avl_tree_num_entries
	mov	edx, DWORD PTR -36[rbp]
	add	edx, 1
	cmp	eax, edx
	je	.L116
	lea	rcx, __PRETTY_FUNCTION__.4[rip]
	mov	edx, 1017
	lea	rsi, .LC0[rip]
	lea	rdi, .LC8[rip]
	call	__assert_fail@PLT
.L116:
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	validate_tree
	mov	eax, DWORD PTR -36[rbp]
	add	eax, 1
	mov	DWORD PTR -36[rbp], eax
.L115:
	mov	eax, DWORD PTR -36[rbp]
	cmp	eax, 127
	jle	.L117
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	avl_tree_root_node
	test	rax, rax
	jne	.L118
	lea	rcx, __PRETTY_FUNCTION__.4[rip]
	mov	edx, 1021
	lea	rsi, .LC0[rip]
	lea	rdi, .LC9[rip]
	call	__assert_fail@PLT
.L118:
	mov	DWORD PTR -36[rbp], 0
	jmp	.L119
.L123:
	lea	rdx, -36[rbp]
	mov	rax, QWORD PTR -32[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup_node
	mov	QWORD PTR -24[rbp], rax
	cmp	QWORD PTR -24[rbp], 0
	jne	.L120
	lea	rcx, __PRETTY_FUNCTION__.4[rip]
	mov	edx, 1027
	lea	rsi, .LC0[rip]
	lea	rdi, .LC10[rip]
	call	__assert_fail@PLT
.L120:
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	avl_tree_node_key
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	edx, DWORD PTR [rax]
	mov	eax, DWORD PTR -36[rbp]
	cmp	edx, eax
	je	.L121
	lea	rcx, __PRETTY_FUNCTION__.4[rip]
	mov	edx, 1029
	lea	rsi, .LC0[rip]
	lea	rdi, .LC11[rip]
	call	__assert_fail@PLT
.L121:
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	avl_tree_node_value
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	edx, DWORD PTR [rax]
	mov	eax, DWORD PTR -36[rbp]
	cmp	edx, eax
	je	.L122
	lea	rcx, __PRETTY_FUNCTION__.4[rip]
	mov	edx, 1031
	lea	rsi, .LC0[rip]
	lea	rdi, .LC11[rip]
	call	__assert_fail@PLT
.L122:
	mov	eax, DWORD PTR -36[rbp]
	add	eax, 1
	mov	DWORD PTR -36[rbp], eax
.L119:
	mov	eax, DWORD PTR -36[rbp]
	cmp	eax, 127
	jle	.L123
	mov	DWORD PTR -36[rbp], -1
	lea	rdx, -36[rbp]
	mov	rax, QWORD PTR -32[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup_node
	test	rax, rax
	je	.L124
	lea	rcx, __PRETTY_FUNCTION__.4[rip]
	mov	edx, 1037
	lea	rsi, .LC0[rip]
	lea	rdi, .LC12[rip]
	call	__assert_fail@PLT
.L124:
	mov	DWORD PTR -36[rbp], 228
	lea	rdx, -36[rbp]
	mov	rax, QWORD PTR -32[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup_node
	test	rax, rax
	je	.L125
	lea	rcx, __PRETTY_FUNCTION__.4[rip]
	mov	edx, 1039
	lea	rsi, .LC0[rip]
	lea	rdi, .LC12[rip]
	call	__assert_fail@PLT
.L125:
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	avl_tree_free
	nop
	mov	rax, QWORD PTR -8[rbp]
	sub	rax, QWORD PTR fs:40
	je	.L126
	call	__stack_chk_fail@PLT
.L126:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE34:
	.size	test_avl_tree_insert_lookup, .-test_avl_tree_insert_lookup
	.section	.rodata
.LC13:
	.string	"*p == 2"
.LC14:
	.string	"*p == 1"
.LC15:
	.string	"*p == 3"
	.align 8
.LC16:
	.string	"avl_tree_node_child(root, -1) == NULL"
	.align 8
.LC17:
	.string	"avl_tree_node_child(root, 10000) == NULL"
	.align 8
.LC18:
	.string	"avl_tree_node_child(root, 2) == NULL"
	.align 8
.LC19:
	.string	"avl_tree_node_child(root, -100000) == NULL"
	.text
	.globl	test_avl_tree_child
	.type	test_avl_tree_child, @function
test_avl_tree_child:
.LFB35:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 80
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	mov	DWORD PTR -20[rbp], 1
	mov	DWORD PTR -16[rbp], 2
	mov	DWORD PTR -12[rbp], 3
	lea	rdi, int_compare[rip]
	call	avl_tree_new
	mov	QWORD PTR -64[rbp], rax
	mov	DWORD PTR -68[rbp], 0
	jmp	.L128
.L129:
	lea	rdx, -20[rbp]
	mov	eax, DWORD PTR -68[rbp]
	cdqe
	sal	rax, 2
	add	rdx, rax
	lea	rcx, -20[rbp]
	mov	eax, DWORD PTR -68[rbp]
	cdqe
	sal	rax, 2
	add	rcx, rax
	mov	rax, QWORD PTR -64[rbp]
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_insert
	add	DWORD PTR -68[rbp], 1
.L128:
	cmp	DWORD PTR -68[rbp], 2
	jle	.L129
	mov	rax, QWORD PTR -64[rbp]
	mov	rdi, rax
	call	avl_tree_root_node
	mov	QWORD PTR -56[rbp], rax
	mov	rax, QWORD PTR -56[rbp]
	mov	rdi, rax
	call	avl_tree_node_value
	mov	QWORD PTR -48[rbp], rax
	mov	rax, QWORD PTR -48[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	eax, 2
	je	.L130
	lea	rcx, __PRETTY_FUNCTION__.3[rip]
	mov	edx, 1067
	lea	rsi, .LC0[rip]
	lea	rdi, .LC13[rip]
	call	__assert_fail@PLT
.L130:
	mov	rax, QWORD PTR -56[rbp]
	mov	esi, 0
	mov	rdi, rax
	call	avl_tree_node_child
	mov	QWORD PTR -40[rbp], rax
	mov	rax, QWORD PTR -40[rbp]
	mov	rdi, rax
	call	avl_tree_node_value
	mov	QWORD PTR -48[rbp], rax
	mov	rax, QWORD PTR -48[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	eax, 1
	je	.L131
	lea	rcx, __PRETTY_FUNCTION__.3[rip]
	mov	edx, 1071
	lea	rsi, .LC0[rip]
	lea	rdi, .LC14[rip]
	call	__assert_fail@PLT
.L131:
	mov	rax, QWORD PTR -56[rbp]
	mov	esi, 1
	mov	rdi, rax
	call	avl_tree_node_child
	mov	QWORD PTR -32[rbp], rax
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	avl_tree_node_value
	mov	QWORD PTR -48[rbp], rax
	mov	rax, QWORD PTR -48[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	eax, 3
	je	.L132
	lea	rcx, __PRETTY_FUNCTION__.3[rip]
	mov	edx, 1075
	lea	rsi, .LC0[rip]
	lea	rdi, .LC15[rip]
	call	__assert_fail@PLT
.L132:
	mov	rax, QWORD PTR -56[rbp]
	mov	esi, -1
	mov	rdi, rax
	call	avl_tree_node_child
	test	rax, rax
	je	.L133
	lea	rcx, __PRETTY_FUNCTION__.3[rip]
	mov	edx, 1079
	lea	rsi, .LC0[rip]
	lea	rdi, .LC16[rip]
	call	__assert_fail@PLT
.L133:
	mov	rax, QWORD PTR -56[rbp]
	mov	esi, 10000
	mov	rdi, rax
	call	avl_tree_node_child
	test	rax, rax
	je	.L134
	lea	rcx, __PRETTY_FUNCTION__.3[rip]
	mov	edx, 1080
	lea	rsi, .LC0[rip]
	lea	rdi, .LC17[rip]
	call	__assert_fail@PLT
.L134:
	mov	rax, QWORD PTR -56[rbp]
	mov	esi, 2
	mov	rdi, rax
	call	avl_tree_node_child
	test	rax, rax
	je	.L135
	lea	rcx, __PRETTY_FUNCTION__.3[rip]
	mov	edx, 1081
	lea	rsi, .LC0[rip]
	lea	rdi, .LC18[rip]
	call	__assert_fail@PLT
.L135:
	mov	rax, QWORD PTR -56[rbp]
	mov	esi, -100000
	mov	rdi, rax
	call	avl_tree_node_child
	test	rax, rax
	je	.L136
	lea	rcx, __PRETTY_FUNCTION__.3[rip]
	mov	edx, 1082
	lea	rsi, .LC0[rip]
	lea	rdi, .LC19[rip]
	call	__assert_fail@PLT
.L136:
	mov	rax, QWORD PTR -64[rbp]
	mov	rdi, rax
	call	avl_tree_free
	nop
	mov	rax, QWORD PTR -8[rbp]
	sub	rax, QWORD PTR fs:40
	je	.L137
	call	__stack_chk_fail@PLT
.L137:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE35:
	.size	test_avl_tree_child, .-test_avl_tree_child
	.globl	test_avl_tree_free
	.type	test_avl_tree_free, @function
test_avl_tree_free:
.LFB36:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	lea	rdi, int_compare[rip]
	call	avl_tree_new
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	avl_tree_free
	call	create_tree
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	avl_tree_free
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE36:
	.size	test_avl_tree_free, .-test_avl_tree_free
	.section	.rodata
.LC20:
	.string	"value != NULL"
	.align 8
.LC21:
	.string	"avl_tree_lookup(tree, &i) == NULL"
	.text
	.globl	test_avl_tree_lookup
	.type	test_avl_tree_lookup, @function
test_avl_tree_lookup:
.LFB37:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	call	create_tree
	mov	QWORD PTR -24[rbp], rax
	mov	DWORD PTR -28[rbp], 0
	jmp	.L140
.L143:
	lea	rdx, -28[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -16[rbp], 0
	jne	.L141
	lea	rcx, __PRETTY_FUNCTION__.2[rip]
	mov	edx, 1115
	lea	rsi, .LC0[rip]
	lea	rdi, .LC20[rip]
	call	__assert_fail@PLT
.L141:
	mov	rax, QWORD PTR -16[rbp]
	mov	edx, DWORD PTR [rax]
	mov	eax, DWORD PTR -28[rbp]
	cmp	edx, eax
	je	.L142
	lea	rcx, __PRETTY_FUNCTION__.2[rip]
	mov	edx, 1116
	lea	rsi, .LC0[rip]
	lea	rdi, .LC11[rip]
	call	__assert_fail@PLT
.L142:
	mov	eax, DWORD PTR -28[rbp]
	add	eax, 1
	mov	DWORD PTR -28[rbp], eax
.L140:
	mov	eax, DWORD PTR -28[rbp]
	cmp	eax, 127
	jle	.L143
	mov	DWORD PTR -28[rbp], -1
	lea	rdx, -28[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup
	test	rax, rax
	je	.L144
	lea	rcx, __PRETTY_FUNCTION__.2[rip]
	mov	edx, 1122
	lea	rsi, .LC0[rip]
	lea	rdi, .LC21[rip]
	call	__assert_fail@PLT
.L144:
	mov	DWORD PTR -28[rbp], 129
	lea	rdx, -28[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup
	test	rax, rax
	je	.L145
	lea	rcx, __PRETTY_FUNCTION__.2[rip]
	mov	edx, 1124
	lea	rsi, .LC0[rip]
	lea	rdi, .LC21[rip]
	call	__assert_fail@PLT
.L145:
	mov	DWORD PTR -28[rbp], 8724897
	lea	rdx, -28[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_lookup
	test	rax, rax
	je	.L146
	lea	rcx, __PRETTY_FUNCTION__.2[rip]
	mov	edx, 1126
	lea	rsi, .LC0[rip]
	lea	rdi, .LC21[rip]
	call	__assert_fail@PLT
.L146:
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	avl_tree_free
	nop
	mov	rax, QWORD PTR -8[rbp]
	sub	rax, QWORD PTR fs:40
	je	.L147
	call	__stack_chk_fail@PLT
.L147:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE37:
	.size	test_avl_tree_lookup, .-test_avl_tree_lookup
	.section	.rodata
	.align 8
.LC22:
	.string	"avl_tree_remove(tree, &i) == 0"
	.align 8
.LC23:
	.string	"avl_tree_remove(tree, &value) != 0"
	.align 8
.LC24:
	.string	"avl_tree_num_entries(tree) == expected_entries"
	.align 8
.LC25:
	.string	"avl_tree_root_node(tree) == NULL"
	.text
	.globl	test_avl_tree_remove
	.type	test_avl_tree_remove, @function
test_avl_tree_remove:
.LFB38:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 48
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	call	create_tree
	mov	QWORD PTR -16[rbp], rax
	mov	DWORD PTR -40[rbp], 228
	lea	rdx, -40[rbp]
	mov	rax, QWORD PTR -16[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_remove
	test	eax, eax
	je	.L149
	lea	rcx, __PRETTY_FUNCTION__.1[rip]
	mov	edx, 1144
	lea	rsi, .LC0[rip]
	lea	rdi, .LC22[rip]
	call	__assert_fail@PLT
.L149:
	mov	DWORD PTR -40[rbp], -1
	lea	rdx, -40[rbp]
	mov	rax, QWORD PTR -16[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_remove
	test	eax, eax
	je	.L150
	lea	rcx, __PRETTY_FUNCTION__.1[rip]
	mov	edx, 1146
	lea	rsi, .LC0[rip]
	lea	rdi, .LC22[rip]
	call	__assert_fail@PLT
.L150:
	mov	DWORD PTR -20[rbp], 128
	mov	DWORD PTR -32[rbp], 0
	jmp	.L151
.L158:
	mov	DWORD PTR -28[rbp], 0
	jmp	.L152
.L157:
	mov	DWORD PTR -24[rbp], 0
	jmp	.L153
.L156:
	mov	eax, DWORD PTR -24[rbp]
	lea	edx, 0[0+rax*4]
	mov	eax, 3
	sub	eax, DWORD PTR -28[rbp]
	add	eax, edx
	lea	edx, 0[0+rax*4]
	mov	eax, DWORD PTR -32[rbp]
	add	eax, edx
	mov	DWORD PTR -36[rbp], eax
	lea	rdx, -36[rbp]
	mov	rax, QWORD PTR -16[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	avl_tree_remove
	test	eax, eax
	jne	.L154
	lea	rcx, __PRETTY_FUNCTION__.1[rip]
	mov	edx, 1159
	lea	rsi, .LC0[rip]
	lea	rdi, .LC23[rip]
	call	__assert_fail@PLT
.L154:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	validate_tree
	sub	DWORD PTR -20[rbp], 1
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	avl_tree_num_entries
	cmp	DWORD PTR -20[rbp], eax
	je	.L155
	lea	rcx, __PRETTY_FUNCTION__.1[rip]
	mov	edx, 1162
	lea	rsi, .LC0[rip]
	lea	rdi, .LC24[rip]
	call	__assert_fail@PLT
.L155:
	add	DWORD PTR -24[rbp], 1
.L153:
	cmp	DWORD PTR -24[rbp], 7
	jle	.L156
	add	DWORD PTR -28[rbp], 1
.L152:
	cmp	DWORD PTR -28[rbp], 3
	jle	.L157
	add	DWORD PTR -32[rbp], 1
.L151:
	cmp	DWORD PTR -32[rbp], 3
	jle	.L158
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	avl_tree_root_node
	test	rax, rax
	je	.L159
	lea	rcx, __PRETTY_FUNCTION__.1[rip]
	mov	edx, 1170
	lea	rsi, .LC0[rip]
	lea	rdi, .LC25[rip]
	call	__assert_fail@PLT
.L159:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	avl_tree_free
	nop
	mov	rax, QWORD PTR -8[rbp]
	sub	rax, QWORD PTR fs:40
	je	.L160
	call	__stack_chk_fail@PLT
.L160:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE38:
	.size	test_avl_tree_remove, .-test_avl_tree_remove
	.section	.rodata
	.align 8
.LC26:
	.string	"avl_tree_num_entries(tree) == num_entries"
.LC27:
	.string	"*array[i] == sorted[i]"
	.text
	.globl	test_avl_tree_to_array
	.type	test_avl_tree_to_array, @function
test_avl_tree_to_array:
.LFB39:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	add	rsp, -128
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	mov	DWORD PTR -96[rbp], 89
	mov	DWORD PTR -92[rbp], 23
	mov	DWORD PTR -88[rbp], 42
	mov	DWORD PTR -84[rbp], 4
	mov	DWORD PTR -80[rbp], 16
	mov	DWORD PTR -76[rbp], 15
	mov	DWORD PTR -72[rbp], 8
	mov	DWORD PTR -68[rbp], 99
	mov	DWORD PTR -64[rbp], 50
	mov	DWORD PTR -60[rbp], 30
	mov	DWORD PTR -48[rbp], 4
	mov	DWORD PTR -44[rbp], 8
	mov	DWORD PTR -40[rbp], 15
	mov	DWORD PTR -36[rbp], 16
	mov	DWORD PTR -32[rbp], 23
	mov	DWORD PTR -28[rbp], 30
	mov	DWORD PTR -24[rbp], 42
	mov	DWORD PTR -20[rbp], 50
	mov	DWORD PTR -16[rbp], 89
	mov	DWORD PTR -12[rbp], 99
	mov	DWORD PTR -116[rbp], 10
	lea	rdi, int_compare[rip]
	call	avl_tree_new
	mov	QWORD PTR -112[rbp], rax
	mov	DWORD PTR -120[rbp], 0
	jmp	.L162
.L163:
	lea	rdx, -96[rbp]
	mov	eax, DWORD PTR -120[rbp]
	cdqe
	sal	rax, 2
	lea	rcx, [rdx+rax]
	mov	rax, QWORD PTR -112[rbp]
	mov	edx, 0
	mov	rsi, rcx
	mov	rdi, rax
	call	avl_tree_insert
	add	DWORD PTR -120[rbp], 1
.L162:
	mov	eax, DWORD PTR -120[rbp]
	cmp	eax, DWORD PTR -116[rbp]
	jl	.L163
	mov	rax, QWORD PTR -112[rbp]
	mov	rdi, rax
	call	avl_tree_num_entries
	cmp	DWORD PTR -116[rbp], eax
	je	.L164
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 1192
	lea	rsi, .LC0[rip]
	lea	rdi, .LC26[rip]
	call	__assert_fail@PLT
.L164:
	mov	rax, QWORD PTR -112[rbp]
	mov	rdi, rax
	call	avl_tree_to_array
	mov	QWORD PTR -104[rbp], rax
	mov	DWORD PTR -120[rbp], 0
	jmp	.L165
.L167:
	mov	eax, DWORD PTR -120[rbp]
	cdqe
	lea	rdx, 0[0+rax*8]
	mov	rax, QWORD PTR -104[rbp]
	add	rax, rdx
	mov	rax, QWORD PTR [rax]
	mov	edx, DWORD PTR [rax]
	mov	eax, DWORD PTR -120[rbp]
	cdqe
	mov	eax, DWORD PTR -48[rbp+rax*4]
	cmp	edx, eax
	je	.L166
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 1199
	lea	rsi, .LC0[rip]
	lea	rdi, .LC27[rip]
	call	__assert_fail@PLT
.L166:
	add	DWORD PTR -120[rbp], 1
.L165:
	mov	eax, DWORD PTR -120[rbp]
	cmp	eax, DWORD PTR -116[rbp]
	jl	.L167
	mov	rax, QWORD PTR -104[rbp]
	mov	rdi, rax
	call	free@PLT
	nop
	mov	rax, QWORD PTR -8[rbp]
	sub	rax, QWORD PTR fs:40
	je	.L168
	call	__stack_chk_fail@PLT
.L168:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE39:
	.size	test_avl_tree_to_array, .-test_avl_tree_to_array
	.globl	int_compare
	.type	int_compare, @function
int_compare:
.LFB40:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -24[rbp], rdi
	mov	QWORD PTR -32[rbp], rsi
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -32[rbp]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	edx, DWORD PTR [rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	edx, eax
	jge	.L170
	mov	eax, -1
	jmp	.L171
.L170:
	mov	rax, QWORD PTR -16[rbp]
	mov	edx, DWORD PTR [rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	edx, eax
	jle	.L172
	mov	eax, 1
	jmp	.L171
.L172:
	mov	eax, 0
.L171:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE40:
	.size	int_compare, .-int_compare
	.section	.rodata
.LC28:
	.string	"PASS"
	.text
	.globl	main
	.type	main, @function
main:
.LFB41:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	mov	DWORD PTR -4[rbp], edi
	mov	QWORD PTR -16[rbp], rsi
	call	test_avl_tree_free
	call	test_avl_tree_child
	call	test_avl_tree_insert_lookup
	call	test_avl_tree_lookup
	call	test_avl_tree_remove
	call	test_avl_tree_to_array
	lea	rdi, .LC28[rip]
	call	puts@PLT
	mov	eax, 0
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE41:
	.size	main, .-main
	.section	.rodata
	.align 16
	.type	__PRETTY_FUNCTION__.6, @object
	.size	__PRETTY_FUNCTION__.6, 17
__PRETTY_FUNCTION__.6:
	.string	"validate_subtree"
	.align 8
	.type	__PRETTY_FUNCTION__.5, @object
	.size	__PRETTY_FUNCTION__.5, 14
__PRETTY_FUNCTION__.5:
	.string	"validate_tree"
	.align 16
	.type	__PRETTY_FUNCTION__.4, @object
	.size	__PRETTY_FUNCTION__.4, 28
__PRETTY_FUNCTION__.4:
	.string	"test_avl_tree_insert_lookup"
	.align 16
	.type	__PRETTY_FUNCTION__.3, @object
	.size	__PRETTY_FUNCTION__.3, 20
__PRETTY_FUNCTION__.3:
	.string	"test_avl_tree_child"
	.align 16
	.type	__PRETTY_FUNCTION__.2, @object
	.size	__PRETTY_FUNCTION__.2, 21
__PRETTY_FUNCTION__.2:
	.string	"test_avl_tree_lookup"
	.align 16
	.type	__PRETTY_FUNCTION__.1, @object
	.size	__PRETTY_FUNCTION__.1, 21
__PRETTY_FUNCTION__.1:
	.string	"test_avl_tree_remove"
	.align 16
	.type	__PRETTY_FUNCTION__.0, @object
	.size	__PRETTY_FUNCTION__.0, 23
__PRETTY_FUNCTION__.0:
	.string	"test_avl_tree_to_array"
	.ident	"GCC: (Ubuntu 10.5.0-1ubuntu1~20.04) 10.5.0"
	.section	.note.GNU-stack,"",@progbits
	.section	.note.gnu.property,"a"
	.align 8
	.long	 1f - 0f
	.long	 4f - 1f
	.long	 5
0:
	.string	 "GNU"
1:
	.align 8
	.long	 0xc0000002
	.long	 3f - 2f
2:
	.long	 0x3
3:
	.align 8
4:

	.arch armv5t
	.eabi_attribute 20, 1
	.eabi_attribute 21, 1
	.eabi_attribute 23, 3
	.eabi_attribute 24, 1
	.eabi_attribute 25, 1
	.eabi_attribute 26, 2
	.eabi_attribute 30, 6
	.eabi_attribute 34, 0
	.eabi_attribute 18, 4
	.file	"71456.c"
	.text
	.align	2
	.global	avl_tree_new
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_new, %function
avl_tree_new:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	mov	r0, #12
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L2
	mov	r3, #0
	b	.L3
.L2:
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-16]
	str	r2, [r3, #4]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3, #8]
	ldr	r3, [fp, #-8]
.L3:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_new, .-avl_tree_new
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_free_subtree, %function
avl_tree_free_subtree:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	str	r0, [fp, #-8]
	str	r1, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L7
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	mov	r1, r3
	ldr	r0, [fp, #-8]
	bl	avl_tree_free_subtree
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	mov	r1, r3
	ldr	r0, [fp, #-8]
	bl	avl_tree_free_subtree
	ldr	r0, [fp, #-12]
	bl	free
	b	.L4
.L7:
	nop
.L4:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_free_subtree, .-avl_tree_free_subtree
	.align	2
	.global	avl_tree_free
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_free, %function
avl_tree_free:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	mov	r1, r3
	ldr	r0, [fp, #-8]
	bl	avl_tree_free_subtree
	ldr	r0, [fp, #-8]
	bl	free
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_free, .-avl_tree_free
	.align	2
	.global	avl_tree_subtree_height
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_subtree_height, %function
avl_tree_subtree_height:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L10
	mov	r3, #0
	b	.L11
.L10:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #20]
.L11:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	avl_tree_subtree_height, .-avl_tree_subtree_height
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_update_height, %function
avl_tree_update_height:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #24
	str	r0, [fp, #-24]
	ldr	r3, [fp, #-24]
	ldr	r3, [r3]
	str	r3, [fp, #-20]
	ldr	r3, [fp, #-24]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-16]
	ldr	r0, [fp, #-20]
	bl	avl_tree_subtree_height
	str	r0, [fp, #-12]
	ldr	r0, [fp, #-16]
	bl	avl_tree_subtree_height
	str	r0, [fp, #-8]
	ldr	r2, [fp, #-12]
	ldr	r3, [fp, #-8]
	cmp	r2, r3
	ble	.L13
	ldr	r3, [fp, #-12]
	add	r2, r3, #1
	ldr	r3, [fp, #-24]
	str	r2, [r3, #20]
	b	.L15
.L13:
	ldr	r3, [fp, #-8]
	add	r2, r3, #1
	ldr	r3, [fp, #-24]
	str	r2, [r3, #20]
.L15:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_update_height, .-avl_tree_update_height
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_node_parent_side, %function
avl_tree_node_parent_side:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	ldr	r3, [r3]
	ldr	r2, [fp, #-8]
	cmp	r2, r3
	bne	.L17
	mov	r3, #0
	b	.L18
.L17:
	mov	r3, #1
.L18:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	avl_tree_node_parent_side, .-avl_tree_node_parent_side
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_node_replace, %function
avl_tree_node_replace:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #24
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	str	r2, [fp, #-24]
	ldr	r3, [fp, #-24]
	cmp	r3, #0
	beq	.L20
	ldr	r3, [fp, #-20]
	ldr	r2, [r3, #8]
	ldr	r3, [fp, #-24]
	str	r2, [r3, #8]
.L20:
	ldr	r3, [fp, #-20]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	bne	.L21
	ldr	r3, [fp, #-16]
	ldr	r2, [fp, #-24]
	str	r2, [r3]
	b	.L23
.L21:
	ldr	r0, [fp, #-20]
	bl	avl_tree_node_parent_side
	mov	r3, r0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-20]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-8]
	ldr	r1, [fp, #-24]
	str	r1, [r3, r2, lsl #2]
	ldr	r3, [fp, #-20]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	avl_tree_update_height
.L23:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_node_replace, .-avl_tree_node_replace
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_rotate, %function
avl_tree_rotate:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #24
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	str	r2, [fp, #-24]
	ldr	r3, [fp, #-24]
	rsb	r2, r3, #1
	ldr	r3, [fp, #-20]
	ldr	r3, [r3, r2, lsl #2]
	str	r3, [fp, #-8]
	ldr	r2, [fp, #-8]
	ldr	r1, [fp, #-20]
	ldr	r0, [fp, #-16]
	bl	avl_tree_node_replace
	ldr	r3, [fp, #-24]
	rsb	r2, r3, #1
	ldr	r3, [fp, #-8]
	ldr	r1, [fp, #-24]
	ldr	r1, [r3, r1, lsl #2]
	ldr	r3, [fp, #-20]
	str	r1, [r3, r2, lsl #2]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-24]
	ldr	r1, [fp, #-20]
	str	r1, [r3, r2, lsl #2]
	ldr	r3, [fp, #-20]
	ldr	r2, [fp, #-8]
	str	r2, [r3, #8]
	ldr	r3, [fp, #-24]
	rsb	r2, r3, #1
	ldr	r3, [fp, #-20]
	ldr	r3, [r3, r2, lsl #2]
	cmp	r3, #0
	beq	.L25
	ldr	r3, [fp, #-24]
	rsb	r2, r3, #1
	ldr	r3, [fp, #-20]
	ldr	r3, [r3, r2, lsl #2]
	ldr	r2, [fp, #-20]
	str	r2, [r3, #8]
.L25:
	ldr	r0, [fp, #-8]
	bl	avl_tree_update_height
	ldr	r0, [fp, #-20]
	bl	avl_tree_update_height
	ldr	r3, [fp, #-8]
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_rotate, .-avl_tree_rotate
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_node_balance, %function
avl_tree_node_balance:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{r4, fp, lr}
	add	fp, sp, #8
	sub	sp, sp, #28
	str	r0, [fp, #-32]
	str	r1, [fp, #-36]
	ldr	r3, [fp, #-36]
	ldr	r3, [r3]
	str	r3, [fp, #-28]
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-24]
	ldr	r0, [fp, #-24]
	bl	avl_tree_subtree_height
	mov	r4, r0
	ldr	r0, [fp, #-28]
	bl	avl_tree_subtree_height
	mov	r3, r0
	sub	r3, r4, r3
	str	r3, [fp, #-20]
	ldr	r3, [fp, #-20]
	cmp	r3, #1
	ble	.L28
	ldr	r3, [fp, #-24]
	str	r3, [fp, #-16]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	mov	r0, r3
	bl	avl_tree_subtree_height
	mov	r4, r0
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	mov	r0, r3
	bl	avl_tree_subtree_height
	mov	r3, r0
	cmp	r4, r3
	bge	.L29
	mov	r2, #1
	ldr	r1, [fp, #-24]
	ldr	r0, [fp, #-32]
	bl	avl_tree_rotate
.L29:
	mov	r2, #0
	ldr	r1, [fp, #-36]
	ldr	r0, [fp, #-32]
	bl	avl_tree_rotate
	str	r0, [fp, #-36]
	b	.L30
.L28:
	ldr	r3, [fp, #-20]
	cmn	r3, #1
	bge	.L30
	ldr	r3, [fp, #-36]
	ldr	r3, [r3]
	str	r3, [fp, #-16]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	mov	r0, r3
	bl	avl_tree_subtree_height
	mov	r4, r0
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	mov	r0, r3
	bl	avl_tree_subtree_height
	mov	r3, r0
	cmp	r4, r3
	bge	.L31
	mov	r2, #0
	ldr	r1, [fp, #-28]
	ldr	r0, [fp, #-32]
	bl	avl_tree_rotate
.L31:
	mov	r2, #1
	ldr	r1, [fp, #-36]
	ldr	r0, [fp, #-32]
	bl	avl_tree_rotate
	str	r0, [fp, #-36]
.L30:
	ldr	r0, [fp, #-36]
	bl	avl_tree_update_height
	ldr	r3, [fp, #-36]
	mov	r0, r3
	sub	sp, fp, #8
	@ sp needed
	pop	{r4, fp, pc}
	.size	avl_tree_node_balance, .-avl_tree_node_balance
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_balance_to_root, %function
avl_tree_balance_to_root:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	ldr	r3, [fp, #-20]
	str	r3, [fp, #-8]
	b	.L34
.L35:
	ldr	r1, [fp, #-8]
	ldr	r0, [fp, #-16]
	bl	avl_tree_node_balance
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-8]
.L34:
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L35
	nop
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_balance_to_root, .-avl_tree_balance_to_root
	.align	2
	.global	avl_tree_insert
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_insert, %function
avl_tree_insert:
	@ args = 0, pretend = 0, frame = 32
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #32
	str	r0, [fp, #-24]
	str	r1, [fp, #-28]
	str	r2, [fp, #-32]
	ldr	r3, [fp, #-24]
	str	r3, [fp, #-16]
	mov	r3, #0
	str	r3, [fp, #-12]
	b	.L37
.L39:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-24]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-16]
	ldr	r2, [r2]
	ldr	r2, [r2, #12]
	mov	r1, r2
	ldr	r0, [fp, #-28]
	blx	r3
	mov	r3, r0
	cmp	r3, #0
	bge	.L38
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	str	r3, [fp, #-16]
	b	.L37
.L38:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	add	r3, r3, #4
	str	r3, [fp, #-16]
.L37:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L39
	mov	r0, #24
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L40
	mov	r3, #0
	b	.L41
.L40:
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3, #4]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-12]
	str	r2, [r3, #8]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-28]
	str	r2, [r3, #12]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-32]
	str	r2, [r3, #16]
	ldr	r3, [fp, #-8]
	mov	r2, #1
	str	r2, [r3, #20]
	ldr	r3, [fp, #-16]
	ldr	r2, [fp, #-8]
	str	r2, [r3]
	ldr	r1, [fp, #-12]
	ldr	r0, [fp, #-24]
	bl	avl_tree_balance_to_root
	ldr	r3, [fp, #-24]
	ldr	r3, [r3, #8]
	add	r2, r3, #1
	ldr	r3, [fp, #-24]
	str	r2, [r3, #8]
	ldr	r3, [fp, #-8]
.L41:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_insert, .-avl_tree_insert
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_node_get_replacement, %function
avl_tree_node_get_replacement:
	@ args = 0, pretend = 0, frame = 40
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #40
	str	r0, [fp, #-40]
	str	r1, [fp, #-44]
	ldr	r3, [fp, #-44]
	ldr	r3, [r3]
	str	r3, [fp, #-24]
	ldr	r3, [fp, #-44]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-20]
	ldr	r3, [fp, #-24]
	cmp	r3, #0
	bne	.L43
	ldr	r3, [fp, #-20]
	cmp	r3, #0
	bne	.L43
	mov	r3, #0
	b	.L44
.L43:
	ldr	r0, [fp, #-24]
	bl	avl_tree_subtree_height
	str	r0, [fp, #-16]
	ldr	r0, [fp, #-20]
	bl	avl_tree_subtree_height
	str	r0, [fp, #-12]
	ldr	r2, [fp, #-16]
	ldr	r3, [fp, #-12]
	cmp	r2, r3
	bge	.L45
	mov	r3, #1
	str	r3, [fp, #-28]
	b	.L46
.L45:
	mov	r3, #0
	str	r3, [fp, #-28]
.L46:
	ldr	r3, [fp, #-44]
	ldr	r2, [fp, #-28]
	ldr	r3, [r3, r2, lsl #2]
	str	r3, [fp, #-32]
	b	.L47
.L48:
	ldr	r3, [fp, #-28]
	rsb	r2, r3, #1
	ldr	r3, [fp, #-32]
	ldr	r3, [r3, r2, lsl #2]
	str	r3, [fp, #-32]
.L47:
	ldr	r3, [fp, #-28]
	rsb	r2, r3, #1
	ldr	r3, [fp, #-32]
	ldr	r3, [r3, r2, lsl #2]
	cmp	r3, #0
	bne	.L48
	ldr	r3, [fp, #-32]
	ldr	r2, [fp, #-28]
	ldr	r3, [r3, r2, lsl #2]
	str	r3, [fp, #-8]
	ldr	r2, [fp, #-8]
	ldr	r1, [fp, #-32]
	ldr	r0, [fp, #-40]
	bl	avl_tree_node_replace
	ldr	r3, [fp, #-32]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	avl_tree_update_height
	ldr	r3, [fp, #-32]
.L44:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_node_get_replacement, .-avl_tree_node_get_replacement
	.align	2
	.global	avl_tree_remove_node
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_remove_node, %function
avl_tree_remove_node:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #24
	str	r0, [fp, #-24]
	str	r1, [fp, #-28]
	ldr	r1, [fp, #-28]
	ldr	r0, [fp, #-24]
	bl	avl_tree_node_get_replacement
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L50
	mov	r2, #0
	ldr	r1, [fp, #-28]
	ldr	r0, [fp, #-24]
	bl	avl_tree_node_replace
	ldr	r3, [fp, #-28]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-16]
	b	.L51
.L50:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-28]
	cmp	r2, r3
	bne	.L52
	ldr	r3, [fp, #-8]
	str	r3, [fp, #-16]
	b	.L53
.L52:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-16]
.L53:
	mov	r3, #0
	str	r3, [fp, #-12]
	b	.L54
.L56:
	ldr	r3, [fp, #-28]
	ldr	r2, [fp, #-12]
	ldr	r1, [r3, r2, lsl #2]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-12]
	str	r1, [r3, r2, lsl #2]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-12]
	ldr	r3, [r3, r2, lsl #2]
	cmp	r3, #0
	beq	.L55
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-12]
	ldr	r3, [r3, r2, lsl #2]
	ldr	r2, [fp, #-8]
	str	r2, [r3, #8]
.L55:
	ldr	r3, [fp, #-12]
	add	r3, r3, #1
	str	r3, [fp, #-12]
.L54:
	ldr	r3, [fp, #-12]
	cmp	r3, #1
	ble	.L56
	ldr	r3, [fp, #-28]
	ldr	r2, [r3, #20]
	ldr	r3, [fp, #-8]
	str	r2, [r3, #20]
	ldr	r2, [fp, #-8]
	ldr	r1, [fp, #-28]
	ldr	r0, [fp, #-24]
	bl	avl_tree_node_replace
.L51:
	ldr	r0, [fp, #-28]
	bl	free
	ldr	r3, [fp, #-24]
	ldr	r3, [r3, #8]
	sub	r2, r3, #1
	ldr	r3, [fp, #-24]
	str	r2, [r3, #8]
	ldr	r1, [fp, #-16]
	ldr	r0, [fp, #-24]
	bl	avl_tree_balance_to_root
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_remove_node, .-avl_tree_remove_node
	.align	2
	.global	avl_tree_remove
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_remove, %function
avl_tree_remove:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	ldr	r1, [fp, #-20]
	ldr	r0, [fp, #-16]
	bl	avl_tree_lookup_node
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L58
	mov	r3, #0
	b	.L59
.L58:
	ldr	r1, [fp, #-8]
	ldr	r0, [fp, #-16]
	bl	avl_tree_remove_node
	mov	r3, #1
.L59:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_remove, .-avl_tree_remove
	.align	2
	.global	avl_tree_lookup_node
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_lookup_node, %function
avl_tree_lookup_node:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	str	r3, [fp, #-12]
	b	.L61
.L65:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-12]
	ldr	r2, [r2, #12]
	mov	r1, r2
	ldr	r0, [fp, #-20]
	blx	r3
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L62
	ldr	r3, [fp, #-12]
	b	.L63
.L62:
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bge	.L64
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	str	r3, [fp, #-12]
	b	.L61
.L64:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-12]
.L61:
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	bne	.L65
	mov	r3, #0
.L63:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_lookup_node, .-avl_tree_lookup_node
	.align	2
	.global	avl_tree_lookup
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_lookup, %function
avl_tree_lookup:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	ldr	r1, [fp, #-20]
	ldr	r0, [fp, #-16]
	bl	avl_tree_lookup_node
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L67
	mov	r3, #0
	b	.L68
.L67:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #16]
.L68:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_lookup, .-avl_tree_lookup
	.align	2
	.global	avl_tree_root_node
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_root_node, %function
avl_tree_root_node:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	avl_tree_root_node, .-avl_tree_root_node
	.align	2
	.global	avl_tree_node_key
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_node_key, %function
avl_tree_node_key:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #12]
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	avl_tree_node_key, .-avl_tree_node_key
	.align	2
	.global	avl_tree_node_value
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_node_value, %function
avl_tree_node_value:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #16]
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	avl_tree_node_value, .-avl_tree_node_value
	.align	2
	.global	avl_tree_node_child
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_node_child, %function
avl_tree_node_child:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	str	r1, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L76
	ldr	r3, [fp, #-12]
	cmp	r3, #1
	bne	.L77
.L76:
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-12]
	ldr	r3, [r3, r2, lsl #2]
	b	.L78
.L77:
	mov	r3, #0
.L78:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	avl_tree_node_child, .-avl_tree_node_child
	.align	2
	.global	avl_tree_node_parent
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_node_parent, %function
avl_tree_node_parent:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	avl_tree_node_parent, .-avl_tree_node_parent
	.align	2
	.global	avl_tree_num_entries
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_num_entries, %function
avl_tree_num_entries:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	avl_tree_num_entries, .-avl_tree_num_entries
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_to_array_add_subtree, %function
avl_tree_to_array_add_subtree:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-8]
	str	r1, [fp, #-12]
	str	r2, [fp, #-16]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	beq	.L86
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r2, [fp, #-16]
	ldr	r1, [fp, #-12]
	mov	r0, r3
	bl	avl_tree_to_array_add_subtree
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-12]
	add	r3, r2, r3
	ldr	r2, [fp, #-8]
	ldr	r2, [r2, #12]
	str	r2, [r3]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	add	r2, r3, #1
	ldr	r3, [fp, #-16]
	str	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-16]
	ldr	r1, [fp, #-12]
	mov	r0, r3
	bl	avl_tree_to_array_add_subtree
	b	.L83
.L86:
	nop
.L83:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	avl_tree_to_array_add_subtree, .-avl_tree_to_array_add_subtree
	.section	.rodata
	.align	2
.LC3:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	avl_tree_to_array
	.syntax unified
	.arm
	.fpu softvfp
	.type	avl_tree_to_array, %function
avl_tree_to_array:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #24
	str	r0, [fp, #-24]
	ldr	r3, .L92
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	ldr	r3, [fp, #-24]
	ldr	r3, [r3, #8]
	lsl	r3, r3, #2
	mov	r0, r3
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	bne	.L88
	mov	r3, #0
	b	.L90
.L88:
	mov	r3, #0
	str	r3, [fp, #-16]
	ldr	r3, [fp, #-24]
	ldr	r3, [r3]
	sub	r2, fp, #16
	ldr	r1, [fp, #-12]
	mov	r0, r3
	bl	avl_tree_to_array_add_subtree
	ldr	r3, [fp, #-12]
.L90:
	ldr	r2, .L92
	ldr	r1, [r2]
	ldr	r2, [fp, #-8]
	eors	r1, r2, r1
	mov	r2, #0
	beq	.L91
	bl	__stack_chk_fail
.L91:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L93:
	.align	2
.L92:
	.word	.LC3
	.size	avl_tree_to_array, .-avl_tree_to_array
	.comm	test_array,512,4
	.align	2
	.global	find_subtree_height
	.syntax unified
	.arm
	.fpu softvfp
	.type	find_subtree_height, %function
find_subtree_height:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #24
	str	r0, [fp, #-24]
	ldr	r3, [fp, #-24]
	cmp	r3, #0
	bne	.L95
	mov	r3, #0
	b	.L96
.L95:
	mov	r1, #0
	ldr	r0, [fp, #-24]
	bl	avl_tree_node_child
	str	r0, [fp, #-20]
	mov	r1, #1
	ldr	r0, [fp, #-24]
	bl	avl_tree_node_child
	str	r0, [fp, #-16]
	ldr	r0, [fp, #-20]
	bl	find_subtree_height
	str	r0, [fp, #-12]
	ldr	r0, [fp, #-16]
	bl	find_subtree_height
	str	r0, [fp, #-8]
	ldr	r2, [fp, #-12]
	ldr	r3, [fp, #-8]
	cmp	r2, r3
	ble	.L97
	ldr	r3, [fp, #-12]
	add	r3, r3, #1
	b	.L96
.L97:
	ldr	r3, [fp, #-8]
	add	r3, r3, #1
.L96:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	find_subtree_height, .-find_subtree_height
	.comm	counter,4,4
	.section	.rodata
	.align	2
.LC4:
	.ascii	"the_stack_data/71456.c\000"
	.align	2
.LC5:
	.ascii	"avl_tree_node_parent(left_node) == node\000"
	.align	2
.LC6:
	.ascii	"avl_tree_node_parent(right_node) == node\000"
	.align	2
.LC7:
	.ascii	"*key > counter\000"
	.align	2
.LC8:
	.ascii	"avl_tree_subtree_height(left_node) == left_height\000"
	.align	2
.LC9:
	.ascii	"avl_tree_subtree_height(right_node) == right_height"
	.ascii	"\000"
	.align	2
.LC10:
	.ascii	"left_height - right_height < 2 && right_height - le"
	.ascii	"ft_height < 2\000"
	.text
	.align	2
	.global	validate_subtree
	.syntax unified
	.arm
	.fpu softvfp
	.type	validate_subtree, %function
validate_subtree:
	@ args = 0, pretend = 0, frame = 32
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #32
	str	r0, [fp, #-32]
	ldr	r3, [fp, #-32]
	cmp	r3, #0
	bne	.L99
	mov	r3, #0
	b	.L100
.L99:
	mov	r1, #0
	ldr	r0, [fp, #-32]
	bl	avl_tree_node_child
	str	r0, [fp, #-24]
	mov	r1, #1
	ldr	r0, [fp, #-32]
	bl	avl_tree_node_child
	str	r0, [fp, #-20]
	ldr	r3, [fp, #-24]
	cmp	r3, #0
	beq	.L101
	ldr	r0, [fp, #-24]
	bl	avl_tree_node_parent
	mov	r2, r0
	ldr	r3, [fp, #-32]
	cmp	r3, r2
	beq	.L101
	ldr	r3, .L110
	ldr	r2, .L110+4
	ldr	r1, .L110+8
	ldr	r0, .L110+12
	bl	__assert_fail
.L101:
	ldr	r3, [fp, #-20]
	cmp	r3, #0
	beq	.L102
	ldr	r0, [fp, #-20]
	bl	avl_tree_node_parent
	mov	r2, r0
	ldr	r3, [fp, #-32]
	cmp	r3, r2
	beq	.L102
	ldr	r3, .L110
	mov	r2, #932
	ldr	r1, .L110+8
	ldr	r0, .L110+16
	bl	__assert_fail
.L102:
	ldr	r0, [fp, #-24]
	bl	validate_subtree
	str	r0, [fp, #-16]
	ldr	r0, [fp, #-32]
	bl	avl_tree_node_key
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	ldr	r2, [r3]
	ldr	r3, .L110+20
	ldr	r3, [r3]
	cmp	r2, r3
	bgt	.L103
	ldr	r3, .L110
	mov	r2, #944
	ldr	r1, .L110+8
	ldr	r0, .L110+24
	bl	__assert_fail
.L103:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	ldr	r2, .L110+20
	str	r3, [r2]
	ldr	r0, [fp, #-20]
	bl	validate_subtree
	str	r0, [fp, #-8]
	ldr	r0, [fp, #-24]
	bl	avl_tree_subtree_height
	mov	r2, r0
	ldr	r3, [fp, #-16]
	cmp	r3, r2
	beq	.L104
	ldr	r3, .L110
	mov	r2, #952
	ldr	r1, .L110+8
	ldr	r0, .L110+28
	bl	__assert_fail
.L104:
	ldr	r0, [fp, #-20]
	bl	avl_tree_subtree_height
	mov	r2, r0
	ldr	r3, [fp, #-8]
	cmp	r3, r2
	beq	.L105
	ldr	r3, .L110
	ldr	r2, .L110+32
	ldr	r1, .L110+8
	ldr	r0, .L110+36
	bl	__assert_fail
.L105:
	ldr	r2, [fp, #-16]
	ldr	r3, [fp, #-8]
	sub	r3, r2, r3
	cmp	r3, #1
	bgt	.L106
	ldr	r2, [fp, #-8]
	ldr	r3, [fp, #-16]
	sub	r3, r2, r3
	cmp	r3, #1
	ble	.L109
.L106:
	ldr	r3, .L110
	ldr	r2, .L110+40
	ldr	r1, .L110+8
	ldr	r0, .L110+44
	bl	__assert_fail
.L109:
	ldr	r2, [fp, #-16]
	ldr	r3, [fp, #-8]
	cmp	r2, r3
	ble	.L108
	ldr	r3, [fp, #-16]
	add	r3, r3, #1
	b	.L100
.L108:
	ldr	r3, [fp, #-8]
	add	r3, r3, #1
.L100:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L111:
	.align	2
.L110:
	.word	__PRETTY_FUNCTION__.5342
	.word	929
	.word	.LC4
	.word	.LC5
	.word	.LC6
	.word	counter
	.word	.LC7
	.word	.LC8
	.word	953
	.word	.LC9
	.word	957
	.word	.LC10
	.size	validate_subtree, .-validate_subtree
	.section	.rodata
	.align	2
.LC11:
	.ascii	"avl_tree_subtree_height(root_node) == height\000"
	.text
	.align	2
	.global	validate_tree
	.syntax unified
	.arm
	.fpu softvfp
	.type	validate_tree, %function
validate_tree:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	ldr	r0, [fp, #-16]
	bl	avl_tree_root_node
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L113
	ldr	r0, [fp, #-12]
	bl	find_subtree_height
	str	r0, [fp, #-8]
	ldr	r0, [fp, #-12]
	bl	avl_tree_subtree_height
	mov	r2, r0
	ldr	r3, [fp, #-8]
	cmp	r3, r2
	beq	.L113
	ldr	r3, .L114
	ldr	r2, .L114+4
	ldr	r1, .L114+8
	ldr	r0, .L114+12
	bl	__assert_fail
.L113:
	ldr	r3, .L114+16
	mvn	r2, #0
	str	r2, [r3]
	ldr	r0, [fp, #-12]
	bl	validate_subtree
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L115:
	.align	2
.L114:
	.word	__PRETTY_FUNCTION__.5348
	.word	977
	.word	.LC4
	.word	.LC11
	.word	counter
	.size	validate_tree, .-validate_tree
	.align	2
	.global	create_tree
	.syntax unified
	.arm
	.fpu softvfp
	.type	create_tree, %function
create_tree:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	ldr	r0, .L120
	bl	avl_tree_new
	str	r0, [fp, #-8]
	mov	r3, #0
	str	r3, [fp, #-12]
	b	.L117
.L118:
	ldr	r1, .L120+4
	ldr	r3, [fp, #-12]
	ldr	r2, [fp, #-12]
	str	r2, [r1, r3, lsl #2]
	ldr	r3, [fp, #-12]
	lsl	r3, r3, #2
	ldr	r2, .L120+4
	add	r1, r3, r2
	ldr	r3, [fp, #-12]
	lsl	r3, r3, #2
	ldr	r2, .L120+4
	add	r3, r3, r2
	mov	r2, r3
	ldr	r0, [fp, #-8]
	bl	avl_tree_insert
	ldr	r3, [fp, #-12]
	add	r3, r3, #1
	str	r3, [fp, #-12]
.L117:
	ldr	r3, [fp, #-12]
	cmp	r3, #127
	ble	.L118
	ldr	r3, [fp, #-8]
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L121:
	.align	2
.L120:
	.word	int_compare
	.word	test_array
	.size	create_tree, .-create_tree
	.section	.rodata
	.align	2
.LC12:
	.ascii	"avl_tree_num_entries(tree) == i + 1\000"
	.align	2
.LC13:
	.ascii	"avl_tree_root_node(tree) != NULL\000"
	.align	2
.LC14:
	.ascii	"node != NULL\000"
	.align	2
.LC15:
	.ascii	"*value == i\000"
	.align	2
.LC16:
	.ascii	"avl_tree_lookup_node(tree, &i) == NULL\000"
	.align	2
.LC17:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	test_avl_tree_insert_lookup
	.syntax unified
	.arm
	.fpu softvfp
	.type	test_avl_tree_insert_lookup, %function
test_avl_tree_insert_lookup:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #24
	ldr	r3, .L135
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	ldr	r0, .L135+4
	bl	avl_tree_new
	str	r0, [fp, #-20]
	mov	r3, #0
	str	r3, [fp, #-24]
	b	.L123
.L125:
	ldr	r3, [fp, #-24]
	ldr	r2, [fp, #-24]
	ldr	r1, .L135+8
	str	r2, [r1, r3, lsl #2]
	ldr	r3, [fp, #-24]
	lsl	r3, r3, #2
	ldr	r2, .L135+8
	add	r1, r3, r2
	ldr	r3, [fp, #-24]
	lsl	r3, r3, #2
	ldr	r2, .L135+8
	add	r3, r3, r2
	mov	r2, r3
	ldr	r0, [fp, #-20]
	bl	avl_tree_insert
	ldr	r0, [fp, #-20]
	bl	avl_tree_num_entries
	mov	r2, r0
	ldr	r3, [fp, #-24]
	add	r3, r3, #1
	cmp	r2, r3
	beq	.L124
	ldr	r3, .L135+12
	ldr	r2, .L135+16
	ldr	r1, .L135+20
	ldr	r0, .L135+24
	bl	__assert_fail
.L124:
	ldr	r0, [fp, #-20]
	bl	validate_tree
	ldr	r3, [fp, #-24]
	add	r3, r3, #1
	str	r3, [fp, #-24]
.L123:
	ldr	r3, [fp, #-24]
	cmp	r3, #127
	ble	.L125
	ldr	r0, [fp, #-20]
	bl	avl_tree_root_node
	mov	r3, r0
	cmp	r3, #0
	bne	.L126
	ldr	r3, .L135+12
	ldr	r2, .L135+28
	ldr	r1, .L135+20
	ldr	r0, .L135+32
	bl	__assert_fail
.L126:
	mov	r3, #0
	str	r3, [fp, #-24]
	b	.L127
.L131:
	sub	r3, fp, #24
	mov	r1, r3
	ldr	r0, [fp, #-20]
	bl	avl_tree_lookup_node
	str	r0, [fp, #-16]
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L128
	ldr	r3, .L135+12
	ldr	r2, .L135+36
	ldr	r1, .L135+20
	ldr	r0, .L135+40
	bl	__assert_fail
.L128:
	ldr	r0, [fp, #-16]
	bl	avl_tree_node_key
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	ldr	r2, [r3]
	ldr	r3, [fp, #-24]
	cmp	r2, r3
	beq	.L129
	ldr	r3, .L135+12
	ldr	r2, .L135+44
	ldr	r1, .L135+20
	ldr	r0, .L135+48
	bl	__assert_fail
.L129:
	ldr	r0, [fp, #-16]
	bl	avl_tree_node_value
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	ldr	r2, [r3]
	ldr	r3, [fp, #-24]
	cmp	r2, r3
	beq	.L130
	ldr	r3, .L135+12
	ldr	r2, .L135+52
	ldr	r1, .L135+20
	ldr	r0, .L135+48
	bl	__assert_fail
.L130:
	ldr	r3, [fp, #-24]
	add	r3, r3, #1
	str	r3, [fp, #-24]
.L127:
	ldr	r3, [fp, #-24]
	cmp	r3, #127
	ble	.L131
	mvn	r3, #0
	str	r3, [fp, #-24]
	sub	r3, fp, #24
	mov	r1, r3
	ldr	r0, [fp, #-20]
	bl	avl_tree_lookup_node
	mov	r3, r0
	cmp	r3, #0
	beq	.L132
	ldr	r3, .L135+12
	ldr	r2, .L135+56
	ldr	r1, .L135+20
	ldr	r0, .L135+60
	bl	__assert_fail
.L132:
	mov	r3, #228
	str	r3, [fp, #-24]
	sub	r3, fp, #24
	mov	r1, r3
	ldr	r0, [fp, #-20]
	bl	avl_tree_lookup_node
	mov	r3, r0
	cmp	r3, #0
	beq	.L133
	ldr	r3, .L135+12
	ldr	r2, .L135+64
	ldr	r1, .L135+20
	ldr	r0, .L135+60
	bl	__assert_fail
.L133:
	ldr	r0, [fp, #-20]
	bl	avl_tree_free
	nop
	ldr	r3, .L135
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	eors	r2, r3, r2
	mov	r3, #0
	beq	.L134
	bl	__stack_chk_fail
.L134:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L136:
	.align	2
.L135:
	.word	.LC17
	.word	int_compare
	.word	test_array
	.word	__PRETTY_FUNCTION__.5364
	.word	1017
	.word	.LC4
	.word	.LC12
	.word	1021
	.word	.LC13
	.word	1027
	.word	.LC14
	.word	1029
	.word	.LC15
	.word	1031
	.word	1037
	.word	.LC16
	.word	1039
	.size	test_avl_tree_insert_lookup, .-test_avl_tree_insert_lookup
	.section	.rodata
	.align	2
.LC18:
	.ascii	"*p == 2\000"
	.align	2
.LC19:
	.ascii	"*p == 1\000"
	.align	2
.LC20:
	.ascii	"*p == 3\000"
	.align	2
.LC21:
	.ascii	"avl_tree_node_child(root, -1) == NULL\000"
	.align	2
.LC22:
	.ascii	"avl_tree_node_child(root, 10000) == NULL\000"
	.align	2
.LC23:
	.ascii	"avl_tree_node_child(root, 2) == NULL\000"
	.align	2
.LC24:
	.ascii	"avl_tree_node_child(root, -100000) == NULL\000"
	.align	2
.LC0:
	.word	1
	.word	2
	.word	3
	.align	2
.LC25:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	test_avl_tree_child
	.syntax unified
	.arm
	.fpu softvfp
	.type	test_avl_tree_child, %function
test_avl_tree_child:
	@ args = 0, pretend = 0, frame = 40
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #40
	ldr	r3, .L148
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	ldr	r2, .L148+4
	sub	r3, fp, #20
	ldm	r2, {r0, r1, r2}
	stm	r3, {r0, r1, r2}
	ldr	r0, .L148+8
	bl	avl_tree_new
	str	r0, [fp, #-40]
	mov	r3, #0
	str	r3, [fp, #-44]
	b	.L138
.L139:
	sub	r2, fp, #20
	ldr	r3, [fp, #-44]
	lsl	r3, r3, #2
	add	r1, r2, r3
	sub	r2, fp, #20
	ldr	r3, [fp, #-44]
	lsl	r3, r3, #2
	add	r3, r2, r3
	mov	r2, r3
	ldr	r0, [fp, #-40]
	bl	avl_tree_insert
	ldr	r3, [fp, #-44]
	add	r3, r3, #1
	str	r3, [fp, #-44]
.L138:
	ldr	r3, [fp, #-44]
	cmp	r3, #2
	ble	.L139
	ldr	r0, [fp, #-40]
	bl	avl_tree_root_node
	str	r0, [fp, #-36]
	ldr	r0, [fp, #-36]
	bl	avl_tree_node_value
	str	r0, [fp, #-32]
	ldr	r3, [fp, #-32]
	ldr	r3, [r3]
	cmp	r3, #2
	beq	.L140
	ldr	r3, .L148+12
	ldr	r2, .L148+16
	ldr	r1, .L148+20
	ldr	r0, .L148+24
	bl	__assert_fail
.L140:
	mov	r1, #0
	ldr	r0, [fp, #-36]
	bl	avl_tree_node_child
	str	r0, [fp, #-28]
	ldr	r0, [fp, #-28]
	bl	avl_tree_node_value
	str	r0, [fp, #-32]
	ldr	r3, [fp, #-32]
	ldr	r3, [r3]
	cmp	r3, #1
	beq	.L141
	ldr	r3, .L148+12
	ldr	r2, .L148+28
	ldr	r1, .L148+20
	ldr	r0, .L148+32
	bl	__assert_fail
.L141:
	mov	r1, #1
	ldr	r0, [fp, #-36]
	bl	avl_tree_node_child
	str	r0, [fp, #-24]
	ldr	r0, [fp, #-24]
	bl	avl_tree_node_value
	str	r0, [fp, #-32]
	ldr	r3, [fp, #-32]
	ldr	r3, [r3]
	cmp	r3, #3
	beq	.L142
	ldr	r3, .L148+12
	ldr	r2, .L148+36
	ldr	r1, .L148+20
	ldr	r0, .L148+40
	bl	__assert_fail
.L142:
	mvn	r1, #0
	ldr	r0, [fp, #-36]
	bl	avl_tree_node_child
	mov	r3, r0
	cmp	r3, #0
	beq	.L143
	ldr	r3, .L148+12
	ldr	r2, .L148+44
	ldr	r1, .L148+20
	ldr	r0, .L148+48
	bl	__assert_fail
.L143:
	ldr	r1, .L148+52
	ldr	r0, [fp, #-36]
	bl	avl_tree_node_child
	mov	r3, r0
	cmp	r3, #0
	beq	.L144
	ldr	r3, .L148+12
	ldr	r2, .L148+56
	ldr	r1, .L148+20
	ldr	r0, .L148+60
	bl	__assert_fail
.L144:
	mov	r1, #2
	ldr	r0, [fp, #-36]
	bl	avl_tree_node_child
	mov	r3, r0
	cmp	r3, #0
	beq	.L145
	ldr	r3, .L148+12
	ldr	r2, .L148+64
	ldr	r1, .L148+20
	ldr	r0, .L148+68
	bl	__assert_fail
.L145:
	ldr	r1, .L148+72
	ldr	r0, [fp, #-36]
	bl	avl_tree_node_child
	mov	r3, r0
	cmp	r3, #0
	beq	.L146
	ldr	r3, .L148+12
	ldr	r2, .L148+76
	ldr	r1, .L148+20
	ldr	r0, .L148+80
	bl	__assert_fail
.L146:
	ldr	r0, [fp, #-40]
	bl	avl_tree_free
	nop
	ldr	r3, .L148
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	eors	r2, r3, r2
	mov	r3, #0
	beq	.L147
	bl	__stack_chk_fail
.L147:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L149:
	.align	2
.L148:
	.word	.LC25
	.word	.LC0
	.word	int_compare
	.word	__PRETTY_FUNCTION__.5384
	.word	1067
	.word	.LC4
	.word	.LC18
	.word	1071
	.word	.LC19
	.word	1075
	.word	.LC20
	.word	1079
	.word	.LC21
	.word	10000
	.word	1080
	.word	.LC22
	.word	1081
	.word	.LC23
	.word	-100000
	.word	1082
	.word	.LC24
	.size	test_avl_tree_child, .-test_avl_tree_child
	.align	2
	.global	test_avl_tree_free
	.syntax unified
	.arm
	.fpu softvfp
	.type	test_avl_tree_free, %function
test_avl_tree_free:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	ldr	r0, .L151
	bl	avl_tree_new
	str	r0, [fp, #-8]
	ldr	r0, [fp, #-8]
	bl	avl_tree_free
	bl	create_tree
	str	r0, [fp, #-8]
	ldr	r0, [fp, #-8]
	bl	avl_tree_free
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L152:
	.align	2
.L151:
	.word	int_compare
	.size	test_avl_tree_free, .-test_avl_tree_free
	.section	.rodata
	.align	2
.LC26:
	.ascii	"value != NULL\000"
	.align	2
.LC27:
	.ascii	"avl_tree_lookup(tree, &i) == NULL\000"
	.align	2
.LC28:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	test_avl_tree_lookup
	.syntax unified
	.arm
	.fpu softvfp
	.type	test_avl_tree_lookup, %function
test_avl_tree_lookup:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	ldr	r3, .L162
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	bl	create_tree
	str	r0, [fp, #-16]
	mov	r3, #0
	str	r3, [fp, #-20]
	b	.L154
.L157:
	sub	r3, fp, #20
	mov	r1, r3
	ldr	r0, [fp, #-16]
	bl	avl_tree_lookup
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	bne	.L155
	ldr	r3, .L162+4
	ldr	r2, .L162+8
	ldr	r1, .L162+12
	ldr	r0, .L162+16
	bl	__assert_fail
.L155:
	ldr	r3, [fp, #-12]
	ldr	r2, [r3]
	ldr	r3, [fp, #-20]
	cmp	r2, r3
	beq	.L156
	ldr	r3, .L162+4
	ldr	r2, .L162+20
	ldr	r1, .L162+12
	ldr	r0, .L162+24
	bl	__assert_fail
.L156:
	ldr	r3, [fp, #-20]
	add	r3, r3, #1
	str	r3, [fp, #-20]
.L154:
	ldr	r3, [fp, #-20]
	cmp	r3, #127
	ble	.L157
	mvn	r3, #0
	str	r3, [fp, #-20]
	sub	r3, fp, #20
	mov	r1, r3
	ldr	r0, [fp, #-16]
	bl	avl_tree_lookup
	mov	r3, r0
	cmp	r3, #0
	beq	.L158
	ldr	r3, .L162+4
	ldr	r2, .L162+28
	ldr	r1, .L162+12
	ldr	r0, .L162+32
	bl	__assert_fail
.L158:
	mov	r3, #129
	str	r3, [fp, #-20]
	sub	r3, fp, #20
	mov	r1, r3
	ldr	r0, [fp, #-16]
	bl	avl_tree_lookup
	mov	r3, r0
	cmp	r3, #0
	beq	.L159
	ldr	r3, .L162+4
	ldr	r2, .L162+36
	ldr	r1, .L162+12
	ldr	r0, .L162+32
	bl	__assert_fail
.L159:
	ldr	r3, .L162+40
	str	r3, [fp, #-20]
	sub	r3, fp, #20
	mov	r1, r3
	ldr	r0, [fp, #-16]
	bl	avl_tree_lookup
	mov	r3, r0
	cmp	r3, #0
	beq	.L160
	ldr	r3, .L162+4
	ldr	r2, .L162+44
	ldr	r1, .L162+12
	ldr	r0, .L162+32
	bl	__assert_fail
.L160:
	ldr	r0, [fp, #-16]
	bl	avl_tree_free
	nop
	ldr	r3, .L162
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	eors	r2, r3, r2
	mov	r3, #0
	beq	.L161
	bl	__stack_chk_fail
.L161:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L163:
	.align	2
.L162:
	.word	.LC28
	.word	__PRETTY_FUNCTION__.5395
	.word	1115
	.word	.LC4
	.word	.LC26
	.word	1116
	.word	.LC15
	.word	1122
	.word	.LC27
	.word	1124
	.word	8724897
	.word	1126
	.size	test_avl_tree_lookup, .-test_avl_tree_lookup
	.section	.rodata
	.align	2
.LC29:
	.ascii	"avl_tree_remove(tree, &i) == 0\000"
	.align	2
.LC30:
	.ascii	"avl_tree_remove(tree, &value) != 0\000"
	.align	2
.LC31:
	.ascii	"avl_tree_num_entries(tree) == expected_entries\000"
	.align	2
.LC32:
	.ascii	"avl_tree_root_node(tree) == NULL\000"
	.align	2
.LC33:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	test_avl_tree_remove
	.syntax unified
	.arm
	.fpu softvfp
	.type	test_avl_tree_remove, %function
test_avl_tree_remove:
	@ args = 0, pretend = 0, frame = 32
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #32
	ldr	r3, .L177
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	bl	create_tree
	str	r0, [fp, #-12]
	mov	r3, #228
	str	r3, [fp, #-36]
	sub	r3, fp, #36
	mov	r1, r3
	ldr	r0, [fp, #-12]
	bl	avl_tree_remove
	mov	r3, r0
	cmp	r3, #0
	beq	.L165
	ldr	r3, .L177+4
	ldr	r2, .L177+8
	ldr	r1, .L177+12
	ldr	r0, .L177+16
	bl	__assert_fail
.L165:
	mvn	r3, #0
	str	r3, [fp, #-36]
	sub	r3, fp, #36
	mov	r1, r3
	ldr	r0, [fp, #-12]
	bl	avl_tree_remove
	mov	r3, r0
	cmp	r3, #0
	beq	.L166
	ldr	r3, .L177+4
	ldr	r2, .L177+20
	ldr	r1, .L177+12
	ldr	r0, .L177+16
	bl	__assert_fail
.L166:
	mov	r3, #128
	str	r3, [fp, #-16]
	mov	r3, #0
	str	r3, [fp, #-28]
	b	.L167
.L174:
	mov	r3, #0
	str	r3, [fp, #-24]
	b	.L168
.L173:
	mov	r3, #0
	str	r3, [fp, #-20]
	b	.L169
.L172:
	ldr	r3, [fp, #-20]
	lsl	r2, r3, #2
	ldr	r3, [fp, #-24]
	rsb	r3, r3, #3
	add	r3, r2, r3
	lsl	r2, r3, #2
	ldr	r3, [fp, #-28]
	add	r3, r2, r3
	str	r3, [fp, #-32]
	sub	r3, fp, #32
	mov	r1, r3
	ldr	r0, [fp, #-12]
	bl	avl_tree_remove
	mov	r3, r0
	cmp	r3, #0
	bne	.L170
	ldr	r3, .L177+4
	ldr	r2, .L177+24
	ldr	r1, .L177+12
	ldr	r0, .L177+28
	bl	__assert_fail
.L170:
	ldr	r0, [fp, #-12]
	bl	validate_tree
	ldr	r3, [fp, #-16]
	sub	r3, r3, #1
	str	r3, [fp, #-16]
	ldr	r0, [fp, #-12]
	bl	avl_tree_num_entries
	mov	r2, r0
	ldr	r3, [fp, #-16]
	cmp	r3, r2
	beq	.L171
	ldr	r3, .L177+4
	ldr	r2, .L177+32
	ldr	r1, .L177+12
	ldr	r0, .L177+36
	bl	__assert_fail
.L171:
	ldr	r3, [fp, #-20]
	add	r3, r3, #1
	str	r3, [fp, #-20]
.L169:
	ldr	r3, [fp, #-20]
	cmp	r3, #7
	ble	.L172
	ldr	r3, [fp, #-24]
	add	r3, r3, #1
	str	r3, [fp, #-24]
.L168:
	ldr	r3, [fp, #-24]
	cmp	r3, #3
	ble	.L173
	ldr	r3, [fp, #-28]
	add	r3, r3, #1
	str	r3, [fp, #-28]
.L167:
	ldr	r3, [fp, #-28]
	cmp	r3, #3
	ble	.L174
	ldr	r0, [fp, #-12]
	bl	avl_tree_root_node
	mov	r3, r0
	cmp	r3, #0
	beq	.L175
	ldr	r3, .L177+4
	ldr	r2, .L177+40
	ldr	r1, .L177+12
	ldr	r0, .L177+44
	bl	__assert_fail
.L175:
	ldr	r0, [fp, #-12]
	bl	avl_tree_free
	nop
	ldr	r3, .L177
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	eors	r2, r3, r2
	mov	r3, #0
	beq	.L176
	bl	__stack_chk_fail
.L176:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L178:
	.align	2
.L177:
	.word	.LC33
	.word	__PRETTY_FUNCTION__.5409
	.word	1144
	.word	.LC4
	.word	.LC29
	.word	1146
	.word	1159
	.word	.LC30
	.word	1162
	.word	.LC31
	.word	1170
	.word	.LC32
	.size	test_avl_tree_remove, .-test_avl_tree_remove
	.section	.rodata
	.align	2
.LC34:
	.ascii	"avl_tree_num_entries(tree) == num_entries\000"
	.align	2
.LC35:
	.ascii	"*array[i] == sorted[i]\000"
	.align	2
.LC1:
	.word	89
	.word	23
	.word	42
	.word	4
	.word	16
	.word	15
	.word	8
	.word	99
	.word	50
	.word	30
	.align	2
.LC2:
	.word	4
	.word	8
	.word	15
	.word	16
	.word	23
	.word	30
	.word	42
	.word	50
	.word	89
	.word	99
	.align	2
.LC36:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	test_avl_tree_to_array
	.syntax unified
	.arm
	.fpu softvfp
	.type	test_avl_tree_to_array, %function
test_avl_tree_to_array:
	@ args = 0, pretend = 0, frame = 104
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #104
	ldr	r3, .L187
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	ldr	r3, .L187+4
	sub	ip, fp, #88
	mov	lr, r3
	ldmia	lr!, {r0, r1, r2, r3}
	stmia	ip!, {r0, r1, r2, r3}
	ldmia	lr!, {r0, r1, r2, r3}
	stmia	ip!, {r0, r1, r2, r3}
	ldm	lr, {r0, r1}
	stm	ip, {r0, r1}
	ldr	r3, .L187+8
	sub	ip, fp, #48
	mov	lr, r3
	ldmia	lr!, {r0, r1, r2, r3}
	stmia	ip!, {r0, r1, r2, r3}
	ldmia	lr!, {r0, r1, r2, r3}
	stmia	ip!, {r0, r1, r2, r3}
	ldm	lr, {r0, r1}
	stm	ip, {r0, r1}
	mov	r3, #10
	str	r3, [fp, #-100]
	ldr	r0, .L187+12
	bl	avl_tree_new
	str	r0, [fp, #-96]
	mov	r3, #0
	str	r3, [fp, #-104]
	b	.L180
.L181:
	sub	r2, fp, #88
	ldr	r3, [fp, #-104]
	lsl	r3, r3, #2
	add	r3, r2, r3
	mov	r2, #0
	mov	r1, r3
	ldr	r0, [fp, #-96]
	bl	avl_tree_insert
	ldr	r3, [fp, #-104]
	add	r3, r3, #1
	str	r3, [fp, #-104]
.L180:
	ldr	r2, [fp, #-104]
	ldr	r3, [fp, #-100]
	cmp	r2, r3
	blt	.L181
	ldr	r0, [fp, #-96]
	bl	avl_tree_num_entries
	mov	r2, r0
	ldr	r3, [fp, #-100]
	cmp	r3, r2
	beq	.L182
	ldr	r3, .L187+16
	ldr	r2, .L187+20
	ldr	r1, .L187+24
	ldr	r0, .L187+28
	bl	__assert_fail
.L182:
	ldr	r0, [fp, #-96]
	bl	avl_tree_to_array
	str	r0, [fp, #-92]
	mov	r3, #0
	str	r3, [fp, #-104]
	b	.L183
.L185:
	ldr	r3, [fp, #-104]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-92]
	add	r3, r2, r3
	ldr	r3, [r3]
	ldr	r2, [r3]
	ldr	r3, [fp, #-104]
	lsl	r3, r3, #2
	sub	r1, fp, #4
	add	r3, r1, r3
	ldr	r3, [r3, #-44]
	cmp	r2, r3
	beq	.L184
	ldr	r3, .L187+16
	ldr	r2, .L187+32
	ldr	r1, .L187+24
	ldr	r0, .L187+36
	bl	__assert_fail
.L184:
	ldr	r3, [fp, #-104]
	add	r3, r3, #1
	str	r3, [fp, #-104]
.L183:
	ldr	r2, [fp, #-104]
	ldr	r3, [fp, #-100]
	cmp	r2, r3
	blt	.L185
	ldr	r0, [fp, #-92]
	bl	free
	nop
	ldr	r3, .L187
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	eors	r2, r3, r2
	mov	r3, #0
	beq	.L186
	bl	__stack_chk_fail
.L186:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L188:
	.align	2
.L187:
	.word	.LC36
	.word	.LC1
	.word	.LC2
	.word	int_compare
	.word	__PRETTY_FUNCTION__.5431
	.word	1192
	.word	.LC4
	.word	.LC34
	.word	1199
	.word	.LC35
	.size	test_avl_tree_to_array, .-test_avl_tree_to_array
	.align	2
	.global	int_compare
	.syntax unified
	.arm
	.fpu softvfp
	.type	int_compare, %function
int_compare:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #20
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-20]
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-12]
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	cmp	r2, r3
	bge	.L190
	mvn	r3, #0
	b	.L191
.L190:
	ldr	r3, [fp, #-12]
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	cmp	r2, r3
	ble	.L192
	mov	r3, #1
	b	.L191
.L192:
	mov	r3, #0
.L191:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	int_compare, .-int_compare
	.section	.rodata
	.align	2
.LC37:
	.ascii	"PASS\000"
	.text
	.align	2
	.global	main
	.syntax unified
	.arm
	.fpu softvfp
	.type	main, %function
main:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	str	r0, [fp, #-8]
	str	r1, [fp, #-12]
	bl	test_avl_tree_free
	bl	test_avl_tree_child
	bl	test_avl_tree_insert_lookup
	bl	test_avl_tree_lookup
	bl	test_avl_tree_remove
	bl	test_avl_tree_to_array
	ldr	r0, .L195
	bl	puts
	mov	r3, #0
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L196:
	.align	2
.L195:
	.word	.LC37
	.size	main, .-main
	.section	.rodata
	.align	2
	.type	__PRETTY_FUNCTION__.5342, %object
	.size	__PRETTY_FUNCTION__.5342, 17
__PRETTY_FUNCTION__.5342:
	.ascii	"validate_subtree\000"
	.align	2
	.type	__PRETTY_FUNCTION__.5348, %object
	.size	__PRETTY_FUNCTION__.5348, 14
__PRETTY_FUNCTION__.5348:
	.ascii	"validate_tree\000"
	.align	2
	.type	__PRETTY_FUNCTION__.5364, %object
	.size	__PRETTY_FUNCTION__.5364, 28
__PRETTY_FUNCTION__.5364:
	.ascii	"test_avl_tree_insert_lookup\000"
	.align	2
	.type	__PRETTY_FUNCTION__.5384, %object
	.size	__PRETTY_FUNCTION__.5384, 20
__PRETTY_FUNCTION__.5384:
	.ascii	"test_avl_tree_child\000"
	.align	2
	.type	__PRETTY_FUNCTION__.5395, %object
	.size	__PRETTY_FUNCTION__.5395, 21
__PRETTY_FUNCTION__.5395:
	.ascii	"test_avl_tree_lookup\000"
	.align	2
	.type	__PRETTY_FUNCTION__.5409, %object
	.size	__PRETTY_FUNCTION__.5409, 21
__PRETTY_FUNCTION__.5409:
	.ascii	"test_avl_tree_remove\000"
	.align	2
	.type	__PRETTY_FUNCTION__.5431, %object
	.size	__PRETTY_FUNCTION__.5431, 23
__PRETTY_FUNCTION__.5431:
	.ascii	"test_avl_tree_to_array\000"
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
