| /linux-6.12.1/drivers/net/ethernet/freescale/fman/ |
| D | fman_keygen.c | 24 /* Select Scheme Value Register */
56 /* Scheme Registers bit field masks */
133 /* Scheme Configuration RAM Registers */
146 /* 0x140: KeyGen Scheme Entry Statistic Packet Counter */
147 u32 kgse_dv0; /* 0x144: KeyGen Scheme Entry Default Value 0 */
148 u32 kgse_dv1; /* 0x148: KeyGen Scheme Entry Default Value 1 */
150 /* 0x14C: KeyGen Scheme Entry Coarse Classification Bit*/
151 u32 kgse_mv; /* 0x150: KeyGen Scheme Entry Match vector */
152 u32 kgse_om; /* 0x154: KeyGen Scheme Entry Operation Mode bits */
154 /* 0x158: KeyGen Scheme Entry Virtual Storage Profile */
[all …]
|
| /linux-6.12.1/mm/damon/ |
| D | sysfs-schemes.c | 14 * scheme region directory
114 * scheme regions directory
124 * Each DAMON-based operation scheme (&struct damos) has its own apply
125 * interval, and we need to expose the scheme tried regions based on only
127 * scheme. The status becomes 'idle' at the beginning.
138 * the scheme is completely applied to the given snapshot. Hence the callback
148 * apply intervals of the scheme is passed while the state is 'idle'.
1060 * scheme/weights directory
1436 * scheme directory
1469 struct damon_sysfs_scheme *scheme = kmalloc(sizeof(*scheme), in damon_sysfs_scheme_alloc() local
[all …]
|
| D | paddr.c | 235 static bool damos_pa_filter_out(struct damos *scheme, struct folio *folio) in damos_pa_filter_out() argument
239 damos_for_each_filter(filter, scheme) { in damos_pa_filter_out()
480 struct damos *scheme) in damon_pa_apply_scheme() argument
482 switch (scheme->action) { in damon_pa_apply_scheme()
484 return damon_pa_pageout(r, scheme); in damon_pa_apply_scheme()
486 return damon_pa_mark_accessed(r, scheme); in damon_pa_apply_scheme()
488 return damon_pa_deactivate_pages(r, scheme); in damon_pa_apply_scheme()
491 return damon_pa_migrate(r, scheme); in damon_pa_apply_scheme()
503 struct damos *scheme) in damon_pa_scheme_score() argument
505 switch (scheme->action) { in damon_pa_scheme_score()
[all …]
|
| D | core.c | 360 struct damos *scheme; in damon_new_scheme() local
362 scheme = kmalloc(sizeof(*scheme), GFP_KERNEL); in damon_new_scheme()
363 if (!scheme) in damon_new_scheme()
365 scheme->pattern = *pattern; in damon_new_scheme()
366 scheme->action = action; in damon_new_scheme()
367 scheme->apply_interval_us = apply_interval_us; in damon_new_scheme()
373 scheme->next_apply_sis = 0; in damon_new_scheme()
374 INIT_LIST_HEAD(&scheme->filters); in damon_new_scheme()
375 scheme->stat = (struct damos_stat){}; in damon_new_scheme()
376 INIT_LIST_HEAD(&scheme->list); in damon_new_scheme()
[all …]
|
| D | reclaim.c | 188 struct damos *scheme; in damon_reclaim_apply_parameters() local
202 scheme = damon_reclaim_new_scheme(); in damon_reclaim_apply_parameters()
203 if (!scheme) in damon_reclaim_apply_parameters()
205 damon_set_schemes(ctx, &scheme, 1); in damon_reclaim_apply_parameters()
212 damos_add_quota_goal(&scheme->quota, goal); in damon_reclaim_apply_parameters()
220 damos_add_quota_goal(&scheme->quota, goal); in damon_reclaim_apply_parameters()
227 damos_add_filter(scheme, filter); in damon_reclaim_apply_parameters()
|
| /linux-6.12.1/tools/testing/selftests/damon/ |
| D | _damon_sysfs.py | 41 scheme = None variable in DamosAccessPattern
56 return os.path.join(self.scheme.sysfs_dir(), 'access_pattern')
124 scheme = None # owner scheme variable in DamosQuota
136 return os.path.join(self.scheme.sysfs_dir(), 'quotas')
201 self.access_pattern.scheme = self
203 self.quota.scheme = self
329 for idx, scheme in enumerate(self.schemes):
330 scheme.idx = idx
331 scheme.context = self
369 for scheme in self.schemes:
[all …]
|
| D | damos_apply_interval.py | 53 print('scheme(s) are not tried')
56 # Because the second scheme was having the apply interval that is ten times
57 # lower than that of the first scheme, the second scheme should be tried
58 # about ten times more frequently than the first scheme. For possible
|
| D | damon_nr_regions.py | 49 scheme = kdamonds.kdamonds[0].contexts[0].schemes[0]
50 if scheme.tried_regions is None:
55 nr_tried_regions = len(scheme.tried_regions)
126 scheme = kdamonds.kdamonds[0].contexts[0].schemes[0]
127 if scheme.tried_regions is None:
132 nr_tried_regions = len(scheme.tried_regions)
|
| D | sysfs_update_removed_scheme_dir.sh | 23 # start DAMON with a scheme
37 # remove scheme sysfs dir
40 # try to update stat of already removed scheme sysfs dir
49 # try to update tried regions of already removed scheme sysfs dir
|
| D | damos_tried_regions.py | 39 scheme = kdamonds.kdamonds[0].contexts[0].schemes[0]
40 if scheme.tried_regions is None:
45 nr_tried_regions = len(scheme.tried_regions)
|
| D | damos_quota.py | 49 scheme = kdamonds.kdamonds[0].contexts[0].schemes[0]
50 wss_collected.append(scheme.tried_bytes)
51 nr_quota_exceeds = scheme.stats.qt_exceeds
|
| /linux-6.12.1/include/linux/ |
| D | damon.h | 99 * Operation Scheme.
149 * struct damos_quota_goal - DAMOS scheme quota auto-tuning goal.
177 * struct damos_quota - Controls the aggressiveness of the given scheme.
179 * @ms: Maximum milliseconds that the scheme can use.
197 * throughput of the scheme's action. DAMON then compares it against &sz and
207 * For selecting regions within the quota, DAMON prioritizes current scheme's
245 * @DAMOS_WMARK_NONE: Ignore the watermarks of the given scheme.
256 * struct damos_watermarks - Controls when a given scheme should be activated.
263 * If &metric is &DAMOS_WMARK_NONE, the scheme is always active. Being active
264 * means DAMON does monitoring and applying the action of the scheme to
[all …]
|
| /linux-6.12.1/Documentation/ABI/testing/ |
| D | sysfs-kernel-mm-damon | 33 'tried_regions' directory of every scheme directory of this
149 directories for controlling each DAMON-based operation scheme
156 of the scheme.
168 the scheme in microseconds. Reading this file returns the
175 size of the scheme's target regions in bytes.
181 size of the scheme's target regions in bytes.
187 'nr_accesses' of the scheme's target regions.
193 'nr_accesses' of the scheme's target regions.
199 'age' of the scheme's target regions.
205 'age' of the scheme's target regions.
[all …]
|
| D | sysfs-bus-iio-light-isl29018 | 9 Scheme 0, makes full n (4, 8, 12, 16) bits (unsigned) proximity
10 detection. The range of Scheme 0 proximity count is from 0 to
11 2^n. Logic 1 of this bit, Scheme 1, makes n-1 (3, 7, 11, 15)
13 range of Scheme 1 proximity count is from -2^(n-1) to 2^(n-1).
15 Scheme 0 has wider dynamic range, Scheme 1 proximity detection
|
| /linux-6.12.1/Documentation/admin-guide/mm/damon/ |
| D | usage.rst | 144 DAMON-based operation scheme of the kdamond. For details of the stats,
146 - ``update_schemes_tried_regions``: Update the DAMON-based operation scheme
147 action tried regions directory for each DAMON-based operation scheme of the
148 kdamond. For details of the DAMON-based operation scheme action tried
153 - ``clear_schemes_tried_regions``: Clear the DAMON-based operating scheme
154 action tried regions directory for each DAMON-based operation scheme of the
157 ``effective_bytes`` files for each DAMON-based operation scheme of the
284 to ``N-1``. Each directory represents each DAMON-based operation scheme.
291 In each scheme directory, five directories (``access_pattern``, ``quotas``,
295 The ``action`` file is for setting and getting the scheme's :ref:`action
[all …]
|
| /linux-6.12.1/drivers/atm/ |
| D | fore200e.c | 285 int scheme, magn, nbr; in fore200e_free_rx_buf() local
288 for (scheme = 0; scheme < BUFFER_SCHEME_NBR; scheme++) { in fore200e_free_rx_buf()
291 if ((buffer = fore200e->host_bsq[ scheme ][ magn ].buffer) != NULL) { in fore200e_free_rx_buf()
293 for (nbr = 0; nbr < fore200e_rx_buf_nbr[ scheme ][ magn ]; nbr++) { in fore200e_free_rx_buf()
309 int scheme, magn; in fore200e_uninit_bs_queue() local
311 for (scheme = 0; scheme < BUFFER_SCHEME_NBR; scheme++) { in fore200e_uninit_bs_queue()
314 struct chunk* status = &fore200e->host_bsq[ scheme ][ magn ].status; in fore200e_uninit_bs_queue()
315 struct chunk* rbd_block = &fore200e->host_bsq[ scheme ][ magn ].rbd_block; in fore200e_uninit_bs_queue()
857 int bsq_audit(int where, struct host_bsq* bsq, int scheme, int magn) in bsq_audit() argument
867 where, scheme, magn, buffer->index); in bsq_audit()
[all …]
|
| D | fore200e.h | 19 #define BUFFER_S1_SIZE SMALL_BUFFER_SIZE /* size of small buffers, scheme 1 */
20 #define BUFFER_L1_SIZE LARGE_BUFFER_SIZE /* size of large buffers, scheme 1 */
22 #define BUFFER_S2_SIZE SMALL_BUFFER_SIZE /* size of small buffers, scheme 2 */
23 #define BUFFER_L2_SIZE LARGE_BUFFER_SIZE /* size of large buffers, scheme 2 */
168 /* buffer scheme */
284 enum buffer_scheme scheme : 8, /* buffer scheme */
580 enum buffer_scheme scheme; /* buffer scheme */ member
655 /* receive buffer supply queues scheme specification */
877 enum buffer_scheme scheme; /* rx buffer scheme */ member
|
| /linux-6.12.1/drivers/media/usb/pvrusb2/ |
| D | pvrusb2-devattr.h | 111 /* Signal routing scheme used by device, contains one of
113 encounter them. This is an arbitrary integer scheme id; its
119 /* Indicates scheme for controlling device's LED (if any). The
124 /* Control scheme to use if there is a digital tuner. This
126 integer scheme id; its meaning is contained entirely within the
155 /* Indicate IR scheme of hardware. If not set, then it is assumed
|
| /linux-6.12.1/drivers/net/wireless/ath/ath9k/ |
| D | btcoex.c | 120 if (btcoex_hw->scheme != ATH_BTCOEX_CFG_2WIRE && in ath9k_hw_btcoex_pin_init()
121 btcoex_hw->scheme != ATH_BTCOEX_CFG_3WIRE) in ath9k_hw_btcoex_pin_init()
124 /* bt priority GPIO will be ignored by 2 wire scheme */ in ath9k_hw_btcoex_pin_init()
146 btcoex_hw->scheme = ATH_BTCOEX_CFG_NONE; in ath9k_hw_btcoex_init_scheme()
151 btcoex_hw->scheme = ATH_BTCOEX_CFG_MCI; in ath9k_hw_btcoex_init_scheme()
153 btcoex_hw->scheme = ATH_BTCOEX_CFG_3WIRE; in ath9k_hw_btcoex_init_scheme()
160 btcoex_hw->scheme = ATH_BTCOEX_CFG_3WIRE; in ath9k_hw_btcoex_init_scheme()
162 btcoex_hw->scheme = ATH_BTCOEX_CFG_2WIRE; in ath9k_hw_btcoex_init_scheme()
434 if (btcoex_hw->scheme == ATH_BTCOEX_CFG_3WIRE) { in ath9k_hw_btcoex_disable()
|
| /linux-6.12.1/drivers/iio/light/ |
| D | isl29018.c | 224 static int isl29018_read_proximity_ir(struct isl29018_chip *chip, int scheme, in isl29018_read_proximity_ir() argument
232 /* Do proximity sensing with required scheme */ in isl29018_read_proximity_ir()
235 scheme << ISL29018_CMD2_SCHEME_SHIFT); in isl29018_read_proximity_ir()
246 if (scheme == 1) { in isl29018_read_proximity_ir()
307 * Proximity Sensing Scheme: Bit 7. This bit programs the function
308 * of the proximity detection. Logic 0 of this bit, Scheme 0, makes
310 * of Scheme 0 proximity count is from 0 to 2^n. Logic 1 of this bit,
311 * Scheme 1, makes n-1 (3, 7, 11, 15) bits (2's complementary)
312 * proximity_less_ambient detection. The range of Scheme 1
314 * for resolutions less than 16. While Scheme 0 has wider dynamic
[all …]
|
| /linux-6.12.1/arch/arm/mach-omap2/ |
| D | omap_hwmod_common_data.c | 24 * struct omap_hwmod_sysc_type1 - TYPE1 sysconfig scheme.
40 * struct omap_hwmod_sysc_type2 - TYPE2 sysconfig scheme.
54 * struct omap_hwmod_sysc_type3 - TYPE3 sysconfig scheme.
|
| /linux-6.12.1/Documentation/mm/damon/ |
| D | design.rst | 202 This scheme, however, cannot preserve the quality of the output if the
373 regions that the scheme is having an interest in.
387 region having the access pattern of interest is found, applying the scheme's
415 scheme action. In contrast, the colder regions would be deprioritized for huge
416 page collapse scheme action. Hence, the prioritization mechanisms for each
442 aggressiveness (the quota) of the corresponding scheme. For example, if DAMOS
474 memory is guaranteed, running a scheme for proactive reclamation would only
482 high watermark or below the low watermark, the scheme is deactivated. If the
483 metric becomes below the mid watermark but above the low watermark, the scheme
507 number of filters for each scheme. Each filter specifies the type of target
[all …]
|
| /linux-6.12.1/Documentation/filesystems/ext4/ |
| D | ifork.rst | 36 Note that with this block mapping scheme, it is necessary to fill out a
38 led to the creation of the extent mapping scheme, discussed below.
40 Notice also that a file using this mapping scheme cannot be placed
47 tree. Under the old scheme, allocating a contiguous run of 1,000 blocks
|
| /linux-6.12.1/Documentation/translations/zh_CN/admin-guide/mm/damon/ |
| D | usage.rst | 427 用户可以通过读取和写入 ``scheme`` debugfs文件来获得和设置这些方案。读取该文件还可以显示每个
514 # scheme="4096 8192 0 5 10 20 2" # target access pattern and action
515 # scheme+=" 10 $((1024*1024*1024)) 1000" # quotas
516 # scheme+=" 0 0 100" # prioritization weights
517 # scheme+=" 1 5000000 600 500 300" # watermarks
518 # echo "$scheme" > schemes
|
| /linux-6.12.1/Documentation/translations/zh_TW/admin-guide/mm/damon/ |
| D | usage.rst | 427 用戶可以通過讀取和寫入 ``scheme`` debugfs文件來獲得和設置這些方案。讀取該文件還可以顯示每個
514 # scheme="4096 8192 0 5 10 20 2" # target access pattern and action
515 # scheme+=" 10 $((1024*1024*1024)) 1000" # quotas
516 # scheme+=" 0 0 100" # prioritization weights
517 # scheme+=" 1 5000000 600 500 300" # watermarks
518 # echo "$scheme" > schemes
|