Searched refs:ages (Results 1 – 5 of 5) sorted by relevance
89 unsigned int *ages; variable1644 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()[all …]
10 similar to what has been possible with cpu scheduling for ages. Support for io
91 * "Reader Pipe": Histogram of "ages" of structures seen by readers.103 * "Reader Batch": Another histogram of "ages" of structures seen
397 which are rather testing artifacts from the old ages.613 As the system ages, allocating huge pages may be expensive as the
277 The interval at which the filesystem ages filestreams cache