1358 int          trees_count;  variable
1622 	trees_count = count * 2;  in trees_init()
1623 	trees = calloc(trees_count, sizeof(struct tree));  in trees_init()
1626 	count = trees_count;  in trees_init()
1642 	for (i = 0; i != trees_count; i++) {  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()
1653 	for (i = 0; i != trees_count-2; i += 2) {  in trees_init()
1654 		trees[i].next = &trees[trees_count-2];  in trees_init()
1656 		trees[i+1].next = &trees[trees_count-1];  in trees_init()
1661 	for (i = 0; i != trees_count; i += 2) {  in trees_init()
1678 	for (i = 0; i != trees_count; i++)  in trees_init()
1690 	for (i = 0; i != trees_count; i++) {  in trees_populate()
1713 	for (i = 0; i != trees_count; i++)  in trees_reduce()
1715 	for (i = 0; i != trees_count; i++)  in trees_reduce()
1719 		for (i = 0; i != trees_count; i++)  in trees_reduce()
1722 		for (i = 0; i != trees_count; i++)  in trees_reduce()
1728 	for (i = 0; i != trees_count; i++)  in trees_reduce()
1732 		for (i = 0; i != trees_count; i++) {  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()
1830 	for (i = 0; i != trees_count; i++)  in trees_verify()
3330 			if (t < trees_count-1)  in write_file()