add_id.c: *  Add the new definiton of the id to the symbol table and adjust Idtable.
add_id.c: *      defnode->previous_definition = previous definition (from Idtable)
add_id.c: *      Update Idtable
add_id.c:# include "Idtable.h"
add_id.icn:#  Add the new definiton of the id to the symbol table and adjust Idtable.
add_id.icn:#      defnode.previous_definition = previous definition (from Idtable)
add_id.icn:#      Update Idtable
add_id.icn:# include "Idtable.h"
add_id.icn~:#  Add the new definiton of the id to the symbol table and adjust Idtable.
add_id.icn~:#      defnode.previous_definition = previous definition (from Idtable)
add_id.icn~:#      Update Idtable
add_id.icn~:# include "Idtable.h"
add_id.tmp.icn:#  Add the new definiton of the id to the symbol table and adjust Idtable.
add_id.tmp.icn:#      defnode.previous_definition = previous definition (from Idtable)
add_id.tmp.icn:#      Update Idtable
add_id.tmp.icn:# include "Idtable.h"
Idtable.h: *	Idtable is a 1-1 map between identifier names (represented by
Idtable.h:Identry * Idtable;
process_id.c: *  point it at the last definition of that id (as given in Idtable).
process_id.c:# include "Idtable.h"
process_id.icn:#  point it at the last definition of that id (as given in Idtable).
process_id.icn~: *  point it at the last definition of that id (as given in Idtable).
process_id.icn~:# include "Idtable.h"
process_id.tmp.icn:#  point it at the last definition of that id (as given in Idtable).
restore.c: *  the Idtable.
restore.c:# include "Idtable.h"
restore.icn: #  the Idtable.
restore.icn:# include "Idtable.h"
restore.icn~: #  the Idtable.
restore.icn~:# include "Idtable.h"
restore.tmp.icn: #  the Idtable.
restore.tmp.icn:# include "Idtable.h"
retrieve.c:# include "Idtable.h"
retrieve.c:	return ( &Idtable[retr1(key, 0, sttnstrings-1)] );
retrieve.c: *	Hidden routine to search Idtable between the bounds f and l for the entry
retrieve.c:    	if ( f > l || Idtable[f].i_sttindx > key || Idtable[l].i_sttindx < key) {
retrieve.c:				( ((long)(l-f)) * ((long)(key-Idtable[f].i_sttindx)) ) /
retrieve.c:					( (int) (Idtable[l].i_sttindx - Idtable[f].i_sttindx) ); */
retrieve.c:			r= ( ((long)(l-f)) * ((long)(key-Idtable[f].i_sttindx)) ); 
retrieve.c:			t=		( (int) (Idtable[l].i_sttindx - Idtable[f].i_sttindx) );
retrieve.c:		if ( Idtable[c].i_sttindx == key )
retrieve.c:    	else if ( key < Idtable[c].i_sttindx ) {
retrieve.icn:    return Idtable[key]
retrieve.icn~:# include "Idtable.h"
retrieve.icn~:	return ( &Idtable[retr1(key, 0, sttnstrings-1)] );
retrieve.icn~: *	Hidden routine to search Idtable between the bounds f and l for the entry
retrieve.icn~:    	if ( f > l || Idtable[f].i_sttindx > key || Idtable[l].i_sttindx < key) {
retrieve.icn~:				( ((long)(l-f)) * ((long)(key-Idtable[f].i_sttindx)) ) /
retrieve.icn~:					( (int) (Idtable[l].i_sttindx - Idtable[f].i_sttindx) ); */
retrieve.icn~:			r= ( ((long)(l-f)) * ((long)(key-Idtable[f].i_sttindx)) ); 
retrieve.icn~:			t=		( (int) (Idtable[l].i_sttindx - Idtable[f].i_sttindx) );
retrieve.icn~:		if ( Idtable[c].i_sttindx == key )
retrieve.icn~:    	else if ( key < Idtable[c].i_sttindx ) {
retrieve.tmp.icn:    return Idtable[key]
rettest.c:# include "Idtable.h"
