Home
last modified time | relevance | path

Searched refs:next (Results 1 - 25 of 7358) sorted by relevance

12345678910>>...295

/device/soc/hisilicon/hi3861v100/sdk_liteos/third_party/libcoap/include/coap2/
H A Dutlist.h40 * To use singly-linked lists, your structure must have a "next" pointer.
41 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
47 * struct item *prev, *next;
84 * to dereference its prev/next pointers, and save/restore the real head.*/
89 #define UTLIST_NEXT(elt,list,next) ((char*)((list)->next))
90 #define UTLIST_NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to); }
98 #define UTLIST_NEXT(elt,list,next) ((elt)->next)
[all...]
/device/soc/hisilicon/hi3516dv300/sdk_linux/drv/osal/include/
H A Dosal_list.h30 * sometimes we already know the next/prev entries and we can
35 struct osal_list_head *next, *prev; member
47 list->next = list; in OSAL_INIT_LIST_HEAD()
55 * the prev/next entries already!
59 struct osal_list_head *next) in osal___list_add()
61 next->prev = new; in osal___list_add()
62 new->next = next; in osal___list_add()
64 prev->next = new; in osal___list_add()
77 osal___list_add(new, head, head->next); in osal_list_add()
57 osal___list_add(struct osal_list_head *new, struct osal_list_head *prev, struct osal_list_head *next) osal___list_add() argument
100 osal___list_del(struct osal_list_head *prev, struct osal_list_head *next) osal___list_del() argument
218 struct osal_list_head *next = head->next; osal_list_empty_careful() local
288 osal___list_splice(const struct osal_list_head *list, struct osal_list_head *prev, struct osal_list_head *next) osal___list_splice() argument
595 struct osal_hlist_node *next, **pprev; global() member
625 struct osal_hlist_node *next = n->next; osal___hlist_del() local
660 osal_hlist_add_before(struct osal_hlist_node *n, struct osal_hlist_node *next) osal_hlist_add_before() argument
669 osal_hlist_add_after(struct osal_hlist_node *n, struct osal_hlist_node *next) osal_hlist_add_after() argument
[all...]
/device/soc/hisilicon/hi3516dv300/sdk_linux/include/
H A Dosal_list.h27 * sometimes we already know the next/prev entries and we can
32 struct osal_list_head *next, *prev; member
44 list->next = list; in OSAL_INIT_LIST_HEAD()
52 * the prev/next entries already!
56 struct osal_list_head *next) in osal___list_add()
58 next->prev = new; in osal___list_add()
59 new->next = next; in osal___list_add()
61 prev->next = new; in osal___list_add()
74 osal___list_add(new, head, head->next); in osal_list_add()
54 osal___list_add(struct osal_list_head *new, struct osal_list_head *prev, struct osal_list_head *next) osal___list_add() argument
97 osal___list_del(struct osal_list_head *prev, struct osal_list_head *next) osal___list_del() argument
215 struct osal_list_head *next = head->next; osal_list_empty_careful() local
285 osal___list_splice(const struct osal_list_head *list, struct osal_list_head *prev, struct osal_list_head *next) osal___list_splice() argument
592 struct osal_hlist_node *next, **pprev; global() member
622 struct osal_hlist_node *next = n->next; osal___hlist_del() local
657 osal_hlist_add_before(struct osal_hlist_node *n, struct osal_hlist_node *next) osal_hlist_add_before() argument
666 osal_hlist_add_after(struct osal_hlist_node *n, struct osal_hlist_node *next) osal_hlist_add_after() argument
[all...]
H A Dlist.h31 (ptr)->next = (ptr); \
38 struct list_head *next, *prev; member
41 static inline void __list_add(struct list_head *_new, struct list_head *prev, struct list_head *next) in __list_add() argument
43 next->prev = _new; in __list_add()
44 _new->next = next; in __list_add()
46 prev->next = _new; in __list_add()
51 __list_add(_new, head, head->next); in list_add()
59 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
61 next in __list_del()
[all...]
/device/soc/hisilicon/hi3516dv300/sdk_liteos/include/
H A Dosal_list.h26 * sometimes we already know the next/prev entries and we can
31 struct osal_list_head *next, *prev; member
43 list->next = list; in OSAL_INIT_LIST_HEAD()
51 * the prev/next entries already!
55 struct osal_list_head *next) in osal___list_add()
57 next->prev = new; in osal___list_add()
58 new->next = next; in osal___list_add()
60 prev->next = new; in osal___list_add()
73 osal___list_add(new, head, head->next); in osal_list_add()
53 osal___list_add(struct osal_list_head *new, struct osal_list_head *prev, struct osal_list_head *next) osal___list_add() argument
96 osal___list_del(struct osal_list_head *prev, struct osal_list_head *next) osal___list_del() argument
214 struct osal_list_head *next = head->next; osal_list_empty_careful() local
284 osal___list_splice(const struct osal_list_head *list, struct osal_list_head *prev, struct osal_list_head *next) osal___list_splice() argument
591 struct osal_hlist_node *next, **pprev; global() member
621 struct osal_hlist_node *next = n->next; osal___hlist_del() local
656 osal_hlist_add_before(struct osal_hlist_node *n, struct osal_hlist_node *next) osal_hlist_add_before() argument
665 osal_hlist_add_after(struct osal_hlist_node *n, struct osal_hlist_node *next) osal_hlist_add_after() argument
[all...]
H A Dlist.h31 (ptr)->next = (ptr); \
38 struct list_head *next, *prev; member
41 static inline void __list_add(struct list_head *_new, struct list_head *prev, struct list_head *next) in __list_add() argument
43 next->prev = _new; in __list_add()
44 _new->next = next; in __list_add()
46 prev->next = _new; in __list_add()
51 __list_add(_new, head, head->next); in list_add()
59 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
61 next in __list_del()
[all...]
/device/soc/hisilicon/hi3751v350/sdk_linux/source/common/drv/include/
H A Dosal_list.h29 * sometimes we already know the next/prev entries and we can
34 struct osal_list_head *next, *prev; member
46 list->next = list; in OSAL_INIT_LIST_HEAD()
54 * the prev/next entries already!
58 struct osal_list_head *next) in osal___list_add()
60 next->prev = new; in osal___list_add()
61 new->next = next; in osal___list_add()
63 prev->next = new; in osal___list_add()
76 osal___list_add(new, head, head->next); in osal_list_add()
56 osal___list_add(struct osal_list_head *new, struct osal_list_head *prev, struct osal_list_head *next) osal___list_add() argument
99 osal___list_del(struct osal_list_head *prev, struct osal_list_head *next) osal___list_del() argument
217 struct osal_list_head *next = head->next; osal_list_empty_careful() local
283 osal___list_splice(const struct osal_list_head *list, struct osal_list_head *prev, struct osal_list_head *next) osal___list_splice() argument
590 struct osal_hlist_node *next, **pprev; global() member
620 struct osal_hlist_node *next = n->next; osal___hlist_del() local
655 osal_hlist_add_before(struct osal_hlist_node *n, struct osal_hlist_node *next) osal_hlist_add_before() argument
664 osal_hlist_add_after(struct osal_hlist_node *n, struct osal_hlist_node *next) osal_hlist_add_after() argument
[all...]
/device/soc/hisilicon/hi3861v100/sdk_liteos/include/
H A Dhi_list.h36 struct hi_list *next; member
46 list->next = list; in hi_list_init()
56 node->next = list->next; in hi_list_head_insert()
58 list->next->prev = node; in hi_list_head_insert()
59 list->next = node; in hi_list_head_insert()
77 if (node->next == HI_NULL || node->prev == HI_NULL) { in hi_list_delete()
81 node->next->prev = node->prev; in hi_list_delete()
82 node->prev->next = node->next; in hi_list_delete()
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dlist.h18 * sometimes we already know the next/prev entries and we can
37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
55 struct list_head *next);
67 struct list_head *next) in __list_add_valid()
73 * With the hardening version, elide checking if next and prev in __list_add_valid()
83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
88 ret &= __list_add_valid_or_report(new, prev, next); in __list_add_valid()
65 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
112 struct list_head *next = entry->next; __list_del_entry_valid() local
128 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
146 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
193 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
409 struct list_head *next = smp_load_acquire(&head->next); list_empty_careful() local
523 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
977 struct hlist_node *next = n->next; __hlist_del() local
1036 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/device/soc/hisilicon/common/platform/wifi/hi3881v100/driver/include/
H A Dhi_list.h31 struct hi_list *next; member
40 list->next = list; in hi_list_init()
50 node->next = list->next; in hi_list_head_insert()
52 list->next->prev = node; in hi_list_head_insert()
53 list->next = node; in hi_list_head_insert()
62 node->next = list->next; in hi_list_head_insert_optimize()
64 list->next->prev = node; in hi_list_head_insert_optimize()
65 list->next in hi_list_head_insert_optimize()
[all...]
/kernel/linux/linux-5.10/tools/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list; in INIT_LIST_HEAD()
35 * the prev/next entries already!
40 struct list_head *next) in __list_add()
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
45 prev->next = new; in __list_add()
50 struct list_head *next);
63 __list_add(new, head, head->next); in list_add()
38 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
87 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
207 struct list_head *next = head->next; list_empty_careful() local
274 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
616 struct hlist_node *next = n->next; __hlist_del() local
650 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/kernel/linux/linux-6.6/tools/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list; in INIT_LIST_HEAD()
35 * the prev/next entries already!
40 struct list_head *next) in __list_add()
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
45 prev->next = new; in __list_add()
50 struct list_head *next);
63 __list_add(new, head, head->next); in list_add()
38 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
87 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
207 struct list_head *next = head->next; list_empty_careful() local
274 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
627 struct hlist_node *next = n->next; __hlist_del() local
661 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dlist.h16 * sometimes we already know the next/prev entries and we can
35 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
42 struct list_head *next);
47 struct list_head *next) in __list_add_valid()
61 * the prev/next entries already!
65 struct list_head *next) in __list_add()
67 if (!__list_add_valid(new, prev, next)) in __list_add()
70 next->prev = new; in __list_add()
71 new->next = next; in __list_add()
45 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
63 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
110 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
318 struct list_head *next = smp_load_acquire(&head->next); list_empty_careful() local
433 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
835 struct hlist_node *next = n->next; __hlist_del() local
894 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/kernel/linux/linux-6.6/lib/
H A Dlist_debug.c23 struct list_head *next) in __list_add_valid_or_report()
27 CHECK_DATA_CORRUPTION(next == NULL, in __list_add_valid_or_report()
28 "list_add corruption. next is NULL.\n") || in __list_add_valid_or_report()
29 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid_or_report()
30 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", in __list_add_valid_or_report()
31 prev, next->prev, next) || in __list_add_valid_or_report()
32 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid_or_report()
22 __list_add_valid_or_report(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid_or_report() argument
47 struct list_head *prev, *next; __list_del_entry_valid_or_report() local
[all...]
/kernel/linux/linux-5.10/lib/
H A Dlist_debug.c21 struct list_head *next) in __list_add_valid()
25 CHECK_DATA_CORRUPTION(next == NULL, in __list_add_valid()
26 "list_add corruption. next is NULL.\n") || in __list_add_valid()
27 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid()
28 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", in __list_add_valid()
29 prev, next->prev, next) || in __list_add_valid()
30 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid()
20 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
44 struct list_head *prev, *next; __list_del_entry_valid() local
[all...]
/kernel/linux/linux-6.6/io_uring/
H A Dslist.h7 for (pos = (head)->first; pos; pos = (pos)->next)
10 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
13 for (; pos; prv = pos, pos = (pos)->next)
25 struct io_wq_work_node *next = pos->next; in wq_list_add_after() local
27 pos->next = node; in wq_list_add_after()
28 node->next = next; in wq_list_add_after()
29 if (!next) in wq_list_add_after()
36 node->next in wq_list_add_tail()
[all...]
/device/soc/hisilicon/hi3516dv300/sdk_linux/drv/mpp/cbb/include/
H A Dlist.h34 (ptr)->next = (ptr); \
41 struct list_head *next, *prev; member
44 static inline void __list_add(struct list_head *_new, struct list_head *prev, struct list_head *next) in __list_add() argument
46 next->prev = _new; in __list_add()
47 _new->next = next; in __list_add()
49 prev->next = _new; in __list_add()
54 __list_add(_new, head, head->next); in list_add()
62 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
64 next in __list_del()
[all...]
/foundation/communication/dsoftbus/components/nstackx/nstackx_util/interface/
H A Dnstackx_list.h28 struct List *next; member
33 head->next = head; in ListInitHead()
39 node->next = head->next; in ListInsertHead()
40 node->next->prev = node; in ListInsertHead()
42 head->next = node; in ListInsertHead()
48 node->prev->next = node; in ListInsertTail()
49 node->next = head; in ListInsertTail()
58 node->next->prev = node->prev; in ListRemoveNode()
59 node->prev->next in ListRemoveNode()
[all...]
/foundation/resourceschedule/ffrt/src/util/
H A Dlinked_list.h25 LinkedList() : prev(this), next(this) in LinkedList()
29 LinkedList(LinkedList* prev, LinkedList* next) : prev(prev), next(next) in LinkedList() argument
53 node->next = cur->next;
55 cur->next->prev = node;
56 cur->next = node;
61 node->next = cur;
63 cur->prev->next
105 LinkedList* next = cur->next; global() variable
116 LinkedList* next = cur->next; global() variable
126 LinkedList* next = cur->next; global() variable
127 Delete(next); global() variable
138 LinkedList* next = cur->next; global() variable
139 Delete(next); global() variable
289 LinkedList* next; global() member in ffrt::LinkedList
[all...]
/device/soc/hisilicon/hi3516dv300/sdk_linux/sample/platform/higv/include/
H A Dlinux_cbb_list.h27 struct cbb_list_head *next, *prev; member
40 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
44 struct cbb_list_head *prev, struct cbb_list_head *next) in inline_cbb_list_add()
46 if (prev == NULL || _new == NULL || next == NULL) { in inline_cbb_list_add()
50 next->prev = _new; in inline_cbb_list_add()
51 _new->next = next; in inline_cbb_list_add()
53 prev->next = _new; in inline_cbb_list_add()
62 inline_cbb_list_add(_new, head, head->next); in cbb_list_add()
74 static HPT_INLINE void inline_cbb_list_del(struct cbb_list_head *prev, struct cbb_list_head *next) in inline_cbb_list_del() argument
43 inline_cbb_list_add(struct cbb_list_head *_new, struct cbb_list_head *prev, struct cbb_list_head *next) inline_cbb_list_add() argument
[all...]
/kernel/linux/linux-5.10/drivers/block/zram/zram_group/
H A Dzlist.c38 struct zlist_node *next) in zlist_before_add_check()
40 assert(idx2node(prev->next, tab) == next); in zlist_before_add_check()
41 assert(idx2node(next->prev, tab) == prev); in zlist_before_add_check()
43 assert(idx2node(node->next, tab) == node); in zlist_before_add_check()
48 struct zlist_node *next) in zlist_after_add_check()
50 assert(idx2node(prev->next, tab) == node); in zlist_after_add_check()
51 assert(idx2node(next->prev, tab) == node); in zlist_after_add_check()
53 assert(idx2node(node->next, tab) == next); in zlist_after_add_check()
36 zlist_before_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_add_check() argument
46 zlist_after_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_add_check() argument
56 zlist_before_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_del_check() argument
66 zlist_after_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_del_check() argument
76 zlist_before_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_add_check() argument
79 zlist_after_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_add_check() argument
82 zlist_before_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_del_check() argument
85 zlist_after_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_del_check() argument
118 struct zlist_node *next = idx2node(nid, tab); zlist_add_nolock() local
165 struct zlist_node *next = idx2node(nid, tab); zlist_del_nolock() local
[all...]
/kernel/linux/linux-6.6/drivers/block/zram/zram_group/
H A Dzlist.c38 struct zlist_node *next) in zlist_before_add_check()
40 assert(idx2node(prev->next, tab) == next); in zlist_before_add_check()
41 assert(idx2node(next->prev, tab) == prev); in zlist_before_add_check()
43 assert(idx2node(node->next, tab) == node); in zlist_before_add_check()
48 struct zlist_node *next) in zlist_after_add_check()
50 assert(idx2node(prev->next, tab) == node); in zlist_after_add_check()
51 assert(idx2node(next->prev, tab) == node); in zlist_after_add_check()
53 assert(idx2node(node->next, tab) == next); in zlist_after_add_check()
36 zlist_before_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_add_check() argument
46 zlist_after_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_add_check() argument
56 zlist_before_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_del_check() argument
66 zlist_after_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_del_check() argument
76 zlist_before_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_add_check() argument
79 zlist_after_add_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_add_check() argument
82 zlist_before_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_before_del_check() argument
85 zlist_after_del_check(struct zlist_table *tab, struct zlist_node *prev, struct zlist_node *node, struct zlist_node *next) zlist_after_del_check() argument
118 struct zlist_node *next = idx2node(nid, tab); zlist_add_nolock() local
165 struct zlist_node *next = idx2node(nid, tab); zlist_del_nolock() local
[all...]
/foundation/communication/dsoftbus/core/common/include/
H A Dcommon_list.h30 struct ListNode *next; /* Current node's pointer to the next node */ member
36 list->next = list; in ListInit()
41 #define GET_LIST_HEAD(object) ((object)->next)
49 node->next = list->next; in ListAdd()
51 list->next->prev = node; in ListAdd()
52 list->next = node; in ListAdd()
70 if (node->next != 0 && node->prev != 0) { in ListDelete()
71 node->next in ListDelete()
[all...]
/kernel/linux/linux-5.10/tools/usb/usbip/libsrc/
H A Dlist.h14 * sometimes we already know the next/prev entries and we can
20 struct list_head *next, *prev; member
30 list->next = list; in INIT_LIST_HEAD()
38 * the prev/next entries already!
42 struct list_head *next) in __list_add()
44 next->prev = new; in __list_add()
45 new->next = next; in __list_add()
47 prev->next = new; in __list_add()
60 __list_add(new, head, head->next); in list_add()
40 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
70 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
[all...]
/kernel/linux/linux-6.6/tools/usb/usbip/libsrc/
H A Dlist.h14 * sometimes we already know the next/prev entries and we can
20 struct list_head *next, *prev; member
30 list->next = list; in INIT_LIST_HEAD()
38 * the prev/next entries already!
42 struct list_head *next) in __list_add()
44 next->prev = new; in __list_add()
45 new->next = next; in __list_add()
47 prev->next = new; in __list_add()
60 __list_add(new, head, head->next); in list_add()
40 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
70 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
[all...]

Completed in 14 milliseconds

12345678910>>...295