Home
last modified time | relevance | path

Searched refs:word_shift (Results 1 – 2 of 2) sorted by relevance

/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
Dcharconv_bigint.h104 const int word_shift = count / 32; in ShiftLeft() local
105 if (word_shift >= max_words) { in ShiftLeft()
109 size_ = (std::min)(size_ + word_shift, max_words); in ShiftLeft()
112 std::copy_backward(words_, words_ + size_ - word_shift, words_ + size_); in ShiftLeft()
114 for (int i = (std::min)(size_, max_words - 1); i > word_shift; --i) { in ShiftLeft()
115 words_[i] = (words_[i - word_shift] << count) | in ShiftLeft()
116 (words_[i - word_shift - 1] >> (32 - count)); in ShiftLeft()
118 words_[word_shift] = words_[0] << count; in ShiftLeft()
124 std::fill(words_, words_ + word_shift, 0u); in ShiftLeft()
/third_party/abseil-cpp/absl/strings/internal/
Dcharconv_bigint.h104 const int word_shift = count / 32; in ShiftLeft() local
105 if (word_shift >= max_words) { in ShiftLeft()
109 size_ = (std::min)(size_ + word_shift, max_words); in ShiftLeft()
112 std::copy_backward(words_, words_ + size_ - word_shift, words_ + size_); in ShiftLeft()
114 for (int i = (std::min)(size_, max_words - 1); i > word_shift; --i) { in ShiftLeft()
115 words_[i] = (words_[i - word_shift] << count) | in ShiftLeft()
116 (words_[i - word_shift - 1] >> (32 - count)); in ShiftLeft()
118 words_[word_shift] = words_[0] << count; in ShiftLeft()
124 std::fill(words_, words_ + word_shift, 0u); in ShiftLeft()