1327  * We need to keep track of the Canonical Combining Class, the Age,
1330  * For the Age, we store the index into the ages table.  Effectively
1621 	/* Two trees per age: nfdi and nfdicf */  in trees_init()
1954 		ret = sscanf(line, "# Age=V%d_%d_%d",  in age_init()
1959 				printf(" Age V%d_%d_%d\n",  in age_init()
1965 		ret = sscanf(line, "# Age=V%d_%d", &major, &minor);  in age_init()
1969 				printf(" Age V%d_%d\n", major, minor);  in age_init()
1978 		printf("%d age entries\n", ages_count);  in age_init()
1992 		ret = sscanf(line, "# Age=V%d_%d_%d",  in age_init()
1998 				printf(" Age V%d_%d_%d = gen %d\n",  in age_init()
2004 		ret = sscanf(line, "# Age=V%d_%d", &major, &minor);  in age_init()
2008 				printf(" Age V%d_%d = %d\n",  in age_init()
2240 	unsigned int age;  in corrections_init()  local
2280 		age = UNICODE_AGE(major, minor, revision);  in corrections_init()
2281 		corrections[count].correction = age;  in corrections_init()
2730  * Maximum age of any character in s.
2737 	int		age = 0;  in utf8agemax()  local
2749 		if (leaf_age <= tree->maxage && leaf_age > age)  in utf8agemax()
2750 			age = leaf_age;  in utf8agemax()
2753 	return age;  in utf8agemax()
2757  * Minimum age of any character in s.
2764 	int		age;  in utf8agemin()  local
2770 	age = tree->maxage;  in utf8agemin()
2776 		if (leaf_age <= tree->maxage && leaf_age < age)  in utf8agemin()
2777 			age = leaf_age;  in utf8agemin()
2780 	return age;  in utf8agemin()
2784  * Maximum age of any character in s, touch at most len bytes.
2790 	int		age = 0;  in utf8nagemax()  local
2802 		if (leaf_age <= tree->maxage && leaf_age > age)  in utf8nagemax()
2803 			age = leaf_age;  in utf8nagemax()
2807 	return age;  in utf8nagemax()
2811  * Maximum age of any character in s, touch at most len bytes.
2818 	int		age;  in utf8nagemin()  local
2823 	age = tree->maxage;  in utf8nagemin()
2829 		if (leaf_age <= tree->maxage && leaf_age < age)  in utf8nagemin()
2830 			age = leaf_age;  in utf8nagemin()
2834 	return age;  in utf8nagemin()