view lwasm/pass3.c @ 417:d7b7004b0883

Update gcc6809 patch to fix an ICE. Add new gcc6809 patch with a fix to an internal compiler error reported by Tormod Volden. It seems whoever created the offending instruction patterns didn't fully understand the instruction contraints system and likely got away with it due to characteristics of the instruction generator in previous versions of gcc. Alas, it causes problems now so unless someone has a brilliant idea how to make it work, addhi_mem_1 and addhi_mem_minus1 have to go. Fortunately, the compiler is smart enough to use an alternate strategy all on its own.
author William Astle <lost@l-w.ca>
date Sun, 27 Mar 2016 21:46:18 -0600
parents 697bc543368c
children
line wrap: on
line source

/*
pass3.c

Copyright © 2010 William Astle

This file is part of LWTOOLS.

LWTOOLS is free software: you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation, either version 3 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 General Public License along with
this program. If not, see <http://www.gnu.org/licenses/>.
*/

#include <stdio.h>
#include <string.h>

#include <lw_alloc.h>
#include <lw_string.h>

#include "lwasm.h"
#include "instab.h"

/*
Resolve1 Pass

repeatedly resolve instruction sizes and line addresses
until nothing more reduces

*/
void do_pass3(asmstate_t *as)
{
	int rc;
	line_t *cl;
	struct line_expr_s *le;
	
	do
	{
		rc = 0;
		for (cl = as -> line_head; cl; cl = cl -> next)
		{
			as -> cl = cl;
			
			// simplify address
			lwasm_reduce_expr(as, cl -> addr);
		
			// simplify data address
			lwasm_reduce_expr(as, cl -> daddr);

			// simplify each expression
			for (le = cl -> exprs; le; le = le -> next)
				lwasm_reduce_expr(as, le -> expr);
			
			if (cl -> len == -1 || cl -> dlen == -1)
			{
				// try resolving the instruction length
				// but don't force resolution
				if (cl -> insn >= 0 && instab[cl -> insn].resolve)
				{
					(instab[cl -> insn].resolve)(as, cl, 0);
					debug_message(as, 100, "len = %d, dlen = %d", cl -> len, cl -> dlen);
					if ((cl -> inmod == 0) && cl -> len >= 0 && cl -> dlen >= 0)
					{
						if (cl -> len == 0)
							cl -> len = cl -> dlen;
						else
							cl -> dlen = cl -> len;
					}
					if (cl -> len != -1 && cl -> dlen != -1)
						rc++;
				}
			}
		}
		if (as -> errorcount > 0)
			return;
	} while (rc > 0);
}