| /ohos5.0/drivers/hdf_core/interfaces/inner_api/utils/ |
| H A D | hdf_dlist.h | 58 head->next = head; in DListHeadInit()
83 entry->prev->next = entry->next; in DListRemove()
87 entry->next = NULL; in DListRemove()
101 entry->next = head->next; in DListInsertHead()
105 head->next = entry; in DListInsertHead()
119 entry->next = head; in DListInsertTail()
138 list->prev->next = head->next; in DListMerge()
141 head->next = list->next; in DListMerge()
155 struct DListHead *next = head->next; in DListGetCount() local
157 while (next != head) { in DListGetCount()
[all …]
|
| /ohos5.0/foundation/communication/dsoftbus/components/nstackx/nstackx_util/interface/ |
| H A D | nstackx_list.h | 28 struct List *next; member
33 head->next = head; in ListInitHead()
39 node->next = head->next; in ListInsertHead()
42 head->next = node; in ListInsertHead()
49 node->next = head; in ListInsertTail()
59 node->prev->next = node->next; in ListRemoveNode()
60 node->next = NULL; in ListRemoveNode()
88 prevHead->prev->next = newHead->next; in ListInsertNewHead()
99 to->next = first; in ListMove()
102 last->next = to; in ListMove()
[all …]
|
| /ohos5.0/base/request/request/frameworks/js/napi/src/ |
| H A D | utf8_utils.cpp | 56 next = v[index]; in GetNextByte()
65 uint8_t next = 0; in Check2Bytes() local
66 return GetNextByte(v, index, next) && (next >= 0x80 && next <= 0xBF); in Check2Bytes()
74 uint8_t next = 0; in Check3Bytes() local
79 if (first == 0xE0 && next >= 0xA0 && next <= 0xBF) { in Check3Bytes()
80 } else if (first >= 0xE1 && first <= 0xEC && next >= 0x80 && next <= 0xBF) { in Check3Bytes()
81 } else if (first == 0xED && next >= 0x80 && next <= 0x9F) { in Check3Bytes()
82 } else if (first >= 0xEE && first <= 0xEF && next >= 0x80 && next <= 0xBF) { in Check3Bytes()
95 uint8_t next = 0; in Check4Bytes() local
100 if (first == 0xF0 && next >= 0x90 && next <= 0xBF) { in Check4Bytes()
[all …]
|
| /ohos5.0/drivers/hdf_core/framework/utils/src/ |
| H A D | hdf_slist.c | 61 link->next = list->root; in HdfSListAdd()
78 link->next = NULL; in HdfSListAddTail()
79 iterator->next = link; in HdfSListAddTail()
100 for (iterator = list->root; iterator && iterator->next; iterator = iterator->next) { in HdfSListAddOrder()
102 link->next = iterator->next; in HdfSListAddOrder()
108 link->next = NULL; in HdfSListAddOrder()
111 link->next = NULL; in HdfSListAddOrder()
112 iterator->next = link; in HdfSListAddOrder()
126 iterator->next = link->next; in HdfSListRemove()
178 return link->next; in HdfSListNext()
[all …]
|
| /ohos5.0/foundation/resourceschedule/ffrt/src/util/ |
| H A D | IntrusiveList.h | 28 return next != this; in IsLinked()
38 std::swap(next, rhs.next); in Swap()
44 SListNode* next {this};
72 nd.next = std::exchange(m_head.next, &nd); in PushFront()
81 m_head.next = std::exchange(node->next, node); in PopFront()
112 ListNode* next {this};
125 m_head.next = x; in List()
173 nd.next = m_head.next; in PushFront()
174 m_head.next = &nd; in PushFront()
184 nd.next = &m_tail; in PushBack()
[all …]
|
| H A D | linked_list.h | 29 LinkedList(LinkedList* prev, LinkedList* next) : prev(prev), next(next) in LinkedList() argument
53 node->next = cur->next; in InsertAfter()
69 node.prev->next = node.next; in Delete()
77 node->prev->next = node->next; in Delete()
105 LinkedList* next = cur->next; in Next() local
106 return next; in Next()
116 LinkedList* next = cur->next; in Next() local
126 LinkedList* next = cur->next; in RemoveNext() local
128 return next; in RemoveNext()
138 LinkedList* next = cur->next; in RemoveNext() local
[all …]
|
| /ohos5.0/foundation/communication/dsoftbus/core/common/include/ |
| H A D | common_list.h | 36 list->next = list; in ListInit()
49 node->next = list->next; in ListAdd()
51 list->next->prev = node; in ListAdd()
52 list->next = node; in ListAdd()
71 node->next->prev = node->prev; in ListDelete()
72 node->prev->next = node->next; in ListDelete()
74 node->next = node; in ListDelete()
121 prevNode->next = nextNode; in ListDel()
127 ListDel(list->prev, list->next); in ListDelInit()
133 for ((item) = (list)->next; (item) != (list); (item) = (item)->next)
[all …]
|
| /ohos5.0/base/tee/tee_client/frameworks/include/ |
| H A D | tee_client_list.h | 23 .next = &(name), \
29 list->next = list; in ListInit()
39 list->next->prev = entry; in ListInsertHead()
40 entry->next = list->next; in ListInsertHead()
42 list->next = entry; in ListInsertHead()
47 entry->next = list; in ListInsertTail()
49 list->prev->next = entry; in ListInsertTail()
55 entry->prev->next = entry->next; in ListRemoveEntry()
63 entry = list->next; in ListRemoveHead()
83 for ((pos) = (list)->next; (pos) != (list); (pos) = (pos)->next)
[all …]
|
| /ohos5.0/foundation/distributeddatamgr/pasteboard/utils/native/include/ |
| H A D | pasteboard_linked_list.h | 32 ListNode<T> *next; member
62 next = iter->next; in Clear()
64 iter = next; in Clear()
66 head_->next = nullptr; in Clear()
77 newNode->next = head_->next; in InsertFront()
78 head_->next = newNode; in InsertFront()
90 while (iter->next) { in InsertTail()
91 iter = iter->next; in InsertTail()
93 iter->next = newNode; in InsertTail()
107 prev->next = iter->next; in RemoveIf()
[all …]
|
| /ohos5.0/foundation/barrierfree/accessibility/services/aams/src/ |
| H A D | accessibility_event_transmission.cpp | 25 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()
47 auto next = GetNext(); in OnMoveMouse() local
48 if (next != nullptr) { in OnMoveMouse()
57 next_ = next; in SetNext()
71 auto next = GetNext(); in DestroyEvents() local
72 if (next != nullptr) { in DestroyEvents()
[all …]
|
| /ohos5.0/base/security/device_security_level/baselib/utils/include/ |
| H A D | utils_dslm_list.h | 20 struct TagListHead *next; member
28 item->next = where->next; in AddListNode()
30 where->next = item; in AddListNode()
31 item->next->prev = item; in AddListNode()
41 item->prev->next = item->next; in RemoveListNode()
42 item->next->prev = item->prev; in RemoveListNode()
47 return head->next == head; in IsEmptyList()
52 head->next = head; in InitListHead()
61 …e FOREACH_LIST_NODE(item, head) for ((item) = (head)->next; (item) != (head); (item) = (item)->nex…
64 …for ((item) = (head)->next, (temp) = (item)->next; (item) != (head); (item) = (temp), (temp) = (it…
|
| /ohos5.0/foundation/arkui/napi/sample/native_module_netserver/ |
| H A D | event_target.cpp | 29 EventListener* next = nullptr; member
42 temp = i->next; in ~EventTarget()
44 first_ = first_->next; 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 = tmp; in Once()
93 last_ = last_->next; in Once()
122 eventListener->back->next = eventListener->next; in Off()
[all …]
|
| /ohos5.0/base/security/huks/utils/list/ |
| H A D | hks_double_list.c | 29 node->next = node; in InitializeDoubleList()
38 if (head->next == NULL) { in AddNodeAfterDoubleListHead()
39 head->next = head; in AddNodeAfterDoubleListHead()
42 head->next->prev = node; in AddNodeAfterDoubleListHead()
43 node->next = head->next; in AddNodeAfterDoubleListHead()
45 head->next = node; in AddNodeAfterDoubleListHead()
58 head->prev->next = node; in AddNodeAtDoubleListTail()
59 node->next = head; in AddNodeAtDoubleListTail()
70 if (node->next != NULL) { in RemoveDoubleListNode()
75 node->prev->next = node->next; in RemoveDoubleListNode()
[all …]
|
| /ohos5.0/base/security/certificate_manager/services/cert_manager_standard/cert_manager_engine/main/core/src/ |
| H A D | cert_manager_double_list.c | 29 listNode->next = listNode; in CmInitList()
38 if (listHead->next == NULL) { in CmAddNodeAfterListHead()
39 listHead->next = listHead; in CmAddNodeAfterListHead()
42 listHead->next->prev = listNode; in CmAddNodeAfterListHead()
43 listNode->next = listHead->next; in CmAddNodeAfterListHead()
45 listHead->next = listNode; in CmAddNodeAfterListHead()
58 listHead->prev->next = listNode; in CmAddNodeAtListTail()
59 listNode->next = listHead; in CmAddNodeAtListTail()
70 if (listNode->next != NULL) { in CmRemoveNodeFromList()
75 listNode->prev->next = listNode->next; in CmRemoveNodeFromList()
[all …]
|
| /ohos5.0/foundation/communication/dsoftbus/components/nstackx/fillp/src/public/include/ |
| H A D | hlist.h | 24 struct HlistNode *next; member
39 (ptr)->head.next = FILLP_NULL_PTR; \
45 (node)->next = FILLP_NULL_PTR; \
71 if (prev->next != FILLP_NULL_PTR) { in HlistAddAfter()
72 prev->next->pprev = &toBeAdded->next; in HlistAddAfter()
77 toBeAdded->next = prev->next; in HlistAddAfter()
78 toBeAdded->pprev = &prev->next; in HlistAddAfter()
79 prev->next = toBeAdded; in HlistAddAfter()
104 HLIST_PREV(n)->next = n->next; in HlistDelete()
105 if (n->next != FILLP_NULL_PTR) { in HlistDelete()
[all …]
|
| /ohos5.0/base/startup/init/services/utils/ |
| H A D | list.c | 34 node->next = node; in OH_ListInit()
50 item->next = head; in OH_ListAddTail()
52 head->prev->next = item; in OH_ListAddTail()
69 item->prev->next = item->next; in OH_ListRemove()
91 match = head->next; in OH_ListAddWithOrder()
96 match = match->next; in OH_ListAddWithOrder()
103 item->next = match; in OH_ListAddWithOrder()
124 match = head->next; in OH_ListFind()
155 ListNode *next; in OH_ListTraversal() local
170 next = match->next; in OH_ListTraversal()
[all …]
|
| /ohos5.0/foundation/communication/dhcp/services/dhcp_server/src/ |
| H A D | dhcp_option.cpp | 44 pNode->previous = pNode->next = 0; in CreateOptionNode()
80 pOptions->last->next = nullptr; in InitOptionList()
105 pOptions->last->next = pNode; in PushBackOption()
129 pOptions->first->next = pNode; in PushFrontOption()
132 pNode->next = pOptions->first->next; in PushFrontOption()
133 pNode->next->previous = pNode; in PushFrontOption()
159 pNode->previous->next = pNode->next; in RemoveOption()
174 pNode = pNode->next; in GetOptionNode()
200 pNode->previous->next = pNode->next; in ClearOptions()
209 pOptions->last->next = nullptr; in ClearOptions()
[all …]
|
| /ohos5.0/foundation/resourceschedule/ffrt/src/sync/ |
| H A D | wait_queue.h | 72 whead->next = whead; in WaitQueue()
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()
132 WaitEntry *we = whead->next; in pop_front()
133 whead->next = we->next; in pop_front()
134 we->next->prev = whead; in pop_front()
135 we->next = nullptr; in pop_front()
145 we->prev->next = we->next; in remove()
146 we->next->prev = we->prev; in remove()
[all …]
|
| /ohos5.0/foundation/communication/bluetooth_service/services/bluetooth/stack/platform/src/ |
| H A D | packet.c | 28 struct Payload *next; member
145 last = last->next; in PacketPayloadAddLast()
172 node = node->next; in PacketFree()
241 node = node->next; in PacketPayloadSize()
282 start = start->next; in PacketCopyToBuffer()
316 start = start->next; in PacketCopyFromBuffer()
374 node = node->next; in PacketSize()
442 last->next = pkt->tail; in PacketExtractTail()
455 dFirst->next = NULL; in PacketFragment()
544 iter = iter->next; in PacketCalCrc16()
[all …]
|
| /ohos5.0/commonlibrary/ets_utils/js_util_module/container/list/ |
| H A D | js_list.ts | 99 next: () => {
106 next?: NodeObj<T>;
109 this.next = next;
160 current.next = node;
197 while (e1.next !== undefined && e2.next !== undefined) {
198 e1 = e1.next;
199 e2 = e2.next;
204 return !(e1.next !== undefined || e2.next !== undefined);
248 prevNode.next = oldNode.next;
305 newNode.next = current;
[all …]
|
| /ohos5.0/foundation/arkui/ace_engine_lite/frameworks/src/core/base/ |
| H A D | async_task_manager.cpp | 69 head_ = head_->next; in Reset()
106 head_ = head_->next; in Callback()
139 task->next = nullptr; in Dispatch()
144 tail_->next = task; in Dispatch()
165 prev->next = node->next; in Cancel()
175 node = node->next; in Cancel()
189 AsyncTask *next = nullptr; in CancelWithContext() local
191 next = node->next; in CancelWithContext()
196 prev->next = next; in CancelWithContext()
202 node = next; in CancelWithContext()
[all …]
|
| /ohos5.0/foundation/distributeddatamgr/preferences/frameworks/native/include/ |
| H A D | pool.h | 40 idle_ = idle_->next;
44 cur->next = busy_;
66 cur->prev->next = cur->next;
69 idle_ = cur->next;
75 cur = cur->next;
87 cur = cur->next; in Idle()
93 busy_ = busy_->next; in Idle()
95 if (cur->next != nullptr) { in Idle()
99 cur->prev->next = cur->next; in Idle()
102 cur->next = idle_; in Idle()
[all …]
|
| /ohos5.0/foundation/distributeddatamgr/kv_store/interfaces/innerkits/distributeddata/include/ |
| H A D | pool.h | 38 idle_ = idle_->next;
42 cur->next = busy_;
64 cur->prev->next = cur->next;
67 idle_ = cur->next;
73 cur = cur->next;
85 cur = cur->next; in Idle()
91 busy_ = busy_->next; in Idle()
93 if (cur->next != nullptr) { in Idle()
97 cur->prev->next = cur->next; in Idle()
100 cur->next = idle_; in Idle()
[all …]
|
| /ohos5.0/commonlibrary/rust/ylong_runtime/ylong_runtime/src/task/ |
| H A D | state.rs | 132 let mut next = cur; in turning_to_running() localVariable
133 next &= !SCHEDULING; in turning_to_running()
134 next |= RUNNING; in turning_to_running()
161 let mut next = cur; in turning_to_finish() localVariable
162 next &= !RUNNING; in turning_to_finish()
163 next |= FINISHED; in turning_to_finish()
190 let mut next = cur; in turning_to_idle() localVariable
191 next &= !RUNNING; in turning_to_idle()
226 let mut next = cur; in turn_to_un_set_waker() localVariable
251 let mut next = cur; in turn_to_set_waker() localVariable
[all …]
|
| /ohos5.0/base/security/dataclassification/frameworks/datatransmitmgr/ |
| H A D | dev_slinfo_list.c | 32 list->next = list; in InitList()
43 newListNode->next = nextListNode; in UpdateListNode()
45 prevListNode->next = newListNode; in UpdateListNode()
66 struct DATASLListParams *pList = list->next; in RemoveListNode()
69 pList->prev->next = pList->next; in RemoveListNode()
70 pList->next->prev = pList->prev; in RemoveListNode()
79 pList = pList->next; in RemoveListNode()
91 struct DATASLListParams *pList = list->next; in ClearList()
94 pList = pList->next; in ClearList()
116 pList = pList->next; in GetListLength()
[all …]
|