209 					triedrop(disc, e->re.trie.root[i]);  in drop()
613 			if ((env->stats.m += e->re.trie.min) < cm)  in stats()
616 			if ((env->stats.n += e->re.trie.max) < cn)  in stats()
619 			if (!env->stats.y || env->stats.y->re.trie.min < e->re.trie.min)  in stats()
1919 	if (!(t = g->re.trie.root[*s]) && !(t = g->re.trie.root[*s] = trienode(env, *s)))  in insert()
1939 	if (g->re.trie.min > len)  in insert()
1940 		g->re.trie.min = len;  in insert()
1941 	if (g->re.trie.max < len)  in insert()
1942 		g->re.trie.max = len;  in insert()
1954 trie(Cenv_t* env, Rex_t* e, Rex_t* f)  in trie()  function
1964 		g->re.trie.min = INT_MAX;  in trie()
2869 		if (!cond && (g = trie(env, e, f)))  in alt()
2978 		if ((t = env->stats.y) && t->re.trie.min < 3)  in special()
2982 			if (x->re.string.size >= t->re.trie.min)  in special()
3006 				n = t->re.trie.min;  in special()
3007 				m = t->re.trie.max;  in special()
3046 					if (t->re.trie.root[i])  in special()
3047 						m = bmtrie(env, a, v, t->re.trie.root[i], n, 0, m);  in special()
3458 	if (!(g = trie(&env, f, e)))  in regcomb()
3501 	p->env->min = g->re.trie.min;  in regcomb()