Searched refs:digit_shift (Results 1 – 4 of 4) sorted by relevance
/third_party/node/deps/v8/src/bigint/ |
D | mul-fft.cc | 94 void ShiftModFn_Large(digit_t* result, const digit_t* input, int digit_shift, in ShiftModFn_Large() argument 110 DCHECK(digit_shift >= K); in ShiftModFn_Large() 111 digit_shift -= K; in ShiftModFn_Large() 115 for (int i = 0; i < digit_shift; i++) { in ShiftModFn_Large() 116 result[i] = digit_add2(input[i + K - digit_shift], carry, &carry); in ShiftModFn_Large() 118 result[digit_shift] = digit_sub(input[K] + carry, input[0], &borrow); in ShiftModFn_Large() 119 for (int i = digit_shift + 1; i < K; i++) { in ShiftModFn_Large() 120 digit_t d = input[i - digit_shift]; in ShiftModFn_Large() 126 input[K - digit_shift - 1] >> (kDigitBits - bits_shift); in ShiftModFn_Large() 127 for (int i = 0; i < digit_shift; i++) { in ShiftModFn_Large() [all …]
|
D | bitwise.cc | 137 int digit_shift = static_cast<int>(shift / kDigitBits); in LeftShift() local 141 for (; i < digit_shift; ++i) Z[i] = 0; in LeftShift() 143 for (; i < X.len() + digit_shift; ++i) Z[i] = X[i - digit_shift]; in LeftShift() 147 for (; i < X.len() + digit_shift; ++i) { in LeftShift() 148 digit_t d = X[i - digit_shift]; in LeftShift() 159 int digit_shift = static_cast<int>(shift / kDigitBits); in RightShift_ResultLength() local 161 int result_length = X.len() - digit_shift; in RightShift_ResultLength() 170 if ((X[digit_shift] & mask) != 0) { in RightShift_ResultLength() 173 for (int i = 0; i < digit_shift; i++) { in RightShift_ResultLength() 197 int digit_shift = static_cast<int>(shift / kDigitBits); in RightShift() local [all …]
|
D | div-burnikel.cc | 214 int digit_shift = n - s; in DivideBurnikelZiegler() local 217 LeftShift(B_shifted + digit_shift, B, sigma); in DivideBurnikelZiegler() 218 for (int i = 0; i < digit_shift; i++) B_shifted[i] = 0; in DivideBurnikelZiegler() 225 r = A.len() + digit_shift + extra_digit; in DivideBurnikelZiegler() 227 LeftShift(A_shifted + digit_shift, A, sigma); in DivideBurnikelZiegler() 228 for (int i = 0; i < digit_shift; i++) A_shifted[i] = 0; in DivideBurnikelZiegler() 266 for (int i = 0; i < digit_shift; i++) { in DivideBurnikelZiegler() 271 Digits Ri_part(Ri, digit_shift, Ri.len()); in DivideBurnikelZiegler()
|
D | bigint.h | 370 int digit_shift = static_cast<int>(shift / kDigitBits); in LeftShift_ResultLength() local 374 return x_length + digit_shift + grow; in LeftShift_ResultLength()
|