X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Farchive.cpp;h=c0e84acd0a7809a120f6291d463f75906deb8b9d;hp=d462584ae3084e76b93a0d11c5c22f8eca906381;hb=26840ecc367d9f9dd4e3758233be1bdd3563cd8a;hpb=67467d256b44f5e08498ca81c946d9ffaa25d1e2 diff --git a/ginac/archive.cpp b/ginac/archive.cpp index d462584a..c0e84acd 100644 --- a/ginac/archive.cpp +++ b/ginac/archive.cpp @@ -3,7 +3,7 @@ * Archiving of GiNaC expressions. */ /* - * GiNaC Copyright (C) 1999-2008 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2018 Johannes Gutenberg University Mainz, Germany * * 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 @@ -20,15 +20,17 @@ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ -#include -#include - #include "archive.h" #include "registrar.h" #include "ex.h" #include "lst.h" +#ifdef HAVE_CONFIG_H #include "config.h" -#include "tostring.h" +#endif +#include "version.h" + +#include +#include namespace GiNaC { @@ -52,7 +54,7 @@ archive_node_id archive::add_node(const archive_node &n) { // Look if expression is known to be in some node already. if (n.has_ex()) { - mapit i = exprtable.find(n.get_ex()); + auto i = exprtable.find(n.get_ex()); if (i != exprtable.end()) return i->second; nodes.push_back(n); @@ -81,7 +83,7 @@ ex archive::unarchive_ex(const lst &sym_lst, const char *name) const // Find root node std::string name_string = name; archive_atom id = atomize(name_string); - std::vector::const_iterator i = exprs.begin(), iend = exprs.end(); + auto i = exprs.begin(), iend = exprs.end(); while (i != iend) { if (i->name == id) goto found; @@ -218,7 +220,7 @@ std::ostream &operator<<(std::ostream &os, const archive &ar) os.put('A'); os.put('R'); os.put('C'); - write_unsigned(os, ARCHIVE_VERSION); + write_unsigned(os, GINACLIB_ARCHIVE_VERSION); // Write atoms unsigned num_atoms = ar.atoms.size(); @@ -265,9 +267,11 @@ std::istream &operator>>(std::istream &is, archive &ar) is.get(c1); is.get(c2); is.get(c3); is.get(c4); if (c1 != 'G' || c2 != 'A' || c3 != 'R' || c4 != 'C') throw (std::runtime_error("not a GiNaC archive (signature not found)")); + constexpr unsigned max_version = GINACLIB_ARCHIVE_VERSION; + constexpr unsigned min_version = GINACLIB_ARCHIVE_VERSION - GINACLIB_ARCHIVE_AGE; unsigned version = read_unsigned(is); - if (version > ARCHIVE_VERSION || version < ARCHIVE_VERSION - ARCHIVE_AGE) - throw (std::runtime_error("archive version " + ToString(version) + " cannot be read by this GiNaC library (which supports versions " + ToString(ARCHIVE_VERSION-ARCHIVE_AGE) + " thru " + ToString(ARCHIVE_VERSION))); + if ((version > max_version) || (version < min_version)) + throw (std::runtime_error("archive version " + std::to_string(version) + " cannot be read by this GiNaC library (which supports versions " + std::to_string(min_version) + " thru " + std::to_string(max_version))); // Read atoms unsigned num_atoms = read_unsigned(is); @@ -315,7 +319,7 @@ archive_atom archive::atomize(const std::string &s) const const std::string &archive::unatomize(archive_atom id) const { if (id >= atoms.size()) - throw (std::range_error("archive::unatomizee(): atom ID out of range")); + throw (std::range_error("archive::unatomize(): atom ID out of range")); return atoms[id]; } @@ -356,7 +360,7 @@ archive_node::archive_node_cit archive_node::find_first(const std::string &name) const { archive_atom name_atom = a.atomize(name); - for (archive_node_cit i=props.begin(); i!=props.end(); ++i) + for (auto i=props.begin(); i!=props.end(); ++i) if (i->name == name_atom) return i; return props.end();; @@ -366,7 +370,7 @@ archive_node::archive_node_cit archive_node::find_last(const std::string &name) const { archive_atom name_atom = a.atomize(name); - for (archive_node_cit i=props.end(); i!=props.begin();) { + for (auto i=props.end(); i!=props.begin();) { --i; if (i->name == name_atom) return i; @@ -400,7 +404,7 @@ void archive_node::add_ex(const std::string &name, const ex &value) bool archive_node::find_bool(const std::string &name, bool &ret, unsigned index) const { archive_atom name_atom = a.atomize(name); - archive_node_cit i = props.begin(), iend = props.end(); + auto i = props.begin(), iend = props.end(); unsigned found_index = 0; while (i != iend) { if (i->type == PTYPE_BOOL && i->name == name_atom) { @@ -418,7 +422,7 @@ bool archive_node::find_bool(const std::string &name, bool &ret, unsigned index) bool archive_node::find_unsigned(const std::string &name, unsigned &ret, unsigned index) const { archive_atom name_atom = a.atomize(name); - archive_node_cit i = props.begin(), iend = props.end(); + auto i = props.begin(), iend = props.end(); unsigned found_index = 0; while (i != iend) { if (i->type == PTYPE_UNSIGNED && i->name == name_atom) { @@ -436,7 +440,7 @@ bool archive_node::find_unsigned(const std::string &name, unsigned &ret, unsigne bool archive_node::find_string(const std::string &name, std::string &ret, unsigned index) const { archive_atom name_atom = a.atomize(name); - archive_node_cit i = props.begin(), iend = props.end(); + auto i = props.begin(), iend = props.end(); unsigned found_index = 0; while (i != iend) { if (i->type == PTYPE_STRING && i->name == name_atom) { @@ -460,7 +464,7 @@ void archive_node::find_ex_by_loc(archive_node_cit loc, ex &ret, lst &sym_lst) bool archive_node::find_ex(const std::string &name, ex &ret, lst &sym_lst, unsigned index) const { archive_atom name_atom = a.atomize(name); - archive_node_cit i = props.begin(), iend = props.end(); + auto i = props.begin(), iend = props.end(); unsigned found_index = 0; while (i != iend) { if (i->type == PTYPE_NODE && i->name == name_atom) { @@ -478,7 +482,7 @@ bool archive_node::find_ex(const std::string &name, ex &ret, lst &sym_lst, unsig const archive_node &archive_node::find_ex_node(const std::string &name, unsigned index) const { archive_atom name_atom = a.atomize(name); - archive_node_cit i = props.begin(), iend = props.end(); + auto i = props.begin(), iend = props.end(); unsigned found_index = 0; while (i != iend) { if (i->type == PTYPE_NODE && i->name == name_atom) { @@ -495,12 +499,12 @@ const archive_node &archive_node::find_ex_node(const std::string &name, unsigned void archive_node::get_properties(propinfovector &v) const { v.clear(); - archive_node_cit i = props.begin(), iend = props.end(); + auto i = props.begin(), iend = props.end(); while (i != iend) { property_type type = i->type; std::string name = a.unatomize(i->name); - propinfovector::iterator a = v.begin(), aend = v.end(); + auto a = v.begin(), aend = v.end(); bool found = false; while (a != aend) { if (a->type == type && a->name == name) { @@ -516,6 +520,12 @@ void archive_node::get_properties(propinfovector &v) const } } +static synthesize_func find_factory_fcn(const std::string& name) +{ + static unarchive_table_t the_table; + synthesize_func ret = the_table.find(name); + return ret; +} /** Convert archive node to GiNaC expression. */ ex archive_node::unarchive(lst &sym_lst) const @@ -528,14 +538,50 @@ ex archive_node::unarchive(lst &sym_lst) const std::string class_name; if (!find_string("class", class_name)) throw (std::runtime_error("archive node contains no class name")); - unarch_func f = find_unarch_func(class_name); // Call instantiation function - e = f(*this, sym_lst); + synthesize_func factory_fcn = find_factory_fcn(class_name); + ptr obj(factory_fcn()); + obj->setflag(status_flags::dynallocated); + obj->read_archive(*this, sym_lst); + e = ex(*obj); has_expression = true; return e; } +int unarchive_table_t::usecount = 0; +unarchive_map_t* unarchive_table_t::unarch_map = nullptr; + +unarchive_table_t::unarchive_table_t() +{ + if (usecount == 0) + unarch_map = new unarchive_map_t(); + ++usecount; +} + +synthesize_func unarchive_table_t::find(const std::string& classname) const +{ + unarchive_map_t::const_iterator i = unarch_map->find(classname); + if (i != unarch_map->end()) + return i->second; + throw std::runtime_error(std::string("no unarchiving function for \"") + + classname + "\" class"); +} + +void unarchive_table_t::insert(const std::string& classname, synthesize_func f) +{ + if (unarch_map->find(classname) != unarch_map->end()) + throw std::runtime_error(std::string("Class \"" + classname + + "\" is already registered")); + unarch_map->operator[](classname) = f; +} + +unarchive_table_t::~unarchive_table_t() +{ + if (--usecount == 0) + delete unarch_map; +} + void archive::clear() { @@ -579,7 +625,7 @@ void archive::printraw(std::ostream &os) const // Dump expressions os << "Expressions:\n"; { - std::vector::const_iterator i = exprs.begin(), iend = exprs.end(); + auto i = exprs.begin(), iend = exprs.end(); unsigned index = 0; while (i != iend) { os << " " << index << " \"" << unatomize(i->name) << "\" root node " << i->root << std::endl; @@ -591,7 +637,7 @@ void archive::printraw(std::ostream &os) const // Dump nodes os << "Nodes:\n"; { - std::vector::const_iterator i = nodes.begin(), iend = nodes.end(); + auto i = nodes.begin(), iend = nodes.end(); archive_node_id id = 0; while (i != iend) { os << " " << id << " "; @@ -611,7 +657,7 @@ void archive_node::printraw(std::ostream &os) const os << "\n"; // Dump properties - archive_node_cit i = props.begin(), iend = props.end(); + auto i = props.begin(), iend = props.end(); while (i != iend) { os << " "; switch (i->type) { @@ -626,13 +672,5 @@ void archive_node::printraw(std::ostream &os) const } } -/** Create a dummy archive. The intention is to fill archive_node's default - * ctor, which is currently a Cint-requirement. */ -archive* archive_node::dummy_ar_creator() -{ - static archive* some_ar = new archive; - return some_ar; -} - } // namespace GiNaC