| /linux/drivers/clk/renesas/ |
| H A D | rzv2h-cpg-lib.c | 17 * rzv2h_cpg_get_pll_pars - Finds the best combination of PLL parameters
21 * @pars: Pointer to the structure where the best calculated PLL parameters values
25 * This function calculates the best set of PLL parameters (M, K, P, S) to achieve
29 * determine the best solution. The best solution is one that minimizes the error
40 struct rzv2h_pll_pars p, best; in rzv2h_cpg_get_pll_pars() local
46 /* Initialize best error to maximum possible value */ in rzv2h_cpg_get_pll_pars()
47 best.error_millihz = S64_MAX; in rzv2h_cpg_get_pll_pars()
152 /* Update best match if error is smaller */ in rzv2h_cpg_get_pll_pars()
153 if (abs(best.error_millihz) > abs(p.error_millihz)) in rzv2h_cpg_get_pll_pars()
154 best = p; in rzv2h_cpg_get_pll_pars()
[all …]
|
| /linux/drivers/gpu/drm/nouveau/nvkm/subdev/bios/ |
| H A D | shadow.c | 186 }, *mthd, *best = NULL; in nvbios_shadow() local
199 best = mthd; in nvbios_shadow()
206 if (!best && (best = mthd)) { in nvbios_shadow()
212 if (!best->score) { in nvbios_shadow()
219 /* scan all potential bios sources, looking for best image */ in nvbios_shadow()
220 if (!best || !best->score) { in nvbios_shadow()
221 for (mthd = mthds, best = mthd; mthd->func; mthd++) { in nvbios_shadow()
222 if (!mthd->skip || best->score < mthd->skip) { in nvbios_shadow()
224 if (mthd->score > best->score) in nvbios_shadow()
225 best = mthd; in nvbios_shadow()
[all …]
|
| /linux/sound/pci/emu10k1/ |
| H A D | emu10k1_callback.c | 27 struct best_voice *best, int active_only);
84 struct best_voice best[V_END]; in snd_emu10k1_synth_get_voice() local
89 lookup_voices(emu, hw, best, 1); /* no OFF voices */ in snd_emu10k1_synth_get_voice()
91 if (best[i].voice >= 0) { in snd_emu10k1_synth_get_voice()
93 vp = &emu->voices[best[i].voice]; in snd_emu10k1_synth_get_voice()
206 * look up voice table - get the best voice in order of preference
211 struct best_voice *best, int active_only) in lookup_voices() argument
218 best[i].time = (unsigned int)-1; /* XXX MAX_?INT really */ in lookup_voices()
219 best[i].voice = -1; in lookup_voices()
223 * Go through them all and get a best one to use. in lookup_voices()
[all …]
|
| /linux/fs/jffs2/ |
| H A D | compr.c | 35 struct jffs2_compressor *best, uint32_t size, uint32_t bestsize) in jffs2_is_best_compression() argument
45 if ((best->compr != JFFS2_COMPR_LZO) && (bestsize > size)) in jffs2_is_best_compression()
154 struct jffs2_compressor *this, *best=NULL; in jffs2_compress() local
210 if (((!best_dlen) || jffs2_is_best_compression(this, best, *cdatalen, best_dlen)) in jffs2_compress()
214 best = this; in jffs2_compress()
221 output_buf = best->compr_buf; in jffs2_compress()
222 best->compr_buf = NULL; in jffs2_compress()
223 best->compr_buf_size = 0; in jffs2_compress()
224 best->stat_compr_blocks++; in jffs2_compress()
225 best->stat_compr_orig_size += best_slen; in jffs2_compress()
[all …]
|
| /linux/drivers/net/bonding/ |
| H A D | bond_3ad.c | 1734 * the current best, according to the ad_select policy.
1736 static struct aggregator *ad_agg_selection_test(struct aggregator *best, in ad_agg_selection_test() argument
1739 /* 0. If no best, select current. in ad_agg_selection_test()
1741 * 1. If the current agg is not individual, and the best is in ad_agg_selection_test()
1744 * 2. If current agg is individual and the best is not, keep best. in ad_agg_selection_test()
1746 * 3. Therefore, current and best are both individual or both not in ad_agg_selection_test()
1749 * 3a. If current agg partner replied, and best agg partner did not, in ad_agg_selection_test()
1752 * 3b. If current agg partner did not reply and best agg partner in ad_agg_selection_test()
1753 * did reply, keep best. in ad_agg_selection_test()
1755 * 4. Therefore, current and best both have partner replies or in ad_agg_selection_test()
[all …]
|
| /linux/sound/isa/sb/ |
| H A D | emu8000_callback.c | 156 struct best { in get_voice() struct
159 } best[END]; in get_voice() local
160 struct best *bp; in get_voice()
165 best[i].time = (unsigned int)(-1); /* XXX MAX_?INT really */ in get_voice()
166 best[i].voice = -1; in get_voice()
170 * Go through them all and get a best one to use. in get_voice()
179 bp = best + OFF; in get_voice()
182 bp = best + RELEASED; in get_voice()
185 bp = best + OFF; in get_voice()
188 bp = best + PLAYING; in get_voice()
[all …]
|
| /linux/drivers/md/ |
| H A D | dm-ps-queue-length.c | 194 struct path_info *pi = NULL, *best = NULL; in ql_select_path() local
203 if (!best || in ql_select_path()
204 (atomic_read(&pi->qlen) < atomic_read(&best->qlen))) in ql_select_path()
205 best = pi; in ql_select_path()
207 if (!atomic_read(&best->qlen)) in ql_select_path()
211 if (!best) in ql_select_path()
215 list_move_tail(&best->list, &s->valid_paths); in ql_select_path()
217 ret = best->path; in ql_select_path()
|
| H A D | dm-ps-service-time.c | 280 struct path_info *pi = NULL, *best = NULL; in st_select_path() local
289 if (!best || (st_compare_load(pi, best, nr_bytes) < 0)) in st_select_path()
290 best = pi; in st_select_path()
292 if (!best) in st_select_path()
296 list_move_tail(&best->list, &s->valid_paths); in st_select_path()
298 ret = best->path; in st_select_path()
|
| H A D | dm-ps-historical-service-time.c | 13 * will never have the best estimated service time, or if the entire
434 struct path_info *pi = NULL, *best = NULL; in hst_select_path() local
444 if (!best || (hst_compare(pi, best, time_now, ps) < 0)) in hst_select_path()
445 best = pi; in hst_select_path()
448 if (!best) in hst_select_path()
452 list_move_tail(&best->list, &s->valid_paths); in hst_select_path()
454 ret = best->path; in hst_select_path()
|
| /linux/arch/sh/kernel/ |
| H A D | unwinder.c | 59 * select_unwinder - Select the best registered stack unwinder.
63 * Select the stack unwinder with the best rating. This is useful for
68 struct unwinder *best; in select_unwinder() local
73 best = list_entry(unwinder_list.next, struct unwinder, list); in select_unwinder()
74 if (best == curr_unwinder) in select_unwinder()
77 return best; in select_unwinder()
|
| /linux/net/dccp/ |
| H A D | qpolicy.c | |
| /linux/drivers/gpu/drm/ |
| H A D | drm_vma_manager.c | 137 * Returns NULL if no suitable node can be found. Otherwise, the best match
145 struct drm_mm_node *node, *best; in drm_vma_offset_lookup_locked() local
150 best = NULL; in drm_vma_offset_lookup_locked()
157 best = node; in drm_vma_offset_lookup_locked()
166 if (best) { in drm_vma_offset_lookup_locked()
167 offset = best->start + best->size; in drm_vma_offset_lookup_locked()
169 best = NULL; in drm_vma_offset_lookup_locked()
172 if (!best) in drm_vma_offset_lookup_locked()
175 return container_of(best, struct drm_vma_offset_node, vm_node); in drm_vma_offset_lookup_locked()
|
| /linux/drivers/clk/rockchip/ |
| H A D | clk-half-divider.c | 14 unsigned long best, unsigned long flags) in _is_best_half_div() argument
17 return abs(rate - now) < abs(rate - best); in _is_best_half_div()
19 return now <= rate && now > best; in _is_best_half_div()
40 unsigned long parent_rate, best = 0, now, maxdiv; in clk_half_divider_bestdiv() local
80 if (_is_best_half_div(rate, now, best, flags)) { in clk_half_divider_bestdiv()
82 best = now; in clk_half_divider_bestdiv()
|
| /linux/scripts/ |
| H A D | kallsyms.c | 287 /* uncompress a compressed symbol. When this function is called, the best table
549 int i, best, bestprofit; in find_best_token()
552 best = 0; in find_best_token()
556 best = i; in find_best_token()
560 return best; in optimize_result()
563 /* this is the core of the algorithm: calculate the "best" table */ in optimize_result()
566 int i, best; in optimize_result()
576 /* find the token with the best profit value */ in optimize_result()
577 best = find_best_token(); in optimize_result()
578 if (token_profit[best] in optimize_result()
545 int i, best, bestprofit; find_best_token() local
562 int i, best; optimize_result() local
[all...] |
| /linux/drivers/crypto/intel/qat/qat_common/ |
| H A D | qat_crypto.c | 55 unsigned long best = ~0; in qat_crypto_get_instance_node() local
65 if (best > ctr) { in qat_crypto_get_instance_node()
67 best = ctr; in qat_crypto_get_instance_node()
87 best = ~0; in qat_crypto_get_instance_node()
92 if (best > ctr) { in qat_crypto_get_instance_node()
94 best = ctr; in qat_crypto_get_instance_node()
|
| /linux/drivers/acpi/numa/ |
| H A D | hmat.c | 45 * selecting the best performing node.
683 static bool hmat_update_best(u8 type, u32 value, u32 *best) in hmat_update_best() argument
694 if (!*best || *best > value) { in hmat_update_best()
695 *best = value; in hmat_update_best()
702 if (!*best || *best < value) { in hmat_update_best()
703 *best = value; in hmat_update_best()
743 u32 best = 0; in hmat_update_target_attrs() local
755 * only that one. Otherwise, find the best performance attributes and in hmat_update_target_attrs()
785 best = 0; in hmat_update_target_attrs()
799 if (hmat_update_best(loc->hmat_loc->data_type, value, &best)) in hmat_update_target_attrs()
[all …]
|
| /linux/drivers/clk/sophgo/ |
| H A D | clk-sg2042-pll.c | 246 * @best: output to hold calculated combination of REFDIV/FBDIV/PSTDIV1/POSTDIV2
252 static int sg2042_get_pll_ctl_setting(struct sg2042_pll_ctrl *best, in sg2042_get_pll_ctl_setting() argument
272 memset(best, 0, sizeof(struct sg2042_pll_ctrl)); in sg2042_get_pll_ctl_setting()
305 if (abs_diff(foutpostdiv, req_rate) < abs_diff(best->freq, req_rate)) { in sg2042_get_pll_ctl_setting()
306 best->freq = foutpostdiv; in sg2042_get_pll_ctl_setting()
307 best->refdiv = refdiv; in sg2042_get_pll_ctl_setting()
308 best->fbdiv = fbdiv; in sg2042_get_pll_ctl_setting()
309 best->postdiv1 = postdiv1; in sg2042_get_pll_ctl_setting()
310 best->postdiv2 = postdiv2; in sg2042_get_pll_ctl_setting()
318 if (best->freq == 0) in sg2042_get_pll_ctl_setting()
|
| /linux/Documentation/userspace-api/gpio/ |
| H A D | gpio-get-linehandle-ioctl.rst | 90 - treat the feature as best effort
100 Bias best effort
105 Bias is treated as best effort to allow userspace to apply the same
116 emulated, or is best effort.
|
| H A D | gpio-v2-get-line-ioctl.rst | 107 - treat the feature as best effort
117 Bias best effort
124 Bias is treated as best effort to allow userspace to apply the same
143 emulated, or is best effort.
|
| /linux/drivers/clk/ |
| H A D | clk-multiplier.c | 57 unsigned long best, unsigned long flags) in __is_best_rate() argument
60 return abs(rate - new) < abs(rate - best); in __is_best_rate()
62 return new >= rate && new < best; in __is_best_rate()
93 * This is the best case for us if we have a in __bestmult()
|
| /linux/drivers/net/wireless/morsemicro/mm81x/ |
| H A D | mmrc.c | 161 /* EWMA percentage value for averaging the best rate probability variation */
173 /* If the best rate changes twice in this number of cycles, it is unstable */
177 * Once the best rate is unchanged for this number of cycles it has
461 * Assist the best rate by increasing the probability by the in calculate_throughput()
526 * Fill out the remaining rates to be used once the best rate is selected.
602 * rates up to the previous best rate. in generate_table_priority()
635 /* Drop one rate, as the best throughput is zero */ in generate_table_priority()
643 /* Increase the counter when the best rate is not changed */ in generate_table_priority()
646 /* Back off the counter when there is a new best rate */ in generate_table_priority()
665 * Best rate has changed twice in a few cycles in generate_table_priority()
[all …]
|
| /linux/drivers/clk/versatile/ |
| H A D | icst.c | 51 unsigned int i = 0, rd, best = (unsigned int)-1; in icst_hz_to_vco() local
90 if ((unsigned)f_diff < best) { in icst_hz_to_vco()
95 best = f_diff; in icst_hz_to_vco()
|
| /linux/sound/soc/codecs/ |
| H A D | wm8731.c | 72 int val, i, best; in wm8731_set_deemph()
78 best = 1; in wm8731_set_deemph()
81 abs(wm8731_deemph[best] - wm8731->playback_fs)) in wm8731_set_deemph()
82 best = i; in wm8731_set_deemph()
85 val = best << 1; in wm8731_set_deemph()
87 best = 0; in wm8731_set_deemph()
92 best, wm8731_deemph[best]); in wm8731_set_deemph()
71 int val, i, best; wm8731_set_deemph() local
|
| /linux/drivers/clk/qcom/ |
| H A D | clk-regmap-mux-div.c | 82 static inline bool is_better_rate(unsigned long req, unsigned long best, in is_better_rate() argument
85 return (req <= new && new < best) || (best < req && best < new); in is_better_rate()
|
| /linux/Documentation/process/ |
| H A D | 3.Early-stage.rst | 8 though, much of the groundwork for success is best laid before the first
130 the right maintainer. For mailing lists, the best approach is to look in
144 patches. Those are the people who will be best placed to help with a new
188 idea. The best thing to do in this situation is to proceed, keeping the
215 best option is often to hire an outside developer to review the plans under
|