	.file	"70450514.c"
	.intel_syntax noprefix
	.text
	.globl	make_treenode
	.type	make_treenode, @function
make_treenode:
.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	DWORD PTR -20[rbp], edi
	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	edx, DWORD PTR -20[rbp]
	mov	DWORD PTR [rax], edx
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR 8[rax], 0
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rax], 0
	mov	rax, QWORD PTR -8[rbp]
.L3:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE6:
	.size	make_treenode, .-make_treenode
	.globl	insert_into_binary_search_tree
	.type	insert_into_binary_search_tree, @function
insert_into_binary_search_tree:
.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, 48
	mov	QWORD PTR -40[rbp], rdi
	mov	DWORD PTR -44[rbp], esi
	mov	QWORD PTR -8[rbp], 0
	cmp	QWORD PTR -40[rbp], 0
	je	.L14
	mov	eax, DWORD PTR -44[rbp]
	mov	edi, eax
	call	make_treenode
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	je	.L15
	mov	rax, QWORD PTR -40[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L8
	mov	rax, QWORD PTR -40[rbp]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], rdx
	jmp	.L4
.L8:
	mov	rax, QWORD PTR -40[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -24[rbp], rax
	mov	QWORD PTR -16[rbp], 0
	jmp	.L9
.L11:
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -44[rbp], eax
	jge	.L10
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -24[rbp], rax
	jmp	.L9
.L10:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -24[rbp], rax
.L9:
	cmp	QWORD PTR -24[rbp], 0
	jne	.L11
	cmp	QWORD PTR -16[rbp], 0
	je	.L12
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -44[rbp], eax
	jge	.L13
	mov	rax, QWORD PTR -16[rbp]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 8[rax], rdx
	jmp	.L4
.L13:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rax], rdx
	jmp	.L4
.L12:
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	free@PLT
	jmp	.L4
.L14:
	nop
	jmp	.L4
.L15:
	nop
.L4:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE7:
	.size	insert_into_binary_search_tree, .-insert_into_binary_search_tree
	.globl	get_maximum_val_binary_search_tree
	.type	get_maximum_val_binary_search_tree, @function
get_maximum_val_binary_search_tree:
.LFB8:
	.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
	cmp	QWORD PTR -24[rbp], 0
	jne	.L17
	mov	eax, 0
	jmp	.L18
.L17:
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L19
.L20:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -8[rbp], rax
.L19:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	jne	.L20
	mov	rax, QWORD PTR -8[rbp]
.L18:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE8:
	.size	get_maximum_val_binary_search_tree, .-get_maximum_val_binary_search_tree
	.globl	find_node_for_value_binary_search_tree
	.type	find_node_for_value_binary_search_tree, @function
find_node_for_value_binary_search_tree:
.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 -24[rbp], rdi
	mov	DWORD PTR -28[rbp], esi
	cmp	QWORD PTR -24[rbp], 0
	jne	.L22
	mov	eax, 0
	jmp	.L23
.L22:
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L24
.L28:
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -28[rbp], eax
	je	.L29
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -28[rbp], eax
	jge	.L27
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L24
.L27:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -8[rbp], rax
.L24:
	cmp	QWORD PTR -8[rbp], 0
	jne	.L28
	jmp	.L26
.L29:
	nop
.L26:
	mov	rax, QWORD PTR -8[rbp]
.L23:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE9:
	.size	find_node_for_value_binary_search_tree, .-find_node_for_value_binary_search_tree
	.globl	get_predecessor_binary_search_tree
	.type	get_predecessor_binary_search_tree, @function
get_predecessor_binary_search_tree:
.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, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	DWORD PTR -28[rbp], esi
	mov	QWORD PTR -8[rbp], 0
	mov	QWORD PTR -16[rbp], 0
	cmp	QWORD PTR -24[rbp], 0
	jne	.L31
	mov	eax, 0
	jmp	.L32
.L31:
	mov	edx, DWORD PTR -28[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	esi, edx
	mov	rdi, rax
	call	find_node_for_value_binary_search_tree
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L33
	mov	eax, 0
	jmp	.L32
.L33:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L34
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdi, rax
	call	get_maximum_val_binary_search_tree
	mov	QWORD PTR -16[rbp], rax
	jmp	.L35
.L34:
	mov	QWORD PTR -16[rbp], 0
	jmp	.L36
.L39:
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -28[rbp], eax
	jge	.L37
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -24[rbp], rax
	jmp	.L36
.L37:
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -28[rbp], eax
	jle	.L40
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -24[rbp], rax
.L36:
	cmp	QWORD PTR -24[rbp], 0
	jne	.L39
	jmp	.L35
.L40:
	nop
.L35:
	mov	rax, QWORD PTR -16[rbp]
.L32:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE10:
	.size	get_predecessor_binary_search_tree, .-get_predecessor_binary_search_tree
	.section	.rodata
.LC0:
	.string	"the_stack_data/70450514.c"
	.align 8
.LC1:
	.string	"NULL == get_predecessor_binary_search_tree(root0, 10)"
	.align 8
.LC2:
	.string	"NULL == get_predecessor_binary_search_tree(root1, 10)"
	.align 8
.LC3:
	.string	"(NULL != predecessor_node2) && (170 == predecessor_node2->data)"
.LC4:
	.string	"NULL == predecessor_node2"
	.align 8
.LC5:
	.string	"(NULL != predecessor_node2) && (90 == predecessor_node2->data)"
	.align 8
.LC6:
	.string	"(NULL != predecessor_node2) && (40 == predecessor_node2->data)"
	.align 8
.LC7:
	.string	"NULL == get_predecessor_binary_search_tree(root3, 10)"
	.text
	.globl	main
	.type	main, @function
main:
.LFB11:
	.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
	mov	QWORD PTR -24[rbp], 0
	mov	rax, QWORD PTR -24[rbp]
	mov	esi, 10
	mov	rdi, rax
	call	get_predecessor_binary_search_tree
	test	rax, rax
	je	.L42
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 313
	lea	rsi, .LC0[rip]
	lea	rdi, .LC1[rip]
	call	__assert_fail@PLT
.L42:
	mov	QWORD PTR -48[rbp], 0
	lea	rax, -48[rbp]
	mov	esi, 10
	mov	rdi, rax
	call	insert_into_binary_search_tree
	mov	rax, QWORD PTR -48[rbp]
	mov	esi, 10
	mov	rdi, rax
	call	get_predecessor_binary_search_tree
	test	rax, rax
	je	.L43
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 321
	lea	rsi, .LC0[rip]
	lea	rdi, .LC2[rip]
	call	__assert_fail@PLT
.L43:
	mov	QWORD PTR -40[rbp], 0
	mov	QWORD PTR -16[rbp], 0
	lea	rax, -40[rbp]
	mov	esi, 100
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 70
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 40
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 90
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 50
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 60
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 170
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 140
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 190
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 150
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -40[rbp]
	mov	esi, 160
	mov	rdi, rax
	call	insert_into_binary_search_tree
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, 190
	mov	rdi, rax
	call	get_predecessor_binary_search_tree
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -16[rbp], 0
	je	.L44
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	eax, 170
	je	.L54
.L44:
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 349
	lea	rsi, .LC0[rip]
	lea	rdi, .LC3[rip]
	call	__assert_fail@PLT
.L54:
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, 40
	mov	rdi, rax
	call	get_predecessor_binary_search_tree
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -16[rbp], 0
	je	.L46
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 351
	lea	rsi, .LC0[rip]
	lea	rdi, .LC4[rip]
	call	__assert_fail@PLT
.L46:
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, 100
	mov	rdi, rax
	call	get_predecessor_binary_search_tree
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -16[rbp], 0
	je	.L47
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	eax, 90
	je	.L55
.L47:
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 353
	lea	rsi, .LC0[rip]
	lea	rdi, .LC5[rip]
	call	__assert_fail@PLT
.L55:
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, 50
	mov	rdi, rax
	call	get_predecessor_binary_search_tree
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -16[rbp], 0
	je	.L49
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	eax, 40
	je	.L56
.L49:
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 355
	lea	rsi, .LC0[rip]
	lea	rdi, .LC6[rip]
	call	__assert_fail@PLT
.L56:
	mov	QWORD PTR -32[rbp], 0
	lea	rax, -32[rbp]
	mov	esi, 100
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -32[rbp]
	mov	esi, 50
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -32[rbp]
	mov	esi, 40
	mov	rdi, rax
	call	insert_into_binary_search_tree
	lea	rax, -32[rbp]
	mov	esi, 70
	mov	rdi, rax
	call	insert_into_binary_search_tree
	mov	rax, QWORD PTR -32[rbp]
	mov	esi, 10
	mov	rdi, rax
	call	get_predecessor_binary_search_tree
	test	rax, rax
	je	.L51
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 367
	lea	rsi, .LC0[rip]
	lea	rdi, .LC7[rip]
	call	__assert_fail@PLT
.L51:
	mov	eax, 0
	mov	rdx, QWORD PTR -8[rbp]
	sub	rdx, QWORD PTR fs:40
	je	.L53
	call	__stack_chk_fail@PLT
.L53:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE11:
	.size	main, .-main
	.section	.rodata
	.type	__PRETTY_FUNCTION__.0, @object
	.size	__PRETTY_FUNCTION__.0, 5
__PRETTY_FUNCTION__.0:
	.string	"main"
	.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	"70450514.c"
	.text
	.align	2
	.global	make_treenode
	.syntax unified
	.arm
	.fpu softvfp
	.type	make_treenode, %function
make_treenode:
	@ 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]
	ldr	r2, [fp, #-16]
	str	r2, [r3]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	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	make_treenode, .-make_treenode
	.align	2
	.global	insert_into_binary_search_tree
	.syntax unified
	.arm
	.fpu softvfp
	.type	insert_into_binary_search_tree, %function
insert_into_binary_search_tree:
	@ 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]
	mov	r3, #0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-24]
	cmp	r3, #0
	beq	.L14
	ldr	r0, [fp, #-28]
	bl	make_treenode
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	beq	.L15
	ldr	r3, [fp, #-24]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L8
	ldr	r3, [fp, #-24]
	ldr	r2, [fp, #-8]
	str	r2, [r3]
	b	.L4
.L8:
	ldr	r3, [fp, #-24]
	ldr	r3, [r3]
	str	r3, [fp, #-16]
	mov	r3, #0
	str	r3, [fp, #-12]
	b	.L9
.L11:
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	ldr	r2, [fp, #-28]
	cmp	r2, r3
	bge	.L10
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-16]
	b	.L9
.L10:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-16]
.L9:
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L11
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L12
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	ldr	r2, [fp, #-28]
	cmp	r2, r3
	bge	.L13
	ldr	r3, [fp, #-12]
	ldr	r2, [fp, #-8]
	str	r2, [r3, #4]
	b	.L4
.L13:
	ldr	r3, [fp, #-12]
	ldr	r2, [fp, #-8]
	str	r2, [r3, #8]
	b	.L4
.L12:
	ldr	r0, [fp, #-8]
	bl	free
	b	.L4
.L14:
	nop
	b	.L4
.L15:
	nop
.L4:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	insert_into_binary_search_tree, .-insert_into_binary_search_tree
	.align	2
	.global	get_maximum_val_binary_search_tree
	.syntax unified
	.arm
	.fpu softvfp
	.type	get_maximum_val_binary_search_tree, %function
get_maximum_val_binary_search_tree:
	@ 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]
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L17
	mov	r3, #0
	b	.L18
.L17:
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-8]
	b	.L19
.L20:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-8]
.L19:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	bne	.L20
	ldr	r3, [fp, #-8]
.L18:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	get_maximum_val_binary_search_tree, .-get_maximum_val_binary_search_tree
	.align	2
	.global	find_node_for_value_binary_search_tree
	.syntax unified
	.arm
	.fpu softvfp
	.type	find_node_for_value_binary_search_tree, %function
find_node_for_value_binary_search_tree:
	@ 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]
	cmp	r3, #0
	bne	.L22
	mov	r3, #0
	b	.L23
.L22:
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-8]
	b	.L24
.L28:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	cmp	r2, r3
	beq	.L29
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	cmp	r2, r3
	bge	.L27
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-8]
	b	.L24
.L27:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-8]
.L24:
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L28
	b	.L26
.L29:
	nop
.L26:
	ldr	r3, [fp, #-8]
.L23:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	find_node_for_value_binary_search_tree, .-find_node_for_value_binary_search_tree
	.align	2
	.global	get_predecessor_binary_search_tree
	.syntax unified
	.arm
	.fpu softvfp
	.type	get_predecessor_binary_search_tree, %function
get_predecessor_binary_search_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]
	str	r1, [fp, #-20]
	mov	r3, #0
	str	r3, [fp, #-8]
	mov	r3, #0
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L31
	mov	r3, #0
	b	.L32
.L31:
	ldr	r1, [fp, #-20]
	ldr	r0, [fp, #-16]
	bl	find_node_for_value_binary_search_tree
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L33
	mov	r3, #0
	b	.L32
.L33:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L34
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	mov	r0, r3
	bl	get_maximum_val_binary_search_tree
	str	r0, [fp, #-12]
	b	.L35
.L34:
	mov	r3, #0
	str	r3, [fp, #-12]
	b	.L36
.L39:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	cmp	r2, r3
	bge	.L37
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-16]
	b	.L36
.L37:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	cmp	r2, r3
	ble	.L40
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-16]
.L36:
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L39
	b	.L35
.L40:
	nop
.L35:
	ldr	r3, [fp, #-12]
.L32:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	get_predecessor_binary_search_tree, .-get_predecessor_binary_search_tree
	.section	.rodata
	.align	2
.LC0:
	.ascii	"the_stack_data/70450514.c\000"
	.align	2
.LC1:
	.ascii	"NULL == get_predecessor_binary_search_tree(root0, 1"
	.ascii	"0)\000"
	.align	2
.LC2:
	.ascii	"NULL == get_predecessor_binary_search_tree(root1, 1"
	.ascii	"0)\000"
	.align	2
.LC3:
	.ascii	"(NULL != predecessor_node2) && (170 == predecessor_"
	.ascii	"node2->data)\000"
	.align	2
.LC4:
	.ascii	"NULL == predecessor_node2\000"
	.align	2
.LC5:
	.ascii	"(NULL != predecessor_node2) && (90 == predecessor_n"
	.ascii	"ode2->data)\000"
	.align	2
.LC6:
	.ascii	"(NULL != predecessor_node2) && (40 == predecessor_n"
	.ascii	"ode2->data)\000"
	.align	2
.LC7:
	.ascii	"NULL == get_predecessor_binary_search_tree(root3, 1"
	.ascii	"0)\000"
	.align	2
.LC8:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	main
	.syntax unified
	.arm
	.fpu softvfp
	.type	main, %function
main:
	@ 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, .L57
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	mov	r3, #0
	str	r3, [fp, #-16]
	mov	r1, #10
	ldr	r0, [fp, #-16]
	bl	get_predecessor_binary_search_tree
	mov	r3, r0
	cmp	r3, #0
	beq	.L42
	ldr	r3, .L57+4
	ldr	r2, .L57+8
	ldr	r1, .L57+12
	ldr	r0, .L57+16
	bl	__assert_fail
.L42:
	mov	r3, #0
	str	r3, [fp, #-28]
	sub	r3, fp, #28
	mov	r1, #10
	mov	r0, r3
	bl	insert_into_binary_search_tree
	ldr	r3, [fp, #-28]
	mov	r1, #10
	mov	r0, r3
	bl	get_predecessor_binary_search_tree
	mov	r3, r0
	cmp	r3, #0
	beq	.L43
	ldr	r3, .L57+4
	ldr	r2, .L57+20
	ldr	r1, .L57+12
	ldr	r0, .L57+24
	bl	__assert_fail
.L43:
	mov	r3, #0
	str	r3, [fp, #-24]
	mov	r3, #0
	str	r3, [fp, #-12]
	sub	r3, fp, #24
	mov	r1, #100
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #70
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #40
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #90
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #50
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #60
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #170
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #140
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #190
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #150
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #24
	mov	r1, #160
	mov	r0, r3
	bl	insert_into_binary_search_tree
	ldr	r3, [fp, #-24]
	mov	r1, #190
	mov	r0, r3
	bl	get_predecessor_binary_search_tree
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L44
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	cmp	r3, #170
	beq	.L54
.L44:
	ldr	r3, .L57+4
	ldr	r2, .L57+28
	ldr	r1, .L57+12
	ldr	r0, .L57+32
	bl	__assert_fail
.L54:
	ldr	r3, [fp, #-24]
	mov	r1, #40
	mov	r0, r3
	bl	get_predecessor_binary_search_tree
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L46
	ldr	r3, .L57+4
	ldr	r2, .L57+36
	ldr	r1, .L57+12
	ldr	r0, .L57+40
	bl	__assert_fail
.L46:
	ldr	r3, [fp, #-24]
	mov	r1, #100
	mov	r0, r3
	bl	get_predecessor_binary_search_tree
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L47
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	cmp	r3, #90
	beq	.L55
.L47:
	ldr	r3, .L57+4
	ldr	r2, .L57+44
	ldr	r1, .L57+12
	ldr	r0, .L57+48
	bl	__assert_fail
.L55:
	ldr	r3, [fp, #-24]
	mov	r1, #50
	mov	r0, r3
	bl	get_predecessor_binary_search_tree
	str	r0, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L49
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	cmp	r3, #40
	beq	.L56
.L49:
	ldr	r3, .L57+4
	ldr	r2, .L57+52
	ldr	r1, .L57+12
	ldr	r0, .L57+56
	bl	__assert_fail
.L56:
	mov	r3, #0
	str	r3, [fp, #-20]
	sub	r3, fp, #20
	mov	r1, #100
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #20
	mov	r1, #50
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #20
	mov	r1, #40
	mov	r0, r3
	bl	insert_into_binary_search_tree
	sub	r3, fp, #20
	mov	r1, #70
	mov	r0, r3
	bl	insert_into_binary_search_tree
	ldr	r3, [fp, #-20]
	mov	r1, #10
	mov	r0, r3
	bl	get_predecessor_binary_search_tree
	mov	r3, r0
	cmp	r3, #0
	beq	.L51
	ldr	r3, .L57+4
	ldr	r2, .L57+60
	ldr	r1, .L57+12
	ldr	r0, .L57+64
	bl	__assert_fail
.L51:
	mov	r3, #0
	ldr	r2, .L57
	ldr	r1, [r2]
	ldr	r2, [fp, #-8]
	eors	r1, r2, r1
	mov	r2, #0
	beq	.L53
	bl	__stack_chk_fail
.L53:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L58:
	.align	2
.L57:
	.word	.LC8
	.word	__PRETTY_FUNCTION__.5174
	.word	313
	.word	.LC0
	.word	.LC1
	.word	321
	.word	.LC2
	.word	349
	.word	.LC3
	.word	351
	.word	.LC4
	.word	353
	.word	.LC5
	.word	355
	.word	.LC6
	.word	367
	.word	.LC7
	.size	main, .-main
	.section	.rodata
	.align	2
	.type	__PRETTY_FUNCTION__.5174, %object
	.size	__PRETTY_FUNCTION__.5174, 5
__PRETTY_FUNCTION__.5174:
	.ascii	"main\000"
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
