// #LAYOUT# STD *       #TAKE
// #LAYOUT# *   BASIC_0 #TAKE
// #LAYOUT# *   *       #IGNORE

//
// Math package - multiplies FAC1 by FAC2
//
// Input:
// - .A - must load FAC1 exponent ($61) beforehand to set the zero flag
//
// Note:
// - load FAC2 after FAC1, or mimic the Kernals sign comparison (XXX do we need it?)
//
// See also:
// - [CM64] Computes Mapping the Commodore 64 - page 113 XXX address does not match
// - https://www.c64-wiki.com/wiki/Floating_point_arithmetic
// - https://codebase64.org/doku.php?id=base:kernal_floating_point_mathematics
//

// XXX test this code

mul_FAC2_FAC1_done:

	rts

mul_FAC2_FAC1:

	// First handle special case of multiplying by 0
	
	lda FAC1_exponent
	beq mul_FAC2_FAC1_done
	
	lda FAC2_exponent
	bne !+
	sta FAC1_exponent
	beq mul_FAC2_FAC1_done
!:
	// Multiply signs
	
	lda FAC1_sign
	eor FAC2_sign
	sta FAC1_sign
	
	// Check if exponents can be added without overflow/underflow
	
	lda FAC1_exponent
	and #$80
	eor FAC2_exponent
	
	bmi mul_FAC2_FAC1_add_exponents    // exponent signs are opposite, we can add them safely
	
	// Both exponents are either negative (below $80), or both are non-negative ($80 or above),
	// try to add them
	
	lda FAC1_exponent
	clc
	adc FAC2_exponent
	bpl mul_FAC2_FAC1_sub_exp_bias     // branch if we can add values
	
	// We cannot add them, result would over/underflow; set result as
	// either 0 or maximum possible float
	
	lda FAC1_exponent
	bmi_16 set_FAC1_max

	lda #$00
	sta FAC1_exponent
	rts
	
mul_FAC2_FAC1_add_exponents:
	
	// Add the exponents
	
	lda FAC1_exponent
	clc
	adc FAC2_exponent
	
	// FALLTROUGH
	
mul_FAC2_FAC1_sub_exp_bias:
	
	sec
	sbc #$80                           // bias
	sta FAC1_exponent
	
	// Multiply the mantissas - first clear the RESHO temporary area

	lda #$00
	sta RESHO+0
	sta RESHO+1
	sta RESHO+2
	sta RESHO+3
	sta RESHO+4

	// Multiply the mantissas

	// XXX maybe we should preserve .X on stack? this will not cost us too much

	lda FACOV
	jsr mul_by_A
	jsr mul_shift_RESHO
	bcc !+
	inc RESHO+0
!:
	lda FAC1_mantissa+3
	jsr mul_by_A
	jsr mul_shift_RESHO
	bcc !+
	inc RESHO+0
!:
	lda FAC1_mantissa+2
	jsr mul_by_A
	jsr mul_shift_RESHO
	bcc !+
	inc RESHO+0
!:
	lda FAC1_mantissa+1
	jsr mul_by_A
	jsr mul_shift_RESHO
	bcc !+
	inc RESHO+0
!:
	lda FAC1_mantissa+0
	jsr mul_by_A
	jsr mul_shift_RESHO
	bcc !+
	inc RESHO+0
!:
	// Copy RESHO to FAC1 mantissa

	lda RESHO+4
	sta FACOV
	lda RESHO+3
	sta FAC1_mantissa+3
	lda RESHO+2
	sta FAC1_mantissa+2
	lda RESHO+1
	sta FAC1_mantissa+1
	lda RESHO+0
	sta FAC1_mantissa+0

	// XXX correction is probably needed

	jmp normal_FAC1




mul_by_A: // XXX we should probably move this subroutine to a separate file

	sta INDEX+3

	// Multiply FAC2_mantissa+3

	lda FAC2_mantissa+3
	jsr mul_8x8

	adc RESHO+4
	sta RESHO+4
	txa
	adc RESHO+3
	sta RESHO+3
	bcc !+
	inc RESHO+2
	bcc !+
	inc RESHO+1
	bcc !+
	inc RESHO+0
!:
	// Multiply FAC2_mantissa+2

	lda FAC2_mantissa+2
	jsr mul_8x8

	adc RESHO+3
	sta RESHO+3
	txa
	adc RESHO+2
	sta RESHO+2
	bcc !+
	inc RESHO+1
	bcc !+
	inc RESHO+0
!:
	// Multiply FAC2_mantissa+1

	lda FAC2_mantissa+1
	jsr mul_8x8

	adc RESHO+2
	sta RESHO+2
	txa
	adc RESHO+1
	sta RESHO+1
	bcc !+
	inc RESHO+0
!:
	// Multiply FAC2_mantissa+0

	lda FAC2_mantissa+0
	jsr mul_8x8
	adc RESHO+1
	sta RESHO+1
	txa
	adc RESHO+0
	sta RESHO+0

	rts



mul_shift_RESHO: // XXX we should probably move this subroutine to a separate file

	// Shift RESHO by one byte

	lda RESHO+3
	sta RESHO+4
	lda RESHO+2
	sta RESHO+3
	lda RESHO+1
	sta RESHO+2
	lda RESHO+0
	sta RESHO+1
	lda #$00
	sta RESHO+0

	rts


mul_8x8: // XXX we should probably move this subroutine to a separate file

	sta INDEX+2

	// Routine based on code by djmips, taken from:
	// - https://codebase64.org/doku.php?id=base:8bit_multiplication_16bit_product_fast_no_tables
	//
	// input: INDEX+2, INDEX+3
	// output: .X (high byte), .A and INDEX+2 (low byte), carry always clear

	lda #$00

	dec INDEX+3	// decrement because we will be adding with carry set for speed (an extra one)
	ror INDEX+2
	bcc !+
	adc INDEX+3
!:
	ror
	ror INDEX+2
	bcc !+
	adc INDEX+3
!:
	ror
	ror INDEX+2
	bcc !+
	adc INDEX+3
!:
	ror
	ror INDEX+2
	bcc !+
	adc INDEX+3
!:
	ror
	ror INDEX+2
	bcc !+
	adc INDEX+3
!:
	ror
	ror INDEX+2
	bcc !+
	adc INDEX+3
!:
	ror
	ror INDEX+2
	bcc !+
	adc INDEX+3
!:
	ror
	ror INDEX+2
	bcc !+
	adc INDEX+3
!:
	ror
	ror INDEX+2
	inc INDEX+3

	tax
	lda INDEX+2
	clc

	rts