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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
#include <stdio.h>
#include <ncurses.h>
#include <unistd.h>
#include "vmtbl.h"
#include "sc.h"
#include "macros.h"
#include "color.h" // for set_ucolor
#include "conf.h" // for set_ucolor
#include "trigger.h"
#include <stdlib.h> // for atoi
//LINUX - PSC not def
#define ATBL_P(tbl, row, col) (*(tbl + row) + (col))
/*
* check to see if *rowp && *colp are currently allocated, if not expand the
* current size if we can.
*/
#ifndef PSC
void checkbounds(int *rowp, int *colp) {
if (*rowp < 0)
*rowp = 0;
else if (*rowp >= maxrows) {
if (*colp >= maxcols) {
if (!growtbl(GROWBOTH, *rowp, *colp)) {
*rowp = maxrows - 1;
*colp = maxcols - 1;
}
return;
} else {
if (!growtbl(GROWROW, *rowp, 0))
*rowp = maxrows - 1;
return;
}
}
if (*colp < 0)
*colp = 0;
else if (*colp >= maxcols) {
if (!growtbl(GROWCOL, 0, *colp))
*colp = maxcols - 1;
}
}
#endif /* ! PSC */
/* scxrealloc will just scxmalloc if oldptr is == NULL */
#define GROWALLOC(newptr, oldptr, nelem, type, msg) \
newptr = (type *)scxrealloc((char *)oldptr, \
(unsigned)(nelem * sizeof(type))); \
if (newptr == (type *)NULL) { \
sc_error(msg); \
return (FALSE); \
} \
oldptr = newptr /* wait incase we can't alloc */
#ifndef PSC
static char nolonger[] = "The table can't be any longer";
#endif /* !PSC */
static char nowider[] = "The table can't be any wider";
/*
* grow the main && auxiliary tables (reset maxrows/maxcols as needed)
* toprow &&/|| topcol tell us a better guess of how big to become.
* we return TRUE if we could grow, FALSE if not....
*/
int growtbl(int rowcol, int toprow, int topcol) {
int * fwidth2;
int * precision2;
int * realfmt2;
int newcols;
#ifndef PSC
struct ent *** tbl2;
struct ent ** nullit;
int cnt;
char * col_hidden2;
char * row_hidden2;
int newrows;
int i;
newrows = maxrows;
#endif /* ! PSC */
newcols = maxcols;
if (rowcol == GROWNEW) {
#ifndef PSC
maxrows = toprow = 0;
/* when we first start up, fill the screen w/ cells */
{
int startval;
startval = LINES - RESROW;
newrows = startval > MINROWS ? startval : MINROWS;
startval = ((COLS) - rescol) / DEFWIDTH;
newcols = startval > MINCOLS ? startval : MINCOLS;
}
#else
newcols = MINCOLS;
#endif /* !PSC */
maxcols = topcol = 0;
}
#ifndef PSC
/* set how much to grow */
if ((rowcol == GROWROW) || (rowcol == GROWBOTH)) {
if (toprow > maxrows)
newrows = GROWAMT + toprow;
else
newrows += GROWAMT;
}
#endif /* !PSC */
if ((rowcol == GROWCOL) || (rowcol == GROWBOTH)) {
if ((rowcol == GROWCOL) && ((maxcols == ABSMAXCOLS) || (topcol >= ABSMAXCOLS))) {
sc_error(nowider);
return (FALSE);
}
if (topcol > maxcols)
newcols = GROWAMT + topcol;
else
newcols += GROWAMT;
if (newcols > ABSMAXCOLS)
newcols = ABSMAXCOLS;
}
if (newrows > MAXROWS) { // 08/12/2014
sc_error(nolonger);
return (FALSE);
}
#ifndef PSC
if ((rowcol == GROWROW) || (rowcol == GROWBOTH) || (rowcol == GROWNEW)) {
struct ent *** lnullit;
int lcnt;
GROWALLOC(row_hidden2, row_hidden, newrows, char, nolonger);
memset(row_hidden + maxrows, 0, (newrows - maxrows) * sizeof(char));
/*
* alloc tbl row pointers, per net.lang.c, calloc does not
* necessarily fill in NULL pointers
*/
GROWALLOC(tbl2, tbl, newrows, struct ent **, nolonger);
for (lnullit = tbl + maxrows, lcnt = 0; lcnt < newrows - maxrows; lcnt++, lnullit++)
*lnullit = (struct ent **)NULL;
/* memset(tbl + maxrows, (char *) NULL, (newrows - maxrows) * (sizeof(struct ent **)));*/
}
#endif /* !PSC */
if ((rowcol == GROWCOL) || (rowcol == GROWBOTH) || (rowcol == GROWNEW)) {
GROWALLOC(fwidth2, fwidth, newcols, int, nowider);
GROWALLOC(precision2, precision, newcols, int, nowider);
GROWALLOC(realfmt2, realfmt, newcols, int, nowider);
#ifdef PSC
memset(fwidth + maxcols, 0, (newcols - maxcols) * sizeof(int));
memset(precision + maxcols, 0, (newcols - maxcols) * sizeof(int));
memset(realfmt + maxcols, 0, (newcols - maxcols) * sizeof(int));
}
#else
GROWALLOC(col_hidden2, col_hidden, newcols, char, nowider);
memset(col_hidden + maxcols, 0, (newcols - maxcols) * sizeof(char));
for (i = maxcols; i < newcols; i++) {
fwidth[i] = DEFWIDTH;
precision[i] = DEFPREC;
realfmt[i] = DEFREFMT;
}
/* [re]alloc the space for each row */
for (i = 0; i < maxrows; i++) {
if ((tbl[i] = (struct ent **) scxrealloc((char *)tbl[i], (unsigned) (newcols * sizeof(struct ent **)))) == (struct ent **)0) {
sc_error(nowider);
return(FALSE);
}
for (nullit = ATBL_P(tbl, i, maxcols), cnt = 0; cnt < newcols - maxcols; cnt++, nullit++)
*nullit = (struct ent *)NULL;
/* memset((char *) ATBL(tbl,i, maxcols), 0, (newcols - maxcols) * sizeof(struct ent **)); */
}
}
else
i = maxrows;
/* fill in the bottom of the table */
for (; i < newrows; i++) {
if ((tbl[i] = (struct ent **) scxmalloc((unsigned)(newcols * sizeof(struct ent **)))) == (struct ent **) 0) {
sc_error(nowider);
return(FALSE);
}
for (nullit = tbl[i], cnt = 0; cnt < newcols; cnt++, nullit++)
*nullit = (struct ent *)NULL;
/* memset((char *) tbl[i], 0, newcols * sizeof(struct ent **));*/
}
maxrows = newrows;
if (maxrows > 1000) rescol = 5;
if (maxrows > 10000) rescol = 6;
if (maxrows > 100000) rescol = 7;
if (maxrows > 1000000) rescol = 8;
#endif /* PSC */
maxcols = newcols;
return (TRUE);
}
struct ent ** ATBL(struct ent ***tbl, int row, int col) {
struct ent **ent=(*(tbl+row)+(col));
struct ent *v= *ent;
if ((v) && (v->trigger) && ((v->trigger->flag & TRG_READ) == TRG_READ))
do_trigger(v,TRG_READ);
return ent;
}
|
