1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
/*
* util.c -- general utility functions.
*/
#include "../h/gsupport.h"
#include "tproto.h"
#include "tglobals.h"
#include "tree.h"
extern int optind;
extern char *ofile;
/*
* Information about Icon functions.
*/
/*
* Names of Icon functions.
*/
char *ftable[] = {
#define FncDef(p,n) Lit(p),
#define FncDefV(p) Lit(p),
#include "../h/fdefs.h"
#undef FncDef
#undef FncDefV
};
int ftbsize = sizeof(ftable) / sizeof(char *);
/*
* tcalloc - allocate and zero m*n bytes
*/
pointer tcalloc(m, n)
unsigned int m, n;
{
pointer a;
if ((a = calloc(m, n)) == 0)
quit("out of memory");
return a;
}
/*
* trealloc - realloc a table making it half again larger and zero the
* new part of the table.
*/
pointer trealloc(table, tblfree, size, unit_size, min_units, tbl_name)
pointer table; /* table to be realloc()ed */
pointer tblfree; /* reference to table free pointer if there is one */
unsigned int *size; /* size of table */
int unit_size; /* number of bytes in a unit of the table */
int min_units; /* the minimum number of units that must be allocated. */
char *tbl_name; /* name of the table */
{
word new_size;
word num_bytes;
word free_offset;
word i;
char *new_tbl;
new_size = (*size * 3) / 2;
if (new_size - *size < min_units)
new_size = *size + min_units;
num_bytes = new_size * unit_size;
if (tblfree != NULL)
free_offset = DiffPtrs(*(char **)tblfree, (char *)table);
if ((new_tbl = realloc(table, (unsigned)num_bytes)) == 0)
quitf("out of memory for %s", tbl_name);
for (i = *size * unit_size; i < num_bytes; ++i)
new_tbl[i] = 0;
*size = new_size;
if (tblfree != NULL)
*(char **)tblfree = (char *)(new_tbl + free_offset);
return (pointer)new_tbl;
}
/*
* round2 - round an integer up to the next power of 2.
*/
unsigned int round2(n)
unsigned int n;
{
unsigned int b = 1;
while (b < n)
b <<= 1;
return b;
}
|
