File:  [gforth] / gforth / Attic / m68k.h
Revision 1.7: download - view: text, annotated - select for diffs
Sun Oct 13 19:56:22 1996 UTC (27 years, 5 months ago) by pazsan
Branches: MAIN
CVS tags: v0-2-1, v0-2-0, HEAD
Some fixes to run on Next

    1: /* This is the machine-specific part for the 68000 and family
    2: 
    3:   Copyright (C) 1995 Free Software Foundation, Inc.
    4: 
    5:   This file is part of Gforth.
    6: 
    7:   Gforth is free software; you can redistribute it and/or
    8:   modify it under the terms of the GNU General Public License
    9:   as published by the Free Software Foundation; either version 2
   10:   of the License, or (at your option) any later version.
   11: 
   12:   This program is distributed in the hope that it will be useful,
   13:   but WITHOUT ANY WARRANTY; without even the implied warranty of
   14:   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   15:   GNU General Public License for more details.
   16: 
   17:   You should have received a copy of the GNU General Public License
   18:   along with this program; if not, write to the Free Software
   19:   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
   20: */
   21: 
   22: #include "32bit.h"
   23: 
   24: /* Clearing the whole cache is a bit drastic, but this is the only
   25:  *    cache control available on the apollo and NeXT
   26:  */
   27: #if defined(apollo)
   28: #  define FLUSH_ICACHE(addr,size)    cache_$clear()
   29: #else
   30: #  if defined(NeXT)
   31: #    define FLUSH_ICACHE(addr,size)     asm("trap #2");
   32: #  endif
   33: #endif
   34: 
   35: #ifdef DIRECT_THREADED
   36: #warning untested
   37: /* PFA gives the parameter field address corresponding to a cfa */
   38: #define PFA(cfa)	(((Cell *)cfa)+2)
   39: /* PFA1 is a special version for use just after a NEXT1 */
   40: #define PFA1(cfa)	PFA(cfa)
   41: /* CODE_ADDRESS is the address of the code jumped to through the code field */
   42: #define CODE_ADDRESS(cfa)	(*(Label *)(((char *)(cfa))+2))
   43: /* MAKE_CF creates an appropriate code field at the cfa;
   44:    ca is the code address */
   45: #define MAKE_CF(cfa,ca)		({short * _cfa = (short *)cfa; \
   46: 				  _cfa[0] = 0x4ef9; /* jmp.l */ \
   47: 				  *(long *)(_cfa+1) = (long)(ca);})
   48: 
   49: /* this is the point where the does code for the word with the xt cfa
   50:    starts. */
   51: #define DOES_CODE(cfa) \
   52:      ({ short *_cfa=(short *)(cfa); \
   53: 	short *_ca;
   54: 	((_cfa[0] == 0x4ef9 \
   55: 	  && (_ca=CODE_ADDRESS(cfa), _ca[0] == 0x4ef9) \
   56: 	  && *(long *)(_cfa+1) == &&docol) \
   57: 	 ? ((unsigned)_ca)+DOES_HANDLER_SIZE \
   58: 	 : 0); })
   59: 
   60: /* this is a special version of DOES_CODE for use in dodoes */
   61: #define DOES_CODE1(cfa)	((Xt *)(((char *)CODE_ADDRESS(cfa))+DOES_HANDLER_SIZE))
   62: 
   63: /* this stores a call dodoes at addr */
   64: #define MAKE_DOES_HANDLER(addr) MAKE_CF(addr,symbols[DODOES])
   65: 
   66: #define DOES_HANDLER_SIZE       8
   67: 
   68: #define MAKE_DOES_CF(addr,doesp)   MAKE_CF(addr,((int)(doesp)-8))
   69: #endif
   70: 

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>