Home
last modified time | relevance | path

Searched refs:scheme (Results 1 – 25 of 181) sorted by relevance

12345678

/linux/drivers/net/ethernet/freescale/fman/
A Dfman_keygen.c490 struct keygen_scheme *scheme; in keygen_bind_port_to_schemes() local
496 if (!scheme) { in keygen_bind_port_to_schemes()
500 if (!scheme->used) { in keygen_bind_port_to_schemes()
541 struct keygen_scheme *scheme; in keygen_scheme_setup() local
546 if (!scheme) { in keygen_scheme_setup()
579 if (scheme->use_hashing) { in keygen_scheme_setup()
637 scheme->used = enable; in keygen_scheme_setup()
742 if (!scheme) { in keygen_port_hashing_init()
746 if (scheme->used) { in keygen_port_hashing_init()
758 scheme->use_hashing = true; in keygen_port_hashing_init()
[all …]
/linux/mm/damon/
A Dcore.c97 struct damos *scheme; in damon_new_scheme() local
99 scheme = kmalloc(sizeof(*scheme), GFP_KERNEL); in damon_new_scheme()
100 if (!scheme) in damon_new_scheme()
108 scheme->action = action; in damon_new_scheme()
109 scheme->stat_count = 0; in damon_new_scheme()
110 scheme->stat_sz = 0; in damon_new_scheme()
121 scheme->quota.esz = 0; in damon_new_scheme()
134 return scheme; in damon_new_scheme()
953 if (metric > scheme->wmarks.high || scheme->wmarks.low > metric) { in damos_wmark_wait_us()
956 scheme->action, in damos_wmark_wait_us()
[all …]
A Dreclaim.c246 struct damos *scheme = damon_new_scheme( in damon_reclaim_new_scheme() local
260 return scheme; in damon_reclaim_new_scheme()
266 struct damos *scheme; in damon_reclaim_turn() local
294 scheme = damon_reclaim_new_scheme(); in damon_reclaim_turn()
295 if (!scheme) { in damon_reclaim_turn()
299 err = damon_set_schemes(ctx, &scheme, 1); in damon_reclaim_turn()
310 damon_destroy_scheme(scheme); in damon_reclaim_turn()
A Dpaddr.c217 struct damon_region *r, struct damos *scheme) in damon_pa_apply_scheme() argument
222 if (scheme->action != DAMOS_PAGEOUT) in damon_pa_apply_scheme()
250 struct damon_region *r, struct damos *scheme) in damon_pa_scheme_score() argument
252 switch (scheme->action) { in damon_pa_scheme_score()
254 return damon_pageout_score(context, r, scheme); in damon_pa_scheme_score()
A Dvaddr.c607 struct damon_region *r, struct damos *scheme) in damon_va_apply_scheme() argument
611 switch (scheme->action) { in damon_va_apply_scheme()
637 struct damon_region *r, struct damos *scheme) in damon_va_scheme_score() argument
640 switch (scheme->action) { in damon_va_scheme_score()
642 return damon_pageout_score(context, r, scheme); in damon_va_scheme_score()
A Ddbgfs.c185 struct damos *scheme, **schemes; in str_to_schemes() local
192 schemes = kmalloc_array(max_nr_schemes, sizeof(scheme), in str_to_schemes()
217 scheme = damon_new_scheme(min_sz, max_sz, min_nr_a, max_nr_a, in str_to_schemes()
219 if (!scheme) in str_to_schemes()
222 schemes[*nr_schemes] = scheme; in str_to_schemes()
/linux/drivers/atm/
A Dfore200e.c291 for (scheme = 0; scheme < BUFFER_SCHEME_NBR; scheme++) { in fore200e_free_rx_buf()
314 for (scheme = 0; scheme < BUFFER_SCHEME_NBR; scheme++) { in fore200e_uninit_bs_queue()
878 if (buffer->scheme != scheme) { in bsq_audit()
880 where, scheme, magn, buffer->index, buffer->scheme); in bsq_audit()
910 for (scheme = 0; scheme < BUFFER_SCHEME_NBR; scheme++) { in fore200e_supply()
1218 return scheme; in fore200e_select_scheme()
1240 activ_opcode.scheme = FORE200E_VCC(vcc)->scheme; in fore200e_activate_vcin()
1989 for (scheme = 0; scheme < BUFFER_SCHEME_NBR; scheme++) { in fore200e_alloc_rx_buf()
2010 buffer[ i ].scheme = scheme; in fore200e_alloc_rx_buf()
2054 for (scheme = 0; scheme < BUFFER_SCHEME_NBR; scheme++) { in fore200e_init_bs_queue()
[all …]
A Dfore200e.h284 enum buffer_scheme scheme : 8, /* buffer scheme */
580 enum buffer_scheme scheme; /* buffer scheme */ member
878 enum buffer_scheme scheme; /* rx buffer scheme */ member
/linux/include/linux/
A Ddamon.h290 struct damos *scheme);
292 struct damon_region *r, struct damos *scheme);
473 struct damon_region *r, struct damos *scheme);
475 struct damon_region *r, struct damos *scheme);
487 struct damon_region *r, struct damos *scheme);
489 struct damon_region *r, struct damos *scheme);
/linux/drivers/net/wireless/ath/ath9k/
A Dbtcoex.c120 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()
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()
A Dhtc_drv_gpio.c176 if (ah->btcoex_hw.scheme == ATH_BTCOEX_CFG_3WIRE) in ath9k_htc_stop_btcoex()
192 ah->btcoex_hw.scheme = ATH_BTCOEX_CFG_NONE; in ath9k_htc_init_btcoex()
197 ah->btcoex_hw.scheme = ATH_BTCOEX_CFG_3WIRE; in ath9k_htc_init_btcoex()
A Dgpio.c404 enum ath_btcoex_scheme scheme = ath9k_hw_get_btcoex_scheme(ah); in ath9k_deinit_btcoex() local
406 if (scheme == ATH_BTCOEX_CFG_2WIRE || in ath9k_deinit_btcoex()
407 scheme == ATH_BTCOEX_CFG_3WIRE) in ath9k_deinit_btcoex()
A Dbtcoex.h108 enum ath_btcoex_scheme scheme; member
/linux/Documentation/admin-guide/mm/damon/
A Dusage.rst137 size of regions that each scheme is applied. This statistics can be used for
141 debugfs file. Reading the file also shows the statistics of each scheme. To
161 example, below commands applies a scheme saying "If a memory region of size in
163 interval in [10, 20], page out the region", check the entered scheme again, and
164 finally remove the scheme. ::
173 the total size of the regions that the scheme is applied.
/linux/Documentation/filesystems/ext4/
A Difork.rst36 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
A Dallocators.rst25 Under this scheme, when a file needs more blocks to absorb file writes,
51 this scheme evens out the loading on the block groups, though the author
/linux/Documentation/scsi/
A Daha152x.rst126 The BIOS uses a cylinder/head/sector addressing scheme (C/H/S)
127 scheme instead. DOS expects a BIOS or driver that understands this
135 geometry just to be able to support that addressing scheme. The geometry
145 Moreover there are certain limitations to the C/H/S addressing scheme,
/linux/Documentation/devicetree/bindings/mfd/
A Dqcom,spmi-pmic.txt4 PMICs. These PMICs use a QPNP scheme through SPMI interface.
5 QPNP is effectively a partitioning scheme for dividing the SPMI extended
/linux/Documentation/devicetree/bindings/power/reset/
A Dqnap-poweroff.txt8 Synology NAS devices use a similar scheme, but a different baud rate,
/linux/Documentation/devicetree/bindings/mtd/partitions/
A Dqcom,smem-part.yaml14 Memory (SMEM) based partition table scheme. The maximum partitions supported
/linux/Documentation/iio/
A Dep93xx_adc.rst15 Numbering scheme for channels 0..4 is defined in EP9301 and EP9302 datasheets.
/linux/Documentation/devicetree/bindings/firmware/
A Dnvidia,tegra186-bpmp.txt53 services. Put another way, the numbering scheme for I2C buses is distinct from
54 the numbering scheme for any other service the BPMP may provide (e.g. a future
/linux/drivers/iio/light/
A Disl29018.c224 static int isl29018_read_proximity_ir(struct isl29018_chip *chip, int scheme, in isl29018_read_proximity_ir() argument
235 scheme << ISL29018_CMD2_SCHEME_SHIFT); in isl29018_read_proximity_ir()
246 if (scheme == 1) { in isl29018_read_proximity_ir()
/linux/Documentation/filesystems/
A Ddirectory-locking.rst6 Locking scheme used for directory operations is based on two
65 If no directory is its own ancestor, the scheme above is deadlock-free.
136 While this locking scheme works for arbitrary DAGs, it relies on
/linux/fs/ext2/
A DKconfig28 groups beyond the owner/group/world scheme.

Completed in 86 milliseconds

12345678