20 |
|
extern int Malloc_cnt; |
21 |
|
#endif |
22 |
|
LIST |
23 |
+ |
/* NOTE: Memory is not initialized */ |
24 |
|
*new_list() |
25 |
|
{ |
26 |
|
LIST *l; |
37 |
|
if( !(l = (LIST *)malloc(sizeof(LIST)))) |
38 |
|
error(SYSTEM,"new_list():Unable to allocate memory"); |
39 |
|
} |
39 |
– |
/* clear the memory */ |
40 |
– |
bzero(l, sizeof(LIST)); |
41 |
– |
|
40 |
|
return(l); |
41 |
|
} |
42 |
|
|
48 |
|
{ |
49 |
|
LIST * l; |
50 |
|
|
53 |
– |
if(!a) |
54 |
– |
return(b); |
55 |
– |
|
51 |
|
if(!b) |
52 |
|
return(a); |
53 |
|
|
60 |
|
return(b); |
61 |
|
} |
62 |
|
|
63 |
+ |
/* attaches list a at the end of list b */ |
64 |
+ |
LIST |
65 |
+ |
*add_data(l,d,end) |
66 |
+ |
LIST *l; |
67 |
+ |
int d; |
68 |
+ |
LIST **end; |
69 |
+ |
|
70 |
+ |
{ |
71 |
+ |
LIST *list,*lptr; |
72 |
+ |
|
73 |
+ |
list = new_list(); |
74 |
+ |
SET_LIST_DATA(list,d); |
75 |
+ |
SET_LIST_NEXT(list,NULL); |
76 |
+ |
if(!l) |
77 |
+ |
{ |
78 |
+ |
if(end) |
79 |
+ |
*end = list; |
80 |
+ |
return(list); |
81 |
+ |
} |
82 |
+ |
if(end) |
83 |
+ |
lptr = *end; |
84 |
+ |
else |
85 |
+ |
{ |
86 |
+ |
lptr = l; |
87 |
+ |
while(LIST_NEXT(lptr)) |
88 |
+ |
lptr = LIST_NEXT(lptr); |
89 |
+ |
} |
90 |
+ |
LIST_NEXT(lptr) = list; |
91 |
+ |
if(end) |
92 |
+ |
*end = list; |
93 |
+ |
|
94 |
+ |
return(l); |
95 |
+ |
} |
96 |
+ |
|
97 |
|
/* Adds data to the end of a circular list. If set, "end" |
98 |
|
* is a pointer to the last element in the list |
99 |
|
*/ |
122 |
|
return(l); |
123 |
|
} |
124 |
|
|
96 |
– |
/* Pushes data element d at the top of the list- returns pointer |
97 |
– |
to new top of list |
98 |
– |
*/ |
99 |
– |
LIST |
100 |
– |
*push_data(l,d) |
101 |
– |
LIST *l; |
102 |
– |
int d; |
103 |
– |
{ |
104 |
– |
LIST * list; |
105 |
– |
|
106 |
– |
list = new_list(); |
107 |
– |
SET_LIST_DATA(list,d); |
108 |
– |
SET_LIST_NEXT(list,l); |
109 |
– |
return(list); |
110 |
– |
} |
125 |
|
|
126 |
+ |
|
127 |
|
/* frees the list */ |
128 |
|
LIST |
129 |
|
*free_list(l) |
137 |
|
return(NULL); |
138 |
|
} |
139 |
|
|
140 |
+ |
/* Pushes data element d at the top of the list- returns pointer |
141 |
+ |
to new top of list |
142 |
+ |
*/ |
143 |
+ |
LIST |
144 |
+ |
*push_data(l,d) |
145 |
+ |
LIST *l; |
146 |
+ |
int d; |
147 |
+ |
{ |
148 |
+ |
LIST *list; |
149 |
+ |
|
150 |
+ |
list = new_list(); |
151 |
+ |
SET_LIST_DATA(list,d); |
152 |
+ |
SET_LIST_NEXT(list,l); |
153 |
+ |
return(list); |
154 |
+ |
} |
155 |
|
/* Returns data element d at the top of the list- returns pointer |
156 |
|
to new top of list |
157 |
|
*/ |
208 |
|
} |
209 |
|
return(FALSE); |
210 |
|
} |
211 |
+ |
|
212 |
+ |
|
213 |
+ |
|
214 |
+ |
|
215 |
|
|
216 |
|
|
217 |
|
|