| // Ceres Solver - A fast non-linear least squares minimizer |
| // Copyright 2019 Google Inc. All rights reserved. |
| // http://code.google.com/p/ceres-solver/ |
| // |
| // Redistribution and use in source and binary forms, with or without |
| // modification, are permitted provided that the following conditions are met: |
| // |
| // * Redistributions of source code must retain the above copyright notice, |
| // this list of conditions and the following disclaimer. |
| // * Redistributions in binary form must reproduce the above copyright notice, |
| // this list of conditions and the following disclaimer in the documentation |
| // and/or other materials provided with the distribution. |
| // * Neither the name of Google Inc. nor the names of its contributors may be |
| // used to endorse or promote products derived from this software without |
| // specific prior written permission. |
| // |
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| // POSSIBILITY OF SUCH DAMAGE. |
| // |
| // Author: darius.rueckert@fau.de (Darius Rueckert) |
| |
| #include "ceres/codegen/internal/optimize_expression_graph.h" |
| |
| #include "ceres/codegen/internal/eliminate_nops.h" |
| #include "glog/logging.h" |
| namespace ceres { |
| namespace internal { |
| |
| OptimizeExpressionGraphSummary OptimizeExpressionGraph( |
| const OptimizeExpressionGraphOptions& options, ExpressionGraph* graph) { |
| OptimizeExpressionGraphSummary summary; |
| summary.num_iterations = 0; |
| while (summary.num_iterations < options.max_num_iterations) { |
| summary.num_iterations++; |
| bool changed = false; |
| |
| if (options.eliminate_nops) { |
| auto pass_summary = EliminateNops(graph); |
| changed |= pass_summary.expression_graph_changed; |
| summary.summaries.push_back(pass_summary); |
| } |
| |
| if (!changed) { |
| break; |
| } |
| } |
| return summary; |
| } |
| |
| } // namespace internal |
| } // namespace ceres |