Index: cycle_breaker.h |
diff --git a/cycle_breaker.h b/cycle_breaker.h |
index 9c10c1749230e3531c2ab270272625705a1e7365..f1fa677446522e1668393c198548f58762efab8e 100644 |
--- a/cycle_breaker.h |
+++ b/cycle_breaker.h |
@@ -28,8 +28,11 @@ namespace chromeos_update_engine { |
class CycleBreaker { |
public: |
+ CycleBreaker() : skipped_ops_(0) {} |
// out_cut_edges is replaced with the cut edges. |
void BreakCycles(const Graph& graph, std::set<Edge>* out_cut_edges); |
+ |
+ size_t skipped_ops() const { return skipped_ops_; } |
private: |
void HandleCircuit(); |
@@ -44,6 +47,10 @@ class CycleBreaker { |
Graph blocked_graph_; // "B" in the paper |
std::set<Edge> cut_edges_; |
+ |
+ // Number of operations skipped b/c we know they don't have any |
+ // incoming edges. |
+ size_t skipped_ops_; |
}; |
} // namespace chromeos_update_engine |