/include/drm/ |
H A D | drm_hashtab.h | 43 struct hlist_node head; member in struct:drm_hash_item
|
/include/drm/ttm/ |
H A D | ttm_execbuf_util.h | 40 * @head: list head for thread-private list. 51 struct list_head head; member in struct:ttm_validate_buffer
|
/include/linux/ |
H A D | circ_buf.h | 10 int head; member in struct:circ_buf 15 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1)) 18 as a completely full buffer has head == tail, which is the same as 20 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size)) 23 accessing head and tail more than once, so they can change 25 #define CIRC_CNT_TO_END(head,tail,size) \ 27 int n = ((head) + end) & ((size)-1); \ 31 #define CIRC_SPACE_TO_END(head,tai [all...] |
H A D | timerqueue.h | 14 struct rb_root head; member in struct:timerqueue_head 19 extern void timerqueue_add(struct timerqueue_head *head, 21 extern void timerqueue_del(struct timerqueue_head *head, 29 * @head: head of timerqueue 35 struct timerqueue_node *timerqueue_getnext(struct timerqueue_head *head) argument 37 return head->next; 45 static inline void timerqueue_init_head(struct timerqueue_head *head) argument 47 head->head [all...] |
H A D | hid-debug.h | 42 int head; member in struct:hid_debug_list
|
H A D | btree-128.h | 5 static inline void btree_init_mempool128(struct btree_head128 *head, argument 8 btree_init_mempool(&head->h, mempool); 11 static inline int btree_init128(struct btree_head128 *head) argument 13 return btree_init(&head->h); 16 static inline void btree_destroy128(struct btree_head128 *head) argument 18 btree_destroy(&head->h); 21 static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2) argument 24 return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key); 27 static inline void *btree_get_prev128(struct btree_head128 *head, argument 33 val = btree_get_prev(&head 40 btree_insert128(struct btree_head128 *head, u64 k1, u64 k2, void *val, gfp_t gfp) argument 48 btree_update128(struct btree_head128 *head, u64 k1, u64 k2, void *val) argument 56 btree_remove128(struct btree_head128 *head, u64 k1, u64 k2) argument 62 btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2) argument 89 btree_visitor128(struct btree_head128 *head, unsigned long opaque, visitor128_t func2) argument 97 btree_grim_visitor128(struct btree_head128 *head, unsigned long opaque, visitor128_t func2) argument [all...] |
H A D | llist.h | 73 * init_llist_head - initialize lock-less list head 74 * @head: the head for your lock-less list 97 * instead of list head. 115 * instead of list head. 129 * @head: the list to test 135 static inline bool llist_empty(const struct llist_head *head) argument 137 return ACCESS_ONCE(head->first) == NULL; 148 * @head: the head fo 152 llist_add(struct llist_node *new, struct llist_head *head) argument 176 llist_del_all(struct llist_head *head) argument [all...] |
H A D | plist.h | 93 * @head: struct plist_head variable name 95 #define PLIST_HEAD_INIT(head) \ 97 .node_list = LIST_HEAD_INIT((head).node_list) \ 114 * @head: &struct plist_head pointer 117 plist_head_init(struct plist_head *head) argument 119 INIT_LIST_HEAD(&head->node_list); 134 extern void plist_add(struct plist_node *node, struct plist_head *head); 135 extern void plist_del(struct plist_node *node, struct plist_head *head); 140 * @head: the head fo 181 plist_head_empty(const struct plist_head *head) argument 237 plist_first(const struct plist_head *head) argument 249 plist_last(const struct plist_head *head) argument [all...] |
H A D | rcutiny.h | 82 static inline void kfree_call_rcu(struct rcu_head *head, argument 85 call_rcu(head, func);
|
H A D | btree-type.h | 13 static inline void BTREE_FN(init_mempool)(BTREE_TYPE_HEAD *head, argument 16 btree_init_mempool(&head->h, mempool); 19 static inline int BTREE_FN(init)(BTREE_TYPE_HEAD *head) argument 21 return btree_init(&head->h); 24 static inline void BTREE_FN(destroy)(BTREE_TYPE_HEAD *head) argument 26 btree_destroy(&head->h); 37 static inline void *BTREE_FN(lookup)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument 40 return btree_lookup(&head->h, BTREE_TYPE_GEO, &_key); 43 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, argument 47 return btree_insert(&head 50 update(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val) argument 57 remove(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument 63 last(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument 72 get_prev(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument 81 lookup(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument 86 insert(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val, gfp_t gfp) argument 93 update(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val) argument 99 remove(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument 104 last(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument 109 get_prev(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument 121 visitor(BTREE_TYPE_HEAD *head, unsigned long opaque, VISITOR_FN_T func2) argument 129 grim_visitor(BTREE_TYPE_HEAD *head, unsigned long opaque, VISITOR_FN_T func2) argument [all...] |
H A D | huge_mm.h | 147 struct page *head; local 148 head = page->first_page; 151 * head may be a dangling pointer. 154 * there it means the head pointer isn't dangling. 157 return head;
|
H A D | notifier.h | 58 struct notifier_block __rcu *head; member in struct:atomic_notifier_head 63 struct notifier_block __rcu *head; member in struct:blocking_notifier_head 67 struct notifier_block __rcu *head; member in struct:raw_notifier_head 73 struct notifier_block __rcu *head; member in struct:srcu_notifier_head 78 (name)->head = NULL; \ 82 (name)->head = NULL; \ 85 (name)->head = NULL; \ 95 .head = NULL } 98 .head = NULL } 100 .head [all...] |
H A D | rculist.h | 15 * and compares it to the address of the list head, but neither dereferences 45 * @head: list head to add it after 47 * Insert a new entry after the specified head. 58 static inline void list_add_rcu(struct list_head *new, struct list_head *head) argument 60 __list_add_rcu(new, head, head->next); 66 * @head: list head to add it before 68 * Insert a new entry before the specified head 79 list_add_tail_rcu(struct list_head *new, struct list_head *head) argument 178 list_splice_init_rcu(struct list_head *list, struct list_head *head, void (*sync)(void)) argument [all...] |
H A D | hidraw.h | 68 int head; member in struct:hidraw_list
|
H A D | nfs_page.h | 121 * @head: head of list into which to insert the request. 124 nfs_list_add_request(struct nfs_page *req, struct list_head *head) argument 126 list_add_tail(&req->wb_list, head); 143 nfs_list_entry(struct list_head *head) argument 145 return list_entry(head, struct nfs_page, wb_list);
|
H A D | rcupdate.h | 83 * @head: structure to be used for queueing the RCU updates. 94 extern void call_rcu(struct rcu_head *head, 95 void (*func)(struct rcu_head *head)); 106 * @head: structure to be used for queueing the RCU updates. 122 extern void call_rcu_bh(struct rcu_head *head, 123 void (*func)(struct rcu_head *head)); 127 * @head: structure to be used for queueing the RCU updates. 141 extern void call_rcu_sched(struct rcu_head *head, 226 typedef void call_rcu_func_t(struct rcu_head *head, 227 void (*func)(struct rcu_head *head)); 248 init_rcu_head_on_stack(struct rcu_head *head) argument 252 destroy_rcu_head_on_stack(struct rcu_head *head) argument 913 __kfree_rcu(struct rcu_head *head, unsigned long offset) argument [all...] |
H A D | rmap.h | 40 * NOTE: the LSB of the head.next is set by 42 * head must only be read/written after taking the above lock 47 struct list_head head; /* Chain of private "related" vmas */ member in struct:anon_vma
|
H A D | stallion.h | 51 * is that the head and tail pointers can be updated without interrupt 52 * protection - since "write" code only needs to change the head, and 57 char *head; member in struct:stlrq
|
/include/net/netfilter/ |
H A D | nf_conntrack_helper.h | 73 struct list_head head; member in struct:nf_ct_helper_expectfn
|
H A D | nf_conntrack_timeout.h | 13 struct list_head head; member in struct:ctnl_timeout
|
/include/crypto/ |
H A D | scatterwalk.h | 49 static inline void scatterwalk_crypto_chain(struct scatterlist *head, argument 54 head->length += sg->length; 59 scatterwalk_sg_chain(head, num, sg); 61 sg_mark_end(head);
|
/include/linux/ceph/ |
H A D | pagelist.h | 7 struct list_head head; member in struct:ceph_pagelist 23 INIT_LIST_HEAD(&pl->head);
|
/include/linux/mtd/ |
H A D | inftl.h | 41 int head,sect,cyl; member in struct:INFTLrecord
|
H A D | nftl.h | 47 int head,sect,cyl; member in struct:NFTLrecord
|
/include/linux/wimax/ |
H A D | debug.h | 166 * @head: buffer where to place the header 167 * @head_size: length of @head 172 void __d_head(char *head, size_t head_size, argument 176 head[0] = 0; 181 snprintf(head, head_size, "%s %s: ", 201 char head[64]; \ 204 __d_head(head, sizeof(head), dev); \ 205 printk(KERN_ERR "%s%s%s: " f, head, __func__, tag, ##a); \ 416 char head[6 [all...] |