835 |
{ |
{ |
836 |
vf->tab.min = min; |
vf->tab.min = min; |
837 |
vf->tab.max = max; |
vf->tab.max = max; |
838 |
vf->tab.vector = pool_alloc (int_pool, |
vf->tab.vector = pool_nalloc (int_pool, |
839 |
sizeof (struct freq) * (max - min + 1)); |
max - min + 1, sizeof *vf->tab.vector); |
840 |
} |
} |
841 |
else |
else |
842 |
vf->tab.vector = NULL; |
vf->tab.vector = NULL; |
878 |
if (nl >= ml) |
if (nl >= ml) |
879 |
{ |
{ |
880 |
ml += 16; |
ml += 16; |
881 |
dl = pool_realloc (int_pool, dl, ml * sizeof (double)); |
dl = pool_nrealloc (int_pool, dl, ml, sizeof *dl); |
882 |
} |
} |
883 |
dl[nl++] = tokval; |
dl[nl++] = tokval; |
884 |
lex_get (); |
lex_get (); |
949 |
|
|
950 |
if (i >= n_percentiles || tokval != percentiles[i].p) |
if (i >= n_percentiles || tokval != percentiles[i].p) |
951 |
{ |
{ |
952 |
percentiles |
percentiles = pool_nrealloc (int_pool, percentiles, |
953 |
= pool_realloc (int_pool, percentiles, |
n_percentiles + 1, sizeof *percentiles); |
|
(n_percentiles + 1) * sizeof (struct percentile )); |
|
954 |
|
|
955 |
if (i < n_percentiles) |
if (i < n_percentiles) |
956 |
memmove (&percentiles[i + 1], &percentiles[i], |
memmove (&percentiles[i + 1], &percentiles[i], |