| /ohos5.0/foundation/communication/dsoftbus/components/nstackx/nstackx_util/interface/ |
| H A D | nstackx_list.h | 27 struct List *prev; member
34 head->prev = head; in ListInitHead()
41 node->prev = head; in ListInsertHead()
47 node->prev = head->prev; in ListInsertTail()
50 head->prev = node; in ListInsertTail()
58 node->next->prev = node->prev; in ListRemoveNode()
61 node->prev = NULL; in ListRemoveNode()
89 newHead->next->prev = prevHead->prev; in ListInsertNewHead()
91 prevHead->prev = newHead->prev; in ListInsertNewHead()
100 to->prev = last; in ListMove()
[all …]
|
| /ohos5.0/commonlibrary/ets_utils/js_concurrent_module/common/helper/ |
| H A D | path_helper.h | 56 while (prev == 0 && script != "") { in CheckWorkerPath()
61 if (prev != std::string::npos) { in CheckWorkerPath()
66 if (prev != std::string::npos) { in CheckWorkerPath()
71 if (prev != std::string::npos) { in CheckWorkerPath()
76 if (prev != std::string::npos) { in CheckWorkerPath()
104 path = script.substr(prev); in CheckNormalizedWorkerPath()
143 size_t prev = 0; in NormalizePath() local
148 if (curr > prev) { in NormalizePath()
149 std::string elem = entryPoint.substr(prev, curr - prev); in NormalizePath()
157 prev = curr + 1; in NormalizePath()
[all …]
|
| /ohos5.0/foundation/resourceschedule/ffrt/src/util/ |
| H A D | linked_list.h | 29 LinkedList(LinkedList* prev, LinkedList* next) : prev(prev), next(next) in LinkedList() argument
54 node->prev = cur; in InsertAfter()
62 node->prev = cur->prev; in InsertBefore()
70 node.next->prev = node.prev; in Delete()
78 node->next->prev = node->prev; in Delete()
149 LinkedList* prev = cur->prev; in RemovePrev() local
150 Delete(prev); in RemovePrev()
151 return prev; in RemovePrev()
161 LinkedList* prev = cur->prev; in RemovePrev() local
162 Delete(prev); in RemovePrev()
[all …]
|
| H A D | IntrusiveList.h | 111 ListNode* prev {this};
126 x->prev = &m_head; in List()
130 m_tail.prev = y; in List()
144 x->prev = &m_head;
148 m_tail.prev = y;
172 nd.prev = &m_head; in PushFront()
183 nd.prev = m_tail.prev; in PushBack()
185 m_tail.prev = &nd; in PushBack()
226 node.next->prev = node.prev; in Unlink()
234 m_tail.prev = &m_head; in Reset()
[all …]
|
| /ohos5.0/drivers/hdf_core/interfaces/inner_api/utils/ |
| H A D | hdf_dlist.h | 59 head->prev = head; in DListHeadInit()
84 entry->next->prev = entry->prev; in DListRemove()
86 entry->prev = NULL; in DListRemove()
102 entry->prev = head; in DListInsertHead()
104 head->next->prev = entry; in DListInsertHead()
120 entry->prev = head->prev; in DListInsertTail()
122 head->prev->next = entry; in DListInsertTail()
123 head->prev = entry; in DListInsertTail()
137 list->next->prev = head; in DListMerge()
138 list->prev->next = head->next; in DListMerge()
[all …]
|
| /ohos5.0/base/security/huks/utils/list/ |
| H A D | hks_double_list.c | 28 node->prev = node; in InitializeDoubleList()
42 head->next->prev = node; in AddNodeAfterDoubleListHead()
44 node->prev = head; in AddNodeAfterDoubleListHead()
54 if (head->prev == NULL) { in AddNodeAtDoubleListTail()
55 head->prev = head; in AddNodeAtDoubleListTail()
58 head->prev->next = node; in AddNodeAtDoubleListTail()
60 node->prev = head->prev; in AddNodeAtDoubleListTail()
61 head->prev = node; in AddNodeAtDoubleListTail()
71 node->next->prev = node->prev; in RemoveDoubleListNode()
74 if (node->prev != NULL) { 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 | 28 listNode->prev = listNode; in CmInitList()
42 listHead->next->prev = listNode; in CmAddNodeAfterListHead()
44 listNode->prev = listHead; in CmAddNodeAfterListHead()
54 if (listHead->prev == NULL) { in CmAddNodeAtListTail()
55 listHead->prev = listHead; in CmAddNodeAtListTail()
58 listHead->prev->next = listNode; in CmAddNodeAtListTail()
60 listNode->prev = listHead->prev; in CmAddNodeAtListTail()
61 listHead->prev = listNode; in CmAddNodeAtListTail()
71 listNode->next->prev = listNode->prev; in CmRemoveNodeFromList()
74 if (listNode->prev != NULL) { in CmRemoveNodeFromList()
[all …]
|
| /ohos5.0/foundation/distributeddatamgr/preferences/frameworks/native/include/ |
| H A D | pool.h | 42 idle_->prev = nullptr;
46 cur->prev = busy_->prev;
47 busy_->prev = cur;
63 cur->next->prev = cur->prev;
65 if (cur->prev != nullptr) {
96 cur->next->prev = cur->prev; in Idle()
98 if (cur->prev != nullptr) { in Idle()
99 cur->prev->next = cur->next; in Idle()
101 cur->prev = nullptr; in Idle()
104 idle_->prev = cur; in Idle()
[all …]
|
| /ohos5.0/foundation/distributeddatamgr/kv_store/interfaces/innerkits/distributeddata/include/ |
| H A D | pool.h | 40 idle_->prev = nullptr;
44 cur->prev = busy_->prev;
45 busy_->prev = cur;
61 cur->next->prev = cur->prev;
63 if (cur->prev != nullptr) {
94 cur->next->prev = cur->prev; in Idle()
96 if (cur->prev != nullptr) { in Idle()
97 cur->prev->next = cur->next; in Idle()
99 cur->prev = nullptr; in Idle()
102 idle_->prev = cur; in Idle()
[all …]
|
| /ohos5.0/base/startup/init/services/utils/ |
| H A D | list.c | 35 node->prev = node; in OH_ListInit()
51 item->prev = head->prev; in OH_ListAddTail()
52 head->prev->next = item; in OH_ListAddTail()
53 head->prev = item; in OH_ListAddTail()
68 item->next->prev = item->prev; in OH_ListRemove()
69 item->prev->next = item->next; in OH_ListRemove()
104 item->prev = match->prev; in OH_ListAddWithOrder()
105 match->prev->next = item; in OH_ListAddWithOrder()
106 match->prev = item; in OH_ListAddWithOrder()
162 match = head->prev; in OH_ListTraversal()
[all …]
|
| /ohos5.0/base/tee/tee_client/frameworks/include/ |
| H A D | tee_client_list.h | 24 .prev = &(name), \
30 list->prev = list; in ListInit()
34 #define LIST_TAIL(list) ((list)->prev)
39 list->next->prev = entry; in ListInsertHead()
41 entry->prev = list; in ListInsertHead()
48 entry->prev = list->prev; in ListInsertTail()
49 list->prev->next = entry; in ListInsertTail()
50 list->prev = entry; in ListInsertTail()
55 entry->prev->next = entry->next; in ListRemoveEntry()
56 entry->next->prev = entry->prev; in ListRemoveEntry()
[all …]
|
| /ohos5.0/foundation/communication/dsoftbus/core/common/include/ |
| H A D | common_list.h | 37 list->prev = list; in ListInit()
44 #define GET_LIST_TAIL(object) ((object)->prev)
50 node->prev = list; in ListAdd()
51 list->next->prev = node; in ListAdd()
58 ListAdd(list->prev, node); in ListTailInsert()
70 if (node->next != 0 && node->prev != 0) { in ListDelete()
71 node->next->prev = node->prev; in ListDelete()
72 node->prev->next = node->next; in ListDelete()
75 node->prev = node; in ListDelete()
120 nextNode->prev = prevNode; in ListDel()
[all …]
|
| /ohos5.0/foundation/resourceschedule/ffrt/src/sync/ |
| H A D | wait_queue.h | 73 whead->prev = whead; in WaitQueue()
116 if ((we == nullptr) || (whead == nullptr) || (whead->prev == nullptr)) { in push_back()
121 we->prev = whead->prev; in push_back()
122 whead->prev->next = we; in push_back()
123 whead->prev = we; in push_back()
134 we->next->prev = whead; in pop_front()
136 we->prev = nullptr; in pop_front()
142 if ((we->next == nullptr) || (we->prev == nullptr)) { in remove()
145 we->prev->next = we->next; in remove()
146 we->next->prev = we->prev; in remove()
[all …]
|
| /ohos5.0/foundation/graphic/graphic_utils_lite/frameworks/diagram/vertexprimitive/ |
| H A D | geometry_shorten_path.cpp | 41 VertexDist& prev = vtxSeq[nSize - 1]; in ShortenPath() local
43 vtxSeqDistance = (prev.vertexDistance - distance) / prev.vertexDistance; in ShortenPath()
44 float x = prev.vertexXCoord + (last.vertexXCoord - prev.vertexXCoord) * vtxSeqDistance; in ShortenPath()
45 float y = prev.vertexYCoord + (last.vertexYCoord - prev.vertexYCoord) * vtxSeqDistance; in ShortenPath()
48 if (!prev(last)) { // Calculate whether the two vertices are close in ShortenPath()
|
| /ohos5.0/base/security/device_security_level/baselib/utils/include/ |
| H A D | utils_dslm_list.h | 21 struct TagListHead *prev; member
29 item->prev = where; in AddListNode()
31 item->next->prev = item; in AddListNode()
36 AddListNode(item, where->prev); in AddListNodeBefore()
41 item->prev->next = item->next; in RemoveListNode()
42 item->next->prev = item->prev; in RemoveListNode()
53 head->prev = head; in InitListHead()
|
| /ohos5.0/foundation/arkui/ace_engine_lite/frameworks/src/core/base/ |
| H A D | async_task_manager.cpp | 159 AsyncTask *prev = nullptr; in Cancel() local
162 if (prev == nullptr) { in Cancel()
165 prev->next = node->next; in Cancel()
167 tail_ = prev; in Cancel()
174 prev = node; in Cancel()
188 AsyncTask *prev = nullptr; in CancelWithContext() local
193 if (prev == nullptr) { in CancelWithContext()
196 prev->next = next; in CancelWithContext()
199 tail_ = prev; in CancelWithContext()
205 prev = node; in CancelWithContext()
|
| /ohos5.0/commonlibrary/rust/ylong_runtime/ylong_runtime/src/util/ |
| H A D | linked_list.rs | 28 prev: Option<NonNull<T>>, field
35 prev: None, in new()
43 let prev = T::node(node).as_ref().prev; in remove_node() localVariable
45 match prev { in remove_node()
47 Some(prev) => T::node(prev).as_mut().next = next, in remove_node()
51 Some(next) => T::node(next).as_mut().prev = prev, in remove_node()
53 T::node(node).as_mut().prev = None; in remove_node()
88 node.prev = Some(head_ptr); in new()
102 L::node(first).as_mut().prev = node; in push_front()
112 if head.prev != Some(self.head) { in pop_back()
[all …]
|
| /ohos5.0/drivers/hdf_core/framework/utils/src/ |
| H A D | hdf_slist.c | 197 iterator->prev = NULL; in HdfSListIteratorInit()
203 iterator->prev = (struct HdfSListNode *)list; in HdfSListIteratorInit()
217 if (iterator->prev->next != iterator->curr) { in HdfSListIteratorHasNext()
219 return iterator->prev->next != NULL; in HdfSListIteratorHasNext()
228 if (iterator == NULL || iterator->curr == NULL || iterator->prev == NULL) { in HdfSListIteratorNext()
233 if (iterator->prev->next == iterator->curr) { in HdfSListIteratorNext()
234 iterator->prev = iterator->curr; in HdfSListIteratorNext()
238 iterator->curr = iterator->prev->next; in HdfSListIteratorNext()
254 iterator->prev->next = iterator->curr; in HdfSListIteratorRemove()
265 iterator->prev->next = link; in HdfSListIteratorInsert()
[all …]
|
| /ohos5.0/base/security/dataclassification/frameworks/datatransmitmgr/ |
| H A D | dev_slinfo_list.c | 33 list->prev = list; in InitList()
42 nextListNode->prev = newListNode; in UpdateListNode()
44 newListNode->prev = prevListNode; in UpdateListNode()
57 UpdateListNode(newList, list->prev, list); in PushListNode()
69 pList->prev->next = pList->next; in RemoveListNode()
70 pList->next->prev = pList->prev; in RemoveListNode()
136 tmpCallback->prev->next = tmpCallback->next; in LookupCallback()
137 tmpCallback->next->prev = tmpCallback->prev; in LookupCallback()
|
| /ohos5.0/foundation/arkui/ui_lite/frameworks/font/ |
| H A D | ui_font_cache.h | 49 ListHead* prev; member
78 head->prev = head; in ListInit()
83 head->next->prev = node; in ListAdd()
85 node->prev = head; in ListAdd()
90 node->next->prev = node->prev; in ListDel()
91 node->prev->next = node->next; in ListDel()
|
| /ohos5.0/base/security/huks/test/unittest/huks_standard_test/module_test/utils_test/src/ |
| H A D | hks_double_list_test.cpp | 67 ASSERT_TRUE(node.prev == &node);
78 struct DoubleList head = { .prev = nullptr, .next = nullptr };
93 struct DoubleList head = { .prev = nullptr, .next = nullptr };
97 ASSERT_TRUE(head.prev == &node);
108 struct DoubleList head = { .prev = nullptr, .next = nullptr };
112 EXPECT_EQ(head.prev == nullptr, true);
|
| /ohos5.0/foundation/communication/bluetooth_service/services/bluetooth/stack/platform/src/ |
| H A D | packet.c | 29 struct Payload *prev; member
105 new->prev = refPayload; in PacketRefMalloc()
157 newLast->prev = last; in PacketPayloadAddLast()
224 pkt->tail->prev = newPayload; in PacketContinuousPayload()
227 newPayload->prev = pkt->head; in PacketContinuousPayload()
418 pkt->payload->prev = pkt->head; in PacketExtractHead()
429 Payload *last = pkt->tail->prev; in PacketExtractTail()
436 last = last->prev; in PacketExtractTail()
443 pkt->tail->prev = last; in PacketExtractTail()
490 downlayer->tail->prev = dFirst; in PacketFragment()
[all …]
|
| /ohos5.0/foundation/distributeddatamgr/kv_store/frameworks/native/kv_store/src/kvstore_common/ |
| H A D | kvstore_common.c | 96 g_itemHeader->prev = NULL; in DeleteKVCache()
98 g_itemTail = item->prev; in DeleteKVCache()
101 item->prev->next = item->next; in DeleteKVCache()
102 item->next->prev = item->prev; in DeleteKVCache()
137 item->prev = NULL; in AddKVCache()
146 g_itemHeader->prev = item; in AddKVCache()
151 g_itemTail = g_itemTail->prev; in AddKVCache()
|
| /ohos5.0/foundation/graphic/graphic_3d/lume/metaobject/include/meta/api/property/ |
| H A D | array_property_changes_recognizer.h | 75 BASE_NS::unordered_map<ValueType, size_t> prev; in OnArrayPropertyChanged() local
78 if (auto p = FindFirstOf(newValuesVector, v, prev[v]); p != NPOS) { in OnArrayPropertyChanged()
79 prev[v] = p + 1; in OnArrayPropertyChanged()
87 BASE_NS::unordered_map<ValueType, size_t> prev; in OnArrayPropertyChanged() local
90 if (auto p = FindFirstOf(previousValues_, v, prev[v]); p != NPOS) { in OnArrayPropertyChanged()
91 prev[v] = p + 1; in OnArrayPropertyChanged()
|
| /ohos5.0/foundation/communication/dsoftbus/components/nstackx/fillp/src/public/include/ |
| H A D | hlist.h | 62 static void HlistAddAfter(struct Hlist *list, struct HlistNode *prev, struct HlistNode *toBeAdded);
69 static __inline void HlistAddAfter(struct Hlist *list, struct HlistNode *prev, struct HlistNode *to… in HlistAddAfter() argument
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()
|