Changes between Version 2 and Version 3 of GarbageCollectorNotes


Ignore:
Timestamp:
May 15, 2006 12:12:13 PM (9 years ago)
Author:
guest
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • GarbageCollectorNotes

    v2 v3  
    1717{{{
    1818static Capability * schedule (Capability *initialCapability, Task *task)
     19}}}
    1920
    20 In schedule is a pretty classical schedule loop. I have stripped several parts of the code here to get down to the essentials.
     21In schedule() is a pretty classical scheduler loop. I have stripped away several parts of the code here to get down to the essentials.
    2122
     23{{{
     24#!c
    2225    t = popRunQueue(cap);
    2326    prev_what_next = t->what_next;
     
    5962
    6063{{{
     64#!c
    6165    switch (ret) {
    6266    case HeapOverflow:
     
    106110
    107111{{{
     112#!c
    108113typedef struct bdescr_ {
    109114  StgPtr start;                 /* start addr of memory */
     
    130135If a large object is allocated and a block is a part of a large object, then the first block is has a count of the number of blocks that are part of the object. The link list of blocks making up the object is maintained by the link pointer. [This may not be entirely correct - I will come back to this later].
    131136
     137=== Generations ===
    132138
     139=== Steps ===
    133140
    134 
    135 
    136 
     141== Allocation ==
    137142
    138143== Scavenging ==