| /linux-6.1.9/ipc/ |
| D | syscall.c | 20 int ksys_ipc(unsigned int call, int first, unsigned long second, in ksys_ipc() argument
30 return ksys_semtimedop(first, (struct sembuf __user *)ptr, in ksys_ipc()
34 return ksys_semtimedop(first, ptr, second, in ksys_ipc()
37 return compat_ksys_semtimedop(first, ptr, second, in ksys_ipc()
43 return ksys_semget(first, second, third); in ksys_ipc()
50 return ksys_old_semctl(first, second, third, arg); in ksys_ipc()
54 return ksys_msgsnd(first, (struct msgbuf __user *) ptr, in ksys_ipc()
67 return ksys_msgrcv(first, tmp.msgp, second, in ksys_ipc()
71 return ksys_msgrcv(first, in ksys_ipc()
76 return ksys_msgget((key_t) first, second); in ksys_ipc()
[all …]
|
| /linux-6.1.9/tools/power/cpupower/lib/ |
| D | cpufreq.c | 273 struct cpufreq_available_governors *first = NULL; in cpufreq_get_available_governors() local
295 first = malloc(sizeof(*first)); in cpufreq_get_available_governors()
296 if (!first) in cpufreq_get_available_governors()
298 current = first; in cpufreq_get_available_governors()
300 current->first = first; in cpufreq_get_available_governors()
313 return first; in cpufreq_get_available_governors()
316 while (first) { in cpufreq_get_available_governors()
317 current = first->next; in cpufreq_get_available_governors()
318 if (first->governor) in cpufreq_get_available_governors()
319 free(first->governor); in cpufreq_get_available_governors()
[all …]
|
| D | cpufreq.h | 20 struct cpufreq_available_governors *first; member
26 struct cpufreq_available_frequencies *first; member
33 struct cpufreq_affected_cpus *first; member
40 struct cpufreq_stats *first; member
117 struct cpufreq_available_governors *first);
131 struct cpufreq_available_frequencies *first);
137 struct cpufreq_available_frequencies *first);
149 void cpufreq_put_affected_cpus(struct cpufreq_affected_cpus *first);
161 void cpufreq_put_related_cpus(struct cpufreq_affected_cpus *first);
|
| /linux-6.1.9/lib/ |
| D | siphash.c | 116 u64 siphash_1u64(const u64 first, const siphash_key_t *key) in siphash_1u64() argument
119 v3 ^= first; in siphash_1u64()
122 v0 ^= first; in siphash_1u64()
133 u64 siphash_2u64(const u64 first, const u64 second, const siphash_key_t *key) in siphash_2u64() argument
136 v3 ^= first; in siphash_2u64()
139 v0 ^= first; in siphash_2u64()
155 u64 siphash_3u64(const u64 first, const u64 second, const u64 third, in siphash_3u64() argument
159 v3 ^= first; in siphash_3u64()
162 v0 ^= first; in siphash_3u64()
183 u64 siphash_4u64(const u64 first, const u64 second, const u64 third, in siphash_4u64() argument
[all …]
|
| D | llist.c | 29 struct llist_node *first; in llist_add_batch() local
32 new_last->next = first = READ_ONCE(head->first); in llist_add_batch()
33 } while (!try_cmpxchg(&head->first, &first, new_first)); in llist_add_batch()
35 return !first; in llist_add_batch()
57 entry = smp_load_acquire(&head->first); in llist_del_first()
62 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first()
|
| /linux-6.1.9/drivers/video/fbdev/core/ |
| D | sysfillrect.c | 28 unsigned long first, last; in bitfill_aligned() local
33 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_aligned()
39 first &= last; in bitfill_aligned()
40 *dst = comp(pat, *dst, first); in bitfill_aligned()
45 if (first!= ~0UL) { in bitfill_aligned()
46 *dst = comp(pat, *dst, first); in bitfill_aligned()
74 unsigned long first, last; in bitfill_unaligned() local
79 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_unaligned()
85 first &= last; in bitfill_unaligned()
86 *dst = comp(pat, *dst, first); in bitfill_unaligned()
[all …]
|
| D | syscopyarea.c | 31 unsigned long first, last; in bitcpy() local
35 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitcpy()
43 first &= last; in bitcpy()
44 *dst = comp(*src, *dst, first); in bitcpy()
48 if (first != ~0UL) { in bitcpy()
49 *dst = comp(*src, *dst, first); in bitcpy()
86 first &= last; in bitcpy()
89 *dst = comp(*src << left, *dst, first); in bitcpy()
92 *dst = comp(*src >> right, *dst, first); in bitcpy()
98 first); in bitcpy()
[all …]
|
| D | cfbfillrect.c | 38 unsigned long first, last; in bitfill_aligned() local
43 first = fb_shifted_pixels_mask_long(p, dst_idx, bswapmask); in bitfill_aligned()
49 first &= last; in bitfill_aligned()
50 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_aligned()
55 if (first!= ~0UL) { in bitfill_aligned()
56 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_aligned()
95 unsigned long first, last; in bitfill_unaligned() local
100 first = FB_SHIFT_HIGH(p, ~0UL, dst_idx); in bitfill_unaligned()
106 first &= last; in bitfill_unaligned()
107 FB_WRITEL(comp(pat, FB_READL(dst), first), dst); in bitfill_unaligned()
[all …]
|
| /linux-6.1.9/kernel/bpf/ |
| D | percpu_freelist.c | 18 head->first = NULL; in pcpu_freelist_init()
21 s->extralist.first = NULL; in pcpu_freelist_init()
33 node->next = head->first; in pcpu_freelist_push_node()
34 WRITE_ONCE(head->first, node); in pcpu_freelist_push_node()
129 if (!READ_ONCE(head->first)) in ___pcpu_freelist_pop()
132 node = head->first; in ___pcpu_freelist_pop()
134 WRITE_ONCE(head->first, node->next); in ___pcpu_freelist_pop()
142 if (!READ_ONCE(s->extralist.first)) in ___pcpu_freelist_pop()
145 node = s->extralist.first; in ___pcpu_freelist_pop()
147 WRITE_ONCE(s->extralist.first, node->next); in ___pcpu_freelist_pop()
[all …]
|
| /linux-6.1.9/io_uring/ |
| D | slist.h | 7 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
12 #define wq_list_empty(list) (READ_ONCE((list)->first) == NULL)
15 (list)->first = NULL; \
41 if (!list0->first) { in wq_list_merge()
42 ret = list1->first; in wq_list_merge()
44 ret = list0->first; in wq_list_merge()
45 list0->last->next = list1->first; in wq_list_merge()
56 if (!list->first) { in wq_list_add_tail()
58 WRITE_ONCE(list->first, node); in wq_list_add_tail()
68 node->next = list->first; in wq_list_add_head()
[all …]
|
| /linux-6.1.9/include/linux/ |
| D | list_nulls.h | 22 struct hlist_nulls_node *first; member
30 ((ptr)->first = (struct hlist_nulls_node *) NULLS_MARKER(nulls))
88 return is_a_nulls(READ_ONCE(h->first)); in hlist_nulls_empty()
94 struct hlist_nulls_node *first = h->first; in hlist_nulls_add_head() local
96 n->next = first; in hlist_nulls_add_head()
97 WRITE_ONCE(n->pprev, &h->first); in hlist_nulls_add_head()
98 h->first = n; in hlist_nulls_add_head()
99 if (!is_a_nulls(first)) in hlist_nulls_add_head()
100 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head()
128 for (pos = (head)->first; \
|
| D | rculist_bl.h | 15 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) != in hlist_bl_set_first_rcu()
17 rcu_assign_pointer(h->first, in hlist_bl_set_first_rcu()
24 ((unsigned long)rcu_dereference_check(h->first, hlist_bl_is_locked(h)) & ~LIST_BL_LOCKMASK); in hlist_bl_first_rcu()
74 struct hlist_bl_node *first; in hlist_bl_add_head_rcu() local
77 first = hlist_bl_first(h); in hlist_bl_add_head_rcu()
79 n->next = first; in hlist_bl_add_head_rcu()
80 if (first) in hlist_bl_add_head_rcu()
81 first->pprev = &n->next; in hlist_bl_add_head_rcu()
82 n->pprev = &h->first; in hlist_bl_add_head_rcu()
|
| D | llist.h | 57 struct llist_node *first; member
73 list->first = NULL; in init_llist_head()
191 return READ_ONCE(head->first) == NULL; in llist_empty()
207 new_last->next = head->first; in __llist_add_batch()
208 head->first = new_first; in __llist_add_batch()
239 return xchg(&head->first, NULL); in llist_del_all()
244 struct llist_node *first = head->first; in __llist_del_all() local
246 head->first = NULL; in __llist_del_all()
247 return first; in __llist_del_all()
|
| D | list.h | 243 struct list_head *first, in list_bulk_move_tail() argument
246 first->prev->next = last->next; in list_bulk_move_tail()
247 last->next->prev = first->prev; in list_bulk_move_tail()
249 head->prev->next = first; in list_bulk_move_tail()
250 first->prev = head->prev; in list_bulk_move_tail()
338 struct list_head *first; in list_rotate_left() local
341 first = head->next; in list_rotate_left()
342 list_move_tail(first, head); in list_rotate_left()
446 struct list_head *first = list->next; in __list_splice() local
449 first->prev = prev; in __list_splice()
[all …]
|
| D | list_bl.h | 35 struct hlist_bl_node *first; member
42 ((ptr)->first = NULL)
60 ((unsigned long)h->first & ~LIST_BL_LOCKMASK); in hlist_bl_first()
67 LIST_BL_BUG_ON(((unsigned long)h->first & LIST_BL_LOCKMASK) != in hlist_bl_set_first()
69 h->first = (struct hlist_bl_node *)((unsigned long)n | LIST_BL_LOCKMASK); in hlist_bl_set_first()
74 return !((unsigned long)READ_ONCE(h->first) & ~LIST_BL_LOCKMASK); in hlist_bl_empty()
80 struct hlist_bl_node *first = hlist_bl_first(h); in hlist_bl_add_head() local
82 n->next = first; in hlist_bl_add_head()
83 if (first) in hlist_bl_add_head()
84 first->pprev = &n->next; in hlist_bl_add_head()
[all …]
|
| D | rculist_nulls.h | 46 (*((struct hlist_nulls_node __rcu __force **)&(head)->first))
102 struct hlist_nulls_node *first = h->first; in hlist_nulls_add_head_rcu() local
104 n->next = first; in hlist_nulls_add_head_rcu()
105 WRITE_ONCE(n->pprev, &h->first); in hlist_nulls_add_head_rcu()
107 if (!is_a_nulls(first)) in hlist_nulls_add_head_rcu()
108 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head_rcu()
136 for (i = h->first; !is_a_nulls(i); i = i->next) in hlist_nulls_add_tail_rcu()
|
| /linux-6.1.9/fs/ |
| D | binfmt_script.c | 19 static inline const char *next_non_spacetab(const char *first, const char *last) in next_non_spacetab() argument
21 for (; first <= last; first++) in next_non_spacetab()
22 if (!spacetab(*first)) in next_non_spacetab()
23 return first; in next_non_spacetab()
26 static inline const char *next_terminator(const char *first, const char *last) in next_terminator() argument
28 for (; first <= last; first++) in next_terminator()
29 if (spacetab(*first) || !*first) in next_terminator()
30 return first; in next_terminator()
|
| /linux-6.1.9/kernel/trace/ |
| D | rethook.c | 204 node = tsk->rethooks.first; in __rethook_find_ret_addr()
274 struct llist_node *first, *node = NULL; in rethook_trampoline_handler() local
297 first = current->rethooks.first; in rethook_trampoline_handler()
298 while (first) { in rethook_trampoline_handler()
299 rhn = container_of(first, struct rethook_node, llist); in rethook_trampoline_handler()
306 if (first == node) in rethook_trampoline_handler()
308 first = first->next; in rethook_trampoline_handler()
315 first = current->rethooks.first; in rethook_trampoline_handler()
316 current->rethooks.first = node->next; in rethook_trampoline_handler()
319 while (first) { in rethook_trampoline_handler()
[all …]
|
| /linux-6.1.9/arch/alpha/lib/ |
| D | csum_partial_copy.c | 129 unsigned long first; in csum_partial_cfu_dest_aligned() local
134 if (__get_word(ldq_u, first,src)) in csum_partial_cfu_dest_aligned()
142 extql(first, soff, word); in csum_partial_cfu_dest_aligned()
145 extqh(second, soff, first); in csum_partial_cfu_dest_aligned()
147 word |= first; in csum_partial_cfu_dest_aligned()
148 first = second; in csum_partial_cfu_dest_aligned()
162 extql(first, soff, word); in csum_partial_cfu_dest_aligned()
163 extqh(second, soff, first); in csum_partial_cfu_dest_aligned()
164 word |= first; in csum_partial_cfu_dest_aligned()
243 unsigned long first; in csum_partial_cfu_unaligned() local
[all …]
|
| /linux-6.1.9/arch/loongarch/kernel/ |
| D | unwind_prologue.c | 18 else if (state->first) in unwind_get_return_address()
69 if (state->first) in unwind_by_prologue()
70 goto first; in unwind_by_prologue()
86 if (state->first) { in unwind_by_prologue()
88 goto first; in unwind_by_prologue()
93 if (state->first) in unwind_by_prologue()
94 state->first = false; in unwind_by_prologue()
100 first: in unwind_by_prologue()
101 state->first = false; in unwind_by_prologue()
123 state->first = true; in unwind_start()
[all …]
|
| /linux-6.1.9/tools/include/linux/ |
| D | list.h | 217 struct list_head *first; in list_rotate_left() local
220 first = head->next; in list_rotate_left()
221 list_move_tail(first, head); in list_rotate_left()
278 struct list_head *first = list->next; in __list_splice() local
281 first->prev = prev; in __list_splice()
282 prev->next = first; in __list_splice()
606 #define HLIST_HEAD_INIT { .first = NULL }
607 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }
608 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
622 return !h->first; in hlist_empty()
[all …]
|
| /linux-6.1.9/drivers/misc/lkdtm/ |
| D | heap.c | 193 u8 *first; in lkdtm_SLAB_INIT_ON_ALLOC() local
196 first = kmalloc(512, GFP_KERNEL); in lkdtm_SLAB_INIT_ON_ALLOC()
197 if (!first) { in lkdtm_SLAB_INIT_ON_ALLOC()
202 memset(first, 0xAB, 512); in lkdtm_SLAB_INIT_ON_ALLOC()
203 kfree(first); in lkdtm_SLAB_INIT_ON_ALLOC()
210 if (val != first) { in lkdtm_SLAB_INIT_ON_ALLOC()
225 u8 *first; in lkdtm_BUDDY_INIT_ON_ALLOC() local
228 first = (u8 *)__get_free_page(GFP_KERNEL); in lkdtm_BUDDY_INIT_ON_ALLOC()
229 if (!first) { in lkdtm_BUDDY_INIT_ON_ALLOC()
234 memset(first, 0xAB, PAGE_SIZE); in lkdtm_BUDDY_INIT_ON_ALLOC()
[all …]
|
| /linux-6.1.9/drivers/net/ethernet/ibm/ |
| D | ibmvnic.h | 248 u8 first; member
264 u8 first; member
291 u8 first; member
303 u8 first; member
311 u8 first; member
324 u8 first; member
340 u8 first; member
345 u8 first; member
360 u8 first; member
367 u8 first; member
[all …]
|
| /linux-6.1.9/tools/testing/selftests/kvm/lib/ |
| D | sparsebit.c | 1895 sparsebit_idx_t first, last; member
1908 if (ranges[i].first <= idx && idx <= ranges[i].last) in get_value()
1914 static void operate(int code, sparsebit_idx_t first, sparsebit_idx_t last) in operate() argument
1919 if (first < last) { in operate()
1920 num = last - first + 1; in operate()
1922 num = first - last + 1; in operate()
1923 first = last; in operate()
1924 last = first + num - 1; in operate()
1929 sparsebit_set(s, first); in operate()
1930 assert(sparsebit_is_set(s, first)); in operate()
[all …]
|
| /linux-6.1.9/tools/testing/radix-tree/ |
| D | regression3.c | 36 bool first; in regression3_test() local
43 first = true; in regression3_test()
46 if (first) { in regression3_test()
49 first = false; in regression3_test()
59 first = true; in regression3_test()
62 if (first) { in regression3_test()
64 first = false; in regression3_test()
|