File indexing completed on 2024-04-21 04:36:14

 /* This file is part of kdev-pg-qt
    Copyright (C) 2005 Roberto Raggi <roberto@kdevelop.org>
    Copyright (C) 2006 Jakob Petsovits <jpetso@gmx.at>
 
    This library 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 library 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
    Library General Public License for more details.
 
    You should have received a copy of the GNU Library General Public License
    along with this library; see the file COPYING.LIB.  If not, write to
    the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
    Boston, MA 02110-1301, USA.
 */
 
 #include "kdev-pg-default-visitor-bits-gen.h"
 #include "kdev-pg.h"
 #include <iostream>
 
 namespace KDevPG
 {
 
 void GenerateDefaultVisitorBitsRule::operator()(QPair<QString,Model::SymbolItem*> const &__it)
 {
   mNames.clear();
   mVariableDeclarations.clear();
 
   Model::SymbolItem *sym = __it.second;
 
   bool has_members = false;
   HasMemberNodes hms(has_members);
   hms(sym);
 
   #define O(ast) \
       out << "void " << name << "::visit" << ast \
       << "(" << ast << "Ast *" << (has_members ? "node" : "") \
       << ") {" << Qt::endl;
       
   if(isOperatorSymbol(sym))
   {
     O("Prefix" + sym->mCapitalizedName)
     out << "visitNode(node->first);" << Qt::endl << "}" << Qt::endl << Qt::endl;
     O("Postfix" + sym->mCapitalizedName)
     out << "visitNode(node->first);" << Qt::endl << "}" << Qt::endl << Qt::endl;
     O("Binary" + sym->mCapitalizedName)
     out << "visitNode(node->first);" << Qt::endl << "visitNode(node->second); }" << Qt::endl << Qt::endl;
     O("Ternary" + sym->mCapitalizedName)
     out << "visitNode(node->first);" << Qt::endl << "visitNode(node->second);" << Qt::endl << "visitNode(node->third);";
   }
   else
   {
     O(sym->mCapitalizedName)
 
     World::Environment::iterator it = globalSystem.env.find(sym);
     while (it != globalSystem.env.end())
       {
         Model::EvolveItem *e = (*it);
         if (it.key() != sym)
           break;
 
         ++it;
 
         visitNode(e);
       }
   }
 
   out << "}" << Qt::endl << Qt::endl;
   
   #undef O
 }
 
 void GenerateDefaultVisitorBitsRule::visitVariableDeclaration(Model::VariableDeclarationItem *node)
 {
   do
   {
     if (node->mStorageType != Model::VariableDeclarationItem::StorageAstMember)
       break;
 
     if (node->mVariableType != Model::VariableDeclarationItem::TypeNode)
       break; // nothing to do
 
     if (mNames.find(node->mName) != mNames.end())
       break;
 
     QString base_type = node->mCapitalizedType + "Ast*";
 
     if (node->mIsSequence)
       {
         out << "if (" << "node->" << node->mName << "Sequence" << ") {"
             << "const KDevPG::ListNode<" << base_type << "> *__it = "
             << "node->" << node->mName << "Sequence" << "->front()"
             << ", *__end = __it;" << Qt::endl
             << "do {" << Qt::endl
             << "visitNode(__it->element);" << Qt::endl
             << "__it = __it->next;" << Qt::endl
             << "} while (__it != __end);" << Qt::endl
             << "}" << Qt::endl;
       }
     else
       {
         out << "visitNode(" << "node->" << node->mName << ")" << ";" << Qt::endl;
       }
 
     mNames.insert(node->mName);
     mVariableDeclarations.push_back(node);
 
   } while(false);
 
   DefaultVisitor::visitVariableDeclaration(node);
 }
 
 
 void HasMemberNodes::operator()(Model::SymbolItem *sym)
 {
   if(isOperatorSymbol(sym))
   {
     has_members = true;
     return;
   }
   
   has_members = false;
 
   World::Environment::iterator it = globalSystem.env.find(sym);
   while (it != globalSystem.env.end())
     {
       Model::EvolveItem *e = (*it);
       if (it.key() != sym)
         break;
 
       ++it;
 
       visitNode(e);
     }
 }
 
 void HasMemberNodes::visitVariableDeclaration(Model::VariableDeclarationItem *node)
 {
   if (node->mStorageType == Model::VariableDeclarationItem::StorageAstMember
       && node->mVariableType == Model::VariableDeclarationItem::TypeNode)
     {
       has_members = true;
     }
 }
 
 }