Lines Matching refs:tree
179 * A colormap is a tree -- more precisely, a DAG -- indexed at each level
181 * lower sections of the tree can be shared, it can exploit the usual
182 * sparseness of such a mapping table. The tree is always NBYTS levels
188 /* the tree itself */
193 union tree *pptr[BYTTAB];
195 union tree {
212 union tree *block; /* block of solid color, if any */
227 union tree tree[NBYTS]; /* tree top, plus fill blocks */
236 #define GETCOLOR(cm, c) ((cm)->tree->tcolor[B0(c)])
240 #define GETCOLOR(cm, c) ((cm)->tree->tptr[B1(c)]->tcolor[B0(c)])
243 #define GETCOLOR(cm, c) ((cm)->tree->tptr[B3(c)]->tptr[B2(c)]->tptr[B1(c)]->tcolor[B0(c)])
357 * subexpression tree
367 # define INUSE 0100 /* in use in final tree */
409 struct subre *tree;