| /csrg-svn/local/ditroff/ditroff.okeeffe/ |
| H A D | v.h | 1 struct v {int pn,nl,yr,hp,ct,dn,mo,dy,dw,ln,dl,st,sb,cd,pid; argument
2 int vxx[NN-NNAMES];} v ; argument
|
| /csrg-svn/local/ditroff/ditroff.okeeffe/troff/ |
| H A D | v.h | 1 struct v {int pn,nl,yr,hp,ct,dn,mo,dy,dw,ln,dl,st,sb,cd,pid; struct
2 int vxx[NN-NNAMES];} v ; variable
|
| /csrg-svn/old/roff/common_source/ |
| H A D | v.h | 10 struct v {int pn,nl,yr,hp,ct,dn,mo,dy,dw,ln,dl,st,sb,cd; argument
11 int vxx[NN-NNAMES];} v ; variable
|
| /csrg-svn/usr.bin/struct/struct/ |
| H A D | def.h | 18 #define DEFINED(v) (v >= 0) argument
54 #define NTYPE(v) graph[v][0] argument
55 #define BEGCOM(v) graph[v][1] argument
56 #define RSIB(v) graph[v][2] argument
57 #define REACH(v) graph[v][3] argument
58 #define LCHILD(v,i) *lchild(v,i) argument
59 #define CHILDNUM(v) childper[NTYPE(v)] argument
60 #define ARC(v,i) *arc(v,i) argument
61 #define ARCNUM(v) *((arcsper[NTYPE(v)] >= 0) ? &arcsper[NTYPE(v)]: &graph[v][-arcsper[NTYPE(v)]]) argument
64 #define BEGCODE(v) *stlfmt(v,0) /* 1st char of line on disk or address of string */ argument
[all …]
|
| H A D | 0.parts.c | 46 VERT *arc(v,i) in arc() argument
55 VERT *lchild(v,i) in lchild() argument
63 int *vxpart(v,type,j) in vxpart() argument
71 int *expres(v) in expres() argument
80 int *negpart(v) in negpart() argument
87 int *predic(v) in predic() argument
94 int *level(v) in level() argument
100 int *stlfmt(v,n) in stlfmt() argument
|
| H A D | 3.def.h | 7 #define RECURSE(p,v,r) { for (r = 0; r < CHILDNUM(v); ++r) if (DEFINED(LCHILD(v,r))) p(LCHILD(v,r))… argument
9 #define IFTHEN(v) ( NTYPE(v) == IFVX && !DEFINED(LCHILD(v,ELSE))) argument
11 #define BRK(v) FATH(v) /* lexical successor of v, for ITERVX only */ argument
12 #define LABEL(v) REACH(v) argument
|
| H A D | 2.dfs.c | 35 #define MARK(v) {REACH(v) = 1; } /* mark node v */ argument
36 #define UNMARK(v) {REACH(v) = 0; } argument
37 #define MARKED(v) (REACH(v)) argument
43 dfs(v) /* depth first search */ in dfs() argument
71 search(v) in search() argument
96 VERT v; in chreach() local
114 VERT v, adj; in addloop() local
139 insloop(v) /* insert LOOPVX, ITERVX at node number v */ in insloop() argument
165 repsearch(v) /* repeat df search in order to fill in after, ntoaft, ntobef tables */ in repsearch() argument
|
| H A D | 3.loop.c | 13 #define ARCCOUNT(v) REACH(v) argument
16 fixhd(v,hd,head) in fixhd() argument
37 VERT w,v; in cntarcs() local
51 fixloop(v) /* find WHILE loops */ in fixloop() argument
73 getwh(v) in getwh() argument
100 getun(v) /* change loop to REPEAT UNTIL if possible */ in getun() argument
132 getswitch(v) in getswitch() argument
|
| H A D | 4.out.c | 14 outrat(v,tab,tabfirst) in outrat() argument
224 newlevel(v,ch,tab,tabfirst) in newlevel() argument
253 prpred(v,addpar) in prpred() argument
275 prstln(v,tab) in prstln() argument
292 prcom(v) in prcom() argument
|
| H A D | 3.reach.c | 41 VERT v; in getreach() local
54 exits(v) /* set REACH(v) = w if w is only node outside subtree of v which is reached from within in exits() argument
100 number(v) in number() argument
119 NUM(v) in NUM() argument
126 SETNUM(v,count) in SETNUM() argument
|
| H A D | 2.test.c | 24 VERT v; local
32 VERT v; local
40 VERT v; in testtree() local
|
| H A D | 3.branch.c | 17 VERT v; local
27 chkbranch(v,head) in chkbranch() argument
80 addlab(v) /* add labels */ in addlab() argument
|
| H A D | 4.def.h | 15 #define YESBRACE(v,i) { if (DEFINED(LCHILD(v,i))) brace[LCHILD(v,i)] = TRUE; } argument
16 #define NOBRACE(v,i) { if (DEFINED(LCHILD(v,i))) brace[LCHILD(v,i)] = FALSE; } argument
17 #define HASBRACE(v,i) ((DEFINED(LCHILD(v,i))) ? brace[LCHILD(v,i)] : TRUE) argument
|
| H A D | 3.then.c | 18 getthen(v) /* turn IFVX into THEN when appropriate, create else ifs where possible */ in getthen() argument
61 mkthen(v) in mkthen() argument
77 negate(v) in negate() argument
|
| H A D | 2.tree.c | 25 VERT v,u,from; variable
103 insib(w,v) /* make RSIB(w) = v, and make RSIB(rightmost sib of v) = old RSIB(w) */ in insib() argument
115 asoc(v,n) /* return # of nodes associated with v if <= n, -1 otherwise */ in asoc() argument
|
| H A D | 3.flow.c | 18 #define BRANCHTYPE(v) (NTYPE(v) == GOVX ) argument
29 fixflow(v,autolex) in fixflow() argument
72 lexval(v,lastlex) in lexval() argument
|
| H A D | 2.dom.c | 26 VERT v; variable
44 comdom(u,v,dom) /* find closest common dominator of u,v */ in comdom() argument
|
| H A D | 4.brace.c | 14 ndbrace(v) /* determine whether braces needed around subparts of v */ in ndbrace() argument
42 compound(v,ch) /* return TRUE iff subpart ch of v has multiple statements */ in compound() argument
|
| /csrg-svn/bin/ps/ |
| H A D | print.c | 47 VAR *v; in printheader() local
70 VAR *v; local
117 VAR *v; local
128 VAR *v; local
146 VAR *v; local
226 VAR *v; local
237 VAR *v; local
254 VAR *v; local
271 VAR *v; local
291 VAR *v; local
[all …]
|
| /csrg-svn/usr.bin/window/ |
| H A D | lcmd1.c | 38 struct value *v; variable
101 l_def_nline(v, a) in l_def_nline() argument
116 l_smooth(v, a) in l_smooth() argument
134 l_def_smooth(v, a) in l_def_smooth() argument
147 l_select(v, a) in l_select() argument
166 l_debug(v, a) in l_debug() argument
179 l_escape(v, a) in l_escape() argument
203 struct value *v; variable
221 l_foreground(v, a) in l_foreground() argument
244 l_terse(v, a) in l_terse() argument
[all …]
|
| H A D | parser3.c | 32 p_expr(v, flag) in p_expr() argument
62 p_expr0(v, flag) in p_expr0() argument
101 p_expr1(v, flag) in p_expr1() argument
135 p_expr2(v, flag) in p_expr2() argument
|
| H A D | lcmd2.c | 26 struct value *v, *a; variable
79 struct value *v; variable
156 struct value *v, *a; variable
189 struct value *v, *a; variable
230 struct value *v, *a; variable
271 struct value *v, *a; variable
338 struct value *v, *a; variable
353 struct value *v; variable
|
| H A D | parser5.c | 21 p_expr11(v, flag) in p_expr11() argument
123 p_expr12(v, flag) in p_expr12() argument
|
| /csrg-svn/lib/libc/regex/ |
| H A D | regexec.c | 41 #define CLEAR(v) ((v) = 0) argument
42 #define SET0(v, n) ((v) &= ~(1 << (n))) argument
43 #define SET1(v, n) ((v) |= 1 << (n)) argument
44 #define ISSET(v, n) ((v) & (1 << (n))) argument
50 #define SETUP(v) ((v) = 0) argument
54 #define ISSTATEIN(v, o) ((v) & (o)) argument
59 #define ISSETBACK(v, n) ((v) & ((unsigned)here >> (n))) argument
88 #define CLEAR(v) memset(v, 0, m->g->nstates) argument
89 #define SET0(v, n) ((v)[n] = 0) argument
90 #define SET1(v, n) ((v)[n] = 1) argument
[all …]
|
| /csrg-svn/bin/csh/ |
| H A D | func.c | 104 doonintr(v, t) in doonintr() argument
140 donohup(v, t) in donohup() argument
153 dozip(v, t) in dozip() argument
168 doalias(v, t) in doalias() argument
197 unalias(v, t) in unalias() argument
206 dologout(v, t) in dologout() argument
216 dologin(v, t) in dologin() argument
239 doif(v, kp) in doif() argument
294 doelse(v, t) in doelse() argument
303 dogoto(v, t) in dogoto() argument
[all …]
|