You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
tdevelop/buildtools/lib/parsers/qmake/qmakeast.cpp

171 lines
4.3 KiB

/***************************************************************************
* Copyright (C) 2005 by Alexander Dymo *
* adymo@kdevelop.org *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU Library General Public License as *
* published by the Free Software Foundation; either version 2 of the *
* License, or (at your option) any later version. *
* *
* 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 Library General Public *
* License along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include "qmakeast.h"
#include <kdebug.h>
namespace TQMake {
//AST
AST::~AST()
{
for (TQValueList<AST*>::iterator it = m_tqchildren.begin(); it != m_tqchildren.end(); ++it)
{
AST *node = *it;
delete node;
}
m_tqchildren.clear();
}
void AST::addChildAST(AST *node)
{
m_tqchildren.append(node);
}
void AST::removeChildAST(AST *node)
{
m_tqchildren.remove(node);
}
void AST::writeBack(TQString &buffer)
{
for (TQValueList<AST*>::const_iterator it = m_tqchildren.constBegin();
it != m_tqchildren.constEnd(); ++it)
{
if (*it)
{
(*it)->writeBack(buffer);
}
}
}
TQString AST::indentation()
{
TQString result;
for (int i = 0; i < depth(); i++)
result += " ";
return result;
}
//ProjectAST
void ProjectAST::writeBack(TQString &buffer)
{
bool hasActualStatements = false;
for (TQValueList<TQMake::AST*>::const_iterator it = m_tqchildren.begin(); it != m_tqchildren.end(); ++it)
{
if ((*it)->nodeType() != AST::IncludeAST)
{
hasActualStatements = true;
break;
}
}
if (isScope())
{
if( !buffer.endsWith(": ") )
buffer += indentation();
buffer += scopedID;
if( m_tqchildren.count() == 1 )
buffer += " : ";
else
buffer += " {";
}
else if (isFunctionScope())
{
if( !buffer.endsWith(": ") )
buffer += indentation();
buffer += scopedID + "(" + args + ")";
if( m_tqchildren.count() == 1 && hasActualStatements )
buffer += ": ";
else if( (m_tqchildren.count() > 0 && hasActualStatements) )
buffer += "{";
else
buffer += "";
}
else if( !buffer.endsWith(": ") )
buffer += indentation();
AST::writeBack(buffer);
if (isScope() && m_tqchildren.count() > 1 )
buffer += indentation() + "}";
if (isFunctionScope() && (hasActualStatements) && m_tqchildren.count() > 1)
buffer += indentation() + "}";
}
void ProjectAST::setLineEnding( ProjectAST::LineEnding l )
{
m_lineEnding = l;
}
ProjectAST::LineEnding ProjectAST::lineEnding()
{
return m_lineEnding;
}
//AssignmentAST
AssignmentAST::~AssignmentAST()
{
}
void AssignmentAST::writeBack(TQString &buffer)
{
if( !buffer.endsWith(": ") )
buffer += indentation();
buffer += scopedID + " " + op;
if( values.first().stripWhiteSpace() != "" )
buffer += " ";
buffer += values.join("");
}
//NewLineAST
void NewLineAST::writeBack(TQString &buffer)
{
buffer += "\n";
}
//CommentAST
void CommentAST::writeBack(TQString &buffer)
{
if( !buffer.endsWith(": ") )
buffer += indentation();
buffer += comment;
}
//IncludeAST
void IncludeAST::writeBack(TQString &/*buffer*/)
{
}
}
// kate: space-indent on; indent-width 4; tab-width 4; replace-tabs on