Searched refs:tree (Results 1 - 23 of 23) sorted by relevance

/ast/src/lib/libast/path/
H A Dpathexists.c43 struct Tree_s* tree; member in struct:Tree_s
62 static Tree_t tree; local
64 t = &tree;
75 for (t = p->tree; t && (*cmp)(s, t->name); t = t->next);
84 t->next = p->tree;
85 p->tree = t;
110 p->next = t->tree;
111 t->tree = p;
/ast/src/lib/libz/
H A Dtrees.c12 * Each code tree is stored in a compressed form which is itself
91 /* The static literal tree. Since the bit lengths are imposed, there is no
93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
98 /* The static distance tree. (Actually a trivial tree since all codes use
122 const ct_data *static_tree; /* static tree or NULL */
125 int elems; /* max number of elements in the tree */
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, in
494 ct_data *tree = desc->dyn_tree; local
623 ct_data *tree = desc->dyn_tree; local
[all...]
/ast/src/lib/libvcodex/Vchuff/
H A Dvchsize.c33 /* node in a kind-of-flattened Huffman tree */
70 Vchtree_t *tree, **sort; local
73 if(!(tree = (Vchtree_t*)malloc(nsym*sizeof(Vchtree_t))) ||
80 for(k = 0, f = tree; k < nsym; ++k, ++f, ++c)
99 *runb = (int)(sort[0]-tree);
100 free(tree);
117 /* linear-time construction of a Huffman tree */
129 size[s-tree] -= size[f-tree];
132 /* tree dept
[all...]
/ast/src/lib/libtk/generic/
H A DtkTextIndex.c42 * in the B-tree and fill in a TkTextIndex structure.
57 TkTextMakeIndex(tree, lineIndex, charIndex, indexPtr)
58 TkTextBTree tree; /* Tree that lineIndex and charIndex refer
68 indexPtr->tree = tree;
76 indexPtr->linePtr = TkBTreeFindLine(tree, lineIndex);
78 indexPtr->linePtr = TkBTreeFindLine(tree, TkBTreeNumLines(tree));
237 indexPtr->tree = textPtr->tree;
[all...]
H A DtkText.h39 * same parent node in B-tree. NULL
139 * modification to the character structure of the b-tree so they
145 TkTextBTree tree; /* Tree containing desired position. */ member in struct:TkTextIndex
353 * The data structure below is used for searching a B-tree for transitions
423 TkTextBTree tree; /* B-tree representation of text and tags for member in struct:TkText
695 extern void TkBTreeCheck _ANSI_ARGS_((TkTextBTree tree));
698 extern void TkBTreeDestroy _ANSI_ARGS_((TkTextBTree tree));
701 extern TkTextLine * TkBTreeFindLine _ANSI_ARGS_((TkTextBTree tree,
712 extern int TkBTreeNumLines _ANSI_ARGS_((TkTextBTree tree));
[all...]
H A DtkTextMark.c155 TkBTreeUnlinkSegment(textPtr->tree, markPtr,
203 TkBTreeUnlinkSegment(textPtr->tree, markPtr,
263 == TkBTreeNumLines(textPtr->tree)) {
268 TkBTreeUnlinkSegment(textPtr->tree, markPtr,
322 indexPtr->tree = textPtr->tree;
376 * This procedure is invoked by the text B-tree code whenever
383 * None (even if the whole tree is being deleted we don't
394 int treeGone; /* Non-zero means the entire tree is
407 * This procedure is invoked by the B-tree cod
[all...]
H A DtkTextBTree.c4 * This file contains code that manages the B-tree representation
35 * The data structure below defines a node in the B-tree.
47 int level; /* Level of this node in the B-tree.
48 * 0 refers to the bottom of the tree
69 * The data structure below defines an entire B-tree.
73 Node *rootPtr; /* Pointer to root of B-tree. */
142 static TkTextSegment * FindTagStart _ANSI_ARGS_((TkTextBTree tree,
198 * This procedure is called to create a new text B-tree.
201 * The return value is a pointer to a new B-tree containing
220 * The tree wil
[all...]
H A DtkText.c7 * the display code. The B-tree representation of text is
249 textPtr->tree = TkBTreeCreate(textPtr);
279 TkTextMakeIndex(textPtr->tree, 0, 0, &startIndex);
682 * before deleting the B-tree, since display-related stuff
683 * may refer to stuff in the B-tree.
687 TkBTreeDestroy(textPtr->tree);
872 TkTextMakeIndex(textPtr->tree, 0, 0, &first);
873 TkTextMakeIndex(textPtr->tree,
874 TkBTreeNumLines(textPtr->tree), 0, &last);
1070 if (lineIndex == TkBTreeNumLines(textPtr->tree)) {
[all...]
H A DtkTextWind.c245 if (lineIndex == TkBTreeNumLines(textPtr->tree)) {
247 TkTextMakeIndex(textPtr->tree, lineIndex, 1000000, &index);
546 index.tree = ewPtr->body.ew.textPtr->tree;
581 index.tree = ewPtr->body.ew.textPtr->tree;
627 index.tree = ewPtr->body.ew.textPtr->tree;
639 * This procedure is invoked by the text B-tree code whenever
657 int treeGone; /* Non-zero means the entire tree i
[all...]
H A DtkTextTag.c451 TkBTreeTag(TkTextMakeIndex(textPtr->tree, 0, 0, &first),
452 TkTextMakeIndex(textPtr->tree,
453 TkBTreeNumLines(textPtr->tree), 0, &last),
555 TkTextMakeIndex(textPtr->tree, TkBTreeNumLines(textPtr->tree),
565 * The search below is a bit tricky. Rather than use the B-tree
634 TkTextMakeIndex(textPtr->tree, 0, 0, &index2);
654 TkTextMakeIndex(textPtr->tree, TkBTreeNumLines(textPtr->tree),
714 TkTextMakeIndex(textPtr->tree,
[all...]
H A DtkTextDisp.c1129 lastLinePtr = TkBTreeFindLine(textPtr->tree,
1130 TkBTreeNumLines(textPtr->tree));
1309 index.linePtr = TkBTreeFindLine(textPtr->tree, lineNum);
2648 index2Ptr = TkTextMakeIndex(textPtr->tree,
2649 TkBTreeNumLines(textPtr->tree), 0, &endOfText);
2894 if (lineIndex == TkBTreeNumLines(indexPtr->tree)) {
3043 index.tree = srcPtr->tree;
3055 index.linePtr = TkBTreeFindLine(srcPtr->tree, lineNum);
3099 TkTextMakeIndex(textPtr->tree,
[all...]
/ast/src/cmd/mam/
H A Dmamdot.sh54 typeset ignore= tree="@(make|done|prev)"
81 [[ ${top[$label]} || $arg == */* || $op != $tree ]] || {
/ast/src/lib/libast/cdt/
H A Ddttree.c34 Dtlink_t* root; /* tree root */
43 Dttree_t *tree = (Dttree_t*)dt->data; local
45 if(!here && !(here = tree->root) )
96 Dttree_t *tree = (Dttree_t*)dt->data; local
98 if(!(root = tree->root) )
109 tree->root = root;
124 Dttree_t *tree = (Dttree_t*)dt->data; local
126 root = tree->root;
127 tree->root = NIL(Dtlink_t*);
128 tree
153 Dttree_t *tree = (Dttree_t*)dt->data; local
234 Dttree_t *tree = (Dttree_t*)dt->data; local
276 Dttree_t *tree = (Dttree_t*)dt->data; local
406 Dttree_t *tree = (Dttree_t*)dt->data; local
641 Dttree_t *tree = (Dttree_t*)dt->data; local
[all...]
/ast/src/lib/libodelta/
H A Dsuftree.c25 ** Construct a suffix tree for a source string
27 ** This is based on the suffix tree algorithm of E. McCreight.
40 ** tree. In the latter case, the tree can be destroyed by free()-ing
46 /* Delete a suffix tree */
82 /* Get space for tree nodes. */
106 /* Build the tree.
109 ** tree node that points to the longest prefix
110 ** that terminates at a node in the current tree.
111 ** locus: defines a tree nod
317 mtchsuftree(Suftree* tree, Element* str, long len, Element** mtchp) argument
[all...]
H A Ddelta.c303 Suftree *tree; local
327 /* try making suffix tree */
328 if(!(tree = n_tar > 0 ? bldsuftree(src,n_src) : (Suftree*)0))
330 /* not enough space for tree, remove matching prefix and suffix */
373 /* try making the tree again */
374 tree = n_tar > 0 ? bldsuftree(src,n_src) : (Suftree*)0;
383 if(tree)
384 size = mtchsuftree(tree,tar,n_tar,&match);
435 if(tree)
436 delsuftree(tree);
[all...]
/ast/src/cmd/pack/
H A Dhuffdecode.c49 static char *tree[HUFFLEV+1]; variable
58 * decode <input> using huffman tree defined in <hp> onto <output>
125 register char *p = &tree[lev+1][n];
174 tree[i] = eof;
196 for(k = tree[i+1] - tree[i];--k>=0;)
201 outchar[c--] = tree[i][k];
/ast/src/lib/librecsort/
H A Drs-rasp.c21 /* Radix + splay tree
39 Rsobj_t* tree[UCHAR_MAX+1]; member in struct:rsrasp_s
110 if(!(root = rasp->tree[index]))
111 { rasp->tree[index] = obj;
186 rasp->tree[index] = root;
195 rasp->tree[index] = obj;
380 /* flatten tree */
410 if((r = rasp->tree[n]) )
412 rasp->tree[n] = NIL(Rsobj_t*);
/ast/src/cmd/ksh93/sh/
H A Dexpand.c217 * scan tree and add each name that matches the given pattern
219 static int scantree(Dt_t *tree, const char *pattern, struct argnod **arghead) argument
225 np = (Namval_t*)dtfirst(tree);
226 for(;np && !nv_isnull(np);(np = (Namval_t*)dtnext(tree,np)))
/ast/src/cmd/ksh93/tests/
H A Dcomvar.sh498 typeset -C tree
510 f1 tree
512 [[ $tree == "$expected" ]] || err_exit 'move of compound local variable to global variable not working'
/ast/src/cmd/std/
H A Dps.c49 "[B!:branch?Print tree branch prefixes for \bcommand\b and \bargs\b."
50 " Implied by \b--children\b, \b--parents\b, and \b--tree\b.]"
52 "[C:children?Display the process tree hierarchy, including the children"
96 "[P:parents?Display the process tree hierarchy, including the parents"
102 "[T:tree|forest?Display the process tree hierarchy, including the parents and"
206 int level; /* process tree level */
217 int tree; /* list proc tree */ member in struct:State_s
234 char branch[1024]; /* process tree branc
[all...]
/ast/src/lib/libtksh/src/
H A Dvar.c101 Hashtab_t *tree = NULL; local
106 tree = hashscope(sh.var_tree); /* Use parent var tree */
108 nvflags |= NV_NOSCOPE; /* Do not search parent tree */
137 if (! (namval = nv_open(part1, tree, nvflags | NV_NOASSIGN )) )
144 part1=nv_name(nv_open(part1,tree,nvflags|NV_NOASSIGN|NV_NOREF));
/ast/lib/package/
H A Dpackage.mk118 packages in this directory tree are controlled by the command
619 $(readme.$(style):@?$$(readme.$$(style))$$("\n\n")??)To build binaries from source into the ./arch/`bin/package` tree run:
/ast/src/cmd/INIT/
H A Dpackage.mk118 packages in this directory tree are controlled by the command
619 $(readme.$(style):@?$$(readme.$$(style))$$("\n\n")??)To build binaries from source into the ./arch/`bin/package` tree run:

Completed in 64 milliseconds