xref: /petsc/src/ts/trajectory/impls/memory/trajmemory.c (revision b122ec5aa1bd4469eb4e0673542fb7de3f411254)

#include <petsc/private/tsimpl.h>        /*I "petscts.h"  I*/
#include <petscsys.h>
#if defined(PETSC_HAVE_REVOLVE)
#include <revolve_c.h>

/* Limit Revolve to 32-bits */
#define PETSC_REVOLVE_INT_MAX  2147483647

typedef int PetscRevolveInt;

static inline PetscErrorCode PetscRevolveIntCast(PetscInt a,PetscRevolveInt *b)
{
  PetscFunctionBegin;
#if defined(PETSC_USE_64BIT_INDICES)
  *b = 0;
  PetscCheck(a <= PETSC_REVOLVE_INT_MAX,PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Parameter is too large for Revolve, which is restricted to 32 bit integers");
#endif
  *b = (PetscRevolveInt)(a);
  PetscFunctionReturn(0);
}
#endif
#if defined(PETSC_HAVE_CAMS)
#include <offline_schedule.h>
#endif

PetscLogEvent TSTrajectory_DiskWrite, TSTrajectory_DiskRead;
static PetscErrorCode TSTrajectorySet_Memory(TSTrajectory,TS,PetscInt,PetscReal,Vec);

typedef enum {NONE,TWO_LEVEL_NOREVOLVE,TWO_LEVEL_REVOLVE,TWO_LEVEL_TWO_REVOLVE,REVOLVE_OFFLINE,REVOLVE_ONLINE,REVOLVE_MULTISTAGE,CAMS_OFFLINE} SchedulerType;

typedef enum {UNSET=-1,SOLUTIONONLY=0,STAGESONLY=1,SOLUTION_STAGES=2} CheckpointType;

typedef enum {TJ_REVOLVE, TJ_CAMS, TJ_PETSC} TSTrajectoryMemoryType;
static const char *const TSTrajectoryMemoryTypes[] = {"REVOLVE","CAMS","PETSC","TSTrajectoryMemoryType","TJ_",NULL};

#define HaveSolution(m) ((m) == SOLUTIONONLY || (m) == SOLUTION_STAGES)
#define HaveStages(m)   ((m) == STAGESONLY || (m) == SOLUTION_STAGES)

typedef struct _StackElement {
  PetscInt       stepnum;
  Vec            X;
  Vec            *Y;
  PetscReal      time;
  PetscReal      timeprev; /* for no solution_only mode */
  PetscReal      timenext; /* for solution_only mode */
  CheckpointType cptype;
} *StackElement;

#if defined(PETSC_HAVE_REVOLVE)
typedef struct _RevolveCTX {
  PetscBool       reverseonestep;
  PetscRevolveInt where;
  PetscRevolveInt snaps_in;
  PetscRevolveInt stepsleft;
  PetscRevolveInt check;
  PetscRevolveInt oldcapo;
  PetscRevolveInt capo;
  PetscRevolveInt fine;
  PetscRevolveInt info;
} RevolveCTX;
#endif

#if defined(PETSC_HAVE_CAMS)
typedef struct _CAMSCTX {
  PetscInt lastcheckpointstep;
  PetscInt lastcheckpointtype;
  PetscInt num_units_avail;
  PetscInt endstep;
  PetscInt num_stages;
  PetscInt nextcheckpointstep;
  PetscInt nextcheckpointtype; /* (0) solution only (1) stages (2) solution+stages */
  PetscInt info;
} CAMSCTX;
#endif

typedef struct _Stack {
  PetscInt      stacksize;
  PetscInt      top;
  StackElement  *container;
  PetscInt      nallocated;
  PetscInt      numY;
  PetscBool     solution_only;
  PetscBool     use_dram;
} Stack;

typedef struct _DiskStack {
  PetscInt  stacksize;
  PetscInt  top;
  PetscInt  *container;
} DiskStack;

typedef struct _TJScheduler {
  SchedulerType stype;
  TSTrajectoryMemoryType tj_memory_type;
#if defined(PETSC_HAVE_REVOLVE)
  RevolveCTX    *rctx,*rctx2;
  PetscBool     use_online;
  PetscInt      store_stride;
#endif
#if defined(PETSC_HAVE_CAMS)
  CAMSCTX       *actx;
#endif
  PetscBool     recompute;
  PetscBool     skip_trajectory;
  PetscBool     save_stack;
  PetscInt      max_units_ram;  /* maximum checkpointing units in RAM */
  PetscInt      max_units_disk; /* maximum checkpointing units on disk */
  PetscInt      max_cps_ram;    /* maximum checkpoints in RAM */
  PetscInt      max_cps_disk;   /* maximum checkpoints on disk */
  PetscInt      stride;
  PetscInt      total_steps;    /* total number of steps */
  Stack         stack;
  DiskStack     diskstack;
  PetscViewer   viewer;
} TJScheduler;

static PetscErrorCode TurnForwardWithStepsize(TS ts,PetscReal nextstepsize)
{
  PetscFunctionBegin;
  /* reverse the direction */
  CHKERRQ(TSSetTimeStep(ts,nextstepsize));
  PetscFunctionReturn(0);
}

static PetscErrorCode TurnForward(TS ts)
{
  PetscReal      stepsize;

  PetscFunctionBegin;
  /* reverse the direction */
  CHKERRQ(TSGetTimeStep(ts,&stepsize));
  CHKERRQ(TSSetTimeStep(ts,-stepsize));
  PetscFunctionReturn(0);
}

static PetscErrorCode TurnBackward(TS ts)
{
  PetscReal      stepsize;

  PetscFunctionBegin;
  if (!ts->trajectory->adjoint_solve_mode) PetscFunctionReturn(0);
  /* reverse the direction */
  stepsize = ts->ptime_prev-ts->ptime;
  CHKERRQ(TSSetTimeStep(ts,stepsize));
  PetscFunctionReturn(0);
}

static PetscErrorCode ElementCreate(TS ts,CheckpointType cptype,Stack *stack,StackElement *e)
{
  Vec            X;
  Vec            *Y;

  PetscFunctionBegin;
  if (stack->top < stack->stacksize-1 && stack->container[stack->top+1]) {
    *e = stack->container[stack->top+1];
    if (HaveSolution(cptype) && !(*e)->X) {
      CHKERRQ(TSGetSolution(ts,&X));
      CHKERRQ(VecDuplicate(X,&(*e)->X));
    }
    if (cptype==1 && (*e)->X) {
      CHKERRQ(VecDestroy(&(*e)->X));
    }
    if (HaveStages(cptype) && !(*e)->Y) {
      CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
      if (stack->numY) {
        CHKERRQ(VecDuplicateVecs(Y[0],stack->numY,&(*e)->Y));
      }
    }
    if (cptype==0 && (*e)->Y) {
      CHKERRQ(VecDestroyVecs(stack->numY,&(*e)->Y));
    }
    (*e)->cptype = cptype;
    PetscFunctionReturn(0);
  }
  if (stack->use_dram) {
    CHKERRQ(PetscMallocSetDRAM());
  }
  CHKERRQ(PetscNew(e));
  if (HaveSolution(cptype)) {
    CHKERRQ(TSGetSolution(ts,&X));
    CHKERRQ(VecDuplicate(X,&(*e)->X));
  }
  if (HaveStages(cptype)) {
    CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
    if (stack->numY) {
      CHKERRQ(VecDuplicateVecs(Y[0],stack->numY,&(*e)->Y));
    }
  }
  if (stack->use_dram) {
    CHKERRQ(PetscMallocResetDRAM());
  }
  stack->nallocated++;
  (*e)->cptype = cptype;
  PetscFunctionReturn(0);
}

static PetscErrorCode ElementSet(TS ts, Stack *stack, StackElement *e, PetscInt stepnum, PetscReal time, Vec X)
{
  Vec            *Y;
  PetscInt       i;
  PetscReal      timeprev;

  PetscFunctionBegin;
  if (HaveSolution((*e)->cptype)) {
    CHKERRQ(VecCopy(X,(*e)->X));
  }
  if (HaveStages((*e)->cptype)) {
    CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
    for (i=0;i<stack->numY;i++) {
      CHKERRQ(VecCopy(Y[i],(*e)->Y[i]));
    }
  }
  (*e)->stepnum = stepnum;
  (*e)->time    = time;
  /* for consistency */
  if (stepnum == 0) {
    (*e)->timeprev = (*e)->time - ts->time_step;
  } else {
    CHKERRQ(TSGetPrevTime(ts,&timeprev));
    (*e)->timeprev = timeprev;
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode ElementDestroy(Stack *stack,StackElement e)
{
  PetscFunctionBegin;
  if (stack->use_dram) {
    CHKERRQ(PetscMallocSetDRAM());
  }
  CHKERRQ(VecDestroy(&e->X));
  if (e->Y) {
    CHKERRQ(VecDestroyVecs(stack->numY,&e->Y));
  }
  CHKERRQ(PetscFree(e));
  if (stack->use_dram) {
    CHKERRQ(PetscMallocResetDRAM());
  }
  stack->nallocated--;
  PetscFunctionReturn(0);
}

static PetscErrorCode StackResize(Stack *stack,PetscInt newsize)
{
  StackElement   *newcontainer;
  PetscInt       i;

  PetscFunctionBegin;
  CHKERRQ(PetscCalloc1(newsize*sizeof(StackElement),&newcontainer));
  for (i=0;i<stack->stacksize;i++) {
    newcontainer[i] = stack->container[i];
  }
  CHKERRQ(PetscFree(stack->container));
  stack->container = newcontainer;
  stack->stacksize = newsize;
  PetscFunctionReturn(0);
}

static PetscErrorCode StackPush(Stack *stack,StackElement e)
{
  PetscFunctionBegin;
  PetscCheck(stack->top+1 < stack->stacksize,PETSC_COMM_SELF,PETSC_ERR_MEMC,"Maximum stack size (%D) exceeded",stack->stacksize);
  stack->container[++stack->top] = e;
  PetscFunctionReturn(0);
}

static PetscErrorCode StackPop(Stack *stack,StackElement *e)
{
  PetscFunctionBegin;
  *e = NULL;
  PetscCheck(stack->top != -1,PETSC_COMM_SELF,PETSC_ERR_MEMC,"Empty stack");
  *e = stack->container[stack->top--];
  PetscFunctionReturn(0);
}

static PetscErrorCode StackTop(Stack *stack,StackElement *e)
{
  PetscFunctionBegin;
  *e = stack->container[stack->top];
  PetscFunctionReturn(0);
}

static PetscErrorCode StackInit(Stack *stack,PetscInt size,PetscInt ny)
{
  PetscFunctionBegin;
  stack->top  = -1;
  stack->numY = ny;

  if (!stack->container) {
    CHKERRQ(PetscCalloc1(size,&stack->container));
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode StackDestroy(Stack *stack)
{
  const PetscInt n = stack->nallocated;

  PetscFunctionBegin;
  if (!stack->container) PetscFunctionReturn(0);
  PetscCheck(stack->top+1 <= n,PETSC_COMM_SELF,PETSC_ERR_PLIB,"Stack size does not match element counter %D",n);
  for (PetscInt i=0; i<n; i++) CHKERRQ(ElementDestroy(stack,stack->container[i]));
  CHKERRQ(PetscFree(stack->container));
  PetscFunctionReturn(0);
}

static PetscErrorCode StackFind(Stack *stack,StackElement *e,PetscInt index)
{
  PetscFunctionBegin;
  *e = NULL;
  PetscCheck(index >= 0 && index <= stack->top,PETSC_COMM_SELF,PETSC_ERR_PLIB,"Invalid index %D",index);
  *e = stack->container[index];
  PetscFunctionReturn(0);
}

static PetscErrorCode WriteToDisk(PetscBool stifflyaccurate,PetscInt stepnum,PetscReal time,PetscReal timeprev,Vec X,Vec *Y,PetscInt numY,CheckpointType cptype,PetscViewer viewer)
{
  PetscFunctionBegin;
  CHKERRQ(PetscViewerBinaryWrite(viewer,&stepnum,1,PETSC_INT));
  if (HaveSolution(cptype)) CHKERRQ(VecView(X,viewer));
  if (HaveStages(cptype)) {
    for (PetscInt i=0; i<numY; i++) {
      /* For stiffly accurate TS methods, the last stage Y[ns-1] is the same as the solution X, thus does not need to be saved again. */
      if (stifflyaccurate && i == numY-1 && HaveSolution(cptype)) continue;
      CHKERRQ(VecView(Y[i],viewer));
    }
  }
  CHKERRQ(PetscViewerBinaryWrite(viewer,&time,1,PETSC_REAL));
  CHKERRQ(PetscViewerBinaryWrite(viewer,&timeprev,1,PETSC_REAL));
  PetscFunctionReturn(0);
}

static PetscErrorCode ReadFromDisk(PetscBool stifflyaccurate,PetscInt *stepnum,PetscReal *time,PetscReal *timeprev,Vec X,Vec *Y,PetscInt numY,CheckpointType cptype,PetscViewer viewer)
{
  PetscFunctionBegin;
  CHKERRQ(PetscViewerBinaryRead(viewer,stepnum,1,NULL,PETSC_INT));
  if (HaveSolution(cptype)) CHKERRQ(VecLoad(X,viewer));
  if (HaveStages(cptype)) {
    for (PetscInt i=0; i<numY; i++) {
      /* For stiffly accurate TS methods, the last stage Y[ns-1] is the same as the solution X, thus does not need to be loaded again. */
      if (stifflyaccurate && i == numY-1 && HaveSolution(cptype)) continue;
      CHKERRQ(VecLoad(Y[i],viewer));
    }
  }
  CHKERRQ(PetscViewerBinaryRead(viewer,time,1,NULL,PETSC_REAL));
  CHKERRQ(PetscViewerBinaryRead(viewer,timeprev,1,NULL,PETSC_REAL));
  PetscFunctionReturn(0);
}

static PetscErrorCode StackDumpAll(TSTrajectory tj,TS ts,Stack *stack,PetscInt id)
{
  Vec          *Y;
  PetscInt      ndumped,cptype_int;
  StackElement  e     = NULL;
  TJScheduler  *tjsch = (TJScheduler*)tj->data;
  char          filename[PETSC_MAX_PATH_LEN];
  MPI_Comm      comm;

  PetscFunctionBegin;
  CHKERRQ(PetscObjectGetComm((PetscObject)ts,&comm));
  if (tj->monitor) {
    CHKERRQ(PetscViewerASCIIPushTab(tj->monitor));
    CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Dump stack id %D to file\n",id));
    CHKERRQ(PetscViewerASCIIPopTab(tj->monitor));
  }
  CHKERRQ(PetscSNPrintf(filename,sizeof(filename),"%s/TS-STACK%06d.bin",tj->dirname,id));
  CHKERRQ(PetscViewerFileSetName(tjsch->viewer,filename));
  CHKERRQ(PetscViewerSetUp(tjsch->viewer));
  ndumped = stack->top+1;
  CHKERRQ(PetscViewerBinaryWrite(tjsch->viewer,&ndumped,1,PETSC_INT));
  for (PetscInt i=0;i<ndumped;i++) {
    e = stack->container[i];
    cptype_int = (PetscInt)e->cptype;
    CHKERRQ(PetscViewerBinaryWrite(tjsch->viewer,&cptype_int,1,PETSC_INT));
    CHKERRQ(PetscLogEventBegin(TSTrajectory_DiskWrite,tj,ts,0,0));
    CHKERRQ(WriteToDisk(ts->stifflyaccurate,e->stepnum,e->time,e->timeprev,e->X,e->Y,stack->numY,e->cptype,tjsch->viewer));
    CHKERRQ(PetscLogEventEnd(TSTrajectory_DiskWrite,tj,ts,0,0));
    ts->trajectory->diskwrites++;
    CHKERRQ(StackPop(stack,&e));
  }
  /* save the last step for restart, the last step is in memory when using single level schemes, but not necessarily the case for multi level schemes */
  CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
  CHKERRQ(PetscLogEventBegin(TSTrajectory_DiskWrite,tj,ts,0,0));
  CHKERRQ(WriteToDisk(ts->stifflyaccurate,ts->steps,ts->ptime,ts->ptime_prev,ts->vec_sol,Y,stack->numY,SOLUTION_STAGES,tjsch->viewer));
  CHKERRQ(PetscLogEventEnd(TSTrajectory_DiskWrite,tj,ts,0,0));
  ts->trajectory->diskwrites++;
  PetscFunctionReturn(0);
}

static PetscErrorCode StackLoadAll(TSTrajectory tj,TS ts,Stack *stack,PetscInt id)
{
  Vec          *Y;
  PetscInt      i,nloaded,cptype_int;
  StackElement  e;
  PetscViewer   viewer;
  char          filename[PETSC_MAX_PATH_LEN];

  PetscFunctionBegin;
  if (tj->monitor) {
    CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
    CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Load stack from file\n"));
    CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
  }
  CHKERRQ(PetscSNPrintf(filename,sizeof filename,"%s/TS-STACK%06d.bin",tj->dirname,id));
  CHKERRQ(PetscViewerBinaryOpen(PetscObjectComm((PetscObject)tj),filename,FILE_MODE_READ,&viewer));
  CHKERRQ(PetscViewerBinarySetSkipInfo(viewer,PETSC_TRUE));
  CHKERRQ(PetscViewerPushFormat(viewer,PETSC_VIEWER_NATIVE));
  CHKERRQ(PetscViewerBinaryRead(viewer,&nloaded,1,NULL,PETSC_INT));
  for (i=0;i<nloaded;i++) {
    CHKERRQ(PetscViewerBinaryRead(viewer,&cptype_int,1,NULL,PETSC_INT));
    CHKERRQ(ElementCreate(ts,(CheckpointType)cptype_int,stack,&e));
    CHKERRQ(StackPush(stack,e));
    CHKERRQ(PetscLogEventBegin(TSTrajectory_DiskRead,tj,ts,0,0));
    CHKERRQ(ReadFromDisk(ts->stifflyaccurate,&e->stepnum,&e->time,&e->timeprev,e->X,e->Y,stack->numY,e->cptype,viewer));
    CHKERRQ(PetscLogEventEnd(TSTrajectory_DiskRead,tj,ts,0,0));
    ts->trajectory->diskreads++;
  }
  /* load the last step into TS */
  CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
  CHKERRQ(PetscLogEventBegin(TSTrajectory_DiskRead,tj,ts,0,0));
  CHKERRQ(ReadFromDisk(ts->stifflyaccurate,&ts->steps,&ts->ptime,&ts->ptime_prev,ts->vec_sol,Y,stack->numY,SOLUTION_STAGES,viewer));
  CHKERRQ(PetscLogEventEnd(TSTrajectory_DiskRead,tj,ts,0,0));
  ts->trajectory->diskreads++;
  CHKERRQ(TurnBackward(ts));
  CHKERRQ(PetscViewerDestroy(&viewer));
  PetscFunctionReturn(0);
}

#if defined(PETSC_HAVE_REVOLVE)
static PetscErrorCode StackLoadLast(TSTrajectory tj,TS ts,Stack *stack,PetscInt id)
{
  Vec         *Y;
  PetscInt     size;
  PetscViewer  viewer;
  char         filename[PETSC_MAX_PATH_LEN];
#if defined(PETSC_HAVE_MPIIO)
  PetscBool    usempiio;
#endif
  int          fd;
  off_t        off,offset;

  PetscFunctionBegin;
  if (tj->monitor) {
    CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
    CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Load last stack element from file\n"));
    CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
  }
  CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
  CHKERRQ(VecGetSize(Y[0],&size));
  /* VecView writes to file two extra int's for class id and number of rows */
  off  = -((stack->solution_only?0:stack->numY)+1)*(size*PETSC_BINARY_SCALAR_SIZE+2*PETSC_BINARY_INT_SIZE)-PETSC_BINARY_INT_SIZE-2*PETSC_BINARY_SCALAR_SIZE;

  CHKERRQ(PetscSNPrintf(filename,sizeof filename,"%s/TS-STACK%06d.bin",tj->dirname,id));
  CHKERRQ(PetscViewerBinaryOpen(PetscObjectComm((PetscObject)tj),filename,FILE_MODE_READ,&viewer));
  CHKERRQ(PetscViewerBinarySetSkipInfo(viewer,PETSC_TRUE));
  CHKERRQ(PetscViewerPushFormat(viewer,PETSC_VIEWER_NATIVE));
#if defined(PETSC_HAVE_MPIIO)
  CHKERRQ(PetscViewerBinaryGetUseMPIIO(viewer,&usempiio));
  if (usempiio) {
    CHKERRQ(PetscViewerBinaryGetMPIIODescriptor(viewer,(MPI_File*)&fd));
    CHKERRQ(PetscBinarySynchronizedSeek(PetscObjectComm((PetscObject)tj),fd,off,PETSC_BINARY_SEEK_END,&offset));
  } else {
#endif
    CHKERRQ(PetscViewerBinaryGetDescriptor(viewer,&fd));
    CHKERRQ(PetscBinarySeek(fd,off,PETSC_BINARY_SEEK_END,&offset));
#if defined(PETSC_HAVE_MPIIO)
  }
#endif
  /* load the last step into TS */
  CHKERRQ(PetscLogEventBegin(TSTrajectory_DiskRead,tj,ts,0,0));
  CHKERRQ(ReadFromDisk(ts->stifflyaccurate,&ts->steps,&ts->ptime,&ts->ptime_prev,ts->vec_sol,Y,stack->numY,SOLUTION_STAGES,viewer));
  CHKERRQ(PetscLogEventEnd(TSTrajectory_DiskRead,tj,ts,0,0));
  ts->trajectory->diskreads++;
  CHKERRQ(PetscViewerDestroy(&viewer));
  CHKERRQ(TurnBackward(ts));
  PetscFunctionReturn(0);
}
#endif

static PetscErrorCode DumpSingle(TSTrajectory tj,TS ts,Stack *stack,PetscInt id)
{
  Vec            *Y;
  PetscInt       stepnum;
  TJScheduler    *tjsch = (TJScheduler*)tj->data;
  char           filename[PETSC_MAX_PATH_LEN];
  MPI_Comm       comm;

  PetscFunctionBegin;
  CHKERRQ(PetscObjectGetComm((PetscObject)ts,&comm));
  if (tj->monitor) {
    CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
    CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Dump a single point from file\n"));
    CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
  }
  CHKERRQ(TSGetStepNumber(ts,&stepnum));
  CHKERRQ(PetscSNPrintf(filename,sizeof(filename),"%s/TS-CPS%06d.bin",tj->dirname,id));
  CHKERRQ(PetscViewerFileSetName(tjsch->viewer,filename));
  CHKERRQ(PetscViewerSetUp(tjsch->viewer));

  CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
  CHKERRQ(PetscLogEventBegin(TSTrajectory_DiskWrite,tj,ts,0,0));
  CHKERRQ(WriteToDisk(ts->stifflyaccurate,stepnum,ts->ptime,ts->ptime_prev,ts->vec_sol,Y,stack->numY,SOLUTION_STAGES,tjsch->viewer));
  CHKERRQ(PetscLogEventEnd(TSTrajectory_DiskWrite,tj,ts,0,0));
  ts->trajectory->diskwrites++;
  PetscFunctionReturn(0);
}

static PetscErrorCode LoadSingle(TSTrajectory tj,TS ts,Stack *stack,PetscInt id)
{
  Vec            *Y;
  PetscViewer    viewer;
  char           filename[PETSC_MAX_PATH_LEN];

  PetscFunctionBegin;
  if (tj->monitor) {
    CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
    CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Load a single point from file\n"));
    CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
  }
  CHKERRQ(PetscSNPrintf(filename,sizeof filename,"%s/TS-CPS%06d.bin",tj->dirname,id));
  CHKERRQ(PetscViewerBinaryOpen(PetscObjectComm((PetscObject)tj),filename,FILE_MODE_READ,&viewer));
  CHKERRQ(PetscViewerBinarySetSkipInfo(viewer,PETSC_TRUE));
  CHKERRQ(PetscViewerPushFormat(viewer,PETSC_VIEWER_NATIVE));
  CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
  CHKERRQ(PetscLogEventBegin(TSTrajectory_DiskRead,tj,ts,0,0));
  CHKERRQ(ReadFromDisk(ts->stifflyaccurate,&ts->steps,&ts->ptime,&ts->ptime_prev,ts->vec_sol,Y,stack->numY,SOLUTION_STAGES,viewer));
  CHKERRQ(PetscLogEventEnd(TSTrajectory_DiskRead,tj,ts,0,0));
  ts->trajectory->diskreads++;
  CHKERRQ(PetscViewerDestroy(&viewer));
  PetscFunctionReturn(0);
}

static PetscErrorCode UpdateTS(TS ts,Stack *stack,StackElement e,PetscInt stepnum,PetscBool adjoint_mode)
{
  Vec            *Y;
  PetscInt       i;

  PetscFunctionBegin;
  /* In adjoint mode we do not need to copy solution if the stepnum is the same */
  if (!adjoint_mode || (HaveSolution(e->cptype) && e->stepnum!=stepnum)) {
    CHKERRQ(VecCopy(e->X,ts->vec_sol));
  }
  if (HaveStages(e->cptype)) {
    CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
    if (e->stepnum && e->stepnum==stepnum) {
      for (i=0;i<stack->numY;i++) {
        CHKERRQ(VecCopy(e->Y[i],Y[i]));
      }
    } else if (ts->stifflyaccurate) {
      CHKERRQ(VecCopy(e->Y[stack->numY-1],ts->vec_sol));
    }
  }
  if (adjoint_mode) {
    CHKERRQ(TSSetTimeStep(ts,e->timeprev-e->time)); /* stepsize will be negative */
  } else {
    CHKERRQ(TSSetTimeStep(ts,e->time-e->timeprev)); /* stepsize will be positive */
  }
  ts->ptime      = e->time;
  ts->ptime_prev = e->timeprev;
  PetscFunctionReturn(0);
}

static PetscErrorCode ReCompute(TS ts,TJScheduler *tjsch,PetscInt stepnumbegin,PetscInt stepnumend)
{
  Stack          *stack = &tjsch->stack;
  PetscInt       i;

  PetscFunctionBegin;
  tjsch->recompute = PETSC_TRUE; /* hints TSTrajectorySet() that it is in recompute mode */
  CHKERRQ(TSSetStepNumber(ts,stepnumbegin));/* global step number */
  for (i=stepnumbegin;i<stepnumend;i++) { /* assume fixed step size */
    if (stack->solution_only && !tjsch->skip_trajectory) { /* revolve online need this */
      /* don't use the public interface as it will update the TSHistory: this need a better fix */
      CHKERRQ(TSTrajectorySet_Memory(ts->trajectory,ts,ts->steps,ts->ptime,ts->vec_sol));
    }
    CHKERRQ(TSMonitor(ts,ts->steps,ts->ptime,ts->vec_sol));
    CHKERRQ(TSStep(ts));
    if (!stack->solution_only && !tjsch->skip_trajectory) {
      /* don't use the public interface as it will update the TSHistory: this need a better fix */
      CHKERRQ(TSTrajectorySet_Memory(ts->trajectory,ts,ts->steps,ts->ptime,ts->vec_sol));
    }
    CHKERRQ(TSEventHandler(ts));
    if (!ts->steprollback) {
      CHKERRQ(TSPostStep(ts));
    }
  }
  CHKERRQ(TurnBackward(ts));
  ts->trajectory->recomps += stepnumend-stepnumbegin; /* recomputation counter */
  CHKERRQ(TSSetStepNumber(ts,stepnumend));
  tjsch->recompute = PETSC_FALSE; /* reset the flag for recompute mode */
  PetscFunctionReturn(0);
}

static PetscErrorCode TopLevelStore(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscInt localstepnum,PetscInt laststridesize,PetscBool *done)
{
  Stack          *stack = &tjsch->stack;
  DiskStack      *diskstack = &tjsch->diskstack;
  PetscInt       stridenum;

  PetscFunctionBegin;
  *done = PETSC_FALSE;
  stridenum    = stepnum/tjsch->stride;
  /* make sure saved checkpoint id starts from 1
     skip last stride when using stridenum+1
     skip first stride when using stridenum */
  if (stack->solution_only) {
    if (tjsch->save_stack) {
      if (localstepnum == tjsch->stride-1 && stepnum < tjsch->total_steps-laststridesize) { /* current step will be saved without going through stack */
        CHKERRQ(StackDumpAll(tj,ts,stack,stridenum+1));
        if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) diskstack->container[++diskstack->top] = stridenum+1;
        *done = PETSC_TRUE;
      }
    } else {
      if (localstepnum == 0 && stepnum < tjsch->total_steps-laststridesize) {
        CHKERRQ(DumpSingle(tj,ts,stack,stridenum+1));
        if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) diskstack->container[++diskstack->top] = stridenum+1;
        *done = PETSC_TRUE;
      }
    }
  } else {
    if (tjsch->save_stack) {
      if (localstepnum == 0 && stepnum < tjsch->total_steps && stepnum != 0) { /* skip the first stride */
        CHKERRQ(StackDumpAll(tj,ts,stack,stridenum));
        if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) diskstack->container[++diskstack->top] = stridenum;
        *done = PETSC_TRUE;
      }
    } else {
      if (localstepnum == 1 && stepnum < tjsch->total_steps-laststridesize) {
        CHKERRQ(DumpSingle(tj,ts,stack,stridenum+1));
        if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) diskstack->container[++diskstack->top] = stridenum+1;
        *done = PETSC_TRUE;
      }
    }
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySet_N(TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack          *stack = &tjsch->stack;
  StackElement   e;
  CheckpointType cptype;

  PetscFunctionBegin;
  /* skip the last step */
  if (ts->reason) { /* only affect the forward run */
    /* update total_steps in the end of forward run */
    if (stepnum != tjsch->total_steps) tjsch->total_steps = stepnum;
    if (stack->solution_only) {
      /* get rid of the solution at second last step */
      CHKERRQ(StackPop(stack,&e));
    }
    PetscFunctionReturn(0);
  }
  /*  do not save trajectory at the recompute stage for solution_only mode */
  if (stack->solution_only && tjsch->recompute) PetscFunctionReturn(0);
  /* skip the first step for no_solution_only mode */
  if (!stack->solution_only && stepnum == 0) PetscFunctionReturn(0);

  /* resize the stack */
  if (stack->top+1 == stack->stacksize) {
    CHKERRQ(StackResize(stack,2*stack->stacksize));
  }
  /* update timenext for the previous step; necessary for step adaptivity */
  if (stack->top > -1) {
    CHKERRQ(StackTop(stack,&e));
    e->timenext = ts->ptime;
  }
  if (stepnum < stack->top) {
    SETERRQ(PetscObjectComm((PetscObject)ts),PETSC_ERR_MEMC,"Illegal modification of a non-top stack element");
  }
  cptype = stack->solution_only ? SOLUTIONONLY : STAGESONLY;
  CHKERRQ(ElementCreate(ts,cptype,stack,&e));
  CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
  CHKERRQ(StackPush(stack,e));
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySet_N_2(TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack          *stack = &tjsch->stack;
  StackElement   e;
  CheckpointType cptype;

  PetscFunctionBegin;
  if (stack->top+1 == stack->stacksize) {
    CHKERRQ(StackResize(stack,2*stack->stacksize));
  }
  /* update timenext for the previous step; necessary for step adaptivity */
  if (stack->top > -1) {
    CHKERRQ(StackTop(stack,&e));
    e->timenext = ts->ptime;
  }
  PetscCheck(stepnum >= stack->top,PetscObjectComm((PetscObject)ts),PETSC_ERR_MEMC,"Illegal modification of a non-top stack element");
  cptype = stack->solution_only ? SOLUTIONONLY : SOLUTION_STAGES; /* Always include solution in a checkpoint in non-adjoint mode */
  CHKERRQ(ElementCreate(ts,cptype,stack,&e));
  CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
  CHKERRQ(StackPush(stack,e));
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_N(TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack          *stack = &tjsch->stack;
  StackElement   e;
  PetscInt       ns;

  PetscFunctionBegin;
  /* If TSTrajectoryGet() is called after TSAdjointSolve() converges (e.g. outside the while loop in TSAdjointSolve()), skip getting the checkpoint. */
  if (ts->reason) PetscFunctionReturn(0);
  if (stepnum == tjsch->total_steps) {
    CHKERRQ(TurnBackward(ts));
    PetscFunctionReturn(0);
  }
  /* restore a checkpoint */
  CHKERRQ(StackTop(stack,&e));
  CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
  CHKERRQ(TSGetStages(ts,&ns,PETSC_IGNORE));
  if (stack->solution_only && ns) { /* recompute one step */
    CHKERRQ(TurnForwardWithStepsize(ts,e->timenext-e->time));
    CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stepnum));
  }
  CHKERRQ(StackPop(stack,&e));
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_N_2(TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack        *stack = &tjsch->stack;
  StackElement  e     = NULL;

  PetscFunctionBegin;
  CHKERRQ(StackFind(stack,&e,stepnum));
  PetscCheck(stepnum == e->stepnum,PetscObjectComm((PetscObject)ts),PETSC_ERR_PLIB,"Inconsistent steps! %D != %D",stepnum,e->stepnum);
  CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_FALSE));
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySet_TLNR(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack          *stack = &tjsch->stack;
  PetscInt       localstepnum,laststridesize;
  StackElement   e;
  PetscBool      done;
  CheckpointType cptype;

  PetscFunctionBegin;
  if (!stack->solution_only && stepnum == 0) PetscFunctionReturn(0);
  if (stack->solution_only && stepnum == tjsch->total_steps) PetscFunctionReturn(0);
  if (tjsch->save_stack && tjsch->recompute) PetscFunctionReturn(0);

  localstepnum = stepnum%tjsch->stride;
  /* (stridesize-1) checkpoints are saved in each stride; an extra point is added by StackDumpAll() */
  laststridesize = tjsch->total_steps%tjsch->stride;
  if (!laststridesize) laststridesize = tjsch->stride;

  if (!tjsch->recompute) {
    CHKERRQ(TopLevelStore(tj,ts,tjsch,stepnum,localstepnum,laststridesize,&done));
    if (!tjsch->save_stack && stepnum < tjsch->total_steps-laststridesize) PetscFunctionReturn(0);
  }
  if (!stack->solution_only && localstepnum == 0) PetscFunctionReturn(0); /* skip last point in each stride at recompute stage or last stride */
  if (stack->solution_only && localstepnum == tjsch->stride-1) PetscFunctionReturn(0); /* skip last step in each stride at recompute stage or last stride */

  cptype = stack->solution_only ? SOLUTIONONLY : STAGESONLY;
  CHKERRQ(ElementCreate(ts,cptype,stack,&e));
  CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
  CHKERRQ(StackPush(stack,e));
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_TLNR(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack          *stack = &tjsch->stack;
  PetscInt       id,localstepnum,laststridesize;
  StackElement   e;

  PetscFunctionBegin;
  if (stepnum == tjsch->total_steps) {
    CHKERRQ(TurnBackward(ts));
    PetscFunctionReturn(0);
  }

  localstepnum = stepnum%tjsch->stride;
  laststridesize = tjsch->total_steps%tjsch->stride;
  if (!laststridesize) laststridesize = tjsch->stride;
  if (stack->solution_only) {
    /* fill stack with info */
    if (localstepnum == 0 && tjsch->total_steps-stepnum >= laststridesize) {
      id = stepnum/tjsch->stride;
      if (tjsch->save_stack) {
        CHKERRQ(StackLoadAll(tj,ts,stack,id));
        tjsch->skip_trajectory = PETSC_TRUE;
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,id*tjsch->stride-1,id*tjsch->stride));
        tjsch->skip_trajectory = PETSC_FALSE;
      } else {
        CHKERRQ(LoadSingle(tj,ts,stack,id));
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,(id-1)*tjsch->stride,id*tjsch->stride));
      }
      PetscFunctionReturn(0);
    }
    /* restore a checkpoint */
    CHKERRQ(StackPop(stack,&e));
    CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
    tjsch->skip_trajectory = PETSC_TRUE;
    CHKERRQ(TurnForward(ts));
    CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stepnum));
    tjsch->skip_trajectory = PETSC_FALSE;
  } else {
    CheckpointType cptype = STAGESONLY;
    /* fill stack with info */
    if (localstepnum == 0 && tjsch->total_steps-stepnum >= laststridesize) {
      id = stepnum/tjsch->stride;
      if (tjsch->save_stack) {
        CHKERRQ(StackLoadAll(tj,ts,stack,id));
      } else {
        CHKERRQ(LoadSingle(tj,ts,stack,id));
        CHKERRQ(ElementCreate(ts,cptype,stack,&e));
        CHKERRQ(ElementSet(ts,stack,&e,(id-1)*tjsch->stride+1,ts->ptime,ts->vec_sol));
        CHKERRQ(StackPush(stack,e));
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,e->stepnum,id*tjsch->stride));
      }
      PetscFunctionReturn(0);
    }
    /* restore a checkpoint */
    CHKERRQ(StackPop(stack,&e));
    CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
  }
  PetscFunctionReturn(0);
}

#if defined(PETSC_HAVE_REVOLVE)
static PetscErrorCode printwhattodo(PetscViewer viewer,PetscRevolveInt whattodo,RevolveCTX *rctx,PetscRevolveInt shift)
{
  PetscFunctionBegin;
  if (!viewer) PetscFunctionReturn(0);

  switch(whattodo) {
    case 1:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"Advance from %D to %D\n",rctx->oldcapo+shift,rctx->capo+shift));
      break;
    case 2:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"Store in checkpoint number %D (located in RAM)\n",rctx->check));
      break;
    case 3:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"First turn: Initialize adjoints and reverse first step\n"));
      break;
    case 4:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"Forward and reverse one step\n"));
      break;
    case 5:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"Restore in checkpoint number %D (located in RAM)\n",rctx->check));
      break;
    case 7:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"Store in checkpoint number %D (located on disk)\n",rctx->check));
      break;
    case 8:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"Restore in checkpoint number %D (located on disk)\n",rctx->check));
      break;
    case -1:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"Error!"));
      break;
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode printwhattodo2(PetscViewer viewer,PetscRevolveInt whattodo,RevolveCTX *rctx,PetscRevolveInt shift)
{
  PetscFunctionBegin;
  if (!viewer) PetscFunctionReturn(0);

  switch(whattodo) {
    case 1:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"[Top Level] Advance from stride %D to stride %D\n",rctx->oldcapo+shift,rctx->capo+shift));
      break;
    case 2:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"[Top Level] Store in checkpoint number %D\n",rctx->check));
      break;
    case 3:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"[Top Level] First turn: Initialize adjoints and reverse first stride\n"));
      break;
    case 4:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"[Top Level] Forward and reverse one stride\n"));
      break;
    case 5:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"[Top Level] Restore in checkpoint number %D\n",rctx->check));
      break;
    case 7:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"[Top Level] Store in top-level checkpoint number %D\n",rctx->check));
      break;
    case 8:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"[Top Level] Restore in top-level checkpoint number %D\n",rctx->check));
      break;
    case -1:
      CHKERRQ(PetscViewerASCIIPrintf(viewer,"[Top Level] Error!"));
      break;
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode InitRevolve(PetscInt fine,PetscInt snaps,RevolveCTX *rctx)
{
  PetscRevolveInt rsnaps,rfine;

  PetscFunctionBegin;
  CHKERRQ(PetscRevolveIntCast(snaps,&rsnaps));
  CHKERRQ(PetscRevolveIntCast(fine,&rfine));
  revolve_reset();
  revolve_create_offline(rfine,rsnaps);
  rctx->snaps_in       = rsnaps;
  rctx->fine           = rfine;
  rctx->check          = 0;
  rctx->capo           = 0;
  rctx->reverseonestep = PETSC_FALSE;
  /* check stepsleft? */
  PetscFunctionReturn(0);
}

static PetscErrorCode FastForwardRevolve(RevolveCTX *rctx)
{
  PetscRevolveInt whattodo;

  PetscFunctionBegin;
  whattodo = 0;
  while (whattodo!=3) { /* we have to fast forward revolve to the beginning of the backward sweep due to unfriendly revolve interface */
    whattodo = revolve_action(&rctx->check,&rctx->capo,&rctx->fine,rctx->snaps_in,&rctx->info,&rctx->where);
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode ApplyRevolve(PetscViewer viewer,SchedulerType stype,RevolveCTX *rctx,PetscRevolveInt total_steps,PetscRevolveInt stepnum,PetscRevolveInt localstepnum,PetscBool toplevel,PetscInt *store)
{
  PetscRevolveInt shift,whattodo;

  PetscFunctionBegin;
  *store = 0;
  if (rctx->stepsleft > 0) { /* advance the solution without checkpointing anything as Revolve requires */
    rctx->stepsleft--;
    PetscFunctionReturn(0);
  }
  /* let Revolve determine what to do next */
  shift         = stepnum-localstepnum;
  rctx->oldcapo = rctx->capo;
  rctx->capo    = localstepnum;

  if (!toplevel) whattodo = revolve_action(&rctx->check,&rctx->capo,&rctx->fine,rctx->snaps_in,&rctx->info,&rctx->where);
  else whattodo = revolve2_action(&rctx->check,&rctx->capo,&rctx->fine,rctx->snaps_in,&rctx->info,&rctx->where);
  if (stype == REVOLVE_ONLINE && whattodo == 8) whattodo = 5;
  if (stype == REVOLVE_ONLINE && whattodo == 7) whattodo = 2;
  if (!toplevel) CHKERRQ(printwhattodo(viewer,whattodo,rctx,shift));
  else CHKERRQ(printwhattodo2(viewer,whattodo,rctx,shift));
  PetscCheck(whattodo != -1,PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in the Revolve library");
  if (whattodo == 1) { /* advance some time steps */
    if (stype == REVOLVE_ONLINE && rctx->capo >= total_steps-1) {
      revolve_turn(total_steps,&rctx->capo,&rctx->fine);
      if (!toplevel) CHKERRQ(printwhattodo(viewer,whattodo,rctx,shift));
      else CHKERRQ(printwhattodo2(viewer,whattodo,rctx,shift));
    }
    rctx->stepsleft = rctx->capo-rctx->oldcapo-1;
  }
  if (whattodo == 3 || whattodo == 4) { /* ready for a reverse step */
    rctx->reverseonestep = PETSC_TRUE;
  }
  if (whattodo == 5) { /* restore a checkpoint and ask Revolve what to do next */
    rctx->oldcapo = rctx->capo;
    if (!toplevel) whattodo = revolve_action(&rctx->check,&rctx->capo,&rctx->fine,rctx->snaps_in,&rctx->info,&rctx->where); /* must return 1 or 3 or 4*/
    else whattodo = revolve2_action(&rctx->check,&rctx->capo,&rctx->fine,rctx->snaps_in,&rctx->info,&rctx->where);
    if (!toplevel) CHKERRQ(printwhattodo(viewer,whattodo,rctx,shift));
    else CHKERRQ(printwhattodo2(viewer,whattodo,rctx,shift));
    if (whattodo == 3 || whattodo == 4) rctx->reverseonestep = PETSC_TRUE;
    if (whattodo == 1) rctx->stepsleft = rctx->capo-rctx->oldcapo;
  }
  if (whattodo == 7) { /* save the checkpoint to disk */
    *store = 2;
    rctx->oldcapo = rctx->capo;
    whattodo = revolve_action(&rctx->check,&rctx->capo,&rctx->fine,rctx->snaps_in,&rctx->info,&rctx->where); /* must return 1 */
    CHKERRQ(printwhattodo(viewer,whattodo,rctx,shift));
    rctx->stepsleft = rctx->capo-rctx->oldcapo-1;
  }
  if (whattodo == 2) { /* store a checkpoint to RAM and ask Revolve how many time steps to advance next */
    *store = 1;
    rctx->oldcapo = rctx->capo;
    if (!toplevel) whattodo = revolve_action(&rctx->check,&rctx->capo,&rctx->fine,rctx->snaps_in,&rctx->info,&rctx->where); /* must return 1 */
    else whattodo = revolve2_action(&rctx->check,&rctx->capo,&rctx->fine,rctx->snaps_in,&rctx->info,&rctx->where);
    if (!toplevel) CHKERRQ(printwhattodo(viewer,whattodo,rctx,shift));
    else CHKERRQ(printwhattodo2(viewer,whattodo,rctx,shift));
    if (stype == REVOLVE_ONLINE && rctx->capo >= total_steps-1) {
      revolve_turn(total_steps,&rctx->capo,&rctx->fine);
      CHKERRQ(printwhattodo(viewer,whattodo,rctx,shift));
    }
    rctx->stepsleft = rctx->capo-rctx->oldcapo-1;
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySet_ROF(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack           *stack = &tjsch->stack;
  PetscInt        store;
  StackElement    e;
  PetscRevolveInt rtotal_steps,rstepnum;
  CheckpointType  cptype;

  PetscFunctionBegin;
  if (!stack->solution_only && stepnum == 0) PetscFunctionReturn(0);
  if (stack->solution_only && stepnum == tjsch->total_steps) PetscFunctionReturn(0);
  CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rstepnum,rstepnum,PETSC_FALSE,&store));
  if (store == 1) {
    PetscCheck(stepnum >= stack->top,PetscObjectComm((PetscObject)ts),PETSC_ERR_MEMC,"Illegal modification of a non-top stack element");
    cptype = stack->solution_only ? SOLUTIONONLY : SOLUTION_STAGES;
    CHKERRQ(ElementCreate(ts,cptype,stack,&e));
    CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
    CHKERRQ(StackPush(stack,e));
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_ROF(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack           *stack = &tjsch->stack;
  PetscInt        store;
  PetscRevolveInt whattodo,shift,rtotal_steps,rstepnum;
  StackElement    e;

  PetscFunctionBegin;
  if (stepnum == 0 || stepnum == tjsch->total_steps) {
    CHKERRQ(TurnBackward(ts));
    tjsch->rctx->reverseonestep = PETSC_FALSE;
    PetscFunctionReturn(0);
  }
  /* restore a checkpoint */
  CHKERRQ(StackTop(stack,&e));
  CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
  CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  if (stack->solution_only) { /* start with restoring a checkpoint */
    tjsch->rctx->capo = rstepnum;
    tjsch->rctx->oldcapo = tjsch->rctx->capo;
    shift = 0;
    whattodo = revolve_action(&tjsch->rctx->check,&tjsch->rctx->capo,&tjsch->rctx->fine,tjsch->rctx->snaps_in,&tjsch->rctx->info,&tjsch->rctx->where);
    CHKERRQ(printwhattodo(tj->monitor,whattodo,tjsch->rctx,shift));
  } else { /* 2 revolve actions: restore a checkpoint and then advance */
    CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rstepnum,rstepnum,PETSC_FALSE,&store));
    if (tj->monitor) {
      CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
      CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Skip the step from %D to %D (stage values already checkpointed)\n",tjsch->rctx->oldcapo,tjsch->rctx->oldcapo+1));
      CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
    }
    if (!tjsch->rctx->reverseonestep && tjsch->rctx->stepsleft > 0) tjsch->rctx->stepsleft--;
  }
  if (stack->solution_only || (!stack->solution_only && e->stepnum < stepnum)) {
    CHKERRQ(TurnForward(ts));
    CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stepnum));
  }
  if ((stack->solution_only && e->stepnum+1 == stepnum) || (!stack->solution_only && e->stepnum == stepnum)) {
    CHKERRQ(StackPop(stack,&e));
  }
  tjsch->rctx->reverseonestep = PETSC_FALSE;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySet_RON(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack           *stack = &tjsch->stack;
  Vec             *Y;
  PetscInt        i,store;
  PetscReal       timeprev;
  StackElement    e;
  RevolveCTX      *rctx = tjsch->rctx;
  PetscRevolveInt rtotal_steps,rstepnum;
  CheckpointType  cptype;

  PetscFunctionBegin;
  if (!stack->solution_only && stepnum == 0) PetscFunctionReturn(0);
  if (stack->solution_only && stepnum == tjsch->total_steps) PetscFunctionReturn(0);
  CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,rctx,rtotal_steps,rstepnum,rstepnum,PETSC_FALSE,&store));
  if (store == 1) {
    if (rctx->check != stack->top+1) { /* overwrite some non-top checkpoint in the stack */
      CHKERRQ(StackFind(stack,&e,rctx->check));
      if (HaveSolution(e->cptype)) {
        CHKERRQ(VecCopy(X,e->X));
      }
      if (HaveStages(e->cptype)) {
        CHKERRQ(TSGetStages(ts,&stack->numY,&Y));
        for (i=0;i<stack->numY;i++) {
          CHKERRQ(VecCopy(Y[i],e->Y[i]));
        }
      }
      e->stepnum  = stepnum;
      e->time     = time;
      CHKERRQ(TSGetPrevTime(ts,&timeprev));
      e->timeprev = timeprev;
    } else {
      PetscCheck(stepnum >= stack->top,PetscObjectComm((PetscObject)ts),PETSC_ERR_MEMC,"Illegal modification of a non-top stack element");
      cptype = stack->solution_only ? SOLUTIONONLY : SOLUTION_STAGES;
      CHKERRQ(ElementCreate(ts,cptype,stack,&e));
      CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
      CHKERRQ(StackPush(stack,e));
    }
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_RON(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack           *stack = &tjsch->stack;
  PetscRevolveInt whattodo,shift,rstepnum;
  StackElement    e;

  PetscFunctionBegin;
  if (stepnum == 0 || stepnum == tjsch->total_steps) {
    CHKERRQ(TurnBackward(ts));
    tjsch->rctx->reverseonestep = PETSC_FALSE;
    PetscFunctionReturn(0);
  }
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  tjsch->rctx->capo = rstepnum;
  tjsch->rctx->oldcapo = tjsch->rctx->capo;
  shift = 0;
  whattodo = revolve_action(&tjsch->rctx->check,&tjsch->rctx->capo,&tjsch->rctx->fine,tjsch->rctx->snaps_in,&tjsch->rctx->info,&tjsch->rctx->where); /* whattodo=restore */
  if (whattodo == 8) whattodo = 5;
  CHKERRQ(printwhattodo(tj->monitor,whattodo,tjsch->rctx,shift));
  /* restore a checkpoint */
  CHKERRQ(StackFind(stack,&e,tjsch->rctx->check));
  CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
  if (!stack->solution_only) { /* whattodo must be 5 */
    /* ask Revolve what to do next */
    tjsch->rctx->oldcapo = tjsch->rctx->capo;
    whattodo = revolve_action(&tjsch->rctx->check,&tjsch->rctx->capo,&tjsch->rctx->fine,tjsch->rctx->snaps_in,&tjsch->rctx->info,&tjsch->rctx->where); /* must return 1 or 3 or 4*/
    CHKERRQ(printwhattodo(tj->monitor,whattodo,tjsch->rctx,shift));
    if (whattodo == 3 || whattodo == 4) tjsch->rctx->reverseonestep = PETSC_TRUE;
    if (whattodo == 1) tjsch->rctx->stepsleft = tjsch->rctx->capo-tjsch->rctx->oldcapo;
    if (tj->monitor) {
      CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
      CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Skip the step from %D to %D (stage values already checkpointed)\n",tjsch->rctx->oldcapo,tjsch->rctx->oldcapo+1));
      CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
    }
    if (!tjsch->rctx->reverseonestep && tjsch->rctx->stepsleft > 0) tjsch->rctx->stepsleft--;
  }
  if (stack->solution_only || (!stack->solution_only && e->stepnum < stepnum)) {
    CHKERRQ(TurnForward(ts));
    CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stepnum));
  }
  tjsch->rctx->reverseonestep = PETSC_FALSE;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySet_TLR(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack           *stack = &tjsch->stack;
  PetscInt        store,localstepnum,laststridesize;
  StackElement    e;
  PetscBool       done = PETSC_FALSE;
  PetscRevolveInt rtotal_steps,rstepnum,rlocalstepnum;
  CheckpointType  cptype;

  PetscFunctionBegin;
  if (!stack->solution_only && stepnum == 0) PetscFunctionReturn(0);
  if (stack->solution_only && stepnum == tjsch->total_steps) PetscFunctionReturn(0);

  localstepnum = stepnum%tjsch->stride;
  laststridesize = tjsch->total_steps%tjsch->stride;
  if (!laststridesize) laststridesize = tjsch->stride;

  if (!tjsch->recompute) {
    CHKERRQ(TopLevelStore(tj,ts,tjsch,stepnum,localstepnum,laststridesize,&done));
    /* revolve is needed for the last stride; different starting points for last stride between solutin_only and !solutin_only */
    if (!stack->solution_only && !tjsch->save_stack && stepnum <= tjsch->total_steps-laststridesize) PetscFunctionReturn(0);
    if (stack->solution_only && !tjsch->save_stack && stepnum < tjsch->total_steps-laststridesize) PetscFunctionReturn(0);
  }
  if (tjsch->save_stack && done) {
    CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
    PetscFunctionReturn(0);
  }
  if (laststridesize < tjsch->stride) {
    if (stack->solution_only && stepnum == tjsch->total_steps-laststridesize && !tjsch->recompute) { /* step tjsch->total_steps-laststridesize-1 is skipped, but the next step is not */
      CHKERRQ(InitRevolve(laststridesize,tjsch->max_cps_ram,tjsch->rctx));
    }
    if (!stack->solution_only && stepnum == tjsch->total_steps-laststridesize+1 && !tjsch->recompute) { /* step tjsch->total_steps-laststridesize is skipped, but the next step is not */
      CHKERRQ(InitRevolve(laststridesize,tjsch->max_cps_ram,tjsch->rctx));
    }
  }
  CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  CHKERRQ(PetscRevolveIntCast(localstepnum,&rlocalstepnum));
  CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rstepnum,rlocalstepnum,PETSC_FALSE,&store));
  if (store == 1) {
    PetscCheck(localstepnum >= stack->top,PetscObjectComm((PetscObject)ts),PETSC_ERR_MEMC,"Illegal modification of a non-top stack element");
    cptype = stack->solution_only ? SOLUTIONONLY : SOLUTION_STAGES;
    CHKERRQ(ElementCreate(ts,cptype,stack,&e));
    CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
    CHKERRQ(StackPush(stack,e));
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_TLR(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack           *stack = &tjsch->stack;
  PetscRevolveInt whattodo,shift,rstepnum,rlocalstepnum,rtotal_steps;
  PetscInt        localstepnum,stridenum,laststridesize,store;
  StackElement    e;
  CheckpointType  cptype;

  PetscFunctionBegin;
  localstepnum = stepnum%tjsch->stride;
  stridenum    = stepnum/tjsch->stride;
  if (stepnum == tjsch->total_steps) {
    CHKERRQ(TurnBackward(ts));
    tjsch->rctx->reverseonestep = PETSC_FALSE;
    PetscFunctionReturn(0);
  }
  laststridesize = tjsch->total_steps%tjsch->stride;
  if (!laststridesize) laststridesize = tjsch->stride;
  CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  CHKERRQ(PetscRevolveIntCast(localstepnum,&rlocalstepnum));
  if (stack->solution_only) {
    /* fill stack */
    if (localstepnum == 0 && stepnum <= tjsch->total_steps-laststridesize) {
      if (tjsch->save_stack) {
        CHKERRQ(StackLoadAll(tj,ts,stack,stridenum));
        CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
        CHKERRQ(FastForwardRevolve(tjsch->rctx));
        tjsch->skip_trajectory = PETSC_TRUE;
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,stridenum*tjsch->stride-1,stridenum*tjsch->stride));
        tjsch->skip_trajectory = PETSC_FALSE;
      } else {
        CHKERRQ(LoadSingle(tj,ts,stack,stridenum));
        CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,(stridenum-1)*tjsch->stride,stridenum*tjsch->stride));
      }
      PetscFunctionReturn(0);
    }
    /* restore a checkpoint */
    CHKERRQ(StackTop(stack,&e));
    CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
    /* start with restoring a checkpoint */
    tjsch->rctx->capo = rstepnum;
    tjsch->rctx->oldcapo = tjsch->rctx->capo;
    shift = rstepnum-rlocalstepnum;
    whattodo = revolve_action(&tjsch->rctx->check,&tjsch->rctx->capo,&tjsch->rctx->fine,tjsch->rctx->snaps_in,&tjsch->rctx->info,&tjsch->rctx->where);
    CHKERRQ(printwhattodo(tj->monitor,whattodo,tjsch->rctx,shift));
    CHKERRQ(TurnForward(ts));
    CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stepnum));
    if (e->stepnum+1 == stepnum) {
      CHKERRQ(StackPop(stack,&e));
    }
  } else {
    /* fill stack with info */
    if (localstepnum == 0 && tjsch->total_steps-stepnum >= laststridesize) {
      if (tjsch->save_stack) {
        CHKERRQ(StackLoadAll(tj,ts,stack,stridenum));
        CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
        CHKERRQ(FastForwardRevolve(tjsch->rctx));
      } else {
        PetscRevolveInt rnum;
        CHKERRQ(LoadSingle(tj,ts,stack,stridenum));
        CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
        CHKERRQ(PetscRevolveIntCast((stridenum-1)*tjsch->stride+1,&rnum));
        CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rnum,1,PETSC_FALSE,&store));
        if (tj->monitor) {
          CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
          CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Skip the step from %D to %D (stage values already checkpointed)\n",(stridenum-1)*tjsch->stride+tjsch->rctx->oldcapo,(stridenum-1)*tjsch->stride+tjsch->rctx->oldcapo+1));
          CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
        }
        cptype = SOLUTION_STAGES;
        CHKERRQ(ElementCreate(ts,cptype,stack,&e));
        CHKERRQ(ElementSet(ts,stack,&e,(stridenum-1)*tjsch->stride+1,ts->ptime,ts->vec_sol));
        CHKERRQ(StackPush(stack,e));
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stridenum*tjsch->stride));
      }
      PetscFunctionReturn(0);
    }
    /* restore a checkpoint */
    CHKERRQ(StackTop(stack,&e));
    CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
    /* 2 revolve actions: restore a checkpoint and then advance */
    CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rstepnum,rlocalstepnum,PETSC_FALSE,&store));
    if (tj->monitor) {
      CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
      CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Skip the step from %D to %D (stage values already checkpointed)\n",stepnum-localstepnum+tjsch->rctx->oldcapo,stepnum-localstepnum+tjsch->rctx->oldcapo+1));
      CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
    }
    if (!tjsch->rctx->reverseonestep && tjsch->rctx->stepsleft > 0) tjsch->rctx->stepsleft--;
    if (e->stepnum < stepnum) {
      CHKERRQ(TurnForward(ts));
      CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stepnum));
    }
    if (e->stepnum == stepnum) {
      CHKERRQ(StackPop(stack,&e));
    }
  }
  tjsch->rctx->reverseonestep = PETSC_FALSE;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySet_TLTR(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack           *stack = &tjsch->stack;
  PetscInt        store,localstepnum,stridenum,laststridesize;
  StackElement    e;
  PetscBool       done = PETSC_FALSE;
  PetscRevolveInt rlocalstepnum,rstepnum,rtotal_steps;

  PetscFunctionBegin;
  if (!stack->solution_only && stepnum == 0) PetscFunctionReturn(0);
  if (stack->solution_only && stepnum == tjsch->total_steps) PetscFunctionReturn(0);

  localstepnum = stepnum%tjsch->stride; /* index at the bottom level (inside a stride) */
  stridenum    = stepnum/tjsch->stride; /* index at the top level */
  laststridesize = tjsch->total_steps%tjsch->stride;
  if (!laststridesize) laststridesize = tjsch->stride;
  if (stack->solution_only && localstepnum == 0 && !tjsch->rctx2->reverseonestep) {
    CHKERRQ(PetscRevolveIntCast((tjsch->total_steps+tjsch->stride-1)/tjsch->stride,&rtotal_steps));
    CHKERRQ(PetscRevolveIntCast(stridenum,&rstepnum));
    CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx2,rtotal_steps,rstepnum,rstepnum,PETSC_TRUE,&tjsch->store_stride));
    if (laststridesize < tjsch->stride && stepnum == tjsch->total_steps-laststridesize) {
      CHKERRQ(InitRevolve(laststridesize,tjsch->max_cps_ram,tjsch->rctx));
    }
  }
  if (!stack->solution_only && localstepnum == 1 && !tjsch->rctx2->reverseonestep) {
    CHKERRQ(PetscRevolveIntCast((tjsch->total_steps+tjsch->stride-1)/tjsch->stride,&rtotal_steps));
    CHKERRQ(PetscRevolveIntCast(stridenum,&rstepnum));
    CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx2,rtotal_steps,rstepnum,rstepnum,PETSC_TRUE,&tjsch->store_stride));
    if (laststridesize < tjsch->stride && stepnum == tjsch->total_steps-laststridesize+1) {
      CHKERRQ(InitRevolve(laststridesize,tjsch->max_cps_ram,tjsch->rctx));
    }
  }
  if (tjsch->store_stride) {
    CHKERRQ(TopLevelStore(tj,ts,tjsch,stepnum,localstepnum,laststridesize,&done));
    if (done) {
      CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
      PetscFunctionReturn(0);
    }
  }
  if (stepnum < tjsch->total_steps-laststridesize) {
    if (tjsch->save_stack && !tjsch->store_stride && !tjsch->rctx2->reverseonestep) PetscFunctionReturn(0); /* store or forward-and-reverse at top level trigger revolve at bottom level */
    if (!tjsch->save_stack && !tjsch->rctx2->reverseonestep) PetscFunctionReturn(0); /* store operation does not require revolve be called at bottom level */
  }
  /* Skipping stepnum=0 for !stack->only is enough for TLR, but not for TLTR. Here we skip the first step for each stride so that the top-level revolve is applied (always at localstepnum=1) ahead of the bottom-level revolve */
  if (!stack->solution_only && localstepnum == 0 && stepnum != tjsch->total_steps && !tjsch->recompute) PetscFunctionReturn(0);
  CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  CHKERRQ(PetscRevolveIntCast(localstepnum,&rlocalstepnum));
  CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rstepnum,rlocalstepnum,PETSC_FALSE,&store));
  if (store == 1) {
    CheckpointType cptype;
    PetscCheck(localstepnum >= stack->top,PetscObjectComm((PetscObject)ts),PETSC_ERR_MEMC,"Illegal modification of a non-top stack element");
    cptype = stack->solution_only ? SOLUTIONONLY : SOLUTION_STAGES;
    CHKERRQ(ElementCreate(ts,cptype,stack,&e));
    CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
    CHKERRQ(StackPush(stack,e));
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_TLTR(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack           *stack = &tjsch->stack;
  DiskStack       *diskstack = &tjsch->diskstack;
  PetscInt        localstepnum,stridenum,restoredstridenum,laststridesize,store;
  StackElement    e;
  PetscRevolveInt whattodo,shift;
  PetscRevolveInt rtotal_steps,rstepnum,rlocalstepnum;

  PetscFunctionBegin;
  localstepnum = stepnum%tjsch->stride;
  stridenum    = stepnum/tjsch->stride;
  if (stepnum == tjsch->total_steps) {
    CHKERRQ(TurnBackward(ts));
    tjsch->rctx->reverseonestep = PETSC_FALSE;
    PetscFunctionReturn(0);
  }
  laststridesize = tjsch->total_steps%tjsch->stride;
  if (!laststridesize) laststridesize = tjsch->stride;
  /*
   Last stride can be adjoined directly. All the other strides require that the stack in memory be ready before an adjoint step is taken (at the end of each stride). The following two cases need to be addressed differently:
     Case 1 (save_stack)
       Restore a disk checkpoint; update TS with the last element in the restored data; recompute to the current point.
     Case 2 (!save_stack)
       Restore a disk checkpoint; update TS with the restored point; recompute to the current point.
  */
  if (localstepnum == 0 && stepnum <= tjsch->total_steps-laststridesize) {
    /* restore the top element in the stack for disk checkpoints */
    restoredstridenum = diskstack->container[diskstack->top];
    tjsch->rctx2->reverseonestep = PETSC_FALSE;
    /* top-level revolve must be applied before current step, just like the solution_only mode for single-level revolve */
    if (!tjsch->save_stack && stack->solution_only) { /* start with restoring a checkpoint */
      CHKERRQ(PetscRevolveIntCast(stridenum,&rstepnum));
      tjsch->rctx2->capo = rstepnum;
      tjsch->rctx2->oldcapo = tjsch->rctx2->capo;
      shift = 0;
      whattodo = revolve2_action(&tjsch->rctx2->check,&tjsch->rctx2->capo,&tjsch->rctx2->fine,tjsch->rctx2->snaps_in,&tjsch->rctx2->info,&tjsch->rctx2->where);
      CHKERRQ(printwhattodo2(tj->monitor,whattodo,tjsch->rctx2,shift));
    } else { /* 2 revolve actions: restore a checkpoint and then advance */
      CHKERRQ(PetscRevolveIntCast((tjsch->total_steps+tjsch->stride-1)/tjsch->stride,&rtotal_steps));
      CHKERRQ(PetscRevolveIntCast(stridenum,&rstepnum));
      CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx2,rtotal_steps,rstepnum,rstepnum,PETSC_TRUE,&tjsch->store_stride));
      if (tj->monitor) {
        CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
        CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"[Top Level] Skip the stride from %D to %D (stage values already checkpointed)\n",tjsch->rctx2->oldcapo,tjsch->rctx2->oldcapo+1));
        CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
      }
      if (!tjsch->rctx2->reverseonestep && tjsch->rctx2->stepsleft > 0) tjsch->rctx2->stepsleft--;
    }
    /* fill stack */
    if (stack->solution_only) {
      if (tjsch->save_stack) {
        if (restoredstridenum < stridenum) {
          CHKERRQ(StackLoadLast(tj,ts,stack,restoredstridenum));
        } else {
          CHKERRQ(StackLoadAll(tj,ts,stack,restoredstridenum));
        }
        /* recompute one step ahead */
        tjsch->skip_trajectory = PETSC_TRUE;
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,stridenum*tjsch->stride-1,stridenum*tjsch->stride));
        tjsch->skip_trajectory = PETSC_FALSE;
        if (restoredstridenum < stridenum) {
          CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
          CHKERRQ(TurnForward(ts));
          CHKERRQ(ReCompute(ts,tjsch,restoredstridenum*tjsch->stride,stepnum));
        } else { /* stack ready, fast forward revolve status */
          CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
          CHKERRQ(FastForwardRevolve(tjsch->rctx));
        }
      } else {
        CHKERRQ(LoadSingle(tj,ts,stack,restoredstridenum));
        CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,(restoredstridenum-1)*tjsch->stride,stepnum));
      }
    } else {
      if (tjsch->save_stack) {
        if (restoredstridenum < stridenum) {
          CHKERRQ(StackLoadLast(tj,ts,stack,restoredstridenum));
          /* reset revolve */
          CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
          CHKERRQ(TurnForward(ts));
          CHKERRQ(ReCompute(ts,tjsch,restoredstridenum*tjsch->stride,stepnum));
        } else { /* stack ready, fast forward revolve status */
          CHKERRQ(StackLoadAll(tj,ts,stack,restoredstridenum));
          CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
          CHKERRQ(FastForwardRevolve(tjsch->rctx));
        }
      } else {
        CHKERRQ(LoadSingle(tj,ts,stack,restoredstridenum));
        CHKERRQ(InitRevolve(tjsch->stride,tjsch->max_cps_ram,tjsch->rctx));
        /* push first element to stack */
        if (tjsch->store_stride || tjsch->rctx2->reverseonestep) {
          CheckpointType cptype = SOLUTION_STAGES;
          shift = (restoredstridenum-1)*tjsch->stride-localstepnum;
          CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
          CHKERRQ(PetscRevolveIntCast((restoredstridenum-1)*tjsch->stride+1,&rstepnum));
          CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rstepnum,1,PETSC_FALSE,&store));
          if (tj->monitor) {
            CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
            CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Skip the step from %D to %D (stage values already checkpointed)\n",(restoredstridenum-1)*tjsch->stride,(restoredstridenum-1)*tjsch->stride+1));
            CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
          }
          CHKERRQ(ElementCreate(ts,cptype,stack,&e));
          CHKERRQ(ElementSet(ts,stack,&e,(restoredstridenum-1)*tjsch->stride+1,ts->ptime,ts->vec_sol));
          CHKERRQ(StackPush(stack,e));
        }
        CHKERRQ(TurnForward(ts));
        CHKERRQ(ReCompute(ts,tjsch,(restoredstridenum-1)*tjsch->stride+1,stepnum));
      }
    }
    if (restoredstridenum == stridenum) diskstack->top--;
    tjsch->rctx->reverseonestep = PETSC_FALSE;
    PetscFunctionReturn(0);
  }

  if (stack->solution_only) {
    /* restore a checkpoint */
    CHKERRQ(StackTop(stack,&e));
    CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
    /* start with restoring a checkpoint */
    CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
    CHKERRQ(PetscRevolveIntCast(localstepnum,&rlocalstepnum));
    tjsch->rctx->capo = rstepnum;
    tjsch->rctx->oldcapo = tjsch->rctx->capo;
    shift = rstepnum-rlocalstepnum;
    whattodo = revolve_action(&tjsch->rctx->check,&tjsch->rctx->capo,&tjsch->rctx->fine,tjsch->rctx->snaps_in,&tjsch->rctx->info,&tjsch->rctx->where);
    CHKERRQ(printwhattodo(tj->monitor,whattodo,tjsch->rctx,shift));
    CHKERRQ(TurnForward(ts));
    CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stepnum));
    if (e->stepnum+1 == stepnum) {
      CHKERRQ(StackPop(stack,&e));
    }
  } else {
    PetscRevolveInt rlocalstepnum;
    /* restore a checkpoint */
    CHKERRQ(StackTop(stack,&e));
    CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
    /* 2 revolve actions: restore a checkpoint and then advance */
    CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
    CHKERRQ(PetscRevolveIntCast(stridenum,&rstepnum));
    CHKERRQ(PetscRevolveIntCast(localstepnum,&rlocalstepnum));
    CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rstepnum,rlocalstepnum,PETSC_FALSE,&store));
    if (tj->monitor) {
      CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
      CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Skip the step from %D to %D (stage values already checkpointed)\n",stepnum-localstepnum+tjsch->rctx->oldcapo,stepnum-localstepnum+tjsch->rctx->oldcapo+1));
      CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
    }
    if (!tjsch->rctx->reverseonestep && tjsch->rctx->stepsleft > 0) tjsch->rctx->stepsleft--;
    if (e->stepnum < stepnum) {
      CHKERRQ(TurnForward(ts));
      CHKERRQ(ReCompute(ts,tjsch,e->stepnum,stepnum));
    }
    if (e->stepnum == stepnum) {
      CHKERRQ(StackPop(stack,&e));
    }
  }
  tjsch->rctx->reverseonestep = PETSC_FALSE;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySet_RMS(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack           *stack = &tjsch->stack;
  PetscInt        store;
  StackElement    e;
  PetscRevolveInt rtotal_steps,rstepnum;

  PetscFunctionBegin;
  if (!stack->solution_only && stepnum == 0) PetscFunctionReturn(0);
  if (stack->solution_only && stepnum == tjsch->total_steps) PetscFunctionReturn(0);
  CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rtotal_steps));
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  CHKERRQ(ApplyRevolve(tj->monitor,tjsch->stype,tjsch->rctx,rtotal_steps,rstepnum,rstepnum,PETSC_FALSE,&store));
  if (store == 1) {
    CheckpointType cptype;
    PetscCheck(stepnum >= stack->top,PetscObjectComm((PetscObject)ts),PETSC_ERR_MEMC,"Illegal modification of a non-top stack element");
    cptype = stack->solution_only ? SOLUTIONONLY : SOLUTION_STAGES;
    CHKERRQ(ElementCreate(ts,cptype,stack,&e));
    CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
    CHKERRQ(StackPush(stack,e));
  } else if (store == 2) {
    CHKERRQ(DumpSingle(tj,ts,stack,tjsch->rctx->check+1));
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_RMS(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack           *stack = &tjsch->stack;
  PetscRevolveInt whattodo,shift,rstepnum;
  PetscInt        restart;
  PetscBool       ondisk;
  StackElement    e;

  PetscFunctionBegin;
  if (stepnum == 0 || stepnum == tjsch->total_steps) {
    CHKERRQ(TurnBackward(ts));
    tjsch->rctx->reverseonestep = PETSC_FALSE;
    PetscFunctionReturn(0);
  }
  CHKERRQ(PetscRevolveIntCast(stepnum,&rstepnum));
  tjsch->rctx->capo = rstepnum;
  tjsch->rctx->oldcapo = tjsch->rctx->capo;
  shift = 0;
  whattodo = revolve_action(&tjsch->rctx->check,&tjsch->rctx->capo,&tjsch->rctx->fine,tjsch->rctx->snaps_in,&tjsch->rctx->info,&tjsch->rctx->where); /* whattodo=restore */
  CHKERRQ(printwhattodo(tj->monitor,whattodo,tjsch->rctx,shift));
  /* restore a checkpoint */
  restart = tjsch->rctx->capo;
  if (!tjsch->rctx->where) {
    ondisk = PETSC_TRUE;
    CHKERRQ(LoadSingle(tj,ts,stack,tjsch->rctx->check+1));
    CHKERRQ(TurnBackward(ts));
  } else {
    ondisk = PETSC_FALSE;
    CHKERRQ(StackTop(stack,&e));
    CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
  }
  if (!stack->solution_only) { /* whattodo must be 5 or 8 */
    /* ask Revolve what to do next */
    tjsch->rctx->oldcapo = tjsch->rctx->capo;
    whattodo = revolve_action(&tjsch->rctx->check,&tjsch->rctx->capo,&tjsch->rctx->fine,tjsch->rctx->snaps_in,&tjsch->rctx->info,&tjsch->rctx->where); /* must return 1 or 3 or 4*/
    CHKERRQ(printwhattodo(tj->monitor,whattodo,tjsch->rctx,shift));
    if (whattodo == 3 || whattodo == 4) tjsch->rctx->reverseonestep = PETSC_TRUE;
    if (whattodo == 1) tjsch->rctx->stepsleft = tjsch->rctx->capo-tjsch->rctx->oldcapo;
    if (tj->monitor) {
      CHKERRQ(PetscViewerASCIIAddTab(tj->monitor,((PetscObject)tj)->tablevel));
      CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Skip the step from %D to %D (stage values already checkpointed)\n",tjsch->rctx->oldcapo,tjsch->rctx->oldcapo+1));
      CHKERRQ(PetscViewerASCIISubtractTab(tj->monitor,((PetscObject)tj)->tablevel));
    }
    if (!tjsch->rctx->reverseonestep && tjsch->rctx->stepsleft > 0) tjsch->rctx->stepsleft--;
    restart++; /* skip one step */
  }
  if (stack->solution_only || (!stack->solution_only && restart < stepnum)) {
    CHKERRQ(TurnForward(ts));
    CHKERRQ(ReCompute(ts,tjsch,restart,stepnum));
  }
  if (!ondisk && ( (stack->solution_only && e->stepnum+1 == stepnum) || (!stack->solution_only && e->stepnum == stepnum))) {
    CHKERRQ(StackPop(stack,&e));
  }
  tjsch->rctx->reverseonestep = PETSC_FALSE;
  PetscFunctionReturn(0);
}
#endif

#if defined(PETSC_HAVE_CAMS)
/* Optimal offline adjoint checkpointing for multistage time integration methods */
static PetscErrorCode TSTrajectoryMemorySet_AOF(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum,PetscReal time,Vec X)
{
  Stack        *stack = &tjsch->stack;
  StackElement  e;

  PetscFunctionBegin;
  /* skip if no checkpoint to use. This also avoids an error when num_units_avail=0  */
  if (tjsch->actx->nextcheckpointstep == -1) PetscFunctionReturn(0);
  if (stepnum == 0) { /* When placing the first checkpoint, no need to change the units available */
    if (stack->solution_only) {
      CHKERRQ(offline_ca(tjsch->actx->lastcheckpointstep,tjsch->actx->num_units_avail,tjsch->actx->endstep,&tjsch->actx->nextcheckpointstep));
    } else {
      /* First two arguments must be -1 when first time calling cams */
      CHKERRQ(offline_cams(tjsch->actx->lastcheckpointstep,tjsch->actx->lastcheckpointtype,tjsch->actx->num_units_avail,tjsch->actx->endstep,tjsch->actx->num_stages,&tjsch->actx->nextcheckpointstep,&tjsch->actx->nextcheckpointtype));
    }
  }

  if (stack->solution_only && stepnum == tjsch->total_steps) PetscFunctionReturn(0);

  if (tjsch->actx->nextcheckpointstep == stepnum) {
    PetscCheck(stepnum >= stack->top,PetscObjectComm((PetscObject)ts),PETSC_ERR_MEMC,"Illegal modification of a non-top stack element");

    if (tjsch->actx->nextcheckpointtype == 2) { /* solution + stage values */
      if (tj->monitor) {
        CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Store in checkpoint number %D with stage values and solution (located in RAM)\n",stepnum));
      }
      CHKERRQ(ElementCreate(ts,SOLUTION_STAGES,stack,&e));
      CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
    }
    if (tjsch->actx->nextcheckpointtype == 1) {
      if (tj->monitor) {
        CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Store in checkpoint number %D with stage values (located in RAM)\n",stepnum));
      }
      CHKERRQ(ElementCreate(ts,STAGESONLY,stack,&e));
      CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
    }
    if (tjsch->actx->nextcheckpointtype == 0) { /* solution only */
      if (tj->monitor) {
        CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Store in checkpoint number %D (located in RAM)\n",stepnum));
      }
      CHKERRQ(ElementCreate(ts,SOLUTIONONLY,stack,&e));
      CHKERRQ(ElementSet(ts,stack,&e,stepnum,time,X));
    }
    CHKERRQ(StackPush(stack,e));

    tjsch->actx->lastcheckpointstep = stepnum;
    if (stack->solution_only) {
      CHKERRQ(offline_ca(tjsch->actx->lastcheckpointstep,tjsch->actx->num_units_avail,tjsch->actx->endstep,&tjsch->actx->nextcheckpointstep));
      tjsch->actx->num_units_avail--;
    } else {
      tjsch->actx->lastcheckpointtype = tjsch->actx->nextcheckpointtype;
      CHKERRQ(offline_cams(tjsch->actx->lastcheckpointstep,tjsch->actx->lastcheckpointtype,tjsch->actx->num_units_avail,tjsch->actx->endstep,tjsch->actx->num_stages,&tjsch->actx->nextcheckpointstep,&tjsch->actx->nextcheckpointtype));
      if (tjsch->actx->lastcheckpointtype == 2) tjsch->actx->num_units_avail -= tjsch->actx->num_stages+1;
      if (tjsch->actx->lastcheckpointtype == 1) tjsch->actx->num_units_avail -= tjsch->actx->num_stages;
      if (tjsch->actx->lastcheckpointtype == 0) tjsch->actx->num_units_avail--;
    }
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemoryGet_AOF(TSTrajectory tj,TS ts,TJScheduler *tjsch,PetscInt stepnum)
{
  Stack        *stack = &tjsch->stack;
  StackElement  e;
  PetscInt      estepnum;

  PetscFunctionBegin;
  if (stepnum == 0 || stepnum == tjsch->total_steps) {
    CHKERRQ(TurnBackward(ts));
    PetscFunctionReturn(0);
  }
  /* Restore a checkpoint */
  CHKERRQ(StackTop(stack,&e));
  estepnum = e->stepnum;
  if (estepnum == stepnum && e->cptype == SOLUTIONONLY) { /* discard the checkpoint if not useful (corner case) */
    CHKERRQ(StackPop(stack,&e));
    tjsch->actx->num_units_avail++;
    CHKERRQ(StackTop(stack,&e));
    estepnum = e->stepnum;
  }
  /* Update TS with stage values if an adjoint step can be taken immediately */
  if (HaveStages(e->cptype)) {
    if (tj->monitor) {
      CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Restore in checkpoint number %D with stage values (located in RAM)\n",e->stepnum));
    }
    if (e->cptype == STAGESONLY) tjsch->actx->num_units_avail += tjsch->actx->num_stages;
    if (e->cptype == SOLUTION_STAGES) tjsch->actx->num_units_avail += tjsch->actx->num_stages+1;
  } else {
    if (tj->monitor) {
      CHKERRQ(PetscViewerASCIIPrintf(tj->monitor,"Restore in checkpoint number %D (located in RAM)\n",e->stepnum));
    }
    tjsch->actx->num_units_avail++;
  }
  CHKERRQ(UpdateTS(ts,stack,e,stepnum,PETSC_TRUE));
  /* Query the scheduler */
  tjsch->actx->lastcheckpointstep = estepnum;
  tjsch->actx->endstep = stepnum;
  if (stack->solution_only) { /* start with restoring a checkpoint */
    CHKERRQ(offline_ca(tjsch->actx->lastcheckpointstep,tjsch->actx->num_units_avail,tjsch->actx->endstep,&tjsch->actx->nextcheckpointstep));
  } else { /* 2 revolve actions: restore a checkpoint and then advance */
    tjsch->actx->lastcheckpointtype = e->cptype;
    CHKERRQ(offline_cams(tjsch->actx->lastcheckpointstep,tjsch->actx->lastcheckpointtype,tjsch->actx->num_units_avail,tjsch->actx->endstep,tjsch->actx->num_stages,&tjsch->actx->nextcheckpointstep, &tjsch->actx->nextcheckpointtype));
  }
  /* Discard the checkpoint if not needed, decrease the number of available checkpoints if it still stays in stack */
  if (HaveStages(e->cptype)) {
    if (estepnum == stepnum) {
      CHKERRQ(StackPop(stack,&e));
    } else {
      if (e->cptype == STAGESONLY) tjsch->actx->num_units_avail -= tjsch->actx->num_stages;
      if (e->cptype == SOLUTION_STAGES) tjsch->actx->num_units_avail -= tjsch->actx->num_stages+1;
    }
  } else {
    if (estepnum+1 == stepnum) {
      CHKERRQ(StackPop(stack,&e));
    } else {
      tjsch->actx->num_units_avail--;
    }
  }
  /* Recompute from the restored checkpoint */
  if (stack->solution_only || (!stack->solution_only && estepnum < stepnum)) {
    CHKERRQ(TurnForward(ts));
    CHKERRQ(ReCompute(ts,tjsch,estepnum,stepnum));
  }
  PetscFunctionReturn(0);
}
#endif

static PetscErrorCode TSTrajectorySet_Memory(TSTrajectory tj,TS ts,PetscInt stepnum,PetscReal time,Vec X)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  if (!tjsch->recompute) { /* use global stepnum in the forward sweep */
    CHKERRQ(TSGetStepNumber(ts,&stepnum));
  }
  /* for consistency */
  if (!tjsch->recompute && stepnum == 0) ts->ptime_prev = ts->ptime-ts->time_step;
  switch (tjsch->stype) {
    case NONE:
      if (tj->adjoint_solve_mode) {
        CHKERRQ(TSTrajectoryMemorySet_N(ts,tjsch,stepnum,time,X));
      } else {
        CHKERRQ(TSTrajectoryMemorySet_N_2(ts,tjsch,stepnum,time,X));
      }
      break;
    case TWO_LEVEL_NOREVOLVE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemorySet_TLNR(tj,ts,tjsch,stepnum,time,X));
      break;
#if defined(PETSC_HAVE_REVOLVE)
    case TWO_LEVEL_REVOLVE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemorySet_TLR(tj,ts,tjsch,stepnum,time,X));
      break;
    case TWO_LEVEL_TWO_REVOLVE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemorySet_TLTR(tj,ts,tjsch,stepnum,time,X));
      break;
    case REVOLVE_OFFLINE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemorySet_ROF(tj,ts,tjsch,stepnum,time,X));
      break;
    case REVOLVE_ONLINE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemorySet_RON(tj,ts,tjsch,stepnum,time,X));
      break;
    case REVOLVE_MULTISTAGE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemorySet_RMS(tj,ts,tjsch,stepnum,time,X));
      break;
#endif
#if defined(PETSC_HAVE_CAMS)
    case CAMS_OFFLINE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemorySet_AOF(tj,ts,tjsch,stepnum,time,X));
      break;
#endif
    default:
      break;
  }
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryGet_Memory(TSTrajectory tj,TS ts,PetscInt stepnum,PetscReal *t)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  if (tj->adjoint_solve_mode && stepnum == 0) {
    CHKERRQ(TSTrajectoryReset(tj)); /* reset TSTrajectory so users do not need to reset TSTrajectory */
    PetscFunctionReturn(0);
  }
  switch (tjsch->stype) {
    case NONE:
      if (tj->adjoint_solve_mode) {
        CHKERRQ(TSTrajectoryMemoryGet_N(ts,tjsch,stepnum));
      } else {
        CHKERRQ(TSTrajectoryMemoryGet_N_2(ts,tjsch,stepnum));
      }
      break;
    case TWO_LEVEL_NOREVOLVE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemoryGet_TLNR(tj,ts,tjsch,stepnum));
      break;
#if defined(PETSC_HAVE_REVOLVE)
    case TWO_LEVEL_REVOLVE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemoryGet_TLR(tj,ts,tjsch,stepnum));
      break;
    case TWO_LEVEL_TWO_REVOLVE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemoryGet_TLTR(tj,ts,tjsch,stepnum));
      break;
    case REVOLVE_OFFLINE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemoryGet_ROF(tj,ts,tjsch,stepnum));
      break;
    case REVOLVE_ONLINE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemoryGet_RON(tj,ts,tjsch,stepnum));
      break;
    case REVOLVE_MULTISTAGE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemoryGet_RMS(tj,ts,tjsch,stepnum));
      break;
#endif
#if defined(PETSC_HAVE_CAMS)
    case CAMS_OFFLINE:
      PetscCheck(tj->adjoint_solve_mode,PetscObjectComm((PetscObject)tj),PETSC_ERR_SUP,"Not implemented");
      CHKERRQ(TSTrajectoryMemoryGet_AOF(tj,ts,tjsch,stepnum));
      break;
#endif
    default:
      break;
  }
  PetscFunctionReturn(0);
}

PETSC_UNUSED static PetscErrorCode TSTrajectorySetStride_Memory(TSTrajectory tj,PetscInt stride)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  tjsch->stride = stride;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectorySetMaxCpsRAM_Memory(TSTrajectory tj,PetscInt max_cps_ram)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  tjsch->max_cps_ram = max_cps_ram;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectorySetMaxCpsDisk_Memory(TSTrajectory tj,PetscInt max_cps_disk)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  tjsch->max_cps_disk = max_cps_disk;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectorySetMaxUnitsRAM_Memory(TSTrajectory tj,PetscInt max_units_ram)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  PetscCheck(tjsch->max_cps_ram,PetscObjectComm((PetscObject)tj),PETSC_ERR_ARG_INCOMP,"Conflict with -ts_trjaectory_max_cps_ram or TSTrajectorySetMaxCpsRAM. You can set max_cps_ram or max_units_ram, but not both at the same time.");
  tjsch->max_units_ram = max_units_ram;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectorySetMaxUnitsDisk_Memory(TSTrajectory tj,PetscInt max_units_disk)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  PetscCheck(tjsch->max_cps_disk,PetscObjectComm((PetscObject)tj),PETSC_ERR_ARG_INCOMP,"Conflict with -ts_trjaectory_max_cps_disk or TSTrajectorySetMaxCpsDisk. You can set max_cps_disk or max_units_disk, but not both at the same time.");
  tjsch->max_units_ram = max_units_disk;
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryMemorySetType_Memory(TSTrajectory tj,TSTrajectoryMemoryType tj_memory_type)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  PetscCheck(!tj->setupcalled,PetscObjectComm((PetscObject)tj),PETSC_ERR_ARG_WRONGSTATE,"Cannot change schedule software after TSTrajectory has been setup or used");
  tjsch->tj_memory_type = tj_memory_type;
  PetscFunctionReturn(0);
}

#if defined(PETSC_HAVE_REVOLVE)
PETSC_UNUSED static PetscErrorCode TSTrajectorySetRevolveOnline(TSTrajectory tj,PetscBool use_online)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  tjsch->use_online = use_online;
  PetscFunctionReturn(0);
}
#endif

PETSC_UNUSED static PetscErrorCode TSTrajectorySetSaveStack(TSTrajectory tj,PetscBool save_stack)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  tjsch->save_stack = save_stack;
  PetscFunctionReturn(0);
}

PETSC_UNUSED static PetscErrorCode TSTrajectorySetUseDRAM(TSTrajectory tj,PetscBool use_dram)
{
  TJScheduler *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  tjsch->stack.use_dram = use_dram;
  PetscFunctionReturn(0);
}

/*@C
   TSTrajectoryMemorySetType - sets the software that is used to generate the checkpointing schedule.

   Logically Collective on TSTrajectory

   Input Parameters:
+  tj - the TSTrajectory context
-  tj_memory_type - Revolve or CAMS

   Options Database Key:
.  -ts_trajectory_memory_type <tj_memory_type> - petsc, revolve, cams

   Level: intermediate

   Note:
     By default this will use Revolve if it exists
@*/
PetscErrorCode TSTrajectoryMemorySetType(TSTrajectory tj,TSTrajectoryMemoryType tj_memory_type)
{
  PetscFunctionBegin;
  CHKERRQ(PetscTryMethod(tj,"TSTrajectoryMemorySetType_C",(TSTrajectory,TSTrajectoryMemoryType),(tj,tj_memory_type)));
  PetscFunctionReturn(0);
}

/*@C
  TSTrajectorySetMaxCpsRAM - Set maximum number of checkpoints in RAM

  Logically collective

  Input Parameter:
.  tj - tstrajectory context

  Output Parameter:
.  max_cps_ram - maximum number of checkpoints in RAM

  Level: intermediate

.seealso: TSTrajectorySetMaxUnitsRAM()
@*/
PetscErrorCode TSTrajectorySetMaxCpsRAM(TSTrajectory tj,PetscInt max_cps_ram)
{
  PetscFunctionBegin;
  CHKERRQ(PetscUseMethod(tj,"TSTrajectorySetMaxCpsRAM_C",(TSTrajectory,PetscInt),(tj,max_cps_ram)));
  PetscFunctionReturn(0);
}

/*@C
  TSTrajectorySetMaxCpsDisk - Set maximum number of checkpoints on disk

  Logically collective

  Input Parameter:
.  tj - tstrajectory context

  Output Parameter:
.  max_cps_disk - maximum number of checkpoints on disk

  Level: intermediate

.seealso: TSTrajectorySetMaxUnitsDisk(), TSTrajectorySetMaxUnitsRAM()
@*/
PetscErrorCode TSTrajectorySetMaxCpsDisk(TSTrajectory tj,PetscInt max_cps_disk)
{
  PetscFunctionBegin;
  CHKERRQ(PetscUseMethod(tj,"TSTrajectorySetMaxCpsDisk_C",(TSTrajectory,PetscInt),(tj,max_cps_disk)));
  PetscFunctionReturn(0);
}

/*@C
  TSTrajectorySetMaxUnitsRAM - Set maximum number of checkpointing units in RAM

  Logically collective

  Input Parameter:
.  tj - tstrajectory context

  Output Parameter:
.  max_units_ram - maximum number of checkpointing units in RAM

  Level: intermediate

.seealso: TSTrajectorySetMaxCpsRAM()
@*/
PetscErrorCode TSTrajectorySetMaxUnitsRAM(TSTrajectory tj,PetscInt max_units_ram)
{
  PetscFunctionBegin;
  CHKERRQ(PetscUseMethod(tj,"TSTrajectorySetMaxUnitsRAM_C",(TSTrajectory,PetscInt),(tj,max_units_ram)));
  PetscFunctionReturn(0);
}

/*@C
  TSTrajectorySetMaxUnitsDisk - Set maximum number of checkpointing units on disk

  Logically collective

  Input Parameter:
.  tj - tstrajectory context

  Output Parameter:
.  max_units_disk - maximum number of checkpointing units on disk

  Level: intermediate

.seealso: TSTrajectorySetMaxCpsDisk()
@*/
PetscErrorCode TSTrajectorySetMaxUnitsDisk(TSTrajectory tj,PetscInt max_units_disk)
{
  PetscFunctionBegin;
  CHKERRQ(PetscUseMethod(tj,"TSTrajectorySetMaxUnitsDisk_C",(TSTrajectory,PetscInt),(tj,max_units_disk)));
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectorySetFromOptions_Memory(PetscOptionItems *PetscOptionsObject,TSTrajectory tj)
{
  TJScheduler    *tjsch = (TJScheduler*)tj->data;
  PetscEnum      etmp;
  PetscInt       max_cps_ram,max_cps_disk,max_units_ram,max_units_disk;
  PetscBool      flg;

  PetscFunctionBegin;
  CHKERRQ(PetscOptionsHead(PetscOptionsObject,"Memory based TS trajectory options"));
  {
    CHKERRQ(PetscOptionsInt("-ts_trajectory_max_cps_ram","Maximum number of checkpoints in RAM","TSTrajectorySetMaxCpsRAM",tjsch->max_cps_ram,&max_cps_ram,&flg));
    if (flg) {
      CHKERRQ(TSTrajectorySetMaxCpsRAM(tj,max_cps_ram));
    }
    CHKERRQ(PetscOptionsInt("-ts_trajectory_max_cps_disk","Maximum number of checkpoints on disk","TSTrajectorySetMaxCpsDisk",tjsch->max_cps_disk,&max_cps_disk,&flg));
    if (flg) {
      CHKERRQ(TSTrajectorySetMaxCpsDisk(tj,max_cps_disk));
    }
    CHKERRQ(PetscOptionsInt("-ts_trajectory_max_units_ram","Maximum number of checkpointing units in RAM","TSTrajectorySetMaxUnitsRAM",tjsch->max_units_ram,&max_units_ram,&flg));
    if (flg) {
      CHKERRQ(TSTrajectorySetMaxUnitsRAM(tj,max_units_ram));
    }
    CHKERRQ(PetscOptionsInt("-ts_trajectory_max_units_disk","Maximum number of checkpointing units on disk","TSTrajectorySetMaxUnitsDisk",tjsch->max_units_disk,&max_units_disk,&flg));
    if (flg) {
      CHKERRQ(TSTrajectorySetMaxUnitsDisk(tj,max_units_disk));
    }
    CHKERRQ(PetscOptionsInt("-ts_trajectory_stride","Stride to save checkpoints to file","TSTrajectorySetStride",tjsch->stride,&tjsch->stride,NULL));
#if defined(PETSC_HAVE_REVOLVE)
    CHKERRQ(PetscOptionsBool("-ts_trajectory_revolve_online","Trick TS trajectory into using online mode of revolve","TSTrajectorySetRevolveOnline",tjsch->use_online,&tjsch->use_online,NULL));
#endif
    CHKERRQ(PetscOptionsBool("-ts_trajectory_save_stack","Save all stack to disk","TSTrajectorySetSaveStack",tjsch->save_stack,&tjsch->save_stack,NULL));
    CHKERRQ(PetscOptionsBool("-ts_trajectory_use_dram","Use DRAM for checkpointing","TSTrajectorySetUseDRAM",tjsch->stack.use_dram,&tjsch->stack.use_dram,NULL));
    CHKERRQ(PetscOptionsEnum("-ts_trajectory_memory_type","Checkpointing scchedule software to use","TSTrajectoryMemorySetType",TSTrajectoryMemoryTypes,(PetscEnum)(int)(tjsch->tj_memory_type),&etmp,&flg));
    if (flg) {
      CHKERRQ(TSTrajectoryMemorySetType(tj,(TSTrajectoryMemoryType)etmp));
    }
  }
  CHKERRQ(PetscOptionsTail());
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectorySetUp_Memory(TSTrajectory tj,TS ts)
{
  TJScheduler    *tjsch = (TJScheduler*)tj->data;
  Stack          *stack = &tjsch->stack;
#if defined(PETSC_HAVE_REVOLVE)
  RevolveCTX     *rctx,*rctx2;
  DiskStack      *diskstack = &tjsch->diskstack;
  PetscInt       diskblocks;
#endif
  PetscInt       numY,total_steps;
  PetscBool      fixedtimestep;

  PetscFunctionBegin;
  if (ts->adapt) {
    CHKERRQ(PetscObjectTypeCompare((PetscObject)ts->adapt,TSADAPTNONE,&fixedtimestep));
  } else {
    fixedtimestep = PETSC_TRUE;
  }
  total_steps = (PetscInt)(PetscCeilReal((ts->max_time-ts->ptime)/ts->time_step));
  total_steps = total_steps < 0 ? PETSC_MAX_INT : total_steps;
  if (fixedtimestep) tjsch->total_steps = PetscMin(ts->max_steps,total_steps);

  tjsch->stack.solution_only = tj->solution_only;
  CHKERRQ(TSGetStages(ts,&numY,PETSC_IGNORE));
  if (stack->solution_only) {
    if (tjsch->max_units_ram) tjsch->max_cps_ram = tjsch->max_units_ram;
    else tjsch->max_units_ram = tjsch->max_cps_ram;
    if (tjsch->max_units_disk) tjsch->max_cps_disk = tjsch->max_units_disk;
  } else {
    if (tjsch->max_units_ram) tjsch->max_cps_ram = (ts->stifflyaccurate) ? tjsch->max_units_ram/numY : tjsch->max_units_ram/(numY+1);
    else tjsch->max_units_ram = (ts->stifflyaccurate) ? numY*tjsch->max_cps_ram : (numY+1)*tjsch->max_cps_ram;
    if (tjsch->max_units_disk) tjsch->max_cps_disk = (ts->stifflyaccurate) ? tjsch->max_units_disk/numY : tjsch->max_units_disk/(numY+1);
    else tjsch->max_units_disk = (ts->stifflyaccurate) ? numY*tjsch->max_cps_disk : (numY+1)*tjsch->max_cps_disk;
  }
  if (tjsch->max_cps_ram > 0) stack->stacksize = tjsch->max_units_ram; /* maximum stack size. Could be overallocated. */

  /* Determine the scheduler type */
  if (tjsch->stride > 1) { /* two level mode */
    PetscCheckFalse(tjsch->save_stack && tjsch->max_cps_disk > 1 && tjsch->max_cps_disk <= tjsch->max_cps_ram,PetscObjectComm((PetscObject)ts),PETSC_ERR_ARG_INCOMP,"The specified disk capacity is not enough to store a full stack of RAM checkpoints. You might want to change the disk capacity or use single level checkpointing instead.");
    if (tjsch->max_cps_disk <= 1 && tjsch->max_cps_ram > 1 && tjsch->max_cps_ram <= tjsch->stride-1) tjsch->stype = TWO_LEVEL_REVOLVE; /* use revolve_offline for each stride */
    if (tjsch->max_cps_disk > 1 && tjsch->max_cps_ram > 1 && tjsch->max_cps_ram <= tjsch->stride-1) tjsch->stype = TWO_LEVEL_TWO_REVOLVE;  /* use revolve_offline for each stride */
    if (tjsch->max_cps_disk <= 1 && (tjsch->max_cps_ram >= tjsch->stride || tjsch->max_cps_ram == -1)) tjsch->stype = TWO_LEVEL_NOREVOLVE; /* can also be handled by TWO_LEVEL_REVOLVE */
  } else { /* single level mode */
    if (fixedtimestep) {
      if (tjsch->max_cps_ram >= tjsch->total_steps-1 || tjsch->max_cps_ram == -1)
        tjsch->stype = NONE; /* checkpoint all */
      else { /* choose the schedule software for offline checkpointing */
        switch (tjsch->tj_memory_type) {
          case TJ_PETSC:
            tjsch->stype = NONE;
            break;
          case TJ_CAMS:
            tjsch->stype = CAMS_OFFLINE;
            break;
          case TJ_REVOLVE:
            tjsch->stype = (tjsch->max_cps_disk>1) ? REVOLVE_MULTISTAGE : REVOLVE_OFFLINE;
            break;
          default:
            break;
        }
      }
    } else tjsch->stype = NONE; /* checkpoint all for adaptive time step */
#if defined(PETSC_HAVE_REVOLVE)
    if (tjsch->use_online) tjsch->stype = REVOLVE_ONLINE; /* trick into online (for testing purpose only) */
#endif
    PetscCheckFalse(tjsch->stype != NONE && tjsch->max_cps_ram < 1 && tjsch->max_cps_disk < 1,PetscObjectComm((PetscObject)ts),PETSC_ERR_ARG_INCOMP,"The specified storage capacity is insufficient for one checkpoint, which is the minimum");
  }
  if (tjsch->stype >= CAMS_OFFLINE) {
#ifndef PETSC_HAVE_CAMS
    SETERRQ(PetscObjectComm((PetscObject)ts),PETSC_ERR_SUP,"CAMS is needed when there is not enough memory to checkpoint all time steps according to the user's settings, please reconfigure with the additional option --download-cams.");
#else
    CAMSCTX  *actx;
    PetscInt ns = 0;
    if (stack->solution_only) {
      offline_ca_create(tjsch->total_steps,tjsch->max_cps_ram);
    } else {
      CHKERRQ(TSGetStages(ts,&ns,PETSC_IGNORE));
      offline_cams_create(tjsch->total_steps,tjsch->max_units_ram,ns,ts->stifflyaccurate);
    }
    CHKERRQ(PetscNew(&actx));
    actx->lastcheckpointstep    = -1; /* -1 can trigger the initialization of CAMS */
    actx->lastcheckpointtype    = -1; /* -1 can trigger the initialization of CAMS */
    actx->endstep               = tjsch->total_steps;
    actx->num_units_avail       = tjsch->max_units_ram;
    actx->num_stages            = ns;
    tjsch->actx                 = actx;
#endif
  } else if (tjsch->stype > TWO_LEVEL_NOREVOLVE) {
#ifndef PETSC_HAVE_REVOLVE
    SETERRQ(PetscObjectComm((PetscObject)ts),PETSC_ERR_SUP,"revolve is needed when there is not enough memory to checkpoint all time steps according to the user's settings, please reconfigure with the additional option --download-revolve.");
#else
    PetscRevolveInt rfine,rsnaps,rsnaps2;

    switch (tjsch->stype) {
      case TWO_LEVEL_REVOLVE:
        CHKERRQ(PetscRevolveIntCast(tjsch->stride,&rfine));
        CHKERRQ(PetscRevolveIntCast(tjsch->max_cps_ram,&rsnaps));
        revolve_create_offline(rfine,rsnaps);
        break;
      case TWO_LEVEL_TWO_REVOLVE:
        diskblocks = tjsch->save_stack ? tjsch->max_cps_disk/(tjsch->max_cps_ram+1) : tjsch->max_cps_disk; /* The block size depends on whether the stack is saved. */
        diskstack->stacksize = diskblocks;
        CHKERRQ(PetscRevolveIntCast(tjsch->stride,&rfine));
        CHKERRQ(PetscRevolveIntCast(tjsch->max_cps_ram,&rsnaps));
        revolve_create_offline(rfine,rsnaps);
        CHKERRQ(PetscRevolveIntCast((tjsch->total_steps+tjsch->stride-1)/tjsch->stride,&rfine));
        CHKERRQ(PetscRevolveIntCast(diskblocks,&rsnaps));
        revolve2_create_offline(rfine,rsnaps);
        CHKERRQ(PetscNew(&rctx2));
        rctx2->snaps_in       = rsnaps;
        rctx2->reverseonestep = PETSC_FALSE;
        rctx2->check          = 0;
        rctx2->oldcapo        = 0;
        rctx2->capo           = 0;
        rctx2->info           = 2;
        rctx2->fine           = rfine;
        tjsch->rctx2          = rctx2;
        diskstack->top        = -1;
        CHKERRQ(PetscMalloc1(diskstack->stacksize,&diskstack->container));
        break;
      case REVOLVE_OFFLINE:
        CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rfine));
        CHKERRQ(PetscRevolveIntCast(tjsch->max_cps_ram,&rsnaps));
        revolve_create_offline(rfine,rsnaps);
        break;
      case REVOLVE_ONLINE:
        stack->stacksize = tjsch->max_cps_ram;
        CHKERRQ(PetscRevolveIntCast(tjsch->max_cps_ram,&rsnaps));
        revolve_create_online(rsnaps);
        break;
      case REVOLVE_MULTISTAGE:
        CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rfine));
        CHKERRQ(PetscRevolveIntCast(tjsch->max_cps_ram,&rsnaps));
        CHKERRQ(PetscRevolveIntCast(tjsch->max_cps_ram+tjsch->max_cps_disk,&rsnaps2));
        revolve_create_multistage(rfine,rsnaps2,rsnaps);
        break;
      default:
        break;
    }
    CHKERRQ(PetscNew(&rctx));
    CHKERRQ(PetscRevolveIntCast(tjsch->max_cps_ram,&rsnaps));
    rctx->snaps_in       = rsnaps; /* for theta methods snaps_in=2*max_cps_ram */
    rctx->reverseonestep = PETSC_FALSE;
    rctx->check          = 0;
    rctx->oldcapo        = 0;
    rctx->capo           = 0;
    rctx->info           = 2;
    if (tjsch->stride > 1) {
      CHKERRQ(PetscRevolveIntCast(tjsch->stride,&rfine));
    } else {
      CHKERRQ(PetscRevolveIntCast(tjsch->total_steps,&rfine));
    }
    rctx->fine           = rfine;
    tjsch->rctx          = rctx;
    if (tjsch->stype == REVOLVE_ONLINE) rctx->fine = -1;
#endif
  } else {
    if (tjsch->stype == TWO_LEVEL_NOREVOLVE) stack->stacksize = tjsch->stride-1; /* need tjsch->stride-1 at most */
    if (tjsch->stype == NONE) {
      if (fixedtimestep) stack->stacksize = stack->solution_only ? tjsch->total_steps : tjsch->total_steps-1;
      else { /* adaptive time step */
        /* if max_cps_ram is not specified, use maximal allowed number of steps for stack size */
        if (tjsch->max_cps_ram == -1) stack->stacksize = ts->max_steps < PETSC_MAX_INT ? ts->max_steps : 10000;
        tjsch->total_steps = stack->solution_only ? stack->stacksize : stack->stacksize+1; /* will be updated as time integration advances */
      }
    }
  }

  if ((tjsch->stype >= TWO_LEVEL_NOREVOLVE && tjsch->stype < REVOLVE_OFFLINE) || tjsch->stype == REVOLVE_MULTISTAGE) { /* these types need to use disk */
    CHKERRQ(TSTrajectorySetUp_Basic(tj,ts));
  }

  stack->stacksize = PetscMax(stack->stacksize,1);
  tjsch->recompute = PETSC_FALSE;
  CHKERRQ(StackInit(stack,stack->stacksize,numY));
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryReset_Memory(TSTrajectory tj)
{
#if defined (PETSC_HAVE_REVOLVE) || defined (PETSC_HAVE_CAMS)
  TJScheduler *tjsch = (TJScheduler*)tj->data;
#endif

  PetscFunctionBegin;
#if defined(PETSC_HAVE_REVOLVE)
  if (tjsch->stype > TWO_LEVEL_NOREVOLVE) {
    revolve_reset();
    if (tjsch->stype == TWO_LEVEL_TWO_REVOLVE) {
      revolve2_reset();
      CHKERRQ(PetscFree(tjsch->diskstack.container));
    }
  }
  if (tjsch->stype > TWO_LEVEL_NOREVOLVE) {
    CHKERRQ(PetscFree(tjsch->rctx));
    CHKERRQ(PetscFree(tjsch->rctx2));
  }
#endif
#if defined(PETSC_HAVE_CAMS)
  if (tjsch->stype == CAMS_OFFLINE) {
    if (tjsch->stack.solution_only) offline_ca_destroy();
    else offline_ca_destroy();
    CHKERRQ(PetscFree(tjsch->actx));
  }
#endif
  PetscFunctionReturn(0);
}

static PetscErrorCode TSTrajectoryDestroy_Memory(TSTrajectory tj)
{
  TJScheduler    *tjsch = (TJScheduler*)tj->data;

  PetscFunctionBegin;
  CHKERRQ(StackDestroy(&tjsch->stack));
  CHKERRQ(PetscViewerDestroy(&tjsch->viewer));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectorySetMaxCpsRAM_C",NULL));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectorySetMaxCpsDisk_C",NULL));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectorySetMaxUnitsRAM_C",NULL));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectorySetMaxUnitsDisk_C",NULL));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectoryMemorySetType_C",NULL));
  CHKERRQ(PetscFree(tjsch));
  PetscFunctionReturn(0);
}

/*MC
      TSTRAJECTORYMEMORY - Stores each solution of the ODE/ADE in memory

  Level: intermediate

.seealso:  TSTrajectoryCreate(), TS, TSTrajectorySetType()

M*/
PETSC_EXTERN PetscErrorCode TSTrajectoryCreate_Memory(TSTrajectory tj,TS ts)
{
  TJScheduler    *tjsch;

  PetscFunctionBegin;
  tj->ops->set            = TSTrajectorySet_Memory;
  tj->ops->get            = TSTrajectoryGet_Memory;
  tj->ops->setup          = TSTrajectorySetUp_Memory;
  tj->ops->setfromoptions = TSTrajectorySetFromOptions_Memory;
  tj->ops->reset          = TSTrajectoryReset_Memory;
  tj->ops->destroy        = TSTrajectoryDestroy_Memory;

  CHKERRQ(PetscNew(&tjsch));
  tjsch->stype        = NONE;
  tjsch->max_cps_ram  = -1; /* -1 indicates that it is not set */
  tjsch->max_cps_disk = -1; /* -1 indicates that it is not set */
  tjsch->stride       = 0; /* if not zero, two-level checkpointing will be used */
#if defined(PETSC_HAVE_REVOLVE)
  tjsch->use_online   = PETSC_FALSE;
#endif
  tjsch->save_stack   = PETSC_TRUE;

  tjsch->stack.solution_only = tj->solution_only;
  CHKERRQ(PetscViewerCreate(PetscObjectComm((PetscObject)tj),&tjsch->viewer));
  CHKERRQ(PetscViewerSetType(tjsch->viewer,PETSCVIEWERBINARY));
  CHKERRQ(PetscViewerPushFormat(tjsch->viewer,PETSC_VIEWER_NATIVE));
  CHKERRQ(PetscViewerFileSetMode(tjsch->viewer,FILE_MODE_WRITE));

  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectorySetMaxCpsRAM_C",TSTrajectorySetMaxCpsRAM_Memory));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectorySetMaxCpsDisk_C",TSTrajectorySetMaxCpsDisk_Memory));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectorySetMaxUnitsRAM_C",TSTrajectorySetMaxUnitsRAM_Memory));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectorySetMaxUnitsDisk_C",TSTrajectorySetMaxUnitsDisk_Memory));
  CHKERRQ(PetscObjectComposeFunction((PetscObject)tj,"TSTrajectoryMemorySetType_C",TSTrajectoryMemorySetType_Memory));
  tj->data = tjsch;
  PetscFunctionReturn(0);
}