Home
last modified time | relevance | path

Searched refs:available (Results 1 - 25 of 296) sorted by relevance

12345678910>>...12

/kernel/linux/linux-5.10/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dcommonring.c70 u16 available; in brcmf_commonring_write_available() local
75 available = commonring->depth - commonring->w_ptr + in brcmf_commonring_write_available()
78 available = commonring->r_ptr - commonring->w_ptr; in brcmf_commonring_write_available()
80 if (available > 1) { in brcmf_commonring_write_available()
83 if (available > commonring->depth / 8) { in brcmf_commonring_write_available()
111 u16 available; in brcmf_commonring_reserve_for_write() local
116 available = commonring->depth - commonring->w_ptr + in brcmf_commonring_reserve_for_write()
119 available = commonring->r_ptr - commonring->w_ptr; in brcmf_commonring_reserve_for_write()
121 if (available > 1) { in brcmf_commonring_reserve_for_write()
147 u16 available; in brcmf_commonring_reserve_for_write_multiple() local
[all...]
/kernel/linux/linux-6.6/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dcommonring.c70 u16 available; in brcmf_commonring_write_available() local
75 available = commonring->depth - commonring->w_ptr + in brcmf_commonring_write_available()
78 available = commonring->r_ptr - commonring->w_ptr; in brcmf_commonring_write_available()
80 if (available > 1) { in brcmf_commonring_write_available()
83 if (available > commonring->depth / 8) { in brcmf_commonring_write_available()
111 u16 available; in brcmf_commonring_reserve_for_write() local
116 available = commonring->depth - commonring->w_ptr + in brcmf_commonring_reserve_for_write()
119 available = commonring->r_ptr - commonring->w_ptr; in brcmf_commonring_reserve_for_write()
121 if (available > 1) { in brcmf_commonring_reserve_for_write()
147 u16 available; in brcmf_commonring_reserve_for_write_multiple() local
[all...]
/kernel/linux/linux-5.10/drivers/hv/
H A Dhv_trace_balloon.h10 TP_PROTO(u64 available, u64 committed,
15 TP_ARGS(available, committed, vm_memory_committed,
18 __field(u64, available)
26 __entry->available = available;
33 TP_printk("available %lld, committed %lld; vm_memory_committed %ld;"
35 __entry->available, __entry->committed,
/kernel/linux/linux-6.6/drivers/hv/
H A Dhv_trace_balloon.h10 TP_PROTO(u64 available, u64 committed,
15 TP_ARGS(available, committed, vm_memory_committed,
18 __field(u64, available)
26 __entry->available = available;
33 TP_printk("available %lld, committed %lld; vm_memory_committed %ld;"
35 __entry->available, __entry->committed,
/kernel/linux/linux-5.10/drivers/pci/hotplug/
H A Dcpqphp_nvram.c188 u32 available; in load_HRT() local
196 available = 1024; in load_HRT()
199 temp_dword = available; in load_HRT()
226 u32 available; in store_HRT() local
236 available = 1024; in store_HRT()
254 rc = add_byte(&pFill, 1 + ctrl->push_flag, &usedbytes, &available); in store_HRT()
259 rc = add_byte(&pFill, 1, &usedbytes, &available); in store_HRT()
269 rc = add_byte(&pFill, ctrl->bus, &usedbytes, &available); in store_HRT()
274 rc = add_byte(&pFill, PCI_SLOT(ctrl->pci_dev->devfn), &usedbytes, &available); in store_HRT()
279 rc = add_byte(&pFill, PCI_FUNC(ctrl->pci_dev->devfn), &usedbytes, &available); in store_HRT()
[all...]
/kernel/linux/linux-6.6/drivers/pci/hotplug/
H A Dcpqphp_nvram.c188 u32 available; in load_HRT() local
196 available = 1024; in load_HRT()
199 temp_dword = available; in load_HRT()
226 u32 available; in store_HRT() local
236 available = 1024; in store_HRT()
254 rc = add_byte(&pFill, 1 + ctrl->push_flag, &usedbytes, &available); in store_HRT()
259 rc = add_byte(&pFill, 1, &usedbytes, &available); in store_HRT()
269 rc = add_byte(&pFill, ctrl->bus, &usedbytes, &available); in store_HRT()
274 rc = add_byte(&pFill, PCI_SLOT(ctrl->pci_dev->devfn), &usedbytes, &available); in store_HRT()
279 rc = add_byte(&pFill, PCI_FUNC(ctrl->pci_dev->devfn), &usedbytes, &available); in store_HRT()
[all...]
/kernel/linux/linux-5.10/fs/ubifs/
H A Dbudget.c112 * as not available);
181 * The index head is not available for the in-the-gaps method, so add an in ubifs_calc_min_idx_lebs()
191 * ubifs_calc_available - calculate available FS space.
195 * This function calculates and returns amount of FS space available for use.
200 long long available; in ubifs_calc_available() local
202 available = c->main_bytes - c->lst.total_used; in ubifs_calc_available()
205 * Now 'available' contains theoretically available flash space in ubifs_calc_available()
223 available -= (long long)subtract_lebs * c->leb_size; in ubifs_calc_available()
225 /* Subtract the dead space which is not available fo in ubifs_calc_available()
295 long long outstanding, available; do_budget_space() local
668 long long available, outstanding, free; ubifs_get_free_space_nolock() local
[all...]
/kernel/linux/linux-6.6/fs/ubifs/
H A Dbudget.c109 * as not available);
178 * The index head is not available for the in-the-gaps method, so add an in ubifs_calc_min_idx_lebs()
188 * ubifs_calc_available - calculate available FS space.
192 * This function calculates and returns amount of FS space available for use.
197 long long available; in ubifs_calc_available() local
199 available = c->main_bytes - c->lst.total_used; in ubifs_calc_available()
202 * Now 'available' contains theoretically available flash space in ubifs_calc_available()
220 available -= (long long)subtract_lebs * c->leb_size; in ubifs_calc_available()
222 /* Subtract the dead space which is not available fo in ubifs_calc_available()
292 long long outstanding, available; do_budget_space() local
665 long long available, outstanding, free; ubifs_get_free_space_nolock() local
[all...]
/kernel/linux/linux-5.10/drivers/soc/fsl/dpio/
H A Dqbman-portal.c266 atomic_set(&p->vdq.available, 1); in qbman_swp_init()
356 p->eqcr.available = p->eqcr.pi_ring_size; in qbman_swp_init()
655 if (!s->eqcr.available) { in qbman_swp_enqueue_multiple_direct()
661 s->eqcr.available = qm_cyc_diff(s->eqcr.pi_ring_size, in qbman_swp_enqueue_multiple_direct()
663 if (!s->eqcr.available) { in qbman_swp_enqueue_multiple_direct()
670 num_enqueued = (s->eqcr.available < num_frames) ? in qbman_swp_enqueue_multiple_direct()
671 s->eqcr.available : num_frames; in qbman_swp_enqueue_multiple_direct()
672 s->eqcr.available -= num_enqueued; in qbman_swp_enqueue_multiple_direct()
739 if (!s->eqcr.available) { in qbman_swp_enqueue_multiple_mem_back()
743 s->eqcr.available in qbman_swp_enqueue_multiple_mem_back()
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/vboxvideo/
H A Dvbva_base.c66 u32 available; in vbva_write() local
75 available = vbva_buffer_available(vbva); in vbva_write()
80 if (chunk >= available) { in vbva_write()
82 available = vbva_buffer_available(vbva); in vbva_write()
85 if (chunk >= available) { in vbva_write()
86 if (WARN_ON(available <= vbva->partial_write_tresh)) { in vbva_write()
90 chunk = available - vbva->partial_write_tresh; in vbva_write()
99 available -= chunk; in vbva_write()
/kernel/linux/linux-6.6/drivers/gpu/drm/vboxvideo/
H A Dvbva_base.c66 u32 available; in vbva_write() local
75 available = vbva_buffer_available(vbva); in vbva_write()
80 if (chunk >= available) { in vbva_write()
82 available = vbva_buffer_available(vbva); in vbva_write()
85 if (chunk >= available) { in vbva_write()
86 if (WARN_ON(available <= vbva->partial_write_tresh)) { in vbva_write()
90 chunk = available - vbva->partial_write_tresh; in vbva_write()
99 available -= chunk; in vbva_write()
/kernel/linux/linux-5.10/kernel/irq/
H A Dmatrix.c14 unsigned int available; member
85 cm->available = m->alloc_size; in irq_matrix_online()
86 cm->available -= cm->managed + m->systembits_inalloc; in irq_matrix_online()
89 m->global_available += cm->available; in irq_matrix_online()
103 /* Update the global available size */ in irq_matrix_offline()
104 m->global_available -= cm->available; in irq_matrix_offline()
140 if (!cm->online || cm->available <= maxavl) in matrix_find_best_cpu()
144 maxavl = cm->available; in matrix_find_best_cpu()
223 cm->available--; in irq_matrix_reserve_managed()
273 cm->available in irq_matrix_remove_managed()
[all...]
/kernel/linux/linux-6.6/kernel/irq/
H A Dmatrix.c14 unsigned int available; member
85 cm->available = m->alloc_size; in irq_matrix_online()
86 cm->available -= cm->managed + m->systembits_inalloc; in irq_matrix_online()
89 m->global_available += cm->available; in irq_matrix_online()
103 /* Update the global available size */ in irq_matrix_offline()
104 m->global_available -= cm->available; in irq_matrix_offline()
140 if (!cm->online || cm->available <= maxavl) in matrix_find_best_cpu()
144 maxavl = cm->available; in matrix_find_best_cpu()
223 cm->available--; in irq_matrix_reserve_managed()
273 cm->available in irq_matrix_remove_managed()
[all...]
/kernel/linux/linux-5.10/include/trace/events/
H A Doom.h37 unsigned long available,
42 TP_ARGS(zoneref, order, reclaimable, available, min_wmark, no_progress_loops, wmark_check),
49 __field( unsigned long, available)
60 __entry->available = available;
66 TP_printk("node=%d zone=%-8s order=%d reclaimable=%lu available=%lu min_wmark=%lu no_progress_loops=%d wmark_check=%d",
69 __entry->reclaimable, __entry->available, __entry->min_wmark,
/kernel/linux/linux-6.6/include/trace/events/
H A Doom.h37 unsigned long available,
42 TP_ARGS(zoneref, order, reclaimable, available, min_wmark, no_progress_loops, wmark_check),
49 __field( unsigned long, available)
60 __entry->available = available;
66 TP_printk("node=%d zone=%-8s order=%d reclaimable=%lu available=%lu min_wmark=%lu no_progress_loops=%d wmark_check=%d",
69 __entry->reclaimable, __entry->available, __entry->min_wmark,
/kernel/linux/linux-5.10/arch/powerpc/mm/
H A Dslice.c139 const struct slice_mask *available, in slice_check_range_fits()
152 if ((low_slices & available->low_slices) != low_slices) in slice_check_range_fits()
162 if (!test_bit(i, available->high_slices)) in slice_check_range_fits()
258 * return boolean indicating if the slice is marked as available in the
259 * 'available' slice_mark.
262 const struct slice_mask *available, in slice_scan_available()
269 return !!(available->low_slices & (1u << slice)); in slice_scan_available()
274 return !!test_bit(slice, available->high_slices); in slice_scan_available()
280 const struct slice_mask *available, in slice_find_area_bottomup()
298 if (!slice_scan_available(addr, available, in slice_find_area_bottomup()
138 slice_check_range_fits(struct mm_struct *mm, const struct slice_mask *available, unsigned long start, unsigned long len) slice_check_range_fits() argument
261 slice_scan_available(unsigned long addr, const struct slice_mask *available, int end, unsigned long *boundary_addr) slice_scan_available() argument
278 slice_find_area_bottomup(struct mm_struct *mm, unsigned long len, const struct slice_mask *available, int psize, unsigned long high_limit) slice_find_area_bottomup() argument
324 slice_find_area_topdown(struct mm_struct *mm, unsigned long len, const struct slice_mask *available, int psize, unsigned long high_limit) slice_find_area_topdown() argument
773 struct slice_mask available; slice_is_hugepage_only_range() local
[all...]
/kernel/linux/linux-6.6/arch/powerpc/mm/book3s64/
H A Dslice.c139 const struct slice_mask *available, in slice_check_range_fits()
152 if ((low_slices & available->low_slices) != low_slices) in slice_check_range_fits()
162 if (!test_bit(i, available->high_slices)) in slice_check_range_fits()
258 * return boolean indicating if the slice is marked as available in the
259 * 'available' slice_mark.
262 const struct slice_mask *available, in slice_scan_available()
269 return !!(available->low_slices & (1u << slice)); in slice_scan_available()
274 return !!test_bit(slice, available->high_slices); in slice_scan_available()
280 const struct slice_mask *available, in slice_find_area_bottomup()
296 if (!slice_scan_available(addr, available, in slice_find_area_bottomup()
138 slice_check_range_fits(struct mm_struct *mm, const struct slice_mask *available, unsigned long start, unsigned long len) slice_check_range_fits() argument
261 slice_scan_available(unsigned long addr, const struct slice_mask *available, int end, unsigned long *boundary_addr) slice_scan_available() argument
278 slice_find_area_bottomup(struct mm_struct *mm, unsigned long addr, unsigned long len, const struct slice_mask *available, int psize, unsigned long high_limit) slice_find_area_bottomup() argument
322 slice_find_area_topdown(struct mm_struct *mm, unsigned long addr, unsigned long len, const struct slice_mask *available, int psize, unsigned long high_limit) slice_find_area_topdown() argument
773 struct slice_mask available; slice_is_hugepage_only_range() local
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_gtt_mgr.c105 atomic64_set(&mgr->available, gtt_size >> PAGE_SHIFT); in amdgpu_gtt_mgr_init()
187 atomic64_read(&mgr->available) < mem->num_pages) { in amdgpu_gtt_mgr_new()
191 atomic64_sub(mem->num_pages, &mgr->available); in amdgpu_gtt_mgr_new()
226 atomic64_add(mem->num_pages, &mgr->available); in amdgpu_gtt_mgr_new()
252 atomic64_add(mem->num_pages, &mgr->available); in amdgpu_gtt_mgr_del()
265 s64 result = man->size - atomic64_read(&mgr->available); in amdgpu_gtt_mgr_usage()
306 drm_printf(printer, "man size:%llu pages, gtt available:%lld pages, usage:%lluMB\n", in amdgpu_gtt_mgr_debug()
307 man->size, (u64)atomic64_read(&mgr->available), in amdgpu_gtt_mgr_debug()
/kernel/linux/linux-5.10/tools/testing/selftests/
H A Drun_kselftest.sh11 available=""
13 available="$(cat "$TESTS")"
26 -l | --list List the available collection:test entries
49 echo "$available"
66 found="$(echo "$available" | grep "^$collection:")"
74 # Replace available test list with explicitly selected tests.
78 found="$(echo "$available" | grep "^${test}$")"
85 available="$(echo "$valid" | sed -e 's/ /\n/g')"
88 collections=$(echo "$available" | cut -d: -f1 | uniq)
91 tests=$(echo "$available" | gre
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/
H A Drun_kselftest.sh11 available=""
13 available="$(cat "$TESTS")"
26 -l | --list List the available collection:test entries
51 echo "$available"
71 found="$(echo "$available" | grep "^$collection:")"
79 # Replace available test list with explicitly selected tests.
83 found="$(echo "$available" | grep "^${test}$")"
90 available="$(echo "$valid" | sed -e 's/ /\n/g')"
93 collections=$(echo "$available" | cut -d: -f1 | sort | uniq)
96 tests=$(echo "$available" | gre
[all...]
/kernel/linux/linux-5.10/arch/arm/mach-vexpress/
H A Dplatsmp.c33 * port control is available. in vexpress_smp_init_ops()
37 bool available; in vexpress_smp_init_ops() local
44 available = cci_node && of_device_is_available(cci_node); in vexpress_smp_init_ops()
48 if (!available) in vexpress_smp_init_ops()
/kernel/linux/linux-6.6/arch/arm/mach-versatile/
H A Dplatsmp-vexpress.c30 * port control is available. in vexpress_smp_init_ops()
34 bool available; in vexpress_smp_init_ops() local
41 available = cci_node && of_device_is_available(cci_node); in vexpress_smp_init_ops()
45 if (!available) in vexpress_smp_init_ops()
/kernel/linux/linux-5.10/include/linux/sched/
H A Disolation.h34 cpumask_t available; in housekeeping_any_cpu() local
37 cpumask_andnot(&available, cpu_online_mask, cpu_isolated_mask); in housekeeping_any_cpu()
38 cpu = cpumask_any(&available); in housekeeping_any_cpu()
/kernel/linux/linux-6.6/include/linux/sched/
H A Disolation.h35 cpumask_t available; in housekeeping_any_cpu() local
38 cpumask_andnot(&available, cpu_online_mask, cpu_isolated_mask); in housekeeping_any_cpu()
39 cpu = cpumask_any(&available); in housekeeping_any_cpu()
/kernel/linux/linux-5.10/net/xfrm/
H A Dxfrm_algo.c652 if (list[i].available) in xfrm_find_algo()
663 list[i].available = status; in xfrm_find_algo()
772 * Probe for the availability of crypto algorithms, and set the available
784 if (aalg_list[i].available != status) in xfrm_probe_algs()
785 aalg_list[i].available = status; in xfrm_probe_algs()
790 if (ealg_list[i].available != status) in xfrm_probe_algs()
791 ealg_list[i].available = status; in xfrm_probe_algs()
797 if (calg_list[i].available != status) in xfrm_probe_algs()
798 calg_list[i].available = status; in xfrm_probe_algs()
808 if (aalg_list[i].available in xfrm_count_pfkey_auth_supported()
[all...]

Completed in 14 milliseconds

12345678910>>...12