| /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 | 291 struct cpufreq_available_governors *first = NULL; in cpufreq_get_available_governors() local 313 first = malloc(sizeof(*first)); in cpufreq_get_available_governors() 314 if (!first) in cpufreq_get_available_governors() 316 current = first; in cpufreq_get_available_governors() 318 current->first = first; in cpufreq_get_available_governors() 331 return first; in cpufreq_get_available_governors() 334 while (first) { in cpufreq_get_available_governors() 335 current = first->next; in cpufreq_get_available_governors() 336 if (first->governor) in cpufreq_get_available_governors() 337 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 125 struct cpufreq_available_governors *first); 139 struct cpufreq_available_frequencies *first); 145 struct cpufreq_available_frequencies *first); 157 void cpufreq_put_affected_cpus(struct cpufreq_affected_cpus *first); 169 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 …]
|
| /linux/include/linux/ |
| 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() 238 struct llist_node *first = READ_ONCE(head->first); in llist_add_batch() local 241 new_last->next = first; in llist_add_batch() 242 } while (!try_cmpxchg(&head->first, &first, new_first)); in llist_add_batch() 244 return !first; in llist_add_batch() 251 new_last->next = head->first; in __llist_add_batch() 252 head->first = new_first; in __llist_add_batch() 283 return xchg(&head->first, NULL); in llist_del_all() [all …]
|
| H A D | list_nulls.h | 22 struct hlist_nulls_node *first; member 30 ((ptr)->first = (struct hlist_nulls_node *) NULLS_MARKER(nulls)) 31 #define HLIST_NULLS_HEAD_INIT(nulls) {.first = (struct hlist_nulls_node *)NULLS_MARKER(nulls)} 89 return is_a_nulls(READ_ONCE(h->first)); in hlist_nulls_empty() 95 struct hlist_nulls_node *first = h->first; in hlist_nulls_add_head() local 97 n->next = first; in hlist_nulls_add_head() 98 WRITE_ONCE(n->pprev, &h->first); in hlist_nulls_add_head() 99 h->first = n; in hlist_nulls_add_head() 100 if (!is_a_nulls(first)) in hlist_nulls_add_head() 101 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head() [all …]
|
| H A D | list.h | 332 struct list_head *first, in list_bulk_move_tail() argument 335 first->prev->next = last->next; in list_bulk_move_tail() 336 last->next->prev = first->prev; in list_bulk_move_tail() 338 head->prev->next = first; in list_bulk_move_tail() 339 first->prev = head->prev; in list_bulk_move_tail() 427 struct list_head *first; in list_rotate_left() local 430 first = head->next; in list_rotate_left() 431 list_move_tail(first, head); in list_rotate_left() 535 struct list_head *first = list->next; in __list_splice() local 538 first->prev = prev; in __list_splice() [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 | 13 * For modification operations, the 0 bit of hlist_bl_head->first 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() [all...] |
| /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/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/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/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/drivers/video/fbdev/core/ |
| H A D | fb_copyarea.h | 54 unsigned long first, last; in fb_copy_aligned_fwd() local 56 first = fb_pixel_mask(dst->bits, reverse); in fb_copy_aligned_fwd() 62 last = last ? (last & first) : first; in fb_copy_aligned_fwd() 71 int offset = first != ~0UL; in fb_copy_aligned_fwd() 75 fb_copy_offset_masked(first, 0, dst, src); in fb_copy_aligned_fwd() 100 unsigned long first, last; in fb_copy_aligned_rev() local 102 first = fb_pixel_mask(dst->bits, reverse); in fb_copy_aligned_rev() 108 first &= last; in fb_copy_aligned_rev() 109 if (first == ~0UL) in fb_copy_aligned_rev() 112 fb_copy_offset_masked(first, 0, dst, src); in fb_copy_aligned_rev() [all …]
|
| H A D | fb_fillrect.h | 111 unsigned long first, last; in bitfill() local 114 first = fb_pixel_mask(dst->bits, pattern->reverse); in bitfill() 118 last = last ? (last & first) : first; in bitfill() 119 first = get(pattern); in bitfill() 121 fb_write_offset(first, 0, dst); in bitfill() 123 fb_modify_offset(first, last, 0, dst); in bitfill() 125 int offset = first != ~0UL; in bitfill() 128 fb_modify_offset(get(pattern), first, 0, dst); in bitfill() 159 unsigned long first, last; in bitinvert() local 163 first = fb_pixel_mask(dst->bits, pattern->reverse); in bitinvert() [all …]
|
| /linux/rust/kernel/ |
| H A D | list.rs | 264 first: *mut ListLinksFields, field 470 first: ptr::null_mut(), in new() 477 self.first.is_null() in is_empty() 514 self.first = item; in insert_inner() 538 unsafe { self.insert_inner(item, self.first) }; in push_back() 546 let new_elem = unsafe { self.insert_inner(item, self.first) }; in push_front() 549 self.first = new_elem; in push_front() 559 let last = unsafe { (*self.first).prev }; in pop_back() 571 Some(unsafe { self.remove_internal(self.first) }) in pop_front() 673 if self.first == item { in remove_internal_inner() [all …]
|
| /linux/tools/include/linux/ |
| H A D | list.h | 227 struct list_head *first; in list_rotate_left() local 230 first = head->next; in list_rotate_left() 231 list_move_tail(first, head); in list_rotate_left() 288 struct list_head *first = list->next; in __list_splice() local 291 first->prev = prev; in __list_splice() 292 prev->next = first; in __list_splice() 616 #define HLIST_HEAD_INIT { .first = NULL } 617 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL } 618 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL) 632 return !h->first; in hlist_empty() [all …]
|
| /linux/drivers/net/ethernet/ibm/ |
| H A D | ibmvnic.h | 254 u8 first; member 270 u8 first; member 297 u8 first; member 309 u8 first; member 317 u8 first; member 330 u8 first; member 346 u8 first; member 351 u8 first; member 366 u8 first; member 373 u8 first; member [all …]
|
| /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/crypto/marvell/cesa/ |
| H A D | tdma.c | 42 if (engine->chain_sw.first == dreq->chain.first) { in mv_cesa_dma_step() 43 engine->chain_sw.first = NULL; in mv_cesa_dma_step() 46 engine->chain_hw.first = dreq->chain.first; in mv_cesa_dma_step() 60 writel_relaxed(dreq->chain.first->cur_dma, in mv_cesa_dma_step() 71 for (tdma = dreq->chain.first; tdma;) { in mv_cesa_dma_cleanup() 84 dreq->chain.first = NULL; in mv_cesa_dma_cleanup() 93 for (tdma = dreq->chain.first; tdma; tdma = tdma->next) { in mv_cesa_dma_prepare() 114 if (!last || dreq->chain.first->flags & CESA_TDMA_SET_STATE) in mv_cesa_tdma_chain() 115 engine->chain_sw.first = dreq->chain.first; in mv_cesa_tdma_chain() 117 last->next = dreq->chain.first; in mv_cesa_tdma_chain() [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/drivers/net/ethernet/intel/ice/ |
| H A D | ice_txrx.c | 37 struct ice_tx_buf *tx_buf, *first; in ice_prgm_fdir_fltr() local 69 first = &tx_ring->tx_buf[i]; in ice_prgm_fdir_fltr() 101 first->next_to_watch = tx_desc; in ice_prgm_fdir_fltr() 1397 ice_tx_map(struct ice_tx_ring *tx_ring, struct ice_tx_buf *first, in ice_tx_map() argument 1413 skb = first->skb; in ice_tx_map() 1420 if (first->tx_flags & ICE_TX_FLAGS_HW_VLAN) { in ice_tx_map() 1422 td_tag = first->vid; in ice_tx_map() 1427 tx_buf = first; in ice_tx_map() 1491 skb_tx_timestamp(first->skb); in ice_tx_map() 1511 first->next_to_watch = tx_desc; in ice_tx_map() [all …]
|
| /linux/drivers/misc/lkdtm/ |
| H A D | heap.c | 253 u8 *first; in lkdtm_SLAB_INIT_ON_ALLOC() local 256 first = kmalloc(512, GFP_KERNEL); in lkdtm_SLAB_INIT_ON_ALLOC() 257 if (!first) { in lkdtm_SLAB_INIT_ON_ALLOC() 262 memset(first, 0xAB, 512); in lkdtm_SLAB_INIT_ON_ALLOC() 263 kfree(first); in lkdtm_SLAB_INIT_ON_ALLOC() 270 if (val != first) { in lkdtm_SLAB_INIT_ON_ALLOC() 285 u8 *first; in lkdtm_BUDDY_INIT_ON_ALLOC() local 288 first = (u8 *)__get_free_page(GFP_KERNEL); in lkdtm_BUDDY_INIT_ON_ALLOC() 289 if (!first) { in lkdtm_BUDDY_INIT_ON_ALLOC() 294 memset(first, 0xAB, PAGE_SIZE); in lkdtm_BUDDY_INIT_ON_ALLOC() [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() 87 printed += comma_fprintf(fp, &first, " (not a tracepoint)"); in evsel__fprintf() 94 printed += comma_fprintf(fp, &first, " (no trace field)"); in evsel__fprintf() 98 printed += comma_fprintf(fp, &first, " trace_fields: %s", field->name); in evsel__fprintf() 102 printed += comma_fprintf(fp, &first, "%s", field->name); in evsel__fprintf() [all …]
|
| /linux/tools/testing/radix-tree/ |
| H A 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()
|