154     const FunctionSample& current,  in InterpolatingPolynomialMinimizingStepSize()  argument
157   if (!current.value_is_valid ||  in InterpolatingPolynomialMinimizingStepSize()
159        max_step_size <= current.x)) {  in InterpolatingPolynomialMinimizingStepSize()
162     return min(max(current.x * 0.5, min_step_size), max_step_size);  in InterpolatingPolynomialMinimizingStepSize()
164     CHECK_GT(max_step_size, current.x);  in InterpolatingPolynomialMinimizingStepSize()
181       << ", current: " << current;  in InterpolatingPolynomialMinimizingStepSize()
191     samples.push_back(ValueSample(current.x, current.value));  in InterpolatingPolynomialMinimizingStepSize()
200     samples.push_back(current);  in InterpolatingPolynomialMinimizingStepSize()
241   FunctionSample current = ValueAndGradientSample(step_size_estimate, 0.0, 0.0);  in Search()  local
242   current.value_is_valid = false;  in Search()
257   current.value_is_valid =  in Search()
258       function->Evaluate(current.x,  in Search()
259                          &current.value,  in Search()
261                          ? &current.gradient : NULL);  in Search()
262   current.gradient_is_valid =  in Search()
263       interpolation_uses_gradient_at_current_sample && current.value_is_valid;  in Search()
264   while (!current.value_is_valid ||  in Search()
265          current.value > (initial_cost  in Search()
268                           * current.x)) {  in Search()
287             current,  in Search()
288             (options().max_step_contraction * current.x),  in Search()
289             (options().min_step_contraction * current.x));  in Search()
300     previous = current;  in Search()
301     current.x = step_size;  in Search()
307     current.value_is_valid =  in Search()
308       function->Evaluate(current.x,  in Search()
309                          &current.value,  in Search()
311                          ? &current.gradient : NULL);  in Search()
312     current.gradient_is_valid =  in Search()
313         interpolation_uses_gradient_at_current_sample && current.value_is_valid;  in Search()
316   summary->optimal_step_size = current.x;  in Search()
463   FunctionSample current = ValueAndGradientSample(step_size_estimate, 0.0, 0.0);  in BracketingPhase()  local
464   current.value_is_valid = false;  in BracketingPhase()
483   current.value_is_valid =  in BracketingPhase()
484       function->Evaluate(current.x,  in BracketingPhase()
485                          &current.value,  in BracketingPhase()
486                          &current.gradient);  in BracketingPhase()
487   current.gradient_is_valid = current.value_is_valid;  in BracketingPhase()
492     if (current.value_is_valid &&  in BracketingPhase()
493         (current.value > (initial_position.value  in BracketingPhase()
496                           * current.x) ||  in BracketingPhase()
497          (previous.value_is_valid && current.value > previous.value))) {  in BracketingPhase()
503       *bracket_high = current;  in BracketingPhase()
506               << "Bracket found: current step (" << current.x  in BracketingPhase()
512     if (current.value_is_valid &&  in BracketingPhase()
513         fabs(current.gradient) <=  in BracketingPhase()
517       *bracket_low = current;  in BracketingPhase()
518       *bracket_high = current;  in BracketingPhase()
521               << "Bracketing phase found step size: " << current.x  in BracketingPhase()
523               << initial_position << ", current: " << current;  in BracketingPhase()
526     } else if (current.value_is_valid && current.gradient >= 0) {  in BracketingPhase()
534       *bracket_low = current;  in BracketingPhase()
536       VLOG(3) << "Bracket found: current step (" << current.x  in BracketingPhase()
541     } else if (current.value_is_valid &&  in BracketingPhase()
542                fabs(current.x - previous.x) * descent_direction_max_norm  in BracketingPhase()
551           << "bracket width: " << fabs(current.x - previous.x)  in BracketingPhase()
559       *bracket_low = current;  in BracketingPhase()
576           current.value_is_valid && current.value < bracket_low->value  in BracketingPhase()
577           ? current : *bracket_low;  in BracketingPhase()
587         current.value_is_valid  in BracketingPhase()
588         ? (current.x * options().max_step_expansion) : current.x;  in BracketingPhase()
602             current,  in BracketingPhase()
614     previous = current.value_is_valid ? current : previous;  in BracketingPhase()
615     current.x = step_size;  in BracketingPhase()
619     current.value_is_valid =  in BracketingPhase()
620         function->Evaluate(current.x,  in BracketingPhase()
621                            &current.value,  in BracketingPhase()
622                            &current.gradient);  in BracketingPhase()
623     current.gradient_is_valid = current.value_is_valid;  in BracketingPhase()