	.section	__TEXT,__text,regular,pure_instructions
	.build_version macos, 13, 0	sdk_version 13, 3
	.globl	_bch_btree_sort_lazy            ## -- Begin function bch_btree_sort_lazy
	.p2align	4, 0x90
_bch_btree_sort_lazy:                   ## @bch_btree_sort_lazy
	.cfi_startproc
## %bb.0:
	pushq	%rbp
	.cfi_def_cfa_offset 16
	.cfi_offset %rbp, -16
	movq	%rsp, %rbp
	.cfi_def_cfa_register %rbp
	movl	(%rdi), %r8d
	testq	%r8, %r8
	je	LBB0_7
## %bb.1:
	movq	%rsi, %rdx
	movq	_SORT_CRIT@GOTPCREL(%rip), %rcx
	movl	(%rcx), %ecx
	movq	%r8, %rsi
	.p2align	4, 0x90
LBB0_2:                                 ## =>This Inner Loop Header: Depth=1
	testl	%esi, %esi
	jle	LBB0_5
## %bb.3:                               ##   in Loop: Header=BB0_2 Depth=1
	imull	(%rdx), %ecx
	movq	8(%rdi), %rax
	movq	-8(%rax,%rsi,8), %rax
	decq	%rsi
	cmpl	%ecx, (%rax)
	jae	LBB0_2
## %bb.4:
                                        ## kill: def $esi killed $esi killed $rsi
	popq	%rbp
	jmp	_bch_btree_sort_partial         ## TAILCALL
LBB0_5:
	incl	%r8d
	movq	_MAX_BSETS@GOTPCREL(%rip), %rax
	cmpl	(%rax), %r8d
	jne	LBB0_7
## %bb.6:
	movq	%rdx, %rsi
	popq	%rbp
	jmp	_bch_btree_sort                 ## TAILCALL
LBB0_7:
	popq	%rbp
	jmp	_bch_bset_build_written_tree    ## TAILCALL
	.cfi_endproc
                                        ## -- End function
	.comm	_SORT_CRIT,4,2                  ## @SORT_CRIT
	.comm	_MAX_BSETS,4,2                  ## @MAX_BSETS
.subsections_via_symbols

	.section	__TEXT,__text,regular,pure_instructions
	.build_version macos, 13, 0	sdk_version 13, 3
	.globl	_bch_btree_sort_lazy            ; -- Begin function bch_btree_sort_lazy
	.p2align	2
_bch_btree_sort_lazy:                   ; @bch_btree_sort_lazy
	.cfi_startproc
; %bb.0:
	ldr	w8, [x0]
	cbz	w8, LBB0_7
; %bb.1:
	mov	x2, x1
Lloh0:
	adrp	x9, _SORT_CRIT@GOTPAGE
Lloh1:
	ldr	x9, [x9, _SORT_CRIT@GOTPAGEOFF]
Lloh2:
	ldr	w9, [x9]
	mov	x10, x8
LBB0_2:                                 ; =>This Inner Loop Header: Depth=1
	cmp	w10, #1
	b.lt	LBB0_5
; %bb.3:                                ;   in Loop: Header=BB0_2 Depth=1
	sub	x1, x10, #1
	ldr	w11, [x2]
	mul	w9, w11, w9
	ldr	x11, [x0, #8]
	add	x10, x11, x10, lsl #3
	ldur	x10, [x10, #-8]
	ldr	w11, [x10]
	mov	x10, x1
	cmp	w11, w9
	b.hs	LBB0_2
; %bb.4:
                                        ; kill: def $w1 killed $w1 killed $x1
	b	_bch_btree_sort_partial
LBB0_5:
	add	w8, w8, #1
Lloh3:
	adrp	x9, _MAX_BSETS@GOTPAGE
Lloh4:
	ldr	x9, [x9, _MAX_BSETS@GOTPAGEOFF]
Lloh5:
	ldr	w9, [x9]
	cmp	w8, w9
	b.ne	LBB0_7
; %bb.6:
	mov	x1, x2
	b	_bch_btree_sort
LBB0_7:
	b	_bch_bset_build_written_tree
	.loh AdrpLdrGotLdr	Lloh0, Lloh1, Lloh2
	.loh AdrpLdrGotLdr	Lloh3, Lloh4, Lloh5
	.cfi_endproc
                                        ; -- End function
	.comm	_SORT_CRIT,4,2                  ; @SORT_CRIT
	.comm	_MAX_BSETS,4,2                  ; @MAX_BSETS
.subsections_via_symbols
