shape.cpp

#include <migraph/shape.hpp>
#include <migraph/stringutils.hpp>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iostream>

namespace migraph {

struct shape_impl
{

  static std::shared_ptr<shape_impl> default_shape()
  {
    static std::shared_ptr<shape_impl> result = std::make_shared<shape_impl>();
    return result;
  }

  shape_impl() : m_type(shape::float_type), m_standard(false) {}

  shape_impl(shape::type_t t) : m_type(t), m_lens({1}), m_strides({1}), m_standard(true) {}
  shape_impl(shape::type_t t, std::vector<std::size_t> l)
      : m_type(t), m_lens(std::move(l)), m_standard(true)
  {
      this->calculate_strides();
      assert(m_lens.size() == m_strides.size());
  }
  shape_impl(shape::type_t t, std::vector<std::size_t> l, std::vector<std::size_t> s)
      : m_type(t), m_lens(std::move(l)), m_strides(std::move(s))
  {
      assert(m_lens.size() == m_strides.size());
      assert(std::any_of(m_strides.begin(), m_strides.end(), [](auto x) { return x > 0; }) and
             "At least one stride must be non-zero");
      m_standard = this->elements() == this->element_space() and std::is_sorted(m_strides.rbegin(), m_strides.rend());
  }
  shape::type_t m_type;
  std::vector<std::size_t> m_lens;
  std::vector<std::size_t> m_strides;
  bool m_standard;

  void calculate_strides()
  {
      m_strides.clear();
      m_strides.resize(m_lens.size(), 0);
      if(m_strides.empty())
          return;
      m_strides.back() = 1;
      std::partial_sum(
          m_lens.rbegin(), m_lens.rend() - 1, m_strides.rbegin() + 1, std::multiplies<std::size_t>());
  }

  std::size_t element_space() const
  {
      assert(m_lens.size() == m_strides.size());
      if(m_lens.empty())
          return 0;
      return std::inner_product(m_lens.begin(),
                                m_lens.end(),
                                m_strides.begin(),
                                std::size_t{0},
                                std::plus<std::size_t>{},
                                [](std::size_t l, std::size_t s) { return (l - 1) * s; }) +
             1;
  }

  std::size_t elements() const
  {
      assert(m_lens.size() == m_strides.size());
      if(m_lens.empty())
          return 0;
      return std::accumulate(
          m_lens.begin(), m_lens.end(), std::size_t{1}, std::multiplies<std::size_t>());
  }
};

shape::shape() : impl(shape_impl::default_shape()) {}

shape::shape(type_t t) : impl(std::make_shared<shape_impl>(t)) {}
shape::shape(type_t t, std::vector<std::size_t> l)
    : impl(std::make_shared<shape_impl>(t, std::move(l)))
{
}
shape::shape(type_t t, std::vector<std::size_t> l, std::vector<std::size_t> s)
    : impl(std::make_shared<shape_impl>(t, std::move(l), std::move(s)))
{
}

shape::type_t shape::type() const { return impl->m_type; }
const std::vector<std::size_t>& shape::lens() const { return impl->m_lens; }
const std::vector<std::size_t>& shape::strides() const { return impl->m_strides; }
std::size_t shape::elements() const
{
    return impl->elements();
}
std::size_t shape::bytes() const
{
    std::size_t n = 0;
    this->visit_type([&](auto as) { n = as.size(); });
    return n * this->element_space();
}
std::size_t shape::index(std::initializer_list<std::size_t> l) const
{
    assert(l.size() <= this->lens().size());
    assert(this->lens().size() == this->strides().size());
    return std::inner_product(l.begin(), l.end(), this->strides().begin(), std::size_t{0});
}
std::size_t shape::index(const std::vector<std::size_t>& l) const
{
    assert(l.size() <= this->lens().size());
    assert(this->lens().size() == this->strides().size());
    return std::inner_product(l.begin(), l.end(), this->strides().begin(), std::size_t{0});
}
std::size_t shape::index(std::size_t i) const
{
    assert(this->lens().size() == this->strides().size());
    if(this->standard())
        return i;
    else
        return std::inner_product(this->lens().begin(),
                                  this->lens().end(),
                                  this->strides().begin(),
                                  std::size_t{0},
                                  std::plus<std::size_t>{},
                                  [&](std::size_t len, std::size_t stride) {
                                      assert(stride > 0 and len > 0);
                                      return ((i / stride) % len) * stride;
                                  });
}
bool shape::packed() const { return this->elements() == this->element_space(); }

bool shape::transposed() const
{
    return not std::is_sorted(this->strides().rbegin(), this->strides().rend());
}

bool shape::broadcasted() const
{
    assert(this->lens().size() == this->strides().size());
    return std::accumulate(this->strides().begin(),
                           this->strides().end(),
                           std::size_t{1},
                           std::multiplies<std::size_t>()) == 0;
}

bool shape::standard() const { return impl->m_standard; }

std::size_t shape::element_space() const
{
    return impl->element_space();
}

std::string shape::type_string() const
{
    switch(this->type())
    {
#define MIGRAPH_SHAPE_TYPE_STRING_CASE(x, t) \
    case x: return #x;
        MIGRAPH_SHAPE_VISIT_TYPES(MIGRAPH_SHAPE_TYPE_STRING_CASE)
#undef MIGRAPH_SHAPE_TYPE_STRING_CASE
    }
    MIGRAPH_THROW("Invalid type");
}

bool operator==(const shape& x, const shape& y)
{
    return x.type() == y.type() && x.lens() == y.lens() && x.strides() == y.strides();
}
bool operator!=(const shape& x, const shape& y) { return !(x == y); }

std::ostream& operator<<(std::ostream& os, const shape& x)
{
    os << x.type_string() << ", ";
    os << "{" << to_string_range(x.lens()) << "}, ";
    os << "{" << to_string_range(x.strides()) << "}";
    return os;
}

} // namespace migraph