| 215 | } |
| 216 | |
| 217 | void lClean_newstruct(lists l) |
| 218 | { |
| 219 | if (l->nr>=0) |
| 220 | { |
| 221 | int i; |
| 222 | ring r=NULL; |
| 223 | for(i=l->nr;i>=0;i--) |
| 224 | { |
| 225 | if ((i>0) && (l->m[i-1].rtyp==RING_CMD)) |
| 226 | r=(ring)(l->m[i-1].data); |
| 227 | else |
| 228 | r=NULL; |
| 229 | l->m[i].CleanUp(r); |
| 230 | } |
| 231 | omFreeSize((ADDRESS)l->m, (l->nr+1)*sizeof(sleftv)); |
| 232 | l->nr=-1; |
| 233 | } |
| 234 | omFreeBin((ADDRESS)l,slists_bin); |
| 235 | } |
| 236 | |
| 237 | static BOOLEAN newstruct_Assign_same(leftv l, leftv r) |
| 238 | { |
no test coverage detected