| 45 |
|
new_histo(n) /* clear our histogram */ |
| 46 |
|
int n; |
| 47 |
|
{ |
| 48 |
< |
bzero((char *)histo, sizeof(histo)); |
| 48 |
> |
bzero((void *)histo, sizeof(histo)); |
| 49 |
|
return(0); |
| 50 |
|
} |
| 51 |
|
|
| 130 |
|
return; |
| 131 |
|
} |
| 132 |
|
N = n; |
| 133 |
< |
bzero((char *)cerr, 3*N*sizeof(short)); |
| 133 |
> |
bzero((void *)cerr, 3*N*sizeof(short)); |
| 134 |
|
} |
| 135 |
|
err[0] = err[1] = err[2] = 0; |
| 136 |
|
for (x = 0; x < n; x++) { |
| 169 |
|
} |
| 170 |
|
/* split box */ |
| 171 |
|
branch = split(box); |
| 172 |
< |
bcopy((char *)box, (char *)kb, sizeof(kb)); |
| 172 |
> |
bcopy((void *)box, (void *)kb, sizeof(kb)); |
| 173 |
|
/* do left (lesser) branch */ |
| 174 |
|
kb[prim(branch)][1] = part(branch); |
| 175 |
|
cut(kb, c0, (c0+c1)>>1); |
| 337 |
|
if (nl[i][t] == i) { /* add to list */ |
| 338 |
|
nl[i][t++] = j; |
| 339 |
|
if (t % NBSIZ == 0) { /* enlarge list */ |
| 340 |
< |
if ((nnl = realloc(nl[i], t+NBSIZ)) == NULL) |
| 340 |
> |
if ((nnl = realloc((void *)nl[i], |
| 341 |
> |
t+NBSIZ)) == NULL) |
| 342 |
|
t--; |
| 343 |
|
else |
| 344 |
|
nl[i] = (BYTE *)nnl; |