1 /* gEDA - GPL Electronic Design Automation
2 * gnetlist - gEDA Netlist
3 * Copyright (C) 1998-2010 Ales Hvezda
4 * Copyright (C) 1998-2010 gEDA Contributors (see ChangeLog for details)
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.
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.
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
32 #include <libgeda/libgeda.h>
34 #include "../include/globals.h"
35 #include "../include/prototype.h"
37 #ifdef HAVE_LIBDMALLOC
41 /* used by the extract functions below */
42 #define DELIMITERS ",; "
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
)
48 NETLIST
*nl_current
= NULL
;
49 NETLIST
*ret_struct
= NULL
;
52 while (nl_current
!= NULL
) { /* goto end of list */
53 ret_struct
= nl_current
;
54 nl_current
= nl_current
->next
;
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
)
64 NETLIST
*nl_current
= NULL
;
65 NETLIST
*ret_struct
= NULL
;
68 while (nl_current
!= NULL
) { /* goto end of list */
69 ret_struct
= nl_current
;
70 nl_current
= nl_current
->prev
;
77 /* returns new node */
78 NETLIST
*s_netlist_add(NETLIST
* ptr
)
82 new_node
= (NETLIST
*) g_malloc(sizeof(NETLIST
));
84 /* setup node information */
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
;
92 /* Setup link list stuff */
93 new_node
->next
= NULL
;
96 new_node
->prev
= NULL
; /* setup previous link */
99 new_node
->prev
= ptr
; /* setup previous link */
100 ptr
->next
= new_node
;
105 void s_netlist_print(NETLIST
* ptr
)
107 NETLIST
*nl_current
= NULL
;
111 if (nl_current
== NULL
) {
115 while (nl_current
!= NULL
) {
117 if (nl_current
->nlid
!= -1) {
119 if (nl_current
->component_uref
) {
120 printf("component %s \n", nl_current
->component_uref
);
122 printf("component SPECIAL \n");
125 if (nl_current
->hierarchy_tag
) {
126 printf("Hierarchy tag: %s\n", nl_current
->hierarchy_tag
);
129 if (nl_current
->cpins
) {
130 s_cpinlist_print(nl_current
->cpins
);
136 nl_current
= nl_current
->next
;
141 void s_netlist_post_process(TOPLEVEL
* pr_current
, NETLIST
* head
)
144 CPINLIST
*pl_current
;
150 printf("\n- Staring post processing\n");
151 printf("- Naming nets:\n");
155 /* this pass gives all nets a name, whether specified or creates a */
158 while (nl_current
!= NULL
) {
159 if (nl_current
->cpins
) {
160 pl_current
= nl_current
->cpins
;
161 while (pl_current
!= NULL
) {
163 if (pl_current
->plid
!= -1) {
167 if (pl_current
->plid
!= -1 && pl_current
->nets
) {
169 g_free(pl_current
->net_name
);
173 /* only name nets of components which */
175 if (nl_current
->component_uref
) {
176 pl_current
->net_name
=
177 s_net_name(pr_current
,
180 nl_current
->hierarchy_tag
,
183 /* put this name also in the first
184 node of the nets linked list */
185 if (pl_current
->net_name
&& pl_current
->nets
) {
186 if (pl_current
->nets
->next
) {
187 pl_current
->nets
->next
->net_name
=
188 g_strdup (pl_current
->net_name
);
194 pl_current
= pl_current
->next
;
197 nl_current
= nl_current
->next
;
202 printf("- Renaming nets:\n");
205 s_rename_all(pr_current
, head
);
209 printf("- Resolving hierarchy:\n");
211 s_hierarchy_post_process(pr_current
, head
);
214 if (pr_current
->hierarchy_uref_mangle
== FALSE
) {
216 printf("- Removing refdes mangling:\n");
218 s_hierarchy_remove_uref_mangling(pr_current
, head
);
224 void s_netlist_name_named_nets (TOPLEVEL
*pr_current
,
225 NETLIST
*named_netlist
,
226 NETLIST
*unnamed_netlist
) {
229 CPINLIST
*pl_current
;
234 printf("\n- Staring post processing\n");
235 printf("- Naming nets of graphical objects:\n");
238 /* this pass gives all nets a name, whether specified or creates a */
240 nl_current
= unnamed_netlist
;
241 while (nl_current
!= NULL
) {
242 if (nl_current
->cpins
) {
243 pl_current
= nl_current
->cpins
;
244 while (pl_current
!= NULL
) {
246 if (pl_current
->plid
!= -1) {
250 if (pl_current
->plid
!= -1 && pl_current
->nets
) {
253 n_current
= pl_current
->nets
;
254 while (n_current
!= NULL
) {
255 g_free (n_current
->net_name
);
256 n_current
->net_name
= s_netlist_netname_of_netid(pr_current
,
260 if (n_current
->net_name
!= NULL
) {
261 net_name
= n_current
->net_name
;
263 n_current
= n_current
->next
;
265 if (net_name
!= NULL
) {
266 pl_current
->net_name
= g_strdup(net_name
);
269 pl_current
= pl_current
->next
;
272 nl_current
= nl_current
->next
;
279 char *s_netlist_netname_of_netid (TOPLEVEL
*pr_current
,
280 NETLIST
*netlist_head
,
284 CPINLIST
*pl_current
;
287 nl_current
= netlist_head
;
289 /* walk through the list of components, and through the list
290 * of individual pins on each, looking for the net identifier
292 while (nl_current
!= NULL
) {
293 pl_current
= nl_current
->cpins
;
294 while (pl_current
!= NULL
) {
295 if (pl_current
->net_name
) {
296 n_current
= pl_current
->nets
;
297 while (n_current
!= NULL
) {
298 if (n_current
->nid
== net_id
) {
299 return (g_strdup(n_current
->net_name
));
301 n_current
= n_current
->next
;
304 pl_current
= pl_current
->next
;
306 nl_current
= nl_current
->next
;