/* 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/Blocks/If.h"
#include "ilengineer/Blocks/Else.h"

#include "ilengineer/Ops/MSIL/Branch.h"

void ILEngineer::Block::OptimizeElse() {
	for (StatementVector::iterator stI(m_Statements.begin()); stI != m_Statements.end(); stI++)
		if ((*stI)->isBlock()) {
			dynamic_cast<Block *>(*stI)->OptimizeElse();
			Blocks::If *bif = dynamic_cast<Blocks::If *>(*stI);
			if (bif != NULL && bif->getStatements().size() > 0) {
				Statement *st = bif->getStatements().back();
				if (!st->isBlock()) {
					Ops::MSIL::Branch *branch = dynamic_cast<Ops::MSIL::Branch *>(st->getOperations()[0]);
					if (branch != NULL) {
						if (branch->getTarget() == m_End) {
							Blocks::Else *unless = new Blocks::Else(m_Method, branch->getTarget(), (*(++stI))->getOffset());
							while(stI != m_Statements.end()) {
								unless->getStatements().push_back(*stI);
								m_Statements.erase(stI);
							}

							m_Statements.insert(stI, unless);
							unless->OptimizeElse();
							bif->getStatements().erase(bif->getStatements().end() - 1);
							delete st;
						} else if (branch != NULL && branch->getTarget() > bif->getEnd()) {
							Statement::Reference ref;
							Find(branch->getTarget(), ref);
							if (ref.stV == &m_Statements) {
								Blocks::Else *unless = new Blocks::Else(m_Method, branch->getTarget(), (*(++stI))->getOffset());
								while((*stI)->getOffset() != branch->getTarget()) {
									unless->getStatements().push_back(*stI);
									m_Statements.erase(stI);
								}

								m_Statements.insert(stI, unless);
								unless->OptimizeElse();
								bif->getStatements().erase(bif->getStatements().end() - 1);
								delete st;
							}
						}
					}
				}
			}
		}
}