/linux-master/arch/m68k/sun3/ |
H A D | sun3dvma.c | 75 struct list_head *cur; local 79 list_for_each(cur, holes) { 80 hole = list_entry(cur, struct hole, list); 98 struct list_head *cur; local 101 list_for_each(cur, &hole_list) { 102 hole = list_entry(cur, struct hole, list); 142 struct list_head *cur; local 154 list_for_each(cur, &hole_list) { 157 hole = list_entry(cur, struct hole, list); 195 struct list_head *cur; local [all...] |
/linux-master/net/core/ |
H A D | gso_test.c | 147 struct sk_buff *skb, *segs, *cur, *next, *last; local 236 for (cur = segs, i = 0; cur; cur = next, i++) { 237 next = cur->next; 239 KUNIT_ASSERT_EQ(test, cur->len, sizeof(hdr) + tcase->segs[i]); 242 KUNIT_ASSERT_PTR_EQ(test, skb_mac_header(cur), cur->data); 243 KUNIT_ASSERT_PTR_EQ(test, skb_network_header(cur), cur [all...] |
/linux-master/drivers/gpu/drm/omapdrm/ |
H A D | omap_overlay.c | 36 struct omap_hw_overlay *cur = priv->overlays[i]; local 38 DBG("%d: id: %d cur->caps: %x", 39 cur->idx, cur->id, cur->caps); 42 if (hwoverlay_to_plane[cur->idx]) 46 if (caps & ~cur->caps) 51 cur->id, fourcc)) 54 return cur;
|
/linux-master/drivers/cpufreq/ |
H A D | amd_freq_sensitivity.c | 63 freq_next = policy->cur; 72 freq_next = policy->cur; 83 if (data->freq_prev == policy->cur) 84 freq_next = policy->cur; 86 if (freq_next > policy->cur) 87 freq_next = policy->cur; 88 else if (freq_next < policy->cur) 94 policy->cur - 1,
|
/linux-master/fs/xfs/ |
H A D | xfs_trans_ail.c | 166 struct xfs_ail_cursor *cur) 168 cur->item = NULL; 169 list_add_tail(&cur->list, &ailp->ail_cursors); 179 struct xfs_ail_cursor *cur) 181 struct xfs_log_item *lip = cur->item; 186 cur->item = xfs_ail_next(ailp, lip); 196 struct xfs_ail_cursor *cur) 198 cur->item = NULL; 199 list_del_init(&cur->list); 215 struct xfs_ail_cursor *cur; local 164 xfs_trans_ail_cursor_init( struct xfs_ail *ailp, struct xfs_ail_cursor *cur) argument 177 xfs_trans_ail_cursor_next( struct xfs_ail *ailp, struct xfs_ail_cursor *cur) argument 195 xfs_trans_ail_cursor_done( struct xfs_ail_cursor *cur) argument 231 xfs_trans_ail_cursor_first( struct xfs_ail *ailp, struct xfs_ail_cursor *cur, xfs_lsn_t lsn) argument 278 xfs_trans_ail_cursor_last( struct xfs_ail *ailp, struct xfs_ail_cursor *cur, xfs_lsn_t lsn) argument 295 xfs_ail_splice( struct xfs_ail *ailp, struct xfs_ail_cursor *cur, struct list_head *list, xfs_lsn_t lsn) argument 422 struct xfs_ail_cursor cur; local [all...] |
H A D | xfs_trans_priv.h | 72 struct xfs_ail_cursor *cur, 111 struct xfs_ail_cursor *cur, 114 struct xfs_ail_cursor *cur, 117 struct xfs_ail_cursor *cur); 118 void xfs_trans_ail_cursor_done(struct xfs_ail_cursor *cur);
|
/linux-master/include/linux/ |
H A D | swap_slots.h | 15 struct mutex alloc_lock; /* protects slots, nr, cur */ 18 int cur; member in struct:swap_slots_cache
|
H A D | iversion.h | 144 u64 cur = inode_peek_iversion_raw(inode); local 147 if (cur > val) 149 } while (!atomic64_try_cmpxchg(&inode->i_version, &cur, val));
|
/linux-master/lib/ |
H A D | list-test.c | 387 struct list_head entries[3], *cur; local 400 list_for_each(cur, &list2) { 401 KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]); 407 list_for_each(cur, &list1) { 408 KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]); 415 struct list_head entries[3], *cur; local 428 list_for_each(cur, &list2) { 429 KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]); 435 list_for_each(cur, &list1) { 436 KUNIT_EXPECT_PTR_EQ(test, cur, 443 struct list_head entries[5], *cur; local 468 struct list_head entries[5], *cur; local 493 struct list_head entries[5], *cur; local 520 struct list_head entries[5], *cur; local 643 struct list_head entries[3], *cur; local 661 struct list_head entries[3], *cur; local 679 struct list_head entries[3], *cur, *n; local 700 struct list_head entries[3], *cur, *n; local 720 struct list_test_struct entries[5], *cur; local 741 struct list_test_struct entries[5], *cur; local 1030 struct hlist_node entries[3], *cur; local 1049 struct hlist_node entries[3], *cur, *n; local 1069 struct hlist_test_struct entries[5], *cur; local 1092 struct hlist_test_struct entries[5], *cur; local 1123 struct hlist_test_struct entries[5], *cur; local 1151 struct hlist_test_struct entries[5], *cur; local [all...] |
/linux-master/tools/testing/radix-tree/ |
H A D | main.c | 160 unsigned long start, end, count = 0, tagged, cur, tmp; local 167 cur = start; 169 end = cur; 173 cur = rand(); 174 if (cur & 1) { 176 if (cur & 2) { 182 if (cur & 4) { 184 if (cur & 8) 187 if (cur & 16) { 189 if (cur [all...] |
/linux-master/arch/loongarch/kernel/ |
H A D | kprobes.c | 128 static void post_kprobe_handler(struct kprobe *cur, struct kprobe_ctlblk *kcb, argument 132 if (cur->ainsn.restore != 0) 133 instruction_pointer_set(regs, cur->ainsn.restore); 143 * update the kcb status even if the cur->post_handler is 147 if (cur->post_handler) 148 cur->post_handler(cur, regs, 0); 272 struct kprobe *cur = kprobe_running(); local 276 if (cur && (kcb->kprobe_status & (KPROBE_HIT_SS | KPROBE_REENTER)) && 277 ((unsigned long)&cur 290 struct kprobe *cur = kprobe_running(); local [all...] |
/linux-master/arch/riscv/kernel/ |
H A D | vector.c | 152 static inline void riscv_v_ctrl_set(struct task_struct *tsk, int cur, int nxt, argument 157 ctrl = cur & PR_RISCV_V_VSTATE_CTRL_CUR_MASK; 214 int cur, next; local 222 cur = PR_RISCV_V_VSTATE_CTRL_ON; 224 cur = PR_RISCV_V_VSTATE_CTRL_OFF; 226 cur = next; 233 riscv_v_ctrl_set(tsk, cur, next, inherit); 247 int cur, next; local 255 cur = VSTATE_CTRL_GET_CUR(arg); 256 switch (cur) { [all...] |
/linux-master/drivers/net/wwan/t7xx/ |
H A D | t7xx_port_wwan.c | 58 struct sk_buff *cur = skb, *tx_skb; local 67 actual = cur->len; 74 skb_put_data(tx_skb, cur->data + offset, len); 93 struct sk_buff *cur = skb, *cloned; local 107 while (cur) { 108 cloned = skb_clone(cur, GFP_KERNEL); 109 cloned->len = skb_headlen(cur); 117 cnt += cur->len; 118 if (cur == skb) 119 cur [all...] |
/linux-master/net/netfilter/ |
H A D | nfnetlink_acct.c | 198 struct nf_acct *cur, *last; local 209 list_for_each_entry_rcu(cur, &nfnl_acct_net->nfnl_acct_list, head) { 211 if (cur != last) 217 if (filter && (cur->flags & filter->mask) != filter->value) 223 NFNL_MSG_ACCT_NEW, cur) < 0) { 224 cb->args[1] = (unsigned long)cur; 279 struct nf_acct *cur; local 297 list_for_each_entry(cur, &nfnl_acct_net->nfnl_acct_list, head) { 300 if (strncmp(cur->name, acct_name, NFACCT_NAME_MAX)!= 0) 312 NFNL_MSG_ACCT_NEW, cur); 326 nfnl_acct_try_del(struct nf_acct *cur) argument 347 struct nf_acct *cur, *tmp; local 420 struct nf_acct *cur, *acct = NULL; local 513 struct nf_acct *cur, *tmp; local [all...] |
H A D | nfnetlink_cthelper.c | 423 struct nf_conntrack_helper *cur, *helper = NULL; local 441 cur = &nlcth->helper; 443 if (strncmp(cur->name, helper_name, NF_CT_HELPER_NAME_LEN)) 446 if ((tuple.src.l3num != cur->tuple.src.l3num || 447 tuple.dst.protonum != cur->tuple.dst.protonum)) 453 helper = cur; 579 struct nf_conntrack_helper *cur, *last; local 585 hlist_for_each_entry_rcu(cur, 589 if (!(cur->flags & NF_CT_HELPER_F_USERSPACE)) 593 if (cur ! 620 struct nf_conntrack_helper *cur; local 685 struct nf_conntrack_helper *cur; local 789 struct nf_conntrack_helper *cur; local [all...] |
H A D | nf_conntrack_helper.c | 116 struct nf_conntrack_nat_helper *cur; local 119 list_for_each_entry_rcu(cur, &nf_ct_nat_helpers, list) { 120 if (!strcmp(cur->mod_name, mod_name)) { 125 return found ? cur : NULL; 290 struct nf_ct_helper_expectfn *cur; local 293 list_for_each_entry_rcu(cur, &nf_ct_helper_expectfn_list, head) { 294 if (!strcmp(cur->name, name)) { 299 return found ? cur : NULL; 307 struct nf_ct_helper_expectfn *cur; local 310 list_for_each_entry_rcu(cur, 351 struct nf_conntrack_helper *cur; local [all...] |
/linux-master/drivers/firmware/google/ |
H A D | memconsole-x86-legacy.c | 85 size_t length, cur; local 101 for (cur = 0; cur < length; cur++) { 102 struct biosmemcon_ebda *hdr = phys_to_virt(address + cur);
|
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_ialloc.h | 72 * Lookup a record by ino in the btree given by cur. 74 int xfs_inobt_lookup(struct xfs_btree_cur *cur, xfs_agino_t ino, 80 int xfs_inobt_get_rec(struct xfs_btree_cur *cur, 99 int xfs_ialloc_has_inodes_at_extent(struct xfs_btree_cur *cur, 102 int xfs_ialloc_count_inodes(struct xfs_btree_cur *cur, xfs_agino_t *count, 104 int xfs_inobt_insert_rec(struct xfs_btree_cur *cur, uint16_t holemask,
|
H A D | xfs_rmap.h | 125 int xfs_rmap_lookup_le(struct xfs_btree_cur *cur, xfs_agblock_t bno, 128 int xfs_rmap_lookup_eq(struct xfs_btree_cur *cur, xfs_agblock_t bno, 134 int xfs_rmap_get_rec(struct xfs_btree_cur *cur, struct xfs_rmap_irec *irec, 138 struct xfs_btree_cur *cur, 142 int xfs_rmap_query_range(struct xfs_btree_cur *cur, 146 int xfs_rmap_query_all(struct xfs_btree_cur *cur, xfs_rmap_query_range_fn fn, 194 int xfs_rmap_lookup_le_range(struct xfs_btree_cur *cur, xfs_agblock_t bno, 205 int xfs_rmap_has_records(struct xfs_btree_cur *cur, xfs_agblock_t bno, 219 int xfs_rmap_count_owners(struct xfs_btree_cur *cur, xfs_agblock_t bno, 222 int xfs_rmap_has_other_keys(struct xfs_btree_cur *cur, xfs_agblock_ [all...] |
/linux-master/drivers/infiniband/core/ |
H A D | umem_dmabuf.c | 19 unsigned long start, end, cur = 0; local 40 if (start < cur + sg_dma_len(sg) && cur < end) 42 if (cur <= start && start < cur + sg_dma_len(sg)) { 43 unsigned long offset = start - cur; 49 cur += offset; 51 if (cur < end && end <= cur + sg_dma_len(sg)) { 52 unsigned long trim = cur [all...] |
/linux-master/block/ |
H A D | blk-rq-qos.c | 11 unsigned int cur = atomic_read(v); local 14 if (cur >= below) 16 } while (!atomic_try_cmpxchg(v, &cur, cur + 1)); 339 struct rq_qos **cur; local 344 for (cur = &q->rq_qos; *cur; cur = &(*cur)->next) { 345 if (*cur [all...] |
/linux-master/fs/xfs/scrub/ |
H A D | alloc.c | 127 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); 142 if (xfs_alloc_check_irec(bs->cur->bc_ag.pag, &irec) != NULL) { 143 xchk_btree_set_corrupt(bs->sc, bs->cur, 0); 159 struct xfs_btree_cur *cur; local 163 cur = sc->sa.bno_cur; 166 cur = sc->sa.cnt_cur; 173 return xchk_btree(sc, cur, xchk_allocbt_rec, &XFS_RMAP_OINFO_AG, &ca);
|
/linux-master/fs/smb/client/ |
H A D | dfs.h | 149 struct cifs_ses *cur; local 154 for (cur = ses; cur; cur = cur->dfs_root_ses) { 155 if (cur->dfs_root_ses) 156 cifs_put_smb_ses(cur->dfs_root_ses);
|
/linux-master/net/sunrpc/ |
H A D | xprtmultipath.c | 25 const struct rpc_xprt *cur); 277 const struct rpc_xprt *cur, 284 if (cur == pos) 295 const struct rpc_xprt *cur) 297 return _xprt_switch_find_current_entry(head, cur, true); 304 const struct rpc_xprt *cur)) 326 const struct rpc_xprt *cur) 328 return _xprt_switch_find_current_entry(head, cur, false); 374 const struct rpc_xprt *cur, bool check_active) 380 if (cur 276 _xprt_switch_find_current_entry(struct list_head *head, const struct rpc_xprt *cur, bool find_active) argument 294 xprt_switch_find_current_entry(struct list_head *head, const struct rpc_xprt *cur) argument 301 _xprt_iter_current_entry(struct rpc_xprt_iter *xpi, struct rpc_xprt *first_entry(struct list_head *head), struct rpc_xprt *current_entry(struct list_head *head, const struct rpc_xprt *cur)) argument 325 xprt_switch_find_current_entry_offline(struct list_head *head, const struct rpc_xprt *cur) argument 373 xprt_switch_find_next_entry(struct list_head *head, const struct rpc_xprt *cur, bool check_active) argument 419 __xprt_switch_find_next_entry_roundrobin(struct list_head *head, const struct rpc_xprt *cur) argument 431 xprt_switch_find_next_entry_roundrobin(struct rpc_xprt_switch *xps, const struct rpc_xprt *cur) argument 463 xprt_switch_find_next_entry_all(struct rpc_xprt_switch *xps, const struct rpc_xprt *cur) argument 470 xprt_switch_find_next_entry_offline(struct rpc_xprt_switch *xps, const struct rpc_xprt *cur) argument [all...] |
/linux-master/tools/perf/util/ |
H A D | expr.c | 85 struct hashmap_entry *cur; local 91 hashmap__for_each_entry(ids, cur, bkt) { 92 zfree(&cur->pkey); 93 zfree(&cur->pvalue); 116 struct hashmap_entry *cur; local 133 hashmap__for_each_entry(ids2, cur, bkt) { 134 ret = hashmap__set(ids1, cur->key, cur->value, &old_key, &old_data); 231 struct hashmap_entry *cur; local 235 hashmap__for_each_entry(needles->ids, cur, bk 313 struct hashmap_entry *cur; local 325 struct hashmap_entry *cur; local [all...] |