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()
2309 	unsigned int age;  in corrections_init()  local
2349 		age = UNICODE_AGE(major, minor, revision);  in corrections_init()
2350 		corrections[count].correction = age;  in corrections_init()
2799  * Maximum age of any character in s.
2806 	int		age = 0;  in utf8agemax()  local
2818 		if (leaf_age <= tree->maxage && leaf_age > age)  in utf8agemax()
2819 			age = leaf_age;  in utf8agemax()
2822 	return age;  in utf8agemax()
2826  * Minimum age of any character in s.
2833 	int		age;  in utf8agemin()  local
2839 	age = tree->maxage;  in utf8agemin()
2845 		if (leaf_age <= tree->maxage && leaf_age < age)  in utf8agemin()
2846 			age = leaf_age;  in utf8agemin()
2849 	return age;  in utf8agemin()
2853  * Maximum age of any character in s, touch at most len bytes.
2859 	int		age = 0;  in utf8nagemax()  local
2871 		if (leaf_age <= tree->maxage && leaf_age > age)  in utf8nagemax()
2872 			age = leaf_age;  in utf8nagemax()
2876 	return age;  in utf8nagemax()
2880  * Maximum age of any character in s, touch at most len bytes.
2887 	int		age;  in utf8nagemin()  local
2892 	age = tree->maxage;  in utf8nagemin()
2898 		if (leaf_age <= tree->maxage && leaf_age < age)  in utf8nagemin()
2899 			age = leaf_age;  in utf8nagemin()
2903 	return age;  in utf8nagemin()