Coverity fixes to keep coverity quiet....

courgette/adjustment_method.cc

 // Copyright (c) 2009 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "courgette/adjustment_method.h"
 
 #include <algorithm>
 #include <list>
 #include <map>
 #include <set>
@@ skipping 201 matching lines @@
   }
 };
 
 typedef std::set<Node*, OrderNodeByWeightDecreasing> NodeQueue;
 
 class AssignmentProblem {
  public:
   AssignmentProblem(const Trace& model,
                     const Trace& problem)
       : m_trace_(model),
-        p_trace_(problem) {
+        p_trace_(problem),
+        m_root_(NULL),
+        p_root_(NULL) {
   }
 
   ~AssignmentProblem() {
     for (size_t i = 0;  i < all_nodes_.size();  ++i)
       delete all_nodes_[i];
   }
 
   bool Solve() {
     m_root_ = MakeRootNode(m_trace_);
     p_root_ = MakeRootNode(p_trace_);
@@ skipping 339 matching lines @@
   NodeQueue worklist_;
   NodeQueue unsolved_;
 
   std::vector<Node*> all_nodes_;
 
   DISALLOW_COPY_AND_ASSIGN(AssignmentProblem);
 };
 
 class GraphAdjuster : public AdjustmentMethod {
  public:
-  GraphAdjuster() {}
+  GraphAdjuster()
+      : prog_(NULL),
+        model_(NULL),
+        debug_label_index_gen_(0) {}
   ~GraphAdjuster() {}
 
   bool Adjust(const AssemblyProgram& model, AssemblyProgram* program) {
     LOG(INFO) << "GraphAdjuster::Adjust";
     prog_ = program;
     model_ = &model;
     debug_label_index_gen_ = 0;
     return Finish();
   }
 
@@ skipping 101 matching lines @@
   AdjustmentMethod* method = AdjustmentMethod::MakeProductionAdjustmentMethod();
   bool ok = method->Adjust(model, program);
   method->Destroy();
   if (ok)
     return C_OK;
   else
     return C_ADJUSTMENT_FAILED;
 }
 
 }  // namespace courgette