/// Implementation of the immutable pass providing access to the model and
/// taking care of its deserialization on the IR.

//
// This file is distributed under the MIT License. See LICENSE.md for details.
//

// LLVM includes
#include "llvm/IR/Metadata.h"
#include "llvm/IR/Module.h"
#include "llvm/Pass.h"

// Local libraries includes
#include "revng/Model/LoadModelPass.h"
#include "revng/TupleTree/TupleTree.h"

using namespace llvm;

char LoadModelWrapperPass::ID;

AnalysisKey LoadModelAnalysis::Key;

template<typename T>
using RP = RegisterPass<T>;

static RP<LoadModelWrapperPass>
  X("load-model", "Deserialize the model", true, true);

using namespace llvm::cl;

bool hasModel(const llvm::Module &M) {
  NamedMDNode *NamedMD = M.getNamedMetadata(ModelMetadataName);
  return NamedMD and NamedMD->getNumOperands();
}

TupleTree<model::Binary> loadModel(const llvm::Module &M) {
  revng_check(hasModel(M));

  NamedMDNode *NamedMD = M.getNamedMetadata(ModelMetadataName);
  auto *Tuple = cast<MDTuple>(NamedMD->getOperand(0));
  revng_check(Tuple->getNumOperands());

  Metadata *MD = Tuple->getOperand(0).get();
  StringRef YAMLString = cast<MDString>(MD)->getString();

  return cantFail(TupleTree<model::Binary>::fromString(YAMLString));
}

bool LoadModelWrapperPass::doInitialization(Module &M) {
  return false;
}

bool LoadModelWrapperPass::doFinalization(Module &M) {
  return false;
}

ModelWrapper LoadModelAnalysis::run(Module &M, ModuleAnalysisManager &) {
  return Wrapper;
}

ModelWrapper LoadModelAnalysis::run(Function &F, FunctionAnalysisManager &) {
  return Wrapper;
}

const TupleTree<model::Binary> &ModelWrapper::getReadOnlyModel() const {
  auto Result = [](auto &Model) -> const TupleTree<model::Binary> & {
    using TupleTreeT = std::remove_pointer_t<std::decay_t<decltype(Model)>>;
    if constexpr (not std::is_const_v<TupleTreeT>)
      Model->enableReferenceCaching();
    return *std::as_const(Model);
  };
  return std::visit(Result, TheBinary);
}

TupleTree<model::Binary> &ModelWrapper::getWriteableModel() {
  HasChanged = true;
  auto Result = [](auto &Model) -> TupleTree<model::Binary> & {
    using TupleTreeT = std::remove_pointer_t<std::decay_t<decltype(Model)>>;
    if constexpr (std::is_const_v<TupleTreeT>) {
      revng_abort("A writeable model has been requested, but the wrapper has "
                  "a reference to a const model");
    } else {
      Model->disableReferenceCaching();
      return *Model;
    }
  };
  return std::visit(Result, TheBinary);
}