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