/*===--------------------------------------------------------------------------
 *              ATMI (Asynchronous Task and Memory Interface)
 *
 * This file is distributed under the MIT License. See LICENSE.txt for details.
 *===------------------------------------------------------------------------*/
#include "queue.h"
#include "atmi.h"
#include "hsa_ext_amd.h"

bool equalsPlace(const atmi_place_t &l, const atmi_place_t &r) {
  bool val = false;
  if (l.node_id == r.node_id && l.type == r.type &&
      l.device_id == r.device_id && l.cu_mask == r.cu_mask)
    val = true;
  return val;
}

hsa_status_t ATLGPUQueue::set_place(atmi_place_t place) {
  hsa_status_t val = HSA_STATUS_SUCCESS;
  if (!equalsPlace(place_, place)) {
    place_ = place;
    val = hsa_amd_queue_cu_set_mask(
        queue_, 2, reinterpret_cast<uint32_t *>(&(place_.cu_mask)));
  }
  return val;
}

hsa_status_t ATLCPUQueue::set_place(atmi_place_t place) {
  hsa_status_t val = HSA_STATUS_SUCCESS;
  if (!equalsPlace(place_, place)) {
    place_ = place;
    // change pthread-to-core binding based on cpu_set. If number of bits that
    // are set on cpu_set is >1 then choose the first non-zero bit and place
    // the thread on that core.
    // TODO(ashwinma): Any other scheduling algorithms based on load, task group
    // annotations, and so on...
  }
  return val;
}