{"translation":"https://translate-dev.freebsd.org/api/translations/documentation/articlesvm-design_index/id/?format=json","source":["FreeBSD 3.X uses a \"sequential list of free regions\" approach to accounting for the free swap areas.  The idea is that large blocks of free linear space can be represented with a single list node ([.filename]#kern/subr_rlist.c#).  But due to the fragmentation the sequential list winds up being insanely fragmented.  In the above example, completely unused swap will have A and B shown as \"free\" and C and D shown as \"all allocated\".  Each A-B sequence requires a list node to account for because C and D are holes, so the list node cannot be combined with the next A-B sequence."],"previous_source":"","target":[""],"id_hash":5525637408233093798,"content_hash":5525637408233093798,"location":"documentation/content/en/articles/vm-design/_index.adoc:318","context":"","note":"type: Plain text","flags":"","labels":[],"state":0,"fuzzy":false,"translated":false,"approved":false,"position":67,"has_suggestion":false,"has_comment":false,"has_failing_check":false,"num_words":100,"source_unit":"https://translate-dev.freebsd.org/api/units/615433/?format=json","priority":100,"id":1404364,"web_url":"https://translate-dev.freebsd.org/translate/documentation/articlesvm-design_index/id/?checksum=ccaf01f25b57faa6","url":"https://translate-dev.freebsd.org/api/units/1404364/?format=json","explanation":"","extra_flags":"","pending":false,"timestamp":"2022-03-09T18:23:49.587957Z"}