Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 62) sorted by relevance

123

/oneTBB/src/tbb/
H A Dqueuing_rw_mutex.cpp293 if( !next ) { in release()
323 next->my_going.store(1U, std::memory_order_release); in release()
332 next->my_going.store(1U, std::memory_order_release); in release()
387 if( !next ) { in release()
399 next->my_going.store(2U, std::memory_order_relaxed); in release()
402 next->my_going.store(1U, std::memory_order_release); in release()
419 if( !next ) { in downgrade_to_reader()
437 __TBB_ASSERT( next, "still no successor at this point!" ); in downgrade_to_reader()
439 next->my_going.store(1U, std::memory_order_release); in downgrade_to_reader()
476 queuing_rw_mutex::scoped_lock * next; in upgrade_to_writer() local
[all …]
H A Dconcurrent_monitor.h37 base_node* next; member
60 n->next = &head; in add()
61 head.prev->next = n; in add()
69 n.prev->next = n.next; in remove()
70 n.next->prev = n.prev; in remove()
78 lst.head.next = head.next; in flush_to()
87 head.next = &head; in clear()
339 nxt = n->next; in notify_all_relaxed()
381 nxt = n->next; in notify_relaxed()
398 base_node* next{}; in notify_one_relaxed()
[all …]
H A Dsmall_object_pool.cpp53 m_private_list = m_private_list->next; in allocate_impl()
58 m_private_list = obj->next; in allocate_impl()
92 obj->next = m_private_list; in deallocate_impl()
108 obj->next = old_public_list; in deallocate_impl()
125 list = list->next; in cleanup_list()
H A Dobserver_proxy.cpp56 observer_proxy *next = my_head.load(std::memory_order_relaxed); in clear() local
57 while ( observer_proxy *p = next ) { in clear()
58 next = p->my_next; in clear()
68 __TBB_ASSERT(!next || p == next->my_prev, nullptr); in clear()
H A Dsmall_object_pool_impl.h38 small_object* next; member
/oneTBB/src/tbb/tools_api/
H A Dittnotify_config.h538 h->next = NULL; \
557 h->next = NULL; \
573 h->next = NULL; \
591 h->next = NULL; \
606 h->next = NULL; \
623 h->next = NULL; \
640 h->next = NULL; \
661 h->next = NULL; \
679 h->next = NULL; \
699 h->next = NULL; \
[all …]
H A Dittnotify_static.c378 for (h_tail = NULL, h = _N_(_ittapi_global).domain_list; h != NULL; h_tail = h, h = h->next) in ITT_VERSIONIZE()
431 for (h_tail = NULL, h = _N_(_ittapi_global).domain_list; h != NULL; h_tail = h, h = h->next) in ITT_VERSIONIZE()
502 for (h_tail = NULL, h = _N_(_ittapi_global).string_list; h != NULL; h_tail = h, h = h->next) in ITT_VERSIONIZE()
555 for (h_tail = NULL, h = _N_(_ittapi_global).string_list; h != NULL; h_tail = h, h = h->next) in ITT_VERSIONIZE()
595 … for (h_tail = NULL, h = _N_(_ittapi_global).counter_list; h != NULL; h_tail = h, h = h->next) in ITT_VERSIONIZE()
651 … for (h_tail = NULL, h = _N_(_ittapi_global).counter_list; h != NULL; h_tail = h, h = h->next) in ITT_VERSIONIZE()
1534 __itt_string_handle* tmp = current_string->next; in __itt_free_allocated_resources()
1547 __itt_domain* tmp = current_domain->next; in __itt_free_allocated_resources()
1560 __itt_counter_info_t* tmp = current_couter->next; in __itt_free_allocated_resources()
1575 __itt_histogram* tmp = current_histogram->next; in __itt_free_allocated_resources()
[all …]
/oneTBB/src/tbbmalloc/
H A Dfrontend.cpp679 if (tls->next) in unregisterThread()
682 tls->prev->next = tls->next; in unregisterThread()
683 MALLOC_ASSERT(!tls->next || tls->next->next!=tls->next, ASSERT_TEXT); in unregisterThread()
1102 next = defaultMemPool->next; in init()
1105 if (next) in init()
1141 prev->next = next; in destroy()
1142 if (next) in destroy()
1254 block->previous->next = block->next; in outofTLSBin()
1629 Block* next = block->next; in cleanup() local
1918 previous->next = next; in free()
[all …]
H A Dlarge_objects.cpp245 op->next = *opList; in addOpToOpList()
254 LargeMemoryBlock *next = head->next; in getFromPutList() local
257 head = next; in getFromPutList()
273 tail->next = h; in addToPutList()
288 opNext = op->next; in operator ()()
332 CacheBinOperation *next = opGet->next; in operator ()() local
563 tail->next = first; in putList()
588 first = result->next; in get()
935 n = b->next; in putList()
942 b->prev->next = b->next; in putList()
[all …]
H A Dbackend.cpp218 *next, member in rml::internal::FreeBlock
464 FreeBlock *next = curr->next; in tryReleaseRegions() local
470 curr = next; in tryReleaseRegions()
486 fBlock->prev->next = fBlock->next; in removeBlock()
487 if (fBlock->next) in removeBlock()
508 if (fBlock->next) in addBlock()
1301 r->next = head; in add()
1303 if (head->next) in add()
1311 head = head->next; in remove()
1312 if (r->next) in remove()
[all …]
/oneTBB/doc/main/tbb_userguide/
H A DTask_Scheduler_Bypass.rst6 Scheduler bypass is an optimization where you directly specify the next task to run.
8 the spawning of the new task to be executed by the current thread involves the next steps:
15 … using "Task Scheduler Bypass" technique to directly point the preferable task to be executed next
17 the returned task becomes the first candidate for the next task to be executed by the thread. Furth…
H A Dappendix_A.rst17 load its registers for the next logical thread that it runs.
34 data. When thread A gets its next time slice, it will need to reload
36 worse yet, the next time slice for thread A may be on a different
43 it is now going to hold it for at least as long as it takes for its next
H A DMutual_Exclusion.rst34 FreeList = n->next;
44 n->next = FreeList;
81 FreeList = n->next;
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_unordered_base.h146 node_ptr next() const { in next() function
900 node_ptr next = my_head.next(); in internal_clear() local
901 node_ptr curr = next; in internal_clear()
906 next = curr->next(); in internal_clear()
908 curr = next; in internal_clear()
1024 node_ptr curr = prev->next(); in search_after()
1030 curr = curr->next(); in search_after()
1275 curr = curr->next(); in internal_find()
1303 curr = curr->next(); in internal_equal_range()
1323 for (node_ptr node = other.my_head.next(); node != nullptr; node = node->next()) { in internal_copy()
[all …]
H A D_concurrent_skip_list.h129 node_ptr next( size_type level ) const { in next() function
211 my_node_ptr = my_node_ptr->next(0);
578 node_ptr current = head->next(0); in clear()
582 node_ptr next = current->next(0); in clear() local
584 current = next; in clear()
860 node_ptr curr = prev->next(level); in internal_find_position()
865 curr = prev->next(level); in internal_find_position()
876 node_ptr curr = prev->next(level); in internal_find_position()
885 curr = prev->next(level); in internal_find_position()
963 node_ptr next = curr_nodes[0]; in internal_insert_node() local
[all …]
H A D_aggregator.h40 std::atomic<Derived*> next; variable
41 aggregated_operation() : status{}, next(nullptr) {} in aggregated_operation()
80 op->next.store(res, std::memory_order_relaxed);
H A D_concurrent_queue_base.h93 padded_page* next{ nullptr };
133 q->next = p; in prepare_page()
224 … for (srcp = srcp->next; srcp != src.tail_page.load(std::memory_order_relaxed); srcp=srcp->next ) { in assign()
226 cur_page = cur_page->next; in assign()
233 … cur_page->next = make_copy( allocator, srcp, 0, last_index, g_index, construct_item ); in assign()
234 cur_page = cur_page->next; in assign()
253 new_page->next = nullptr; in make_copy()
271 q->next = invalid_page; in invalidate_page()
297 padded_page* next_page = curr_page->next;
382 padded_page* q = p->next; in ~micro_queue_pop_finalizer()
[all …]
/oneTBB/examples/parallel_for/tachyon/src/
H A Dgrid.cpp125 lnext = lcur->next; in grid_free()
224 cur = cur->next; in cellbound()
267 cur = cur->next; in countobjlist()
324 *prev = next; in engrid_objlist()
328 cur = next; in engrid_objlist()
371 newobj->next = *list; in engrid_cell()
392 next = cur->next; in engrid_objectlist()
395 *prev = next; in engrid_objectlist()
400 prev = &cur->next; in engrid_objectlist()
403 cur = next; in engrid_objectlist()
[all …]
H A Dtrace.threads2d.cpp170 struct work_queue_entry_s *next; member
205 q->next = nullptr; in generate_work()
210 work_queue_tail->next = q; in generate_work()
230 work_queue_head = work_queue_head->next; in schedule_thread_work()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h56 hash_map_node_base* next; member
748 node_base* next = curr->next; in __TBB_requires() local
753 prev->next = curr->next; in __TBB_requires()
756 curr = next; in __TBB_requires()
759 curr = curr->next; in __TBB_requires()
987 node_base* next = curr->next; in __TBB_requires() local
992 prev->next = curr->next; in __TBB_requires()
997 curr = next; in __TBB_requires()
1394 curr = curr->next; in __TBB_requires()
1408 prev->next = curr->next; in __TBB_requires()
[all …]
/oneTBB/python/tbb/
H A Dtest.py124 assert next(it) == 0
125 assert next(it) == 1
126 assert next(it) == 4
H A Dpool.py252 arg = next(it_)
460 def next(self, timeout=None): member in CollectorIterator
478 return self.next()
/oneTBB/doc/main/reference/
H A Dtask_group_extensions.rst63 …an optimization hint, ``F`` might return a ``task_handle``, which task object can be executed next.
70 …an optimization hint, ``F`` might return a ``task_handle``, which task object can be executed next.
78 …an optimization hint, ``F`` might return a ``task_handle``, which task object can be executed next.
/oneTBB/python/rml/
H A Dipc_server.cpp1038 ipc_worker* next = nullptr; in stop_one() local
1044 next = current->my_next; in stop_one()
1045 … while( next!= nullptr && next->my_state.load(std::memory_order_relaxed)==ipc_worker::st_normal ) { in stop_one()
1046 current = next; in stop_one()
1047 next = current->my_next; in stop_one()
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DLocal_Serializer.rst152 // Destroy f before running Serializer’s next functor.
184 unconstraining the next waiting functor.
191 that should complete before the next functor runs.
280 more constraints, forwarding the work to the next constraint

123