+/EE306
intro to computing
git clone https://git.julia.blue/+/EE306
51dbf3f
master
1 .ORIGx3000 2AND R6 , R6 , #0 ; R6 (slope) = 0 (positive) 3LD R5 , args 4LDR R1 , R5 , #1 ; R1 = left 5LDR R2 , R5 , #2 ; R2 = right 6JSR mid 7LD R3 , func 8JSRR R3 9AND R5 , R4 , R4 ; R5 = f(mid) 10ADD R0 , R0 , #1 11JSRR R3 12NOT R7 , R4 13ADD R7 , R7 , #-1 ; R7 = -f(mid+1) 14ADD R7 , R7 , R5 15BRnz pslope ; If f(mid) >= f(mid+1): slope is positive 16NOT R6 , R6 17pslope AND R4 , R5 , R5 18BR post 19again JSR mid ; R0 = avg(left, right) 20JSRR R3 21AND R4 , R4 , R4 22post BRz done ; If f(mid) == 0: FINISH 23BRn neg 24AND R6 , R6 , R6 25BRz right ; If slope and f(mid) are positive: right = mid 26BR left ; Else: left = mid 27neg AND R6 , R6 , R6 28BRz left ; If slope and f(mid) are negative: left = mid 29right AND R2 , R0 , R0 ; else right = mid 30BR again 31left AND R1 , R0 , R0 32BR again ; Loop forever 33done STI R0 , args 34HALT 35args .FILLx4000 36func .FILLx5000 37 38; Averages R1 and R2, avoiding overflow errors by computing R1+(R2-R1)>>1 39; rather than (R1+R2)>>1, placing the result in R0 40mid ST R7 , retaddr 41ST R3 , saver3 42NOT R3 , R1 43ADD R3 , R3 , #1 44ADD R3 , R3 , R2 ; R3 = R2-R1 45JSR rshift ; R3 >>= 1 46ADD R0 , R1 , R3 ; R0 = R1+R3 47LD R3 , saver3 48LD R7 , retaddr 49RET 50retaddr .BLKW#1 51saver3 .BLKW#1 52 53; Right shifts the contents of R3 by 1 (sign extended) 54rshift ST R4 , saver4 55ST R5 , saver5 56ST R6 , saver6 57ST R7 , saver7 58AND R4 , R4 , #0 59AND R5 , R5 , #0 60LD R7 , bit15 ; Sign extend 61AND R7 , R7 , R3 62ADD R4 , R4 , #1 ; Create 2 masks, off by 1 bit 63ADD R5 , R5 , #2 64loop AND R6 , R3 , R5 ; If R3[mask1] == 1: result += mask2 65BRz noadd 66ADD R7 , R7 , R4 67noadd ADD R4 , R4 , R4 ; Shift masks left by 1 68ADD R5 , R5 , R5 69BRnp loop ; Repeat for each bit 70AND R3 , R7 , R7 71LD R4 , saver4 72LD R5 , saver5 73LD R6 , saver6 74LD R7 , saver7 75RET 76saver4 .BLKW#1 77saver5 .BLKW#1 78saver6 .BLKW#1 79saver7 .BLKW#1 80bit15 .FILLx8000 81 .END