Lines Matching refs:tree
55 union tree *t;
56 union tree *nextt;
73 /* upper levels of tree */
74 for (t = &cm->tree[0], j = NBYTS-1; j > 0; t = nextt, j--) {
80 t = &cm->tree[NBYTS-1];
95 union tree *cb;
99 cmtreefree(cm, cm->tree, 0);
111 - cmtreefree - free a non-terminal part of a colormap tree
112 ^ static VOID cmtreefree(struct colormap *, union tree *, int);
115 cmtreefree(cm, tree, level)
117 union tree *tree;
121 union tree *t;
122 union tree *fillt = &cm->tree[level+1];
123 union tree *cb;
127 t = tree->tptr[i];
157 union tree *t;
158 union tree *newt;
159 union tree *fillt;
160 union tree *lastt;
161 union tree *cb;
168 t = cm->tree;
175 fillt = &cm->tree[level+1];
179 newt = (union tree *)MALLOC((bottom) ?
190 BYTTAB*sizeof(union tree *));
416 /* first, align "from" on a tree-block boundary */
434 - subblock - allocate new subcolors for one tree block of chrs, fill in arcs
450 union tree *t;
451 union tree *cb;
452 union tree *fillt;
453 union tree *lastt = NULL;
462 t = cm->tree;
470 fillt = &cm->tree[level+1];
472 t = (union tree *)MALLOC(sizeof(struct ptrs));
478 BYTTAB*sizeof(union tree *));
491 t = (union tree *)MALLOC(sizeof(struct colors));
708 fillcheck(cm, cm->tree, 0, f);
731 - fillcheck - check proper filling of a tree
732 ^ static VOID fillcheck(struct colormap *, union tree *, int, FILE *);
735 fillcheck(cm, tree, level, f)
737 union tree *tree;
742 union tree *t;
743 union tree *fillt = &cm->tree[level+1];
747 t = tree->tptr[i];
749 fprintf(f, "NULL found in filled tree!\n");