/* ILEngineer - Crummy .NET Decompiler
 * Copyright (C) 2001-2002  Jay Freeman (saurik)
*/

/*
 *        Redistribution and use in source and binary
 * forms, with or without modification, are permitted
 * provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the
 *    above copyright notice, this list of conditions
 *    and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the
 *    above copyright notice, this list of conditions
 *    and the following disclaimer in the documentation
 *    and/or other materials provided with the
 *    distribution.
 * 3. The name of the author may not be used to endorse
 *    or promote products derived from this software
 *    without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS''
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
 * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

#include "stdafx.h"
#include "ilengineer/Block.h"

#include "ilengineer/Ops/MSIL/Duplicate.h"
#include "ilengineer/Ops/MSIL/Store.h"

void ILEngineer::Block::OptimizeInline() {
	for (StatementVector::iterator stI(m_Statements.begin()); stI != m_Statements.end(); stI++)
		if ((*stI)->isBlock())
			dynamic_cast<Block *>(*stI)->OptimizeInline();

	for (stI = m_Statements.begin(); stI < m_Statements.end() - 1; stI++)
		if (!(*stI)->isBlock()) {
			Ops::MSIL::Store *store = dynamic_cast<Ops::MSIL::Store *>((*stI)->getOperations()[0]);
			if (store != NULL && typeid(*store->getValue()) == typeid(Ops::MSIL::Duplicate)) {
				Ops::MSIL::Duplicate *dup1 = dynamic_cast<Ops::MSIL::Duplicate *>(store->getValue());
				Statement *st = *(stI+1);

				Operation::Reference ref;
				if (st->FindDup(dup1, ref)) {
					store->getValue() = dup1->getValue();
					store->setScope();
					st->setOffset((*stI)->getOffset());

					(*stI)->toTrash();
					delete *stI;
					dup1->toTrash();
					delete dup1;
					(*ref.opI)->toTrash();
					delete *ref.opI;

					*ref.opI = store;
					m_Statements.erase(stI);
					stI = m_Statements.begin();
					stI--;
				}
			}
		}

}