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

fixed a couple typos in comments

Browse Source 
original commit: 9e2347eeb2bd57b35f96f0f1938ef84d624ed6a4
This commit is contained in:
Bob Burger 2016-06-23 16:43:19 -04:00
parent 51db0ddbc1
commit 0d0e876fb7
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
c/gc.c
View File

@ -212,7 +212,7 @@ static ptr copy(pp, pps) ptr pp; ISPC pps; {
if (counts == Sfalse) {
IGEN grtd = rtd == pp ? tg : GENERATION(rtd);
S_G.countof[grtd][countof_rtd_counts] += 1;
/* allocte counts struct in same generation as rtd. initialize timestamp & counts */
/* allocate counts struct in same generation as rtd. initialize timestamp & counts */
find_room(space_data, grtd, type_typed_object, size_rtd_counts, counts);
RTDCOUNTSTYPE(counts) = type_rtd_counts;
RTDCOUNTSTIMESTAMP(counts) = S_G.gctimestamp[0];

4
c/segment.c
View File

@ -21,8 +21,8 @@ Low-level Memory management strategy:
* maintain getmem-allocated segment info and dirty vector tables
* after each collection, run through the list of chunks. If all
segments in a chunk are empty, the chunk is a candidate for return
to the O/S. Return (freeem) as many chunks as possible without going
below a user-defined threshhold of empty segments (determined as a
to the O/S. Return (freemem) as many chunks as possible without going
below a user-defined threshold of empty segments (determined as a
multiple of the occupied nonstatic segments). Bias return to the
most recently allocated chunks.
* getmem/freemem may be implemented with malloc/free; we use them