forked from mdykman/jlang-core
-
Notifications
You must be signed in to change notification settings - Fork 0
/
jt.h
249 lines (240 loc) · 17 KB
/
jt.h
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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
/* Copyright 1990-2011, Jsoftware Inc. All rights reserved. */
/* License in license.txt. */
/* */
/* Definitions for jt ("jthis") */
#if !SY_WINCE && (SYS & SYS_DOS)
#include <sys/stat.h>
#endif
#if (SYS & SYS_UNIX) /* IVL */
#include <sys/stat.h>
#endif
/*
All allocated and variable data for a J instance is accessed through
its JST structure.
Only simple constant data can be global and are shared by J instances.
Constants such as mtm are created in the dll process_attach. They are
the same for all instances and are never freed. The dll is never
allowed to unload as we don't have code to free mtm et. al.
j.map must be checked to ensure no 'bad' global data exists. In
windows the global data that needs scrutiny is in the 0003: section.
*/
typedef struct {
C* adbreak; /* must be first! ad mapped shared file break flag */
I arg; /* integer argument */
B asgn; /* 1 iff last operation on this line is assignment */
B assert; /* 1 iff evaluate assert. statements */
I* breakfh; /* win break file handle */
C breakfn[NPATH]; /* break file name */
B breakignore; /* 1 to ignore break (input_jfe_ output_jfe_ */
I* breakmh; /* win break map handle */
C* bx; /* box drawing characters */
A bxa; /* array of box drawing characters */
I bytes; /* bytes currently in use */
I bytesmax; /* high-water mark of "bytes" */
A cdarg; /* table of 15!:0 parsed left arguments */
A cdhash; /* hash table of indices into cdarg */
A cdhashl; /* hash table of indices into cdarg */
I cdna; /* # of used entries in cdarg */
I cdnl; /* # of used entries in cdhashl */
I cdns; /* length of used portion of cdstr */
A cdstr; /* strings for cdarg */
CMP comp; /* comparison function in sort */
int compgt; /* comparison: denotes greater than */
I compk; /* comparison: byte size of each item */
int complt; /* comparison: denotes less than */
I compn; /* comparison: number of atoms in each item */
C* compsev; /* comparison: sparse element value ptr */
I compsi; /* comparison: sparse current cell index */
I* compstv; /* comparison: sparse element item indices */
I compswf; /* comparison: sparse wf value */
I compsxc; /* comparison: sparse aii(x) */
C* compsxv; /* comparison: sparse AV(x) */
I compsyc; /* comparison: sparse aii(y) or *(1+AS(y)) */
I* compsyv; /* comparison: sparse AV(y) */
C* compv; /* comparison: beginning of data area */
A compw; /* comparison: orig arg. (for relative addressing) */
D ct; /* comparison tolerance */
UI ctmask; /* 1 iff significant wrt ct; for i. and i: */
A curlocn; /* current locale name corresp. to curname */
A curname; /* current name */
L* cursymb; /* current symbol table entry */
I db; /* debug flag; see 13!:0 */
A dbalpha; /* left argument for rerun */
I dbjump; /* line to jump to */
A dbomega; /* right argument for rerun */
A dbresult; /* result to pop to the next level */
C dbss; /* single step mode */
DC dbssd; /* stack entry d corresp. to d->dcss setting */
A dbssexec; /* single step: execute string */
A dbstops; /* stops set by the user */
C dbsusact; /* suspension action */
A dbtrap; /* trap, execute on suspension */
I dbuser; /* user-entered value for db */
DC dcs; /* ptr to debug stack entry for current script */
C diratts[7]; /* set by ismatch, read by dir1 */
C* dirbase; /* for directory search */
C dirmode[11]; /* set by ismatch, read by dir1 */
C dirnamebuf[NPATH];/* for directory search */
C dirrwx[3]; /* set by ismatch, read by dir1 */
#if !SY_WINCE
struct stat dirstatbuf; //set by ismatch, read by dir1
#if !SY_64 && (SYS & SYS_LINUX)
struct stat dummy1; // stat above should be stat64
struct stat dummy2; // reserve extra to avoid stomping disp
#endif
#endif
I disp[7]; /* # different verb displays */
I dlllasterror; /* DLL stuff */
B dotnames; /* 1 iff x. y. etc. names are permitted */
void*dtoa; /* use internally by dtoa.c */
C etx[1+NETX]; /* display text for last error (+1 for trailing 0) */
I etxn; /* strlen(etx) */
I etxn1; /* last non-zero etxn */
A evm; /* event messages */
I fcalli; /* named fn calls: current depth */
I fcalln; /* named fn calls: maximum permissible depth */
LS fcallg[1+NFCALL]; /* named fn calls: stack */
I fdepi; /* fn calls: current depth */
I fdepn; /* fn calls: maximum permissible depth */
A fill; /* fill */
C* fillv; /* fill value */
C fillv0[sizeof(Z)];/* default fill value */
A flkd; /* file lock data: number, index, length */
I flkn; /* file lock count */
A fopa; /* open files boxed names */
A fopf; /* open files corresp. file numbers */
I fopn; /* open files count */
D fuzz; /* fuzz (sometimes set to 0) */
I fxi; /* f. depth countdown */
A fxpath; /* f. path of names */
A* fxpv; /* f. AAV(fxpath) */
I getlasterror; /* DLL stuff */
A global; /* global symbol table */
I glock; /* 0=unlocked, 1=perm lock, 2=temp lock */
void*heap; /* heap handle */
I hin; /* used in dyad i. & i: */
I* hiv; /* used in dyad i. & i: */
A iep; /* immediate execution phrase */
B iepdo; /* 1 iff do iep */
C jerr; /* error number (0 means no error) */
I jerr1; /* last non-zero jerr */
AF lcp; /* linear representation paren function */
I lleft; /* positive finite left level */
I lmon; /* positive finite monadic level */
A local; /* local symbol table */
I locsize[2]; /* size indices for named and numbered locales */
I lright; /* positive finite right level */
A ltext; /* linear representation text */
AF ltie; /* linear representation tie function */
I* mfree[MLEN]; /* head ptr of each free list */
I mfreeb[MLEN]; /* # bytes tied up in the corresp. mfree list */
I mfreet[MLEN]; /* thresholds for garbage collect */
I min; /* the r result from irange */
I mmax; /* space allocation limit */
I mtyo; /* jsto output type - jfwrite arg to jpr */
C* mtyostr; /* jsto string */
I nfe; /* 1 for J native front end */
B nflag; /* 1 if space required before name */
B nla[256]; /* namelist names mask */
I nlt; /* namelist type mask */
A nvra; /* see comments in p.c */
A* nvrav; /* see comments in p.c */
A nvrb; /* see comments in p.c */
B* nvrbv; /* see comments in p.c */
I nvrtop; /* see comments in p.c */
I oleop; /* com flag to capture output */
void*opbstr; /* com ptr to BSTR for captured output */
I outeol; /* output: EOL sequence code */
I outmaxafter; /* output: maximum # lines after truncation */
I outmaxbefore; /* output: maximum # lines before truncation */
I outmaxlen; /* output: maximum line length before truncation */
C outseq[3]; /* EOL: "LF" "CR" "CRLF" */
I parsercalls; /* # times parser was called */
A pma; /* perf. monitor: data area */
I pmctr; /* perf. monitor: ctr>0 means do monitoring */
B pmrec; /* perf. monitor: 0 entry/exit; 1 all */
PM0* pmu; /* perf. monitor: (PM0)AV(pma) */
PM* pmv; /* perf. monitor: (PM*)(sizeof(PM0)+CAV(pma)) */
I pos[2]; /* boxed output x-y positioning */
C pp[8]; /* print precision */
AF pre; /* preface function for assignment */
I* rank; /* for integrated rank support */
I redefined; /* symbol table entry of redefined explicit defn */
int reginitflag; /* 1 iff regular expression stuff initialized */
I rela; /* if a is relative, a itself; else 0 */
I relw; /* if w is relative, w itself; else 0 */
B retcomm; /* 1 iff retain comments and redundant spaces */
I rng; /* RNG: generator selector */
UF rngF[5]; /* RNG: function to get the next random number */
UI* rngfxsv; /* RNG: rngv for fixed seed (?.) */
UF rngf; /* RNG: rngF[rng] */
I rngI[5]; /* RNG: indices */
I rngI0[5]; /* RNG: indices for RNG0 */
I rngi; /* RNG: current index */
UI rngM[5]; /* RNG: moduli */
I rngS[5]; /* RNG: seeds */
A rngseed; /* RNG: array seed */
UI* rngV[5]; /* RNG: state vectors */
UI* rngV0[5]; /* RNG: state vectors for RNG0 */
UI* rngv; /* RNG: rngV[rng] */
I rngw; /* RNG: # bits in a random # */
I sbfillfactor; /* SB for binary tree */
I sbgap; /* SB for binary tree */
A sbh; /* SB hash table of indices; -1 means unused */
I* sbhv; /* SB points to ravel of sbh */
I sbroot; /* SB root of the binary tree */
A sbs; /* SB string */
I sbsn; /* SB string length so far */
C* sbsv; /* SB points to ravel of sbs */
A sbu; /* SB data for each unique symbol */
I sbun; /* SB cardinality */
SBU* sbuv; /* SB points to ravel of sbu */
A sca; /* S: result vector */
I scn; /* S: actual length of sca */
I* scv; /* S: AV(sca) */
int sdinited; /* sockets */
I seclev; /* security level */
B sesm; /* whether there is a session manager */
A sf; /* for $: */
DC sitop; /* top of SI stack */
A slist; /* files used in right arg to 0!: */
I slisti; /* index into slist of current script */
I slistn; /* slist # of real entries */
I sm; /* sm options set by JSM() */
void*smdowd;
void*sminput;
void*smoutput; /* sm.. sm/wd callbacks set by JSM() */
void*smpoll;
D spfor; /* semi-global for use by spfor() */
B stch; /* enable setting of changed bit */
A stloc; /* locales symbol table */
I stmax; /* numbered locales maximum number */
A stnum; /* numbered locale numbers */
A stptr; /* numbered locale symbol table ptrs */
B stswitched; /* called fn switched locale */
I stused; /* entries in stnum/stptr in use */
A symb; /* symbol table for assignment */
I symindex; /* symbol table index (monotonically increasing) */
A symp; /* symbol pool array */
L* sympv; /* symbol pool array value ptr, (L*)AV(jt->symp) */
I tbase; /* index of current frame */
C* th2buf; /* space for formatting one number */
I th2bufn; /* current max length of buf */
UI timelimit; /* execution time limit milliseconds */
B tmonad; /* tacit translator: 1 iff monad */
B tostdout; /* 1 if output to stdout */
I transposeflag; /* com flag for transposed arrays */
D tssbase; /* initial time of date */
A* tstack; /* data portion of current frame */
A tstacka; /* current frame */
TA* ttab; /* tacit translator */
I ttabi; /* tacit translator */
I ttabi0; /* tacit translator */
B tsubst; /* tacit translator */
I ttop; /* stack top (index into tstack[]) */
B xco; /* 1 iff doing x: conversion */
B xdefn; /* 1 iff within explicit definition */
A xmod; /* extended integer: the m in m&|@f */
I xmode; /* extended integer operating mode */
} JST;
typedef JST* J;