sta_timing_arc_calculator.h

/*
 * Copyright 2016 Ophidian
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements.  See the NOTICE file
distributed with this work for additional information
regarding copyright ownership.  The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License.  You may obtain a copy of the License at

  http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing,
software distributed under the License is distributed on an
"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, either express or implied.  See the License for the
specific language governing permissions and limitations
under the License.
 */

#ifndef SRC_TIMING_STA_TIMING_ARC_CALCULATOR_H_
#define SRC_TIMING_STA_TIMING_ARC_CALCULATOR_H_

#include <lemon/list_graph.h>
#include "graph_nodes_timing.h"
#include "graph_arcs_timing.h"
#include "library.h"

#include "sta_arc_calculator.h"
#include "graph.h"

namespace openeda {
namespace timing {

class sta_timing_arc_calculator: public sta_timing_edge_calculator {
    const library & m_library;

public:
    sta_timing_arc_calculator(const library & lib);
    virtual ~sta_timing_arc_calculator();

    void update(const graph& g, const graph_nodes_timing& nodes_timing, sta_timing_point_calculator & tpoints, graph_arcs_timing & m_arcs) {
        boost::units::quantity<boost::units::si::capacitance> target_load;
        boost::units::quantity<boost::units::si::time> source_slew ;
            for (std::deque<lemon::ListDigraph::Arc>::const_iterator arc_it = m_to_process.begin(); arc_it != m_to_process.end(); ++arc_it) {
                target_load = nodes_timing.load(g.edge_target(*arc_it));
                source_slew = nodes_timing.slew(g.edge_source(*arc_it));
                const entity::entity tarc = g.edge_entity(*arc_it);
                boost::units::quantity<boost::units::si::time> delay, slew;
                switch (g.node_edge( g.edge_target(*arc_it) )) {
                case edges::RISE:
                    delay = m_library.timing_arc_rise_delay(tarc).compute(target_load, source_slew);
                    slew = m_library.timing_arc_rise_slew(tarc).compute(target_load, source_slew);
                    break;
                case edges::FALL:
                    delay = m_library.timing_arc_fall_delay(tarc).compute(target_load, source_slew);
                    slew = m_library.timing_arc_fall_slew(tarc).compute(target_load, source_slew);
                    break;
                default:
                    break;
                }
                m_arcs.slew(*arc_it, slew);
                m_arcs.delay(*arc_it, delay);
            }
        // CRITICAL >>>>
        for (lemon::ListDigraph::Arc arc : m_to_process) {
            tpoints.push(g.edge_target(arc));
        }
        // <<<<
        m_to_process.clear();
    }
};

} /* namespace timing */
} /* namespace openeda */

#endif /* SRC_TIMING_STA_TIMING_ARC_CALCULATOR_H_ */