	.file	"extr_blocksort.c_BZ2_blockSort.c"
	.intel_syntax noprefix
	.text
	.section	.rodata.str1.8,"aMS",@progbits,1
	.align 8
.LC0:
	.string	"      %d work, %d block, ratio %5.2f\n"
	.align 8
.LC1:
	.string	"    too repetitive; using fallback sorting algorithm\n"
	.text
	.p2align 4
	.globl	BZ2_blockSort
	.type	BZ2_blockSort, @function
BZ2_blockSort:
.LFB0:
	.cfi_startproc
	endbr64
	push	r15
	.cfi_def_cfa_offset 16
	.cfi_offset 15, -16
	push	r14
	.cfi_def_cfa_offset 24
	.cfi_offset 14, -24
	push	r13
	.cfi_def_cfa_offset 32
	.cfi_offset 13, -32
	push	r12
	.cfi_def_cfa_offset 40
	.cfi_offset 12, -40
	push	rbp
	.cfi_def_cfa_offset 48
	.cfi_offset 6, -48
	push	rbx
	.cfi_def_cfa_offset 56
	.cfi_offset 3, -56
	mov	rbx, rdi
	sub	rsp, 24
	.cfi_def_cfa_offset 80
	mov	r13d, DWORD PTR [rdi]
	mov	rbp, QWORD PTR 40[rdi]
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR 8[rsp], rax
	xor	eax, eax
	mov	r14, QWORD PTR 24[rdi]
	mov	r15d, DWORD PTR 4[rdi]
	cmp	r13d, 9999
	jle	.L7
	mov	eax, DWORD PTR BZ_N_OVERSHOOT[rip]
	mov	rsi, QWORD PTR 32[rdi]
	mov	r9d, r15d
	mov	r8d, r13d
	mov	ecx, 1
	add	eax, r13d
	mov	edx, eax
	and	edx, 1
	cmp	edx, 1
	mov	edx, 100
	sbb	eax, -1
	cmp	DWORD PTR 8[rdi], 100
	cmovle	edx, DWORD PTR 8[rdi]
	mov	rdi, rbp
	cdqe
	test	edx, edx
	cmovle	edx, ecx
	sub	rsp, 8
	.cfi_def_cfa_offset 88
	mov	rcx, r14
	lea	r12d, -1[rdx]
	mov	edx, 2863311531
	imul	r12, rdx
	lea	rdx, [rsi+rax*4]
	shr	r12, 33
	imul	r12d, r13d
	mov	DWORD PTR 12[rsp], r12d
	lea	rax, 12[rsp]
	push	rax
	.cfi_def_cfa_offset 96
	call	mainSort@PLT
	pop	rcx
	.cfi_def_cfa_offset 88
	pop	rsi
	.cfi_def_cfa_offset 80
	cmp	r15d, 2
	jg	.L22
	mov	eax, DWORD PTR 4[rsp]
	test	eax, eax
	jns	.L3
	cmp	r15d, 2
	je	.L6
.L7:
	mov	esi, DWORD PTR 16[rbx]
	mov	edi, DWORD PTR 20[rbx]
	mov	r8d, r15d
	mov	ecx, r13d
	mov	rdx, r14
	call	fallbackSort@PLT
.L3:
	mov	eax, DWORD PTR [rbx]
	mov	DWORD PTR 12[rbx], -1
	test	eax, eax
	jle	.L13
	lea	ecx, -1[rax]
	xor	eax, eax
	jmp	.L11
	.p2align 4,,10
	.p2align 3
.L10:
	lea	rdx, 1[rax]
	cmp	rcx, rax
	je	.L13
	mov	rax, rdx
.L11:
	cmp	QWORD PTR 0[rbp+rax*8], 0
	jne	.L10
	mov	DWORD PTR 12[rbx], eax
	mov	edi, 1
	jmp	.L9
	.p2align 4,,10
	.p2align 3
.L13:
	xor	edi, edi
.L9:
	mov	esi, 1003
	call	AssertH@PLT
	mov	rax, QWORD PTR 8[rsp]
	xor	rax, QWORD PTR fs:40
	jne	.L23
	add	rsp, 24
	.cfi_remember_state
	.cfi_def_cfa_offset 56
	pop	rbx
	.cfi_def_cfa_offset 48
	pop	rbp
	.cfi_def_cfa_offset 40
	pop	r12
	.cfi_def_cfa_offset 32
	pop	r13
	.cfi_def_cfa_offset 24
	pop	r14
	.cfi_def_cfa_offset 16
	pop	r15
	.cfi_def_cfa_offset 8
	ret
	.p2align 4,,10
	.p2align 3
.L22:
	.cfi_restore_state
	mov	esi, r12d
	pxor	xmm0, xmm0
	sub	esi, DWORD PTR 4[rsp]
	mov	edx, r13d
	pxor	xmm1, xmm1
	cvtsi2ss	xmm0, esi
	lea	rdi, .LC0[rip]
	cvtsi2ss	xmm1, r13d
	divss	xmm0, xmm1
	call	VPrintf3@PLT
	mov	edx, DWORD PTR 4[rsp]
	test	edx, edx
	jns	.L3
.L6:
	lea	rdi, .LC1[rip]
	call	VPrintf0@PLT
	jmp	.L7
.L23:
	call	__stack_chk_fail@PLT
	.cfi_endproc
.LFE0:
	.size	BZ2_blockSort, .-BZ2_blockSort
	.comm	BZ_N_OVERSHOOT,4,4
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.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, 2
	.eabi_attribute 34, 0
	.eabi_attribute 18, 4
	.file	"extr_blocksort.c_BZ2_blockSort.c"
	.text
	.global	__aeabi_i2f
	.global	__aeabi_fdiv
	.section	.rodata.str1.4,"aMS",%progbits,1
	.align	2
.LC0:
	.ascii	"      %d work, %d block, ratio %5.2f\012\000"
	.align	2
.LC1:
	.ascii	"    too repetitive; using fallback sorting algorith"
	.ascii	"m\012\000"
	.section	.rodata.cst4,"aM",%progbits,4
	.align	2
.LC2:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	BZ2_blockSort
	.syntax unified
	.arm
	.fpu softvfp
	.type	BZ2_blockSort, %function
BZ2_blockSort:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 0, uses_anonymous_args = 0
	push	{r4, r5, r6, r7, r8, r9, r10, lr}
	ldr	r3, .L25
	ldr	r7, [r0]
	ldr	r2, .L25+4
	sub	sp, sp, #24
	cmp	r7, r3
	mov	r5, r0
	ldr	r2, [r2]
	str	r2, [sp, #20]
	mov	r2,#0
	ldr	r4, [r0, #32]
	ldr	r9, [r0, #24]
	ldr	r8, [r0, #4]
	ble	.L7
	ldr	r3, .L25+8
	ldr	r1, .L25+12
	ldr	r2, [r3]
	ldr	r3, [r0, #8]
	add	r2, r7, r2
	tst	r2, #1
	addne	r2, r2, #1
	cmp	r3, #100
	movge	r3, #100
	cmp	r3, #1
	movge	r6, r3
	movlt	r6, #1
	sub	r6, r6, #1
	umull	r3, r6, r1, r6
	lsr	r6, r6, #1
	mul	r6, r7, r6
	ldr	r1, [r0, #28]
	add	r3, sp, #16
	str	r3, [sp, #8]
	mov	r0, r4
	mov	r3, r9
	stm	sp, {r7, r8}
	add	r2, r1, r2, lsl #2
	str	r6, [sp, #16]
	bl	mainSort
	cmp	r8, #2
	ldr	r3, [sp, #16]
	bgt	.L23
	cmp	r3, #0
	bge	.L3
	cmp	r8, #2
	beq	.L6
.L7:
	str	r8, [sp]
	mov	r3, r7
	mov	r2, r9
	ldr	r1, [r5, #16]
	ldr	r0, [r5, #20]
	bl	fallbackSort
.L3:
	mvn	r3, #0
	ldr	r0, [r5]
	str	r3, [r5, #12]
	cmp	r0, #0
	ble	.L13
	mov	r3, #0
	sub	r2, r4, #4
	b	.L11
.L10:
	add	r3, r3, #1
	cmp	r3, r0
	beq	.L13
.L11:
	ldr	r1, [r2, #4]!
	cmp	r1, #0
	bne	.L10
	mov	r0, #1
	str	r3, [r5, #12]
	b	.L9
.L13:
	mov	r0, #0
.L9:
	ldr	r1, .L25+16
	bl	AssertH
	ldr	r3, .L25+4
	ldr	r2, [r3]
	ldr	r3, [sp, #20]
	eors	r2, r3, r2
	mov	r3, #0
	bne	.L24
	add	sp, sp, #24
	@ sp needed
	pop	{r4, r5, r6, r7, r8, r9, r10, pc}
.L23:
	sub	r6, r6, r3
	mov	r0, r6
	bl	__aeabi_i2f
	mov	r10, r0
	mov	r0, r7
	bl	__aeabi_i2f
	mov	r1, r0
	mov	r0, r10
	bl	__aeabi_fdiv
	mov	r2, r7
	mov	r3, r0
	mov	r1, r6
	ldr	r0, .L25+20
	bl	VPrintf3
	ldr	r3, [sp, #16]
	cmp	r3, #0
	bge	.L3
.L6:
	ldr	r0, .L25+24
	bl	VPrintf0
	b	.L7
.L24:
	bl	__stack_chk_fail
.L26:
	.align	2
.L25:
	.word	9999
	.word	.LC2
	.word	BZ_N_OVERSHOOT
	.word	-1431655765
	.word	1003
	.word	.LC0
	.word	.LC1
	.size	BZ2_blockSort, .-BZ2_blockSort
	.comm	BZ_N_OVERSHOOT,4,4
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
