1 /* 2 * Copyright (c) 2020 Arm Limited. 3 * 4 * SPDX-License-Identifier: MIT 5 * 6 * Permission is hereby granted, free of charge, to any person obtaining a copy 7 * of this software and associated documentation files (the "Software"), to 8 * deal in the Software without restriction, including without limitation the 9 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or 10 * sell copies of the Software, and to permit persons to whom the Software is 11 * furnished to do so, subject to the following conditions: 12 * 13 * The above copyright notice and this permission notice shall be included in all 14 * copies or substantial portions of the Software. 15 * 16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 22 * SOFTWARE. 23 */ 24 #ifndef SRC_COMPUTE_SCHEDULER_UTILS_H 25 #define SRC_COMPUTE_SCHEDULER_UTILS_H 26 27 #include <cstddef> 28 #include <utility> 29 30 namespace arm_compute 31 { 32 namespace scheduler_utils 33 { 34 /** Given two dimensions and a maximum number of threads to utilise, calculate the best 35 * combination of threads that fit in (multiplied together) max_threads. 36 * 37 * This algorithm assumes that work in either of the dimensions is equally difficult 38 * to compute 39 * 40 * @returns [m_nthreads, n_nthreads] A pair of the threads that should be used in each dimension 41 */ 42 std::pair<unsigned, unsigned> split_2d(unsigned max_threads, std::size_t m, std::size_t n); 43 } // namespace scheduler_utils 44 } // namespace arm_compute 45 #endif /* SRC_COMPUTE_SCHEDULER_UTILS_H */ 46