label.hh

// This file is a part of Aurelia.
// Copyright (C) 2010  Valentin David
// Copyright (C) 2010  University of Bergen
//
// This program 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.
//
// This program 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 this program.  If not, see <http://www.gnu.org/licenses/>.

#ifndef __LABEL_HH
# define __LABEL_HH
# include <cassert>
# include "frame.hh"
# include "../streams/buf_stream.hh"
# include "../hash/hash_addr.hh"

namespace aurelia {
  namespace llstack {

struct node;
struct r_t;

struct label {
private:
  std::function<void(r_t&, const frame&, stream&, const node&)> fun;
  size_t type;

public:
  template <typename T>
  label(const T& in): fun(in), type((size_t)&typeid(T)) {}

  label(const label& other): fun(other.fun), type(other.type) {
  }

  label(label&& other): fun(std::move(other.fun)), type(other.type) {}

  label() {
  }

  void call(r_t& R, const frame& f, stream& s, const node& n) const {
    fun(R, f, s, n);
  }

  unsigned hash() const {
    return std::hash<size_t>()(type);
  }

  label& operator=(const label& other) {
    return *this = label(other);
  }

  label& operator=(label&& other) {
    std::swap(fun, other.fun);
    std::swap(type, other.type);
    return *this;
  }

  bool operator==(const label& other) const {
    return (type == other.type);
  }
};

  }
}

#endif