Lines Matching refs:my_count

1887     size_t my_count; // number of successful puts  variable
1904 if ( delta > 0 && size_t(delta) > my_count ) { in decrement_counter()
1906 my_future_decrement += (size_t(delta) - my_count); in decrement_counter()
1908 my_count = 0; in decrement_counter()
1910 else if ( delta < 0 && size_t(-delta) > my_threshold - my_count ) { in decrement_counter()
1911 my_count = my_threshold; in decrement_counter()
1914 my_count -= size_t(delta); // absolute value of delta is sufficiently small in decrement_counter()
1916 …__TBB_ASSERT(my_count <= my_threshold, "counter values are truncated to be inside the [0, threshol… in decrement_counter()
1927 …return ( my_count + my_tries < my_threshold && !my_predecessors.empty() && !my_successors.empty() … in check_conditions()
1952 ++my_count; in forward_task()
1954 if ( my_count > my_future_decrement ) { in forward_task()
1955 my_count -= my_future_decrement; in forward_task()
1959 my_future_decrement -= my_count; in forward_task()
1960 my_count = 0; in forward_task()
2010 : graph_node(g), my_threshold(threshold), my_count(0), my_tries(0), my_future_decrement(0), in limiter_node()
2036 if ( was_empty && !my_predecessors.empty() && my_count + my_tries < my_threshold ) { in register_successor()
2061 …if ( my_count + my_tries < my_threshold && !my_successors.empty() && is_graph_active(this->my_grap… in register_predecessor()
2086 if ( my_count + my_tries >= my_threshold ) in try_put_task()
2105 ++my_count; in try_put_task()
2107 if ( my_count > my_future_decrement ) { in try_put_task()
2108 my_count -= my_future_decrement; in try_put_task()
2112 my_future_decrement -= my_count; in try_put_task()
2113 my_count = 0; in try_put_task()
2124 my_count = 0; in reset_node()