需要 LOH 内部结构
我知道,这是一个实施细节,有些人认为禁止对它们感兴趣。但我仍然想找到以下内容的参考并进行确认:
大对象堆维护段中空洞的空闲列表。它用它来满足大对象的分配请求。这是否也意味着此类分配可能比来自小对象堆的常规(仅分配指针增加)分配更昂贵? 参考
在 32 位进程上,段大小的下限为 16MB。 64 位进程的大小限制是多少?
备注:此问题不要求正确的对象设计(池)解决方案。
I know, it is an implementation detail, and some people think it is forbidden to be interested into them. But I nevertheless want to find references for, and confirmation of, the following:
The large object heap maintains a free-list of holes in a segment. It uses this to fullfill allocation requests for large objects. Doesn't that also mean that such allocations would potentially be more expensive than regular (only allocation pointer increasing) allocations from the small object heap? Reference
On 32-bit processes, the lower limit of segment sizes is 16MB. What is that size limit for 64-bit processes?
Remark: This question does not ask for proper object design (pooling) solutions.
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(1)
我刚刚在 VMMap 的帮助下找到了问题的第二部分:
32 位上的最小段大小
(MS 博客中也以这种方式报告):
64 位上(仅通过尝试发现):
I just found out the second part of the question with the help of VMMap:
The minimum segment size
On 32 bit (is also reported that way in a MS blog):
On 64 bit (only found out by trying):