Home
last modified time | relevance | path

Searched full:age (Results 1 – 25 of 165) sorted by relevance

1234567

/linux/Documentation/admin-guide/mm/damon/
H A Dstart.rst48 0 addr 86.182 TiB size 8.000 KiB access 0 % age 14.900 s
49 1 addr 86.182 TiB size 8.000 KiB access 60 % age 0 ns
50 2 addr 86.182 TiB size 3.422 MiB access 0 % age 4.100 s
51 3 addr 86.182 TiB size 2.004 MiB access 95 % age 2.200 s
52 4 addr 86.182 TiB size 29.688 MiB access 0 % age 14.100 s
53 5 addr 86.182 TiB size 29.516 MiB access 0 % age 16.700 s
54 6 addr 86.182 TiB size 29.633 MiB access 0 % age 17.900 s
55 7 addr 86.182 TiB size 117.652 MiB access 0 % age 18.400 s
56 8 addr 126.990 TiB size 62.332 MiB access 0 % age 9.500 s
57 9 addr 126.990 TiB size 13.980 MiB access 0 % age 5.200 s
[all …]
H A Dusage.rst80 │ │ │ │ │ │ │ │ age/min,max
92 │ │ │ │ │ │ │ │ 0/start,end,nr_accesses,age,sz_filter_passed
361 ``nr_accesses``, and ``age``) each having two files (``min`` and ``max``)
364 ``nr_accesses``, and ``age`` directories, respectively. Note that the ``min``
400 <damon_design_damos_quotas_prioritization>` for size, access frequency, and age
566 and ``age`` of the region.
587 ``nr_accesses``, ``age``, and ``sz_filter_passed``). Reading the files will
598 limitation, page out memory regions having longer age first. Also, check the
613 # echo 10 > access_pattern/age/min
614 # echo 20 > access_pattern/age/max
[all …]
/linux/fs/ubifs/
H A Dshrinker.c23 * The age of znodes is just the time-stamp when they were last looked at.
52 * @age: the age of znodes to free
56 * clean znodes which younger then @age. Returns number of freed znodes.
58 static int shrink_tnc(struct ubifs_info *c, int nr, int age, int *contention) in shrink_tnc() argument
73 * children are older or of the same age. in shrink_tnc()
110 abs(time - znode->time) >= age) { in shrink_tnc()
137 * @age: the age of znodes to free
141 * znodes which are older than @age, until at least @nr znodes are freed.
144 static int shrink_tnc_trees(int nr, int age, int *contention) in shrink_tnc_trees() argument
187 freed += shrink_tnc(c, nr, age, contention); in shrink_tnc_trees()
/linux/fs/f2fs/
H A Dextent_cache.c77 unsigned long age, unsigned long last_blocks, in __set_extent_info() argument
91 ei->age = age; in __set_extent_info()
163 abs(back->age - front->age) <= SAME_AGE_REGION && in __is_extent_mergeable()
475 /* initialize block age cache */ in f2fs_init_extent_tree()
608 "extent node in rb tree [%u, %u, %u], age [%llu, %llu], " in __insert_extent_tree()
609 "extent node to insert [%u, %u, %u], age [%llu, %llu]", in __insert_extent_tree()
610 __func__, et->type, en->ei.fofs, en->ei.blk, en->ei.len, en->ei.age, in __insert_extent_tree()
611 en->ei.last_blocks, ei->fofs, ei->blk, ei->len, ei->age, ei->last_blocks); in __insert_extent_tree()
675 "extent [%u, %u, %u], age [%llu, %llu]", in __update_extent_tree_range()
677 tei->age, tei->last_blocks); in __update_extent_tree_range()
[all …]
H A Dgc.c365 unsigned char age = 0; in get_cb_cost() local
382 age = 100 - div64_u64(100 * (mtime - sit_i->min_mtime), in get_cb_cost()
385 return UINT_MAX - ((100 * (100 - u) * age) / (100 + u)); in get_cb_cost()
554 unsigned long long age, u, accu; in atgc_lookup_victim() local
585 /* age = 10000 * x% * 60 */ in atgc_lookup_victim()
586 age = div64_u64(accu * (max_mtime - ve->mtime), total_time) * in atgc_lookup_victim()
596 f2fs_bug_on(sbi, age + u >= UINT_MAX); in atgc_lookup_victim()
598 cost = UINT_MAX - (age + u); in atgc_lookup_victim()
602 (cost == p->min_cost && age > p->oldest_age)) { in atgc_lookup_victim()
604 p->oldest_age = age; in atgc_lookup_victim()
[all …]
/linux/arch/mips/include/asm/sn/sn0/
H A Dhubni.h46 #define NI_AGE_CPU0_MEMORY 0x600500 /* CPU 0 memory age control */
47 #define NI_AGE_CPU0_PIO 0x600508 /* CPU 0 PIO age control */
48 #define NI_AGE_CPU1_MEMORY 0x600510 /* CPU 1 memory age control */
49 #define NI_AGE_CPU1_PIO 0x600518 /* CPU 1 PIO age control */
50 #define NI_AGE_GBR_MEMORY 0x600520 /* GBR memory age control */
51 #define NI_AGE_GBR_PIO 0x600528 /* GBR PIO age control */
52 #define NI_AGE_IO_MEMORY 0x600530 /* IO memory age control */
53 #define NI_AGE_IO_PIO 0x600538 /* IO PIO age control */
/linux/scripts/gdb/linux/
H A Dslab.py119 age = jiffies - track['when']
132 loc['sum_time'] += age
133 loc['min_time'] = min(loc['min_time'], age)
134 loc['max_time'] = max(loc['max_time'], age)
142 'sum_time' : age,
143 'min_time' : age,
144 'max_time' : age,
218 … gdb.write(" age=%d/%d/%d" % (loc['min_time'], loc['sum_time']/loc['count'], loc['max_time']))
220 gdb.write(" age=%d" % loc['min_time'])
/linux/tools/testing/selftests/damon/
H A Ddamos_apply_interval.py22 # >= 25% access rate, >= 200ms age
23 nr_accesses=[5, 20], age=[2, 2**64 - 1]),
29 # >= 25% access rate, >= 200ms age
30 nr_accesses=[5, 20], age=[2, 2**64 - 1]),
H A D_damon_sysfs.py44 age = None variable in DamosAccessPattern
47 def __init__(self, size=None, nr_accesses=None, age=None): argument
50 self.age = age
56 if self.age is None:
57 self.age = [0, 2**32 - 1]
80 os.path.join(self.sysfs_dir(), 'age', 'min'), self.age[0])
84 os.path.join(self.sysfs_dir(), 'age', 'max'), self.age[1])
383 def __init__(self, start, end, nr_accesses, age): argument
387 self.age = age
723 for f in ['start', 'end', 'nr_accesses', 'age']:
H A Dsysfs_update_schemes_tried_regions_wss_estimation.py19 # >= 25% access rate, >= 200ms age
20 nr_accesses=[5, 20], age=[2, 2**64 - 1]))] # schemes
H A Ddamos_quota.py23 # >= 25% access rate, >= 200ms age
24 nr_accesses=[5, 20], age=[2, 2**64 - 1]),
/linux/drivers/md/dm-vdo/
H A Dblock-map.h375 * vdo_convert_maximum_age() - Convert the maximum age to reflect the new recovery journal format
376 * @age: The configured maximum age
378 * Return: The converted age
381 * made two entries. The old maximum age was half the usable journal length. In the new format,
383 * age so that the number of writes in a block map era is the same in the old and new formats. This
388 static inline block_count_t vdo_convert_maximum_age(block_count_t age) in vdo_convert_maximum_age() argument
390 return DIV_ROUND_UP(age * RECOVERY_JOURNAL_1_ENTRIES_PER_BLOCK, in vdo_convert_maximum_age()
/linux/drivers/infiniband/hw/hfi1/
H A Dtrace_ibhdrs.h86 u8 *age, bool *becn, bool *fecn,
92 u8 age, bool becn, bool fecn, u8 l4,
123 __field(u8, age)
160 &__entry->age,
226 __entry->age,
283 __field(u8, age)
320 &__entry->age,
390 __entry->age,
H A Dtrace.c169 u8 *age, bool *becn, bool *fecn, in hfi1_trace_parse_16b_hdr() argument
174 *age = hfi1_16B_get_age(hdr); in hfi1_trace_parse_16b_hdr()
189 #define LRH_16B_PRN "age:%d becn:%d fecn:%d l4:%d " \
192 u8 age, bool becn, bool fecn, u8 l4, in hfi1_trace_fmt_lrh() argument
203 age, becn, fecn, l4, rc, sc, pkey, entropy); in hfi1_trace_fmt_lrh()
/linux/fs/unicode/
H A Dmkutf8data.c1327 * 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()
[all …]
/linux/drivers/scsi/
H A Dlibiscsi.c341 task->conn->session->age); in iscsi_prep_scsi_cmd_pdu()
787 task->conn->session->age); in iscsi_alloc_mgmt_task()
1178 * the LDD's itt space does not include the session age.
1368 int age = 0, i = 0; in iscsi_verify_itt() local
1374 session->tt->parse_pdu_itt(conn, itt, &i, &age); in iscsi_verify_itt()
1377 age = ((__force u32)itt >> ISCSI_AGE_SHIFT) & ISCSI_AGE_MASK; in iscsi_verify_itt()
1380 if (age != session->age) { in iscsi_verify_itt()
1382 "received itt %x expected session age (%x)\n", in iscsi_verify_itt()
1383 (__force u32)itt, session->age); in iscsi_verify_itt()
1417 if (iscsi_cmd(task->sc)->age != conn->session->age) { in iscsi_itt_to_ctask()
[all …]
/linux/include/uapi/linux/
H A Dtcp_metrics.h52 TCP_METRICS_ATTR_TW_TS_STAMP, /* s32, sec age */
56 TCP_METRICS_ATTR_FOPEN_SYN_DROP_TS, /* msecs age */
/linux/mm/damon/
H A Dsysfs-schemes.c21 unsigned int age; member
37 sysfs_region->age = region->age; in damon_sysfs_scheme_region_alloc()
75 return sysfs_emit(buf, "%u\n", region->age); in age_show()
106 __ATTR_RO_MODE(age, 0400);
1331 unsigned int age; member
1335 unsigned int nr_accesses, unsigned int age) in damon_sysfs_weights_alloc() argument
1345 weights->age = age; in damon_sysfs_weights_alloc()
1393 return sysfs_emit(buf, "%u\n", weights->age); in age_permil_show()
1401 int err = kstrtouint(buf, 0, &weights->age); in age_permil_store()
1608 struct damon_sysfs_ul_range *age; member
[all …]
H A Dcore.c131 region->age = 0; in damon_new_region()
594 static unsigned int damon_age_for_new_attrs(unsigned int age, in damon_age_for_new_attrs() argument
597 return age * old_attrs->aggr_interval / new_attrs->aggr_interval; in damon_age_for_new_attrs()
649 r->age = damon_age_for_new_attrs(r->age, old_attrs, new_attrs); in damon_update_monitoring_result()
654 * aggregation interval that access to the region has found, and region->age is
658 * ->nr_accesses and ->age of given damon_ctx's regions for new damon_attrs.
1621 s->pattern.min_age_region <= r->age && in __damos_valid_target()
1622 r->age <= s->pattern.max_age_region; in __damos_valid_target()
1924 r->age = 0; in damos_apply_scheme()
2296 l->age = (l->age * sz_l + r->age * sz_r) / (sz_l + sz_r); in damon_merge_two_regions()
[all …]
/linux/drivers/gpu/drm/xe/
H A Dxe_mocs.c162 /* Age 0 - LLC */
166 /* Age 0 - L3 + LLC */
170 /* Age: Don't Chg. - LLC */
174 /* Age: Don't Chg. - L3 + LLC */
186 /* No AOM; Age 0 - LLC */
190 /* No AOM; Age 0 - L3 + LLC */
194 /* No AOM; Age:DC - LLC */
198 /* No AOM; Age:DC - L3 + LLC */
/linux/Documentation/admin-guide/mm/
H A Dslab.rst198 INFO: Allocated in get_modalias+0x61/0xf5 age=53 cpu=1 pid=554
244 INFO: Allocated in <kernel function> age=<jiffies since alloc> cpu=<allocated by
246 INFO: Freed in <kernel function> age=<jiffies since free> cpu=<freed by cpu>
418 338 pci_alloc_dev+0x2c/0xa0 waste=521872/1544 age=290837/291891/293509 pid=1 cpus=106 nodes=0-1
449 1980 <not-available> age=4294912290 pid=0 cpus=0
450 51 acpi_ut_update_ref_count+0x6a6/0x782 age=236886/237027/237772 pid=1 cpus=1
/linux/tools/usb/usbip/
H A Dconfigure.ac9 AGE=0
10 AC_SUBST([LIBUSBIP_VERSION], [$CURRENT:$REVISION:$AGE], [library version])
/linux/Documentation/netlink/specs/
H A Dtcp_metrics.yaml39 name: age
151 - age
/linux/include/linux/
H A Ddamon.h56 * @age: Age of this region.
71 * @age is initially zero, increased for each aggregation interval, and reset
73 * regions are merged into a new region, both @nr_accesses and @age of the new
83 unsigned int age; member
84 /* private: Internal value for age calculation. */
222 * @weight_age: Weight of the region's age for prioritization.
458 * @min_age_region: Minimum age of target regions.
459 * @max_age_region: Maximum age of target regions.
/linux/mm/
H A Dksm.c198 * @age: number of scan iterations since creation
212 rmap_age_t age; member
1056 unsigned char age; in remove_rmap_item_from_tree() local
1064 age = (unsigned char)(ksm_scan.seqnr - rmap_item->address); in remove_rmap_item_from_tree()
1065 BUG_ON(age > 1); in remove_rmap_item_from_tree()
1066 if (!age) in remove_rmap_item_from_tree()
2418 * Calculate skip age for the ksm page age. The age determines how often
2419 * de-duplicating has already been tried unsuccessfully. If the age is
2422 * @age: rmap_item age of page
2424 static unsigned int skip_age(rmap_age_t age) in skip_age() argument
[all …]

1234567