Channa wrote: > With small allocations i wanted to know how the bins are arranged?? > The sentence from the above pdf : "Small allocations are segregated > such that each run manages a single size class" > means that all the memory regions for > eg: of size 4KB are maintained as a single run in the form of red black tree? The quoted text is talking about small objects, which are packed together in run objects. All small objects within each particular run are of the same size class. So, one run may contain an array of 16-byte objects, another may contain an array of 24-byte objects, and so on. The small objects within each run are tracked by bitmaps at the beginning of each run. Page runs are tracked by red-black trees. JasonReceived on Tue Nov 25 2008 - 18:13:55 UTC
This archive was generated by hypermail 2.4.0 : Wed May 19 2021 - 11:39:38 UTC