Home
last modified time | relevance | path

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

1234567

/linux/drivers/gpu/drm/i915/gt/
H A Dintel_gt_buffer_pool.c56 unsigned long age; in pool_free_older_than() local
60 age = READ_ONCE(node->age); in pool_free_older_than()
61 if (!age || jiffies - age < keep) in pool_free_older_than()
65 if (!xchg(&node->age, 0)) in pool_free_older_than()
116 GEM_BUG_ON(node->age); in pool_retire()
119 WRITE_ONCE(node->age, jiffies ?: 1); /* 0 reserved for active nodes */ in pool_retire()
152 node->age = 0; in node_create()
185 unsigned long age; in intel_gt_get_buffer_pool() local
193 age = READ_ONCE(node->age); in intel_gt_get_buffer_pool()
194 if (!age) in intel_gt_get_buffer_pool()
[all …]
/linux/Documentation/translations/zh_CN/admin-guide/mm/damon/
H A Dstart.rst51 0 addr 86.182 TiB size 8.000 KiB access 0 % age 14.900 s
52 1 addr 86.182 TiB size 8.000 KiB access 60 % age 0 ns
53 2 addr 86.182 TiB size 3.422 MiB access 0 % age 4.100 s
54 3 addr 86.182 TiB size 2.004 MiB access 95 % age 2.200 s
55 4 addr 86.182 TiB size 29.688 MiB access 0 % age 14.100 s
56 5 addr 86.182 TiB size 29.516 MiB access 0 % age 16.700 s
57 6 addr 86.182 TiB size 29.633 MiB access 0 % age 17.900 s
58 7 addr 86.182 TiB size 117.652 MiB access 0 % age 18.400 s
59 8 addr 126.990 TiB size 62.332 MiB access 0 % age 9.500 s
60 9 addr 126.990 TiB size 13.980 MiB access 0 % age 5.200 s
[all …]
H A Dusage.rst89 │ │ │ │ │ │ │ │ age/min,max
103 │ │ │ │ │ │ │ │ 0/start,end,nr_accesses,age,sz_filter_passed
351 在 ``access_pattern`` 目录下，存在三个目录（ ``sz``, ``nr_accesses``, 和 ``age`` ），
353 ``age`` 目录下的 ``min`` 和 ``max`` 文件分别写入和读取来设置和获取给定方案的访问模式。
539 信息。这些信息包括该区域的地址范围、``nr_accesses`` 和 ``age``。
557 ``age`` 和 ``sz_filter_passed``）。读取这些文件将显示相应的基于DAMON的操作方案
587 # echo 10 > access_pattern/age/min
588 # echo 20 > access_pattern/age/max
635 的 ``age`` （关于该计数器的更多细节请参考 :ref:`设计 <damon_design_age_tracking_zh_CN>`）。
/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 …]
/linux/include/linux/
H A Dunicode.h21 static inline u8 unicode_major(unsigned int age) in unicode_major() argument
23 return (age >> UNICODE_MAJ_SHIFT) & 0xff; in unicode_major()
26 static inline u8 unicode_minor(unsigned int age) in unicode_minor() argument
28 return (age >> UNICODE_MIN_SHIFT) & 0xff; in unicode_minor()
31 static inline u8 unicode_rev(unsigned int age) in unicode_rev() argument
33 return age & 0xff; in unicode_rev()
/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.c86 unsigned long age, unsigned long last_blocks, in __set_extent_info() argument
100 ei->age = age; in __set_extent_info()
172 abs(back->age - front->age) <= SAME_AGE_REGION && in __is_extent_mergeable()
484 /* initialize block age cache */ in f2fs_init_extent_tree()
617 "extent node in rb tree [%u, %u, %u], age [%llu, %llu], " in __insert_extent_tree()
618 "extent node to insert [%u, %u, %u], age [%llu, %llu]", in __insert_extent_tree()
619 __func__, et->type, en->ei.fofs, en->ei.blk, en->ei.len, en->ei.age, in __insert_extent_tree()
620 en->ei.last_blocks, ei->fofs, ei->blk, ei->len, ei->age, ei->last_blocks); in __insert_extent_tree()
682 "extent [%u, %u, %u], age [%llu, %llu]", in __update_extent_tree_range()
684 tei->age, tei->last_blocks); in __update_extent_tree_range()
[all …]
H A Dgc.c367 unsigned char age = 0; in get_cb_cost() local
384 age = 100 - div64_u64(100 * (mtime - sit_i->min_mtime), in get_cb_cost()
387 return UINT_MAX - ((100 * (100 - u) * age) / (100 + u)); in get_cb_cost()
556 unsigned long long age, u, accu; in atgc_lookup_victim() local
587 /* age = 10000 * x% * 60 */ in atgc_lookup_victim()
588 age = div64_u64(accu * (max_mtime - ve->mtime), total_time) * in atgc_lookup_victim()
598 f2fs_bug_on(sbi, age + u >= UINT_MAX); in atgc_lookup_victim()
600 cost = UINT_MAX - (age + u); in atgc_lookup_victim()
604 (cost == p->min_cost && age > p->oldest_age)) { in atgc_lookup_victim()
606 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.py25 # >= 25% access rate, >= 200ms age
26 nr_accesses=[5, 20], age=[2, 2**64 - 1]),
32 # >= 25% access rate, >= 200ms age
33 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[
383 __init__(self, start, end, nr_accesses, age) global() argument
[all...]
H A Dsysfs_update_schemes_tried_regions_wss_estimation.py22 # >= 25% access rate, >= 200ms age
23 nr_accesses=[5, 20], age=[2, 2**64 - 1]))] # schemes
H A Ddamos_quota.py26 # >= 25% access rate, >= 200ms age
27 nr_accesses=[5, 20], age=[2, 2**64 - 1]),
/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/Documentation/translations/zh_CN/mm/damon/
H A Ddesign.rst223 易，DAMON 在每个区域中维护另一个名为 ``age`` 的计数器。对于每个 ``聚集间隔``，DAMON 检查该
281 监测结果快照中各区域的 ``nr_accesses`` 和 ``age`` 来衡量。该间隔的默认值 ``100ms`` 在许多情况
290 表示，也用 ``age`` 表示。例如，即使监测结果中的每个区域都显示 ``nr_accesses`` 为零，仍然可以
291 用 ``age`` 值作为时近性信息来区分区域。
415 当任何这类动作被应用到区域时，DAMOS 会重置这些区域的 age。
468 时近性（``age``）而不是访问频率（``nr_accesses``）。DAMOS 允许用户指定每个访问模式
/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()
1181 * the LDD's itt space does not include the session age.
1371 int age = 0, i = 0; in iscsi_verify_itt()
1377 session->tt->parse_pdu_itt(conn, itt, &i, &age); in iscsi_verify_itt()
1380 age = ((__force u32)itt >> ISCSI_AGE_SHIFT) & ISCSI_AGE_MASK; in iscsi_verify_itt()
1383 if (age != session->age) { in iscsi_verify_itt()
1385 "received itt %x expected session age (%x)\n", in iscsi_verify_itt()
1386 (__force u32)itt, session->age); in iscsi_verify_itt()
1370 int age = 0, i = 0; iscsi_verify_itt() local
1918 iscsi_exec_task_mgmt_fn(struct iscsi_conn * conn,struct iscsi_tm * hdr,int age,int timeout) iscsi_exec_task_mgmt_fn() argument
2355 int age; iscsi_eh_abort() local
[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/tools/testing/selftests/mm/
H A Dksft_kmemleak_confirm.sh40 AGE=6 # seconds; must exceed kmemleak's 5s minimum object age
84 sleep "$AGE"
/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/mm/
H A Dksm.c198 * @age: number of scan iterations since creation (unstable node)
215 rmap_age_t age; member
802 * Reset linear_page_index that might overlay age-related in break_cow()
918 /* Reset linear_page_index that might overlay age-related information. */ in remove_node_from_stable_tree()
1072 /* Reset linear_page_index that might overlay age-related information. */ in remove_rmap_item_from_tree()
1078 unsigned char age; in remove_rmap_item_from_tree() local
1086 age = (unsigned char)(ksm_scan.seqnr - rmap_item->address); in remove_rmap_item_from_tree()
1087 BUG_ON(age > 1); in remove_rmap_item_from_tree()
1088 if (!age) in remove_rmap_item_from_tree()
2448 * Calculate skip age fo
2453 skip_age(rmap_age_t age) skip_age() argument
2474 rmap_age_t age; should_skip_rmap_item() local
[all...]
/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
147 - age

1234567