/linux-6.12.1/drivers/media/platform/ti/omap3isp/ |
D | isppreview.c | 149 preview_config_luma_enhancement(struct isp_prev_device *prev, in preview_config_luma_enhancement() argument 152 struct isp_device *isp = to_isp_device(prev); in preview_config_luma_enhancement() 168 preview_enable_luma_enhancement(struct isp_prev_device *prev, bool enable) in preview_enable_luma_enhancement() argument 170 struct isp_device *isp = to_isp_device(prev); in preview_enable_luma_enhancement() 183 static void preview_enable_invalaw(struct isp_prev_device *prev, bool enable) in preview_enable_invalaw() argument 185 struct isp_device *isp = to_isp_device(prev); in preview_enable_invalaw() 198 static void preview_config_hmed(struct isp_prev_device *prev, in preview_config_hmed() argument 201 struct isp_device *isp = to_isp_device(prev); in preview_config_hmed() 213 static void preview_enable_hmed(struct isp_prev_device *prev, bool enable) in preview_enable_hmed() argument 215 struct isp_device *isp = to_isp_device(prev); in preview_enable_hmed() [all …]
|
/linux-6.12.1/block/ |
D | badblocks.c | 579 static bool can_merge_front(struct badblocks *bb, int prev, in can_merge_front() argument 585 if (BB_ACK(p[prev]) == bad->ack && in can_merge_front() 586 (s < BB_END(p[prev]) || in can_merge_front() 587 (s == BB_END(p[prev]) && (BB_LEN(p[prev]) < BB_MAX_LEN)))) in can_merge_front() 597 static int front_merge(struct badblocks *bb, int prev, struct badblocks_context *bad) in front_merge() argument 604 WARN_ON(s > BB_END(p[prev])); in front_merge() 606 if (s < BB_END(p[prev])) { in front_merge() 607 merged = min_t(sector_t, sectors, BB_END(p[prev]) - s); in front_merge() 609 merged = min_t(sector_t, sectors, BB_MAX_LEN - BB_LEN(p[prev])); in front_merge() 610 if ((prev + 1) < bb->count && in front_merge() [all …]
|
/linux-6.12.1/arch/powerpc/include/asm/ |
D | cmpxchg.h | 19 unsigned int prev, prev_mask, tmp, bitoff, off; \ 33 : "=&r" (prev), "=&r" (tmp), "+m" (*(u32*)p) \ 37 return prev >> bitoff; \ 44 unsigned int prev, prev_mask, tmp, bitoff, off; \ 66 : "=&r" (prev), "=&r" (tmp), "+m" (*(u32*)p) \ 70 return prev >> bitoff; \ 89 unsigned long prev; in __xchg_u8_local() local 95 : "=&r" (prev), "+m" (*(volatile unsigned char *)p) in __xchg_u8_local() 99 return prev; in __xchg_u8_local() 105 unsigned long prev; in __xchg_u8_relaxed() local [all …]
|
/linux-6.12.1/lib/ |
D | list_debug.c | 22 bool __list_add_valid_or_report(struct list_head *new, struct list_head *prev, in __list_add_valid_or_report() argument 25 if (CHECK_DATA_CORRUPTION(prev == NULL, in __list_add_valid_or_report() 29 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid_or_report() 31 prev, next->prev, next) || in __list_add_valid_or_report() 32 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid_or_report() 34 next, prev->next, prev) || in __list_add_valid_or_report() 35 CHECK_DATA_CORRUPTION(new == prev || new == next, 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() [all …]
|
D | list_sort.c | 62 a->prev = tail; in merge_final() 69 b->prev = tail; in merge_final() 91 b->prev = tail; in merge_final() 98 head->prev = tail; in merge_final() 190 if (list == head->prev) /* Zero or one elements */ in list_sort() 194 head->prev->next = NULL; in list_sort() 220 tail = &(*tail)->prev; in list_sort() 223 struct list_head *a = *tail, *b = a->prev; in list_sort() 227 a->prev = b->prev; in list_sort() 232 list->prev = pending; in list_sort() [all …]
|
/linux-6.12.1/drivers/dma-buf/ |
D | dma-fence-chain.c | 23 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() 42 struct dma_fence *prev, *replacement, *tmp; in dma_fence_chain_walk() local 50 while ((prev = dma_fence_chain_get_prev(chain))) { in dma_fence_chain_walk() 52 prev_chain = to_dma_fence_chain(prev); in dma_fence_chain_walk() 59 if (!dma_fence_is_signaled(prev)) in dma_fence_chain_walk() 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() [all …]
|
/linux-6.12.1/include/linux/ |
D | list.h | 38 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD() 54 struct list_head *prev, 66 struct list_head *prev, in __list_add_valid() argument 83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid() 88 ret &= __list_add_valid_or_report(new, prev, 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() 129 struct list_head *prev, in __list_add_valid() argument 147 struct list_head *prev, in __list_add() argument 150 if (!__list_add_valid(new, prev, next)) in __list_add() [all …]
|
/linux-6.12.1/include/asm-generic/ |
D | cmpxchg-local.h | 18 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() 33 if (prev == (old & 0xffffu)) in __generic_cmpxchg_local() 36 case 4: prev = *(u32 *)ptr; in __generic_cmpxchg_local() 37 if (prev == (old & 0xffffffffu)) in __generic_cmpxchg_local() 40 case 8: prev = *(u64 *)ptr; in __generic_cmpxchg_local() 41 if (prev == old) in __generic_cmpxchg_local() 48 return prev; in __generic_cmpxchg_local() [all …]
|
/linux-6.12.1/arch/mips/include/asm/ |
D | switch_to.h | 32 extern asmlinkage struct task_struct *resume(struct task_struct *prev, 52 #define __mips_mt_fpaff_switch_to(prev) \ argument 54 struct thread_info *__prev_ti = task_thread_info(prev); \ 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); \ [all …]
|
/linux-6.12.1/tools/testing/selftests/bpf/progs/ |
D | cpumask_failure.c | 123 struct bpf_cpumask *local, *prev; in BPF_PROG() local 129 prev = bpf_kptr_xchg(&global_mask, local); in BPF_PROG() 130 if (prev) { in BPF_PROG() 131 bpf_cpumask_release(prev); in BPF_PROG() 157 struct bpf_cpumask *local, *prev; in BPF_PROG() local 163 prev = bpf_kptr_xchg(&global_mask, local); 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 191 prev = bpf_kptr_xchg(&global_mask, curr); in BPF_PROG() [all …]
|
/linux-6.12.1/tools/include/linux/ |
D | list.h | 28 list->prev = list; in INIT_LIST_HEAD() 39 struct list_head *prev, in __list_add() argument 42 next->prev = new; in __list_add() 44 new->prev = prev; in __list_add() 45 prev->next = new; in __list_add() 49 struct list_head *prev, 77 __list_add(new, head->prev, head); in list_add_tail() 87 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument 89 next->prev = prev; in __list_del() 90 WRITE_ONCE(prev->next, next); in __list_del() [all …]
|
/linux-6.12.1/arch/s390/include/asm/ |
D | cmpxchg.h | 93 unsigned int prev, shift, mask; in __cmpxchg() local 114 : [prev] "=&d" (prev), in __cmpxchg() 120 return prev >> shift; in __cmpxchg() 123 unsigned int prev, shift, mask; in __cmpxchg() local 144 : [prev] "=&d" (prev), in __cmpxchg() 150 return prev >> shift; in __cmpxchg() 153 unsigned int prev = old; in __cmpxchg() local 157 : [prev] "+&d" (prev), in __cmpxchg() 161 return prev; in __cmpxchg() 164 unsigned long prev = old; in __cmpxchg() local [all …]
|
D | uaccess.h | 459 unsigned int prev, shift, mask, _old, _new; in __cmpxchg_user_key() local 486 EX_TABLE_UA_LOAD_REG(0b, 5b, %[rc], %[prev]) in __cmpxchg_user_key() 487 EX_TABLE_UA_LOAD_REG(1b, 5b, %[rc], %[prev]) in __cmpxchg_user_key() 488 EX_TABLE_UA_LOAD_REG(3b, 5b, %[rc], %[prev]) in __cmpxchg_user_key() 489 EX_TABLE_UA_LOAD_REG(4b, 5b, %[rc], %[prev]) in __cmpxchg_user_key() 491 [prev] "=&d" (prev), in __cmpxchg_user_key() 501 *(unsigned char *)uval = prev >> shift; in __cmpxchg_user_key() 507 unsigned int prev, shift, mask, _old, _new; in __cmpxchg_user_key() local 534 EX_TABLE_UA_LOAD_REG(0b, 5b, %[rc], %[prev]) in __cmpxchg_user_key() 535 EX_TABLE_UA_LOAD_REG(1b, 5b, %[rc], %[prev]) in __cmpxchg_user_key() [all …]
|
/linux-6.12.1/rust/kernel/ |
D | list.rs | 137 prev: *mut ListLinksFields, field 167 prev: ptr::null_mut(), in new() 225 prev: ptr::null_mut(), in new() 268 (*item).prev = item; in push_back() 274 let prev = unsafe { (*next).prev }; in push_back() localVariable 280 (*item).prev = prev; in push_back() 281 (*prev).next = item; in push_back() 282 (*next).prev = item; in push_back() 307 (*item).prev = item; in push_front() 312 let prev = unsafe { (*next).prev }; in push_front() localVariable [all …]
|
/linux-6.12.1/kernel/locking/ |
D | osq_lock.c | 16 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() 165 cmpxchg(&prev->next, node, NULL) == 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() [all …]
|
/linux-6.12.1/tools/power/cpupower/ |
D | cpupower-completion.sh | 10 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 58 local prev="${COMP_WORDS[COMP_CWORD-1]}" 60 case "$prev" in [all …]
|
/linux-6.12.1/tools/usb/usbip/libsrc/ |
D | list.h | 20 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() 70 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument 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() [all …]
|
/linux-6.12.1/arch/arm64/kvm/hyp/nvhe/ |
D | list_debug.c | 30 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.12.1/arch/riscv/include/asm/ |
D | atomic.h | 216 int prev, rc; local 218 _arch_atomic_fetch_add_unless(prev, rc, v->counter, a, u, "w"); 220 return prev; 227 s64 prev; in arch_atomic64_fetch_add_unless() local 230 _arch_atomic_fetch_add_unless(prev, rc, v->counter, a, u, "d"); in arch_atomic64_fetch_add_unless() 232 return prev; in arch_atomic64_fetch_add_unless() 254 int prev, rc; in arch_atomic_inc_unless_negative() local 256 _arch_atomic_inc_unless_negative(prev, rc, v->counter, "w"); in arch_atomic_inc_unless_negative() 258 return !(prev < 0); in arch_atomic_inc_unless_negative() 280 int prev, rc; in arch_atomic_dec_unless_positive() local [all …]
|
/linux-6.12.1/tools/lib/ |
D | list_sort.c | 60 a->prev = tail; in merge_final() 67 b->prev = tail; in merge_final() 80 b->prev = tail; in merge_final() 87 head->prev = tail; in merge_final() 179 if (list == head->prev) /* Zero or one elements */ in list_sort() 183 head->prev->next = NULL; in list_sort() 209 tail = &(*tail)->prev; in list_sort() 212 struct list_head *a = *tail, *b = a->prev; in list_sort() 216 a->prev = b->prev; in list_sort() 221 list->prev = pending; in list_sort() [all …]
|
/linux-6.12.1/fs/jffs2/ |
D | nodelist.c | 28 struct jffs2_full_dirent **prev = list; in jffs2_add_fd_to_list() local 32 while ((*prev) && (*prev)->nhash <= new->nhash) { in jffs2_add_fd_to_list() 33 if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) { in jffs2_add_fd_to_list() 35 if (new->version < (*prev)->version) { 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() 43 new->next = (*prev)->next; in jffs2_add_fd_to_list() 46 if ((*prev)->raw) in jffs2_add_fd_to_list() 47 jffs2_mark_node_obsolete(c, ((*prev)->raw)); in jffs2_add_fd_to_list() 48 jffs2_free_full_dirent(*prev); in jffs2_add_fd_to_list() [all …]
|
/linux-6.12.1/scripts/include/ |
D | list.h | 54 list->prev = list; in INIT_LIST_HEAD() 64 struct list_head *prev, in __list_add() argument 67 next->prev = new; in __list_add() 69 new->prev = prev; in __list_add() 70 prev->next = new; in __list_add() 96 __list_add(new, head->prev, head); in list_add_tail() 106 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument 108 next->prev = prev; in __list_del() 109 prev->next = next; in __list_del() 114 __list_del(entry->prev, entry->next); in __list_del_entry() [all …]
|
/linux-6.12.1/tools/firewire/ |
D | list.h | 3 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.12.1/drivers/gpu/drm/nouveau/nvkm/core/ |
D | mm.c | 53 struct nvkm_mm_node *prev = node(this, prev); in nvkm_mm_free() local 56 if (prev && prev->type == NVKM_MM_TYPE_NONE) { in nvkm_mm_free() 57 prev->length += this->length; in nvkm_mm_free() 59 kfree(this); this = prev; in nvkm_mm_free() 72 list_for_each_entry(prev, &mm->free, fl_entry) { in nvkm_mm_free() 73 if (this->offset < prev->offset) in nvkm_mm_free() 77 list_add_tail(&this->fl_entry, &prev->fl_entry); in nvkm_mm_free() 114 struct nvkm_mm_node *prev, *this, *next; in nvkm_mm_head() local 129 prev = node(this, prev); in nvkm_mm_head() 130 if (prev && prev->type != type) in nvkm_mm_head() [all …]
|
/linux-6.12.1/arch/powerpc/platforms/cell/spufs/ |
D | switch.c | 1775 static int quiece_spu(struct spu_state *prev, struct spu *spu) in quiece_spu() argument 1787 if (check_spu_isolate(prev, spu)) { /* Step 2. */ in quiece_spu() 1790 disable_interrupts(prev, spu); /* Step 3. */ in quiece_spu() 1791 set_watchdog_timer(prev, spu); /* Step 4. */ in quiece_spu() 1792 inhibit_user_access(prev, spu); /* Step 5. */ in quiece_spu() 1793 if (check_spu_isolate(prev, spu)) { /* Step 6. */ in quiece_spu() 1796 set_switch_pending(prev, spu); /* Step 7. */ in quiece_spu() 1797 save_mfc_cntl(prev, spu); /* Step 8. */ in quiece_spu() 1798 save_spu_runcntl(prev, spu); /* Step 9. */ in quiece_spu() 1799 save_mfc_sr1(prev, spu); /* Step 10. */ in quiece_spu() [all …]
|