Home
last modified time | relevance | path

Searched refs:prev (Results 1 - 25 of 71) sorted by relevance

123

/foundation/communication/dsoftbus/components/nstackx/nstackx_util/interface/
H A Dnstackx_list.h27 struct List *prev; member
34 head->prev = head; in ListInitHead()
40 node->next->prev = node; in ListInsertHead()
41 node->prev = head; in ListInsertHead()
47 node->prev = head->prev; in ListInsertTail()
48 node->prev->next = node; in ListInsertTail()
50 head->prev = node; in ListInsertTail()
58 node->next->prev = node->prev; 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
54 node->prev = cur;
55 cur->next->prev = node;
62 node->prev = cur->prev;
63 cur->prev->next = node;
64 cur->prev
149 LinkedList* prev = cur->prev; global() variable
150 Delete(prev); global() variable
161 LinkedList* prev = cur->prev; global() variable
162 Delete(prev); global() variable
288 LinkedList* prev; global() member in ffrt::LinkedList
[all...]
H A DIntrusiveList.h100 return next != this && prev != this;
103 ListNode(ListNode* p, ListNode* n) noexcept : prev {p}, next {n}
111 ListNode* prev {this};
126 x->prev = &m_head; in List()
128 NodeType* y = rhs.m_tail.prev; in List()
130 m_tail.prev = y; in List()
144 x->prev = &m_head;
146 NodeType* y = rhs.m_tail.prev;
148 m_tail.prev = y;
171 m_head.next->prev
[all...]
/foundation/distributeddatamgr/kv_store/interfaces/innerkits/distributeddata/include/
H A Dpool.h40 idle_->prev = nullptr; in Get()
44 cur->prev = busy_->prev; in Get()
45 busy_->prev = cur; in Get()
61 cur->next->prev = cur->prev; in Release()
63 if (cur->prev != nullptr) { in Release()
64 cur->prev->next = cur->next; in Release()
94 cur->next->prev = cur->prev; in Idle()
123 Node *prev = nullptr; global() member
[all...]
/foundation/distributeddatamgr/preferences/frameworks/native/include/
H A Dpool.h42 idle_->prev = nullptr; in Get()
46 cur->prev = busy_->prev; in Get()
47 busy_->prev = cur; in Get()
63 cur->next->prev = cur->prev; in Release()
65 if (cur->prev != nullptr) { in Release()
66 cur->prev->next = cur->next; in Release()
96 cur->next->prev = cur->prev; in Idle()
125 Node *prev = nullptr; global() member
[all...]
/foundation/graphic/graphic_utils_lite/frameworks/diagram/vertexprimitive/
H A Dgeometry_shorten_path.cpp41 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()
/foundation/resourceschedule/ffrt/src/sync/
H A Dwait_queue.h77 whead->prev = whead; in WaitQueue()
116 if ((we == nullptr) || (whead == nullptr) || (whead->prev == nullptr)) { in push_back()
117 FFRT_LOGE("we or whead or whead->prev is 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 in remove()
[all...]
/foundation/communication/dsoftbus/core/common/include/
H A Dcommon_list.h29 struct ListNode *prev; /* Current node's pointer to the previous node */ member
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 in ListDelete()
[all...]
/foundation/arkui/ace_engine_lite/frameworks/src/core/base/
H A Dasync_task_manager.cpp159 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 in CancelWithContext()
[all...]
/foundation/arkui/ui_lite/frameworks/font/
H A Dui_font_cache.h49 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()
H A Dui_font_allocator.cpp50 chunk->prev = 0; in SetRamAddr()
55 end_->prev = size - sizeof(struct Chunk); in SetRamAddr()
102 chunk2->prev = ptr; in Allocate()
107 chunk3->prev = ptr2; in Allocate()
143 reinterpret_cast<struct Chunk*>(ram_ + nextChunk->next)->prev = reinterpret_cast<uint8_t*>(chunk) - ram_; in CombineFree()
146 prevChunk = reinterpret_cast<struct Chunk*>(ram_ + chunk->prev); in CombineFree()
152 reinterpret_cast<struct Chunk*>(ram_ + chunk->next)->prev = reinterpret_cast<uint8_t*>(prevChunk) - ram_; in CombineFree()
/foundation/arkui/napi/reference_manager/
H A Dnative_reference_manager.cpp39 NativeReference* prev = reinterpret_cast<ArkNativeReference*>(reference)->prev_; in ReleaseHandler() local
42 if (prev) { in ReleaseHandler()
43 reinterpret_cast<ArkNativeReference*>(prev)->next_ = next; in ReleaseHandler()
49 reinterpret_cast<ArkNativeReference*>(next)->prev_ = prev; in ReleaseHandler()
/foundation/communication/netmanager_ext/frameworks/native/mdnsclient/src/
H A Dmdns_common.cpp52 std::string::size_type prev = 0; in Split() local
55 if (pos - prev > 0) { in Split()
56 output.push_back(s.substr(prev, pos - prev)); in Split()
58 prev = ++pos; in Split()
60 if (prev < s.size()) { in Split()
61 output.push_back(s.substr(prev)); in Split()
/foundation/communication/dsoftbus/components/nstackx/fillp/src/public/include/
H A Dhlist.h62 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 *toBeAdded) 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()
/foundation/distributeddatamgr/kv_store/frameworks/native/kv_store/src/kvstore_common/
H A Dkvstore_common.c96 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()
/foundation/graphic/graphic_3d/lume/metaobject/include/meta/api/property/
H A Darray_property_changes_recognizer.h75 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()
/foundation/communication/bluetooth_service/services/bluetooth/stack/platform/src/
H A Dpacket.c29 struct Payload *prev; member
80 packet->payload->prev = packet->head; in PacketMalloc()
83 packet->tail->prev = packet->payload; in PacketMalloc()
105 new->prev = refPayload; in PacketRefMalloc()
112 refPacket->tail->prev = refPayload; in PacketRefMalloc()
115 refPacket->payload->prev = refPacket->head; in PacketRefMalloc()
130 inheritPacket->payload->prev = inheritPacket->head; in PacketInheritMalloc()
135 inheritPacket->tail->prev = tempTail; in PacketInheritMalloc()
155 pkt->tail->prev = newLast; in PacketPayloadAddLast()
157 newLast->prev in PacketPayloadAddLast()
[all...]
/foundation/communication/dsoftbus/core/connection/wifi_direct_cpp/event/
H A Dwifi_direct_event_template_dispatcher.h28 WifiDirectEventTemplateDispatcher(WifiDirectEventQueue *queue, PrevDispatcher *prev, Func &&func) in WifiDirectEventTemplateDispatcher() argument
29 : queue_(queue), prev_(prev), func_(std::forward<Func>(func)), chained_(false) in WifiDirectEventTemplateDispatcher()
31 prev->chained_ = true; in WifiDirectEventTemplateDispatcher()
/foundation/multimedia/av_codec/services/media_engine/plugins/source/http_source/xml/
H A Dxml_element.cpp52 xmlNodePtr prev = xmlNodePtr_->prev; in GetSiblingPrev() local
53 if (prev != nullptr) { in GetSiblingPrev()
54 return std::make_shared<XmlElement>(prev); in GetSiblingPrev()
/foundation/resourceschedule/ffrt/src/core/
H A Dversion_ctx.cpp108 auto prev = last; in CreateChildVersion() local
109 last = new (SimpleAllocator<VersionCtx>::AllocMem()) VersionCtx(this->signature, this, prev); in CreateChildVersion()
111 if (prev != nullptr) { in CreateChildVersion()
112 prev->next = last; in CreateChildVersion()
/foundation/resourceschedule/ffrt/src/sched/
H A Dexecute_ctx.h56 WaitEntry() : prev(this), next(this), task(nullptr), weType(0), wtType(SharedMutexWaitType::NORMAL) { in WaitEntry()
58 explicit WaitEntry(CPUEUTask *task) : prev(nullptr), next(nullptr), task(task), weType(0), in WaitEntry()
62 WaitEntry* prev; member
/foundation/graphic/graphic_3d/lume/LumeBase/api/base/containers/
H A Dunordered_map.h233 struct list_node* prev { nullptr }; struct
297 nb->prev = last;
322 // link prev to next or set bucket start to next if this was the first node. in erase()
323 // if this was the last prev-next will be null or bucket will be empty. in erase()
324 if (pos.it_->prev) { in erase()
325 BASE_ASSERT(pos.it_ == pos.it_->prev->next); in erase()
326 node = pos.it_->prev->next; in erase()
327 pos.it_->prev->next = next; in erase()
334 // link next to prev or if this was the last node look or the next bucket with items. in erase()
335 // if this was the first next-prev wil in erase()
[all...]
/foundation/multimedia/av_codec/test/unittest/dash_test/
H A Ddash_xml_unit_test.cpp96 std::shared_ptr<XmlElement> prev = last->GetSiblingPrev(); in HWTEST_F() local
113 std::shared_ptr<XmlElement> prev = root->GetSiblingPrev(); in HWTEST_F() local
114 EXPECT_EQ(prev, nullptr); in HWTEST_F()
135 std::shared_ptr<XmlElement> prev = root->GetSiblingPrev(); in HWTEST_F() local
136 EXPECT_EQ(prev, nullptr); in HWTEST_F()
/foundation/distributeddatamgr/kv_store/frameworks/common/
H A Dlru_bucket.h204 void Insert(Node *prev, Node *node) in Insert() argument
206 prev->next_->prev_ = node; in Insert()
207 node->next_ = prev->next_; in Insert()
208 prev->next_ = node; in Insert()
209 node->prev_ = prev; in Insert()
/foundation/distributeddatamgr/relational_store/rdbmock/frameworks/native/rdb/
H A Dlru_bucket.h204 void Insert(Node *prev, Node *node) in Insert() argument
206 prev->next_->prev_ = node; in Insert()
207 node->next_ = prev->next_; in Insert()
208 prev->next_ = node; in Insert()
209 node->prev_ = prev; in Insert()

Completed in 9 milliseconds

123