e17a69bc74
The hash map is much faster at checking that the map won't have what we're looking for so that we can just go to the parent scope instead.
183 lines
5.1 KiB
C++
183 lines
5.1 KiB
C++
/*============================================================================
|
|
CMake - Cross Platform Makefile Generator
|
|
Copyright 2000-2009 Kitware, Inc., Insight Software Consortium
|
|
|
|
Distributed under the OSI-approved BSD License (the "License");
|
|
see accompanying file Copyright.txt for details.
|
|
|
|
This software is distributed WITHOUT ANY WARRANTY; without even the
|
|
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
See the License for more information.
|
|
============================================================================*/
|
|
#include "cmDefinitions.h"
|
|
|
|
//----------------------------------------------------------------------------
|
|
cmDefinitions::Def cmDefinitions::NoDef;
|
|
|
|
//----------------------------------------------------------------------------
|
|
cmDefinitions::cmDefinitions(cmDefinitions* parent)
|
|
: Up(parent)
|
|
{
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
void cmDefinitions::Reset(cmDefinitions* parent)
|
|
{
|
|
this->Up = parent;
|
|
this->Map.clear();
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
cmDefinitions::Def const&
|
|
cmDefinitions::GetInternal(const std::string& key) const
|
|
{
|
|
MapType::const_iterator i = this->Map.find(key);
|
|
if(i != this->Map.end())
|
|
{
|
|
return i->second;
|
|
}
|
|
if(cmDefinitions* up = this->Up)
|
|
{
|
|
// Query the parent scope.
|
|
return up->GetInternal(key);
|
|
}
|
|
return this->NoDef;
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
cmDefinitions::Def const&
|
|
cmDefinitions::SetInternal(const std::string& key, Def const& def)
|
|
{
|
|
if(this->Up || def.Exists)
|
|
{
|
|
// In lower scopes we store keys, defined or not.
|
|
return (this->Map[key] = def);
|
|
}
|
|
else
|
|
{
|
|
// In the top-most scope we need not store undefined keys.
|
|
this->Map.erase(key);
|
|
return this->NoDef;
|
|
}
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
const char* cmDefinitions::Get(const std::string& key) const
|
|
{
|
|
Def const& def = this->GetInternal(key);
|
|
return def.Exists? def.c_str() : 0;
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
void cmDefinitions::Pull(const std::string& key)
|
|
{
|
|
if (this->Up)
|
|
{
|
|
Def const& def = this->Up->GetInternal(key);
|
|
if (def.Exists)
|
|
{
|
|
this->SetInternal(key, def);
|
|
}
|
|
}
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
const char* cmDefinitions::Set(const std::string& key, const char* value)
|
|
{
|
|
Def const& def = this->SetInternal(key, Def(value));
|
|
return def.Exists? def.c_str() : 0;
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
std::set<std::string> cmDefinitions::LocalKeys() const
|
|
{
|
|
std::set<std::string> keys;
|
|
// Consider local definitions.
|
|
for(MapType::const_iterator mi = this->Map.begin();
|
|
mi != this->Map.end(); ++mi)
|
|
{
|
|
if (mi->second.Exists)
|
|
{
|
|
keys.insert(mi->first);
|
|
}
|
|
}
|
|
return keys;
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
cmDefinitions cmDefinitions::Closure() const
|
|
{
|
|
return cmDefinitions(ClosureTag(), this);
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
cmDefinitions::cmDefinitions(ClosureTag const&, cmDefinitions const* root):
|
|
Up(0)
|
|
{
|
|
std::set<std::string> undefined;
|
|
this->ClosureImpl(undefined, root);
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
void cmDefinitions::ClosureImpl(std::set<std::string>& undefined,
|
|
cmDefinitions const* defs)
|
|
{
|
|
// Consider local definitions.
|
|
for(MapType::const_iterator mi = defs->Map.begin();
|
|
mi != defs->Map.end(); ++mi)
|
|
{
|
|
// Use this key if it is not already set or unset.
|
|
if(this->Map.find(mi->first) == this->Map.end() &&
|
|
undefined.find(mi->first) == undefined.end())
|
|
{
|
|
if(mi->second.Exists)
|
|
{
|
|
this->Map.insert(*mi);
|
|
}
|
|
else
|
|
{
|
|
undefined.insert(mi->first);
|
|
}
|
|
}
|
|
}
|
|
|
|
// Traverse parents.
|
|
if(cmDefinitions const* up = defs->Up)
|
|
{
|
|
this->ClosureImpl(undefined, up);
|
|
}
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
std::set<std::string> cmDefinitions::ClosureKeys() const
|
|
{
|
|
std::set<std::string> defined;
|
|
std::set<std::string> undefined;
|
|
this->ClosureKeys(defined, undefined);
|
|
return defined;
|
|
}
|
|
|
|
//----------------------------------------------------------------------------
|
|
void cmDefinitions::ClosureKeys(std::set<std::string>& defined,
|
|
std::set<std::string>& undefined) const
|
|
{
|
|
// Consider local definitions.
|
|
for(MapType::const_iterator mi = this->Map.begin();
|
|
mi != this->Map.end(); ++mi)
|
|
{
|
|
// Use this key if it is not already set or unset.
|
|
if(defined.find(mi->first) == defined.end() &&
|
|
undefined.find(mi->first) == undefined.end())
|
|
{
|
|
std::set<std::string>& m = mi->second.Exists? defined : undefined;
|
|
m.insert(mi->first);
|
|
}
|
|
}
|
|
|
|
// Traverse parents.
|
|
if(cmDefinitions const* up = this->Up)
|
|
{
|
|
up->ClosureKeys(defined, undefined);
|
|
}
|
|
}
|