| /linux-6.12.1/lib/raid6/ |
| D | algos.c | 137 const struct raid6_recov_calls *best; in raid6_choose_recov() local
139 for (best = NULL, algo = raid6_recov_algos; *algo; algo++) in raid6_choose_recov()
140 if (!best || (*algo)->priority > best->priority) in raid6_choose_recov()
142 best = *algo; in raid6_choose_recov()
144 if (best) { in raid6_choose_recov()
145 raid6_2data_recov = best->data2; in raid6_choose_recov()
146 raid6_datap_recov = best->datap; in raid6_choose_recov()
148 pr_info("raid6: using %s recovery algorithm\n", best->name); in raid6_choose_recov()
152 return best; in raid6_choose_recov()
161 const struct raid6_calls *best; in raid6_choose_gen() local
[all …]
|
| /linux-6.12.1/drivers/gpu/drm/nouveau/nvkm/subdev/bios/ |
| 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-6.12.1/sound/pci/emu10k1/ |
| 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-6.12.1/arch/x86/kvm/ |
| D | cpuid.h | 117 struct kvm_cpuid_entry2 *best; in guest_cpuid_family() local
119 best = kvm_find_cpuid_entry(vcpu, 0x1); in guest_cpuid_family()
120 if (!best) in guest_cpuid_family()
123 return x86_family(best->eax); in guest_cpuid_family()
128 struct kvm_cpuid_entry2 *best; in guest_cpuid_model() local
130 best = kvm_find_cpuid_entry(vcpu, 0x1); in guest_cpuid_model()
131 if (!best) in guest_cpuid_model()
134 return x86_model(best->eax); in guest_cpuid_model()
144 struct kvm_cpuid_entry2 *best; in guest_cpuid_stepping() local
146 best = kvm_find_cpuid_entry(vcpu, 0x1); in guest_cpuid_stepping()
[all …]
|
| D | cpuid.c | 137 struct kvm_cpuid_entry2 *best; in kvm_check_cpuid() local
144 best = cpuid_entry2_find(entries, nent, 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 = cpuid_entry2_find(entries, nent, 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()
247 struct kvm_cpuid_entry2 *best = kvm_find_kvm_cpuid_features(vcpu); in kvm_update_pv_runtime() local
253 if (best) in kvm_update_pv_runtime()
254 vcpu->arch.pv_cpuid.features = best->eax; in kvm_update_pv_runtime()
[all …]
|
| /linux-6.12.1/fs/jffs2/ |
| 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-6.12.1/drivers/usb/core/ |
| D | generic.c | 61 struct usb_host_config *c, *best; in usb_choose_configuration() local
82 best = NULL; in usb_choose_configuration()
146 best = c; in usb_choose_configuration()
152 best = c; in usb_choose_configuration()
156 * because it can reassign best, which for audio devices in usb_choose_configuration()
172 best = c; in usb_choose_configuration()
184 best = c; in usb_choose_configuration()
190 else if (!best) in usb_choose_configuration()
191 best = c; in usb_choose_configuration()
199 if (best) { in usb_choose_configuration()
[all …]
|
| /linux-6.12.1/sound/isa/sb/ |
| 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-6.12.1/include/linux/ |
| D | cpufreq.h | 794 int idx, best = -1; in cpufreq_table_find_index_al() local
802 best = idx; in cpufreq_table_find_index_al()
805 return best; in cpufreq_table_find_index_al()
816 int idx, best = -1; in cpufreq_table_find_index_dl() local
825 best = idx; in cpufreq_table_find_index_dl()
830 if (best == -1) in cpufreq_table_find_index_dl()
833 return best; in cpufreq_table_find_index_dl()
836 return best; in cpufreq_table_find_index_dl()
862 int idx, best = -1; in cpufreq_table_find_index_ah() local
871 best = idx; in cpufreq_table_find_index_ah()
[all …]
|
| /linux-6.12.1/drivers/md/ |
| 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()
|
| 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()
|
| /linux-6.12.1/drivers/net/bonding/ |
| 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-6.12.1/arch/sh/kernel/ |
| 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-6.12.1/lib/ |
| D | win_minmax.c | 12 * The algorithm keeps track of the best, 2nd best & 3rd best min
14 * the n'th best >= n-1'th best. It also makes sure that the three
23 * holds for 2nd & 3rd best.
|
| /linux-6.12.1/drivers/video/fbdev/core/ |
| 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-6.12.1/net/dccp/ |
| D | qpolicy.c | 38 struct sk_buff *skb, *best = NULL; in qpolicy_prio_best_skb() local
41 if (best == NULL || skb->priority > best->priority) in qpolicy_prio_best_skb()
42 best = skb; in qpolicy_prio_best_skb()
43 return best; in qpolicy_prio_best_skb()
|
| /linux-6.12.1/drivers/clk/rockchip/ |
| 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-6.12.1/drivers/gpu/drm/ |
| 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-6.12.1/drivers/crypto/intel/qat/qat_common/ |
| 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()
|
| D | qat_compression.c | 53 unsigned long best = ~0; in qat_compression_get_instance_node() local
67 if (best > ctr) { in qat_compression_get_instance_node()
69 best = ctr; in qat_compression_get_instance_node()
92 best = ~0; in qat_compression_get_instance_node()
99 if (best > ctr) { in qat_compression_get_instance_node()
101 best = ctr; in qat_compression_get_instance_node()
|
| /linux-6.12.1/drivers/acpi/numa/ |
| D | hmat.c | 45 * selecting the best performing node.
669 static bool hmat_update_best(u8 type, u32 value, u32 *best) in hmat_update_best() argument
680 if (!*best || *best > value) { in hmat_update_best()
681 *best = value; in hmat_update_best()
688 if (!*best || *best < value) { in hmat_update_best()
689 *best = value; in hmat_update_best()
729 u32 best = 0; in hmat_update_target_attrs() local
745 * only that one. Otherwise, find the best performance attributes and in hmat_update_target_attrs()
775 best = 0; in hmat_update_target_attrs()
789 if (hmat_update_best(loc->hmat_loc->data_type, value, &best)) in hmat_update_target_attrs()
[all …]
|
| /linux-6.12.1/scripts/ |
| D | kallsyms.c | 295 /* uncompress a compressed symbol. When this function is called, the best table
588 int i, best, bestprofit; in find_best_token() local
591 best = 0; in find_best_token()
595 best = i; in find_best_token()
599 return best; in find_best_token()
602 /* this is the core of the algorithm: calculate the "best" table */
605 int i, best; in optimize_result() local
615 /* find the token with the best profit value */ in optimize_result()
616 best = find_best_token(); in optimize_result()
617 if (token_profit[best] == 0) in optimize_result()
[all …]
|
| /linux-6.12.1/drivers/clk/sophgo/ |
| 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-6.12.1/fs/reiserfs/ |
| D | README | 40 fair, ask. (Last I spoke with him Richard was contemplating how best
71 vendors. Select from the best in the world, not the best in your
89 writing the cleanest code. He always made the effort to be the best he
90 could be, and to make his code the best that it could be. What resulted
|
| /linux-6.12.1/Documentation/userspace-api/gpio/ |
| 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.
|