	.file	"517210.c"
	.intel_syntax noprefix
	.text
	.section	.rodata
.LC0:
	.string	"\nList is empty"
.LC1:
	.string	"\nThe list is => "
.LC2:
	.string	"%d -> "
.LC3:
	.string	"NULL"
	.text
	.globl	traverse
	.type	traverse, @function
traverse:
.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
	cmp	QWORD PTR -24[rbp], 0
	jne	.L2
	lea	rdi, .LC0[rip]
	call	puts@PLT
	jmp	.L6
.L2:
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -8[rbp], rax
	lea	rdi, .LC1[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L4
.L5:
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	mov	esi, eax
	lea	rdi, .LC2[rip]
	mov	eax, 0
	call	printf@PLT
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
.L4:
	cmp	QWORD PTR -8[rbp], 0
	jne	.L5
	lea	rdi, .LC3[rip]
	call	puts@PLT
.L6:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE6:
	.size	traverse, .-traverse
	.globl	isEmpty
	.type	isEmpty, @function
isEmpty:
.LFB7:
	.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
	sete	al
	movzx	eax, al
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE7:
	.size	isEmpty, .-isEmpty
	.globl	search
	.type	search, @function
search:
.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
	mov	DWORD PTR -28[rbp], esi
	mov	DWORD PTR -12[rbp], 0
	cmp	QWORD PTR -24[rbp], 0
	je	.L10
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L11
.L13:
	add	DWORD PTR -12[rbp], 1
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -28[rbp], eax
	je	.L17
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
.L11:
	cmp	QWORD PTR -8[rbp], 0
	jne	.L13
	jmp	.L10
.L17:
	nop
.L10:
	cmp	QWORD PTR -8[rbp], 0
	je	.L14
	mov	eax, DWORD PTR -12[rbp]
	jmp	.L16
.L14:
	mov	eax, -1
.L16:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE8:
	.size	search, .-search
	.globl	countNodes
	.type	countNodes, @function
countNodes:
.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 -12[rbp], 0
	cmp	QWORD PTR -24[rbp], 0
	je	.L19
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L20
.L21:
	add	DWORD PTR -12[rbp], 1
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
.L20:
	cmp	QWORD PTR -8[rbp], 0
	jne	.L21
.L19:
	mov	eax, DWORD PTR -12[rbp]
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE9:
	.size	countNodes, .-countNodes
	.globl	freeList
	.type	freeList, @function
freeList:
.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	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rdx, QWORD PTR 8[rax]
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR [rax], rdx
	jmp	.L24
.L25:
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	free@PLT
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rdx, QWORD PTR 8[rax]
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR [rax], rdx
.L24:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L25
	nop
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE10:
	.size	freeList, .-freeList
	.globl	detectLoop
	.type	detectLoop, @function
detectLoop:
.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 -24[rbp], rdi
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L27
.L30:
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	cmp	rax, QWORD PTR -8[rbp]
	jne	.L27
	mov	eax, 1
	jmp	.L28
.L27:
	cmp	QWORD PTR -16[rbp], 0
	je	.L29
	cmp	QWORD PTR -8[rbp], 0
	je	.L29
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	jne	.L30
.L29:
	mov	eax, 0
.L28:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE11:
	.size	detectLoop, .-detectLoop
	.section	.rodata
	.align 8
.LC4:
	.ascii	"\n------------------------MENU------------------------\n\t1 "
	.ascii	"To see list\n\t2 For insertion at heading\n\t3 For insertion"
	.ascii	" at end\n\t4 For insertion at any position\n\t5 For deletion"
	.ascii	" of first element\n\t6 For deletion of last element\n\t7 For"
	.ascii	" deletion of element at any position\n\t8 For deletion of el"
	.ascii	"ement for any key\n\t9 For coun"
	.string	"ting number of nodes\n\t10 For searching an element\n\t11 For checking if list is empty or not\n\t12 Reverse a linked list\n\t13 Make loop in linked list\n\t14 Detect Loop and remove it\n\t0 To exit\n----------------------------------------------------\n\nEnter Choice : "
.LC5:
	.string	"%d"
.LC6:
	.string	"\nNumber of nodes = %d\n"
.LC7:
	.string	"Enter element to search for: "
	.align 8
.LC8:
	.string	"\nElement found at index(-1 if not found) = %d\n"
.LC9:
	.string	"\nList is empty!\n"
.LC10:
	.string	"\nList is not empty!\n"
	.align 8
.LC11:
	.string	"Loop Detected, removing loop.....\n"
.LC12:
	.string	"No Loop Detected\n"
.LC13:
	.string	"Incorrect Choice"
	.text
	.globl	main
	.type	main, @function
main:
.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, 32
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
	mov	QWORD PTR -16[rbp], 0
.L54:
	lea	rdi, .LC4[rip]
	mov	eax, 0
	call	printf@PLT
	lea	rax, -24[rbp]
	mov	rsi, rax
	lea	rdi, .LC5[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	mov	eax, DWORD PTR -24[rbp]
	cmp	eax, 14
	ja	.L32
	mov	eax, eax
	lea	rdx, 0[0+rax*4]
	lea	rax, .L34[rip]
	mov	eax, DWORD PTR [rdx+rax]
	cdqe
	lea	rdx, .L34[rip]
	add	rax, rdx
	notrack jmp	rax
	.section	.rodata
	.align 4
	.align 4
.L34:
	.long	.L47-.L34
	.long	.L46-.L34
	.long	.L57-.L34
	.long	.L57-.L34
	.long	.L57-.L34
	.long	.L57-.L34
	.long	.L57-.L34
	.long	.L57-.L34
	.long	.L39-.L34
	.long	.L39-.L34
	.long	.L38-.L34
	.long	.L37-.L34
	.long	.L57-.L34
	.long	.L57-.L34
	.long	.L33-.L34
	.text
.L47:
	lea	rax, -16[rbp]
	mov	rdi, rax
	call	freeList
	mov	eax, 0
	mov	rcx, QWORD PTR -8[rbp]
	sub	rcx, QWORD PTR fs:40
	je	.L55
	jmp	.L56
.L46:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	traverse
	jmp	.L49
.L39:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	countNodes
	mov	esi, eax
	lea	rdi, .LC6[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L49
.L38:
	lea	rdi, .LC7[rip]
	mov	eax, 0
	call	printf@PLT
	lea	rax, -20[rbp]
	mov	rsi, rax
	lea	rdi, .LC5[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	mov	edx, DWORD PTR -20[rbp]
	mov	rax, QWORD PTR -16[rbp]
	mov	esi, edx
	mov	rdi, rax
	call	search
	mov	esi, eax
	lea	rdi, .LC8[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L49
.L37:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	isEmpty
	test	eax, eax
	je	.L50
	lea	rdi, .LC9[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L49
.L50:
	lea	rdi, .LC10[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L49
.L33:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdi, rax
	call	detectLoop
	test	eax, eax
	je	.L52
	lea	rdi, .LC11[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L49
.L52:
	lea	rdi, .LC12[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L49
.L32:
	lea	rdi, .LC13[rip]
	call	puts@PLT
	jmp	.L49
.L57:
	nop
.L49:
	jmp	.L54
.L56:
	call	__stack_chk_fail@PLT
.L55:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE12:
	.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	"517210.c"
	.text
	.section	.rodata
	.align	2
.LC0:
	.ascii	"\012List is empty\000"
	.align	2
.LC1:
	.ascii	"\012The list is => \000"
	.align	2
.LC2:
	.ascii	"%d -> \000"
	.align	2
.LC3:
	.ascii	"NULL\000"
	.text
	.align	2
	.global	traverse
	.syntax unified
	.arm
	.fpu softvfp
	.type	traverse, %function
traverse:
	@ 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	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L2
	ldr	r0, .L7
	bl	puts
	b	.L6
.L2:
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-8]
	ldr	r0, .L7+4
	bl	printf
	b	.L4
.L5:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	mov	r1, r3
	ldr	r0, .L7+8
	bl	printf
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-8]
.L4:
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L5
	ldr	r0, .L7+12
	bl	puts
.L6:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L8:
	.align	2
.L7:
	.word	.LC0
	.word	.LC1
	.word	.LC2
	.word	.LC3
	.size	traverse, .-traverse
	.align	2
	.global	isEmpty
	.syntax unified
	.arm
	.fpu softvfp
	.type	isEmpty, %function
isEmpty:
	@ 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
	moveq	r3, #1
	movne	r3, #0
	and	r3, r3, #255
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	isEmpty, .-isEmpty
	.align	2
	.global	search
	.syntax unified
	.arm
	.fpu softvfp
	.type	search, %function
search:
	@ 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]
	mov	r3, #0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	beq	.L12
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-12]
	b	.L13
.L15:
	ldr	r3, [fp, #-8]
	add	r3, r3, #1
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	cmp	r2, r3
	beq	.L19
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-12]
.L13:
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	bne	.L15
	b	.L12
.L19:
	nop
.L12:
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L16
	ldr	r3, [fp, #-8]
	b	.L18
.L16:
	mvn	r3, #0
.L18:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	search, .-search
	.align	2
	.global	countNodes
	.syntax unified
	.arm
	.fpu softvfp
	.type	countNodes, %function
countNodes:
	@ 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]
	mov	r3, #0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	beq	.L21
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-12]
	b	.L22
.L23:
	ldr	r3, [fp, #-8]
	add	r3, r3, #1
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-12]
.L22:
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	bne	.L23
.L21:
	ldr	r3, [fp, #-8]
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	countNodes, .-countNodes
	.align	2
	.global	freeList
	.syntax unified
	.arm
	.fpu softvfp
	.type	freeList, %function
freeList:
	@ 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	r3, [fp, #-16]
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	ldr	r2, [r3, #4]
	ldr	r3, [fp, #-16]
	str	r2, [r3]
	b	.L26
.L27:
	ldr	r0, [fp, #-8]
	bl	free
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	ldr	r2, [r3, #4]
	ldr	r3, [fp, #-16]
	str	r2, [r3]
.L26:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L27
	nop
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	freeList, .-freeList
	.align	2
	.global	detectLoop
	.syntax unified
	.arm
	.fpu softvfp
	.type	detectLoop, %function
detectLoop:
	@ 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]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-8]
	b	.L29
.L32:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-8]
	ldr	r2, [fp, #-12]
	ldr	r3, [fp, #-8]
	cmp	r2, r3
	bne	.L29
	mov	r3, #1
	b	.L30
.L29:
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	beq	.L31
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	beq	.L31
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	bne	.L32
.L31:
	mov	r3, #0
.L30:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	detectLoop, .-detectLoop
	.section	.rodata
	.align	2
.LC4:
	.ascii	"\012------------------------MENU-------------------"
	.ascii	"-----\012\0111 To see list\012\0112 For insertion a"
	.ascii	"t heading\012\0113 For insertion at end\012\0114 Fo"
	.ascii	"r insertion at any position\012\0115 For deletion o"
	.ascii	"f first element\012\0116 For deletion of last eleme"
	.ascii	"nt\012\0117 For deletion of element at any position"
	.ascii	"\012\0118 For deletion of element for any key\012\011"
	.ascii	"9 For counting number of nodes\012\01110 For search"
	.ascii	"ing an element\012\01111 For checking if list is em"
	.ascii	"pty or not\012\01112 Reverse a linked list\012\0111"
	.ascii	"3 Make loop in linked list\012\01114 Detect Loop an"
	.ascii	"d remove it\012\0110 To exit\012-------------------"
	.ascii	"---------------------------------\012\012Enter Choi"
	.ascii	"ce : \000"
	.align	2
.LC5:
	.ascii	"%d\000"
	.align	2
.LC6:
	.ascii	"\012Number of nodes = %d\012\000"
	.align	2
.LC7:
	.ascii	"Enter element to search for: \000"
	.align	2
.LC8:
	.ascii	"\012Element found at index(-1 if not found) = %d\012"
	.ascii	"\000"
	.align	2
.LC9:
	.ascii	"\012List is empty!\012\000"
	.align	2
.LC10:
	.ascii	"\012List is not empty!\012\000"
	.align	2
.LC11:
	.ascii	"Loop Detected, removing loop.....\012\000"
	.align	2
.LC12:
	.ascii	"No Loop Detected\012\000"
	.align	2
.LC13:
	.ascii	"Incorrect Choice\000"
	.align	2
.LC14:
	.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, .L60
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
	mov	r3, #0
	str	r3, [fp, #-20]
.L56:
	ldr	r0, .L60+4
	bl	printf
	sub	r3, fp, #16
	mov	r1, r3
	ldr	r0, .L60+8
	bl	__isoc99_scanf
	ldr	r3, [fp, #-16]
	cmp	r3, #14
	ldrls	pc, [pc, r3, asl #2]
	b	.L34
.L36:
	.word	.L49
	.word	.L48
	.word	.L59
	.word	.L59
	.word	.L59
	.word	.L59
	.word	.L59
	.word	.L59
	.word	.L41
	.word	.L41
	.word	.L40
	.word	.L39
	.word	.L59
	.word	.L59
	.word	.L35
.L49:
	sub	r3, fp, #20
	mov	r0, r3
	bl	freeList
	mov	r3, #0
	ldr	r2, .L60
	ldr	r1, [r2]
	ldr	r2, [fp, #-8]
	eors	r1, r2, r1
	mov	r2, #0
	beq	.L57
	b	.L58
.L48:
	ldr	r3, [fp, #-20]
	mov	r0, r3
	bl	traverse
	b	.L51
.L41:
	ldr	r3, [fp, #-20]
	mov	r0, r3
	bl	countNodes
	mov	r3, r0
	mov	r1, r3
	ldr	r0, .L60+12
	bl	printf
	b	.L51
.L40:
	ldr	r0, .L60+16
	bl	printf
	sub	r3, fp, #12
	mov	r1, r3
	ldr	r0, .L60+8
	bl	__isoc99_scanf
	ldr	r3, [fp, #-20]
	ldr	r2, [fp, #-12]
	mov	r1, r2
	mov	r0, r3
	bl	search
	mov	r3, r0
	mov	r1, r3
	ldr	r0, .L60+20
	bl	printf
	b	.L51
.L39:
	ldr	r3, [fp, #-20]
	mov	r0, r3
	bl	isEmpty
	mov	r3, r0
	cmp	r3, #0
	beq	.L52
	ldr	r0, .L60+24
	bl	printf
	b	.L51
.L52:
	ldr	r0, .L60+28
	bl	printf
	b	.L51
.L35:
	ldr	r3, [fp, #-20]
	mov	r0, r3
	bl	detectLoop
	mov	r3, r0
	cmp	r3, #0
	beq	.L54
	ldr	r0, .L60+32
	bl	printf
	b	.L51
.L54:
	ldr	r0, .L60+36
	bl	printf
	b	.L51
.L34:
	ldr	r0, .L60+40
	bl	puts
	b	.L51
.L59:
	nop
.L51:
	b	.L56
.L58:
	bl	__stack_chk_fail
.L57:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L61:
	.align	2
.L60:
	.word	.LC14
	.word	.LC4
	.word	.LC5
	.word	.LC6
	.word	.LC7
	.word	.LC8
	.word	.LC9
	.word	.LC10
	.word	.LC11
	.word	.LC12
	.word	.LC13
	.size	main, .-main
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
