libs/EDoc/TryBlock.cpp

Go to the documentation of this file.

/*******************************************************************************

   Copyright (C) 2007 by Brendon Costa

   This library is free software; you can redistribute it and/or modify 
   it under the terms of the "LGPL Like" License defined in the file COPYING 
   that should have been distributed along with this source.

   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.  

   You should have received a copy of the "LGPL Like" License 
   along with this library; see the file COPYING. if not, it can be 
   obtained from the EDoc++ website: 
   http://edoc.sourceforge.net/license.html

*******************************************************************************/
#include "config.h"

#include "EDoc/TryBlock.h"

#include "EDoc/CodeBlock.h"
#include "EDoc/utils.h"
#include "EDoc/PStack.h"
#include "EDoc/StackRef.h"

#include "EDoc/PersistenceIFace.h"
#include "IndexedDictionary.h"
#include "EDoc/persistence_data.h"

namespace EDoc
{
   //===========================================================================
   TryBlock::TryBlock(Dictionary* dict_in) :
      DictionarySpecific(dict_in),
      try_block(NULL)
   {
      try_block = new CodeBlock(dict_in);
   }
   //===========================================================================
   TryBlock::TryBlock(const TryBlock& right) :
      DictionarySpecific(&right.dict),
      try_block(NULL)
   {
      try_block = new CodeBlock(*right.try_block);
      catch_blocks = right.catch_blocks;
   }
   //===========================================================================
   TryBlock::TryBlock(const TryBlock& right, Dictionary& dict_in) :
      DictionarySpecific(&dict_in),
      try_block(NULL)
   {
      try_block = new CodeBlock(*right.try_block, dict);

      for (size_t i = 0; i < right.catch_blocks.size(); i++)
      {
         catch_blocks.push_back(CatchBlock(right.catch_blocks[i], dict));
      }
   }
   //===========================================================================
   TryBlock::~TryBlock()
   {
      delete try_block;
      try_block = NULL;
   }
   //===========================================================================
   TryBlock& TryBlock::operator=(const TryBlock& right)
   {
      if (this == &right)
      {
         return *this;
      }
      
      *try_block = *right.try_block;

      Erase(catch_blocks);
      for (size_t i = 0; i < right.catch_blocks.size(); i++)
      {
         catch_blocks.push_back(CatchBlock(right.catch_blocks[i], dict));
      }
      
      return *this;
   }
   //===========================================================================
   void TryBlock::Read(PersistenceIFace& file, IndexedDictionary& idict)
   {
      uint32_t size = 0;
      
      try_block->Read(file, idict);
      
      Erase(catch_blocks);
      size = file.ReadUInt32(KEY_CATCH_BLOCKS_LS);
      for (size_t i = 0; i < size; i++)
      {
         catch_blocks.push_back(CatchBlock(&dict));
         catch_blocks.back().Read(file, idict);
      }
   }
   //===========================================================================
   void TryBlock::Write(PersistenceIFace& file) const
   {
      try_block->Write(file);
      
      file.WriteUInt32(KEY_CATCH_BLOCKS_LS, catch_blocks.size());
      for (size_t i = 0; i < catch_blocks.size(); i++)
      {
         catch_blocks[i].Write(file);
      }
   }
   //===========================================================================
   bool TryBlock::operator==(const TryBlock& right) const
   {
      if (catch_blocks.size() != right.catch_blocks.size())
      {
         return false;
      }

      if (!(*try_block == *right.try_block))
      {
         return false;
      }
      
      // @@@Brendon !! Actually order is important for catch blocks. Should look
      // at changing this.
      // Contents is important but order is not.
      for (size_t i = 0; i < catch_blocks.size(); i++)
      {
         bool found = false;
         for (size_t j = 0; j < right.catch_blocks.size(); j++)
         {
            if (catch_blocks[i] == right.catch_blocks[j])
            {
               found = true;
               break;
            }
         }
         
         if (!found)
         {
            return false;
         }
      }
      
      return true;
   }
   //===========================================================================
   std::ostream& TryBlock::Print(std::ostream& out, std::string prefix) const
   {
      out << prefix << "try" << std::endl;
      try_block->Print(out, prefix);
      for (size_t i = 0; i < catch_blocks.size(); i++)
      {
         catch_blocks[i].Print(out, prefix);
      }
      
      return out;
   }
   //===========================================================================
   size_t TryBlock::ReplaceReferences(PStack& stack, void* remove, 
      void* replace)
   {
      size_t count = 0;
      if (!stack.Push(this))
      {
         return count;
      }

      count += try_block->ReplaceReferences(stack, remove, replace);
      for (size_t i = 0; i < catch_blocks.size(); i++)
      {
         count += catch_blocks[i].ReplaceReferences(stack, remove, replace);
      }
      
      return count;
   }
   //===========================================================================
   void TryBlock::ExpandCallGraph(Function& function)
   {
      try_block->ExpandCallGraph(function);
      
      for (size_t i = 0; i < catch_blocks.size(); i++)
      {
         catch_blocks[i].ExpandCallGraph(function);
      }
   }
   //===========================================================================
   void TryBlock::Validate(PStack& stack, const Dictionary& dict_in) const
   {
      StackRef ref(stack, this);
      if (!ref)
      {
         return;
      }
      
      EDOC_ASSERT(&dict == &dict_in, "");
      
      try_block->Validate(stack, dict_in);
      for (size_t i = 0; i < catch_blocks.size(); i++)
      {
         catch_blocks[i].Validate(stack, dict_in);
      }
   }
   //===========================================================================
}

---