| /plan9/sys/src/cmd/rc/ |
| H A D | rc.h | 33 typedef struct tree tree; typedef
48 struct tree{ struct
54 tree *child[3]; argument
55 tree *next; argument
57 tree *newtree(void);
58 tree *token(char*, int), *klook(char*), *tree1(int, tree*);
59 tree *tree2(int, tree*, tree*), *tree3(int, tree*, tree*, tree*);
60 tree *mung1(tree*, tree*), *mung2(tree*, tree*, tree*);
61 tree *mung3(tree*, tree*, tree*, tree*), *epimung(tree*, tree*);
62 tree *simplemung(tree*), *heredoc(tree*);
[all …]
|
| H A D | tree.c | 5 tree *treenodes;
11 tree*
14 tree *t = new(tree); in newtree()
26 tree *t, *u; in freenodes()
36 tree*
37 tree1(int type, tree *c0) in tree1()
39 return tree3(type, c0, (tree *)0, (tree *)0); in tree1()
42 tree*
43 tree2(int type, tree *c0, tree *c1) in tree2()
45 return tree3(type, c0, c1, (tree *)0); in tree2()
[all …]
|
| H A D | syn.y | 17 struct tree *tree; member
19 %type<tree> line paren brace body cmdsa cmdsan assign epilog redir
20 %type<tree> cmd simple first word comword keyword words
21 %type<tree> NOT FOR IN WHILE IF TWIDDLE BANG SUBSHELL SWITCH FN
22 %type<tree> WORD REDIR DUP PIPE
57 {$$=mung3($1, $3, (struct tree *)0, $6);}
90 words: {$$=(struct tree*)0;}
|
| H A D | code.c | 14 char *fnstr(tree*);
15 void outcode(tree*, int);
16 void codeswitch(tree*, int);
17 int iscase(tree*);
41 compile(tree *t) in compile()
66 fnstr(tree *t) in fnstr()
83 outcode(tree *t, int eflag) in outcode()
86 tree *tt; in outcode()
403 codeswitch(tree *t, int eflag) in codeswitch()
408 tree *tt; in codeswitch()
[all …]
|
| H A D | lex.c | 196 struct tree *t; in yylex()
197 yylval.tree = 0; in yylex()
336 yylval.tree = t; in yylex()
359 yylval.tree = t; in yylex()
385 yylval.tree = t; in yylex()
|
| H A D | run.unix | 15 cc -DUnix -c -I. tree.c
20 … getflags.o glob.o here.o io.o lex.o pcmd.o pfnc.o simple.o subr.o trap.o tree.o var.o havefork.o …
|
| H A D | var.c | 51 tree*
55 tree *t = token(name, WORD); in klook()
|
| H A D | here.c | 23 tree*
24 heredoc(tree *tag) in heredoc()
|
| /plan9/sys/src/cmd/gs/src/ |
| H A D | scfdgen.c | 71 cfd_count_nodes(cfd_node * tree, cfd_node * ignore_extn, in cfd_count_nodes() argument
77 cfd_node *np = &tree[code << sh]; in cfd_count_nodes()
85 cfd_node *np = &tree[code >> (code_length - initial_bits)]; in cfd_count_nodes()
93 cfd_init2_nodes(cfd_node * tree, cfd_node * extn, in cfd_init2_nodes() argument
103 np1 = &tree[code >> xbits]; in cfd_init2_nodes()
115 cfd_enumerate_codes(cfd_node_proc proc, cfd_node * tree, cfd_node * extn, in cfd_enumerate_codes() argument
122 (*proc) (tree, extn, ep->code, ep->code_length, i, initial_bits); in cfd_enumerate_codes()
124 (*proc) (tree, extn, ep->code, ep->code_length, i << 6, initial_bits); in cfd_enumerate_codes()
125 (*proc) (tree, extn, in cfd_enumerate_codes()
128 (*proc) (tree, extn, in cfd_enumerate_codes()
[all …]
|
| /plan9/sys/src/cmd/gs/zlib/ |
| H A D | trees.c | 144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
148 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
149 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
167 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
171 # define send_code(s, c, tree) \ argument
173 send_bits(s, tree[c].Code, tree[c].Len); }
434 #define pqremove(s, tree, top) \ argument
438 pqdownheap(s, tree, SMALLEST); \
445 #define smaller(tree, n, m, depth) \ argument
[all …]
|
| H A D | algorithm.txt | 13 Literals or match lengths are compressed with one Huffman tree, and
14 match distances are compressed with another tree. The trees are stored
83 For inflate, which has 286 possible codes for the literal/length tree, the size
94 Ok, you want to know what this cleverly obfuscated inflate tree actually
95 looks like. You are correct that it's not a Huffman tree. It is simply a
124 that's essentially a Huffman tree. But then you spend two much time
125 traversing the tree while decoding, even for short symbols.
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
187 Huffman tree.
|
| /plan9/sys/doc/net/ |
| H A D | mkfile | 4 tree.pout
13 tree.pout:D: tree
14 pic tree > tree.pout
20 rm -f net.ps tree.pout net.trout
|
| /plan9/sys/include/ |
| H A D | avl.h | 20 Avlwalk *avlwalk(Avltree *tree);
21 void deleteavl(Avltree *tree, Avl *key, Avl **oldp);
23 void insertavl(Avltree *tree, Avl *new, Avl **oldp);
24 Avl *lookupavl(Avltree *tree, Avl *key);
26 Avl* searchavl(Avltree *tree, Avl *key, int neighbor);
|
| /plan9/sys/src/cmd/replica/ |
| H A D | all.h | 22 void insertavl(Avltree *tree, Avl *new, Avl **oldp);
23 Avl *lookupavl(Avltree *tree, Avl *key);
24 void deleteavl(Avltree *tree, Avl *key, Avl **oldp);
25 Avlwalk *avlwalk(Avltree *tree);
|
| H A D | avl.c | 239 Avltree *tree; member
343 w->tree = t; in avlwalk()
355 for(a=w->tree->root; a && a->n[0]; a=a->n[0]) in avlnext()
374 for(a=w->tree->root; a && a->n[1]; a=a->n[1]) in avlprev()
396 t = w->tree; in endwalk()
|
| /plan9/sys/src/games/ |
| H A D | festoon.c | 1429 X tree; in main() local
1473 tree = np(env); in main()
1475 pr(tree); in main()
1486 tree = turgid(env); in main()
1488 pr(tree); in main()
1499 tree = np(env); in main()
1502 pr(tree); in main()
1548 tree = sent(env); in main()
1549 pr(tree); in main()
1558 tree = turgid(env); in main()
[all …]
|
| /plan9/sys/src/cmd/snap/ |
| H A D | snapfs.c | 130 Tree *tree; in main() local
168 tree = alloctree(nil, nil, DMDIR|0555, nil); in main()
169 fs.tree = tree; in main()
175 fdir = ecreatefile(tree->root, buf, nil, DMDIR|0555, nil); in main()
|
| /plan9/sys/src/cmd/ |
| H A D | import.c | 298 connect(char *system, char *tree, int oldserver) in connect() argument
323 if(tree != nil){ in connect()
324 procsetname("writing tree name %s", tree); in connect()
325 n = write(fd, tree, strlen(tree)); in connect()
331 procsetname("awaiting OK for %s", tree); in connect()
|
| /plan9/sys/src/cmd/aquarela/ |
| H A D | smbcomtreeconnectandx.c | 18 SmbTree *tree; in smbcomtreeconnectandx() local
91 tree = smbtreeconnect(s, serv); in smbcomtreeconnectandx()
92 h->tid = tree->id; in smbcomtreeconnectandx()
|
| /plan9/sys/src/lib9p/ |
| H A D | file.c | 114 f->tree->destroy(f); in closefile()
221 t = fp->tree; in createfile()
237 f->tree = fp->tree; in createfile()
326 f->tree = t; in alloctree()
354 f->tree->destroy(f); in _freefiles()
|
| H A D | ramfs.c | 137 fs.tree = alloctree(nil, nil, DMDIR|0777, fsdestroyfile); in main()
138 q = fs.tree->root->qid; in main()
|
| /plan9/acme/bin/source/win/ |
| H A D | fs.c | 139 fs.tree = alloctree("win", "win", DMDIR|0555, nil); in mountcons()
140 devcons = createfile(fs.tree->root, "cons", "win", 0666, nil); in mountcons()
143 devnew = createfile(fs.tree->root, "wnew", "win", 0666, nil); in mountcons()
|
| /plan9/lib/ |
| H A D | mammals | 87 tree kangaroo
88 dusky tree kangaroo
288 tree bat
365 tree shrew
366 indian tree shrew
367 small smooth-tailed tree shrew
368 philippine tree-shrew
369 pen-tailed tree-shrew, or feather-tailed tree shrew
487 two-toed tree sloth
488 three-toed tree sloth
[all …]
|
| /plan9/sys/src/9/port/ |
| H A D | devfs.c | 83 Tree* tree; /* where the device is kept */ member
152 if(mp->tree != &fstree) in seprintdev()
153 s = seprint(s, e, " %s/%s", mp->tree->name, mp->name); in seprintdev()
174 mkpath(int tree, int devno) in mkpath() argument
176 return (tree&0xFFFF)<<16 | devno&0xFFFF; in mkpath()
290 mp->tree = t; in devalloc()
333 t = mp->tree; in mdeldev()
488 parsename(char *name, char *disk, char **tree, char **dev) in parsename() argument
495 *tree = disk; in parsename()
497 *tree = "fs"; in parsename()
[all …]
|
| /plan9/sys/src/libavl/ |
| H A D | avl.c | 229 Avltree *tree; member
365 w->tree = t; in avlwalk()
377 for(a = w->tree->root; a && a->n[0]; a = a->n[0]) in avlnext()
396 for(a = w->tree->root; a && a->n[1]; a = a->n[1]) in avlprev()
418 t = w->tree; in endwalk()
|