1356 int          trees_count;  variable
1615 	trees_count = count * 2;  in trees_init()
1616 	trees = calloc(trees_count, sizeof(struct tree));  in trees_init()
1619 	count = trees_count;  in trees_init()
1635 	for (i = 0; i != trees_count; i++) {  in trees_init()
1643 	trees[trees_count-2].next = &trees[trees_count-1];  in trees_init()
1644 	trees[trees_count-1].leaf_mark = nfkdi_mark;  in trees_init()
1645 	trees[trees_count-2].leaf_mark = nfkdicf_mark;  in trees_init()
1646 	for (i = 0; i != trees_count-2; i += 2) {  in trees_init()
1647 		trees[i].next = &trees[trees_count-2];  in trees_init()
1649 		trees[i+1].next = &trees[trees_count-1];  in trees_init()
1654 	for (i = 0; i != trees_count; i += 2) {  in trees_init()
1671 	for (i = 0; i != trees_count; i++)  in trees_init()
1683 	for (i = 0; i != trees_count; i++) {  in trees_populate()
1706 	for (i = 0; i != trees_count; i++)  in trees_reduce()
1708 	for (i = 0; i != trees_count; i++)  in trees_reduce()
1712 		for (i = 0; i != trees_count; i++)  in trees_reduce()
1715 		for (i = 0; i != trees_count; i++)  in trees_reduce()
1721 	for (i = 0; i != trees_count; i++)  in trees_reduce()
1725 		for (i = 0; i != trees_count; i++) {  in trees_reduce()
1731 	nfkdi = utf8data + trees[trees_count-1].index;  in trees_reduce()
1732 	nfkdicf = utf8data + trees[trees_count-2].index;  in trees_reduce()
1734 	nfkdi_tree = &trees[trees_count-1];  in trees_reduce()
1735 	nfkdicf_tree = &trees[trees_count-2];  in trees_reduce()
1823 	for (i = 0; i != trees_count; i++)  in trees_verify()
3305 			if (t < trees_count-1)  in write_file()