/* Copyright (c) 2013 Microsoft Corporation. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Author: Leonardo de Moura */ #include #include #include #include #include "name.h" #include "debug.h" #include "rc.h" #include "hash.h" #include "trace.h" namespace lean { constexpr char const * anonymous_str = "[anonymous]"; /** \brief Actual implementation of hierarchical names. */ struct name::imp { MK_LEAN_RC() bool m_is_string; unsigned m_hash; imp * m_prefix; union { char * m_str; unsigned m_k; }; void dealloc() { imp * curr = this; while (true) { lean_assert(curr->get_rc() == 0); imp * p = curr->m_prefix; if (curr->m_is_string) delete[] reinterpret_cast(curr); else delete curr; curr = p; if (!curr || !curr->dec_ref_core()) break; } } imp(bool s, imp * p):m_rc(1), m_is_string(s), m_hash(0), m_prefix(p) { if (p) p->inc_ref(); } static void display_core(std::ostream & out, char const * sep, imp * p) { lean_assert(p != nullptr); if (p->m_prefix) { display_core(out, sep, p->m_prefix); out << sep; } if (p->m_is_string) out << p->m_str; else out << p->m_k; } static void display(std::ostream & out, char const * sep, imp * p) { if (p == nullptr) out << anonymous_str; else display_core(out, sep, p); } friend void copy_limbs(imp * p, std::vector & limbs) { limbs.clear(); while (p != nullptr) { limbs.push_back(p); p = p->m_prefix; } std::reverse(limbs.begin(), limbs.end()); } }; name::name(imp * p) { m_ptr = p; if (m_ptr) m_ptr->inc_ref(); } name::name() { m_ptr = nullptr; } name::name(name const & prefix, char const * name) { size_t sz = strlen(name); lean_assert(sz < 1u<<31); char * mem = new char[sizeof(imp) + sz + 1]; m_ptr = new (mem) imp(true, prefix.m_ptr); std::memcpy(mem + sizeof(imp), name, sz + 1); m_ptr->m_str = mem + sizeof(imp); if (m_ptr->m_prefix) m_ptr->m_hash = hash_str(sz, name, m_ptr->m_prefix->m_hash); else m_ptr->m_hash = hash_str(sz, name, 0); } name::name(name const & prefix, unsigned k) { m_ptr = new imp(false, prefix.m_ptr); m_ptr->m_k = k; if (m_ptr->m_prefix) m_ptr->m_hash = ::lean::hash(m_ptr->m_prefix->m_hash, k); else m_ptr->m_hash = k; } name::name(char const * n):name(name(), n) { } name::name(unsigned k):name(name(), k) { } name::name(name const & other):m_ptr(other.m_ptr) { if (m_ptr) m_ptr->inc_ref(); } name::name(name && other):m_ptr(other.m_ptr) { other.m_ptr = nullptr; } name::~name() { if (m_ptr) m_ptr->dec_ref(); } name & name::operator=(name const & other) { LEAN_COPY_REF(name, other); } name & name::operator=(name && other) { LEAN_MOVE_REF(name, other); } name_kind name::kind() const { if (m_ptr == nullptr) return name_kind::ANONYMOUS; else return m_ptr->m_is_string ? name_kind::STRING : name_kind::NUMERAL; } unsigned name::get_numeral() const { lean_assert(is_numeral()); return m_ptr->m_k; } char const * name::get_string() const { lean_assert(is_string()); return m_ptr->m_str; } bool operator==(name const & a, name const & b) { name::imp * i1 = a.m_ptr; name::imp * i2 = b.m_ptr; while (true) { if (i1 == i2) return true; if ((i1 == nullptr) != (i2 == nullptr)) return false; if (i1->m_hash != i2->m_hash) return false; lean_assert(i1 != nullptr); lean_assert(i2 != nullptr); if (i1->m_is_string != i2->m_is_string) return false; if (i1->m_is_string) { if (strcmp(i1->m_str, i2->m_str) != 0) return false; } else { if (i1->m_k != i2->m_k) return false; } i1 = i1->m_prefix; i2 = i2->m_prefix; } } bool operator==(name const & a, char const * b) { return a.m_ptr->m_is_string && strcmp(a.m_ptr->m_str, b) == 0; } int cmp(name::imp * i1, name::imp * i2) { static thread_local std::vector limbs1; static thread_local std::vector limbs2; copy_limbs(i1, limbs1); copy_limbs(i2, limbs2); auto it1 = limbs1.begin(); auto it2 = limbs2.begin(); for (; it1 != limbs1.end() && it2 != limbs2.end(); ++it1, ++it2) { i1 = *it1; i2 = *it2; if (i1->m_is_string != i2->m_is_string) return i1->m_is_string ? 1 : -1; if (i1->m_is_string) { int c = strcmp(i1->m_str, i2->m_str); if (c != 0) return c; } else if (i1->m_k != i2->m_k) { return i1->m_k < i2->m_k ? -1 : 1; } } if (it1 == limbs1.end() && it2 == limbs2.end()) return 0; else return it1 == limbs1.end() ? -1 : 1; } bool name::is_atomic() const { return m_ptr == nullptr || m_ptr->m_prefix == nullptr; } name name::get_prefix() const { lean_assert(!is_atomic()); return name(m_ptr->m_prefix); } static unsigned num_digits(unsigned k) { if (k == 0) return 1; int r = 0; while (k != 0) { k /= 10; r++; } return r; } size_t name::size(char const * sep) const { if (m_ptr == nullptr) { return strlen(anonymous_str); } else { imp * i = m_ptr; size_t sep_sz = strlen(sep); size_t r = 0; while (true) { if (i->m_is_string) { r += strlen(i->m_str); } else { r += num_digits(i->m_k); } if (i->m_prefix) { r += sep_sz; i = i->m_prefix; } else { break; } } return r; } } unsigned name::hash() const { return m_ptr ? m_ptr->m_hash : 11; } std::string name::to_string(char const * sep) const { std::ostringstream s; imp::display(s, sep, m_ptr); return s.str(); } std::ostream & operator<<(std::ostream & out, name const & n) { name::imp::display(out, default_name_separator, n.m_ptr); return out; } name::sep::sep(name const & n, char const * s):m_name(n), m_sep(s) {} std::ostream & operator<<(std::ostream & out, name::sep const & s) { name::imp::display(out, s.m_sep, s.m_name.m_ptr); return out; } } void print(lean::name const & n) { std::cout << n << std::endl; }