netlist_check.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	check_netlist (netlist_t *netlist)
void	levelize_and_check_for_combinational_loop_and_liveness (short ast_based, netlist_t *netlist)

---

Function Documentation

void check_netlist

(

netlist_t *

netlist

)

Definition at line 53 of file netlist_check.c.

{
        /* create a graph output of this netlist */
        if (configuration.output_netlist_graphs == 1)
        {
                /* Path is where we are */
                graphVizOutputNetlist(configuration.debug_output_path, "net", 1, netlist);
        }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void levelize_and_check_for_combinational_loop_and_liveness	(	short	ast_based,
		netlist_t *	netlist
	)

Definition at line 67 of file netlist_check.c.

{
        /* go from the POs backwards and mark level */
        levelize_backwards(netlist);
        /* Since the net_data (void pointer) is used to record information, we need to clean this up so that it can be used again
           also, during this cleaning we check if nodes are live based on all the fanout pins have been visited */
        levelize_backwards_clean_checking_for_liveness(ast_based, netlist);

        /* do a forward analysis */
        levelize_forwards(netlist);

        /* checks if there are any non-forward marked nodes */
        depth_first_traversal_check_if_forward_leveled(COMBO_LOOP, netlist);
        /* finds combo loops, but usually killed by previous.  Also cleans out net_data (void pointer) for next algorithm. */
        levelize_forwards_clean_checking_for_combo_loop_and_liveness(ast_based, netlist);

        /* assign each node which sequential level it is in, and keep the primary inputs to that level */
        sequential_levelized_dfs(SEQUENTIAL_LEVELIZE, netlist);
}

Here is the call graph for this function:

Here is the caller graph for this function: