suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

remove unused binding

Browse Source 
original commit: a4732d58666d80e78af5e1cde4c796d3eeae20e7
This commit is contained in:
Matthew Flatt 2019-09-01 07:13:23 -06:00
parent c195288251
commit 2f4d59de0f
1 changed files with 1 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
c/gc.c
View File

@ -955,7 +955,6 @@ void GCENTRY(ptr tc, IGEN mcg, IGEN tg) {
seginfo *oldspacesegments, *si, *nextsi; seginfo *oldspacesegments, *si, *nextsi;
ptr ls; ptr ls;
bucket_pointer_list *buckets_to_rebuild; bucket_pointer_list *buckets_to_rebuild;
ptr locked_oldspace_objects;
/* flush instruction cache: effectively clear_code_mod but safer */ /* flush instruction cache: effectively clear_code_mod but safer */
for (ls = S_threads; ls != Snil; ls = Scdr(ls)) { for (ls = S_threads; ls != Snil; ls = Scdr(ls)) {
@ -1058,12 +1057,11 @@ void GCENTRY(ptr tc, IGEN mcg, IGEN tg) {
} }
if (ls == Snil) { if (ls == Snil) {
sorted_locked_objects = FIX(0); sorted_locked_objects = FIX(0);
locked_oldspace_objects = Snil;
} else { } else {
ptr v, x, y; uptr i, n; ptr v, x, y; uptr i, n;
/* dosort is destructive, so have to store the result back */ /* dosort is destructive, so have to store the result back */
locked_oldspace_objects = ls = dosort(ls, list_length(ls)); ls = dosort(ls, list_length(ls));
/* create vector of smallest size n=2^k-1 that will fit all of /* create vector of smallest size n=2^k-1 that will fit all of
the list's unique elements */ the list's unique elements */