| /linux/lib/raid6/ |
| H A D | algos.c | 140 const struct raid6_recov_calls *best; in raid6_choose_recov() local
142 for (best = NULL, algo = raid6_recov_algos; *algo; algo++) in raid6_choose_recov()
143 if (!best || (*algo)->priority > best->priority) in raid6_choose_recov()
145 best = *algo; in raid6_choose_recov()
147 if (best) { in raid6_choose_recov()
148 raid6_2data_recov = best->data2; in raid6_choose_recov()
149 raid6_datap_recov = best->datap; in raid6_choose_recov()
151 pr_info("raid6: using %s recovery algorithm\n", best->name); in raid6_choose_recov()
155 return best; in raid6_choose_recov()
164 const struct raid6_calls *best; in raid6_choose_gen() local
[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/arch/x86/kvm/ |
| H A D | cpuid.h | 140 struct kvm_cpuid_entry2 *best; in guest_cpuid_family() local
142 best = kvm_find_cpuid_entry(vcpu, 0x1); in guest_cpuid_family()
143 if (!best) in guest_cpuid_family()
146 return x86_family(best->eax); in guest_cpuid_family()
151 struct kvm_cpuid_entry2 *best; in guest_cpuid_model() local
153 best = kvm_find_cpuid_entry(vcpu, 0x1); in guest_cpuid_model()
154 if (!best) in guest_cpuid_model()
157 return x86_model(best->eax); in guest_cpuid_model()
167 struct kvm_cpuid_entry2 *best; in guest_cpuid_stepping() local
169 best = kvm_find_cpuid_entry(vcpu, 0x1); in guest_cpuid_stepping()
[all …]
|
| H A D | cpuid.c | 138 struct kvm_cpuid_entry2 *best; in kvm_check_cpuid() local
145 best = kvm_find_cpuid_entry(vcpu, 0x80000008); in kvm_check_cpuid()
146 if (best) { in kvm_check_cpuid()
147 int vaddr_bits = (best->eax & 0xff00) >> 8; in kvm_check_cpuid()
157 best = kvm_find_cpuid_entry_index(vcpu, 0xd, 0); in kvm_check_cpuid()
158 if (!best) in kvm_check_cpuid()
161 xfeatures = best->eax | ((u64)best->edx << 32); in kvm_check_cpuid()
235 struct kvm_cpuid_entry2 *best; in kvm_apply_cpuid_pv_features_quirk() local
241 best = kvm_find_cpuid_entry(vcpu, kvm_cpuid.base | KVM_CPUID_FEATURES); in kvm_apply_cpuid_pv_features_quirk()
242 if (!best) in kvm_apply_cpuid_pv_features_quirk()
[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/include/linux/ |
| H A D | cpufreq.h | 810 int idx, best = -1; in cpufreq_table_find_index_al() local
818 best = idx; in cpufreq_table_find_index_al()
821 return best; in cpufreq_table_find_index_al()
832 int idx, best = -1; in cpufreq_table_find_index_dl() local
841 best = idx; in cpufreq_table_find_index_dl()
846 if (best == -1) in cpufreq_table_find_index_dl()
849 return best; in cpufreq_table_find_index_dl()
852 return best; in cpufreq_table_find_index_dl()
886 int idx, best = -1; in cpufreq_table_find_index_ah() local
895 best = idx; in cpufreq_table_find_index_ah()
[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/net/bonding/ |
| H A D | bond_3ad.c | 1670 * the current best, according to the ad_select policy.
1672 static struct aggregator *ad_agg_selection_test(struct aggregator *best, in ad_agg_selection_test() argument
1675 /* 0. If no best, select current. in ad_agg_selection_test()
1677 * 1. If the current agg is not individual, and the best is in ad_agg_selection_test()
1680 * 2. If current agg is individual and the best is not, keep best. in ad_agg_selection_test()
1682 * 3. Therefore, current and best are both individual or both not in ad_agg_selection_test()
1685 * 3a. If current agg partner replied, and best agg partner did not, in ad_agg_selection_test()
1688 * 3b. If current agg partner did not reply and best agg partner in ad_agg_selection_test()
1689 * did reply, keep best. in ad_agg_selection_test()
1691 * 4. Therefore, current and best both have partner replies or in ad_agg_selection_test()
[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/drivers/video/fbdev/core/ |
| H A D | modedb.c | 656 u32 best, diff, tdiff; in fb_find_mode() local
780 best = -1; in fb_find_mode()
800 best = i; in fb_find_mode()
804 if (best != -1) { in fb_find_mode()
805 fb_try_mode(var, info, &db[best], bpp); in fb_find_mode()
810 best = -1; in fb_find_mode()
811 DPRINTK("Trying best-fit modes\n"); in fb_find_mode()
827 best = i; in fb_find_mode()
831 if (best != -1) { in fb_find_mode()
832 fb_try_mode(var, info, &db[best], bpp); in fb_find_mode()
[all …]
|
| /linux/net/dccp/ |
| H A D | qpolicy.c | |
| /linux/drivers/gpu/drm/ |
| H A D | drm_vma_manager.c | 136 * Returns NULL if no suitable node can be found. Otherwise, the best match
144 struct drm_mm_node *node, *best; in drm_vma_offset_lookup_locked() local
149 best = NULL; in drm_vma_offset_lookup_locked()
156 best = node; in drm_vma_offset_lookup_locked()
165 if (best) { in drm_vma_offset_lookup_locked()
166 offset = best->start + best->size; in drm_vma_offset_lookup_locked()
168 best = NULL; in drm_vma_offset_lookup_locked()
171 if (!best) in drm_vma_offset_lookup_locked()
174 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/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/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/drivers/acpi/numa/ |
| H A D | hmat.c | 45 * selecting the best performing node.
713 static bool hmat_update_best(u8 type, u32 value, u32 *best) in hmat_update_best() argument
724 if (!*best || *best > value) { in hmat_update_best()
725 *best = value; in hmat_update_best()
732 if (!*best || *best < value) { in hmat_update_best()
733 *best = value; in hmat_update_best()
773 u32 best = 0; in hmat_update_target_attrs() local
789 * only that one. Otherwise, find the best performance attributes and in hmat_update_target_attrs()
819 best = 0; in hmat_update_target_attrs()
833 if (hmat_update_best(loc->hmat_loc->data_type, value, &best)) in hmat_update_target_attrs()
[all …]
|
| /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/kernel/bpf/ |
| H A D | range_tree.c | 15 * __find_range() performs binary search and best fit algorithm to find the
55 /* Find range that fits best to requested size */
59 struct range_node *best = NULL; in __find_range() local
65 best = rn; in __find_range()
72 return best; in __find_range()
|
| /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()
|