Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 1099) sorted by relevance

12345678910>>...44

/linux-6.15/block/
H A Dbadblocks.c570 p[prev] = BB_MAKE(BB_OFFSET(p[prev]), in front_merge()
617 memmove(p + prev, p + prev + 1, (bb->count - prev - 1) * 8); in front_combine()
725 p[prev] = BB_MAKE(BB_OFFSET(p[prev]), BB_LEN(p[prev]), in front_overwrite()
732 memmove(p + prev + 2, p + prev + 1, in front_overwrite()
746 memmove(p + prev + 2, p + prev + 1, in front_overwrite()
752 p[prev] = BB_MAKE(BB_OFFSET(p[prev]), in front_overwrite()
760 memmove(p + prev + 3, p + prev + 1, in front_overwrite()
830 memmove(p + prev + 1, p + prev + 2, in try_adjacent_combine()
1007 memmove(p + prev, p + prev + 1, in front_clear()
1040 p[prev] = BB_MAKE(BB_OFFSET(p[prev]), in front_splitting_clear()
[all …]
/linux-6.15/drivers/media/platform/ti/omap3isp/
H A Disppreview.c640 ? &prev->params.params[0] : &prev->params.params[1]; in preview_update_contrast()
662 ? &prev->params.params[0] : &prev->params.params[1]; in preview_update_brightness()
725 | (prev->params.params[1].update & prev->params.active); in preview_params_switch()
1046 ? &prev->params.params[0] : &prev->params.params[1]; in preview_config_input_format()
1067 unsigned int eph = prev->crop.left + prev->crop.width - 1; in preview_config_input_size()
1069 unsigned int elv = prev->crop.top + prev->crop.height - 1; in preview_config_input_size()
1231 prev->params.params[0].update = prev->params.active & update; in omap3isp_preview_restore_context()
1232 prev->params.params[1].update = ~prev->params.active & update; in omap3isp_preview_restore_context()
1234 preview_setup_hw(prev, update, prev->params.active); in omap3isp_preview_restore_context()
2309 prev->video_in.isp = to_isp_device(prev); in preview_init_entities()
[all …]
/linux-6.15/arch/powerpc/include/asm/
H A Dcmpxchg.h99 return prev; in __xchg_u8_local()
115 return prev; in __xchg_u8_relaxed()
131 return prev; in __xchg_u16_local()
147 return prev; in __xchg_u16_relaxed()
164 return prev; in __xchg_u32_local()
180 return prev; in __xchg_u32_relaxed()
197 return prev; in __xchg_u64_local()
213 return prev; in __xchg_u64_relaxed()
301 return prev; in __cmpxchg_u8()
321 return prev; in __cmpxchg_u8_local()
[all …]
/linux-6.15/lib/
H A Dlist_debug.c29 CHECK_DATA_CORRUPTION(next->prev != prev, next, in __list_add_valid_or_report()
31 prev, next->prev, next) || in __list_add_valid_or_report()
32 CHECK_DATA_CORRUPTION(prev->next != next, prev, in __list_add_valid_or_report()
34 next, prev->next, prev) || in __list_add_valid_or_report()
37 new, prev, next)) in __list_add_valid_or_report()
47 struct list_head *prev, *next; in __list_del_entry_valid_or_report() local
49 prev = entry->prev; in __list_del_entry_valid_or_report()
59 CHECK_DATA_CORRUPTION(prev == LIST_POISON2, prev, in __list_del_entry_valid_or_report()
62 CHECK_DATA_CORRUPTION(prev->next != entry, prev, in __list_del_entry_valid_or_report()
64 entry, prev->next, prev) || in __list_del_entry_valid_or_report()
[all …]
H A Dlist_sort.c59 a->prev = tail; in merge_final()
66 b->prev = tail; in merge_final()
88 b->prev = tail; in merge_final()
95 head->prev = tail; in merge_final()
198 head->prev->next = NULL; in list_sort()
224 tail = &(*tail)->prev; in list_sort()
227 struct list_head *a = *tail, *b = a->prev; in list_sort()
231 a->prev = b->prev; in list_sort()
236 list->prev = pending; in list_sort()
245 pending = pending->prev; in list_sort()
[all …]
/linux-6.15/drivers/dma-buf/
H A Ddma-fence-chain.c23 struct dma_fence *prev; in dma_fence_chain_get_prev() local
26 prev = dma_fence_get_rcu_safe(&chain->prev); in dma_fence_chain_get_prev()
28 return prev; in dma_fence_chain_get_prev()
65 tmp = unrcu_pointer(cmpxchg(&chain->prev, RCU_INITIALIZER(prev), in dma_fence_chain_walk()
67 if (tmp == prev) in dma_fence_chain_walk()
71 dma_fence_put(prev); in dma_fence_chain_walk()
75 return prev; in dma_fence_chain_walk()
186 while ((prev = rcu_dereference_protected(chain->prev, true))) { in dma_fence_chain_release()
199 chain->prev = prev_chain->prev; in dma_fence_chain_release()
203 dma_fence_put(prev); in dma_fence_chain_release()
[all …]
/linux-6.15/include/linux/
H A Dlist.h83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
111 struct list_head *prev = entry->prev; in __list_del_entry_valid() local
119 if (likely(prev->next == entry && next->prev == entry)) in __list_del_entry_valid()
155 new->prev = prev; in __list_add()
195 next->prev = prev; in __list_del()
246 new->prev = old->prev; in list_replace()
328 last->next->prev = first->prev; in list_bulk_move_tail()
331 first->prev = head->prev; in list_bulk_move_tail()
517 list->prev = entry->prev; in list_cut_before()
530 first->prev = prev; in __list_splice()
[all …]
H A Drculist.h25 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
94 new->prev = prev; in __list_add_rcu()
96 next->prev = new; in __list_add_rcu()
169 entry->prev = LIST_POISON2; in list_del_rcu()
248 new->prev = old->prev; in list_replace_rcu()
250 new->next->prev = new; in list_replace_rcu()
251 old->prev = LIST_POISON2; in list_replace_rcu()
274 struct list_head *prev, in __list_splice_init_rcu() argument
310 first->prev = prev; in __list_splice_init_rcu()
311 next->prev = last; in __list_splice_init_rcu()
[all …]
/linux-6.15/include/asm-generic/
H A Dcmpxchg-local.h18 unsigned long flags, prev; in __generic_cmpxchg_local() local
28 case 1: prev = *(u8 *)ptr; in __generic_cmpxchg_local()
29 if (prev == (old & 0xffu)) in __generic_cmpxchg_local()
32 case 2: prev = *(u16 *)ptr; in __generic_cmpxchg_local()
36 case 4: prev = *(u32 *)ptr; in __generic_cmpxchg_local()
41 if (prev == old) in __generic_cmpxchg_local()
48 return prev; in __generic_cmpxchg_local()
57 u64 prev; in __generic_cmpxchg64_local() local
61 prev = *(u64 *)ptr; in __generic_cmpxchg64_local()
62 if (prev == old) in __generic_cmpxchg64_local()
[all …]
/linux-6.15/arch/mips/include/asm/
H A Dswitch_to.h52 #define __mips_mt_fpaff_switch_to(prev) \ argument
58 (!(KSTK_STATUS(prev) & ST0_CU1))) { \
60 prev->cpus_mask = prev->thread.user_cpus_allowed; \
66 #define __mips_mt_fpaff_switch_to(prev) do { (void) (prev); } while (0) argument
109 #define switch_to(prev, next, last) \ argument
111 __mips_mt_fpaff_switch_to(prev); \
112 lose_fpu_inatomic(1, prev); \
116 __save_dsp(prev); \
123 if ((KSTK_STATUS(prev) & ST0_CU2)) { \
125 KSTK_STATUS(prev) &= ~ST0_CU2; \
[all …]
/linux-6.15/tools/include/linux/
H A Dlist.h28 list->prev = list; in INIT_LIST_HEAD()
42 next->prev = new; in __list_add()
44 new->prev = prev; in __list_add()
45 prev->next = new; in __list_add()
89 next->prev = prev; in __list_del()
128 new->prev = old->prev; in list_replace()
281 first->prev = prev; in __list_splice()
428 for (pos = (head)->prev; pos != (head); pos = pos->prev)
447 for (pos = (head)->prev, n = pos->prev; \
674 prev->next = n; in hlist_add_behind()
[all …]
/linux-6.15/kernel/locking/
H A Dosq_lock.c16 struct optimistic_spin_node *next, *prev; member
96 struct optimistic_spin_node *prev, *next; in osq_lock() local
114 prev = decode_cpu(old); in osq_lock()
115 node->prev = prev; in osq_lock()
129 WRITE_ONCE(prev->next, node); in osq_lock()
147 vcpu_is_preempted(node_cpu(node->prev)))) in osq_lock()
164 if (data_race(prev->next) == node && in osq_lock()
182 prev = READ_ONCE(node->prev); in osq_lock()
192 next = osq_wait_next(lock, node, prev->cpu); in osq_lock()
204 WRITE_ONCE(next->prev, prev); in osq_lock()
[all …]
/linux-6.15/arch/arm64/kvm/hyp/nvhe/
H A Dlist_debug.c30 bool __list_add_valid_or_report(struct list_head *new, struct list_head *prev, in __list_add_valid_or_report() argument
33 if (NVHE_CHECK_DATA_CORRUPTION(next->prev != prev) || in __list_add_valid_or_report()
34 NVHE_CHECK_DATA_CORRUPTION(prev->next != next) || in __list_add_valid_or_report()
35 NVHE_CHECK_DATA_CORRUPTION(new == prev || new == next)) in __list_add_valid_or_report()
44 struct list_head *prev, *next; in __list_del_entry_valid_or_report() local
46 prev = entry->prev; in __list_del_entry_valid_or_report()
50 NVHE_CHECK_DATA_CORRUPTION(prev == LIST_POISON2) || in __list_del_entry_valid_or_report()
51 NVHE_CHECK_DATA_CORRUPTION(prev->next != entry) || in __list_del_entry_valid_or_report()
52 NVHE_CHECK_DATA_CORRUPTION(next->prev != entry)) in __list_del_entry_valid_or_report()
/linux-6.15/tools/usb/usbip/libsrc/
H A Dlist.h20 struct list_head *next, *prev; member
31 list->prev = list; in INIT_LIST_HEAD()
41 struct list_head *prev, in __list_add() argument
44 next->prev = new; in __list_add()
46 new->prev = prev; in __list_add()
47 prev->next = new; in __list_add()
72 next->prev = prev; in __list_del()
73 prev->next = next; in __list_del()
82 __list_del(entry->prev, entry->next); in __list_del_entry()
93 __list_del(entry->prev, entry->next); in list_del()
[all …]
/linux-6.15/tools/power/cpupower/
H A Dcpupower-completion.sh10 local prev="${COMP_WORDS[COMP_CWORD-1]}"
12 case "$prev" in
20 local prev="${COMP_WORDS[COMP_CWORD-1]}"
22 case "$prev" in
38 local prev="${COMP_WORDS[COMP_CWORD-1]}"
40 case "$prev" in
48 local prev="${COMP_WORDS[COMP_CWORD-1]}"
50 case "$prev" in
60 case "$prev" in
70 case "$prev" in
[all …]
/linux-6.15/tools/testing/selftests/bpf/progs/
H A Dcpumask_failure.c130 if (prev) { in BPF_PROG()
131 bpf_cpumask_release(prev); in BPF_PROG()
164 if (prev) { in BPF_PROG()
165 bpf_cpumask_release(prev); in BPF_PROG()
185 struct bpf_cpumask *prev, *curr; in BPF_PROG() local
192 if (prev) in BPF_PROG()
193 bpf_cpumask_release(prev); in BPF_PROG()
200 if (prev) in BPF_PROG()
201 bpf_cpumask_release(prev); in BPF_PROG()
217 if (prev) { in BPF_PROG()
[all …]
/linux-6.15/tools/lib/
H A Dlist_sort.c58 a->prev = tail; in merge_final()
65 b->prev = tail; in merge_final()
78 b->prev = tail; in merge_final()
85 head->prev = tail; in merge_final()
181 head->prev->next = NULL; in list_sort()
207 tail = &(*tail)->prev; in list_sort()
210 struct list_head *a = *tail, *b = a->prev; in list_sort()
214 a->prev = b->prev; in list_sort()
219 list->prev = pending; in list_sort()
228 pending = pending->prev; in list_sort()
[all …]
/linux-6.15/arch/riscv/include/asm/
H A Datomic.h216 int prev, rc; local
220 return prev;
227 s64 prev; in arch_atomic64_fetch_add_unless() local
232 return prev; in arch_atomic64_fetch_add_unless()
254 int prev, rc; in arch_atomic_inc_unless_negative() local
280 int prev, rc; in arch_atomic_dec_unless_positive() local
310 return prev - 1; in arch_atomic_dec_if_positive()
318 s64 prev; in arch_atomic64_inc_unless_negative() local
330 s64 prev; in arch_atomic64_dec_unless_positive() local
342 s64 prev; in arch_atomic64_dec_if_positive() local
[all …]
/linux-6.15/arch/s390/include/asm/
H A Duaccess.h517 [prev] "=&d" (prev), in __cmpxchg_user_key()
565 [prev] "=&d" (prev), in __cmpxchg_user_key()
581 unsigned int prev = old; in __cmpxchg_user_key() local
592 [prev] "+&d" (prev), in __cmpxchg_user_key()
598 *(unsigned int *)uval = prev; in __cmpxchg_user_key()
602 unsigned long prev = old; in __cmpxchg_user_key() local
613 [prev] "+&d" (prev), in __cmpxchg_user_key()
619 *(unsigned long *)uval = prev; in __cmpxchg_user_key()
623 __uint128_t prev = old; in __cmpxchg_user_key() local
634 [prev] "+&d" (prev), in __cmpxchg_user_key()
[all …]
/linux-6.15/fs/jffs2/
H A Dnodelist.c32 while ((*prev) && (*prev)->nhash <= new->nhash) { in jffs2_add_fd_to_list()
37 (*prev)->name, (*prev)->ino); in jffs2_add_fd_to_list()
42 (*prev)->name, (*prev)->ino); in jffs2_add_fd_to_list()
53 prev = &((*prev)->next); in jffs2_add_fd_to_list()
56 *prev = new; in jffs2_add_fd_to_list()
448 while ((*prev) && (*prev)->ino < new->ino) { in jffs2_add_ino_cache()
449 prev = &(*prev)->next; in jffs2_add_ino_cache()
469 while ((*prev) && (*prev)->ino < old->ino) { in jffs2_del_ino_cache()
470 prev = &(*prev)->next; in jffs2_del_ino_cache()
541 if (!prev || frag->ofs > prev->ofs) in jffs2_lookup_node_frag()
[all …]
/linux-6.15/scripts/include/
H A Dlist.h54 list->prev = list; in INIT_LIST_HEAD()
67 next->prev = new; in __list_add()
69 new->prev = prev; in __list_add()
70 prev->next = new; in __list_add()
108 next->prev = prev; in __list_del()
109 prev->next = next; in __list_del()
127 entry->prev = LIST_POISON2; in list_del()
141 new->next->prev = new; in list_replace()
142 new->prev = old->prev; in list_replace()
143 new->prev->next = new; in list_replace()
[all …]
/linux-6.15/net/bridge/
H A Dbr_forward.c131 __br_forward(prev, skb, local_orig); in deliver_clone()
183 return prev; in maybe_deliver()
187 if (!prev) in maybe_deliver()
205 struct net_bridge_port *prev = NULL; in br_flood() local
237 prev = maybe_deliver(prev, p, skb, local_orig); in br_flood()
238 if (IS_ERR(prev)) { in br_flood()
245 if (!prev) in br_flood()
297 struct net_bridge_port *prev = NULL; in br_multicast_flood() local
336 prev = maybe_deliver(prev, port, skb, local_orig); in br_multicast_flood()
337 if (IS_ERR(prev)) { in br_multicast_flood()
[all …]
/linux-6.15/tools/firewire/
H A Dlist.h3 struct list *next, *prev; member
10 list->prev = list; in list_init()
22 new_link->prev = link->prev; in list_insert()
24 new_link->prev->next = new_link; in list_insert()
25 new_link->next->prev = new_link; in list_insert()
43 link->prev->next = link->next; in list_remove()
44 link->next->prev = link->prev; in list_remove()
54 list_entry((list)->prev, type, member)
/linux-6.15/rust/pin-init/examples/
H A Dlinked_list.rs25 prev: Link, field
35 prev: unsafe { Link::new_unchecked(this) }, in new()
43 prev: list.next.prev().replace(unsafe { Link::new_unchecked(this)}), in insert_next()
52 next: list.prev.next().replace(unsafe { Link::new_unchecked(this)}), in insert_prev()
53 prev: list.prev.replace(unsafe { Link::new_unchecked(this)}), in insert_prev()
85 let prev = unsafe { &*self.prev.as_ptr() }; in drop() localVariable
86 next.prev.set(&self.prev); in drop()
87 prev.next.set(&self.next); in drop()
114 fn prev(&self) -> &Link { in prev() method
115 unsafe { &(*self.0.get().as_ptr()).prev } in prev()
/linux-6.15/rust/kernel/
H A Dlist.rs140 prev: *mut ListLinksFields, field
283 (*item).prev = item; in insert_inner()
289 let prev = unsafe { (*next).prev }; in insert_inner() localVariable
295 (*item).prev = prev; in insert_inner()
296 (*prev).next = item; in insert_inner()
412 prev: *mut ListLinksFields, in remove_internal_inner()
424 (*next).prev = prev; in remove_internal_inner()
425 (*prev).next = next; in remove_internal_inner()
746 unsafe { (*next).prev } in prev_ptr()
768 if prev.is_null() { in peek_prev()
[all …]

12345678910>>...44