|
|
1.1 root 1: #define NORM 0 /* normal message */
2: #define INITM 1 /* initial message */
3:
4: #define SND 2
5: #define RCV 4
6: #define SAR 6
7: #define RFR 1
8: #define DCL 2
9: #define RAD 3
10: #define ADR 4
11: #define DAR 6
12:
13: #define MAXNAME 32 /* max available composite namelength */
14: #define MAXPROC 16 /* max number of processes */
15: #define MANY 512 /* max nr of distinct rows or names */
16: #define MAXDEPTH 32 /* max nesting depth of if's and do's */
17: #define EXPRMAX 64
18: #define NOSTATE -1 /* default state */
19:
20: #define SOME 1 /* not none */
21: #define NONE -1 /* default signal */
22: #define NEW -1
23: #define OLD 0
24: #define LAB 1
25:
26: #define ISM 0 /* message variable */
27: #define ISQ 1 /* queue-set variable */
28: #define ISV 2 /* protocol variable */
29: #define ISQN 3 /* queuename variable */
30:
31: /* types of transitions: */
32: #define INP 10 /* recv specific message */
33: #define DFL 11 /* default input from q */
34: #define TMO 12 /* transition on timeout */
35: #define OUTP 13 /* append message to a q */
36: #define SPN 14 /* builtin call or transit state */
37: #define CND 15 /* conditional */
38: #define FCT 16 /* function call */
39:
40: /* `builtins:' */
41: #define INCR 16 /* increment */
42: #define DECR 17 /* decrement */
43: #define SUBT 18 /* subtract */
44: #define ADDT 19 /* add */
45: #define SETV 32 /* set: = */
46: #define ISEQ 256 /* compare: == */
47: #define NTEQ 257 /* != */
48: #define GREQ 258 /* >= */
49: #define SMEQ 259 /* <= */
50: #define GRNQ 260 /* > */
51: #define SMNQ 261 /* < */
52:
53: #define SPNT(u) (u == TMO || u == OUTP)
54:
55: struct QTABLE {
56: char name[MAXNAME];
57: short status;
58: short limit;
59: short owner;
60: int multiple;
61: unsigned char magic;
62: };
63:
64: #define BASEVAL MAXPROC /* base value for coding messages */
65: #define NQUEUES 2*MAXPROC /* maximum number of queues */
66:
67: struct PROCTABLE {
68: char name[MAXNAME];
69: int nrstates;
70: int unreach;
71: int replic;
72: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.