Home
last modified time | relevance | path

Searched full:head (Results 1 – 25 of 4626) sorted by relevance

12345678910>>...186

/OK3568_Linux_fs/yocto/poky/meta/recipes-core/musl/bsd-headers/
H A Dsys-queue.h45 * head of the list. Elements being removed from the head of the list
55 * or after an existing element or at the head of the list. A list
58 * A simple queue is headed by a pair of pointers, one the head of the
61 * head of the list. New elements can be added to the list after
62 * an existing element, at the head of the list, or at the end of the
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 of the list, or at the end of the list.
111 #define SLIST_HEAD_INITIALIZER(head) \ argument
[all …]
H A Dsys-tree.h78 #define SPLAY_ROOT(head) (head)->sph_root argument
79 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
82 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
83 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
84 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
85 (head)->sph_root = tmp; \
88 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
89 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
90 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/sys/
H A Dqueue.h48 * head of the list. Elements being removed from the head of the list
58 * or after an existing element or at the head of the list. A list
61 * A simple queue is headed by a pair of pointers, one the head of the
64 * head of the list. New elements can be added to the list after
65 * an existing element, at the head of the list, or at the end of the
68 * A tail queue is headed by a pair of pointers, one to the head of the
72 * after an existing element, at the head of the list, or at the end of
75 * A circle queue is headed by a pair of pointers, one to the head of the
79 * an existing element, at the head of the list, or at the end of the list.
94 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/sys/
H A Dqueue.h48 * head of the list. Elements being removed from the head of the list
58 * or after an existing element or at the head of the list. A list
61 * A simple queue is headed by a pair of pointers, one the head of the
64 * head of the list. New elements can be added to the list after
65 * an existing element, at the head of the list, or at the end of the
68 * A tail queue is headed by a pair of pointers, one to the head of the
72 * after an existing element, at the head of the list, or at the end of
75 * A circle queue is headed by a pair of pointers, one to the head of the
79 * an existing element, at the head of the list, or at the end of the list.
94 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/OK3568_Linux_fs/kernel/security/tomoyo/
H A Dcommon.c209 * @head: Pointer to "struct tomoyo_io_buffer".
213 static bool tomoyo_flush(struct tomoyo_io_buffer *head) in tomoyo_flush() argument
215 while (head->r.w_pos) { in tomoyo_flush()
216 const char *w = head->r.w[0]; in tomoyo_flush()
220 if (len > head->read_user_buf_avail) in tomoyo_flush()
221 len = head->read_user_buf_avail; in tomoyo_flush()
224 if (copy_to_user(head->read_user_buf, w, len)) in tomoyo_flush()
226 head->read_user_buf_avail -= len; in tomoyo_flush()
227 head->read_user_buf += len; in tomoyo_flush()
230 head->r.w[0] = w; in tomoyo_flush()
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v1/export-user_ta/include/sys/
H A Dqueue.h47 * head of the list. Elements being removed from the head of the list
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head of the list, or at the end of the list.
93 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/OK3568_Linux_fs/kernel/drivers/gpu/drm/nouveau/dispnv04/
H A Dhw.c39 NVWriteVgaSeq(struct drm_device *dev, int head, uint8_t index, uint8_t value) in NVWriteVgaSeq() argument
41 NVWritePRMVIO(dev, head, NV_PRMVIO_SRX, index); in NVWriteVgaSeq()
42 NVWritePRMVIO(dev, head, NV_PRMVIO_SR, value); in NVWriteVgaSeq()
46 NVReadVgaSeq(struct drm_device *dev, int head, uint8_t index) in NVReadVgaSeq() argument
48 NVWritePRMVIO(dev, head, NV_PRMVIO_SRX, index); in NVReadVgaSeq()
49 return NVReadPRMVIO(dev, head, NV_PRMVIO_SR); in NVReadVgaSeq()
53 NVWriteVgaGr(struct drm_device *dev, int head, uint8_t index, uint8_t value) in NVWriteVgaGr() argument
55 NVWritePRMVIO(dev, head, NV_PRMVIO_GRX, index); in NVWriteVgaGr()
56 NVWritePRMVIO(dev, head, NV_PRMVIO_GX, value); in NVWriteVgaGr()
60 NVReadVgaGr(struct drm_device *dev, int head, uint8_t index) in NVReadVgaGr() argument
[all …]
H A Dhw.h37 void NVWriteVgaSeq(struct drm_device *, int head, uint8_t index, uint8_t value);
38 uint8_t NVReadVgaSeq(struct drm_device *, int head, uint8_t index);
39 void NVWriteVgaGr(struct drm_device *, int head, uint8_t index, uint8_t value);
40 uint8_t NVReadVgaGr(struct drm_device *, int head, uint8_t index);
42 void NVBlankScreen(struct drm_device *, int head, bool blank);
48 void nouveau_hw_save_state(struct drm_device *, int head,
50 void nouveau_hw_load_state(struct drm_device *, int head,
52 void nouveau_hw_load_state_palette(struct drm_device *, int head,
60 int head, uint32_t reg) in NVReadCRTC() argument
64 if (head) in NVReadCRTC()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/libc/usr/include/sys/
H A Dqueue.h43 * head of the list. Elements being removed from the head of the list
53 * or after an existing element or at the head of the list. A list
56 * A simple queue is headed by a pair of pointers, one the head of the
59 * head of the list. New elements can be added to the list after
60 * an existing element, at the head of the list, or at the end of the
63 * A tail queue is headed by a pair of pointers, one to the head of the
67 * after an existing element, at the head of the list, or at the end of
70 * A circle queue is headed by a pair of pointers, one to the head of the
74 * an existing element, at the head of the list, or at the end of the list.
89 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/libc/usr/include/sys/
H A Dqueue.h43 * head of the list. Elements being removed from the head of the list
53 * or after an existing element or at the head of the list. A list
56 * A simple queue is headed by a pair of pointers, one the head of the
59 * head of the list. New elements can be added to the list after
60 * an existing element, at the head of the list, or at the end of the
63 * A tail queue is headed by a pair of pointers, one to the head of the
67 * after an existing element, at the head of the list, or at the end of
70 * A circle queue is headed by a pair of pointers, one to the head of the
74 * an existing element, at the head of the list, or at the end of the list.
89 #define LIST_HEAD_INITIALIZER(head) \ argument
[all …]
/OK3568_Linux_fs/kernel/drivers/scsi/aic7xxx/
H A Dqueue.h40 * 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 of the list, or at the end of the list.
[all …]
/OK3568_Linux_fs/kernel/tools/include/linux/
H A Dlist.h56 * @head: list head to add it after
58 * Insert a new entry after the specified head.
61 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
63 __list_add(new, head, head->next); in list_add()
70 * @head: list head to add it before
72 * Insert a new entry before the specified head.
75 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
77 __list_add(new, head->prev, head); in list_add_tail()
150 * list_move - delete from one list and add as another's head
152 * @head: the head that will precede our entry
[all …]
/OK3568_Linux_fs/kernel/include/linux/
H A Dlist.h79 * @head: list head to add it after
81 * Insert a new entry after the specified head.
84 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
86 __list_add(new, head, head->next); in list_add()
93 * @head: list head to add it before
95 * Insert a new entry before the specified head.
98 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
100 __list_add(new, head->prev, head); in list_add_tail()
209 * list_move - delete from one list and add as another's head
211 * @head: the head that will precede our entry
[all …]
H A Dplist.h35 * HEAD| NODE(S)
91 * @head: struct plist_head variable name
93 #define PLIST_HEAD_INIT(head) \ argument
95 .node_list = LIST_HEAD_INIT((head).node_list) \
100 * @head: name for struct plist_head variable
102 #define PLIST_HEAD(head) \ argument
103 struct plist_head head = PLIST_HEAD_INIT(head)
119 * @head: &struct plist_head pointer
122 plist_head_init(struct plist_head *head) in plist_head_init() argument
124 INIT_LIST_HEAD(&head->node_list); in plist_head_init()
[all …]
H A Dbtree-type.h14 static inline void BTREE_FN(init_mempool)(BTREE_TYPE_HEAD *head, in BTREE_FN()
17 btree_init_mempool(&head->h, mempool); in BTREE_FN()
20 static inline int BTREE_FN(init)(BTREE_TYPE_HEAD *head) in BTREE_FN()
22 return btree_init(&head->h); in BTREE_FN()
25 static inline void BTREE_FN(destroy)(BTREE_TYPE_HEAD *head) in BTREE_FN()
27 btree_destroy(&head->h); in BTREE_FN()
38 static inline void *BTREE_FN(lookup)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) in BTREE_FN()
41 return btree_lookup(&head->h, BTREE_TYPE_GEO, &_key); in BTREE_FN()
44 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, in BTREE_FN()
48 return btree_insert(&head->h, BTREE_TYPE_GEO, &_key, val, gfp); in BTREE_FN()
[all …]
/OK3568_Linux_fs/u-boot/include/linux/
H A Dlist.h56 * @head: list head to add it after
58 * Insert a new entry after the specified head.
61 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
63 __list_add(new, head, head->next); in list_add()
69 * @head: list head to add it before
71 * Insert a new entry before the specified head.
74 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
76 __list_add(new, head->prev, head); in list_add_tail()
139 * list_move - delete from one list and add as another's head
141 * @head: the head that will precede our entry
[all …]
/OK3568_Linux_fs/external/camera_engine_rkaiq/rkaiq/include/common/
H A Dlist.h5 …ernel.org/?p=linux/kernel/git/stable/linux-2.6.25.y.git;a=blob_plain;f=include/linux/list.h;hb=HEAD
70 * @head: list head to add it after
72 * Insert a new entry after the specified head.
75 static inline void list_add(struct list_head *n, struct list_head *head) in list_add() argument
77 __list_add(n, head, head->next); in list_add()
85 * @head: list head to add it before
87 * Insert a new entry before the specified head.
90 static inline void list_add_tail(struct list_head *n, struct list_head *head) in list_add_tail() argument
92 __list_add(n, head->prev, head); in list_add_tail()
156 * list_move - delete from one list and add as another's head
[all …]
/OK3568_Linux_fs/external/rk_pcba_test/pcba_minui/
H A Dlist.h108 * @head: list head to add it after
110 * Insert a new entry after the specified head.
113 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
115 __list_add(new, head, head->next); in list_add()
122 * @head: list head to add it before
124 * Insert a new entry before the specified head.
127 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
129 __list_add(new, head->prev, head); in list_add_tail()
202 * list_move - delete from one list and add as another's head
204 * @head: the head that will precede our entry
[all …]
/OK3568_Linux_fs/external/security/librkcrypto/include/
H A Drk_list.h114 * @head: list head to add it after
116 * Insert a new entry after the specified head.
119 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
121 __list_add(new, head, head->next); in list_add()
128 * @head: list head to add it before
130 * Insert a new entry before the specified head.
133 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
135 __list_add(new, head->prev, head); in list_add_tail()
217 * list_move - delete from one list and add as another's head
219 * @head: the head that will precede our entry
[all …]
/OK3568_Linux_fs/kernel/net/sched/
H A Dcls_matchall.c30 struct cls_mall_head *head = rcu_dereference_bh(tp->root); in mall_classify() local
32 if (unlikely(!head)) in mall_classify()
35 if (tc_skip_sw(head->flags)) in mall_classify()
38 *res = head->res; in mall_classify()
39 __this_cpu_inc(head->pf->rhit); in mall_classify()
40 return tcf_exts_exec(skb, &head->exts, res); in mall_classify()
48 static void __mall_destroy(struct cls_mall_head *head) in __mall_destroy() argument
50 tcf_exts_destroy(&head->exts); in __mall_destroy()
51 tcf_exts_put_net(&head->exts); in __mall_destroy()
52 free_percpu(head->pf); in __mall_destroy()
[all …]
/OK3568_Linux_fs/kernel/drivers/gpu/drm/nouveau/nvkm/engine/disp/
H A Dnv50.c25 #include "head.h"
96 disp->head.nr = func->head.cnt(&disp->base, &disp->head.mask); in nv50_disp_oneinit_()
97 nvkm_debug(subdev, " Head(s): %d (%02lx)\n", in nv50_disp_oneinit_()
98 disp->head.nr, disp->head.mask); in nv50_disp_oneinit_()
99 for_each_set_bit(i, &disp->head.mask, disp->head.nr) { in nv50_disp_oneinit_()
100 ret = func->head.new(&disp->base, i); in nv50_disp_oneinit_()
182 nv50_disp_super_iedt(struct nvkm_head *head, struct nvkm_outp *outp, in nv50_disp_super_iedt() argument
186 struct nvkm_bios *bios = head->disp->engine.subdev.device->bios; in nv50_disp_super_iedt()
189 const u16 m = (0x0100 << head->id) | (l << 6) | outp->info.or; in nv50_disp_super_iedt()
197 nv50_disp_super_ied_on(struct nvkm_head *head, in nv50_disp_super_ied_on() argument
[all …]
H A Dhead.c24 #include "head.h"
34 struct nvkm_head *head; in nvkm_head_find() local
35 list_for_each_entry(head, &disp->head, head) { in nvkm_head_find()
36 if (head->id == id) in nvkm_head_find()
37 return head; in nvkm_head_find()
44 struct nvkm_head *head, void *data, u32 size) in nvkm_head_mthd_scanoutpos() argument
51 nvif_ioctl(object, "head scanoutpos size %d\n", size); in nvkm_head_mthd_scanoutpos()
53 nvif_ioctl(object, "head scanoutpos vers %d\n", in nvkm_head_mthd_scanoutpos()
56 head->func->state(head, &head->arm); in nvkm_head_mthd_scanoutpos()
57 args->v0.vtotal = head->arm.vtotal; in nvkm_head_mthd_scanoutpos()
[all …]
H A Dgf119.c25 #include "head.h"
40 struct nvkm_head *head; in gf119_disp_super() local
44 list_for_each_entry(head, &disp->base.head, head) { in gf119_disp_super()
45 mask[head->id] = nvkm_rd32(device, 0x6101d4 + (head->id * 0x800)); in gf119_disp_super()
46 HEAD_DBG(head, "%08x", mask[head->id]); in gf119_disp_super()
52 list_for_each_entry(head, &disp->base.head, head) { in gf119_disp_super()
53 if (!(mask[head->id] & 0x00001000)) in gf119_disp_super()
55 nv50_disp_super_1_0(disp, head); in gf119_disp_super()
59 list_for_each_entry(head, &disp->base.head, head) { in gf119_disp_super()
60 if (!(mask[head->id] & 0x00001000)) in gf119_disp_super()
[all …]
/OK3568_Linux_fs/kernel/net/netlabel/
H A Dnetlabel_addrlist.h82 #define netlbl_af4list_foreach(iter, head) \ argument
83 for (iter = __af4list_valid((head)->next, head); \
84 &iter->list != (head); \
85 iter = __af4list_valid(iter->list.next, head))
87 #define netlbl_af4list_foreach_rcu(iter, head) \ argument
88 for (iter = __af4list_valid_rcu((head)->next, head); \
89 &iter->list != (head); \
90 iter = __af4list_valid_rcu(iter->list.next, head))
92 #define netlbl_af4list_foreach_safe(iter, tmp, head) \ argument
93 for (iter = __af4list_valid((head)->next, head), \
[all …]
/OK3568_Linux_fs/kernel/drivers/nvme/host/
H A Dmultipath.c57 sprintf(disk_name, "nvme%dn%d", ctrl->instance, ns->head->instance); in nvme_set_disk_name()
58 } else if (ns->head->disk) { in nvme_set_disk_name()
60 ctrl->instance, ns->head->instance); in nvme_set_disk_name()
64 ns->head->instance); in nvme_set_disk_name()
86 spin_lock_irqsave(&ns->head->requeue_lock, flags); in nvme_failover_req()
87 blk_steal_bios(&ns->head->requeue_list, req); in nvme_failover_req()
88 spin_unlock_irqrestore(&ns->head->requeue_lock, flags); in nvme_failover_req()
91 kblockd_schedule_work(&ns->head->requeue_work); in nvme_failover_req()
100 if (ns->head->disk) in nvme_kick_requeue_lists()
101 kblockd_schedule_work(&ns->head->requeue_work); in nvme_kick_requeue_lists()
[all …]

12345678910>>...186