gnetlist/src/s_netlist.c

   1 /* gEDA - GPL Electronic Design Automation
   2  * gnetlist - gEDA Netlist
   3  * Copyright (C) 1998-2007 Ales Hvezda
   4  * Copyright (C) 1998-2007 gEDA Contributors (see ChangeLog for details)
   5  *
   6  * This program is free software; you can redistribute it and/or modify
   7  * it under the terms of the GNU General Public License as published by
   8  * the Free Software Foundation; either version 2 of the License, or
   9  * (at your option) any later version.
  10  *
  11  * This program is distributed in the hope that it will be useful,
  12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14  * GNU General Public License for more details.
  15  *
  16  * You should have received a copy of the GNU General Public License
  17  * along with this program; if not, write to the Free Software
  18  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111 USA
  19  */
  20
  21 #include <config.h>
  22
  23 #include <stdio.h>
  24 #include <ctype.h>
  25 #ifdef HAVE_STDLIB_H
  26 #include <stdlib.h>
  27 #endif
  28 #ifdef HAVE_ASSERT_H
  29 #include <assert.h>
  30 #endif
  31
  32 #include <libgeda/libgeda.h>
  33
  34 #include "../include/globals.h"
  35 #include "../include/prototype.h"
  36
  37 #ifdef HAVE_LIBDMALLOC
  38 #include <dmalloc.h>
  39 #endif
  40
  41 /* used by the extract functions below */
  42 #define DELIMITERS ",; "
  43
  44 /* hack rename this to be s_return_tail */
  45 /* update object_tail or any list of that matter */
  46 NETLIST *s_netlist_return_tail(NETLIST * head)
  47 {
  48     NETLIST *nl_current = NULL;
  49     NETLIST *ret_struct = NULL;
  50
  51     nl_current = head;
  52     while (nl_current != NULL) {        /* goto end of list */
  53         ret_struct = nl_current;
  54         nl_current = nl_current->next;
  55     }
  56
  57     return (ret_struct);
  58 }
  59
  60 /* hack rename this to be s_return_head */
  61 /* update object_tail or any list of that matter */
  62 NETLIST *s_netlist_return_head(NETLIST * tail)
  63 {
  64     NETLIST *nl_current = NULL;
  65     NETLIST *ret_struct = NULL;
  66
  67     nl_current = tail;
  68     while (nl_current != NULL) {        /* goto end of list */
  69         ret_struct = nl_current;
  70         nl_current = nl_current->prev;
  71     }
  72
  73     return (ret_struct);
  74 }
  75
  76
  77 /* returns new node */
  78 NETLIST *s_netlist_add(NETLIST * ptr)
  79 {
  80     NETLIST *new_node;
  81
  82     new_node = (NETLIST *) g_malloc(sizeof(NETLIST));
  83
  84     /* setup node information */
  85     new_node->nlid = 0;
  86     new_node->cpins = NULL;
  87     new_node->component_uref = NULL;
  88     new_node->object_ptr = NULL;
  89     new_node->hierarchy_tag = NULL;
  90     new_node->composite_component = FALSE;
  91
  92     /* Setup link list stuff */
  93     new_node->next = NULL;
  94
  95     if (ptr == NULL) {
  96         new_node->prev = NULL;  /* setup previous link */
  97         return (new_node);
  98     } else {
  99         new_node->prev = ptr;   /* setup previous link */
 100         ptr->next = new_node;
 101         return (ptr->next);
 102     }
 103 }
 104
 105 void s_netlist_print(NETLIST * ptr)
 106 {
 107     NETLIST *nl_current = NULL;
 108
 109     nl_current = ptr;
 110
 111     if (nl_current == NULL) {
 112         return;
 113     }
 114
 115     while (nl_current != NULL) {
 116
 117         if (nl_current->nlid != -1) {
 118
 119             if (nl_current->component_uref) {
 120                 printf("component %s \n", nl_current->component_uref);
 121             } else {
 122                 printf("component SPECIAL \n");
 123             }
 124
 125             if (nl_current->hierarchy_tag) {
 126                 printf("Hierarchy tag: %s\n", nl_current->hierarchy_tag);
 127             }
 128
 129             if (nl_current->cpins) {
 130                 s_cpinlist_print(nl_current->cpins);
 131             }
 132
 133             printf("\n");
 134         }
 135
 136         nl_current = nl_current->next;
 137     }
 138     printf("\n");
 139 }
 140
 141 void s_netlist_post_process(TOPLEVEL * pr_current, NETLIST * head)
 142 {
 143     NETLIST *nl_current;
 144     CPINLIST *pl_current;
 145     int vi = 0;
 146
 147     nl_current = head;
 148
 149     if (verbose_mode) {
 150         printf("\n- Staring post processing\n");
 151         printf("- Naming nets:\n");
 152         vi = 0;
 153     }
 154
 155     /* this pass gives all nets a name, whether specified or creates a */
 156     /* name */
 157     nl_current = head;
 158     while (nl_current != NULL) {
 159         if (nl_current->cpins) {
 160             pl_current = nl_current->cpins;
 161             while (pl_current != NULL) {
 162
 163                 if (pl_current->plid != -1) {
 164                     verbose_print("p");
 165                 }
 166
 167                 if (pl_current->plid != -1 && pl_current->nets) {
 168
 169                     if (pl_current->net_name) {
 170                         g_free(pl_current->net_name);
 171                     }
 172
 173                     verbose_print("n");
 174
 175                     /* only name nets of components which */
 176                     /* have a uref */
 177                     if (nl_current->component_uref) {
 178                         pl_current->net_name =
 179                             s_net_name(pr_current,
 180                                        head,
 181                                        pl_current->nets,
 182                                        nl_current->hierarchy_tag);
 183
 184                         /* put this name also in the first
 185                            node of the nets linked list */
 186                         if (pl_current->net_name && pl_current->nets) {
 187                             if (pl_current->nets->next) {
 188                                 pl_current->nets->next->net_name =
 189                                     g_strdup (pl_current->net_name);
 190                             }
 191                         }
 192                     }
 193                 }
 194
 195                 pl_current = pl_current->next;
 196             }
 197         }
 198         nl_current = nl_current->next;
 199     }
 200
 201     verbose_done();
 202     if (verbose_mode) {
 203         printf("- Renaming nets:\n");
 204     }
 205
 206     s_rename_all(pr_current, head);
 207
 208     verbose_done();
 209     if (verbose_mode) {
 210         printf("- Resolving hierarchy:\n");
 211     }
 212     s_hierarchy_post_process(pr_current, head);
 213
 214     verbose_done();
 215     if (pr_current->hierarchy_uref_mangle == FALSE) {
 216         if (verbose_mode) {
 217             printf("- Removing refdes mangling:\n");
 218         }
 219         s_hierarchy_remove_uref_mangling(pr_current, head);
 220     }
 221
 222     verbose_done();
 223 }
 224
 225 void s_netlist_name_named_nets (TOPLEVEL *pr_current,
 226                                 NETLIST *named_netlist,
 227                                 NETLIST *unnamed_netlist) {
 228
 229   NETLIST *nl_current;
 230   CPINLIST *pl_current;
 231   NET *n_current;
 232   char *net_name;
 233
 234   if (verbose_mode) {
 235     printf("\n- Staring post processing\n");
 236     printf("- Naming nets of graphical objects:\n");
 237   }
 238
 239   /* this pass gives all nets a name, whether specified or creates a */
 240   /* name */
 241   nl_current = unnamed_netlist;
 242   while (nl_current != NULL) {
 243     if (nl_current->cpins) {
 244       pl_current = nl_current->cpins;
 245       while (pl_current != NULL) {
 246
 247         if (pl_current->plid != -1) {
 248           verbose_print("p");
 249         }
 250
 251         if (pl_current->plid != -1 && pl_current->nets) {
 252           verbose_print("n");
 253           net_name = NULL;
 254           n_current = pl_current->nets;
 255           while (n_current != NULL) {
 256             if (n_current->net_name) {
 257               g_free (n_current->net_name);
 258             }
 259             n_current->net_name = s_netlist_netname_of_netid(pr_current,
 260                                                              named_netlist,
 261                                                              n_current->nid);
 262
 263             if (n_current->net_name != NULL) {
 264               net_name = n_current->net_name;
 265             }
 266             n_current = n_current->next;
 267           }
 268           if (net_name != NULL) {
 269             pl_current->net_name = g_strdup(net_name);
 270           }
 271         }
 272         pl_current = pl_current->next;
 273       }
 274     }
 275     nl_current = nl_current->next;
 276   }
 277
 278   verbose_done();
 279
 280 }
 281
 282 char *s_netlist_netname_of_netid (TOPLEVEL *pr_current,
 283                                   NETLIST *netlist_head,
 284                                   int net_id) {
 285
 286   NETLIST *nl_current;
 287   CPINLIST *pl_current;
 288   NET *n_current;
 289
 290   nl_current = netlist_head;
 291
 292   /* walk through the list of components, and through the list
 293    * of individual pins on each, looking for the net identifier
 294    */
 295   while (nl_current != NULL) {
 296     pl_current = nl_current->cpins;
 297     while (pl_current != NULL) {
 298       if (pl_current->net_name) {
 299         n_current = pl_current->nets;
 300         while (n_current != NULL) {
 301           if (n_current->nid == net_id) {
 302             return (g_strdup(n_current->net_name));
 303           }
 304           n_current = n_current->next;
 305         }
 306       }
 307       pl_current = pl_current->next;
 308     }
 309     nl_current = nl_current->next;
 310     }
 311   return NULL;
 312 }