by Scott Dattalo Given two bits at any bit position of any arbitrary registers, what's the fastest way to find their sum and place that into yet another bit position of an arbitrary register?
I get 6-cycles:
movlw 1<<result_bit_position bcf result,result_bit_position btfsc x1,x1_bit_position xorwf result,f btfsc x2,x2_bit_position xorwf result,f