tbb Namespace Reference

The graph class. More...

Namespaces
	flow
	interface10
	interface5
	interface6
	interface7
	interface8
	interface9
	internal
	Identifiers declared inside namespace internal should never be used directly by client code.
	serial
	strict_ppl
	For internal use only.
	this_task_arena
	this_tbb_thread

Classes
class	affinity_partitioner
	An affinity partitioner. More...
class	auto_partitioner
	An auto partitioner. More...
class	bad_last_alloc
	Exception for concurrent containers. More...
class	blocked_range
	A range over which to iterate. More...
class	blocked_range2d
	A 2-dimensional range that models the Range concept. More...
class	blocked_range3d
	A 3-dimensional range that models the Range concept. More...
class	cache_aligned_allocator
	Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
class	cache_aligned_allocator< void >
	Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
class	captured_exception
	This class is used by TBB to propagate information about unhandled exceptions into the root thread. More...
class	combinable
	Thread-local storage with optional reduction. More...
class	concurrent_bounded_queue
	A high-performance thread-safe blocking concurrent bounded queue. More...
class	concurrent_vector
	Concurrent vector container. More...
class	empty_task
	task that does nothing. Useful for synchronization. More...
class	filter
	A stage in a pipeline. More...
struct	final_scan_tag
	Used to indicate that the final scan is being performed. More...
class	improper_lock
	Exception for PPL locks. More...
class	invalid_multiple_scheduling
	Exception for repeated scheduling of the same task_handle. More...
class	missing_wait
	Exception for missing wait on structured_task_group. More...
class	movable_exception
	Template that can be used to implement exception that transfers arbitrary ExceptionData to the root thread. More...
class	null_mutex
	A mutex which does nothing. More...
class	null_rw_mutex
	A rw mutex which does nothing. More...
class	parallel_while
	Parallel iteration over a stream, with optional addition of more work. More...
struct	pre_scan_tag
	Used to indicate that the initial scan is being performed. More...
class	proportional_split
	Type enables transmission of splitting proportion from partitioners to range objects. More...
class	queuing_mutex
	Queuing mutex with local-only spinning. More...
class	queuing_rw_mutex
	Queuing reader-writer mutex with local-only spinning. More...
class	simple_partitioner
	A simple partitioner. More...
class	spin_mutex
	A lock that occupies a single byte. More...
class	spin_rw_mutex_v3
	Fast, unfair, spinning reader-writer lock with backoff and writer-preference. More...
class	split
	Dummy type that distinguishes splitting constructor from copy constructor. More...
class	static_partitioner
	A static partitioner. More...
class	structured_task_group
class	task
	Base class for user-defined tasks. More...
class	task_group
class	task_group_context
	Used to form groups of tasks. More...
class	task_handle
class	task_list
	A list of children. More...
class	task_scheduler_init
	Class delimiting the scope of task scheduler activity. More...
class	tbb_allocator
	Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
class	tbb_allocator< void >
	Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...
class	tbb_exception
	Interface to be implemented by all exceptions TBB recognizes and propagates across the threads. More...
struct	tbb_hash_compare
	hash_compare that is default argument for concurrent_hash_map More...
class	thread_bound_filter
	A stage in a pipeline served by a user thread. More...
class	tick_count
	Absolute timestamp. More...
class	tricky_atomic_pointer
	A view of a T* with additional functionality for twiddling low-order bits. More...
class	user_abort
	Exception for user-initiated abort. More...
class	zero_allocator
	Meets "allocator" requirements of ISO C++ Standard, Section 20.1.5. More...
class	zero_allocator< void, Allocator >
	Analogous to std::allocator<void>, as defined in ISO C++ Standard, Section 20.4.1. More...

Typedefs
typedef interface7::internal::padded_mutex< spin_mutex, false >	speculative_spin_mutex
	A cross-platform spin mutex with speculative lock acquisition. More...
typedef spin_rw_mutex_v3	spin_rw_mutex
typedef std::size_t	stack_size_type
typedef char	tchar
	Unicode support. More...
typedef tricky_atomic_pointer< queuing_rw_mutex::scoped_lock >	tricky_pointer
typedef void(*	assertion_handler_type) (const char *filename, int line, const char *expression, const char *comment)
	Type for an assertion handler. More...

Enumerations
enum	memory_semantics { full_fence, acquire, release, relaxed }
	Specifies memory semantics. More...
enum	ets_key_usage_type { ets_key_per_instance, ets_no_key }
	enum for selecting between single key and key-per-instance versions More...
enum	priority_t { priority_normal = internal::priority_stride_v4 * 2, priority_low = priority_normal - internal::priority_stride_v4, priority_high = priority_normal + internal::priority_stride_v4 }
enum	task_group_status { not_complete, complete, canceled }
enum	state_t_flags {   STATE_NONE = 0, STATE_WRITER = 1<<0, STATE_READER = 1<<1, STATE_READER_UNBLOCKNEXT = 1<<2,   STATE_ACTIVEREADER = 1<<3, STATE_UPGRADE_REQUESTED = 1<<4, STATE_UPGRADE_WAITING = 1<<5, STATE_UPGRADE_LOSER = 1<<6,   STATE_COMBINED_WAITINGREADER = STATE_READER | STATE_READER_UNBLOCKNEXT, STATE_COMBINED_READER = STATE_COMBINED_WAITINGREADER | STATE_ACTIVEREADER, STATE_COMBINED_UPGRADING = STATE_UPGRADE_WAITING | STATE_UPGRADE_LOSER }
	Flag bits in a state_t that specify information about a locking request. More...

Functions
template<typename T , size_t N = 1>
class	__TBB_DEPRECATED_IN_VERBOSE_MODE_MSG ("tbb::aligned_space is deprecated, use std::aligned_storage") aligned_space
	Block of space aligned sufficiently to construct an array T with N elements. More...
template<memory_semantics M, typename T >
struct __TBB_DEPRECATED_IN_VERBOSE_MODE_MSG("tbb::atomic is deprecated, use std::atomic") atomic< T * > struct __TBB_DEPRECATED_IN_VERBOSE_MODE_MSG("tbb::atomic is deprecated, use std::atomic") atomic< void * > T	load (const atomic< T > &a)
	Specialization for atomic<T*> with arithmetic and operator->. More...
template<memory_semantics M, typename T >
void	store (atomic< T > &a, T value)
template<typename T , typename U >
bool	operator== (const cache_aligned_allocator< T > &, const cache_aligned_allocator< U > &)
template<typename T , typename U >
bool	operator!= (const cache_aligned_allocator< T > &, const cache_aligned_allocator< U > &)
template<typename Key , typename T , typename HashCompare , typename A1 , typename A2 >
bool	operator== (const concurrent_hash_map< Key, T, HashCompare, A1 > &a, const concurrent_hash_map< Key, T, HashCompare, A2 > &b)
template<typename Key , typename T , typename HashCompare , typename A1 , typename A2 >
bool	operator!= (const concurrent_hash_map< Key, T, HashCompare, A1 > &a, const concurrent_hash_map< Key, T, HashCompare, A2 > &b)
template<typename Key , typename T , typename HashCompare , typename A >
void	swap (concurrent_hash_map< Key, T, HashCompare, A > &a, concurrent_hash_map< Key, T, HashCompare, A > &b)
template<typename T , class A1 , class A2 >
bool	operator== (const concurrent_vector< T, A1 > &a, const concurrent_vector< T, A2 > &b)
template<typename T , class A1 , class A2 >
bool	operator!= (const concurrent_vector< T, A1 > &a, const concurrent_vector< T, A2 > &b)
template<typename T , class A1 , class A2 >
bool	operator< (const concurrent_vector< T, A1 > &a, const concurrent_vector< T, A2 > &b)
template<typename T , class A1 , class A2 >
bool	operator> (const concurrent_vector< T, A1 > &a, const concurrent_vector< T, A2 > &b)
template<typename T , class A1 , class A2 >
bool	operator<= (const concurrent_vector< T, A1 > &a, const concurrent_vector< T, A2 > &b)
template<typename T , class A1 , class A2 >
bool	operator>= (const concurrent_vector< T, A1 > &a, const concurrent_vector< T, A2 > &b)
template<typename T , class A >
void	swap (concurrent_vector< T, A > &a, concurrent_vector< T, A > &b)
template<typename Key >
class	__TBB_DEPRECATED_MSG ("tbb::tbb_hash is deprecated, use std::hash") tbb_hash
class	__TBB_DEPRECATED_MSG ("tbb::pipeline is deprecated, use tbb::parallel_pipeline") pipeline
	A processing pipeline that applies filters to items. More...
bool	is_current_task_group_canceling ()
template<class F >
task_handle< typename internal::strip< F >::type >	make_task (F &&f)
template<typename T , typename U >
bool	operator== (const tbb_allocator< T > &, const tbb_allocator< U > &)
template<typename T , typename U >
bool	operator!= (const tbb_allocator< T > &, const tbb_allocator< U > &)
template<typename T1 , template< typename X1 > class B1, typename T2 , template< typename X2 > class B2>
bool	operator== (const zero_allocator< T1, B1 > &a, const zero_allocator< T2, B2 > &b)
template<typename T1 , template< typename X1 > class B1, typename T2 , template< typename X2 > class B2>
bool	operator!= (const zero_allocator< T1, B1 > &a, const zero_allocator< T2, B2 > &b)
void	atomic_fence ()
	Sequentially consistent full memory fence. More...
assertion_handler_type __TBB_EXPORTED_FUNC	set_assertion_handler (assertion_handler_type new_handler)
	Set assertion handler and return previous value of it. More...
void __TBB_EXPORTED_FUNC	assertion_failure (const char *filename, int line, const char *expression, const char *comment)
	Process an assertion failure. More...
int __TBB_EXPORTED_FUNC	TBB_runtime_interface_version ()
	The function returns the interface version of the TBB shared library being used. More...
void	swap (internal::tbb_thread_v3 &t1, internal::tbb_thread_v3 &t2) __TBB_NOEXCEPT(true)
void	move (tbb_thread &t1, tbb_thread &t2)
tick_count::interval_t	operator- (const tick_count &t1, const tick_count &t0)
uintptr_t	get_flag (queuing_rw_mutex::scoped_lock *ptr)
template<typename T >
static T	CAS (volatile T &addr, T newv, T oldv)
parallel_do
See also requirements on parallel_do Body.
template<typename Iterator , typename Body >
void	parallel_do (Iterator first, Iterator last, const Body &body)
	Parallel iteration over a range, with optional addition of more work. More...
template<typename Range , typename Body >
void	parallel_do (Range &rng, const Body &body)
template<typename Range , typename Body >
void	parallel_do (const Range &rng, const Body &body)
template<typename Iterator , typename Body >
void	parallel_do (Iterator first, Iterator last, const Body &body, task_group_context &context)
	Parallel iteration over a range, with optional addition of more work and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_do (Range &rng, const Body &body, task_group_context &context)
template<typename Range , typename Body >
void	parallel_do (const Range &rng, const Body &body, task_group_context &context)
parallel_for
See also requirements on Range and parallel_for Body.
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body)
	Parallel iteration over range with default partitioner. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner)
	Parallel iteration over range with simple partitioner. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner)
	Parallel iteration over range with auto_partitioner. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, const static_partitioner &partitioner)
	Parallel iteration over range with static_partitioner. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner)
	Parallel iteration over range with affinity_partitioner. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, task_group_context &context)
	Parallel iteration over range with default partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, const simple_partitioner &partitioner, task_group_context &context)
	Parallel iteration over range with simple partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, const auto_partitioner &partitioner, task_group_context &context)
	Parallel iteration over range with auto_partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, const static_partitioner &partitioner, task_group_context &context)
	Parallel iteration over range with static_partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_for (const Range &range, const Body &body, affinity_partitioner &partitioner, task_group_context &context)
	Parallel iteration over range with affinity_partitioner and user-supplied context. More...
parallel_for_each
template<typename Iterator , typename Function >
void	parallel_for_each (Iterator first, Iterator last, const Function &f, task_group_context &context)
	Calls function f for all items from [first, last) interval using user-supplied context. More...
template<typename Range , typename Function >
void	parallel_for_each (Range &rng, const Function &f, task_group_context &context)
	Calls function f for all items from rng using user-supplied context. More...
template<typename Range , typename Function >
void	parallel_for_each (const Range &rng, const Function &f, task_group_context &context)
	Calls function f for all items from const rng user-supplied context. More...
template<typename Iterator , typename Function >
void	parallel_for_each (Iterator first, Iterator last, const Function &f)
	Uses default context. More...
template<typename Range , typename Function >
void	parallel_for_each (Range &rng, const Function &f)
	Uses default context. More...
template<typename Range , typename Function >
void	parallel_for_each (const Range &rng, const Function &f)
	Uses default context. More...
parallel_invoke
template<typename F0 , typename F1 >
void	parallel_invoke (const F0 &f0, const F1 &f1, tbb::task_group_context &context)
	Executes a list of tasks in parallel and waits for all tasks to complete. More...
template<typename F0 , typename F1 , typename F2 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, tbb::task_group_context &context)
template<typename F0 , typename F1 , typename F2 , typename F3 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, tbb::task_group_context &context)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, tbb::task_group_context &context)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, tbb::task_group_context &context)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, tbb::task_group_context &context)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, tbb::task_group_context &context)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, tbb::task_group_context &context)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9, tbb::task_group_context &context)
template<typename F0 , typename F1 >
void	parallel_invoke (const F0 &f0, const F1 &f1)
template<typename F0 , typename F1 , typename F2 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2)
template<typename F0 , typename F1 , typename F2 , typename F3 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8)
template<typename F0 , typename F1 , typename F2 , typename F3 , typename F4 , typename F5 , typename F6 , typename F7 , typename F8 , typename F9 >
void	parallel_invoke (const F0 &f0, const F1 &f1, const F2 &f2, const F3 &f3, const F4 &f4, const F5 &f5, const F6 &f6, const F7 &f7, const F8 &f8, const F9 &f9)
parallel_reduce
See also requirements on Range and parallel_reduce Body.
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body)
	Parallel iteration with reduction and default partitioner. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner)
	Parallel iteration with reduction and simple_partitioner. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner)
	Parallel iteration with reduction and auto_partitioner. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, const static_partitioner &partitioner)
	Parallel iteration with reduction and static_partitioner. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner)
	Parallel iteration with reduction and affinity_partitioner. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, task_group_context &context)
	Parallel iteration with reduction, default partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, const simple_partitioner &partitioner, task_group_context &context)
	Parallel iteration with reduction, simple partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, const auto_partitioner &partitioner, task_group_context &context)
	Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, const static_partitioner &partitioner, task_group_context &context)
	Parallel iteration with reduction, static_partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_reduce (const Range &range, Body &body, affinity_partitioner &partitioner, task_group_context &context)
	Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
	Parallel iteration with reduction and default partitioner. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner)
	Parallel iteration with reduction and simple_partitioner. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner)
	Parallel iteration with reduction and auto_partitioner. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const static_partitioner &partitioner)
	Parallel iteration with reduction and static_partitioner. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner)
	Parallel iteration with reduction and affinity_partitioner. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, task_group_context &context)
	Parallel iteration with reduction, default partitioner and user-supplied context. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner, task_group_context &context)
	Parallel iteration with reduction, simple partitioner and user-supplied context. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const auto_partitioner &partitioner, task_group_context &context)
	Parallel iteration with reduction, auto_partitioner and user-supplied context. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const static_partitioner &partitioner, task_group_context &context)
	Parallel iteration with reduction, static_partitioner and user-supplied context. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, affinity_partitioner &partitioner, task_group_context &context)
	Parallel iteration with reduction, affinity_partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_deterministic_reduce (const Range &range, Body &body)
	Parallel iteration with deterministic reduction and default simple partitioner. More...
template<typename Range , typename Body >
void	parallel_deterministic_reduce (const Range &range, Body &body, const simple_partitioner &partitioner)
	Parallel iteration with deterministic reduction and simple partitioner. More...
template<typename Range , typename Body >
void	parallel_deterministic_reduce (const Range &range, Body &body, const static_partitioner &partitioner)
	Parallel iteration with deterministic reduction and static partitioner. More...
template<typename Range , typename Body >
void	parallel_deterministic_reduce (const Range &range, Body &body, task_group_context &context)
	Parallel iteration with deterministic reduction, default simple partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_deterministic_reduce (const Range &range, Body &body, const simple_partitioner &partitioner, task_group_context &context)
	Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
template<typename Range , typename Body >
void	parallel_deterministic_reduce (const Range &range, Body &body, const static_partitioner &partitioner, task_group_context &context)
	Parallel iteration with deterministic reduction, static partitioner and user-supplied context. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction)
	Parallel iteration with deterministic reduction and default simple partitioner. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner)
	Parallel iteration with deterministic reduction and simple partitioner. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const static_partitioner &partitioner)
	Parallel iteration with deterministic reduction and static partitioner. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, task_group_context &context)
	Parallel iteration with deterministic reduction, default simple partitioner and user-supplied context. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const simple_partitioner &partitioner, task_group_context &context)
	Parallel iteration with deterministic reduction, simple partitioner and user-supplied context. More...
template<typename Range , typename Value , typename RealBody , typename Reduction >
Value	parallel_deterministic_reduce (const Range &range, const Value &identity, const RealBody &real_body, const Reduction &reduction, const static_partitioner &partitioner, task_group_context &context)
	Parallel iteration with deterministic reduction, static partitioner and user-supplied context. More...
parallel_scan
See also requirements on Range and parallel_scan Body.
template<typename Range , typename Body >
void	parallel_scan (const Range &range, Body &body)
	Parallel prefix with default partitioner. More...
template<typename Range , typename Body >
void	parallel_scan (const Range &range, Body &body, const simple_partitioner &partitioner)
	Parallel prefix with simple_partitioner. More...
template<typename Range , typename Body >
void	parallel_scan (const Range &range, Body &body, const auto_partitioner &partitioner)
	Parallel prefix with auto_partitioner. More...
template<typename Range , typename Value , typename Scan , typename ReverseJoin >
Value	parallel_scan (const Range &range, const Value &identity, const Scan &scan, const ReverseJoin &reverse_join)
	Parallel prefix with default partitioner. More...
template<typename Range , typename Value , typename Scan , typename ReverseJoin >
Value	parallel_scan (const Range &range, const Value &identity, const Scan &scan, const ReverseJoin &reverse_join, const simple_partitioner &partitioner)
	Parallel prefix with simple_partitioner. More...
template<typename Range , typename Value , typename Scan , typename ReverseJoin >
Value	parallel_scan (const Range &range, const Value &identity, const Scan &scan, const ReverseJoin &reverse_join, const auto_partitioner &partitioner)
	Parallel prefix with auto_partitioner. More...
parallel_sort
See also requirements on iterators for parallel_sort.
template<typename RandomAccessIterator , typename Compare >
void	parallel_sort (RandomAccessIterator begin, RandomAccessIterator end, const Compare &comp)
	Sorts the data in [begin,end) using the given comparator. More...
template<typename RandomAccessIterator >
void	parallel_sort (RandomAccessIterator begin, RandomAccessIterator end)
	Sorts the data in [begin,end) with a default comparator std::less<RandomAccessIterator> More...
template<typename Range , typename Compare >
void	parallel_sort (Range &rng, const Compare &comp)
	Sorts the data in rng using the given comparator. More...
template<typename Range >
void	parallel_sort (Range &rng)
	Sorts the data in rng with a default comparator std::less<RandomAccessIterator> More...
template<typename T >
void	parallel_sort (T *begin, T *end)
	Sorts the data in the range [begin,end) with a default comparator std::less<T> More...

Variables
const unsigned char	RELEASED = 0
const unsigned char	ACQUIRED = 1
static const tricky_pointer::word	FLAG = 0x1
	Mask for low order bit of a pointer. More...
static assertion_handler_type	assertion_handler

Detailed Description

The graph class.

The namespace tbb contains all components of the library.

This header provides basic platform abstraction layer by hooking up appropriate architecture/OS/compiler specific headers from the /include/tbb/machine directory. If a plug-in header does not implement all the required APIs, it must specify the missing ones by setting one or more of the following macros:

__TBB_USE_GENERIC_PART_WORD_CAS __TBB_USE_GENERIC_PART_WORD_FETCH_ADD __TBB_USE_GENERIC_PART_WORD_FETCH_STORE __TBB_USE_GENERIC_FETCH_ADD __TBB_USE_GENERIC_FETCH_STORE __TBB_USE_GENERIC_DWORD_FETCH_ADD __TBB_USE_GENERIC_DWORD_FETCH_STORE __TBB_USE_GENERIC_HALF_FENCED_LOAD_STORE __TBB_USE_GENERIC_SEQUENTIAL_CONSISTENCY_LOAD_STORE __TBB_USE_GENERIC_RELAXED_LOAD_STORE __TBB_USE_FETCHSTORE_AS_FULL_FENCED_STORE

In this case tbb_machine.h will add missing functionality based on a minimal set of APIs that are required to be implemented by all plug-n headers as described further. Note that these generic implementations may be sub-optimal for a particular architecture, and thus should be relied upon only after careful evaluation or as the last resort.

Additionally __TBB_64BIT_ATOMICS can be set to 0 on a 32-bit architecture to indicate that the port is not going to support double word atomics. It may also be set to 1 explicitly, though normally this is not necessary as tbb_machine.h will set it automatically.

__TBB_ENDIANNESS macro can be defined by the implementation as well. It is used only if __TBB_USE_GENERIC_PART_WORD_CAS is set (or for testing), and must specify the layout of aligned 16-bit and 32-bit data anywhere within a process (while the details of unaligned 16-bit or 32-bit data or of 64-bit data are irrelevant). The layout must be the same at all relevant memory locations within the current process; in case of page-specific endianness, one endianness must be kept "out of sight". Possible settings, reflecting hardware and possibly O.S. convention, are:

• __TBB_ENDIAN_BIG for big-endian data,
• __TBB_ENDIAN_LITTLE for little-endian data,
• __TBB_ENDIAN_DETECT for run-time detection iff exactly one of the above,
• __TBB_ENDIAN_UNSUPPORTED to prevent undefined behavior if none of the above.

Prerequisites for each architecture port

The following functions and macros have no generic implementation. Therefore they must be implemented in each machine architecture specific header either as a conventional function or as a functional macro.

__TBB_WORDSIZE This is the size of machine word in bytes, i.e. for 32 bit systems it should be defined to 4.

__TBB_Yield() Signals OS that the current thread is willing to relinquish the remainder of its time quantum.

__TBB_full_memory_fence() Must prevent all memory operations from being reordered across it (both by hardware and compiler). All such fences must be totally ordered (or sequentially consistent).

__TBB_machine_cmpswp4( volatile void *ptr, int32_t value, int32_t comparand ) Must be provided if __TBB_USE_FENCED_ATOMICS is not set.

__TBB_machine_cmpswp8( volatile void *ptr, int32_t value, int64_t comparand ) Must be provided for 64-bit architectures if __TBB_USE_FENCED_ATOMICS is not set, and for 32-bit architectures if __TBB_64BIT_ATOMICS is set

__TBB_machine_<op><S><fence>(...), where <op> = {cmpswp, fetchadd, fetchstore} <S> = {1, 2, 4, 8} <fence> = {full_fence, acquire, release, relaxed} Must be provided if __TBB_USE_FENCED_ATOMICS is set.

__TBB_control_consistency_helper() Bridges the memory-semantics gap between architectures providing only implicit C++0x "consume" semantics (like Power Architecture) and those also implicitly obeying control dependencies (like IA-64 architecture). It must be used only in conditional code where the condition is itself data-dependent, and will then make subsequent code behave as if the original data dependency were acquired. It needs only a compiler fence where implied by the architecture either specifically (like IA-64 architecture) or because generally stronger "acquire" semantics are enforced (like x86). It is always valid, though potentially suboptimal, to replace control with acquire on the load and then remove the helper.

__TBB_acquire_consistency_helper(), __TBB_release_consistency_helper() Must be provided if __TBB_USE_GENERIC_HALF_FENCED_LOAD_STORE is set. Enforce acquire and release semantics in generic implementations of fenced store and load operations. Depending on the particular architecture/compiler combination they may be a hardware fence, a compiler fence, both or nothing.

Before making any changes in the implementation, please emulate algorithmic changes with SPIN tool using <TBB directory>="">/tools/spin_models/ReaderWriterMutex.pml. There could be some code looking as "can be restructured" but its structure does matter!

This file is a possible future replacement for the task_stream class implemented in task_stream.h. It refactors the code and extends task_stream capabilities by moving lane management during operations on caller side. Despite the fact that new implementation should not affect performance of the original task stream, analysis on this subject was not made at the time it was developed. In addition, it is not clearly seen at the moment that this container would be suitable for critical tasks due to linear time complexity on its operations.

Typedef Documentation

assertion_handler_type

typedef void(* tbb::assertion_handler_type) (const char *filename, int line, const char *expression, const char *comment)

Type for an assertion handler.

Definition at line 46 of file tbb_assert_impl.h.

spin_rw_mutex

typedef spin_rw_mutex_v3 tbb::spin_rw_mutex

Definition at line 33 of file spin_rw_mutex.h.

stack_size_type

typedef std::size_t tbb::stack_size_type

Definition at line 42 of file task_scheduler_init.h.

tchar

typedef char tbb::tchar

Unicode support.

Definition at line 57 of file itt_notify.h.

tricky_pointer

typedef tricky_atomic_pointer<queuing_rw_mutex::scoped_lock> tbb::tricky_pointer

Definition at line 120 of file queuing_rw_mutex.cpp.

Enumeration Type Documentation

ets_key_usage_type

enum tbb::ets_key_usage_type

enum for selecting between single key and key-per-instance versions

Enumerator
ets_key_per_instance
ets_no_key

Definition at line 51 of file enumerable_thread_specific.h.

                        {
    ets_key_per_instance
    , ets_no_key
#if __TBB_PREVIEW_RESUMABLE_TASKS
    , ets_suspend_aware
#endif
};

memory_semantics

enum tbb::memory_semantics

Specifies memory semantics.

Enumerator
full_fence	Sequential consistency.
acquire	Acquire.
release	Release.
relaxed	No ordering.

Definition at line 53 of file atomic.h.

                      {
    full_fence,
    acquire,
    release,
    relaxed
};

priority_t

enum tbb::priority_t

Enumerator
priority_normal
priority_low
priority_high

Definition at line 317 of file task.h.

                {
    priority_normal = internal::priority_stride_v4 * 2,
    priority_low = priority_normal - internal::priority_stride_v4,
    priority_high = priority_normal + internal::priority_stride_v4
};

state_t_flags

enum tbb::state_t_flags

Flag bits in a state_t that specify information about a locking request.

Enumerator
STATE_NONE
STATE_WRITER
STATE_READER
STATE_READER_UNBLOCKNEXT
STATE_ACTIVEREADER
STATE_UPGRADE_REQUESTED
STATE_UPGRADE_WAITING
STATE_UPGRADE_LOSER
STATE_COMBINED_WAITINGREADER
STATE_COMBINED_READER
STATE_COMBINED_UPGRADING

Definition at line 33 of file queuing_rw_mutex.cpp.

                   {
    STATE_NONE                   = 0,
    STATE_WRITER                 = 1<<0,
    STATE_READER                 = 1<<1,
    STATE_READER_UNBLOCKNEXT     = 1<<2,
    STATE_ACTIVEREADER           = 1<<3,
    STATE_UPGRADE_REQUESTED      = 1<<4,
    STATE_UPGRADE_WAITING        = 1<<5,
    STATE_UPGRADE_LOSER          = 1<<6,
    STATE_COMBINED_WAITINGREADER = STATE_READER | STATE_READER_UNBLOCKNEXT,
    STATE_COMBINED_READER        = STATE_COMBINED_WAITINGREADER | STATE_ACTIVEREADER,
    STATE_COMBINED_UPGRADING     = STATE_UPGRADE_WAITING | STATE_UPGRADE_LOSER
};

task_group_status

enum tbb::task_group_status

Enumerator
not_complete
complete
canceled

Definition at line 73 of file task_group.h.

                       {
    not_complete,
    complete,
    canceled
};

Function Documentation

__TBB_DEPRECATED_MSG()

template<typename Key >

class tbb::__TBB_DEPRECATED_MSG	(	"tbb::tbb_hash is	deprecated,
		use std::hash"
	)

Definition at line 86 of file _tbb_hash_compare_impl.h.

{
public:
    tbb_hash() {}

    size_t operator()(const Key& key) const
    {
        return tbb_hasher(key);
    }
};

References key.

assertion_failure()

void __TBB_EXPORTED_FUNC tbb::assertion_failure	(	const char *	filename,
		int	line,
		const char *	expression,
		const char *	comment
	)

Process an assertion failure.

Normally called from __TBB_ASSERT macro. If assertion handler is null, print message for assertion failure and abort. Otherwise call the assertion handler.

Definition at line 56 of file tbb_assert_impl.h.

                                                                                                                              {
        if( assertion_handler_type a = assertion_handler ) {
            (*a)(filename,line,expression,comment);
        } else {
            static bool already_failed;
            if( !already_failed ) {
                already_failed = true;
                fprintf( stderr, "Assertion %s failed on line %d of file %s\n",
                         expression, line, filename );
                if( comment )
                    fprintf( stderr, "Detailed description: %s\n", comment );
#if _MSC_VER && _DEBUG
                if(1 == _CrtDbgReport(_CRT_ASSERT, filename, line, "tbb_debug.dll", "%s\r\n%s", expression, comment?comment:""))
                        _CrtDbgBreak();
#else
                fflush(stderr);
                std::abort();
#endif
            }
        }
    }

References assertion_handler.

atomic_fence()

void tbb::atomic_fence ( )

inline

Sequentially consistent full memory fence.

Definition at line 339 of file tbb_machine.h.

{ __TBB_full_memory_fence(); }

References __TBB_full_memory_fence.

Referenced by tbb::internal::concurrent_monitor::abort_all(), tbb::internal::arena::advertise_new_work(), tbb::internal::generic_scheduler::get_task(), tbb::internal::concurrent_monitor::notify(), tbb::internal::concurrent_monitor::notify_all(), tbb::internal::concurrent_monitor::notify_one(), tbb::internal::concurrent_monitor::prepare_wait(), and tbb::internal::generic_scheduler::steal_task_from().

Here is the caller graph for this function:

CAS()

template<typename T >

static T tbb::CAS ( volatile T &  addr, T  newv, T  oldv  )

inlinestatic

Definition at line 30 of file spin_rw_mutex.cpp.

                                                      {
    // ICC (9.1 and 10.1 tried) unable to do implicit conversion
    // from "volatile T*" to "volatile void*", so explicit cast added.
    return tbb::internal::as_atomic(addr).compare_and_swap( newv, oldv );
}

References addr, and tbb::internal::as_atomic().

Referenced by tbb::spin_rw_mutex_v3::internal_acquire_writer(), tbb::spin_rw_mutex_v3::internal_try_acquire_writer(), and tbb::spin_rw_mutex_v3::internal_upgrade().

Here is the call graph for this function:

Here is the caller graph for this function:

get_flag()

uintptr_t tbb::get_flag ( queuing_rw_mutex::scoped_lock *  ptr )

inline

Definition at line 131 of file queuing_rw_mutex.cpp.

                                                       {
    return uintptr_t(ptr) & FLAG;
}

References FLAG.

Referenced by tbb::queuing_rw_mutex::scoped_lock::release(), and tbb::queuing_rw_mutex::scoped_lock::upgrade_to_writer().

Here is the caller graph for this function:

is_current_task_group_canceling()

bool tbb::is_current_task_group_canceling ( )

inline

Definition at line 343 of file task_group.h.

                                       {
    return task::self().is_cancelled();
}

References tbb::task::is_cancelled(), and tbb::task::self().

Here is the call graph for this function:

load()

template<memory_semantics M, typename T >

struct __TBB_DEPRECATED_IN_VERBOSE_MODE_MSG ("tbb::atomic is deprecated, use std::atomic") atomic<T*> struct __TBB_DEPRECATED_IN_VERBOSE_MODE_MSG ("tbb::atomic is deprecated, use std::atomic") atomic<void*> T tbb::load

(

const atomic< T > &

a

)

Specialization for atomic<T*> with arithmetic and operator->.

Specialization for atomic<void*>, for sake of not allowing arithmetic or operator->.

Definition at line 546 of file atomic.h.

{ return a.template load<M>(); }

Referenced by tbb::internal::__TBB_load_full_fence(), and tbb::internal::__TBB_load_relaxed().

Here is the caller graph for this function:

make_task()

template<class F >

task_handle< typename internal::strip<F>::type > tbb::make_task

(

F &&

f

)

Definition at line 349 of file task_group.h.

                                                                {
    return task_handle< typename internal::strip<F>::type >( std::forward<F>(f) );
}

move()

void tbb::move ( tbb_thread &  t1, tbb_thread &  t2  )

inline

Definition at line 319 of file tbb_thread.h.

                                                   {
    internal::move_v3(t1, t2);
}

References tbb::internal::move_v3().

Referenced by tbb::interface9::parallel_do_feeder< Item >::add(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::allocate_node_default_construct(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::allocate_node_move_construct(), tbb::internal::allocator_move_assignment(), tbb::strict_ppl::internal::micro_queue< Value >::assign_and_destroy_item(), tbb::concurrent_bounded_queue< T, A >::assign_and_destroy_item(), tbb::internal::stored_pack< T, Types... >::call(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::concurrent_hash_map(), tbb::interface5::concurrent_priority_queue< graph_task *, graph_task_comparator >::concurrent_priority_queue(), tbb::interface10::internal::concurrent_skip_list< Traits >::concurrent_skip_list(), tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_map_traits< Key, T, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, false > >::concurrent_unordered_base(), tbb::interface6::memory_pool_allocator< T, P >::construct(), tbb::interface7::internal::delegated_function< F, R >::consume_result(), tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::create_local_by_move(), tbb::interface6::internal::token_helper< T, true >::create_token(), tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::enumerable_thread_specific(), tbb::interface9::internal::do_iteration_task< Body, Item >::execute(), tbb::interface5::concurrent_priority_queue< graph_task *, graph_task_comparator >::handle_operations(), tbb::interface5::concurrent_priority_queue< graph_task *, graph_task_comparator >::heapify(), tbb::interface10::internal::concurrent_skip_list< Traits >::insert(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::insert(), tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_map_traits< Key, T, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, false > >::insert(), tbb::interface9::internal::parallel_do_feeder_impl< Body, Item >::internal_add_move(), tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_map_traits< Key, T, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, false > >::internal_merge(), tbb::interface10::internal::concurrent_skip_list< Traits >::internal_merge(), tbb::interface10::internal::concurrent_skip_list< Traits >::internal_move_assign(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::internal_move_assign(), tbb::concurrent_vector< T, A >::internal_loop_guide::move_assign(), tbb::concurrent_vector< T, A >::internal_loop_guide::move_construct(), tbb::strict_ppl::concurrent_queue< T, A >::move_construct_item(), tbb::concurrent_bounded_queue< T, A >::move_item(), tbb::concurrent_bounded_queue< T, A >::move_page_item(), tbb::interface6::internal::concrete_filter< T, U, Body >::operator()(), tbb::interface6::internal::concrete_filter< T, void, Body >::operator()(), tbb::combinable< T >::operator=(), tbb::interface5::concurrent_priority_queue< graph_task *, graph_task_comparator >::operator=(), tbb::interface10::internal::concurrent_skip_list< Traits >::operator=(), tbb::concurrent_vector< padded_element, padded_allocator_type >::operator=(), tbb::interface5::internal::concurrent_unordered_base< concurrent_unordered_map_traits< Key, T, internal::hash_compare< Key, Hasher, Key_equality >, Allocator, false > >::operator=(), tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::operator=(), tbb::concurrent_vector< padded_element, padded_allocator_type >::push_back(), tbb::interface5::concurrent_priority_queue< graph_task *, graph_task_comparator >::reheap(), async_msg< T >::set(), and internal::kernel_executor_helper< StreamFactory, KernelInputTuple, typename tbb::internal::void_t< typename StreamFactory::range_type >::type >::set_range().

Here is the call graph for this function:

Here is the caller graph for this function:

operator!=() [1/5]

template<typename T , typename U >

bool tbb::operator!= ( const cache_aligned_allocator< T > &  , const cache_aligned_allocator< U > &    )

inline

Definition at line 132 of file cache_aligned_allocator.h.

{return false;}

operator!=() [2/5]

template<typename T , typename U >

bool tbb::operator!= ( const tbb_allocator< T > &  , const tbb_allocator< U > &    )

inline

Definition at line 142 of file tbb_allocator.h.

{return false;}

operator!=() [3/5]

template<typename T1 , template< typename X1 > class B1, typename T2 , template< typename X2 > class B2>

bool tbb::operator!= ( const zero_allocator< T1, B1 > &  a, const zero_allocator< T2, B2 > &  b  )

inline

Definition at line 197 of file tbb_allocator.h.

                                                                                        {
    return static_cast< B1<T1> >(a) != static_cast< B2<T2> >(b);
}

operator!=() [4/5]

template<typename T , class A1 , class A2 >

bool tbb::operator!= ( const concurrent_vector< T, A1 > &  a, const concurrent_vector< T, A2 > &  b  )

inline

Definition at line 1363 of file concurrent_vector.h.

{    return !(a == b); }

operator!=() [5/5]

template<typename Key , typename T , typename HashCompare , typename A1 , typename A2 >

bool tbb::operator!= ( const concurrent_hash_map< Key, T, HashCompare, A1 > &  a, const concurrent_hash_map< Key, T, HashCompare, A2 > &  b  )

inline

Definition at line 1634 of file concurrent_hash_map.h.

{    return !(a == b); }

operator-()

tick_count::interval_t tbb::operator- ( const tick_count &  t1, const tick_count &  t0  )

inline

Definition at line 126 of file tick_count.h.

                                                                                    {
    return tick_count::interval_t( t1.my_count-t0.my_count );
}

References tbb::tick_count::my_count.

operator<()

template<typename T , class A1 , class A2 >

bool tbb::operator< ( const concurrent_vector< T, A1 > &  a, const concurrent_vector< T, A2 > &  b  )

inline

Definition at line 1367 of file concurrent_vector.h.

{    return (std::lexicographical_compare(a.begin(), a.end(), b.begin(), b.end())); }

operator<=()

template<typename T , class A1 , class A2 >

bool tbb::operator<= ( const concurrent_vector< T, A1 > &  a, const concurrent_vector< T, A2 > &  b  )

inline

Definition at line 1375 of file concurrent_vector.h.

{    return !(b < a); }

operator==() [1/5]

template<typename T , typename U >

bool tbb::operator== ( const cache_aligned_allocator< T > &  , const cache_aligned_allocator< U > &    )

inline

Definition at line 129 of file cache_aligned_allocator.h.

{return true;}

operator==() [2/5]

template<typename T , typename U >

bool tbb::operator== ( const tbb_allocator< T > &  , const tbb_allocator< U > &    )

inline

Definition at line 139 of file tbb_allocator.h.

{return true;}

operator==() [3/5]

template<typename T1 , template< typename X1 > class B1, typename T2 , template< typename X2 > class B2>

bool tbb::operator== ( const zero_allocator< T1, B1 > &  a, const zero_allocator< T2, B2 > &  b  )

inline

Definition at line 193 of file tbb_allocator.h.

                                                                                        {
    return static_cast< B1<T1> >(a) == static_cast< B2<T2> >(b);
}

operator==() [4/5]

template<typename T , class A1 , class A2 >

bool tbb::operator== ( const concurrent_vector< T, A1 > &  a, const concurrent_vector< T, A2 > &  b  )

inline

Definition at line 1351 of file concurrent_vector.h.

                                                                                             {
    //TODO: call size() only once per vector (in operator==)
    // Simply:    return a.size() == b.size() && std::equal(a.begin(), a.end(), b.begin());
    if(a.size() != b.size()) return false;
    typename concurrent_vector<T, A1>::const_iterator i(a.begin());
    typename concurrent_vector<T, A2>::const_iterator j(b.begin());
    for(; i != a.end(); ++i, ++j)
        if( !(*i == *j) ) return false;
    return true;
}

operator==() [5/5]

template<typename Key , typename T , typename HashCompare , typename A1 , typename A2 >

bool tbb::operator== ( const concurrent_hash_map< Key, T, HashCompare, A1 > &  a, const concurrent_hash_map< Key, T, HashCompare, A2 > &  b  )

inline

Definition at line 1622 of file concurrent_hash_map.h.

                                                                                                                                     {
    if(a.size() != b.size()) return false;
    typename concurrent_hash_map<Key, T, HashCompare, A1>::const_iterator i(a.begin()), i_end(a.end());
    typename concurrent_hash_map<Key, T, HashCompare, A2>::const_iterator j, j_end(b.end());
    for(; i != i_end; ++i) {
        j = b.equal_range(i->first).first;
        if( j == j_end || !(i->second == j->second) ) return false;
    }
    return true;
}

References tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::begin(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::end(), tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::equal_range(), and tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::size().

Here is the call graph for this function:

operator>()

template<typename T , class A1 , class A2 >

bool tbb::operator> ( const concurrent_vector< T, A1 > &  a, const concurrent_vector< T, A2 > &  b  )

inline

Definition at line 1371 of file concurrent_vector.h.

{    return b < a; }

operator>=()

template<typename T , class A1 , class A2 >

bool tbb::operator>= ( const concurrent_vector< T, A1 > &  a, const concurrent_vector< T, A2 > &  b  )

inline

Definition at line 1379 of file concurrent_vector.h.

{    return !(a < b); }

set_assertion_handler()

assertion_handler_type __TBB_EXPORTED_FUNC tbb::set_assertion_handler

(

assertion_handler_type

new_handler

)

Set assertion handler and return previous value of it.

Definition at line 50 of file tbb_assert_impl.h.

                                                                                                           {
        assertion_handler_type old_handler = assertion_handler;
        assertion_handler = new_handler;
        return old_handler;
    }

References assertion_handler.

store()

template<memory_semantics M, typename T >

void tbb::store	(	atomic< T > &	a,
		T	value
	)

Definition at line 549 of file atomic.h.

{ a.template store<M>(value); }

References value.

Referenced by tbb::internal::__TBB_store_full_fence(), tbb::internal::__TBB_store_relaxed(), and tbb::internal::atomic_impl< I >::store().

Here is the caller graph for this function:

swap() [1/3]

void tbb::swap ( internal::tbb_thread_v3 &  t1, internal::tbb_thread_v3 &  t2  )

inline

Definition at line 323 of file tbb_thread.h.

                                                                                               {
    std::swap(t1.my_handle, t2.my_handle);
#if _WIN32||_WIN64
    std::swap(t1.my_thread_id, t2.my_thread_id);
#endif /* _WIN32||_WIN64 */
}

swap() [2/3]

template<typename T , class A >

void tbb::swap ( concurrent_vector< T, A > &  a, concurrent_vector< T, A > &  b  )

inline

Definition at line 1383 of file concurrent_vector.h.

{    a.swap( b ); }

swap() [3/3]

template<typename Key , typename T , typename HashCompare , typename A >

void tbb::swap ( concurrent_hash_map< Key, T, HashCompare, A > &  a, concurrent_hash_map< Key, T, HashCompare, A > &  b  )

inline

Definition at line 1638 of file concurrent_hash_map.h.

{    a.swap( b ); }

References tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::swap().

Referenced by tbb::interface5::concurrent_priority_queue< graph_task *, graph_task_comparator >::assign(), tbb::interface5::internal::hash_map_base::internal_swap(), tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::internal_swap(), tbb::interface5::concurrent_priority_queue< graph_task *, graph_task_comparator >::operator=(), tbb::internal::tbb_thread_v3::swap(), tbb::interface5::concurrent_priority_queue< graph_task *, graph_task_comparator >::swap(), and tbb::interface5::concurrent_hash_map< Key, T, HashCompare, Allocator >::swap().

Here is the call graph for this function:

Here is the caller graph for this function:

TBB_runtime_interface_version()

int tbb::TBB_runtime_interface_version

(

)

The function returns the interface version of the TBB shared library being used.

The version it returns is determined at runtime, not at compile/link time. So it can be different than the value of TBB_INTERFACE_VERSION obtained at compile time.

Definition at line 267 of file tbb_misc.cpp.

                                               {
    return TBB_INTERFACE_VERSION;
}

References TBB_INTERFACE_VERSION.

Variable Documentation

ACQUIRED

const unsigned char tbb::ACQUIRED = 1

Definition at line 48 of file queuing_rw_mutex.cpp.

Referenced by tbb::queuing_rw_mutex::scoped_lock::release(), and tbb::queuing_rw_mutex::scoped_lock::try_acquire_internal_lock().

assertion_handler

assertion_handler_type tbb::assertion_handler

static

Definition at line 48 of file tbb_assert_impl.h.

Referenced by assertion_failure(), and set_assertion_handler().

FLAG

const tricky_pointer::word tbb::FLAG = 0x1

static

Mask for low order bit of a pointer.

Definition at line 128 of file queuing_rw_mutex.cpp.

Referenced by tbb::queuing_rw_mutex::scoped_lock::acquire(), get_flag(), tbb::queuing_rw_mutex::scoped_lock::release(), and tbb::queuing_rw_mutex::scoped_lock::upgrade_to_writer().

RELEASED

const unsigned char tbb::RELEASED = 0

Definition at line 47 of file queuing_rw_mutex.cpp.

Referenced by tbb::queuing_rw_mutex::scoped_lock::acquire(), tbb::queuing_rw_mutex::scoped_lock::release_internal_lock(), tbb::queuing_rw_mutex::scoped_lock::try_acquire(), tbb::queuing_rw_mutex::scoped_lock::try_acquire_internal_lock(), and tbb::queuing_rw_mutex::scoped_lock::wait_for_release_of_internal_lock().