Home
last modified time | relevance | path

Searched refs:num_domains_ (Results 1 – 2 of 2) sorted by relevance

/dports/devel/hpx/hpx-1.2.1/hpx/runtime/threads/policies/
H A Dshared_priority_queue_scheduler.hpp80 , num_domains_(1) in shared_priority_queue_scheduler()
101 for (std::size_t d = 0; d < num_domains_; ++d) { in get_creation_time()
122 for (std::size_t d = 0; d < num_domains_; ++d) { in get_cleanup_time()
533 for (std::size_t d=0; d<num_domains_; ++d) { in cleanup_terminated()
692 for (std::size_t d=0; d<num_domains_; ++d) { in get_next_thread()
717 std::size_t dom = d % num_domains_; in get_next_thread()
937 for (std::size_t d=0; d<num_domains_; ++d) { in get_queue_length()
1119 std::size_t dom = d % num_domains_; in wait_or_add_new()
1154 num_domains_ = 1; in on_start_thread()
1167 num_domains_ = (std::max)(num_domains_, domain+1); in on_start_thread()
[all …]
/dports/devel/hpx/hpx-1.2.1/examples/resource_partitioner/
H A Dshared_priority_queue_scheduler.hpp200 , num_domains_(1) in shared_priority_queue_scheduler()
664 for (std::size_t d=0; d<num_domains_; ++d) { in cleanup_terminated()
852 for (std::size_t d=0; d<num_domains_; ++d) { in get_next_thread()
877 std::size_t dom = d % num_domains_; in get_next_thread()
1131 for (std::size_t d=0; d<num_domains_; ++d) { in get_queue_length()
1273 for (std::size_t d=0; d<num_domains_; ++d) { in enumerate_threads()
1305 for (std::size_t d=0; d<num_domains_; ++d) { in wait_or_add_new()
1332 std::size_t dom = d % num_domains_; in wait_or_add_new()
1370 num_domains_ = 1; in on_start_thread()
1386 num_domains_ = (std::max)(num_domains_, domain+1); in on_start_thread()
[all …]