hlist_entry
hlist_entry(p, typeof(*n), link);
n = hlist_entry(p, typeof(*n), link);
struct blkcg_gq *blkg = hlist_entry(blkcg->blkg_list.first,
struct io_cq *icq = hlist_entry(ioc->icq_list.first,
zwplug = hlist_entry(disk->zone_wplugs_hash[i].first,
proc = hlist_entry(binder_deferred_list.first,
struct zcomp *comp = hlist_entry(node, struct zcomp, node);
struct zcomp *comp = hlist_entry(node, struct zcomp, node);
xfer = hlist_entry(minfo->free_xfers.first, struct scmi_xfer, node);
base = hlist_entry(hash, struct ttm_ref_object, hash)->obj;
ref = hlist_entry(hash, struct ttm_ref_object, hash);
ref = hlist_entry(hash, struct ttm_ref_object, hash);
entry = hlist_entry(hash, struct vmw_cmdbuf_res, hash);
return hlist_entry(hash, struct vmw_cmdbuf_res, hash)->res;
p9_fid_put(hlist_entry(p, struct p9_fid, dlist));
pcell = hlist_entry(*p, struct afs_cell, proc_link);
struct afs_volume *vol = hlist_entry(v, struct afs_volume, proc_link);
alias = hlist_entry(inode->i_dentry.first, struct dentry, d_u.d_alias);
alias = hlist_entry(inode->i_dentry.first, struct dentry, d_u.d_alias);
de = hlist_entry(l->first, struct dentry, d_u.d_alias);
next = hlist_entry(dentry->d_sib.next, struct dentry, d_sib);
epi = hlist_entry(file->f_ep->first, struct epitem, fllink);
pin_kill(hlist_entry(p, struct fs_pin, m_list));
pin_kill(hlist_entry(q, struct fs_pin, s_list));
struct dentry *d = hlist_entry(*p, struct dentry, d_sib);
cur = hlist_entry(v, struct file_lock_core, flc_link);
mnt = hlist_entry(mp.node.next, struct mount, mnt_mp_list);
child = hlist_entry(tree_list.first, struct mount, mnt_hash);
hlist_entry(dir->i_dentry.first, struct dentry, d_u.d_alias);
d = hlist_entry(tmp.first, struct nfs4_deviceid_node, tmpnode);
res = hlist_entry(iter, struct dlm_lock_resource,
return hlist_entry(p->mnt_slave_list.first, struct mount, mnt_slave);
return hlist_entry(p->mnt_slave.next, struct mount, mnt_slave);
struct k_itimer *timer = hlist_entry((struct hlist_node *)v, struct k_itimer, list);
struct proc_inode *ei = hlist_entry(node, struct proc_inode, sibling_inodes);
____ptr ? hlist_entry(____ptr, type, member) : NULL; \
struct hlist_node hlist_entry;
return hlist_entry(tb_hlist, struct fib_table, tb_hlist);
return hlist_entry(node, struct sock, sk_node);
return hlist_entry(head->first, struct sock, sk_node);
return hlist_entry(progs->first, typeof(*pl), node);
return hlist_entry(progs->first, typeof(*pl), node);
hlist_for_each_entry_rcu(event, head, hlist_entry) {
hlist_add_head_rcu(&event->hlist_entry, head);
hlist_del_rcu(&event->hlist_entry);
hlist_for_each_entry_rcu(event, head, hlist_entry) {
INIT_HLIST_NODE(&event->hlist_entry);
desc = hlist_entry(irq_resend_list.first, struct irq_desc, resend_node);
result = hlist_entry(first, struct task_struct, pid_links[(type)]);
hlist_entry(console_list.first, struct console, node)
posix_timer_cleanup_ignored(hlist_entry(timers.first, struct k_itimer,
timer = hlist_entry(head->first, struct timer_list, entry);
timer = hlist_entry(head->first, struct timer_list, entry);
iter->probe_entry = hlist_entry(hnd, struct ftrace_func_entry, hlist);
hlist_add_head_rcu(&p_event->hlist_entry, list);
hlist_del_rcu(&p_event->hlist_entry);
head.first = &event->hlist_entry;
watch = hlist_entry(wqueue->watches.first, struct watch, queue_node);
obj = hlist_entry(first_batch, typeof(*obj), node);
obj = hlist_entry(head->first, typeof(*obj), node);
obj = hlist_entry(head->first, typeof(*obj), node);
obj = hlist_entry(list->first, typeof(*obj), node);
first = hlist_entry(pcp->objects.first, typeof(*first), node);
hlist_entry(&(test_struct.list),
mem = hlist_entry(cma->mem_head.first, struct cma_mem, node);
subscription = hlist_entry(subscriptions->list.first,
struct zswap_pool *pool = hlist_entry(node, struct zswap_pool, node);
struct zswap_pool *pool = hlist_entry(node, struct zswap_pool, node);
struct lec_arp_table *entry = hlist_entry(state->node,
ax25_cb *ax25 = hlist_entry(v, struct ax25_cb, ax25_node);
pt = hlist_entry(v, struct ax25_uid_assoc, uid_node);
claim_removed_entry = hlist_entry(claim_removed_node,
entry = hlist_entry(chain->first, struct batadv_frag_list_entry, list);
hardif_neigh = hlist_entry(first, struct batadv_hardif_neigh_node,
tt_removed_entry = hlist_entry(tt_removed_node,
tt_removed_entry = hlist_entry(tt_removed_node,
pmctx = hlist_entry(rlist, struct net_bridge_mcast_port,
pmctx = hlist_entry(rlist, struct net_bridge_mcast_port,
struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
tup = hlist_entry(udp_tunnel_gro->list.first, struct udp_sock,
key = hlist_entry(mns->keys.first, struct mctp_sk_key, hlist);
return hlist_entry(e, struct ip_vs_conn, c_list);
return hlist_entry(e, struct ip_vs_service, s_list);
return hlist_entry(e, struct ip_vs_service, f_list);
expect = hlist_entry(n, struct nf_conntrack_expect, hnode);
struct nr_node *nr_node = hlist_entry(v, struct nr_node,
nr_neigh = hlist_entry(v, struct nr_neigh, neigh_node);
local = hlist_entry(cursor, struct rxrpc_local, link);
call = hlist_entry(error_targets.first,
local = hlist_entry(v, struct rxrpc_local, link);
return hlist_entry(grp->slots[grp->front].first,
cred = hlist_entry(head->first, struct rpc_cred, cr_hash);
ch = hlist_entry(head->first, struct cache_head,
____ptr ? hlist_entry(____ptr, type, member) : NULL; \
____ptr ? hlist_entry(____ptr, type, member) : NULL; \