/linux/ipc/ |
H A 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/tools/power/cpupower/lib/ |
H A 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 …]
|
H A 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/lib/ |
H A 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 …]
|
H A D | llist.c | 29 struct llist_node *first = READ_ONCE(head->first); in llist_add_batch() local 32 new_last->next = 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() 85 entry = smp_load_acquire(&head->first); in llist_del_first_this() 90 } while (!try_cmpxchg(&head->first, &entry, next)); in llist_del_first_this()
|
/linux/drivers/video/fbdev/core/ |
H A 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 …]
|
H A 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 …]
|
H A 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/kernel/bpf/ |
H A 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/fs/ |
H A 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/include/linux/ |
H A 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; \
|
H A D | list.h | 317 * @first: first entry to move 318 * @last: last entry to move, can be the same as first 320 * Move all entries between @first and including @last before @head. 324 struct list_head *first, in list_bulk_move_tail() argument 327 first->prev->next = last->next; in list_bulk_move_tail() 328 last->next->prev = first->prev; in list_bulk_move_tail() 330 head->prev->next = first; in list_bulk_move_tail() 331 first->prev = head->prev; in list_bulk_move_tail() 338 * list_is_first -- tests whether @list is the first entr 419 struct list_head *first; list_rotate_left() local 527 struct list_head *first = list->next; __list_splice() local 1031 struct hlist_node *first = h->first; hlist_add_head() local [all...] |
H A 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()
|
H A 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 …]
|
H A D | llist.h | 57 struct llist_node *first; member 73 list->first = NULL; in init_llist_head() 218 return READ_ONCE(head->first) == NULL; in llist_empty() 234 new_last->next = head->first; in __llist_add_batch() 235 head->first = new_first; in __llist_add_batch() 266 return xchg(&head->first, NULL); in llist_del_all() 271 struct llist_node *first = head->first; in __llist_del_all() local 273 head->first = NULL; in __llist_del_all() 274 return first; in __llist_del_all()
|
H A 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 WRITE_ONCE(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/kernel/trace/ |
H A D | rethook.c | 212 node = tsk->rethooks.first; in __rethook_find_ret_addr() 282 struct llist_node *first, *node = NULL; in rethook_trampoline_handler() local 305 first = current->rethooks.first; in rethook_trampoline_handler() 306 while (first) { in rethook_trampoline_handler() 307 rhn = container_of(first, struct rethook_node, llist); in rethook_trampoline_handler() 315 if (first == node) in rethook_trampoline_handler() 317 first = first->next; in rethook_trampoline_handler() 324 first = current->rethooks.first; in rethook_trampoline_handler() 325 current->rethooks.first = node->next; in rethook_trampoline_handler() 328 while (first) { in rethook_trampoline_handler() [all …]
|
/linux/tools/testing/selftests/bpf/ |
H A D | bpf_arena_list.h | 16 struct arena_list_node __arena *first; member 37 for (void * ___tmp = (pos = list_entry_safe((head)->first, \ 45 arena_list_node_t *first = h->first, * __arena *tmp; in list_add_head() local 47 cast_user(first); in list_add_head() 49 WRITE_ONCE(n->next, first); in list_add_head() 50 cast_kern(first); in list_add_head() 51 if (first) { in list_add_head() 54 WRITE_ONCE(first->pprev, tmp); in list_add_head() 57 WRITE_ONCE(h->first, n); in list_add_head() 59 tmp = &h->first; in list_add_head()
|
/linux/arch/alpha/lib/ |
H A 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/rust/kernel/ |
H A D | list.rs | 33 /// * If the list is empty, then `first` is null. Otherwise, `first` points at the `ListLinks` 34 /// field of the first element in the list. 39 first: *mut ListLinksFields, field 238 first: ptr::null_mut(), in new() 245 self.first.is_null() in is_empty() 262 if self.first.is_null() { in push_back() 263 self.first = item; in push_back() 271 let next = self.first; in push_back() 302 if self.first in push_front() [all...] |
/linux/tools/include/linux/ |
H A 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/io_uring/ |
H A D | slist.h | 7 for (pos = (head)->first; pos; pos = (pos)->next) 10 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next) 15 #define wq_list_empty(list) (READ_ONCE((list)->first) == NULL) 18 (list)->first = NULL; \ 37 if (!list->first) { in wq_list_add_tail() 39 WRITE_ONCE(list->first, node); in wq_list_add_tail() 49 node->next = list->first; in wq_list_add_head() 52 WRITE_ONCE(list->first, node); in wq_list_add_head() 61 WRITE_ONCE(list->first, last->next); in wq_list_cut() 74 to->next = list->first; in __wq_list_splice()
|
/linux/tools/testing/selftests/kvm/lib/ |
H A D | sparsebit.c | 1894 sparsebit_idx_t first, last; member 1907 if (ranges[i].first <= idx && idx <= ranges[i].last) in get_value() 1913 static void operate(int code, sparsebit_idx_t first, sparsebit_idx_t last) in operate() argument 1918 if (first < last) { in operate() 1919 num = last - first + 1; in operate() 1921 num = first - last + 1; in operate() 1922 first = last; in operate() 1923 last = first + num - 1; in operate() 1928 sparsebit_set(s, first); in operate() 1929 assert(sparsebit_is_set(s, first)); in operate() [all …]
|
/linux/drivers/net/wireguard/ |
H A D | send.c | 242 static void wg_packet_create_data_done(struct wg_peer *peer, struct sk_buff *first) in wg_packet_create_data_done() argument 249 skb_list_walk_safe(first, skb, next) { in wg_packet_create_data_done() 267 struct sk_buff *first; in wg_packet_tx_worker() local 269 while ((first = wg_prev_queue_peek(&peer->tx_queue)) != NULL && in wg_packet_tx_worker() 270 (state = atomic_read_acquire(&PACKET_CB(first)->state)) != in wg_packet_tx_worker() 273 keypair = PACKET_CB(first)->keypair; in wg_packet_tx_worker() 276 wg_packet_create_data_done(peer, first); in wg_packet_tx_worker() 278 kfree_skb_list(first); in wg_packet_tx_worker() 291 struct sk_buff *first, *skb, *next; in wg_packet_encrypt_worker() local 293 while ((first = ptr_ring_consume_bh(&queue->ring)) != NULL) { in wg_packet_encrypt_worker() [all …]
|
/linux/tools/perf/util/ |
H A D | evsel_fprintf.c | 20 static int comma_fprintf(FILE *fp, bool *first, const char *fmt, ...) in comma_fprintf() argument 25 if (!*first) { in comma_fprintf() 29 *first = false; in comma_fprintf() 45 bool first = true; in evsel__fprintf() local 70 __print_attr__fprintf, &first); in evsel__fprintf() 77 printed += comma_fprintf(fp, &first, " %s=%" PRIu64, in evsel__fprintf() 86 printed += comma_fprintf(fp, &first, " (not a tracepoint)"); in evsel__fprintf() 92 printed += comma_fprintf(fp, &first, " (no trace field)"); in evsel__fprintf() 96 printed += comma_fprintf(fp, &first, " trace_fields: %s", field->name); in evsel__fprintf() 100 printed += comma_fprintf(fp, &first, " in evsel__fprintf() 127 bool first = true; sample__fprintf_callchain() local [all...] |