| 5 |
|
* Routines for tracking beam compuatations |
| 6 |
|
*/ |
| 7 |
|
|
| 8 |
+ |
#include <string.h> |
| 9 |
+ |
|
| 10 |
|
#include "rholo.h" |
| 11 |
|
#include "view.h" |
| 12 |
|
|
| 94 |
|
CHECK(p==NULL, SYSTEM, "out of memory in dispbeam"); |
| 95 |
|
} |
| 96 |
|
/* assign packet fields */ |
| 97 |
< |
bcopy((void *)hdbray(b), (void *)packra(p), b->nrm*sizeof(RAYVAL)); |
| 97 |
> |
memcpy((void *)packra(p), (void *)hdbray(b), b->nrm*sizeof(RAYVAL)); |
| 98 |
|
p->nr = p->nc = b->nrm; |
| 99 |
|
for (p->hd = 0; hdlist[p->hd] != hb->h; p->hd++) |
| 100 |
|
if (hdlist[p->hd] == NULL) |
| 168 |
|
complist = (PACKHEAD *)malloc(nents*sizeof(PACKHEAD)); |
| 169 |
|
if (complist == NULL) |
| 170 |
|
goto memerr; |
| 171 |
< |
bcopy((void *)clist, (void *)complist, nents*sizeof(PACKHEAD)); |
| 171 |
> |
memcpy((void *)complist, (void *)clist, nents*sizeof(PACKHEAD)); |
| 172 |
|
break; |
| 173 |
|
case BS_ADD: /* add to computation set */ |
| 174 |
|
case BS_MAX: /* maximum of quantities */ |
| 393 |
|
else if (listpos) { /* else sort and merge sublist */ |
| 394 |
|
list2 = (PACKHEAD *)malloc(listpos*sizeof(PACKHEAD)); |
| 395 |
|
CHECK(list2==NULL, SYSTEM, "out of memory in sortcomplist"); |
| 396 |
< |
bcopy((void *)complist,(void *)list2,listpos*sizeof(PACKHEAD)); |
| 396 |
> |
memcpy((void *)list2,(void *)complist,listpos*sizeof(PACKHEAD)); |
| 397 |
|
qsort((void *)list2, listpos, sizeof(PACKHEAD), beamcmp); |
| 398 |
|
mergeclists(complist, list2, listpos, |
| 399 |
|
complist+listpos, complen-listpos); |