Searched defs:root (Results 1 - 25 of 48) sorted by relevance

12

/ast/src/lib/libast/hash/
H A Dhashdump.c75 if (n = tab->root->namesize)
130 * dump hash table root info
134 dumproot(register Hash_root_t* root, register int flags) argument
138 sfprintf(sfstderr, " root\n");
139 sfprintf(sfstderr, " address: 0x%08lx\n", (unsigned long)root);
141 dumpflags(root->flags);
142 if (root->namesize) sfprintf(sfstderr, "namesize=%d ", root->namesize);
143 if (root->local->alloc) sfprintf(sfstderr, "alloc=0x%08lx ", (unsigned long)root
166 register Hash_root_t* root; local
[all...]
/ast/src/cmd/mailx/port/
H A Ddtdisc.c106 reg Dtlink_t *root, *t, *next, **slot, **eslot; local
139 root = next = NIL(Dtlink_t*);
145 else root = next = t;
154 while(root)
155 { next = root->right;
157 { k = (char*)OBJ(root,disc); k = KEY((Void_t*)k,disc);
158 root->hash = HASH(dt,k,disc);
160 (void)(*searchf)(dt,(Void_t*)root,DT_RENEW);
161 root = next;
167 { root
[all...]
H A Ddttree.c91 reg Dtlink_t *root, *l, *r, *t, *me = NIL(Dtlink_t*); local
96 root = dt->data->here;
98 { if(!root || !(type&(DT_CLEAR|DT_FIRST|DT_LAST)) )
104 { while((t = root->left) )
105 RROTATE(root,t);
106 t = root->right;
108 (*disc->freef)(dt,OBJ(root,disc),disc);
110 (*dt->memoryf)(dt,(Void_t*)root,0,disc);
111 } while((root = t) );
120 { while((t = root
[all...]
H A Ddtstat.c77 static void dttstat(Dtstat_t* ds, Dtlink_t* root, int depth, int* level) argument
79 static void dttstat(ds,root,depth,level)
81 Dtlink_t* root;
86 if(root->left)
87 dttstat(ds,root->left,depth+1,level);
88 if(root->right)
89 dttstat(ds,root->right,depth+1,level);
/ast/src/lib/libtksh/src/
H A Dshcompat.c15 int _nv_scan(Hashtab_t *root, void (*fn)(Namval_t *,void*), void *data, int mask, int flags) argument
17 return nv_scan(root, (void (*)(Namval_t *)) fn, mask, flags);
/ast/src/lib/librecsort/
H A Drs-splay.c29 { Rsobj_t* root; member in struct:rssplay_s
41 reg Rsobj_t *r, *root, *t, *l; local
48 if(!(root = splay->root))
50 splay->root = obj;
54 OBJCMP(obj,root,cmp);
56 { EQUAL(root,obj,t);
60 { if(!root->right)
61 { obj->left = root;
63 splay->root
[all...]
H A Drs-rasp.c65 reg Rsobj_t *r, *root, *t, *l; local
110 if(!(root = rasp->tree[index]))
116 SPLAYCMP(obj,root,o,k,endo,mp,cr);
118 { EQUAL(root,obj,t);
124 { if((t = root->left))
127 { RROTATE(root,t);
128 RLINK(r,root);
129 if(!(root = root->left))
133 { RROTATE(root,
[all...]
/ast/src/lib/libast/comp/
H A Dtsearch.c160 ** node is always rotated to the root first. So this implementation always
161 ** returns the key of the new root.
222 ** Since our root is a dictionary structure, the search here will start
223 ** at whichever node happens to be current root.
227 void twalk(const Void_t* root, void(*action)(const Void_t*,VISIT,int) ) argument
229 void twalk(root, action)
230 Void_t* root;
236 if(root && (o = (Tree_t*)dtfinger((Dt_t*)root)) )
/ast/src/cmd/ksh93/bltins/
H A Dwhence.c141 Dt_t *root; local
187 root = (flags&F_FLAG)?shp->bltin_tree:shp->fun_tree;
188 if(np= nv_bfsearch(name, root, &nq, &notused))
H A Dtypeset.c472 Dt_t *root = tp->sh->last_root; local
493 tp->sh->last_root = root;
1402 static void print_all(Sfio_t *file,Dt_t *root, struct tdata *tp) argument
1405 nv_scan(root, print_attribute, (void*)tp, 0, 0);
1418 * print the nodes in tree <root> which have attributes <flag> set
1422 static void print_scan(Sfio_t *file, int flag, Dt_t *root, int option,struct tdata *tp) argument
1433 tp->scanroot = root;
1443 namec = nv_scan(root,nullscan,(void*)tp,tp->scanmask,flag);
1445 namec = nv_scan(root, pushname, (void*)tp, tp->scanmask, flag&~NV_IARRAY);
1448 if(namec==0 && tp->sh->namespace && nv_dict(tp->sh->namespace)==root)
[all...]
/ast/src/lib/libodelta/
H A Dsuftree.c39 ** BldSuftree returns either NULL or the pointer to the root of the
41 ** the root.
47 void delsuftree(Suftree* root) argument
49 if(!root)
51 root -= 1;
52 while(root)
55 next = NEXT(root);
56 free(root);
57 root = next;
83 static Suftree *getmem(Suftree* root, in argument
125 Suftree *root, *list, *endlist; local
[all...]
/ast/src/lib/libvcodex/Vchuff/
H A Dvchtrie.c43 Node_t* root, ssize_t len, Vcbit_t** sort, ssize_t ns, ssize_t lev)
45 static int bldtrie(trie, clen, bits, root, len, sort, ns, lev)
49 Node_t* root; /* parent node of the new table */
84 root->node = trie->next;
85 root->size = -p;
89 node = trie->node + root->node;
90 size = trie->size + root->node;
121 node = trie->node + root->node;
122 size = trie->size + root->node;
161 Node_t root; local
42 bldtrie(Vchtrie_t* trie, ssize_t* clen, Vcbit_t* bits, Node_t* root, ssize_t len, Vcbit_t** sort, ssize_t ns, ssize_t lev) argument
[all...]
/ast/src/lib/libz/
H A Dinftrees.c28 requested root table index bits, and on return it is the actual root
49 unsigned root; /* number of index bits for root table */ local
57 unsigned low; /* low bits for current root entry */
58 unsigned mask; /* mask for low root bits */
118 /* bound code lengths, force root to be within code lengths */
119 root = *bits;
122 if (root > max) root
[all...]
/ast/src/lib/libast/cdt/
H A Ddttree.c34 Dtlink_t* root; /* tree root */ member in struct:_dttree_s
45 if(!here && !(here = tree->root) )
94 Dtlink_t *t, *root; local
98 if(!(root = tree->root) )
102 { while((t = root->_rght) )
103 LROTATE(root,t);
106 { while((t = root->_left) )
107 RROTATE(root,
122 Dtlink_t *root, *t; local
188 tsize(Dtlink_t* root, ssize_t lev, Dtstat_t* st) argument
287 Dtlink_t *root, *last, *t, *r, *l; local
404 Dtlink_t *root, *t, *l, *r, *me, link; local
[all...]
/ast/src/lib/libmam/
H A Dmam.h103 struct rule* root; /* root target */ member in struct:proc
/ast/src/cmd/ksh93/sh/
H A Darith.c70 Dt_t *root = shp->var_tree; local
95 root = shp->last_root;
104 if((lvalue->emode&ARITH_COMP) && dtvnext(root) && ((sdict && (mp=nv_search(cp,sdict,flags&~NV_ADD))) || (mp=nv_search(cp,root,flags&~(NV_ADD))) || (nsdict && (mp=nv_search(cp,nsdict,flags&~(NV_ADD|HASH_NOSCOPE)))) ))
309 Dt_t *root = (lvalue->emode&ARITH_COMP)?shp->var_base:shp->var_tree; local
348 else if(!(np = nv_open(*ptr,root,NV_NOREF|NV_NOASSIGN|NV_VARNAME|dot)))
H A Dnvtree.c37 Dt_t *root; member in struct:nvdir
161 dp->root = sh.last_root?sh.last_root:sh.var_tree;
172 np = nv_open(name, dp->root, NV_NOFAIL);
176 dp->root = nv_dict(np);
187 if(dp->hp = (Namval_t*)dtprev(dp->root,&fake))
192 dp->hp = (Namval_t*)dtnext(dp->root,dp->hp);
200 dp->hp = (Namval_t*)dtfirst(dp->root);
203 dp->hp = (Namval_t*)dtfirst(dp->root);
226 np = nv_search(last,dp->root,0);
231 dp->hp = (Namval_t*)dtnext(dp->root,d
320 Dt_t *root; local
572 Dt_t *root; member in struct:Walk
[all...]
/ast/src/lib/libvgraph/
H A Dgrbranching.c26 Grnode_t* root; /* strong component before collapsing */ member in struct:_bredge_s
51 PRINT(Fd,"root=%d, ", BREDGE(ed)->root ? (int)BREDGE(ed)->root->label : -1 );
178 { BREDGE(ec)->root = grfind(ec->head); /* save node union structure */
230 BREDGE(ec)->root->link = BREDGE(ec)->root;
/ast/src/cmd/pax/
H A Dfile.c299 char* root; member in struct:View
324 vp->root = s;
381 sfsprintf(state.tmp.buffer, state.tmp.buffersize - 1, "%s/%s/%s", vp->root, offset, f->name);
/ast/src/lib/libast/include/
H A Dhash.h159 struct Hash_root /* root hash table information */
173 Hash_root_t* root; /* root hash table information */ member in struct:Hash_table
/ast/src/lib/libast/misc/
H A Dfts.c49 FTSENT* root; \
258 search(FTSENT* e, FTSENT* root, int(*comparf)(FTSENT* const*, FTSENT* const*), int insert) argument
268 while (root)
270 if (!(cmp = (*comparf)(&e, &root)) && !insert)
278 if (root->left && (cmp = (*comparf)(&e, &root->left)) <= 0)
280 RROTATE(root);
290 right->left = root;
292 rroot = root;
293 right = root;
346 deleteroot(register FTSENT* root) argument
372 getlist(register FTSENT** top, register FTSENT** bot, register FTSENT* root) argument
692 register FTSENT* root; local
[all...]
/ast/src/lib/libast/port/
H A Dlcgen.c53 Link_t* root; member in struct:Table_s
144 for (p = 0, x = tab->root; x; p = x, x = x->next)
150 tab->root = v;
167 for (x = tab->root; x; x = x->next)
702 for (cp = (Charset_t*)state.charset.root; cp; cp = (Charset_t*)cp->link.next)
725 for (lp = (Language_t*)state.language.root; lp; lp = (Language_t*)lp->link.next)
754 for (tp = (Territory_t*)state.territory.root; tp; tp = (Territory_t*)tp->link.next)
774 for (mp = (Map_t*)state.map.root; mp; mp = (Map_t*)mp->link.next)
/ast/src/lib/libast/vmalloc/
H A Dvmbest.c100 if(vd->root)
101 return vmintree(vd->root, b);
183 if(vd->root && vmchktree(vd->root) < 0 )
254 reg Block_t *t, *root, *l, *r; local
258 if((root = wanted) && size == TINYSIZE)
261 l = TLEFT(root);
262 if((r = LINK(root)) )
270 SEG(root) = seg;
272 { if((Vmuchar_t*)root > (Vmuchar_
[all...]
/ast/src/cmd/html/
H A Dhtmlrefs.c36 " \b--root\b and \b--user\b options influence the order):]{"
40 " [+document-root?The document root directory containing URL"
41 " target documents. Exactly one \bdocument-root\b must"
43 " [+program-root?The program root directory containing CGI"
45 " If specified then the program root directory should"
47 " [+data-root?The data root directory containing CGI"
49 " the data root director
212 String_t root; member in struct:State_s
[all...]
/ast/src/cmd/ksh93/include/
H A Dname.h90 Dt_t *root; member in struct:Namref
162 #define nv_reftree(n) ((n)->nvalue.nrp->root)

Completed in 66 milliseconds

12