CMake/Source/cmIfCommand.cxx

553 lines
14 KiB
C++
Raw Normal View History

2001-04-19 21:39:03 +00:00
/*=========================================================================
Program: CMake - Cross-Platform Makefile Generator
2001-04-19 21:39:03 +00:00
Module: $RCSfile$
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) 2002 Kitware, Inc., Insight Consortium. All rights reserved.
See Copyright.txt or http://www.cmake.org/HTML/Copyright.html for details.
2001-04-19 21:39:03 +00:00
2002-01-21 20:30:43 +00:00
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
2001-04-19 21:39:03 +00:00
=========================================================================*/
#include "cmIfCommand.h"
#include <stdlib.h> // required for atof
#include <list>
#include <cmsys/RegularExpression.hxx>
2001-04-19 21:39:03 +00:00
bool cmIfFunctionBlocker::
IsFunctionBlocked(const cmListFileFunction& lff, cmMakefile &mf)
2001-04-19 21:39:03 +00:00
{
const char* name = lff.m_Name.c_str();
const std::vector<cmListFileArgument>& args = lff.m_Arguments;
2002-09-23 13:41:01 +00:00
// always let if statements through
if (cmSystemTools::LowerCase(lff.m_Name) == "if")
2002-09-23 13:41:01 +00:00
{
return false;
}
// watch for our ELSE or ENDIF
if (cmSystemTools::LowerCase(lff.m_Name) == "else" ||
cmSystemTools::LowerCase(lff.m_Name) == "endif")
2001-04-19 21:39:03 +00:00
{
2001-08-06 21:01:26 +00:00
if (args == m_Args)
2001-05-01 15:16:20 +00:00
{
2002-08-09 16:00:49 +00:00
// if it was an else statement then we should change state
// and block this Else Command
if (cmSystemTools::LowerCase(lff.m_Name) == "else")
2002-08-09 16:00:49 +00:00
{
m_IsBlocking = !m_IsBlocking;
return true;
}
2002-09-10 14:16:50 +00:00
// otherwise it must be an ENDIF statement, in that case remove the
// function blocker
mf.RemoveFunctionBlocker(lff);
2002-09-10 14:16:50 +00:00
return true;
2001-05-01 15:16:20 +00:00
}
else if(args.empty())
{
std::string err = "Empty arguments for ";
err += name;
err += ". Did you mean ";
err += name;
err += "( ";
for(std::vector<cmListFileArgument>::const_iterator a = m_Args.begin();
a != m_Args.end();++a)
{
err += (a->Quoted?"\"":"");
err += a->Value;
err += (a->Quoted?"\"":"");
err += " ";
}
err += ")?";
cmSystemTools::Error(err.c_str());
}
2001-04-19 21:39:03 +00:00
}
return m_IsBlocking;
2001-04-19 21:39:03 +00:00
}
bool cmIfFunctionBlocker::ShouldRemove(const cmListFileFunction& lff,
cmMakefile&)
2001-04-19 21:39:03 +00:00
{
if (cmSystemTools::LowerCase(lff.m_Name) == "endif")
{
if (lff.m_Arguments == m_Args)
{
return true;
}
}
return false;
2001-04-19 21:39:03 +00:00
}
2001-05-04 12:46:05 +00:00
void cmIfFunctionBlocker::
2001-07-25 20:53:13 +00:00
ScopeEnded(cmMakefile &mf)
2001-05-04 12:46:05 +00:00
{
2001-11-26 16:31:50 +00:00
std::string errmsg = "The end of a CMakeLists file was reached with an IF statement that was not closed properly.\nWithin the directory: ";
errmsg += mf.GetCurrentDirectory();
errmsg += "\nThe arguments are: ";
for(std::vector<cmListFileArgument>::const_iterator j = m_Args.begin();
2001-11-26 16:31:50 +00:00
j != m_Args.end(); ++j)
{
errmsg += (j->Quoted?"\"":"");
errmsg += j->Value;
errmsg += (j->Quoted?"\"":"");
2001-11-26 16:31:50 +00:00
errmsg += " ";
}
2002-12-13 14:52:05 +00:00
cmSystemTools::Message(errmsg.c_str(), "Warning");
2001-05-04 12:46:05 +00:00
}
bool cmIfCommand::InvokeInitialPass(const std::vector<cmListFileArgument>& args)
2001-04-19 21:39:03 +00:00
{
char* errorString = 0;
std::vector<std::string> expandedArguments;
m_Makefile->ExpandArguments(args, expandedArguments);
bool isTrue = cmIfCommand::IsTrue(expandedArguments,&errorString,m_Makefile);
if (errorString)
2001-04-19 21:39:03 +00:00
{
std::string err = "had incorrect arguments: ";
2002-11-15 17:54:04 +00:00
unsigned int i;
for(i =0; i < args.size(); ++i)
{
err += (args[i].Quoted?"\"":"");
err += args[i].Value;
err += (args[i].Quoted?"\"":"");
err += " ";
}
err += "(";
err += errorString;
err += ").";
this->SetError(err.c_str());
2004-08-04 12:50:37 +00:00
delete [] errorString;
2001-04-19 21:39:03 +00:00
return false;
}
cmIfFunctionBlocker *f = new cmIfFunctionBlocker();
// if is isn't true block the commands
f->m_IsBlocking = !isTrue;
f->m_Args = args;
m_Makefile->AddFunctionBlocker(f);
return true;
}
2001-08-06 21:01:26 +00:00
2005-11-17 14:32:07 +00:00
void IncrementArguments(std::list<std::string> &newArgs,
std::list<std::string>::iterator &argP1,
std::list<std::string>::iterator &argP2)
{
if (argP1 != newArgs.end())
{
argP1++;
argP2 = argP1;
if (argP1 != newArgs.end())
{
argP2++;
}
}
}
2004-05-01 14:08:14 +00:00
// order of operations,
// EXISTS COMMAND DEFINED
2004-06-14 16:02:12 +00:00
// MATCHES LESS GREATER EQUAL STRLESS STRGREATER STREQUAL
2004-05-01 14:08:14 +00:00
// AND OR
//
// There is an issue on whether the arguments should be values of references,
// for example IF (FOO AND BAR) should that compare the strings FOO and BAR
// or should it really do IF (${FOO} AND ${BAR}) Currently EXISTS COMMAND and
// DEFINED all take values. EQUAL, LESS and GREATER can take numeric values or
// variable names. STRLESS and STRGREATER take variable names but if the
// variable name is not found it will use the name directly. AND OR take
// variables or the values 0 or 1.
bool cmIfCommand::IsTrue(const std::vector<std::string> &args,
char **errorString, const cmMakefile *makefile)
{
2001-08-06 21:01:26 +00:00
// check for the different signatures
2001-05-01 15:16:20 +00:00
const char *def;
2001-08-06 21:01:26 +00:00
const char *def2;
2004-08-04 12:50:37 +00:00
const char* msg = "Unknown arguments specified";
*errorString = new char[strlen(msg) + 1];
strcpy(*errorString, msg);
2004-05-01 14:08:14 +00:00
2004-05-03 19:33:42 +00:00
// handle empty invocation
if (args.size() < 1)
{
2004-08-04 12:50:37 +00:00
delete [] *errorString;
*errorString = 0;
2004-05-03 19:33:42 +00:00
return false;
}
2004-05-06 13:47:25 +00:00
// this is a super ugly hack. Basically old versiosn of VTK and ITK have a
// bad test to check for more recent versions of CMake in the
// CMakeLists.txt file for libtiff. So when we reved CMake up to 2.0 the
// test started failing because the minor version went to zero this causes
// the test to pass
if (args.size() == 3 &&
2004-08-04 12:50:37 +00:00
(makefile->GetDefinition("VTKTIFF_SOURCE_DIR") ||
makefile->GetDefinition("ITKTIFF_SOURCE_DIR")) &&
args[0] == "CMAKE_MINOR_VERSION" &&
args[1] == "MATCHES")
2004-05-06 13:47:25 +00:00
{
2004-08-04 12:50:37 +00:00
delete [] *errorString;
*errorString = 0;
2004-05-06 13:47:25 +00:00
return true;
}
2004-08-04 12:50:37 +00:00
2004-05-01 14:08:14 +00:00
// store the reduced args in this vector
std::list<std::string> newArgs;
2004-05-04 13:16:06 +00:00
int reducible;
2004-05-01 14:08:14 +00:00
unsigned int i;
2004-08-04 12:50:37 +00:00
2004-05-01 14:08:14 +00:00
// copy to the list structure
for(i = 0; i < args.size(); ++i)
{
newArgs.push_back(args[i]);
}
std::list<std::string>::iterator argP1;
std::list<std::string>::iterator argP2;
2004-08-04 12:50:37 +00:00
2004-05-01 14:08:14 +00:00
// now loop through the arguments and see if we can reduce any of them
// we do this multiple times. Once for each level of precedence
do
2001-08-06 21:01:26 +00:00
{
2004-05-01 14:08:14 +00:00
reducible = 0;
std::list<std::string>::iterator arg = newArgs.begin();
2004-05-01 14:08:14 +00:00
while (arg != newArgs.end())
2001-08-06 21:01:26 +00:00
{
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
// does a file exist
if (*arg == "EXISTS" && argP1 != newArgs.end())
2004-05-01 14:08:14 +00:00
{
if(cmSystemTools::FileExists((argP1)->c_str()))
2004-05-01 14:08:14 +00:00
{
*arg = "1";
}
else
{
*arg = "0";
}
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:33:17 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
// does a command exist
if (*arg == "COMMAND" && argP1 != newArgs.end())
2004-05-01 14:08:14 +00:00
{
if(makefile->CommandExists((argP1)->c_str()))
2004-05-01 14:08:14 +00:00
{
*arg = "1";
}
else
{
*arg = "0";
}
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
// is a variable defined
if (*arg == "DEFINED" && argP1 != newArgs.end())
2004-05-01 14:08:14 +00:00
{
def = makefile->GetDefinition((argP1)->c_str());
2004-05-01 14:08:14 +00:00
if(def)
{
*arg = "1";
}
else
{
*arg = "0";
}
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
++arg;
2001-08-06 21:01:26 +00:00
}
}
2004-05-01 14:08:14 +00:00
while (reducible);
2004-08-04 12:50:37 +00:00
2004-05-01 14:08:14 +00:00
// now loop through the arguments and see if we can reduce any of them
// we do this multiple times. Once for each level of precedence
do
2001-04-19 21:39:03 +00:00
{
2004-05-01 14:08:14 +00:00
reducible = 0;
std::list<std::string>::iterator arg = newArgs.begin();
2004-08-04 12:50:37 +00:00
2004-05-01 14:08:14 +00:00
while (arg != newArgs.end())
2001-05-01 15:16:20 +00:00
{
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
if (argP1 != newArgs.end() && argP2 != newArgs.end() &&
2004-08-04 12:50:37 +00:00
*(argP1) == "MATCHES")
2004-05-01 14:08:14 +00:00
{
def = cmIfCommand::GetVariableOrString(arg->c_str(), makefile);
const char* rex = (argP2)->c_str();
cmsys::RegularExpression regEntry;
if ( !regEntry.compile(rex) )
{
cmOStringStream error;
error << "Regular expression \"" << rex << "\" cannot compile";
2004-08-04 12:50:37 +00:00
delete [] *errorString;
*errorString = new char[error.str().size() + 1];
strcpy(*errorString, error.str().c_str());
return false;
}
2004-05-01 14:08:14 +00:00
if (regEntry.find(def))
{
*arg = "1";
}
else
{
*arg = "0";
}
newArgs.erase(argP2);
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
if (argP1 != newArgs.end() && *arg == "MATCHES")
2004-05-01 14:08:14 +00:00
{
*arg = "0";
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
2001-08-06 21:01:26 +00:00
if (argP1 != newArgs.end() && argP2 != newArgs.end() &&
2004-08-04 12:50:37 +00:00
(*(argP1) == "LESS" || *(argP1) == "GREATER" ||
*(argP1) == "EQUAL"))
2004-05-01 14:08:14 +00:00
{
def = cmIfCommand::GetVariableOrString(arg->c_str(), makefile);
def2 = cmIfCommand::GetVariableOrString((argP2)->c_str(), makefile);
if (*(argP1) == "LESS")
2004-05-01 14:08:14 +00:00
{
if(atof(def) < atof(def2))
{
*arg = "1";
}
else
{
*arg = "0";
}
}
else if (*(argP1) == "GREATER")
2004-05-01 14:08:14 +00:00
{
if(atof(def) > atof(def2))
{
*arg = "1";
}
else
{
*arg = "0";
}
}
else
{
if(atof(def) == atof(def2))
{
*arg = "1";
}
else
{
*arg = "0";
}
}
newArgs.erase(argP2);
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
if (argP1 != newArgs.end() && argP2 != newArgs.end() &&
2004-08-04 12:50:37 +00:00
(*(argP1) == "STRLESS" ||
*(argP1) == "STREQUAL" ||
*(argP1) == "STRGREATER"))
2004-05-01 14:08:14 +00:00
{
def = cmIfCommand::GetVariableOrString(arg->c_str(), makefile);
def2 = cmIfCommand::GetVariableOrString((argP2)->c_str(), makefile);
2004-06-14 16:02:12 +00:00
int val = strcmp(def,def2);
int result;
if (*(argP1) == "STRLESS")
2004-05-01 14:08:14 +00:00
{
2004-06-14 16:02:12 +00:00
result = (val < 0);
}
else if (*(argP1) == "STRGREATER")
{
result = (val > 0);
}
else // strequal
{
result = (val == 0);
}
if(result)
{
*arg = "1";
2004-05-01 14:08:14 +00:00
}
else
{
2004-06-14 16:02:12 +00:00
*arg = "0";
}
newArgs.erase(argP2);
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
2002-01-02 21:46:08 +00:00
2004-05-01 14:08:14 +00:00
++arg;
}
}
2004-05-01 14:08:14 +00:00
while (reducible);
2004-08-04 12:50:37 +00:00
2004-05-01 14:08:14 +00:00
// now loop through the arguments and see if we can reduce any of them
// we do this multiple times. Once for each level of precedence
do
2001-08-06 21:01:26 +00:00
{
2004-05-01 14:08:14 +00:00
reducible = 0;
std::list<std::string>::iterator arg = newArgs.begin();
2004-05-01 14:08:14 +00:00
while (arg != newArgs.end())
2001-05-01 15:16:20 +00:00
{
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
if (argP1 != newArgs.end() && *arg == "NOT")
2004-05-01 14:08:14 +00:00
{
def = cmIfCommand::GetVariableOrNumber((argP1)->c_str(), makefile);
2004-05-01 14:08:14 +00:00
if(!cmSystemTools::IsOff(def))
{
*arg = "0";
}
else
{
*arg = "1";
}
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
++arg;
2001-05-01 15:16:20 +00:00
}
2001-04-19 21:39:03 +00:00
}
2004-05-01 14:08:14 +00:00
while (reducible);
2004-08-04 12:50:37 +00:00
2004-05-01 14:08:14 +00:00
// now loop through the arguments and see if we can reduce any of them
// we do this multiple times. Once for each level of precedence
do
2001-04-19 21:39:03 +00:00
{
2004-05-01 14:08:14 +00:00
reducible = 0;
std::list<std::string>::iterator arg = newArgs.begin();
2004-05-01 14:08:14 +00:00
while (arg != newArgs.end())
2001-05-01 15:16:20 +00:00
{
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
if (argP1 != newArgs.end() && *(argP1) == "AND" &&
2004-08-04 12:50:37 +00:00
argP2 != newArgs.end())
2004-05-01 14:08:14 +00:00
{
def = cmIfCommand::GetVariableOrNumber(arg->c_str(), makefile);
def2 = cmIfCommand::GetVariableOrNumber((argP2)->c_str(), makefile);
2004-05-01 14:08:14 +00:00
if(cmSystemTools::IsOff(def) || cmSystemTools::IsOff(def2))
{
*arg = "0";
}
else
{
*arg = "1";
}
newArgs.erase(argP2);
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
2001-08-06 21:01:26 +00:00
if (argP1 != newArgs.end() && *(argP1) == "OR" &&
2004-08-04 12:50:37 +00:00
argP2 != newArgs.end())
2004-05-01 14:08:14 +00:00
{
def = cmIfCommand::GetVariableOrNumber(arg->c_str(), makefile);
def2 = cmIfCommand::GetVariableOrNumber((argP2)->c_str(), makefile);
2004-05-01 14:08:14 +00:00
if(cmSystemTools::IsOff(def) && cmSystemTools::IsOff(def2))
{
*arg = "0";
}
else
{
*arg = "1";
}
newArgs.erase(argP2);
newArgs.erase(argP1);
argP1 = arg;
2005-11-17 14:32:07 +00:00
IncrementArguments(newArgs,argP1,argP2);
2004-05-01 14:08:14 +00:00
reducible = 1;
}
2004-08-04 12:50:37 +00:00
2004-05-01 14:08:14 +00:00
++arg;
2002-05-23 14:32:28 +00:00
}
}
2004-05-01 14:08:14 +00:00
while (reducible);
2002-05-23 14:32:28 +00:00
2004-05-01 14:08:14 +00:00
// now at the end there should only be one argument left
if (newArgs.size() == 1)
2002-05-23 14:32:28 +00:00
{
2004-08-04 12:50:37 +00:00
delete [] *errorString;
*errorString = 0;
if (*newArgs.begin() == "0")
{
2004-05-01 14:08:14 +00:00
return false;
}
if (*newArgs.begin() == "1")
2002-05-23 14:32:28 +00:00
{
2004-05-01 14:08:14 +00:00
return true;
2002-05-23 14:32:28 +00:00
}
2004-05-01 14:08:14 +00:00
def = makefile->GetDefinition(args[0].c_str());
if(cmSystemTools::IsOff(def))
2002-05-23 14:32:28 +00:00
{
2004-05-01 14:08:14 +00:00
return false;
2002-05-23 14:32:28 +00:00
}
}
2004-05-01 14:08:14 +00:00
return true;
2001-04-19 21:39:03 +00:00
}
const char* cmIfCommand::GetVariableOrString(const char* str,
const cmMakefile* mf)
{
const char* def = mf->GetDefinition(str);
if(!def)
{
def = str;
}
return def;
}
2004-05-01 14:08:14 +00:00
const char* cmIfCommand::GetVariableOrNumber(const char* str,
const cmMakefile* mf)
{
const char* def = mf->GetDefinition(str);
if(!def)
{
if (atoi(str))
{
def = str;
}
}
return def;
}