	.file	"90765494.c"
	.intel_syntax noprefix
	.text
	.globl	fibonacciIterative
	.type	fibonacciIterative, @function
fibonacciIterative:
.LFB0:
	.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 -40[rbp], rdi
	cmp	QWORD PTR -40[rbp], 0
	jns	.L2
	mov	rax, -1
	jmp	.L3
.L2:
	cmp	QWORD PTR -40[rbp], 0
	jne	.L4
	mov	eax, 0
	jmp	.L3
.L4:
	cmp	QWORD PTR -40[rbp], 2
	jg	.L5
	mov	eax, 1
	jmp	.L3
.L5:
	mov	QWORD PTR -24[rbp], 1
	mov	QWORD PTR -16[rbp], 1
	mov	QWORD PTR -8[rbp], 0
	mov	DWORD PTR -28[rbp], 0
	jmp	.L6
.L7:
	mov	rdx, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR -16[rbp]
	add	rax, rdx
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR -24[rbp], rax
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR -16[rbp], rax
	add	DWORD PTR -28[rbp], 1
.L6:
	mov	eax, DWORD PTR -28[rbp]
	cdqe
	mov	rdx, QWORD PTR -40[rbp]
	sub	rdx, 2
	cmp	rax, rdx
	jl	.L7
	mov	rax, QWORD PTR -8[rbp]
.L3:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE0:
	.size	fibonacciIterative, .-fibonacciIterative
	.globl	testIterative
	.type	testIterative, @function
testIterative:
.LFB1:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	edi, 0
	call	fibonacciIterative
	test	rax, rax
	jne	.L9
	mov	edi, 42
	call	fibonacciIterative
	cmp	rax, 267914296
	jne	.L9
	mov	edi, 23
	call	fibonacciIterative
	cmp	rax, 28657
	jne	.L9
	mov	rdi, -33
	call	fibonacciIterative
	cmp	rax, -1
	jne	.L9
	mov	eax, 1
	jmp	.L11
.L9:
	mov	eax, 0
.L11:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE1:
	.size	testIterative, .-testIterative
	.globl	fibonacciRecursive
	.type	fibonacciRecursive, @function
fibonacciRecursive:
.LFB2:
	.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, 24
	.cfi_offset 3, -24
	mov	QWORD PTR -24[rbp], rdi
	cmp	QWORD PTR -24[rbp], 0
	jns	.L13
	mov	rax, -1
	jmp	.L14
.L13:
	cmp	QWORD PTR -24[rbp], 0
	jne	.L15
	mov	eax, 0
	jmp	.L14
.L15:
	cmp	QWORD PTR -24[rbp], 2
	jg	.L16
	mov	eax, 1
	jmp	.L14
.L16:
	mov	rax, QWORD PTR -24[rbp]
	sub	rax, 1
	mov	rdi, rax
	call	fibonacciRecursive
	mov	rbx, rax
	mov	rax, QWORD PTR -24[rbp]
	sub	rax, 2
	mov	rdi, rax
	call	fibonacciRecursive
	add	rax, rbx
.L14:
	mov	rbx, QWORD PTR -8[rbp]
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE2:
	.size	fibonacciRecursive, .-fibonacciRecursive
	.globl	testRecursive
	.type	testRecursive, @function
testRecursive:
.LFB3:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	edi, 0
	call	fibonacciRecursive
	test	rax, rax
	jne	.L18
	mov	edi, 12
	call	fibonacciRecursive
	cmp	rax, 144
	jne	.L18
	mov	edi, 34
	call	fibonacciRecursive
	cmp	rax, 5702887
	jne	.L18
	mov	rdi, -11
	call	fibonacciRecursive
	cmp	rax, -1
	jne	.L18
	mov	eax, 1
	jmp	.L20
.L18:
	mov	eax, 0
.L20:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE3:
	.size	testRecursive, .-testRecursive
	.section	.rodata
	.align 8
.LC0:
	.string	"Please, enter the number from 0 to 46"
.LC1:
	.string	"%lld"
.LC2:
	.string	"Iterative: "
.LC3:
	.string	"Tests failed"
.LC4:
	.string	"Tests succeed"
.LC5:
	.string	"Answer: %lld\n"
.LC6:
	.string	"Recursive: "
	.text
	.globl	main
	.type	main, @function
main:
.LFB4:
	.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	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	lea	rdi, .LC0[rip]
	call	puts@PLT
	mov	QWORD PTR -16[rbp], 0
	lea	rax, -16[rbp]
	mov	rsi, rax
	lea	rdi, .LC1[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	lea	rdi, .LC2[rip]
	mov	eax, 0
	call	printf@PLT
	call	testIterative
	test	eax, eax
	jne	.L22
	lea	rdi, .LC3[rip]
	call	puts@PLT
	jmp	.L23
.L22:
	lea	rdi, .LC4[rip]
	call	puts@PLT
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	fibonacciIterative
	mov	rsi, rax
	lea	rdi, .LC5[rip]
	mov	eax, 0
	call	printf@PLT
.L23:
	lea	rdi, .LC6[rip]
	mov	eax, 0
	call	printf@PLT
	call	testRecursive
	test	eax, eax
	jne	.L24
	lea	rdi, .LC3[rip]
	call	puts@PLT
	jmp	.L25
.L24:
	lea	rdi, .LC4[rip]
	call	puts@PLT
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	fibonacciRecursive
	mov	rsi, rax
	lea	rdi, .LC5[rip]
	mov	eax, 0
	call	printf@PLT
.L25:
	mov	eax, 0
	mov	rdx, QWORD PTR -8[rbp]
	sub	rdx, QWORD PTR fs:40
	je	.L27
	call	__stack_chk_fail@PLT
.L27:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE4:
	.size	main, .-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	"90765494.c"
	.text
	.align	2
	.global	fibonacciIterative
	.syntax unified
	.arm
	.fpu softvfp
	.type	fibonacciIterative, %function
fibonacciIterative:
	@ args = 0, pretend = 0, frame = 40
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	push	{r4, r5, r6, r7, fp}
	add	fp, sp, #16
	sub	sp, sp, #44
	str	r0, [fp, #-60]
	str	r1, [fp, #-56]
	sub	r3, fp, #60
	ldmia	r3, {r2-r3}
	cmp	r2, #0
	sbcs	r3, r3, #0
	bge	.L2
	mvn	r2, #0
	mvn	r3, #0
	b	.L3
.L2:
	sub	r3, fp, #60
	ldmia	r3, {r2-r3}
	orrs	r3, r2, r3
	bne	.L4
	mov	r2, #0
	mov	r3, #0
	b	.L3
.L4:
	sub	r3, fp, #60
	ldmia	r3, {r2-r3}
	cmp	r2, #3
	sbcs	r3, r3, #0
	bge	.L5
	mov	r2, #1
	mov	r3, #0
	b	.L3
.L5:
	mov	r2, #1
	mov	r3, #0
	str	r2, [fp, #-44]
	str	r3, [fp, #-40]
	mov	r2, #1
	mov	r3, #0
	str	r2, [fp, #-36]
	str	r3, [fp, #-32]
	mov	r2, #0
	mov	r3, #0
	str	r2, [fp, #-28]
	str	r3, [fp, #-24]
	mov	r3, #0
	str	r3, [fp, #-48]
	b	.L6
.L7:
	sub	r1, fp, #44
	ldmia	r1, {r0-r1}
	sub	r3, fp, #36
	ldmia	r3, {r2-r3}
	adds	r6, r0, r2
	adc	r7, r1, r3
	str	r6, [fp, #-28]
	str	r7, [fp, #-24]
	sub	r3, fp, #36
	ldmia	r3, {r2-r3}
	str	r2, [fp, #-44]
	str	r3, [fp, #-40]
	sub	r3, fp, #28
	ldmia	r3, {r2-r3}
	str	r2, [fp, #-36]
	str	r3, [fp, #-32]
	ldr	r3, [fp, #-48]
	add	r3, r3, #1
	str	r3, [fp, #-48]
.L6:
	ldr	r3, [fp, #-48]
	mov	r0, r3
	asr	r1, r0, #31
	sub	r3, fp, #60
	ldmia	r3, {r2-r3}
	subs	r4, r2, #2
	sbc	r5, r3, #0
	cmp	r0, r4
	sbcs	r3, r1, r5
	blt	.L7
	sub	r3, fp, #28
	ldmia	r3, {r2-r3}
.L3:
	mov	r0, r2
	mov	r1, r3
	sub	sp, fp, #16
	@ sp needed
	pop	{r4, r5, r6, r7, fp}
	bx	lr
	.size	fibonacciIterative, .-fibonacciIterative
	.align	2
	.global	testIterative
	.syntax unified
	.arm
	.fpu softvfp
	.type	testIterative, %function
testIterative:
	@ args = 0, pretend = 0, frame = 0
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	mov	r0, #0
	mov	r1, #0
	bl	fibonacciIterative
	mov	r2, r0
	mov	r3, r1
	orrs	r3, r2, r3
	bne	.L9
	mov	r0, #42
	mov	r1, #0
	bl	fibonacciIterative
	mov	r2, r0
	mov	r3, r1
	adr	r1, .L12
	ldmia	r1, {r0-r1}
	cmp	r3, r1
	cmpeq	r2, r0
	bne	.L9
	mov	r0, #23
	mov	r1, #0
	bl	fibonacciIterative
	mov	r2, r0
	mov	r3, r1
	ldr	r0, .L12+8
	mov	r1, #0
	cmp	r3, r1
	cmpeq	r2, r0
	bne	.L9
	mvn	r0, #32
	mvn	r1, #0
	bl	fibonacciIterative
	mov	r2, r0
	mov	r3, r1
	mvn	r0, #0
	mvn	r1, #0
	cmp	r3, r1
	cmpeq	r2, r0
	bne	.L9
	mov	r3, #1
	b	.L11
.L9:
	mov	r3, #0
.L11:
	mov	r0, r3
	pop	{fp, pc}
.L13:
	.align	3
.L12:
	.word	267914296
	.word	0
	.word	28657
	.size	testIterative, .-testIterative
	.align	2
	.global	fibonacciRecursive
	.syntax unified
	.arm
	.fpu softvfp
	.type	fibonacciRecursive, %function
fibonacciRecursive:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{r4, r5, r6, r7, r8, r9, fp, lr}
	add	fp, sp, #28
	sub	sp, sp, #8
	str	r0, [fp, #-36]
	str	r1, [fp, #-32]
	sub	r3, fp, #36
	ldmia	r3, {r2-r3}
	cmp	r2, #0
	sbcs	r3, r3, #0
	bge	.L15
	mvn	r4, #0
	mvn	r5, #0
	b	.L16
.L15:
	sub	r3, fp, #36
	ldmia	r3, {r2-r3}
	orrs	r3, r2, r3
	bne	.L17
	mov	r4, #0
	mov	r5, #0
	b	.L16
.L17:
	sub	r3, fp, #36
	ldmia	r3, {r2-r3}
	cmp	r2, #3
	sbcs	r3, r3, #0
	bge	.L18
	mov	r4, #1
	mov	r5, #0
	b	.L16
.L18:
	sub	r3, fp, #36
	ldmia	r3, {r2-r3}
	subs	r6, r2, #1
	sbc	r7, r3, #0
	mov	r0, r6
	mov	r1, r7
	bl	fibonacciRecursive
	mov	r6, r0
	mov	r7, r1
	sub	r3, fp, #36
	ldmia	r3, {r2-r3}
	subs	r8, r2, #2
	sbc	r9, r3, #0
	mov	r0, r8
	mov	r1, r9
	bl	fibonacciRecursive
	mov	r2, r0
	mov	r3, r1
	adds	r4, r6, r2
	adc	r5, r7, r3
.L16:
	mov	r2, r4
	mov	r3, r5
	mov	r0, r2
	mov	r1, r3
	sub	sp, fp, #28
	@ sp needed
	pop	{r4, r5, r6, r7, r8, r9, fp, pc}
	.size	fibonacciRecursive, .-fibonacciRecursive
	.align	2
	.global	testRecursive
	.syntax unified
	.arm
	.fpu softvfp
	.type	testRecursive, %function
testRecursive:
	@ args = 0, pretend = 0, frame = 0
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	mov	r0, #0
	mov	r1, #0
	bl	fibonacciRecursive
	mov	r2, r0
	mov	r3, r1
	orrs	r3, r2, r3
	bne	.L20
	mov	r0, #12
	mov	r1, #0
	bl	fibonacciRecursive
	mov	r2, r0
	mov	r3, r1
	cmp	r3, #0
	cmpeq	r2, #144
	bne	.L20
	mov	r0, #34
	mov	r1, #0
	bl	fibonacciRecursive
	mov	r2, r0
	mov	r3, r1
	adr	r1, .L23
	ldmia	r1, {r0-r1}
	cmp	r3, r1
	cmpeq	r2, r0
	bne	.L20
	mvn	r0, #10
	mvn	r1, #0
	bl	fibonacciRecursive
	mov	r2, r0
	mov	r3, r1
	mvn	r0, #0
	mvn	r1, #0
	cmp	r3, r1
	cmpeq	r2, r0
	bne	.L20
	mov	r3, #1
	b	.L22
.L20:
	mov	r3, #0
.L22:
	mov	r0, r3
	pop	{fp, pc}
.L24:
	.align	3
.L23:
	.word	5702887
	.word	0
	.size	testRecursive, .-testRecursive
	.section	.rodata
	.align	2
.LC0:
	.ascii	"Please, enter the number from 0 to 46\000"
	.align	2
.LC1:
	.ascii	"%lld\000"
	.align	2
.LC2:
	.ascii	"Iterative: \000"
	.align	2
.LC3:
	.ascii	"Tests failed\000"
	.align	2
.LC4:
	.ascii	"Tests succeed\000"
	.align	2
.LC5:
	.ascii	"Answer: %lld\012\000"
	.align	2
.LC6:
	.ascii	"Recursive: \000"
	.align	2
.LC7:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	main
	.syntax unified
	.arm
	.fpu softvfp
	.type	main, %function
main:
	@ 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, .L32
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	ldr	r0, .L32+4
	bl	puts
	mov	r2, #0
	mov	r3, #0
	str	r2, [fp, #-20]
	str	r3, [fp, #-16]
	sub	r3, fp, #20
	mov	r1, r3
	ldr	r0, .L32+8
	bl	__isoc99_scanf
	ldr	r0, .L32+12
	bl	printf
	bl	testIterative
	mov	r3, r0
	cmp	r3, #0
	bne	.L26
	ldr	r0, .L32+16
	bl	puts
	b	.L27
.L26:
	ldr	r0, .L32+20
	bl	puts
	sub	r3, fp, #20
	ldmia	r3, {r2-r3}
	mov	r0, r2
	mov	r1, r3
	bl	fibonacciIterative
	mov	r2, r0
	mov	r3, r1
	ldr	r0, .L32+24
	bl	printf
.L27:
	ldr	r0, .L32+28
	bl	printf
	bl	testRecursive
	mov	r3, r0
	cmp	r3, #0
	bne	.L28
	ldr	r0, .L32+16
	bl	puts
	b	.L29
.L28:
	ldr	r0, .L32+20
	bl	puts
	sub	r3, fp, #20
	ldmia	r3, {r2-r3}
	mov	r0, r2
	mov	r1, r3
	bl	fibonacciRecursive
	mov	r2, r0
	mov	r3, r1
	ldr	r0, .L32+24
	bl	printf
.L29:
	mov	r3, #0
	ldr	r2, .L32
	ldr	r1, [r2]
	ldr	r2, [fp, #-8]
	eors	r1, r2, r1
	mov	r2, #0
	beq	.L31
	bl	__stack_chk_fail
.L31:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L33:
	.align	2
.L32:
	.word	.LC7
	.word	.LC0
	.word	.LC1
	.word	.LC2
	.word	.LC3
	.word	.LC4
	.word	.LC5
	.word	.LC6
	.size	main, .-main
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
