From d37a8f5233a83d68d36010cb60ada8091071d40f Mon Sep 17 00:00:00 2001 From: James Cherry Date: Fri, 22 Jan 2021 16:07:04 -0700 Subject: [PATCH] debugPrint zero arg warning --- dcalc/DmpCeff.cc | 6 +++--- sdc/Sdc.cc | 2 +- search/ClkNetwork.cc | 4 ++-- search/Genclks.cc | 2 +- search/Levelize.cc | 6 +++--- search/PathEnum.cc | 2 +- search/Power.cc | 6 +++--- search/Search.cc | 10 +++++----- search/WorstSlack.cc | 6 +++--- 9 files changed, 22 insertions(+), 22 deletions(-) diff --git a/dcalc/DmpCeff.cc b/dcalc/DmpCeff.cc index 85ad37e7..a8f4413a 100644 --- a/dcalc/DmpCeff.cc +++ b/dcalc/DmpCeff.cc @@ -730,7 +730,7 @@ DmpCap::init(const LibertyLibrary *drvr_library, double rpi, double c1) { - debugPrint(debug_, "dmp_ceff", 3, "Using DMP cap"); + debugPrint0(debug_, "dmp_ceff", 3, "Using DMP cap"); DmpAlg::init(drvr_library, drvr_cell, pvt, gate_model, rf, rd, in_slew, related_out_cap, c2, rpi, c1); ceff_ = c1 + c2; @@ -871,7 +871,7 @@ DmpPi::init(const LibertyLibrary *drvr_library, double rpi, double c1) { - debugPrint(debug_, "dmp_ceff", 3, "Using DMP Pi"); + debugPrint0(debug_, "dmp_ceff", 3, "Using DMP Pi"); DmpAlg::init(drvr_library, drvr_cell, pvt, gate_model, rf, rd, in_slew, related_out_cap, c2, rpi, c1); @@ -1185,7 +1185,7 @@ DmpZeroC2::init(const LibertyLibrary *drvr_library, double rpi, double c1) { - debugPrint(debug_, "dmp_ceff", 3, "Using DMP C2=0"); + debugPrint0(debug_, "dmp_ceff", 3, "Using DMP C2=0"); DmpAlg::init(drvr_library, drvr_cell, pvt, gate_model, rf, rd, in_slew, related_out_cap, c2, rpi, c1); ceff_ = c1; diff --git a/sdc/Sdc.cc b/sdc/Sdc.cc index 5963ca0d..6411953f 100644 --- a/sdc/Sdc.cc +++ b/sdc/Sdc.cc @@ -4243,7 +4243,7 @@ Sdc::makeLoopExceptions() void Sdc::makeLoopExceptions(GraphLoop *loop) { - debugPrint(debug_, "loop", 2, "Loop false path"); + debugPrint0(debug_, "loop", 2, "Loop false path"); EdgeSeq::Iterator loop_edge_iter(loop->edges()); while (loop_edge_iter.hasNext()) { Edge *edge = loop_edge_iter.next(); diff --git a/search/ClkNetwork.cc b/search/ClkNetwork.cc index a1b5dbec..0a040059 100644 --- a/search/ClkNetwork.cc +++ b/search/ClkNetwork.cc @@ -51,7 +51,7 @@ ClkNetwork::clear() void ClkNetwork::clkPinsInvalid() { - debugPrint(debug_, "clk_network", 1, "clk network invalid"); + debugPrint0(debug_, "clk_network", 1, "clk network invalid"); clk_pins_valid_ = false; } @@ -98,7 +98,7 @@ ClkSearchPred::searchTo(const Vertex *to) void ClkNetwork::findClkPins() { - debugPrint(debug_, "clk_network", 1, "find clk network"); + debugPrint0(debug_, "clk_network", 1, "find clk network"); clear(); findClkPins(false, pin_clks_map_); findClkPins(true, pin_ideal_clks_map_); diff --git a/search/Genclks.cc b/search/Genclks.cc index f500a6d5..4db9b4d6 100644 --- a/search/Genclks.cc +++ b/search/Genclks.cc @@ -195,7 +195,7 @@ Genclks::ensureInsertionDelays() { if (!found_insertion_delays_) { Stats stats(debug_, report_); - debugPrint(debug_, "genclk", 1, "find generated clk insertion delays"); + debugPrint0(debug_, "genclk", 1, "find generated clk insertion delays"); ClockSeq gclks; for (auto clk : sdc_->clks()) { diff --git a/search/Levelize.cc b/search/Levelize.cc index 836d4e3a..24befe94 100644 --- a/search/Levelize.cc +++ b/search/Levelize.cc @@ -115,7 +115,7 @@ void Levelize::levelize() { Stats stats(debug_, report_); - debugPrint(debug_, "levelize", 1, "levelize"); + debugPrint0(debug_, "levelize", 1, "levelize"); max_level_ = 0; clearLoopEdges(); deleteLoops(); @@ -276,7 +276,7 @@ EdgeSeq * Levelize::loopEdges(EdgeSeq &path, Edge *closing_edge) { - debugPrint(debug_, "loop", 2, "Loop"); + debugPrint0(debug_, "loop", 2, "Loop"); EdgeSeq *loop_edges = new EdgeSeq; // Skip the "head" of the path up to where closing_edge closes the loop. Pin *loop_pin = closing_edge->to(graph_)->pin(); @@ -355,7 +355,7 @@ Levelize::levelizeCycles() void Levelize::invalid() { - debugPrint(debug_, "levelize", 1, "levels invalid"); + debugPrint0(debug_, "levelize", 1, "levels invalid"); clear(); } diff --git a/search/PathEnum.cc b/search/PathEnum.cc index a15eb22e..c316e327 100644 --- a/search/PathEnum.cc +++ b/search/PathEnum.cc @@ -434,7 +434,7 @@ PathEnum::makeDiversion(PathEnd *div_end, void PathEnum::pruneDiversionQueue() { - debugPrint(debug_, "path_enum", 2, "prune queue"); + debugPrint0(debug_, "path_enum", 2, "prune queue"); VertexPathCountMap path_counts; int end_count = 0; // Collect endpoint_count diversions per vertex. diff --git a/search/Power.cc b/search/Power.cc index 60008957..b5d2a76a 100644 --- a/search/Power.cc +++ b/search/Power.cc @@ -661,7 +661,7 @@ Power::findInputInternalPower(const Pin *pin, Vertex *vertex = graph_->pinLoadVertex(pin); debugPrint(debug_, "power", 2, " cap = %s", units_->capacitanceUnit()->asString(load_cap)); - debugPrint(debug_, "power", 2, " whena act/ns duty energy power"); + debugPrint0(debug_, "power", 2, " when act/ns duty energy power"); float internal = 0.0; for (InternalPower *pwr : *internal_pwrs) { const char *related_pg_pin = pwr->relatedPgPin(); @@ -806,8 +806,8 @@ Power::findOutputInternalPower(const Pin *to_pin, } float energy = 0.0; int tr_count = 0; - debugPrint(debug_, "power", 2, - " when act/ns duty wgt energy power"); + debugPrint0(debug_, "power", 2, + " when act/ns duty wgt energy power"); for (auto to_rf : RiseFall::range()) { // Use unateness to find from_rf. RiseFall *from_rf = positive_unate ? to_rf : to_rf->opposite(); diff --git a/search/Search.cc b/search/Search.cc index f4b0df0e..0efa662c 100644 --- a/search/Search.cc +++ b/search/Search.cc @@ -392,7 +392,7 @@ Search::copyState(const StaState *sta) void Search::deletePaths() { - debugPrint(debug_, "search", 1, "delete paths"); + debugPrint0(debug_, "search", 1, "delete paths"); if (arrivals_exist_) { VertexIterator vertex_iter(graph_); while (vertex_iter.hasNext()) { @@ -662,7 +662,7 @@ void Search::arrivalsInvalid() { if (arrivals_exist_) { - debugPrint(debug_, "search", 1, "arrivals invalid"); + debugPrint0(debug_, "search", 1, "arrivals invalid"); // Delete paths to make sure no state is left over. // For example, set_disable_timing strands a vertex, which means // the search won't revisit it to clear the previous arrival. @@ -689,7 +689,7 @@ Search::arrivalsInvalid() void Search::requiredsInvalid() { - debugPrint(debug_, "search", 1, "requireds invalid"); + debugPrint0(debug_, "search", 1, "requireds invalid"); requireds_exist_ = false; requireds_seeded_ = false; invalid_requireds_.clear(); @@ -791,7 +791,7 @@ Search::findClkArrivals() if (!clk_arrivals_valid_) { genclks_->ensureInsertionDelays(); Stats stats(debug_, report_); - debugPrint(debug_, "search", 1, "find clk arrivals"); + debugPrint0(debug_, "search", 1, "find clk arrivals"); arrival_iter_->clear(); seedClkVertexArrivals(); ClkArrivalSearchPred search_clk(this); @@ -1129,7 +1129,7 @@ ArrivalVisitor::visit(Vertex *vertex) || !sdc->isPathDelayInternalEndpoint(pin))) search->arrivalIterator()->enqueueAdjacentVertices(vertex, adj_pred_); if (arrivals_changed) { - debugPrint(debug, "search", 4, "arrival changed"); + debugPrint0(debug, "search", 4, "arrival changed"); // Only update arrivals when delays change by more than // fuzzyEqual can distinguish. search->setVertexArrivals(vertex, tag_bldr_); diff --git a/search/WorstSlack.cc b/search/WorstSlack.cc index 5d0f57f9..d82a9499 100644 --- a/search/WorstSlack.cc +++ b/search/WorstSlack.cc @@ -149,7 +149,7 @@ WorstSlack::initQueue(PathAPIndex path_ap_index, { Search *search = sta->search(); const Debug *debug = sta->debug(); - debugPrint(debug, "wns", 3, "init queue"); + debugPrint0(debug, "wns", 3, "init queue"); queue_.clear(); worst_vertex_ = nullptr; @@ -181,7 +181,7 @@ WorstSlack::sortQueue(PathAPIndex path_ap_index, if (queue_.size() > 0) { Search *search = sta->search(); const Debug *debug = sta->debug(); - debugPrint(debug, "wns", 3, "sort queue"); + debugPrint0(debug, "wns", 3, "sort queue"); VertexSeq vertices; vertices.reserve(queue_.size()); @@ -223,7 +223,7 @@ WorstSlack::findWorstInQueue(PathAPIndex path_ap_index, { Search *search = sta->search(); const Debug *debug = sta->debug(); - debugPrint(debug, "wns", 3, "find worst in queue"); + debugPrint0(debug, "wns", 3, "find worst in queue"); worst_vertex_ = nullptr; worst_slack_ = slack_init_;