1 /* Copyright (C) 1995,1996, 1997 Free Software Foundation, Inc.
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * If you do not wish that, delete this exception notice. */
65 #define var_start(x, y) va_start(x, y)
68 #define var_start(x, y) va_start(x)
72 /* {heap tuning parameters}
74 * These are parameters for controlling memory allocation. The heap
75 * is the area out of which scm_cons, and object headers are allocated.
77 * Each heap cell is 8 bytes on a 32 bit machine and 16 bytes on a
78 * 64 bit machine. The units of the _SIZE parameters are bytes.
79 * Cons pairs and object headers occupy one heap cell.
81 * SCM_INIT_HEAP_SIZE is the initial size of heap. If this much heap is
82 * allocated initially the heap will grow by half its current size
83 * each subsequent time more heap is needed.
85 * If SCM_INIT_HEAP_SIZE heap cannot be allocated initially, SCM_HEAP_SEG_SIZE
86 * will be used, and the heap will grow by SCM_HEAP_SEG_SIZE when more
87 * heap is needed. SCM_HEAP_SEG_SIZE must fit into type scm_sizet. This code
88 * is in scm_init_storage() and alloc_some_heap() in sys.c
90 * If SCM_INIT_HEAP_SIZE can be allocated initially, the heap will grow by
91 * SCM_EXPHEAP(scm_heap_size) when more heap is needed.
93 * SCM_MIN_HEAP_SEG_SIZE is minimum size of heap to accept when more heap
96 * INIT_MALLOC_LIMIT is the initial amount of malloc usage which will
99 * SCM_MTRIGGER_HYSTERESIS is the amount of malloc storage that must be
100 * reclaimed by a GC triggered by must_malloc. If less than this is
101 * reclaimed, the trigger threshold is raised. [I don't know what a
102 * good value is. I arbitrarily chose 1/10 of the INIT_MALLOC_LIMIT to
103 * work around a oscillation that caused almost constant GC.]
106 #define SCM_INIT_HEAP_SIZE (32768L*sizeof(scm_cell))
107 #define SCM_MIN_HEAP_SEG_SIZE (2048L*sizeof(scm_cell))
109 # define SCM_HEAP_SEG_SIZE 32768L
112 # define SCM_HEAP_SEG_SIZE (7000L*sizeof(scm_cell))
114 # define SCM_HEAP_SEG_SIZE (16384L*sizeof(scm_cell))
117 #define SCM_EXPHEAP(scm_heap_size) (scm_heap_size*2)
118 #define SCM_INIT_MALLOC_LIMIT 100000
119 #define SCM_MTRIGGER_HYSTERESIS (SCM_INIT_MALLOC_LIMIT/10)
121 /* CELL_UP and CELL_DN are used by scm_init_heap_seg to find scm_cell aligned inner
122 bounds for allocated storage */
125 /*in 386 protected mode we must only adjust the offset */
126 # define CELL_UP(p) MK_FP(FP_SEG(p), ~7&(FP_OFF(p)+7))
127 # define CELL_DN(p) MK_FP(FP_SEG(p), ~7&FP_OFF(p))
130 # define CELL_UP(p) (SCM_CELLPTR)(~1L & ((long)(p)+1L))
131 # define CELL_DN(p) (SCM_CELLPTR)(~1L & (long)(p))
133 # define CELL_UP(p) (SCM_CELLPTR)(~(sizeof(scm_cell)-1L) & ((long)(p)+sizeof(scm_cell)-1L))
134 # define CELL_DN(p) (SCM_CELLPTR)(~(sizeof(scm_cell)-1L) & (long)(p))
141 * is the head of freelist of cons pairs.
143 SCM scm_freelist
= SCM_EOL
;
146 * is the number of bytes of must_malloc allocation needed to trigger gc.
148 unsigned long scm_mtrigger
;
152 * If set, don't expand the heap. Set only during gc, during which no allocation
153 * is supposed to take place anyway.
155 int scm_gc_heap_lock
= 0;
158 * Don't pause for collection if this is set -- just
162 int scm_block_gc
= 1;
164 /* If fewer than MIN_GC_YIELD cells are recovered during a garbage
165 * collection (GC) more space is allocated for the heap.
167 #define MIN_GC_YIELD (scm_heap_size/4)
169 /* During collection, this accumulates objects holding
172 SCM
*scm_weak_vectors
;
176 /* GC Statistics Keeping
178 unsigned long scm_cells_allocated
= 0;
179 unsigned long scm_mallocated
= 0;
180 unsigned long scm_gc_cells_collected
;
181 unsigned long scm_gc_malloc_collected
;
182 unsigned long scm_gc_ports_collected
;
183 unsigned long scm_gc_rt
;
184 unsigned long scm_gc_time_taken
= 0;
186 SCM_SYMBOL (sym_cells_allocated
, "cells-allocated");
187 SCM_SYMBOL (sym_heap_size
, "cell-heap-size");
188 SCM_SYMBOL (sym_mallocated
, "bytes-malloced");
189 SCM_SYMBOL (sym_mtrigger
, "gc-malloc-threshold");
190 SCM_SYMBOL (sym_heap_segments
, "cell-heap-segments");
191 SCM_SYMBOL (sym_gc_time_taken
, "gc-time-taken");
194 struct scm_heap_seg_data
196 /* lower and upper bounds of the segment */
197 SCM_CELLPTR bounds
[2];
199 /* address of the head-of-freelist pointer for this segment's cells.
200 All segments usually point to the same one, scm_freelist. */
203 /* number of SCM words per object in this segment */
206 /* If SEG_DATA->valid is non-zero, the conservative marking
207 functions will apply SEG_DATA->valid to the purported pointer and
208 SEG_DATA, and mark the object iff the function returns non-zero.
209 At the moment, I don't think anyone uses this. */
216 static void scm_mark_weak_vector_spines
SCM_P ((void));
217 static scm_sizet init_heap_seg
SCM_P ((SCM_CELLPTR
, scm_sizet
, int, SCM
*));
218 static void alloc_some_heap
SCM_P ((int, SCM
*));
222 /* Debugging functions. */
224 #ifdef DEBUG_FREELIST
226 /* Return the number of the heap segment containing CELL. */
232 for (i
= 0; i
< scm_n_heap_segs
; i
++)
233 if (SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], (SCM_CELLPTR
) cell
)
234 && SCM_PTR_GT (scm_heap_table
[i
].bounds
[1], (SCM_CELLPTR
) cell
))
236 fprintf (stderr
, "which_seg: can't find segment containing cell %lx\n",
242 SCM_PROC (s_map_free_list
, "map-free-list", 0, 0, 0, scm_map_free_list
);
246 int last_seg
= -1, count
= 0;
249 fprintf (stderr
, "%d segments total\n", scm_n_heap_segs
);
250 for (f
= scm_freelist
; SCM_NIMP (f
); f
= SCM_CDR (f
))
252 int this_seg
= which_seg (f
);
254 if (this_seg
!= last_seg
)
257 fprintf (stderr
, " %5d cells in segment %d\n", count
, last_seg
);
264 fprintf (stderr
, " %5d cells in segment %d\n", count
, last_seg
);
268 return SCM_UNSPECIFIED
;
272 /* Number of calls to SCM_NEWCELL since startup. */
273 static unsigned long scm_newcell_count
;
275 /* Search freelist for anything that isn't marked as a free cell.
276 Abort if we find something. */
278 scm_check_freelist ()
283 for (f
= scm_freelist
; SCM_NIMP (f
); f
= SCM_CDR (f
), i
++)
284 if (SCM_CAR (f
) != (SCM
) scm_tc_free_cell
)
286 fprintf (stderr
, "Bad cell in freelist on newcell %lu: %d'th elt\n",
287 scm_newcell_count
, i
);
293 static int scm_debug_check_freelist
= 0;
295 scm_debug_newcell (SCM
*into
)
298 if (scm_debug_check_freelist
)
299 scm_check_freelist ();
301 /* The rest of this is supposed to be identical to the SCM_NEWCELL
303 if (SCM_IMP (scm_freelist
))
304 *into
= scm_gc_for_newcell ();
307 *into
= scm_freelist
;
308 scm_freelist
= SCM_CDR (scm_freelist
);
309 ++scm_cells_allocated
;
313 #endif /* DEBUG_FREELIST */
317 /* {Scheme Interface to GC}
320 SCM_PROC (s_gc_stats
, "gc-stats", 0, 0, 0, scm_gc_stats
);
327 SCM local_scm_mtrigger
;
328 SCM local_scm_mallocated
;
329 SCM local_scm_heap_size
;
330 SCM local_scm_cells_allocated
;
331 SCM local_scm_gc_time_taken
;
339 for (i
= scm_n_heap_segs
; i
--; )
340 heap_segs
= scm_cons (scm_cons (scm_ulong2num ((unsigned long)scm_heap_table
[i
].bounds
[1]),
341 scm_ulong2num ((unsigned long)scm_heap_table
[i
].bounds
[0])),
343 if (scm_n_heap_segs
!= n
)
347 local_scm_mtrigger
= scm_mtrigger
;
348 local_scm_mallocated
= scm_mallocated
;
349 local_scm_heap_size
= scm_heap_size
;
350 local_scm_cells_allocated
= scm_cells_allocated
;
351 local_scm_gc_time_taken
= scm_gc_time_taken
;
353 answer
= scm_listify (scm_cons (sym_gc_time_taken
, scm_ulong2num (local_scm_gc_time_taken
)),
354 scm_cons (sym_cells_allocated
, scm_ulong2num (local_scm_cells_allocated
)),
355 scm_cons (sym_heap_size
, scm_ulong2num (local_scm_heap_size
)),
356 scm_cons (sym_mallocated
, scm_ulong2num (local_scm_mallocated
)),
357 scm_cons (sym_mtrigger
, scm_ulong2num (local_scm_mtrigger
)),
358 scm_cons (sym_heap_segments
, heap_segs
),
369 scm_gc_rt
= SCM_INUM (scm_get_internal_run_time ());
370 scm_gc_cells_collected
= 0;
371 scm_gc_malloc_collected
= 0;
372 scm_gc_ports_collected
= 0;
378 scm_gc_rt
= SCM_INUM (scm_get_internal_run_time ()) - scm_gc_rt
;
379 scm_gc_time_taken
= scm_gc_time_taken
+ scm_gc_rt
;
380 scm_system_async_mark (scm_gc_async
);
384 SCM_PROC(s_object_address
, "object-address", 1, 0, 0, scm_object_addr
);
386 scm_object_addr (obj
)
389 return scm_ulong2num ((unsigned long)obj
);
393 SCM_PROC(s_gc
, "gc", 0, 0, 0, scm_gc
);
400 return SCM_UNSPECIFIED
;
405 /* {C Interface For When GC is Triggered}
409 scm_gc_for_alloc (ncells
, freelistp
)
415 if ((scm_gc_cells_collected
< MIN_GC_YIELD
) || SCM_IMP (*freelistp
))
417 alloc_some_heap (ncells
, freelistp
);
424 scm_gc_for_newcell ()
427 scm_gc_for_alloc (1, &scm_freelist
);
429 scm_freelist
= SCM_CDR (fl
);
440 /* During the critical section, only the current thread may run. */
441 SCM_THREAD_CRITICAL_SECTION_START
;
444 /* fprintf (stderr, "gc: %s\n", what); */
447 if (!scm_stack_base
|| scm_block_gc
)
456 /* unprotect any struct types with no instances */
462 pos
= &scm_type_obj_list
;
463 type_list
= scm_type_obj_list
;
464 while (type_list
!= SCM_EOL
)
465 if (SCM_VELTS (SCM_CAR (type_list
))[scm_struct_i_refcnt
])
467 pos
= SCM_CDRLOC (type_list
);
468 type_list
= SCM_CDR (type_list
);
472 *pos
= SCM_CDR (type_list
);
473 type_list
= SCM_CDR (type_list
);
478 /* flush dead entries from the continuation stack */
483 elts
= SCM_VELTS (scm_continuation_stack
);
484 bound
= SCM_LENGTH (scm_continuation_stack
);
485 x
= SCM_INUM (scm_continuation_stack_ptr
);
488 elts
[x
] = SCM_BOOL_F
;
495 /* Protect from the C stack. This must be the first marking
496 * done because it provides information about what objects
497 * are "in-use" by the C code. "in-use" objects are those
498 * for which the values from SCM_LENGTH and SCM_CHARS must remain
499 * usable. This requirement is stricter than a liveness
500 * requirement -- in particular, it constrains the implementation
501 * of scm_vector_set_length_x.
503 SCM_FLUSH_REGISTER_WINDOWS
;
504 /* This assumes that all registers are saved into the jmp_buf */
505 setjmp (scm_save_regs_gc_mark
);
506 scm_mark_locations ((SCM_STACKITEM
*) scm_save_regs_gc_mark
,
507 ( (scm_sizet
) (sizeof (SCM_STACKITEM
) - 1 +
508 sizeof scm_save_regs_gc_mark
)
509 / sizeof (SCM_STACKITEM
)));
512 /* stack_len is long rather than scm_sizet in order to guarantee that
513 &stack_len is long aligned */
514 #ifdef SCM_STACK_GROWS_UP
516 long stack_len
= (SCM_STACKITEM
*) (&stack_len
) - scm_stack_base
;
518 long stack_len
= scm_stack_size (scm_stack_base
);
520 scm_mark_locations (scm_stack_base
, (scm_sizet
) stack_len
);
523 long stack_len
= scm_stack_base
- (SCM_STACKITEM
*) (&stack_len
);
525 long stack_len
= scm_stack_size (scm_stack_base
);
527 scm_mark_locations ((scm_stack_base
- stack_len
), (scm_sizet
) stack_len
);
531 #else /* USE_THREADS */
533 /* Mark every thread's stack and registers */
534 scm_threads_mark_stacks();
536 #endif /* USE_THREADS */
538 /* FIXME: insert a phase to un-protect string-data preserved
539 * in scm_vector_set_length_x.
542 j
= SCM_NUM_PROTECTS
;
544 scm_gc_mark (scm_sys_protects
[j
]);
547 scm_gc_mark (scm_root
->handle
);
550 scm_mark_weak_vector_spines ();
558 SCM_THREAD_CRITICAL_SECTION_END
;
568 /* Mark an object precisely.
584 if (SCM_NCELLP (ptr
))
585 scm_wta (ptr
, "rogue pointer in heap", NULL
);
587 switch (SCM_TYP7 (ptr
))
589 case scm_tcs_cons_nimcar
:
590 if (SCM_GCMARKP (ptr
))
593 if (SCM_IMP (SCM_CDR (ptr
))) /* SCM_IMP works even with a GC mark */
598 scm_gc_mark (SCM_CAR (ptr
));
599 ptr
= SCM_GCCDR (ptr
);
601 case scm_tcs_cons_imcar
:
602 if (SCM_GCMARKP (ptr
))
605 ptr
= SCM_GCCDR (ptr
);
607 case scm_tcs_cons_gloc
:
608 if (SCM_GCMARKP (ptr
))
613 vcell
= SCM_CAR (ptr
) - 1L;
614 switch (SCM_CDR (vcell
))
618 ptr
= SCM_GCCDR (ptr
);
630 vtable_data
= (SCM
*)vcell
;
631 layout
= vtable_data
[scm_vtable_index_layout
];
632 len
= SCM_LENGTH (layout
);
633 fields_desc
= SCM_CHARS (layout
);
634 /* We're using SCM_GCCDR here like STRUCT_DATA, except
635 that it removes the mark */
636 mem
= (SCM
*)SCM_GCCDR (ptr
);
640 for (x
= 0; x
< len
- 2; x
+= 2, ++mem
)
641 if (fields_desc
[x
] == 'p')
643 if (fields_desc
[x
] == 'p')
645 if (SCM_LAYOUT_TAILP (fields_desc
[x
+ 1]))
646 for (x
= *mem
; x
; --x
)
647 scm_gc_mark (*++mem
);
652 if (!SCM_CDR (vcell
))
654 SCM_SETGCMARK (vcell
);
655 ptr
= vtable_data
[scm_vtable_index_vtable
];
662 case scm_tcs_closures
:
663 if (SCM_GCMARKP (ptr
))
666 if (SCM_IMP (SCM_CDR (ptr
)))
668 ptr
= SCM_CLOSCAR (ptr
);
671 scm_gc_mark (SCM_CLOSCAR (ptr
));
672 ptr
= SCM_GCCDR (ptr
);
675 case scm_tc7_lvector
:
679 if (SCM_GC8MARKP (ptr
))
681 SCM_SETGC8MARK (ptr
);
682 i
= SCM_LENGTH (ptr
);
686 if (SCM_NIMP (SCM_VELTS (ptr
)[i
]))
687 scm_gc_mark (SCM_VELTS (ptr
)[i
]);
688 ptr
= SCM_VELTS (ptr
)[0];
693 SCM_SETGC8MARK (ptr
);
695 scm_mark_locations (SCM_VELTS (ptr
),
698 (sizeof (SCM_STACKITEM
) + -1 +
699 sizeof (scm_contregs
)) /
700 sizeof (SCM_STACKITEM
)));
715 SCM_SETGC8MARK (ptr
);
718 case scm_tc7_substring
:
719 if (SCM_GC8MARKP(ptr
))
721 SCM_SETGC8MARK (ptr
);
726 if (SCM_GC8MARKP(ptr
))
728 scm_weak_vectors
[scm_n_weak
++] = ptr
;
729 if (scm_n_weak
>= scm_weak_size
)
731 SCM_SYSCALL (scm_weak_vectors
=
732 (SCM
*) realloc ((char *) scm_weak_vectors
,
733 sizeof (SCM
*) * (scm_weak_size
*= 2)));
734 if (scm_weak_vectors
== NULL
)
736 scm_puts ("weak vector table", scm_cur_errp
);
737 scm_puts ("\nFATAL ERROR DURING CRITICAL SCM_CODE SECTION\n",
739 exit(SCM_EXIT_FAILURE
);
742 SCM_SETGC8MARK (ptr
);
743 if (SCM_IS_WHVEC_ANY (ptr
))
750 len
= SCM_LENGTH (ptr
);
751 weak_keys
= SCM_IS_WHVEC (ptr
) || SCM_IS_WHVEC_B (ptr
);
752 weak_values
= SCM_IS_WHVEC_V (ptr
) || SCM_IS_WHVEC_B (ptr
);
754 for (x
= 0; x
< len
; ++x
)
757 alist
= SCM_VELTS (ptr
)[x
];
758 /* mark everything on the alist
759 * except the keys or values, according to weak_values and weak_keys.
761 while ( SCM_NIMP (alist
)
763 && !SCM_GCMARKP (alist
)
764 && SCM_NIMP (SCM_CAR (alist
))
765 && SCM_CONSP (SCM_CAR (alist
)))
770 kvpair
= SCM_CAR (alist
);
771 next_alist
= SCM_CDR (alist
);
774 * SCM_SETGCMARK (alist);
775 * SCM_SETGCMARK (kvpair);
777 * It may be that either the key or value is protected by
778 * an escaped reference to part of the spine of this alist.
779 * If we mark the spine here, and only mark one or neither of the
780 * key and value, they may never be properly marked.
781 * This leads to a horrible situation in which an alist containing
782 * freelist cells is exported.
784 * So only mark the spines of these arrays last of all marking.
785 * If somebody confuses us by constructing a weak vector
786 * with a circular alist then we are hosed, but at least we
787 * won't prematurely drop table entries.
790 scm_gc_mark (SCM_CAR (kvpair
));
792 scm_gc_mark (SCM_GCCDR (kvpair
));
795 if (SCM_NIMP (alist
))
801 case scm_tc7_msymbol
:
802 if (SCM_GC8MARKP(ptr
))
804 SCM_SETGC8MARK (ptr
);
805 scm_gc_mark (SCM_SYMBOL_FUNC (ptr
));
806 ptr
= SCM_SYMBOL_PROPS (ptr
);
808 case scm_tc7_ssymbol
:
809 if (SCM_GC8MARKP(ptr
))
811 SCM_SETGC8MARK (ptr
);
814 ptr
= (SCM
)(scm_heap_org
+ (((unsigned long)SCM_CAR (ptr
)) >> 8));
817 i
= SCM_PTOBNUM (ptr
);
818 if (!(i
< scm_numptob
))
820 if (SCM_GC8MARKP (ptr
))
822 SCM_SETGC8MARK (ptr
);
823 if (SCM_PTAB_ENTRY(ptr
))
824 scm_gc_mark (SCM_PTAB_ENTRY(ptr
)->file_name
);
825 if (scm_ptobs
[i
].mark
)
827 ptr
= (scm_ptobs
[i
].mark
) (ptr
);
834 if (SCM_GC8MARKP (ptr
))
836 SCM_SETGC8MARK (ptr
);
837 switch SCM_GCTYP16 (ptr
)
838 { /* should be faster than going through scm_smobs */
839 case scm_tc_free_cell
:
840 /* printf("found free_cell %X ", ptr); fflush(stdout); */
841 SCM_SETCDR (ptr
, SCM_EOL
);
843 case scm_tcs_bignums
:
847 i
= SCM_SMOBNUM (ptr
);
848 if (!(i
< scm_numsmob
))
850 if (scm_smobs
[i
].mark
)
852 ptr
= (scm_smobs
[i
].mark
) (ptr
);
860 def
:scm_wta (ptr
, "unknown type in ", "gc_mark");
865 /* Mark a Region Conservatively
869 scm_mark_locations (x
, n
)
875 register SCM_CELLPTR ptr
;
878 if SCM_CELLP (*(SCM
**) & x
[m
])
880 ptr
= (SCM_CELLPTR
) SCM2PTR ((*(SCM
**) & x
[m
]));
882 j
= scm_n_heap_segs
- 1;
883 if ( SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], ptr
)
884 && SCM_PTR_GT (scm_heap_table
[j
].bounds
[1], ptr
))
891 || SCM_PTR_GT (scm_heap_table
[i
].bounds
[1], ptr
))
893 else if (SCM_PTR_LE (scm_heap_table
[j
].bounds
[0], ptr
))
901 if (SCM_PTR_GT (scm_heap_table
[k
].bounds
[1], ptr
))
905 if (SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], ptr
))
910 else if (SCM_PTR_LE (scm_heap_table
[k
].bounds
[0], ptr
))
914 if (SCM_PTR_GT (scm_heap_table
[j
].bounds
[1], ptr
))
920 if ( !scm_heap_table
[seg_id
].valid
921 || scm_heap_table
[seg_id
].valid (ptr
,
922 &scm_heap_table
[seg_id
]))
923 scm_gc_mark (*(SCM
*) & x
[m
]);
932 /* The following is a C predicate which determines if an SCM value can be
933 regarded as a pointer to a cell on the heap. The code is duplicated
934 from scm_mark_locations. */
942 register SCM_CELLPTR ptr
;
944 if SCM_CELLP (*(SCM
**) & value
)
946 ptr
= (SCM_CELLPTR
) SCM2PTR ((*(SCM
**) & value
));
948 j
= scm_n_heap_segs
- 1;
949 if ( SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], ptr
)
950 && SCM_PTR_GT (scm_heap_table
[j
].bounds
[1], ptr
))
957 || SCM_PTR_GT (scm_heap_table
[i
].bounds
[1], ptr
))
959 else if (SCM_PTR_LE (scm_heap_table
[j
].bounds
[0], ptr
))
967 if (SCM_PTR_GT (scm_heap_table
[k
].bounds
[1], ptr
))
971 if (SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], ptr
))
976 else if (SCM_PTR_LE (scm_heap_table
[k
].bounds
[0], ptr
))
980 if (SCM_PTR_GT (scm_heap_table
[j
].bounds
[1], ptr
))
986 if ( !scm_heap_table
[seg_id
].valid
987 || scm_heap_table
[seg_id
].valid (ptr
,
988 &scm_heap_table
[seg_id
]))
1000 scm_mark_weak_vector_spines ()
1004 for (i
= 0; i
< scm_n_weak
; ++i
)
1006 if (SCM_IS_WHVEC_ANY (scm_weak_vectors
[i
]))
1013 obj
= scm_weak_vectors
[i
];
1014 ptr
= SCM_VELTS (scm_weak_vectors
[i
]);
1015 n
= SCM_LENGTH (scm_weak_vectors
[i
]);
1016 for (j
= 0; j
< n
; ++j
)
1021 while ( SCM_NIMP (alist
)
1022 && SCM_CONSP (alist
)
1023 && !SCM_GCMARKP (alist
)
1024 && SCM_NIMP (SCM_CAR (alist
))
1025 && SCM_CONSP (SCM_CAR (alist
)))
1027 SCM_SETGCMARK (alist
);
1028 SCM_SETGCMARK (SCM_CAR (alist
));
1029 alist
= SCM_GCCDR (alist
);
1041 register SCM_CELLPTR ptr
;
1042 #ifdef SCM_POINTERS_MUNGED
1043 register SCM scmptr
;
1046 #define scmptr (SCM)ptr
1048 register SCM nfreelist
;
1049 register SCM
*hp_freelist
;
1057 /* Reset all free list pointers. We'll reconstruct them completely
1059 for (i
= 0; i
< scm_n_heap_segs
; i
++)
1060 *scm_heap_table
[i
].freelistp
= SCM_EOL
;
1062 for (i
= 0; i
< scm_n_heap_segs
; i
++)
1064 register scm_sizet n
= 0;
1065 register scm_sizet j
;
1067 /* Unmarked cells go onto the front of the freelist this heap
1068 segment points to. Rather than updating the real freelist
1069 pointer as we go along, we accumulate the new head in
1070 nfreelist. Then, if it turns out that the entire segment is
1071 free, we free (i.e., malloc's free) the whole segment, and
1072 simply don't assign nfreelist back into the real freelist. */
1073 hp_freelist
= scm_heap_table
[i
].freelistp
;
1074 nfreelist
= *hp_freelist
;
1076 span
= scm_heap_table
[i
].ncells
;
1077 ptr
= CELL_UP (scm_heap_table
[i
].bounds
[0]);
1078 seg_size
= CELL_DN (scm_heap_table
[i
].bounds
[1]) - ptr
;
1079 for (j
= seg_size
+ span
; j
-= span
; ptr
+= span
)
1081 #ifdef SCM_POINTERS_MUNGED
1082 scmptr
= PTR2SCM (ptr
);
1084 switch SCM_TYP7 (scmptr
)
1086 case scm_tcs_cons_gloc
:
1087 if (SCM_GCMARKP (scmptr
))
1089 if (SCM_CDR (SCM_CAR (scmptr
) - 1) == (SCM
)1)
1090 SCM_SETCDR (SCM_CAR (scmptr
) - 1, (SCM
) 0);
1095 vcell
= SCM_CAR (scmptr
) - 1L;
1097 if ((SCM_CDR (vcell
) == 0) || (SCM_CDR (vcell
) == 1))
1099 SCM
*p
= (SCM
*) SCM_GCCDR (scmptr
);
1100 m
+= p
[scm_struct_i_n_words
] * sizeof (SCM
);
1101 /* I feel like I'm programming in BCPL here... */
1102 free ((char *) p
[scm_struct_i_ptr
]);
1106 case scm_tcs_cons_imcar
:
1107 case scm_tcs_cons_nimcar
:
1108 case scm_tcs_closures
:
1109 if (SCM_GCMARKP (scmptr
))
1113 if (SCM_GC8MARKP (scmptr
))
1119 m
+= (1 + SCM_LENGTH (scmptr
)) * sizeof (SCM
);
1120 scm_must_free ((char *)(SCM_VELTS (scmptr
) - 1));
1124 case scm_tc7_vector
:
1125 case scm_tc7_lvector
:
1129 if (SCM_GC8MARKP (scmptr
))
1132 m
+= (SCM_LENGTH (scmptr
) * sizeof (SCM
));
1134 scm_must_free (SCM_CHARS (scmptr
));
1135 /* SCM_SETCHARS(scmptr, 0);*/
1138 if SCM_GC8MARKP (scmptr
)
1140 m
+= sizeof (long) * ((SCM_HUGE_LENGTH (scmptr
) + SCM_LONG_BIT
- 1) / SCM_LONG_BIT
);
1142 case scm_tc7_byvect
:
1143 if SCM_GC8MARKP (scmptr
)
1145 m
+= SCM_HUGE_LENGTH (scmptr
) * sizeof (char);
1149 if SCM_GC8MARKP (scmptr
)
1151 m
+= SCM_HUGE_LENGTH (scmptr
) * sizeof (long);
1154 if SCM_GC8MARKP (scmptr
)
1156 m
+= SCM_HUGE_LENGTH (scmptr
) * sizeof (short);
1159 case scm_tc7_llvect
:
1160 if SCM_GC8MARKP (scmptr
)
1162 m
+= SCM_HUGE_LENGTH (scmptr
) * sizeof (long_long
);
1166 if SCM_GC8MARKP (scmptr
)
1168 m
+= SCM_HUGE_LENGTH (scmptr
) * sizeof (float);
1171 if SCM_GC8MARKP (scmptr
)
1173 m
+= SCM_HUGE_LENGTH (scmptr
) * sizeof (double);
1176 if SCM_GC8MARKP (scmptr
)
1178 m
+= SCM_HUGE_LENGTH (scmptr
) * 2 * sizeof (double);
1180 case scm_tc7_substring
:
1181 if (SCM_GC8MARKP (scmptr
))
1184 case scm_tc7_string
:
1185 if (SCM_GC8MARKP (scmptr
))
1187 m
+= SCM_HUGE_LENGTH (scmptr
) + 1;
1189 case scm_tc7_msymbol
:
1190 if (SCM_GC8MARKP (scmptr
))
1192 m
+= ( SCM_LENGTH (scmptr
)
1194 + sizeof (SCM
) * ((SCM
*)SCM_CHARS (scmptr
) - SCM_SLOTS(scmptr
)));
1195 scm_must_free ((char *)SCM_SLOTS (scmptr
));
1197 case scm_tc7_contin
:
1198 if SCM_GC8MARKP (scmptr
)
1200 m
+= SCM_LENGTH (scmptr
) * sizeof (SCM_STACKITEM
) + sizeof (scm_contregs
);
1201 if (SCM_VELTS (scmptr
))
1203 case scm_tc7_ssymbol
:
1204 if SCM_GC8MARKP(scmptr
)
1210 if SCM_GC8MARKP (scmptr
)
1212 if SCM_OPENP (scmptr
)
1214 int k
= SCM_PTOBNUM (scmptr
);
1215 if (!(k
< scm_numptob
))
1217 /* Keep "revealed" ports alive. */
1218 if (scm_revealed_count(scmptr
) > 0)
1220 /* Yes, I really do mean scm_ptobs[k].free */
1221 /* rather than ftobs[k].close. .close */
1222 /* is for explicit CLOSE-PORT by user */
1223 (scm_ptobs
[k
].free
) (SCM_STREAM (scmptr
));
1224 SCM_SETSTREAM (scmptr
, 0);
1225 scm_remove_from_port_table (scmptr
);
1226 scm_gc_ports_collected
++;
1227 SCM_SETAND_CAR (scmptr
, ~SCM_OPN
);
1231 switch SCM_GCTYP16 (scmptr
)
1233 case scm_tc_free_cell
:
1234 if SCM_GC8MARKP (scmptr
)
1238 case scm_tcs_bignums
:
1239 if SCM_GC8MARKP (scmptr
)
1241 m
+= (SCM_NUMDIGS (scmptr
) * SCM_BITSPERDIG
/ SCM_CHAR_BIT
);
1243 #endif /* def SCM_BIGDIG */
1245 if SCM_GC8MARKP (scmptr
)
1247 switch ((int) (SCM_CAR (scmptr
) >> 16))
1249 case (SCM_IMAG_PART
| SCM_REAL_PART
) >> 16:
1250 m
+= sizeof (double);
1251 case SCM_REAL_PART
>> 16:
1252 case SCM_IMAG_PART
>> 16:
1253 m
+= sizeof (double);
1262 if SCM_GC8MARKP (scmptr
)
1267 k
= SCM_SMOBNUM (scmptr
);
1268 if (!(k
< scm_numsmob
))
1270 m
+= (scm_smobs
[k
].free
) ((SCM
) scmptr
);
1276 sweeperr
:scm_wta (scmptr
, "unknown type in ", "gc_sweep");
1280 if (SCM_CAR (scmptr
) == (SCM
) scm_tc_free_cell
)
1283 /* Stick the new cell on the front of nfreelist. It's
1284 critical that we mark this cell as freed; otherwise, the
1285 conservative collector might trace it as some other type
1287 SCM_SETCAR (scmptr
, (SCM
) scm_tc_free_cell
);
1288 SCM_SETCDR (scmptr
, nfreelist
);
1293 SCM_CLRGC8MARK (scmptr
);
1296 SCM_CLRGCMARK (scmptr
);
1298 #ifdef GC_FREE_SEGMENTS
1303 scm_heap_size
-= seg_size
;
1304 free ((char *) scm_heap_table
[i
].bounds
[0]);
1305 scm_heap_table
[i
].bounds
[0] = 0;
1306 for (j
= i
+ 1; j
< scm_n_heap_segs
; j
++)
1307 scm_heap_table
[j
- 1] = scm_heap_table
[j
];
1308 scm_n_heap_segs
-= 1;
1309 i
--; /* We need to scan the segment just moved. */
1312 #endif /* ifdef GC_FREE_SEGMENTS */
1313 /* Update the real freelist pointer to point to the head of
1314 the list of free cells we've built for this segment. */
1315 *hp_freelist
= nfreelist
;
1317 #ifdef DEBUG_FREELIST
1318 scm_check_freelist ();
1319 scm_map_free_list ();
1322 scm_gc_cells_collected
+= n
;
1324 /* Scan weak vectors. */
1327 for (i
= 0; i
< scm_n_weak
; ++i
)
1329 if (!SCM_IS_WHVEC_ANY (scm_weak_vectors
[i
]))
1333 ptr
= SCM_VELTS (scm_weak_vectors
[i
]);
1334 n
= SCM_LENGTH (scm_weak_vectors
[i
]);
1335 for (j
= 0; j
< n
; ++j
)
1336 if (SCM_NIMP (ptr
[j
]) && SCM_FREEP (ptr
[j
]))
1337 ptr
[j
] = SCM_BOOL_F
;
1339 else /* if (SCM_IS_WHVEC_ANY (scm_weak_vectors[i])) */
1341 SCM obj
= scm_weak_vectors
[i
];
1342 register long n
= SCM_LENGTH (scm_weak_vectors
[i
]);
1345 ptr
= SCM_VELTS (scm_weak_vectors
[i
]);
1347 for (j
= 0; j
< n
; ++j
)
1354 weak_keys
= SCM_IS_WHVEC (obj
) || SCM_IS_WHVEC_B (obj
);
1355 weak_values
= SCM_IS_WHVEC_V (obj
) || SCM_IS_WHVEC_B (obj
);
1360 while (SCM_NIMP (alist
)
1361 && SCM_CONSP (alist
)
1362 && SCM_NIMP (SCM_CAR (alist
))
1363 && SCM_CONSP (SCM_CAR (alist
)))
1368 key
= SCM_CAAR (alist
);
1369 value
= SCM_CDAR (alist
);
1370 if ( (weak_keys
&& SCM_NIMP (key
) && SCM_FREEP (key
))
1371 || (weak_values
&& SCM_NIMP (value
) && SCM_FREEP (value
)))
1373 *fixup
= SCM_CDR (alist
);
1376 fixup
= SCM_CDRLOC (alist
);
1377 alist
= SCM_CDR (alist
);
1383 scm_cells_allocated
= (scm_heap_size
- scm_gc_cells_collected
);
1384 scm_mallocated
-= m
;
1385 scm_gc_malloc_collected
= m
;
1391 /* {Front end to malloc}
1393 * scm_must_malloc, scm_must_realloc, scm_must_free, scm_done_malloc
1395 * These functions provide services comperable to malloc, realloc, and
1396 * free. They are for allocating malloced parts of scheme objects.
1397 * The primary purpose of the front end is to impose calls to gc.
1401 * Return newly malloced storage or throw an error.
1403 * The parameter WHAT is a string for error reporting.
1404 * If the threshold scm_mtrigger will be passed by this
1405 * allocation, or if the first call to malloc fails,
1406 * garbage collect -- on the presumption that some objects
1407 * using malloced storage may be collected.
1409 * The limit scm_mtrigger may be raised by this allocation.
1412 scm_must_malloc (len
, what
)
1417 scm_sizet size
= len
;
1418 unsigned long nm
= scm_mallocated
+ size
;
1421 scm_wta (SCM_MAKINUM (len
), (char *) SCM_NALLOC
, what
);
1422 if ((nm
<= scm_mtrigger
))
1424 SCM_SYSCALL (ptr
= (char *) malloc (size
));
1427 scm_mallocated
= nm
;
1433 nm
= scm_mallocated
+ size
;
1434 SCM_SYSCALL (ptr
= (char *) malloc (size
));
1437 scm_mallocated
= nm
;
1438 if (nm
> scm_mtrigger
- SCM_MTRIGGER_HYSTERESIS
) {
1439 if (nm
> scm_mtrigger
)
1440 scm_mtrigger
= nm
+ nm
/ 2;
1442 scm_mtrigger
+= scm_mtrigger
/ 2;
1451 * is similar to scm_must_malloc.
1454 scm_must_realloc (char *where
,
1460 scm_sizet size
= len
;
1461 scm_sizet nm
= scm_mallocated
+ size
- olen
;
1464 scm_wta (SCM_MAKINUM (len
), (char *) SCM_NALLOC
, what
);
1465 if ((nm
<= scm_mtrigger
))
1467 SCM_SYSCALL (ptr
= (char *) realloc (where
, size
));
1470 scm_mallocated
= nm
;
1475 nm
= scm_mallocated
+ size
- olen
;
1476 SCM_SYSCALL (ptr
= (char *) realloc (where
, size
));
1479 scm_mallocated
= nm
;
1480 if (nm
> scm_mtrigger
- SCM_MTRIGGER_HYSTERESIS
) {
1481 if (nm
> scm_mtrigger
)
1482 scm_mtrigger
= nm
+ nm
/ 2;
1484 scm_mtrigger
+= scm_mtrigger
/ 2;
1498 scm_wta (SCM_INUM0
, "already free", "");
1501 /* Announce that there has been some malloc done that will be freed
1502 * during gc. A typical use is for a smob that uses some malloced
1503 * memory but can not get it from scm_must_malloc (for whatever
1504 * reason). When a new object of this smob is created you call
1505 * scm_done_malloc with the size of the object. When your smob free
1506 * function is called, be sure to include this size in the return
1510 scm_done_malloc (size
)
1513 scm_mallocated
+= size
;
1515 if (scm_mallocated
> scm_mtrigger
)
1517 scm_igc ("foreign mallocs");
1518 if (scm_mallocated
> scm_mtrigger
- SCM_MTRIGGER_HYSTERESIS
)
1520 if (scm_mallocated
> scm_mtrigger
)
1521 scm_mtrigger
= scm_mallocated
+ scm_mallocated
/ 2;
1523 scm_mtrigger
+= scm_mtrigger
/ 2;
1533 * Each heap segment is an array of objects of a particular size.
1534 * Every segment has an associated (possibly shared) freelist.
1535 * A table of segment records is kept that records the upper and
1536 * lower extents of the segment; this is used during the conservative
1537 * phase of gc to identify probably gc roots (because they point
1538 * into valid segments at reasonable offsets). */
1541 * is true if the first segment was smaller than INIT_HEAP_SEG.
1542 * If scm_expmem is set to one, subsequent segment allocations will
1543 * allocate segments of size SCM_EXPHEAP(scm_heap_size).
1548 * is the lowest base address of any heap segment.
1550 SCM_CELLPTR scm_heap_org
;
1552 struct scm_heap_seg_data
* scm_heap_table
= 0;
1553 int scm_n_heap_segs
= 0;
1556 * is the total number of cells in heap segments.
1558 unsigned long scm_heap_size
= 0;
1561 * initializes a new heap segment and return the number of objects it contains.
1563 * The segment origin, segment size in bytes, and the span of objects
1564 * in cells are input parameters. The freelist is both input and output.
1566 * This function presume that the scm_heap_table has already been expanded
1567 * to accomodate a new segment record.
1572 init_heap_seg (seg_org
, size
, ncells
, freelistp
)
1573 SCM_CELLPTR seg_org
;
1578 register SCM_CELLPTR ptr
;
1579 #ifdef SCM_POINTERS_MUNGED
1580 register SCM scmptr
;
1585 SCM_CELLPTR seg_end
;
1589 if (seg_org
== NULL
)
1594 /* Compute the ceiling on valid object pointers w/in this segment.
1596 seg_end
= CELL_DN ((char *) ptr
+ size
);
1598 /* Find the right place and insert the segment record.
1601 for (new_seg_index
= 0;
1602 ( (new_seg_index
< scm_n_heap_segs
)
1603 && SCM_PTR_LE (scm_heap_table
[new_seg_index
].bounds
[0], seg_org
));
1609 for (i
= scm_n_heap_segs
; i
> new_seg_index
; --i
)
1610 scm_heap_table
[i
] = scm_heap_table
[i
- 1];
1615 scm_heap_table
[new_seg_index
].valid
= 0;
1616 scm_heap_table
[new_seg_index
].ncells
= ncells
;
1617 scm_heap_table
[new_seg_index
].freelistp
= freelistp
;
1618 scm_heap_table
[new_seg_index
].bounds
[0] = (SCM_CELLPTR
)ptr
;
1619 scm_heap_table
[new_seg_index
].bounds
[1] = (SCM_CELLPTR
)seg_end
;
1622 /* Compute the least valid object pointer w/in this segment
1624 ptr
= CELL_UP (ptr
);
1627 n_new_objects
= seg_end
- ptr
;
1629 /* Prepend objects in this segment to the freelist.
1631 while (ptr
< seg_end
)
1633 #ifdef SCM_POINTERS_MUNGED
1634 scmptr
= PTR2SCM (ptr
);
1636 SCM_SETCAR (scmptr
, (SCM
) scm_tc_free_cell
);
1637 SCM_SETCDR (scmptr
, PTR2SCM (ptr
+ ncells
));
1643 /* Patch up the last freelist pointer in the segment
1644 * to join it to the input freelist.
1646 SCM_SETCDR (PTR2SCM (ptr
), *freelistp
);
1647 *freelistp
= PTR2SCM (CELL_UP (seg_org
));
1649 scm_heap_size
+= (ncells
* n_new_objects
);
1658 alloc_some_heap (ncells
, freelistp
)
1662 struct scm_heap_seg_data
* tmptable
;
1666 /* Critical code sections (such as the garbage collector)
1667 * aren't supposed to add heap segments.
1669 if (scm_gc_heap_lock
)
1670 scm_wta (SCM_UNDEFINED
, "need larger initial", "heap");
1672 /* Expand the heap tables to have room for the new segment.
1673 * Do not yet increment scm_n_heap_segs -- that is done by init_heap_seg
1674 * only if the allocation of the segment itself succeeds.
1676 len
= (1 + scm_n_heap_segs
) * sizeof (struct scm_heap_seg_data
);
1678 SCM_SYSCALL (tmptable
= ((struct scm_heap_seg_data
*)
1679 realloc ((char *)scm_heap_table
, len
)));
1681 scm_wta (SCM_UNDEFINED
, "could not grow", "hplims");
1683 scm_heap_table
= tmptable
;
1686 /* Pick a size for the new heap segment.
1687 * The rule for picking the size of a segment is explained in
1692 len
= (scm_sizet
) (SCM_EXPHEAP (scm_heap_size
) * sizeof (scm_cell
));
1693 if ((scm_sizet
) (SCM_EXPHEAP (scm_heap_size
) * sizeof (scm_cell
)) != len
)
1697 len
= SCM_HEAP_SEG_SIZE
;
1702 smallest
= (ncells
* sizeof (scm_cell
));
1704 len
= (ncells
* sizeof (scm_cell
));
1706 /* Allocate with decaying ambition. */
1707 while ((len
>= SCM_MIN_HEAP_SEG_SIZE
)
1708 && (len
>= smallest
))
1710 SCM_SYSCALL (ptr
= (SCM_CELLPTR
) malloc (len
));
1713 init_heap_seg (ptr
, len
, ncells
, freelistp
);
1720 scm_wta (SCM_UNDEFINED
, "could not grow", "heap");
1725 SCM_PROC (s_unhash_name
, "unhash-name", 1, 0, 0, scm_unhash_name
);
1727 scm_unhash_name (name
)
1732 SCM_ASSERT (SCM_NIMP (name
) && SCM_SYMBOLP (name
), name
, SCM_ARG1
, s_unhash_name
);
1734 bound
= scm_n_heap_segs
;
1735 for (x
= 0; x
< bound
; ++x
)
1739 p
= (SCM_CELLPTR
)scm_heap_table
[x
].bounds
[0];
1740 pbound
= (SCM_CELLPTR
)scm_heap_table
[x
].bounds
[1];
1745 if (1 == (7 & (int)incar
))
1748 if ( ((name
== SCM_BOOL_T
) || (SCM_CAR (incar
) == name
))
1749 && (SCM_CDR (incar
) != 0)
1750 && (SCM_CDR (incar
) != 1))
1764 /* {GC Protection Helper Functions}
1776 scm_return_first (SCM elt
, ...)
1779 scm_return_first (elt
, va_alist
)
1789 scm_permanent_object (obj
)
1793 scm_permobjs
= scm_cons (obj
, scm_permobjs
);
1799 /* Protect OBJ from the garbage collector. OBJ will not be freed,
1800 even if all other references are dropped, until someone applies
1801 scm_unprotect_object to it. This function returns OBJ.
1803 Note that calls to scm_protect_object do not nest. You can call
1804 scm_protect_object any number of times on a given object, and the
1805 next call to scm_unprotect_object will unprotect it completely.
1807 Basically, scm_protect_object and scm_unprotect_object just
1808 maintain a list of references to things. Since the GC knows about
1809 this list, all objects it mentions stay alive. scm_protect_object
1810 adds its argument to the list; scm_unprotect_object remove its
1811 argument from the list. */
1813 scm_protect_object (obj
)
1816 /* This function really should use address hashing tables, but I
1817 don't know how to use them yet. For now we just use a list. */
1818 scm_protects
= scm_cons (obj
, scm_protects
);
1824 /* Remove any protection for OBJ established by a prior call to
1825 scm_protect_obj. This function returns OBJ.
1827 See scm_protect_obj for more information. */
1829 scm_unprotect_object (obj
)
1832 scm_protects
= scm_delq_x (obj
, scm_protects
);
1840 scm_init_storage (scm_sizet init_heap_size
)
1844 j
= SCM_NUM_PROTECTS
;
1846 scm_sys_protects
[--j
] = SCM_BOOL_F
;
1848 scm_freelist
= SCM_EOL
;
1851 j
= SCM_HEAP_SEG_SIZE
;
1852 scm_mtrigger
= SCM_INIT_MALLOC_LIMIT
;
1853 scm_heap_table
= ((struct scm_heap_seg_data
*)
1854 scm_must_malloc (sizeof (struct scm_heap_seg_data
), "hplims"));
1855 if (0L == init_heap_size
)
1856 init_heap_size
= SCM_INIT_HEAP_SIZE
;
1858 if ((init_heap_size
!= j
)
1859 || !init_heap_seg ((SCM_CELLPTR
) malloc (j
), j
, 1, &scm_freelist
))
1861 j
= SCM_HEAP_SEG_SIZE
;
1862 if (!init_heap_seg ((SCM_CELLPTR
) malloc (j
), j
, 1, &scm_freelist
))
1867 scm_heap_org
= CELL_UP (scm_heap_table
[0].bounds
[0]);
1868 /* scm_hplims[0] can change. do not remove scm_heap_org */
1869 if (!(scm_weak_vectors
= (SCM
*) malloc ((scm_weak_size
= 32) * sizeof(SCM
*))))
1872 /* Initialise the list of ports. */
1873 scm_port_table
= (struct scm_port_table
**) malloc ((long) (sizeof (struct scm_port_table
)
1874 * scm_port_table_room
));
1875 if (!scm_port_table
)
1879 scm_undefineds
= scm_cons (SCM_UNDEFINED
, SCM_EOL
);
1880 SCM_SETCDR (scm_undefineds
, scm_undefineds
);
1882 scm_listofnull
= scm_cons (SCM_EOL
, SCM_EOL
);
1883 scm_nullstr
= scm_makstr (0L, 0);
1884 scm_nullvect
= scm_make_vector (SCM_INUM0
, SCM_UNDEFINED
);
1885 scm_symhash
= scm_make_vector ((SCM
) SCM_MAKINUM (scm_symhash_dim
), SCM_EOL
);
1886 scm_weak_symhash
= scm_make_weak_key_hash_table ((SCM
) SCM_MAKINUM (scm_symhash_dim
));
1887 scm_symhash_vars
= scm_make_vector ((SCM
) SCM_MAKINUM (scm_symhash_dim
), SCM_EOL
);
1888 scm_stand_in_procs
= SCM_EOL
;
1889 scm_permobjs
= SCM_EOL
;
1890 scm_protects
= SCM_EOL
;
1891 scm_asyncs
= SCM_EOL
;
1892 scm_sysintern ("most-positive-fixnum", (SCM
) SCM_MAKINUM (SCM_MOST_POSITIVE_FIXNUM
));
1893 scm_sysintern ("most-negative-fixnum", (SCM
) SCM_MAKINUM (SCM_MOST_NEGATIVE_FIXNUM
));
1895 scm_sysintern ("bignum-radix", SCM_MAKINUM (SCM_BIGRAD
));