Home
last modified time | relevance | path

Searched refs:rhead (Results 1 – 13 of 13) sorted by relevance

/linux/fs/xfs/
H A Dxfs_log_recover.c770 struct xlog_rec_header **rhead, in xlog_rseek_logrec_hdr() argument
793 *rhead = (struct xlog_rec_header *) offset; in xlog_rseek_logrec_hdr()
814 *rhead = (struct xlog_rec_header *) offset; in xlog_rseek_logrec_hdr()
844 struct xlog_rec_header **rhead, in xlog_seek_logrec_hdr() argument
867 *rhead = (struct xlog_rec_header *) offset; in xlog_seek_logrec_hdr()
887 *rhead = (struct xlog_rec_header *) offset; in xlog_seek_logrec_hdr()
1026 struct xlog_rec_header **rhead, /* ptr to last record */ in xlog_verify_head() argument
1079 buffer, rhead_blk, rhead, wrapped); in xlog_verify_head()
1095 *tail_blk = BLOCK_LSN(be64_to_cpu((*rhead)->h_tail_lsn)); in xlog_verify_head()
1105 be32_to_cpu((*rhead)->h_size)); in xlog_verify_head()
[all …]
H A Dxfs_log.c1481 struct xlog_rec_header *rhead = iclog->ic_header; in xlog_pack_data() local
1482 __be32 cycle_lsn = CYCLE_LSN_DISK(rhead->h_lsn); in xlog_pack_data()
1487 *xlog_cycle_data(rhead, i) = *(__be32 *)dp; in xlog_pack_data()
1493 rhead->h_ext[i].xh_cycle = cycle_lsn; in xlog_pack_data()
1505 struct xlog_rec_header *rhead, in xlog_cksum() argument
1513 crc = xfs_start_cksum_update((char *)rhead, hdrsize, in xlog_cksum()
1522 crc = crc32c(crc, &rhead->h_ext[i], XLOG_REC_EXT_SIZE); in xlog_cksum()
3231 struct xlog_rec_header *rhead = iclog->ic_header; in xlog_verify_iclog() local
3250 if (rhead->h_magicno != cpu_to_be32(XLOG_HEADER_MAGIC_NUM)) in xlog_verify_iclog()
3253 base_ptr = ptr = rhead; in xlog_verify_iclog()
[all …]
H A Dxfs_trace.h2633 TP_PROTO(struct xlog *log, struct xlog_rec_header *rhead, int pass),
2634 TP_ARGS(log, rhead, pass),
2644 __entry->lsn = be64_to_cpu(rhead->h_lsn);
2645 __entry->len = be32_to_cpu(rhead->h_len);
2646 __entry->num_logops = be32_to_cpu(rhead->h_num_logops);
/linux/drivers/gpu/drm/vmwgfx/
H A Dttm_object.h103 struct rcu_head rhead; member
286 kfree_rcu(__object, __base.rhead)
309 kfree_rcu(__obj, __prime.base.rhead)
/linux/include/linux/
H A Drhashtable.h737 return he ? container_of(he, struct rhlist_head, rhead) : NULL; in rhltable_lookup()
748 return likely(he) ? container_of(he, struct rhlist_head, rhead) : NULL; in rhltable_lookup_likely()
810 list = container_of(obj, struct rhlist_head, rhead); in __rhashtable_insert_fast()
811 plist = container_of(head, struct rhlist_head, rhead); in __rhashtable_insert_fast()
815 RCU_INIT_POINTER(list->rhead.next, head); in __rhashtable_insert_fast()
843 list = container_of(obj, struct rhlist_head, rhead); in __rhashtable_insert_fast()
912 return PTR_ERR(__rhashtable_insert_fast(&hlt->ht, key, &list->rhead, in rhltable_insert_key()
935 const char *key = rht_obj(&hlt->ht, &list->rhead); in rhltable_insert()
1068 list = container_of(he, struct rhlist_head, rhead); in __rhashtable_remove_fast_one()
1082 } while (list && obj != &list->rhead); in __rhashtable_remove_fast_one()
[all …]
H A Drhashtable-types.h24 struct rhash_head rhead; member
/linux/lib/
H A Drhashtable.c549 list = container_of(obj, struct rhlist_head, rhead); in rhashtable_lookup_one()
550 plist = container_of(head, struct rhlist_head, rhead); in rhashtable_lookup_one()
554 RCU_INIT_POINTER(list->rhead.next, head); in rhashtable_lookup_one()
604 list = container_of(obj, struct rhlist_head, rhead); in rhashtable_insert_one()
797 for (list = container_of(p, struct rhlist_head, rhead); in rhashtable_walk_start_check()
842 rhead); in __rhashtable_walk_find_next()
862 return rht_obj(ht, rhlist ? &list->rhead : p); in __rhashtable_walk_find_next()
907 list = container_of(p, struct rhlist_head, rhead); in rhashtable_walk_next()
913 return rht_obj(ht, rhlist ? &list->rhead : p); in rhashtable_walk_next()
943 return rht_obj(ht, ht->rhlist ? &list->rhead : p); in rhashtable_walk_peek()
[all …]
H A Dtest_rhashtable.c494 struct rhlist_head *list = container_of(pos, struct rhlist_head, rhead); in print_ht()
497 pos = &list->rhead; in print_ht()
539 key = rht_obj(&rhlt->ht, &rhl_test_objects[i].list_node.rhead); in test_insert_dup()
544 &rhl_test_objects[i].list_node.rhead)); in test_insert_dup()
/linux/Documentation/translations/zh_CN/core-api/
H A Dkref.rst274 struct rcu_head rhead;
301 kfree_rcu(entry, rhead);
310 宽限期。这可以通过使用上面的kfree_rcu(entry, rhead)来实现,或者在使用kfree之前
/linux/net/mac80211/
H A Dmesh_pathtbl.c98 WARN_ON(rhashtable_init(&tbl->rhead, &mesh_rht_params)); in mesh_table_init()
103 rhashtable_free_and_destroy(&tbl->rhead, in mesh_table_free()
248 mpath = rhashtable_lookup(&tbl->rhead, dst, mesh_rht_params); in mpath_lookup()
702 mpath = rhashtable_lookup_get_insert_fast(&tbl->rhead, in mesh_path_add()
745 ret = rhashtable_lookup_insert_fast(&tbl->rhead, in mpp_path_add()
814 rhashtable_remove_fast(&tbl->rhead, &mpath->rhash, mesh_rht_params); in __mesh_path_del()
904 mpath = rhashtable_lookup_fast(&tbl->rhead, addr, mesh_rht_params); in table_path_del()
/linux/drivers/net/wireless/ath/ath11k/
H A Dpeer.c172 struct rhash_head *rhead, in ath11k_peer_rhash_insert() argument
180 tmp = rhashtable_lookup_get_insert_fast(rtbl, rhead, *params); in ath11k_peer_rhash_insert()
192 struct rhash_head *rhead, in ath11k_peer_rhash_remove() argument
199 ret = rhashtable_remove_fast(rtbl, rhead, *params); in ath11k_peer_rhash_remove()
/linux/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_bo_list.c44 rhead); in amdgpu_bo_list_free_rcu()
57 call_rcu(&list->rhead, amdgpu_bo_list_free_rcu); in amdgpu_bo_list_free()
/linux/security/selinux/
H A Davc.c59 struct rcu_head rhead; member
429 static void avc_node_free(struct rcu_head *rhead) in avc_node_free() argument
431 struct avc_node *node = container_of(rhead, struct avc_node, rhead); in avc_node_free()
440 call_rcu(&node->rhead, avc_node_free); in avc_node_delete()
455 call_rcu(&old->rhead, avc_node_free); in avc_node_replace()