github.com/Interlisp.maiko
1
0
Fork 0
mirror of https://github.com/Interlisp/maiko.git synced 2026-01-16 16:19:10 +00:00
Code Issues Projects Releases Wiki Activity

Rearrange code to avoid forward references. Add missing void declarations. Add parentheses to suppress warning for use of assignment in if-condition.

Browse Source
This commit is contained in:
Nick Briggs 2017-05-24 17:23:34 -07:00
parent ba246fa721
commit 569d1187d6
1 changed files with 77 additions and 77 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

154
src/conspage.c
View File

@ -33,6 +33,81 @@ static char *id = "$Id: conspage.c,v 1.3 1999/05/31 23:35:27 sybalsky Exp $ Copy
#include "lspglob.h"
#include "gc.h"
/************************************************************************/
/* */
/* i n i t _ c o n s p a g e */
/* */
/* Initialize a fresh page of CONS cells. Sets the count field */
/* and chains the cells together for ease of searching. */
/* */
/* A fresh CONS page looks like this: */
/* */
/* +--------+--------+----------------+ */
/* 0 | count | nxtcell| (padding) | nxtcell = 254. */
/* +--------+--------+----------------+ */
/* 2 | next_page | */
/* +--------+-------------------------+ */
/* 4 | 0 | N I L | */
/* +--------+-------------------------+ */
/* 6 | 4 | N I L | */
/* +--------+-------------------------+ */
/* ... | ... | N I L | */
/* +--------+-------------------------+ */
/* 254 | 252 | N I L | */
/* +--------+-------------------------+ */
/* */
/* The cells are chained together thru their high 8 bits, */
/* using the word offset within page as the chain. Cells */
/* are chained from the top of the page down. */
/* */
/* Experimental version goes nxtcell = 248 */
/* count/nxtcell in cell 4, next_page in cell 6 */
/* Chain up 4 down 8 ( ^ 6 into word count) */
/* */
/* */
/* */
/* */
/************************************************************************/
void init_conspage(register struct conspage *base, unsigned int link)
/* Page Base */
/* Prev Link page number DL->int*/
{
register ConsCell *cell ;
register int j ; /* DL-> int */
#ifdef TRACE2
printf("TRACE: init_conspage()\n");
#endif
#ifdef NEWCDRCODING
base -> next_cell= 6^(j = 254) ;
while (j > 8)
{
cell = (ConsCell *)((DLword *)base + (6 ^ j) );
cell->car_field = NIL_PTR ;
j -= 2;
((freecons *)cell)->next_free = (6^j) ;
}
base -> count = 124;
#else
base -> next_cell= j = 254 ;
while(j != 0)
{
cell = (ConsCell *)((DLword *)base + (j) );
cell->car_field = NIL_PTR ;
j -= 2;
((freecons *)cell)->next_free = (j) ;
}
base -> count = 127 ;
#endif /* NEWCDRCODING */
base -> next_page = link ;
} /* init_conspage end */
/**********************************************************************/
/*
Func name : next_conspage
@ -112,81 +187,6 @@ ex :
/************************************************************************/
/* */
/* i n i t _ c o n s p a g e */
/* */
/* Initialize a fresh page of CONS cells. Sets the count field */
/* and chains the cells together for ease of searching. */
/* */
/* A fresh CONS page looks like this: */
/* */
/* +--------+--------+----------------+ */
/* 0 | count | nxtcell| (padding) | nxtcell = 254. */
/* +--------+--------+----------------+ */
/* 2 | next_page | */
/* +--------+-------------------------+ */
/* 4 | 0 | N I L | */
/* +--------+-------------------------+ */
/* 6 | 4 | N I L | */
/* +--------+-------------------------+ */
/* ... | ... | N I L | */
/* +--------+-------------------------+ */
/* 254 | 252 | N I L | */
/* +--------+-------------------------+ */
/* */
/* The cells are chained together thru their high 8 bits, */
/* using the word offset within page as the chain. Cells */
/* are chained from the top of the page down. */
/* */
/* Experimental version goes nxtcell = 248 */
/* count/nxtcell in cell 4, next_page in cell 6 */
/* Chain up 4 down 8 ( ^ 6 into word count) */
/* */
/* */
/* */
/* */
/************************************************************************/
init_conspage(register struct conspage *base, unsigned int link)
/* Page Base */
/* Prev Link page number DL->int*/
{
register ConsCell *cell ;
register int j ; /* DL-> int */
#ifdef TRACE2
printf("TRACE: init_conspage()\n");
#endif
#ifdef NEWCDRCODING
base -> next_cell= 6^(j = 254) ;
while (j > 8)
{
cell = (ConsCell *)((DLword *)base + (6 ^ j) );
cell->car_field = NIL_PTR ;
j -= 2;
((freecons *)cell)->next_free = (6^j) ;
}
base -> count = 124;
#else
base -> next_cell= j = 254 ;
while(j != 0)
{
cell = (ConsCell *)((DLword *)base + (j) );
cell->car_field = NIL_PTR ;
j -= 2;
((freecons *)cell)->next_free = (j) ;
}
base -> count = 127 ;
#endif /* NEWCDRCODING */
base -> next_page = link ;
} /* init_conspage end */
/************************************************************************/
/* */
/* f i n d _ c d r c o d a b l e _ p a i r */
@ -278,7 +278,7 @@ ConsCell * find_cdrcodable_pair(LispPTR cdrval)
for (pg = (struct conspage *)Addr68k_from_LPAGE(pgno); pgno;
pg = (struct conspage *)Addr68k_from_LPAGE(pgno = pg->next_page))
if (cell = find_pair_in_page(pg, cdrval)) return(cell);
if ((cell = find_pair_in_page(pg, cdrval))) return(cell);
pg = next_conspage();
cell = find_pair_in_page(pg,cdrval);
@ -355,7 +355,7 @@ N_OP_cons(register int cons_car, register int cons_cdr)
if(cons_cdr == NIL_PTR)
{
#ifdef NEWCDRCODING
if (new_cell = find_free_cons_cell())
if ((new_cell = find_free_cons_cell()))
{ /* next page has 1 or more free cells */
#else
if ((ListpDTD->dtd_nextpage != 0)