Lines Matching defs:digitMove
890 void BigInt::RightShift(JSHandle<BigInt> bigint, JSHandle<BigInt> x, uint32_t digitMove, uint32_t bitsMove)
894 for (uint32_t i = digitMove; i < size; i++) {
895 bigint->SetDigit(i - digitMove, x->GetDigit(i));
898 uint32_t carry = x->GetDigit(digitMove) >> bitsMove;
899 ASSERT(size > digitMove);
900 uint32_t last = size - digitMove - 1;
902 uint32_t value = x->GetDigit(i + digitMove + 1);
910 void BigInt::JudgeRoundDown(JSHandle<BigInt> x, uint32_t digitMove, uint32_t bitsMove, uint32_t &needLen,
914 if (x->GetDigit(digitMove) & stamp) {
917 for (uint32_t i = 0; i < digitMove; i++) {
943 uint32_t digitMove = moveNum / DATEBITS;
945 if (x->GetLength() <= digitMove) {
948 uint32_t needLen = x->GetLength() - digitMove;
953 JudgeRoundDown(x, digitMove, bitsMove, needLen, roundDown);
958 RightShift(bigint, x, digitMove, bitsMove);
985 uint32_t digitMove = moveNum / DATEBITS;
988 uint32_t needLen = digitMove + x->GetLength() + static_cast<uint32_t>(!!bitsMove);
992 uint32_t index = digitMove;
994 bigint->SetDigit(index, x->GetDigit(index - digitMove));
1002 bigint->SetDigit(index + digitMove, (value << bitsMove) | carry);
1007 ASSERT(index + digitMove < needLen);
1008 bigint->SetDigit(index + digitMove, carry);