Ignore:
Timestamp:
Apr 1, 2008, 5:07:25 PM (12 years ago)
Author:
mikel
Message:

additions to ObjC and ffi docs; many mechanical edits; some standardization of XML elements and formatting

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/source/doc/src/gc.xml

    r8820 r8981  
    2828      after each full GC, the lisp kernel will try to ensure that a
    2929      specified amount (the "lisp-heap-gc-threshold") of free memory
    30       is available. The inital value of this kernel variable is 16MB
     30      is available. The initial value of this kernel variable is 16MB
    3131      on 32-bit implementations and 32MB on 64-bit implementations ;
    3232      it can be manipulated from Lisp (see below.)</para>
     
    116116      necessary to do more expensive GCs of the entire heap in order
    117117      to reclaim unreferenced memory.  In some environments, the
    118       pauses associated with such full GCs can be noticable and
     118      pauses associated with such full GCs can be noticeable and
    119119      disruptive, and minimizing the frequency (and sometimes the
    120120      duration) of these pauses is probably the EGC's primary goal
     
    124124      amortized GC time), but there are cases where it can improve
    125125      overall performance as well; the nature and degree of its impact
    126       on performance is highly application-dependant.</para>
     126      on performance is highly application-dependent.</para>
    127127      <para>Most EGC strategies (including the one employed by
    128128      &CCL;) logically or physically divide memory into one or more
     
    136136      This filtering process isn't perfect - a certain amount of
    137137      premature tenuring may take place - but it usually works very
    138       well in practive.</para>
     138      well in practice.</para>
    139139      <para>It's important to note that a GC of the youngest
    140140      generation is typically very fast (perhaps a few milliseconds on
     
    185185      <para>For some programs (especially those that cons at a very
    186186      high rate), the default policy may be less than ideal: releasing
    187       pages that're going to be needed almost immediately - and
     187      pages that are going to be needed almost immediately - and
    188188      zero-fill-faulting them back in, lazily - incurs unnecessary
    189189      overhead. (There's a false economy associated with minimizing
     
    236236      their memory will never be reclaimed, even if they are
    237237      referenced nowhere else in the program.  You may want this
    238       behaviour.  If you don't, you need weak references.</para>
     238      behavior.  If you don't, you need weak references.</para>
    239239      <para>&CCL; supports weak references with "weak hash tables".
    240240      Hash tables may be weak with respect to either their keys or
Note: See TracChangeset for help on using the changeset viewer.