1 /* tb.c: check which entries exist, also storage allocation */
9 for (c = 0; c < ncol; c++) {
10 used[c] = lused[c] = rused[c] = 0;
11 for (i = 0; i < nlin; i++) {
12 if (instead[i] || fullbot[i])
15 if (k == '-' || k == '=')
17 if ((k == 'n' || k == 'a')) {
18 rused[c] |= real(table[i][c].rcol);
19 if ( !real(table[i][c].rcol))
20 used[c] |= real(table[i][c].col);
22 lused[c] |= real(table[i][c].col);
24 used[c] |= real(table[i][c].col);
53 return(spvecs[spcount++]);
54 if (spcount >= MAXVEC)
55 error("Too many characters in table");
56 spvecs[spcount++] = pp = calloc(MAXCHS + MAXLINLEN, 1);
57 if (pp == (char *) - 1 || pp == (char *)0)
58 error("no space for characters");
73 if (tpcount < 0 || thisvec + n > tpvecs[tpcount] + MAXCHS) {
75 if (tpvecs[tpcount] == 0) {
76 tpvecs[tpcount] = calloc(MAXCHS, 1);
78 thisvec = tpvecs[tpcount];
79 if (thisvec == (char *)0)
80 error("no space for vectors");
84 for (q = tp; q < (int *)thisvec; q++)
93 /* give back unwanted space in some vectors */
94 /* this should call free; it does not because
95 alloc() is so buggy */