2001-01-11 22:55:47 +03:00
|
|
|
/*=========================================================================
|
|
|
|
|
|
|
|
Program: Insight Segmentation & Registration Toolkit
|
|
|
|
Module: $RCSfile$
|
|
|
|
Language: C++
|
|
|
|
Date: $Date$
|
|
|
|
Version: $Revision$
|
|
|
|
|
2001-04-27 16:01:17 +04:00
|
|
|
Copyright (c) 2001 Insight Consortium
|
|
|
|
All rights reserved.
|
2001-01-11 22:55:47 +03:00
|
|
|
|
2001-04-27 16:01:17 +04:00
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
modification, are permitted provided that the following conditions are met:
|
2001-01-11 22:55:47 +03:00
|
|
|
|
2001-04-27 16:01:17 +04:00
|
|
|
* Redistributions of source code must retain the above copyright notice,
|
|
|
|
this list of conditions and the following disclaimer.
|
|
|
|
|
|
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
this list of conditions and the following disclaimer in the documentation
|
|
|
|
and/or other materials provided with the distribution.
|
|
|
|
|
|
|
|
* The name of the Insight Consortium, nor the names of any consortium members,
|
|
|
|
nor of any contributors, may be used to endorse or promote products derived
|
|
|
|
from this software without specific prior written permission.
|
|
|
|
|
|
|
|
* Modified source versions must be plainly marked as such, and must not be
|
|
|
|
misrepresented as being the original software.
|
|
|
|
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS''
|
|
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
|
|
|
|
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
|
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
|
|
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
|
|
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
2001-01-11 22:55:47 +03:00
|
|
|
|
|
|
|
=========================================================================*/
|
2000-08-29 23:26:29 +04:00
|
|
|
#include "cmMakeDepend.h"
|
2001-01-05 19:41:20 +03:00
|
|
|
#include "cmStandardIncludes.h"
|
2000-09-12 13:30:35 +04:00
|
|
|
#include "cmSystemTools.h"
|
2000-08-29 23:26:29 +04:00
|
|
|
|
|
|
|
cmMakeDepend::cmMakeDepend()
|
|
|
|
{
|
|
|
|
m_Verbose = false;
|
2001-06-21 23:02:52 +04:00
|
|
|
m_IncludeFileRegularExpression.compile("^.*$");
|
|
|
|
m_ComplainFileRegularExpression.compile("^$");
|
2000-09-12 13:30:35 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-08-29 23:26:29 +04:00
|
|
|
cmMakeDepend::~cmMakeDepend()
|
|
|
|
{
|
|
|
|
for(DependArray::iterator i = m_DependInformation.begin();
|
|
|
|
i != m_DependInformation.end(); ++i)
|
|
|
|
{
|
|
|
|
delete *i;
|
|
|
|
}
|
|
|
|
m_DependInformation.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Set the makefile that depends will be made from.
|
2001-04-25 17:37:57 +04:00
|
|
|
// The pointer is kept so the cmSourceFile array can
|
2000-09-12 13:30:35 +04:00
|
|
|
// be updated with the depend information in the cmMakefile.
|
2000-08-29 23:26:29 +04:00
|
|
|
|
2001-06-12 17:00:21 +04:00
|
|
|
void cmMakeDepend::SetMakefile(const cmMakefile* makefile)
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
|
|
|
m_Makefile = makefile;
|
2001-03-16 02:09:16 +03:00
|
|
|
|
|
|
|
// Now extract the include file regular expression from the makefile.
|
|
|
|
m_IncludeFileRegularExpression.compile(
|
|
|
|
m_Makefile->m_IncludeFileRegularExpression.c_str());
|
2001-06-21 23:02:52 +04:00
|
|
|
m_ComplainFileRegularExpression.compile(
|
|
|
|
m_Makefile->m_ComplainFileRegularExpression.c_str());
|
2000-09-12 13:30:35 +04:00
|
|
|
|
|
|
|
// Now extract any include paths from the makefile flags
|
2001-06-12 17:00:21 +04:00
|
|
|
const std::vector<std::string>& includes = m_Makefile->GetIncludeDirectories();
|
|
|
|
std::vector<std::string>::const_iterator j;
|
2000-09-12 13:30:35 +04:00
|
|
|
for(j = includes.begin(); j != includes.end(); ++j)
|
|
|
|
{
|
|
|
|
this->AddSearchPath(j->c_str());
|
|
|
|
}
|
2001-04-25 00:49:12 +04:00
|
|
|
|
2000-09-12 13:30:35 +04:00
|
|
|
// Now create cmDependInformation objects for files in the directory
|
2001-06-12 17:00:21 +04:00
|
|
|
const cmTargets &tgts = m_Makefile->GetTargets();
|
|
|
|
for(cmTargets::const_iterator l = tgts.begin();
|
2001-04-25 00:49:12 +04:00
|
|
|
l != tgts.end(); l++)
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
2001-06-12 17:00:21 +04:00
|
|
|
const std::vector<cmSourceFile> &classes = l->second.GetSourceFiles();
|
|
|
|
for(std::vector<cmSourceFile>::const_iterator i = classes.begin();
|
2001-04-25 00:49:12 +04:00
|
|
|
i != classes.end(); ++i)
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
2001-04-25 00:49:12 +04:00
|
|
|
if(!i->GetIsAHeaderFileOnly())
|
2001-04-11 22:59:02 +04:00
|
|
|
{
|
|
|
|
cmDependInformation* info = new cmDependInformation;
|
2001-04-25 00:49:12 +04:00
|
|
|
info->m_FullPath = this->FullPath(i->GetFullPath().c_str());
|
2001-04-11 22:59:02 +04:00
|
|
|
this->AddFileToSearchPath(info->m_FullPath.c_str());
|
2001-04-25 00:49:12 +04:00
|
|
|
info->m_IncludeName = i->GetFullPath();
|
2001-04-18 16:01:56 +04:00
|
|
|
info->m_ClassFileIndex = &*i;
|
2001-04-11 22:59:02 +04:00
|
|
|
m_DependInformation.push_back(info);
|
|
|
|
}
|
2000-08-29 23:26:29 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Compute the depends.
|
2001-06-12 17:00:21 +04:00
|
|
|
void cmMakeDepend::GenerateDependInformation()
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
|
|
|
// The size of the m_DependInformation will change as
|
|
|
|
// Depend is called so do not use an iterater but rather
|
|
|
|
// depend on the size of the array.
|
2001-01-05 19:41:20 +03:00
|
|
|
unsigned int j = 0;
|
2000-08-29 23:26:29 +04:00
|
|
|
while(j != m_DependInformation.size())
|
|
|
|
{
|
|
|
|
cmDependInformation* info = m_DependInformation[j];
|
|
|
|
// compute the depend information for the info object
|
|
|
|
// this may add more objects to the m_DependInformation
|
|
|
|
// array
|
|
|
|
this->Depend(info);
|
|
|
|
++j;
|
|
|
|
}
|
2001-06-12 17:00:21 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
const cmDependInformation *
|
|
|
|
cmMakeDepend::GetDependInformationForSourceFile(const cmSourceFile &sf) const
|
|
|
|
{
|
2001-04-25 17:37:57 +04:00
|
|
|
// Now update the depend information for each cmSourceFile
|
2000-08-29 23:26:29 +04:00
|
|
|
// in the cmMakefile m_Makefile
|
2001-06-12 17:00:21 +04:00
|
|
|
for(DependArray::const_iterator i = m_DependInformation.begin();
|
2000-08-29 23:26:29 +04:00
|
|
|
i != m_DependInformation.end(); ++i)
|
|
|
|
{
|
|
|
|
cmDependInformation* info = *i;
|
|
|
|
// find the class
|
2001-06-12 17:00:21 +04:00
|
|
|
if(info->m_ClassFileIndex == &sf)
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
2001-06-12 17:00:21 +04:00
|
|
|
return info;
|
2000-08-29 23:26:29 +04:00
|
|
|
}
|
|
|
|
}
|
2001-06-12 17:00:21 +04:00
|
|
|
return 0;
|
2000-08-29 23:26:29 +04:00
|
|
|
}
|
|
|
|
|
2001-06-12 17:00:21 +04:00
|
|
|
const cmDependInformation *
|
|
|
|
cmMakeDepend::GetDependInformationForSourceFile(const char *fname) const
|
|
|
|
{
|
|
|
|
// Now update the depend information for each cmSourceFile
|
|
|
|
// in the cmMakefile m_Makefile
|
|
|
|
for(DependArray::const_iterator i = m_DependInformation.begin();
|
|
|
|
i != m_DependInformation.end(); ++i)
|
|
|
|
{
|
|
|
|
cmDependInformation* info = *i;
|
|
|
|
// find the class
|
|
|
|
if(info->m_FullPath == fname)
|
|
|
|
{
|
|
|
|
return info;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2001-03-09 00:12:16 +03:00
|
|
|
|
2000-08-29 23:26:29 +04:00
|
|
|
void cmMakeDepend::Depend(cmDependInformation* info)
|
|
|
|
{
|
|
|
|
const char* path = info->m_FullPath.c_str();
|
|
|
|
if(!path)
|
|
|
|
{
|
2001-01-05 19:41:20 +03:00
|
|
|
cmSystemTools::Error("no full path for object", 0);
|
2000-08-29 23:26:29 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-03-09 00:12:16 +03:00
|
|
|
// If the file exists, use it to find dependency information.
|
|
|
|
if(cmSystemTools::FileExists(path))
|
|
|
|
{
|
|
|
|
// Use the real file to find its dependencies.
|
|
|
|
this->DependWalk(info, path);
|
|
|
|
info->m_DependDone = true;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-04-25 17:37:57 +04:00
|
|
|
// The file doesn't exist. See if the cmSourceFile for it has any files
|
2001-03-09 00:12:16 +03:00
|
|
|
// specified as dependency hints.
|
2001-04-11 22:59:02 +04:00
|
|
|
if(info->m_ClassFileIndex != 0)
|
2001-03-09 00:12:16 +03:00
|
|
|
{
|
2001-04-25 17:37:57 +04:00
|
|
|
// Get the cmSourceFile corresponding to this.
|
2001-06-12 17:00:21 +04:00
|
|
|
const cmSourceFile& cFile = *(info->m_ClassFileIndex);
|
2001-03-09 00:12:16 +03:00
|
|
|
// See if there are any hints for finding dependencies for the missing
|
|
|
|
// file.
|
2001-04-25 00:49:12 +04:00
|
|
|
if(!cFile.GetDepends().empty())
|
2001-03-09 00:12:16 +03:00
|
|
|
{
|
|
|
|
// Initial dependencies have been given. Use them to begin the
|
|
|
|
// recursion.
|
2001-06-12 17:00:21 +04:00
|
|
|
for(std::vector<std::string>::const_iterator file =
|
2001-04-25 00:49:12 +04:00
|
|
|
cFile.GetDepends().begin(); file != cFile.GetDepends().end();
|
|
|
|
++file)
|
2001-03-09 00:12:16 +03:00
|
|
|
{
|
|
|
|
this->AddDependency(info, file->c_str());
|
|
|
|
}
|
|
|
|
|
|
|
|
// Found dependency information. We are done.
|
|
|
|
return;
|
2001-04-16 20:31:56 +04:00
|
|
|
}
|
2001-03-09 00:12:16 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// Couldn't find any dependency information.
|
2001-06-21 23:02:52 +04:00
|
|
|
if(m_ComplainFileRegularExpression.find(info->m_IncludeName.c_str()))
|
|
|
|
{
|
|
|
|
cmSystemTools::Error("error cannot find dependencies for ", path);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Destroy the name of the file so that it won't be output as a
|
|
|
|
// dependency.
|
|
|
|
info->m_FullPath = "";
|
|
|
|
}
|
2001-03-09 00:12:16 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// This function actually reads the file specified and scans it for
|
|
|
|
// #include directives
|
|
|
|
void cmMakeDepend::DependWalk(cmDependInformation* info, const char* file)
|
|
|
|
{
|
2001-06-21 23:02:52 +04:00
|
|
|
cmRegularExpression includeLine("^[ \t]*#[ \t]*include[ \t]*[<\"]([^\">]+)[\">]");
|
2001-03-09 00:12:16 +03:00
|
|
|
std::ifstream fin(file);
|
2000-08-29 23:26:29 +04:00
|
|
|
if(!fin)
|
|
|
|
{
|
2001-03-09 00:12:16 +03:00
|
|
|
cmSystemTools::Error("error can not open ", file);
|
2000-08-29 23:26:29 +04:00
|
|
|
return;
|
|
|
|
}
|
2001-03-09 00:12:16 +03:00
|
|
|
|
2000-08-29 23:26:29 +04:00
|
|
|
char line[255];
|
2001-06-21 23:02:52 +04:00
|
|
|
for(fin.getline(line, 255); !fin.eof()&&!fin.fail(); fin.getline(line, 255))
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
2001-06-21 23:02:52 +04:00
|
|
|
if(includeLine.find(line))
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
|
|
|
// extract the file being included
|
2001-06-21 23:02:52 +04:00
|
|
|
std::string includeFile = includeLine.match(1);
|
2000-08-29 23:26:29 +04:00
|
|
|
// see if the include matches the regular expression
|
|
|
|
if(!m_IncludeFileRegularExpression.find(includeFile))
|
|
|
|
{
|
|
|
|
if(m_Verbose)
|
|
|
|
{
|
2001-01-05 19:41:20 +03:00
|
|
|
std::string message = "Skipping ";
|
|
|
|
message += includeFile;
|
|
|
|
message += " for file ";
|
2001-03-09 00:12:16 +03:00
|
|
|
message += file;
|
2001-01-05 19:41:20 +03:00
|
|
|
cmSystemTools::Error(message.c_str(), 0);
|
2000-08-29 23:26:29 +04:00
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
2001-03-09 00:12:16 +03:00
|
|
|
|
|
|
|
// Add this file and all its dependencies.
|
|
|
|
this->AddDependency(info, includeFile.c_str());
|
2000-08-29 23:26:29 +04:00
|
|
|
}
|
|
|
|
}
|
2001-03-09 00:12:16 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void cmMakeDepend::AddDependency(cmDependInformation* info, const char* file)
|
|
|
|
{
|
|
|
|
// find the index of the include file in the
|
|
|
|
// m_DependInformation array, if it is not
|
|
|
|
// there then FindInformation will create it
|
|
|
|
int index = this->FindInformation(file);
|
|
|
|
// add the index to the depends of the current
|
|
|
|
// depend info object
|
2001-04-16 20:31:56 +04:00
|
|
|
info->m_IndexSet.insert(index);
|
2001-03-09 00:12:16 +03:00
|
|
|
// Get the depend information object for the include file
|
|
|
|
cmDependInformation* dependInfo = m_DependInformation[index];
|
|
|
|
// if the depends are not known for an include file, then compute them
|
|
|
|
// recursively
|
|
|
|
if(!dependInfo->m_DependDone)
|
|
|
|
{
|
|
|
|
// stop the recursion here
|
|
|
|
dependInfo->m_DependDone = true;
|
|
|
|
this->Depend(dependInfo);
|
|
|
|
}
|
|
|
|
// add the depends of the included file to the includer
|
|
|
|
info->MergeInfo(dependInfo);
|
2000-08-29 23:26:29 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Find the cmDependInformation array index of the
|
|
|
|
// given include file. Create a new cmDependInformation
|
|
|
|
// object if one is not found
|
|
|
|
int cmMakeDepend::FindInformation(const char* fname)
|
|
|
|
{
|
2001-01-05 19:41:20 +03:00
|
|
|
unsigned int i = 0;
|
2000-08-29 23:26:29 +04:00
|
|
|
|
|
|
|
while(i < m_DependInformation.size())
|
|
|
|
{
|
|
|
|
if(m_DependInformation[i]->m_IncludeName == fname)
|
|
|
|
{
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
cmDependInformation* newinfo = new cmDependInformation;
|
|
|
|
newinfo->m_FullPath = this->FullPath(fname);
|
2000-09-12 13:30:35 +04:00
|
|
|
// Add the directory where this file was found to the search path
|
|
|
|
// may have been foo/bar.h, but bar may include files from the foo
|
|
|
|
// directory without the foo prefix
|
2000-08-29 23:26:29 +04:00
|
|
|
this->AddFileToSearchPath(newinfo->m_FullPath.c_str());
|
|
|
|
newinfo->m_IncludeName = fname;
|
|
|
|
m_DependInformation.push_back(newinfo);
|
|
|
|
return m_DependInformation.size()-1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-04-16 20:31:56 +04:00
|
|
|
// add the depend information from info to the m_IndexSet varible of this class.
|
2000-08-29 23:26:29 +04:00
|
|
|
void cmDependInformation::MergeInfo(cmDependInformation* info)
|
|
|
|
{
|
2001-04-16 20:31:56 +04:00
|
|
|
if(this != info)
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
2001-06-12 17:00:21 +04:00
|
|
|
for (std::set<int>::const_iterator p = info->m_IndexSet.begin();
|
|
|
|
p != info->m_IndexSet.end(); ++p)
|
|
|
|
{
|
|
|
|
m_IndexSet.insert(*p);
|
|
|
|
}
|
2000-08-29 23:26:29 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// find the full path to fname by searching the m_IncludeDirectories array
|
|
|
|
std::string cmMakeDepend::FullPath(const char* fname)
|
|
|
|
{
|
2000-11-22 19:02:30 +03:00
|
|
|
if(cmSystemTools::FileExists(fname))
|
|
|
|
{
|
|
|
|
return std::string(fname);
|
|
|
|
}
|
2001-01-05 19:41:20 +03:00
|
|
|
|
2000-08-29 23:26:29 +04:00
|
|
|
for(std::vector<std::string>::iterator i = m_IncludeDirectories.begin();
|
|
|
|
i != m_IncludeDirectories.end(); ++i)
|
|
|
|
{
|
|
|
|
std::string path = *i;
|
|
|
|
path = path + "/";
|
|
|
|
path = path + fname;
|
2000-09-12 13:30:35 +04:00
|
|
|
if(cmSystemTools::FileExists(path.c_str()))
|
2000-08-29 23:26:29 +04:00
|
|
|
{
|
|
|
|
return path;
|
|
|
|
}
|
|
|
|
}
|
2001-04-25 17:37:57 +04:00
|
|
|
|
2001-06-21 23:02:52 +04:00
|
|
|
// Couldn't find the file.
|
2000-08-29 23:26:29 +04:00
|
|
|
return std::string(fname);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add a directory to the search path
|
|
|
|
void cmMakeDepend::AddSearchPath(const char* path)
|
|
|
|
{
|
|
|
|
m_IncludeDirectories.push_back(path);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add a directory to the search path
|
|
|
|
void cmMakeDepend::AddFileToSearchPath(const char* file)
|
|
|
|
{
|
|
|
|
std::string filepath = file;
|
|
|
|
std::string::size_type pos = filepath.rfind('/');
|
|
|
|
if(pos != std::string::npos)
|
|
|
|
{
|
|
|
|
std::string path = filepath.substr(0, pos);
|
2001-01-05 19:41:20 +03:00
|
|
|
if(std::find(m_IncludeDirectories.begin(),
|
|
|
|
m_IncludeDirectories.end(), path)
|
2000-08-29 23:26:29 +04:00
|
|
|
== m_IncludeDirectories.end())
|
|
|
|
{
|
|
|
|
m_IncludeDirectories.push_back(path);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|