DataMuseum.dk

Presents historical artifacts from the history of:

DKUUG/EUUG Conference tapes

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about DKUUG/EUUG Conference tapes

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - download
Index: ┃ T r

⟦50ad83662⟧ TextFile

    Length: 4315 (0x10db)
    Types: TextFile
    Names: »regblock.c«

Derivation

└─⟦a0efdde77⟧ Bits:30001252 EUUGD11 Tape, 1987 Spring Conference Helsinki
    └─ ⟦this⟧ »EUUGD11/gnu-31mar87/scheme/microcode/regblock.c« 

TextFile

/*          Hey EMACS, this is -*- C -*- code!                 */

/****************************************************************
*                                                               *
*                         Copyright (c) 1984                    *
*               Massachusetts Institute of Technology           *
*                                                               *
* This material was developed by the Scheme project at the      *
* Massachusetts Institute of Technology, Department of          *
* Electrical Engineering and Computer Science.  Permission to   *
* copy this software, to redistribute it, and to use it for any *
* purpose is granted, subject to the following restrictions and *
* understandings.                                               *
*                                                               *
* 1. Any copy made of this software must include this copyright *
* notice in full.                                               *
*                                                               *
* 2. Users of this software agree to make their best efforts (a)*
* to return to the MIT Scheme project any improvements or       *
* extensions that they make, so that these may be included in   *
* future releases; and (b) to inform MIT of noteworthy uses of  *
* this software.                                                *
*                                                               *
* 3.  All materials developed as a consequence of the use of    *
* this software shall duly acknowledge such use, in accordance  *
* with the usual standards of acknowledging credit in academic  *
* research.                                                     *
*                                                               *
* 4. MIT has made no warrantee or representation that the       *
* operation of this software will be error-free, and MIT is     *
* under no obligation to provide any services, by way of        *
* maintenance, update, or otherwise.                            *
*                                                               *
* 5.  In conjunction with products arising from the use of this *
* material, there shall be no use of the name of the            *
* Massachusetts Institute of Technology nor of any adaptation   *
* thereof in any advertising, promotional, or sales literature  *
* without prior written consent from MIT in each case.          *
*                                                               *
****************************************************************/
\f


#include "scheme.h"

#ifdef COMPILER

extern Out_Of_Stack(), Out_Of_Heap_On_Entry(),
       Compiler_Apply(), Comp_Lex_Symbol_Ref(),
       Comp_Lex_Ref(), Comp_Local_Set(), Comp_Lex_Set(),
       Wrong_NArgs(), Convert_To_Heap(), Convert_Lexpr(),
       Reformat_Stack(), Reformat_Lexpr(),
       Out_Of_Heap_On_Recursion(), Stop_Popping();

Pointer Registers[] =
{           NIL,		/* 00: Val */
            NIL,		/* 01: Lowest stack address */
            NIL,		/* 02: Highest heap address */
  (Pointer) Out_Of_Stack,	/* 03: Error: no stack space */
  (Pointer) Out_Of_Heap_On_Entry, /* 04: Error: no heap space */
  (Pointer) Compiler_Apply,	/* 05: Apply a function */
  (Pointer) Comp_Lex_Symbol_Ref,/* 06: Lexical symbol reference */
  (Pointer) Comp_Lex_Ref,	/* 07: Lexical reference */
  (Pointer) Comp_Local_Set,	/* 08: Local set */
  (Pointer) Comp_Lex_Set,	/* 09: Lexical set */
  (Pointer) Wrong_NArgs,	/* 10: Error: wrong no. args. */
  (Pointer) Convert_To_Heap,	/* 11: Stack frame to heap */
  (Pointer) Convert_Lexpr,	/* 12: Stack frame to heap lexpr */
  (Pointer) Reformat_Stack,	/* 13: Stack frame to compiler format */
  (Pointer) Reformat_Lexpr,	/* 14: Stack frame to compiler w/lexpr */
  (Pointer) Out_Of_Heap_On_Recursion,
				/* 15: Error: no heap space */
  (Pointer) Stop_Popping,	/* 16: Stack Popper Stopper */
  NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL,
  NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL,
  NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL,
  NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL,
  NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL, NIL
                                /* 17: 25 Compiler Displays */
                                /* 42: 25 Compiler Temporaries */
};

#endif