Lines Matching refs:Bit
313 ;; Bit n of A is 1 --> C += B << n
324 ;; Carry = n-th bit of A
327 ;; If bit n of A is set, then go add B * 2^n to C
453 1: ;; If bit n of A is set, then add B * 2^n to the result in CC
460 3: ;; A >>= 1: Carry = n-th bit of A
757 0: ;; Shift N-th Bit of B[] into Carry. N = 24 - Loop
760 ;; If the N-th Bit of B[] was set...
969 ;; A helper for some 64-bit multiplications with MUL available
1025 0: ;; Rotate B[] right by 1 and set Carry to the N-th Bit of B[]
1032 ;; If the N-th Bit of B[] was set then...
1794 ;; Bit-Counter in Division Routine
1833 ;; Worker Routine for 64-Bit unsigned Quotient and Remainder Computation
1837 ;; T = 1: Compute Remainder in A[] and shift SS one Bit left
1883 2: ;; Initialze Bit-Counter with Number of Bits still to be performed
1901 ;; and it is still smaller than the Divisor --> Shift one 32-Bit Chunk
1906 ;; Set Bit Counter to 32
1933 ;; ...and set according Bit in the upcoming Quotient
1934 ;; The Bit will travel to its final Position
1937 4: ;; This Bit is done
2017 3: ;; Do the unsigned 64-Bit Division/Modulo (depending on T-flag)
2168 ;; This function does not clobber T-flag; 64-bit division relies on it
2786 * Find first set Bit (ffs)
2790 ;; find first set bit
2813 ;; find first set bit
3121 * 64-bit shifts
3308 ;; 1.0 = 0x80, so test for bit 7 of B to see if A must to be added to C.
Indexes created Sat Jun 27 00:24:51 UTC 2026