SRC/path_delay2.h File Reference

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

Go to the source code of this file.

Data Structures
struct	t_tedge
struct	t_tnode
struct	t_tnode_descript
Enumerations
enum	t_tnode_type {   INPAD_SOURCE, INPAD_OPIN, OUTPAD_IPIN, OUTPAD_SINK,   FB_IPIN, FB_OPIN, SUBBLK_IPIN, SUBBLK_OPIN,   FF_SINK, FF_SOURCE, CONSTANT_GEN_SOURCE }
Functions
int	alloc_and_load_timing_graph_levels (void)
void	check_timing_graph (int num_const_gen, int num_ff, int num_sinks)
float	print_critical_path_node (FILE *fp, t_linked_int *critical_path_node, t_subblock_data subblock_data)
Variables
t_tnode *	tnode
t_tnode_descript *	tnode_descript
int	num_tnodes
int *	net_to_driver_tnode
struct s_ivec *	tnodes_at_level
int	num_tnode_levels

---

Enumeration Type Documentation

enum t_tnode_type

Enumerator:

INPAD_SOURCE
INPAD_OPIN
OUTPAD_IPIN
OUTPAD_SINK
FB_IPIN
FB_OPIN
SUBBLK_IPIN
SUBBLK_OPIN
FF_SINK
FF_SOURCE
CONSTANT_GEN_SOURCE

Definition at line 35 of file path_delay2.h.

{ INPAD_SOURCE, INPAD_OPIN, OUTPAD_IPIN, OUTPAD_SINK,
    FB_IPIN, FB_OPIN, SUBBLK_IPIN, SUBBLK_OPIN, FF_SINK, FF_SOURCE,
    CONSTANT_GEN_SOURCE
}

---

Function Documentation

int alloc_and_load_timing_graph_levels

(

void

)

Definition at line 104 of file path_delay2.c.

{

/* Does a breadth-first search through the timing graph in order to levelize *
 * it.  This allows subsequent breadth-first traversals to be faster. Also   *
 * returns the number of sinks in the graph (nodes with no fanout).          */

    t_linked_int *free_list_head, *nodes_at_level_head;
    int inode, num_at_level, iedge, to_node, num_edges, num_sinks,
        num_levels, i;
    t_tedge *tedge;

/* [0..num_tnodes-1]. # of in-edges to each tnode that have not yet been    *
 * seen in this traversal.                                                  */

    int *tnode_fanin_left;


    tnode_fanin_left = alloc_and_load_tnode_fanin_and_check_edges(&num_sinks);

    free_list_head = NULL;
    nodes_at_level_head = NULL;

/* Very conservative -> max number of levels = num_tnodes.  Realloc later.  *
 * Temporarily need one extra level on the end because I look at the first  *
 * empty level.                                                             */

    tnodes_at_level = (struct s_ivec *)my_malloc((num_tnodes + 1) *
                                                 sizeof(struct s_ivec));

/* Scan through the timing graph, putting all the primary input nodes (no    *
 * fanin) into level 0 of the level structure.                               */

    num_at_level = 0;

    for(inode = 0; inode < num_tnodes; inode++)
        {
            if(tnode_fanin_left[inode] == 0)
                {
                    num_at_level++;
                    nodes_at_level_head =
                        insert_in_int_list(nodes_at_level_head, inode,
                                           &free_list_head);
                }
        }

    alloc_ivector_and_copy_int_list(&nodes_at_level_head, num_at_level,
                                    &tnodes_at_level[0], &free_list_head);

    num_levels = 0;

    while(num_at_level != 0)
        {                       /* Until there's nothing in the queue. */
            num_levels++;
            num_at_level = 0;

            for(i = 0; i < tnodes_at_level[num_levels - 1].nelem; i++)
                {
                    inode = tnodes_at_level[num_levels - 1].list[i];
                    tedge = tnode[inode].out_edges;
                    num_edges = tnode[inode].num_edges;

                    for(iedge = 0; iedge < num_edges; iedge++)
                        {
                            to_node = tedge[iedge].to_node;
                            tnode_fanin_left[to_node]--;

                            if(tnode_fanin_left[to_node] == 0)
                                {
                                    num_at_level++;
                                    nodes_at_level_head =
                                        insert_in_int_list
                                        (nodes_at_level_head, to_node,
                                         &free_list_head);
                                }
                        }
                }

            alloc_ivector_and_copy_int_list(&nodes_at_level_head,
                                            num_at_level,
                                            &tnodes_at_level[num_levels],
                                            &free_list_head);
        }

    tnodes_at_level =
        (struct s_ivec *)my_realloc(tnodes_at_level,
                                    num_levels * sizeof(struct s_ivec));
    num_tnode_levels = num_levels;

    free(tnode_fanin_left);
    free_int_list(&free_list_head);
    return (num_sinks);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void check_timing_graph	(	int	num_const_gen,
		int	num_ff,
		int	num_sinks
	)

Definition at line 200 of file path_delay2.c.

{

/* Checks the timing graph to see that: (1) all the tnodes have been put    *
 * into some level of the timing graph; (2) the number of primary inputs    *
 * to the timing graph is equal to the number of input pads + the number of *
 * constant generators; and (3) the number of sinks (nodes with no fanout)  *
 * equals the number of output pads + the number of flip flops.             */

    int i, j, num_tnodes_check, ilevel, inet, inode, error, num_p_inputs,
        num_p_outputs;

    error = 0;
    num_tnodes_check = 0;
    num_p_inputs = 0;
    num_p_outputs = 0;

    /* Count I/O input and output pads */
    for(i = 0; i < num_blocks; i++)
        {
            if(block[i].type == IO_TYPE)
                {
                    for(j = 0; j < IO_TYPE->num_pins; j++)
                        {
                            if(block[i].nets[j] != OPEN)
                                {
                                    if(IO_TYPE->
                                       class_inf[IO_TYPE->pin_class[j]].
                                       type == DRIVER)
                                        {
                                            num_p_inputs++;
                                        }
                                    else
                                        {
                                            assert(IO_TYPE->
                                                   class_inf[IO_TYPE->
                                                             pin_class[j]].
                                                   type == RECEIVER);
                                            num_p_outputs++;
                                        }
                                }
                        }
                }
        }

    for(ilevel = 0; ilevel < num_tnode_levels; ilevel++)
        num_tnodes_check += tnodes_at_level[ilevel].nelem;

    if(num_tnodes_check != num_tnodes)
        {
            printf
                ("Error in check_timing_graph: %d tnodes appear in the tnode level "
                 "structure.  Expected %d.\n", num_tnodes_check, num_tnodes);
            printf("Check the netlist for combinational cycles.\n");
            error++;
        }

    if(num_const_gen + num_p_inputs != tnodes_at_level[0].nelem)
        {
            printf
                ("Error in check_timing_graph: %d tnodes are sources (have no "
                 "inputs -- expected %d.\n", tnodes_at_level[0].nelem,
                 num_const_gen + num_p_inputs);
            error++;
        }

    if(num_sinks != num_p_outputs + num_ff)
        {
            printf
                ("Error in check_timing_graph: %d tnodes are sinks (have no "
                 "outputs -- expected %d.\n", num_sinks,
                 num_ff + num_p_outputs);
            error++;
        }

    for(inet = 0; inet < num_nets; inet++)
        {
            inode = net_to_driver_tnode[inet];
            if(inode < 0 || inode >= num_tnodes)
                {
                    printf("Error in check_timing_graph:\n"
                           "\tdriver of net %d has a tnode mapping of %d (out of range).\n",
                           inet, inode);
                    error++;
                }
        }

    if(error != 0)
        {
            printf("Found %d Errors in the timing graph.  Aborting.\n",
                   error);
            exit(1);
        }
}

Here is the caller graph for this function:

float print_critical_path_node	(	FILE *	fp,
		t_linked_int *	critical_path_node,
		t_subblock_data	subblock_data
	)

Definition at line 299 of file path_delay2.c.

{

/* Prints one tnode on the critical path out to fp. Returns the delay to    *
 * the next node.                                                           */

    int inode, iblk, ipin, inet, downstream_node;
    t_tnode_type type;
    static char *tnode_type_names[] = { "INPAD_SOURCE", "INPAD_OPIN",
        "OUTPAD_IPIN", "OUTPAD_SINK", "CLB_IPIN", "CLB_OPIN",
        "SUBBLK_IPIN", "SUBBLK_OPIN", "FF_SINK", "FF_SOURCE",
        "CONSTANT_GEN_SOURCE"
    };                          /* NB: static for speed */
    t_linked_int *next_crit_node;
    float Tdel;

    inode = critical_path_node->data;
    type = tnode_descript[inode].type;
    iblk = tnode_descript[inode].iblk;
    ipin = tnode_descript[inode].ipin;

    fprintf(fp, "Node: %d  %s Block #%d (%s)\n", inode,
            tnode_type_names[type], iblk, block[iblk].name);

    if(type != INPAD_SOURCE && type != OUTPAD_SINK && type != FF_SINK &&
       type != FF_SOURCE && type != CONSTANT_GEN_SOURCE)
        {
            fprintf(fp, "Pin: %d ", ipin);
        }

    if(type == SUBBLK_IPIN || type == SUBBLK_OPIN || type == FF_SINK
       || type == FF_SOURCE || type == CONSTANT_GEN_SOURCE)
        {
            fprintf(fp, "Subblock #%d subpin #%d",
                    tnode_descript[inode].isubblk,
                    tnode_descript[inode].ipin);
        }

    if(type != INPAD_SOURCE && type != OUTPAD_SINK)
        {
            fprintf(fp, "\n");
        }

    fprintf(fp, "T_arr: %g  T_req: %g  ", tnode[inode].T_arr,
            tnode[inode].T_req);

    next_crit_node = critical_path_node->next;
    if(next_crit_node != NULL)
        {
            downstream_node = next_crit_node->data;
            Tdel = tnode[downstream_node].T_arr - tnode[inode].T_arr;
            fprintf(fp, "Tdel: %g\n", Tdel);
        }
    else
        {                       /* last node, no Tdel. */
            Tdel = 0.;
            fprintf(fp, "\n");
        }

    if(type == FB_OPIN)
        {
            inet = block[iblk].nets[ipin];
            fprintf(fp, "Net to next node: #%d (%s).  Pins on net: %d.\n",
                    inet, net[inet].name, (net[inet].num_sinks + 1));
        }

    if(type == INPAD_OPIN)
        {
            ipin =
                subblock_data.subblock_inf[iblk][tnode_descript[inode].
                                                 isubblk].outputs[ipin];
            inet = block[iblk].nets[ipin];
            fprintf(fp, "Net to next node: #%d (%s).  Pins on net: %d.\n",
                    inet, net[inet].name, (net[inet].num_sinks + 1));
        }

    fprintf(fp, "\n");
    return (Tdel);
}

Here is the caller graph for this function:

---

Variable Documentation

int* net_to_driver_tnode

Definition at line 16 of file path_delay2.c.

int num_tnode_levels

Definition at line 23 of file path_delay2.c.

int num_tnodes

Definition at line 12 of file path_delay2.c.

t_tnode* tnode

Definition at line 10 of file path_delay2.c.

t_tnode_descript* tnode_descript

Definition at line 11 of file path_delay2.c.

struct s_ivec* tnodes_at_level

Definition at line 22 of file path_delay2.c.