	.file	"extr_fold-const.c_fold_comparison.c"
	.intel_syntax noprefix
	.text
	.section	.rodata.str1.8,"aMS",@progbits,1
	.align 8
.LC0:
	.string	"assuming signed overflow does not occur when changing X +- C1 cmp C2 to X cmp C1 +- C2"
	.text
	.p2align 4
	.type	fold_comparison, @function
fold_comparison:
.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
	mov	r14, rsi
	push	r13
	.cfi_def_cfa_offset 32
	.cfi_offset 13, -32
	mov	r13, rcx
	push	r12
	.cfi_def_cfa_offset 40
	.cfi_offset 12, -40
	mov	r12, rdx
	push	rbp
	.cfi_def_cfa_offset 48
	.cfi_offset 6, -48
	mov	ebp, edi
	mov	rdi, rdx
	push	rbx
	.cfi_def_cfa_offset 56
	.cfi_offset 3, -56
	sub	rsp, 72
	.cfi_def_cfa_offset 128
	mov	rax, QWORD PTR fs:40
	mov	QWORD PTR 56[rsp], rax
	xor	eax, eax
	call	STRIP_SIGN_NOPS@PLT
	mov	rdi, r13
	call	STRIP_SIGN_NOPS@PLT
	mov	rcx, r13
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, ebp
	call	fold_relational_const@PLT
	cmp	QWORD PTR NULL_TREE[rip], rax
	je	.L167
.L1:
	mov	rbx, QWORD PTR 56[rsp]
	xor	rbx, QWORD PTR fs:40
	jne	.L168
	add	rsp, 72
	.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
.L167:
	.cfi_restore_state
	mov	edx, 1
	mov	rsi, r13
	mov	rdi, r12
	call	tree_swap_operands_p@PLT
	test	rax, rax
	jne	.L169
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR PLUS_EXPR[rip]
	je	.L7
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR MINUS_EXPR[rip]
	je	.L7
.L6:
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	POINTER_TYPE_P@PLT
	test	rax, rax
	je	.L13
	mov	edx, DWORD PTR flag_wrapv[rip]
	test	edx, edx
	je	.L170
.L13:
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	FLOAT_TYPE_P@PLT
	test	rax, rax
	je	.L40
	mov	rdi, r12
	call	strip_float_extensions@PLT
	mov	rdi, r13
	mov	r15, rax
	mov	QWORD PTR 8[rsp], rax
	call	strip_float_extensions@PLT
	mov	rdi, r15
	mov	rbx, rax
	call	TREE_TYPE@PLT
	mov	rdi, rbx
	mov	r15, rax
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_PRECISION@PLT
	mov	rdi, r15
	mov	QWORD PTR [rsp], rax
	call	TYPE_PRECISION@PLT
	cmp	QWORD PTR [rsp], rax
	jg	.L171
.L23:
	mov	rdi, r15
	call	TYPE_PRECISION@PLT
	mov	rdi, r12
	mov	QWORD PTR [rsp], rax
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_PRECISION@PLT
	cmp	QWORD PTR [rsp], rax
	jl	.L172
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR NEGATE_EXPR[rip]
	je	.L173
.L25:
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR REAL_CST[rip]
	je	.L26
.L34:
	cmp	QWORD PTR flag_unsafe_math_optimizations[rip], 0
	jne	.L174
.L28:
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR REAL_CST[rip]
	je	.L175
.L40:
	mov	rdi, r13
	call	TREE_CONSTANT@PLT
	test	rax, rax
	je	.L22
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR POSTINCREMENT_EXPR[rip]
	je	.L44
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR POSTDECREMENT_EXPR[rip]
	je	.L44
.L22:
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_TYPE[rip]
	je	.L50
.L56:
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	je	.L176
.L52:
	xor	edx, edx
	mov	rsi, r13
	mov	rdi, r12
	call	operand_equal_p@PLT
	test	rax, rax
	je	.L62
	lea	eax, -128[rbp]
	cmp	eax, 5
	ja	.L63
	lea	rdx, .L65[rip]
	movsx	rax, DWORD PTR [rdx+rax*4]
	add	rax, rdx
	notrack jmp	rax
	.section	.rodata
	.align 4
	.align 4
.L65:
	.long	.L68-.L65
	.long	.L67-.L65
	.long	.L66-.L65
	.long	.L67-.L65
	.long	.L66-.L65
	.long	.L64-.L65
	.text
	.p2align 4,,10
	.p2align 3
.L7:
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L6
	mov	rdi, r12
	mov	esi, 1
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_OVERFLOW@PLT
	test	eax, eax
	jne	.L6
	mov	rdi, r13
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_OVERFLOW_UNDEFINED@PLT
	test	rax, rax
	je	.L6
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L6
	mov	rdi, r13
	call	TREE_OVERFLOW@PLT
	test	eax, eax
	jne	.L6
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	xor	esi, esi
	mov	rdi, r12
	mov	r15, rax
	call	TREE_OPERAND@PLT
	mov	rdi, r12
	mov	QWORD PTR 8[rsp], rax
	call	TREE_CODE@PLT
	mov	rdi, r13
	mov	rbx, rax
	mov	rax, QWORD PTR PLUS_EXPR[rip]
	mov	QWORD PTR [rsp], rax
	call	TREE_TYPE@PLT
	mov	rsi, rax
	cmp	rbx, QWORD PTR [rsp]
	je	.L8
	mov	edi, DWORD PTR PLUS_EXPR[rip]
.L9:
	mov	rcx, r15
	mov	rdx, r13
	call	fold_build2@PLT
	mov	rdi, rax
	mov	r15, rax
	call	TREE_CODE@PLT
	mov	rdi, r13
	mov	rbx, rax
	call	TREE_CODE@PLT
	cmp	rbx, rax
	jne	.L6
	mov	rdi, r15
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L11
	mov	rdi, r15
	call	TREE_OVERFLOW@PLT
	test	eax, eax
	jne	.L6
.L11:
	mov	esi, DWORD PTR WARN_STRICT_OVERFLOW_COMPARISON[rip]
	lea	rdi, .LC0[rip]
	call	fold_overflow_warning@PLT
	mov	rdx, QWORD PTR 8[rsp]
	mov	rcx, r15
	mov	rsi, r14
	mov	edi, ebp
	call	fold_build2@PLT
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L169:
	mov	edi, ebp
	call	swap_tree_comparison@PLT
	mov	rcx, r12
	mov	rdx, r13
	mov	rsi, r14
	mov	edi, eax
	call	fold_build2@PLT
	jmp	.L1
.L63:
	xor	eax, eax
	call	gcc_unreachable@PLT
.L62:
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	je	.L177
.L92:
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR ADDR_EXPR[rip]
	je	.L178
.L93:
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR TRUNC_DIV_EXPR[rip]
	je	.L97
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR EXACT_DIV_EXPR[rip]
	je	.L97
.L96:
	mov	rax, QWORD PTR NULL_TREE[rip]
	jmp	.L1
.L68:
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	FLOAT_TYPE_P@PLT
	test	rax, rax
	je	.L67
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MODE@PLT
	mov	edi, eax
	call	HONOR_NANS@PLT
	test	eax, eax
	jne	.L62
.L67:
	mov	rsi, r14
	xor	edi, edi
	call	constant_boolean_node@PLT
	jmp	.L1
.L64:
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	FLOAT_TYPE_P@PLT
	test	rax, rax
	je	.L72
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MODE@PLT
	mov	edi, eax
	call	HONOR_NANS@PLT
	test	eax, eax
	jne	.L62
	.p2align 4,,10
	.p2align 3
.L72:
	mov	rsi, r14
	mov	edi, 1
	call	constant_boolean_node@PLT
	jmp	.L1
.L66:
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	FLOAT_TYPE_P@PLT
	test	rax, rax
	je	.L72
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MODE@PLT
	mov	edi, eax
	call	HONOR_NANS@PLT
	test	eax, eax
	je	.L72
	mov	rcx, r13
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, 133
	call	fold_build2@PLT
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L173:
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR NEGATE_EXPR[rip]
	jne	.L25
	mov	rdi, r12
	xor	esi, esi
	call	TREE_OPERAND@PLT
	xor	esi, esi
	mov	rdi, r13
	mov	r12, rax
	call	TREE_OPERAND@PLT
	.p2align 4,,10
	.p2align 3
.L164:
	mov	rdx, rax
	mov	rcx, r12
	mov	rsi, r14
	mov	edi, ebp
.L165:
	call	fold_build2@PLT
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L175:
	cmp	QWORD PTR flag_unsafe_math_optimizations[rip], 0
	je	.L40
	mov	eax, DWORD PTR flag_errno_math[rip]
	test	eax, eax
	jne	.L40
	mov	rdi, r12
	call	builtin_mathfn_code@PLT
	cmp	eax, DWORD PTR END_BUILTINS[rip]
	je	.L40
	mov	r8, r13
	mov	rcx, r12
	mov	rdx, r14
	mov	esi, ebp
	mov	edi, eax
	call	fold_mathfn_compare@PLT
	cmp	QWORD PTR NULL_TREE[rip], rax
	jne	.L1
	jmp	.L40
	.p2align 4,,10
	.p2align 3
.L97:
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L96
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L96
	mov	rdi, r12
	mov	esi, 1
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	integer_zerop@PLT
	test	eax, eax
	jne	.L96
	mov	rdi, r12
	mov	esi, 1
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_OVERFLOW@PLT
	test	eax, eax
	jne	.L96
	mov	rdi, r13
	call	TREE_OVERFLOW@PLT
	test	eax, eax
	jne	.L96
	mov	rcx, r13
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, ebp
	call	fold_div_compare@PLT
	cmp	QWORD PTR NULL_TREE[rip], rax
	je	.L96
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L178:
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR COMPONENT_REF[rip]
	jne	.L93
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR ADDR_EXPR[rip]
	jne	.L93
	xor	esi, esi
	mov	rdi, r13
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR COMPONENT_REF[rip]
	jne	.L93
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	xor	esi, esi
	mov	rdi, r13
	mov	rbx, rax
	call	TREE_OPERAND@PLT
	mov	esi, 1
	mov	rdi, rbx
	mov	r15, rax
	call	TREE_OPERAND@PLT
	mov	esi, 1
	mov	rdi, r15
	mov	QWORD PTR [rsp], rax
	call	TREE_OPERAND@PLT
	cmp	QWORD PTR [rsp], rax
	jne	.L93
	xor	esi, esi
	mov	rdi, rbx
	call	TREE_OPERAND@PLT
	xor	esi, esi
	mov	rdi, r15
	mov	r13, rax
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	build_fold_addr_expr@PLT
	mov	rdi, r13
	mov	r12, rax
	call	build_fold_addr_expr@PLT
	jmp	.L164
	.p2align 4,,10
	.p2align 3
.L177:
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	je	.L92
	lea	rcx, 32[rsp]
	lea	rdx, 48[rsp]
	mov	rdi, r12
	mov	QWORD PTR 40[rsp], 0
	lea	rsi, 40[rsp]
	mov	DWORD PTR 32[rsp], 0
	mov	QWORD PTR 48[rsp], 0
	call	twoval_comparison_p@PLT
	test	rax, rax
	je	.L92
	mov	rdi, QWORD PTR 40[rsp]
	test	rdi, rdi
	je	.L92
	cmp	QWORD PTR 48[rsp], 0
	je	.L92
	call	TREE_CONSTANT@PLT
	test	rax, rax
	je	.L79
	mov	rdi, QWORD PTR 48[rsp]
	call	TREE_CONSTANT@PLT
	test	rax, rax
	jne	.L92
.L79:
	mov	rdi, QWORD PTR 40[rsp]
	call	TREE_TYPE@PLT
	mov	rdi, QWORD PTR 48[rsp]
	mov	rbx, rax
	call	TREE_TYPE@PLT
	cmp	rbx, rax
	jne	.L92
	mov	rdi, QWORD PTR 40[rsp]
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	INTEGRAL_TYPE_P@PLT
	test	rax, rax
	je	.L92
	mov	rdi, QWORD PTR 40[rsp]
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MAX_VALUE@PLT
	test	rax, rax
	je	.L92
	mov	rdi, QWORD PTR 48[rsp]
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MAX_VALUE@PLT
	test	rax, rax
	je	.L92
	mov	rdi, QWORD PTR 48[rsp]
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MAX_VALUE@PLT
	mov	rdi, QWORD PTR 40[rsp]
	mov	r15, rax
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MIN_VALUE@PLT
	xor	edx, edx
	mov	rsi, r15
	mov	rdi, rax
	call	operand_equal_p@PLT
	test	rax, rax
	jne	.L92
	mov	rdi, QWORD PTR 40[rsp]
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MAX_VALUE@PLT
	mov	rdi, QWORD PTR 40[rsp]
	mov	rbx, rax
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MIN_VALUE@PLT
	mov	rcx, QWORD PTR 48[rsp]
	mov	rdx, rbx
	mov	rdi, r12
	mov	rsi, QWORD PTR 40[rsp]
	mov	r8, rax
	mov	QWORD PTR 8[rsp], rax
	call	eval_subst@PLT
	mov	rcx, r13
	mov	rsi, r14
	mov	edi, ebp
	mov	rdx, rax
	call	fold_build2@PLT
	mov	rcx, QWORD PTR 48[rsp]
	mov	r8, rbx
	mov	rdx, rbx
	mov	rsi, QWORD PTR 40[rsp]
	mov	rdi, r12
	mov	QWORD PTR [rsp], rax
	call	eval_subst@PLT
	mov	rcx, r13
	mov	rsi, r14
	mov	edi, ebp
	mov	rdx, rax
	call	fold_build2@PLT
	mov	r10, QWORD PTR 8[rsp]
	mov	r8, rbx
	mov	rdi, r12
	mov	rcx, QWORD PTR 48[rsp]
	mov	rsi, QWORD PTR 40[rsp]
	mov	r15, rax
	mov	rdx, r10
	call	eval_subst@PLT
	mov	rcx, r13
	mov	rsi, r14
	mov	edi, ebp
	mov	rdx, rax
	call	fold_build2@PLT
	mov	rdi, QWORD PTR [rsp]
	mov	QWORD PTR 8[rsp], rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L92
	mov	rdi, r15
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L92
	mov	rdi, QWORD PTR 8[rsp]
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L92
	mov	rdi, QWORD PTR [rsp]
	call	integer_onep@PLT
	mov	rdi, r15
	mov	r13d, eax
	call	integer_onep@PLT
	mov	rdi, QWORD PTR 8[rsp]
	mov	ebx, eax
	call	integer_onep@PLT
	lea	edx, [rbx+r13*2]
	lea	eax, [rax+rdx*2]
	cmp	eax, 7
	ja	.L87
	lea	rdx, .L82[rip]
	movsx	rax, DWORD PTR [rdx+rax*4]
	add	rax, rdx
	notrack jmp	rax
	.section	.rodata
	.align 4
	.align 4
.L82:
	.long	.L89-.L82
	.long	.L88-.L82
	.long	.L99-.L82
	.long	.L86-.L82
	.long	.L85-.L82
	.long	.L84-.L82
	.long	.L83-.L82
	.long	.L81-.L82
	.text
	.p2align 4,,10
	.p2align 3
.L174:
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR REAL_CST[rip]
	je	.L179
.L35:
	cmp	QWORD PTR flag_unsafe_math_optimizations[rip], 0
	je	.L28
	mov	rdi, r13
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR REAL_CST[rip]
	jne	.L28
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR MINUS_EXPR[rip]
	jne	.L28
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR REAL_CST[rip]
	jne	.L28
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, QWORD PTR MINUS_EXPR[rip]
	xor	ecx, ecx
	mov	rdx, r13
	mov	rsi, rax
	call	const_binop@PLT
	mov	r15, rax
	test	rax, rax
	je	.L28
	mov	rdi, rax
	call	TREE_CONSTANT_OVERFLOW@PLT
	test	eax, eax
	jne	.L28
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	edi, ebp
	mov	r12, rax
	call	swap_tree_comparison@PLT
	mov	rcx, r15
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, eax
	call	fold_build2@PLT
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L44:
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	POINTER_TYPE_P@PLT
	test	rax, rax
	jne	.L42
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	INTEGRAL_TYPE_P@PLT
	test	rax, rax
	je	.L22
	cmp	ebp, 133
	je	.L42
	cmp	ebp, 128
	jne	.L22
	.p2align 4,,10
	.p2align 3
.L42:
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR POSTINCREMENT_EXPR[rip]
	je	.L180
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, r12
	mov	r15, rax
	call	TREE_TYPE@PLT
	mov	edi, DWORD PTR MINUS_EXPR[rip]
	mov	rcx, r15
	mov	rdx, r13
	mov	rsi, rax
	call	fold_build2@PLT
	mov	rdi, r12
	mov	esi, 1
	mov	r15, rax
	call	TREE_OPERAND@PLT
	xor	esi, esi
	mov	rdi, r12
	mov	QWORD PTR [rsp], rax
	call	TREE_OPERAND@PLT
	mov	rdi, r12
	mov	rbx, rax
	call	TREE_TYPE@PLT
	mov	rcx, QWORD PTR [rsp]
	mov	edi, DWORD PTR PREDECREMENT_EXPR[rip]
	mov	rdx, rbx
	mov	rsi, rax
	call	build2@PLT
	mov	r12, rax
.L47:
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR COMPONENT_REF[rip]
	jne	.L48
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	esi, 1
	mov	rdi, rax
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	DECL_BIT_FIELD@PLT
	test	rax, rax
	je	.L48
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	esi, 1
	mov	rdi, rax
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	DECL_SIZE@PLT
	mov	esi, 1
	mov	edi, eax
	call	host_integerp@PLT
	test	rax, rax
	je	.L48
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	esi, 1
	mov	rdi, rax
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	DECL_SIZE@PLT
	mov	esi, 1
	mov	edi, eax
	call	tree_low_cst@PLT
	xor	esi, esi
	mov	rdi, r12
	mov	rbx, rax
	call	TREE_OPERAND@PLT
	mov	rcx, r13
	mov	rsi, r14
	mov	edi, ebp
	mov	rdx, rax
	call	fold_build2@PLT
	mov	rdi, rax
	mov	r13, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	je	.L181
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_PRECISION@PLT
	mov	rdi, QWORD PTR NULL_TREE[rip]
	sub	rax, rbx
	mov	rsi, rax
	call	build_int_cst@PLT
	mov	rdi, r12
	mov	r13, rax
	call	TREE_TYPE@PLT
	mov	rsi, r13
	mov	rdi, rax
	call	fold_convert@PLT
	mov	rdi, r12
	mov	r13, rax
	call	TREE_TYPE@PLT
	mov	edi, DWORD PTR LSHIFT_EXPR[rip]
	mov	rdx, r15
	mov	rcx, r13
	mov	rsi, rax
	call	fold_build2@PLT
	mov	rdi, r12
	mov	r15, rax
	call	TREE_TYPE@PLT
	mov	edi, DWORD PTR RSHIFT_EXPR[rip]
	mov	rdx, r15
	mov	rcx, r13
	mov	rsi, rax
	call	fold_build2@PLT
	mov	r15, rax
	.p2align 4,,10
	.p2align 3
.L48:
	mov	rcx, r15
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, ebp
	call	fold_build2@PLT
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L170:
	mov	rdi, r12
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_OVERFLOW_TRAPS@PLT
	test	eax, eax
	jne	.L13
	lea	rdx, 32[rsp]
	lea	rsi, 24[rsp]
	mov	rdi, r12
	call	extract_array_ref@PLT
	test	rax, rax
	je	.L13
	lea	rdx, 48[rsp]
	lea	rsi, 40[rsp]
	mov	rdi, r13
	call	extract_array_ref@PLT
	test	rax, rax
	je	.L13
	mov	rsi, QWORD PTR 40[rsp]
	mov	rdi, QWORD PTR 24[rsp]
	xor	edx, edx
	call	operand_equal_p@PLT
	test	rax, rax
	je	.L13
	mov	edi, DWORD PTR size_type_node[rip]
	call	signed_type_for@PLT
	mov	rsi, QWORD PTR 32[rsp]
	cmp	rsi, QWORD PTR NULL_TREE[rip]
	mov	r12, rax
	je	.L182
	mov	rdi, rax
	call	fold_convert@PLT
	mov	QWORD PTR 32[rsp], rax
.L17:
	mov	rsi, QWORD PTR 48[rsp]
	cmp	rsi, QWORD PTR NULL_TREE[rip]
	je	.L183
	mov	rdi, r12
	call	fold_convert@PLT
	mov	QWORD PTR 48[rsp], rax
.L19:
	mov	rcx, QWORD PTR 48[rsp]
	mov	rdx, QWORD PTR 32[rsp]
	mov	rsi, r14
	mov	edi, ebp
	call	fold_build2@PLT
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L50:
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR NOP_EXPR[rip]
	je	.L55
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR CONVERT_EXPR[rip]
	jne	.L56
.L55:
	mov	rcx, r13
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, ebp
	call	fold_widened_comparison@PLT
	test	rax, rax
	jne	.L1
	mov	rcx, r13
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, ebp
	call	fold_sign_changed_comparison@PLT
	test	rax, rax
	je	.L56
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L176:
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR MIN_EXPR[rip]
	je	.L61
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR MAX_EXPR[rip]
	jne	.L52
.L61:
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR INTEGER_CST[rip]
	jne	.L52
	mov	rcx, r13
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, ebp
	call	optimize_minmax_comparison@PLT
	test	rax, rax
	je	.L52
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L172:
	mov	rsi, rbx
	mov	rdi, r15
	call	fold_convert@PLT
	mov	rsi, QWORD PTR 8[rsp]
	mov	rdi, r15
	mov	r12, rax
	call	fold_convert@PLT
	jmp	.L164
	.p2align 4,,10
	.p2align 3
.L171:
	mov	rdi, rbx
	call	TREE_TYPE@PLT
	mov	r15, rax
	jmp	.L23
	.p2align 4,,10
	.p2align 3
.L26:
	mov	rdi, r13
	call	TREE_REAL_CST@PLT
	mov	rdi, r12
	mov	r15d, eax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR NEGATE_EXPR[rip]
	mov	edi, r15d
	je	.L184
	call	REAL_VALUE_MINUS_ZERO@PLT
	test	rax, rax
	jne	.L185
	mov	edi, r15d
	call	REAL_VALUE_ISNAN@PLT
	test	rax, rax
	je	.L31
	mov	rdi, r13
	call	TREE_TYPE@PLT
	mov	rdi, rax
	call	TYPE_MODE@PLT
	mov	edi, eax
	call	HONOR_SNANS@PLT
	test	eax, eax
	je	.L186
.L31:
	mov	edi, r15d
	call	REAL_VALUE_ISINF@PLT
	test	rax, rax
	je	.L34
	mov	rcx, r13
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, ebp
	call	fold_inf_compare@PLT
	cmp	QWORD PTR NULL_TREE[rip], rax
	jne	.L1
	jmp	.L34
	.p2align 4,,10
	.p2align 3
.L180:
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, r12
	mov	r15, rax
	call	TREE_TYPE@PLT
	mov	edi, DWORD PTR PLUS_EXPR[rip]
	mov	rcx, r15
	mov	rdx, r13
	mov	rsi, rax
	call	fold_build2@PLT
	mov	rdi, r12
	mov	esi, 1
	mov	r15, rax
	call	TREE_OPERAND@PLT
	xor	esi, esi
	mov	rdi, r12
	mov	QWORD PTR [rsp], rax
	call	TREE_OPERAND@PLT
	mov	rdi, r12
	mov	rbx, rax
	call	TREE_TYPE@PLT
	mov	rcx, QWORD PTR [rsp]
	mov	edi, DWORD PTR PREINCREMENT_EXPR[rip]
	mov	rdx, rbx
	mov	rsi, rax
	call	build2@PLT
	mov	r12, rax
	jmp	.L47
.L179:
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR PLUS_EXPR[rip]
	je	.L38
	mov	rdi, r12
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR MINUS_EXPR[rip]
	jne	.L35
.L38:
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, rax
	call	TREE_CODE@PLT
	cmp	rax, QWORD PTR REAL_CST[rip]
	jne	.L35
	mov	esi, 1
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rdi, r12
	mov	r15, rax
	call	TREE_CODE@PLT
	mov	rdi, QWORD PTR PLUS_EXPR[rip]
	cmp	rax, rdi
	jne	.L39
	mov	rdi, QWORD PTR MINUS_EXPR[rip]
.L39:
	mov	rdx, r15
	xor	ecx, ecx
	mov	rsi, r13
	call	const_binop@PLT
	mov	r15, rax
	test	rax, rax
	je	.L35
	mov	rdi, rax
	call	TREE_CONSTANT_OVERFLOW@PLT
	test	eax, eax
	jne	.L35
	xor	esi, esi
	mov	rdi, r12
	call	TREE_OPERAND@PLT
	mov	rcx, r15
	mov	rsi, r14
	mov	edi, ebp
	mov	rdx, rax
	call	fold_build2@PLT
	jmp	.L1
	.p2align 4,,10
	.p2align 3
.L185:
	mov	r15d, DWORD PTR dconst0[rip]
	mov	rdi, r13
	call	TREE_TYPE@PLT
	mov	rdi, rax
	mov	esi, r15d
	call	build_real@PLT
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, ebp
	mov	rcx, rax
	call	fold_build2@PLT
	jmp	.L1
.L184:
	call	REAL_VALUE_NEGATE@PLT
	mov	rdi, r13
	mov	r15d, eax
	call	TREE_TYPE@PLT
	mov	esi, r15d
	mov	rdi, rax
	call	build_real@PLT
	xor	esi, esi
	mov	rdi, r12
	mov	r13, rax
	call	TREE_OPERAND@PLT
	mov	edi, ebp
	mov	r12, rax
	call	swap_tree_comparison@PLT
	mov	rcx, r13
	mov	rdx, r12
	mov	rsi, r14
	mov	edi, eax
	call	fold_build2@PLT
	jmp	.L1
.L186:
	cmp	ebp, 128
	mov	rsi, QWORD PTR integer_one_node[rip]
	mov	rdx, r12
	mov	rdi, r14
	cmovne	rsi, QWORD PTR integer_zero_node[rip]
	call	omit_one_operand@PLT
	jmp	.L1
.L181:
	mov	rdx, r12
	mov	rsi, r13
	mov	rdi, r14
	call	omit_one_operand@PLT
	jmp	.L1
.L168:
	call	__stack_chk_fail@PLT
.L183:
	xor	esi, esi
	mov	rdi, r12
	call	build_int_cst@PLT
	mov	QWORD PTR 48[rsp], rax
	jmp	.L19
.L182:
	xor	esi, esi
	mov	rdi, rax
	call	build_int_cst@PLT
	mov	QWORD PTR 32[rsp], rax
	jmp	.L17
.L8:
	mov	edi, DWORD PTR MINUS_EXPR[rip]
	jmp	.L9
.L83:
	mov	ebp, 132
.L87:
	cmp	DWORD PTR 32[rsp], 0
	mov	rcx, QWORD PTR 48[rsp]
	mov	rsi, r14
	mov	edi, ebp
	mov	rdx, QWORD PTR 40[rsp]
	je	.L165
	call	build2@PLT
	mov	rdi, rax
	call	save_expr@PLT
	jmp	.L1
.L84:
	mov	ebp, 128
	jmp	.L87
.L85:
	mov	ebp, 131
	jmp	.L87
.L86:
	mov	ebp, 130
	jmp	.L87
.L99:
	mov	ebp, 133
	jmp	.L87
.L88:
	mov	ebp, 129
	jmp	.L87
.L81:
	mov	rsi, QWORD PTR integer_one_node[rip]
	mov	rdx, r12
	mov	rdi, r14
	call	omit_one_operand@PLT
	jmp	.L1
.L89:
	mov	rsi, QWORD PTR integer_zero_node[rip]
	mov	rdx, r12
	mov	rdi, r14
	call	omit_one_operand@PLT
	jmp	.L1
	.cfi_endproc
.LFE0:
	.size	fold_comparison, .-fold_comparison
	.comm	size_type_node,4,4
	.comm	integer_zero_node,8,8
	.comm	integer_one_node,8,8
	.comm	flag_wrapv,4,4
	.comm	flag_unsafe_math_optimizations,8,8
	.comm	flag_errno_math,4,4
	.comm	dconst0,4,4
	.comm	WARN_STRICT_OVERFLOW_COMPARISON,4,4
	.comm	TRUNC_DIV_EXPR,8,8
	.comm	RSHIFT_EXPR,4,4
	.comm	REAL_CST,8,8
	.comm	PREINCREMENT_EXPR,4,4
	.comm	PREDECREMENT_EXPR,4,4
	.comm	POSTINCREMENT_EXPR,8,8
	.comm	POSTDECREMENT_EXPR,8,8
	.comm	PLUS_EXPR,8,8
	.comm	NULL_TREE,8,8
	.comm	NOP_EXPR,8,8
	.comm	NEGATE_EXPR,8,8
	.comm	MIN_EXPR,8,8
	.comm	MINUS_EXPR,8,8
	.comm	MAX_EXPR,8,8
	.comm	LSHIFT_EXPR,4,4
	.comm	INTEGER_TYPE,8,8
	.comm	INTEGER_CST,8,8
	.comm	EXACT_DIV_EXPR,8,8
	.comm	END_BUILTINS,4,4
	.comm	CONVERT_EXPR,8,8
	.comm	COMPONENT_REF,8,8
	.comm	ADDR_EXPR,8,8
	.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_fold-const.c_fold_comparison.c"
	.text
	.section	.rodata.str1.4,"aMS",%progbits,1
	.align	2
.LC0:
	.ascii	"assuming signed overflow does not occur when changi"
	.ascii	"ng X +- C1 cmp C2 to X cmp C1 +- C2\000"
	.section	.rodata.cst4,"aM",%progbits,4
	.align	2
.LC1:
	.word	__stack_chk_guard
	.text
	.align	2
	.syntax unified
	.arm
	.fpu softvfp
	.type	fold_comparison, %function
fold_comparison:
	@ args = 0, pretend = 0, frame = 32
	@ frame_needed = 0, uses_anonymous_args = 0
	push	{r4, r5, r6, r7, r8, r9, r10, fp, lr}
	mov	r5, r3
	mov	r4, r2
	mov	r7, r1
	mov	r6, r0
	ldr	r3, .L196
	sub	sp, sp, #44
	mov	r0, r2
	ldr	r3, [r3]
	str	r3, [sp, #36]
	mov	r3,#0
	bl	STRIP_SIGN_NOPS
	mov	r0, r5
	bl	STRIP_SIGN_NOPS
	mov	r3, r5
	mov	r2, r4
	mov	r1, r7
	mov	r0, r6
	bl	fold_relational_const
	ldr	r8, .L196+4
	ldr	r3, [r8]
	cmp	r3, r0
	beq	.L176
.L1:
	ldr	r3, .L196
	ldr	r2, [r3]
	ldr	r3, [sp, #36]
	eors	r2, r3, r2
	mov	r3, #0
	bne	.L177
	add	sp, sp, #44
	@ sp needed
	pop	{r4, r5, r6, r7, r8, r9, r10, fp, pc}
.L176:
	mov	r2, #1
	mov	r1, r5
	mov	r0, r4
	bl	tree_swap_operands_p
	cmp	r0, #0
	bne	.L178
	mov	r0, r4
	bl	TREE_CODE
	ldr	fp, .L196+8
	ldr	r3, [fp]
	cmp	r0, r3
	beq	.L7
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+12
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L7
.L6:
	mov	r0, r4
	bl	TREE_TYPE
	bl	POINTER_TYPE_P
	cmp	r0, #0
	beq	.L12
	ldr	r3, .L196+16
	ldr	r3, [r3]
	cmp	r3, #0
	beq	.L179
.L12:
	mov	r0, r4
	bl	TREE_TYPE
	bl	FLOAT_TYPE_P
	cmp	r0, #0
	beq	.L39
	mov	r0, r4
	bl	strip_float_extensions
	mov	r3, r0
	mov	r0, r5
	mov	r9, r3
	str	r3, [sp, #12]
	bl	strip_float_extensions
	mov	r10, r0
	mov	r0, r9
	bl	TREE_TYPE
	mov	r9, r0
	mov	r0, r10
	bl	TREE_TYPE
	bl	TYPE_PRECISION
	mov	r3, r0
	mov	r0, r9
	str	r3, [sp, #8]
	bl	TYPE_PRECISION
	ldr	r3, [sp, #8]
	cmp	r3, r0
	bgt	.L180
.L22:
	mov	r0, r9
	bl	TYPE_PRECISION
	mov	r3, r0
	mov	r0, r4
	str	r3, [sp, #8]
	bl	TREE_TYPE
	bl	TYPE_PRECISION
	ldr	r3, [sp, #8]
	cmp	r3, r0
	blt	.L181
	mov	r0, r4
	bl	TREE_CODE
	ldr	r10, .L196+20
	ldr	r2, [r10]
	cmp	r0, r2
	beq	.L182
.L24:
	mov	r0, r5
	bl	TREE_CODE
	ldr	r9, .L196+24
	ldr	r2, [r9]
	cmp	r0, r2
	beq	.L25
.L33:
	ldr	r10, .L196+28
	ldr	r3, [r10]
	cmp	r3, #0
	bne	.L183
.L27:
	mov	r0, r5
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	beq	.L184
.L39:
	mov	r0, r5
	bl	TREE_CONSTANT
	cmp	r0, #0
	beq	.L21
	mov	r0, r4
	bl	TREE_CODE
	ldr	r9, .L196+32
	ldr	r3, [r9]
	cmp	r0, r3
	beq	.L43
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+36
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L43
.L21:
	mov	r0, r4
	bl	TREE_TYPE
	bl	TREE_CODE
	ldr	r3, .L196+40
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L49
.L55:
	mov	r0, r5
	bl	TREE_CODE
	ldr	r9, .L196+44
	ldr	r3, [r9]
	cmp	r0, r3
	beq	.L185
.L51:
	mov	r2, #0
	mov	r1, r5
	mov	r0, r4
	bl	operand_equal_p
	cmp	r0, #0
	beq	.L61
	sub	r3, r6, #128
	cmp	r3, #5
	ldrls	pc, [pc, r3, asl #2]
	b	.L62
.L64:
	.word	.L67
	.word	.L66
	.word	.L65
	.word	.L66
	.word	.L65
	.word	.L63
.L7:
	mov	r1, #1
	mov	r0, r4
	bl	TREE_OPERAND
	bl	TREE_CODE
	ldr	r9, .L196+44
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L6
	mov	r1, #1
	mov	r0, r4
	bl	TREE_OPERAND
	bl	TREE_OVERFLOW
	cmp	r0, #0
	bne	.L6
	mov	r0, r5
	bl	TREE_TYPE
	bl	TYPE_OVERFLOW_UNDEFINED
	cmp	r0, #0
	beq	.L6
	mov	r0, r5
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L6
	mov	r0, r5
	bl	TREE_OVERFLOW
	subs	r10, r0, #0
	bne	.L6
	mov	r1, #1
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r3, r0
	mov	r1, r10
	mov	r0, r4
	str	r3, [sp, #8]
	bl	TREE_OPERAND
	mov	r3, r0
	mov	r0, r4
	str	r3, [sp, #12]
	bl	TREE_CODE
	ldr	r10, [fp]
	cmp	r0, r10
	ldreq	r3, .L196+12
	mov	r0, r5
	ldreq	r10, [r3]
	bl	TREE_TYPE
	mov	r2, r5
	mov	r1, r0
	ldr	r3, [sp, #8]
	mov	r0, r10
	bl	fold_build2
	mov	r10, r0
	bl	TREE_CODE
	mov	r3, r0
	mov	r0, r5
	str	r3, [sp, #8]
	bl	TREE_CODE
	ldr	r3, [sp, #8]
	cmp	r3, r0
	bne	.L6
	mov	r0, r10
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L10
	mov	r0, r10
	bl	TREE_OVERFLOW
	cmp	r0, #0
	bne	.L6
.L10:
	ldr	r3, .L196+48
	ldr	r0, .L196+52
	ldr	r1, [r3]
	bl	fold_overflow_warning
	mov	r3, r10
	mov	r1, r7
	mov	r0, r6
	ldr	r2, [sp, #12]
	bl	fold_build2
	b	.L1
.L178:
	mov	r0, r6
	bl	swap_tree_comparison
	mov	r3, r4
	mov	r2, r5
	mov	r1, r7
	bl	fold_build2
	b	.L1
.L62:
	bl	gcc_unreachable
.L61:
	mov	r0, r5
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	beq	.L186
.L91:
	mov	r0, r4
	bl	TREE_CODE
	ldr	r10, .L196+56
	ldr	r3, [r10]
	cmp	r0, r3
	beq	.L187
.L92:
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+60
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L96
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+64
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L96
.L95:
	ldr	r0, [r8]
	b	.L1
.L67:
	mov	r0, r4
	bl	TREE_TYPE
	bl	FLOAT_TYPE_P
	cmp	r0, #0
	beq	.L66
	mov	r0, r4
	bl	TREE_TYPE
	bl	TYPE_MODE
	bl	HONOR_NANS
	cmp	r0, #0
	bne	.L61
.L66:
	mov	r1, r7
	mov	r0, #0
	bl	constant_boolean_node
	b	.L1
.L63:
	mov	r0, r4
	bl	TREE_TYPE
	bl	FLOAT_TYPE_P
	cmp	r0, #0
	beq	.L71
	mov	r0, r4
	bl	TREE_TYPE
	bl	TYPE_MODE
	bl	HONOR_NANS
	cmp	r0, #0
	bne	.L61
.L71:
	mov	r1, r7
	mov	r0, #1
	bl	constant_boolean_node
	b	.L1
.L65:
	mov	r0, r4
	bl	TREE_TYPE
	bl	FLOAT_TYPE_P
	cmp	r0, #0
	beq	.L71
	mov	r0, r4
	bl	TREE_TYPE
	bl	TYPE_MODE
	bl	HONOR_NANS
	cmp	r0, #0
	beq	.L71
	mov	r3, r5
	mov	r2, r4
	mov	r1, r7
	mov	r0, #133
	bl	fold_build2
	b	.L1
.L182:
	mov	r0, r5
	bl	TREE_CODE
	ldr	r2, [r10]
	cmp	r0, r2
	bne	.L24
	mov	r0, r5
	mov	r1, #0
	bl	TREE_OPERAND
	mov	r1, #0
	mov	r5, r0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r2, r5
	mov	r3, r0
	mov	r1, r7
	mov	r0, r6
	bl	fold_build2
	b	.L1
.L184:
	ldr	r3, [r10]
	cmp	r3, #0
	beq	.L39
	ldr	r3, .L196+68
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L39
	mov	r0, r4
	bl	builtin_mathfn_code
	ldr	r3, .L196+72
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L39
	mov	r3, r4
	mov	r2, r7
	mov	r1, r6
	str	r5, [sp]
	bl	fold_mathfn_compare
	ldr	r3, [r8]
	cmp	r3, r0
	bne	.L1
	b	.L39
.L96:
	mov	r0, r5
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L95
	mov	r1, #1
	mov	r0, r4
	bl	TREE_OPERAND
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L95
	mov	r1, #1
	mov	r0, r4
	bl	TREE_OPERAND
	bl	integer_zerop
	cmp	r0, #0
	bne	.L95
	mov	r1, #1
	mov	r0, r4
	bl	TREE_OPERAND
	bl	TREE_OVERFLOW
	cmp	r0, #0
	bne	.L95
	mov	r0, r5
	bl	TREE_OVERFLOW
	cmp	r0, #0
	bne	.L95
	mov	r3, r5
	mov	r2, r4
	mov	r1, r7
	mov	r0, r6
	bl	fold_div_compare
	ldr	r3, [r8]
	cmp	r3, r0
	beq	.L95
	b	.L1
.L187:
	mov	r1, #0
	mov	r0, r4
	bl	TREE_OPERAND
	bl	TREE_CODE
	ldr	fp, .L196+76
	ldr	r3, [fp]
	cmp	r0, r3
	bne	.L92
	mov	r0, r5
	bl	TREE_CODE
	ldr	r3, [r10]
	cmp	r0, r3
	bne	.L92
	mov	r1, #0
	mov	r0, r5
	bl	TREE_OPERAND
	bl	TREE_CODE
	ldr	r3, [fp]
	cmp	r0, r3
	bne	.L92
	mov	r1, #0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, #0
	mov	fp, r0
	mov	r0, r5
	bl	TREE_OPERAND
	mov	r1, #1
	mov	r10, r0
	mov	r0, fp
	bl	TREE_OPERAND
	mov	r3, r0
	mov	r1, #1
	mov	r0, r10
	str	r3, [sp, #8]
	bl	TREE_OPERAND
	ldr	r3, [sp, #8]
	cmp	r3, r0
	bne	.L92
	mov	r1, #0
	mov	r0, fp
	bl	TREE_OPERAND
	mov	r1, #0
	mov	r4, r0
	mov	r0, r10
	bl	TREE_OPERAND
	mov	r5, r0
	mov	r0, r4
	bl	build_fold_addr_expr
	mov	r4, r0
	mov	r0, r5
	bl	build_fold_addr_expr
.L173:
	mov	r3, r0
	mov	r2, r4
	mov	r1, r7
	mov	r0, r6
.L174:
	bl	fold_build2
	b	.L1
.L186:
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	beq	.L91
	mov	ip, #0
	mov	r0, r4
	add	r3, sp, #32
	add	r2, sp, #28
	add	r1, sp, #24
	str	ip, [sp, #24]
	str	ip, [sp, #28]
	str	ip, [sp, #32]
	bl	twoval_comparison_p
	cmp	r0, #0
	beq	.L91
	ldr	r0, [sp, #24]
	cmp	r0, #0
	beq	.L91
	ldr	r3, [sp, #28]
	cmp	r3, #0
	beq	.L91
	bl	TREE_CONSTANT
	cmp	r0, #0
	beq	.L78
	ldr	r0, [sp, #28]
	bl	TREE_CONSTANT
	cmp	r0, #0
	bne	.L91
.L78:
	ldr	r0, [sp, #24]
	bl	TREE_TYPE
	mov	r10, r0
	ldr	r0, [sp, #28]
	bl	TREE_TYPE
	cmp	r10, r0
	bne	.L91
	ldr	r0, [sp, #24]
	bl	TREE_TYPE
	bl	INTEGRAL_TYPE_P
	cmp	r0, #0
	beq	.L91
	ldr	r0, [sp, #24]
	bl	TREE_TYPE
	bl	TYPE_MAX_VALUE
	cmp	r0, #0
	beq	.L91
	ldr	r0, [sp, #28]
	bl	TREE_TYPE
	bl	TYPE_MAX_VALUE
	cmp	r0, #0
	beq	.L91
	ldr	r0, [sp, #24]
	bl	TREE_TYPE
	bl	TYPE_MIN_VALUE
	mov	r10, r0
	ldr	r0, [sp, #28]
	bl	TREE_TYPE
	bl	TYPE_MAX_VALUE
	mov	r2, #0
	mov	r1, r0
	mov	r0, r10
	bl	operand_equal_p
	cmp	r0, #0
	bne	.L91
	ldr	r0, [sp, #24]
	bl	TREE_TYPE
	bl	TYPE_MAX_VALUE
	mov	r10, r0
	ldr	r0, [sp, #24]
	bl	TREE_TYPE
	bl	TYPE_MIN_VALUE
	mov	r2, r10
	mov	fp, r0
	ldr	r3, [sp, #28]
	ldr	r1, [sp, #24]
	str	r0, [sp]
	mov	r0, r4
	bl	eval_subst
	mov	r3, r5
	mov	r2, r0
	mov	r1, r7
	mov	r0, r6
	bl	fold_build2
	mov	ip, r0
	mov	r2, r10
	ldr	r3, [sp, #28]
	ldr	r1, [sp, #24]
	str	r10, [sp]
	mov	r0, r4
	str	ip, [sp, #8]
	bl	eval_subst
	mov	r3, r5
	mov	r2, r0
	mov	r1, r7
	mov	r0, r6
	bl	fold_build2
	mov	ip, r0
	mov	r2, fp
	ldr	r3, [sp, #28]
	ldr	r1, [sp, #24]
	str	r10, [sp]
	mov	r0, r4
	mov	fp, ip
	bl	eval_subst
	mov	r3, r5
	mov	r2, r0
	mov	r1, r7
	mov	r0, r6
	bl	fold_build2
	mov	r10, r0
	ldr	r0, [sp, #8]
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L91
	mov	r0, fp
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L91
	mov	r0, r10
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L91
	ldr	r0, [sp, #8]
	bl	integer_onep
	mov	r8, r0
	mov	r0, fp
	bl	integer_onep
	mov	r5, r0
	mov	r0, r10
	bl	integer_onep
	add	r5, r5, r8, lsl #1
	add	r5, r0, r5, lsl #1
	cmp	r5, #7
	ldrls	pc, [pc, r5, asl #2]
	b	.L86
.L81:
	.word	.L88
	.word	.L87
	.word	.L98
	.word	.L85
	.word	.L84
	.word	.L83
	.word	.L82
	.word	.L80
.L183:
	mov	r0, r5
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	beq	.L188
.L34:
	ldr	r3, [r10]
	cmp	r3, #0
	beq	.L27
	mov	r0, r5
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L27
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+12
	ldr	r2, [r3]
	cmp	r0, r2
	bne	.L27
	mov	r1, #0
	mov	r0, r4
	bl	TREE_OPERAND
	bl	TREE_CODE
	ldr	r2, [r9]
	ldr	r3, .L196+12
	cmp	r0, r2
	bne	.L27
	ldr	r2, [r3]
	mov	r1, #0
	mov	r0, r4
	str	r2, [sp, #8]
	bl	TREE_OPERAND
	ldr	r2, [sp, #8]
	mov	r1, r0
	mov	r3, #0
	mov	r0, r2
	mov	r2, r5
	bl	const_binop
	subs	r3, r0, #0
	str	r3, [sp, #8]
	beq	.L27
	bl	TREE_CONSTANT_OVERFLOW
	cmp	r0, #0
	bne	.L27
	mov	r0, r6
	bl	swap_tree_comparison
	mov	r1, #1
	mov	r5, r0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, r7
	mov	r2, r0
	ldr	r3, [sp, #8]
	mov	r0, r5
	bl	fold_build2
	b	.L1
.L43:
	mov	r0, r4
	bl	TREE_TYPE
	bl	POINTER_TYPE_P
	cmp	r0, #0
	bne	.L41
	mov	r0, r4
	bl	TREE_TYPE
	bl	INTEGRAL_TYPE_P
	cmp	r0, #0
	beq	.L21
	cmp	r6, #128
	cmpne	r6, #133
	bne	.L21
.L41:
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	beq	.L189
	ldr	r3, .L196+12
	mov	r0, r4
	ldr	r10, [r3]
	bl	TREE_TYPE
	mov	r1, #1
	mov	r9, r0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, r9
	mov	r3, r0
	mov	r2, r5
	mov	r0, r10
	bl	fold_build2
	mov	r9, r0
	ldr	r3, .L196+80
.L172:
	mov	r0, r4
	ldr	fp, [r3]
	bl	TREE_TYPE
	mov	r1, #0
	mov	r10, r0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, #1
	str	r0, [sp, #8]
	mov	r0, r4
	bl	TREE_OPERAND
	ldr	r2, [sp, #8]
	mov	r3, r0
	mov	r1, r10
	mov	r0, fp
	bl	build2
	mov	r1, #0
	mov	r4, r0
	bl	TREE_OPERAND
	bl	TREE_CODE
	ldr	r3, .L196+76
	ldr	r3, [r3]
	cmp	r0, r3
	bne	.L47
	mov	r1, #0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, #1
	bl	TREE_OPERAND
	bl	DECL_BIT_FIELD
	cmp	r0, #0
	beq	.L47
	mov	r1, #0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, #1
	bl	TREE_OPERAND
	bl	DECL_SIZE
	mov	r1, #1
	bl	host_integerp
	cmp	r0, #0
	beq	.L47
	mov	r1, #0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, #1
	bl	TREE_OPERAND
	bl	DECL_SIZE
	mov	r1, #1
	bl	tree_low_cst
	mov	r1, #0
	mov	r10, r0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r3, r5
	mov	r2, r0
	mov	r1, r7
	mov	r0, r6
	bl	fold_build2
	mov	r5, r0
	bl	TREE_CODE
	ldr	r3, .L196+44
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L190
	mov	r0, r4
	ldr	r5, [r8]
	bl	TREE_TYPE
	bl	TYPE_PRECISION
	mov	r1, r0
	mov	r0, r5
	sub	r1, r1, r10
	bl	build_int_cst
	mov	r5, r0
	mov	r0, r4
	bl	TREE_TYPE
	mov	r1, r5
	bl	fold_convert
	ldr	r3, .L196+84
	mov	r5, r0
	mov	r0, r4
	ldr	r8, [r3]
	bl	TREE_TYPE
	mov	r2, r9
	mov	r1, r0
	mov	r3, r5
	mov	r0, r8
	bl	fold_build2
	ldr	r3, .L196+88
	mov	r8, r0
	mov	r0, r4
	ldr	r9, [r3]
	bl	TREE_TYPE
	mov	r3, r5
	mov	r1, r0
	mov	r2, r8
	mov	r0, r9
	bl	fold_build2
	mov	r9, r0
.L47:
	mov	r3, r9
	mov	r2, r4
	mov	r1, r7
	mov	r0, r6
	bl	fold_build2
	b	.L1
.L179:
	mov	r0, r4
	bl	TREE_TYPE
	bl	TYPE_OVERFLOW_TRAPS
	subs	r9, r0, #0
	bne	.L12
	mov	r0, r4
	add	r2, sp, #24
	add	r1, sp, #20
	bl	extract_array_ref
	cmp	r0, #0
	beq	.L12
	mov	r0, r5
	add	r2, sp, #32
	add	r1, sp, #28
	bl	extract_array_ref
	cmp	r0, #0
	beq	.L12
	mov	r2, r9
	ldr	r1, [sp, #28]
	ldr	r0, [sp, #20]
	bl	operand_equal_p
	cmp	r0, #0
	beq	.L12
	ldr	r3, .L196+92
	ldr	r0, [r3]
	bl	signed_type_for
	ldr	r1, [sp, #24]
	ldr	r3, [r8]
	mov	r4, r0
	cmp	r1, r3
	beq	.L191
	bl	fold_convert
	str	r0, [sp, #24]
.L16:
	ldr	r3, [r8]
	ldr	r1, [sp, #32]
	mov	r0, r4
	cmp	r1, r3
	beq	.L192
	bl	fold_convert
	str	r0, [sp, #32]
.L18:
	mov	r1, r7
	mov	r0, r6
	ldr	r3, [sp, #32]
	ldr	r2, [sp, #24]
	bl	fold_build2
	b	.L1
.L49:
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+96
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L54
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+100
	ldr	r3, [r3]
	cmp	r0, r3
	bne	.L55
.L54:
	mov	r3, r5
	mov	r2, r4
	mov	r1, r7
	mov	r0, r6
	bl	fold_widened_comparison
	cmp	r0, #0
	bne	.L1
	mov	r3, r5
	mov	r2, r4
	mov	r1, r7
	mov	r0, r6
	bl	fold_sign_changed_comparison
	cmp	r0, #0
	beq	.L55
	b	.L1
.L185:
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+104
	ldr	r3, [r3]
	cmp	r0, r3
	beq	.L60
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+108
	ldr	r3, [r3]
	cmp	r0, r3
	bne	.L51
.L60:
	mov	r1, #1
	mov	r0, r4
	bl	TREE_OPERAND
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L51
	mov	r3, r5
	mov	r2, r4
	mov	r1, r7
	mov	r0, r6
	bl	optimize_minmax_comparison
	cmp	r0, #0
	beq	.L51
	b	.L1
.L181:
	ldr	r1, [sp, #12]
	mov	r0, r9
	bl	fold_convert
	mov	r1, r10
	mov	r4, r0
	mov	r0, r9
	bl	fold_convert
	b	.L173
.L180:
	mov	r0, r10
	bl	TREE_TYPE
	mov	r9, r0
	b	.L22
.L25:
	mov	r0, r5
	bl	TREE_REAL_CST
	mov	r3, r0
	mov	r0, r4
	str	r3, [sp, #8]
	bl	TREE_CODE
	ldr	r3, [r10]
	cmp	r0, r3
	beq	.L193
	ldr	r0, [sp, #8]
	bl	REAL_VALUE_MINUS_ZERO
	cmp	r0, #0
	bne	.L194
	ldr	r0, [sp, #8]
	bl	REAL_VALUE_ISNAN
	cmp	r0, #0
	beq	.L30
	mov	r0, r5
	bl	TREE_TYPE
	bl	TYPE_MODE
	bl	HONOR_SNANS
	cmp	r0, #0
	beq	.L195
.L30:
	ldr	r0, [sp, #8]
	bl	REAL_VALUE_ISINF
	cmp	r0, #0
	beq	.L33
	mov	r3, r5
	mov	r2, r4
	mov	r1, r7
	mov	r0, r6
	bl	fold_inf_compare
	ldr	r3, [r8]
	cmp	r3, r0
	bne	.L1
	b	.L33
.L189:
	mov	r0, r4
	ldr	r10, [fp]
	bl	TREE_TYPE
	mov	r1, #1
	mov	r9, r0
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, r9
	mov	r3, r0
	mov	r2, r5
	mov	r0, r10
	bl	fold_build2
	ldr	r3, .L196+112
	mov	r9, r0
	b	.L172
.L188:
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, [fp]
	cmp	r0, r3
	beq	.L37
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, .L196+12
	ldr	r3, [r3]
	cmp	r0, r3
	bne	.L34
.L37:
	mov	r1, #1
	mov	r0, r4
	bl	TREE_OPERAND
	bl	TREE_CODE
	ldr	r3, [r9]
	cmp	r0, r3
	bne	.L34
	mov	r0, r4
	bl	TREE_CODE
	ldr	r3, [fp]
	mov	r1, #1
	cmp	r0, r3
	str	r3, [sp, #8]
	ldreq	r3, .L196+12
	mov	r0, r4
	ldreq	r3, [r3]
	streq	r3, [sp, #8]
	bl	TREE_OPERAND
	mov	r3, #0
	mov	r2, r0
	mov	r1, r5
	ldr	r0, [sp, #8]
	bl	const_binop
	subs	r3, r0, #0
	str	r3, [sp, #8]
	beq	.L34
	bl	TREE_CONSTANT_OVERFLOW
	subs	r1, r0, #0
	bne	.L34
	mov	r0, r4
	bl	TREE_OPERAND
	mov	r1, r7
	mov	r2, r0
	ldr	r3, [sp, #8]
	mov	r0, r6
	bl	fold_build2
	b	.L1
.L194:
	mov	r0, r5
	bl	TREE_TYPE
	ldr	r3, .L196+116
	ldr	r1, [r3]
	bl	build_real
	b	.L173
.L197:
	.align	2
.L196:
	.word	.LC1
	.word	NULL_TREE
	.word	PLUS_EXPR
	.word	MINUS_EXPR
	.word	flag_wrapv
	.word	NEGATE_EXPR
	.word	REAL_CST
	.word	flag_unsafe_math_optimizations
	.word	POSTINCREMENT_EXPR
	.word	POSTDECREMENT_EXPR
	.word	INTEGER_TYPE
	.word	INTEGER_CST
	.word	WARN_STRICT_OVERFLOW_COMPARISON
	.word	.LC0
	.word	ADDR_EXPR
	.word	TRUNC_DIV_EXPR
	.word	EXACT_DIV_EXPR
	.word	flag_errno_math
	.word	END_BUILTINS
	.word	COMPONENT_REF
	.word	PREDECREMENT_EXPR
	.word	LSHIFT_EXPR
	.word	RSHIFT_EXPR
	.word	size_type_node
	.word	NOP_EXPR
	.word	CONVERT_EXPR
	.word	MIN_EXPR
	.word	MAX_EXPR
	.word	PREINCREMENT_EXPR
	.word	dconst0
	.word	integer_one_node
	.word	integer_zero_node
.L193:
	mov	r0, r6
	bl	swap_tree_comparison
	mov	r3, r0
	mov	r1, #0
	mov	r0, r4
	mov	r4, r3
	bl	TREE_OPERAND
	mov	r2, r0
	mov	r0, r5
	mov	r5, r2
	bl	TREE_TYPE
	mov	r6, r0
	ldr	r0, [sp, #8]
	bl	REAL_VALUE_NEGATE
	mov	r1, r0
	mov	r0, r6
	bl	build_real
	mov	r2, r5
	mov	r3, r0
	mov	r1, r7
	mov	r0, r4
	bl	fold_build2
	b	.L1
.L195:
	cmp	r6, #128
	ldreq	r3, .L196+120
	ldrne	r3, .L196+124
	mov	r2, r4
	mov	r0, r7
	ldr	r1, [r3]
	bl	omit_one_operand
	b	.L1
.L190:
	mov	r2, r4
	mov	r1, r5
	mov	r0, r7
	bl	omit_one_operand
	b	.L1
.L177:
	bl	__stack_chk_fail
.L192:
	mov	r1, #0
	bl	build_int_cst
	str	r0, [sp, #32]
	b	.L18
.L191:
	mov	r1, r9
	bl	build_int_cst
	str	r0, [sp, #24]
	b	.L16
.L80:
	ldr	r3, .L196+120
	mov	r2, r4
	mov	r0, r7
	ldr	r1, [r3]
	bl	omit_one_operand
	b	.L1
.L82:
	mov	r6, #132
.L86:
	ldr	r3, [sp, #32]
	mov	r1, r7
	cmp	r3, #0
	mov	r0, r6
	ldr	r2, [sp, #24]
	ldr	r3, [sp, #28]
	beq	.L174
	bl	build2
	bl	save_expr
	b	.L1
.L83:
	mov	r6, #128
	b	.L86
.L84:
	mov	r6, #131
	b	.L86
.L85:
	mov	r6, #130
	b	.L86
.L98:
	mov	r6, #133
	b	.L86
.L88:
	ldr	r3, .L196+124
	mov	r2, r4
	mov	r0, r7
	ldr	r1, [r3]
	bl	omit_one_operand
	b	.L1
.L87:
	mov	r6, #129
	b	.L86
	.size	fold_comparison, .-fold_comparison
	.comm	size_type_node,4,4
	.comm	integer_zero_node,4,4
	.comm	integer_one_node,4,4
	.comm	flag_wrapv,4,4
	.comm	flag_unsafe_math_optimizations,4,4
	.comm	flag_errno_math,4,4
	.comm	dconst0,4,4
	.comm	WARN_STRICT_OVERFLOW_COMPARISON,4,4
	.comm	TRUNC_DIV_EXPR,4,4
	.comm	RSHIFT_EXPR,4,4
	.comm	REAL_CST,4,4
	.comm	PREINCREMENT_EXPR,4,4
	.comm	PREDECREMENT_EXPR,4,4
	.comm	POSTINCREMENT_EXPR,4,4
	.comm	POSTDECREMENT_EXPR,4,4
	.comm	PLUS_EXPR,4,4
	.comm	NULL_TREE,4,4
	.comm	NOP_EXPR,4,4
	.comm	NEGATE_EXPR,4,4
	.comm	MIN_EXPR,4,4
	.comm	MINUS_EXPR,4,4
	.comm	MAX_EXPR,4,4
	.comm	LSHIFT_EXPR,4,4
	.comm	INTEGER_TYPE,4,4
	.comm	INTEGER_CST,4,4
	.comm	EXACT_DIV_EXPR,4,4
	.comm	END_BUILTINS,4,4
	.comm	CONVERT_EXPR,4,4
	.comm	COMPONENT_REF,4,4
	.comm	ADDR_EXPR,4,4
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
