Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 27) sorted by relevance

12

/oneTBB/src/tbb/
H A Dobserver_proxy.cpp171 if (prev) { in do_notify_entry_observers()
191 __TBB_ASSERT(!prev || p != prev, nullptr); in do_notify_entry_observers()
193 if (prev) { in do_notify_entry_observers()
194 remove_ref(prev); in do_notify_entry_observers()
203 prev = p; in do_notify_entry_observers()
220 if (p == prev) in do_notify_exit_observers()
228 if (p != prev && prev) { in do_notify_exit_observers()
247 __TBB_ASSERT(!prev || p != prev, nullptr); in do_notify_exit_observers()
248 if (prev) in do_notify_exit_observers()
249 remove_ref(prev); in do_notify_exit_observers()
[all …]
H A Dconcurrent_monitor.h38 base_node* prev; member
59 n->prev = head.prev; in add()
61 head.prev->next = n; in add()
62 head.prev = n; in add()
69 n.prev->next = n.next; in remove()
70 n.next->prev = n.prev; in remove()
79 lst.head.prev = head.prev; in flush_to()
80 head.next->prev = &lst.head; in flush_to()
88 head.prev = &head; in clear()
369 nxt = n->prev; in notify_relaxed()
[all …]
H A Dscheduler_common.h215 std::uint64_t prev = machine_time_stamp(); in prolonged_pause_impl() local
216 const std::uint64_t finish = prev + 1000; in prolonged_pause_impl()
221 if (curr <= prev) in prolonged_pause_impl()
224 prev = curr; in prolonged_pause_impl()
225 } while (prev < finish); in prolonged_pause_impl()
524 isolation_type prev = m_execute_data_ext.isolation; in alignas() local
526 return prev; in alignas()
H A Dthread_dispatcher.cpp159 thread_dispatcher_client* thread_dispatcher::client_in_need(thread_dispatcher_client* prev) { in client_in_need() argument
161 if (is_client_alive(prev)) { in client_in_need()
162 return client_in_need(my_client_list, prev); in client_in_need()
H A Dthread_dispatcher.h70 thread_dispatcher_client* client_in_need(thread_dispatcher_client* prev);
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_skip_list.h786 node_ptr prev = get_head(); in internal_find_multi() local
840 prev = curr; in internal_equal_range()
863 prev = curr; in internal_find_position()
865 curr = prev->next(level); in internal_find_position()
883 prev = curr; in internal_find_position()
885 curr = prev->next(level); in internal_find_position()
901 node_ptr prev = head; in fill_prev_curr_arrays() local
904 prev_nodes[level - 1] = prev; in fill_prev_curr_arrays()
913 node_ptr prev = head; in fill_prev_array_for_existing_node() local
916 prev = prev->next(level - 1); in fill_prev_array_for_existing_node()
[all …]
H A D_flow_graph_tagged_buffer_impl.h240 element_type* prev = nullptr; in delete_with_key() local
241 for(element_type* p = pointer_array[h]; p; prev = p, p = (element_type *)(p->second)) { in delete_with_key()
246 if(prev) prev->second = p->second; in delete_with_key()
H A D_concurrent_unordered_base.h992 node_ptr prev = prepare_bucket(hash_key); in internal_insert() local
993 __TBB_ASSERT(prev != nullptr, "Invalid head node"); in internal_insert()
995 auto search_result = search_after(prev, order_key, key); in internal_insert()
1004 while (!try_insert(prev, new_node, curr)) { in internal_insert()
1005 search_result = search_after(prev, order_key, key); in internal_insert()
1020 …std::pair<value_node_ptr, bool> search_after( node_ptr& prev, sokey_type order_key, const key_type… in search_after() argument
1024 node_ptr curr = prev->next(); in search_after()
1029 prev = curr; in search_after()
H A D_flow_graph_impl.h404 graph_node* prev = nullptr; variable
/oneTBB/src/tbbmalloc/
H A Dbackend.cpp484 tail = fBlock->prev; in removeBlock()
485 if (fBlock->prev) in removeBlock()
488 fBlock->next->prev = fBlock->prev; in removeBlock()
501 if (fBlock->prev) in addBlock()
530 if (fBlock->prev) in tryAddBlock()
536 fBlock->prev = nullptr; in tryAddBlock()
1299 r->prev = nullptr; in add()
1304 head->next->prev = head; in add()
1313 r->next->prev = r->prev; in remove()
1314 if (r->prev) in remove()
[all …]
H A Dlarge_objects.cpp274 h->prev = tail; in addToPutList()
308 LargeMemoryBlock *curr = head, *prev = nullptr; in operator ()() local
313 curr->prev = prev; in operator ()()
322 prev = curr; in operator ()()
328 LargeMemoryBlock *tail = prev; in operator ()()
411 curr->prev = nullptr; in operator ()()
554 tail = tail->prev; in putList()
565 first->prev = tail; in putList()
590 first->prev = nullptr; in get()
942 b->prev->next = b->next; in putList()
[all …]
H A Dbackend.h42 intptr_t prev = inFlyBlocks.fetch_sub(1); in blockReleased() local
43 MALLOC_ASSERT(prev > 0, ASSERT_TEXT); in blockReleased()
44 suppress_unused_warning(prev); in blockReleased()
H A Dfrontend.cpp273 *prev; member in rml::internal::MemoryPool
663 tls->prev = nullptr; in registerThread()
668 head->prev = tls; in registerThread()
680 tls->next->prev = tls->prev; in unregisterThread()
681 if (tls->prev) in unregisterThread()
1104 prev = defaultMemPool; in init()
1106 next->prev = this; in init()
1140 if (prev) in destroy()
1143 next->prev = prev; in destroy()
2204 object->prev = nullptr; in put()
[all …]
H A Dtbbmalloc_internal.h244 *prev; member
355 *prev,
/oneTBB/examples/parallel_for/tachyon/src/
H A Dgrid.cpp312 object *cur, *next, **prev; in engrid_objlist() local
317 prev = list; in engrid_objlist()
324 *prev = next; in engrid_objlist()
326 prev = (object **)&cur->nextobj; in engrid_objlist()
382 objectlist *cur, *next, **prev; in engrid_objectlist() local
388 prev = list; in engrid_objectlist()
395 *prev = next; in engrid_objectlist()
400 prev = &cur->next; in engrid_objectlist()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h737 node_base* prev = nullptr; in __TBB_requires()
750 if (prev == nullptr) { in __TBB_requires()
758 prev = curr; in __TBB_requires()
999 prev = curr; in __TBB_requires()
1389 node_base* prev = nullptr; in __TBB_requires() local
1393 prev = curr; in __TBB_requires()
1405 if (prev == nullptr) { in __TBB_requires()
1408 prev->next = curr->next; in __TBB_requires()
1433 node_base* prev = nullptr; in __TBB_requires()
1436 prev = erase_node; in __TBB_requires()
[all …]
H A Dpartitioner.h213 depth_t prev = my_head; in split_to_fill() local
215 new(my_pool.begin()+my_head) T(my_pool.begin()[prev]); // copy TODO: std::move? in split_to_fill()
216 my_pool.begin()[prev].~T(); // instead of assignment in split_to_fill()
217 … new(my_pool.begin()+prev) T(my_pool.begin()[my_head], detail::split()); // do 'inverse' split in split_to_fill()
218 my_depth[my_head] = ++my_depth[prev]; in split_to_fill()
H A Dflow_graph.h470 n->prev = my_nodes_last; in register_node()
481 if (n->prev) n->prev->next = n->next; in remove_node()
482 if (n->next) n->next->prev = n->prev; in remove_node()
483 if (my_nodes_last == n) my_nodes_last = n->prev; in remove_node()
486 n->prev = n->next = nullptr; in remove_node()
/oneTBB/test/tbb/
H A Dtest_priority_queue_node.cpp71 T prev; in operator ()() local
72 spin_try_get( my_q, prev ); in operator ()()
76 CHECK_MESSAGE(v < prev, ""); in operator ()()
/oneTBB/test/conformance/
H A Dconformance_global_control.cpp368 std::terminate_handler prev = std::set_terminate([] { in __anon3ebcafb90302() variable
399 std::set_terminate(prev);
H A Dconformance_concurrent_priority_queue.cpp505 int prev = INT_MAX; in test_serial_push_pop() local
520 REQUIRE_MESSAGE(prev >= e, "Failed pop priority test"); in test_serial_push_pop()
521 prev = e; in test_serial_push_pop()
H A Dconformance_enumerable_thread_specific.cpp1083 REQUIRE_MESSAGE(std::prev(ets.end()) == ets.begin(), "Incorrect begin or end of the ETS"); in TestETSIterator()
1139 REQUIRE(std::prev(ets.end())[-i] == 42); in TestETSIterator()
1167 it2 = std::prev(ets.end()); in TestETSIteratorComparisonsBasic()
H A Dconformance_concurrent_vector.cpp134 intptr_t prev = (*cp_new).bar(); in TestSequentialFor() local
135 REQUIRE( prev==u[i-1].bar() ); in TestSequentialFor()
1402 it2 = std::prev(vec.end()); in TestVectorIteratorComparisonsBasic()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_compliance.cpp402 size_t prev = utils::GetMemoryUsage(utils::peakUsage); in CheckReallocLeak() local
408 if (prev == curr) in CheckReallocLeak()
410 prev = curr; in CheckReallocLeak()
H A Dtest_malloc_overload.cpp162 *prev, member

12