Difference between revisions of "Garbage collector"
Jump to navigation
Jump to search
(Created page with "Liberty Eiffel provides two garbage collector implementations. Most core libraries are also well equipped to minimize memory requirements in the case that ''no'' GC is used. ...") |
|||
| Line 7: | Line 7: | ||
The native GC is generated at the same time as the rest of the code, allowing efficient use of the memory by splitting it in chunks of known size. |
The native GC is generated at the same time as the rest of the code, allowing efficient use of the memory by splitting it in chunks of known size. |
||
| − | + | [[Papers#Compiler_Support_to_Customize_the_Mark_and_Sweep_Algorithm.|See this paper]] for details. |
|
== BDW GC == |
== BDW GC == |
||
Revision as of 22:48, 4 January 2014
Liberty Eiffel provides two garbage collector implementations.
Most core libraries are also well equipped to minimize memory requirements in the case that no GC is used.
Native GC
The native GC is generated at the same time as the rest of the code, allowing efficient use of the memory by splitting it in chunks of known size.
See this paper for details.
BDW GC
The Boehm-Demers-Weiser conservative collector is also supported. The minimal required version is currently 7.2.
The missing parts are:
- a lot of testing (esp. dynamic arrays, weak references, agents)
- total GC cycle at the end of the program (Eiffel requires that all the objects are disposed at exit, and some programs or libraries rely on that behaviour)
- Liberty does not make use of the parallel or incremental collectors