| /openbmc/linux/arch/x86/kvm/ |
| H A D | cpuid.h | 113 struct kvm_cpuid_entry2 *best; in guest_cpuid_is_amd_or_hygon() local
115 best = kvm_find_cpuid_entry(vcpu, 0); in guest_cpuid_is_amd_or_hygon()
116 return best && in guest_cpuid_is_amd_or_hygon()
117 (is_guest_vendor_amd(best->ebx, best->ecx, best->edx) || in guest_cpuid_is_amd_or_hygon()
118 is_guest_vendor_hygon(best->ebx, best->ecx, best->edx)); in guest_cpuid_is_amd_or_hygon()
123 struct kvm_cpuid_entry2 *best; in guest_cpuid_is_intel() local
125 best = kvm_find_cpuid_entry(vcpu, 0); in guest_cpuid_is_intel()
126 return best && is_guest_vendor_intel(best->ebx, best->ecx, best->edx); in guest_cpuid_is_intel()
141 struct kvm_cpuid_entry2 *best; in guest_cpuid_family() local
143 best = kvm_find_cpuid_entry(vcpu, 0x1); in guest_cpuid_family()
[all …]
|
| H A D | cpuid.c | 158 struct kvm_cpuid_entry2 *best; in kvm_check_cpuid() local
165 best = cpuid_entry2_find(entries, nent, 0x80000008, in kvm_check_cpuid()
167 if (best) { in kvm_check_cpuid()
168 int vaddr_bits = (best->eax & 0xff00) >> 8; in kvm_check_cpuid()
178 best = cpuid_entry2_find(entries, nent, 0xd, 0); in kvm_check_cpuid()
179 if (!best) in kvm_check_cpuid()
182 xfeatures = best->eax | ((u64)best->edx << 32); in kvm_check_cpuid()
261 struct kvm_cpuid_entry2 *best = kvm_find_kvm_cpuid_features(vcpu); in kvm_update_pv_runtime() local
267 if (best) in kvm_update_pv_runtime()
268 vcpu->arch.pv_cpuid.features = best->eax; in kvm_update_pv_runtime()
[all …]
|
| /openbmc/linux/lib/raid6/ |
| H A D | algos.c | 141 const struct raid6_recov_calls *best; in raid6_choose_recov() local
143 for (best = NULL, algo = raid6_recov_algos; *algo; algo++) in raid6_choose_recov()
144 if (!best || (*algo)->priority > best->priority) in raid6_choose_recov()
146 best = *algo; in raid6_choose_recov()
148 if (best) { in raid6_choose_recov()
149 raid6_2data_recov = best->data2; in raid6_choose_recov()
150 raid6_datap_recov = best->datap; in raid6_choose_recov()
152 pr_info("raid6: using %s recovery algorithm\n", best->name); in raid6_choose_recov()
156 return best; in raid6_choose_recov()
165 const struct raid6_calls *best; in raid6_choose_gen() local
[all …]
|
| /openbmc/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 …]
|
| /openbmc/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 …]
|
| /openbmc/openbmc/poky/meta/lib/oeqa/selftest/cases/ |
| H A D | tinfoil.py | 45 best = tinfoil.find_best_provider(testrecipe)
46 if not best:
48 rd = tinfoil.parse_recipe_file(best[3])
55 best = tinfoil.find_best_provider(testrecipe)
56 if not best:
58 rd = tinfoil.parse_recipe_file(best[3])
66 best = tinfoil.find_best_provider(testrecipe)
67 if not best:
69 rd = tinfoil.parse_recipe_file(best[3])
88 best = tinfoil.find_best_provider(testrecipe)
[all …]
|
| /openbmc/qemu/hw/intc/ |
| H A D | arm_gicv3.c | 225 /* If the best interrupt we just found would preempt whatever in gicv3_redist_update_noirqset()
226 * was the previous best interrupt before this update, then in gicv3_redist_update_noirqset()
227 * we know it's definitely the best one now. in gicv3_redist_update_noirqset()
229 * best, and the previous best is outside our range (or there was no in gicv3_redist_update_noirqset()
231 * we leave it as the best. in gicv3_redist_update_noirqset()
232 * Otherwise, we need to do a full update (because the previous best in gicv3_redist_update_noirqset()
234 * now be the new best one). in gicv3_redist_update_noirqset()
299 /* If the best interrupt we just found would preempt whatever in gicv3_update_noirqset()
300 * was the previous best interrupt before this update, then in gicv3_update_noirqset()
301 * we know it's definitely the best one now. in gicv3_update_noirqset()
[all …]
|
| /openbmc/linux/drivers/acpi/numa/ |
| H A 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 …]
|
| /openbmc/linux/drivers/usb/core/ |
| H A 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 …]
|
| /openbmc/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 …]
|
| /openbmc/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 …]
|
| /openbmc/linux/include/linux/ |
| H A D | cpufreq.h | 811 int idx, best = -1; in cpufreq_table_find_index_al() local
819 best = idx; in cpufreq_table_find_index_al()
822 return best; in cpufreq_table_find_index_al()
833 int idx, best = -1; in cpufreq_table_find_index_dl() local
842 best = idx; in cpufreq_table_find_index_dl()
847 if (best == -1) in cpufreq_table_find_index_dl()
850 return best; in cpufreq_table_find_index_dl()
853 return best; in cpufreq_table_find_index_dl()
879 int idx, best = -1; in cpufreq_table_find_index_ah() local
888 best = idx; in cpufreq_table_find_index_ah()
[all …]
|
| /openbmc/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()
|
| /openbmc/linux/drivers/net/bonding/ |
| H A D | bond_3ad.c | 1570 * the current best, according to the ad_select policy.
1572 static struct aggregator *ad_agg_selection_test(struct aggregator *best, in ad_agg_selection_test() argument
1575 /* 0. If no best, select current. in ad_agg_selection_test()
1577 * 1. If the current agg is not individual, and the best is in ad_agg_selection_test()
1580 * 2. If current agg is individual and the best is not, keep best. in ad_agg_selection_test()
1582 * 3. Therefore, current and best are both individual or both not in ad_agg_selection_test()
1585 * 3a. If current agg partner replied, and best agg partner did not, in ad_agg_selection_test()
1588 * 3b. If current agg partner did not reply and best agg partner in ad_agg_selection_test()
1589 * did reply, keep best. in ad_agg_selection_test()
1591 * 4. Therefore, current and best both have partner replies or in ad_agg_selection_test()
[all …]
|
| /openbmc/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()
|
| /openbmc/linux/lib/ |
| H A 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.
|
| /openbmc/linux/net/dccp/ |
| H A 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()
|
| /openbmc/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 …]
|
| /openbmc/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()
|
| /openbmc/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()
|
| /openbmc/linux/drivers/crypto/intel/qat/qat_common/ |
| H A 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()
|
| 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()
|
| /openbmc/qemu/docs/devel/migration/ |
| H A D | best-practices.rst | 2 Best practices
35 to hold the firmware and thus migration can fail. In practice it's best
45 In some cases it may be best to tie specific firmware versions to specific
|
| /openbmc/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()
|