Searched refs:prev (Results 1 - 11 of 11) sorted by relevance
| /commonlibrary/ets_utils/js_concurrent_module/common/helper/ |
| H A D | path_helper.h | 55 size_t prev = script.find_first_of(SLASH_TAG); in CheckWorkerPath() local
56 while (prev == 0 && script != "") { in CheckWorkerPath()
58 prev = script.find_first_of(SLASH_TAG); in CheckWorkerPath()
61 if (prev != std::string::npos) { in CheckWorkerPath()
62 bundleName = script.substr(0, prev); in CheckWorkerPath()
64 std::string temp = script.substr(prev + 1); in CheckWorkerPath()
65 prev = temp.find_first_of(SLASH_TAG); in CheckWorkerPath()
66 if (prev != std::string::npos) { in CheckWorkerPath()
67 moduleName = temp.substr(0, prev); in CheckWorkerPath()
71 if (prev ! in CheckWorkerPath()
90 size_t prev = fileName.find_first_of(SLASH_TAG); CheckNormalizedWorkerPath() local
96 size_t prev = script.find_last_of(POINT_TAG); CheckNormalizedWorkerPath() local
143 size_t prev = 0; NormalizePath() local
[all...] |
| /commonlibrary/rust/ylong_runtime/ylong_runtime/src/util/ |
| H A D | slots.rs | 27 prev: usize,
32 fn new(val: T, prev: usize, next: usize) -> Entry<T> { in new()
35 prev, in new()
99 self.entries[key].prev = tail; in push_back()
134 entry.prev = NULL; in pop_front()
142 head.prev = NULL; in pop_front()
169 let prev = entry.prev; in remove()
172 entry.prev = NULL; in remove()
176 match self.entries.get_mut(prev) { in remove()
[all...] |
| H A D | linked_list.rs | 28 prev: Option<NonNull<T>>,
35 prev: None,
43 let prev = T::node(node).as_ref().prev; in remove_node()
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 in remove_node()
[all...] |
| /commonlibrary/rust/ylong_json/src/ |
| H A D | linked_list.rs | 56 // Sets prev to LinkedList.tail
57 node.prev = self.tail;
79 self.tail = node.prev;
209 if node.prev.is_null() {
212 (*(node.prev as *mut Node<T>)).next = node.next;
216 self.tail = node.prev;
218 (*(node.next as *mut Node<T>)).prev = node.prev;
283 prev: *const Node<T>,
293 prev
[all...] |
| /commonlibrary/rust/ylong_runtime/ylong_runtime/src/task/ |
| H A D | task_handle.rs | 83 let prev = self.header().state.dec_ref();
84 if state::is_last_ref_count(prev) {
236 let prev = self.header().state.turn_to_scheduling();
237 if state::need_enqueue(prev) {
332 let prev = self.header().state.turn_to_scheduling();
333 if state::need_enqueue(prev) {
|
| H A D | state.rs | 49 pub(crate) fn is_last_ref_count(prev: usize) -> bool {
50 ref_count(prev) == 1
|
| /commonlibrary/rust/ylong_runtime/ylong_runtime/src/executor/ |
| H A D | queue.rs | 247 fn sync_steal_pos(&self, mut prev: u32) { in sync_steal_pos()
249 let (_front_steal, front_real) = unwrap(prev); in sync_steal_pos()
251 let res = self.front.compare_exchange(prev, next, AcqRel, Acquire); in sync_steal_pos()
260 prev = actual; in sync_steal_pos()
304 let prev = wrap(front, front);
307 match self.front.compare_exchange(prev, next, Release, Acquire) {
312 let (mut src_front_steal, _src_front_real) = unwrap(prev);
|
| H A D | async_pool.rs | 192 if let Some(prev) = prev_task { in enqueue_under_ctx()
193 // there is some task in lifo slot, therefore we put the prev task in enqueue_under_ctx()
196 task = prev; in enqueue_under_ctx()
|
| /commonlibrary/ets_utils/js_concurrent_module/utils/test/ |
| H A D | test_locks.cpp | 148 bool prev = data->executing.exchange(true); in ExclusiveLockMultiCb() local
149 if (prev) { in ExclusiveLockMultiCb()
|
| /commonlibrary/ets_utils/js_api_module/convertxml/test/ |
| H A D | test_convertxml.cpp | 668 curNode->prev = curNode1; in HWTEST_F()
669 curNode1->prev = nullptr; in HWTEST_F()
684 curNode->prev = curNode1; in HWTEST_F()
685 curNode1->prev = nullptr; in HWTEST_F()
|
| /commonlibrary/ets_utils/js_api_module/convertxml/ |
| H A D | js_convertxml.cpp | 106 while (curNode->prev != nullptr) {
in GetPrevNodeList()
107 curNode = curNode->prev;
in GetPrevNodeList()
|
Completed in 9 milliseconds