/linux-master/drivers/gpu/drm/nouveau/nvkm/engine/disp/ |
H A D | head.c | 24 #include "head.h" 34 struct nvkm_head *head; local 35 list_for_each_entry(head, &disp->heads, head) { 36 if (head->id == id) 37 return head; 45 struct nvkm_head *head = *phead; local 46 if (head) { 47 HEAD_DBG(head, "dtor"); 48 list_del(&head 58 struct nvkm_head *head; local [all...] |
/linux-master/include/linux/ |
H A D | plist.h | 84 * @head: struct plist_head variable name 86 #define PLIST_HEAD_INIT(head) \ 88 .node_list = LIST_HEAD_INIT((head).node_list) \ 93 * @head: name for struct plist_head variable 95 #define PLIST_HEAD(head) \ 96 struct plist_head head = PLIST_HEAD_INIT(head) 112 * @head: &struct plist_head pointer 115 plist_head_init(struct plist_head *head) argument 117 INIT_LIST_HEAD(&head 203 plist_head_empty(const struct plist_head *head) argument 273 plist_first(const struct plist_head *head) argument 285 plist_last(const struct plist_head *head) argument [all...] |
H A D | circ_buf.h | 11 int head; member in struct:circ_buf 16 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1)) 19 as a completely full buffer has head == tail, which is the same as 21 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size)) 24 accessing head and tail more than once, so they can change 26 #define CIRC_CNT_TO_END(head,tail,size) \ 28 int n = ((head) + end) & ((size)-1); \ 32 #define CIRC_SPACE_TO_END(head,tai [all...] |
H A D | btree-128.h | 6 static inline void btree_init_mempool128(struct btree_head128 *head, argument 9 btree_init_mempool(&head->h, mempool); 12 static inline int btree_init128(struct btree_head128 *head) argument 14 return btree_init(&head->h); 17 static inline void btree_destroy128(struct btree_head128 *head) argument 19 btree_destroy(&head->h); 22 static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2) argument 25 return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key); 28 static inline void *btree_get_prev128(struct btree_head128 *head, argument 34 val = btree_get_prev(&head 41 btree_insert128(struct btree_head128 *head, u64 k1, u64 k2, void *val, gfp_t gfp) argument 49 btree_update128(struct btree_head128 *head, u64 k1, u64 k2, void *val) argument 57 btree_remove128(struct btree_head128 *head, u64 k1, u64 k2) argument 63 btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2) argument 90 btree_visitor128(struct btree_head128 *head, unsigned long opaque, visitor128_t func2) argument 98 btree_grim_visitor128(struct btree_head128 *head, unsigned long opaque, visitor128_t func2) argument [all...] |
H A D | rcu_segcblist.h | 22 struct rcu_head *head; member in struct:rcu_cblist 27 #define RCU_CBLIST_INITIALIZER(n) { .head = NULL, .tail = &n.head } 36 * [head, *tails[RCU_DONE_TAIL]): 60 #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */ 61 #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */ 62 #define RCU_NEXT_READY_TAIL 2 /* Also RCU_NEXT head. */ 207 struct rcu_head *head; member in struct:rcu_segcblist 221 .head = NULL, \ 222 .tails[RCU_DONE_TAIL] = &n.head, \ [all...] |
H A D | btree-type.h | 14 static inline void BTREE_FN(init_mempool)(BTREE_TYPE_HEAD *head, argument 17 btree_init_mempool(&head->h, mempool); 20 static inline int BTREE_FN(init)(BTREE_TYPE_HEAD *head) argument 22 return btree_init(&head->h); 25 static inline void BTREE_FN(destroy)(BTREE_TYPE_HEAD *head) argument 27 btree_destroy(&head->h); 38 static inline void *BTREE_FN(lookup)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument 41 return btree_lookup(&head->h, BTREE_TYPE_GEO, &_key); 44 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, argument 48 return btree_insert(&head 51 update(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val) argument 58 remove(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument 64 last(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument 73 get_prev(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument 82 lookup(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument 87 insert(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val, gfp_t gfp) argument 94 update(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val) argument 100 remove(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument 105 last(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument 110 get_prev(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument 122 visitor(BTREE_TYPE_HEAD *head, unsigned long opaque, VISITOR_FN_T func2) argument 130 grim_visitor(BTREE_TYPE_HEAD *head, unsigned long opaque, VISITOR_FN_T func2) argument [all...] |
H A D | btree.h | 16 * Each B+Tree consists of a head, that contains bookkeeping information and 29 * struct btree_head - btree head 61 * @head: the btree head to initialise 67 void btree_init_mempool(struct btree_head *head, mempool_t *mempool); 72 * @head: the btree head to initialise 79 int __must_check btree_init(struct btree_head *head); 84 * @head: the btree head t [all...] |
/linux-master/drivers/scsi/aic7xxx/ |
H A D | queue.h | 40 * added to the list after an existing element or at the head of the list. 41 * Elements being removed from the head of the list should use the explicit 48 * head of the list and the other to the tail of the list. The elements are 51 * to the list after an existing element, at the head of the list, or at the 52 * end of the list. Elements being removed from the head of the tail queue 62 * or after an existing element or at the head of the list. A list 65 * A tail queue is headed by a pair of pointers, one to the head of the 69 * after an existing element, at the head of the list, or at the end of 72 * A circle queue is headed by a pair of pointers, one to the head of the 76 * an existing element, at the head o [all...] |
/linux-master/include/linux/sched/ |
H A D | wake_q.h | 22 * The DEFINE_WAKE_Q macro declares and initializes the list head. 51 static inline void wake_q_init(struct wake_q_head *head) argument 53 head->first = WAKE_Q_TAIL; 54 head->lastp = &head->first; 57 static inline bool wake_q_empty(struct wake_q_head *head) argument 59 return head->first == WAKE_Q_TAIL; 62 extern void wake_q_add(struct wake_q_head *head, struct task_struct *task); 63 extern void wake_q_add_safe(struct wake_q_head *head, struct task_struct *task); 64 extern void wake_up_q(struct wake_q_head *head); [all...] |
/linux-master/drivers/gpu/drm/nouveau/dispnv50/ |
H A D | curs907a.c | 25 curs907a_new(struct nouveau_drm *drm, int head, s32 oclass, argument 28 return curs507a_new_(&curs507a, drm, head, oclass, 29 0x00000001 << (head * 4), pwndw);
|
H A D | handles.h | 14 #define NV50_DISP_HANDLE_CRC_CTX(head, i) (0xfc000000 | head->base.index << 1 | i)
|
H A D | ovly917e.c | 37 ovly917e_new(struct nouveau_drm *drm, int head, s32 oclass, argument 40 return ovly507e_new_(&ovly907e, ovly917e_format, drm, head, oclass, 41 0x00000004 << (head * 4), pwndw);
|
/linux-master/lib/ |
H A D | radix-tree.h | 8 extern void radix_tree_node_rcu_free(struct rcu_head *head);
|
H A D | llist.c | 22 * @head: the head for your lock-less list 27 struct llist_head *head) 29 struct llist_node *first = READ_ONCE(head->first); 33 } while (!try_cmpxchg(&head->first, &first, new_first)); 41 * @head: the head for your lock-less list 49 * llist_add) sequence in another user may change @head->first->next, 50 * but keep @head->first. If multiple consumers are needed, please 53 struct llist_node *llist_del_first(struct llist_head *head) argument 26 llist_add_batch(struct llist_node *new_first, struct llist_node *new_last, struct llist_head *head) argument 79 llist_del_first_this(struct llist_head *head, struct llist_node *this) argument 103 llist_reverse_order(struct llist_node *head) argument [all...] |
/linux-master/scripts/gdb/linux/ |
H A D | lists.py | 23 def list_for_each(head): 24 if head.type == list_head.get_type().pointer(): 25 head = head.dereference() 26 elif head.type != list_head.get_type(): 28 .format(head.type)) 30 if head['next'] == 0: 32 .format(head.address)) 35 node = head['next'].dereference() 36 while node.address != head [all...] |
/linux-master/drivers/gpu/drm/nouveau/nvif/ |
H A D | head.c | 22 #include <nvif/head.h> 30 nvif_head_vblank_event_ctor(struct nvif_head *head, const char *name, nvif_event_func func, argument 33 int ret = nvif_event_ctor(&head->object, name ?: "nvifHeadVBlank", nvif_head_id(head), 35 NVIF_ERRON(ret, &head->object, "[NEW EVENT:VBLANK]"); 40 nvif_head_dtor(struct nvif_head *head) argument 42 nvif_object_dtor(&head->object); 46 nvif_head_ctor(struct nvif_disp *disp, const char *name, int id, struct nvif_head *head) argument 55 &args, sizeof(args), &head->object); 56 NVIF_ERRON(ret, &disp->object, "[NEW head i [all...] |
/linux-master/tools/testing/selftests/arm64/signal/testcases/ |
H A D | fake_sigreturn_bad_magic.c | 21 struct _aarch64_ctx *shead = GET_SF_RESV_HEAD(sf), *head; local 28 head = get_starting_head(shead, HDR_SZ * 2, GET_SF_RESV_SIZE(sf), NULL); 29 if (!head) 36 head->magic = KSFT_BAD_MAGIC; 37 head->size = HDR_SZ; 38 write_terminator_record(GET_RESV_NEXT_HEAD(head));
|
H A D | fake_sigreturn_bad_size_for_magic0.c | 21 struct _aarch64_ctx *shead = GET_SF_RESV_HEAD(sf), *head; local 28 head = get_starting_head(shead, HDR_SZ, GET_SF_RESV_SIZE(sf), NULL); 29 if (!head) 32 head->magic = 0; 33 head->size = HDR_SZ;
|
H A D | testcases.c | 9 struct _aarch64_ctx *get_header(struct _aarch64_ctx *head, uint32_t magic, argument 15 if (!head || resv_sz < HDR_SZ) 19 head->magic != magic && head->magic) { 20 offs += head->size; 21 head = GET_RESV_NEXT_HEAD(head); 23 if (head->magic == magic) { 24 found = head; 41 term = GET_RESV_NEXT_HEAD(&extra->head); 141 struct _aarch64_ctx *head = local 322 struct _aarch64_ctx *head; local [all...] |
/linux-master/fs/btrfs/ |
H A D | lru_cache.c | 23 static struct btrfs_lru_cache_entry *match_entry(struct list_head *head, u64 key, argument 28 list_for_each_entry(entry, head, list) { 48 struct list_head *head; local 51 head = mtree_load(&cache->entries, key); 52 if (!head) 55 entry = match_entry(head, key, gen); 82 struct list_head *head; local 86 * means it's a head entry not pointing to any cached entries, 89 head = mtree_erase(&cache->entries, entry->key); 90 ASSERT(head 111 struct list_head *head; local [all...] |
/linux-master/drivers/scsi/sym53c8xx_2/ |
H A D | sym_misc.h | 42 static inline struct sym_quehead *sym_que_first(struct sym_quehead *head) argument 44 return (head->flink == head) ? 0 : head->flink; 47 static inline struct sym_quehead *sym_que_last(struct sym_quehead *head) argument 49 return (head->blink == head) ? 0 : head->blink; 69 static inline int sym_que_empty(struct sym_quehead *head) argument 71 return head 74 sym_que_splice(struct sym_quehead *list, struct sym_quehead *head) argument 119 sym_remque_head(struct sym_quehead *head) argument 132 sym_remque_tail(struct sym_quehead *head) argument [all...] |
/linux-master/security/tomoyo/ |
H A D | common.c | 201 * @head: Pointer to "struct tomoyo_io_buffer". 205 static bool tomoyo_flush(struct tomoyo_io_buffer *head) argument 207 while (head->r.w_pos) { 208 const char *w = head->r.w[0]; 212 if (len > head->read_user_buf_avail) 213 len = head->read_user_buf_avail; 216 if (copy_to_user(head->read_user_buf, w, len)) 218 head->read_user_buf_avail -= len; 219 head->read_user_buf += len; 222 head 251 tomoyo_set_string(struct tomoyo_io_buffer *head, const char *string) argument 269 tomoyo_io_printf(struct tomoyo_io_buffer *head, const char *fmt, ...) argument 297 tomoyo_set_space(struct tomoyo_io_buffer *head) argument 309 tomoyo_set_lf(struct tomoyo_io_buffer *head) argument 322 tomoyo_set_slash(struct tomoyo_io_buffer *head) argument 361 tomoyo_print_namespace(struct tomoyo_io_buffer *head) argument 378 tomoyo_print_name_union(struct tomoyo_io_buffer *head, const struct tomoyo_name_union *ptr) argument 398 tomoyo_print_name_union_quoted(struct tomoyo_io_buffer *head, const struct tomoyo_name_union *ptr) argument 419 tomoyo_print_number_union_nospace(struct tomoyo_io_buffer *head, const struct tomoyo_number_union *ptr) argument 467 tomoyo_print_number_union(struct tomoyo_io_buffer *head, const struct tomoyo_number_union *ptr) argument 666 tomoyo_write_profile(struct tomoyo_io_buffer *head) argument 721 tomoyo_print_config(struct tomoyo_io_buffer *head, const u8 config) argument 736 tomoyo_read_profile(struct tomoyo_io_buffer *head) argument 885 tomoyo_write_manager(struct tomoyo_io_buffer *head) argument 903 tomoyo_read_manager(struct tomoyo_io_buffer *head) argument 982 tomoyo_select_domain(struct tomoyo_io_buffer *head, const char *data) argument 1164 tomoyo_write_domain(struct tomoyo_io_buffer *head) argument 1224 tomoyo_print_condition(struct tomoyo_io_buffer *head, const struct tomoyo_condition *cond) argument 1365 tomoyo_set_group(struct tomoyo_io_buffer *head, const char *category) argument 1384 tomoyo_print_entry(struct tomoyo_io_buffer *head, struct tomoyo_acl_info *acl) argument 1589 tomoyo_read_domain2(struct tomoyo_io_buffer *head, struct list_head *list) argument 1610 tomoyo_read_domain(struct tomoyo_io_buffer *head) argument 1672 tomoyo_write_pid(struct tomoyo_io_buffer *head) argument 1688 tomoyo_read_pid(struct tomoyo_io_buffer *head) argument 1748 tomoyo_write_exception(struct tomoyo_io_buffer *head) argument 1789 tomoyo_read_group(struct tomoyo_io_buffer *head, const int idx) argument 1848 tomoyo_read_policy(struct tomoyo_io_buffer *head, const int idx) argument 1908 tomoyo_read_exception(struct tomoyo_io_buffer *head) argument 2194 tomoyo_read_query(struct tomoyo_io_buffer *head) argument 2255 tomoyo_write_answer(struct tomoyo_io_buffer *head) argument 2294 tomoyo_read_version(struct tomoyo_io_buffer *head) argument 2342 tomoyo_read_stat(struct tomoyo_io_buffer *head) argument 2386 tomoyo_write_stat(struct tomoyo_io_buffer *head) argument 2408 struct tomoyo_io_buffer *head = kzalloc(sizeof(*head), GFP_NOFS); local 2518 struct tomoyo_io_buffer *head = file->private_data; local 2532 tomoyo_set_namespace_cursor(struct tomoyo_io_buffer *head) argument 2558 tomoyo_has_more_namespace(struct tomoyo_io_buffer *head) argument 2574 tomoyo_read_control(struct tomoyo_io_buffer *head, char __user *buffer, const int buffer_len) argument 2610 tomoyo_parse_policy(struct tomoyo_io_buffer *head, char *line) argument 2647 tomoyo_write_control(struct tomoyo_io_buffer *head, const char __user *buffer, const int buffer_len) argument 2749 tomoyo_close_control(struct tomoyo_io_buffer *head) argument 2826 struct tomoyo_io_buffer head = { }; local [all...] |
/linux-master/tools/testing/radix-tree/linux/ |
H A D | radix-tree.h | 10 static inline void trace_call_rcu(struct rcu_head *head, argument 11 void (*func)(struct rcu_head *head)) 14 printf("Delaying free of %p to slab\n", (char *)head - 16 call_rcu(head, func);
|
/linux-master/sound/pci/ctxfi/ |
H A D | ctimap.c | 21 struct list_head *pos, *pre, *head; local 24 head = mappers; 26 if (list_empty(head)) { 29 list_add(&entry->list, head); 33 list_for_each(pos, head) { 41 if (pos != head) { 43 if (pre == head) 44 pre = head->prev; 48 pre = head->prev; 49 pos = head 67 struct list_head *next, *pre, *head; local 96 free_input_mapper_list(struct list_head *head) argument [all...] |
/linux-master/arch/m68k/kernel/ |
H A D | Makefile | 8 obj-$(CONFIG_AMIGA) := head.o 9 obj-$(CONFIG_ATARI) := head.o 10 obj-$(CONFIG_MAC) := head.o 11 obj-$(CONFIG_APOLLO) := head.o 12 obj-$(CONFIG_VME) := head.o 13 obj-$(CONFIG_HP300) := head.o 14 obj-$(CONFIG_Q40) := head.o 15 obj-$(CONFIG_SUN3X) := head.o 16 obj-$(CONFIG_VIRT) := head.o 17 obj-$(CONFIG_SUN3) := sun3-head [all...] |