#include <cassert>
#include <cstdlib>
#include <iostream>

#include "cctk.h"
#include "cctk_Parameters.h"

#include "defs.hh"
#include "dh.hh"
#include "th.hh"

#include "gh.hh"

using namespace std;



  // Constructors
template<int D>
gh<D>::gh (const int reffact, const centering refcent,
	   const int mgfact, const centering mgcent,
           const ibbox baseextent)
  : reffact(reffact), refcent(refcent),
    mgfact(mgfact), mgcent(mgcent),
    baseextent(baseextent)
{
}

// Destructors
template<int D>
gh<D>::~gh () { }

// Modifiers
template<int D>
void gh<D>::recompose (const rexts& exts,
                       const rbnds& outer_bounds,
		       const rprocs& procs,
                       const bool do_prolongate)
{
  DECLARE_CCTK_PARAMETERS;
  
  _extents = exts;
  _outer_boundaries = outer_bounds;
  _processors = procs;
  
  // Consistency checks
  
  // nota bene: there might be 0 refinement levels.
  
  check_processor_number_consistency ();
  check_multigrid_consistency ();
  check_component_consistency ();
  check_base_grid_extent ();
  check_refinement_levels ();
  
  calculate_base_extents_of_all_levels ();
  
  if (output_bboxes) {
    do_output_bboxes ( cout);
    do_output_bases ( cout);
  }
  
  // Recompose the other hierarchies
  
  for (typename list<th<D>*>::iterator t=ths.begin(); t!=ths.end(); ++t) {
    (*t)->recompose();
  }
  
  for (typename list<dh<D>*>::iterator d=dhs.begin(); d!=dhs.end(); ++d) {
    (*d)->recompose (do_prolongate);
  }
}

template<int D>
void gh<D>::check_processor_number_consistency () {
  for (int rl=0; rl<reflevels(); ++rl) {
    assert (processors().size() == extents().size());
    assert (outer_boundaries().size() == extents().size());
    for (int c=0; c<components(rl); ++c) {
      assert (processors().at(rl).size() == extents().at(rl).size());
      assert (outer_boundaries().at(rl).size() == extents().at(rl).size());
    }
  }
}
  
template<int D>
void gh<D>::check_multigrid_consistency () {
  for (int rl=0; rl<reflevels(); ++rl) {
    for (int c=0; c<components(rl); ++c) {
      assert (mglevels(rl,c)>0);
      for (int ml=1; ml<mglevels(rl,c); ++ml) {
	assert (all(extents().at(rl).at(c).at(ml).stride()
		    == ivect(mgfact) * extents().at(rl).at(c).at(ml-1).stride()));
        // TODO: put the check back in, taking outer boundaries into
        // account
#if 0
	assert (extents().at(rl).at(c).at(ml)
		.contracted_for(extents().at(rl).at(c).at(ml-1))
		.is_contained_in(extents().at(rl).at(c).at(ml-1)));
#endif
      }
    }
  }
}
  
template<int D>
void gh<D>::check_component_consistency () {
  for (int rl=0; rl<reflevels(); ++rl) {
    assert (components(rl)>0);
    for (int c=0; c<components(rl); ++c) {
      for (int ml=0; ml<mglevels(rl,c); ++ml) {
        const ibbox &b  = extents().at(rl).at(c).at(ml);
        const ibbox &b0 = extents().at(rl).at(0).at(ml);
	assert (all(b.stride() == b0.stride()));
	assert (b.is_aligned_with(b0));
        for (int cc=c+1; cc<components(rl); ++cc) {
          assert ((b & extents().at(rl).at(cc).at(ml)).empty());
        }
      }
    }
  }
}

template<int D>
void gh<D>::check_base_grid_extent () {
  if (reflevels()>0) {
    for (int c=0; c<components(0); ++c) {
      // TODO: put the check back in, taking outer boundaries into
      // account
#if 0
      assert (extents().at(0).at(c).at(0).is_contained_in(baseextent));
#endif
    }
  }
}
  
template<int D>
void gh<D>::check_refinement_levels () {
  for (int rl=1; rl<reflevels(); ++rl) {
    assert (all(extents().at(rl-1).at(0).at(0).stride()
		== ivect(reffact) * extents().at(rl).at(0).at(0).stride()));
    // Check contained-ness:
    // first take all coarse grids ...
    bboxset<int,D> all;
    for (int c=0; c<components(rl-1); ++c) {
      all |= extents().at(rl-1).at(c).at(0);
    }
    // ... remember their size ...
    const int sz = all.size();
    // ... then add the coarsified fine grids ...
    for (int c=0; c<components(rl); ++c) {
      all |= extents().at(rl).at(c).at(0).contracted_for(extents().at(rl-1).at(0).at(0));
    }
    // ... and then check the sizes:
    assert (all.size() == sz);
  }
}

template<int D>
void gh<D>::calculate_base_extents_of_all_levels () {
  _bases.resize(reflevels());
  for (int rl=0; rl<reflevels(); ++rl) {
    if (components(rl)==0) {
      _bases.at(rl).resize(0);
    } else {
      _bases.at(rl).resize(mglevels(rl,0));
      for (int ml=0; ml<mglevels(rl,0); ++ml) {
        _bases.at(rl).at(ml) = ibbox();
        ibbox &bb = _bases.at(rl).at(ml);
	for (int c=0; c<components(rl); ++c) {
	  bb = bb.expanded_containing(extents().at(rl).at(c).at(ml));
	}
      }
    }
  }
}

// Accessors
template<int D>
int gh<D>::local_components (const int rl) const {
  int lc = 0;
  for (int c=0; c<components(rl); ++c) {
    if (is_local(rl,c)) ++lc;
  }
  return lc;
}



// Time hierarchy management
template<int D>
void gh<D>::add (th<D>* t) {
  ths.push_back(t);
}

template<int D>
void gh<D>::remove (th<D>* t) {
  ths.remove(t);
}



// Data hierarchy management
template<int D>
void gh<D>::add (dh<D>* d) {
  dhs.push_back(d);
}

template<int D>
void gh<D>::remove (dh<D>* d) {
  dhs.remove(d);
}


template<int D>
void gh<D>::do_output_bboxes (ostream& os) const {
  for (int rl=0; rl<reflevels(); ++rl) {
    for (int c=0; c<components(rl); ++c) {
      for (int ml=0; ml<mglevels(rl,c); ++ml) {
        os << endl;
        os << "gh bboxes:" << endl;
        os << "rl=" << rl << " c=" << c << " ml=" << ml << endl;
        os << "extent=" << extents().at(rl).at(c).at(ml) << endl;
        os << "outer_boundary=" << outer_boundaries().at(rl).at(c) << endl;
        os << "processor=" << processors().at(rl).at(c) << endl;
      }
    }
  }
}

template<int D>
void gh<D>::do_output_bases (ostream& os) const {
  for (int rl=0; rl<reflevels(); ++rl) {
    if (components(rl)>0) {
      for (int ml=0; ml<mglevels(rl,0); ++ml) {
        os << endl;
        os << "gh bases:" << endl;
        os << "rl=" << rl << " ml=" << ml << endl;
        os << "base=" << bases().at(rl).at(ml) << endl;
      }
    }
  }
}

template<int D>
ostream& gh<D>::output (ostream& os) const {
  os << "gh<" << D << ">:"
     << "reffactor=" << reffact << ",refcentering=" << refcent << ","
     << "mgfactor=" << mgfact << ",mgcentering=" << mgcent << ","
     << "extents=" << extents() << ","
     << "outer_boundaries=" << outer_boundaries() << ","
     << "processors=" << processors() << ","
     << "dhs={";
  const char * sep = "";
  for (typename list<dh<D>*>::const_iterator d = dhs.begin();
       d != dhs.end(); ++d)
  {
    os << sep;
    (*d)->output(os);
    sep = ",";
  }
  os << "}";
  return os;
}



template class gh<3>;