jacobianReuseTape.hpp

/*
 * CoDiPack, a Code Differentiation Package
 *
 * Copyright (C) 2015-2024 Chair for Scientific Computing (SciComp), University of Kaiserslautern-Landau
 * Homepage: http://scicomp.rptu.de
 * Contact:  Prof. Nicolas R. Gauger (codi@scicomp.uni-kl.de)
 *
 * Lead developers: Max Sagebaum, Johannes Blühdorn (SciComp, University of Kaiserslautern-Landau)
 *
 * This file is part of CoDiPack (http://scicomp.rptu.de/software/codi).
 *
 * CoDiPack is free software: you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation, either version 3 of the
 * License, or (at your option) any later version.
 *
 * CoDiPack is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty
 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 *
 * See the GNU General Public License for more details.
 * You should have received a copy of the GNU
 * General Public License along with CoDiPack.
 * If not, see <http://www.gnu.org/licenses/>.
 *
 * For other licensing options please contact us.
 *
 * Authors:
 *  - SciComp, University of Kaiserslautern-Landau:
 *    - Max Sagebaum
 *    - Johannes Blühdorn
 *    - Former members:
 *      - Tim Albring
 */
#pragma once
 
#include <algorithm>
#include <type_traits>
 
#include "../config.h"
#include "../expressions/lhsExpressionInterface.hpp"
#include "../expressions/logic/compileTimeTraversalLogic.hpp"
#include "../expressions/logic/traversalLogic.hpp"
#include "../misc/macros.hpp"
#include "../traits/expressionTraits.hpp"
#include "data/chunk.hpp"
#include "indices/indexManagerInterface.hpp"
#include "interfaces/editingTapeInterface.hpp"
#include "interfaces/reverseTapeInterface.hpp"
#include "jacobianBaseTape.hpp"
 
namespace codi {
 
  template<typename T_TapeTypes>
  struct JacobianReuseTape
      : public JacobianBaseTape<T_TapeTypes, JacobianReuseTape<T_TapeTypes>>,
        public EditingTapeInterface<typename JacobianBaseTape<T_TapeTypes, JacobianReuseTape<T_TapeTypes>>::Position> {
    public:
 
      using TapeTypes = CODI_DD(T_TapeTypes,
                                CODI_T(JacobianTapeTypes<double, double, IndexManagerInterface<int>,
                                                         DefaultChunkedData>));  
 
      using Base = JacobianBaseTape<T_TapeTypes, JacobianReuseTape>;  
      friend Base;  
 
      using Real = typename TapeTypes::Real;                    
      using Gradient = typename TapeTypes::Gradient;            
      using IndexManager = typename TapeTypes::IndexManager;    
      using Identifier = typename TapeTypes::Identifier;        
      using Position = typename Base::Position;                 
      using StatementData = typename TapeTypes::StatementData;  
 
      CODI_STATIC_ASSERT(!IndexManager::IsLinear, "This class requires an index manager with a reuse scheme.");
 
      JacobianReuseTape() : Base() {}
 
      /*******************************************************************************/
 
      using Base::clearAdjoints;
 
      void clearAdjoints(Position const& start, Position const& end,
                         AdjointsManagement adjointsManagement = AdjointsManagement::Automatic) {
        if (AdjointsManagement::Automatic == adjointsManagement) {
          this->adjoints.beginUse();
        }
 
        Identifier adjointsSize = (Identifier)this->adjoints.size();
 
        auto clearFunc = [&adjointsSize, this](Identifier* index, Config::ArgumentSize* stmtSize) {
          CODI_UNUSED(stmtSize);
 
          if (*index < adjointsSize) {
            this->adjoints[*index] = Gradient();
          }
        };
 
        using StmtPosition = typename StatementData::Position;
        StmtPosition startStmt = this->llfByteData.template extractPosition<StmtPosition>(start);
        StmtPosition endStmt = this->llfByteData.template extractPosition<StmtPosition>(end);
 
        this->statementData.forEachReverse(startStmt, endStmt, clearFunc);
 
        if (AdjointsManagement::Automatic == adjointsManagement) {
          this->adjoints.endUse();
        }
      }
 
 
    protected:
 
      /*******************************************************************************/
 
      CODI_INLINE void pushStmtData(Identifier const& index, Config::ArgumentSize const& numberOfArguments) {
        this->statementData.pushData(index, numberOfArguments);
      }
 
      template<typename Adjoint>
      CODI_INLINE static void internalEvaluateForward_EvalStatements(
          /* data from call */
          JacobianReuseTape& tape, Adjoint* adjointVector,
          /* data from low level function byte data vector */
          size_t& curLLFByteDataPos, size_t const& endLLFByteDataPos, char* dataPtr,
          /* data from low level function info data vector */
          size_t& curLLFInfoDataPos, size_t const& endLLFInfoDataPos, Config::LowLevelFunctionToken* const tokenPtr,
          Config::LowLevelFunctionDataSize* const dataSizePtr,
          /* data from jacobian vector */
          size_t& curJacobianPos, size_t const& endJacobianPos, Real const* const rhsJacobians,
          Identifier const* const rhsIdentifiers,
          /* data from statement vector */
          size_t& curStmtPos, size_t const& endStmtPos, Identifier const* const lhsIdentifiers,
          Config::ArgumentSize const* const numberOfJacobians) {
        CODI_UNUSED(endJacobianPos, endLLFByteDataPos, endLLFInfoDataPos);
 
        typename Base::template VectorAccess<Adjoint> vectorAccess(adjointVector);
 
        while (curStmtPos < endStmtPos) CODI_Likely {
          Config::ArgumentSize const argsSize = numberOfJacobians[curStmtPos];
 
          if (Config::StatementLowLevelFunctionTag == argsSize) CODI_Unlikely {
            Base::template callLowLevelFunction<LowLevelFunctionEntryCallKind::Forward>(
                tape, true, curLLFByteDataPos, dataPtr, curLLFInfoDataPos, tokenPtr, dataSizePtr, &vectorAccess);
          } else CODI_Likely {
            Adjoint lhsAdjoint = Adjoint();
            Base::incrementTangents(adjointVector, lhsAdjoint, argsSize, curJacobianPos, rhsJacobians, rhsIdentifiers);
 
            adjointVector[lhsIdentifiers[curStmtPos]] = lhsAdjoint;
 
            EventSystem<JacobianReuseTape>::notifyStatementEvaluateListeners(
                tape, lhsIdentifiers[curStmtPos], GradientTraits::dim<Adjoint>(),
                GradientTraits::toArray(lhsAdjoint).data());
          }
 
          curStmtPos += 1;
        }
      }
 
      template<typename Adjoint>
      CODI_INLINE static void internalEvaluateReverse_EvalStatements(
          /* data from call */
          JacobianReuseTape& tape, Adjoint* adjointVector,
          /* data from low level function byte data vector */
          size_t& curLLFByteDataPos, size_t const& endLLFByteDataPos, char* dataPtr,
          /* data from low level function info data vector */
          size_t& curLLFInfoDataPos, size_t const& endLLFInfoDataPos, Config::LowLevelFunctionToken* const tokenPtr,
          Config::LowLevelFunctionDataSize* const dataSizePtr,
          /* data from jacobianData */
          size_t& curJacobianPos, size_t const& endJacobianPos, Real const* const rhsJacobians,
          Identifier const* const rhsIdentifiers,
          /* data from statementData */
          size_t& curStmtPos, size_t const& endStmtPos, Identifier const* const lhsIdentifiers,
          Config::ArgumentSize const* const numberOfJacobians) {
        CODI_UNUSED(endJacobianPos, endLLFByteDataPos, endLLFInfoDataPos);
 
        typename Base::template VectorAccess<Adjoint> vectorAccess(adjointVector);
 
        while (curStmtPos > endStmtPos) CODI_Likely {
          curStmtPos -= 1;
 
          Config::ArgumentSize const argsSize = numberOfJacobians[curStmtPos];
 
          if (Config::StatementLowLevelFunctionTag == argsSize) CODI_Unlikely {
            Base::template callLowLevelFunction<LowLevelFunctionEntryCallKind::Reverse>(
                tape, false, curLLFByteDataPos, dataPtr, curLLFInfoDataPos, tokenPtr, dataSizePtr, &vectorAccess);
          } else CODI_Likely {
            Adjoint const lhsAdjoint = adjointVector[lhsIdentifiers[curStmtPos]];
 
            EventSystem<JacobianReuseTape>::notifyStatementEvaluateListeners(
                tape, lhsIdentifiers[curStmtPos], GradientTraits::dim<Adjoint>(),
                GradientTraits::toArray(lhsAdjoint).data());
 
            adjointVector[lhsIdentifiers[curStmtPos]] = Adjoint();
            Base::incrementAdjoints(adjointVector, lhsAdjoint, argsSize, curJacobianPos, rhsJacobians, rhsIdentifiers);
          }
        }
      }
 
 
    public:
 
      /*******************************************************************************/
 
      CODI_INLINE void erase(Position const& start, Position const& end) {
        JacobianReuseTape emptyTape;
        erase(start, end, emptyTape);
      }
 
      // clang-format off
      // clang-format on
      CODI_INLINE void erase(Position const& start, Position const& end, JacobianReuseTape& emptyTape) {
        // Store the tail after the part to be erased in the helper tape.
        emptyTape.append(*this, end, this->getPosition());
        // Reset the tape to before the erased part and re-append the tail. This accounts for external function position
        // correction.
        this->resetTo(start);
        this->append(emptyTape, emptyTape.getZeroPosition(), emptyTape.getPosition());
        emptyTape.reset();
      }
 
      CODI_INLINE void append(JacobianReuseTape& srcTape, Position const& start, Position const& end) {
        srcTape.llfByteData.evaluateForward(start, end, JacobianReuseTape::internalAppend, this);
      }
 
 
    private:
 
      static CODI_INLINE void internalAppend(
          /* data from call */
          JacobianReuseTape* dstTape,
          /* data from low level function byte data vector */
          size_t& curLLFByteDataPos, size_t const& endLLFByteDataPos, char* dataPtr,
          /* data from low level function info data vector */
          size_t& curLLFInfoDataPos, size_t const& endLLFInfoDataPos, Config::LowLevelFunctionToken* const tokenPtr,
          Config::LowLevelFunctionDataSize* const dataSizePtr,
          /* data from jacobianData */
          size_t& curJacobianPos, size_t const& endJacobianPos, Real const* const rhsJacobians,
          Identifier const* const rhsIdentifiers,
          /* data from statementData */
          size_t& curStmtPos, size_t const& endStmtPos, Identifier const* const lhsIdentifiers,
          Config::ArgumentSize const* const numberOfJacobians) {
        CODI_UNUSED(endLLFByteDataPos, endLLFInfoDataPos, endJacobianPos);
 
        while (curStmtPos < endStmtPos) {
          Config::ArgumentSize const argsSize = numberOfJacobians[curStmtPos];
          if (Config::StatementLowLevelFunctionTag == argsSize) CODI_Unlikely {
            Config::LowLevelFunctionToken token = tokenPtr[curLLFInfoDataPos];
            size_t dataSize = dataSizePtr[curLLFInfoDataPos];
 
            // Create the store on the new tape.
            ByteDataView dstDataStore = {};
            dstTape->pushLowLevelFunction(token, dataSize, dstDataStore);
 
            // Copy the data.
            dstDataStore.write(&dataPtr[curLLFByteDataPos], dataSize);
 
            curLLFInfoDataPos += 1;
            curLLFByteDataPos += dataSize;
          } else CODI_Likely {
            // Manual statement push.
            dstTape->statementData.reserveItems(1);
            dstTape->jacobianData.reserveItems(numberOfJacobians[curStmtPos]);
 
            dstTape->pushStmtData(lhsIdentifiers[curStmtPos], numberOfJacobians[curStmtPos]);
            size_t curJacobianEnd = curJacobianPos + numberOfJacobians[curStmtPos];
 
            while (curJacobianPos < curJacobianEnd) {
              dstTape->jacobianData.pushData(rhsJacobians[curJacobianPos], rhsIdentifiers[curJacobianPos]);
              ++curJacobianPos;
            }
          }
 
          ++curStmtPos;
        }
      }
  };
}