Home
last modified time | relevance | path

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

12345678910>>...27

/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...]
/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...]
/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...]
H A DIntrusiveList.h25 // if next point to self, isn't in list
28 return next != this;
30 explicit SListNode(SListNode* p) noexcept : next {p}
38 std::swap(next, rhs.next);
44 SListNode* next {this};
51 return m_head.next == nullptr;
72 nd.next = std::exchange(m_head.next, &nd);
80 auto node = m_head.next;
[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...]
/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...]
/device/soc/rockchip/common/kernel/drivers/gpu/arm/mali400/mali/common/
H A Dmali_osk_list.h26 MALI_STATIC_INLINE void __mali_osk_list_add(_mali_osk_list_t *new_entry, _mali_osk_list_t *prev, _mali_osk_list_t *next) in __mali_osk_list_add() argument
28 next->prev = new_entry; in __mali_osk_list_add()
29 new_entry->next = next; in __mali_osk_list_add()
31 prev->next = new_entry; in __mali_osk_list_add()
34 MALI_STATIC_INLINE void __mali_osk_list_del(_mali_osk_list_t *prev, _mali_osk_list_t *next) in __mali_osk_list_del() argument
36 next->prev = prev; in __mali_osk_list_del()
37 prev->next = next; in __mali_osk_list_del()
73 list->next in _mali_osk_list_init()
[all...]
/device/soc/rockchip/common/vendor/drivers/gpu/arm/mali400/mali/common/
H A Dmali_osk_list.h27 MALI_STATIC_INLINE void __mali_osk_list_add(_mali_osk_list_t *new_entry, _mali_osk_list_t *prev, _mali_osk_list_t *next) in __mali_osk_list_add() argument
29 next->prev = new_entry; in __mali_osk_list_add()
30 new_entry->next = next; in __mali_osk_list_add()
32 prev->next = new_entry; in __mali_osk_list_add()
35 MALI_STATIC_INLINE void __mali_osk_list_del(_mali_osk_list_t *prev, _mali_osk_list_t *next) in __mali_osk_list_del() argument
37 next->prev = prev; in __mali_osk_list_del()
38 prev->next = next; in __mali_osk_list_del()
74 list->next in mali_osk_list_init()
[all...]
/foundation/barrierfree/accessibility/services/aams/src/
H A Daccessibility_event_transmission.cpp25 auto next = GetNext(); in OnKeyEvent() local
26 if (next != nullptr) { in OnKeyEvent()
27 return next->OnKeyEvent(event); in OnKeyEvent()
36 auto next = GetNext(); in OnPointerEvent() local
37 if (next != nullptr) { in OnPointerEvent()
38 return next->OnPointerEvent(event); in OnPointerEvent()
47 auto next = GetNext(); in OnMoveMouse() local
48 if (next != nullptr) { in OnMoveMouse()
49 next->OnMoveMouse(offsetX, offsetY); in OnMoveMouse()
53 void EventTransmission::SetNext(const sptr<EventTransmission> &next) in SetNext() argument
71 auto next = GetNext(); DestroyEvents() local
[all...]
/foundation/communication/dsoftbus/components/nstackx/fillp/src/public/include/
H A Dhlist.h24 struct HlistNode *next; member
39 (ptr)->head.next = FILLP_NULL_PTR; \
40 (ptr)->head.pprev = &((ptr)->head.next); \
45 (node)->next = FILLP_NULL_PTR; \
51 #define HLIST_FIRST(_list) ((_list)->head.next)
55 for ((_pos) = HLIST_FIRST(list); ((_pos) != FILLP_NULL_PTR) && ((_next) = (_pos)->next, FILLP_TRUE); \
59 for (; ((_pos) != FILLP_NULL_PTR) && ((_next) = (_pos)->next, FILLP_TRUE); (_pos) = (_next))
71 if (prev->next != FILLP_NULL_PTR) { in HlistAddAfter()
72 prev->next->pprev = &toBeAdded->next; in HlistAddAfter()
[all...]
/foundation/resourceschedule/ffrt/src/sync/
H A Dwait_queue.h76 whead->next = whead; in WaitQueue()
102 return (whead->next == whead); in empty()
120 we->next = whead; in push_back()
122 whead->prev->next = we; in push_back()
128 if ((whead->next == nullptr) || (whead->next->next == nullptr)) { in pop_front()
129 FFRT_LOGE("whead->next or whead->next->next i in pop_front()
[all...]
/device/soc/rockchip/rk3588/hardware/mpp/include/
H A Dmpp_list.h92 struct list_head *next, *prev; member
101 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
105 for (pos = (head)->next, n = pos->next; pos != (head); \
106 pos = n, n = pos->next)
112 list_entry((ptr)->next, type, member)
119 struct list_head *pos__ = head__->next; \
124 list_entry((pos)->member.next, type, member)
130 for (pos = list_entry((head)->next, type, member); \
153 struct list_head * next) in __list_add()
151 __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) __list_add() argument
171 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
[all...]
/foundation/arkui/ace_engine_lite/frameworks/src/core/base/
H A Dasync_task_manager.cpp69 head_ = head_->next; in Reset()
106 head_ = head_->next; in Callback()
139 task->next = nullptr; in Dispatch()
144 tail_->next = task; in Dispatch()
163 head_ = head_->next; in Cancel()
165 prev->next = node->next; in Cancel()
175 node = node->next; in Cancel()
189 AsyncTask *next = nullptr; in CancelWithContext() local
191 next in CancelWithContext()
[all...]
/foundation/distributeddatamgr/kv_store/interfaces/innerkits/distributeddata/include/
H A Dpool.h38 idle_ = idle_->next; in Get()
42 cur->next = busy_; in Get()
60 if (cur->next != nullptr) { in Release()
61 cur->next->prev = cur->prev; in Release()
64 cur->prev->next = cur->next; in Release()
67 idle_ = cur->next; in Release()
73 cur = cur->next; in Release()
85 cur = cur->next; in Idle()
91 busy_ = busy_->next; in Idle()
124 Node *next = nullptr; global() member
[all...]
/foundation/distributeddatamgr/preferences/frameworks/native/include/
H A Dpool.h40 idle_ = idle_->next; in Get()
44 cur->next = busy_; in Get()
62 if (cur->next != nullptr) { in Release()
63 cur->next->prev = cur->prev; in Release()
66 cur->prev->next = cur->next; in Release()
69 idle_ = cur->next; in Release()
75 cur = cur->next; in Release()
87 cur = cur->next; in Idle()
93 busy_ = busy_->next; in Idle()
126 Node *next = nullptr; global() member
[all...]
/foundation/arkui/napi/sample/native_module_netserver/
H A Devent_target.cpp29 EventListener* next = nullptr; member
42 temp = i->next; in ~EventTarget()
44 first_ = first_->next; in ~EventTarget()
48 i->next->back = i->back; in ~EventTarget()
49 i->back->next = i->next; in ~EventTarget()
70 last_->next = tmp; in On()
71 last_->next->back = last_; in On()
72 last_ = last_->next; in On()
91 last_->next in Once()
[all...]

Completed in 10 milliseconds

12345678910>>...27