Lines Matching defs:trees
1357 struct tree *trees;
1621 /* Two trees per age: nfdi and nfdicf */
1623 trees = calloc(trees_count, sizeof(struct tree));
1625 /* Assign ages to the trees. */
1630 trees[--count].maxage = maxage;
1631 trees[--count].maxage = maxage;
1644 while (ages[j] < trees[i].maxage)
1646 trees[i].maxage = ages[j-1];
1649 /* Set up the forwarding between trees. */
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;
1654 trees[i].next = &trees[trees_count-2];
1655 trees[i].leaf_mark = correction_mark;
1656 trees[i+1].next = &trees[trees_count-1];
1657 trees[i+1].leaf_mark = correction_mark;
1662 trees[i].type = "nfdicf";
1663 trees[i].leaf_equal = nfdicf_equal;
1664 trees[i].leaf_print = nfdicf_print;
1665 trees[i].leaf_size = nfdicf_size;
1666 trees[i].leaf_index = nfdicf_index;
1667 trees[i].leaf_emit = nfdicf_emit;
1669 trees[i+1].type = "nfdi";
1670 trees[i+1].leaf_equal = nfdi_equal;
1671 trees[i+1].leaf_print = nfdi_print;
1672 trees[i+1].leaf_size = nfdi_size;
1673 trees[i+1].leaf_index = nfdi_index;
1674 trees[i+1].leaf_emit = nfdi_emit;
1679 trees[i].childnode = NODE;
1693 trees[i].type, trees[i].maxage);
1700 if (data->correction <= trees[i].maxage)
1702 insert(&trees[i], keyval, keylen, data);
1714 prune(&trees[i]);
1716 mark_nodes(&trees[i]);
1720 size = index_nodes(&trees[i], size);
1723 changed += size_nodes(&trees[i]);
1729 emit(&trees[i], utf8data);
1734 trees[i].type, trees[i].maxage, trees[i].index);
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];
1831 verify(&trees[i]);
3307 ages[gen], trees[t].index,
3309 if (trees[t].maxage == ages[gen])
3318 ages[gen], trees[t].index,
3320 if (trees[t].maxage == ages[gen])
3329 if (i == trees[t].index) {
3331 trees[t].type, trees[t].maxage);