Lines Matching refs:collectors

55   Many collectors require running application code to periodically check a
106 conservative garbage collectors (though these seem rare in practice).
108 Accurate garbage collectors do not suffer from any of these problems, but they
125 * semi-space collectors
127 * mark-sweep collectors
129 * generational collectors
131 * incremental collectors
133 * concurrent collectors
135 * cooperative collectors
145 describing the garbage collectors requirements to the compiler.  In particular,
166   used to optimize incremental scans in generational collectors.
169   for interoperating with concurrent collectors.
317 Some collectors need to be informed when the mutator (the program that needs
369 concurrent collectors.  Additionally, write barriers could be used to implement
394 LLVM includes built in support for several varieties of garbage collectors.  
487 LLVM ships with two example collectors which leverage the ``gcroot`` 
569    of references at a safepoint and is used by precise collectors to identify
570    references within a stack frame on the machine stack. Note that collectors
579 #. If you collector requires them, an LLVM IR implementation of your collectors
580    load and store barriers.  Note that since many collectors don't require 
758   area to another, compacting them in the process.  Copying collectors enable
763   (Including generational collectors.) Incremental collectors generally have all
779   collectors is generally still present to a limited extent.  Sophisticated
783 suitable for a wide variety of collectors, but does not currently extend to
939 Threaded collectors may also require ``Return`` and ``PreCall`` safe points to