solver.h

// This file if part of the llir-opt project.
// Licensing information can be found in the LICENSE file.
// (C) 2018 Nandor Licker. All rights reserved.
 
#pragma once
 
#include <unordered_map>
#include <unordered_set>
#include <vector>
 
#include "core/adt/queue.h"
#include "passes/pta/graph.h"
#include "passes/pta/scc.h"
 
class Atom;
class Inst;
class Node;
class Global;
 
class RootNode;
 
 
 
class ConstraintSolver final {
public:
  ConstraintSolver();
  ~ConstraintSolver();
 
  Node *Load(Node *ptr);
 
  void Subset(Node *from, Node *to);
 
  RootNode *Root();
 
  Node *Empty();
 
  void Store(Node *ptr, Node *val)
  {
    Subset(val, Load(ptr));
  }
 
  Node *Alloc(const std::vector<Inst *> &context)
  {
    auto *set = Set();
    set->AddNode(Set()->GetID());
    return set;
  }
 
  RootNode *Lookup(Global *global);
 
  RootNode *Root(SetNode *set);
  RootNode *Anchor(Node *node);
  DerefNode *Deref(SetNode *set);
  SetNode *Set();
 
  ID<Func *> Map(Func *func);
  Func *Map(const ID<Func *> &id);
  ID<Extern *> Map(Extern *ext);
  Extern *Map(const ID<Extern *> &id);
  SetNode *Map(const ID<SetNode *> &id);
 
  void Solve();
 
private:
  friend class RootNode;
 
  Graph graph_;
 
  std::unordered_map<Func *, ID<Func *>> funcToID_;
  std::vector<Func *> idToFunc_;
  std::unordered_map<Extern *, ID<Extern *>> extToID_;
  std::vector<Extern *> idToExt_;
 
  SCCSolver scc_;
  Queue<SetNode *> queue_;
};