Lines Matching full:ages
89 unsigned int *ages; variable
1330 * For the Age, we store the index into the ages table. Effectively
1606 /* Count the number of different ages. */ in trees_init()
1625 /* Assign ages to the trees. */ in trees_init()
1641 /* The ages assigned above are off by one. */ in trees_init()
1644 while (ages[j] < trees[i].maxage) in trees_init()
1646 trees[i].maxage = ages[j-1]; in trees_init()
1984 ages = calloc(ages_count + 1, sizeof(*ages)); in age_init()
1986 ages[ages_count] = (unsigned int)-1; in age_init()
1995 ages[++gen] = in age_init()
2006 ages[++gen] = UNICODE_AGE(major, minor, 0); in age_init()
2037 unicode_maxage = ages[gen]; in age_init()
2817 leaf_age = ages[LEAF_GEN(leaf)]; in utf8agemax()
2844 leaf_age = ages[LEAF_GEN(leaf)]; in utf8agemin()
2870 leaf_age = ages[LEAF_GEN(leaf)]; in utf8nagemax()
2897 leaf_age = ages[LEAF_GEN(leaf)]; in utf8nagemin()
2924 if (ages[LEAF_GEN(leaf)] > tree->maxage) in utf8len()
2951 if (ages[LEAF_GEN(leaf)] > tree->maxage) in utf8nlen()
3097 if (ages[LEAF_GEN(leaf)] > u8c->tree->maxage) { in utf8byte()
3299 fprintf(file, "\t%#x%s\n", ages[i], in write_file()
3300 ages[i] == unicode_maxage ? "" : ","); in write_file()
3307 ages[gen], trees[t].index, in write_file()
3308 ages[gen] == unicode_maxage ? "" : ","); in write_file()
3309 if (trees[t].maxage == ages[gen]) in write_file()
3318 ages[gen], trees[t].index, in write_file()
3319 ages[gen] == unicode_maxage ? "" : ","); in write_file()
3320 if (trees[t].maxage == ages[gen]) in write_file()