This means the order of children is preserved. It also means the name of each node isn't duplicated. This was an opportunity for an inconsistent XNode tree. Nodes can now be renamed after being inserted into a tree. Searching for children by name isn't efficient. Use attributes for that.
180 lines
4.3 KiB
C++
180 lines
4.3 KiB
C++
#include "global.h"
|
|
#include "IniFile.h"
|
|
#include "RageUtil.h"
|
|
#include "RageLog.h"
|
|
#include "RageFile.h"
|
|
#include "Foreach.h"
|
|
|
|
IniFile::IniFile(): XNode("IniFile")
|
|
{
|
|
}
|
|
|
|
bool IniFile::ReadFile( const RString &sPath )
|
|
{
|
|
m_sPath = sPath;
|
|
CHECKPOINT_M( ssprintf("Reading '%s'",m_sPath.c_str()) );
|
|
|
|
RageFile f;
|
|
if( !f.Open( m_sPath ) )
|
|
{
|
|
LOG->Trace( "Reading '%s' failed: %s", m_sPath.c_str(), f.GetError().c_str() );
|
|
m_sError = f.GetError();
|
|
return 0;
|
|
}
|
|
|
|
return ReadFile( f );
|
|
}
|
|
|
|
bool IniFile::ReadFile( RageFileBasic &f )
|
|
{
|
|
RString keyname;
|
|
while( 1 )
|
|
{
|
|
RString line;
|
|
switch( f.GetLine(line) )
|
|
{
|
|
case -1:
|
|
m_sError = f.GetError();
|
|
return false;
|
|
case 0:
|
|
return true; /* eof */
|
|
}
|
|
|
|
utf8_remove_bom( line );
|
|
|
|
if( line.size() == 0 )
|
|
continue;
|
|
if( line[0] == '#' )
|
|
continue; /* comment */
|
|
if( line.size() > 1 && line[0] == '/' && line[1] == '/' )
|
|
continue; /* comment */
|
|
|
|
if( line[0] == '[' && line[line.size()-1] == ']' )
|
|
{
|
|
/* New section. */
|
|
keyname = line.substr(1, line.size()-2);
|
|
}
|
|
else
|
|
{
|
|
/* New value. */
|
|
size_t iEqualIndex = line.find("=");
|
|
if( iEqualIndex != string::npos )
|
|
{
|
|
RString valuename = line.Left( (int) iEqualIndex );
|
|
RString value = line.Right( line.size()-valuename.size()-1 );
|
|
if( keyname.size() && valuename.size() )
|
|
SetValue( keyname, valuename, value );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
bool IniFile::WriteFile( const RString &sPath ) const
|
|
{
|
|
RageFile f;
|
|
if( !f.Open( sPath, RageFile::WRITE ) )
|
|
{
|
|
LOG->Trace( "Writing '%s' failed: %s", sPath.c_str(), f.GetError().c_str() );
|
|
m_sError = f.GetError();
|
|
return false;
|
|
}
|
|
|
|
bool bSuccess = IniFile::WriteFile( f );
|
|
int iFlush = f.Flush();
|
|
bSuccess &= (iFlush != -1);
|
|
return bSuccess;
|
|
}
|
|
|
|
bool IniFile::WriteFile( RageFileBasic &f ) const
|
|
{
|
|
FOREACH_CONST_Child( this, pKey )
|
|
{
|
|
if( f.PutLine( ssprintf("[%s]", pKey->GetName().c_str()) ) == -1 )
|
|
{
|
|
m_sError = f.GetError();
|
|
return false;
|
|
}
|
|
|
|
FOREACH_CONST_Attr( pKey, pAttr )
|
|
{
|
|
const RString &sName = pAttr->first;
|
|
const RString &sValue = pAttr->second->GetValue<RString>();
|
|
|
|
// TODO: Are there esacpe rules for these?
|
|
DEBUG_ASSERT( sName.find('\n') == sName.npos );
|
|
DEBUG_ASSERT( sName.find('=') == sName.npos );
|
|
|
|
if( f.PutLine( ssprintf("%s=%s", sName.c_str(), sValue.c_str()) ) == -1 )
|
|
{
|
|
m_sError = f.GetError();
|
|
return false;
|
|
}
|
|
}
|
|
|
|
if( f.PutLine( "" ) == -1 )
|
|
{
|
|
m_sError = f.GetError();
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool IniFile::DeleteValue(const RString &keyname, const RString &valuename)
|
|
{
|
|
XNode* pNode = GetChild( keyname );
|
|
if( pNode == NULL )
|
|
return false;
|
|
return pNode->RemoveAttr( valuename );
|
|
}
|
|
|
|
|
|
bool IniFile::DeleteKey(const RString &keyname)
|
|
{
|
|
XNode* pNode = GetChild( keyname );
|
|
if( pNode == NULL )
|
|
return false;
|
|
return RemoveChild( pNode );
|
|
}
|
|
|
|
bool IniFile::RenameKey(const RString &from, const RString &to)
|
|
{
|
|
/* If to already exists, do nothing. */
|
|
if( GetChild(to) != NULL )
|
|
return false;
|
|
|
|
XNode* pNode = GetChild( from );
|
|
if( pNode == NULL )
|
|
return false;
|
|
|
|
pNode->SetName( to );
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
/*
|
|
* (c) 2001-2004 Adam Clauss, Chris Danford
|
|
* All rights reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, and/or sell copies of the Software, and to permit persons to
|
|
* whom the Software is furnished to do so, provided that the above
|
|
* copyright notice(s) and this permission notice appear in all copies of
|
|
* the Software and that both the above copyright notice(s) and this
|
|
* permission notice appear in supporting documentation.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
|
|
* THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS
|
|
* INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT
|
|
* OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
|
|
* OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
|
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
* PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|