	.file	"533382.c"
	.intel_syntax noprefix
	.text
	.section	.rodata
.LC1:
	.string	"Size of long double is: %lu\n"
	.align 8
.LC2:
	.string	"Searching for Largest prime in %lg\n"
.LC3:
	.string	"Error processing the prime"
	.align 8
.LC4:
	.string	"The largest prime calculated was %lu\n"
	.text
	.globl	main
	.type	main, @function
main:
.LFB0:
	.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	QWORD PTR -32[rbp], rsi
	movsd	xmm0, QWORD PTR .LC0[rip]
	movsd	QWORD PTR -16[rbp], xmm0
	mov	esi, 16
	lea	rdi, .LC1[rip]
	mov	eax, 0
	call	printf@PLT
	mov	rax, QWORD PTR -16[rbp]
	movq	xmm0, rax
	lea	rdi, .LC2[rip]
	mov	eax, 1
	call	printf@PLT
	movsd	xmm0, QWORD PTR -16[rbp]
	cvttsd2si	rax, xmm0
	mov	rdi, rax
	call	findLargestPrime
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], -1
	jne	.L2
	lea	rdi, .LC3[rip]
	call	puts@PLT
	jmp	.L3
.L2:
	mov	rax, QWORD PTR -8[rbp]
	mov	rsi, rax
	lea	rdi, .LC4[rip]
	mov	eax, 0
	call	printf@PLT
.L3:
	mov	eax, 0
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE0:
	.size	main, .-main
	.section	.rodata
	.align 8
.LC5:
	.string	"Largest Possible Prime is %lg\n"
	.align 8
.LC6:
	.string	"MPP=%lg : nextPrimeToCheck=%lu : largestPrimeFound=%lu : totalCalculation=%lu\n"
	.text
	.globl	findLargestPrime
	.type	findLargestPrime, @function
findLargestPrime:
.LFB1:
	.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
	fild	QWORD PTR -40[rbp]
	lea	rsp, -16[rsp]
	fstp	TBYTE PTR [rsp]
	call	sqrtl@PLT
	add	rsp, 16
	fstp	QWORD PTR -8[rbp]
	mov	QWORD PTR -32[rbp], 1
	mov	QWORD PTR -24[rbp], 2
	mov	QWORD PTR -16[rbp], 1
	mov	rax, QWORD PTR -8[rbp]
	movq	xmm0, rax
	lea	rdi, .LC5[rip]
	mov	eax, 1
	call	printf@PLT
.L12:
	mov	rax, QWORD PTR -40[rbp]
	cqo
	idiv	QWORD PTR -24[rbp]
	mov	rax, rdx
	test	rax, rax
	jne	.L6
	mov	rax, QWORD PTR -24[rbp]
	cmp	QWORD PTR -32[rbp], rax
	cmovge	rax, QWORD PTR -32[rbp]
	mov	QWORD PTR -32[rbp], rax
	mov	rax, QWORD PTR -40[rbp]
	cqo
	idiv	QWORD PTR -24[rbp]
	mov	QWORD PTR -40[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	imul	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rcx, QWORD PTR -16[rbp]
	mov	rdx, QWORD PTR -32[rbp]
	mov	rsi, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR -8[rbp]
	movq	xmm0, rax
	lea	rdi, .LC6[rip]
	mov	eax, 1
	call	printf@PLT
	cmp	QWORD PTR -40[rbp], 1
	jne	.L7
	mov	rax, QWORD PTR -32[rbp]
	jmp	.L13
.L7:
	mov	QWORD PTR -24[rbp], 2
	jmp	.L12
.L6:
	mov	rax, QWORD PTR -24[rbp]
	and	eax, 1
	test	rax, rax
	je	.L10
	mov	eax, 2
	jmp	.L11
.L10:
	mov	eax, 1
.L11:
	add	QWORD PTR -24[rbp], rax
	jmp	.L12
.L13:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE1:
	.size	findLargestPrime, .-findLargestPrime
	.section	.rodata
	.align 8
.LC0:
	.long	1029234688
	.long	1113685169
	.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	"533382.c"
	.text
	.section	.rodata
	.align	2
.LC0:
	.ascii	"Size of long double is: %lu\012\000"
	.align	2
.LC1:
	.ascii	"Searching for Largest prime in %lg\012\000"
	.global	__aeabi_d2iz
	.align	2
.LC2:
	.ascii	"Error processing the prime\000"
	.align	2
.LC3:
	.ascii	"The largest prime calculated was %lu\012\000"
	.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
	str	r0, [fp, #-24]
	str	r1, [fp, #-28]
	ldr	r2, .L5
	ldr	r3, .L5+4
	str	r2, [fp, #-12]
	str	r3, [fp, #-8]
	mov	r1, #8
	ldr	r0, .L5+8
	bl	printf
	sub	r3, fp, #12
	ldmia	r3, {r2-r3}
	ldr	r0, .L5+12
	bl	printf
	sub	r1, fp, #12
	ldmia	r1, {r0-r1}
	bl	__aeabi_d2iz
	mov	r3, r0
	mov	r0, r3
	bl	findLargestPrime
	str	r0, [fp, #-16]
	ldr	r3, [fp, #-16]
	cmn	r3, #1
	bne	.L2
	ldr	r0, .L5+16
	bl	puts
	b	.L3
.L2:
	ldr	r1, [fp, #-16]
	ldr	r0, .L5+20
	bl	printf
.L3:
	mov	r3, #0
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L6:
	.align	2
.L5:
	.word	1029234688
	.word	1113685169
	.word	.LC0
	.word	.LC1
	.word	.LC2
	.word	.LC3
	.size	main, .-main
	.global	__aeabi_i2d
	.section	.rodata
	.align	2
.LC4:
	.ascii	"Largest Possible Prime is %lg\012\000"
	.global	__aeabi_idivmod
	.global	__aeabi_idiv
	.align	2
.LC5:
	.ascii	"MPP=%lg : nextPrimeToCheck=%lu : largestPrimeFound="
	.ascii	"%lu : totalCalculation=%lu\012\000"
	.text
	.align	2
	.global	findLargestPrime
	.syntax unified
	.arm
	.fpu softvfp
	.type	findLargestPrime, %function
findLargestPrime:
	@ args = 0, pretend = 0, frame = 32
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #48
	str	r0, [fp, #-32]
	ldr	r0, [fp, #-32]
	bl	__aeabi_i2d
	mov	r2, r0
	mov	r3, r1
	mov	r0, r2
	mov	r1, r3
	bl	sqrtl
	str	r0, [fp, #-12]
	str	r1, [fp, #-8]
	mov	r3, #1
	str	r3, [fp, #-24]
	mov	r3, #2
	str	r3, [fp, #-20]
	mov	r3, #1
	str	r3, [fp, #-16]
	sub	r3, fp, #12
	ldmia	r3, {r2-r3}
	ldr	r0, .L16
	bl	printf
.L14:
	ldr	r3, [fp, #-32]
	ldr	r1, [fp, #-20]
	mov	r0, r3
	bl	__aeabi_idivmod
	mov	r3, r1
	cmp	r3, #0
	bne	.L8
	ldr	r2, [fp, #-24]
	ldr	r3, [fp, #-20]
	cmp	r2, r3
	movge	r3, r2
	movlt	r3, r3
	str	r3, [fp, #-24]
	ldr	r1, [fp, #-20]
	ldr	r0, [fp, #-32]
	bl	__aeabi_idiv
	mov	r3, r0
	str	r3, [fp, #-32]
	ldr	r3, [fp, #-16]
	ldr	r2, [fp, #-20]
	mul	r3, r2, r3
	str	r3, [fp, #-16]
	ldr	r3, [fp, #-16]
	str	r3, [sp, #8]
	ldr	r3, [fp, #-24]
	str	r3, [sp, #4]
	ldr	r3, [fp, #-20]
	str	r3, [sp]
	sub	r3, fp, #12
	ldmia	r3, {r2-r3}
	ldr	r0, .L16+4
	bl	printf
	ldr	r3, [fp, #-32]
	cmp	r3, #1
	bne	.L9
	ldr	r3, [fp, #-24]
	b	.L15
.L9:
	mov	r3, #2
	str	r3, [fp, #-20]
	b	.L14
.L8:
	ldr	r3, [fp, #-20]
	and	r3, r3, #1
	cmp	r3, #0
	beq	.L12
	mov	r3, #2
	b	.L13
.L12:
	mov	r3, #1
.L13:
	ldr	r2, [fp, #-20]
	add	r3, r2, r3
	str	r3, [fp, #-20]
	b	.L14
.L15:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L17:
	.align	2
.L16:
	.word	.LC4
	.word	.LC5
	.size	findLargestPrime, .-findLargestPrime
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
