Subversion Repositories Vertical

/*

/*

 * $Id: statistics.c,v 1.1.1.1 2003/11/04 23:34:57 mjames Exp $

 * $Id: statistics.c,v 1.1.1.1 2003/11/04 23:34:57 mjames Exp $  

 * until a constant is located

 * until a constant is located

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 * Added in reference to expression.h, but no changes made

 * Added in reference to expression.h, but no changes made

 *

 *

 *

 *

 *

 *

 *

 *

 *

 *

 * Tidied up the ensure_reserved() function. Added in a flag to

 * Tidied up the ensure_reserved() function. Added in a flag to

 *

 *

 *

 *

 *

 *

#include "statistics.h"

#include <stdlib.h>

#include <sys/types.h>

static char IDstr[] = "@(#)$Header: c:\\cygwin\\cvsroot/Vert03/vertlib/statistics.c,v 1.1.1.1 2003/11/04 23:34:57 mjames Exp $";

int count_paths (char *template)

int count_paths(char * template)

        socket_t *skt_p, *skt_try;

  socket_t * skt_p, * skt_try;

        noderef_t *net_nodes;

  noderef_t *  net_nodes;

        node_t *skt_nodes;

  node_t * skt_nodes ;

        net_t **list_member;

  net_t ** list_member;

        int rc;

  int rc;

        char *pattern;

  char * pattern;

        /* compile regular expression */

  /* compile regular expression */

        vert_regex_t *preg;

  vert_regex_t * preg;

        skt_p = socket_head;

  skt_p = socket_head;

        /* clear all of the visit counters */

/* clear all of the visit counters */

        while (skt_p)

  while (skt_p) {

        {

    skt_p->named_cnt =

                skt_p->named_in_use_cnt = skt_p->named_cnt = skt_p->routed_cnt =

    skt_p->routed_cnt=

                    skt_p->unrouted_cnt = 0;

    skt_p->unrouted_cnt = 0;

                skt_p = skt_p->next;

    skt_p=skt_p->next;

        }

  }

        if (!ISNULLSTR (template))

  if(!ISNULLSTR(template))

        {

    {

                pattern = template;

    pattern = template;

        }

    }

        else

  else

        {

    {

                pattern = ".*";

    pattern = ".*";

        }

    }

        rc = vert_regcomp (&preg, pattern);

    found  = regexec(preg->preg,skt_p->name,0,preg->regpatt,0);

        if (rc != 0)

      skt_nodes = skt_p -> nodes ;

        {

/*

                char errbuff[100];

  fprintf(f,"named = %p , routed = %p  unrouted = %p\n",

                regerror (rc, preg->preg, errbuff, 100);

        &named_list,&routed_list,&unrouted_list);

                Log (

*/

                    LOG_ERROR,

  /* we have located the socket on the net . Let us now locate each net */

                    "-- Problem (rc=%d) %s with '%s' as regular expression\n",

  /* some nodes on a socket will be unrouted nodes on unrouted nets that

                    rc,

     have now been resolved , and the unrouted net will have been deleted .

                    errbuff,

     These have the property that node->net->list_ref = NULL */

                    pattern);

    while(skt_nodes)  {

      net_t * ref_net = skt_nodes->net;

                return TCL_ERROR;

      if(ref_net) {

        }

        int high,low,width,net_high,net_low;

        Log (

            LOG_GENERAL,

        net_nodes = ref_net->nodes;

            "-- Listing xref for socket names '%s' --\n",

            template ? template : "[ALL Sockets]");

      /* note the upper and lower bound of the bundle connected from this

        skt_p = socket_head;

       *    pin of this socket to the net.

        while (skt_p)

       * Also checking there is an associated VHDL type 4 May 2000 */

        {

        if (skt_nodes->vhdltype) {

                int found;

          eval_vhdl_expression(skt_nodes->vhdltype->expr,&net_high,&net_low);

          }

                found = regexec (preg->preg, skt_p->name, 0, preg->regpatt, 0);

        else {

                if (!found)

          net_low = 0;

                {

          net_high= 0;

                        skt_nodes = skt_p->nodes;

          }

                        /*

                          fprintf(f,"named = %p , routed = %p  unrouted = %p\n",

      /* which list is this net on */

                                &named_list,&routed_list,&unrouted_list);

        list_member = ref_net->list_ref;

                        */

        /* visit each node */

                        /* we have located the socket on the net . Let us now locate each net

        while(net_nodes){

                         */

          node_t * n = net_nodes->node;

                        /* some nodes on a socket will be unrouted nodes on unrouted nets that

          vhdl_t * vhdl= net_nodes->vhdltype;

                           have now been resolved , and the unrouted net will have been deleted

          int  vhdl_high,vhdl_low;

                           . These have the property that node->net->list_ref = NULL */

          if (vhdl) {

                        while (skt_nodes)

            /* to determine the intersection of the bundles,

                        {

             * hence connection count :

                                net_t *ref_net = skt_nodes->net;

             * (15 downto 8) connected to (10 downto 5) has intersection

                                if (ref_net)

             * (10 downto 8)

                                {

             */

                                        int high, low, width, net_high, net_low;

            if (vhdl->expr)

              eval_vhdl_expression(vhdl->expr,&vhdl_high,&vhdl_low);

                                        net_nodes = ref_net->nodes;

            else {

              vhdl_high = 0;

                                        /* note the upper and lower bound of the bundle

              vhdl_low  = 0;

                                         * connected from this pin of this socket to the net.

              }  

                                         * Also checking there is an associated VHDL type 4 May

        /* use the lowest high bound of the node this net comes from */

                                         * 2000 */

          high = vhdl_high > net_high ? net_high : vhdl_high;

                                        if (skt_nodes->vhdltype)

                                        {

        /* use the highest low bound of the node this net comes from */

                                                eval_vhdl_expression (

          low  = vhdl_low  < net_low  ? net_low  : vhdl_low;

                                                    skt_nodes->vhdltype->expr,

                                                    &net_high,

        /* now get the number of wires in the bundle */

                                                    &net_low);

          width =  high - low + 1;

                                        }

          if(list_member==&named_list) {

                                        else

            if (n->in_use)

                                        {

              n->socket->named_in_use_cnt += width;

                                                net_low = 0;

            else

                                                net_high = 0;

              n->socket->named_cnt += width;

                                        }

          }

          else if (list_member==&routed_list)

                                        /* which list is this net on */

            n->socket->routed_cnt   +=  width;

                                        list_member = ref_net->list_ref;

          else if (list_member==&unrouted_list)

                                        /* visit each node */

            n->socket->unrouted_cnt +=  width;

                                        while (net_nodes)

          else if (list_member!=NULL)

                                        {

            Log(LOG_ERROR,"# ERROR : Net %s is on unknown list pointer=%p , net \n",ref_net->name,list_member);

                                                node_t *n = net_nodes->node;

            }

                                                vhdl_t *vhdl = net_nodes->vhdltype;

          net_nodes = net_nodes->next;

                                                int vhdl_high, vhdl_low;

          }

                                                if (vhdl)

        }  

                                                {

      skt_nodes = skt_nodes->sktnext;

                                                        /* to determine the intersection of the

      }

                                                         * bundles, hence connection count :

    /* now have compiled a cross reference count */

                                                         * (15 downto 8) connected to (10

    skt_try = socket_head;

                                                         * downto 5) has intersection (10

    Log(LOG_GENERAL,"--  Cross reference for socket '%s'\n",skt_p->name);

                                                         * downto 8)

    Log(LOG_GENERAL,"Name            : Named&Used, Named, Routed,Unrouted\n");

                                                         */

    skt_try = socket_head;

                                                        if (vhdl->expr)

    while(skt_try){

                                                                eval_vhdl_expression (

      if(!ISNULLSTR(skt_try->name)){

                                                                    vhdl->expr,

      Log(LOG_GENERAL,"%16s :  %5d, %5d, %5d, %5d\n",

                                                                    &vhdl_high,

             skt_try -> name,

                                                                    &vhdl_low);

             skt_try -> named_in_use_cnt,

                                                        else

             skt_try -> named_cnt,

                                                        {

             skt_try -> routed_cnt,

                                                                vhdl_high = 0;

             skt_try -> unrouted_cnt);

        vert_regfree (&preg);

  vert_regfree(&preg);

        return OKCMD; /* success */

  return OKCMD; /* success */

void count_nets_with_few_nodes (int limit)

void count_nets_with_few_nodes(int limit)

        long lowcount = 0;

  long lowcount=0;

        net_t *routed_net = named_list;

  net_t * routed_net = named_list;

            "-- Checking for nets with less than or equal to %d nodes in use\n",

  Log(LOG_GENERAL,"-- Checking for nets with less than or equal to %d nodes in use\n",

            limit);

                  limit);

        while (routed_net)

  while (routed_net) {

                int nodecount = 0;

    int nodecount = 0;

                noderef_t *routed_nodes = routed_net->nodes;

    noderef_t * routed_nodes = routed_net->nodes;

                while (routed_nodes)

    while (routed_nodes) {

                        /*        node_t *cnode = routed_nodes->node;  */

/*        node_t *cnode = routed_nodes->node;  */

                        if (routed_nodes->node->net_assigned != 0)

      if (routed_nodes->node->net_assigned != 0)

                                nodecount++;

        nodecount++;

                        routed_nodes = routed_nodes->next;

   routed_nodes = routed_nodes->next;

                }

      }

                /* turn off warning if low nodecount is due to ensure_reserved processing in

/* turn off warning if low nodecount is due to ensure_reserved processing in routing.c */

                if (nodecount <= limit && !routed_net->nodes_reserved)

    if (nodecount <= limit && !routed_net->nodes_reserved) {

                            "-- Net '%s' (name '%s') has only %d node(s) in use\n",

      Log(LOG_GENERAL,"-- Net '%s' (name '%s') has only %d node(s) in use\n",

                            routed_net->identifier,

                      routed_net->identifier,

                            routed_net->name,

                      routed_net->name,

                            nodecount);

                      nodecount);

                        lowcount++;

      lowcount++;

                }

      }

                routed_net = routed_net->next;

    routed_net = routed_net->next;

        }

    }

        Log (LOG_GENERAL, "-- Found %d nets with less than %d nodes used\n", lowcount, limit);

  Log(LOG_GENERAL,"-- Found %d nets with less than %d nodes used\n",

void statistics_waste (void)

void statistics_waste(void)

        char *s = IDstr;

  char * s=IDstr;

        s = s;

  s=s;