Searched refs:trie (Results 1 - 8 of 8) sorted by relevance

/ast/src/lib/libvcodex/Vchuff/
H A Dvchtrie.c26 ** For fast prefix matching, we use a recursive trie similar to
42 static int bldtrie(Vchtrie_t* trie, ssize_t* clen, Vcbit_t* bits, argument
45 static int bldtrie(trie, clen, bits, root, len, sort, ns, lev)
46 Vchtrie_t* trie; /* handle holding entire trie */
53 ssize_t lev; /* level in the trie */
69 if((trie->next + (1<<p)) > trie->trsz)
70 { s = trie->next + ((1<<p) < (1<<8) ? (1<<8) : (1<<p));
74 memcpy(node, trie
160 Vchtrie_t *trie; local
191 vchdeltrie(Vchtrie_t* trie) argument
[all...]
H A Dvchuffman.c33 Vchtrie_t* trie; /* re-trie for decoding */ member in struct:_vchuff_s
194 if(huff->trie)
195 vchdeltrie(huff->trie);
196 if(!(huff->trie = vchbldtrie(VCH_SIZE, huff->size, huff->bits)) )
198 node = huff->trie->node;
199 size = huff->trie->size;
200 ntop = huff->trie->ntop;
212 sz = ntop; p = 0; /* restart at trie top */
218 sz = -size[p]; p = node[p]; /* trie recursio
[all...]
H A Dvchuffgroup.c563 Vchtrie_t *trie[GRP_NTBL]; local
577 trie[k] = NIL(Vchtrie_t*);
593 else /* construct code table and trie for fast matching */
600 if(!(trie[k] = vchbldtrie(VCH_SIZE, tbl[k].size, bits[k])) )
628 { node = trie[part[k]]->node;
629 size = trie[part[k]]->size;
630 ntop = trie[part[k]]->ntop;
658 if(trie[k])
659 vchdeltrie(trie[k]);
/ast/src/lib/libast/regex/
H A Dregcomp.c218 triedrop(disc, e->re.trie.root[i]);
622 if ((env->stats.m += e->re.trie.min) < cm)
625 if ((env->stats.n += e->re.trie.max) < cn)
628 if (!env->stats.y || env->stats.y->re.trie.min < e->re.trie.min)
1942 if (!(t = g->re.trie.root[*s]) && !(t = g->re.trie.root[*s] = trienode(env, *s)))
1962 if (g->re.trie.min > len)
1963 g->re.trie.min = len;
1964 if (g->re.trie
1977 trie(Cenv_t* env, Rex_t* e, Rex_t* f) function
[all...]
H A Dregdecomp.c310 if (e->re.trie.root[c])
318 detrie(e->re.trie.root[c], sp, pfx, pfx, &pfx[sizeof(pfx)], delimiter);
H A Dreglib.h524 Trie_t trie; /* trie */ member in union:Rex_s::__anon302
H A Dregnexec.c1733 if (((s + rex->re.trie.min) > env->end) || !(x = rex->re.trie.root[rex->map ? rex->map[*s] : *s]))
/ast/src/lib/libvcodex/
H A Dvcio.c480 Vchtrie_t *trie; local
502 if(!(trie = vchbldtrie(VC_INTSIZE, cdsz, bits)) )
504 node = trie->node;
505 size = trie->size;
506 ntop = trie->ntop;
535 s = ntop; p = 0; /* restart at trie top for next integer */
541 s = -size[p]; p = node[p]; /* trie recursion */

Completed in 301 milliseconds