|
4 | 4 |
|
5 | 5 | ; A research paper on selecting good parameters for the multiplier: |
6 | 6 | ; https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.34.1024&rep=rep1&type=pdf |
| 7 | +; We'll use m = 2891336453, or 0xAC564B05 from Table 4. |
| 8 | +; Any odd integer will do for c, so we'll take a random value. |
7 | 9 |
|
| 10 | + |
| 11 | + |
| 12 | +* = $FCE7 |
| 13 | +;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
| 14 | +;; Bank 0F, $FCE7 (BattleRNG) ;; |
| 15 | +;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
| 16 | + |
| 17 | +battle_rng_state = $68AF |
| 18 | + |
| 19 | +BattleRNG: |
| 20 | + LDA battle_rng_state ; Get the first byte of state |
| 21 | + TAX |
| 22 | + LDA battle_rng_m ; Get the first byte of m |
| 23 | + JSR MultiplyXA ; Multiply state by m |
| 24 | + CLC |
| 25 | + ADC battle_rng_c ; Add c |
| 26 | + BCC :+ |
| 27 | + INX ; Increment high bits if necessary |
| 28 | + CLC |
| 29 | + : |
| 30 | + STA battle_rng_state ; Store the low bits back to state |
| 31 | + TXA |
| 32 | + STA btltmp_multA ; Save the high bits for the next step |
| 33 | + |
| 34 | + LDA battle_rng_state + 1 ; Now do it again for the next byte of state |
| 35 | + TAX |
| 36 | + LDA battle_rng_m + 1 |
| 37 | + JSR MultiplyXA |
| 38 | + CLC |
| 39 | + ADC battle_rng_c + 1 |
| 40 | + BCC :+ |
| 41 | + INX |
| 42 | + CLC |
| 43 | + : |
| 44 | + ADC btltmp_multA ; Add the high bits from the previous step |
| 45 | + BCC :+ |
| 46 | + INX |
| 47 | + CLC |
| 48 | + : |
| 49 | + STA battle_rng_state + 1 |
| 50 | + TXA |
| 51 | + STA btltmp_multA |
| 52 | + |
| 53 | + LDA battle_rng_state + 2 |
| 54 | + TAX |
| 55 | + LDA battle_rng_m + 2 |
| 56 | + JSR MultiplyXA |
| 57 | + CLC |
| 58 | + ADC battle_rng_c + 2 |
| 59 | + BCC :+ |
| 60 | + INX |
| 61 | + CLC |
| 62 | + : |
| 63 | + ADC btltmp_multA |
| 64 | + BCC :+ |
| 65 | + INX |
| 66 | + CLC |
| 67 | + : |
| 68 | + STA battle_rng_state + 2 |
| 69 | + TXA |
| 70 | + STA btltmp_multA |
| 71 | + |
| 72 | + LDA battle_rng_state + 3 ; Last byte |
| 73 | + TAX |
| 74 | + LDA battle_rng_m + 3 |
| 75 | + JSR MultiplyXA |
| 76 | + CLC |
| 77 | + ADC battle_rng_c + 3 |
| 78 | + CLC ; No need to save the high bits, so just CLC |
| 79 | + ADC btltmp_multA |
| 80 | + CLC ; Just in case |
| 81 | + STA battle_rng_state + 3 |
| 82 | + |
| 83 | + ; And we're done. A already has the highest bits of state, and that's what we want to return. |
| 84 | + RTS |
| 85 | + |
| 86 | +battle_rng_m: |
| 87 | + .BYTE $05, $4B, $56, $AC ; m |
| 88 | +battle_rng_c: |
| 89 | + .BYTE $00, $00, $00, $00 ; c (this will be replaced by the randomizer) |
| 90 | + |
| 91 | + |
| 92 | + |
| 93 | +; MultiplyXA copied from bank 0B |
| 94 | +btltmp_multA = $68B3 |
| 95 | +btltmp_multB = $68B4 |
| 96 | +btltmp_multC = $68B5 |
| 97 | + |
| 98 | +MultiplyXA: |
| 99 | + STA btltmp_multA ; store the values we'll be multiplying |
| 100 | + STX btltmp_multB |
| 101 | + LDX #$08 ; Use x as a loop counter. X=8 for 8 bits |
| 102 | + |
| 103 | + LDA #$00 ; A will be the high byte of the product |
| 104 | + STA btltmp_multC ; multC will be the low byte |
| 105 | + |
| 106 | + ; For each bit in multA |
| 107 | + @Loop: |
| 108 | + LSR btltmp_multA ; shift out the low bit |
| 109 | + BCC :+ |
| 110 | + CLC ; if it was set, add multB to our product |
| 111 | + ADC btltmp_multB |
| 112 | + : ROR A ; then rotate down our product |
| 113 | + ROR btltmp_multC |
| 114 | + DEX |
| 115 | + BNE @Loop |
| 116 | + |
| 117 | + TAX ; put high bits of product in X |
| 118 | + LDA btltmp_multC ; put low bits in A |
| 119 | + RTS |
0 commit comments