/*****************************************************************************
*
* Copyright (c) 2000 - 2018, Lawrence Livermore National Security, LLC
* Produced at the Lawrence Livermore National Laboratory
* LLNL-CODE-442911
* All rights reserved.
*
* This file is  part of VisIt. For  details, see https://visit.llnl.gov/.  The
* full copyright notice is contained in the file COPYRIGHT located at the root
* of the VisIt distribution or at http://www.llnl.gov/visit/copyright.html.
*
* Redistribution  and  use  in  source  and  binary  forms,  with  or  without
* modification, are permitted provided that the following conditions are met:
*
*  - Redistributions of  source code must  retain the above  copyright notice,
*    this list of conditions and the disclaimer below.
*  - Redistributions in binary form must reproduce the above copyright notice,
*    this  list of  conditions  and  the  disclaimer (as noted below)  in  the
*    documentation and/or other materials provided with the distribution.
*  - Neither the name of  the LLNS/LLNL nor the names of  its contributors may
*    be used to endorse or promote products derived from this software without
*    specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT  HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR  IMPLIED WARRANTIES, INCLUDING,  BUT NOT  LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND  FITNESS FOR A PARTICULAR  PURPOSE
* ARE  DISCLAIMED. IN  NO EVENT  SHALL LAWRENCE  LIVERMORE NATIONAL  SECURITY,
* LLC, THE  U.S.  DEPARTMENT OF  ENERGY  OR  CONTRIBUTORS BE  LIABLE  FOR  ANY
* DIRECT,  INDIRECT,   INCIDENTAL,   SPECIAL,   EXEMPLARY,  OR   CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT  LIMITED TO, PROCUREMENT OF  SUBSTITUTE GOODS OR
* SERVICES; LOSS OF  USE, DATA, OR PROFITS; OR  BUSINESS INTERRUPTION) HOWEVER
* CAUSED  AND  ON  ANY  THEORY  OF  LIABILITY,  WHETHER  IN  CONTRACT,  STRICT
* LIABILITY, OR TORT  (INCLUDING NEGLIGENCE OR OTHERWISE)  ARISING IN ANY  WAY
* OUT OF THE  USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
*
*****************************************************************************/

// ************************************************************************* //
//                            avtIntegralCurve.C                             //
// ************************************************************************* //

#include <avtIntegralCurve.h>

#include <list>
#include <iostream>
#include <limits>
#include <ImproperUseException.h>
#include <DebugStream.h>
#include <avtVector.h>
#include <algorithm>
#include <snprintf.h>

const double avtIntegralCurve::minHFactor = std::numeric_limits<double>::epsilon() * 100.0;

using namespace std;

// ****************************************************************************
//  Method: avtIntegralCurve constructor
//
//  Programmer: Christoph Garth
//  Creation:   February 25, 2008
//
//  Modifications:
//  
//   Dave Pugmire, Mon Feb 23, 09:11:34 EST 2009
//   Reworked the termination code. Added a type enum and value. Made num steps
//   a termination criterion. Code cleanup: We no longer need fwd/bwd solvers.
//
//   Dave Pugmire, Mon Jun 8 2009, 11:44:01 EDT 2009
//   Remove wantVorticity, intialize scalarValueType.
//
//   Dave Pugmire, Tue Aug 11 10:25:45 EDT 2009
//   Add new termination criterion: Number of intersections with an object.
//
//   Dave Pugmire, Tue Aug 18 08:47:40 EDT 2009
//   Don't record intersection points, just count them.
//
//   Dave Pugmire, Tue Dec  1 11:50:18 EST 2009
//   Switch from avtVec to avtVector.
//  
//   Hank Childs, Thu Jun  3 10:58:32 PDT 2010
//   Remove _t0 and _p0, which are no longer used.
//
//   Hank Childs, Sat Jun  5 16:29:56 CDT 2010
//   Separate out portions related to Integral Curve and Poincare into 
//   avtStateRecorderIntegralCurve.
//
//   Hank Childs, Tue Oct  5 18:41:35 PDT 2010
//   Remove references to "termination", which now go in derived type.
//
//   Dave Pugmire, Fri Nov  5 15:34:49 EDT 2010
//   Add counter to handle communication of ICs
//
//   Hank Childs, Sun Dec  5 11:43:46 PST 2010
//   Initialize encounteredNumericalProblems.
//
// ****************************************************************************

avtIntegralCurve::avtIntegralCurve( const avtIVPSolver* model, 
                                    Direction dir,
                                    const double& t_start,
                                    const avtVector &p_start, 
                                    const avtVector &v_start, 
                                    long ID )
    : direction(dir), sortKey(0), id(ID), originatingRank(-1)
{
    ivp = model->Clone();
    ivp->Reset( t_start, p_start, v_start );
    counter = 0;
    status.Clear();
    status.SetOK();
}


// ****************************************************************************
//  Method: avtIntegralCurve constructor
//
//  Programmer: Christoph Garth
//  Creation:   February 25, 2008
//
//  Modifications:
//
//   Dave Pugmire, Mon Jun 8 2009, 11:44:01 EDT 2009
//   Remove wantVorticity, intialize scalarValueType.
//
//   Dave Pugmire, Tue Aug 11 10:25:45 EDT 2009
//   Add new termination criterion: Number of intersections with an object.
//
//   Dave Pugmire, Tue Aug 18 08:47:40 EDT 2009
//   Don't record intersection points, just count them.
//
//   Hank Childs, Sat Jun  5 16:29:56 CDT 2010
//   Separate out portions related to Integral Curve and Poincare into 
//   avtStateRecorderIntegralCurve.
//
//   Hank Childs, Tue Oct  5 18:41:35 PDT 2010
//   Remove references to "termination", which now go in derived type.
//
//   Dave Pugmire, Fri Nov  5 15:34:49 EDT 2010
//   Add counter to handle communication of ICs
//
//   Hank Childs, Sun Dec  5 11:43:46 PST 2010
//   Initialize encounteredNumericalProblems.
//
// ****************************************************************************

avtIntegralCurve::avtIntegralCurve()
{
    ivp = NULL;

    direction = DIRECTION_FORWARD;
    sortKey = 0;
    id = -1;
    counter = 0;
    originatingRank = -1;
}


// ****************************************************************************
//  Method: avtIntegralCurve destructor
//
//  Programmer: Christoph Garth
//  Creation:   February 25, 2008
//
//  Modifications:
//    Dave Pugmire, Mon Feb 23, 09:11:34 EST 2009
//    Reworked the termination code. Added a type enum and value. Made num steps
//    a termination criterion. Code cleanup: We no longer need fwd/bwd solvers.
//    
// ****************************************************************************

avtIntegralCurve::~avtIntegralCurve()
{
    if (ivp)
        delete ivp;
    
#ifdef USE_IC_STATE_TRACKING
    trk.close();
#endif
}

// ****************************************************************************
//  Method: avtIntegralCurve::Advance
//
//  Purpose:
//      Advances the integral curve.
//
//  Programmer: Christoph Garth
//  Creation:   February 25, 2008
//
//  Modifications:
//
//    Dave Pugmire, Wed Aug 13 10:58:32 EDT 2008
//    Modify how data without ghost zones are handled.
//
//    Dave Pugmire, Tue Aug 19, 17:38:03 EDT 2008
//    Changed how distanced based termination is computed.
//
//    Dave Pugmire, Wed Dec  3 08:33:42 EST 2008
//    Added maxSteps argument to optionally control how many integration steps
//    are taken.
//
//    Dave Pugmire, Mon Feb 23, 09:11:34 EST 2009
//    Reworked the termination code. Added a type enum and value. Made num steps
//    a termination criterion. Code cleanup: We no longer need fwd/bwd solvers.
//
//   Dave Pugmire, Mon Jun 8 2009, 11:44:01 EDT 2009
//   Removed the wantVorticity, extents and ghostzone flags. Extents and ghost
//   zones are handled by the vtkDataSet itself. The wantVorticity was replaced
//   with a scalarValueType which can be 'or'-d together to specify what to
//   compute.
//
//    Christoph Garth, Wed Jul 21, 09:27:01 PDT 2010
//    Rolled DoAdvance into this method since all it did was call it.
//
//    Hank Childs, Sun Dec  5 11:43:46 PST 2010
//    Indicate when we have a numerical problem.
//
//    David Camp, Tue Feb  1 09:45:41 PST 2011
//    Added a catch just incase an error ocurres.
//
//   Dave Pugmire, Fri Feb 18 14:52:18 EST 2011
//   Replaced minH with minHFactor for use when integrating upto a domain boundary.
//
//   Hank Childs, Thu Aug 25 14:08:48 PDT 2011
//   If we take a step to that ends up "OUTSIDE_DOMAIN", then make sure
//   that the amount of step is limited by our maximum time.  (We have 
//   observed multiple cases where the epsilon step in space is actually
//   a huge step in time ... so big that it causes the particle to go well
//   too far in the future.)
//
//   Hank Childs, Sat Mar 10 14:10:47 PST 2012
//   Fix bug with supporting reverse pathlines.
//
//   Dave Pugmire, Wed Jun  5 14:31:18 EDT 2013
//   Fix bug in terminating the while loop. Was checking for OK(), and not Integrateable().
//
//   Dave Pugmire, Mon Dec 15 11:00:23 EST 2014
//   Return number of steps taken.
//
// ****************************************************************************

int
avtIntegralCurve::Advance(avtIVPField *field)
{
    status.Clear();
    status.SetOK();
    int numStepsTaken = 0;

    double range[2];
    field->GetTimeRange(range);

    // Catch cases where the start position is outside the
    // domain of field; in this case, mark the curve 
    avtIVPField::Result fieldRes =
      field->IsInside(ivp->GetCurrentT(), ivp->GetCurrentY());

    if (fieldRes != avtIVPField::OK)
    {
        if( DebugStream::Level5() )
        {
            debug5 << "avtIntegralCurve::Advance(): "
                   << "initial point is outside domain\n";
        }
        if (fieldRes == avtIVPField::OUTSIDE_SPATIAL ||
            fieldRes == avtIVPField::OUTSIDE_BOTH)
            status.SetAtSpatialBoundary();
        if (fieldRes == avtIVPField::OUTSIDE_TEMPORAL ||
            fieldRes == avtIVPField::OUTSIDE_BOTH)
            status.SetAtTemporalBoundary();
        return numStepsTaken;
    }

    // Some of the test PICS flow fields have periodic boundaries.
    if( field->HasPeriodicBoundaries() )
    {
      double x, y, z;

      field->GetBoundaries( x, y, z );

      ivp->SetBoundaries( x, y, z );
    }

    // For a directionless field the initial velocity direction needs
    // to be known.
    if( field->GetDirectionless() && ivp->GetCurrentV().length() == 0.0 )

    {
      // Find the value sans orientation checks.
      field->SetDirectionless( false );

      avtVector vel;
      (*field)(ivp->GetCurrentT(), ivp->GetCurrentY(), vel);

      ivp->SetCurrentV(vel);

      // Restore the orientation checks.
      field->SetDirectionless( true );
    }

    // Determine the maximum integration time from the field's temporal
    // extent and the time termination criterion (if set).
    double tfinal;

    if (direction == DIRECTION_FORWARD)
    {
        tfinal = range[1];

        if (UseFixedTerminationTime() && FixedTerminationTime() < tfinal)
            tfinal = FixedTerminationTime();
    }
    else
    {
        tfinal = range[0];

        if (UseFixedTerminationTime() && FixedTerminationTime() > tfinal)
            tfinal = FixedTerminationTime();
    }

    status.SetInsideBlock();
    bool firstStep = true;
    // Loop doing integration steps.
    do
    {
        avtIVPStep           step;
        avtIVPSolver::Result result;
        result = ivp->Step( field, tfinal, &step );
        ++numStepsTaken;

        if (result == avtIVPSolver::OK || result == avtIVPSolver::TERMINATE)
        {
            // The step was successful, call AnalyzeStep() which will
            // determine((among other things) whether to terminate.
            AnalyzeStep(step, field, firstStep);
            firstStep = false;

            // If the user termination criteria was reached exit the
            // loop without any further checks.
            // if( status.TerminationMet() ) 
            //     break;

            // Check if the new position is outside the domain
            // (or in the domain's ghost data); in this case
            // finish here and continue in the next domain.
            fieldRes = field->IsInside(ivp->GetCurrentT(),
                                       ivp->GetCurrentY());

            if (fieldRes != avtIVPField::OK)
            {
                if( DebugStream::Level5() )
                {
                    debug5 << "avtIntegralCurve::Advance(): "
                           << "step ended in ghost data\n";
                }

                if (fieldRes == avtIVPField::OUTSIDE_SPATIAL ||
                    fieldRes == avtIVPField::OUTSIDE_BOTH)
                    status.SetAtSpatialBoundary();

                if (fieldRes == avtIVPField::OUTSIDE_TEMPORAL ||
                    fieldRes == avtIVPField::OUTSIDE_BOTH)
                    status.SetAtTemporalBoundary();

                break;
            }

            // Not out side the domain but hit a terminate criteria so
            // exit the loop.
            if (result == avtIVPSolver::TERMINATE)
            {
                break;
            }
        }
        else if (result == avtIVPSolver::OUTSIDE_TEMPORAL)
        {
            status.SetAtTemporalBoundary();
            break;
        }
        else if (result == avtIVPSolver::OUTSIDE_SPATIAL)
        {
            // Last step took us outside the domain, see what can be done.

            // First, check if the current point is inside the domain.
            // If it is outside, there is nothing further we can do.
            fieldRes = field->IsInside(ivp->GetCurrentT(), ivp->GetCurrentY());

            if (fieldRes != avtIVPField::OK)
            {
                if( DebugStream::Level5() )
                {
                    debug5 << "avtIntegralCurve::Advance(): "
                           << "current point outside domain\n";
                }
                if (fieldRes == avtIVPField::OUTSIDE_SPATIAL ||
                    fieldRes == avtIVPField::OUTSIDE_BOTH)
                    status.SetAtSpatialBoundary();
                if (fieldRes == avtIVPField::OUTSIDE_TEMPORAL ||
                    fieldRes == avtIVPField::OUTSIDE_BOTH)
                    status.SetAtTemporalBoundary();
                break;
            }

            // The point is inside, hence the step was too long. 
            // Try to reduce the step size.
            double h = ivp->GetNextStepSize();
            double t = ivp->GetCurrentT();

            if (h == 0.0)
            {
                // In the case where h = 0, the integrator's initial 
                // guess failed; use the maximum stepsize in this case.
                // If that is zero, too, we cannot make any guess as to
                // a suitable stepsize, so we use 1.0, and rely on 
                // the integrator and boundary handling to adjust this 
                // to a more sensible value.

                // FIXME
                // h = ivp->GetMaximumStepSize();

                if (h == 0.0)
                    h = 1.0;

                if( DebugStream::Level5() )
                {
                    debug5 << "avtIntegralCurve::Advance(): step outside, "
                           << "retry with initial guess " << h << '\n';
                }
            }
            else if (std::abs(h) <= std::abs(t) * minHFactor)
            {
                // If we are close enough to the boundary, stop the bisection.
                // Do a very small Euler step to move the integrator's current 
                // position just outside the domain so that it is inside the 
                // next domain.
                avtVector y = ivp->GetCurrentY();
                avtVector v;
                if ((*field)(t, y, v) != avtIVPField::OK)
                {
                    if( DebugStream::Level5() )
                    {
                        debug5 << "avtIntegralCurve::Advance(): bad step, "
                               << "Error with t: " << t << " y: " << y << endl;
                    }
                    status.SetBadStepError();
                    break;
                }
                        
                // Determine the stepsize such that the push distance
                // in either coordinate direction is at least 1e-6
                // times the bounding box extent in one directions.
                // That should get the point into the next domain even
                // if the dataset geometry is given as single
                // precision data.
                double ext[6];
                field->GetExtents(ext);

                avtVector dir = v / v.length();
                const double eps = 1e-6;

                ext[0] = std::abs(dir.x * eps * (ext[1] - ext[0]));
                ext[1] = std::abs(dir.y * eps * (ext[3] - ext[2]));
                ext[2] = std::abs(dir.z * eps * (ext[5] - ext[4]));

                double hmin = std::max(ext[0], std::max(ext[1], ext[2]));

                if (std::abs(h) < hmin)
                    h = h < 0 ? -hmin : hmin;

                if (h > 0)
                {
                    if (t + h > tfinal)
                        h = tfinal-t;
                }
                else
                {
                    if (t + h < tfinal)
                        h = tfinal-t;
                }

                t += h;
                y += h*v;

                if( DebugStream::Level5() )
                {
                    debug5 << "avtIntegralCurve::Advance(): step outside, minimal "
                           << "stepsize reached, pushing to " << y << '\n';
                }
                status.SetAtSpatialBoundary();
                ivp->SetCurrentT(t);
                ivp->SetCurrentY(y);
                break;
            }

            // Retry with halved stepsize.
            ivp->SetNextStepSize(h/2.0);
        }
        else if (result == avtIVPSolver::STEPSIZE_UNDERFLOW)
        {
            // If we get here, the integration step size was too small
            // as it approached a spatial or temporal boundary.
            if (DebugStream::Level5())
            {
                debug5 << "avtIntegralCurve::Advance(): "
                       << "step size underflow during step, finished\n";
            }
            status.SetStepSizeUnderflow();
        }
        else
        {
            // If we get here, the integration resulted in a (likely
            // numerical) error. Cannot continue the integration.
            if (DebugStream::Level5())
            {
                debug5 << "avtIntegralCurve::Advance(): "
                       << "error during step, finished\n";
            }
            status.SetNumericalError();
        }
    }
    while (status.Integrateable());
    
    status.ClearInsideBlock();

    // if (DebugStream::Level5())
    // {
    //     debug5 << "avtIntegralCurve::Advance(): done, "
    //            << "numver of steps taken " << numStepsTaken << "  "
    //            << "status: " << status << std::endl;
    // }

    return numStepsTaken;
}


// ****************************************************************************
//  Method: avtIntegralCurve::Serialize
//
//  Purpose:
//      Serializes an integral curve so it can be sent to another processor.
//
//  Programmer: Christoph Garth
//  Creation:   February 25, 2008
//
//  Modifications:
//    Kathleen Bonnell, Thu Aug  7, 08:29:42 PDT 2008
//    Changed for loop to use size_t to eliminate signed/unsigned int 
//    comparison warnings.
//
//    Hank Childs, Tue Aug 19 17:05:38 PDT 2008
//    Initialize the sz variable to make purify happy.
//
//    Dave Pugmire, Tue Feb  3 10:54:34 EST 2009
//    More debug statements.
//
//    Dave Pugmire, Mon Feb 23, 09:11:34 EST 2009
//    Code cleanup: We no longer need fwd/bwd solvers.
//
//    Hank Childs, Fri Apr 10 23:31:22 CDT 2009
//    Put if statements in front of debug's.  The generation of strings to
//    output to debug was doubling the total integration time.
//
//    Mark C. Miller, Wed Apr 22 13:48:13 PDT 2009
//    Changed interface to DebugStream to obtain current debug level.
//
//    Dave Pugmire, Tue Aug 18 08:47:40 EDT 2009
//    Don't record intersection points, just count them.
//
//    Dave Pugmire, Thu Sep 24 13:52:59 EDT 2009
//    Option to serialize steps.
//
//    Hank Childs, Thu Jun  3 10:58:32 PDT 2010
//    Remove _t0 and _p0, which are no longer used.
//
//    Hank Childs, Sat Jun  5 16:29:56 CDT 2010
//    Separate out portions related to Integral Curve and Poincare into 
//    avtStateRecorderIntegralCurve.
//
//    Hank Childs, Tue Jun  8 09:30:45 CDT 2010
//    Separate out portions related to sequence tracking into
//    avtStateRecorderIntegralCurve.
//
//   Hank Childs, Tue Oct  5 18:41:35 PDT 2010
//   Remove references to "termination", which now go in derived type.
//
//   Dave Pugmire, Fri Nov  5 15:34:49 EDT 2010
//   Add counter to handle communication of ICs
//
//   Hank Childs, Sun Dec  5 11:43:46 PST 2010
//   Send encounteredNumericalProblems.
//
//   David Camp, Wed Mar  7 10:43:07 PST 2012
//   Added a Serialize flag to the arguments. This is to support the restore
//   ICs code.
//
// ****************************************************************************

void
avtIntegralCurve::Serialize(MemStream::Mode mode, MemStream &buff, 
                            avtIVPSolver *solver, SerializeFlags serializeFlags)
{
    if (DebugStream::Level5())
    {
        debug5 << "  avtIntegralCurve::Serialize "
               << (mode==MemStream::READ?"READ":"WRITE")<<endl;
    }
    buff.io(mode, id);
    buff.io(mode, direction);
    buff.io(mode, blockList);
    buff.io(mode, status);
    buff.io(mode, counter);
    buff.io(mode, originatingRank);
    
    if (solver)
    {
        if (mode == MemStream::WRITE)
        {
            avtIVPState solverState;

            ivp->GetState(solverState);
            solverState.Serialize(mode, buff);
        }
        else
        {
            // TODO:
            //ivp->Serialize( mode, buff );

            avtIVPState solverState;
            solverState.Serialize(mode, buff);

            if (ivp)
                delete ivp;

            ivp = solver->Clone();
            ivp->PutState(solverState);
        }
    }

    
#ifdef USE_IC_STATE_TRACKING
    if (mode == MemStream::WRITE)
    {
        trk<<"Serialize"<<endl;
        trk.close();
    }
    else
    {
        trk<<flush;
        trk.close();
        char tmp[64];
        sprintf(tmp, "IC_%d.txt", (int)id);
        trk.open(tmp, ofstream::app);
        trk<<"De-serialize"<<endl;
    }
#endif

    if (DebugStream::Level5())
    {
        debug5 << "avtIntegralCurve::Serialize() size is " 
               << buff.len() << endl;
    }
}


// ****************************************************************************
// Method:  avtIntegralCurve::DomainCompare
//
//
// Programmer:  Dave Pugmire
// Creation:    August 30, 2011
//
// ****************************************************************************

bool
avtIntegralCurve::DomainCompare(const avtIntegralCurve *icA,
                                const avtIntegralCurve *icB)
{  
    if (!icA->blockList.empty() && !icB->blockList.empty()) 
        return icA->blockList.front().domain < icB->blockList.front().domain; 
    return false;
}


// ****************************************************************************
// Method:  avtIntegralCurve::IDCompare
//
//
// Programmer:  Dave Pugmire
// Creation:    August 30, 2011
//
// ****************************************************************************

bool
avtIntegralCurve::IDCompare(const avtIntegralCurve *icA,
                            const avtIntegralCurve *icB)
{  
    return icA->id < icB->id;
}


// ****************************************************************************
//  Method: avtIntegralCurve::LessThan
//
//  Purpose:
//      Used for sorting integral curves when doing parallel communication.
//      This method is used in conjunction with the STL sort of a vector.
//
//  Programmer: Hank Childs
//  Creation:   December 6, 2011
//
// ****************************************************************************

bool
avtIntegralCurve::LessThan(const avtIntegralCurve *ic) const
{
    if (id < ic->id)
        return true;
    if (ic->id < id)
        return false;
    return false;  // equal
}
