Lines Matching refs:accumulator

11 // The classic algorithm: for every part, multiply the accumulator with
14 FromStringAccumulator* accumulator) {
16 DCHECK(accumulator->stack_parts_used_ > 0);
17 Z[0] = accumulator->stack_parts_[0];
23 int num_stack_parts = accumulator->stack_parts_used_;
25 const std::vector<digit_t>& heap_parts = accumulator->heap_parts_;
28 const digit_t max_multiplier = accumulator->max_multiplier_;
33 Add(Z, accumulator->stack_parts_[i]);
36 MultiplySingle(Z, already_set, accumulator->last_multiplier_);
37 Add(Z, accumulator->stack_parts_[num_stack_parts - 1]);
43 Add(Z, accumulator->heap_parts_[i]);
46 MultiplySingle(Z, already_set, accumulator->last_multiplier_);
47 Add(Z, accumulator->heap_parts_.back());
90 FromStringAccumulator* accumulator) {
91 int num_parts = static_cast<int>(accumulator->heap_parts_.size());
94 RWDigits parts(accumulator->heap_parts_.data(), num_parts);
102 digit_t max_multiplier = accumulator->max_multiplier_;
103 digit_t last_multiplier = accumulator->last_multiplier_;
228 // {accumulator->last_multiplier_}.
241 RWDigits Z, FromStringAccumulator* accumulator) {
242 const int num_parts = accumulator->ResultLength();
245 Digits parts(accumulator->heap_parts_.size() > 0
246 ? accumulator->heap_parts_.data()
247 : accumulator->stack_parts_,
249 uint8_t radix = accumulator->radix_;
253 static_cast<int>(accumulator->last_multiplier_);
306 void ProcessorImpl::FromString(RWDigits Z, FromStringAccumulator* accumulator) {
307 if (accumulator->inline_everything_) {
309 for (; i < accumulator->stack_parts_used_; i++) {
310 Z[i] = accumulator->stack_parts_[i];
313 } else if (accumulator->stack_parts_used_ == 0) {
315 } else if (IsPowerOfTwo(accumulator->radix_)) {
316 FromStringBasePowerOfTwo(Z, accumulator);
317 } else if (accumulator->ResultLength() < kFromStringLargeThreshold) {
318 FromStringClassic(Z, accumulator);
320 FromStringLarge(Z, accumulator);
324 Status Processor::FromString(RWDigits Z, FromStringAccumulator* accumulator) {
326 impl->FromString(Z, accumulator);