Home
last modified time | relevance | path

Searched refs:predecessor (Results 1 – 9 of 9) sorted by relevance

/oneTBB/src/tbb/
H A Dqueuing_rw_mutex.cpp179 if( predecessor ) { in acquire()
181 predecessor = tricky_pointer(predecessor) & ~FLAG; in acquire()
192 if( predecessor ) { in acquire()
195 if( tricky_pointer(predecessor) & FLAG ) { in acquire()
198 predecessor = tricky_pointer(predecessor) & ~FLAG; in acquire()
344 if( predecessor ) { in release()
382 release_internal_lock(*predecessor); in release()
525 queuing_rw_mutex::scoped_lock * predecessor; in upgrade_to_writer() local
528 if( predecessor ) { in upgrade_to_writer()
552 release_internal_lock(*predecessor); in upgrade_to_writer()
[all …]
/oneTBB/doc/main/tbb_userguide/
H A DFlow_Graph_Message_Passing_Protocol.rst9 message from its predecessor. For a graph to operate most-efficiently,
12 query its predecessor to see if a message is available. If the edge did
13 not reverse from push to pull, the predecessor node would have to
19 try to pull a message from a predecessor.
22 #. If a predecessor has a message, the successor will process it and the
24 #. If the predecessor has no message, the edge between the nodes will
H A Dcommunicate_with_nodes.rst14 predecessor or successor at times that are unexpected by the user.
74 consider m2 to be a predecessor of n1 since no edge exists.
H A DEdges.rst10 ``make_edge( p, s )`` with two arguments: ``p``, the predecessor, and ``s``, the
H A DFlow_Graph_Reservation.rst29 an edge in pull state. While the input port's predecessor is in
38 by the predecessor nodes, because they have been successfully pushed.
95 ``bn``. Port 1 of the ``join_node`` has one predecessor, ``buffer_node``
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A Dshortpath.cpp92 std::vector<vertex_id> predecessor; // for recreating path from src to dst variable
145 predecessor[v] = u; in shortpath_helper()
169 vertex_id at = predecessor[dst]; in make_path()
217 predecessor.resize(N); in InitializeGraph()
270 predecessor[i] = N; in ResetGraph()
319 if (predecessor[dst] != N) { in main()
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DWavefront.rst14 an item uses results from computations on predecessor items.
37 predecessor completes.
58 additional predecessor. When the number of predecessors becomes
59 known, treat this conceptual predecessor as completed.
151 // Initialize predecessor counts for blocks.
/oneTBB/doc/main/reference/
H A Dfollows_and_precedes_functions.rst24 the predecessor of the set of nodes passed as an argument.
/oneTBB/
H A Dthird-party-programs.txt271 …predecessor in interest had or could give under the previous paragraph, plus a right to possession…