/ Long remainder.globl	lrem.globl	csv, cretlrem:	jsr	r5,csv	mov	10.(r5),r3	sxt	r4	bpl	1f	neg	r31:	cmp	r4,8.(r5)	bne	hardlrem	mov	6.(r5),r2	mov	4.(r5),r1	mov	r1,r4	bge	1f	neg	r1	neg	r2	sbc	r11:	clr	r0	div	r3,r0	mov	r1,r0	mov	r2,r1	div	r3,r0	bvc	1f	sub	r3,r0	div	r3,r0	tst	r1	beq	9f	add	r3,r11:	tst	r4	bpl	9f	neg	r19:	sxt	r0	jmp	cret/ The divisor is known to be >= 2^15.  Only 16 cycles are/ needed to get a remainder.hardlrem:	mov	6.(r5),r2	mov	4.(r5),r1	bpl	1f	neg	r1	neg	r2	sbc	r11:	clr	r0	mov	8.(r5),r3	bge	1f	neg	r3	neg	10.(r5)	sbc	r31:	mov	$16.,r41:	clc	rol	r2	rol	r1	rol	r0	cmp	r3,r0	blt	2f	bgt	3f	cmp	10.(r5),r1	blos	2f3:	sob	r4,1b	br	1f2:	sub	10.(r5),r1	sbc	r0	sub	r3,r0	sob	r4,1b1:	tst	4(r5)	bge	1f	neg	r0	neg	r1	sbc	r01:	jmp	cret