Home
last modified time | relevance | path

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

12345678910>>...33

/linux/drivers/media/platform/ti/omap3isp/
H A Disppreview.c149 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/block/
H A Dbadblocks.c579 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/arch/powerpc/include/asm/
H A Dcmpxchg.h19 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/lib/
H A Dlist_debug.c22 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, NULL, in __list_add_valid_or_report()
26 "list_add corruption. prev is NULL.\n") || in __list_add_valid_or_report()
29 CHECK_DATA_CORRUPTION(next->prev != prev, next, in __list_add_valid_or_report()
30 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", in __list_add_valid_or_report()
31 prev, next->prev, next) || in __list_add_valid_or_report()
32 CHECK_DATA_CORRUPTION(prev in __list_add_valid_or_report()
47 struct list_head *prev, *next; __list_del_entry_valid_or_report() local
[all...]
H A Dplist.c35 WARN(n->prev != p || p->next != n, in plist_check_prev_next()
39 t, t->next, t->prev, in plist_check_prev_next()
40 p, p->next, p->prev, in plist_check_prev_next()
41 n, n->next, n->prev); in plist_check_prev_next()
46 struct list_head *prev = top, *next = top->next; in plist_check_list() local
48 plist_check_prev_next(top, prev, next); in plist_check_list()
50 WRITE_ONCE(prev, next); in plist_check_list()
51 WRITE_ONCE(next, prev->next); in plist_check_list()
52 plist_check_prev_next(top, prev, next); in plist_check_list()
75 struct plist_node *first, *iter, *prev = NULL, *last, *reverse_iter; in plist_add() local
[all …]
/linux/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()
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/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()
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/tools/include/linux/
H A Dlist.h28 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/tools/testing/selftests/bpf/progs/
H A Dcpumask_failure.c123 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/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()
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/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
58 local prev="${COMP_WORDS[COMP_CWORD-1]}"
60 case "$prev" in
[all …]
/linux/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/arch/s390/include/asm/
H A Duaccess.h515 unsigned int prev, shift, mask, _old, _new; in __cmpxchg_user_key() local
542 EX_TABLE_UA_LOAD_REG(0b, 5b, %[rc], %[prev]) in __cmpxchg_user_key()
543 EX_TABLE_UA_LOAD_REG(1b, 5b, %[rc], %[prev]) in __cmpxchg_user_key()
544 EX_TABLE_UA_LOAD_REG(3b, 5b, %[rc], %[prev]) in __cmpxchg_user_key()
545 EX_TABLE_UA_LOAD_REG(4b, 5b, %[rc], %[prev]) in __cmpxchg_user_key()
547 [prev] "=&d" (prev), in __cmpxchg_user_key()
557 *(unsigned char *)uval = prev >> shift; in __cmpxchg_user_key()
563 unsigned int prev, shift, mask, _old, _new; in __cmpxchg_user_key() local
590 EX_TABLE_UA_LOAD_REG(0b, 5b, %[rc], %[prev]) in __cmpxchg_user_key()
591 EX_TABLE_UA_LOAD_REG(1b, 5b, %[rc], %[prev]) in __cmpxchg_user_key()
[all …]
/linux/fs/jffs2/
H A Dnodelist.c28 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/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()
177 if (list == head->prev) /* Zero or one elements */ in list_sort()
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()
[all …]
/linux/scripts/include/
H A Dlist.h54 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/include/linux/
H A Drculist.h25 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
43 #define list_bidir_prev_rcu(list) (*((struct list_head __rcu **)(&(list)->prev)))
53 #define list_tail_rcu(head) (*((struct list_head __rcu **)(&(head)->prev)))
88 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument
90 if (!__list_add_valid(new, prev, next)) in __list_add_rcu()
94 new->prev = prev; in __list_add_rcu()
95 rcu_assign_pointer(list_next_rcu(prev), new); in __list_add_rcu()
96 next->prev = new; in __list_add_rcu()
139 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
169 entry->prev = LIST_POISON2; in list_del_rcu()
[all …]
/linux/arch/powerpc/platforms/cell/spufs/
H A Dswitch.c1775 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 …]
/linux/drivers/gpu/drm/nouveau/nvkm/core/
H A Dmm.c53 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/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/arch/alpha/include/asm/
H A Dcmpxchg.h119 unsigned long prev, tmp, cmp, addr64; in ____cmpxchg_u8() local
136 : "=&r" (prev), "=&r" (new), "=&r" (tmp), "=&r" (cmp), "=&r" (addr64) in ____cmpxchg_u8()
139 return prev; in ____cmpxchg_u8()
145 unsigned long prev, tmp, cmp, addr64; in ____cmpxchg_u16() local
162 : "=&r" (prev), "=&r" (new), "=&r" (tmp), "=&r" (cmp), "=&r" (addr64) in ____cmpxchg_u16()
165 return prev; in ____cmpxchg_u16()
171 unsigned long prev, cmp; in ____cmpxchg_u32() local
184 : "=&r"(prev), "=&r"(cmp), "=m"(*m) in ____cmpxchg_u32()
187 return prev; in ____cmpxchg_u32()
193 unsigned long prev, cmp; in ____cmpxchg_u64() local
[all …]
/linux/samples/bpf/
H A Dxdp_sample_user.c652 struct record *rec, *prev; in stats_get_rx_cnt() local
657 prev = &stats_prev->rx_cnt; in stats_get_rx_cnt()
658 t = calc_period(rec, prev); in stats_get_rx_cnt()
662 struct datarec *p = &prev->cpu[i]; in stats_get_rx_cnt()
678 pps = calc_pps(&rec->total, &prev->total, t); in stats_get_rx_cnt()
679 drop = calc_drop_pps(&rec->total, &prev->total, t); in stats_get_rx_cnt()
680 err = calc_errs_pps(&rec->total, &prev->total, t); in stats_get_rx_cnt()
695 struct record *rec, *prev; in stats_get_cpumap_enqueue() local
702 prev = &stats_prev->enq[to_cpu]; in stats_get_cpumap_enqueue()
703 t = calc_period(rec, prev); in stats_get_cpumap_enqueue()
[all …]
/linux/drivers/net/fddi/skfp/
H A Dsmttimer.c33 struct smt_timer **prev ; in smt_timer_stop() local
43 for (prev = &smc->t.st_queue ; (tm = *prev) ; prev = &tm->tm_next ) { in smt_timer_stop()
45 *prev = tm->tm_next ; in smt_timer_stop()
57 struct smt_timer **prev ; in smt_timer_start() local
84 for (prev = &smc->t.st_queue ; (tm = *prev) ; prev = &tm->tm_next ) { in smt_timer_start()
91 *prev = timer ; in smt_timer_start()
/linux/arch/csky/include/asm/
H A Dswitch_to.h9 static inline void __switch_to_fpu(struct task_struct *prev, in __switch_to_fpu() argument
12 save_to_user_fp(&prev->thread.user_fp); in __switch_to_fpu()
16 static inline void __switch_to_fpu(struct task_struct *prev, in __switch_to_fpu() argument
27 #define switch_to(prev, next, last) \ argument
29 struct task_struct *__prev = (prev); \
32 ((last) = __switch_to((prev), (next))); \
/linux/sound/isa/gus/
H A Dgus_mem.c46 nblock->prev = pblock->prev; in snd_gf1_mem_xalloc()
48 pblock->prev = nblock; in snd_gf1_mem_xalloc()
52 nblock->prev->next = nblock; in snd_gf1_mem_xalloc()
60 nblock->prev = NULL; in snd_gf1_mem_xalloc()
63 nblock->prev = alloc->last; in snd_gf1_mem_xalloc()
80 block->next->prev = NULL; in snd_gf1_mem_xfree()
82 block->prev->next = block->next; in snd_gf1_mem_xfree()
84 block->next->prev = block->prev; in snd_gf1_mem_xfree()
87 alloc->last = block->prev; in snd_gf1_mem_xfree()
88 if (block->prev) in snd_gf1_mem_xfree()
[all …]

12345678910>>...33