151     const FunctionSample& current,  in InterpolatingPolynomialMinimizingStepSize()  argument
154   if (!current.value_is_valid ||  in InterpolatingPolynomialMinimizingStepSize()
156        max_step_size <= current.x)) {  in InterpolatingPolynomialMinimizingStepSize()
159     return min(max(current.x * 0.5, min_step_size), max_step_size);  in InterpolatingPolynomialMinimizingStepSize()
161     CHECK_GT(max_step_size, current.x);  in InterpolatingPolynomialMinimizingStepSize()
177       << ", current: " << current;  in InterpolatingPolynomialMinimizingStepSize()
187     samples.push_back(ValueSample(current.x, current.value));  in InterpolatingPolynomialMinimizingStepSize()
196     samples.push_back(current);  in InterpolatingPolynomialMinimizingStepSize()
237   FunctionSample current = ValueAndGradientSample(step_size_estimate, 0.0, 0.0);  in Search()  local
238   current.value_is_valid = false;  in Search()
247   current.value_is_valid =  in Search()
248       function->Evaluate(current.x,  in Search()
249                          &current.value,  in Search()
251                          ? &current.gradient : NULL);  in Search()
252   current.gradient_is_valid =  in Search()
253       interpolation_uses_gradients && current.value_is_valid;  in Search()
254   while (!current.value_is_valid ||  in Search()
255          current.value > (initial_cost  in Search()
258                           * current.x)) {  in Search()
277             current,  in Search()
278             (options().max_step_contraction * current.x),  in Search()
279             (options().min_step_contraction * current.x));  in Search()
290     previous = current;  in Search()
291     current.x = step_size;  in Search()
295     current.value_is_valid =  in Search()
296       function->Evaluate(current.x,  in Search()
297                          &current.value,  in Search()
299                          ? &current.gradient : NULL);  in Search()
300     current.gradient_is_valid =  in Search()
301         interpolation_uses_gradients && current.value_is_valid;  in Search()
304   summary->optimal_step_size = current.x;  in Search()
437   FunctionSample current = ValueAndGradientSample(step_size_estimate, 0.0, 0.0);  in BracketingPhase()  local
438   current.value_is_valid = false;  in BracketingPhase()
450   current.value_is_valid =  in BracketingPhase()
451       function->Evaluate(current.x,  in BracketingPhase()
452                          &current.value,  in BracketingPhase()
454                          ? &current.gradient : NULL);  in BracketingPhase()
455   current.gradient_is_valid =  in BracketingPhase()
456       interpolation_uses_gradients && current.value_is_valid;  in BracketingPhase()
461     if (current.value_is_valid &&  in BracketingPhase()
462         (current.value > (initial_position.value  in BracketingPhase()
465                           * current.x) ||  in BracketingPhase()
466          (previous.value_is_valid && current.value > previous.value))) {  in BracketingPhase()
472       *bracket_high = current;  in BracketingPhase()
482       current.value_is_valid =  in BracketingPhase()
483           function->Evaluate(current.x,  in BracketingPhase()
484                              &current.value,  in BracketingPhase()
485                              &current.gradient);  in BracketingPhase()
486       current.gradient_is_valid = current.value_is_valid;  in BracketingPhase()
489     if (current.value_is_valid &&  in BracketingPhase()
490         fabs(current.gradient) <=  in BracketingPhase()
494       *bracket_low = current;  in BracketingPhase()
495       *bracket_high = current;  in BracketingPhase()
498     } else if (current.value_is_valid && current.gradient >= 0) {  in BracketingPhase()
506       *bracket_low = current;  in BracketingPhase()
524           current.value_is_valid && current.value < bracket_low->value  in BracketingPhase()
525           ? current : *bracket_low;  in BracketingPhase()
535         current.value_is_valid  in BracketingPhase()
536         ? (current.x * options().max_step_expansion) : current.x;  in BracketingPhase()
550             current,  in BracketingPhase()
562     previous = current.value_is_valid ? current : previous;  in BracketingPhase()
563     current.x = step_size;  in BracketingPhase()
567     current.value_is_valid =  in BracketingPhase()
568         function->Evaluate(current.x,  in BracketingPhase()
569                            &current.value,  in BracketingPhase()
571                            ? &current.gradient : NULL);  in BracketingPhase()
572     current.gradient_is_valid =  in BracketingPhase()
573         interpolation_uses_gradients && current.value_is_valid;  in BracketingPhase()