1357 struct tree *trees;  variable
1621 	/* Two trees per age: nfdi and nfdicf */  in trees_init()
1623 	trees = calloc(trees_count, sizeof(struct tree));  in trees_init()
1625 	/* Assign ages to the trees. */  in trees_init()
1630 		trees[--count].maxage = maxage;  in trees_init()
1631 		trees[--count].maxage = maxage;  in trees_init()
1644 		while (ages[j] < trees[i].maxage)  in trees_init()
1646 		trees[i].maxage = ages[j-1];  in trees_init()
1649 	/* Set up the forwarding between trees. */  in trees_init()
1650 	trees[trees_count-2].next = &trees[trees_count-1];  in trees_init()
1651 	trees[trees_count-1].leaf_mark = nfdi_mark;  in trees_init()
1652 	trees[trees_count-2].leaf_mark = nfdicf_mark;  in trees_init()
1654 		trees[i].next = &trees[trees_count-2];  in trees_init()
1655 		trees[i].leaf_mark = correction_mark;  in trees_init()
1656 		trees[i+1].next = &trees[trees_count-1];  in trees_init()
1657 		trees[i+1].leaf_mark = correction_mark;  in trees_init()
1662 		trees[i].type = "nfdicf";  in trees_init()
1663 		trees[i].leaf_equal = nfdicf_equal;  in trees_init()
1664 		trees[i].leaf_print = nfdicf_print;  in trees_init()
1665 		trees[i].leaf_size = nfdicf_size;  in trees_init()
1666 		trees[i].leaf_index = nfdicf_index;  in trees_init()
1667 		trees[i].leaf_emit = nfdicf_emit;  in trees_init()
1669 		trees[i+1].type = "nfdi";  in trees_init()
1670 		trees[i+1].leaf_equal = nfdi_equal;  in trees_init()
1671 		trees[i+1].leaf_print = nfdi_print;  in trees_init()
1672 		trees[i+1].leaf_size = nfdi_size;  in trees_init()
1673 		trees[i+1].leaf_index = nfdi_index;  in trees_init()
1674 		trees[i+1].leaf_emit = nfdi_emit;  in trees_init()
1679 		trees[i].childnode = NODE;  in trees_init()
1693 				trees[i].type, trees[i].maxage);  in trees_populate()
1700 			if (data->correction <= trees[i].maxage)  in trees_populate()
1702 			insert(&trees[i], keyval, keylen, data);  in trees_populate()
1714 		prune(&trees[i]);  in trees_reduce()
1716 		mark_nodes(&trees[i]);  in trees_reduce()
1720 			size = index_nodes(&trees[i], size);  in trees_reduce()
1723 			changed += size_nodes(&trees[i]);  in trees_reduce()
1729 		emit(&trees[i], utf8data);  in trees_reduce()
1734 				trees[i].type, trees[i].maxage, trees[i].index);  in trees_reduce()
1738 	nfdi = utf8data + trees[trees_count-1].index;  in trees_reduce()
1739 	nfdicf = utf8data + trees[trees_count-2].index;  in trees_reduce()
1741 	nfdi_tree = &trees[trees_count-1];  in trees_reduce()
1742 	nfdicf_tree = &trees[trees_count-2];  in trees_reduce()
1831 		verify(&trees[i]);  in trees_verify()
3305 			ages[gen], trees[t].index,  in write_file()
3307 		if (trees[t].maxage == ages[gen])  in write_file()
3316 			ages[gen], trees[t].index,  in write_file()
3318 		if (trees[t].maxage == ages[gen])  in write_file()
3327 		if (i == trees[t].index) {  in write_file()
3329 				trees[t].type, trees[t].maxage);  in write_file()