| /plan9/sys/src/cmd/awk/ |
| H A D | proto.h | 27 extern int constnode(Node *); 28 extern char *strnode(Node *); 29 extern Node *notnull(Node *); 53 extern Node *nodealloc(int); 54 extern Node *exptostat(Node *); 55 extern Node *node1(int, Node *); 56 extern Node *node2(int, Node *, Node *); 57 extern Node *node3(int, Node *, Node *, Node *); 58 extern Node *node4(int, Node *, Node *, Node *, Node *); 59 extern Node *stat3(int, Node *, Node *, Node *); [all …]
|
| H A D | parse.c | 32 Node *nodealloc(int n) in nodealloc() 34 Node *x; in nodealloc() 36 x = (Node *) malloc(sizeof(Node) + (n-1)*sizeof(Node *)); in nodealloc() 44 Node *exptostat(Node *a) in exptostat() 50 Node *node1(int a, Node *b) in node1() 52 Node *x; in node1() 60 Node *node2(int a, Node *b, Node *c) in node2() 62 Node *x; in node2() 71 Node *node3(int a, Node *b, Node *c, Node *d) in node3() 73 Node *x; in node3() [all …]
|
| /plan9/sys/src/cmd/6c/ |
| H A D | gc.h | 29 Node* regtree; 30 Node* basetree; 120 Node base; 121 Node* saved; 122 Node* scope; 137 EXTERN Node constnode; 138 EXTERN Node fconstnode; 139 EXTERN Node vconstnode; 147 EXTERN Node* nodrat; 148 EXTERN Node* nodret; [all …]
|
| H A D | div.c | 83 sdivgen(Node *l, Node *r, Node *ax, Node *dx) in sdivgen() 107 udivgen(Node *l, Node *r, Node *ax, Node *dx) in udivgen() 111 Node nod; in udivgen() 143 sext(Node *d, Node *s, Node *l) in sext() 157 sdiv2(long c, int v, Node *l, Node *n) in sdiv2() 159 Node nod; in sdiv2() 179 smod2(long c, int v, Node *l, Node *n) in smod2() 181 Node nod; in smod2()
|
| /plan9/sys/src/cmd/8c/ |
| H A D | gc.h | 29 Node* regtree; 30 Node* basetree; 120 Node base; 121 Node* saved; 122 Node* scope; 137 EXTERN Node constnode; 138 EXTERN Node fconstnode; 146 EXTERN Node* nodrat; 147 EXTERN Node* nodret; 148 EXTERN Node* nodsafe; [all …]
|
| H A D | div.c | 83 sdivgen(Node *l, Node *r, Node *ax, Node *dx) in sdivgen() 107 udivgen(Node *l, Node *r, Node *ax, Node *dx) in udivgen() 111 Node nod; in udivgen() 143 sext(Node *d, Node *s, Node *l) in sext() 157 sdiv2(long c, int v, Node *l, Node *n) in sdiv2() 159 Node nod; in sdiv2() 179 smod2(long c, int v, Node *l, Node *n) in smod2() 181 Node nod; in smod2()
|
| /plan9/sys/src/cmd/qc/ |
| H A D | gc.h | 139 EXTERN Node constnode; 140 EXTERN Node fconstnode; 150 EXTERN Node* nodrat; 151 EXTERN Node* nodret; 152 EXTERN Node* nodsafe; 153 EXTERN Node* nodretv; 158 EXTERN Node regnode; 161 EXTERN Node znode; 212 void codgen(Node*, Node*); 213 void gen(Node*); [all …]
|
| /plan9/sys/src/cmd/kc/ |
| H A D | gc.h | 134 EXTERN Node constnode; 135 EXTERN Node fconstnode; 145 EXTERN Node* nodrat; 146 EXTERN Node* nodret; 147 EXTERN Node* nodsafe; 152 EXTERN Node regnode; 155 EXTERN Node znode; 204 void codgen(Node*, Node*); 205 void gen(Node*); 206 void usedset(Node*, int); [all …]
|
| /plan9/sys/src/cmd/vc/ |
| H A D | gc.h | 135 EXTERN Node constnode; 136 EXTERN Node fconstnode; 146 EXTERN Node* nodrat; 147 EXTERN Node* nodret; 148 EXTERN Node* nodsafe; 153 EXTERN Node regnode; 156 EXTERN Node znode; 205 void codgen(Node*, Node*); 206 void gen(Node*); 208 void xcom(Node*); [all …]
|
| /plan9/sys/src/cmd/5c/ |
| H A D | gc.h | 141 EXTERN Node constnode; 142 EXTERN Node fconstnode; 152 EXTERN Node* nodrat; 153 EXTERN Node* nodret; 154 EXTERN Node* nodsafe; 159 EXTERN Node regnode; 162 EXTERN Node znode; 211 void codgen(Node*, Node*); 212 void gen(Node*); 214 void usedset(Node*, int); [all …]
|
| /plan9/sys/src/cmd/upas/smtp/ |
| H A D | smtp.h | 6 typedef struct Node Node; typedef 8 typedef Node *Nodeptr; 11 struct Node { struct 12 Node *next; argument 23 Node *node; argument 40 extern Node *usender; 41 extern Node *usys; 42 extern Node *udate; 50 Node* address(Node*); 51 Node* anonymous(Node*); [all …]
|
| H A D | rfc822.y | 12 Node *root; 15 Node *usender; 16 Node *usys; 17 Node *udate; 322 yylval = malloc(sizeof(Node)); in yylex() 497 Node* 498 link2(Node *p1, Node *p2) in link2() 500 Node *p; in link2() 511 Node* 512 link3(Node *p1, Node *p2, Node *p3) in link3() [all …]
|
| /plan9/sys/src/cmd/spin/ |
| H A D | tl.h | 23 typedef struct Node { struct 26 struct Node *lft; /* tree */ argument 27 struct Node *rgt; /* tree */ argument 28 struct Node *nxt; /* if linked list */ argument 29 } Node; typedef 37 Node *New; 38 Node *Old; 39 Node *Other; 40 Node *Next; 71 Node *Canonical(Node *); [all …]
|
| H A D | tl_cache.c | 18 Node *before; 19 Node *after; 27 static int ismatch(Node *, Node *); 29 int sameform(Node *, Node *); 54 Node * 55 in_cache(Node *n) in in_cache() 67 Node * 68 cached(Node *n) in cached() 70 Node *m; in cached() 99 releasenode(int all_levels, Node *n) in releasenode() [all …]
|
| /plan9/sys/src/cmd/ip/ftpfs/ |
| H A D | ftpfs.h | 2 typedef struct Node Node; typedef 13 struct Node struct 17 Node *parent; argument 18 Node *sibs; argument 19 Node *children; argument 50 void filefree(Node*); 51 int fileread(Node*, char*, long, int); 52 int filewrite(Node*, char*, long, int); 53 void filedirty(Node*); 54 void fileclean(Node*); [all …]
|
| /plan9/sys/src/cmd/acid/ |
| H A D | builtin.c | 11 void cvtatof(Node*, Node*); 12 void cvtatoi(Node*, Node*); 13 void cvtitoa(Node*, Node*); 14 void bprint(Node*, Node*); 15 void funcbound(Node*, Node*); 16 void printto(Node*, Node*); 17 void getfile(Node*, Node*); 18 void fmt(Node*, Node*); 19 void pcfile(Node*, Node*); 20 void pcline(Node*, Node*); [all …]
|
| H A D | acid.h | 16 typedef struct Node Node; typedef 52 Extern Node* prnt; 57 extern void (*expop[])(Node*, Node*); 98 Node* stak; 99 Node* val; 119 Node* cc; 148 Node* proc; 150 void (*builtin)(Node*, Node*); 153 struct Node struct 158 Node* left; argument [all …]
|
| H A D | expr.c | 66 chklval(Node *lp) in chklval() 73 olist(Node *n, Node *res) in olist() 80 oeval(Node *n, Node *res) in oeval() 89 ocast(Node *n, Node *res) in ocast() 100 oindm(Node *n, Node *res) in oindm() 103 Node l; in oindm() 118 oindc(Node *n, Node *res) in oindc() 121 Node l; in oindc() 136 oframe(Node *n, Node *res) in oframe() 139 Node *lp; in oframe() [all …]
|
| /plan9/sys/src/cmd/cc/ |
| H A D | cc.h | 12 typedef struct Node Node; typedef 45 struct Node struct 47 Node* left; argument 48 Node* right; argument 71 #define Z ((Node*)0) argument 84 Node* label; 173 Node *node; 459 EXTERN Node* nodproto; 460 EXTERN Node* nodcast; 480 EXTERN Node* initlist; [all …]
|
| H A D | com64.c | 10 Node* nodaddv; 11 Node* nodsubv; 12 Node* nodmulv; 13 Node* noddivv; 14 Node* noddivvu; 15 Node* nodmodv; 16 Node* nodmodvu; 17 Node* nodlshv; 18 Node* nodrshav; 19 Node* nodrshlv; [all …]
|
| /plan9/sys/src/cmd/ratfs/ |
| H A D | ratfs.h | 37 typedef struct Node Node; typedef 47 Node *node; /* current position in path */ 69 struct Node struct 75 Node *parent; /* points to self in root node*/ argument 76 Node *sibs; /* 0 in Ipaddr and Acctaddr dirs */ argument 78 Node *children; /* type == Directory || Addrdir || Trusted */ argument 89 Node *root; /* root of directory tree */ 90 Node dummy; /* dummy node for fid's pointing to an Address */ 103 Node* dirwalk(char*, Node*); 106 Node* finddir(int); [all …]
|
| /plan9/sys/src/cmd/ |
| H A D | sh.C | 13 typedef struct Node Node; typedef 14 struct Node{ /* parse tree node */ struct 15 int (*op)(Node *); /* operator function */ argument 16 Node *args[2]; /* argument nodes */ argument 21 Node nodes[25]; /* node pool */ argument 22 Node *nfree; /* next available node */ 36 Node *alloc(int (*op)(Node *)); 37 int builtin(Node *np); 38 Node *command(void); 41 Node *list(void); [all …]
|
| H A D | units.y | 15 typedef struct Node Node; typedef 18 struct Node struct 26 Node node; argument 44 Node one; 46 Node retnode1; 47 Node retnode2; 48 Node retnode; 53 extern void add(Node*, Node*, Node*); 54 extern void div(Node*, Node*, Node*); 55 extern int specialcase(Node*, Node*, Node*); [all …]
|
| /plan9/sys/src/cmd/mk/ |
| H A D | fns.h | 12 void clrmade(Node*); 16 int dorecipe(Node*); 19 void dumpn(char*, Node*); 31 Node *graph(char*); 44 Arc *newarc(Node*, Rule*, char*, Resub*); 46 Job *newjob(Rule*, Node*, char*, char**, Word*, Word*, Word*, Word*); 52 int outofdate(Node*, Arc*, int); 75 void update(int, Node*); 81 int work(Node*, Node*, Arc*);
|
| H A D | graph.c | 3 static Node *applyrules(char *, char *); 4 static void togo(Node *); 5 static int vacuous(Node *); 6 static Node *newnode(char *); 8 static void cyclechk(Node *); 9 static void ambiguous(Node *); 10 static void attribute(Node *); 12 Node * 15 Node *node; in graph() 29 static Node * [all …]
|