| /Linux-v6.1/arch/x86/kvm/ |
| D | cpuid.h | 112 struct kvm_cpuid_entry2 *best; in guest_cpuid_is_amd_or_hygon() local
114 best = kvm_find_cpuid_entry(vcpu, 0); in guest_cpuid_is_amd_or_hygon()
115 return best && in guest_cpuid_is_amd_or_hygon()
116 (is_guest_vendor_amd(best->ebx, best->ecx, best->edx) || in guest_cpuid_is_amd_or_hygon()
117 is_guest_vendor_hygon(best->ebx, best->ecx, best->edx)); in guest_cpuid_is_amd_or_hygon()
122 struct kvm_cpuid_entry2 *best; in guest_cpuid_is_intel() local
124 best = kvm_find_cpuid_entry(vcpu, 0); in guest_cpuid_is_intel()
125 return best && is_guest_vendor_intel(best->ebx, best->ecx, best->edx); in guest_cpuid_is_intel()
130 struct kvm_cpuid_entry2 *best; in guest_cpuid_family() local
132 best = kvm_find_cpuid_entry(vcpu, 0x1); in guest_cpuid_family()
[all …]
|
| D | cpuid.c | 122 struct kvm_cpuid_entry2 *best; in kvm_check_cpuid() local
129 best = cpuid_entry2_find(entries, nent, 0x80000008, in kvm_check_cpuid()
131 if (best) { in kvm_check_cpuid()
132 int vaddr_bits = (best->eax & 0xff00) >> 8; in kvm_check_cpuid()
142 best = cpuid_entry2_find(entries, nent, 0xd, 0); in kvm_check_cpuid()
143 if (!best) in kvm_check_cpuid()
146 xfeatures = best->eax | ((u64)best->edx << 32); in kvm_check_cpuid()
223 struct kvm_cpuid_entry2 *best = kvm_find_kvm_cpuid_features(vcpu); in kvm_update_pv_runtime() local
229 if (best) in kvm_update_pv_runtime()
230 vcpu->arch.pv_cpuid.features = best->eax; in kvm_update_pv_runtime()
[all …]
|
| /Linux-v6.1/lib/raid6/ |
| D | algos.c | 127 const struct raid6_recov_calls *best; in raid6_choose_recov() local
129 for (best = NULL, algo = raid6_recov_algos; *algo; algo++) in raid6_choose_recov()
130 if (!best || (*algo)->priority > best->priority) in raid6_choose_recov()
132 best = *algo; in raid6_choose_recov()
134 if (best) { in raid6_choose_recov()
135 raid6_2data_recov = best->data2; in raid6_choose_recov()
136 raid6_datap_recov = best->datap; in raid6_choose_recov()
138 pr_info("raid6: using %s recovery algorithm\n", best->name); in raid6_choose_recov()
142 return best; in raid6_choose_recov()
151 const struct raid6_calls *best; in raid6_choose_gen() local
[all …]
|
| /Linux-v6.1/drivers/gpu/drm/nouveau/nvkm/subdev/bios/ |
| D | shadow.c | 180 }, *mthd, *best = NULL; in nvbios_shadow() local
193 best = mthd; in nvbios_shadow()
200 if (!best && (best = mthd)) { in nvbios_shadow()
206 if (!best->score) { in nvbios_shadow()
213 /* scan all potential bios sources, looking for best image */ in nvbios_shadow()
214 if (!best || !best->score) { in nvbios_shadow()
215 for (mthd = mthds, best = mthd; mthd->func; mthd++) { in nvbios_shadow()
216 if (!mthd->skip || best->score < mthd->skip) { in nvbios_shadow()
218 if (mthd->score > best->score) in nvbios_shadow()
219 best = mthd; in nvbios_shadow()
[all …]
|
| /Linux-v6.1/sound/pci/emu10k1/ |
| D | emu10k1_callback.c | 27 struct best_voice *best, int active_only);
83 struct best_voice best[V_END]; in snd_emu10k1_synth_get_voice() local
88 lookup_voices(emu, hw, best, 1); /* no OFF voices */ in snd_emu10k1_synth_get_voice()
90 if (best[i].voice >= 0) { in snd_emu10k1_synth_get_voice()
92 vp = &emu->voices[best[i].voice]; in snd_emu10k1_synth_get_voice()
205 * look up voice table - get the best voice in order of preference
210 struct best_voice *best, int active_only) in lookup_voices() argument
217 best[i].time = (unsigned int)-1; /* XXX MAX_?INT really */ in lookup_voices()
218 best[i].voice = -1; in lookup_voices()
222 * Go through them all and get a best one to use. in lookup_voices()
[all …]
|
| /Linux-v6.1/drivers/usb/core/ |
| D | generic.c | 61 struct usb_host_config *c, *best; in usb_choose_configuration() local
66 best = NULL; in usb_choose_configuration()
130 best = c; in usb_choose_configuration()
136 best = c; in usb_choose_configuration()
140 * because it can reassign best, which for audio devices in usb_choose_configuration()
156 best = c; in usb_choose_configuration()
168 best = c; in usb_choose_configuration()
174 else if (!best) in usb_choose_configuration()
175 best = c; in usb_choose_configuration()
183 if (best) { in usb_choose_configuration()
[all …]
|
| /Linux-v6.1/drivers/net/bonding/ |
| D | bond_3ad.c | 1560 * the current best, according to the ad_select policy.
1562 static struct aggregator *ad_agg_selection_test(struct aggregator *best, in ad_agg_selection_test() argument
1565 /* 0. If no best, select current. in ad_agg_selection_test()
1567 * 1. If the current agg is not individual, and the best is in ad_agg_selection_test()
1570 * 2. If current agg is individual and the best is not, keep best. in ad_agg_selection_test()
1572 * 3. Therefore, current and best are both individual or both not in ad_agg_selection_test()
1575 * 3a. If current agg partner replied, and best agg partner did not, in ad_agg_selection_test()
1578 * 3b. If current agg partner did not reply and best agg partner in ad_agg_selection_test()
1579 * did reply, keep best. in ad_agg_selection_test()
1581 * 4. Therefore, current and best both have partner replies or in ad_agg_selection_test()
[all …]
|
| /Linux-v6.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-v6.1/drivers/acpi/numa/ |
| D | hmat.c | 44 * selecting the best performing node.
531 static bool hmat_update_best(u8 type, u32 value, u32 *best) in hmat_update_best() argument
542 if (!*best || *best > value) { in hmat_update_best()
543 *best = value; in hmat_update_best()
550 if (!*best || *best < value) { in hmat_update_best()
551 *best = value; in hmat_update_best()
591 u32 best = 0; in hmat_register_target_initiators() local
598 * only that one. Otherwise, find the best performance attributes and in hmat_register_target_initiators()
631 best = 0; in hmat_register_target_initiators()
640 if (hmat_update_best(loc->hmat_loc->data_type, value, &best)) in hmat_register_target_initiators()
[all …]
|
| /Linux-v6.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-v6.1/include/linux/ |
| D | cpufreq.h | 813 int idx, best = -1; in cpufreq_table_find_index_al() local
821 best = idx; in cpufreq_table_find_index_al()
824 return best; in cpufreq_table_find_index_al()
835 int idx, best = -1; in cpufreq_table_find_index_dl() local
844 best = idx; in cpufreq_table_find_index_dl()
849 if (best == -1) in cpufreq_table_find_index_dl()
852 return best; in cpufreq_table_find_index_dl()
855 return best; in cpufreq_table_find_index_dl()
881 int idx, best = -1; in cpufreq_table_find_index_ah() local
890 best = idx; in cpufreq_table_find_index_ah()
[all …]
|
| /Linux-v6.1/drivers/md/ |
| D | dm-ps-queue-length.c | 193 struct path_info *pi = NULL, *best = NULL; in ql_select_path() local
202 if (!best || in ql_select_path()
203 (atomic_read(&pi->qlen) < atomic_read(&best->qlen))) in ql_select_path()
204 best = pi; in ql_select_path()
206 if (!atomic_read(&best->qlen)) in ql_select_path()
210 if (!best) in ql_select_path()
214 list_move_tail(&best->list, &s->valid_paths); in ql_select_path()
216 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-v6.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-v6.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-v6.1/drivers/video/fbdev/core/ |
| D | modedb.c | 648 u32 best, diff, tdiff; in fb_find_mode() local
771 best = -1; in fb_find_mode()
791 best = i; in fb_find_mode()
795 if (best != -1) { in fb_find_mode()
796 fb_try_mode(var, info, &db[best], bpp); in fb_find_mode()
801 best = -1; in fb_find_mode()
802 DPRINTK("Trying best-fit modes\n"); in fb_find_mode()
818 best = i; in fb_find_mode()
822 if (best != -1) { in fb_find_mode()
823 fb_try_mode(var, info, &db[best], bpp); in fb_find_mode()
[all …]
|
| /Linux-v6.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-v6.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-v6.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-v6.1/drivers/clk/ |
| 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-v6.1/scripts/ |
| D | kallsyms.c | 381 /* uncompress a compressed symbol. When this function is called, the best table
642 int i, best, bestprofit; in find_best_token() local
645 best = 0; in find_best_token()
649 best = i; in find_best_token()
653 return best; in find_best_token()
656 /* this is the core of the algorithm: calculate the "best" table */
659 int i, best; in optimize_result() local
669 /* find the token with the best profit value */ in optimize_result()
670 best = find_best_token(); in optimize_result()
671 if (token_profit[best] == 0) in optimize_result()
[all …]
|
| /Linux-v6.1/drivers/leds/ |
| D | leds-tca6507.c | 234 /* Best yet */ in choose_times()
398 * bank. If none perfect, choose best. Count in led_prepare()
402 int best = -1;/* full-on */ in led_prepare() local
414 best = i; in led_prepare()
420 best = i; in led_prepare()
423 if (best == -1) { in led_prepare()
424 /* Best brightness is full-on */ in led_prepare()
430 if (!tca->bank[best].level_use) in led_prepare()
431 set_level(tca, best, level); in led_prepare()
433 tca->bank[best].level_use++; in led_prepare()
[all …]
|
| /Linux-v6.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-v6.1/arch/parisc/ |
| D | Kconfig | 247 This lets you select the page size of the kernel. For best
248 performance, a page size of 16KB is recommended. For best
253 4KB For best 32bit compatibility
254 16KB For best performance
255 64KB For best performance, might give more overhead.
|
| /Linux-v6.1/drivers/crypto/qat/qat_common/ |
| D | qat_crypto.c | 56 unsigned long best = ~0; in qat_crypto_get_instance_node() local
66 if (best > ctr) { in qat_crypto_get_instance_node()
68 best = ctr; in qat_crypto_get_instance_node()
88 best = ~0; in qat_crypto_get_instance_node()
93 if (best > ctr) { in qat_crypto_get_instance_node()
95 best = ctr; in qat_crypto_get_instance_node()
|
