78 |
|
if ((hp = (HOLO *)malloc(n)) == NULL) |
79 |
|
return(NULL); |
80 |
|
/* copy header information */ |
81 |
< |
copystruct(hp, &hdhead); |
81 |
> |
*hp = hdhead; |
82 |
|
/* allocate and clear beam list */ |
83 |
|
hp->bl = (BEAM **)malloc((nbeams(hp)+1)*sizeof(BEAM *)+sizeof(BEAM)); |
84 |
|
if (hp->bl == NULL) { |
261 |
|
hp->dirseg[j].n = 1; |
262 |
|
break; |
263 |
|
} |
264 |
< |
copystruct(hp->dirseg+j, hp->dirseg+(j-1)); |
264 |
> |
*(hp->dirseg+j) = *(hp->dirseg+(j-1)); |
265 |
|
} |
266 |
|
do { /* check neighbors */ |
267 |
|
mindist = nbeams(hp); /* find closest */ |
283 |
|
hp->dirseg[minpos].n - hp->dirseg[j].s; |
284 |
|
hp->dirty--; |
285 |
|
while (++j < hp->dirty) /* close the gap */ |
286 |
< |
copystruct(hp->dirseg+j, hp->dirseg+(j+1)); |
286 |
> |
*(hp->dirseg+j) = *(hp->dirseg+(j+1)); |
287 |
|
} while (mindist <= MINDIRSEL); |
288 |
|
} |
289 |
|
|
555 |
|
if (++k >= f->nfrags) |
556 |
|
goto endloop; |
557 |
|
if (k > j) |
558 |
< |
copystruct(f->fi+j, f->fi+k); |
558 |
> |
*(f->fi+j) = *(f->fi+k); |
559 |
|
} |
560 |
|
endloop: |
561 |
|
f->nfrags = j; |
587 |
|
f->fi[j].nrd = bi->nrd; |
588 |
|
break; |
589 |
|
} |
590 |
< |
copystruct(f->fi+j, f->fi+(j-1)); |
590 |
> |
*(f->fi+j) = *(f->fi+(j-1)); |
591 |
|
} |
592 |
|
/* coalesce adjacent fragments */ |
593 |
|
/* successors never empty */ |
817 |
|
hb[j].b = i; |
818 |
|
break; |
819 |
|
} |
820 |
< |
copystruct(hb+j, hb+(j-1)); |
820 |
> |
*(hb+j) = *(hb+(j-1)); |
821 |
|
} |
822 |
|
} |
823 |
|
return(nents); /* return new list length */ |