openscad/src/module.cc

249 lines
7.2 KiB
C++
Raw Normal View History

/*
2011-01-21 04:21:09 +03:00
* OpenSCAD (www.openscad.org)
* Copyright (C) 2009-2011 Clifford Wolf <clifford@clifford.at> and
* Marius Kintel <marius@kintel.net>
*
* 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 2 of the License, or
* (at your option) any later version.
*
* As a special exception, you have permission to link this program
* with the CGAL library and distribute executables, as long as you
* follow the requirements of the GNU GPL in regard to all of the
* software in the executable aside from CGAL.
*
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "module.h"
#include "ModuleCache.h"
#include "node.h"
#include "modcontext.h"
#include "evalcontext.h"
#include "expression.h"
#include "function.h"
#include "printutils.h"
2013-04-05 09:30:09 +04:00
#include <boost/filesystem.hpp>
namespace fs = boost::filesystem;
#include "boosty.h"
2011-09-03 08:10:36 +04:00
#include <boost/foreach.hpp>
#include <sstream>
2012-02-18 02:05:36 +04:00
#include <sys/stat.h>
AbstractModule::~AbstractModule()
{
}
AbstractNode *AbstractModule::evaluate(const Context *ctx, const ModuleInstantiation *inst, const EvalContext *evalctx) const
{
AbstractNode *node = new AbstractNode(inst);
node->children = inst->evaluateChildren(evalctx);
return node;
}
2011-09-03 08:10:36 +04:00
std::string AbstractModule::dump(const std::string &indent, const std::string &name) const
{
2011-09-03 08:10:36 +04:00
std::stringstream dump;
dump << indent << "abstract module " << name << "();\n";
return dump.str();
}
ModuleInstantiation::~ModuleInstantiation()
{
BOOST_FOREACH (Expression *v, argexpr) delete v;
BOOST_FOREACH (ModuleInstantiation *v, children) delete v;
}
IfElseModuleInstantiation::~IfElseModuleInstantiation()
{
BOOST_FOREACH (ModuleInstantiation *v, else_children) delete v;
}
2013-04-05 09:30:09 +04:00
/*!
Returns the absolute path to the given filename, unless it's empty.
*/
std::string ModuleInstantiation::getAbsolutePath(const std::string &filename) const
{
if (!filename.empty() && !boosty::is_absolute(fs::path(filename))) {
return boosty::absolute(fs::path(this->modpath) / filename).string();
}
else {
return filename;
}
}
2011-09-03 08:10:36 +04:00
std::string ModuleInstantiation::dump(const std::string &indent) const
{
2011-09-03 08:10:36 +04:00
std::stringstream dump;
dump << indent;
dump << modname + "(";
for (size_t i=0; i < argnames.size(); i++) {
if (i > 0) dump << ", ";
if (!argnames[i].empty()) dump << argnames[i] << " = ";
dump << *argexpr[i];
}
if (children.size() == 0) {
2011-09-03 08:10:36 +04:00
dump << ");\n";
} else if (children.size() == 1) {
2011-09-03 08:10:36 +04:00
dump << ")\n";
dump << children[0]->dump(indent + "\t");
} else {
2011-09-03 08:10:36 +04:00
dump << ") {\n";
for (size_t i = 0; i < children.size(); i++) {
dump << children[i]->dump(indent + "\t");
}
2011-09-03 08:10:36 +04:00
dump << indent << "}\n";
}
2011-09-03 08:10:36 +04:00
return dump.str();
}
AbstractNode *ModuleInstantiation::evaluate_instance(const Context *ctx) const
{
EvalContext c(ctx);
for (size_t i=0; i<argnames.size(); i++) {
c.eval_arguments.push_back(std::make_pair(argnames[i],
i < argexpr.size() && argexpr[i] ?
argexpr[i]->evaluate(ctx) :
Value()));
}
c.children = this->children;
#ifdef DEBUG
PRINT("New eval ctx:");
c.dump(NULL, this);
#endif
AbstractNode *node = ctx->evaluate_module(*this, &c); // Passes c as evalctx
return node;
}
std::vector<AbstractNode*> ModuleInstantiation::evaluateChildren(const Context *evalctx) const
{
std::vector<AbstractNode*> childnodes;
BOOST_FOREACH (ModuleInstantiation *modinst, this->children) {
AbstractNode *node = modinst->evaluate_instance(evalctx);
if (node) childnodes.push_back(node);
2011-09-03 08:10:36 +04:00
}
return childnodes;
}
std::vector<AbstractNode*> IfElseModuleInstantiation::evaluateElseChildren(const Context *evalctx) const
{
std::vector<AbstractNode*> childnodes;
BOOST_FOREACH (ModuleInstantiation *modinst, this->else_children) {
AbstractNode *node = modinst->evaluate_instance(evalctx);
if (node != NULL) childnodes.push_back(node);
2011-09-03 08:10:36 +04:00
}
return childnodes;
}
Module::~Module()
{
BOOST_FOREACH (const AssignmentContainer::value_type &v, assignments) delete v.second;
BOOST_FOREACH (FunctionContainer::value_type &f, functions) delete f.second;
BOOST_FOREACH (AbstractModuleContainer::value_type &m, modules) delete m.second;
BOOST_FOREACH (ModuleInstantiation *v, children) delete v;
}
AbstractNode *Module::evaluate(const Context *ctx, const ModuleInstantiation *inst, const EvalContext *evalctx) const
{
ModuleContext c(this, ctx, evalctx);
// FIXME: Set document path to the path of the module
c.set_variable("$children", Value(double(inst->children.size())));
#ifdef DEBUG
c.dump(this, inst);
#endif
AbstractNode *node = new AbstractNode(inst);
2011-09-03 08:10:36 +04:00
for (size_t i = 0; i < children.size(); i++) {
AbstractNode *n = children[i]->evaluate_instance(&c);
if (n != NULL)
2011-08-04 06:58:17 +04:00
node->children.push_back(n);
}
return node;
}
2011-09-03 08:10:36 +04:00
std::string Module::dump(const std::string &indent, const std::string &name) const
{
2011-09-03 08:10:36 +04:00
std::stringstream dump;
std::string tab;
if (!name.empty()) {
dump << indent << "module " << name << "(";
for (size_t i=0; i < argnames.size(); i++) {
if (i > 0) dump << ", ";
dump << argnames[i];
if (argexpr[i]) dump << " = " << *argexpr[i];
}
2011-09-03 08:10:36 +04:00
dump << ") {\n";
tab = "\t";
}
2011-09-03 08:10:36 +04:00
BOOST_FOREACH(const FunctionContainer::value_type &f, functions) {
dump << f.second->dump(indent + tab, f.first);
}
2011-09-03 08:10:36 +04:00
BOOST_FOREACH(const AbstractModuleContainer::value_type &m, modules) {
dump << m.second->dump(indent + tab, m.first);
}
BOOST_FOREACH(const std::string &var, assignments_var) {
dump << indent << tab << var << " = " << *assignments.at(var) << ";\n";
}
2011-09-03 08:10:36 +04:00
for (size_t i = 0; i < children.size(); i++) {
dump << children[i]->dump(indent + tab);
}
2011-09-03 08:10:36 +04:00
if (!name.empty()) {
dump << indent << "}\n";
}
2011-09-03 08:10:36 +04:00
return dump.str();
}
2012-02-18 02:05:36 +04:00
void Module::registerInclude(const std::string &filename)
{
2012-02-18 02:05:36 +04:00
struct stat st;
memset(&st, 0, sizeof(struct stat));
stat(filename.c_str(), &st);
this->includes[filename] = st.st_mtime;
}
/*!
Check if any dependencies have been modified and recompile them.
Returns true if anything was recompiled.
*/
bool Module::handleDependencies()
{
if (this->is_handling_dependencies) return false;
this->is_handling_dependencies = true;
2012-02-18 02:05:36 +04:00
bool changed = false;
// Iterating manually since we want to modify the container while iterating
Module::ModuleContainer::iterator iter = this->usedlibs.begin();
while (iter != this->usedlibs.end()) {
Module::ModuleContainer::iterator curr = iter++;
2012-02-18 02:05:36 +04:00
Module *oldmodule = curr->second;
curr->second = ModuleCache::instance()->evaluate(curr->first);
2012-03-28 05:53:09 +04:00
if (curr->second != oldmodule) {
changed = true;
#ifdef DEBUG
PRINTB_NOCACHE(" %s: %p", curr->first % curr->second);
#endif
}
if (!curr->second) {
PRINTB_NOCACHE("WARNING: Failed to compile library '%s'.", curr->first);
this->usedlibs.erase(curr);
}
}
this->is_handling_dependencies = false;
2012-02-18 02:05:36 +04:00
return changed;
}