Lines Matching defs:trees_count
1358 int trees_count;
1622 trees_count = count * 2;
1623 trees = calloc(trees_count, sizeof(struct tree));
1626 count = trees_count;
1642 for (i = 0; i != trees_count; i++) {
1650 trees[trees_count-2].next = &trees[trees_count-1];
1651 trees[trees_count-1].leaf_mark = nfdi_mark;
1652 trees[trees_count-2].leaf_mark = nfdicf_mark;
1653 for (i = 0; i != trees_count-2; i += 2) {
1654 trees[i].next = &trees[trees_count-2];
1656 trees[i+1].next = &trees[trees_count-1];
1661 for (i = 0; i != trees_count; i += 2) {
1678 for (i = 0; i != trees_count; i++)
1690 for (i = 0; i != trees_count; i++) {
1713 for (i = 0; i != trees_count; i++)
1715 for (i = 0; i != trees_count; i++)
1719 for (i = 0; i != trees_count; i++)
1722 for (i = 0; i != trees_count; i++)
1728 for (i = 0; i != trees_count; i++)
1732 for (i = 0; i != trees_count; i++) {
1738 nfdi = utf8data + trees[trees_count-1].index;
1739 nfdicf = utf8data + trees[trees_count-2].index;
1741 nfdi_tree = &trees[trees_count-1];
1742 nfdicf_tree = &trees[trees_count-2];
1830 for (i = 0; i != trees_count; i++)
3332 if (t < trees_count-1)