bldc/tests/test_gc_9.lisp

(define arr1 [1 2 3 4])
(define arr2 [5 6 7 8])
(define tree (cons arr1 arr2))
(define tree1 (cons tree tree))

(gc)

(check (and
        (eq tree '([1 2 3 4] . [5 6 7 8]))
        (eq (car tree1) '([1 2 3 4] . [5 6 7 8]))
        (eq (cdr tree1) '([1 2 3 4] . [5 6 7 8]))))
Squashed 'lispBM/lispBM/' changes from ae675bb2..5bc9cc72 5bc9cc72 update readme 20763667 added a number of GC tests. all of which pass under both garbage collection principles. 8f0f9f04 first attempt at pointer-reversal mark phase. This mark implementation is disabled per default and can be tried out by building with -DUSE_GC_PTR_REV 6f4b7899 refactor closure application and addition of several error-suspects in fundamental operations 34942ef9 undo some changes related to error_reason and some cleaning f046c967 added lbm_set_error_suspect to allow setting a more relevant expression likely to be guilty of an error to an error message git-subtree-dir: lispBM/lispBM git-subtree-split: 5bc9cc726803bc65c8853ccd1c99a44bc5de5063 2023-11-06 00:41:15 -08:00			`(define arr1 [1 2 3 4])`
			`(define arr2 [5 6 7 8])`
			`(define tree (cons arr1 arr2))`
			`(define tree1 (cons tree tree))`

			`(gc)`

			`(check (and`
			`(eq tree '([1 2 3 4] . [5 6 7 8]))`
			`(eq (car tree1) '([1 2 3 4] . [5 6 7 8]))`
			`(eq (cdr tree1) '([1 2 3 4] . [5 6 7 8]))))`