[
{
"path": ".gitignore",
"content": "# Xcode\n#\n# gitignore contributors: remember to update Global/Xcode.gitignore, Objective-C.gitignore & Swift.gitignore\n\n## Build generated\nbuild/\nDerivedData/\n\n## Various settings\n*.pbxuser\n!default.pbxuser\n*.mode1v3\n!default.mode1v3\n*.mode2v3\n!default.mode2v3\n*.perspectivev3\n!default.perspectivev3\nxcuserdata/\n\n## Other\n*.moved-aside\n*.xccheckout\n*.xcscmblueprint\n\n## Obj-C/Swift specific\n*.hmap\n*.ipa\n*.dSYM.zip\n*.dSYM\n\n# CocoaPods\n#\n# We recommend against adding the Pods directory to your .gitignore. However\n# you should judge for yourself, the pros and cons are mentioned at:\n# https://guides.cocoapods.org/using/using-cocoapods.html#should-i-check-the-pods-directory-into-source-control\n#\n# Pods/\n\n# Carthage\n#\n# Add this line if you want to avoid checking in source code from Carthage dependencies.\n# Carthage/Checkouts\n\nCarthage/Build\n\n# fastlane\n#\n# It is recommended to not store the screenshots in the git repo. Instead, use fastlane to re-generate the\n# screenshots whenever they are needed.\n# For more information about the recommended setup visit:\n# https://docs.fastlane.tools/best-practices/source-control/#source-control\n\nfastlane/report.xml\nfastlane/Preview.html\nfastlane/screenshots\nfastlane/test_output\n\n# Code Injection\n#\n# After new code Injection tools there's a generated folder /iOSInjectionProject\n# https://github.com/johnno1962/injectionforxcode\n\niOSInjectionProject/\n"
},
{
"path": "BlockFile.md",
"content": "# Block\n\n> 面试驱动技术合集（初中级iOS开发），关注仓库，及时获取更新 [Interview-series](https://github.com/miniLV/Interview-series)\n\n\n\nBlock 在 iOS 算比较常见常用且常考的了，现在面试中，要么没面试题，有面试题的，基本都会考到 block 的点。\n\n先来个面试题热热身，题目: **手撕代码 - 用Block实现两个数的求和**\n\n*(这题如果会的，block基础知识可以跳过了，直接到* Block原理探究）\n\n\n\n#### 简单介绍block入门级用法\n\nBlock结构比较复杂，一般用 typedef 定义，直接调用的感觉比较简单、清晰易懂\n\n```\n//typedef block的时候有提示\ntypedef void(^MNBlock)(int);\n\n@interface ViewController ()\n\n@property (nonatomic, copy) MNBlock block;\n\n@end\n\n\n@implementation ViewController\n\n- (void)viewDidLoad {\n [super viewDidLoad];\n \n //直接用self.block调用\n self.block = ^(int a) {\n //dosomething...\n };\n}\n```\n\n- **参数解释:**\n\n`typedef <#returnType#>(^<#name#>)(<#arguments#>);`\n\n\n\n\n\n**题目: 手撕代码 - 用Block实现两个数的求和**\n\n*日常开发中，block声明一般写的比较多，实现一般是靠Xcode自动补全提示出现的，手撕代码的情况下，等号右侧的block实现要怎么写？*\n\n声明:\n```\ntypedef int(^MNBlock)(int a, int b);\n\n@interface ViewController ()\n\n@property (nonatomic, copy) MNBlock sum;\n```\n\nVip补全功能:\n\n\n\n纸上按Enter没用啊兄弟！看来还是需要了解一下Block右边的东西~\n\n先在 Xcode上按下 Enter，了解下再撕\n\n\n```\n^int(int a, int b) {\n //Control reaches end of non-void block \n 因为返回值是int类型，所以这里需要返回\n}\n```\n\n\n\n\n```\nint(^Sum)(int, int) = ^(int a, int b){\n return a + b;\n};\nint result = Sum(5, 10);\n```\n\n\n\n\n\n\n#### Block的坑出现！新手可能会写错的地方\n\n1.声明出错 - `void ^(testBlock)`\n\n\n\n\n修正版：\n\n```\nvoid (^testBlock)() = ^{\n \n};\n```\nblock的声明，^ 和 blockName 都是在小括号里面！！\n\n\n2.block各种实现的参数问题\n\n声明`typedef int(^MNBlock)(int, int);`\n\n\n\n\n```\n self.sum = ^int(int a, int b) {\n return a + b;\n };\n```\n\n这里要注意，block声明里面只有参数类型，没有实际参数的话，Xcode提示也只有参数，这里涉及到形参和实参的问题\n\n声明是形参，可以不写参数，但是使用的时候，必须有实际参数，才可以进行使用，所以这里需要实参，可以在 `^int(int , int)` 中手动添加实参`^int(int a, int b)`，就可以让a 和 b 参与运算\n\n小tips：实际开发中，建议声明的时候，如果需要带参数，最好形参也声明下，这样使用Xcode提示的时候，会把参数带进去，方便得多~(踩过坑的自然懂！)\n\n\n\n\n3. 省略void导致看不懂block结构的 *(正常是两个void导致局面混乱)*\n\n```\n//声明\ntypedef void(^MNBlock)(void);\n\n//实现\nself.sum = ^{\n //dosomething...\n};\n\n```\n\n这种情况下，能知道怎么省略的，声明里两个void，能知道怎么对应的吗？\n\n这个其实比较简单，block不管声明 or 实现，最后一个小括号，里面都是参数，而参数是可以省略的！\n\n而为了把声明的两个void区分开，返回值 or 参数区分开，其实就ok了\n\n参数非void的例子\n```\n//声明非void的参数\ntypedef void(^MNBlock)(int a);\n\n//实现就必须带参数，不可省略！\nself.sum = ^(int a) {\n \n}\n```\n\n参数void的例子 ==> 参数可以省略\n```\ntypedef int(^MNBlock)(void);\n\nself.sum = ^{\n //声明的返回值类型是int，所以一定要return；\n return 5;\n};\n```\n\n其实-返回值是void的，也可以不省略\n```\ntypedef void(^MNBlock)(void);\n\n//实现的返回值不省略\nself.sum = ^void () {\n \n};\n\n```\n\n参数是void的省略:\n```\ntypedef int(^MNBlock)();\n\n//实现里面，没有参数，就可以不写()\nself.sum = ^int{\n return 5;\n}\n```\n\n**注意！！ 声明里面的返回值void是不可以省略的！！**\n\n\n\n\n4. 小箭头^混乱的问题,到底放小括号内还是小括号外\n\n声明是 `int(^MNBlock)(int a , int b)`\n\n实现是 `^int(int a, int b)`\n\n注意，这里箭头之后的，不管是多写() 还是少写，都会出错\n\n\n\n\n\n> 所以这里还不能死记，比如不管声明还是实现,死记 (^ xxx) 是没问题的 or 死记 ^…… xxx 不加括号是没问题的,在这里都行不通，只能靠脑记了\n\n这时候，就需要用到巧记了！\n\n*^ 和小括号组合的，一共有三种情况*\n\n- 一种是声明的，`void(^MNBlock)`\n- 一种是实现的，`^int(int a,)`\n- 还一种 `^(int a)`\n\n兄弟，看到这你还不乱吗！！\n\n\n\n\n怎么记看这里，\n- 手写分为两个部分，block等号左边 or 等号右边的，左边为声明，右边为实现区分开\n- 声明记住：^后面跟blockName，他们需要包起来！ (^blockName),只有声明会用到blockName，先记住一点，如果有blockName，要和^一起，用小括号包起来\n- 实现又分为两种：\n - `^int`:^后面跟的是返回值类型\n - ^ 直接跟类型，不用加\"( )\" ==> `^int`\n - `^(int a)`:^后面直接跟参数 *(返回值是void)*。\n - 参数都是要用\"( )\"包起来的，如果^后面跟参数，就得用\"( )\" ==> `^(int a)`,\n - 实现里，肯定有实际参数，这时候，参数类型和实参，就得用( )包起来\n\n### ^与小括号纠缠的总结\n\n- ^ 后面仅跟类型，不需要小括号，==> `^int`\n- ^ 后面跟参数，参数需要小括号 ==> `^(int a)`\n- ^ 后面跟block名称，^和blockName需要小括号 ==> `void (^MNBlock)`\n\n
\n\n\n\n## Block原理探究 \n\n```objective-c\nvoid (^MNBlock)(void) = ^(void){\n NSLog(@\"this is a Block~ rua~\");\n};\nMNBlock();\n```\n\n\n\n 使用 `xcrun -sdk iphoneos clang -arch arm64 -rewrite-objc main.m` 转成 C++ 代码, 查看底层结构\n\n\n\n```objective-c\n//对应上面的 MNBlock声明\nvoid (*MNBlock)(void) = (&__main_block_impl_0(__main_block_func_0,\n &__main_block_desc_0_DATA));\n \n//对应上面的 MNblock() 调用\nMNBlock->FuncPtr(MNBlock);\n```\n\n\n\n```objective-c\n//block声明调用的 - __main_block_impl_0\nstruct __main_block_impl_0 {\n //结构体内的参数\n struct __block_impl impl;\n struct __main_block_desc_0* Desc;\n \n //c++中的构造函数，类似于 OC 的 init 方法，返回一个结构体对象\n __main_block_impl_0(void *fp, struct __main_block_desc_0 *desc, int flags=0) {\n impl.isa = &_NSConcreteStackBlock;\n impl.Flags = flags;\n impl.FuncPtr = fp;\n Desc = desc;\n }\n};\n\nstruct __block_impl {\n void *isa;\n int Flags;\n int Reserved;\n void *FuncPtr;\n};\n\nstatic struct __main_block_desc_0 {\n size_t reserved;\n size_t Block_size;\n}\n```\n\n\n\n这里的block封装的函数调用解释`MNBlock->FuncPtr(MNBlock);`\n\nMNBlock 其实内部结构是 `__main_block_impl_0`，\n\n```\nstruct __main_block_impl_0 {\n\n //函数调用地址在这个结构体内\n struct __block_impl impl;\n\n struct __main_block_desc_0* Desc;\n }\n \n struct __block_impl {\n void *isa;\n int Flags;\n int Reserved;\n //函数调用地址在这里\n void *FuncPtr;\n};\n```\n\n内部只有两个参数，一个`impl`，一个`Desc`，而函数的调用地址 - `FuncPtr`是再`impl`中的，为什么这里能直接这样写呢？\n\n> 因为，__main_block_impl_0 结构的地址和他的第一个成员一样，第一个成员的地址是__block_impl，所以__main_block_impl_0 和 __block_impl 的地址其实是同一个，通过格式强制转换，将 main_block_impl_0 转成 block_impl 就可以直接拿到他内部的 FuncPtr 函数地址，然后进行调用！\n\n\n\n\n\n\n\n- 可见- block本质上是OC对象，内部有一个isa指针\n\n- block是封装了函数调用已经函数调用的oc对象\n\n \n\n### Block面试题抛砖引玉~\n\n**开胃菜先来一下，以下结果输出什么**\n\n```\nint a = 10;\nvoid (^MNBlock)(void) = ^{\n NSLog(@\"a = %d\",a);\n};\na += 20;\n\nMNBlock();\n```\n\n\n\n调用 `MNBlock();` 之前，a 已经 + 20了，输出30？ 太天真了兄弟，这里涉及到capture的概念，即变量捕获\n\n\n\n### Block捕获变量(capture)\n\n捕获：Block内部会新增一个成员，来存储传进来的变量\n\n\n\n\n\nblock 内部直接捕获了穿进去的这个变量a(10)\n\n\n\n\n\n创建block的时候，已经将变量a=10 捕获到 block内部，之后再怎么修改，不会影响block 内部的 a\n\n\n\n**auto 和 static的区别**:以下会输出什么~ \n\n```\nstatic int b = 10;\nvoid (^MNBlock)(void) = ^{\n NSLog(@\"a = %d, b = %d\",a,b);\n};\na = 20;\nb = 20;\n\nMNBlock();\n```\n\n输出\n\n```\n2019-03-07 21:49:49 Block-Demo a = 10, b = 20\n```\n\n\n\nwhy?\n\n查看原因:\n\n```\nauto int a = 10;\nstatic int b = 10;\nvoid (*MNBlock)(void) = (&__main_block_impl_0(__main_block_func_0,\n &__main_block_desc_0_DATA,\n a,\n &b));\n```\n\n\n\n发现：两种变量，都有捕获到block内部。\n\na 是auto变量，走的是值传递，\n\nb 是 static 变量，走的是地址传递，所以会影响(指针指向同一块内存，修改的等于是同个对象)\n\n\n\n**总结**\n\n- 只有局部变量才需要捕获，\n- 全局变量不需要捕获，因为在哪都可以访问\n- 需不需要捕获，其实主要是看作用域问题\n- auto局部变量 ==>值传递->因为会销毁\n- static局部练练==>不会销毁==>所以地址传递\n\n\n\n**看图就行~**\n\n\n\n\n\n**进阶考题 - self 会被捕获到 block 内部吗**\n\n```\nvoid (^MNBlock)(void) = ^{\n NSLog(@\"p = %p\",self);\n};\n```\n\n\n\n模拟看官作答：不会，因为整个类里，都能调用self，应该是全局的，全局变量不会捕获到block中\n\n\n\n哈哈哈哈！中计了！其实 self 是参数(局部变量)\n\n\n\n```\nstruct __MNDemo__test_block_impl_0 {\n struct __block_impl impl;\n struct __MNDemo__test_block_desc_0* Desc;\n MNDemo *self; ==> 捕捉到了兄弟\n }\n```\n\n\n\n> 解释原因：\n>\n> - 每个OC函数，其实默认有两个参数，一个self，一个_cmd，只是他们倆兄弟默认是隐藏的\n> - 而由于他们是参数，所以是局部变量，局部变量就要被 block 捕获\n> - `- (void)test(self, SEL _cmd){XXX}` 默认的OC方法里面其实有这两个隐藏的参数！所以上题的答案，self是会被block捕获的！**（能听懂掌声！）**\n\n\n\n**进进阶考题 - 成员变量_name 会被捕获到 block 内部吗**\n\n\n\n```\nvoid (^MNBlock)(void) = ^{\n NSLog(@\"==%@\",_name);\n};\n```\n\n模拟看官作答：呵呵，老子都中了这么多次技了，这题学会了！！ 因为_name是成员变量，全局的，也没有self，所以不需要捕获整个类就都可以随便访问它！\n\n\n\n哎，兄弟，还是太年轻了！！\n\n```\nvoid (^MNBlock)(void) = ^{\n NSLog(@\"==%@\",self->_name);\n};\n```\n\n看图说话，不多bb, *（能听懂掌声！）*\n\n\n\n## Block的类型\n\n- `__NSGlobalBlock__`\n\n- `__NSStackBlock__`\n\n- `__NSMallocBlock__`\n\n\n\nMRC环境下\n\n```\nvoid (^global)() = ^{\n NSLog(@\"globalValue = %d\",globalValue);\n};\n\nvoid (^autoBlock)() = ^{\n NSLog(@\"this is a Block~ rua~ = %d\",a);\n};\n\nvoid (^copyAuto)() = [autoBlock copy];\n\n--------------------------------------------\nprint class\n2019-03-08 17:40:43 Block-Demo\n\n global class = __NSGlobalBlock__ \n autoBlock class = __NSStackBlock__ \n copyAuto = __NSMallocBlock__\n```\n\n\n\n总结:\n\n\n\n\n\n\n\n\n栈上的内存系统会自动回收\n\n- 栈空间的block 不会对 对象进行强引用\n- 堆空间的block 可能会对对象产生强引用：\n - 如果是weak指针，不会强引用\n - 如果是strong指针，会强引用\n\n堆上的内存是由程序员控制，所以一般将block 拷贝到堆上，让程序员控制他与内部变量的生命周期\n\n\n\n题目：以下输出的顺序是什么(ARC环境下)\n\n```\n@implementation MNPerson\n\n- (void)dealloc{\n NSLog(@\"MNPerson - dealloc\");\n}\n\n@end\n\n--------------------------------------\n\nMNPerson *person = [[MNPerson alloc]init];\n\n__weak MNPerson *weakPerson = person;\n\ndispatch_after(dispatch_time(DISPATCH_TIME_NOW, (int64_t)(1.0 * NSEC_PER_SEC)), dispatch_get_main_queue(), ^{\n \n NSLog(@\"1-----%@\",person);\n \n dispatch_after(dispatch_time(DISPATCH_TIME_NOW, (int64_t)(2.0 * NSEC_PER_SEC)), dispatch_get_main_queue(), ^{\n NSLog(@\"2------%@\",weakPerson);\n });\n \n});\n\nNSLog(@\"touchesBegan\");\n```\n\n\n\n输出结果\n\n```\n2019-03-08 22:38:59.038452+0800 touchesBegan\n2019-03-08 22:39:00.056746+0800 1-----\n2019-03-08 22:39:00.057891+0800 MNPerson - dealloc\n2019-03-08 22:39:02.058011+0800 2-----(null)\n```\n\n解释：\n\n1. gcd的block会自动对auto变量进行copy操作\n\n2. block内部对 auto 变量的强弱引用，取决于指针类型\n\n3. 1 中的auto变量是 person，没声明默认对象是 strong 类型，所以 gcd1 会对 person进行 1s的强引用\n\n4. gcd2 中的变量是 weakPerson，看到是__wesk指针，所以block内部不会对其产生强引用\n\n5. 随后，gcd1 对 person进行1s的强引用之后，gcd1 的block销毁，person对象销毁，打印MNPerson dealloc\n\n6. 最终，2s过后打印 2——weakPerson，因为person对象在gcd1 block结束之后，释放掉了，所以此时person是空，因为是weak指针，对象是null不会crash，最终打印null\n\n\n\n#### 对象类型的auto变量\n\n- 当 block 内部访问了对象类型的auto变量时\t\n - 如果block在展示，不会对 auto 变量产生强引用\n - 如果 block 被 拷贝到堆上\n - 会调用 block 内部的 copy 函数\n - copy 函数内部会调用 _Block_object_assign 函数\n - _Block_object_assign 函数会根据auto变量的修饰符 *( strong、 weak、unsafe_unretained )* 做出对应的操作，看对内部auto变量进行强引用还是弱引用(类似于 retain)\n - 如果 block 从 堆上移除\n - 会调用 block 内部的 dispose 函数\n - dispose函数内部会调用_Block_object_dispose 函数\n - _Block_object_dispose 类似于 release，会对auto变量进行自动释放(当引用计数器=0的时候 )\n\n\n\n\n\n#### block中的copy\n\n- 在ARC环境下，编译器会根据情况，自动将栈上的block拷贝到堆上，比如以下几种情况\n - block 作为函数返回值的时候\n - 将block复制给__strong指针的时候\n - block作为Cocoa API中方法名含有usingBlock的方法参数事\n - 比如：`[array enumerateObjectsUsingBlock:XXX]`\n\n\n\n### __block 修饰符的使用\n\n\n\n题目：以下代码的是否编译通过，可以的话输出结果是什么\n\n```\nint a = 10;\nvoid (^block)() = ^{\n a = 20;\n NSLog(@\"a = %d\",a);\n};\n```\n\n\n\n结果如下：\n\n\n\n*思考：无法编译，为啥呢？编译的时候，block应该是会把auto变量捕获进去的，那block结构中应该有a才对啊*\n\n\n\n```\n//main函数\nint main(int argc, const char * argv[]) {\n /* @autoreleasepool */ { __AtAutoreleasePool __autoreleasepool; \n\n int a = 10;\n void (*block)() = ((void (*)())&__main_block_impl_0((void *)__main_block_func_0, &__main_block_desc_0_DATA, a));\n\n }\n return 0;\n}\n\n//block执行地址\n static void __main_block_func_0(struct __main_block_impl_0 *__cself) {\n int a = __cself->a; // bound by copy\n NSLog((NSString *)&__NSConstantStringImpl__var_folders_kh_0rp73c0s2mvfp5gjf25j5y6h0000gn_T_main_1a12fa_mi_0,a);}\n```\n\n\n\nblock执行的时候，内部是 `__main_block_func_0` 函数，而a的声明，是在`main`函数，两个函数相互独立，对于他们来说，a都是一个局部变量，而且两个函数中都对a初始化，两个函数的中a不是同一个，那怎么可以在 执行函数中，修改main函数中的局部变量呢，所以编译报错！\n\n\n\n如何改？\n\n\n\n- **方案一：使用static**\n\n```\nstatic int a = 10;\nvoid (^block)() = ^{\n a = 20;\n NSLog(@\"a = %d\",a);\n};\n```\n\n\n\n因为static修饰的auto变量，最终在block中进行的不是值传递，而是地址传递，措意执行函数中的a 和 main 函数中的a，是同一个地址 ==> 等于同一个a，所以可以修改，输出20\n\n\n\n但是使用static，就会变成静态变量，永远在内存中\n\n\n\n- **方案二： 使用__blcok**\n\n```\n__block auto int a = 10;\nvoid (^block)() = ^{\n a = 20;\n NSLog(@\"a = %d\",a);\n};\n```\n\n\n\n```\nstruct __main_block_impl_0 {\n struct __block_impl impl;\n struct __main_block_desc_0* Desc;\n __Block_byref_a_0 *a; // by ref ==> auto的话，是int a，__block，变成对象了\n}\n```\n\n\n\n```\nstruct __Block_byref_a_0 {\n void *__isa;\n__Block_byref_a_0 *__forwarding;==> 指向自己的结构体\n int __flags;\n int __size;\n int a; ==> 10在这里\n};\n```\n\na = 20;最终转成 `(a->__forwarding->a) = 20;`\n\n> 解释下：__forwarding 是指向结构体本身的指针，等价于a本身，其实就是通过a的结构体指针，拿到里面的成员a，再对他赋值\n>\n> 指针传递，所以可以修改 auto 变量，通过block，间接引用 auto 变量\n\n\n\n\n\n\n\n#### __block的内存管理\n\n- 当 block 在栈上的时候，不会对内部的__block 变量产生强硬有\n- 当 block 从栈上被 copy 到堆上的时候\n - 会调用block内部的copy函数\n - copy函数内部会调用_Block_object_assign 函数\n - _Block_object_assign 函数会对 __block 变量进行一次 retain操作，产生强引用\n\n\n\n抄图分析 :\n\n\n\n\n\n\n\n- 当block从堆中移除时\n - 会调用 block 内部的 dispose 函数\n - dispose内部会调用_Block_object_dispose函数\n - _Block_object_dispose函数会对`__block`变量进行一次release操作，如果retainCount为0，自动释放该__block变量\n\n\n\n\n\n\n\n**总结：**\n\n- block在栈上的时候，不会对内部的变量产生强引用\n- 当block从栈上 copy 到堆上的时候，内部都会调用 __Block_object_assign\n - 如果是`__block`修饰的变量，会__block修饰的对象产生强引用\n - 如果是普通auto变量，看修饰的指针类型是strong 还是 weak(unsafe_unretained)\n - strong修饰的，block就会对内部的auto变量产生强引用\n - weak修饰的，block就不会对内部的auto变量产生强引用\n - 特别注意！上述条件仅在ARC环境下生效，如果是MRC环境下，block不会对内部auto变量产生强引用！**(MRC下不会进行retain操作)**\n- 当block从堆上移除的时候，内部会调用`__Block_object_dispose `函数，相当于对`block`内部所持有的对象进行移除release操作，如果retainCount为0，自动释放该__block变量\n\n\n\n#### __block中的 _ forwarding 指针\n\n内存拷贝的时候，如果block从栈被copy到堆上，肯定也希望内部的变量一起存储到堆上(让变量的生命周期可控，才不会被回收)\n\n\n\n加入变量a在栈上，在栈上的指针，指向堆上的 block，堆上的block的 forwarding指向他自己，就可以保证，修改&获取的变量，都是堆上的变量\n\n\n\n最终，__block指向的变量，是指向堆上的\n\n\n\n#### __block 修饰的类型\n\n\n\n```\n@implementation MNObject\n\n- (void)dealloc{\n NSLog(@\"MNObject - dealloc\");\n}\n\n@end\n\n\n--------------------------------------------\n\ntypedef void (^MNBlock)();\n\nMNBlock block;\n{\n MNObject *obj = [[MNObject alloc]init];\n __block __weak MNObject *weakObj = obj;\n \n block = ^{\n NSLog(@\"----------%p\",weakObj);\n };\n}\nblock();\n\n```\n\n\n\n问，上述代码的输出顺序是？\n\n```\n2019-03-09 21:57:56.673296+0800 Block-Demo[72692:8183596] MNObject - dealloc\n2019-03-09 21:57:56.673520+0800 Block-Demo[72692:8183596] ----------0x0\n```\n\n\n\n解释：ARC下\n\n\n\n\n\n上述代码，block 持有的是 weakObj，weak指针，所以block内部的__block结构体，对他内部持有的person不强引用！所以出了 小括号后，person没有被强引用，生命gg，先dealloc，输出`dealloc`，之后进行block调用，打印 ---------\n\n\n\n**特别注意，上述逻辑进在ARC下，如果在MRC下，中间结构体对象，不会对person 进行retain操作! 即便 person 是强指针修饰，也不会对内部的person对象进行强引用！**\n\n\n\nMRC环境下\n\n```\nMNBlock block;\n{\n MNObject *obj = [[MNObject alloc]init];\n block = [^{\n NSLog(@\"----------%p\",obj);\n }copy];\n \n [obj release];\n}\nblock();\n\n[block release];\n\n--------------------\n输出:\n2019-03-09 21:59:56.673296+0800 Block-Demo[72692:8183596] MNObject - dealloc\n2019-03-09 21:59:56.673520+0800 Block-Demo[72692:8183596] ----------0x0\n```\n\n\n\n上述代码，obj 是 __strong 修饰，但是并没有被 block 强引用！可见MRC环境下，__修饰的对象，生成的中间block对象不会对 auto变量产生强引用。\n\n\n\n### Block的循环应用问题\n\n传送门：[ 实际开发中-Block导致循环引用的问题(ARC环境下)](https://www.jianshu.com/p/fc2f4d207d25)\n\n\n\n**考题：MRC 下，block的循环引用如何解决呢？**\n\n\n\n- **方案1：unsafe_unretained**\n\nMRC下，没有__weak，所以只能用_unsafe_unretained指针，原理和 weak 一样(ARC环境下不推荐使用，可能导致野指针，推荐使用weak)\n\n```\n__unsafe_unretained MNObject *weakSelf = self;\nself.block = [^{\n NSLog(@\"----------%p\",weakSelf);\n}copy];\n```\n\n\n\n- **方案2： __block**\n\n```\n__block self;\nself.block = [^{\n NSLog(@\"----------%p\",self);\n}copy];\n```\n\n\n\nwhy? 上面关于 __block的总结 \n\n> 特别注意！上述条件仅在ARC环境下生效，如果是MRC环境下，block不会对内部auto变量产生强引用！(MRC下不会进行retain操作)\n\n\n\n\n\n\n\n- **方案3: 手动在block函数内将对象制空，并且必须手动保证block调用**\n\n```\nMNObject *obj = [[MNObject alloc]init];\n__unsafe_unretained MNObject *weakObj = obj;\nobj.block = [^{\n NSLog(@\"----------%p\",obj);\n obj = nil;\n}copy];\n\nobj.block();\n```\n\n\n\n\n\n但是这个一定要注意，block必须调用，因为对象指针的清空操作，是写在block函数中的，如果没调用block，循环引用问题还是会存在，所以不推荐使用。\n\n\n\n实际开发中，循环引用的检测工具推荐，facebook开源的 [FBRetainCycleDetector](https://github.com/facebook/FBRetainCycleDetector)，用过的都说好~\n\n\n\n---\n\n老实说，block其实非常难，能考得特别深，本文也只是简单探究&总结下中级iOS常见的block考题，以及对Block底层的初步探究，如果是像我所在的三线城市，去面试那种非一线公司的话，如果能掌握本文，可能block相关的题目能答个八九不离十吧！*(可能题目会变换组合，但是万变不离其宗)*\n\n\n\nblock的文章其实很多，但是如果要真的深入理解，还是得动手，这里推荐初中级iOSer可以跟着本文的思路，一步一步跟着探究试试，本文只是起个抛砖引玉的作用\n\n
\n\n---\n\n
\n\n\n\n友情演出:[小马哥MJ](https://github.com/CoderMJLee)\n\n\n*参考资料*\n\n[实际开发中-Block导致循环引用的问题(ARC环境下)](https://www.jianshu.com/p/fc2f4d207d25)\n\n[招聘一个靠谱的 iOS](https://blog.sunnyxx.com/2015/07/04/ios-interview/)\n\n[ChenYilong/iOSInterviewQuestions](https://github.com/ChenYilong/iOSInterviewQuestions/blob/master/01%E3%80%8A%E6%8B%9B%E8%81%98%E4%B8%80%E4%B8%AA%E9%9D%A0%E8%B0%B1%E7%9A%84iOS%E3%80%8B%E9%9D%A2%E8%AF%95%E9%A2%98%E5%8F%82%E8%80%83%E7%AD%94%E6%A1%88/%E3%80%8A%E6%8B%9B%E8%81%98%E4%B8%80%E4%B8%AA%E9%9D%A0%E8%B0%B1%E7%9A%84iOS%E3%80%8B%E9%9D%A2%E8%AF%95%E9%A2%98%E5%8F%82%E8%80%83%E7%AD%94%E6%A1%88%EF%BC%88%E4%B8%8B%EF%BC%89.md#45-addobserverforkeypathoptionscontext%E5%90%84%E4%B8%AA%E5%8F%82%E6%95%B0%E7%9A%84%E4%BD%9C%E7%94%A8%E5%88%86%E5%88%AB%E6%98%AF%E4%BB%80%E4%B9%88observer%E4%B8%AD%E9%9C%80%E8%A6%81%E5%AE%9E%E7%8E%B0%E5%93%AA%E4%B8%AA%E6%96%B9%E6%B3%95%E6%89%8D%E8%83%BD%E8%8E%B7%E5%BE%97kvo%E5%9B%9E%E8%B0%83)"
},
{
"path": "InterView-obj-isa-class/InterView-obj-isa-class/NSObject+MNTest.h",
"content": "//\n// NSObject+MNTest.h\n// InterView-obj-isa-class\n//\n// Created by 梁宇航 on 2019/1/20.\n// Copyright © 2019年 梁宇航. All rights reserved.\n//\n\n#import \n\n@interface NSObject (MNTest)\n\n+ (void)checkSuperclass;\n\n@end\n"
},
{
"path": "InterView-obj-isa-class/InterView-obj-isa-class/NSObject+MNTest.m",
"content": "//\n// NSObject+MNTest.m\n// InterView-obj-isa-class\n//\n// Created by 梁宇航 on 2019/1/20.\n// Copyright © 2019年 梁宇航. All rights reserved.\n//\n\n#import \"NSObject+MNTest.h\"\n\n@implementation NSObject (MNTest)\n\n//+ (void)checkSuperclass{\n// NSLog(@\"+NSObject checkSuperclass - %p\",self);\n//}\n\n- (void)checkSuperclass{\n NSLog(@\"-NSObject checkSuperclass - %p\",self);\n}\n\n@end\n"
},
{
"path": "InterView-obj-isa-class/InterView-obj-isa-class/main.m",
"content": "//\n// main.m\n// InterView-obj-isa-class\n//\n// Created by 梁宇航 on 2019/1/20.\n// Copyright © 2019年 梁宇航. All rights reserved.\n//\n\n#import \n#import \n#import \"NSObject+MNTest.h\"\n\n@interface MNSuperclass : NSObject\n\n- (void)superclassInstanceMethod;\n+ (void)superClassMethod;\n\n@end\n\n@implementation MNSuperclass\n\n- (void)superclassInstanceMethod{\n NSLog(@\"superclass-InstanceMethod - %p\",self);\n}\n\n+ (void)superClassMethod{\n NSLog(@\"+ superClass-classMethod- %p\",self);\n}\n\n@end\n\n@interface MNSubclass : MNSuperclass\n\n- (void)subclassInstanceMethod;\n- (void)compareSelfWithSuperclass;\n@end\n\n@implementation MNSubclass\n\n- (void)subclassInstanceMethod{\n NSLog(@\"subclassInstanceMethod- %p\",self);\n \n}\n\n- (void)compareSelfWithSuperclass{\n NSLog(@\"self class = %@\",[self class]);\n NSLog(@\"super class = %@\",[super class]);\n}\n\n@end\n\nint main(int argc, char * argv[]) {\n @autoreleasepool\n {\n MNSubclass *subclass = [[MNSubclass alloc]init];\n [subclass superclassInstanceMethod];\n NSLog(@\"subclass = %p, MNSubclass = %p\",subclass,[MNSubclass class]);\n \n [MNSubclass superClassMethod];\n \n //检验 - root-meta-class的superclass 是否指向 root-class\n [MNSubclass checkSuperclass];\n NSLog(@\"MNSubclass = %p\",[MNSubclass class]);\n \n //回答 - [self class] && [super class] 的答案\n [subclass compareSelfWithSuperclass];\n \n }\n \n return 0;\n}\n\n\n"
},
{
"path": "InterView-obj-isa-class/InterView-obj-isa-class.xcodeproj/project.pbxproj",
"content": "// !$*UTF8*$!\n{\n\tarchiveVersion = 1;\n\tclasses = {\n\t};\n\tobjectVersion = 50;\n\tobjects = {\n\n/* Begin PBXBuildFile section */\n\t\tA793EB6421F4CECA003661CD /* main.m in Sources */ = {isa = PBXBuildFile; fileRef = A793EB6321F4CECA003661CD /* main.m */; };\n\t\tA793EB6C21F4CEDF003661CD /* NSObject+MNTest.m in Sources */ = {isa = PBXBuildFile; fileRef = A793EB6A21F4CEDF003661CD /* NSObject+MNTest.m */; };\n/* End PBXBuildFile section */\n\n/* Begin PBXCopyFilesBuildPhase section */\n\t\tA793EB5E21F4CECA003661CD /* CopyFiles */ = {\n\t\t\tisa = PBXCopyFilesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tdstPath = /usr/share/man/man1/;\n\t\t\tdstSubfolderSpec = 0;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 1;\n\t\t};\n/* End PBXCopyFilesBuildPhase section */\n\n/* Begin PBXFileReference section */\n\t\tA793EB6021F4CECA003661CD /* InterView-obj-isa-class */ = {isa = PBXFileReference; explicitFileType = \"compiled.mach-o.executable\"; includeInIndex = 0; path = \"InterView-obj-isa-class\"; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\tA793EB6321F4CECA003661CD /* main.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; path = main.m; sourceTree = \"\"; };\n\t\tA793EB6A21F4CEDF003661CD /* NSObject+MNTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; path = \"NSObject+MNTest.m\"; sourceTree = \"\"; };\n\t\tA793EB6B21F4CEDF003661CD /* NSObject+MNTest.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = \"NSObject+MNTest.h\"; sourceTree = \"\"; };\n/* End PBXFileReference section */\n\n/* Begin PBXFrameworksBuildPhase section */\n\t\tA793EB5D21F4CECA003661CD /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXFrameworksBuildPhase section */\n\n/* Begin PBXGroup section */\n\t\tA793EB5721F4CECA003661CD = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\tA793EB6221F4CECA003661CD /* InterView-obj-isa-class */,\n\t\t\t\tA793EB6121F4CECA003661CD /* Products */,\n\t\t\t);\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\tA793EB6121F4CECA003661CD /* Products */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\tA793EB6021F4CECA003661CD /* InterView-obj-isa-class */,\n\t\t\t);\n\t\t\tname = Products;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\tA793EB6221F4CECA003661CD /* InterView-obj-isa-class */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\tA793EB6B21F4CEDF003661CD /* NSObject+MNTest.h */,\n\t\t\t\tA793EB6A21F4CEDF003661CD /* NSObject+MNTest.m */,\n\t\t\t\tA793EB6321F4CECA003661CD /* main.m */,\n\t\t\t);\n\t\t\tpath = \"InterView-obj-isa-class\";\n\t\t\tsourceTree = \"\";\n\t\t};\n/* End PBXGroup section */\n\n/* Begin PBXNativeTarget section */\n\t\tA793EB5F21F4CECA003661CD /* InterView-obj-isa-class */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = A793EB6721F4CECA003661CD /* Build configuration list for PBXNativeTarget \"InterView-obj-isa-class\" */;\n\t\t\tbuildPhases = (\n\t\t\t\tA793EB5C21F4CECA003661CD /* Sources */,\n\t\t\t\tA793EB5D21F4CECA003661CD /* Frameworks */,\n\t\t\t\tA793EB5E21F4CECA003661CD /* CopyFiles */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = \"InterView-obj-isa-class\";\n\t\t\tproductName = \"InterView-obj-isa-class\";\n\t\t\tproductReference = A793EB6021F4CECA003661CD /* InterView-obj-isa-class */;\n\t\t\tproductType = \"com.apple.product-type.tool\";\n\t\t};\n/* End PBXNativeTarget section */\n\n/* Begin PBXProject section */\n\t\tA793EB5821F4CECA003661CD /* Project object */ = {\n\t\t\tisa = PBXProject;\n\t\t\tattributes = {\n\t\t\t\tLastUpgradeCheck = 0930;\n\t\t\t\tORGANIZATIONNAME = \"梁宇航\";\n\t\t\t\tTargetAttributes = {\n\t\t\t\t\tA793EB5F21F4CECA003661CD = {\n\t\t\t\t\t\tCreatedOnToolsVersion = 9.3;\n\t\t\t\t\t};\n\t\t\t\t};\n\t\t\t};\n\t\t\tbuildConfigurationList = A793EB5B21F4CECA003661CD /* Build configuration list for PBXProject \"InterView-obj-isa-class\" */;\n\t\t\tcompatibilityVersion = \"Xcode 9.3\";\n\t\t\tdevelopmentRegion = en;\n\t\t\thasScannedForEncodings = 0;\n\t\t\tknownRegions = (\n\t\t\t\ten,\n\t\t\t);\n\t\t\tmainGroup = A793EB5721F4CECA003661CD;\n\t\t\tproductRefGroup = A793EB6121F4CECA003661CD /* Products */;\n\t\t\tprojectDirPath = \"\";\n\t\t\tprojectRoot = \"\";\n\t\t\ttargets = (\n\t\t\t\tA793EB5F21F4CECA003661CD /* InterView-obj-isa-class */,\n\t\t\t);\n\t\t};\n/* End PBXProject section */\n\n/* Begin PBXSourcesBuildPhase section */\n\t\tA793EB5C21F4CECA003661CD /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\tA793EB6C21F4CEDF003661CD /* NSObject+MNTest.m in Sources */,\n\t\t\t\tA793EB6421F4CECA003661CD /* main.m in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXSourcesBuildPhase section */\n\n/* Begin XCBuildConfiguration section */\n\t\tA793EB6521F4CECA003661CD /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\n\t\t\t\tCLANG_ANALYZER_NONNULL = YES;\n\t\t\t\tCLANG_ANALYZER_NUMBER_OBJECT_CONVERSION = YES_AGGRESSIVE;\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++14\";\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\n\t\t\t\tCLANG_ENABLE_OBJC_WEAK = YES;\n\t\t\t\tCLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_COMMA = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_DEPRECATED_OBJC_IMPLEMENTATIONS = YES;\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\n\t\t\t\tCLANG_WARN_DOCUMENTATION_COMMENTS = YES;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INFINITE_RECURSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_IMPLICIT_RETAIN_SELF = YES;\n\t\t\t\tCLANG_WARN_OBJC_LITERAL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\n\t\t\t\tCLANG_WARN_RANGE_LOOP_ANALYSIS = YES;\n\t\t\t\tCLANG_WARN_STRICT_PROTOTYPES = YES;\n\t\t\t\tCLANG_WARN_SUSPICIOUS_MOVE = YES;\n\t\t\t\tCLANG_WARN_UNGUARDED_AVAILABILITY = YES_AGGRESSIVE;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\n\t\t\t\tCODE_SIGN_IDENTITY = \"-\";\n\t\t\t\tCOPY_PHASE_STRIP = NO;\n\t\t\t\tDEBUG_INFORMATION_FORMAT = dwarf;\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\n\t\t\t\tENABLE_TESTABILITY = YES;\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu11;\n\t\t\t\tGCC_DYNAMIC_NO_PIC = NO;\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\n\t\t\t\tGCC_OPTIMIZATION_LEVEL = 0;\n\t\t\t\tGCC_PREPROCESSOR_DEFINITIONS = (\n\t\t\t\t\t\"DEBUG=1\",\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t);\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tMACOSX_DEPLOYMENT_TARGET = 10.13;\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = YES;\n\t\t\t\tONLY_ACTIVE_ARCH = YES;\n\t\t\t\tSDKROOT = macosx;\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\tA793EB6621F4CECA003661CD /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\n\t\t\t\tCLANG_ANALYZER_NONNULL = YES;\n\t\t\t\tCLANG_ANALYZER_NUMBER_OBJECT_CONVERSION = YES_AGGRESSIVE;\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++14\";\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\n\t\t\t\tCLANG_ENABLE_OBJC_WEAK = YES;\n\t\t\t\tCLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_COMMA = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_DEPRECATED_OBJC_IMPLEMENTATIONS = YES;\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\n\t\t\t\tCLANG_WARN_DOCUMENTATION_COMMENTS = YES;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INFINITE_RECURSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_IMPLICIT_RETAIN_SELF = YES;\n\t\t\t\tCLANG_WARN_OBJC_LITERAL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\n\t\t\t\tCLANG_WARN_RANGE_LOOP_ANALYSIS = YES;\n\t\t\t\tCLANG_WARN_STRICT_PROTOTYPES = YES;\n\t\t\t\tCLANG_WARN_SUSPICIOUS_MOVE = YES;\n\t\t\t\tCLANG_WARN_UNGUARDED_AVAILABILITY = YES_AGGRESSIVE;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\n\t\t\t\tCODE_SIGN_IDENTITY = \"-\";\n\t\t\t\tCOPY_PHASE_STRIP = NO;\n\t\t\t\tDEBUG_INFORMATION_FORMAT = \"dwarf-with-dsym\";\n\t\t\t\tENABLE_NS_ASSERTIONS = NO;\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu11;\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tMACOSX_DEPLOYMENT_TARGET = 10.13;\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = NO;\n\t\t\t\tSDKROOT = macosx;\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\tA793EB6821F4CECA003661CD /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCODE_SIGN_STYLE = Automatic;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\tA793EB6921F4CECA003661CD /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCODE_SIGN_STYLE = Automatic;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n/* End XCBuildConfiguration section */\n\n/* Begin XCConfigurationList section */\n\t\tA793EB5B21F4CECA003661CD /* Build configuration list for PBXProject \"InterView-obj-isa-class\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\tA793EB6521F4CECA003661CD /* Debug */,\n\t\t\t\tA793EB6621F4CECA003661CD /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\tA793EB6721F4CECA003661CD /* Build configuration list for PBXNativeTarget \"InterView-obj-isa-class\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\tA793EB6821F4CECA003661CD /* Debug */,\n\t\t\t\tA793EB6921F4CECA003661CD /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n/* End XCConfigurationList section */\n\t};\n\trootObject = A793EB5821F4CECA003661CD /* Project object */;\n}\n"
},
{
"path": "InterView-obj-isa-class/InterView-obj-isa-class.xcodeproj/project.xcworkspace/contents.xcworkspacedata",
"content": "\n\n \n \n\n"
},
{
"path": "InterView-obj-isa-class/InterView-obj-isa-class.xcodeproj/project.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist",
"content": "\n\n\n\n\tIDEDidComputeMac32BitWarning\n\t\n\n\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/.clang-format",
"content": "# Format of this file is YAML\n# Minimum clang-format version required: clang-format version 3.6.0\n# Detailed description of options available at http://clang.llvm.org/docs/ClangFormatStyleOptions.html\n\nAlignEscapedNewlinesLeft: true\n# Bad:\n# void foo() {\n# someFunction();\n# someOtherFunction();\n# }\n# Good:\n# void foo() {\n# someFunction();\n# someOtherFunction();\n# }\n\nAlignTrailingComments: true\n# align all comments to right based of //\n# == Avoid using // based comments altogether ==\n\nAlignAfterOpenBracket: false\n# don't align after a bracket, uses indentation rules to indent\n\nAllowAllParametersOfDeclarationOnNextLine: false\n# allow funtion definition as\n# someFunction(foo,\n# bar,\n# baz);\n\nAlignConsecutiveAssignments: false\n# does not align consecutive assignments with '=' operator\n\nAllowShortBlocksOnASingleLine: true\n# single statement block can be merged on one line \n# e.g if (a) { return; }\n\nAllowShortCaseLabelsOnASingleLine: false\n# Single statement case statements should be on their own lines\n\nAllowShortFunctionsOnASingleLine: None\n# Bad:\n# int foo() { return 123; }\n\nAllowShortIfStatementsOnASingleLine: false\n# Bad: \n# if (someOtherVar) return; \n# Good:\n# if (someOtherVar) \n# return;\n\nAllowShortLoopsOnASingleLine: false\n# Bad:\n# while(i>0) i--;\n# Good:\n# while(i>0) {\n# i--;\n# }\n\nAlwaysBreakAfterDefinitionReturnType: true\n# Ensures return type is one its own line\n# e.g. unsigned int\n# function(char param) { }\n\nAlwaysBreakBeforeMultilineStrings: true\n# multine strings should begin on new line\n\nBinPackArguments: true\nBinPackParameters: false\n# functions arguments should all be on one line or have a single line for each param\n\nBreakBeforeBinaryOperators: None\n# break for new line after binary operator in case of length is over ColumnLimit\n# e.g.\n# int foo = bar +\n# baz;\n\nBreakBeforeBraces: Linux\n# Always attach braces to surrounding context except -\n# break before braces on function, namespace and class definitions\n\nColumnLimit: 132\n# every body has wide screen now. 132 seems to be reasonable limit now.\n\nContinuationIndentWidth: 8\n# indent continued lines by two tabs\n\nIndentCaseLabels: false\n# case labels have same indentation as switch statement.\n\nIndentWidth: 4\n# 4 spaces for indentation\nTabWidth: 4\n# tabwidth is 4 spaces\n\nUseTab: Always\n# always indent lines with tabs\n\nIndentWrappedFunctionNames: false\nKeepEmptyLinesAtTheStartOfBlocks: false\n# remove excess empty lines at start of blocks.\n\nPointerAlignment: Right\n# \"void *foo\" (vs. \"void* foo\" or \"void * foo\")\n\nSpaceAfterCStyleCast: false\n# No space after (cast). E.g\n# int blah = (int)((void *)foo + bar)\n\nSpaceBeforeAssignmentOperators: true\n# Assignment = should be seperated by spaces on both sides.\n\nSpaceBeforeParens: ControlStatements\n# for control statements a space is required before '{'\n# Bad: for(){ statement; }\n# Good: for() { statement; }\n\nSpaceInEmptyParentheses: false\n# No spaces required for empty ()\n\nSpacesInCStyleCastParentheses: false\n# No spaces required for (unsigned int) type cast\n\nSpacesInParentheses: false\n\nSpacesInSquareBrackets: false\n# No spaces in [count] style invocations of []\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/.gitattributes",
"content": ""
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/.gitignore",
"content": "# /libmalloc.xcodeproj/\n/libmalloc.xcodeproj/*.xcworkspace\n/libmalloc.xcodeproj/xcuserdata\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/include/malloc/_malloc.h",
"content": "/*\n * Copyright (c) 2018 Apple Computer, Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef _MALLOC_UNDERSCORE_MALLOC_H_\n#define _MALLOC_UNDERSCORE_MALLOC_H_\n\n/*\n * This header is included from , so the contents of this file have\n * broad source compatibility and POSIX conformance implications.\n * Be cautious about what is included and declared here.\n */\n\n#include \n#include \n#include <_types.h>\n#include \n\n__BEGIN_DECLS\n\nvoid\t*malloc(size_t __size) __result_use_check __alloc_size(1);\nvoid\t*calloc(size_t __count, size_t __size) __result_use_check __alloc_size(1,2);\nvoid\t free(void *);\nvoid\t*realloc(void *__ptr, size_t __size) __result_use_check __alloc_size(2);\n#if !defined(_ANSI_SOURCE) && (!defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE))\nvoid\t*valloc(size_t) __alloc_size(1);\n#endif // !defined(_ANSI_SOURCE) && (!defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE))\nint \t posix_memalign(void **__memptr, size_t __alignment, size_t __size) __OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_3_0);\n\n__END_DECLS\n\n#endif /* _MALLOC_UNDERSCORE_MALLOC_H_ */\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/include/malloc/malloc.h",
"content": "/*\n * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n * \n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n * \n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n * \n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef _MALLOC_MALLOC_H_\n#define _MALLOC_MALLOC_H_\n\n#include \n#include \n#include \n#include \n\n#if __has_feature(ptrauth_calls)\n#include \n\n// Zone function pointer, type-diversified but not address-diversified (because\n// the zone can be copied). Process-independent because the zone structure may\n// be in the shared library cache.\n#define MALLOC_ZONE_FN_PTR(fn) __ptrauth(ptrauth_key_process_independent_code, \\\n\t\tFALSE, ptrauth_string_discriminator(\"malloc_zone_fn.\" #fn)) fn\n\n// Introspection function pointer, address- and type-diversified.\n// Process-independent because the malloc_introspection_t structure that contains\n// these pointers may be in the shared library cache.\n#define MALLOC_INTROSPECT_FN_PTR(fn) __ptrauth(ptrauth_key_process_independent_code, \\\n\t\tTRUE, ptrauth_string_discriminator(\"malloc_introspect_fn.\" #fn)) fn\n\n// Pointer to the introspection pointer table, type-diversified but not\n// address-diversified (because the zone can be copied).\n// Process-independent because the table pointer may be in the shared library cache.\n#define MALLOC_INTROSPECT_TBL_PTR(ptr) __ptrauth(ptrauth_key_process_independent_data,\\\n\t\tFALSE, ptrauth_string_discriminator(\"malloc_introspect_tbl\")) ptr\n\n#endif\t// __has_feature(ptrauth_calls)\n\n#ifndef MALLOC_ZONE_FN_PTR\n#define MALLOC_ZONE_FN_PTR(fn) fn\n#define MALLOC_INTROSPECT_FN_PTR(fn) fn\n#define MALLOC_INTROSPECT_TBL_PTR(ptr) ptr\n#endif // MALLOC_ZONE_FN_PTR\n\n__BEGIN_DECLS\n/*********\tType definitions\t************/\n\ntypedef struct _malloc_zone_t {\n /* Only zone implementors should depend on the layout of this structure;\n Regular callers should use the access functions below */\n void\t*reserved1;\t/* RESERVED FOR CFAllocator DO NOT USE */\n void\t*reserved2;\t/* RESERVED FOR CFAllocator DO NOT USE */\n size_t \t(* MALLOC_ZONE_FN_PTR(size))(struct _malloc_zone_t *zone, const void *ptr); /* returns the size of a block or 0 if not in this zone; must be fast, especially for negative answers */\n void \t*(* MALLOC_ZONE_FN_PTR(malloc))(struct _malloc_zone_t *zone, size_t size);\n void \t*(* MALLOC_ZONE_FN_PTR(calloc))(struct _malloc_zone_t *zone, size_t num_items, size_t size); /* same as malloc, but block returned is set to zero */\n void \t*(* MALLOC_ZONE_FN_PTR(valloc))(struct _malloc_zone_t *zone, size_t size); /* same as malloc, but block returned is set to zero and is guaranteed to be page aligned */\n void \t(* MALLOC_ZONE_FN_PTR(free))(struct _malloc_zone_t *zone, void *ptr);\n void \t*(* MALLOC_ZONE_FN_PTR(realloc))(struct _malloc_zone_t *zone, void *ptr, size_t size);\n void \t(* MALLOC_ZONE_FN_PTR(destroy))(struct _malloc_zone_t *zone); /* zone is destroyed and all memory reclaimed */\n const char\t*zone_name;\n\n /* Optional batch callbacks; these may be NULL */\n unsigned\t(* MALLOC_ZONE_FN_PTR(batch_malloc))(struct _malloc_zone_t *zone, size_t size, void **results, unsigned num_requested); /* given a size, returns pointers capable of holding that size; returns the number of pointers allocated (maybe 0 or less than num_requested) */\n void\t(* MALLOC_ZONE_FN_PTR(batch_free))(struct _malloc_zone_t *zone, void **to_be_freed, unsigned num_to_be_freed); /* frees all the pointers in to_be_freed; note that to_be_freed may be overwritten during the process */\n\n struct malloc_introspection_t\t* MALLOC_INTROSPECT_TBL_PTR(introspect);\n unsigned\tversion;\n \t\n /* aligned memory allocation. The callback may be NULL. Present in version >= 5. */\n void *(* MALLOC_ZONE_FN_PTR(memalign))(struct _malloc_zone_t *zone, size_t alignment, size_t size);\n \n /* free a pointer known to be in zone and known to have the given size. The callback may be NULL. Present in version >= 6.*/\n void (* MALLOC_ZONE_FN_PTR(free_definite_size))(struct _malloc_zone_t *zone, void *ptr, size_t size);\n\n /* Empty out caches in the face of memory pressure. The callback may be NULL. Present in version >= 8. */\n size_t \t(* MALLOC_ZONE_FN_PTR(pressure_relief))(struct _malloc_zone_t *zone, size_t goal);\n\n\t/*\n\t * Checks whether an address might belong to the zone. May be NULL. Present in version >= 10.\n\t * False positives are allowed (e.g. the pointer was freed, or it's in zone space that has\n\t * not yet been allocated. False negatives are not allowed.\n\t */\n boolean_t (* MALLOC_ZONE_FN_PTR(claimed_address))(struct _malloc_zone_t *zone, void *ptr);\n} malloc_zone_t;\n\n/*********\tCreation and destruction\t************/\n\nextern malloc_zone_t *malloc_default_zone(void);\n /* The initial zone */\n\nextern malloc_zone_t *malloc_create_zone(vm_size_t start_size, unsigned flags);\n /* Creates a new zone with default behavior and registers it */\n\nextern void malloc_destroy_zone(malloc_zone_t *zone);\n /* Destroys zone and everything it allocated */\n\n/*********\tBlock creation and manipulation\t************/\n\nextern void *malloc_zone_malloc(malloc_zone_t *zone, size_t size) __alloc_size(2);\n /* Allocates a new pointer of size size; zone must be non-NULL */\n\nextern void *malloc_zone_calloc(malloc_zone_t *zone, size_t num_items, size_t size) __alloc_size(2,3);\n /* Allocates a new pointer of size num_items * size; block is cleared; zone must be non-NULL */\n\nextern void *malloc_zone_valloc(malloc_zone_t *zone, size_t size) __alloc_size(2);\n /* Allocates a new pointer of size size; zone must be non-NULL; Pointer is guaranteed to be page-aligned and block is cleared */\n\nextern void malloc_zone_free(malloc_zone_t *zone, void *ptr);\n /* Frees pointer in zone; zone must be non-NULL */\n\nextern void *malloc_zone_realloc(malloc_zone_t *zone, void *ptr, size_t size) __alloc_size(3);\n /* Enlarges block if necessary; zone must be non-NULL */\n\nextern malloc_zone_t *malloc_zone_from_ptr(const void *ptr);\n /* Returns the zone for a pointer, or NULL if not in any zone.\n The ptr must have been returned from a malloc or realloc call. */\n\nextern size_t malloc_size(const void *ptr);\n /* Returns size of given ptr */\n\nextern size_t malloc_good_size(size_t size);\n /* Returns number of bytes greater than or equal to size that can be allocated without padding */\n\nextern void *malloc_zone_memalign(malloc_zone_t *zone, size_t alignment, size_t size) __alloc_size(3) __OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_3_0);\n /* \n * Allocates a new pointer of size size whose address is an exact multiple of alignment.\n * alignment must be a power of two and at least as large as sizeof(void *).\n * zone must be non-NULL.\n */\n\n/*********\tBatch methods\t************/\n\nextern unsigned malloc_zone_batch_malloc(malloc_zone_t *zone, size_t size, void **results, unsigned num_requested);\n /* Allocates num blocks of the same size; Returns the number truly allocated (may be 0) */\n\nextern void malloc_zone_batch_free(malloc_zone_t *zone, void **to_be_freed, unsigned num);\n /* frees all the pointers in to_be_freed; note that to_be_freed may be overwritten during the process; This function will always free even if the zone has no batch callback */\n\n/*********\tFunctions for libcache\t************/\n\nextern malloc_zone_t *malloc_default_purgeable_zone(void) __OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_3_0);\n /* Returns a pointer to the default purgeable_zone. */\n\nextern void malloc_make_purgeable(void *ptr) __OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_3_0);\n /* Make an allocation from the purgeable zone purgeable if possible. */\n\nextern int malloc_make_nonpurgeable(void *ptr) __OSX_AVAILABLE_STARTING(__MAC_10_6, __IPHONE_3_0);\n /* Makes an allocation from the purgeable zone nonpurgeable.\n * Returns zero if the contents were not purged since the last\n * call to malloc_make_purgeable, else returns non-zero. */\n\n/*********\tFunctions for zone implementors\t************/\n\nextern void malloc_zone_register(malloc_zone_t *zone);\n /* Registers a custom malloc zone; Should typically be called after a \n * malloc_zone_t has been filled in with custom methods by a client. See\n * malloc_create_zone for creating additional malloc zones with the\n * default allocation and free behavior. */\n\nextern void malloc_zone_unregister(malloc_zone_t *zone);\n /* De-registers a zone\n Should typically be called before calling the zone destruction routine */\n\nextern void malloc_set_zone_name(malloc_zone_t *zone, const char *name);\n /* Sets the name of a zone */\n\nextern const char *malloc_get_zone_name(malloc_zone_t *zone);\n /* Returns the name of a zone */\n\nsize_t malloc_zone_pressure_relief(malloc_zone_t *zone, size_t goal) __OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_3);\n /* malloc_zone_pressure_relief() advises the malloc subsystem that the process is under memory pressure and \n * that the subsystem should make its best effort towards releasing (i.e. munmap()-ing) \"goal\" bytes from \"zone\". \n * If \"goal\" is passed as zero, the malloc subsystem will attempt to achieve maximal pressure relief in \"zone\". \n * If \"zone\" is passed as NULL, all zones are examined for pressure relief opportunities. \n * malloc_zone_pressure_relief() returns the number of bytes released. \n */\n\ntypedef struct {\n vm_address_t\taddress;\n vm_size_t\t\tsize;\n} vm_range_t;\n\ntypedef struct malloc_statistics_t {\n unsigned\tblocks_in_use;\n size_t\tsize_in_use;\n size_t\tmax_size_in_use;\t/* high water mark of touched memory */\n size_t\tsize_allocated;\t\t/* reserved in memory */\n} malloc_statistics_t;\n\ntypedef kern_return_t memory_reader_t(task_t remote_task, vm_address_t remote_address, vm_size_t size, void **local_memory);\n /* given a task, \"reads\" the memory at the given address and size\nlocal_memory: set to a contiguous chunk of memory; validity of local_memory is assumed to be limited (until next call) */\n\n#define MALLOC_PTR_IN_USE_RANGE_TYPE\t1\t/* for allocated pointers */\n#define MALLOC_PTR_REGION_RANGE_TYPE\t2\t/* for region containing pointers */\n#define MALLOC_ADMIN_REGION_RANGE_TYPE\t4\t/* for region used internally */\n#define MALLOC_ZONE_SPECIFIC_FLAGS\t0xff00\t/* bits reserved for zone-specific purposes */\n\ntypedef void vm_range_recorder_t(task_t, void *, unsigned type, vm_range_t *, unsigned);\n /* given a task and context, \"records\" the specified addresses */\n\ntypedef struct malloc_introspection_t {\n\tkern_return_t (* MALLOC_INTROSPECT_FN_PTR(enumerator))(task_t task, void *, unsigned type_mask, vm_address_t zone_address, memory_reader_t reader, vm_range_recorder_t recorder); /* enumerates all the malloc pointers in use */\n\tsize_t\t(* MALLOC_INTROSPECT_FN_PTR(good_size))(malloc_zone_t *zone, size_t size);\n\tboolean_t \t(* MALLOC_INTROSPECT_FN_PTR(check))(malloc_zone_t *zone); /* Consistency checker */\n\tvoid \t(* MALLOC_INTROSPECT_FN_PTR(print))(malloc_zone_t *zone, boolean_t verbose); /* Prints zone */\n\tvoid\t(* MALLOC_INTROSPECT_FN_PTR(log))(malloc_zone_t *zone, void *address); /* Enables logging of activity */\n\tvoid\t(* MALLOC_INTROSPECT_FN_PTR(force_lock))(malloc_zone_t *zone); /* Forces locking zone */\n\tvoid\t(* MALLOC_INTROSPECT_FN_PTR(force_unlock))(malloc_zone_t *zone); /* Forces unlocking zone */\n\tvoid\t(* MALLOC_INTROSPECT_FN_PTR(statistics))(malloc_zone_t *zone, malloc_statistics_t *stats); /* Fills statistics */\n\tboolean_t (* MALLOC_INTROSPECT_FN_PTR(zone_locked))(malloc_zone_t *zone); /* Are any zone locks held */\n\n /* Discharge checking. Present in version >= 7. */\n\tboolean_t\t(* MALLOC_INTROSPECT_FN_PTR(enable_discharge_checking))(malloc_zone_t *zone);\n\tvoid\t(* MALLOC_INTROSPECT_FN_PTR(disable_discharge_checking))(malloc_zone_t *zone);\n\tvoid\t(* MALLOC_INTROSPECT_FN_PTR(discharge))(malloc_zone_t *zone, void *memory);\n#ifdef __BLOCKS__\n\tvoid (* MALLOC_INTROSPECT_FN_PTR(enumerate_discharged_pointers))(malloc_zone_t *zone, void (^report_discharged)(void *memory, void *info));\n\t#else\n void\t*enumerate_unavailable_without_blocks; \n#endif /* __BLOCKS__ */\n\tvoid\t(* MALLOC_INTROSPECT_FN_PTR(reinit_lock))(malloc_zone_t *zone); /* Reinitialize zone locks, called only from atfork_child handler. Present in version >= 9. */\n} malloc_introspection_t;\n\nextern void malloc_printf(const char *format, ...);\n /* Convenience for logging errors and warnings;\n No allocation is performed during execution of this function;\n Only understands usual %p %d %s formats, and %y that expresses a number of bytes (5b,10KB,1MB...)\n */\n\n/*********\tFunctions for performance tools\t************/\n\nextern kern_return_t malloc_get_all_zones(task_t task, memory_reader_t reader, vm_address_t **addresses, unsigned *count);\n /* Fills addresses and count with the addresses of the zones in task;\n Note that the validity of the addresses returned correspond to the validity of the memory returned by reader */\n\n/*********\tDebug helpers\t************/\n\nextern void malloc_zone_print_ptr_info(void *ptr);\n /* print to stdout if this pointer is in the malloc heap, free status, and size */\n\nextern boolean_t malloc_zone_check(malloc_zone_t *zone);\n /* Checks zone is well formed; if !zone, checks all zones */\n\nextern void malloc_zone_print(malloc_zone_t *zone, boolean_t verbose);\n /* Prints summary on zone; if !zone, prints all zones */\n\nextern void malloc_zone_statistics(malloc_zone_t *zone, malloc_statistics_t *stats);\n /* Fills statistics for zone; if !zone, sums up all zones */\n\nextern void malloc_zone_log(malloc_zone_t *zone, void *address);\n /* Controls logging of all activity; if !zone, for all zones;\n If address==0 nothing is logged;\n If address==-1 all activity is logged;\n Else only the activity regarding address is logged */\n\nstruct mstats {\n size_t\tbytes_total;\n size_t\tchunks_used;\n size_t\tbytes_used;\n size_t\tchunks_free;\n size_t\tbytes_free;\n};\n\nextern struct mstats mstats(void);\n\nextern boolean_t malloc_zone_enable_discharge_checking(malloc_zone_t *zone) __OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_3);\n/* Increment the discharge checking enabled counter for a zone. Returns true if the zone supports checking, false if it does not. */\n\nextern void malloc_zone_disable_discharge_checking(malloc_zone_t *zone) __OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_3);\n/* Decrement the discharge checking enabled counter for a zone. */\n\nextern void malloc_zone_discharge(malloc_zone_t *zone, void *memory) __OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_3);\n/* Register memory that the programmer expects to be freed soon. \n zone may be NULL in which case the zone is determined using malloc_zone_from_ptr(). \n If discharge checking is off for the zone this function is a no-op. */\n \n#ifdef __BLOCKS__\nextern void malloc_zone_enumerate_discharged_pointers(malloc_zone_t *zone, void (^report_discharged)(void *memory, void *info)) __OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_3);\n/* Calls report_discharged for each block that was registered using malloc_zone_discharge() but has not yet been freed. \n info is used to provide zone defined information about the memory block. \n If zone is NULL then the enumeration covers all zones. */\n#else\nextern void malloc_zone_enumerate_discharged_pointers(malloc_zone_t *zone, void *) __OSX_AVAILABLE_STARTING(__MAC_10_7, __IPHONE_4_3);\n#endif /* __BLOCKS__ */\n\n__END_DECLS\n\n#endif /* _MALLOC_MALLOC_H_ */\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/libmalloc.xcodeproj/project.pbxproj",
"content": "// !$*UTF8*$!\n{\n\tarchiveVersion = 1;\n\tclasses = {\n\t};\n\tobjectVersion = 46;\n\tobjects = {\n\n/* Begin PBXAggregateTarget section */\n\t\t3FE9201116A9111000D1238A /* libmalloc */ = {\n\t\t\tisa = PBXAggregateTarget;\n\t\t\tbuildConfigurationList = 3FE9201216A9111000D1238A /* Build configuration list for PBXAggregateTarget \"libmalloc\" */;\n\t\t\tbuildPhases = (\n\t\t\t\t3FC1927C16DD946500315C26 /* Install Man Pages */,\n\t\t\t\t3FE9201D16A9143E00D1238A /* Sanitise Headers (rdar://problem/10241868) */,\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t\tC0CE45501C52CCBD00C24048 /* PBXTargetDependency */,\n\t\t\t\t3FE9201816A9111600D1238A /* PBXTargetDependency */,\n\t\t\t\t3FE9201616A9111400D1238A /* PBXTargetDependency */,\n\t\t\t);\n\t\t\tname = libmalloc;\n\t\t\tproductName = libmalloc;\n\t\t};\n\t\t45039161198FFF73004EE2A3 /* libmalloc_test */ = {\n\t\t\tisa = PBXAggregateTarget;\n\t\t\tbuildConfigurationList = 45039162198FFF73004EE2A3 /* Build configuration list for PBXAggregateTarget \"libmalloc_test\" */;\n\t\t\tbuildPhases = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t\t45039168198FFFA6004EE2A3 /* PBXTargetDependency */,\n\t\t\t\t925383D91BD03D0000F745DB /* PBXTargetDependency */,\n\t\t\t);\n\t\t\tname = libmalloc_test;\n\t\t\tproductName = libmalloc_test;\n\t\t};\n\t\tB60A57932009307E006215CB /* executables */ = {\n\t\t\tisa = PBXAggregateTarget;\n\t\t\tbuildConfigurationList = B60A57962009307E006215CB /* Build configuration list for PBXAggregateTarget \"executables\" */;\n\t\t\tbuildPhases = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t\tB60A579820093093006215CB /* PBXTargetDependency */,\n\t\t\t);\n\t\t\tname = executables;\n\t\t\tproductName = executables;\n\t\t};\n/* End PBXAggregateTarget section */\n\n/* Begin PBXBuildFile section */\n\t\t084F5E841D50204F006CD296 /* Foundation.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 084F5E831D50204F006CD296 /* Foundation.framework */; };\n\t\t084F5E851D502102006CD296 /* radix_tree_debug.c in Sources */ = {isa = PBXBuildFile; fileRef = 08C28B3A1D501ACC000AE997 /* radix_tree_debug.c */; };\n\t\t088C4D771D1AF049005C6B36 /* radix_tree.c in Sources */ = {isa = PBXBuildFile; fileRef = 088C4D741D1AEFB5005C6B36 /* radix_tree.c */; };\n\t\t088C4D841D1AF16F005C6B36 /* radix_tree.c in Sources */ = {isa = PBXBuildFile; fileRef = 088C4D741D1AEFB5005C6B36 /* radix_tree.c */; };\n\t\t08FEED021D501F6B00BE8A69 /* radix_tree_main.m in Sources */ = {isa = PBXBuildFile; fileRef = 08C28B421D501D2C000AE997 /* radix_tree_main.m */; };\n\t\t0D468DCF1C7BEF51006FACF5 /* magazine_lite.c in Sources */ = {isa = PBXBuildFile; fileRef = 0D468DCC1C7BEE56006FACF5 /* magazine_lite.c */; };\n\t\t0D468DD01C7BEF71006FACF5 /* stack_logging_internal.h in Headers */ = {isa = PBXBuildFile; fileRef = 0D468DCD1C7BEE65006FACF5 /* stack_logging_internal.h */; };\n\t\t2B67B5682040B3AF0003E78F /* _malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = 2B67B5672040B3A50003E78F /* _malloc.h */; settings = {ATTRIBUTES = (Public, ); }; };\n\t\t3D157E7420354E02001630BF /* perfdata.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 3D157E7320354E02001630BF /* perfdata.framework */; };\n\t\t3FE91FED16A90B9200D1238A /* bitarray.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD116A90A8D00D1238A /* bitarray.c */; };\n\t\t3FE91FF016A90B9200D1238A /* magazine_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD616A90A8D00D1238A /* magazine_malloc.c */; };\n\t\t3FE91FF116A90B9200D1238A /* magmallocProvider.d in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD716A90A8D00D1238A /* magmallocProvider.d */; };\n\t\t3FE91FF216A90B9200D1238A /* malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD816A90A8D00D1238A /* malloc.c */; };\n\t\t3FE91FF416A90B9200D1238A /* nano_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDA16A90A8D00D1238A /* nano_malloc.c */; };\n\t\t3FE91FF616A90B9200D1238A /* stack_logging_disk.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDC16A90A8D00D1238A /* stack_logging_disk.c */; };\n\t\t3FE91FFA16A90BEF00D1238A /* malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = 3FE91FF916A90BEF00D1238A /* malloc.h */; settings = {ATTRIBUTES = (Public, ); }; };\n\t\t3FE91FFF16A9109E00D1238A /* bitarray.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD116A90A8D00D1238A /* bitarray.c */; };\n\t\t3FE9200116A9109E00D1238A /* magazine_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD616A90A8D00D1238A /* magazine_malloc.c */; };\n\t\t3FE9200216A9109E00D1238A /* magmallocProvider.d in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD716A90A8D00D1238A /* magmallocProvider.d */; };\n\t\t3FE9200316A9109E00D1238A /* malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD816A90A8D00D1238A /* malloc.c */; };\n\t\t3FE9200416A9109E00D1238A /* nano_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDA16A90A8D00D1238A /* nano_malloc.c */; };\n\t\t3FE9200616A9109E00D1238A /* stack_logging_disk.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDC16A90A8D00D1238A /* stack_logging_disk.c */; };\n\t\t925383DA1BD03D5100F745DB /* stress_test.c in Sources */ = {isa = PBXBuildFile; fileRef = 925383D11BD03B4A00F745DB /* stress_test.c */; };\n\t\tB61341DE20114B660038D163 /* ktrace.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = B61341DD20114B070038D163 /* ktrace.framework */; };\n\t\tB629CF28202BA149007719B9 /* nanov2_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7FA41FCDD9A500BAD1AA /* nanov2_malloc.c */; };\n\t\tB629CF2D202BB337007719B9 /* radix_tree.c in Sources */ = {isa = PBXBuildFile; fileRef = 088C4D741D1AEFB5005C6B36 /* radix_tree.c */; };\n\t\tB629CF2E202BB337007719B9 /* bitarray.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD116A90A8D00D1238A /* bitarray.c */; };\n\t\tB629CF2F202BB337007719B9 /* purgeable_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429E1BF681B00027269A /* purgeable_malloc.c */; };\n\t\tB629CF30202BB337007719B9 /* magazine_large.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429B1BF672F80027269A /* magazine_large.c */; };\n\t\tB629CF31202BB337007719B9 /* magazine_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD616A90A8D00D1238A /* magazine_malloc.c */; };\n\t\tB629CF32202BB337007719B9 /* empty.s in Sources */ = {isa = PBXBuildFile; fileRef = C9ABCA041CB6FC6800ECB399 /* empty.s */; };\n\t\tB629CF33202BB337007719B9 /* magazine_small.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742981BF670D00027269A /* magazine_small.c */; };\n\t\tB629CF34202BB337007719B9 /* legacy_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742AA1BF685CB0027269A /* legacy_malloc.c */; };\n\t\tB629CF35202BB337007719B9 /* magmallocProvider.d in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD716A90A8D00D1238A /* magmallocProvider.d */; };\n\t\tB629CF36202BB337007719B9 /* malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD816A90A8D00D1238A /* malloc.c */; };\n\t\tB629CF37202BB337007719B9 /* frozen_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742A41BF6842F0027269A /* frozen_malloc.c */; };\n\t\tB629CF38202BB337007719B9 /* nanov2_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7FA41FCDD9A500BAD1AA /* nanov2_malloc.c */; };\n\t\tB629CF39202BB337007719B9 /* nano_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDA16A90A8D00D1238A /* nano_malloc.c */; };\n\t\tB629CF3A202BB337007719B9 /* stack_logging_disk.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDC16A90A8D00D1238A /* stack_logging_disk.c */; };\n\t\tB629CF3B202BB337007719B9 /* magazine_tiny.c in Sources */ = {isa = PBXBuildFile; fileRef = C957428F1BF419DF0027269A /* magazine_tiny.c */; };\n\t\tB629CF3C202BB337007719B9 /* nano_malloc_common.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7F9D1FCDCBC600BAD1AA /* nano_malloc_common.c */; };\n\t\tB65FBE2C2087AA2F00E21F59 /* malloc_printf.c in Sources */ = {isa = PBXBuildFile; fileRef = B65FBE2B2087AA2F00E21F59 /* malloc_printf.c */; };\n\t\tB66C71D92034BFAE0047E265 /* malloc_common.h in Headers */ = {isa = PBXBuildFile; fileRef = B66C71D72034BFAE0047E265 /* malloc_common.h */; };\n\t\tB66C71DA2034BFAE0047E265 /* malloc_common.c in Sources */ = {isa = PBXBuildFile; fileRef = B66C71D82034BFAE0047E265 /* malloc_common.c */; };\n\t\tB66C71DB2034BFD30047E265 /* malloc_common.c in Sources */ = {isa = PBXBuildFile; fileRef = B66C71D82034BFAE0047E265 /* malloc_common.c */; };\n\t\tB66C71DC2034BFD40047E265 /* malloc_common.c in Sources */ = {isa = PBXBuildFile; fileRef = B66C71D82034BFAE0047E265 /* malloc_common.c */; };\n\t\tB68B7F9E1FCDCBC600BAD1AA /* nano_malloc_common.h in Headers */ = {isa = PBXBuildFile; fileRef = B68B7F9C1FCDCBC600BAD1AA /* nano_malloc_common.h */; };\n\t\tB68B7F9F1FCDCBC600BAD1AA /* nano_malloc_common.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7F9D1FCDCBC600BAD1AA /* nano_malloc_common.c */; };\n\t\tB68B7FA01FCDCBE700BAD1AA /* nano_malloc_common.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7F9D1FCDCBC600BAD1AA /* nano_malloc_common.c */; };\n\t\tB68B7FA11FCDCBE800BAD1AA /* nano_malloc_common.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7F9D1FCDCBC600BAD1AA /* nano_malloc_common.c */; };\n\t\tB68B7FA31FCDD67100BAD1AA /* nanov2_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = B68B7FA21FCDD60F00BAD1AA /* nanov2_malloc.h */; };\n\t\tB68B7FA51FCDD9A500BAD1AA /* nanov2_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7FA41FCDD9A500BAD1AA /* nanov2_malloc.c */; };\n\t\tB68B7FA61FCDD9B200BAD1AA /* nanov2_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7FA41FCDD9A500BAD1AA /* nanov2_malloc.c */; };\n\t\tB68B7FA71FCDD9B200BAD1AA /* nanov2_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7FA41FCDD9A500BAD1AA /* nanov2_malloc.c */; };\n\t\tB6910F67202B630D00FF2EB0 /* radix_tree.c in Sources */ = {isa = PBXBuildFile; fileRef = 088C4D741D1AEFB5005C6B36 /* radix_tree.c */; };\n\t\tB6910F68202B630D00FF2EB0 /* bitarray.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD116A90A8D00D1238A /* bitarray.c */; };\n\t\tB6910F69202B630D00FF2EB0 /* purgeable_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429E1BF681B00027269A /* purgeable_malloc.c */; };\n\t\tB6910F6A202B630D00FF2EB0 /* magazine_large.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429B1BF672F80027269A /* magazine_large.c */; };\n\t\tB6910F6B202B630D00FF2EB0 /* magazine_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD616A90A8D00D1238A /* magazine_malloc.c */; };\n\t\tB6910F6C202B630D00FF2EB0 /* empty.s in Sources */ = {isa = PBXBuildFile; fileRef = C9ABCA041CB6FC6800ECB399 /* empty.s */; };\n\t\tB6910F6D202B630D00FF2EB0 /* magazine_small.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742981BF670D00027269A /* magazine_small.c */; };\n\t\tB6910F6E202B630D00FF2EB0 /* legacy_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742AA1BF685CB0027269A /* legacy_malloc.c */; };\n\t\tB6910F6F202B630D00FF2EB0 /* magmallocProvider.d in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD716A90A8D00D1238A /* magmallocProvider.d */; };\n\t\tB6910F70202B630D00FF2EB0 /* malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD816A90A8D00D1238A /* malloc.c */; };\n\t\tB6910F71202B630D00FF2EB0 /* frozen_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742A41BF6842F0027269A /* frozen_malloc.c */; };\n\t\tB6910F73202B630D00FF2EB0 /* nano_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDA16A90A8D00D1238A /* nano_malloc.c */; };\n\t\tB6910F74202B630D00FF2EB0 /* stack_logging_disk.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDC16A90A8D00D1238A /* stack_logging_disk.c */; };\n\t\tB6910F75202B630D00FF2EB0 /* magazine_tiny.c in Sources */ = {isa = PBXBuildFile; fileRef = C957428F1BF419DF0027269A /* magazine_tiny.c */; };\n\t\tB6910F76202B630D00FF2EB0 /* nano_malloc_common.c in Sources */ = {isa = PBXBuildFile; fileRef = B68B7F9D1FCDCBC600BAD1AA /* nano_malloc_common.c */; };\n\t\tB6CA644E1FCE2C1900DEBA12 /* nanov2_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = B6CA644D1FCE2C0A00DEBA12 /* nanov2_zone.h */; };\n\t\tB6CA644F1FCE2C1A00DEBA12 /* nanov2_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = B6CA644D1FCE2C0A00DEBA12 /* nanov2_zone.h */; };\n\t\tB6CA64501FCE2C1B00DEBA12 /* nanov2_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = B6CA644D1FCE2C0A00DEBA12 /* nanov2_zone.h */; };\n\t\tB6CA64521FCF1AD200DEBA12 /* nano_zone_common.h in Headers */ = {isa = PBXBuildFile; fileRef = B6CA64511FCF1AAD00DEBA12 /* nano_zone_common.h */; };\n\t\tB6CA64531FCF1AD400DEBA12 /* nano_zone_common.h in Headers */ = {isa = PBXBuildFile; fileRef = B6CA64511FCF1AAD00DEBA12 /* nano_zone_common.h */; };\n\t\tB6CA64541FCF1AD400DEBA12 /* nano_zone_common.h in Headers */ = {isa = PBXBuildFile; fileRef = B6CA64511FCF1AAD00DEBA12 /* nano_zone_common.h */; };\n\t\tB6D2ED572007D91A007AF994 /* malloc_replay.cpp in Sources */ = {isa = PBXBuildFile; fileRef = B6D2ED552007D91A007AF994 /* malloc_replay.cpp */; };\n\t\tB6D5C7F1202E26F80035E376 /* resolver.c in Sources */ = {isa = PBXBuildFile; fileRef = B6D5C7ED202E26CA0035E376 /* resolver.c */; };\n\t\tB6D5C7F2202E26F80035E376 /* resolver.c in Sources */ = {isa = PBXBuildFile; fileRef = B6D5C7ED202E26CA0035E376 /* resolver.c */; };\n\t\tB6D5C7F3202E26F90035E376 /* resolver.c in Sources */ = {isa = PBXBuildFile; fileRef = B6D5C7ED202E26CA0035E376 /* resolver.c */; };\n\t\tB6D5C7F4202E26F90035E376 /* resolver.c in Sources */ = {isa = PBXBuildFile; fileRef = B6D5C7ED202E26CA0035E376 /* resolver.c */; };\n\t\tB6D5C7F5202E26FA0035E376 /* resolver.c in Sources */ = {isa = PBXBuildFile; fileRef = B6D5C7ED202E26CA0035E376 /* resolver.c */; };\n\t\tC0352EC71C3F3C4400DB5126 /* malloc_private.h in Headers */ = {isa = PBXBuildFile; fileRef = C0352EC61C3F3C3600DB5126 /* malloc_private.h */; settings = {ATTRIBUTES = (Private, ); }; };\n\t\tC0CE45311C52C90500C24048 /* bitarray.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD116A90A8D00D1238A /* bitarray.c */; };\n\t\tC0CE45321C52C90500C24048 /* purgeable_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429E1BF681B00027269A /* purgeable_malloc.c */; };\n\t\tC0CE45331C52C90500C24048 /* magazine_large.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429B1BF672F80027269A /* magazine_large.c */; };\n\t\tC0CE45341C52C90500C24048 /* magazine_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD616A90A8D00D1238A /* magazine_malloc.c */; };\n\t\tC0CE45351C52C90500C24048 /* magazine_small.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742981BF670D00027269A /* magazine_small.c */; };\n\t\tC0CE45361C52C90500C24048 /* legacy_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742AA1BF685CB0027269A /* legacy_malloc.c */; };\n\t\tC0CE45371C52C90500C24048 /* magmallocProvider.d in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD716A90A8D00D1238A /* magmallocProvider.d */; };\n\t\tC0CE45381C52C90500C24048 /* malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FD816A90A8D00D1238A /* malloc.c */; };\n\t\tC0CE45391C52C90500C24048 /* frozen_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742A41BF6842F0027269A /* frozen_malloc.c */; };\n\t\tC0CE453A1C52C90500C24048 /* nano_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDA16A90A8D00D1238A /* nano_malloc.c */; };\n\t\tC0CE453C1C52C90500C24048 /* stack_logging_disk.c in Sources */ = {isa = PBXBuildFile; fileRef = 3FE91FDC16A90A8D00D1238A /* stack_logging_disk.c */; };\n\t\tC0CE453D1C52C90500C24048 /* magazine_tiny.c in Sources */ = {isa = PBXBuildFile; fileRef = C957428F1BF419DF0027269A /* magazine_tiny.c */; };\n\t\tC0CE45401C52C90500C24048 /* magazine_inline.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742921BF41C970027269A /* magazine_inline.h */; };\n\t\tC0CE45411C52C90500C24048 /* nano_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = C957427E1BF33D130027269A /* nano_zone.h */; };\n\t\tC0CE45421C52C90500C24048 /* thresholds.h in Headers */ = {isa = PBXBuildFile; fileRef = C957428C1BF411330027269A /* thresholds.h */; };\n\t\tC0CE45431C52C90500C24048 /* debug.h in Headers */ = {isa = PBXBuildFile; fileRef = C957427B1BF2C8DE0027269A /* debug.h */; };\n\t\tC0CE45441C52C90500C24048 /* frozen_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742A51BF6842F0027269A /* frozen_malloc.h */; };\n\t\tC0CE45451C52C90500C24048 /* magazine_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742861BF3F9550027269A /* magazine_zone.h */; };\n\t\tC0CE45461C52C90500C24048 /* magazine_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742951BF41E480027269A /* magazine_malloc.h */; };\n\t\tC0CE45471C52C90500C24048 /* purgeable_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C957429F1BF681B00027269A /* purgeable_malloc.h */; };\n\t\tC0CE45481C52C90500C24048 /* base.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742891BF3FD290027269A /* base.h */; };\n\t\tC0CE454E1C52C9E600C24048 /* libmalloc.a in CopyFiles */ = {isa = PBXBuildFile; fileRef = C0CE454C1C52C90500C24048 /* libmalloc.a */; };\n\t\tC932D2681D6B8D840063B19E /* vm.c in Sources */ = {isa = PBXBuildFile; fileRef = C932D2661D6B8D840063B19E /* vm.c */; };\n\t\tC932D2691D6B8D840063B19E /* vm.h in Headers */ = {isa = PBXBuildFile; fileRef = C932D2671D6B8D840063B19E /* vm.h */; };\n\t\tC938BBD31C74F7A400522BBD /* trace.h in Headers */ = {isa = PBXBuildFile; fileRef = C938BBD21C74F7A400522BBD /* trace.h */; };\n\t\tC9571C3A1C18AA1D00A67EE3 /* stack_logging.h in Headers */ = {isa = PBXBuildFile; fileRef = C9571C391C18AA1D00A67EE3 /* stack_logging.h */; settings = {ATTRIBUTES = (Private, ); }; };\n\t\tC95742721BF2C2880027269A /* bitarray.h in Headers */ = {isa = PBXBuildFile; fileRef = 3FE91FD216A90A8D00D1238A /* bitarray.h */; };\n\t\tC95742731BF2C2880027269A /* internal.h in Headers */ = {isa = PBXBuildFile; fileRef = C957426D1BF2C0C80027269A /* internal.h */; };\n\t\tC95742741BF2C2880027269A /* locking.h in Headers */ = {isa = PBXBuildFile; fileRef = C957426E1BF2C1480027269A /* locking.h */; };\n\t\tC95742751BF2C2880027269A /* printf.h in Headers */ = {isa = PBXBuildFile; fileRef = 3FE91FD916A90A8D00D1238A /* printf.h */; };\n\t\tC95742761BF2C2880027269A /* platform.h in Headers */ = {isa = PBXBuildFile; fileRef = C9F77BBA1BF2B84800812E13 /* platform.h */; };\n\t\tC95742771BF2C2880027269A /* legacy_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = 3FE91FFB16A90E6C00D1238A /* legacy_malloc.h */; };\n\t\tC957427A1BF2C67E0027269A /* nano_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742791BF2C5F40027269A /* nano_malloc.h */; };\n\t\tC957427C1BF2C8DE0027269A /* debug.h in Headers */ = {isa = PBXBuildFile; fileRef = C957427B1BF2C8DE0027269A /* debug.h */; };\n\t\tC957427D1BF2C8DE0027269A /* debug.h in Headers */ = {isa = PBXBuildFile; fileRef = C957427B1BF2C8DE0027269A /* debug.h */; };\n\t\tC957427F1BF33D130027269A /* nano_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = C957427E1BF33D130027269A /* nano_zone.h */; };\n\t\tC95742801BF33D130027269A /* nano_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = C957427E1BF33D130027269A /* nano_zone.h */; };\n\t\tC95742871BF3F9550027269A /* magazine_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742861BF3F9550027269A /* magazine_zone.h */; };\n\t\tC95742881BF3F9550027269A /* magazine_zone.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742861BF3F9550027269A /* magazine_zone.h */; };\n\t\tC957428A1BF3FD290027269A /* base.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742891BF3FD290027269A /* base.h */; };\n\t\tC957428B1BF3FD290027269A /* base.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742891BF3FD290027269A /* base.h */; };\n\t\tC957428D1BF411330027269A /* thresholds.h in Headers */ = {isa = PBXBuildFile; fileRef = C957428C1BF411330027269A /* thresholds.h */; };\n\t\tC957428E1BF411330027269A /* thresholds.h in Headers */ = {isa = PBXBuildFile; fileRef = C957428C1BF411330027269A /* thresholds.h */; };\n\t\tC95742901BF419DF0027269A /* magazine_tiny.c in Sources */ = {isa = PBXBuildFile; fileRef = C957428F1BF419DF0027269A /* magazine_tiny.c */; };\n\t\tC95742911BF419DF0027269A /* magazine_tiny.c in Sources */ = {isa = PBXBuildFile; fileRef = C957428F1BF419DF0027269A /* magazine_tiny.c */; };\n\t\tC95742931BF41C970027269A /* magazine_inline.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742921BF41C970027269A /* magazine_inline.h */; };\n\t\tC95742941BF41C970027269A /* magazine_inline.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742921BF41C970027269A /* magazine_inline.h */; };\n\t\tC95742961BF41E480027269A /* magazine_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742951BF41E480027269A /* magazine_malloc.h */; };\n\t\tC95742971BF41E480027269A /* magazine_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742951BF41E480027269A /* magazine_malloc.h */; };\n\t\tC95742991BF670D00027269A /* magazine_small.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742981BF670D00027269A /* magazine_small.c */; };\n\t\tC957429A1BF670D00027269A /* magazine_small.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742981BF670D00027269A /* magazine_small.c */; };\n\t\tC957429C1BF672F80027269A /* magazine_large.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429B1BF672F80027269A /* magazine_large.c */; };\n\t\tC957429D1BF672F80027269A /* magazine_large.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429B1BF672F80027269A /* magazine_large.c */; };\n\t\tC95742A01BF681B00027269A /* purgeable_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429E1BF681B00027269A /* purgeable_malloc.c */; };\n\t\tC95742A11BF681B00027269A /* purgeable_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C957429E1BF681B00027269A /* purgeable_malloc.c */; };\n\t\tC95742A21BF681B00027269A /* purgeable_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C957429F1BF681B00027269A /* purgeable_malloc.h */; };\n\t\tC95742A31BF681B00027269A /* purgeable_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C957429F1BF681B00027269A /* purgeable_malloc.h */; };\n\t\tC95742A61BF6842F0027269A /* frozen_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742A41BF6842F0027269A /* frozen_malloc.c */; };\n\t\tC95742A71BF6842F0027269A /* frozen_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742A41BF6842F0027269A /* frozen_malloc.c */; };\n\t\tC95742A81BF6842F0027269A /* frozen_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742A51BF6842F0027269A /* frozen_malloc.h */; };\n\t\tC95742A91BF6842F0027269A /* frozen_malloc.h in Headers */ = {isa = PBXBuildFile; fileRef = C95742A51BF6842F0027269A /* frozen_malloc.h */; };\n\t\tC95742AB1BF685CB0027269A /* legacy_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742AA1BF685CB0027269A /* legacy_malloc.c */; };\n\t\tC95742AC1BF685CB0027269A /* legacy_malloc.c in Sources */ = {isa = PBXBuildFile; fileRef = C95742AA1BF685CB0027269A /* legacy_malloc.c */; };\n\t\tC99E320B1D6F7366005655A8 /* magazine_rack.c in Sources */ = {isa = PBXBuildFile; fileRef = C99E32091D6F7366005655A8 /* magazine_rack.c */; };\n\t\tC99E320C1D6F7366005655A8 /* magazine_rack.h in Headers */ = {isa = PBXBuildFile; fileRef = C99E320A1D6F7366005655A8 /* magazine_rack.h */; };\n\t\tC9ABCA051CB6FC6800ECB399 /* empty.s in Sources */ = {isa = PBXBuildFile; fileRef = C9ABCA041CB6FC6800ECB399 /* empty.s */; };\n/* End PBXBuildFile section */\n\n/* Begin PBXContainerItemProxy section */\n\t\t3FE9201516A9111400D1238A /* PBXContainerItemProxy */ = {\n\t\t\tisa = PBXContainerItemProxy;\n\t\t\tcontainerPortal = 3FFC1BE516A908F800027192 /* Project object */;\n\t\t\tproxyType = 1;\n\t\t\tremoteGlobalIDString = 3FE91FFD16A9109E00D1238A;\n\t\t\tremoteInfo = libmalloc_eOS;\n\t\t};\n\t\t3FE9201716A9111600D1238A /* PBXContainerItemProxy */ = {\n\t\t\tisa = PBXContainerItemProxy;\n\t\t\tcontainerPortal = 3FFC1BE516A908F800027192 /* Project object */;\n\t\t\tproxyType = 1;\n\t\t\tremoteGlobalIDString = 3FE91FE716A90AEC00D1238A;\n\t\t\tremoteInfo = libsystem_malloc;\n\t\t};\n\t\t45039167198FFFA6004EE2A3 /* PBXContainerItemProxy */ = {\n\t\t\tisa = PBXContainerItemProxy;\n\t\t\tcontainerPortal = 3FFC1BE516A908F800027192 /* Project object */;\n\t\t\tproxyType = 1;\n\t\t\tremoteGlobalIDString = 456E51C8197DF0D600A7E488;\n\t\t\tremoteInfo = libmalloc_stress_test;\n\t\t};\n\t\t925383D81BD03D0000F745DB /* PBXContainerItemProxy */ = {\n\t\t\tisa = PBXContainerItemProxy;\n\t\t\tcontainerPortal = 3FFC1BE516A908F800027192 /* Project object */;\n\t\t\tproxyType = 1;\n\t\t\tremoteGlobalIDString = 925383D41BD03C0500F745DB;\n\t\t\tremoteInfo = darwintests;\n\t\t};\n\t\tB60A579720093093006215CB /* PBXContainerItemProxy */ = {\n\t\t\tisa = PBXContainerItemProxy;\n\t\t\tcontainerPortal = 3FFC1BE516A908F800027192 /* Project object */;\n\t\t\tproxyType = 1;\n\t\t\tremoteGlobalIDString = B6D2ED492007D76F007AF994;\n\t\t\tremoteInfo = libmalloc_replay;\n\t\t};\n\t\tB629CF43202BB389007719B9 /* PBXContainerItemProxy */ = {\n\t\t\tisa = PBXContainerItemProxy;\n\t\t\tcontainerPortal = 3FFC1BE516A908F800027192 /* Project object */;\n\t\t\tproxyType = 1;\n\t\t\tremoteGlobalIDString = B629CF2B202BB337007719B9;\n\t\t\tremoteInfo = libmalloc_alt;\n\t\t};\n\t\tB676F4AB202B66EF00933F6D /* PBXContainerItemProxy */ = {\n\t\t\tisa = PBXContainerItemProxy;\n\t\t\tcontainerPortal = 3FFC1BE516A908F800027192 /* Project object */;\n\t\t\tproxyType = 1;\n\t\t\tremoteGlobalIDString = B6910F65202B630D00FF2EB0;\n\t\t\tremoteInfo = libmalloc_mp;\n\t\t};\n\t\tC0CE454F1C52CCBD00C24048 /* PBXContainerItemProxy */ = {\n\t\t\tisa = PBXContainerItemProxy;\n\t\t\tcontainerPortal = 3FFC1BE516A908F800027192 /* Project object */;\n\t\t\tproxyType = 1;\n\t\t\tremoteGlobalIDString = C0CE452F1C52C90500C24048;\n\t\t\tremoteInfo = libmalloc_static;\n\t\t};\n/* End PBXContainerItemProxy section */\n\n/* Begin PBXCopyFilesBuildPhase section */\n\t\t456E51C7197DF0D600A7E488 /* CopyFiles */ = {\n\t\t\tisa = PBXCopyFilesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tdstPath = /usr/share/man/man1/;\n\t\t\tdstSubfolderSpec = 0;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 1;\n\t\t};\n\t\tC0CE454D1C52C9D900C24048 /* CopyFiles */ = {\n\t\t\tisa = PBXCopyFilesBuildPhase;\n\t\t\tbuildActionMask = 8;\n\t\t\tdstPath = /usr/local/lib/loaderd;\n\t\t\tdstSubfolderSpec = 0;\n\t\t\tfiles = (\n\t\t\t\tC0CE454E1C52C9E600C24048 /* libmalloc.a in CopyFiles */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 1;\n\t\t};\n/* End PBXCopyFilesBuildPhase section */\n\n/* Begin PBXFileReference section */\n\t\t084F5E831D50204F006CD296 /* Foundation.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = Foundation.framework; path = System/Library/Frameworks/Foundation.framework; sourceTree = SDKROOT; };\n\t\t088C4D731D1AEFB5005C6B36 /* radix_tree_internal.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = radix_tree_internal.h; sourceTree = \"\"; };\n\t\t088C4D741D1AEFB5005C6B36 /* radix_tree.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = radix_tree.c; sourceTree = \"\"; };\n\t\t088C4D751D1AEFB5005C6B36 /* radix_tree.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = radix_tree.h; sourceTree = \"\"; };\n\t\t088C4D761D1AEFC5005C6B36 /* radix_tree_test.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; path = radix_tree_test.m; sourceTree = \"\"; };\n\t\t08C28B3A1D501ACC000AE997 /* radix_tree_debug.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = radix_tree_debug.c; sourceTree = \"\"; };\n\t\t08C28B401D501D2C000AE997 /* radix-tree */ = {isa = PBXFileReference; explicitFileType = \"compiled.mach-o.executable\"; includeInIndex = 0; path = \"radix-tree\"; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\t08C28B421D501D2C000AE997 /* radix_tree_main.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; path = radix_tree_main.m; sourceTree = \"\"; };\n\t\t0D468DCC1C7BEE56006FACF5 /* magazine_lite.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = magazine_lite.c; sourceTree = \"\"; };\n\t\t0D468DCD1C7BEE65006FACF5 /* stack_logging_internal.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = stack_logging_internal.h; sourceTree = \"\"; };\n\t\t0D468DCE1C7BEE74006FACF5 /* stack_logging_test.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = stack_logging_test.c; sourceTree = \"\"; };\n\t\t2B67B5672040B3A50003E78F /* _malloc.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = _malloc.h; sourceTree = \"\"; };\n\t\t3D157E7320354E02001630BF /* perfdata.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = perfdata.framework; path = ../MacOSX10.14.Internal.sdk/System/Library/PrivateFrameworks/perfdata.framework; sourceTree = SDKROOT; };\n\t\t3FC452FF18E4ABFE003D6A38 /* manpages.sh */ = {isa = PBXFileReference; lastKnownFileType = text.script.sh; path = manpages.sh; sourceTree = \"\"; };\n\t\t3FE91FC916A90A8D00D1238A /* malloc.3 */ = {isa = PBXFileReference; lastKnownFileType = text; path = malloc.3; sourceTree = \"\"; };\n\t\t3FE91FCA16A90A8D00D1238A /* malloc_size.3 */ = {isa = PBXFileReference; lastKnownFileType = text; path = malloc_size.3; sourceTree = \"\"; };\n\t\t3FE91FCB16A90A8D00D1238A /* malloc_zone_malloc.3 */ = {isa = PBXFileReference; lastKnownFileType = text; path = malloc_zone_malloc.3; sourceTree = \"\"; };\n\t\t3FE91FD116A90A8D00D1238A /* bitarray.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = bitarray.c; sourceTree = \"\"; };\n\t\t3FE91FD216A90A8D00D1238A /* bitarray.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = bitarray.h; sourceTree = \"\"; };\n\t\t3FE91FD616A90A8D00D1238A /* magazine_malloc.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; lineEnding = 0; path = magazine_malloc.c; sourceTree = \"\"; xcLanguageSpecificationIdentifier = xcode.lang.c; };\n\t\t3FE91FD716A90A8D00D1238A /* magmallocProvider.d */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.dtrace; path = magmallocProvider.d; sourceTree = \"\"; };\n\t\t3FE91FD816A90A8D00D1238A /* malloc.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = malloc.c; sourceTree = \"\"; };\n\t\t3FE91FD916A90A8D00D1238A /* printf.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = printf.h; sourceTree = \"\"; };\n\t\t3FE91FDA16A90A8D00D1238A /* nano_malloc.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = nano_malloc.c; sourceTree = \"\"; };\n\t\t3FE91FDC16A90A8D00D1238A /* stack_logging_disk.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = stack_logging_disk.c; sourceTree = \"\"; usesTabs = 1; };\n\t\t3FE91FE016A90A8D00D1238A /* libmalloc.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; path = libmalloc.xcconfig; sourceTree = \"\"; };\n\t\t3FE91FE116A90A8D00D1238A /* libmalloc_eos.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; path = libmalloc_eos.xcconfig; sourceTree = \"\"; };\n\t\t3FE91FE316A90A8D00D1238A /* sanitise_headers.sh */ = {isa = PBXFileReference; lastKnownFileType = text.script.sh; path = sanitise_headers.sh; sourceTree = \"\"; };\n\t\t3FE91FE816A90AEC00D1238A /* libsystem_malloc.dylib */ = {isa = PBXFileReference; explicitFileType = \"compiled.mach-o.dylib\"; includeInIndex = 0; path = libsystem_malloc.dylib; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\t3FE91FF916A90BEF00D1238A /* malloc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = malloc.h; sourceTree = \"\"; };\n\t\t3FE91FFB16A90E6C00D1238A /* legacy_malloc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = legacy_malloc.h; sourceTree = \"\"; };\n\t\t3FE9201016A9109E00D1238A /* libmalloc_eOS.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libmalloc_eOS.a; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\t456E51C9197DF0D600A7E488 /* libmalloc_stress_test */ = {isa = PBXFileReference; explicitFileType = \"compiled.mach-o.executable\"; includeInIndex = 0; path = libmalloc_stress_test; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\t8CB962B01F7E9F610046942E /* asan.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = asan.c; sourceTree = \"\"; };\n\t\t8CB962B11F7E9FD00046942E /* tsan.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = tsan.c; sourceTree = \"\"; };\n\t\t925383D01BD03B4A00F745DB /* Makefile */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.make; path = Makefile; sourceTree = \"\"; };\n\t\t925383D11BD03B4A00F745DB /* stress_test.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = stress_test.c; sourceTree = \"\"; };\n\t\t925383D31BD03B8F00F745DB /* manpages.lst */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = manpages.lst; sourceTree = \"\"; };\n\t\tB61341DD20114B070038D163 /* ktrace.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = ktrace.framework; path = Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.Internal.sdk/System/Library/PrivateFrameworks/ktrace.framework; sourceTree = DEVELOPER_DIR; };\n\t\tB629CF29202BA3C2007719B9 /* libmalloc_resolver.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; path = libmalloc_resolver.xcconfig; sourceTree = \"\"; };\n\t\tB629CF42202BB337007719B9 /* libmalloc_alt.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libmalloc_alt.a; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\tB629CF46202BBDEC007719B9 /* resolver_internal.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = resolver_internal.h; sourceTree = \"\"; };\n\t\tB629CF48202BBE3B007719B9 /* resolver.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = resolver.h; sourceTree = \"\"; };\n\t\tB64E100A205311DC004C4BA6 /* malloc_size_test.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = malloc_size_test.c; sourceTree = \"\"; };\n\t\tB6536A62204754B6005FBE22 /* perf_contended_malloc_free.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = perf_contended_malloc_free.c; sourceTree = \"\"; };\n\t\tB6536A6320475BA4005FBE22 /* basic_malloc_free_perf.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = basic_malloc_free_perf.c; sourceTree = \"\"; };\n\t\tB65FBE2B2087AA2F00E21F59 /* malloc_printf.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = malloc_printf.c; sourceTree = \"\"; };\n\t\tB66AA658202A70B00019D607 /* libmalloc_resolved.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; path = libmalloc_resolved.xcconfig; sourceTree = \"\"; };\n\t\tB66C71D72034BFAE0047E265 /* malloc_common.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = malloc_common.h; sourceTree = \"\"; };\n\t\tB66C71D82034BFAE0047E265 /* malloc_common.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = malloc_common.c; sourceTree = \"\"; };\n\t\tB670DABD2072D0BB00139A1D /* perf_realloc.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = perf_realloc.c; sourceTree = \"\"; };\n\t\tB671CFFD207578CC00EEAF20 /* libmalloc.dirty */ = {isa = PBXFileReference; lastKnownFileType = text; path = libmalloc.dirty; sourceTree = \"\"; };\n\t\tB675F74520213D0A00B5038B /* nano_tests.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = nano_tests.c; sourceTree = \"\"; };\n\t\tB68B7F9C1FCDCBC600BAD1AA /* nano_malloc_common.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = nano_malloc_common.h; sourceTree = \"\"; };\n\t\tB68B7F9D1FCDCBC600BAD1AA /* nano_malloc_common.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = nano_malloc_common.c; sourceTree = \"\"; };\n\t\tB68B7FA21FCDD60F00BAD1AA /* nanov2_malloc.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = nanov2_malloc.h; sourceTree = \"\"; };\n\t\tB68B7FA41FCDD9A500BAD1AA /* nanov2_malloc.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = nanov2_malloc.c; sourceTree = \"\"; };\n\t\tB6910F89202B630D00FF2EB0 /* libmalloc_mp.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libmalloc_mp.a; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\tB69B2B941FB3D00500FD5A8F /* magazine_malloc.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = magazine_malloc.c; sourceTree = \"\"; };\n\t\tB6A414EA1FBDF01C0038DC53 /* malloc_claimed_address_tests.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = malloc_claimed_address_tests.c; sourceTree = \"\"; };\n\t\tB6A494971F9918DD0016A799 /* calloc_test.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = calloc_test.c; sourceTree = \"\"; };\n\t\tB6A9C48C1F991716007D0853 /* malloc_free_test.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = malloc_free_test.c; sourceTree = \"\"; };\n\t\tB6C1C9C720D9B70F002CCC0B /* nano_trace_replay.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = nano_trace_replay.c; sourceTree = \"\"; };\n\t\tB6CA644D1FCE2C0A00DEBA12 /* nanov2_zone.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = nanov2_zone.h; sourceTree = \"\"; };\n\t\tB6CA64511FCF1AAD00DEBA12 /* nano_zone_common.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = nano_zone_common.h; sourceTree = \"\"; };\n\t\tB6D2ED512007D76F007AF994 /* libmalloc_replay */ = {isa = PBXFileReference; explicitFileType = \"compiled.mach-o.executable\"; includeInIndex = 0; path = libmalloc_replay; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\tB6D2ED552007D91A007AF994 /* malloc_replay.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = malloc_replay.cpp; sourceTree = \"\"; };\n\t\tB6D2ED562007D91A007AF994 /* malloc_replay.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = malloc_replay.h; sourceTree = \"\"; };\n\t\tB6D5C7ED202E26CA0035E376 /* resolver.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = resolver.c; sourceTree = \"\"; };\n\t\tC0352EC61C3F3C3600DB5126 /* malloc_private.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = malloc_private.h; sourceTree = \"\"; };\n\t\tC0CE450E1C52B9E300C24048 /* libmalloc_static.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; path = libmalloc_static.xcconfig; sourceTree = \"\"; };\n\t\tC0CE454C1C52C90500C24048 /* libmalloc.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libmalloc.a; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\tC92853A01C767F08001FEAF3 /* install-codes.sh */ = {isa = PBXFileReference; lastKnownFileType = text.script.sh; path = \"install-codes.sh\"; sourceTree = \"\"; };\n\t\tC931B58F1C81248100D0D230 /* madvise.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = madvise.c; sourceTree = \"\"; };\n\t\tC932D2631D6B6ED40063B19E /* magazine_tiny_test.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = magazine_tiny_test.c; sourceTree = \"\"; };\n\t\tC932D2641D6B73270063B19E /* dtrace.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = dtrace.h; sourceTree = \"\"; };\n\t\tC932D2661D6B8D840063B19E /* vm.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = vm.c; sourceTree = \"\"; };\n\t\tC932D2671D6B8D840063B19E /* vm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = vm.h; sourceTree = \"\"; };\n\t\tC938BBD21C74F7A400522BBD /* trace.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = trace.h; sourceTree = \"\"; };\n\t\tC93F76D71D6B9F8C0088931B /* magazine_testing.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = magazine_testing.h; sourceTree = \"\"; };\n\t\tC9571C391C18AA1D00A67EE3 /* stack_logging.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = stack_logging.h; sourceTree = \"\"; };\n\t\tC9571C3C1C18AD5F00A67EE3 /* balloon.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = balloon.cpp; sourceTree = \"\"; };\n\t\tC9571C3D1C18AD5F00A67EE3 /* balloon.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = balloon.h; sourceTree = \"\"; };\n\t\tC9571C3E1C18AD5F00A67EE3 /* Benchmark.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = Benchmark.cpp; sourceTree = \"\"; };\n\t\tC9571C3F1C18AD5F00A67EE3 /* Benchmark.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = Benchmark.h; sourceTree = \"\"; };\n\t\tC9571C401C18AD5F00A67EE3 /* big.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = big.cpp; sourceTree = \"\"; };\n\t\tC9571C411C18AD5F00A67EE3 /* big.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = big.h; sourceTree = \"\"; };\n\t\tC9571C421C18AD5F00A67EE3 /* churn.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = churn.cpp; sourceTree = \"\"; };\n\t\tC9571C431C18AD5F00A67EE3 /* churn.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = churn.h; sourceTree = \"\"; };\n\t\tC9571C441C18AD5F00A67EE3 /* CommandLine.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = CommandLine.cpp; sourceTree = \"\"; };\n\t\tC9571C451C18AD5F00A67EE3 /* CommandLine.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = CommandLine.h; sourceTree = \"\"; };\n\t\tC9571C461C18AD5F00A67EE3 /* CPUCount.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = CPUCount.cpp; sourceTree = \"\"; };\n\t\tC9571C471C18AD5F00A67EE3 /* CPUCount.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = CPUCount.h; sourceTree = \"\"; };\n\t\tC9571C4C1C18AD5F00A67EE3 /* fragment.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = fragment.cpp; sourceTree = \"\"; };\n\t\tC9571C4D1C18AD5F00A67EE3 /* fragment.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = fragment.h; sourceTree = \"\"; };\n\t\tC9571C4E1C18AD5F00A67EE3 /* Interpreter.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = Interpreter.cpp; sourceTree = \"\"; };\n\t\tC9571C4F1C18AD5F00A67EE3 /* Interpreter.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = Interpreter.h; sourceTree = \"\"; };\n\t\tC9571C501C18AD5F00A67EE3 /* list.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = list.cpp; sourceTree = \"\"; };\n\t\tC9571C511C18AD5F00A67EE3 /* list.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = list.h; sourceTree = \"\"; };\n\t\tC9571C521C18AD5F00A67EE3 /* mbmalloc.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = mbmalloc.cpp; sourceTree = \"\"; };\n\t\tC9571C531C18AD5F00A67EE3 /* mbmalloc.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = mbmalloc.h; sourceTree = \"\"; };\n\t\tC9571C541C18AD5F00A67EE3 /* medium.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = medium.cpp; sourceTree = \"\"; };\n\t\tC9571C551C18AD5F00A67EE3 /* medium.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = medium.h; sourceTree = \"\"; };\n\t\tC9571C561C18AD5F00A67EE3 /* memalign.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = memalign.cpp; sourceTree = \"\"; };\n\t\tC9571C571C18AD5F00A67EE3 /* memalign.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = memalign.h; sourceTree = \"\"; };\n\t\tC9571C581C18AD5F00A67EE3 /* message.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = message.cpp; sourceTree = \"\"; };\n\t\tC9571C591C18AD5F00A67EE3 /* message.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = message.h; sourceTree = \"\"; };\n\t\tC9571C5A1C18AD5F00A67EE3 /* realloc.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = realloc.cpp; sourceTree = \"\"; };\n\t\tC9571C5B1C18AD5F00A67EE3 /* realloc.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = realloc.h; sourceTree = \"\"; };\n\t\tC9571C5E1C18AD5F00A67EE3 /* stress_aligned.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = stress_aligned.cpp; sourceTree = \"\"; };\n\t\tC9571C5F1C18AD5F00A67EE3 /* stress_aligned.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = stress_aligned.h; sourceTree = \"\"; };\n\t\tC9571C601C18AD5F00A67EE3 /* stress.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = stress.cpp; sourceTree = \"\"; };\n\t\tC9571C611C18AD5F00A67EE3 /* stress.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = stress.h; sourceTree = \"\"; };\n\t\tC9571C641C18AD5F00A67EE3 /* tree.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = tree.cpp; sourceTree = \"\"; };\n\t\tC9571C651C18AD5F00A67EE3 /* tree.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = tree.h; sourceTree = \"\"; };\n\t\tC9571C661C18AD6A00A67EE3 /* MallocBench.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = MallocBench.cpp; sourceTree = \"\"; };\n\t\tC957426D1BF2C0C80027269A /* internal.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = internal.h; sourceTree = \"\"; };\n\t\tC957426E1BF2C1480027269A /* locking.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = locking.h; sourceTree = \"\"; };\n\t\tC95742791BF2C5F40027269A /* nano_malloc.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = nano_malloc.h; sourceTree = \"\"; };\n\t\tC957427B1BF2C8DE0027269A /* debug.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = debug.h; sourceTree = \"\"; };\n\t\tC957427E1BF33D130027269A /* nano_zone.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = nano_zone.h; sourceTree = \"\"; };\n\t\tC95742861BF3F9550027269A /* magazine_zone.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = magazine_zone.h; sourceTree = \"\"; };\n\t\tC95742891BF3FD290027269A /* base.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = base.h; sourceTree = \"\"; };\n\t\tC957428C1BF411330027269A /* thresholds.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = thresholds.h; sourceTree = \"\"; };\n\t\tC957428F1BF419DF0027269A /* magazine_tiny.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; lineEnding = 0; path = magazine_tiny.c; sourceTree = \"\"; xcLanguageSpecificationIdentifier = xcode.lang.c; };\n\t\tC95742921BF41C970027269A /* magazine_inline.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; lineEnding = 0; path = magazine_inline.h; sourceTree = \"\"; xcLanguageSpecificationIdentifier = xcode.lang.objcpp; };\n\t\tC95742951BF41E480027269A /* magazine_malloc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = magazine_malloc.h; sourceTree = \"\"; };\n\t\tC95742981BF670D00027269A /* magazine_small.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; lineEnding = 0; path = magazine_small.c; sourceTree = \"\"; xcLanguageSpecificationIdentifier = xcode.lang.c; };\n\t\tC957429B1BF672F80027269A /* magazine_large.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = magazine_large.c; sourceTree = \"\"; };\n\t\tC957429E1BF681B00027269A /* purgeable_malloc.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = purgeable_malloc.c; sourceTree = \"\"; };\n\t\tC957429F1BF681B00027269A /* purgeable_malloc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = purgeable_malloc.h; sourceTree = \"\"; };\n\t\tC95742A41BF6842F0027269A /* frozen_malloc.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = frozen_malloc.c; sourceTree = \"\"; };\n\t\tC95742A51BF6842F0027269A /* frozen_malloc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = frozen_malloc.h; sourceTree = \"\"; };\n\t\tC95742AA1BF685CB0027269A /* legacy_malloc.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = legacy_malloc.c; sourceTree = \"\"; };\n\t\tC99E32091D6F7366005655A8 /* magazine_rack.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = magazine_rack.c; sourceTree = \"\"; };\n\t\tC99E320A1D6F7366005655A8 /* magazine_rack.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = magazine_rack.h; sourceTree = \"\"; };\n\t\tC9ABCA041CB6FC6800ECB399 /* empty.s */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.asm; path = empty.s; sourceTree = \"\"; };\n\t\tC9F77BBA1BF2B84800812E13 /* platform.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = platform.h; sourceTree = \"\"; };\n\t\tC9F8C2681D70B521008C4044 /* magazine_small_test.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = magazine_small_test.c; sourceTree = \"\"; };\n\t\tC9F8C2691D74C93A008C4044 /* magazine_rack.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = magazine_rack.c; sourceTree = \"\"; };\n/* End PBXFileReference section */\n\n/* Begin PBXFrameworksBuildPhase section */\n\t\t08C28B3D1D501D2C000AE997 /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t084F5E841D50204F006CD296 /* Foundation.framework in Frameworks */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\t3FE91FE516A90AEC00D1238A /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\t3FE9200716A9109E00D1238A /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\t456E51C6197DF0D600A7E488 /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tB629CF3D202BB337007719B9 /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tB6910F77202B630D00FF2EB0 /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tB6D2ED4C2007D76F007AF994 /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t3D157E7420354E02001630BF /* perfdata.framework in Frameworks */,\n\t\t\t\tB61341DE20114B660038D163 /* ktrace.framework in Frameworks */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tC0CE453E1C52C90500C24048 /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXFrameworksBuildPhase section */\n\n/* Begin PBXGroup section */\n\t\t084F5E821D50204F006CD296 /* Frameworks */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t3D157E7320354E02001630BF /* perfdata.framework */,\n\t\t\t\tB61341DD20114B070038D163 /* ktrace.framework */,\n\t\t\t\t084F5E831D50204F006CD296 /* Foundation.framework */,\n\t\t\t);\n\t\t\tname = Frameworks;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t08C28B411D501D2C000AE997 /* tools */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t08C28B421D501D2C000AE997 /* radix_tree_main.m */,\n\t\t\t\tB6D2ED552007D91A007AF994 /* malloc_replay.cpp */,\n\t\t\t\tB6D2ED562007D91A007AF994 /* malloc_replay.h */,\n\t\t\t);\n\t\t\tpath = tools;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t3FE91FC816A90A8D00D1238A /* man */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t925383D31BD03B8F00F745DB /* manpages.lst */,\n\t\t\t\t3FE91FC916A90A8D00D1238A /* malloc.3 */,\n\t\t\t\t3FE91FCA16A90A8D00D1238A /* malloc_size.3 */,\n\t\t\t\t3FE91FCB16A90A8D00D1238A /* malloc_zone_malloc.3 */,\n\t\t\t);\n\t\t\tpath = man;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t3FE91FCC16A90A8D00D1238A /* src */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t08C28B3A1D501ACC000AE997 /* radix_tree_debug.c */,\n\t\t\t\t088C4D731D1AEFB5005C6B36 /* radix_tree_internal.h */,\n\t\t\t\t088C4D741D1AEFB5005C6B36 /* radix_tree.c */,\n\t\t\t\t088C4D751D1AEFB5005C6B36 /* radix_tree.h */,\n\t\t\t\tC95742891BF3FD290027269A /* base.h */,\n\t\t\t\t3FE91FD116A90A8D00D1238A /* bitarray.c */,\n\t\t\t\t3FE91FD216A90A8D00D1238A /* bitarray.h */,\n\t\t\t\tC957427B1BF2C8DE0027269A /* debug.h */,\n\t\t\t\tC932D2641D6B73270063B19E /* dtrace.h */,\n\t\t\t\tC9ABCA041CB6FC6800ECB399 /* empty.s */,\n\t\t\t\tC95742A41BF6842F0027269A /* frozen_malloc.c */,\n\t\t\t\tC95742A51BF6842F0027269A /* frozen_malloc.h */,\n\t\t\t\tC957426D1BF2C0C80027269A /* internal.h */,\n\t\t\t\tC95742AA1BF685CB0027269A /* legacy_malloc.c */,\n\t\t\t\t3FE91FFB16A90E6C00D1238A /* legacy_malloc.h */,\n\t\t\t\tC957426E1BF2C1480027269A /* locking.h */,\n\t\t\t\tC95742921BF41C970027269A /* magazine_inline.h */,\n\t\t\t\tC957429B1BF672F80027269A /* magazine_large.c */,\n\t\t\t\t0D468DCC1C7BEE56006FACF5 /* magazine_lite.c */,\n\t\t\t\t3FE91FD616A90A8D00D1238A /* magazine_malloc.c */,\n\t\t\t\tC95742951BF41E480027269A /* magazine_malloc.h */,\n\t\t\t\tB65FBE2B2087AA2F00E21F59 /* malloc_printf.c */,\n\t\t\t\tC99E32091D6F7366005655A8 /* magazine_rack.c */,\n\t\t\t\tC99E320A1D6F7366005655A8 /* magazine_rack.h */,\n\t\t\t\tC95742981BF670D00027269A /* magazine_small.c */,\n\t\t\t\tC957428F1BF419DF0027269A /* magazine_tiny.c */,\n\t\t\t\tC95742861BF3F9550027269A /* magazine_zone.h */,\n\t\t\t\t3FE91FD716A90A8D00D1238A /* magmallocProvider.d */,\n\t\t\t\t3FE91FD816A90A8D00D1238A /* malloc.c */,\n\t\t\t\tB66C71D82034BFAE0047E265 /* malloc_common.c */,\n\t\t\t\tB66C71D72034BFAE0047E265 /* malloc_common.h */,\n\t\t\t\tB68B7F9D1FCDCBC600BAD1AA /* nano_malloc_common.c */,\n\t\t\t\tB68B7F9C1FCDCBC600BAD1AA /* nano_malloc_common.h */,\n\t\t\t\t3FE91FDA16A90A8D00D1238A /* nano_malloc.c */,\n\t\t\t\tC95742791BF2C5F40027269A /* nano_malloc.h */,\n\t\t\t\tC957427E1BF33D130027269A /* nano_zone.h */,\n\t\t\t\tB6CA64511FCF1AAD00DEBA12 /* nano_zone_common.h */,\n\t\t\t\tB68B7FA41FCDD9A500BAD1AA /* nanov2_malloc.c */,\n\t\t\t\tB68B7FA21FCDD60F00BAD1AA /* nanov2_malloc.h */,\n\t\t\t\tB6CA644D1FCE2C0A00DEBA12 /* nanov2_zone.h */,\n\t\t\t\tC9F77BBA1BF2B84800812E13 /* platform.h */,\n\t\t\t\t3FE91FD916A90A8D00D1238A /* printf.h */,\n\t\t\t\tC957429E1BF681B00027269A /* purgeable_malloc.c */,\n\t\t\t\tC957429F1BF681B00027269A /* purgeable_malloc.h */,\n\t\t\t\t3FE91FDC16A90A8D00D1238A /* stack_logging_disk.c */,\n\t\t\t\t0D468DCD1C7BEE65006FACF5 /* stack_logging_internal.h */,\n\t\t\t\tC957428C1BF411330027269A /* thresholds.h */,\n\t\t\t\tC938BBD21C74F7A400522BBD /* trace.h */,\n\t\t\t\tC932D2661D6B8D840063B19E /* vm.c */,\n\t\t\t\tC932D2671D6B8D840063B19E /* vm.h */,\n\t\t\t);\n\t\t\tpath = src;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t3FE91FDF16A90A8D00D1238A /* xcodeconfig */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t3FE91FE016A90A8D00D1238A /* libmalloc.xcconfig */,\n\t\t\t\t3FE91FE116A90A8D00D1238A /* libmalloc_eos.xcconfig */,\n\t\t\t\tC0CE450E1C52B9E300C24048 /* libmalloc_static.xcconfig */,\n\t\t\t\tB66AA658202A70B00019D607 /* libmalloc_resolved.xcconfig */,\n\t\t\t\tB629CF29202BA3C2007719B9 /* libmalloc_resolver.xcconfig */,\n\t\t\t\tB671CFFD207578CC00EEAF20 /* libmalloc.dirty */,\n\t\t\t);\n\t\t\tpath = xcodeconfig;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t3FE91FE216A90A8D00D1238A /* xcodescripts */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t3FC452FF18E4ABFE003D6A38 /* manpages.sh */,\n\t\t\t\t3FE91FE316A90A8D00D1238A /* sanitise_headers.sh */,\n\t\t\t\tC92853A01C767F08001FEAF3 /* install-codes.sh */,\n\t\t\t);\n\t\t\tpath = xcodescripts;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t3FE91FE916A90AEC00D1238A /* Products */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t3FE91FE816A90AEC00D1238A /* libsystem_malloc.dylib */,\n\t\t\t\t3FE9201016A9109E00D1238A /* libmalloc_eOS.a */,\n\t\t\t\t456E51C9197DF0D600A7E488 /* libmalloc_stress_test */,\n\t\t\t\tC0CE454C1C52C90500C24048 /* libmalloc.a */,\n\t\t\t\t08C28B401D501D2C000AE997 /* radix-tree */,\n\t\t\t\tB6D2ED512007D76F007AF994 /* libmalloc_replay */,\n\t\t\t\tB6910F89202B630D00FF2EB0 /* libmalloc_mp.a */,\n\t\t\t\tB629CF42202BB337007719B9 /* libmalloc_alt.a */,\n\t\t\t);\n\t\t\tname = Products;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t3FE91FF716A90BEF00D1238A /* include */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t3FE91FF816A90BEF00D1238A /* malloc */,\n\t\t\t);\n\t\t\tpath = include;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t3FE91FF816A90BEF00D1238A /* malloc */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t2B67B5672040B3A50003E78F /* _malloc.h */,\n\t\t\t\t3FE91FF916A90BEF00D1238A /* malloc.h */,\n\t\t\t);\n\t\t\tpath = malloc;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t3FFC1BE416A908F800027192 = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t3FE91FF716A90BEF00D1238A /* include */,\n\t\t\t\t3FE91FC816A90A8D00D1238A /* man */,\n\t\t\t\tC9571C381C18AA0A00A67EE3 /* private */,\n\t\t\t\t3FE91FCC16A90A8D00D1238A /* src */,\n\t\t\t\tB629CF45202BBDCC007719B9 /* resolver */,\n\t\t\t\t925383BD1BD03B4A00F745DB /* tests */,\n\t\t\t\t3FE91FDF16A90A8D00D1238A /* xcodeconfig */,\n\t\t\t\t3FE91FE216A90A8D00D1238A /* xcodescripts */,\n\t\t\t\t08C28B411D501D2C000AE997 /* tools */,\n\t\t\t\t3FE91FE916A90AEC00D1238A /* Products */,\n\t\t\t\t084F5E821D50204F006CD296 /* Frameworks */,\n\t\t\t);\n\t\t\tsourceTree = \"\";\n\t\t\ttabWidth = 4;\n\t\t\tusesTabs = 1;\n\t\t};\n\t\t925383BD1BD03B4A00F745DB /* tests */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t8CB962B01F7E9F610046942E /* asan.c */,\n\t\t\t\t8CB962B11F7E9FD00046942E /* tsan.c */,\n\t\t\t\tC931B58F1C81248100D0D230 /* madvise.c */,\n\t\t\t\tC9F8C2691D74C93A008C4044 /* magazine_rack.c */,\n\t\t\t\tB6A494971F9918DD0016A799 /* calloc_test.c */,\n\t\t\t\tB6A9C48C1F991716007D0853 /* malloc_free_test.c */,\n\t\t\t\tB6A414EA1FBDF01C0038DC53 /* malloc_claimed_address_tests.c */,\n\t\t\t\tC9F8C2681D70B521008C4044 /* magazine_small_test.c */,\n\t\t\t\tB64E100A205311DC004C4BA6 /* malloc_size_test.c */,\n\t\t\t\tC93F76D71D6B9F8C0088931B /* magazine_testing.h */,\n\t\t\t\tC932D2631D6B6ED40063B19E /* magazine_tiny_test.c */,\n\t\t\t\tB69B2B941FB3D00500FD5A8F /* magazine_malloc.c */,\n\t\t\t\t925383D01BD03B4A00F745DB /* Makefile */,\n\t\t\t\tC9571C3B1C18AD4F00A67EE3 /* MallocBench */,\n\t\t\t\tC9571C661C18AD6A00A67EE3 /* MallocBench.cpp */,\n\t\t\t\tB6536A6320475BA4005FBE22 /* basic_malloc_free_perf.c */,\n\t\t\t\tB675F74520213D0A00B5038B /* nano_tests.c */,\n\t\t\t\tB6C1C9C720D9B70F002CCC0B /* nano_trace_replay.c */,\n\t\t\t\tB6536A62204754B6005FBE22 /* perf_contended_malloc_free.c */,\n\t\t\t\tB670DABD2072D0BB00139A1D /* perf_realloc.c */,\n\t\t\t\t088C4D761D1AEFC5005C6B36 /* radix_tree_test.m */,\n\t\t\t\t0D468DCE1C7BEE74006FACF5 /* stack_logging_test.c */,\n\t\t\t\t925383D11BD03B4A00F745DB /* stress_test.c */,\n\t\t\t);\n\t\t\tpath = tests;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\tB629CF45202BBDCC007719B9 /* resolver */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\tB629CF48202BBE3B007719B9 /* resolver.h */,\n\t\t\t\tB629CF46202BBDEC007719B9 /* resolver_internal.h */,\n\t\t\t\tB6D5C7ED202E26CA0035E376 /* resolver.c */,\n\t\t\t);\n\t\t\tpath = resolver;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\tC9571C381C18AA0A00A67EE3 /* private */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\tC9571C391C18AA1D00A67EE3 /* stack_logging.h */,\n\t\t\t\tC0352EC61C3F3C3600DB5126 /* malloc_private.h */,\n\t\t\t);\n\t\t\tpath = private;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\tC9571C3B1C18AD4F00A67EE3 /* MallocBench */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\tC9571C3C1C18AD5F00A67EE3 /* balloon.cpp */,\n\t\t\t\tC9571C3D1C18AD5F00A67EE3 /* balloon.h */,\n\t\t\t\tC9571C3E1C18AD5F00A67EE3 /* Benchmark.cpp */,\n\t\t\t\tC9571C3F1C18AD5F00A67EE3 /* Benchmark.h */,\n\t\t\t\tC9571C401C18AD5F00A67EE3 /* big.cpp */,\n\t\t\t\tC9571C411C18AD5F00A67EE3 /* big.h */,\n\t\t\t\tC9571C421C18AD5F00A67EE3 /* churn.cpp */,\n\t\t\t\tC9571C431C18AD5F00A67EE3 /* churn.h */,\n\t\t\t\tC9571C441C18AD5F00A67EE3 /* CommandLine.cpp */,\n\t\t\t\tC9571C451C18AD5F00A67EE3 /* CommandLine.h */,\n\t\t\t\tC9571C461C18AD5F00A67EE3 /* CPUCount.cpp */,\n\t\t\t\tC9571C471C18AD5F00A67EE3 /* CPUCount.h */,\n\t\t\t\tC9571C4C1C18AD5F00A67EE3 /* fragment.cpp */,\n\t\t\t\tC9571C4D1C18AD5F00A67EE3 /* fragment.h */,\n\t\t\t\tC9571C4E1C18AD5F00A67EE3 /* Interpreter.cpp */,\n\t\t\t\tC9571C4F1C18AD5F00A67EE3 /* Interpreter.h */,\n\t\t\t\tC9571C501C18AD5F00A67EE3 /* list.cpp */,\n\t\t\t\tC9571C511C18AD5F00A67EE3 /* list.h */,\n\t\t\t\tC9571C521C18AD5F00A67EE3 /* mbmalloc.cpp */,\n\t\t\t\tC9571C531C18AD5F00A67EE3 /* mbmalloc.h */,\n\t\t\t\tC9571C541C18AD5F00A67EE3 /* medium.cpp */,\n\t\t\t\tC9571C551C18AD5F00A67EE3 /* medium.h */,\n\t\t\t\tC9571C561C18AD5F00A67EE3 /* memalign.cpp */,\n\t\t\t\tC9571C571C18AD5F00A67EE3 /* memalign.h */,\n\t\t\t\tC9571C581C18AD5F00A67EE3 /* message.cpp */,\n\t\t\t\tC9571C591C18AD5F00A67EE3 /* message.h */,\n\t\t\t\tC9571C5A1C18AD5F00A67EE3 /* realloc.cpp */,\n\t\t\t\tC9571C5B1C18AD5F00A67EE3 /* realloc.h */,\n\t\t\t\tC9571C5E1C18AD5F00A67EE3 /* stress_aligned.cpp */,\n\t\t\t\tC9571C5F1C18AD5F00A67EE3 /* stress_aligned.h */,\n\t\t\t\tC9571C601C18AD5F00A67EE3 /* stress.cpp */,\n\t\t\t\tC9571C611C18AD5F00A67EE3 /* stress.h */,\n\t\t\t\tC9571C641C18AD5F00A67EE3 /* tree.cpp */,\n\t\t\t\tC9571C651C18AD5F00A67EE3 /* tree.h */,\n\t\t\t);\n\t\t\tpath = MallocBench;\n\t\t\tsourceTree = \"\";\n\t\t};\n/* End PBXGroup section */\n\n/* Begin PBXHeadersBuildPhase section */\n\t\t3FE91FE616A90AEC00D1238A /* Headers */ = {\n\t\t\tisa = PBXHeadersBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\tC957428A1BF3FD290027269A /* base.h in Headers */,\n\t\t\t\tC0352EC71C3F3C4400DB5126 /* malloc_private.h in Headers */,\n\t\t\t\t0D468DD01C7BEF71006FACF5 /* stack_logging_internal.h in Headers */,\n\t\t\t\tC95742731BF2C2880027269A /* internal.h in Headers */,\n\t\t\t\tB6CA644E1FCE2C1900DEBA12 /* nanov2_zone.h in Headers */,\n\t\t\t\tC99E320C1D6F7366005655A8 /* magazine_rack.h in Headers */,\n\t\t\t\tC95742721BF2C2880027269A /* bitarray.h in Headers */,\n\t\t\t\tC932D2691D6B8D840063B19E /* vm.h in Headers */,\n\t\t\t\tB6CA64521FCF1AD200DEBA12 /* nano_zone_common.h in Headers */,\n\t\t\t\tC938BBD31C74F7A400522BBD /* trace.h in Headers */,\n\t\t\t\tC95742A81BF6842F0027269A /* frozen_malloc.h in Headers */,\n\t\t\t\tC957428D1BF411330027269A /* thresholds.h in Headers */,\n\t\t\t\tC95742741BF2C2880027269A /* locking.h in Headers */,\n\t\t\t\tC95742931BF41C970027269A /* magazine_inline.h in Headers */,\n\t\t\t\tB68B7FA31FCDD67100BAD1AA /* nanov2_malloc.h in Headers */,\n\t\t\t\tC95742761BF2C2880027269A /* platform.h in Headers */,\n\t\t\t\tC957427A1BF2C67E0027269A /* nano_malloc.h in Headers */,\n\t\t\t\tB66C71D92034BFAE0047E265 /* malloc_common.h in Headers */,\n\t\t\t\tC957427C1BF2C8DE0027269A /* debug.h in Headers */,\n\t\t\t\t2B67B5682040B3AF0003E78F /* _malloc.h in Headers */,\n\t\t\t\tC95742961BF41E480027269A /* magazine_malloc.h in Headers */,\n\t\t\t\tC9571C3A1C18AA1D00A67EE3 /* stack_logging.h in Headers */,\n\t\t\t\t3FE91FFA16A90BEF00D1238A /* malloc.h in Headers */,\n\t\t\t\tC95742871BF3F9550027269A /* magazine_zone.h in Headers */,\n\t\t\t\tC95742771BF2C2880027269A /* legacy_malloc.h in Headers */,\n\t\t\t\tC95742A21BF681B00027269A /* purgeable_malloc.h in Headers */,\n\t\t\t\tB68B7F9E1FCDCBC600BAD1AA /* nano_malloc_common.h in Headers */,\n\t\t\t\tC957427F1BF33D130027269A /* nano_zone.h in Headers */,\n\t\t\t\tC95742751BF2C2880027269A /* printf.h in Headers */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\t3FE9200816A9109E00D1238A /* Headers */ = {\n\t\t\tisa = PBXHeadersBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\tC95742941BF41C970027269A /* magazine_inline.h in Headers */,\n\t\t\t\tC95742801BF33D130027269A /* nano_zone.h in Headers */,\n\t\t\t\tB6CA644F1FCE2C1A00DEBA12 /* nanov2_zone.h in Headers */,\n\t\t\t\tC957428E1BF411330027269A /* thresholds.h in Headers */,\n\t\t\t\tC957427D1BF2C8DE0027269A /* debug.h in Headers */,\n\t\t\t\tC95742A91BF6842F0027269A /* frozen_malloc.h in Headers */,\n\t\t\t\tC95742881BF3F9550027269A /* magazine_zone.h in Headers */,\n\t\t\t\tC95742971BF41E480027269A /* magazine_malloc.h in Headers */,\n\t\t\t\tC95742A31BF681B00027269A /* purgeable_malloc.h in Headers */,\n\t\t\t\tC957428B1BF3FD290027269A /* base.h in Headers */,\n\t\t\t\tB6CA64531FCF1AD400DEBA12 /* nano_zone_common.h in Headers */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tC0CE453F1C52C90500C24048 /* Headers */ = {\n\t\t\tisa = PBXHeadersBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\tC0CE45401C52C90500C24048 /* magazine_inline.h in Headers */,\n\t\t\t\tC0CE45411C52C90500C24048 /* nano_zone.h in Headers */,\n\t\t\t\tB6CA64501FCE2C1B00DEBA12 /* nanov2_zone.h in Headers */,\n\t\t\t\tC0CE45421C52C90500C24048 /* thresholds.h in Headers */,\n\t\t\t\tC0CE45431C52C90500C24048 /* debug.h in Headers */,\n\t\t\t\tC0CE45441C52C90500C24048 /* frozen_malloc.h in Headers */,\n\t\t\t\tC0CE45451C52C90500C24048 /* magazine_zone.h in Headers */,\n\t\t\t\tC0CE45461C52C90500C24048 /* magazine_malloc.h in Headers */,\n\t\t\t\tC0CE45471C52C90500C24048 /* purgeable_malloc.h in Headers */,\n\t\t\t\tC0CE45481C52C90500C24048 /* base.h in Headers */,\n\t\t\t\tB6CA64541FCF1AD400DEBA12 /* nano_zone_common.h in Headers */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXHeadersBuildPhase section */\n\n/* Begin PBXLegacyTarget section */\n\t\t925383D41BD03C0500F745DB /* darwintests */ = {\n\t\t\tisa = PBXLegacyTarget;\n\t\t\tbuildArgumentsString = \"$(ACTION)\";\n\t\t\tbuildConfigurationList = 925383D51BD03C0500F745DB /* Build configuration list for PBXLegacyTarget \"darwintests\" */;\n\t\t\tbuildPhases = (\n\t\t\t);\n\t\t\tbuildToolPath = /usr/bin/make;\n\t\t\tbuildWorkingDirectory = tests;\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = darwintests;\n\t\t\tpassBuildSettingsInEnvironment = 1;\n\t\t\tproductName = darwintests;\n\t\t};\n/* End PBXLegacyTarget section */\n\n/* Begin PBXNativeTarget section */\n\t\t08C28B3F1D501D2C000AE997 /* radix-tree */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = 08C28B441D501D2C000AE997 /* Build configuration list for PBXNativeTarget \"radix-tree\" */;\n\t\t\tbuildPhases = (\n\t\t\t\t08C28B3C1D501D2C000AE997 /* Sources */,\n\t\t\t\t08C28B3D1D501D2C000AE997 /* Frameworks */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = \"radix-tree\";\n\t\t\tproductName = \"radix-tree\";\n\t\t\tproductReference = 08C28B401D501D2C000AE997 /* radix-tree */;\n\t\t\tproductType = \"com.apple.product-type.tool\";\n\t\t};\n\t\t3FE91FE716A90AEC00D1238A /* libsystem_malloc */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = 3FE91FEA16A90AEC00D1238A /* Build configuration list for PBXNativeTarget \"libsystem_malloc\" */;\n\t\t\tbuildPhases = (\n\t\t\t\t3FE91FE416A90AEC00D1238A /* Sources */,\n\t\t\t\t3FE91FE516A90AEC00D1238A /* Frameworks */,\n\t\t\t\t3FE91FE616A90AEC00D1238A /* Headers */,\n\t\t\t\tC92853A11C767F78001FEAF3 /* Install Codes File */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t\tB676F4AC202B66EF00933F6D /* PBXTargetDependency */,\n\t\t\t\tB629CF44202BB389007719B9 /* PBXTargetDependency */,\n\t\t\t);\n\t\t\tname = libsystem_malloc;\n\t\t\tproductName = libmalloc;\n\t\t\tproductReference = 3FE91FE816A90AEC00D1238A /* libsystem_malloc.dylib */;\n\t\t\tproductType = \"com.apple.product-type.library.dynamic\";\n\t\t};\n\t\t3FE91FFD16A9109E00D1238A /* libmalloc_eOS */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = 3FE9200D16A9109E00D1238A /* Build configuration list for PBXNativeTarget \"libmalloc_eOS\" */;\n\t\t\tbuildPhases = (\n\t\t\t\t3FE91FFE16A9109E00D1238A /* Sources */,\n\t\t\t\t3FE9200716A9109E00D1238A /* Frameworks */,\n\t\t\t\t3FE9200816A9109E00D1238A /* Headers */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = libmalloc_eOS;\n\t\t\tproductName = libmalloc;\n\t\t\tproductReference = 3FE9201016A9109E00D1238A /* libmalloc_eOS.a */;\n\t\t\tproductType = \"com.apple.product-type.library.static\";\n\t\t};\n\t\t456E51C8197DF0D600A7E488 /* libmalloc_stress_test */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = 456E51CF197DF0D600A7E488 /* Build configuration list for PBXNativeTarget \"libmalloc_stress_test\" */;\n\t\t\tbuildPhases = (\n\t\t\t\t456E51C5197DF0D600A7E488 /* Sources */,\n\t\t\t\t456E51C6197DF0D600A7E488 /* Frameworks */,\n\t\t\t\t456E51C7197DF0D600A7E488 /* CopyFiles */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = libmalloc_stress_test;\n\t\t\tproductName = libmalloc_stress_test;\n\t\t\tproductReference = 456E51C9197DF0D600A7E488 /* libmalloc_stress_test */;\n\t\t\tproductType = \"com.apple.product-type.tool\";\n\t\t};\n\t\tB629CF2B202BB337007719B9 /* libmalloc_alt */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = B629CF3F202BB337007719B9 /* Build configuration list for PBXNativeTarget \"libmalloc_alt\" */;\n\t\t\tbuildPhases = (\n\t\t\t\tB629CF2C202BB337007719B9 /* Sources */,\n\t\t\t\tB629CF3D202BB337007719B9 /* Frameworks */,\n\t\t\t\tB629CF3E202BB337007719B9 /* Symlink normal variant */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = libmalloc_alt;\n\t\t\tproductName = libmalloc;\n\t\t\tproductReference = B629CF42202BB337007719B9 /* libmalloc_alt.a */;\n\t\t\tproductType = \"com.apple.product-type.library.static\";\n\t\t};\n\t\tB6910F65202B630D00FF2EB0 /* libmalloc_mp */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = B6910F86202B630D00FF2EB0 /* Build configuration list for PBXNativeTarget \"libmalloc_mp\" */;\n\t\t\tbuildPhases = (\n\t\t\t\tB6910F66202B630D00FF2EB0 /* Sources */,\n\t\t\t\tB6910F77202B630D00FF2EB0 /* Frameworks */,\n\t\t\t\tB629CF2A202BB226007719B9 /* Symlink normal variant */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = libmalloc_mp;\n\t\t\tproductName = libmalloc;\n\t\t\tproductReference = B6910F89202B630D00FF2EB0 /* libmalloc_mp.a */;\n\t\t\tproductType = \"com.apple.product-type.library.static\";\n\t\t};\n\t\tB6D2ED492007D76F007AF994 /* libmalloc_replay */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = B6D2ED4E2007D76F007AF994 /* Build configuration list for PBXNativeTarget \"libmalloc_replay\" */;\n\t\t\tbuildPhases = (\n\t\t\t\tB6D2ED4A2007D76F007AF994 /* Sources */,\n\t\t\t\tB6D2ED4C2007D76F007AF994 /* Frameworks */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = libmalloc_replay;\n\t\t\tproductName = libmalloc_stress_test;\n\t\t\tproductReference = B6D2ED512007D76F007AF994 /* libmalloc_replay */;\n\t\t\tproductType = \"com.apple.product-type.tool\";\n\t\t};\n\t\tC0CE452F1C52C90500C24048 /* libmalloc_static */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = C0CE45491C52C90500C24048 /* Build configuration list for PBXNativeTarget \"libmalloc_static\" */;\n\t\t\tbuildPhases = (\n\t\t\t\tC0CE45301C52C90500C24048 /* Sources */,\n\t\t\t\tC0CE453E1C52C90500C24048 /* Frameworks */,\n\t\t\t\tC0CE453F1C52C90500C24048 /* Headers */,\n\t\t\t\tC0CE454D1C52C9D900C24048 /* CopyFiles */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = libmalloc_static;\n\t\t\tproductName = libmalloc;\n\t\t\tproductReference = C0CE454C1C52C90500C24048 /* libmalloc.a */;\n\t\t\tproductType = \"com.apple.product-type.library.static\";\n\t\t};\n/* End PBXNativeTarget section */\n\n/* Begin PBXProject section */\n\t\t3FFC1BE516A908F800027192 /* Project object */ = {\n\t\t\tisa = PBXProject;\n\t\t\tattributes = {\n\t\t\t\tLastSwiftUpdateCheck = 0700;\n\t\t\t\tLastUpgradeCheck = 0900;\n\t\t\t\tTargetAttributes = {\n\t\t\t\t\t08C28B3F1D501D2C000AE997 = {\n\t\t\t\t\t\tCreatedOnToolsVersion = 8.0;\n\t\t\t\t\t\tProvisioningStyle = Automatic;\n\t\t\t\t\t};\n\t\t\t\t\t45039161198FFF73004EE2A3 = {\n\t\t\t\t\t\tCreatedOnToolsVersion = 6.0;\n\t\t\t\t\t};\n\t\t\t\t\t456E51C8197DF0D600A7E488 = {\n\t\t\t\t\t\tCreatedOnToolsVersion = 6.0;\n\t\t\t\t\t};\n\t\t\t\t\t925383D41BD03C0500F745DB = {\n\t\t\t\t\t\tCreatedOnToolsVersion = 7.1;\n\t\t\t\t\t};\n\t\t\t\t\tB60A57932009307E006215CB = {\n\t\t\t\t\t\tCreatedOnToolsVersion = 9.3;\n\t\t\t\t\t\tProvisioningStyle = Automatic;\n\t\t\t\t\t};\n\t\t\t\t};\n\t\t\t};\n\t\t\tbuildConfigurationList = 3FFC1BE816A908F800027192 /* Build configuration list for PBXProject \"libmalloc\" */;\n\t\t\tcompatibilityVersion = \"Xcode 3.2\";\n\t\t\tdevelopmentRegion = English;\n\t\t\thasScannedForEncodings = 0;\n\t\t\tknownRegions = (\n\t\t\t\ten,\n\t\t\t);\n\t\t\tmainGroup = 3FFC1BE416A908F800027192;\n\t\t\tproductRefGroup = 3FE91FE916A90AEC00D1238A /* Products */;\n\t\t\tprojectDirPath = \"\";\n\t\t\tprojectRoot = \"\";\n\t\t\ttargets = (\n\t\t\t\t3FE9201116A9111000D1238A /* libmalloc */,\n\t\t\t\t45039161198FFF73004EE2A3 /* libmalloc_test */,\n\t\t\t\t3FE91FE716A90AEC00D1238A /* libsystem_malloc */,\n\t\t\t\tB6910F65202B630D00FF2EB0 /* libmalloc_mp */,\n\t\t\t\tB629CF2B202BB337007719B9 /* libmalloc_alt */,\n\t\t\t\t3FE91FFD16A9109E00D1238A /* libmalloc_eOS */,\n\t\t\t\tC0CE452F1C52C90500C24048 /* libmalloc_static */,\n\t\t\t\tB6D2ED492007D76F007AF994 /* libmalloc_replay */,\n\t\t\t\t456E51C8197DF0D600A7E488 /* libmalloc_stress_test */,\n\t\t\t\t08C28B3F1D501D2C000AE997 /* radix-tree */,\n\t\t\t\t925383D41BD03C0500F745DB /* darwintests */,\n\t\t\t\tB60A57932009307E006215CB /* executables */,\n\t\t\t);\n\t\t};\n/* End PBXProject section */\n\n/* Begin PBXShellScriptBuildPhase section */\n\t\t3FC1927C16DD946500315C26 /* Install Man Pages */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 8;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t\t\"$(SRCROOT)/xcodescripts/manpages.sh\",\n\t\t\t);\n\t\t\tname = \"Install Man Pages\";\n\t\t\toutputPaths = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 1;\n\t\t\tshellPath = \"/bin/bash -e\";\n\t\t\tshellScript = \". \\\"${SCRIPT_INPUT_FILE_0}\\\"\";\n\t\t};\n\t\t3FE9201D16A9143E00D1238A /* Sanitise Headers (rdar://problem/10241868) */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 8;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t\t\"$(SRCROOT)/xcodescripts/sanitise_headers.sh\",\n\t\t\t);\n\t\t\tname = \"Sanitise Headers (rdar://problem/10241868)\";\n\t\t\toutputPaths = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 1;\n\t\t\tshellPath = /bin/sh;\n\t\t\tshellScript = \". \\\"${SCRIPT_INPUT_FILE_0}\\\"\";\n\t\t};\n\t\tB629CF2A202BB226007719B9 /* Symlink normal variant */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t);\n\t\t\tname = \"Symlink normal variant\";\n\t\t\toutputPaths = (\n\t\t\t\t\"$(CONFIGURATION_BUILD_DIR)/$(EXECUTABLE_PREFIX)$(PRODUCT_NAME)_normal$(EXECUTABLE_SUFFIX)\",\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t\tshellPath = \"/bin/bash -e -x\";\n\t\t\tshellScript = \"ln -fs \\\"${EXECUTABLE_PREFIX}${PRODUCT_NAME}${EXECUTABLE_SUFFIX}\\\" \\\"${SCRIPT_OUTPUT_FILE_0}\\\"\";\n\t\t\tshowEnvVarsInLog = 0;\n\t\t};\n\t\tB629CF3E202BB337007719B9 /* Symlink normal variant */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t);\n\t\t\tname = \"Symlink normal variant\";\n\t\t\toutputPaths = (\n\t\t\t\t\"$(CONFIGURATION_BUILD_DIR)/$(EXECUTABLE_PREFIX)$(PRODUCT_NAME)_normal$(EXECUTABLE_SUFFIX)\",\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t\tshellPath = \"/bin/bash -e -x\";\n\t\t\tshellScript = \"ln -fs \\\"${EXECUTABLE_PREFIX}${PRODUCT_NAME}${EXECUTABLE_SUFFIX}\\\" \\\"${SCRIPT_OUTPUT_FILE_0}\\\"\";\n\t\t\tshowEnvVarsInLog = 0;\n\t\t};\n\t\tC92853A11C767F78001FEAF3 /* Install Codes File */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t\t\"$(SRCROOT)/src/trace.h\",\n\t\t\t);\n\t\t\tname = \"Install Codes File\";\n\t\t\toutputPaths = (\n\t\t\t\t\"$(DSTROOT)/usr/local/share/misc/libmalloc.codes\",\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t\tshellPath = /bin/bash;\n\t\t\tshellScript = \". \\\"$PROJECT_DIR\\\"/xcodescripts/install-codes.sh\";\n\t\t};\n/* End PBXShellScriptBuildPhase section */\n\n/* Begin PBXSourcesBuildPhase section */\n\t\t08C28B3C1D501D2C000AE997 /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t084F5E851D502102006CD296 /* radix_tree_debug.c in Sources */,\n\t\t\t\t08FEED021D501F6B00BE8A69 /* radix_tree_main.m in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\t3FE91FE416A90AEC00D1238A /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t088C4D771D1AF049005C6B36 /* radix_tree.c in Sources */,\n\t\t\t\t3FE91FED16A90B9200D1238A /* bitarray.c in Sources */,\n\t\t\t\tB66C71DA2034BFAE0047E265 /* malloc_common.c in Sources */,\n\t\t\t\tC95742A01BF681B00027269A /* purgeable_malloc.c in Sources */,\n\t\t\t\tC957429C1BF672F80027269A /* magazine_large.c in Sources */,\n\t\t\t\t3FE91FF016A90B9200D1238A /* magazine_malloc.c in Sources */,\n\t\t\t\tC95742991BF670D00027269A /* magazine_small.c in Sources */,\n\t\t\t\tC99E320B1D6F7366005655A8 /* magazine_rack.c in Sources */,\n\t\t\t\tC95742AB1BF685CB0027269A /* legacy_malloc.c in Sources */,\n\t\t\t\tC932D2681D6B8D840063B19E /* vm.c in Sources */,\n\t\t\t\t3FE91FF116A90B9200D1238A /* magmallocProvider.d in Sources */,\n\t\t\t\t0D468DCF1C7BEF51006FACF5 /* magazine_lite.c in Sources */,\n\t\t\t\tB68B7FA51FCDD9A500BAD1AA /* nanov2_malloc.c in Sources */,\n\t\t\t\tB6D5C7F1202E26F80035E376 /* resolver.c in Sources */,\n\t\t\t\tB68B7F9F1FCDCBC600BAD1AA /* nano_malloc_common.c in Sources */,\n\t\t\t\t3FE91FF216A90B9200D1238A /* malloc.c in Sources */,\n\t\t\t\tC95742A61BF6842F0027269A /* frozen_malloc.c in Sources */,\n\t\t\t\t3FE91FF416A90B9200D1238A /* nano_malloc.c in Sources */,\n\t\t\t\t3FE91FF616A90B9200D1238A /* stack_logging_disk.c in Sources */,\n\t\t\t\tC95742901BF419DF0027269A /* magazine_tiny.c in Sources */,\n\t\t\t\tB65FBE2C2087AA2F00E21F59 /* malloc_printf.c in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\t3FE91FFE16A9109E00D1238A /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\tB66C71DB2034BFD30047E265 /* malloc_common.c in Sources */,\n\t\t\t\t3FE91FFF16A9109E00D1238A /* bitarray.c in Sources */,\n\t\t\t\tC95742A11BF681B00027269A /* purgeable_malloc.c in Sources */,\n\t\t\t\tC957429D1BF672F80027269A /* magazine_large.c in Sources */,\n\t\t\t\t3FE9200116A9109E00D1238A /* magazine_malloc.c in Sources */,\n\t\t\t\tC957429A1BF670D00027269A /* magazine_small.c in Sources */,\n\t\t\t\tC95742AC1BF685CB0027269A /* legacy_malloc.c in Sources */,\n\t\t\t\tB68B7FA01FCDCBE700BAD1AA /* nano_malloc_common.c in Sources */,\n\t\t\t\tB68B7FA61FCDD9B200BAD1AA /* nanov2_malloc.c in Sources */,\n\t\t\t\t3FE9200216A9109E00D1238A /* magmallocProvider.d in Sources */,\n\t\t\t\t3FE9200316A9109E00D1238A /* malloc.c in Sources */,\n\t\t\t\tC95742A71BF6842F0027269A /* frozen_malloc.c in Sources */,\n\t\t\t\t3FE9200416A9109E00D1238A /* nano_malloc.c in Sources */,\n\t\t\t\t3FE9200616A9109E00D1238A /* stack_logging_disk.c in Sources */,\n\t\t\t\tC95742911BF419DF0027269A /* magazine_tiny.c in Sources */,\n\t\t\t\tB6D5C7F4202E26F90035E376 /* resolver.c in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\t456E51C5197DF0D600A7E488 /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t925383DA1BD03D5100F745DB /* stress_test.c in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tB629CF2C202BB337007719B9 /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\tB629CF2D202BB337007719B9 /* radix_tree.c in Sources */,\n\t\t\t\tB629CF2E202BB337007719B9 /* bitarray.c in Sources */,\n\t\t\t\tB629CF2F202BB337007719B9 /* purgeable_malloc.c in Sources */,\n\t\t\t\tB6D5C7F3202E26F90035E376 /* resolver.c in Sources */,\n\t\t\t\tB629CF30202BB337007719B9 /* magazine_large.c in Sources */,\n\t\t\t\tB629CF31202BB337007719B9 /* magazine_malloc.c in Sources */,\n\t\t\t\tB629CF32202BB337007719B9 /* empty.s in Sources */,\n\t\t\t\tB629CF33202BB337007719B9 /* magazine_small.c in Sources */,\n\t\t\t\tB629CF34202BB337007719B9 /* legacy_malloc.c in Sources */,\n\t\t\t\tB629CF35202BB337007719B9 /* magmallocProvider.d in Sources */,\n\t\t\t\tB629CF36202BB337007719B9 /* malloc.c in Sources */,\n\t\t\t\tB629CF37202BB337007719B9 /* frozen_malloc.c in Sources */,\n\t\t\t\tB629CF38202BB337007719B9 /* nanov2_malloc.c in Sources */,\n\t\t\t\tB629CF39202BB337007719B9 /* nano_malloc.c in Sources */,\n\t\t\t\tB629CF3A202BB337007719B9 /* stack_logging_disk.c in Sources */,\n\t\t\t\tB629CF3B202BB337007719B9 /* magazine_tiny.c in Sources */,\n\t\t\t\tB629CF3C202BB337007719B9 /* nano_malloc_common.c in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tB6910F66202B630D00FF2EB0 /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\tB6910F67202B630D00FF2EB0 /* radix_tree.c in Sources */,\n\t\t\t\tB6910F68202B630D00FF2EB0 /* bitarray.c in Sources */,\n\t\t\t\tB6910F69202B630D00FF2EB0 /* purgeable_malloc.c in Sources */,\n\t\t\t\tB6D5C7F2202E26F80035E376 /* resolver.c in Sources */,\n\t\t\t\tB6910F6A202B630D00FF2EB0 /* magazine_large.c in Sources */,\n\t\t\t\tB6910F6B202B630D00FF2EB0 /* magazine_malloc.c in Sources */,\n\t\t\t\tB6910F6C202B630D00FF2EB0 /* empty.s in Sources */,\n\t\t\t\tB6910F6D202B630D00FF2EB0 /* magazine_small.c in Sources */,\n\t\t\t\tB6910F6E202B630D00FF2EB0 /* legacy_malloc.c in Sources */,\n\t\t\t\tB6910F6F202B630D00FF2EB0 /* magmallocProvider.d in Sources */,\n\t\t\t\tB6910F70202B630D00FF2EB0 /* malloc.c in Sources */,\n\t\t\t\tB6910F71202B630D00FF2EB0 /* frozen_malloc.c in Sources */,\n\t\t\t\tB629CF28202BA149007719B9 /* nanov2_malloc.c in Sources */,\n\t\t\t\tB6910F73202B630D00FF2EB0 /* nano_malloc.c in Sources */,\n\t\t\t\tB6910F74202B630D00FF2EB0 /* stack_logging_disk.c in Sources */,\n\t\t\t\tB6910F75202B630D00FF2EB0 /* magazine_tiny.c in Sources */,\n\t\t\t\tB6910F76202B630D00FF2EB0 /* nano_malloc_common.c in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tB6D2ED4A2007D76F007AF994 /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\tB6D2ED572007D91A007AF994 /* malloc_replay.cpp in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n\t\tC0CE45301C52C90500C24048 /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t088C4D841D1AF16F005C6B36 /* radix_tree.c in Sources */,\n\t\t\t\tC0CE45311C52C90500C24048 /* bitarray.c in Sources */,\n\t\t\t\tC0CE45321C52C90500C24048 /* purgeable_malloc.c in Sources */,\n\t\t\t\tB6D5C7F5202E26FA0035E376 /* resolver.c in Sources */,\n\t\t\t\tC0CE45331C52C90500C24048 /* magazine_large.c in Sources */,\n\t\t\t\tC0CE45341C52C90500C24048 /* magazine_malloc.c in Sources */,\n\t\t\t\tC9ABCA051CB6FC6800ECB399 /* empty.s in Sources */,\n\t\t\t\tC0CE45351C52C90500C24048 /* magazine_small.c in Sources */,\n\t\t\t\tC0CE45361C52C90500C24048 /* legacy_malloc.c in Sources */,\n\t\t\t\tC0CE45371C52C90500C24048 /* magmallocProvider.d in Sources */,\n\t\t\t\tC0CE45381C52C90500C24048 /* malloc.c in Sources */,\n\t\t\t\tC0CE45391C52C90500C24048 /* frozen_malloc.c in Sources */,\n\t\t\t\tB68B7FA71FCDD9B200BAD1AA /* nanov2_malloc.c in Sources */,\n\t\t\t\tB66C71DC2034BFD40047E265 /* malloc_common.c in Sources */,\n\t\t\t\tC0CE453A1C52C90500C24048 /* nano_malloc.c in Sources */,\n\t\t\t\tC0CE453C1C52C90500C24048 /* stack_logging_disk.c in Sources */,\n\t\t\t\tC0CE453D1C52C90500C24048 /* magazine_tiny.c in Sources */,\n\t\t\t\tB68B7FA11FCDCBE800BAD1AA /* nano_malloc_common.c in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXSourcesBuildPhase section */\n\n/* Begin PBXTargetDependency section */\n\t\t3FE9201616A9111400D1238A /* PBXTargetDependency */ = {\n\t\t\tisa = PBXTargetDependency;\n\t\t\ttarget = 3FE91FFD16A9109E00D1238A /* libmalloc_eOS */;\n\t\t\ttargetProxy = 3FE9201516A9111400D1238A /* PBXContainerItemProxy */;\n\t\t};\n\t\t3FE9201816A9111600D1238A /* PBXTargetDependency */ = {\n\t\t\tisa = PBXTargetDependency;\n\t\t\ttarget = 3FE91FE716A90AEC00D1238A /* libsystem_malloc */;\n\t\t\ttargetProxy = 3FE9201716A9111600D1238A /* PBXContainerItemProxy */;\n\t\t};\n\t\t45039168198FFFA6004EE2A3 /* PBXTargetDependency */ = {\n\t\t\tisa = PBXTargetDependency;\n\t\t\ttarget = 456E51C8197DF0D600A7E488 /* libmalloc_stress_test */;\n\t\t\ttargetProxy = 45039167198FFFA6004EE2A3 /* PBXContainerItemProxy */;\n\t\t};\n\t\t925383D91BD03D0000F745DB /* PBXTargetDependency */ = {\n\t\t\tisa = PBXTargetDependency;\n\t\t\ttarget = 925383D41BD03C0500F745DB /* darwintests */;\n\t\t\ttargetProxy = 925383D81BD03D0000F745DB /* PBXContainerItemProxy */;\n\t\t};\n\t\tB60A579820093093006215CB /* PBXTargetDependency */ = {\n\t\t\tisa = PBXTargetDependency;\n\t\t\ttarget = B6D2ED492007D76F007AF994 /* libmalloc_replay */;\n\t\t\ttargetProxy = B60A579720093093006215CB /* PBXContainerItemProxy */;\n\t\t};\n\t\tB629CF44202BB389007719B9 /* PBXTargetDependency */ = {\n\t\t\tisa = PBXTargetDependency;\n\t\t\ttarget = B629CF2B202BB337007719B9 /* libmalloc_alt */;\n\t\t\ttargetProxy = B629CF43202BB389007719B9 /* PBXContainerItemProxy */;\n\t\t};\n\t\tB676F4AC202B66EF00933F6D /* PBXTargetDependency */ = {\n\t\t\tisa = PBXTargetDependency;\n\t\t\ttarget = B6910F65202B630D00FF2EB0 /* libmalloc_mp */;\n\t\t\ttargetProxy = B676F4AB202B66EF00933F6D /* PBXContainerItemProxy */;\n\t\t};\n\t\tC0CE45501C52CCBD00C24048 /* PBXTargetDependency */ = {\n\t\t\tisa = PBXTargetDependency;\n\t\t\ttarget = C0CE452F1C52C90500C24048 /* libmalloc_static */;\n\t\t\ttargetProxy = C0CE454F1C52CCBD00C24048 /* PBXContainerItemProxy */;\n\t\t};\n/* End PBXTargetDependency section */\n\n/* Begin XCBuildConfiguration section */\n\t\t08C28B451D501D2C000AE997 /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t08C28B461D501D2C000AE997 /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\t3FE91FEB16A90AEC00D1238A /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = B629CF29202BA3C2007719B9 /* libmalloc_resolver.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t3FE91FEC16A90AEC00D1238A /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = B629CF29202BA3C2007719B9 /* libmalloc_resolver.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\t3FE9200E16A9109E00D1238A /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = 3FE91FE116A90A8D00D1238A /* libmalloc_eos.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t3FE9200F16A9109E00D1238A /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = 3FE91FE116A90A8D00D1238A /* libmalloc_eos.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\t3FE9201316A9111000D1238A /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t3FE9201416A9111000D1238A /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\t3FFC1BE916A908F800027192 /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tONLY_ACTIVE_ARCH = YES;\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t3FFC1BEA16A908F800027192 /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\t45039163198FFF73004EE2A3 /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t45039164198FFF73004EE2A3 /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\t456E51CD197DF0D600A7E488 /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tCOPY_PHASE_STRIP = NO;\n\t\t\t\tGCC_OPTIMIZATION_LEVEL = 0;\n\t\t\t\tGCC_PREPROCESSOR_DEFINITIONS = (\n\t\t\t\t\t\"DEBUG=1\",\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t);\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tSDKROOT = macosx.internal;\n\t\t\t\tSUPPORTED_PLATFORMS = \"macosx iphoneos appletvos watchos\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t456E51CE197DF0D600A7E488 /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tDEBUG_INFORMATION_FORMAT = \"dwarf-with-dsym\";\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tSDKROOT = macosx.internal;\n\t\t\t\t\"SKIP_INSTALL[sdk=iphonesimulator*]\" = YES;\n\t\t\t\tSUPPORTED_PLATFORMS = \"macosx iphoneos appletvos watchos\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\t925383D61BD03C0500F745DB /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tSDKROOT = macosx.internal;\n\t\t\t\tSUPPORTED_PLATFORMS = \"macosx iphoneos appletvos watchos\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t925383D71BD03C0500F745DB /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tSDKROOT = macosx.internal;\n\t\t\t\tSUPPORTED_PLATFORMS = \"macosx iphoneos appletvos watchos\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\tB60A57942009307E006215CB /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCODE_SIGN_STYLE = Automatic;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\tB60A57952009307E006215CB /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCODE_SIGN_STYLE = Automatic;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\tB629CF40202BB337007719B9 /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = B66AA658202A70B00019D607 /* libmalloc_resolved.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t\tPRODUCT_NAME = \"$(PRODUCT_NAME)\";\n\t\t\t\tRESOLVED_VARIANT = alt;\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\tB629CF41202BB337007719B9 /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = B66AA658202A70B00019D607 /* libmalloc_resolved.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t\tPRODUCT_NAME = \"$(PRODUCT_NAME)\";\n\t\t\t\tRESOLVED_VARIANT = alt;\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\tB6910F87202B630D00FF2EB0 /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = B66AA658202A70B00019D607 /* libmalloc_resolved.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t\tPRODUCT_NAME = \"$(PRODUCT_NAME)\";\n\t\t\t\tRESOLVED_VARIANT = mp;\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\tB6910F88202B630D00FF2EB0 /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = B66AA658202A70B00019D607 /* libmalloc_resolved.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t\tPRODUCT_NAME = \"$(PRODUCT_NAME)\";\n\t\t\t\tRESOLVED_VARIANT = mp;\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\tB6D2ED4F2007D76F007AF994 /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"c++0x\";\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tCOPY_PHASE_STRIP = NO;\n\t\t\t\tFRAMEWORK_SEARCH_PATHS = (\n\t\t\t\t\t\"$(SDKROOT)/System/Library/PrivateFrameworks\",\n\t\t\t\t\t\"$(SDKROOT)$(SYSTEM_LIBRARY_DIR)/PrivateFrameworks\",\n\t\t\t\t);\n\t\t\t\tGCC_OPTIMIZATION_LEVEL = 0;\n\t\t\t\tGCC_PREPROCESSOR_DEFINITIONS = (\n\t\t\t\t\t\"DEBUG=1\",\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t);\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tHEADER_SEARCH_PATHS = \"$(SRCROOT)/src\";\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tSDKROOT = macosx.internal;\n\t\t\t\tSUPPORTED_PLATFORMS = \"macosx iphoneos iphonesimulator appletvos appletvsimulator watchos watchsimulator\";\n\t\t\t\tVALID_ARCHS = \"armv6 armv7 arm64 arm64_32 armv7k x86_64 x86_64h\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\tB6D2ED502007D76F007AF994 /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbuildSettings = {\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"c++0x\";\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tDEBUG_INFORMATION_FORMAT = \"dwarf-with-dsym\";\n\t\t\t\tFRAMEWORK_SEARCH_PATHS = (\n\t\t\t\t\t\"$(SDKROOT)/System/Library/PrivateFrameworks\",\n\t\t\t\t\t\"$(SDKROOT)$(SYSTEM_LIBRARY_DIR)/PrivateFrameworks\",\n\t\t\t\t);\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tHEADER_SEARCH_PATHS = \"$(SRCROOT)/src\";\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tSDKROOT = macosx.internal;\n\t\t\t\t\"SKIP_INSTALL[sdk=iphonesimulator*]\" = YES;\n\t\t\t\tSUPPORTED_PLATFORMS = \"macosx iphoneos iphonesimulator appletvos appletvsimulator watchos watchsimulator\";\n\t\t\t\tVALID_ARCHS = \"armv6 armv7 arm64 arm64_32 armv7k x86_64 x86_64h\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\tC0CE454A1C52C90500C24048 /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = C0CE450E1C52B9E300C24048 /* libmalloc_static.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t\tPRODUCT_NAME = \"$(PRODUCT_NAME)\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\tC0CE454B1C52C90500C24048 /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = C0CE450E1C52B9E300C24048 /* libmalloc_static.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\n\t\t\t\tPRODUCT_NAME = \"$(PRODUCT_NAME)\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n/* End XCBuildConfiguration section */\n\n/* Begin XCConfigurationList section */\n\t\t08C28B441D501D2C000AE997 /* Build configuration list for PBXNativeTarget \"radix-tree\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t08C28B451D501D2C000AE997 /* Debug */,\n\t\t\t\t08C28B461D501D2C000AE997 /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\t3FE91FEA16A90AEC00D1238A /* Build configuration list for PBXNativeTarget \"libsystem_malloc\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t3FE91FEB16A90AEC00D1238A /* Debug */,\n\t\t\t\t3FE91FEC16A90AEC00D1238A /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\t3FE9200D16A9109E00D1238A /* Build configuration list for PBXNativeTarget \"libmalloc_eOS\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t3FE9200E16A9109E00D1238A /* Debug */,\n\t\t\t\t3FE9200F16A9109E00D1238A /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\t3FE9201216A9111000D1238A /* Build configuration list for PBXAggregateTarget \"libmalloc\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t3FE9201316A9111000D1238A /* Debug */,\n\t\t\t\t3FE9201416A9111000D1238A /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\t3FFC1BE816A908F800027192 /* Build configuration list for PBXProject \"libmalloc\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t3FFC1BE916A908F800027192 /* Debug */,\n\t\t\t\t3FFC1BEA16A908F800027192 /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\t45039162198FFF73004EE2A3 /* Build configuration list for PBXAggregateTarget \"libmalloc_test\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t45039163198FFF73004EE2A3 /* Debug */,\n\t\t\t\t45039164198FFF73004EE2A3 /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\t456E51CF197DF0D600A7E488 /* Build configuration list for PBXNativeTarget \"libmalloc_stress_test\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t456E51CD197DF0D600A7E488 /* Debug */,\n\t\t\t\t456E51CE197DF0D600A7E488 /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\t925383D51BD03C0500F745DB /* Build configuration list for PBXLegacyTarget \"darwintests\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t925383D61BD03C0500F745DB /* Debug */,\n\t\t\t\t925383D71BD03C0500F745DB /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\tB60A57962009307E006215CB /* Build configuration list for PBXAggregateTarget \"executables\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\tB60A57942009307E006215CB /* Debug */,\n\t\t\t\tB60A57952009307E006215CB /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\tB629CF3F202BB337007719B9 /* Build configuration list for PBXNativeTarget \"libmalloc_alt\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\tB629CF40202BB337007719B9 /* Debug */,\n\t\t\t\tB629CF41202BB337007719B9 /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\tB6910F86202B630D00FF2EB0 /* Build configuration list for PBXNativeTarget \"libmalloc_mp\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\tB6910F87202B630D00FF2EB0 /* Debug */,\n\t\t\t\tB6910F88202B630D00FF2EB0 /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\tB6D2ED4E2007D76F007AF994 /* Build configuration list for PBXNativeTarget \"libmalloc_replay\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\tB6D2ED4F2007D76F007AF994 /* Debug */,\n\t\t\t\tB6D2ED502007D76F007AF994 /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\tC0CE45491C52C90500C24048 /* Build configuration list for PBXNativeTarget \"libmalloc_static\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\tC0CE454A1C52C90500C24048 /* Debug */,\n\t\t\t\tC0CE454B1C52C90500C24048 /* Release */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n/* End XCConfigurationList section */\n\t};\n\trootObject = 3FFC1BE516A908F800027192 /* Project object */;\n}\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/man/malloc.3",
"content": ".\\\" Copyright (c) 2006 Apple Computer, Inc. All rights reserved.\n.\\\"\n.\\\" @APPLE_LICENSE_HEADER_START@\n.\\\"\n.\\\" The contents of this file constitute Original Code as defined in and\n.\\\" are subject to the Apple Public Source License Version 1.1 (the\n.\\\" \"License\"). You may not use this file except in compliance with the\n.\\\" License. Please obtain a copy of the License at\n.\\\" http://www.apple.com/publicsource and read it before using this file.\n.\\\"\n.\\\" This Original Code and all software distributed under the License are\n.\\\" distributed on an \"AS IS\" basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n.\\\" EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n.\\\" INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n.\\\" FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the\n.\\\" License for the specific language governing rights and limitations\n.\\\" under the License.\n.\\\"\n.\\\" @APPLE_LICENSE_HEADER_END@\n.\\\"\n.Dd Aug 13, 2008\n.Dt MALLOC 3\n.Os\n.Sh NAME\n.Nm calloc ,\n.Nm free ,\n.Nm malloc ,\n.Nm realloc ,\n.Nm reallocf ,\n.Nm valloc\n.Nd memory allocation\n.Sh SYNOPSIS\n.In stdlib.h\n.Ft void *\n.Fo calloc\n.Fa \"size_t count\"\n.Fa \"size_t size\"\n.Fc\n.Ft void\n.Fo free\n.Fa \"void *ptr\"\n.Fc\n.Ft void *\n.Fo malloc\n.Fa \"size_t size\"\n.Fc\n.Ft void *\n.Fo realloc\n.Fa \"void *ptr\"\n.Fa \"size_t size\"\n.Fc\n.Ft void *\n.Fo reallocf\n.Fa \"void *ptr\"\n.Fa \"size_t size\"\n.Fc\n.Ft void *\n.Fo valloc\n.Fa \"size_t size\"\n.Fc\n.Sh DESCRIPTION\nThe\n.Fn malloc ,\n.Fn calloc ,\n.Fn valloc ,\n.Fn realloc ,\nand\n.Fn reallocf\nfunctions allocate memory.\nThe allocated memory is aligned such that it can be used for any data type,\nincluding AltiVec- and SSE-related types.\nThe\n.Fn free\nfunction frees allocations that were created via the preceding allocation\nfunctions.\n.Pp\nThe\n.Fn malloc\nfunction allocates\n.Fa size\nbytes of memory and returns a pointer to the allocated memory.\n.Pp\nThe\n.Fn calloc\nfunction contiguously allocates enough space for\n.Fa count\nobjects that are\n.Fa size\nbytes of memory each and returns a pointer to the allocated memory.\nThe allocated memory is filled with bytes of value zero.\n.Pp\nThe\n.Fn valloc\nfunction allocates\n.Fa size\nbytes of memory and returns a pointer to the allocated memory.\nThe allocated memory is aligned on a page boundary.\n.Pp\nThe\n.Fn realloc\nfunction tries to change the size of the allocation pointed to by\n.Fa ptr\nto\n.Fa size ,\nand returns\n.Fa ptr .\nIf there is not enough room to enlarge the memory allocation pointed to by\n.Fa ptr ,\n.Fn realloc\ncreates a new allocation, copies as much of the old data pointed to by\n.Fa ptr\nas will fit to the new allocation, frees the old allocation, and returns a\npointer to the allocated memory.\nIf\n.Fa ptr\nis \n.Dv NULL ,\n.Fn realloc\nis identical to a call to \n.Fn malloc\nfor \n.Fa size\nbytes.\nIf\n.Fa size\nis zero and \n.Fa ptr\nis not \n.Dv NULL ,\na new, minimum sized object is allocated and the original object is freed.\nWhen extending a region allocated with calloc(3), realloc(3) does not guarantee \nthat the additional memory is also zero-filled.\n.Pp\nThe\n.Fn reallocf\nfunction is identical to the\n.Fn realloc\nfunction, except that it\nwill free the passed pointer when the requested memory cannot be allocated.\nThis is a\n.Fx\nspecific API designed to ease the problems with traditional coding styles\nfor realloc causing memory leaks in libraries.\n.Pp\nThe\n.Fn free\nfunction deallocates the memory allocation pointed to by\n.Fa ptr . If\n.Fa ptr \nis a NULL pointer, no operation is performed.\n.Sh RETURN VALUES\nIf successful,\n.Fn calloc ,\n.Fn malloc ,\n.Fn realloc ,\n.Fn reallocf ,\nand\n.Fn valloc\nfunctions return a pointer to allocated memory.\nIf there is an error, they return a\n.Dv NULL\npointer and set\n.Va errno\nto\n.Er ENOMEM .\n.Pp\nFor\n.Fn realloc ,\nthe input pointer is still valid if reallocation failed.\nFor\n.Fn reallocf ,\nthe input pointer will have been freed if reallocation failed.\n.Pp\nThe\n.Fn free\nfunction does not return a value.\n.Sh DEBUGGING ALLOCATION ERRORS\nA number of facilities are provided to aid in debugging allocation errors in\napplications.\nThese facilities are primarily controlled via environment variables.\nThe recognized environment variables and their meanings are documented below.\n.Sh ENVIRONMENT\nThe following environment variables change the behavior of the\nallocation-related functions.\n.Bl -tag -width \".Ev MallocStackLoggingNoCompact\"\n.It Ev MallocDebugReport\nIf set, specifies where messages are written. Set to \"stderr\" to write messages\nto the standard error stream, \"none\" to discard all messages and \"crash\" to\nwrite messages to standard error only for a condition that is about to cause a\ncrash. When not set, message are written to the standard error stream if it\nappears to be a terminal (that is, if isatty(STDERR_FILENO) returns a non-zero\nvalue) and are otherwise discarded.\n.It Ev MallocGuardEdges\nIf set, add a guard page before and after each large block.\n.It Ev MallocDoNotProtectPrelude\nIf set, do not add a guard page before large blocks,\neven if the\n.Ev MallocGuardEdges\nenvironment variable is set.\n.It Ev MallocDoNotProtectPostlude\nIf set, do not add a guard page after large blocks,\neven if the\n.Ev MallocGuardEdges\nenvironment variable is set.\n.It Ev MallocStackLogging\nThe default behavior if this is set is to record all allocation and deallocation events to an on-disk log, along with stacks, so that tools like\n.Xr leaks 1\nand\n.Xr malloc_history 1\ncan be used.\n.Pp\nSet to \"vm\" to record only allocation of virtual memory regions allocated by system calls and mach traps, such as by\n.Xr mmap 1\n.\n.Pp\nSet to \"malloc\" to record only allocations via\n.Xr malloc 3\nand related interfaces, not virtual memory regions.\n.Pp\nSet to \"lite\" to record current allocations only, not history. These are recorded by in-memory data structures, instead of an on-disk log.\n.It Ev MallocStackLoggingNoCompact\nIf set, record all stacks in a manner that is compatible with the\n.Nm malloc_history\nprogram.\n.It Ev MallocStackLoggingDirectory\nIf set, records stack logs to the directory specified instead of saving them to the default location (/tmp).\n.It Ev MallocScribble\nIf set, fill memory that has been allocated with 0xaa bytes.\nThis increases the likelihood that a program making assumptions about the contents of\nfreshly allocated memory will fail.\nAlso if set, fill memory that has been deallocated with 0x55 bytes.\nThis increases the likelihood that a program will fail due to accessing memory\nthat is no longer allocated. Note that due to the way in which freed memory is\nmanaged internally, the 0x55 pattern may not appear in some parts of a\ndeallocated memory block.\n.It Ev MallocCheckHeapStart \nIf set, specifies the number of allocations\n.Fa \nto wait before begining periodic heap checks every\n.Fa \nas specified by \n.Ev MallocCheckHeapEach .\nIf\n.Ev MallocCheckHeapStart\nis set but \n.Ev MallocCheckHeapEach\nis not specified, the default check repetition is 1000.\n.It Ev MallocCheckHeapEach \nIf set, run a consistency check on the heap every\n.Fa \noperations.\n.Ev MallocCheckHeapEach\nis only meaningful if\n.Ev MallocCheckHeapStart\nis also set.\n.It Ev MallocCheckHeapSleep \nSets the number of seconds to sleep (waiting for a debugger to attach) when\n.Ev MallocCheckHeapStart\nis set and a heap corruption is detected.\nThe default is 100 seconds.\nSetting this to zero means not to sleep at all.\nSetting this to a negative number means to sleep (for the positive number of\nseconds) only the very first time a heap corruption is detected.\n.It Ev MallocCheckHeapAbort \nWhen\n.Ev MallocCheckHeapStart\nis set and this is set to a non-zero value, causes\n.Xr abort 3\nto be called if a heap corruption is detected, instead of any sleeping.\n.It Ev MallocErrorAbort\nIf set, causes\n.Xr abort 3\nto be called if an error was encountered in\n.Xr malloc 3\nor \n.Xr free 3\n, such as a calling\n.Xr free 3\non a pointer previously freed.\n.It Ev MallocCorruptionAbort\nSimilar to\n.Ev MallocErrorAbort \nbut will not abort in out of memory conditions, making it more useful to catch\nonly those errors which will cause memory corruption.\nMallocCorruptionAbort is always set on 64-bit processes.\n.It Ev MallocHelp\nIf set, print a list of environment variables that are paid heed to by the\nallocation-related functions, along with short descriptions.\nThe list should correspond to this documentation.\n.El\n.Sh DIAGNOSTIC MESSAGES\n.Sh SEE ALSO\n.Xr leaks 1 ,\n.Xr malloc_history 1 ,\n.Xr abort 3 ,\n.Xr malloc_size 3 ,\n.Xr malloc_zone_malloc 3 ,\n.Xr posix_memalign 3 ,\n.Xr libgmalloc 3\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/man/malloc_size.3",
"content": ".\\\" Copyright (c) 2006 Apple Computer, Inc. All rights reserved.\n.\\\"\n.\\\" @APPLE_LICENSE_HEADER_START@\n.\\\"\n.\\\" The contents of this file constitute Original Code as defined in and\n.\\\" are subject to the Apple Public Source License Version 1.1 (the\n.\\\" \"License\"). You may not use this file except in compliance with the\n.\\\" License. Please obtain a copy of the License at\n.\\\" http://www.apple.com/publicsource and read it before using this file.\n.\\\"\n.\\\" This Original Code and all software distributed under the License are\n.\\\" distributed on an \"AS IS\" basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n.\\\" EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n.\\\" INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n.\\\" FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the\n.\\\" License for the specific language governing rights and limitations\n.\\\" under the License.\n.\\\"\n.\\\" @APPLE_LICENSE_HEADER_END@\n.\\\"\n.Dd May 23, 2006\n.Dt MALLOC_SIZE 3\n.Os\n.Sh NAME\n.Nm malloc_good_size ,\n.Nm malloc_size\n.Nd memory allocation information\n.Sh SYNOPSIS\n.In malloc/malloc.h\n.Ft size_t\n.Fo malloc_good_size\n.Fa \"size_t size\"\n.Fc\n.Ft size_t\n.Fo malloc_size\n.Fa \"const void *ptr\"\n.Fc\n.Sh DESCRIPTION\nThe\n.Fn malloc_size\nfunction returns the size of the memory block\nthat backs the allocation pointed to by\n.Fa ptr .\nThe memory block size is always at least as large\nas the allocation it backs, and may be larger.\n.Pp\nThe\n.Fn malloc_good_size\nfunction rounds\n.Fa size\nup to a value that the allocator implementation can allocate\nwithout adding any padding;\nit then returns that rounded-up value.\n.Sh SEE ALSO\n.Xr malloc 3\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/man/malloc_zone_malloc.3",
"content": ".\\\" Copyright (c) 2008 Apple, Inc. All rights reserved.\n.\\\"\n.\\\" @APPLE_LICENSE_HEADER_START@\n.\\\"\n.\\\" The contents of this file constitute Original Code as defined in and\n.\\\" are subject to the Apple Public Source License Version 1.1 (the\n.\\\" \"License\"). You may not use this file except in compliance with the\n.\\\" License. Please obtain a copy of the License at\n.\\\" http://www.apple.com/publicsource and read it before using this file.\n.\\\"\n.\\\" This Original Code and all software distributed under the License are\n.\\\" distributed on an \"AS IS\" basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n.\\\" EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n.\\\" INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n.\\\" FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the\n.\\\" License for the specific language governing rights and limitations\n.\\\" under the License.\n.\\\"\n.\\\" @APPLE_LICENSE_HEADER_END@\n.\\\"\n.Dd Aug 13, 2008\n.Dt MALLOC_ZONE_MALLOC 3\n.Os\n.Sh NAME\n.Nm malloc_create_zone ,\n.Nm malloc_destroy_zone ,\n.Nm malloc_default_zone ,\n.Nm malloc_zone_from_ptr ,\n.Nm malloc_zone_malloc ,\n.Nm malloc_zone_calloc ,\n.Nm malloc_zone_valloc ,\n.Nm malloc_zone_realloc ,\n.Nm malloc_zone_memalign ,\n.Nm malloc_zone_free\n.Nd zone-based memory allocation\n.Sh SYNOPSIS\n.In malloc/malloc.h\n.Ft malloc_zone_t *\n.Fo malloc_create_zone\n.Fa \"vm_size_t start_size\"\n.Fa \"unsigned flags\"\n.Fc\n.Ft void\n.Fo malloc_destroy_zone\n.Fa \"malloc_zone_t *zone\"\n.Fc\n.Ft malloc_zone_t *\n.Fo malloc_default_zone\n.Fa void\n.Fc\n.Ft malloc_zone_t *\n.Fo malloc_zone_from_ptr\n.Fa \"const void *ptr\"\n.Fc\n.Ft void *\n.Fo malloc_zone_malloc\n.Fa \"malloc_zone_t *zone\"\n.Fa \"size_t size\"\n.Fc\n.Ft void *\n.Fo malloc_zone_calloc\n.Fa \"malloc_zone_t *zone\"\n.Fa \"size_t num_items\"\n.Fa \"size_t size\"\n.Fc\n.Ft void *\n.Fo malloc_zone_valloc\n.Fa \"malloc_zone_t *zone\"\n.Fa \"size_t size\"\n.Fc\n.Ft void *\n.Fo malloc_zone_realloc\n.Fa \"malloc_zone_t *zone\"\n.Fa \"void *ptr\"\n.Fa \"size_t size\"\n.Fc\n.Ft void *\n.Fo malloc_zone_memalign\n.Fa \"malloc_zone_t *zone\"\n.Fa \"size_t alignment\"\n.Fa \"size_t size\"\n.Fc\n.Ft void\n.Fo malloc_zone_free\n.Fa \"malloc_zone_t *zone\"\n.Fa \"void *ptr\"\n.Fc\n.Sh DESCRIPTION\nThe\n.Fn malloc_create_zone\nfunction creates a malloc zone, advising an initial allocation of\n.Fa start_size\nbytes, and specifying \n.Fa flags\nThe returned malloc zone can be used to provide custom allocation and \ndeallocation behavior, and to retrieve additional information about the\nallocations in that zone.\nAt present there are no client settable flag values recognized by malloc_create_zone(),\nthe flags argument should always be passed as zero.\n.Pp\nThe\n.Fn malloc_destroy_zone\nfunction deallocates all memory associated with objects in \n.Fa zone\nas well as \n.Fa zone\nitself.\n.Pp\nThe\n.Fn malloc_default_zone\nfunction returns the default system malloc zone, used by\n.Xr malloc 3 ,\nand\n.Xr free 3 .\n.Pp\nThe\n.Fn malloc_zone_from_ptr\nfunction returns a pointer to the malloc zone which contains\n.Fa ptr\nor NULL, if the pointer does not point to an allocated object in any current\nmalloc zone.\n.Pp\nThe\n.Fn malloc_zone_malloc ,\n.Fn malloc_zone_calloc ,\n.Fn malloc_zone_valloc ,\n.Fn malloc_zone_realloc ,\n.Fn malloc_zone_memalign ,\nand\n.Fn malloc_zone_free\nperform the same task on\n.Fa zone\nas their non-prefixed variants, \n.Xr malloc 3 ,\n.Xr calloc 3 ,\n.Xr valloc 3 ,\n.Xr realloc 3 ,\n.Xr posix_memalign 3 ,\nand \n.Xr free 3 perform on the default system malloc zone.\n.Sh RETURN VALUES\nThe \n.Fn malloc_create_zone ,\n.Fn malloc_default_zone ,\nand\n.Fn malloc_zone_from_ptr\nfunctions return a pointer to a malloc_zone_t structure, or NULL if there was\nan error.\n.Pp\nThe \n.Fn malloc_zone_malloc ,\n.Fn malloc_zone_calloc ,\n.Fn malloc_zone_valloc ,\n.Fn malloc_zone_realloc ,\nand\n.Fn malloc_zone_memalign\nfunctions return a pointer to allocated memory. If there is an error, they \nreturn a NULL pointer. They are not required to set \n.Va errno .\n.Sh SEE ALSO\n.Xr malloc 3 ,\n.Xr posix_memalign 3\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/man/manpages.lst",
"content": "# manpage tables\n# [ ...]\n\n# man3\nmalloc.3 malloc.3 calloc.3 free.3 realloc.3 reallocf.3 valloc.3\nmalloc_size.3 malloc_size.3 malloc_good_size.3\nmalloc_zone_malloc.3 malloc_zone_malloc.3 malloc_create_zone.3 malloc_destroy_zone.3 malloc_default_zone.3 malloc_zone_from_ptr.3 malloc_zone_calloc.3 malloc_zone_valloc.3 malloc_zone_realloc.3 malloc_zone_memalign.3 malloc_zone_free.3\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/private/malloc_private.h",
"content": "/*\n * Copyright (c) 1999-2016 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n * \n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n * \n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n * \n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef _MALLOC_PRIVATE_H_\n#define _MALLOC_PRIVATE_H_\n\n/* Here be dragons (SPIs) */\n\n#include \n#include \n#include \n#include \n#include \n\n/*********\tCallbacks\t************/\n\nAPI_AVAILABLE(macos(10.12), ios(10.0), tvos(10.0), watchos(3.0))\nvoid malloc_enter_process_memory_limit_warn_mode(void);\n\t/* A callback invoked once the process receives a warning for approaching\n\t * memory limit. */\n\n__OSX_AVAILABLE(10.12) __IOS_AVAILABLE(10.0)\n__TVOS_AVAILABLE(10.0) __WATCHOS_AVAILABLE(3.0)\nvoid malloc_memory_event_handler(unsigned long);\n\t/* A function invoked when malloc needs to handle any flavor of\n\t * memory pressure notification or process memory limit notification. */\n\nAPI_AVAILABLE(macos(10.12), ios(10.0), tvos(10.0), watchos(3.0))\nvoid * reallocarray(void * in_ptr, size_t nmemb, size_t size) __DARWIN_EXTSN(reallocarray) __result_use_check;\n\nAPI_AVAILABLE(macos(10.12), ios(10.0), tvos(10.0), watchos(3.0))\nvoid * reallocarrayf(void * in_ptr, size_t nmemb, size_t size) __DARWIN_EXTSN(reallocarrayf) __result_use_check;\n\n/*\n * Checks whether an address might belong to any registered zone. False positives\n * are allowed (e.g. the memory was freed, or it's in a part of the address\n * space used by malloc that has not yet been allocated.) False negatives are\n * not allowed.\n */\nAPI_AVAILABLE(macos(10.14), ios(12.0), tvos(12.0), watchos(5.0))\nboolean_t malloc_claimed_address(void *ptr) __result_use_check;\n\n/*\n * Checks whether an address might belong to a given zone. False positives are\n * allowed (e.g. the memory was freed, or it's in a part of the address space\n * used by malloc that has not yet been allocated.) False negatives are not\n * allowed.\n */\nAPI_AVAILABLE(macos(10.14), ios(12.0), tvos(12.0), watchos(5.0))\nboolean_t malloc_zone_claimed_address(malloc_zone_t *zone, void *ptr) __result_use_check;\n\n/**\n * Returns whether the nano allocator is engaged. The return value is 0 if Nano\n * is not engaged and the allocator version otherwise.\n */\nAPI_AVAILABLE(macos(10.14), ios(12.0), tvos(12.0), watchos(5.0))\nint malloc_engaged_nano(void) __result_use_check;\n\n#endif /* _MALLOC_PRIVATE_H_ */\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/private/stack_logging.h",
"content": "/*\n * Copyright (c) 1999-2007 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n * \n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n * \n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n * \n * @APPLE_LICENSE_HEADER_END@\n */\n\n#import \n#import \n#import \n#import \n#import \n\n#define STACK_LOGGING_MAX_STACK_SIZE 512\n\n#define stack_logging_type_free\t\t0\n#define stack_logging_type_generic\t1\t/* anything that is not allocation/deallocation */\n#define stack_logging_type_alloc\t2\t/* malloc, realloc, etc... */\n#define stack_logging_type_dealloc\t4\t/* free, realloc, etc... */\n#define stack_logging_type_vm_allocate 16 /* vm_allocate or mmap */\n#define stack_logging_type_vm_deallocate 32\t/* vm_deallocate or munmap */\n#define stack_logging_type_mapped_file_or_shared_mem\t128\n\n// The valid flags include those from VM_FLAGS_ALIAS_MASK, which give the user_tag of allocated VM regions.\n#define stack_logging_valid_type_flags ( \\\n\tstack_logging_type_generic | \\\n\tstack_logging_type_alloc | \\\n\tstack_logging_type_dealloc | \\\n\tstack_logging_type_vm_allocate | \\\n\tstack_logging_type_vm_deallocate | \\\n\tstack_logging_type_mapped_file_or_shared_mem | \\\n\tVM_FLAGS_ALIAS_MASK);\n\n// Following flags are absorbed by stack_logging_log_stack()\n#define\tstack_logging_flag_zone\t\t8\t/* NSZoneMalloc, etc... */\n#define stack_logging_flag_cleared\t64\t/* for NewEmptyHandle */\n\n#define STACK_LOGGING_VM_USER_TAG(flags) (((flags) & VM_FLAGS_ALIAS_MASK) >> 24)\n\n\n/* Macro used to disguise addresses so that leak finding can work */\n#define STACK_LOGGING_DISGUISE(address)\t((address) ^ 0x00005555) /* nicely idempotent */\n\ntypedef enum {\n\tstack_logging_mode_none = 0,\n\tstack_logging_mode_all,\n\tstack_logging_mode_malloc,\n\tstack_logging_mode_vm,\n\tstack_logging_mode_lite,\n\tstack_logging_mode_vmlite\n} stack_logging_mode_type;\n\nextern boolean_t turn_on_stack_logging(stack_logging_mode_type mode);\nextern void turn_off_stack_logging();\n\n/* constants for enabling/disabling malloc stack logging via the memorystatus_vm_pressure_send sysctl */\n#define\tMEMORYSTATUS_ENABLE_MSL_MALLOC\t\t0x10000000\n#define MEMORYSTATUS_ENABLE_MSL_VM\t\t\t0x20000000\n#define MEMORYSTATUS_ENABLE_MSL_LITE\t\t0x40000000\n#define MEMORYSTATUS_DISABLE_MSL\t\t\t0x80000000\n#define MEMORYSTATUS_ENABLE_MSL_LITE_FULL\t(MEMORYSTATUS_ENABLE_MSL_LITE | MEMORYSTATUS_ENABLE_MSL_VM | MEMORYSTATUS_ENABLE_MSL_MALLOC)\n#define MEMORYSTATUS_ENABLE_MSL_LITE_VM\t\t(MEMORYSTATUS_ENABLE_MSL_LITE | MEMORYSTATUS_ENABLE_MSL_VM)\n\nextern void __disk_stack_logging_log_stack(uint32_t type_flags, uintptr_t zone_ptr, uintptr_t size, uintptr_t ptr_arg, uintptr_t return_val, uint32_t num_hot_to_skip);\n\t/* Fits as the malloc_logger; logs malloc/free/realloc events and can log custom events if called directly */\n\n\n/* 64-bit-aware stack log access. As new SPI, these routines are prefixed with double-underscore to avoid conflict with Libsystem clients. */\n\ntypedef struct mach_stack_logging_record {\n\tuint32_t\t\ttype_flags;\n\tuint64_t\t\tstack_identifier;\n\tuint64_t\t\targument;\n\tmach_vm_address_t\taddress;\n} mach_stack_logging_record_t;\n\nextern kern_return_t __mach_stack_logging_start_reading(task_t task, vm_address_t shared_memory_address, boolean_t *uses_lite_mode);\nextern kern_return_t __mach_stack_logging_stop_reading(task_t task);\n\n/* Clients *should* call these start/stop functions to properly initialize stack logging data\n * structures and fully clean them up when they're done looking at a process. If the client does *not*\n * call these then currently it should still work but some data structures will still remain after\n * reading the stack logs (e.g., an extra shared memory segment, an open stack log file, etc).\n * NULL can be passed for uses_lite_mode if the client doesn’t need them.\n *\n * It is recommended that the client suspend the task before actually reading the stacks, and resume the task when done,\n * if the task uses lite mode.\n */\n\nextern kern_return_t __mach_stack_logging_set_file_path(task_t task, char* file_path);\n\nextern kern_return_t __mach_stack_logging_get_frames(task_t task, mach_vm_address_t address, mach_vm_address_t *stack_frames_buffer, uint32_t max_stack_frames, uint32_t *count);\n /* Gets the last allocation record (malloc, realloc, or free) about address */\n\nextern kern_return_t __mach_stack_logging_enumerate_records(task_t task, mach_vm_address_t address, void enumerator(mach_stack_logging_record_t, void *), void *context);\n /* Applies enumerator to all records involving address sending context as enumerator's second parameter; if !address, applies enumerator to all records */\n\nextern kern_return_t __mach_stack_logging_frames_for_uniqued_stack(task_t task, uint64_t stack_identifier, mach_vm_address_t *stack_frames_buffer, uint32_t max_stack_frames, uint32_t *count)\n\tAPI_DEPRECATED(\"use __mach_stack_logging_get_frames_for_stackid instead\", macos(10.9, 10.13), ios(7.0, 11.0), watchos(1.0, 4.0), tvos(9.0, 11.0));\n /* Given a uniqued_stack fills stack_frames_buffer. */\n\nextern kern_return_t __mach_stack_logging_get_frames_for_stackid(task_t task, uint64_t stack_identifier, mach_vm_address_t *stack_frames_buffer, uint32_t max_stack_frames, uint32_t *count,\n bool *last_frame_is_threadid)\n\tAPI_AVAILABLE(macos(10.13), ios(11.0), watchos(4.0), tvos(11.0));\n /* Given a uniqued_stack fills stack_frames_buffer. */\n\nextern uint64_t __mach_stack_logging_stackid_for_vm_region(task_t task, mach_vm_address_t address);\n\t/* given the address of a vm region, lookup it's stackid */\n\n\nstruct backtrace_uniquing_table;\n\nextern kern_return_t\n__mach_stack_logging_uniquing_table_read_stack(struct backtrace_uniquing_table *uniquing_table,\n\t\t\t\t\t\t\t\t\t\t\t uint64_t stackid,\n\t\t\t\t\t\t\t\t\t\t\t mach_vm_address_t *out_frames_buffer,\n\t\t\t\t\t\t\t\t\t\t\t uint32_t *out_frames_count,\n\t\t\t\t\t\t\t\t\t\t\t uint32_t max_frames);\n\nextern\nstruct backtrace_uniquing_table *\n__mach_stack_logging_copy_uniquing_table(task_t task);\n/* returns a retained pointer to copy of the task's uniquing table */\n\nextern\nvoid\n__mach_stack_logging_uniquing_table_release(struct backtrace_uniquing_table *);\n\nextern\nvoid\n__mach_stack_logging_uniquing_table_retain(struct backtrace_uniquing_table *);\n\nextern\nsize_t\n__mach_stack_logging_uniquing_table_sizeof(struct backtrace_uniquing_table *);\n/* returns the serialized size of a uniquing talbe in bytes */\n\nextern\nvoid *\n__mach_stack_logging_uniquing_table_serialize(struct backtrace_uniquing_table *table, mach_vm_size_t *size);\n/* Writes out a serialized representation of the table. Free it with mach_vm_deallocate. */\n\nextern\nstruct backtrace_uniquing_table *\n__mach_stack_logging_uniquing_table_copy_from_serialized(void *buffer, size_t size);\n/* creates a malloc uniquing table from a serialized representation */\n\n\nextern void thread_stack_pcs(vm_address_t *buffer, unsigned max, unsigned *num);\n /* Convenience to fill buffer with the PCs of the frames, starting with the hot frames;\n num: returned number of frames\n */\n\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/resolver/resolver.c",
"content": "/*\n * Copyright (c) 2018 Apple Inc. All rights reserved.\n *\n * @APPLE_APACHE_LICENSE_HEADER_START@\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * @APPLE_APACHE_LICENSE_HEADER_END@\n */\n\n\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/resolver/resolver.h",
"content": "/*\n * Copyright (c) 2018 Apple Inc. All rights reserved.\n *\n * @APPLE_APACHE_LICENSE_HEADER_START@\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * @APPLE_APACHE_LICENSE_HEADER_END@\n */\n\n#ifndef __MALLOC_RESOLVER_H__\n#define __MALLOC_RESOLVER_H__\n\n#include \"resolver_internal.h\"\n\n\n#endif // __MALLOC_RESOLVER_H__\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/resolver/resolver_internal.h",
"content": "/*\n * Copyright (c) 2018 Apple Inc. All rights reserved.\n *\n * @APPLE_APACHE_LICENSE_HEADER_START@\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * @APPLE_APACHE_LICENSE_HEADER_END@\n */\n\n#ifndef __MALLOC_RESOLVER_INTERNAL_H__\n#define __MALLOC_RESOLVER_INTERNAL_H__\n\n#define OS_RESOLVED_VARIANT_ADDR(s) (void *)(&s)\n\n#endif // __MALLOC_RESOLVER_INTERNAL_H__\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/base.h",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __BASE_H\n#define __BASE_H\n\n#ifndef __has_extension\n#define __has_extension(x) 0\n#endif\n\n#if __has_extension(c_static_assert)\n#define MALLOC_STATIC_ASSERT(x, y) _Static_assert((x), y)\n#else\n#define MALLOC_STATIC_ASSERT(x, y)\n#endif\n\n#define MALLOC_ASSERT(e) ({ \\\n\tif (__builtin_expect(!(e), 0)) { \\\n\t\t__asm__ __volatile__ (\"\"); \\\n\t\t__builtin_trap(); \\\n\t} \\\n})\n\n#define MALLOC_FATAL_ERROR(cause, message) ({ \\\n\t\t_os_set_crash_log_cause_and_message((cause), \"FATAL ERROR - \" message); \\\n\t\t__asm__ __volatile__ (\"\"); \\\n\t\t__builtin_trap(); \\\n})\n\n#define MALLOC_REPORT_FATAL_ERROR(cause, message) ({ \\\n\t\tmalloc_report(ASL_LEVEL_ERR, \"*** FATAL ERROR - \" message \".\\n\"); \\\n\t\tMALLOC_FATAL_ERROR((cause), message); \\\n})\n\n#if defined(__i386__) || defined(__x86_64__) || defined(__arm__) || defined(__arm64__)\n# define __APPLE_API_PRIVATE\n# include \n# if defined(__i386__) || defined(__x86_64__)\n# define _COMM_PAGE_VERSION_REQD 9\n# else\n# define _COMM_PAGE_VERSION_REQD 3\n# endif\n# undef __APPLE_API_PRIVATE\n#else\n# include \n#endif\n\n#if defined(__i386__) || defined(__x86_64__)\n// nano vs. magazine have different definitions\n// for this cache-line size.\n# define MALLOC_CACHE_LINE 128\n# define MALLOC_NANO_CACHE_LINE 64\n#elif defined(__arm__) || defined(__arm64__)\n# define MALLOC_CACHE_LINE 64\n# define MALLOC_NANO_CACHE_LINE 64\n#else\n# define MALLOC_CACHE_LINE 32\n# define MALLOC_NANO_CACHE_LINE 32\n#endif\n\n#define MALLOC_CACHE_ALIGN __attribute__ ((aligned (MALLOC_CACHE_LINE) ))\n#define MALLOC_NANO_CACHE_ALIGN __attribute__ ((aligned (MALLOC_NANO_CACHE_LINE) ))\n#define MALLOC_EXPORT extern __attribute__((visibility(\"default\")))\n#define MALLOC_NOEXPORT __attribute__((visibility(\"hidden\")))\n#define MALLOC_NOINLINE __attribute__((noinline))\n#define MALLOC_INLINE __inline__\n#define MALLOC_ALWAYS_INLINE __attribute__((always_inline))\n#define MALLOC_PACKED __attribute__((packed))\n#define MALLOC_USED __attribute__((used))\n#define MALLOC_UNUSED __attribute__((unused))\n#define CHECK_MAGAZINE_PTR_LOCKED(szone, mag_ptr, fun) {}\n\n#define SCRIBBLE_BYTE 0xaa /* allocated scribble */\n#define SCRABBLE_BYTE 0x55 /* free()'d scribble */\n#define SCRUBBLE_BYTE 0xdd /* madvise(..., MADV_FREE) scriblle */\n\n#define NDEBUG 1\n#define trunc_page_quanta(x) trunc_page((x))\n#define round_page_quanta(x) round_page((x))\n#define vm_page_quanta_size (vm_page_size)\n#define vm_page_quanta_shift (vm_page_shift)\n\n// add a guard page before and after each VM region to help debug\n#define MALLOC_ADD_GUARD_PAGES (1 << 0)\n// do not protect prelude page\n#define MALLOC_DONT_PROTECT_PRELUDE (1 << 1)\n// do not protect postlude page\n#define MALLOC_DONT_PROTECT_POSTLUDE (1 << 2)\n// write 0x55 onto free blocks\n#define MALLOC_DO_SCRIBBLE (1 << 3)\n// call abort() on any malloc error, such as double free or out of memory.\n#define MALLOC_ABORT_ON_ERROR (1 << 4)\n// allocate objects such that they may be used with VM purgability APIs\n#define MALLOC_PURGEABLE (1 << 5)\n// call abort() on malloc errors, but not on out of memory.\n#define MALLOC_ABORT_ON_CORRUPTION (1 << 6)\n// expanded small-zone free list size (256 slots)\n#define MALLOC_EXTENDED_SMALL_SLOTS (1 << 7)\n\n/*\n * msize - a type to refer to the number of quanta of a tiny or small\n * allocation. A tiny block with an msize of 3 would be 3 << SHIFT_TINY_QUANTUM\n * bytes in size.\n */\ntypedef unsigned short msize_t;\n\ntypedef unsigned int grain_t; // N.B. wide enough to index all free slots\ntypedef struct large_entry_s large_entry_t;\ntypedef struct szone_s szone_t;\ntypedef struct rack_s rack_t;\ntypedef struct magazine_s magazine_t;\ntypedef int mag_index_t;\ntypedef void *region_t;\n\n#endif // __BASE_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/bitarray.c",
"content": "/*\n * Copyright (c) 1999, 2000, 2003, 2005, 2008, 2012 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n//\n// bitarray.c\n// bitarray\n//\n// Created by Bertrand Serlet on 9/26/10.\n// Copyright (c) 2010 Apple. All rights reserved.\n//\n\n#include \"internal.h\"\n\n/******************************** Utilities ***************************/\n\n#define STATIC_INLINE static __inline\n\nSTATIC_INLINE unsigned\n__ffsll(uint64_t xx)\n{\n#if defined(__LP64__)\n\treturn __builtin_ffsl(xx);\n#else\n\treturn __builtin_ffsll(xx);\n#endif\n}\n\n#define BIT_SET(old, bit) ((old) | (1ULL << (bit)))\n#define BIT_GET(old, bit) ((old) & (1ULL << (bit)))\n#define BIT_ZAP(old, bit) ((old) & ~(1ULL << (bit)))\n\n// several variants below of bit setting or zapping to generate minimal code\n// All these do 1 memory read and (maybe) 1 memory write\nSTATIC_INLINE bool\nword_get_bit_simple(uint64_t *word, unsigned bit)\n{\n\tuint64_t old = *word;\n\treturn BIT_GET(old, bit) != 0;\n}\n\nSTATIC_INLINE void\nword_set_bit_simple(uint64_t *word, unsigned bit)\n{\n\tuint64_t old = *word;\n\t*word = BIT_SET(old, bit);\n}\n\nSTATIC_INLINE bool\nword_set_bit_changed(uint64_t *word, unsigned bit)\n{\n\t// returns 1 iff word has changed\n\tuint64_t old = *word;\n\tuint64_t new = BIT_SET(old, bit);\n\tif (old == new) {\n\t\treturn 0;\n\t}\n\t*word = new;\n\treturn 1;\n}\n\nSTATIC_INLINE bool\nword_set_bit_changed_go_down(uint64_t *word, unsigned bit, bool *was_non_zero)\n{\n\t// returns 1 iff word changed\n\t// sets was_non_zero (when something changed)\n\tuint64_t old = *word;\n\tuint64_t new = BIT_SET(old, bit);\n\tif (old == new) {\n\t\treturn 0;\n\t}\n\t*word = new;\n\t*was_non_zero = old != 0;\n\treturn 1;\n}\n\nSTATIC_INLINE bool\nword_set_bit_go_down(uint64_t *word, unsigned bit)\n{\n\t// returns 1 iff level below should be set too\n\tuint64_t old = *word;\n\tuint64_t new = BIT_SET(old, bit);\n\tif (old == new) {\n\t\treturn 0;\n\t}\n\t*word = new;\n\treturn !old;\n}\n\nSTATIC_INLINE void\nword_zap_bit_simple(uint64_t *word, unsigned bit)\n{\n\tuint64_t old = *word;\n\t*word = BIT_ZAP(old, bit);\n}\n\nSTATIC_INLINE bool\nword_zap_bit_changed(uint64_t *word, unsigned bit)\n{\n\t// returns 1 iff word changed\n\tuint64_t old = *word;\n\tuint64_t new = BIT_ZAP(old, bit);\n\tif (old == new) {\n\t\treturn 0;\n\t}\n\t*word = new;\n\treturn 1;\n}\n\nSTATIC_INLINE bool\nword_zap_bit_changed_go_down(uint64_t *word, unsigned bit, bool *is_now_zero)\n{\n\t// returns 1 iff word changed\n\t// sets is_now_zero (when something changed)\n\tuint64_t old = *word;\n\tuint64_t new = BIT_ZAP(old, bit);\n\tif (old == new) {\n\t\treturn 0;\n\t}\n\t*word = new;\n\t*is_now_zero = !new;\n\treturn 1;\n}\n\nSTATIC_INLINE bool\nword_zap_bit_go_down(uint64_t *word, unsigned bit)\n{\n\t// returns 1 iff level below might require a bit-zeroing\n\tuint64_t old = *word;\n\tuint64_t new = BIT_ZAP(old, bit);\n\tif (old == new) {\n\t\treturn 0;\n\t}\n\t*word = new;\n\treturn !new;\n}\n\n/******************************** Helpers ***************************/\n\n#define NB 9 // number of bits we process at once\n// must be at least 6 (64-bit) and 9 seems the best on x86\n#define MASKNB ((1 << NB) - 1) // to just keep these bits\n#define NUM_64b (1 << (NB - 6)) // number of 64-bit words we process at once\n\n// number of uint64_t of summaries\n#define LEVEL0 (NUM_64b)\n#define LEVEL1 (LEVEL0 + (1 << NB) * NUM_64b)\n#define LEVEL2 (LEVEL1 + (1 << (NB + NB)) * NUM_64b)\n#define LEVEL3 (LEVEL2 + (1 << (NB + NB + NB)) * NUM_64b)\n\n#define MAX_LEVEL 5\n\nstatic const unsigned levels_num_words[] = {\n\t\tLEVEL0, LEVEL1, LEVEL2, LEVEL3}; // this encodes the number of words reserved for the bitmap summaries at various levels\n\nSTATIC_INLINE bool\nGET_SIMPLE(uint64_t *word, unsigned bit)\n{\n\treturn word_get_bit_simple(word + (bit >> 6), bit & 63);\n}\n\nSTATIC_INLINE void\nSET_SIMPLE(uint64_t *word, unsigned bit)\n{\n\tword_set_bit_simple(word + (bit >> 6), bit & 63);\n}\n\nSTATIC_INLINE bool\nSET_CHANGED(uint64_t *word, unsigned bit)\n{\n\t// returns 1 iff word changed\n\treturn word_set_bit_changed(word + (bit >> 6), bit & 63);\n}\n\nSTATIC_INLINE bool\nSET_CHANGED_GO_DOWN(uint64_t *word, unsigned bit, bool *was_non_zero)\n{\n\t// returns 1 iff word changed\n\t// sets was_non_zero (when something changed)\n\treturn word_set_bit_changed_go_down(word + (bit >> 6), bit & 63, was_non_zero);\n}\n\nSTATIC_INLINE bool\nSET_GO_DOWN(uint64_t *word, unsigned bit)\n{\n\t// returns 1 iff level below should be set too\n\treturn word_set_bit_go_down(word + (bit >> 6), bit & 63);\n}\n\nSTATIC_INLINE void\nZAP_SIMPLE(uint64_t *word, unsigned bit)\n{\n\treturn word_zap_bit_simple(word + (bit >> 6), bit & 63);\n}\n\nSTATIC_INLINE bool\nZAP_CHANGED(uint64_t *word, unsigned bit)\n{\n\t// returns 1 iff word changed\n\treturn word_zap_bit_changed(word + (bit >> 6), bit & 63);\n}\n\nSTATIC_INLINE bool\nall_zeros(uint64_t *words)\n{\n\tfor (unsigned w = 0; w < NUM_64b; w++) {\n\t\tif (words[w]) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 1;\n}\n\nSTATIC_INLINE bool\nZAP_CHANGED_GO_DOWN(uint64_t *word, unsigned bit, bool *is_now_zero)\n{\n\t// returns 1 iff word changed\n\t// sets is_now_zero (when something changed)\n\tbool changed = word_zap_bit_changed_go_down(word + (bit >> 6), bit & 63, is_now_zero);\n\tif (changed && (NUM_64b != 1)) {\n\t\t// One component went entirely zero, now examine all components in the level\n\t\tif (!all_zeros(word)) {\n\t\t\t*is_now_zero = 0;\n\t\t}\n\t}\n\treturn changed;\n}\n\nSTATIC_INLINE bool\nZAP_GO_DOWN(uint64_t *word, unsigned bit)\n{\n\t// returns 1 iff level below should be changed too\n\tbool changed = word_zap_bit_go_down(word + (bit >> 6), bit & 63);\n\tif (changed && (NUM_64b != 1)) {\n\t\t// One component went entirely zero, now examine all components in the level\n\t\tif (!all_zeros(word)) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn changed;\n}\n\nSTATIC_INLINE unsigned\nFFS(uint64_t *word)\n{\n// does NUM_64b memory reads, at most\n#if NB == 6\n\treturn __ffsll(*word);\n#else\n\tfor (unsigned w = 0; w < NUM_64b; w++) {\n\t\tunsigned f = __ffsll(word[w]);\n\t\tif (f) {\n\t\t\treturn f + (w << 6);\n\t\t}\n\t}\n\treturn 0;\n#endif\n}\n\n/******************************** Entry Points ***************************/\n\nsize_t\nbitarray_size(unsigned log_size)\n{\n\tassert(log_size <= MAX_LEVEL * NB);\n\tunsigned num = NUM_64b;\n\tif (log_size > NB) {\n\t\tunsigned level = (log_size - NB - 1) / NB;\n\t\tnum = levels_num_words[level] + (1 << (log_size - 6));\n\t}\n\treturn num * sizeof(uint64_t);\n}\n\nbitarray_t\nbitarray_create(unsigned log_size)\n{\n\treturn calloc(1, bitarray_size(log_size));\n}\n\nbool\nbitarray_get(bitarray_t bits, unsigned log_size, index_t index)\n{\n\tassert(log_size <= MAX_LEVEL * NB);\n\tassert(index < (1 << log_size));\n\tif (log_size <= NB) {\n\t\treturn GET_SIMPLE(bits, index);\n\t}\n\tunsigned level = (log_size - NB - 1) / NB;\n\tunsigned bit;\n\tbit = index & MASKNB;\n\tindex >>= NB;\n\treturn GET_SIMPLE(bits + levels_num_words[level] + index * NUM_64b, bit);\n}\n\nbool\nbitarray_set(bitarray_t bits, unsigned log_size, index_t index)\n{\n\t// returns whether changed\n\tassert(log_size <= MAX_LEVEL * NB);\n\tassert(index < (1 << log_size));\n\tif (log_size <= NB) {\n\t\treturn SET_CHANGED(bits, index);\n\t}\n\tunsigned level = (log_size - NB - 1) / NB;\n\tbool was_non_zero;\n\tunsigned bit;\n\tbit = index & MASKNB;\n\tindex >>= NB;\n\t// printf(\"SET_CHANGED_GO_DOWN(bits + %d, %d,…)\\n\", levels_num_words[level] + index, bit);\n\tif (!SET_CHANGED_GO_DOWN(bits + levels_num_words[level] + index * NUM_64b, bit, &was_non_zero)) {\n\t\treturn 0;\n\t}\n\tif (was_non_zero) {\n\t\treturn 1;\n\t}\n\tswitch (level) {\n\tcase 3:\n\t\tbit = index & MASKNB;\n\t\tindex >>= NB;\n\t\tif (!SET_GO_DOWN(bits + LEVEL2 + index * NUM_64b, bit)) {\n\t\t\treturn 1;\n\t\t}\n\t/* no break */\n\tcase 2:\n\t\tbit = index & MASKNB;\n\t\tindex >>= NB;\n\t\tif (!SET_GO_DOWN(bits + LEVEL1 + index * NUM_64b, bit)) {\n\t\t\treturn 1;\n\t\t}\n\t/* no break */\n\tcase 1:\n\t\tbit = index & MASKNB;\n\t\tindex >>= NB;\n\t\tif (!SET_GO_DOWN(bits + LEVEL0 + index * NUM_64b, bit)) {\n\t\t\treturn 1;\n\t\t}\n\t/* no break */\n\tcase 0:\n\t\tSET_SIMPLE(bits, index & MASKNB);\n\t\treturn 1;\n\tdefault:\n\t\tMALLOC_FATAL_ERROR(level, \"invalid bitarray level\");\n\t}\n}\n\nbool\nbitarray_zap(bitarray_t bits, unsigned log_size, index_t index)\n{\n\tassert(log_size <= MAX_LEVEL * NB);\n\tassert(index < (1 << log_size));\n\tif (log_size <= NB) {\n\t\treturn ZAP_CHANGED(bits, index);\n\t}\n\tunsigned level = (log_size - NB - 1) / NB;\n\tbool is_now_zero;\n\tunsigned bit;\n\tbit = index & MASKNB;\n\tindex >>= NB;\n\tif (!ZAP_CHANGED_GO_DOWN(bits + levels_num_words[level] + index * NUM_64b, bit, &is_now_zero)) {\n\t\treturn 0;\n\t}\n\tif (!is_now_zero) {\n\t\treturn 1;\n\t}\n\tswitch (level) {\n\tcase 3:\n\t\tbit = index & MASKNB;\n\t\tindex >>= NB;\n\t\tif (!ZAP_GO_DOWN(bits + LEVEL2 + index * NUM_64b, bit)) {\n\t\t\treturn 1;\n\t\t}\n\t/* no break */\n\tcase 2:\n\t\tbit = index & MASKNB;\n\t\tindex >>= NB;\n\t\tif (!ZAP_GO_DOWN(bits + LEVEL1 + index * NUM_64b, bit)) {\n\t\t\treturn 1;\n\t\t}\n\t/* no break */\n\tcase 1:\n\t\tbit = index & MASKNB;\n\t\tindex >>= NB;\n\t\tif (!ZAP_GO_DOWN(bits + LEVEL0 + index * NUM_64b, bit)) {\n\t\t\treturn 1;\n\t\t}\n\t/* no break */\n\tcase 0:\n\t\tZAP_SIMPLE(bits, index & MASKNB);\n\t\treturn 1;\n\tdefault:\n\t\tMALLOC_FATAL_ERROR(level, \"invalid bitarray level\");\n\t}\n}\n\n// Note in the following macro that \"words\" and \"base\" are variables being written\n#define ADJUST_OFFSET_FOR_FFS(words, base, current_level) \\\n\t{ \\\n\t\twords += (1 << (NB * current_level)) * NUM_64b; \\\n\t\tbase = (base << NB) + FFS(words + base * NUM_64b) - 1; \\\n\t}\n\n// Note in the following macro that \"words\" and \"base\" are variables being written\n#define ADJUST_OFFSET_FOR_FFS_ACROSS_SUMMARIES(words, base, level) \\\n\t{ \\\n\t\tswitch (level) { \\\n\t\tcase 4: \\\n\t\t\tADJUST_OFFSET_FOR_FFS(words, base, 0); \\\n\t\t\tADJUST_OFFSET_FOR_FFS(words, base, 1); \\\n\t\t\tADJUST_OFFSET_FOR_FFS(words, base, 2); \\\n\t\t\tbreak; \\\n\t\tcase 3: \\\n\t\t\tADJUST_OFFSET_FOR_FFS(words, base, 0); \\\n\t\t\tADJUST_OFFSET_FOR_FFS(words, base, 1); \\\n\t\t\tbreak; \\\n\t\tcase 2: \\\n\t\t\tADJUST_OFFSET_FOR_FFS(words, base, 0); \\\n\t\t\tbreak; \\\n\t\tcase 1: \\\n\t\t\tbreak; \\\n\t\tdefault: \\\n\t\t\tMALLOC_FATAL_ERROR(level, \"invalid bitarray level\"); \\\n\t\t} \\\n\t}\n\n// Note in the following macro that \"ix\" and \"bit\" are variables being written\n#define ZAP_SUMMARIES(bits, ix, level) \\\n\t{ \\\n\t\tunsigned bit; \\\n\t\tswitch (level) { \\\n\t\tcase 3: \\\n\t\t\tbit = ix & MASKNB; \\\n\t\t\tix >>= NB; \\\n\t\t\tif (!ZAP_GO_DOWN(bits + LEVEL2 + ix * NUM_64b, bit)) { \\\n\t\t\t\tbreak; \\\n\t\t\t} \\\n\t\tcase 2: \\\n\t\t\tbit = ix & MASKNB; \\\n\t\t\tix >>= NB; \\\n\t\t\tif (!ZAP_GO_DOWN(bits + LEVEL1 + ix * NUM_64b, bit)) { \\\n\t\t\t\tbreak; \\\n\t\t\t} \\\n\t\tcase 1: \\\n\t\t\tbit = ix & MASKNB; \\\n\t\t\tix >>= NB; \\\n\t\t\tif (!ZAP_GO_DOWN(bits + LEVEL0 + ix * NUM_64b, bit)) { \\\n\t\t\t\tbreak; \\\n\t\t\t} \\\n\t\tcase 0: \\\n\t\t\tZAP_SIMPLE(bits, ix &MASKNB); \\\n\t\t\tbreak; \\\n\t\tdefault: \\\n\t\t\tMALLOC_FATAL_ERROR(level, \"invalid bitarray level\"); \\\n\t\t} \\\n\t}\n\nindex_t\nbitarray_first_set(const bitarray_t bits, unsigned log_size)\n{\n\t// return 0 if none set\n\tassert(log_size <= MAX_LEVEL * NB);\n\tuint64_t *words = bits;\n\tunsigned bit = FFS(words);\n\tif (log_size <= NB) {\n\t\treturn bit;\n\t}\n\tif (!bit) {\n\t\treturn 0;\n\t}\n\tunsigned level = (log_size - 1) / NB;\n\tindex_t base = bit - 1; // offset, in number of uin64_t words\n\tADJUST_OFFSET_FOR_FFS_ACROSS_SUMMARIES(words, base, level);\n\twords += (1 << (NB * (level - 1))) * NUM_64b;\n\tbase = (base << NB) + FFS(words + base * NUM_64b) - 1;\n\treturn base + 1; //+1 because bit N is encoded as N+1\n}\n\nbool\nbitarray_zap_first_set(bitarray_t bits, unsigned log_size, index_t *index)\n{\n\tassert(log_size <= MAX_LEVEL * NB);\n\tuint64_t *words = bits;\n\tindex_t ix = FFS(words);\n\tif (!ix) {\n\t\treturn 0;\n\t}\n\tunsigned level = (log_size - 1) / NB;\n\tif (!level) {\n\t\tix--;\n\t\t*index = ix;\n\t\tZAP_SIMPLE(bits, ix);\n\t\treturn 1;\n\t}\n\tindex_t base = ix - 1; // offset, in number of uin64_t words\n\tADJUST_OFFSET_FOR_FFS_ACROSS_SUMMARIES(words, base, level);\n\twords += (1 << (NB * (level - 1))) * NUM_64b;\n\tbase = (base << NB) + FFS(words + base * NUM_64b) - 1;\n\tix = base;\n\t*index = ix;\n\tassert(ix < (1 << log_size));\n\tlevel--;\n\tbool is_now_zero;\n\tunsigned bit;\n\tbit = ix & MASKNB;\n\tix >>= NB;\n\tif (!ZAP_CHANGED_GO_DOWN(bits + levels_num_words[level] + ix * NUM_64b, bit, &is_now_zero)) {\n\t\treturn 1;\n\t}\n\tif (!is_now_zero) {\n\t\treturn 1;\n\t}\n\tZAP_SUMMARIES(bits, ix, level);\n\treturn 1;\n}\n\nstatic unsigned\nFFS_and_zap_word(uint64_t *words, unsigned max, index_t *indices, index_t to_be_added)\n{\n\t// returns the number of bits zapped\n\tunsigned zapped = 0;\n\tfor (unsigned w = 0; w < NUM_64b; w++) {\n\t\tuint64_t word = words[w];\n\t\tif (!word) {\n\t\t\tcontinue;\n\t\t}\n\t\twhile (1) {\n\t\t\tunsigned f = __ffsll(word);\n\t\t\tassert(f);\n\t\t\tf--;\n\t\t\t// printf(\"%d \", f);\n\t\t\tindices[zapped++] = f + (w << 6) + to_be_added;\n\t\t\tword = BIT_ZAP(word, f);\n\t\t\tif (!word) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (zapped >= max) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\twords[w] = word;\n\t\t// printf(\"word=%lld \\n\", word);\n\t\tif (zapped >= max) {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn zapped;\n}\n\nunsigned\nbitarray_zap_first_set_multiple(bitarray_t bits, unsigned log_size, unsigned max, index_t *indices)\n{\n\tassert(log_size <= MAX_LEVEL * NB);\n\tif (log_size <= NB) {\n\t\treturn FFS_and_zap_word(bits, max, indices, 0);\n\t}\n\tunsigned zapped = 0;\n\tunsigned level = (log_size - 1) / NB;\n\twhile (zapped < max) {\n\t\t/*\n\t\t * the lines in loop could be written just as:\n\t\t *\t\tif (! bitarray_zap_first_set(bits, log_size, indices + zapped)) break;\n\t\t *\t\t\tzapped++;\n\t\t * but the code is faster because it wont go up and down in the summaries\n\t\t */\n\t\tuint64_t *words = bits;\n\t\tindex_t ix = FFS(words);\n\t\tif (!ix) {\n\t\t\treturn zapped; // if the top level summary is 0, no bit is set\n\t\t}\n\t\tindex_t base = ix - 1; // offset, in number of uin64_t words\n\t\tADJUST_OFFSET_FOR_FFS_ACROSS_SUMMARIES(words, base, level);\n\t\twords += (1 << (NB * (level - 1))) * NUM_64b; // the beginning of the non-summarized bitarray\n\t\tuint64_t *word = words + base * NUM_64b;\t // the first non-zero word\n\t\tix = base;\n\t\t// the idea here is that we zap a whole bunch of bits at once\n\t\tunsigned z = FFS_and_zap_word(word, max - zapped, indices + zapped, base << NB);\n\t\tassert(z);\n\t\tzapped += z;\n\t\tif ((zapped < max) /* entire word was zapped */ || all_zeros(word) /* partial zap, a priori */) {\n\t\t\t// adjust summaries to reflect all zeros in the bitarray\n\t\t\tZAP_SUMMARIES(bits, ix, level - 1);\n\t\t}\n\t}\n\treturn zapped;\n}\n\n#if 0\n/******************************** Test and debug utilities ***************************/\n\nstatic void print_ones(const uint64_t *bits, unsigned num_big_words) {\n\tunsigned base = 0;\n\tunsigned num = num_big_words * NUM_64b;\n\t// printf(\"In print_ones; num=%d, num_big=%d \\n\", num, num_big_words);\n\twhile (num--) {\n\t\tuint64_t word = *(bits++);\n\t\tif (word) {\n\t\t\tfor (unsigned bit = 0; bit < 64; bit++) {\n\t\t\t\tif (word & (1ULL << bit)) { printf(\"%d \", base + bit); }\n\t\t\t}\n\t\t}\n\t\tbase += 64;\n\t}\n}\n\nvoid bitarray_print(bitarray_t bits, unsigned log_size) {\n\tassert(log_size <= MAX_LEVEL * NB);\n\tprintf(\"bitarray %p log_size=%d\\n\", bits, log_size);\n\tif (log_size > 4 * NB) {\n\t\tprintf(\"Level 4: \"); print_ones(bits, 1); printf(\"\\n\");\n\t\tprintf(\"Level 3: \"); print_ones(bits + LEVEL0, 1 << NB); printf(\"\\n\");\n\t\tprintf(\"Level 2: \"); print_ones(bits + LEVEL1, 1 << NB); printf(\"\\n\");\n\t\tprintf(\"Level 1: \"); print_ones(bits + LEVEL2, 1 << NB); printf(\"\\n\");\n\t\tprintf(\"Level 0: \"); print_ones(bits + LEVEL3, 1 << (log_size - NB)); printf(\"\\n\");\n\t} else if (log_size > 3 * NB) {\n\t\tprintf(\"Level 3: \"); print_ones(bits, 1); printf(\"\\n\");\n\t\tprintf(\"Level 2: \"); print_ones(bits + LEVEL0, 1 << NB); printf(\"\\n\");\n\t\tprintf(\"Level 1: \"); print_ones(bits + LEVEL1, 1 << NB); printf(\"\\n\");\n\t\tprintf(\"Level 0: \"); print_ones(bits + LEVEL2, 1 << (log_size - NB)); printf(\"\\n\");\n\t} else if (log_size > 2 * NB) {\n\t\tprintf(\"Level 2: \"); print_ones(bits, 1); printf(\"\\n\");\n\t\tprintf(\"Level 1: \"); print_ones(bits + LEVEL0, 1 << NB); printf(\"\\n\");\n\t\tprintf(\"Level 0: \"); print_ones(bits + LEVEL1, 1 << (log_size - NB)); printf(\"\\n\");\n\t} else if (log_size > NB) {\n\t\tprintf(\"Level 1: \"); print_ones(bits, 1); printf(\"\\n\");\n\t\tprintf(\"Level 0: \"); print_ones(bits + LEVEL0, 1 << (log_size - NB)); printf(\"\\n\");\n\t} else {\n\t\tprintf(\"Level 0: \"); print_ones(bits, 1); printf(\"\\n\");\n\t}\n}\n\nbool compare_to_truth(bitarray_t bits, unsigned nbits, const bool *truth) {\n\tuint64_t *start = bits;\n\tif (nbits > NB) {\n\t\tunsigned level = (nbits - NB - 1) / NB;\n\t\tstart += levels_num_words[level];\n\t}\n\tbool ok = 1;\n\tfor (unsigned bit = 0; bit < (1 << nbits); bit++) {\n\t\tbool expected = truth[bit];\n\t\tuint64_t word = start[bit >> 6];\n\t\tbool actual = (word >> (bit & 63)) & 1;\n\t\tif (actual != expected) {\n\t\t\tprintf(\"*** # for bit %d, expected=%d actual=%d\\n\", bit, expected, actual);\n\t\t\tok = 0;\n\t\t}\n\t}\n\treturn ok;\n}\n\nunsigned first_set_in_truth(const bool *truth, unsigned log_size) {\n\tfor (unsigned bit = 0; bit < (1 << log_size); bit++) {\n\t\tif (truth[bit]) { return bit + 1; }\n\t}\n\treturn 0;\n}\n\nvoid truth_print(const bool *truth, unsigned log_size) {\n\tprintf(\"Truth: \");\n\tfor (unsigned bit = 0; bit < (1 << log_size); bit++) {\n\t\tif (truth[bit]) { printf(\"%d \", bit); }\n\t}\n\tprintf(\"\\n\");\n}\n#endif\n\n/* vim: set noet:ts=4:sw=4:cindent: */\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/bitarray.h",
"content": "/*\n * Copyright (c) 1999, 2000, 2003, 2005, 2008, 2012 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n * \n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n * \n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n * \n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __BITARRAY_H\n#define __BITARRAY_H\n\ntypedef uint64_t *bitarray_t; // array of bits, assumed to be mostly 0\ntypedef uint32_t index_t; // we limit the number of bits to be a 32-bit quantity\n\n/* A bitarray uses a summarization to be able to quickly say what's the first bit that is set to 1;\n All together each of the entry points will do a very small number of memory access (exact number depends on log_size) */\n\nextern size_t bitarray_size(unsigned log_size);\n // For a bitarray with 1<> 5 identifies the uint32_t to manipulate in the conceptually contiguous bits array\n\t// (index >> 5) << 1 identifies the uint32_t allowing for the actual interleaving\n\tbits[(index >> 5) << 1] |= (1 << (index & 31));\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE void\nBITARRAY_CLR(uint32_t *bits, msize_t index)\n{\n\tbits[(index >> 5) << 1] &= ~(1 << (index & 31));\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE boolean_t\nBITARRAY_BIT(uint32_t *bits, msize_t index)\n{\n\treturn ((bits[(index >> 5) << 1]) >> (index & 31)) & 1;\n}\n\n/* Macros used to manipulate the uint32_t quantity mag_bitmap. */\n\n/* BITMAPV variants are used by tiny. */\n#if defined(__LP64__)\n// assert(NUM_SLOTS == 64) in which case (slot >> 5) is either 0 or 1\n#define BITMAPV_SET(bitmap, slot) (bitmap[(slot) >> 5] |= 1 << ((slot)&31))\n#define BITMAPV_CLR(bitmap, slot) (bitmap[(slot) >> 5] &= ~(1 << ((slot)&31)))\n#define BITMAPV_BIT(bitmap, slot) ((bitmap[(slot) >> 5] >> ((slot)&31)) & 1)\n#define BITMAPV_CTZ(bitmap) (__builtin_ctzl(bitmap))\n#else\n// assert(NUM_SLOTS == 32) in which case (slot >> 5) is always 0, so code it that way\n#define BITMAPV_SET(bitmap, slot) (bitmap[0] |= 1 << (slot))\n#define BITMAPV_CLR(bitmap, slot) (bitmap[0] &= ~(1 << (slot)))\n#define BITMAPV_BIT(bitmap, slot) ((bitmap[0] >> (slot)) & 1)\n#define BITMAPV_CTZ(bitmap) (__builtin_ctz(bitmap))\n#endif\n\n/* BITMAPN is used by small. (slot >> 5) takes on values from 0 to 7. */\n#define BITMAPN_SET(bitmap, slot) (bitmap[(slot) >> 5] |= 1 << ((slot)&31))\n#define BITMAPN_CLR(bitmap, slot) (bitmap[(slot) >> 5] &= ~(1 << ((slot)&31)))\n#define BITMAPN_BIT(bitmap, slot) ((bitmap[(slot) >> 5] >> ((slot)&31)) & 1)\n\n/* returns bit # of least-significant one bit, starting at 0 (undefined if !bitmap) */\n#define BITMAP32_CTZ(bitmap) (__builtin_ctz(bitmap[0]))\n\n#endif // __BITARRAY_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/debug.h",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __DEBUG_H\n#define __DEBUG_H\n\n// set to one to debug malloc itself\n#define DEBUG_MALLOC 0\n// set to one to debug malloc client\n#define DEBUG_CLIENT 0\n#define DEBUG_MADVISE 0\n\n#if DEBUG_MALLOC\n# warning DEBUG_MALLOC ENABLED\n# undef MALLOC_INLINE\n# undef MALLOC_UNUSED\n# undef MALLOC_ALWAYS_INLINE\n# undef CHECK_MAGAZINE_PTR_LOCKED\n\n# define MALLOC_INLINE\n# define MALLOC_UNUSED\n# define MALLOC_ALWAYS_INLINE\n# define CHECK_MAGAZINE_PTR_LOCKED(szone, mag_ptr, fun)\t\t\t\t\\\n\tdo {\t\t\t\t\t\t\t\t\t\t\\\n\t if (TRY_LOCK(mag_ptr->magazine_lock)) {\t\t\t\t\t\\\n\t\tmalloc_report(ASL_LEVEL_ERR, \"*** magazine_lock was not set %p in %s\\n\",\t\t\\\n\t\tmag_ptr->magazine_lock, fun);\t\t\t\t\t\t\\\n\t }\t\t\t\t\t\t\t\t\t\t\\\n\t} while (0)\n#endif // DEBUG_MALLOC\n\n#if DEBUG_MALLOC || DEBUG_CLIENT\n#\tdefine CHECK(szone, fun) \\\n\tif ((szone)->debug_flags & CHECK_REGIONS) { \\\n\t\tszone_check_all(szone, fun) \\\n\t}\n#else // DEBUG_MALLOC || DEBUG_CLIENT\n#\tdefine CHECK(szone, fun) \\\n\tdo {} while (0)\n#endif // DEBUG_MALLOC || DEBUG_CLIENT\n\n#endif // __DEBUG_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/dtrace.h",
"content": "/*\n * Copyright (c) 2016 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __DTRACE_H\n#define __DTRACE_H\n\n#ifndef DARWINTEST\n#include \"magmallocProvider.h\"\n#else\n#define\tMAGMALLOC_ALLOCREGION(arg0, arg1, arg2, arg3)\n#define\tMAGMALLOC_ALLOCREGION_ENABLED() (0)\n#define\tMAGMALLOC_DEALLOCREGION(arg0, arg1, arg2)\n#define\tMAGMALLOC_DEALLOCREGION_ENABLED() (0)\n#define\tMAGMALLOC_DEPOTREGION(arg0, arg1, arg2, arg3, arg4)\n#define\tMAGMALLOC_DEPOTREGION_ENABLED() (0)\n#define\tMAGMALLOC_MADVFREEREGION(arg0, arg1, arg2, arg3)\n#define\tMAGMALLOC_MADVFREEREGION_ENABLED() (0)\n#define\tMAGMALLOC_MALLOCERRORBREAK()\n#define\tMAGMALLOC_MALLOCERRORBREAK_ENABLED() (0)\n#define\tMAGMALLOC_PRESSURERELIEFBEGIN(arg0, arg1, arg2)\n#define\tMAGMALLOC_PRESSURERELIEFBEGIN_ENABLED() (0)\n#define\tMAGMALLOC_PRESSURERELIEFEND(arg0, arg1, arg2, arg3)\n#define\tMAGMALLOC_PRESSURERELIEFEND_ENABLED() (0)\n#define\tMAGMALLOC_RECIRCREGION(arg0, arg1, arg2, arg3, arg4)\n#define\tMAGMALLOC_RECIRCREGION_ENABLED() (0)\n#define\tMAGMALLOC_REFRESHINDEX(arg0, arg1, arg2)\n#define\tMAGMALLOC_REFRESHINDEX_ENABLED() (0)\n#endif\n\n#endif // __DTRACE_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/empty.s",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n/*\n * This file exists to force clang+ld to produce an link-time optimised\n * master object file that contains no bitcode when it is laid down on\n * disk.\n *\n * Adding a non-LTO assembly file to the link step forces ld to perform\n * LTO and produce the master object file.\n */\n\nempty:\n\tnop\n\n.subsections_via_symbols\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/frozen_malloc.c",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#include \"internal.h\"\n\n/********* Support code for emacs unexec ************/\n\n/* History of freezedry version numbers:\n *\n * 1) Old malloc (before the scalable malloc implementation in this file\n * existed).\n * 2) Original freezedrying code for scalable malloc. This code was apparently\n * based on the old freezedrying code and was fundamentally flawed in its\n * assumption that tracking allocated memory regions was adequate to fake\n * operations on freezedried memory. This doesn't work, since scalable\n * malloc does not store flags in front of large page-aligned allocations.\n * 3) Original szone-based freezedrying code.\n * 4) Fresher malloc with tiny zone\n * 5) 32/64bit compatible malloc\n * 6) Metadata within 1MB and 8MB region for tiny and small\n *\n * No version backward compatibility is provided, but the version number does\n * make it possible for malloc_jumpstart() to return an error if the application\n * was freezedried with an older version of malloc.\n */\n#define MALLOC_FREEZEDRY_VERSION 6\n\ntypedef struct {\n\tunsigned version;\n\tunsigned nszones;\n\tszone_t *szones;\n} malloc_frozen;\n\nstatic void *\nfrozen_malloc(szone_t *zone, size_t new_size)\n{\n\treturn malloc(new_size);\n}\n\nstatic void *\nfrozen_calloc(szone_t *zone, size_t num_items, size_t size)\n{\n\treturn calloc(num_items, size);\n}\n\nstatic void *\nfrozen_valloc(szone_t *zone, size_t new_size)\n{\n\treturn valloc(new_size);\n}\n\nstatic void *\nfrozen_realloc(szone_t *zone, void *ptr, size_t new_size)\n{\n\tsize_t old_size = szone_size(zone, ptr);\n\tvoid *new_ptr;\n\n\tif (new_size <= old_size) {\n\t\treturn ptr;\n\t}\n\tnew_ptr = malloc(new_size);\n\tif (old_size > 0) {\n\t\tmemcpy(new_ptr, ptr, old_size);\n\t}\n\treturn new_ptr;\n}\n\nstatic void\nfrozen_free(szone_t *zone, void *ptr)\n{\n}\n\nstatic void\nfrozen_destroy(szone_t *zone)\n{\n}\n\n/********* Pseudo-private API for emacs unexec ************/\n\n/*\n * malloc_freezedry() records all of the szones in use, so that they can be\n * partially reconstituted by malloc_jumpstart(). Due to the differences\n * between reconstituted memory regions and those created by the szone code,\n * care is taken not to reallocate from the freezedried memory, except in the\n * case of a non-growing realloc().\n *\n * Due to the flexibility provided by the zone registration mechanism, it is\n * impossible to implement generic freezedrying for any zone type. This code\n * only handles applications that use the szone allocator, so malloc_freezedry()\n * returns 0 (error) if any non-szone zones are encountered.\n */\n\nuintptr_t\nmalloc_freezedry(void)\n{\n\textern unsigned malloc_num_zones;\n\textern malloc_zone_t **malloc_zones;\n\tmalloc_frozen *data;\n\tunsigned i;\n\n\t/* Allocate space in which to store the freezedry state. */\n\tdata = (malloc_frozen *)malloc(sizeof(malloc_frozen));\n\n\t/* Set freezedry version number so that malloc_jumpstart() can check for compatibility. */\n\tdata->version = MALLOC_FREEZEDRY_VERSION;\n\n\t/* Allocate the array of szone pointers. */\n\tdata->nszones = malloc_num_zones;\n\tdata->szones = (szone_t *)calloc(malloc_num_zones, sizeof(szone_t));\n\n\t/*\n\t * Fill in the array of szone structures. They are copied rather than\n\t * referenced, since the originals are likely to be clobbered during malloc\n\t * initialization.\n\t */\n\tfor (i = 0; i < malloc_num_zones; i++) {\n\t\tif (strcmp(malloc_zones[i]->zone_name, \"DefaultMallocZone\")) {\n\t\t\t/* Unknown zone type. */\n\t\t\tfree(data->szones);\n\t\t\tfree(data);\n\t\t\treturn 0;\n\t\t}\n\t\tmemcpy(&data->szones[i], malloc_zones[i], sizeof(szone_t));\n\t}\n\n\treturn ((uintptr_t)data);\n}\n\nint\nmalloc_jumpstart(uintptr_t cookie)\n{\n\tmalloc_frozen *data = (malloc_frozen *)cookie;\n\tunsigned i;\n\n\tif (data->version != MALLOC_FREEZEDRY_VERSION) {\n\t\t/* Unsupported freezedry version. */\n\t\treturn 1;\n\t}\n\n\tfor (i = 0; i < data->nszones; i++) {\n\t\t/* Set function pointers. Even the functions that stay the same must be\n\t\t * set, since there are no guarantees that they will be mapped to the\n\t\t * same addresses. */\n\t\tdata->szones[i].basic_zone.size = (void *)szone_size;\n\t\tdata->szones[i].basic_zone.malloc = (void *)frozen_malloc;\n\t\tdata->szones[i].basic_zone.calloc = (void *)frozen_calloc;\n\t\tdata->szones[i].basic_zone.valloc = (void *)frozen_valloc;\n\t\tdata->szones[i].basic_zone.free = (void *)frozen_free;\n\t\tdata->szones[i].basic_zone.realloc = (void *)frozen_realloc;\n\t\tdata->szones[i].basic_zone.destroy = (void *)frozen_destroy;\n\t\tdata->szones[i].basic_zone.introspect = (struct malloc_introspection_t *)&szone_introspect;\n\n\t\t/* Register the freezedried zone. */\n\t\tmalloc_zone_register(&data->szones[i].basic_zone);\n\t}\n\n\treturn 0;\n}\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/frozen_malloc.h",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n\n#ifndef __FROZEN_MALLOC_H\n#define __FROZEN_MALLOC_H\n\nMALLOC_EXPORT\nuintptr_t\nmalloc_freezedry(void);\n\nMALLOC_EXPORT\nint\nmalloc_jumpstart(uintptr_t cookie);\n\n#endif // __FROZEN_MALLOC_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/internal.h",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __INTERNAL_H\n#define __INTERNAL_H\n\n#define __OS_EXPOSE_INTERNALS__ 1\n\n#include \n#include \n#include <_simple.h>\n#include \n#undef memcpy\n#define memcpy _platform_memmove\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"dtrace.h\"\n\n#include \"base.h\"\n#include \"trace.h\"\n#include \"platform.h\"\n#include \"debug.h\"\n#include \"locking.h\"\n#include \"bitarray.h\"\n#include \"malloc.h\"\n#include \"printf.h\"\n#include \"frozen_malloc.h\"\n#include \"legacy_malloc.h\"\n#include \"magazine_malloc.h\"\n#include \"malloc_common.h\"\n#include \"nano_malloc_common.h\"\n#include \"nano_malloc.h\"\n#include \"nanov2_malloc.h\"\n#include \"purgeable_malloc.h\"\n#include \"malloc_private.h\"\n#include \"stack_logging.h\"\n#include \"stack_logging_internal.h\"\n#include \"thresholds.h\"\n#include \"vm.h\"\n\n#include \"magazine_rack.h\"\n#include \"magazine_zone.h\"\n#include \"nano_zone_common.h\"\n#include \"nano_zone.h\"\n#include \"nanov2_zone.h\"\n\n#include \"magazine_inline.h\"\n\nextern uint64_t malloc_entropy[2];\n\nMALLOC_NOEXPORT\nextern boolean_t malloc_tracing_enabled;\n\nMALLOC_NOEXPORT\nextern unsigned malloc_debug_flags;\n\nMALLOC_NOEXPORT MALLOC_NOINLINE\nvoid\nmalloc_error_break(void);\n\nMALLOC_NOEXPORT MALLOC_NOINLINE MALLOC_USED\nint\nmalloc_gdb_po_unsafe(void);\n\nMALLOC_NOEXPORT\nextern uint64_t max_lite_mallocs;\n\n#endif // __INTERNAL_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/legacy_malloc.c",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#include \"internal.h\"\n\n/*\n * For use by CheckFix: create a new zone whose behavior is, apart from\n * the use of death-row and per-CPU magazines, that of Leopard.\n */\nstatic MALLOC_NOINLINE void *\nlegacy_valloc(szone_t *szone, size_t size)\n{\n\tvoid *ptr;\n\tsize_t num_kernel_pages;\n\n\tnum_kernel_pages = round_page_quanta(size) >> vm_page_quanta_shift;\n\tptr = large_malloc(szone, num_kernel_pages, 0, TRUE);\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"legacy_valloc returned %p\\n\", ptr);\n\t}\n#endif\n\treturn ptr;\n}\n\nmalloc_zone_t *\ncreate_legacy_scalable_zone(size_t initial_size, unsigned debug_flags)\n{\n\t// legacy always uses 32 small slots\n\tmalloc_zone_t *mzone = create_scalable_zone(initial_size, debug_flags & ~MALLOC_EXTENDED_SMALL_SLOTS);\n\tszone_t *szone = (szone_t *)mzone;\n\n\tif (!szone) {\n\t\treturn NULL;\n\t}\n\n\tszone->is_largemem = 0;\n\tszone->large_threshold = (15 * 1024);\n\tszone->vm_copy_threshold = (40 * 1024);\n\n\tmprotect(szone, sizeof(szone->basic_zone), PROT_READ | PROT_WRITE);\n\tszone->basic_zone.valloc = (void *)legacy_valloc;\n\tszone->basic_zone.free_definite_size = NULL;\n\tmprotect(szone, sizeof(szone->basic_zone), PROT_READ);\n\n\treturn mzone;\n}\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/legacy_malloc.h",
"content": "/*\n * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n * \n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n * \n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n * \n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __LEGACY_MALLOC_H\n#define __LEGACY_MALLOC_H\n\nMALLOC_NOEXPORT\nmalloc_zone_t *\ncreate_legacy_scalable_zone(size_t initial_size, unsigned debug_flags);\n\n#endif // __LEGACY_MALLOC_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/locking.h",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __LOCKING_H\n#define __LOCKING_H\n\n#if OS_UNFAIR_LOCK_INLINE\n#define os_unfair_lock_lock_with_options(lock, options) \\\n\t\tos_unfair_lock_lock_with_options_inline(lock, options)\n#define os_unfair_lock_trylock(lock) \\\n\t\tos_unfair_lock_trylock_inline(lock)\n#define os_unfair_lock_unlock(lock) \\\n\t\tos_unfair_lock_unlock_inline(lock)\n#endif // OS_UNFAIR_LOCK_INLINE\n\ntypedef os_unfair_lock _malloc_lock_s;\n#define _MALLOC_LOCK_INIT OS_UNFAIR_LOCK_INIT\n\n__attribute__((always_inline))\nstatic inline void\n_malloc_lock_init(_malloc_lock_s *lock) {\n *lock = OS_UNFAIR_LOCK_INIT;\n}\n\nMALLOC_ALWAYS_INLINE\nstatic inline void\n_malloc_lock_lock(_malloc_lock_s *lock) {\n\treturn os_unfair_lock_lock_with_options(lock,\n\t\t\tOS_UNFAIR_LOCK_DATA_SYNCHRONIZATION);\n}\n\nMALLOC_ALWAYS_INLINE\nstatic inline bool\n_malloc_lock_trylock(_malloc_lock_s *lock) {\n return os_unfair_lock_trylock(lock);\n}\n\nMALLOC_ALWAYS_INLINE\nstatic inline void\n_malloc_lock_unlock(_malloc_lock_s *lock) {\n return os_unfair_lock_unlock(lock);\n}\n\nMALLOC_ALWAYS_INLINE\nstatic inline void\n_malloc_lock_assert_owner(_malloc_lock_s *lock) {\n\tos_unfair_lock_assert_owner(lock);\n}\n\n#endif // __LOCKING_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_inline.h",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __MAGAZINE_INLINE_H\n#define __MAGAZINE_INLINE_H\n\nextern unsigned int _os_cpu_number_override;\n\n/*\n * MALLOC_ABSOLUTE_MAX_SIZE - There are many instances of addition to a\n * user-specified size_t, which can cause overflow (and subsequent crashes)\n * for values near SIZE_T_MAX. Rather than add extra \"if\" checks everywhere\n * this occurs, it is easier to just set an absolute maximum request size,\n * and immediately return an error if the requested size exceeds this maximum.\n * Of course, values less than this absolute max can fail later if the value\n * is still too large for the available memory. The largest value added\n * seems to be PAGE_SIZE (in the macro round_page()), so to be safe, we set\n * the maximum to be 2 * PAGE_SIZE less than SIZE_T_MAX.\n */\n#define MALLOC_ABSOLUTE_MAX_SIZE (SIZE_T_MAX - (2 * PAGE_SIZE))\n\n// Gets the allocation size for a calloc(). Multiples size by num_items and adds\n// extra_size, storing the result in *total_size. Returns 0 on success, -1 (with\n// errno set to ENOMEM) on overflow.\nstatic int MALLOC_INLINE MALLOC_ALWAYS_INLINE\ncalloc_get_size(size_t num_items, size_t size, size_t extra_size, size_t *total_size)\n{\n\tsize_t alloc_size = size;\n\tif (num_items != 1 && (os_mul_overflow(num_items, size, &alloc_size)\n\t\t\t|| alloc_size > MALLOC_ABSOLUTE_MAX_SIZE)) {\n\t\terrno = ENOMEM;\n\t\treturn -1;\n\t}\n\tif (extra_size && (os_add_overflow(alloc_size, extra_size, &alloc_size)\n\t\t\t|| alloc_size > MALLOC_ABSOLUTE_MAX_SIZE)) {\n\t\terrno = ENOMEM;\n\t\treturn -1;\n\t}\n\t*total_size = alloc_size;\n\treturn 0;\n}\n\n/*********************\tFREE LIST UTILITIES ************************/\n\n// A free list entry is comprised of a pair of pointers, previous and next.\n// These are used to implement a doubly-linked list, which permits efficient\n// extraction.\n//\n// Because the free list entries are previously freed objects, a misbehaved\n// program may write to a pointer after it has called free() on that pointer,\n// either by dereference or buffer overflow from an adjacent pointer. This write\n// would then corrupt the free list's previous and next pointers, leading to a\n// crash. In order to detect this case, we take advantage of the fact that\n// malloc'd pointers are known to be at least 16 byte aligned, and thus have\n// at least 4 trailing zero bits.\n//\n// When an entry is added to the free list, a checksum of the previous and next\n// pointers is calculated and written to the high four bits of the respective\n// pointers. Upon detection of an invalid checksum, an error is logged and NULL\n// is returned. Since all code which un-checksums pointers checks for a NULL\n// return, a potentially crashing or malicious dereference is avoided at the\n// cost of leaking the corrupted block, and any subsequent blocks on the free\n// list of that size.\n\n#pragma mark forward decls\n\nstatic MALLOC_INLINE uintptr_t free_list_gen_checksum(uintptr_t ptr) MALLOC_ALWAYS_INLINE;\nstatic MALLOC_INLINE uintptr_t free_list_checksum_ptr(rack_t *rack, void *p) MALLOC_ALWAYS_INLINE;\nstatic MALLOC_INLINE void *free_list_unchecksum_ptr(rack_t *rack, inplace_union *ptr) MALLOC_ALWAYS_INLINE;\nstatic MALLOC_INLINE unsigned free_list_count(rack_t *rack, free_list_t ptr);\n\nstatic MALLOC_INLINE void recirc_list_extract(rack_t *rack, magazine_t *mag_ptr, region_trailer_t *node) MALLOC_ALWAYS_INLINE;\nstatic MALLOC_INLINE void recirc_list_splice_last(rack_t *rack, magazine_t *mag_ptr, region_trailer_t *node) MALLOC_ALWAYS_INLINE;\nstatic MALLOC_INLINE void recirc_list_splice_first(rack_t *rack, magazine_t *mag_ptr, region_trailer_t *node) MALLOC_ALWAYS_INLINE;\n\nstatic MALLOC_INLINE void\nyield(void)\n{\n\tthread_switch(MACH_PORT_NULL, SWITCH_OPTION_DEPRESS, 1);\n}\n\nstatic MALLOC_INLINE kern_return_t\n_szone_default_reader(task_t task, vm_address_t address, vm_size_t size, void **ptr)\n{\n\t*ptr = (void *)address;\n\treturn 0;\n}\n\n#pragma mark helpers\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE\nuint64_t\nplatform_hw_memsize(void)\n{\n#if CONFIG_HAS_COMMPAGE_MEMSIZE\n\treturn *(uint64_t *)(uintptr_t)_COMM_PAGE_MEMORY_SIZE;\n#else\n\tuint64_t hw_memsize = 0;\n\tsize_t uint64_t_size = sizeof(hw_memsize);\n\t// hw_memsize was always 0 if sysctlbyname failed, so preserve that behaviour\n\t(void)sysctlbyname(\"hw.memsize\", &hw_memsize, &uint64_t_size, 0, 0);\n\treturn hw_memsize;\n#endif\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE\nuint32_t\nplatform_cpu_count(void)\n{\n#if CONFIG_HAS_COMMPAGE_NCPUS\n\treturn *(uint8_t *)(uintptr_t)_COMM_PAGE_NCPUS;\n#else\n\treturn sysconf(_SC_NPROCESSORS_CONF);\n#endif\n}\n\n#pragma mark szone locking\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE void\nSZONE_LOCK(szone_t *szone)\n{\n\t_malloc_lock_lock(&szone->large_szone_lock);\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE void\nSZONE_UNLOCK(szone_t *szone)\n{\n\t_malloc_lock_unlock(&szone->large_szone_lock);\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE bool\nSZONE_TRY_LOCK(szone_t *szone)\n{\n\treturn _malloc_lock_trylock(&szone->large_szone_lock);\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE void\nSZONE_REINIT_LOCK(szone_t *szone)\n{\n\t_malloc_lock_init(&szone->large_szone_lock);\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE void\nSZONE_MAGAZINE_PTR_LOCK(magazine_t *mag_ptr)\n{\n\t_malloc_lock_lock(&mag_ptr->magazine_lock);\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE void\nSZONE_MAGAZINE_PTR_UNLOCK(magazine_t *mag_ptr)\n{\n\t_malloc_lock_unlock(&mag_ptr->magazine_lock);\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE bool\nSZONE_MAGAZINE_PTR_TRY_LOCK(magazine_t *mag_ptr)\n{\n\treturn _malloc_lock_trylock(&mag_ptr->magazine_lock);\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE void\nSZONE_MAGAZINE_PTR_REINIT_LOCK(magazine_t *mag_ptr)\n{\n\t_malloc_lock_init(&mag_ptr->magazine_lock);\n}\n\n#pragma mark free list\n\nstatic MALLOC_NOINLINE void\nfree_list_checksum_botch(rack_t *rack, void *ptr, void *value)\n{\n\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\"Incorrect checksum for freed object %p: \"\n\t\t\t\"probably modified after being freed.\\n\"\n\t\t\t\"Corrupt value: %p\\n\", ptr, value);\n}\n\nstatic MALLOC_INLINE uintptr_t\nfree_list_gen_checksum(uintptr_t ptr)\n{\n\tuint8_t chk;\n\n\tchk = (unsigned char)(ptr >> 0);\n\tchk += (unsigned char)(ptr >> 8);\n\tchk += (unsigned char)(ptr >> 16);\n\tchk += (unsigned char)(ptr >> 24);\n#if __LP64__\n\tchk += (unsigned char)(ptr >> 32);\n\tchk += (unsigned char)(ptr >> 40);\n\tchk += (unsigned char)(ptr >> 48);\n\tchk += (unsigned char)(ptr >> 56);\n#endif\n\n\treturn chk;\n}\n\nstatic unsigned\nfree_list_count(rack_t *rack, free_list_t ptr)\n{\n\tunsigned count = 0;\n\n\twhile (ptr.p) {\n\t\tcount++;\n\t\tptr.p = free_list_unchecksum_ptr(rack, &ptr.inplace->next);\n\t}\n\treturn count;\n}\n\n#define NYBBLE 4\n#if __LP64__\n#define ANTI_NYBBLE (64 - NYBBLE)\n#else\n#define ANTI_NYBBLE (32 - NYBBLE)\n#endif\n\nstatic MALLOC_INLINE uintptr_t\nfree_list_checksum_ptr(rack_t *rack, void *ptr)\n{\n\tuintptr_t p = (uintptr_t)ptr;\n\treturn (p >> NYBBLE) | ((free_list_gen_checksum(p ^ rack->cookie) & (uintptr_t)0xF) << ANTI_NYBBLE); // compiles to rotate instruction\n}\n\nstatic MALLOC_INLINE void *\nfree_list_unchecksum_ptr(rack_t *rack, inplace_union *ptr)\n{\n\tinplace_union p;\n\tuintptr_t t = ptr->u;\n\n\tt = (t << NYBBLE) | (t >> ANTI_NYBBLE); // compiles to rotate instruction\n\tp.u = t & ~(uintptr_t)0xF;\n\n\tif ((t ^ free_list_gen_checksum(p.u ^ rack->cookie)) & (uintptr_t)0xF) {\n\t\tfree_list_checksum_botch(rack, ptr, (void *)ptr->u);\n\t\t__builtin_trap();\n\t}\n\treturn p.p;\n}\n\n#undef ANTI_NYBBLE\n#undef NYBBLE\n\n#pragma mark recirc helpers\n\nstatic MALLOC_INLINE void\nrecirc_list_extract(rack_t *rack, magazine_t *mag_ptr, region_trailer_t *node)\n{\n\t// excise node from list\n\tif (NULL == node->prev) {\n\t\tmag_ptr->firstNode = node->next;\n\t} else {\n\t\tnode->prev->next = node->next;\n\t}\n\n\tif (NULL == node->next) {\n\t\tmag_ptr->lastNode = node->prev;\n\t} else {\n\t\tnode->next->prev = node->prev;\n\t}\n\n\tmag_ptr->recirculation_entries--;\n}\n\nstatic MALLOC_INLINE void\nrecirc_list_splice_last(rack_t *rack, magazine_t *mag_ptr, region_trailer_t *node)\n{\n\tif (NULL == mag_ptr->lastNode) {\n\t\tmag_ptr->firstNode = node;\n\t\tnode->prev = NULL;\n\t} else {\n\t\tnode->prev = mag_ptr->lastNode;\n\t\tmag_ptr->lastNode->next = node;\n\t}\n\tmag_ptr->lastNode = node;\n\tnode->next = NULL;\n\tnode->recirc_suitable = FALSE;\n\tmag_ptr->recirculation_entries++;\n}\n\nstatic MALLOC_INLINE void\nrecirc_list_splice_first(rack_t *rack, magazine_t *mag_ptr, region_trailer_t *node)\n{\n\tif (NULL == mag_ptr->firstNode) {\n\t\tmag_ptr->lastNode = node;\n\t\tnode->next = NULL;\n\t} else {\n\t\tnode->next = mag_ptr->firstNode;\n\t\tmag_ptr->firstNode->prev = node;\n\t}\n\tmag_ptr->firstNode = node;\n\tnode->prev = NULL;\n\tnode->recirc_suitable = FALSE;\n\tmag_ptr->recirculation_entries++;\n}\n\n/*******************************************************************************\n * Region hash implementation\n *\n * This is essentially a duplicate of the existing Large allocator hash, minus\n * the ability to remove entries. The two should be combined eventually.\n ******************************************************************************/\n#pragma mark region hash\n\n/*\n * hash_lookup_region_no_lock - Scan a hash ring looking for an entry for a\n * given region.\n *\n * FIXME: If consecutive queries of the same region are likely, a one-entry\n * cache would likely be a significant performance win here.\n */\nstatic MALLOC_INLINE rgnhdl_t\nhash_lookup_region_no_lock(region_t *regions, size_t num_entries, size_t shift, region_t r)\n{\n\tsize_t index, hash_index;\n\trgnhdl_t entry;\n\n\tif (!num_entries) {\n\t\treturn 0;\n\t}\n\n\t// Multiplicative hash where the multiplier is a prime near (ULONG_MAX / phi). [phi = 1.618033...]\n\t// Since the values of (((uintptr_t)r >> HASH_BLOCKS_ALIGN) are (roughly) an ascending sequence of integers,\n\t// this hash works really well. See Knuth TAOCP, Vol. 3.\n#if __LP64__\n\tindex = hash_index = (((uintptr_t)r >> HASH_BLOCKS_ALIGN) * 11400714819323198549ULL) >> (64 - shift);\n#else\n\tindex = hash_index = (((uintptr_t)r >> HASH_BLOCKS_ALIGN) * 2654435761UL) >> (32 - shift);\n#endif\n\tdo {\n\t\tentry = regions + index;\n\t\tif (*entry == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tif (*entry == r) {\n\t\t\treturn entry;\n\t\t}\n\t\tif (++index == num_entries) {\n\t\t\tindex = 0;\n\t\t}\n\t} while (index != hash_index);\n\treturn 0;\n}\n\n/*\n * hash_region_insert_no_lock - Insert a region into the hash ring.\n */\nstatic void\nhash_region_insert_no_lock(region_t *regions, size_t num_entries, size_t shift, region_t r)\n{\n\tsize_t index, hash_index;\n\trgnhdl_t entry;\n\n\t// Multiplicative hash where the multiplier is a prime near (ULONG_MAX / phi). [phi = 1.618033...]\n\t// Since the values of (((uintptr_t)r >> HASH_BLOCKS_ALIGN) are (roughly) an ascending sequence of integers,\n\t// this hash works really well. See Knuth TAOCP, Vol. 3.\n#if __LP64__\n\tindex = hash_index = (((uintptr_t)r >> HASH_BLOCKS_ALIGN) * 11400714819323198549ULL) >> (64 - shift);\n#else\n\tindex = hash_index = (((uintptr_t)r >> HASH_BLOCKS_ALIGN) * 2654435761UL) >> (32 - shift);\n#endif\n\tdo {\n\t\tentry = regions + index;\n\t\tif (*entry == HASHRING_OPEN_ENTRY || *entry == HASHRING_REGION_DEALLOCATED) {\n\t\t\t*entry = r;\n\t\t\treturn;\n\t\t}\n\t\tif (++index == num_entries) {\n\t\t\tindex = 0;\n\t\t}\n\t} while (index != hash_index);\n}\n\n/*\n * hash_regions_alloc_no_lock - Allocate space for a number of entries. This\n * must be a VM allocation as to avoid recursing between allocating a new small\n * region, and asking the small region to allocate space for the new list of\n * regions.\n */\nstatic region_t *\nhash_regions_alloc_no_lock(size_t num_entries)\n{\n\tsize_t size = num_entries * sizeof(region_t);\n\treturn mvm_allocate_pages(round_page_quanta(size), 0, 0, VM_MEMORY_MALLOC);\n}\n\n/*\n * hash_regions_grow_no_lock - Grow the hash ring, and rehash the entries.\n * Return the new region and new size to update the szone. Do not deallocate\n * the old entries since someone may still be allocating them.\n */\nstatic MALLOC_INLINE region_t *\nhash_regions_grow_no_lock(region_t *regions, size_t old_size, size_t *mutable_shift, size_t *new_size)\n{\n\t// double in size and allocate memory for the regions\n\t*new_size = old_size + old_size;\n\t*mutable_shift = *mutable_shift + 1;\n\tregion_t *new_regions = hash_regions_alloc_no_lock(*new_size);\n\n\t// rehash the entries into the new list\n\tsize_t index;\n\tfor (index = 0; index < old_size; ++index) {\n\t\tregion_t r = regions[index];\n\t\tif (r != HASHRING_OPEN_ENTRY && r != HASHRING_REGION_DEALLOCATED) {\n\t\t\thash_region_insert_no_lock(new_regions, *new_size, *mutable_shift, r);\n\t\t}\n\t}\n\treturn new_regions;\n}\n\n#pragma mark mag index\n\n/*\n * These commpage routines provide fast access to the logical cpu number\n * of the calling processor assuming no pre-emption occurs.\n */\n\nextern unsigned int hyper_shift;\nextern unsigned int phys_ncpus;\nextern unsigned int logical_ncpus;\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE\nunsigned int\nmag_max_magazines(void)\n{\n return max_magazines;\n}\n\n#pragma mark mag lock\n\nstatic MALLOC_INLINE magazine_t *\nmag_lock_zine_for_region_trailer(magazine_t *magazines, region_trailer_t *trailer, mag_index_t mag_index)\n{\n\tmag_index_t refreshed_index;\n\tmagazine_t *mag_ptr = &(magazines[mag_index]);\n\n\t// Take the lock on entry.\n\tSZONE_MAGAZINE_PTR_LOCK(mag_ptr);\n\n\t// Now in the time it took to acquire the lock, the region may have migrated\n\t// from one magazine to another. In which case the magazine lock we obtained\n\t// (namely magazines[mag_index].mag_lock) is stale. If so, keep on tryin' ...\n\twhile (mag_index != (refreshed_index = trailer->mag_index)) { // Note assignment\n\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(mag_ptr);\n\n\t\tmag_index = refreshed_index;\n\t\tmag_ptr = &(magazines[mag_index]);\n\t\tSZONE_MAGAZINE_PTR_LOCK(mag_ptr);\n\t}\n\n\treturn mag_ptr;\n}\n\n#pragma mark tiny allocator\n\n/*\n * tiny_region_for_ptr_no_lock - Returns the tiny region containing the pointer,\n * or NULL if not found.\n */\nstatic MALLOC_INLINE region_t\ntiny_region_for_ptr_no_lock(rack_t *rack, const void *ptr)\n{\n\trgnhdl_t r = hash_lookup_region_no_lock(rack->region_generation->hashed_regions,\n\t\t\track->region_generation->num_regions_allocated,\n\t\t\track->region_generation->num_regions_allocated_shift,\n\t\t\tTINY_REGION_FOR_PTR(ptr));\n\n\treturn r ? *r : r;\n}\n\n/*\n * Obtain the size of a free tiny block (in msize_t units).\n */\nstatic msize_t\nget_tiny_free_size(const void *ptr)\n{\n\tvoid *next_block = (void *)((uintptr_t)ptr + TINY_QUANTUM);\n\tvoid *region_end = TINY_REGION_END(TINY_REGION_FOR_PTR(ptr));\n\n\t// check whether the next block is outside the tiny region or a block header\n\t// if so, then the size of this block is one, and there is no stored size.\n\tif (next_block < region_end) {\n\t\tuint32_t *next_header = TINY_BLOCK_HEADER_FOR_PTR(next_block);\n\t\tmsize_t next_index = TINY_INDEX_FOR_PTR(next_block);\n\n\t\tif (!BITARRAY_BIT(next_header, next_index)) {\n\t\t\treturn TINY_FREE_SIZE(ptr);\n\t\t}\n\t}\n\treturn 1;\n}\n\nstatic MALLOC_INLINE msize_t\nget_tiny_meta_header(const void *ptr, boolean_t *is_free)\n{\n\t// returns msize and is_free\n\t// may return 0 for the msize component (meaning 65536)\n\tuint32_t *block_header;\n\tmsize_t index;\n\n\tblock_header = TINY_BLOCK_HEADER_FOR_PTR(ptr);\n\tindex = TINY_INDEX_FOR_PTR(ptr);\n\n\tmsize_t midx = (index >> 5) << 1;\n\tuint32_t mask = 1 << (index & 31);\n\t*is_free = 0;\n\tif (0 == (block_header[midx] & mask)) { // if (!BITARRAY_BIT(block_header, index))\n\t\treturn 0;\n\t}\n\tif (0 == (block_header[midx + 1] & mask)) { // if (!BITARRAY_BIT(in_use, index))\n\t\t*is_free = 1;\n\t\treturn get_tiny_free_size(ptr);\n\t}\n\n\t// index >> 5 identifies the uint32_t to manipulate in the conceptually contiguous bits array\n\t// (index >> 5) << 1 identifies the uint32_t allowing for the actual interleaving\n#if defined(__LP64__)\n\t// The return value, msize, is computed as the distance to the next 1 bit in block_header.\n\t// That's guaranteed to be somewhere in the next 64 bits. And those bits could span three\n\t// uint32_t block_header elements. Collect the bits into a single uint64_t and measure up with ffsl.\n\tuint32_t *addr = ((uint32_t *)block_header) + ((index >> 5) << 1);\n\tuint32_t bitidx = index & 31;\n\tuint64_t word_lo = addr[0];\n\tuint64_t word_mid = addr[2];\n\tuint64_t word_hi = addr[4];\n\tuint64_t word_lomid = (word_lo >> bitidx) | (word_mid << (32 - bitidx));\n\tuint64_t word = bitidx ? word_lomid | (word_hi << (64 - bitidx)) : word_lomid;\n\tuint32_t result = __builtin_ffsl(word >> 1);\n#else\n\t// The return value, msize, is computed as the distance to the next 1 bit in block_header.\n\t// That's guaranteed to be somewhere in the next 32 bits. And those bits could span two\n\t// uint32_t block_header elements. Collect the bits into a single uint32_t and measure up with ffs.\n\tuint32_t *addr = ((uint32_t *)block_header) + ((index >> 5) << 1);\n\tuint32_t bitidx = index & 31;\n\tuint32_t word = bitidx ? (addr[0] >> bitidx) | (addr[2] << (32 - bitidx)) : addr[0];\n\tuint32_t result = __builtin_ffs(word >> 1);\n#endif\n\treturn result;\n}\n\n#pragma mark small allocator\n\n/*\n * small_region_for_ptr_no_lock - Returns the small region containing the pointer,\n * or NULL if not found.\n */\nstatic MALLOC_INLINE region_t\nsmall_region_for_ptr_no_lock(rack_t *rack, const void *ptr)\n{\n\trgnhdl_t r = hash_lookup_region_no_lock(rack->region_generation->hashed_regions,\n\t\t\track->region_generation->num_regions_allocated, rack->region_generation->num_regions_allocated_shift,\n\t\t\tSMALL_REGION_FOR_PTR(ptr));\n\treturn r ? *r : r;\n}\n\n#endif // __MAGAZINE_INLINE_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_large.c",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#include \"internal.h\"\n\n#if DEBUG_MALLOC\nstatic void\nlarge_debug_print(szone_t *szone)\n{\n\tunsigned index;\n\tlarge_entry_t *range;\n\t_SIMPLE_STRING b = _simple_salloc();\n\n\tif (b) {\n\t\tfor (index = 0, range = szone->large_entries; index < szone->num_large_entries; index++, range++) {\n\t\t\tif (range->address) {\n\t\t\t\t_simple_sprintf(b, \"%d: %p(%y); \", index, range->address, range->size);\n\t\t\t}\n\t\t}\n\n\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%s\\n\", _simple_string(b));\n\t\t_simple_sfree(b);\n\t}\n}\n#endif\n\n/*\n * Scan the hash ring looking for an entry containing a given pointer.\n */\nstatic large_entry_t *\nlarge_entry_containing_pointer_no_lock(szone_t *szone, const void *ptr)\n{\n\t// result only valid with lock held\n\tunsigned num_large_entries = szone->num_large_entries;\n\tunsigned hash_index;\n\tunsigned index;\n\tlarge_entry_t *range;\n\n\tif (!num_large_entries) {\n\t\treturn NULL;\n\t}\n\n\thash_index = ((uintptr_t)ptr >> vm_page_quanta_shift) % num_large_entries;\n\tindex = hash_index;\n\n\tdo {\n\t\trange = szone->large_entries + index;\n\t\tif (range->address == (vm_address_t)ptr) {\n\t\t\treturn range;\n\t\t} else if ((vm_address_t)ptr >= range->address\n\t\t\t\t&& (vm_address_t)ptr < range->address + range->size) {\n\t\t\treturn range;\n\t\t}\n\n\t\t// Since we may be looking for an inner pointer, we might not get an\n\t\t// exact match on the address, so we need to scan further and to skip\n\t\t// over empty entries. It will usually be faster to scan backwards.\n\t\tindex = index == 0 ? num_large_entries - 1 : index - 1;\n\t} while (index != hash_index);\n\n\treturn NULL;\n}\n\n/*\n * Scan the hash ring looking for an entry for the given pointer.\n */\nlarge_entry_t *\nlarge_entry_for_pointer_no_lock(szone_t *szone, const void *ptr)\n{\n\t// result only valid with lock held\n\tunsigned num_large_entries = szone->num_large_entries;\n\tunsigned hash_index;\n\tunsigned index;\n\tlarge_entry_t *range;\n\n\tif (!num_large_entries) {\n\t\treturn NULL;\n\t}\n\n\thash_index = ((uintptr_t)ptr >> vm_page_quanta_shift) % num_large_entries;\n\tindex = hash_index;\n\n\tdo {\n\t\trange = szone->large_entries + index;\n\t\tif (range->address == (vm_address_t)ptr) {\n\t\t\treturn range;\n\t\t}\n\t\tif (0 == range->address) {\n\t\t\treturn NULL; // end of chain\n\t\t}\n\t\tindex++;\n\t\tif (index == num_large_entries) {\n\t\t\tindex = 0;\n\t\t}\n\t} while (index != hash_index);\n\n\treturn NULL;\n}\n\nstatic void\nlarge_entry_insert_no_lock(szone_t *szone, large_entry_t range)\n{\n\tunsigned num_large_entries = szone->num_large_entries;\n\tunsigned hash_index = (((uintptr_t)(range.address)) >> vm_page_quanta_shift) % num_large_entries;\n\tunsigned index = hash_index;\n\tlarge_entry_t *entry;\n\n\t// assert(szone->num_large_objects_in_use < szone->num_large_entries); /* must be called with room to spare */\n\n\tdo {\n\t\tentry = szone->large_entries + index;\n\t\tif (0 == entry->address) {\n\t\t\t*entry = range;\n\t\t\treturn; // end of chain\n\t\t}\n\t\tindex++;\n\t\tif (index == num_large_entries) {\n\t\t\tindex = 0;\n\t\t}\n\t} while (index != hash_index);\n\n\t// assert(0); /* must not fallthrough! */\n}\n\n// FIXME: can't we simply swap the (now empty) entry with the last entry on the collision chain for this hash slot?\nstatic MALLOC_INLINE void\nlarge_entries_rehash_after_entry_no_lock(szone_t *szone, large_entry_t *entry)\n{\n\tunsigned num_large_entries = szone->num_large_entries;\n\tuintptr_t hash_index = entry - szone->large_entries;\n\tuintptr_t index = hash_index;\n\tlarge_entry_t range;\n\n\t// assert(entry->address == 0) /* caller must have cleared *entry */\n\n\tdo {\n\t\tindex++;\n\t\tif (index == num_large_entries) {\n\t\t\tindex = 0;\n\t\t}\n\t\trange = szone->large_entries[index];\n\t\tif (0 == range.address) {\n\t\t\treturn;\n\t\t}\n\t\tszone->large_entries[index].address = (vm_address_t)0;\n\t\tszone->large_entries[index].size = 0;\n\t\tszone->large_entries[index].did_madvise_reusable = FALSE;\n\t\tlarge_entry_insert_no_lock(szone, range); // this will reinsert in the\n\t\t// proper place\n\t} while (index != hash_index);\n\n\t// assert(0); /* since entry->address == 0, must not fallthrough! */\n}\n\n// FIXME: num should probably be a size_t, since you can theoretically allocate\n// more than 2^32-1 large_threshold objects in 64 bit.\nstatic MALLOC_INLINE large_entry_t *\nlarge_entries_alloc_no_lock(unsigned num)\n{\n\tsize_t size = num * sizeof(large_entry_t);\n\n\t// Note that we allocate memory (via a system call) under a spin lock\n\t// That is certainly evil, however it's very rare in the lifetime of a process\n\t// The alternative would slow down the normal case\n\treturn mvm_allocate_pages(round_page_quanta(size), 0, 0, VM_MEMORY_MALLOC_LARGE);\n}\n\nvoid\nlarge_entries_free_no_lock(szone_t *szone, large_entry_t *entries, unsigned num, vm_range_t *range_to_deallocate)\n{\n\tsize_t size = num * sizeof(large_entry_t);\n\n\trange_to_deallocate->address = (vm_address_t)entries;\n\trange_to_deallocate->size = round_page_quanta(size);\n}\n\nstatic large_entry_t *\nlarge_entries_grow_no_lock(szone_t *szone, vm_range_t *range_to_deallocate)\n{\n\t// sets range_to_deallocate\n\tunsigned old_num_entries = szone->num_large_entries;\n\tlarge_entry_t *old_entries = szone->large_entries;\n\t// always an odd number for good hashing\n\tunsigned new_num_entries =\n\t(old_num_entries) ? old_num_entries * 2 + 1 : (unsigned)((vm_page_quanta_size / sizeof(large_entry_t)) - 1);\n\tlarge_entry_t *new_entries = large_entries_alloc_no_lock(new_num_entries);\n\tunsigned index = old_num_entries;\n\tlarge_entry_t oldRange;\n\n\t// if the allocation of new entries failed, bail\n\tif (new_entries == NULL) {\n\t\treturn NULL;\n\t}\n\n\tszone->num_large_entries = new_num_entries;\n\tszone->large_entries = new_entries;\n\n\t/* rehash entries into the new list */\n\twhile (index--) {\n\t\toldRange = old_entries[index];\n\t\tif (oldRange.address) {\n\t\t\tlarge_entry_insert_no_lock(szone, oldRange);\n\t\t}\n\t}\n\n\tif (old_entries) {\n\t\tlarge_entries_free_no_lock(szone, old_entries, old_num_entries, range_to_deallocate);\n\t} else {\n\t\trange_to_deallocate->address = (vm_address_t)0;\n\t\trange_to_deallocate->size = 0;\n\t}\n\n\treturn new_entries;\n}\n\n// frees the specific entry in the size table\n// returns a range to truly deallocate\nstatic vm_range_t\nlarge_entry_free_no_lock(szone_t *szone, large_entry_t *entry)\n{\n\tvm_range_t range;\n\n\tMALLOC_TRACE(TRACE_large_free, (uintptr_t)szone, (uintptr_t)entry->address, entry->size, 0);\n\n\trange.address = entry->address;\n\trange.size = entry->size;\n\n\tif (szone->debug_flags & MALLOC_ADD_GUARD_PAGES) {\n\t\tmvm_protect((void *)range.address, range.size, PROT_READ | PROT_WRITE, szone->debug_flags);\n\t\trange.address -= vm_page_quanta_size;\n\t\trange.size += 2 * vm_page_quanta_size;\n\t}\n\n\tentry->address = 0;\n\tentry->size = 0;\n\tentry->did_madvise_reusable = FALSE;\n\tlarge_entries_rehash_after_entry_no_lock(szone, entry);\n\n#if DEBUG_MALLOC\n\tif (large_entry_for_pointer_no_lock(szone, (void *)range.address)) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"*** freed entry %p still in use; num_large_entries=%d\\n\", range.address, szone->num_large_entries);\n\t\tlarge_debug_print(szone);\n\t\tszone_sleep();\n\t}\n#endif\n\treturn range;\n}\n\nkern_return_t\nlarge_in_use_enumerator(task_t task,\n\t\t\t\t\t\tvoid *context,\n\t\t\t\t\t\tunsigned type_mask,\n\t\t\t\t\t\tvm_address_t large_entries_address,\n\t\t\t\t\t\tunsigned num_entries,\n\t\t\t\t\t\tmemory_reader_t reader,\n\t\t\t\t\t\tvm_range_recorder_t recorder)\n{\n\tunsigned index = 0;\n\tvm_range_t buffer[MAX_RECORDER_BUFFER];\n\tunsigned count = 0;\n\tlarge_entry_t *entries;\n\tkern_return_t err;\n\tvm_range_t range;\n\tlarge_entry_t entry;\n\n\terr = reader(task, large_entries_address, sizeof(large_entry_t) * num_entries, (void **)&entries);\n\tif (err) {\n\t\treturn err;\n\t}\n\n\tindex = num_entries;\n\tif (type_mask & MALLOC_ADMIN_REGION_RANGE_TYPE) {\n\t\trange.address = large_entries_address;\n\t\trange.size = round_page_quanta(num_entries * sizeof(large_entry_t));\n\t\trecorder(task, context, MALLOC_ADMIN_REGION_RANGE_TYPE, &range, 1);\n\t}\n\tif (type_mask & (MALLOC_PTR_IN_USE_RANGE_TYPE | MALLOC_PTR_REGION_RANGE_TYPE)) {\n\t\twhile (index--) {\n\t\t\tentry = entries[index];\n\t\t\tif (entry.address) {\n\t\t\t\trange.address = entry.address;\n\t\t\t\trange.size = entry.size;\n\t\t\t\tbuffer[count++] = range;\n\t\t\t\tif (count >= MAX_RECORDER_BUFFER) {\n\t\t\t\t\trecorder(task, context, MALLOC_PTR_IN_USE_RANGE_TYPE | MALLOC_PTR_REGION_RANGE_TYPE, buffer, count);\n\t\t\t\t\tcount = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (count) {\n\t\trecorder(task, context, MALLOC_PTR_IN_USE_RANGE_TYPE | MALLOC_PTR_REGION_RANGE_TYPE, buffer, count);\n\t}\n\treturn 0;\n}\n\nvoid *\nlarge_malloc(szone_t *szone, size_t num_kernel_pages, unsigned char alignment, boolean_t cleared_requested)\n{\n\tvoid *addr;\n\tvm_range_t range_to_deallocate;\n\tsize_t size;\n\tlarge_entry_t large_entry;\n\n\tMALLOC_TRACE(TRACE_large_malloc, (uintptr_t)szone, num_kernel_pages, alignment, cleared_requested);\n\n\tif (!num_kernel_pages) {\n\t\tnum_kernel_pages = 1; // minimal allocation size for this szone\n\t}\n\tsize = (size_t)num_kernel_pages << vm_page_quanta_shift;\n\trange_to_deallocate.size = 0;\n\trange_to_deallocate.address = 0;\n\n#if CONFIG_LARGE_CACHE\n\tif (size < LARGE_CACHE_SIZE_ENTRY_LIMIT) { // Look for a large_entry_t on the death-row cache?\n\t\tSZONE_LOCK(szone);\n\n\t\tint i, best = -1, idx = szone->large_entry_cache_newest, stop_idx = szone->large_entry_cache_oldest;\n\t\tsize_t best_size = SIZE_T_MAX;\n\n\t\twhile (1) { // Scan large_entry_cache for best fit, starting with most recent entry\n\t\t\tsize_t this_size = szone->large_entry_cache[idx].size;\n\t\t\taddr = (void *)szone->large_entry_cache[idx].address;\n\n\t\t\tif (0 == alignment || 0 == (((uintptr_t)addr) & (((uintptr_t)1 << alignment) - 1))) {\n\t\t\t\tif (size == this_size) { // size match!\n\t\t\t\t\tbest = idx;\n\t\t\t\t\tbest_size = this_size;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (size <= this_size && this_size < best_size) { // improved fit?\n\t\t\t\t\tbest = idx;\n\t\t\t\t\tbest_size = this_size;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (idx == stop_idx) { // exhausted live ring?\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (idx) {\n\t\t\t\tidx--; // bump idx down\n\t\t\t} else {\n\t\t\t\tidx = LARGE_ENTRY_CACHE_SIZE - 1; // wrap idx\n\t\t\t}\n\t\t}\n\n\t\tif (best > -1 && (best_size - size) < size) { // limit fragmentation to 50%\n\t\t\taddr = (void *)szone->large_entry_cache[best].address;\n\t\t\tboolean_t was_madvised_reusable = szone->large_entry_cache[best].did_madvise_reusable;\n\n\t\t\t// Compact live ring to fill entry now vacated at large_entry_cache[best]\n\t\t\t// while preserving time-order\n\t\t\tif (szone->large_entry_cache_oldest < szone->large_entry_cache_newest) {\n\t\t\t\t// Ring hasn't wrapped. Fill in from right.\n\t\t\t\tfor (i = best; i < szone->large_entry_cache_newest; ++i) {\n\t\t\t\t\tszone->large_entry_cache[i] = szone->large_entry_cache[i + 1];\n\t\t\t\t}\n\n\t\t\t\tszone->large_entry_cache_newest--; // Pull in right endpoint.\n\n\t\t\t} else if (szone->large_entry_cache_newest < szone->large_entry_cache_oldest) {\n\t\t\t\t// Ring has wrapped. Arrange to fill in from the contiguous side.\n\t\t\t\tif (best <= szone->large_entry_cache_newest) {\n\t\t\t\t\t// Fill from right.\n\t\t\t\t\tfor (i = best; i < szone->large_entry_cache_newest; ++i) {\n\t\t\t\t\t\tszone->large_entry_cache[i] = szone->large_entry_cache[i + 1];\n\t\t\t\t\t}\n\n\t\t\t\t\tif (0 < szone->large_entry_cache_newest) {\n\t\t\t\t\t\tszone->large_entry_cache_newest--;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tszone->large_entry_cache_newest = LARGE_ENTRY_CACHE_SIZE - 1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// Fill from left.\n\t\t\t\t\tfor (i = best; i > szone->large_entry_cache_oldest; --i) {\n\t\t\t\t\t\tszone->large_entry_cache[i] = szone->large_entry_cache[i - 1];\n\t\t\t\t\t}\n\n\t\t\t\t\tif (szone->large_entry_cache_oldest < LARGE_ENTRY_CACHE_SIZE - 1) {\n\t\t\t\t\t\tszone->large_entry_cache_oldest++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tszone->large_entry_cache_oldest = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\t// By trichotomy, large_entry_cache_newest == large_entry_cache_oldest.\n\t\t\t\t// That implies best == large_entry_cache_newest == large_entry_cache_oldest\n\t\t\t\t// and the ring is now empty.\n\t\t\t\tszone->large_entry_cache[best].address = 0;\n\t\t\t\tszone->large_entry_cache[best].size = 0;\n\t\t\t\tszone->large_entry_cache[best].did_madvise_reusable = FALSE;\n\t\t\t}\n\n\t\t\tif ((szone->num_large_objects_in_use + 1) * 4 > szone->num_large_entries) {\n\t\t\t\t// density of hash table too high; grow table\n\t\t\t\t// we do that under lock to avoid a race\n\t\t\t\tlarge_entry_t *entries = large_entries_grow_no_lock(szone, &range_to_deallocate);\n\t\t\t\tif (entries == NULL) {\n\t\t\t\t\tSZONE_UNLOCK(szone);\n\t\t\t\t\treturn NULL;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlarge_entry.address = (vm_address_t)addr;\n\t\t\tlarge_entry.size = best_size;\n\t\t\tlarge_entry.did_madvise_reusable = FALSE;\n\t\t\tlarge_entry_insert_no_lock(szone, large_entry);\n\n\t\t\tszone->num_large_objects_in_use++;\n\t\t\tszone->num_bytes_in_large_objects += best_size;\n\t\t\tif (!was_madvised_reusable) {\n\t\t\t\tszone->large_entry_cache_reserve_bytes -= best_size;\n\t\t\t}\n\n\t\t\tszone->large_entry_cache_bytes -= best_size;\n\n\t\t\tif (szone->flotsam_enabled && szone->large_entry_cache_bytes < SZONE_FLOTSAM_THRESHOLD_LOW) {\n\t\t\t\tszone->flotsam_enabled = FALSE;\n\t\t\t}\n\n\t\t\tSZONE_UNLOCK(szone);\n\n\t\t\tif (range_to_deallocate.size) {\n\t\t\t\t// we deallocate outside the lock\n\t\t\t\tmvm_deallocate_pages((void *)range_to_deallocate.address, range_to_deallocate.size, 0);\n\t\t\t}\n\n\t\t\tif (cleared_requested) {\n\t\t\t\tmemset(addr, 0, size);\n\t\t\t}\n\n\t\t\treturn addr;\n\t\t} else {\n\t\t\tSZONE_UNLOCK(szone);\n\t\t}\n\t}\n\n\trange_to_deallocate.size = 0;\n\trange_to_deallocate.address = 0;\n#endif /* CONFIG_LARGE_CACHE */\n\n\taddr = mvm_allocate_pages(size, alignment, szone->debug_flags, VM_MEMORY_MALLOC_LARGE);\n\tif (addr == NULL) {\n\t\treturn NULL;\n\t}\n\n\tSZONE_LOCK(szone);\n\tif ((szone->num_large_objects_in_use + 1) * 4 > szone->num_large_entries) {\n\t\t// density of hash table too high; grow table\n\t\t// we do that under lock to avoid a race\n\t\tlarge_entry_t *entries = large_entries_grow_no_lock(szone, &range_to_deallocate);\n\t\tif (entries == NULL) {\n\t\t\tSZONE_UNLOCK(szone);\n\t\t\treturn NULL;\n\t\t}\n\t}\n\n\tlarge_entry.address = (vm_address_t)addr;\n\tlarge_entry.size = size;\n\tlarge_entry.did_madvise_reusable = FALSE;\n\tlarge_entry_insert_no_lock(szone, large_entry);\n\n\tszone->num_large_objects_in_use++;\n\tszone->num_bytes_in_large_objects += size;\n\tSZONE_UNLOCK(szone);\n\n\tif (range_to_deallocate.size) {\n\t\t// we deallocate outside the lock\n\t\tmvm_deallocate_pages((void *)range_to_deallocate.address, range_to_deallocate.size, 0);\n\t}\n\treturn addr;\n}\n\nvoid\nfree_large(szone_t *szone, void *ptr)\n{\n\t// We have established ptr is page-aligned and neither tiny nor small\n\tlarge_entry_t *entry;\n\tvm_range_t vm_range_to_deallocate;\n\n\tSZONE_LOCK(szone);\n\tentry = large_entry_for_pointer_no_lock(szone, ptr);\n\tif (entry) {\n#if CONFIG_LARGE_CACHE\n\t\tif (entry->size < LARGE_CACHE_SIZE_ENTRY_LIMIT &&\n\t\t\t-1 != madvise((void *)(entry->address), entry->size,\n\t\t\t\t\t\t MADV_CAN_REUSE)) { // Put the large_entry_t on the death-row cache?\n\t\t\t\tint idx = szone->large_entry_cache_newest, stop_idx = szone->large_entry_cache_oldest;\n\t\t\t\tlarge_entry_t this_entry = *entry; // Make a local copy, \"entry\" is volatile when lock is let go.\n\t\t\t\tboolean_t reusable = TRUE;\n\t\t\t\tboolean_t should_madvise =\n\t\t\t\tszone->large_entry_cache_reserve_bytes + this_entry.size > szone->large_entry_cache_reserve_limit;\n\n\t\t\t\t// Already freed?\n\t\t\t\t// [Note that repeated entries in death-row risk vending the same entry subsequently\n\t\t\t\t// to two different malloc() calls. By checking here the (illegal) double free\n\t\t\t\t// is accommodated, matching the behavior of the previous implementation.]\n\t\t\t\twhile (1) { // Scan large_entry_cache starting with most recent entry\n\t\t\t\t\tif (szone->large_entry_cache[idx].address == entry->address) {\n\t\t\t\t\t\tmalloc_zone_error(szone->debug_flags, true, \"pointer %p being freed already on death-row\\n\", ptr);\n\t\t\t\t\t\tSZONE_UNLOCK(szone);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (idx == stop_idx) { // exhausted live ring?\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (idx) {\n\t\t\t\t\t\tidx--; // bump idx down\n\t\t\t\t\t} else {\n\t\t\t\t\t\tidx = LARGE_ENTRY_CACHE_SIZE - 1; // wrap idx\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tSZONE_UNLOCK(szone);\n\n\t\t\t\tif (szone->debug_flags & MALLOC_PURGEABLE) { // Are we a purgable zone?\n\t\t\t\t\tint state = VM_PURGABLE_NONVOLATILE;\t\t\t // restore to default condition\n\n\t\t\t\t\tif (KERN_SUCCESS != vm_purgable_control(mach_task_self(), this_entry.address, VM_PURGABLE_SET_STATE, &state)) {\n\t\t\t\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** can't vm_purgable_control(..., VM_PURGABLE_SET_STATE) for large freed block at %p\\n\",\n\t\t\t\t\t\t\t\t\t (void *)this_entry.address);\n\t\t\t\t\t\treusable = FALSE;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (szone->large_legacy_reset_mprotect) { // Linked for Leopard?\n\t\t\t\t\t// Accomodate Leopard apps that (illegally) mprotect() their own guard pages on large malloc'd allocations\n\t\t\t\t\tint err = mprotect((void *)(this_entry.address), this_entry.size, PROT_READ | PROT_WRITE);\n\t\t\t\t\tif (err) {\n\t\t\t\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** can't reset protection for large freed block at %p\\n\", (void *)this_entry.address);\n\t\t\t\t\t\treusable = FALSE;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// madvise(..., MADV_REUSABLE) death-row arrivals if hoarding would exceed large_entry_cache_reserve_limit\n\t\t\t\tif (should_madvise) {\n\t\t\t\t\t// Issue madvise to avoid paging out the dirtied free()'d pages in \"entry\"\n\t\t\t\t\tMAGMALLOC_MADVFREEREGION((void *)szone, (void *)0, (void *)(this_entry.address), (int)this_entry.size); // DTrace USDT Probe\n\n\t\t\t\t\t// Ok to do this madvise on embedded because we won't call MADV_FREE_REUSABLE on a large\n\t\t\t\t\t// cache block twice without MADV_FREE_REUSE in between.\n\n\t\t\t\t\tif (-1 == madvise((void *)(this_entry.address), this_entry.size, MADV_FREE_REUSABLE)) {\n\t\t\t\t\t\t/* -1 return: VM map entry change makes this unfit for reuse. */\n#if DEBUG_MADVISE\n\t\t\t\t\t\tmalloc_zone_error(szone->debug_flags, false,\n\t\t\t\t\t\t\t\t\t\"free_large madvise(..., MADV_FREE_REUSABLE) failed for %p, length=%d\\n\",\n\t\t\t\t\t\t\t\t\t(void *)this_entry.address, this_entry.size);\n#endif\n\t\t\t\t\t\treusable = FALSE;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tSZONE_LOCK(szone);\n\n\t\t\t\t// Re-acquire \"entry\" after interval just above where we let go the lock.\n\t\t\t\tentry = large_entry_for_pointer_no_lock(szone, ptr);\n\t\t\t\tif (NULL == entry) {\n\t\t\t\t\tmalloc_zone_error(szone->debug_flags, true, \"entry for pointer %p being freed from death-row vanished\\n\", ptr);\n\t\t\t\t\tSZONE_UNLOCK(szone);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\t// Add \"entry\" to death-row ring\n\t\t\t\tif (reusable) {\n\t\t\t\t\tint idx = szone->large_entry_cache_newest; // Most recently occupied\n\t\t\t\t\tvm_address_t addr;\n\t\t\t\t\tsize_t adjsize;\n\n\t\t\t\t\tif (szone->large_entry_cache_newest == szone->large_entry_cache_oldest &&\n\t\t\t\t\t\t0 == szone->large_entry_cache[idx].address) {\n\t\t\t\t\t\t// Ring is empty, idx is good as it stands\n\t\t\t\t\t\taddr = 0;\n\t\t\t\t\t\tadjsize = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Extend the queue to the \"right\" by bumping up large_entry_cache_newest\n\t\t\t\t\t\tif (idx == LARGE_ENTRY_CACHE_SIZE - 1) {\n\t\t\t\t\t\t\tidx = 0; // Wrap index\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tidx++; // Bump index\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (idx == szone->large_entry_cache_oldest) { // Fully occupied\n\t\t\t\t\t\t\t// Drop this entry from the cache and deallocate the VM\n\t\t\t\t\t\t\taddr = szone->large_entry_cache[idx].address;\n\t\t\t\t\t\t\tadjsize = szone->large_entry_cache[idx].size;\n\t\t\t\t\t\t\tszone->large_entry_cache_bytes -= adjsize;\n\t\t\t\t\t\t\tif (!szone->large_entry_cache[idx].did_madvise_reusable) {\n\t\t\t\t\t\t\t\tszone->large_entry_cache_reserve_bytes -= adjsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Using an unoccupied cache slot\n\t\t\t\t\t\t\taddr = 0;\n\t\t\t\t\t\t\tadjsize = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif ((szone->debug_flags & MALLOC_DO_SCRIBBLE)) {\n\t\t\t\t\t\tmemset((void *)(entry->address), should_madvise ? SCRUBBLE_BYTE : SCRABBLE_BYTE, entry->size);\n\t\t\t\t\t}\n\n\t\t\t\t\tentry->did_madvise_reusable = should_madvise; // Was madvise()'d above?\n\t\t\t\t\tif (!should_madvise) {\t\t\t\t\t\t // Entered on death-row without madvise() => up the hoard total\n\t\t\t\t\t\tszone->large_entry_cache_reserve_bytes += entry->size;\n\t\t\t\t\t}\n\n\t\t\t\t\tszone->large_entry_cache_bytes += entry->size;\n\n\t\t\t\t\tif (!szone->flotsam_enabled && szone->large_entry_cache_bytes > SZONE_FLOTSAM_THRESHOLD_HIGH) {\n\t\t\t\t\t\tszone->flotsam_enabled = TRUE;\n\t\t\t\t\t}\n\n\t\t\t\t\tszone->large_entry_cache[idx] = *entry;\n\t\t\t\t\tszone->large_entry_cache_newest = idx;\n\n\t\t\t\t\tszone->num_large_objects_in_use--;\n\t\t\t\t\tszone->num_bytes_in_large_objects -= entry->size;\n\n\t\t\t\t\t(void)large_entry_free_no_lock(szone, entry);\n\n\t\t\t\t\tif (0 == addr) {\n\t\t\t\t\t\tSZONE_UNLOCK(szone);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Fall through to drop large_entry_cache_oldest from the cache,\n\t\t\t\t\t// and then deallocate its pages.\n\n\t\t\t\t\t// Trim the queue on the \"left\" by bumping up large_entry_cache_oldest\n\t\t\t\t\tif (szone->large_entry_cache_oldest == LARGE_ENTRY_CACHE_SIZE - 1) {\n\t\t\t\t\t\tszone->large_entry_cache_oldest = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tszone->large_entry_cache_oldest++;\n\t\t\t\t\t}\n\n\t\t\t\t\t// we deallocate_pages, including guard pages, outside the lock\n\t\t\t\t\tSZONE_UNLOCK(szone);\n\t\t\t\t\tmvm_deallocate_pages((void *)addr, (size_t)adjsize, 0);\n\t\t\t\t\treturn;\n\t\t\t\t} else {\n\t\t\t\t\t/* fall through to discard an allocation that is not reusable */\n\t\t\t\t}\n\t\t\t}\n#endif /* CONFIG_LARGE_CACHE */\n\n\t\tszone->num_large_objects_in_use--;\n\t\tszone->num_bytes_in_large_objects -= entry->size;\n\n\t\tvm_range_to_deallocate = large_entry_free_no_lock(szone, entry);\n\t} else {\n#if DEBUG_MALLOC\n\t\tlarge_debug_print(szone);\n#endif\n\t\tmalloc_zone_error(szone->debug_flags, true, \"pointer %p being freed was not allocated\\n\", ptr);\n\t\tSZONE_UNLOCK(szone);\n\t\treturn;\n\t}\n\tSZONE_UNLOCK(szone); // we release the lock asap\n\tCHECK(szone, __PRETTY_FUNCTION__);\n\n\t// we deallocate_pages, including guard pages, outside the lock\n\tif (vm_range_to_deallocate.address) {\n#if DEBUG_MALLOC\n\t\t// FIXME: large_entry_for_pointer_no_lock() needs the lock held ...\n\t\tif (large_entry_for_pointer_no_lock(szone, (void *)vm_range_to_deallocate.address)) {\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** invariant broken: %p still in use num_large_entries=%d\\n\",\n\t\t\t\t\tvm_range_to_deallocate.address, szone->num_large_entries);\n\t\t\tlarge_debug_print(szone);\n\t\t\tszone_sleep();\n\t\t}\n#endif\n\t\tmvm_deallocate_pages((void *)vm_range_to_deallocate.address, (size_t)vm_range_to_deallocate.size, 0);\n\t}\n}\n\nvoid *\nlarge_try_shrink_in_place(szone_t *szone, void *ptr, size_t old_size, size_t new_good_size)\n{\n\tsize_t shrinkage = old_size - new_good_size;\n\n\tif (shrinkage) {\n\t\tSZONE_LOCK(szone);\n\t\t/* contract existing large entry */\n\t\tlarge_entry_t *large_entry = large_entry_for_pointer_no_lock(szone, ptr);\n\t\tif (!large_entry) {\n\t\t\tmalloc_zone_error(szone->debug_flags, true, \"large entry %p reallocated is not properly in table\\n\", ptr);\n\t\t\tSZONE_UNLOCK(szone);\n\t\t\treturn ptr;\n\t\t}\n\n\t\tlarge_entry->address = (vm_address_t)ptr;\n\t\tlarge_entry->size = new_good_size;\n\t\tszone->num_bytes_in_large_objects -= shrinkage;\n\t\tboolean_t guarded = szone->debug_flags & MALLOC_ADD_GUARD_PAGES;\n\t\tSZONE_UNLOCK(szone); // we release the lock asap\n\n\t\tif (guarded) {\n\t\t\t// Keep the page above the new end of the allocation as the\n\t\t\t// postlude guard page.\n\t\t\tkern_return_t err;\n\t\t\terr = mprotect((void *)((uintptr_t)ptr + new_good_size), vm_page_quanta_size, 0);\n\t\t\tif (err) {\n\t\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** can't mvm_protect(0x0) region for new postlude guard page at %p\\n\",\n\t\t\t\t\t\t ptr + new_good_size);\n\t\t\t}\n\t\t\tnew_good_size += vm_page_quanta_size;\n\t\t\tshrinkage -= vm_page_quanta_size;\n\t\t}\n\n\t\tmvm_deallocate_pages((void *)((uintptr_t)ptr + new_good_size), shrinkage, 0);\n\t}\n\treturn ptr;\n}\n\nint\nlarge_try_realloc_in_place(szone_t *szone, void *ptr, size_t old_size, size_t new_size)\n{\n\tvm_address_t addr = (vm_address_t)ptr + old_size;\n\tlarge_entry_t *large_entry;\n\tkern_return_t err;\n\n\tSZONE_LOCK(szone);\n\tlarge_entry = large_entry_for_pointer_no_lock(szone, (void *)addr);\n\tSZONE_UNLOCK(szone);\n\n\tif (large_entry) { // check if \"addr = ptr + old_size\" is already spoken for\n\t\treturn 0;\t // large pointer already exists in table - extension is not going to work\n\t}\n\n\tnew_size = round_page_quanta(new_size);\n\t/*\n\t * Ask for allocation at a specific address, and mark as realloc\n\t * to request coalescing with previous realloc'ed extensions.\n\t */\n\terr = vm_allocate(mach_task_self(), &addr, new_size - old_size, VM_MAKE_TAG(VM_MEMORY_REALLOC));\n\tif (err != KERN_SUCCESS) {\n\t\treturn 0;\n\t}\n\n\tSZONE_LOCK(szone);\n\t/* extend existing large entry */\n\tlarge_entry = large_entry_for_pointer_no_lock(szone, ptr);\n\tif (!large_entry) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"large entry %p reallocated is not properly in table\\n\", ptr);\n\t\tSZONE_UNLOCK(szone);\n\t\treturn 0; // Bail, leaking \"addr\"\n\t}\n\t\n\tlarge_entry->address = (vm_address_t)ptr;\n\tlarge_entry->size = new_size;\n\tszone->num_bytes_in_large_objects += new_size - old_size;\n\tSZONE_UNLOCK(szone); // we release the lock asap\n\t\n\treturn 1;\n}\n\nboolean_t\nlarge_claimed_address(szone_t *szone, void *ptr)\n{\n\tSZONE_LOCK(szone);\n\tboolean_t result = large_entry_containing_pointer_no_lock(szone,\n\t\t\t(void *)trunc_page((uintptr_t)ptr)) != NULL;\n\tSZONE_UNLOCK(szone);\n\treturn result;\n}\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_lite.c",
"content": "/*\n * Copyright (c) 2016, Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#include \"internal.h\"\n\ntypedef uint64_t malloc_stack_id;\n\nuint64_t max_lite_mallocs = 0;\n\nstatic malloc_stack_id\nget_stack_id_from_ptr(void *ptr, size_t ptr_size)\n{\n\tvoid *idptr = ptr + ptr_size - sizeof(malloc_stack_id);\n\t\n\treturn * (malloc_stack_id *) idptr;\n}\n\nstatic void\nset_stack_id_in_ptr(void *ptr, size_t requested_size, size_t ptr_size, malloc_stack_id\tstack_id)\n{\n\tvoid *idptr = ptr + ptr_size - sizeof(malloc_stack_id);\n\t* (malloc_stack_id *) idptr = stack_id;\n\tvoid *padding = ptr + requested_size;\n\tbzero(padding, ptr_size - requested_size - sizeof(malloc_stack_id));\n}\n\nstatic void\nadd_stack_to_ptr(szone_t *szone, size_t requested_size, void *ptr)\n{\n\t// enter the stack into the unique table\n\tvm_address_t self_thread = (vm_address_t)_os_tsd_get_direct(__TSD_THREAD_SELF);\n\t\n\tsize_t ptr_size = szone_size(szone, ptr);\n\t\n\t__malloc_lock_stack_logging();\n\t\n\t// if stack logging was turned off behind our backs\n\tif (!is_stack_logging_lite_enabled()) {\n\t\t__malloc_unlock_stack_logging();\n\t\treturn;\n\t}\n\n\tmalloc_stack_id stack_id = __enter_stack_into_table_while_locked(self_thread, 0, false, ptr_size);\n\t\n\t__malloc_unlock_stack_logging();\n\t\n\tif (stack_id == __invalid_stack_id) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"bad stack id. turning off stack logging\\n\");\n\t\tturn_off_stack_logging();\n\t} else {\n\t\tset_stack_id_in_ptr(ptr, requested_size, ptr_size, stack_id);\n\t}\n}\n\nstatic boolean_t stack_logging_lite_enabled = false;\n\nboolean_t is_stack_logging_lite_enabled(void) {\n\treturn stack_logging_lite_enabled;\n}\n\nvoid\nenable_stack_logging_lite()\n{\n\tstack_logging_lite_enabled = true;\n}\n\nvoid\ndisable_stack_logging_lite()\n{\n\tstack_logging_lite_enabled = false;\n}\n\nstatic void *\nstack_logging_lite_malloc(malloc_zone_t *zone, size_t size)\n{\n\tszone_t *szone = (szone_t *) zone;\n\tvoid* p = NULL;\n\tstatic uint64_t num_mallocs = 0;\n\t\n\tif (stack_logging_lite_enabled) {\n\t\t__prepare_to_log_stacks(true);\t// do this again in case stack logging was postponed\n\t\t\n\t\tp = szone_malloc(szone, size + sizeof(malloc_stack_id));\n\t\t\n\t\tif (p) {\n\t\t\tadd_stack_to_ptr(szone, size, p);\n\t\t}\n\t\t\n\t\t// this value doesn't need to be exact, so no need for atomic operations\n\t\tnum_mallocs++;\n\t\t\n\t\tif (max_lite_mallocs > 0 && num_mallocs > max_lite_mallocs) {\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"lite allocations exceeded limit. disabling lite mode\\n\");\n\t\t\tdisable_stack_logging_lite();\n\t\t}\n\t} else {\n\t\tp = szone->helper_zone->basic_zone.malloc((malloc_zone_t *) szone->helper_zone, size);\n\t}\n\t\n\treturn p;\n}\n\nstatic void *\nstack_logging_lite_calloc(struct _malloc_zone_t *zone, size_t num_items, size_t size)\n{\n\tszone_t *szone = (szone_t *) zone;\n\tvoid *p = NULL;\n\t\n\tif (stack_logging_lite_enabled) {\n\t\tsize_t total_bytes;\n\t\t\n\t\tif (calloc_get_size(num_items, size, sizeof(malloc_stack_id), &total_bytes)) {\n\t\t\treturn NULL;\n\t\t}\n\t\t\n\t\tp = szone_malloc_should_clear(szone, total_bytes, 1);\n\t\t\n\t\tif (p) {\n\t\t\tadd_stack_to_ptr(szone, total_bytes - sizeof(malloc_stack_id), p);\n\t\t}\n\t} else {\n\t\tp = szone->helper_zone->basic_zone.calloc((malloc_zone_t *) szone->helper_zone, num_items, size);\n\t}\n\t\n\treturn p;\n}\n\nstatic void *\nstack_logging_lite_valloc(malloc_zone_t *zone, size_t size)\n{\n\tszone_t *szone = (szone_t *) zone;\n\tvoid *p = NULL;\n\t\n\tif (stack_logging_lite_enabled) {\n\t\tp = szone_valloc(szone, size + sizeof(malloc_stack_id));\n\t\t\n\t\tif (p) {\n\t\t\tadd_stack_to_ptr(szone, size, p);\n\t\t}\n\t} else {\n\t\tp = szone->helper_zone->basic_zone.valloc((malloc_zone_t *) szone->helper_zone, size);\n\t}\n\t\n\treturn p;\n}\n\nstatic void\nstack_logging_lite_free(malloc_zone_t *zone, void *ptr)\n{\n\tszone_t *szone = (szone_t *) zone;\n\tsize_t size = szone_size(szone, ptr);\n\t\n\t// see if it's in our zone\n\tif (size) {\n\t\tmalloc_stack_id stack_id = get_stack_id_from_ptr(ptr, size);\n\t\t__decrement_table_slot_refcount(stack_id, size);\n\t\tszone_free(szone, ptr);\n\t} else {\n\t\tszone->helper_zone->basic_zone.free((malloc_zone_t *) szone->helper_zone, ptr);\n\t}\n}\n\nstatic void\nstack_logging_lite_free_definite_size(malloc_zone_t *zone, void *ptr, size_t size)\n{\n\t// because we've messed with the size, don't try to be fancy and just call free\n\tstack_logging_lite_free(zone, ptr);\n}\n\n// Three paths:\n// 1. do a szone_realloc with padding and add stack id\n// 2. do a szone_realloc on the helper zone\n// 3. do a manual free / malloc\n\nstatic void *\nstack_logging_lite_realloc(malloc_zone_t *zone, void *ptr, size_t new_size)\n{\n\tszone_t *szone = (szone_t *) zone;\n\tvoid *new_ptr = NULL;\n\t\n\tsize_t old_size = szone_size(szone, ptr);\n\t\n\t// if we own the ptr and lite enabled do our thing\n\tif (old_size && stack_logging_lite_enabled) {\n\t\t// need to get the old stackid and decrement\n\t\tmalloc_stack_id stack_id = get_stack_id_from_ptr(ptr, old_size);\n\t\tnew_ptr = szone_realloc(szone, ptr, new_size + sizeof(malloc_stack_id));\n\t\t\n\t\tif (new_ptr) {\n\t\t\t__decrement_table_slot_refcount(stack_id, old_size);\n\t\t\tadd_stack_to_ptr(szone, new_size, new_ptr);\n\t\t}\n\t} else if (!old_size && !stack_logging_lite_enabled) {\n\t\t// we don't own the pointer and lite mode is disabled, so just pass the realloc on to the helper zone\n\t\treturn szone->helper_zone->basic_zone.realloc((malloc_zone_t *) szone->helper_zone, ptr, new_size);\n\t} else {\n\t\t// otherwise perform the realloc by hand:\n\t\t// 1. malloc new ptr\n\t\t// 2. copy existing data to new ptr\n\t\t// 3. free old ptr\n\t\t\n\t\t// this will add the stack id if needed\n\t\tnew_ptr = stack_logging_lite_malloc(zone, new_size);\n\t\t\n\t\tif (new_ptr) {\n\t\t\tsize_t old_size = malloc_size(ptr);\n\t\t\tsize_t new_size = malloc_size(new_ptr);\n\t\t\t\n\t\t\t// copy as much old data as possible\n\t\t\tsize_t copy_size = MIN(old_size, new_size);\n\t\t\tmemcpy(new_ptr, ptr, copy_size);\n\t\t}\n\t\t\n\t\tstack_logging_lite_free(zone, ptr);\n\t}\n\t\n\treturn new_ptr;\n}\n\nstatic void * MALLOC_NOINLINE\nstack_logging_lite_memalign(malloc_zone_t *zone, size_t alignment, size_t size)\n{\n\tszone_t *szone = (szone_t *) zone;\n\tvoid *ptr = NULL;\n\t\n\tif (stack_logging_lite_enabled) {\n\t\tptr = szone_memalign(szone, alignment, size + sizeof(malloc_stack_id));\n\t\t\n\t\tif (ptr) {\n\t\t\tadd_stack_to_ptr(szone, size, ptr);\n\t\t}\n\t} else {\n\t\tptr = szone->helper_zone->basic_zone.memalign((malloc_zone_t *) szone->helper_zone, alignment, size);\n\t}\n\t\n\treturn ptr;\n}\n\nstatic size_t\nstack_logging_lite_size(malloc_zone_t *zone, const void *ptr)\n{\n\tszone_t *szone = (szone_t *) zone;\n\tsize_t size = szone_size(szone, ptr);\n\t\n\tif (size) {\n\t\tsize -= sizeof(malloc_stack_id);\n\t} else {\n\t\tsize = szone->helper_zone->basic_zone.size((malloc_zone_t *) szone->helper_zone, ptr);\n\t}\n\t\n\treturn size;\n}\n\nunsigned\nstack_logging_lite_batch_malloc(szone_t *szone, size_t size, void **results, unsigned count)\n{\n\tunsigned num_allocated = 0;\n\t\n\tif (stack_logging_lite_enabled) {\n\t\tnum_allocated = szone_batch_malloc(szone, size + sizeof(malloc_stack_id), results, count);\n\t\t\n\t\tfor (unsigned i = 0; i < num_allocated; i++) {\n\t\t\tadd_stack_to_ptr(szone, size, results[i]);\n\t\t}\n\t} else {\n\t\tnum_allocated = szone->helper_zone->basic_zone.batch_malloc((malloc_zone_t *) szone->helper_zone, size, results, count);\n\t}\n\t\n\treturn num_allocated;\n}\n\nvoid\nstack_logging_lite_batch_free(szone_t *szone, void **to_be_freed, unsigned count)\n{\n\tfor (unsigned i = 0; i < count; i++) {\n\t\tvoid *p = to_be_freed[i];\n\t\t\n\t\tif (p) {\n\t\t\tsize_t size = szone_size(szone, p);\n\t\t\t\n\t\t\t// see if it's in our zone\n\t\t\tif (size) {\n\t\t\t\tmalloc_stack_id stack_id = get_stack_id_from_ptr(p, size);\n\t\t\t\t__decrement_table_slot_refcount(stack_id, size);\n\t\t\t\tszone_free(szone, p);\n\t\t\t} else {\n\t\t\t\tszone->helper_zone->basic_zone.free((malloc_zone_t *) szone->helper_zone, p);\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nmalloc_zone_t *\ncreate_stack_logging_lite_zone(size_t initial_size, malloc_zone_t *helper_zone, unsigned debug_flags)\n{\n\tszone_t* zone = create_scalable_szone(initial_size, debug_flags);\n\t\n\t// unprotect function pointers\n\tmprotect(zone, sizeof(zone->basic_zone), PROT_READ | PROT_WRITE);\n\t\n\t// set the function pointers\n\tzone->basic_zone.malloc = stack_logging_lite_malloc;\n\tzone->basic_zone.calloc = stack_logging_lite_calloc;\n\tzone->basic_zone.valloc = stack_logging_lite_valloc;\n\tzone->basic_zone.realloc = stack_logging_lite_realloc;\n\tzone->basic_zone.batch_malloc = (void *) stack_logging_lite_batch_malloc;\n\tzone->basic_zone.batch_free = (void *) stack_logging_lite_batch_free;\n\tzone->basic_zone.memalign = stack_logging_lite_memalign;\n\tzone->basic_zone.free = stack_logging_lite_free;\n\tzone->basic_zone.free_definite_size = stack_logging_lite_free_definite_size;\n\tzone->basic_zone.size = stack_logging_lite_size;\n\t\n\t// protect function pointers\n\tmprotect(zone, sizeof(zone->basic_zone), PROT_READ);\n\t\n\t// set helper zone\n\tzone->helper_zone = (szone_t*) helper_zone;\n\t\n\treturn (malloc_zone_t*) zone;\n}\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_malloc.c",
"content": "/*\n * Copyright (c) 1999, 2006, 2008 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n/* Author: Bertrand Serlet, August 1999 */\n\n/*\n * Multithread enhancements for \"tiny\" allocations introduced February 2008.\n * These are in the spirit of \"Hoard\". See:\n * Berger, E.D.; McKinley, K.S.; Blumofe, R.D.; Wilson, P.R. (2000).\n * \"Hoard: a scalable memory allocator for multithreaded applications\".\n * ACM SIGPLAN Notices 35 (11): 117-128. Berger2000.\n * \n * Retrieved on 2008-02-22.\n */\n\n#include \"internal.h\"\n\n#if DEBUG_MALLOC\n#define LOG(szone, ptr) (szone->log_address && (((uintptr_t)szone->log_address == -1) || (szone->log_address == (void *)(ptr))))\n#else\n#define LOG(szone, ptr) 0\n#endif\n\n// Maximum number of magazines, set from the number of logical CPUS and\n// possibly limited by the MallocMaxMagazines environment variable.\nint max_magazines;\n\n// Number of regions to retain in a recirc depot.\n#if CONFIG_RECIRC_DEPOT\nint recirc_retained_regions = DEFAULT_RECIRC_RETAINED_REGIONS;\n#endif // CONFIG_RECIRC_DEPOT\n\n/*********************\tZone call backs\t************************/\n/*\n * Mark these MALLOC_NOINLINE to avoid bloating the purgeable zone call backs\n */\nvoid\nszone_free(szone_t *szone, void *ptr)\n{\n\tregion_t tiny_region;\n\tregion_t small_region;\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in szone_free with %p\\n\", ptr);\n\t}\n#endif\n\tif (!ptr) {\n\t\treturn;\n\t}\n\t/*\n\t * Try to free to a tiny region.\n\t */\n\tif ((uintptr_t)ptr & (TINY_QUANTUM - 1)) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"Non-aligned pointer %p being freed\\n\", ptr);\n\t\treturn;\n\t}\n\tif ((tiny_region = tiny_region_for_ptr_no_lock(&szone->tiny_rack, ptr)) != NULL) {\n\t\tif (TINY_INDEX_FOR_PTR(ptr) >= NUM_TINY_BLOCKS) {\n\t\t\tmalloc_zone_error(szone->debug_flags, true, \"Pointer %p to metadata being freed\\n\", ptr);\n\t\t\treturn;\n\t\t}\n\t\tfree_tiny(&szone->tiny_rack, ptr, tiny_region, 0);\n\t\treturn;\n\t}\n\n\t/*\n\t * Try to free to a small region.\n\t */\n\tif ((uintptr_t)ptr & (SMALL_QUANTUM - 1)) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"Non-aligned pointer %p being freed (2)\\n\", ptr);\n\t\treturn;\n\t}\n\tif ((small_region = small_region_for_ptr_no_lock(&szone->small_rack, ptr)) != NULL) {\n\t\tif (SMALL_META_INDEX_FOR_PTR(ptr) >= NUM_SMALL_BLOCKS) {\n\t\t\tmalloc_zone_error(szone->debug_flags, true, \"Pointer %p to metadata being freed (2)\\n\", ptr);\n\t\t\treturn;\n\t\t}\n\t\tfree_small(&szone->small_rack, ptr, small_region, 0);\n\t\treturn;\n\t}\n\n\t/* check that it's a legal large allocation */\n\tif ((uintptr_t)ptr & (vm_page_quanta_size - 1)) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"non-page-aligned, non-allocated pointer %p being freed\\n\", ptr);\n\t\treturn;\n\t}\n\tfree_large(szone, ptr);\n}\n\nvoid\nszone_free_definite_size(szone_t *szone, void *ptr, size_t size)\n{\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in szone_free_definite_size with %p\\n\", ptr);\n\t}\n\n\tif (0 == size) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"pointer %p of size zero being freed\\n\", ptr);\n\t\treturn;\n\t}\n\n#endif\n\tif (!ptr) {\n\t\treturn;\n\t}\n\n\t/*\n\t * Try to free to a tiny region.\n\t */\n\tif ((uintptr_t)ptr & (TINY_QUANTUM - 1)) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"Non-aligned pointer %p being freed\\n\", ptr);\n\t\treturn;\n\t}\n\tif (size <= SMALL_THRESHOLD) {\n\t\tif (TINY_INDEX_FOR_PTR(ptr) >= NUM_TINY_BLOCKS) {\n\t\t\tmalloc_zone_error(szone->debug_flags, true, \"Pointer %p to metadata being freed\\n\", ptr);\n\t\t\treturn;\n\t\t}\n\t\tfree_tiny(&szone->tiny_rack, ptr, TINY_REGION_FOR_PTR(ptr), size);\n\t\treturn;\n\t}\n\n\t/*\n\t * Try to free to a small region.\n\t */\n\tif ((uintptr_t)ptr & (SMALL_QUANTUM - 1)) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"Non-aligned pointer %p being freed (2)\\n\", ptr);\n\t\treturn;\n\t}\n\tif (size <= szone->large_threshold) {\n\t\tif (SMALL_META_INDEX_FOR_PTR(ptr) >= NUM_SMALL_BLOCKS) {\n\t\t\tmalloc_zone_error(szone->debug_flags, true, \"Pointer %p to metadata being freed (2)\\n\", ptr);\n\t\t\treturn;\n\t\t}\n\t\tfree_small(&szone->small_rack, ptr, SMALL_REGION_FOR_PTR(ptr), size);\n\t\treturn;\n\t}\n\n\t/* check that it's a legal large allocation */\n\tif ((uintptr_t)ptr & (vm_page_quanta_size - 1)) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"non-page-aligned, non-allocated pointer %p being freed\\n\", ptr);\n\t\treturn;\n\t}\n\tfree_large(szone, ptr);\n}\n\nMALLOC_NOINLINE void *\nszone_malloc_should_clear(szone_t *szone, size_t size, boolean_t cleared_requested)\n{\n\tvoid *ptr;\n\tmsize_t msize;\n\n\tif (size <= SMALL_THRESHOLD) {\n\t\t// tiny size: <=1008 bytes (64-bit), <=496 bytes (32-bit)\n\t\t// think tiny\n\t\tmsize = TINY_MSIZE_FOR_BYTES(size + TINY_QUANTUM - 1);\n\t\tif (!msize) {\n\t\t\tmsize = 1;\n\t\t}\n\t\tptr = tiny_malloc_should_clear(&szone->tiny_rack, msize, cleared_requested);\n\t} else if (size <= szone->large_threshold) {\n\t\t// small size: <=15k (iOS), <=64k (large iOS), <=128k (macOS)\n\t\t// think small\n\t\tmsize = SMALL_MSIZE_FOR_BYTES(size + SMALL_QUANTUM - 1);\n\t\tif (!msize) {\n\t\t\tmsize = 1;\n\t\t}\n\t\tptr = small_malloc_should_clear(&szone->small_rack, msize, cleared_requested);\n\t} else {\n\t\t// large: all other allocations\n\t\tsize_t num_kernel_pages = round_page_quanta(size) >> vm_page_quanta_shift;\n\t\tif (num_kernel_pages == 0) { /* Overflowed */\n\t\t\tptr = 0;\n\t\t} else {\n\t\t\tptr = large_malloc(szone, num_kernel_pages, 0, cleared_requested);\n\t\t}\n\t}\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"szone_malloc returned %p\\n\", ptr);\n\t}\n#endif\n\t/*\n\t * If requested, scribble on allocated memory.\n\t */\n\tif ((szone->debug_flags & MALLOC_DO_SCRIBBLE) && ptr && !cleared_requested && size) {\n\t\tmemset(ptr, SCRIBBLE_BYTE, szone_size(szone, ptr));\n\t}\n\n\treturn ptr;\n}\n\nvoid *\nszone_malloc(szone_t *szone, size_t size)\n{\n\treturn szone_malloc_should_clear(szone, size, 0);\n}\n\nvoid *\nszone_calloc(szone_t *szone, size_t num_items, size_t size)\n{\n\tsize_t total_bytes;\n\tif (calloc_get_size(num_items, size, 0, &total_bytes)) {\n\t\treturn NULL;\n\t}\n\treturn szone_malloc_should_clear(szone, total_bytes, 1);\n}\n\nvoid *\nszone_valloc(szone_t *szone, size_t size)\n{\n\tvoid *ptr;\n\n\tif (size <= szone->large_threshold) {\n\t\tptr = szone_memalign(szone, vm_page_quanta_size, size);\n\t} else {\n\t\tsize_t num_kernel_pages;\n\n\t\tnum_kernel_pages = round_page_quanta(size) >> vm_page_quanta_shift;\n\t\tptr = large_malloc(szone, num_kernel_pages, 0, 0);\n\t}\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"szone_valloc returned %p\\n\", ptr);\n\t}\n#endif\n\treturn ptr;\n}\n\n/* Isolate PIC-base load here. */\nsize_t\nszone_size_try_large(szone_t *szone, const void *ptr)\n{\n\tsize_t size = 0;\n\tlarge_entry_t *entry;\n\n\tSZONE_LOCK(szone);\n\tentry = large_entry_for_pointer_no_lock(szone, ptr);\n\tif (entry) {\n\t\tsize = entry->size;\n\t}\n\tSZONE_UNLOCK(szone);\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"szone_size for %p returned %d\\n\", ptr, (unsigned)size);\n\t}\n#endif\n\treturn size;\n}\n\nsize_t\nszone_size(szone_t *szone, const void *ptr)\n{\n\tsize_t sz = 0;\n\n\tif (!ptr) {\n\t\treturn 0;\n\t}\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in szone_size for %p (szone=%p)\\n\", ptr, szone);\n\t}\n#endif\n\n\t/*\n\t * Look for it in a tiny region.\n\t */\n\tif ((uintptr_t)ptr & (TINY_QUANTUM - 1)) {\n\t\treturn 0;\n\t}\n\n\tsz = tiny_size(&szone->tiny_rack, ptr);\n\tif (sz) {\n\t\treturn sz;\n\t}\n\n\t/*\n\t * Look for it in a small region.\n\t */\n\tif ((uintptr_t)ptr & (SMALL_QUANTUM - 1)) {\n\t\treturn 0;\n\t}\n\n\tsz = small_size(&szone->small_rack, ptr);\n\tif (sz) {\n\t\treturn sz;\n\t}\n\n\t/*\n\t * If not page-aligned, it cannot have come from a large allocation.\n\t */\n\tif ((uintptr_t)ptr & (vm_page_quanta_size - 1)) {\n\t\treturn 0;\n\t}\n\n\t/*\n\t * Look for it in a large entry.\n\t */\n\treturn szone_size_try_large(szone, ptr);\n}\n\nvoid *\nszone_realloc(szone_t *szone, void *ptr, size_t new_size)\n{\n\tsize_t old_size, new_good_size, valid_size;\n\tvoid *new_ptr;\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in szone_realloc for %p, %d\\n\", ptr, (unsigned)new_size);\n\t}\n#endif\n\tif (NULL == ptr) {\n\t\t// If ptr is a null pointer, realloc() shall be equivalent to malloc() for the specified size.\n\t\treturn szone_malloc(szone, new_size);\n\t} else if (0 == new_size) {\n\t\t// If size is 0 and ptr is not a null pointer, the object pointed to is freed.\n\t\tszone_free(szone, ptr);\n\t\t// If size is 0, either a null pointer or a unique pointer that can be successfully passed\n\t\t// to free() shall be returned.\n\t\treturn szone_malloc(szone, 1);\n\t}\n\n\told_size = szone_size(szone, ptr);\n\tif (!old_size) {\n\t\tmalloc_zone_error(szone->debug_flags, true, \"pointer %p being reallocated was not allocated\\n\", ptr);\n\t\treturn NULL;\n\t}\n\n\tnew_good_size = szone_good_size(szone, new_size);\n\tif (new_good_size == old_size) { // Existing allocation is best fit evar?\n\t\treturn ptr;\n\t}\n\n\t/*\n\t * If the new size suits the tiny allocator and the pointer being resized\n\t * belongs to a tiny region, try to reallocate in-place.\n\t */\n\tif (new_good_size <= SMALL_THRESHOLD) {\n\t\tif (old_size <= SMALL_THRESHOLD) {\n\t\t\tif (new_good_size <= (old_size >> 1)) {\n\t\t\t\t/*\n\t\t\t\t * Serious shrinkage (more than half). free() the excess.\n\t\t\t\t */\n\t\t\t\treturn tiny_try_shrink_in_place(&szone->tiny_rack, ptr, old_size, new_good_size);\n\t\t\t} else if (new_good_size <= old_size) {\n\t\t\t\t/*\n\t\t\t\t * new_good_size smaller than old_size but not by much (less than half).\n\t\t\t\t * Avoid thrashing at the expense of some wasted storage.\n\t\t\t\t */\n\t\t\t\tif (szone->debug_flags & MALLOC_DO_SCRIBBLE) {\n\t\t\t\t\tmemset(ptr + new_size, SCRIBBLE_BYTE, old_size - new_size);\n\t\t\t\t}\n\t\t\t\treturn ptr;\n\t\t\t} else if (tiny_try_realloc_in_place(&szone->tiny_rack, ptr, old_size, new_good_size)) { // try to grow the allocation\n\t\t\t\tif (szone->debug_flags & MALLOC_DO_SCRIBBLE) {\n\t\t\t\t\tmemset(ptr + old_size, SCRIBBLE_BYTE, new_good_size - old_size);\n\t\t\t\t}\n\t\t\t\treturn ptr;\n\t\t\t}\n\t\t}\n\n\t\t/*\n\t\t * Else if the new size suits the small allocator and the pointer being resized\n\t\t * belongs to a small region, and we're not protecting the small allocations\n\t\t * try to reallocate in-place.\n\t\t */\n\t} else if (new_good_size <= szone->large_threshold) {\n\t\tif (SMALL_THRESHOLD < old_size && old_size <= szone->large_threshold) {\n\t\t\tif (new_good_size <= (old_size >> 1)) {\n\t\t\t\treturn small_try_shrink_in_place(&szone->small_rack, ptr, old_size, new_good_size);\n\t\t\t} else if (new_good_size <= old_size) {\n\t\t\t\tif (szone->debug_flags & MALLOC_DO_SCRIBBLE) {\n\t\t\t\t\tmemset(ptr + new_size, SCRIBBLE_BYTE, old_size - new_size);\n\t\t\t\t}\n\t\t\t\treturn ptr;\n\t\t\t} else if (small_try_realloc_in_place(&szone->small_rack, ptr, old_size, new_good_size)) {\n\t\t\t\tif (szone->debug_flags & MALLOC_DO_SCRIBBLE) {\n\t\t\t\t\tmemset(ptr + old_size, SCRIBBLE_BYTE, new_good_size - old_size);\n\t\t\t\t}\n\t\t\t\treturn ptr;\n\t\t\t}\n\t\t}\n\t\t/*\n\t\t * Else if the allocation's a large allocation, try to reallocate in-place there.\n\t\t */\n\t} else if (!(szone->debug_flags & MALLOC_PURGEABLE) && // purgeable needs fresh allocation\n\t\t\t (old_size > szone->large_threshold) && (new_good_size > szone->large_threshold)) {\n\t\tif (new_good_size <= (old_size >> 1)) {\n\t\t\treturn large_try_shrink_in_place(szone, ptr, old_size, new_good_size);\n\t\t} else if (new_good_size <= old_size) {\n\t\t\tif (szone->debug_flags & MALLOC_DO_SCRIBBLE) {\n\t\t\t\tmemset(ptr + new_size, SCRIBBLE_BYTE, old_size - new_size);\n\t\t\t}\n\t\t\treturn ptr;\n\t\t} else if (large_try_realloc_in_place(szone, ptr, old_size, new_good_size)) {\n\t\t\tif (szone->debug_flags & MALLOC_DO_SCRIBBLE) {\n\t\t\t\tmemset(ptr + old_size, SCRIBBLE_BYTE, new_good_size - old_size);\n\t\t\t}\n\t\t\treturn ptr;\n\t\t}\n\t}\n\n\t/*\n\t * Can't reallocate in place for whatever reason; allocate a new buffer and copy.\n\t */\n\tif (new_good_size <= (old_size >> 1)) {\n\t\t/* Serious shrinkage (more than half). FALL THROUGH to alloc/copy/free. */\n\t} else if (new_good_size <= old_size) {\n\t\tif (szone->debug_flags & MALLOC_DO_SCRIBBLE) {\n\t\t\tmemset(ptr + new_size, SCRIBBLE_BYTE, old_size - new_size);\n\t\t}\n\t\treturn ptr;\n\t}\n\n\tnew_ptr = szone_malloc(szone, new_size);\n\tif (new_ptr == NULL) {\n\t\treturn NULL;\n\t}\n\n\t/*\n\t * If the allocation's large enough, try to copy using VM. If that fails, or\n\t * if it's too small, just copy by hand.\n\t */\n\tvalid_size = MIN(old_size, new_size);\n\tif ((valid_size <= szone->vm_copy_threshold) ||\n\t\t\tvm_copy(mach_task_self(), (vm_address_t)ptr, valid_size, (vm_address_t)new_ptr)) {\n\t\tmemcpy(new_ptr, ptr, valid_size);\n\t}\n\tszone_free(szone, ptr);\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"szone_realloc returned %p for %d\\n\", new_ptr, (unsigned)new_size);\n\t}\n#endif\n\treturn new_ptr;\n}\n\nvoid *\nszone_memalign(szone_t *szone, size_t alignment, size_t size)\n{\n\tif (size == 0) {\n\t\tsize = 1; // Ensures we'll return an aligned free()-able pointer\n\t}\n\tif ((size + alignment) < size) { // size_t arithmetic wrapped!\n\t\treturn NULL;\n\t}\n\n\t// alignment is gauranteed a power of 2 at least as large as sizeof(void *), hence non-zero.\n\t// Since size + alignment didn't wrap, 0 <= size + alignment - 1 < size + alignment\n\tsize_t span = size + alignment - 1;\n\n\tif (alignment <= TINY_QUANTUM) {\n\t\treturn szone_malloc(szone, size); // Trivially satisfied by tiny, small, or large\n\t}\n\tif (span <= SMALL_THRESHOLD) {\n\t\treturn tiny_memalign(szone, alignment, size, span);\n\t}\n\tif (SMALL_THRESHOLD < size && alignment <= SMALL_QUANTUM) {\n\t\treturn szone_malloc(szone, size); // Trivially satisfied by small or large\n\t}\n\tif (size <= SMALL_THRESHOLD) {\n\t\t// ensure block allocated by small does not have a tiny-possible size\n\t\tsize = SMALL_THRESHOLD + TINY_QUANTUM;\n\t\tspan = size + alignment - 1;\n\t}\n\tif (span <= szone->large_threshold) {\n\t\treturn small_memalign(szone, alignment, size, span);\n\t}\n\tif (szone->large_threshold < size && alignment <= vm_page_quanta_size) {\n\t\treturn szone_malloc(szone, size); // Trivially satisfied by large\n\t}\n\t// ensure block allocated by large does not have a small-possible size\n\tsize_t num_kernel_pages = round_page_quanta(MAX(szone->large_threshold + 1,\n\t\t\tsize)) >> vm_page_quanta_shift;\n\tif (num_kernel_pages == 0) { /* Overflowed */\n\t\treturn NULL;\n\t} else {\n\t\treturn large_malloc(szone, num_kernel_pages,\n\t\t\t\tMAX(vm_page_quanta_shift, __builtin_ctz((unsigned)alignment)), 0);\n\t}\n\t/* NOTREACHED */\n}\n\n// Given a size, returns the number of pointers allocated capable of holding\n// that size, up to the limit specified by the 'count' argument. These pointers\n// are stored in the 'results' array, which must be allocated by the caller.\n// May return zero, since this function is only a best attempt at allocating\n// the pointers. Clients should be prepared to call malloc for any additional\n// blocks they need.\nunsigned\nszone_batch_malloc(szone_t *szone, size_t size, void **results, unsigned count)\n{\n\t// only bother implementing this for tiny\n\tif (size <= SMALL_THRESHOLD) {\n\t\treturn tiny_batch_malloc(szone, size, results, count);\n\t}\n\treturn 0;\n}\n\nvoid\nszone_batch_free(szone_t *szone, void **to_be_freed, unsigned count)\n{\n\t// frees all the pointers in to_be_freed\n\t// note that to_be_freed may be overwritten during the process\n\tif (!count) {\n\t\treturn;\n\t}\n\n\tCHECK(szone, __PRETTY_FUNCTION__);\n\n\t// We only support batch malloc in tiny. Let it free all of the pointers\n\t// that belong to it, then let the standard free deal with the rest.\n\ttiny_batch_free(szone, to_be_freed, count);\n\t\n\tCHECK(szone, __PRETTY_FUNCTION__);\n\twhile (count--) {\n\t\tvoid *ptr = to_be_freed[count];\n\t\tif (ptr) {\n\t\t\tszone_free(szone, ptr);\n\t\t}\n\t}\n}\n\n// FIXME: Suppose one of the locks is held?\nstatic void\nszone_destroy(szone_t *szone)\n{\n\tsize_t index;\n\tlarge_entry_t *large;\n\tvm_range_t range_to_deallocate;\n\n#if CONFIG_LARGE_CACHE\n\tSZONE_LOCK(szone);\n\n\t/* disable any memory pressure responder */\n\tszone->flotsam_enabled = FALSE;\n\n\t// stack allocated copy of the death-row cache\n\tint idx = szone->large_entry_cache_oldest, idx_max = szone->large_entry_cache_newest;\n\tlarge_entry_t local_entry_cache[LARGE_ENTRY_CACHE_SIZE];\n\n\tmemcpy((void *)local_entry_cache, (void *)szone->large_entry_cache, sizeof(local_entry_cache));\n\n\tszone->large_entry_cache_oldest = szone->large_entry_cache_newest = 0;\n\tszone->large_entry_cache[0].address = 0x0;\n\tszone->large_entry_cache[0].size = 0;\n\tszone->large_entry_cache_bytes = 0;\n\tszone->large_entry_cache_reserve_bytes = 0;\n\n\tSZONE_UNLOCK(szone);\n\n\t// deallocate the death-row cache outside the zone lock\n\twhile (idx != idx_max) {\n\t\tmvm_deallocate_pages((void *)local_entry_cache[idx].address, local_entry_cache[idx].size, 0);\n\t\tif (++idx == LARGE_ENTRY_CACHE_SIZE) {\n\t\t\tidx = 0;\n\t\t}\n\t}\n\tif (0 != local_entry_cache[idx].address && 0 != local_entry_cache[idx].size) {\n\t\tmvm_deallocate_pages((void *)local_entry_cache[idx].address, local_entry_cache[idx].size, 0);\n\t}\n#endif\n\n\t/* destroy large entries */\n\tindex = szone->num_large_entries;\n\twhile (index--) {\n\t\tlarge = szone->large_entries + index;\n\t\tif (large->address) {\n\t\t\t// we deallocate_pages, including guard pages\n\t\t\tmvm_deallocate_pages((void *)(large->address), large->size, szone->debug_flags);\n\t\t}\n\t}\n\tlarge_entries_free_no_lock(szone, szone->large_entries, szone->num_large_entries, &range_to_deallocate);\n\tif (range_to_deallocate.size) {\n\t\tmvm_deallocate_pages((void *)range_to_deallocate.address, (size_t)range_to_deallocate.size, 0);\n\t}\n\n\t/* destroy allocator regions */\n\track_destroy_regions(&szone->tiny_rack, TINY_REGION_SIZE);\n\track_destroy_regions(&szone->small_rack, SMALL_REGION_SIZE);\n\n\t/* destroy rack region hash rings and racks themselves */\n\track_destroy(&szone->tiny_rack);\n\track_destroy(&szone->small_rack);\n\n\tmvm_deallocate_pages((void *)szone, SZONE_PAGED_SIZE, 0);\n}\n\nsize_t\nszone_good_size(szone_t *szone, size_t size)\n{\n\tmsize_t msize;\n\n\t// Find a good size for this tiny allocation.\n\tif (size <= SMALL_THRESHOLD) {\n\t\tmsize = TINY_MSIZE_FOR_BYTES(size + TINY_QUANTUM - 1);\n\t\tif (!msize) {\n\t\t\tmsize = 1;\n\t\t}\n\t\treturn TINY_BYTES_FOR_MSIZE(msize);\n\t}\n\n\t// Find a good size for this small allocation.\n\tif (size <= szone->large_threshold) {\n\t\tmsize = SMALL_MSIZE_FOR_BYTES(size + SMALL_QUANTUM - 1);\n\t\tif (!msize) {\n\t\t\tmsize = 1;\n\t\t}\n\t\treturn SMALL_BYTES_FOR_MSIZE(msize);\n\t}\n\n\t// Check for integer overflow on the size, since unlike the two cases above,\n\t// there is no upper bound on allocation size at this point.\n\tif (size > round_page_quanta(size)) {\n\t\treturn (size_t)(-1LL);\n\t}\n\n#if DEBUG_MALLOC\n\t// It is not acceptable to see a size of zero here, since that means we\n\t// failed to catch a request for zero bytes in the tiny check, or the size\n\t// overflowed to zero during some arithmetic.\n\tif (size == 0) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"szone_good_size() invariant broken %y\\n\", size);\n\t}\n#endif\n\treturn round_page_quanta(size);\n}\n\nboolean_t\nszone_claimed_address(szone_t *szone, void *ptr)\n{\n\treturn tiny_claimed_address(&szone->tiny_rack, ptr)\n\t\t\t|| small_claimed_address(&szone->small_rack, ptr)\n\t\t\t|| large_claimed_address(szone, ptr);\n}\n\nunsigned szone_check_counter = 0;\nunsigned szone_check_start = 0;\nunsigned szone_check_modulo = 1;\n\nstatic MALLOC_NOINLINE boolean_t\nszone_check_all(szone_t *szone, const char *function)\n{\n\tsize_t index;\n\n\t/* check tiny regions - chould check region count */\n\tfor (index = 0; index < szone->tiny_rack.region_generation->num_regions_allocated; ++index) {\n\t\tregion_t tiny = szone->tiny_rack.region_generation->hashed_regions[index];\n\n\t\tif (HASHRING_REGION_DEALLOCATED == tiny) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (tiny) {\n\t\t\tmagazine_t *tiny_mag_ptr = mag_lock_zine_for_region_trailer(szone->tiny_rack.magazines,\n\t\t\t\t\tREGION_TRAILER_FOR_TINY_REGION(tiny),\n\t\t\t\t\tMAGAZINE_INDEX_FOR_TINY_REGION(tiny));\n\n\t\t\tif (!tiny_check_region(&szone->tiny_rack, tiny, index, szone_check_counter)) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\tszone->debug_flags &= ~CHECK_REGIONS;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t}\n\t}\n\t/* check tiny free lists */\n\tfor (index = 0; index < NUM_TINY_SLOTS; ++index) {\n\t\tif (!tiny_free_list_check(&szone->tiny_rack, (grain_t)index, szone_check_counter)) {\n\t\t\tszone->debug_flags &= ~CHECK_REGIONS;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t/* check small regions - could check region count */\n\tfor (index = 0; index < szone->small_rack.region_generation->num_regions_allocated; ++index) {\n\t\tregion_t small = szone->small_rack.region_generation->hashed_regions[index];\n\n\t\tif (HASHRING_REGION_DEALLOCATED == small) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (small) {\n\t\t\tmagazine_t *small_mag_ptr = mag_lock_zine_for_region_trailer(szone->small_rack.magazines,\n\t\t\t\t\tREGION_TRAILER_FOR_SMALL_REGION(small),\n\t\t\t\t\tMAGAZINE_INDEX_FOR_SMALL_REGION(small));\n\n\t\t\tif (!small_check_region(&szone->small_rack, small, index, szone_check_counter)) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\tszone->debug_flags &= ~CHECK_REGIONS;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t}\n\t}\n\t/* check small free lists */\n\tfor (index = 0; index < SMALL_FREE_SLOT_COUNT(&szone->small_rack); ++index) {\n\t\tif (!small_free_list_check(&szone->small_rack, (grain_t)index, szone_check_counter)) {\n\t\t\tszone->debug_flags &= ~CHECK_REGIONS;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn 1;\n}\n\nstatic boolean_t\nszone_check(szone_t *szone)\n{\n\tif ((++szone_check_counter % 10000) == 0) {\n\t\tmalloc_report(ASL_LEVEL_NOTICE, \"at szone_check counter=%d\\n\", szone_check_counter);\n\t}\n\n\tif (szone_check_counter < szone_check_start) {\n\t\treturn 1;\n\t}\n\n\tif (szone_check_counter % szone_check_modulo) {\n\t\treturn 1;\n\t}\n\n\treturn szone_check_all(szone, \"\");\n}\n\nstatic kern_return_t\nszone_ptr_in_use_enumerator(task_t task,\n\t\tvoid *context,\n\t\tunsigned type_mask,\n\t\tvm_address_t zone_address,\n\t\tmemory_reader_t reader,\n\t\tvm_range_recorder_t recorder)\n{\n\tszone_t *szone;\n\tkern_return_t err;\n\n\tif (!reader) {\n\t\treader = _szone_default_reader;\n\t}\n\n\terr = reader(task, zone_address, sizeof(szone_t), (void **)&szone);\n\tif (err) {\n\t\treturn err;\n\t}\n\n\terr = tiny_in_use_enumerator(task, context, type_mask, szone, reader, recorder);\n\tif (err) {\n\t\treturn err;\n\t}\n\n\terr = small_in_use_enumerator(task, context, type_mask, szone, reader, recorder);\n\tif (err) {\n\t\treturn err;\n\t}\n\n\terr = large_in_use_enumerator(\n\t\t\ttask, context, type_mask, (vm_address_t)szone->large_entries, szone->num_large_entries, reader, recorder);\n\treturn err;\n}\n\n// Following method is deprecated: use scalable_zone_statistics instead\nvoid\nscalable_zone_info(malloc_zone_t *zone, unsigned *info_to_fill, unsigned count)\n{\n\tszone_t *szone = (void *)zone;\n\tunsigned info[13];\n\n\t// We do not lock to facilitate debug\n\n\tsize_t s = 0;\n\tunsigned t = 0;\n\tsize_t u = 0;\n\tmag_index_t mag_index;\n\n\tfor (mag_index = -1; mag_index < szone->tiny_rack.num_magazines; mag_index++) {\n\t\ts += szone->tiny_rack.magazines[mag_index].mag_bytes_free_at_start;\n\t\ts += szone->tiny_rack.magazines[mag_index].mag_bytes_free_at_end;\n\t\tt += szone->tiny_rack.magazines[mag_index].mag_num_objects;\n\t\tu += szone->tiny_rack.magazines[mag_index].mag_num_bytes_in_objects;\n\t}\n\n\tinfo[4] = (unsigned)t;\n\tinfo[5] = (unsigned)u;\n\n\tfor (t = 0, u = 0, mag_index = -1; mag_index < szone->small_rack.num_magazines; mag_index++) {\n\t\ts += szone->small_rack.magazines[mag_index].mag_bytes_free_at_start;\n\t\ts += szone->small_rack.magazines[mag_index].mag_bytes_free_at_end;\n\t\tt += szone->small_rack.magazines[mag_index].mag_num_objects;\n\t\tu += szone->small_rack.magazines[mag_index].mag_num_bytes_in_objects;\n\t}\n\n\tinfo[6] = (unsigned)t;\n\tinfo[7] = (unsigned)u;\n\n\tinfo[8] = (unsigned)szone->num_large_objects_in_use;\n\tinfo[9] = (unsigned)szone->num_bytes_in_large_objects;\n\n\tinfo[10] = 0; // DEPRECATED szone->num_huge_entries;\n\tinfo[11] = 0; // DEPRECATED szone->num_bytes_in_huge_objects;\n\n\tinfo[12] = szone->debug_flags;\n\n\tinfo[0] = info[4] + info[6] + info[8] + info[10];\n\tinfo[1] = info[5] + info[7] + info[9] + info[11];\n\n\tinfo[3] = (unsigned)(szone->tiny_rack.num_regions - szone->tiny_rack.num_regions_dealloc) * TINY_REGION_SIZE +\n\t\t\t (unsigned)(szone->small_rack.num_regions - szone->small_rack.num_regions_dealloc) * SMALL_REGION_SIZE + info[9] + info[11];\n\n\tinfo[2] = info[3] - (unsigned)s;\n\tmemcpy(info_to_fill, info, sizeof(unsigned) * count);\n}\n\n// FIXME: consistent picture requires locking!\nstatic MALLOC_NOINLINE void\nszone_print(szone_t *szone, boolean_t verbose)\n{\n\tunsigned info[13];\n\tsize_t index;\n\tregion_t region;\n\n\tscalable_zone_info((void *)szone, info, 13);\n\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX,\n\t\t\t\"Scalable zone %p: inUse=%u(%y) touched=%y allocated=%y flags=%d\\n\", szone, info[0], info[1], info[2], info[3],\n\t\t\tinfo[12]);\n\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"\\ttiny=%u(%y) small=%u(%y) large=%u(%y) huge=%u(%y)\\n\", info[4],\n\t\t\tinfo[5], info[6], info[7], info[8], info[9], info[10], info[11]);\n\t// tiny\n\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%lu tiny regions:\\n\", szone->tiny_rack.num_regions);\n\tif (szone->tiny_rack.num_regions_dealloc) {\n\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"[%lu tiny regions have been vm_deallocate'd]\\n\",\n\t\t\t\tszone->tiny_rack.num_regions_dealloc);\n\t}\n\tfor (index = 0; index < szone->tiny_rack.region_generation->num_regions_allocated; ++index) {\n\t\tregion = szone->tiny_rack.region_generation->hashed_regions[index];\n\t\tif (HASHRING_OPEN_ENTRY != region && HASHRING_REGION_DEALLOCATED != region) {\n\t\t\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_TINY_REGION(region);\n\t\t\tprint_tiny_region(verbose, region, (region == szone->tiny_rack.magazines[mag_index].mag_last_region)\n\t\t\t\t\t\t\t\t\t\t\t\t\t ? szone->tiny_rack.magazines[mag_index].mag_bytes_free_at_start\n\t\t\t\t\t\t\t\t\t\t\t\t\t : 0,\n\t\t\t\t\t(region == szone->tiny_rack.magazines[mag_index].mag_last_region)\n\t\t\t\t\t\t\t? szone->tiny_rack.magazines[mag_index].mag_bytes_free_at_end\n\t\t\t\t\t\t\t: 0);\n\t\t}\n\t}\n\tif (verbose) {\n\t\tprint_tiny_free_list(&szone->tiny_rack);\n\t}\n\t// small\n\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%lu small regions:\\n\", szone->small_rack.num_regions);\n\tif (szone->small_rack.num_regions_dealloc) {\n\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"[%lu small regions have been vm_deallocate'd]\\n\",\n\t\t\t\tszone->small_rack.num_regions_dealloc);\n\t}\n\tfor (index = 0; index < szone->small_rack.region_generation->num_regions_allocated; ++index) {\n\t\tregion = szone->small_rack.region_generation->hashed_regions[index];\n\t\tif (HASHRING_OPEN_ENTRY != region && HASHRING_REGION_DEALLOCATED != region) {\n\t\t\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_SMALL_REGION(region);\n\t\t\tprint_small_region(szone, verbose, region, (region == szone->small_rack.magazines[mag_index].mag_last_region)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t ? szone->small_rack.magazines[mag_index].mag_bytes_free_at_start\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t : 0,\n\t\t\t\t\t(region == szone->small_rack.magazines[mag_index].mag_last_region)\n\t\t\t\t\t\t\t? szone->small_rack.magazines[mag_index].mag_bytes_free_at_end\n\t\t\t\t\t\t\t: 0);\n\t\t}\n\t}\n\tif (verbose) {\n\t\tprint_small_free_list(&szone->small_rack);\n\t}\n}\n\nstatic void\nszone_log(malloc_zone_t *zone, void *log_address)\n{\n\tszone_t *szone = (szone_t *)zone;\n\n\tszone->log_address = log_address;\n}\n\n// \n// When forcing the lock on the entire zone, make sure we are out of the critical section in each magazine\nstatic MALLOC_INLINE void\nszone_force_lock_magazine(szone_t *szone, magazine_t *mag)\n{\n\twhile (1) {\n\t\tSZONE_MAGAZINE_PTR_LOCK(mag);\n\t\tif (!mag->alloc_underway) {\n\t\t\treturn;\n\t\t}\n\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(mag);\n\t\tyield();\n\t}\n}\n\nstatic void\nszone_force_lock(szone_t *szone)\n{\n\tmag_index_t i;\n\n\tfor (i = 0; i < szone->tiny_rack.num_magazines; ++i) {\n\t\tszone_force_lock_magazine(szone, &szone->tiny_rack.magazines[i]);\n\t}\n\tszone_force_lock_magazine(szone, &szone->tiny_rack.magazines[DEPOT_MAGAZINE_INDEX]);\n\n\tfor (i = 0; i < szone->small_rack.num_magazines; ++i) {\n\t\tszone_force_lock_magazine(szone, &szone->small_rack.magazines[i]);\n\t}\n\tszone_force_lock_magazine(szone, &szone->small_rack.magazines[DEPOT_MAGAZINE_INDEX]);\n\n\tSZONE_LOCK(szone);\n}\n\nstatic void\nszone_force_unlock(szone_t *szone)\n{\n\tmag_index_t i;\n\n\tSZONE_UNLOCK(szone);\n\n\tfor (i = -1; i < szone->small_rack.num_magazines; ++i) {\n\t\tSZONE_MAGAZINE_PTR_UNLOCK((&(szone->small_rack.magazines[i])));\n\t}\n\n\tfor (i = -1; i < szone->tiny_rack.num_magazines; ++i) {\n\t\tSZONE_MAGAZINE_PTR_UNLOCK((&(szone->tiny_rack.magazines[i])));\n\t}\n}\n\nstatic void\nszone_reinit_lock(szone_t *szone)\n{\n\tmag_index_t i;\n\n\tSZONE_REINIT_LOCK(szone);\n\n\tfor (i = -1; i < szone->small_rack.num_magazines; ++i) {\n\t\tSZONE_MAGAZINE_PTR_REINIT_LOCK((&(szone->small_rack.magazines[i])));\n\t}\n\n\tfor (i = -1; i < szone->tiny_rack.num_magazines; ++i) {\n\t\tSZONE_MAGAZINE_PTR_REINIT_LOCK((&(szone->tiny_rack.magazines[i])));\n\t}\n}\n\nstatic boolean_t\nszone_locked(szone_t *szone)\n{\n\tmag_index_t i;\n\tint tookLock;\n\n\ttookLock = SZONE_TRY_LOCK(szone);\n\tif (tookLock == 0) {\n\t\treturn 1;\n\t}\n\tSZONE_UNLOCK(szone);\n\n\tfor (i = -1; i < szone->small_rack.num_magazines; ++i) {\n\t\ttookLock = SZONE_MAGAZINE_PTR_TRY_LOCK((&(szone->small_rack.magazines[i])));\n\t\tif (tookLock == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tSZONE_MAGAZINE_PTR_UNLOCK((&(szone->small_rack.magazines[i])));\n\t}\n\n\tfor (i = -1; i < szone->tiny_rack.num_magazines; ++i) {\n\t\ttookLock = SZONE_MAGAZINE_PTR_TRY_LOCK((&(szone->tiny_rack.magazines[i])));\n\t\tif (tookLock == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tSZONE_MAGAZINE_PTR_UNLOCK((&(szone->tiny_rack.magazines[i])));\n\t}\n\treturn 0;\n}\n\nsize_t\nszone_pressure_relief(szone_t *szone, size_t goal)\n{\n\tsize_t total = 0;\n\n\tMAGMALLOC_PRESSURERELIEFBEGIN((void *)szone, szone->basic_zone.zone_name, (int)goal); // DTrace USDT Probe\n\tMALLOC_TRACE(TRACE_malloc_memory_pressure | DBG_FUNC_START, (uint64_t)szone, goal, 0, 0);\n\n#if CONFIG_MADVISE_PRESSURE_RELIEF\n\tmag_index_t mag_index;\n\n\tmagazine_t *tiny_depot_ptr = (&szone->tiny_rack.magazines[DEPOT_MAGAZINE_INDEX]);\n\tmagazine_t *small_depot_ptr = (&szone->small_rack.magazines[DEPOT_MAGAZINE_INDEX]);\n\n\tfor (mag_index = 0; mag_index < szone->tiny_rack.num_magazines; mag_index++) {\n\t\tsize_t index;\n\t\tfor (index = 0; index < szone->tiny_rack.region_generation->num_regions_allocated; ++index) {\n\t\t\tSZONE_LOCK(szone);\n\n\t\t\tregion_t tiny = szone->tiny_rack.region_generation->hashed_regions[index];\n\t\t\tif (!tiny || tiny == HASHRING_REGION_DEALLOCATED) {\n\t\t\t\tSZONE_UNLOCK(szone);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tmagazine_t *mag_ptr = mag_lock_zine_for_region_trailer(szone->tiny_rack.magazines,\n\t\t\t\t\tREGION_TRAILER_FOR_TINY_REGION(tiny),\n\t\t\t\t\tMAGAZINE_INDEX_FOR_TINY_REGION(tiny));\n\t\t\tSZONE_UNLOCK(szone);\n\n\t\t\t/* Ordering is important here, the magazine of a region may potentially change\n\t\t\t * during mag_lock_zine_for_region_trailer, so src_mag_index must be taken\n\t\t\t * after we've obtained the lock.\n\t\t\t */\n\t\t\tmag_index_t src_mag_index = MAGAZINE_INDEX_FOR_TINY_REGION(tiny);\n\n\t\t\t/* We can (and must) ignore magazines that are already in the recirc depot. */\n\t\t\tif (src_mag_index == DEPOT_MAGAZINE_INDEX) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(mag_ptr);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (tiny == mag_ptr->mag_last_region && (mag_ptr->mag_bytes_free_at_end || mag_ptr->mag_bytes_free_at_start)) {\n\t\t\t\ttiny_finalize_region(&szone->tiny_rack, mag_ptr);\n\t\t\t}\n\n\t\t\t/* Because this region is currently in use, we can't safely madvise it while\n\t\t\t * it's attached to the magazine. For this operation we have to remove it from\n\t\t\t * the current mag, attach it to the depot and then madvise.\n\t\t\t */\n\n\t\t\trecirc_list_extract(&szone->tiny_rack, mag_ptr, REGION_TRAILER_FOR_TINY_REGION(tiny));\n\t\t\tint objects_in_use = tiny_free_detach_region(&szone->tiny_rack, mag_ptr, tiny);\n\n\t\t\tSZONE_MAGAZINE_PTR_LOCK(tiny_depot_ptr);\n\t\t\tMAGAZINE_INDEX_FOR_TINY_REGION(tiny) = DEPOT_MAGAZINE_INDEX;\n\t\t\tREGION_TRAILER_FOR_TINY_REGION(tiny)->pinned_to_depot = 0;\n\n\t\t\tsize_t bytes_inplay = tiny_free_reattach_region(&szone->tiny_rack, tiny_depot_ptr, tiny);\n\n\t\t\t/* Fix up the metadata of the target magazine while the region is in the depot. */\n\t\t\tmag_ptr->mag_num_bytes_in_objects -= bytes_inplay;\n\t\t\tmag_ptr->num_bytes_in_magazine -= TINY_REGION_PAYLOAD_BYTES;\n\t\t\tmag_ptr->mag_num_objects -= objects_in_use;\n\n\t\t\t/* Now we can drop the magazine lock of the source mag. */\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(mag_ptr);\n\n\t\t\ttiny_depot_ptr->mag_num_bytes_in_objects += bytes_inplay;\n\t\t\ttiny_depot_ptr->num_bytes_in_magazine += TINY_REGION_PAYLOAD_BYTES;\n\t\t\ttiny_depot_ptr->mag_num_objects -= objects_in_use;\n\n\t\t\trecirc_list_splice_last(&szone->tiny_rack, tiny_depot_ptr, REGION_TRAILER_FOR_TINY_REGION(tiny));\n\n\t\t\t/* Actually do the scan, done holding the depot lock, the call will drop the lock\n\t\t\t * around the actual madvise syscalls.\n\t\t\t */\n\t\t\ttiny_free_scan_madvise_free(&szone->tiny_rack, tiny_depot_ptr, tiny);\n\n\t\t\t/* Now the region is in the recirc depot, the next allocations to require more\n\t\t\t * blocks will come along and take one of these regions back out of the depot.\n\t\t\t * As OS X madvise's reuse on an per-region basis, we leave as many of these\n\t\t\t * regions in the depot as possible after memory pressure.\n\t\t\t */\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_depot_ptr);\n\t\t}\n\t}\n\n\tfor (mag_index = 0; mag_index < szone->small_rack.num_magazines; mag_index++) {\n\t\tsize_t index;\n\t\tfor (index = 0; index < szone->small_rack.region_generation->num_regions_allocated; ++index) {\n\t\t\tSZONE_LOCK(szone);\n\n\t\t\tregion_t small = szone->small_rack.region_generation->hashed_regions[index];\n\t\t\tif (!small || small == HASHRING_REGION_DEALLOCATED) {\n\t\t\t\tSZONE_UNLOCK(szone);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tmagazine_t *mag_ptr = mag_lock_zine_for_region_trailer(szone->small_rack.magazines,\n\t\t\t\t\tREGION_TRAILER_FOR_SMALL_REGION(small),\n\t\t\t\t\tMAGAZINE_INDEX_FOR_SMALL_REGION(small));\n\t\t\tSZONE_UNLOCK(szone);\n\n\t\t\t/* Ordering is important here, the magazine of a region may potentially change\n\t\t\t * during mag_lock_zine_for_region_trailer, so src_mag_index must be taken\n\t\t\t * after we've obtained the lock.\n\t\t\t */\n\t\t\tmag_index_t src_mag_index = MAGAZINE_INDEX_FOR_SMALL_REGION(small);\n\n\t\t\t/* We can (and must) ignore magazines that are already in the recirc depot. */\n\t\t\tif (src_mag_index == DEPOT_MAGAZINE_INDEX) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(mag_ptr);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (small == mag_ptr->mag_last_region && (mag_ptr->mag_bytes_free_at_end || mag_ptr->mag_bytes_free_at_start)) {\n\t\t\t\tsmall_finalize_region(&szone->small_rack, mag_ptr);\n\t\t\t}\n\n\t\t\t/* Because this region is currently in use, we can't safely madvise it while\n\t\t\t * it's attached to the magazine. For this operation we have to remove it from\n\t\t\t * the current mag, attach it to the depot and then madvise.\n\t\t\t */\n\n\t\t\trecirc_list_extract(&szone->small_rack, mag_ptr, REGION_TRAILER_FOR_SMALL_REGION(small));\n\t\t\tint objects_in_use = small_free_detach_region(&szone->small_rack, mag_ptr, small);\n\n\t\t\tSZONE_MAGAZINE_PTR_LOCK(small_depot_ptr);\n\t\t\tMAGAZINE_INDEX_FOR_SMALL_REGION(small) = DEPOT_MAGAZINE_INDEX;\n\t\t\tREGION_TRAILER_FOR_SMALL_REGION(small)->pinned_to_depot = 0;\n\n\t\t\tsize_t bytes_inplay = small_free_reattach_region(&szone->small_rack, small_depot_ptr, small);\n\n\t\t\t/* Fix up the metadata of the target magazine while the region is in the depot. */\n\t\t\tmag_ptr->mag_num_bytes_in_objects -= bytes_inplay;\n\t\t\tmag_ptr->num_bytes_in_magazine -= SMALL_REGION_PAYLOAD_BYTES;\n\t\t\tmag_ptr->mag_num_objects -= objects_in_use;\n\n\t\t\t/* Now we can drop the magazine lock of the source mag. */\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(mag_ptr);\n\n\t\t\tsmall_depot_ptr->mag_num_bytes_in_objects += bytes_inplay;\n\t\t\tsmall_depot_ptr->num_bytes_in_magazine += SMALL_REGION_PAYLOAD_BYTES;\n\t\t\tsmall_depot_ptr->mag_num_objects -= objects_in_use;\n\n\t\t\trecirc_list_splice_last(&szone->small_rack, small_depot_ptr, REGION_TRAILER_FOR_SMALL_REGION(small));\n\n\t\t\t/* Actually do the scan, done holding the depot lock, the call will drop the lock\n\t\t\t * around the actual madvise syscalls.\n\t\t\t */\n\t\t\tsmall_free_scan_madvise_free(&szone->small_rack, small_depot_ptr, small);\n\n\t\t\t/* Now the region is in the recirc depot, the next allocations to require more\n\t\t\t * blocks will come along and take one of these regions back out of the depot.\n\t\t\t * As OS X madvise's reuse on an per-region basis, we leave as many of these\n\t\t\t * regions in the depot as possible after memory pressure.\n\t\t\t */\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_depot_ptr);\n\t\t}\n\t}\n#endif\n\n#if CONFIG_LARGE_CACHE\n\tif (szone->flotsam_enabled) {\n\t\tSZONE_LOCK(szone);\n\n\t\t// stack allocated copy of the death-row cache\n\t\tint idx = szone->large_entry_cache_oldest, idx_max = szone->large_entry_cache_newest;\n\t\tlarge_entry_t local_entry_cache[LARGE_ENTRY_CACHE_SIZE];\n\n\t\tmemcpy((void *)local_entry_cache, (void *)szone->large_entry_cache, sizeof(local_entry_cache));\n\n\t\tszone->large_entry_cache_oldest = szone->large_entry_cache_newest = 0;\n\t\tszone->large_entry_cache[0].address = 0x0;\n\t\tszone->large_entry_cache[0].size = 0;\n\t\tszone->large_entry_cache_bytes = 0;\n\t\tszone->large_entry_cache_reserve_bytes = 0;\n\n\t\tszone->flotsam_enabled = FALSE;\n\n\t\tSZONE_UNLOCK(szone);\n\n\t\t// deallocate the death-row cache outside the zone lock\n\t\tsize_t total = 0;\n\t\twhile (idx != idx_max) {\n\t\t\tmvm_deallocate_pages((void *)local_entry_cache[idx].address, local_entry_cache[idx].size, 0);\n\t\t\ttotal += local_entry_cache[idx].size;\n\t\t\tif (++idx == LARGE_ENTRY_CACHE_SIZE) {\n\t\t\t\tidx = 0;\n\t\t\t}\n\t\t}\n\t\tif (0 != local_entry_cache[idx].address && 0 != local_entry_cache[idx].size) {\n\t\t\tmvm_deallocate_pages((void *)local_entry_cache[idx].address, local_entry_cache[idx].size, 0);\n\t\t\ttotal += local_entry_cache[idx].size;\n\t\t}\n\t}\n#endif\n\n\tMAGMALLOC_PRESSURERELIEFEND((void *)szone, szone->basic_zone.zone_name, (int)goal, (int)total); // DTrace USDT Probe\n\tMALLOC_TRACE(TRACE_malloc_memory_pressure | DBG_FUNC_END, (uint64_t)szone, goal, total, 0);\n\n\treturn total;\n}\n\nboolean_t\nscalable_zone_statistics(malloc_zone_t *zone, malloc_statistics_t *stats, unsigned subzone)\n{\n\tszone_t *szone = (szone_t *)zone;\n\n\tswitch (subzone) {\n\tcase 0: {\n\t\tsize_t s = 0;\n\t\tunsigned t = 0;\n\t\tsize_t u = 0;\n\t\tmag_index_t mag_index;\n\n\t\tfor (mag_index = -1; mag_index < szone->tiny_rack.num_magazines; mag_index++) {\n\t\t\ts += szone->tiny_rack.magazines[mag_index].mag_bytes_free_at_start;\n\t\t\ts += szone->tiny_rack.magazines[mag_index].mag_bytes_free_at_end;\n\t\t\tt += szone->tiny_rack.magazines[mag_index].mag_num_objects;\n\t\t\tu += szone->tiny_rack.magazines[mag_index].mag_num_bytes_in_objects;\n\t\t}\n\n\t\tstats->blocks_in_use = t;\n\t\tstats->size_in_use = u;\n\t\tstats->size_allocated = (szone->tiny_rack.num_regions - szone->tiny_rack.num_regions_dealloc) * TINY_REGION_SIZE;\n\t\tstats->max_size_in_use = stats->size_allocated - s;\n\t\treturn 1;\n\t}\n\tcase 1: {\n\t\tsize_t s = 0;\n\t\tunsigned t = 0;\n\t\tsize_t u = 0;\n\t\tmag_index_t mag_index;\n\n\t\tfor (mag_index = -1; mag_index < szone->small_rack.num_magazines; mag_index++) {\n\t\t\ts += szone->small_rack.magazines[mag_index].mag_bytes_free_at_start;\n\t\t\ts += szone->small_rack.magazines[mag_index].mag_bytes_free_at_end;\n\t\t\tt += szone->small_rack.magazines[mag_index].mag_num_objects;\n\t\t\tu += szone->small_rack.magazines[mag_index].mag_num_bytes_in_objects;\n\t\t}\n\n\t\tstats->blocks_in_use = t;\n\t\tstats->size_in_use = u;\n\t\tstats->size_allocated = (szone->small_rack.num_regions - szone->small_rack.num_regions_dealloc) * SMALL_REGION_SIZE;\n\t\tstats->max_size_in_use = stats->size_allocated - s;\n\t\treturn 1;\n\t}\n\tcase 2:\n\t\tstats->blocks_in_use = szone->num_large_objects_in_use;\n\t\tstats->size_in_use = szone->num_bytes_in_large_objects;\n\t\tstats->max_size_in_use = stats->size_allocated = stats->size_in_use;\n\t\treturn 1;\n\tcase 3:\n\t\tstats->blocks_in_use = 0; // DEPRECATED szone->num_huge_entries;\n\t\tstats->size_in_use = 0; // DEPRECATED szone->num_bytes_in_huge_objects;\n\t\tstats->max_size_in_use = stats->size_allocated = 0;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\nstatic void\nszone_statistics(szone_t *szone, malloc_statistics_t *stats)\n{\n\tsize_t large;\n\n\tsize_t s = 0;\n\tunsigned t = 0;\n\tsize_t u = 0;\n\tmag_index_t mag_index;\n\n\tfor (mag_index = -1; mag_index < szone->tiny_rack.num_magazines; mag_index++) {\n\t\ts += szone->tiny_rack.magazines[mag_index].mag_bytes_free_at_start;\n\t\ts += szone->tiny_rack.magazines[mag_index].mag_bytes_free_at_end;\n\t\tt += szone->tiny_rack.magazines[mag_index].mag_num_objects;\n\t\tu += szone->tiny_rack.magazines[mag_index].mag_num_bytes_in_objects;\n\t}\n\n\tfor (mag_index = -1; mag_index < szone->small_rack.num_magazines; mag_index++) {\n\t\ts += szone->small_rack.magazines[mag_index].mag_bytes_free_at_start;\n\t\ts += szone->small_rack.magazines[mag_index].mag_bytes_free_at_end;\n\t\tt += szone->small_rack.magazines[mag_index].mag_num_objects;\n\t\tu += szone->small_rack.magazines[mag_index].mag_num_bytes_in_objects;\n\t}\n\n\tlarge = szone->num_bytes_in_large_objects + 0; // DEPRECATED szone->num_bytes_in_huge_objects;\n\n\tstats->blocks_in_use = t + szone->num_large_objects_in_use + 0; // DEPRECATED szone->num_huge_entries;\n\tstats->size_in_use = u + large;\n\tstats->max_size_in_use = stats->size_allocated =\n\t\t\t(szone->tiny_rack.num_regions - szone->tiny_rack.num_regions_dealloc) * TINY_REGION_SIZE +\n\t\t\t(szone->small_rack.num_regions - szone->small_rack.num_regions_dealloc) * SMALL_REGION_SIZE + large;\n\t// Now we account for the untouched areas\n\tstats->max_size_in_use -= s;\n}\n\nconst struct malloc_introspection_t szone_introspect = {\n\t\t(void *)szone_ptr_in_use_enumerator, (void *)szone_good_size, (void *)szone_check, (void *)szone_print, szone_log,\n\t\t(void *)szone_force_lock, (void *)szone_force_unlock, (void *)szone_statistics, (void *)szone_locked, NULL, NULL, NULL,\n\t\tNULL, /* Zone enumeration version 7 and forward. */\n\t\t(void *)szone_reinit_lock, // reinit_lock version 9 and foward\n}; // marked as const to spare the DATA section\n\nszone_t *\ncreate_scalable_szone(size_t initial_size, unsigned debug_flags)\n{\n\tszone_t *szone;\n\n#if defined(__i386__) || defined(__x86_64__)\n\tif (_COMM_PAGE_VERSION_REQD > (*((uint16_t *)_COMM_PAGE_VERSION))) {\n\t\tMALLOC_REPORT_FATAL_ERROR((*((uint16_t *)_COMM_PAGE_VERSION)), \"comm page version mismatch\");\n\t}\n#endif\n\n\t/* get memory for the zone. */\n\tszone = mvm_allocate_pages(SZONE_PAGED_SIZE, 0, 0, VM_MEMORY_MALLOC);\n\tif (!szone) {\n\t\treturn NULL;\n\t}\n\n/* set up the szone structure */\n#if 0\n#warning CHECK_REGIONS enabled\n\tdebug_flags |= CHECK_REGIONS;\n#endif\n#if 0\n#warning LOG enabled\n\tszone->log_address = ~0;\n#endif\n\n\tif (mvm_aslr_enabled()) {\n\t\tdebug_flags &= ~DISABLE_ASLR;\n\t} else {\n\t\tdebug_flags |= DISABLE_ASLR;\n\t}\n\n#if CONFIG_SMALL_CUTOFF_DYNAMIC || CONFIG_LARGE_CACHE\n\tuint64_t memsize = platform_hw_memsize();\n#endif\n\n\tbool is_largemem = false;\n#if CONFIG_SMALL_CUTOFF_LARGEMEM\n\tis_largemem = true;\n#elif CONFIG_SMALL_CUTOFF_DYNAMIC\n\t// TODO: rdar://problem/35395572\n\t// switch to largemem thresholds on devices with > 2 cores and > 2gb of memory\n\tuint32_t nproc = platform_cpu_count();\n\tis_largemem = (nproc > 2) && (memsize > (2ull << 30));\n#endif\n\tif (is_largemem) {\n\t\tdebug_flags |= MALLOC_EXTENDED_SMALL_SLOTS;\n\t\tszone->is_largemem = 1;\n\t\tszone->large_threshold = LARGE_THRESHOLD_LARGEMEM;\n\t\tszone->vm_copy_threshold = VM_COPY_THRESHOLD_LARGEMEM;\n\t} else {\n\t\tdebug_flags &= ~MALLOC_EXTENDED_SMALL_SLOTS;\n\t\tszone->is_largemem = 0;\n\t\tszone->large_threshold = LARGE_THRESHOLD;\n\t\tszone->vm_copy_threshold = VM_COPY_THRESHOLD;\n\t}\n\n\t// Query the number of configured processors.\n\t// Uniprocessor case gets just one tiny and one small magazine (whose index is zero). This gives\n\t// the same behavior as the original scalable malloc. MP gets per-CPU magazines\n\t// that scale (way) better.\n\tunsigned int max_mags = mag_max_magazines();\n\tuint32_t num_magazines = (max_mags > 1) ? MIN(max_mags, TINY_MAX_MAGAZINES) : 1;\n\track_init(&szone->tiny_rack, RACK_TYPE_TINY, num_magazines, debug_flags);\n\track_init(&szone->small_rack, RACK_TYPE_SMALL, num_magazines, debug_flags);\n\n#if CONFIG_LARGE_CACHE\n\t// madvise(..., MADV_REUSABLE) death-row arrivals above this threshold [~0.1%]\n\tszone->large_entry_cache_reserve_limit = (size_t)(memsize >> 10);\n\n\t/* Reset protection when returning a previous large allocation? */\n\tint32_t libSystemVersion = NSVersionOfLinkTimeLibrary(\"System\");\n\tif ((-1 != libSystemVersion) && ((libSystemVersion >> 16) < 112) /* CFSystemVersionSnowLeopard */) {\n\t\tszone->large_legacy_reset_mprotect = TRUE;\n\t} else {\n\t\tszone->large_legacy_reset_mprotect = FALSE;\n\t}\n#endif\n\n\t// Initialize the security token.\n\tszone->cookie = (uintptr_t)malloc_entropy[0];\n\n\tszone->basic_zone.version = 10;\n\tszone->basic_zone.size = (void *)szone_size;\n\tszone->basic_zone.malloc = (void *)szone_malloc;\n\tszone->basic_zone.calloc = (void *)szone_calloc;\n\tszone->basic_zone.valloc = (void *)szone_valloc;\n\tszone->basic_zone.free = (void *)szone_free;\n\tszone->basic_zone.realloc = (void *)szone_realloc;\n\tszone->basic_zone.destroy = (void *)szone_destroy;\n\tszone->basic_zone.batch_malloc = (void *)szone_batch_malloc;\n\tszone->basic_zone.batch_free = (void *)szone_batch_free;\n\tszone->basic_zone.introspect = (struct malloc_introspection_t *)&szone_introspect;\n\tszone->basic_zone.memalign = (void *)szone_memalign;\n\tszone->basic_zone.free_definite_size = (void *)szone_free_definite_size;\n\tszone->basic_zone.pressure_relief = (void *)szone_pressure_relief;\n\tszone->basic_zone.claimed_address = (void *)szone_claimed_address;\n\n\t/* Set to zero once and for all as required by CFAllocator. */\n\tszone->basic_zone.reserved1 = 0;\n\t/* Set to zero once and for all as required by CFAllocator. */\n\tszone->basic_zone.reserved2 = 0;\n\n\t/* Prevent overwriting the function pointers in basic_zone. */\n\tmprotect(szone, sizeof(szone->basic_zone), PROT_READ);\n\n\tszone->debug_flags = debug_flags;\n\t_malloc_lock_init(&szone->large_szone_lock);\n\n\tszone->cpu_id_key = -1UL; // Unused.\n\n\tCHECK(szone, __PRETTY_FUNCTION__);\n\treturn szone;\n}\n\nmalloc_zone_t *\ncreate_scalable_zone(size_t initial_size, unsigned debug_flags) {\n\treturn (malloc_zone_t *) create_scalable_szone(initial_size, debug_flags);\n}\n\n/* vim: set noet:ts=4:sw=4:cindent: */\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_malloc.h",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __MAGAZINE_MALLOC_H\n#define __MAGAZINE_MALLOC_H\n\n// MARK: magazine_malloc\n\nMALLOC_NOEXPORT\nmalloc_zone_t *\ncreate_scalable_zone(size_t initial_size, unsigned debug_flags);\n\nMALLOC_NOEXPORT\nszone_t *\ncreate_scalable_szone(size_t initial_size, unsigned debug_flags);\n\nMALLOC_EXPORT\nboolean_t\nscalable_zone_statistics(malloc_zone_t *zone, malloc_statistics_t *stats, unsigned subzone);\n\nMALLOC_NOEXPORT\nextern int max_magazines;\n\nMALLOC_NOEXPORT\nextern int recirc_retained_regions;\n\n// MARK: magazine_malloc utility functions\n\nMALLOC_NOEXPORT\nextern const\nstruct malloc_introspection_t szone_introspect;\n\nMALLOC_NOEXPORT\nvoid\nszone_batch_free(szone_t *szone, void **to_be_freed, unsigned count);\n\nMALLOC_NOEXPORT\nunsigned\nszone_batch_malloc(szone_t *szone, size_t size, void **results, unsigned count);\n\nMALLOC_NOEXPORT\nvoid *\nszone_calloc(szone_t *szone, size_t num_items, size_t size);\n\nMALLOC_NOEXPORT\nvoid\nszone_free(szone_t *szone, void *ptr);\n\nMALLOC_NOEXPORT\nvoid\nszone_free_definite_size(szone_t *szone, void *ptr, size_t size);\n\nMALLOC_NOEXPORT\nsize_t\nszone_good_size(szone_t *szone, size_t size);\n\nMALLOC_NOEXPORT\nvoid *\nszone_malloc(szone_t *szone, size_t size);\n\nMALLOC_NOEXPORT\nvoid *\nszone_memalign(szone_t *szone, size_t alignment, size_t size);\n\nMALLOC_NOEXPORT\nsize_t\nszone_pressure_relief(szone_t *szone, size_t goal);\n\nMALLOC_NOEXPORT\nboolean_t\nszone_claimed_address(szone_t *szone, void *ptr);\n\nMALLOC_NOEXPORT\nvoid *\nszone_realloc(szone_t *szone, void *ptr, size_t new_size);\n\nMALLOC_NOEXPORT\nsize_t\nszone_size(szone_t *szone, const void *ptr);\n\nMALLOC_NOEXPORT\nsize_t\nszone_size_try_large(szone_t *szone, const void *ptr);\n\nMALLOC_NOEXPORT\nvoid *\nszone_valloc(szone_t *szone, size_t size);\n\n// MARK: tiny region allocator functions\n\nMALLOC_NOEXPORT\nboolean_t\ntiny_check_region(rack_t *rack, region_t region, size_t region_index,\n\t\tunsigned counter);\n\nMALLOC_NOEXPORT\nvoid\ntiny_finalize_region(rack_t *rack, magazine_t *tiny_mag_ptr);\n\nMALLOC_NOEXPORT\nint\ntiny_free_detach_region(rack_t *rack, magazine_t *tiny_mag_ptr, region_t r);\n\nMALLOC_NOEXPORT\nboolean_t\ntiny_free_list_check(rack_t *rack, grain_t slot, unsigned counter);\n\nMALLOC_NOEXPORT\nboolean_t\ntiny_free_no_lock(rack_t *rack, magazine_t *tiny_mag_ptr, mag_index_t mag_index, region_t region, void *ptr, msize_t msize);\n\nMALLOC_NOEXPORT\nsize_t\ntiny_free_reattach_region(rack_t *rack, magazine_t *tiny_mag_ptr, region_t r);\n\nMALLOC_NOEXPORT\nvoid\ntiny_free_scan_madvise_free(rack_t *rack, magazine_t *depot_ptr, region_t r);\n\nMALLOC_NOEXPORT\nkern_return_t\ntiny_in_use_enumerator(task_t task, void *context, unsigned type_mask, szone_t *szone, memory_reader_t reader,\n\t\tvm_range_recorder_t recorder);\n\nMALLOC_NOEXPORT\nvoid *\ntiny_malloc_from_free_list(rack_t *rack, magazine_t *tiny_mag_ptr, mag_index_t mag_index, msize_t msize);\n\nMALLOC_NOEXPORT\nvoid *\ntiny_malloc_should_clear(rack_t *rack, msize_t msize, boolean_t cleared_requested);\n\nMALLOC_NOEXPORT\nvoid *\ntiny_memalign(szone_t *szone, size_t alignment, size_t size, size_t span);\n\nMALLOC_NOEXPORT\nboolean_t\ntiny_claimed_address(rack_t *rack, void *ptr);\n\nMALLOC_NOEXPORT\nvoid *\ntiny_try_shrink_in_place(rack_t *rack, void *ptr, size_t old_size, size_t new_good_size);\n\nMALLOC_NOEXPORT\nboolean_t\ntiny_try_realloc_in_place(rack_t *rack, void *ptr, size_t old_size, size_t new_size);\n\nMALLOC_NOEXPORT\nvoid\nfree_tiny(rack_t *rack, void *ptr, region_t tiny_region, size_t known_size);\n\nMALLOC_NOEXPORT\nsize_t\ntiny_size(rack_t *rack, const void *ptr);\n\nMALLOC_NOEXPORT\nunsigned\ntiny_batch_malloc(szone_t *szone, size_t size, void **results, unsigned count);\n\nMALLOC_NOEXPORT\nvoid\ntiny_batch_free(szone_t *szone, void **to_be_freed, unsigned count);\n\nMALLOC_NOEXPORT\nvoid\nprint_tiny_free_list(rack_t *rack);\n\nMALLOC_NOEXPORT\nvoid\nprint_tiny_region(boolean_t verbose, region_t region, size_t bytes_at_start, size_t bytes_at_end);\n\n// MARK: small region allocation functions\n\nMALLOC_NOEXPORT\nboolean_t\nsmall_check_region(rack_t *rack, region_t region, size_t region_index,\n\t\tunsigned counter);\n\nMALLOC_NOEXPORT\nvoid\nsmall_finalize_region(rack_t *rack, magazine_t *small_mag_ptr);\n\nMALLOC_NOEXPORT\nint\nsmall_free_detach_region(rack_t *rack, magazine_t *small_mag_ptr, region_t r);\n\nMALLOC_NOEXPORT\nboolean_t\nsmall_free_list_check(rack_t *rack, grain_t slot, unsigned counter);\n\nMALLOC_NOEXPORT\nsize_t\nsmall_free_reattach_region(rack_t *rack, magazine_t *small_mag_ptr, region_t r);\n\nMALLOC_NOEXPORT\nvoid\nsmall_free_scan_madvise_free(rack_t *rack, magazine_t *depot_ptr, region_t r);\n\nMALLOC_NOEXPORT\nkern_return_t\nsmall_in_use_enumerator(task_t task, void *context, unsigned type_mask, szone_t *szone, memory_reader_t reader,\n\t\tvm_range_recorder_t recorder);\n\nMALLOC_NOEXPORT\nvoid *\nsmall_malloc_should_clear(rack_t *rack, msize_t msize, boolean_t cleared_requested);\n\nMALLOC_NOEXPORT\nvoid *\nsmall_memalign(szone_t *szone, size_t alignment, size_t size, size_t span);\n\nMALLOC_NOEXPORT\nboolean_t\nsmall_claimed_address(rack_t *rack, void *ptr);\n\nMALLOC_NOEXPORT\nvoid *\nsmall_try_shrink_in_place(rack_t *rack, void *ptr, size_t old_size, size_t new_good_size);\n\nMALLOC_NOEXPORT\nboolean_t\nsmall_try_realloc_in_place(rack_t *rack, void *ptr, size_t old_size, size_t new_size);\n\nMALLOC_NOEXPORT\nvoid\nfree_small(rack_t *rack, void *ptr, region_t small_region, size_t known_size);\n\nMALLOC_NOEXPORT\nsize_t\nsmall_size(rack_t *rack, const void *ptr);\n\nMALLOC_NOEXPORT\nvoid\nprint_small_free_list(rack_t *rack);\n\nMALLOC_NOEXPORT\nvoid\nprint_small_region(szone_t *szone, boolean_t verbose, region_t region, size_t bytes_at_start, size_t bytes_at_end);\n\n// MARK: large region allocator functions\n\nMALLOC_NOEXPORT\nvoid\nfree_large(szone_t *szone, void *ptr);\n\nMALLOC_NOEXPORT\nvoid\nlarge_entries_free_no_lock(szone_t *szone, large_entry_t *entries, unsigned num, vm_range_t *range_to_deallocate);\n\nMALLOC_NOEXPORT\nlarge_entry_t *\nlarge_entry_for_pointer_no_lock(szone_t *szone, const void *ptr);\n\nMALLOC_NOEXPORT\nkern_return_t\nlarge_in_use_enumerator(task_t task, void *context, unsigned type_mask, vm_address_t large_entries_address, unsigned num_entries,\n\t\tmemory_reader_t reader, vm_range_recorder_t recorder);\n\nMALLOC_NOEXPORT\nint\nlarge_try_realloc_in_place(szone_t *szone, void *ptr, size_t old_size, size_t new_size);\n\nMALLOC_NOEXPORT\nvoid *\nlarge_try_shrink_in_place(szone_t *szone, void *ptr, size_t old_size, size_t new_good_size);\n\nMALLOC_NOEXPORT\nvoid *\nlarge_malloc(szone_t *szone, size_t num_kernel_pages, unsigned char alignment, boolean_t cleared_requested);\n\nMALLOC_NOEXPORT\nboolean_t\nlarge_claimed_address(szone_t *szone, void *ptr);\n\nMALLOC_NOEXPORT\nvoid *\nszone_malloc_should_clear(szone_t *szone, size_t size, boolean_t cleared_requested);\n\n// MARK: stack logging lite functionality\n\n#define MALLOC_STOCK_LOGGING_LITE_ZONE_NAME \"MallocStackLoggingLiteZone\"\n\n// These enable/disable stack logging lite for malloc allocations, not VM-only lite mode\nMALLOC_NOEXPORT\nvoid\nenable_stack_logging_lite();\n\nMALLOC_NOEXPORT\nvoid\ndisable_stack_logging_lite();\n\nMALLOC_NOEXPORT\nmalloc_zone_t *\ncreate_stack_logging_lite_zone(size_t initial_size, malloc_zone_t *helper_zone, unsigned debug_flags);\n\n#endif // __MAGAZINE_MALLOC_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_rack.c",
"content": "/*\n * Copyright (c) 2016 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#include \"internal.h\"\n\nvoid\nrack_init(rack_t *rack, rack_type_t type, uint32_t num_magazines, uint32_t debug_flags)\n{\n\track->type = type;\n\track->rg[0].nextgen = &rack->rg[1];\n\track->rg[1].nextgen = &rack->rg[0];\n\track->region_generation = &rack->rg[0];\n\n\track->region_generation->hashed_regions = rack->initial_regions;\n\track->region_generation->num_regions_allocated = INITIAL_NUM_REGIONS;\n\track->region_generation->num_regions_allocated_shift = INITIAL_NUM_REGIONS_SHIFT;\n\n\tmemset(rack->initial_regions, '\\0', sizeof(region_t) * INITIAL_NUM_REGIONS);\n\n\track->cookie = (uintptr_t)malloc_entropy[0];\n\n\tif (type == RACK_TYPE_SMALL) {\n\t\t// Flip the cookie for SMALL regions so that tiny and small free list\n\t\t// entries will trap when used if used in opposing region types.\n\t\track->cookie = ~rack->cookie;\n\t}\n\n\track->debug_flags = debug_flags;\n\track->num_magazines = num_magazines;\n\track->num_regions = 0;\n\track->num_regions_dealloc = 0;\n\track->magazines = NULL;\n\n\tif (num_magazines > 0) {\n\t\t// num_magazines + 1, the [-1] index will become the depot magazine\n\t\tsize_t magsize = round_page_quanta(sizeof(magazine_t) * (num_magazines + 1));\n\t\tmagazine_t *magazines = mvm_allocate_pages(magsize, 0, MALLOC_ADD_GUARD_PAGES, VM_MEMORY_MALLOC);\n\t\tif (!magazines) {\n\t\t\tMALLOC_REPORT_FATAL_ERROR(0, \"unable to allocate magazine array\");\n\t\t}\n\n\t\track->magazines = &magazines[1];\n\t\track->num_magazines_mask_shift = 0;\n\n\t\t// The magazines are indexed in [0 .. (num_magazines - 1)]\n\t\t// Find the smallest power of 2 that exceeds (num_magazines - 1)\n\t\tint i = 1;\n\t\twhile (i <= (num_magazines - 1)) {\n\t\t\track->num_magazines_mask_shift++;\n\t\t\ti <<= 1;\n\t\t}\n\n\t\t// Reduce i by 1 to obtain a mask covering [0 .. (num_tiny_magazines - 1)]\n\t\track->num_magazines_mask = i - 1;\n\t\track->last_madvise = 0;\n\n\t\t_malloc_lock_init(&rack->region_lock);\n\t\t_malloc_lock_init(&rack->magazines[DEPOT_MAGAZINE_INDEX].magazine_lock);\n\n\t\tfor (int i=0; i < rack->num_magazines; i++) {\n\t\t\t_malloc_lock_init(&rack->magazines[i].magazine_lock);\n\t\t}\n\t}\n}\n\nvoid\nrack_destroy_regions(rack_t *rack, size_t region_size)\n{\n\t/* destroy regions attached to this rack */\n\tfor (int i=0; i < rack->region_generation->num_regions_allocated; i++) {\n\t\tif ((rack->region_generation->hashed_regions[i] != HASHRING_OPEN_ENTRY) &&\n\t\t\t(rack->region_generation->hashed_regions[i] != HASHRING_REGION_DEALLOCATED))\n\t\t{\n\t\t\tmvm_deallocate_pages(rack->region_generation->hashed_regions[i], region_size, 0);\n\t\t\track->region_generation->hashed_regions[i] = HASHRING_REGION_DEALLOCATED;\n\t\t}\n\t}\n}\n\nvoid\nrack_destroy(rack_t *rack)\n{\n\t/* if the rack has additional regions, then deallocate them */\n\tif (rack->region_generation->hashed_regions != rack->initial_regions) {\n\t\tsize_t size = round_page_quanta(rack->region_generation->num_regions_allocated * sizeof(region_t));\n\t\tmvm_deallocate_pages(rack->region_generation->hashed_regions, size, 0);\n\t}\n\n\tif (rack->num_magazines > 0) {\n\t\tsize_t size = round_page_quanta(sizeof(magazine_t) * (rack->num_magazines + 1));\n\t\tmvm_deallocate_pages(&rack->magazines[-1], size, MALLOC_ADD_GUARD_PAGES);\n\t\track->magazines = NULL;\n\t}\n}\n\nvoid\nrack_region_insert(rack_t *rack, region_t region)\n{\n\t// Here find the only place in rackland that (infrequently) takes the tiny_regions_lock.\n\t// Only one thread at a time should be permitted to assess the density of the hash\n\t// ring and adjust if needed.\n\t// Only one thread at a time should be permitted to insert its new region on\n\t// the hash ring.\n\t// It is safe for all other threads to read the hash ring (hashed_regions) and\n\t// the associated sizes (num_regions_allocated and num_tiny_regions).\n\n\t_malloc_lock_lock(&rack->region_lock);\n\n\t// Check to see if the hash ring of tiny regions needs to grow. Try to\n\t// avoid the hash ring becoming too dense.\n\tif (rack->region_generation->num_regions_allocated < (2 * rack->num_regions)) {\n\t\tregion_t *new_regions;\n\t\tsize_t new_size;\n\t\tsize_t new_shift = rack->region_generation->num_regions_allocated_shift; // In/Out parameter\n\t\tnew_regions = hash_regions_grow_no_lock(rack->region_generation->hashed_regions,\n\t\t\t\t\t\t\t\t\t\t\t\track->region_generation->num_regions_allocated, &new_shift, &new_size);\n\t\t// Do not deallocate the current hashed_regions allocation since someone may\n\t\t// be iterating it. Instead, just leak it.\n\n\t\t// Prepare to advance to the \"next generation\" of the hash ring.\n\t\track->region_generation->nextgen->hashed_regions = new_regions;\n\t\track->region_generation->nextgen->num_regions_allocated = new_size;\n\t\track->region_generation->nextgen->num_regions_allocated_shift = new_shift;\n\n\t\t// Throw the switch to atomically advance to the next generation.\n\t\track->region_generation = rack->region_generation->nextgen;\n\t\t// Ensure everyone sees the advance.\n\t\tOSMemoryBarrier();\n\t}\n\n\t// Insert the new region into the hash ring, and update malloc statistics\n\thash_region_insert_no_lock(rack->region_generation->hashed_regions,\n\t\t\t\t\t\t\t rack->region_generation->num_regions_allocated,\n\t\t\t\t\t\t\t rack->region_generation->num_regions_allocated_shift,\n\t\t\t\t\t\t\t region);\n\n\track->num_regions++;\n\t_malloc_lock_unlock(&rack->region_lock);\n}\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_rack.h",
"content": "/*\n * Copyright (c) 2016 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __MAGAZINE_RACK_H\n#define __MAGAZINE_RACK_H\n\n/*******************************************************************************\n * Definitions for region hash\n ******************************************************************************/\n\ntypedef void *region_t;\ntypedef region_t *rgnhdl_t; /* A pointer into hashed_regions array. */\n\n#define INITIAL_NUM_REGIONS_SHIFT 6\t\t\t\t\t\t\t // log2(INITIAL_NUM_REGIONS)\n#define INITIAL_NUM_REGIONS (1 << INITIAL_NUM_REGIONS_SHIFT) // Must be a power of 2!\n#define HASHRING_OPEN_ENTRY ((region_t)0)\t\t\t\t\t // Initial value and sentinel marking end of collision chain\n#define HASHRING_REGION_DEALLOCATED ((region_t)-1)\t\t\t // Region at this slot reclaimed by OS\n#define HASH_BLOCKS_ALIGN TINY_BLOCKS_ALIGN\t\t\t\t\t // MIN( TINY_BLOCKS_ALIGN, SMALL_BLOCKS_ALIGN, ... )\n\ntypedef struct region_hash_generation {\n\tsize_t num_regions_allocated;\n\tsize_t num_regions_allocated_shift; // log2(num_regions_allocated)\n\tregion_t *hashed_regions;\t\t\t// hashed by location\n\tstruct region_hash_generation *nextgen;\n} region_hash_generation_t;\n\nOS_ENUM(rack_type, uint32_t,\n\tRACK_TYPE_NONE = 0,\n\tRACK_TYPE_TINY,\n\tRACK_TYPE_SMALL,\n);\n\n/*******************************************************************************\n * Per-allocator collection of regions and magazines\n ******************************************************************************/\n\ntypedef struct rack_s {\n\t/* Regions for tiny objects */\n\t_malloc_lock_s region_lock MALLOC_CACHE_ALIGN;\n\n\track_type_t type;\n\tsize_t num_regions;\n\tsize_t num_regions_dealloc;\n\tregion_hash_generation_t *region_generation;\n\tregion_hash_generation_t rg[2];\n\tregion_t initial_regions[INITIAL_NUM_REGIONS];\n\n\tint num_magazines;\n\tunsigned num_magazines_mask;\n\tint num_magazines_mask_shift;\n\tuint32_t debug_flags;\n\n\t// array of per-processor magazines\n\tmagazine_t *magazines;\n\n\tuintptr_t cookie;\n\tuintptr_t last_madvise;\n} rack_t;\n\n\nMALLOC_NOEXPORT\nvoid\nrack_init(rack_t *rack, rack_type_t type, uint32_t num_magazines, uint32_t debug_flags);\n\nMALLOC_NOEXPORT\nvoid\nrack_destroy_regions(rack_t *rack, size_t region_size);\n\nMALLOC_NOEXPORT\nvoid\nrack_destroy(rack_t *rack);\n\nMALLOC_NOEXPORT\nvoid\nrack_region_insert(rack_t *rack, region_t region);\n\n#endif // __MAGAZINE_RACK_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_small.c",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#include \"internal.h\"\n\n\n/*********************\tSMALL FREE LIST UTILITIES\t************************/\n\n#pragma mark meta header helpers\n\n/*\n * Mark a block as free. Only the first quantum of a block is marked thusly,\n * the remainder are marked \"middle\".\n */\nstatic MALLOC_INLINE void\nsmall_meta_header_set_is_free(msize_t *meta_headers, msize_t index, msize_t msize)\n{\n\tmeta_headers[index] = msize | SMALL_IS_FREE;\n}\n\n/*\n * Mark a block as not free, preserving its size.\n */\nstatic MALLOC_INLINE void\nsmall_meta_header_set_not_free(msize_t *meta_headers, msize_t index)\n{\n\tmeta_headers[index] &= ~SMALL_IS_FREE;\n}\n\n/*\n * Mark a block as in use. Only the first quantum of a block is marked thusly,\n * the remainder are marked \"middle\".\n */\nstatic MALLOC_INLINE void\nsmall_meta_header_set_in_use(msize_t *meta_headers, msize_t index, msize_t msize)\n{\n\tmeta_headers[index] = msize;\n}\n\n/*\n * Mark a quantum as being the second or later in a block.\n */\nstatic MALLOC_INLINE void\nsmall_meta_header_set_middle(msize_t *meta_headers, msize_t index)\n{\n\tmeta_headers[index] = 0;\n}\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE\nmag_index_t\nsmall_mag_get_thread_index(void)\n{\n#if CONFIG_SMALL_USES_HYPER_SHIFT\n\tif (os_likely(_os_cpu_number_override == -1)) {\n\t\treturn _os_cpu_number() >> hyper_shift;\n\t} else {\n\t\treturn _os_cpu_number_override >> hyper_shift;\n\t}\n#else // CONFIG_SMALL_USES_HYPER_SHIFT\n\tif (os_likely(_os_cpu_number_override == -1)) {\n\t\treturn _os_cpu_number();\n\t} else {\n\t\treturn _os_cpu_number_override;\n\t}\n#endif // CONFIG_SMALL_USES_HYPER_SHIFT\n}\n\n#pragma mark in-place free list\n\nstatic MALLOC_INLINE void\nsmall_inplace_checksum_ptr(rack_t *rack, inplace_linkage_s *linkage, void *ptr)\n{\n\tuintptr_t checksum = free_list_gen_checksum((uintptr_t)ptr ^ rack->cookie ^ (uintptr_t)rack);\n\tlinkage->checksum = checksum;\n\tlinkage->ptr = ptr;\n}\n\nstatic MALLOC_INLINE free_list_t\nsmall_inplace_unchecksum_ptr(rack_t *rack, inplace_linkage_s *linkage)\n{\n\tif (linkage->checksum != (uint8_t)free_list_gen_checksum((uintptr_t)linkage->ptr ^ rack->cookie ^ (uintptr_t)rack)) {\n\t\tfree_list_checksum_botch(rack, linkage, linkage->ptr);\n\t\t__builtin_trap();\n\t}\n\n\treturn (free_list_t){ .p = linkage->ptr };\n}\n\nstatic MALLOC_INLINE free_list_t\nsmall_inplace_free_entry_get_previous(rack_t *rack, small_inplace_free_entry_t ptr)\n{\n\treturn small_inplace_unchecksum_ptr(rack, &ptr->previous);\n}\n\nstatic MALLOC_INLINE void\nsmall_inplace_free_entry_set_previous(rack_t *rack, small_inplace_free_entry_t entry, free_list_t previous)\n{\n\tsmall_inplace_checksum_ptr(rack, &entry->previous, previous.p);\n}\n\nstatic MALLOC_INLINE free_list_t\nsmall_inplace_free_entry_get_next(rack_t *rack, small_inplace_free_entry_t ptr)\n{\n\treturn small_inplace_unchecksum_ptr(rack, &ptr->next);\n}\n\nstatic MALLOC_INLINE void\nsmall_inplace_free_entry_set_next(rack_t *rack, small_inplace_free_entry_t entry, free_list_t next)\n{\n\tsmall_inplace_checksum_ptr(rack, &entry->next, next.p);\n}\n\n#pragma mark OOB free list\n\n// Returns true if the address and size of the free list entry would result\n// in the free entry being the only data on a given page.\nstatic MALLOC_INLINE boolean_t\nsmall_needs_oob_free_entry(void *ptr, msize_t msize)\n{\n\treturn ((trunc_page_quanta((uintptr_t)ptr) == (uintptr_t)ptr) && (SMALL_BYTES_FOR_MSIZE(msize) >= vm_kernel_page_size));\n}\n\n// Returns true if the address given lies within the region's OOB free\n// list entries, rather than a free_list_t in the region's heap space.\nstatic MALLOC_INLINE boolean_t\nsmall_is_oob_free_entry(free_list_t ptr)\n{\n\tsmall_region_t region = SMALL_REGION_FOR_PTR(ptr.p);\n\treturn (((uintptr_t)ptr.p >= (uintptr_t)®ion->small_oob_free_entries[0]) &&\n\t\t\t((uintptr_t)ptr.p < (uintptr_t)®ion->small_oob_free_entries[SMALL_OOB_COUNT]));\n}\n\nstatic MALLOC_INLINE void\nsmall_oob_free_entry_set_previous(oob_free_entry_t oobe, free_list_t previous)\n{\n\toobe->prev = (uintptr_t)previous.p;\n}\n\nstatic MALLOC_INLINE free_list_t\nsmall_oob_free_entry_get_previous(oob_free_entry_t oobe)\n{\n\treturn (free_list_t){ .p = (void *)oobe->prev };\n}\n\nstatic MALLOC_INLINE void\nsmall_oob_free_entry_set_next(oob_free_entry_t oobe, free_list_t next)\n{\n\toobe->next = (uintptr_t)next.p;\n}\n\nstatic MALLOC_INLINE free_list_t\nsmall_oob_free_entry_get_next(oob_free_entry_t oobe)\n{\n\treturn (free_list_t){ .p = (void *)oobe->next };\n}\n\nstatic MALLOC_INLINE void *\nsmall_oob_free_entry_get_ptr(oob_free_entry_t oobe)\n{\n\tsmall_region_t region = SMALL_REGION_FOR_PTR(oobe);\n\tuint16_t block = oobe->ptr & ~SMALL_IS_OOB;\n\treturn (void *)((uintptr_t)region + (block << SHIFT_SMALL_QUANTUM));\n}\n\nstatic MALLOC_INLINE void\nsmall_oob_free_entry_set_ptr(oob_free_entry_t oobe, void *ptr)\n{\n\toobe->ptr = SMALL_IS_OOB | (SMALL_OFFSET_FOR_PTR(ptr) >> SHIFT_SMALL_QUANTUM);\n}\n\nstatic MALLOC_INLINE void\nsmall_oob_free_entry_set_free(oob_free_entry_t oobe)\n{\n\toobe->prev = ~0;\n\toobe->next = ~0;\n\toobe->ptr = 0;\n}\n\n// Finds the first unused OOB free list entry in the pointer's region.\n// Returns NULL if all of the OOB entries are used.\nstatic MALLOC_INLINE oob_free_entry_t\nsmall_oob_free_find_empty(void *ptr, msize_t msize)\n{\n\tsmall_region_t region = SMALL_REGION_FOR_PTR(ptr);\n\n\t// There are 61 of these entries at the end of a small region.\n\t// If this changes, then a linear search through the list may\n\t// become an unsuitable choice.\n\tfor (int i=0; i < SMALL_OOB_COUNT; i++) {\n\t\tif (region->small_oob_free_entries[i].ptr == 0) {\n\t\t\treturn ®ion->small_oob_free_entries[i];\n\t\t}\n\t}\n\n#if DEBUG_MALLOC\n\tmalloc_report(ASL_LEVEL_INFO, \"used all slots of OOB entries\\n\");\n#endif\n\treturn NULL;\n}\n\nstatic MALLOC_INLINE oob_free_entry_t\nsmall_oob_free_find_ptr(void *ptr, msize_t msize)\n{\n\tsmall_region_t region = SMALL_REGION_FOR_PTR(ptr);\n\n\t// There are 61 of these entries at the end of a small region.\n\t// If this changes, then a linear search through the list may\n\t// become an unsuitable choice.\n\tfor (int i=0; i < SMALL_OOB_COUNT; i++) {\n\t\tif (small_oob_free_entry_get_ptr(®ion->small_oob_free_entries[i]) == ptr) {\n\t\t\treturn ®ion->small_oob_free_entries[i];\n\t\t}\n\t}\n\n\treturn NULL;\n}\n\n#pragma mark generic free list\n\nstatic MALLOC_INLINE void\nsmall_free_list_set_previous(rack_t *rack, free_list_t entry, free_list_t previous)\n{\n\tif (small_is_oob_free_entry(entry)) {\n\t\tsmall_oob_free_entry_set_previous(entry.oob, previous);\n\t} else {\n\t\tsmall_inplace_free_entry_set_previous(rack, entry.small_inplace, previous);\n\t}\n}\n\nstatic MALLOC_INLINE free_list_t\nsmall_free_list_get_previous(rack_t *rack, free_list_t ptr)\n{\n\tMALLOC_ASSERT(ptr.p);\n\tif (small_is_oob_free_entry(ptr)) {\n\t\treturn small_oob_free_entry_get_previous(ptr.oob);\n\t} else {\n\t\treturn small_inplace_free_entry_get_previous(rack, ptr.small_inplace);\n\t}\n}\n\nstatic MALLOC_INLINE void\nsmall_free_list_set_next(rack_t *rack, free_list_t entry, free_list_t next)\n{\n\tif (small_is_oob_free_entry(entry)) {\n\t\tsmall_oob_free_entry_set_next(entry.oob, next);\n\t} else {\n\t\tsmall_inplace_free_entry_set_next(rack, entry.small_inplace, next);\n\t}\n}\n\nstatic MALLOC_INLINE free_list_t\nsmall_free_list_get_next(rack_t *rack, free_list_t ptr)\n{\n\tMALLOC_ASSERT(ptr.p);\n\tif (small_is_oob_free_entry(ptr)) {\n\t\treturn small_oob_free_entry_get_next(ptr.oob);\n\t} else {\n\t\treturn small_inplace_free_entry_get_next(rack, ptr.small_inplace);\n\t}\n}\n\nstatic MALLOC_INLINE void *\nsmall_free_list_get_ptr(rack_t *rack, free_list_t ptr)\n{\n\tif (!ptr.p) {\n\t\treturn NULL;\n\t} else if (small_is_oob_free_entry(ptr)) {\n\t\treturn small_oob_free_entry_get_ptr(ptr.oob);\n\t} else {\n\t\treturn (void *)ptr.p;\n\t}\n}\n\n// Returns a free_list_t that is either inline or not based on the\n// pointer and msize.\nstatic MALLOC_INLINE free_list_t\nsmall_free_list_from_ptr(rack_t *rack, void *ptr, msize_t msize)\n{\n\tMALLOC_ASSERT(msize);\n\n\t// The default is to put the free_list_t in the memory that\n\t// the pointer leads to.\n\tfree_list_t entry;\n\tentry.p = ptr;\n\n\t// If the pointer is page aligned, and the msize is greater\n\t// than a whole page, then we try and put the entry in\n\t// the out-of-band area instead.\n\tif (small_needs_oob_free_entry(ptr, msize)) {\n\t\toob_free_entry_t oobe = small_oob_free_find_empty(ptr, msize);\n\t\tif (oobe) {\n\t\t\tsmall_oob_free_entry_set_ptr(oobe, ptr);\n\t\t\tentry.oob = oobe;\n\t\t}\n\t}\n\n\treturn entry;\n}\n\nstatic MALLOC_INLINE void\nsmall_free_mark_free(rack_t *rack, free_list_t entry, msize_t msize)\n{\n\t// Marks both the start and end block of a free-list entry as free.\n\tvoid *ptr = small_free_list_get_ptr(rack, entry);\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(ptr);\n\tuintptr_t start_index = SMALL_META_INDEX_FOR_PTR(ptr);\n\tuintptr_t end_index = SMALL_META_INDEX_FOR_PTR(ptr + SMALL_BYTES_FOR_MSIZE(msize) - 1);\n\tMALLOC_ASSERT(start_index <= end_index);\n\n\tsmall_meta_header_set_is_free(meta_headers, start_index, msize);\n\tsmall_meta_header_set_is_free(meta_headers, end_index, msize);\n}\n\nstatic MALLOC_INLINE void\nsmall_free_mark_middle(rack_t *rack, free_list_t entry, msize_t msize)\n{\n\t// Marks both the start and end block of a free-list entry as \"middle\" (unfree).\n\tvoid *ptr = small_free_list_get_ptr(rack, entry);\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(ptr);\n\tuintptr_t start_index = SMALL_META_INDEX_FOR_PTR(ptr);\n\tuintptr_t end_index = SMALL_META_INDEX_FOR_PTR(ptr + SMALL_BYTES_FOR_MSIZE(msize) - 1);\n\tMALLOC_ASSERT(start_index <= end_index);\n\tMALLOC_ASSERT((meta_headers[start_index] & ~SMALL_IS_FREE) == msize);\n\n\tsmall_meta_header_set_middle(meta_headers, start_index);\n\tsmall_meta_header_set_middle(meta_headers, end_index);\n}\n\nstatic MALLOC_INLINE void\nsmall_free_mark_unfree(rack_t *rack, free_list_t entry, msize_t msize)\n{\n\t// Marks both the start and end block of a free-list entry as not free.\n\tvoid *ptr = small_free_list_get_ptr(rack, entry);\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(ptr);\n\tuintptr_t start_index = SMALL_META_INDEX_FOR_PTR(ptr);\n\tuintptr_t end_index = SMALL_META_INDEX_FOR_PTR(ptr + SMALL_BYTES_FOR_MSIZE(msize) - 1);\n\tMALLOC_ASSERT(start_index <= end_index);\n\n\tsmall_meta_header_set_not_free(meta_headers, start_index);\n\tsmall_meta_header_set_not_free(meta_headers, end_index);\n}\n\nstatic MALLOC_INLINE unsigned int\nsmall_free_list_count(rack_t *rack, free_list_t ptr)\n{\n\tunsigned int count = 0;\n\twhile (ptr.p) {\n\t\tcount++;\n\t\tptr = small_free_list_get_next(rack, ptr);\n\t}\n\treturn count;\n}\n\n/*\n * Adds an item to the proper free list, and also marks the meta-header of the\n * block properly.\n * Assumes szone has been locked\n */\nstatic free_list_t\nsmall_free_list_add_ptr(rack_t *rack, magazine_t *small_mag_ptr, void *ptr, msize_t msize)\n{\n\tgrain_t slot = SMALL_FREE_SLOT_FOR_MSIZE(rack, msize);\n\tfree_list_t free_head = small_mag_ptr->mag_free_list[slot];\n\n\t// This will either return the free_list_t for the current pointer, or attempt\n\t// to reserve an OOB entry for us.\n\tfree_list_t free_ptr = small_free_list_from_ptr(rack, ptr, msize);\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in %s, ptr=%p, msize=%d\\n\", __FUNCTION__, ptr, msize);\n\t}\n\tif (((uintptr_t)ptr) & (SMALL_QUANTUM - 1)) {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"small_free_list_add_ptr: Unaligned ptr %p\\n\", ptr);\n\t}\n#endif\n\n\tsmall_free_list_set_previous(rack, free_ptr, (free_list_t){ .p = NULL });\n\tsmall_free_list_set_next(rack, free_ptr, free_head);\n\n\t// Set the start and end blocks of the meta header as \"free\". Marking the last block\n\t// allows coalescing the regions when we free adjacent regions.\n\tsmall_free_mark_free(rack, free_ptr, msize);\n\n\tif (small_free_list_get_ptr(rack, free_head)) {\n#if DEBUG_MALLOC\n\t\tif (small_free_list_get_previous(szone, free_head)) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true, \"small_free_list_add_ptr: Internal invariant broken (free_head->previous != NULL)\\n\"\n\t\t\t\t\t\t\"ptr=%p slot=%d free_head=%p previous=%p\\n\", ptr, slot, (void *)free_head, free_head->previous.p);\n\t\t}\n\t\tif (!SMALL_PTR_IS_FREE(small_free_list_get_ptr(szone, free_head))) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true, \"small_free_list_add_ptr: Internal invariant broken (free_head is not a free pointer)\\n\"\n\t\t\t\t\t\t\"ptr=%p slot=%d free_head=%p\\n\", ptr, slot, (void *)small_free_list_get_ptr(szone, free_head));\n\t\t}\n#endif\n\t\tsmall_free_list_set_previous(rack, free_head, free_ptr);\n\t} else {\n\t\tBITMAPN_SET(small_mag_ptr->mag_bitmap, slot);\n\t}\n\n\tsmall_mag_ptr->mag_free_list[slot] = free_ptr;\n\treturn free_ptr;\n}\n\n/*\n * Removes the item pointed to by ptr in the proper free list.\n * Assumes szone has been locked\n */\nstatic void\nsmall_free_list_remove_ptr_no_clear(rack_t *rack, magazine_t *small_mag_ptr, free_list_t entry, msize_t msize)\n{\n\tgrain_t slot = SMALL_FREE_SLOT_FOR_MSIZE(rack, msize);\n\tfree_list_t next, previous;\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"In %s, ptr=%p, msize=%d\\n\", __FUNCTION__, ptr, msize);\n\t}\n#endif\n\n\tprevious = small_free_list_get_previous(rack, entry);\n\tnext = small_free_list_get_next(rack, entry);\n\n\tif (!small_free_list_get_ptr(rack, previous)) {\n\t\t// The block to remove is the head of the free list\n#if DEBUG_MALLOC\n\t\tif (small_mag_ptr->mag_free_list[slot] != ptr) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\t\"small_free_list_remove_ptr_no_clear: Internal invariant broken (small_mag_ptr->mag_free_list[slot])\\n\"\n\t\t\t\t\t\"ptr=%p slot=%d msize=%d small_mag_ptr->mag_free_list[slot]=%p\\n\", ptr, slot, msize,\n\t\t\t\t\t(void *)small_mag_ptr->mag_free_list[slot]);\n\t\t\treturn;\n\t\t}\n#endif\n\t\tsmall_mag_ptr->mag_free_list[slot] = next;\n\t\tif (!small_free_list_get_ptr(rack, next)) {\n\t\t\tBITMAPN_CLR(small_mag_ptr->mag_bitmap, slot);\n\t\t}\n\t} else {\n\t\t// Check that the next pointer of \"previous\" points to \"entry\".\n\t\tfree_list_t prev_next = small_free_list_get_next(rack, previous);\n\t\tif (small_free_list_get_ptr(rack, prev_next) != small_free_list_get_ptr(rack, entry)) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\t\"small_free_list_remove_ptr_no_clear: Internal invariant broken (next ptr of prev) for %p, prev_next=%p\\n\",\n\t\t\t\t\tsmall_free_list_get_ptr(rack, entry), small_free_list_get_ptr(rack, prev_next));\n\t\t\t__builtin_unreachable(); // Always crashes in malloc_zone_error().\n\t\t}\n\t\tsmall_free_list_set_next(rack, previous, next);\n\t}\n\n\tif (small_free_list_get_ptr(rack, next)) {\n\t\t// Check that the previous pointer of \"next\" points to \"entry\".\n\t\tfree_list_t next_prev = small_free_list_get_previous(rack, next);\n\t\tif (small_free_list_get_ptr(rack, next_prev) != small_free_list_get_ptr(rack, entry)) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\t\"small_free_list_remove_ptr_no_clear: Internal invariant broken (prev ptr of next) for %p, next_prev=%p\\n\",\n\t\t\t\t\tsmall_free_list_get_ptr(rack, entry), small_free_list_get_ptr(rack, next_prev));\n\t\t\t__builtin_unreachable(); // Always crashes in malloc_zone_error().\n\t\t}\n\t\tsmall_free_list_set_previous(rack, next, previous);\n\t}\n\n\tif (small_is_oob_free_entry(entry)) {\n\t\tsmall_oob_free_entry_set_free(entry.oob);\n\t}\n}\n\nstatic void\nsmall_free_list_remove_ptr(rack_t *rack, magazine_t *small_mag_ptr, free_list_t entry, msize_t msize)\n{\n\t// In the general case we want to ensure we marked these entries as \"middle\"\n\t// while we are in this function. However, when we're moving free list entries\n\t// from/to the recirc depot we rely on the metadata bits being intact to\n\t// reconstruct the free list. In that case we have to be able to skip this\n\t// metadata manipulation.\n\tsmall_free_mark_middle(rack, entry, msize);\n\tsmall_free_list_remove_ptr_no_clear(rack, small_mag_ptr, entry, msize);\n}\n\n// Find a free list entry by its pointer address. This should only really be used\n// by small_finalize_region, or similar, where the free_list_t entry of a known\n// pointer is desired. Otherwise it is cheaper to always pull off the free lists.\nstatic free_list_t\nsmall_free_list_find_by_ptr(rack_t *rack, magazine_t *small_mag_ptr, void *ptr, msize_t msize)\n{\n\tif (*SMALL_METADATA_FOR_PTR(ptr) == (SMALL_IS_FREE | msize)) {\n\t\t// If the block is marked free, and of size `msize`, then we first must check\n\t\t// if the alignment+size is such that we could have use an OOB-entry.\n\t\tif (small_needs_oob_free_entry(ptr, msize)) {\n\t\t\t// Scan the OOB entries looking for this address.\n\t\t\tsmall_region_t region = SMALL_REGION_FOR_PTR(ptr);\n\t\t\tfor (int i=0; ismall_oob_free_entries[i].ptr) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (small_oob_free_entry_get_ptr(®ion->small_oob_free_entries[i]) == ptr) {\n\t\t\t\t\treturn (free_list_t){ .oob = ®ion->small_oob_free_entries[i] };\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Otherwise, the freed pointer will be in place.\n\t\treturn (free_list_t){ .p = ptr };\n\t}\n\n\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\"small_free_list_find_by_ptr: ptr is not free (ptr metadata !SMALL_IS_FREE), \"\n\t\t\t\"ptr=%p msize=%d metadata=0x%x\\n\", ptr, msize, *SMALL_METADATA_FOR_PTR(ptr));\n\t__builtin_trap();\n}\n\nvoid\nsmall_finalize_region(rack_t *rack, magazine_t *small_mag_ptr)\n{\n\tvoid *last_block, *previous_block;\n\tmsize_t last_msize, previous_msize, last_index;\n\tfree_list_t previous;\n\n\t// It is possible that the block prior to the last block in the region has\n\t// been free'd, but was not coalesced with the free bytes at the end of the\n\t// block, since we treat the bytes at the end of the region as \"in use\" in\n\t// the meta headers. Attempt to coalesce the last block with the previous\n\t// block, so we don't violate the \"no consecutive free blocks\" invariant.\n\t//\n\t// FIXME: If we could calculate the previous small free size in the same\n\t// manner as tiny_previous_preceding_free, it would eliminate the\n\t// index & previous msize checks, which are a guard against reading\n\t// bogus data out of in-use or written-on-freed memory.\n\t//\n\t// FIXME: Need to investigate how much work would be required to increase\n\t// 'mag_bytes_free_at_end' when freeing the preceding block, rather\n\t// than performing this workaround.\n\t//\n\tif (small_mag_ptr->mag_bytes_free_at_end) {\n\t\tlast_block = SMALL_REGION_END(small_mag_ptr->mag_last_region) - small_mag_ptr->mag_bytes_free_at_end;\n\t\tlast_msize = SMALL_MSIZE_FOR_BYTES(small_mag_ptr->mag_bytes_free_at_end);\n\n\t\tlast_index = SMALL_META_INDEX_FOR_PTR(last_block);\n\t\tprevious_msize = SMALL_PREVIOUS_MSIZE(last_block);\n\n\t\tif (last_index && (previous_msize <= last_index)) {\n\t\t\tprevious_block = (void *)((uintptr_t)last_block - SMALL_BYTES_FOR_MSIZE(previous_msize));\n\n\t\t\tif (SMALL_PTR_IS_FREE(previous_block)) {\n\t\t\t\tprevious = small_free_list_find_by_ptr(rack, small_mag_ptr, previous_block, previous_msize);\n\t\t\t\tsmall_free_list_remove_ptr(rack, small_mag_ptr, previous, previous_msize);\n\t\t\t\tlast_block = previous_block;\n\t\t\t\tlast_msize += previous_msize;\n\t\t\t}\n\t\t}\n\n\t\t// splice last_block into the free list\n\t\tsmall_free_list_add_ptr(rack, small_mag_ptr, last_block, last_msize);\n\t\tsmall_mag_ptr->mag_bytes_free_at_end = 0;\n\t}\n\n#if CONFIG_ASLR_INTERNAL\n\tfree_list_t next;\n\n\tif (small_mag_ptr->mag_bytes_free_at_start) {\n\t\tlast_block = SMALL_REGION_ADDRESS(small_mag_ptr->mag_last_region);\n\t\tlast_msize = SMALL_MSIZE_FOR_BYTES(small_mag_ptr->mag_bytes_free_at_start);\n\n\t\tvoid *next_block = (void *)((uintptr_t)last_block + small_mag_ptr->mag_bytes_free_at_start);\n\t\tif (SMALL_PTR_IS_FREE(next_block)) {\n\t\t\tmsize_t next_msize = SMALL_PTR_SIZE(next_block);\n\t\t\tnext = small_free_list_find_by_ptr(rack, small_mag_ptr, next_block, next_msize);\n\t\t\tsmall_free_list_remove_ptr(rack, small_mag_ptr, next, next_msize);\n\t\t\tlast_msize += next_msize;\n\t\t}\n\n\t\t// splice last_block into the free list\n\t\tsmall_free_list_add_ptr(rack, small_mag_ptr, last_block, last_msize);\n\t\tsmall_mag_ptr->mag_bytes_free_at_start = 0;\n\t}\n#endif\n\n\t// TODO: Will we ever need to coalesce the blocks at the beginning and end when we finalize?\n\tsmall_mag_ptr->mag_last_region = NULL;\n}\n\nint\nsmall_free_detach_region(rack_t *rack, magazine_t *small_mag_ptr, region_t r)\n{\n\tunsigned char *ptr = SMALL_REGION_ADDRESS(r);\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(ptr);\n\tuintptr_t start = (uintptr_t)SMALL_REGION_ADDRESS(r);\n\tuintptr_t current = start;\n\tuintptr_t limit = (uintptr_t)SMALL_REGION_END(r);\n\tint total_alloc = 0;\n\n\twhile (current < limit) {\n\t\tunsigned index = SMALL_META_INDEX_FOR_PTR(current);\n\t\tmsize_t msize_and_free = meta_headers[index];\n\t\tboolean_t is_free = msize_and_free & SMALL_IS_FREE;\n\t\tmsize_t msize = msize_and_free & ~SMALL_IS_FREE;\n\n\t\tif (!msize) {\n#if DEBUG_MALLOC\n\t\t\tboolean_t is_free = msize_and_free & SMALL_IS_FREE;\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** small_free_detach_region error with %p: msize=%d is_free=%d\\n\", (void *)current, msize, is_free);\n#endif\n\t\t\tbreak;\n\t\t}\n\n\t\tif (is_free) {\n\t\t\tfree_list_t entry = small_free_list_find_by_ptr(rack, small_mag_ptr, (void *)current, msize);\n\t\t\tsmall_free_list_remove_ptr_no_clear(rack, small_mag_ptr, entry, msize);\n\t\t} else {\n\t\t\ttotal_alloc++;\n\t\t}\n\t\tcurrent += SMALL_BYTES_FOR_MSIZE(msize);\n\t}\n\treturn total_alloc;\n}\n\nsize_t\nsmall_free_reattach_region(rack_t *rack, magazine_t *small_mag_ptr, region_t r)\n{\n\tunsigned char *ptr = SMALL_REGION_ADDRESS(r);\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(ptr);\n\tuintptr_t start = (uintptr_t)SMALL_REGION_ADDRESS(r);\n\tuintptr_t current = start;\n\tuintptr_t limit = (uintptr_t)SMALL_REGION_END(r);\n\tsize_t total_alloc = 0;\n\n\twhile (current < limit) {\n\t\tunsigned index = SMALL_META_INDEX_FOR_PTR(current);\n\t\tmsize_t msize_and_free = meta_headers[index];\n\t\tboolean_t is_free = msize_and_free & SMALL_IS_FREE;\n\t\tmsize_t msize = msize_and_free & ~SMALL_IS_FREE;\n\n\t\tif (!msize) {\n#if DEBUG_MALLOC\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** small_free_reattach_region error with %p: msize=%d is_free=%d\\n\", (void *)current, msize, is_free);\n#endif\n\t\t\tbreak;\n\t\t}\n\t\tif (is_free) {\n\t\t\tsmall_free_list_add_ptr(rack, small_mag_ptr, (void *)current, msize);\n\t\t} else {\n\t\t\ttotal_alloc += SMALL_BYTES_FOR_MSIZE(msize);\n\t\t}\n\t\tcurrent += SMALL_BYTES_FOR_MSIZE(msize);\n\t}\n\treturn total_alloc;\n}\n\ntypedef struct {\n\tuint16_t pnum, size;\n} small_pg_pair_t;\n\nvoid\nsmall_free_scan_madvise_free(rack_t *rack, magazine_t *depot_ptr, region_t r)\n{\n\tuintptr_t start = (uintptr_t)SMALL_REGION_ADDRESS(r);\n\tuintptr_t current = start;\n\tuintptr_t limit = (uintptr_t)SMALL_REGION_END(r);\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(start);\n\tsmall_pg_pair_t advisory[((SMALL_REGION_PAYLOAD_BYTES + vm_kernel_page_size - 1) >> vm_kernel_page_shift) >>\n\t\t\t\t\t\t\t 1]; // 4096bytes stack allocated\n\tint advisories = 0;\n\n\t// Scan the metadata identifying blocks which span one or more pages. Mark the pages MADV_FREE taking care to preserve free list\n\t// management data.\n\twhile (current < limit) {\n\t\tunsigned index = SMALL_META_INDEX_FOR_PTR(current);\n\t\tmsize_t msize_and_free = meta_headers[index];\n\t\tboolean_t is_free = msize_and_free & SMALL_IS_FREE;\n\t\tmsize_t msize = msize_and_free & ~SMALL_IS_FREE;\n\n\t\tif (is_free && !msize && (current == start)) {\n#if DEBUG_MALLOC\n\t\t\t// first block is all free\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** small_free_scan_madvise_free first block is all free! %p: msize=%d is_free=%d\\n\", (void *)current,\n\t\t\t\t\t\t msize, is_free);\n#endif\n\t\t\tuintptr_t pgLo = round_page_kernel(start + sizeof(free_list_t) + sizeof(msize_t));\n\t\t\tuintptr_t pgHi = trunc_page_kernel(start + SMALL_REGION_SIZE - sizeof(msize_t));\n\n\t\t\tif (pgLo < pgHi) {\n\t\t\t\tadvisory[advisories].pnum = (pgLo - start) >> vm_kernel_page_shift;\n\t\t\t\tadvisory[advisories].size = (pgHi - pgLo) >> vm_kernel_page_shift;\n\t\t\t\tadvisories++;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tif (!msize) {\n#if DEBUG_MALLOC\n\t\t\tmalloc_report(ASL_LEVEL_ERR,\n\t\t\t\t\t\t \"*** small_free_scan_madvise_free error with %p: msize=%d is_free=%d\\n\", (void *)current, msize, is_free);\n#endif\n\t\t\tbreak;\n\t\t}\n\t\tif (is_free) {\n\t\t\tuintptr_t pgLo = round_page_kernel(current + sizeof(free_list_t) + sizeof(msize_t));\n\t\t\tuintptr_t pgHi = trunc_page_kernel(current + SMALL_BYTES_FOR_MSIZE(msize) - sizeof(msize_t));\n\n\t\t\tif (pgLo < pgHi) {\n\t\t\t\tadvisory[advisories].pnum = (pgLo - start) >> vm_kernel_page_shift;\n\t\t\t\tadvisory[advisories].size = (pgHi - pgLo) >> vm_kernel_page_shift;\n\t\t\t\tadvisories++;\n\t\t\t}\n\t\t}\n\t\tcurrent += SMALL_BYTES_FOR_MSIZE(msize);\n\t}\n\n\tif (advisories > 0) {\n\t\tint i;\n\n\t\tOSAtomicIncrement32Barrier(&(REGION_TRAILER_FOR_SMALL_REGION(r)->pinned_to_depot));\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\t\tfor (i = 0; i < advisories; ++i) {\n\t\t\tuintptr_t addr = (advisory[i].pnum << vm_page_quanta_shift) + start;\n\t\t\tsize_t size = advisory[i].size << vm_page_quanta_shift;\n\n\t\t\tmvm_madvise_free(rack, r, addr, addr + size, NULL, rack->debug_flags & MALLOC_DO_SCRIBBLE);\n\t\t}\n\t\tSZONE_MAGAZINE_PTR_LOCK(depot_ptr);\n\t\tOSAtomicDecrement32Barrier(&(REGION_TRAILER_FOR_SMALL_REGION(r)->pinned_to_depot));\n\t}\n}\n\nstatic region_t\nsmall_find_msize_region(rack_t *rack, magazine_t *small_mag_ptr, mag_index_t mag_index, msize_t msize)\n{\n\tvoid *ptr;\n\tgrain_t slot = SMALL_FREE_SLOT_FOR_MSIZE(rack, msize);\n\tfree_list_t *free_list = small_mag_ptr->mag_free_list;\n\tfree_list_t *the_slot = free_list + slot;\n\tfree_list_t *limit;\n\tunsigned bitmap;\n\n\t// Assumes we've locked the magazine\n\tCHECK_MAGAZINE_PTR_LOCKED(szone, small_mag_ptr, __PRETTY_FUNCTION__);\n\n\t// Look for an exact match by checking the freelist for this msize.\n\tptr = small_free_list_get_ptr(rack, *the_slot);\n\tif (ptr) {\n\t\treturn SMALL_REGION_FOR_PTR(ptr);\n\t}\n\n\t// Mask off the bits representing slots holding free blocks smaller than\n\t// the size we need.\n\tif (SMALL_FREELIST_BITMAP_WORDS(rack) > 1) {\n\t\t// BITMAPN_CTZ implementation\n\t\tunsigned idx = slot >> 5;\n\t\tbitmap = 0;\n\t\tunsigned mask = ~((1 << (slot & 31)) - 1);\n\t\tfor (; idx < SMALL_FREELIST_BITMAP_WORDS(rack); ++idx) {\n\t\t\tbitmap = small_mag_ptr->mag_bitmap[idx] & mask;\n\t\t\tif (bitmap != 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tmask = ~0U;\n\t\t}\n\t\t// Check for fallthrough: No bits set in bitmap\n\t\tif ((bitmap == 0) && (idx == SMALL_FREELIST_BITMAP_WORDS(rack))) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\t// Start looking at the first set bit, plus 32 bits for every word of\n\t\t// zeroes or entries that were too small.\n\t\tslot = BITMAP32_CTZ((&bitmap)) + (idx * 32);\n\t} else {\n\t\tbitmap = small_mag_ptr->mag_bitmap[0] & ~((1 << slot) - 1);\n\t\tif (!bitmap) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tslot = BITMAP32_CTZ((&bitmap));\n\t}\n\tlimit = free_list + SMALL_FREE_SLOT_COUNT(rack) - 1;\n\tfree_list += slot;\n\n\tif (free_list < limit) {\n\t\tptr = small_free_list_get_ptr(rack, *free_list);\n\t\tif (ptr) {\n\t\t\treturn SMALL_REGION_FOR_PTR(ptr);\n\t\t} else {\n\t\t\t/* Shouldn't happen. Fall through to look at last slot. */\n#if DEBUG_MALLOC\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"in small_malloc_from_free_list(), mag_bitmap out of sync, slot=%d\\n\", slot);\n#endif\n\t\t}\n\t}\n\n\t// We are now looking at the last slot, which contains blocks equal to, or\n\t// due to coalescing of free blocks, larger than (num_small_slots - 1) * (small quantum size).\n\tptr = small_free_list_get_ptr(rack, *limit);\n\tif (ptr) {\n\t\treturn SMALL_REGION_FOR_PTR(ptr);\n\t}\n\n\treturn NULL;\n}\n\nstatic boolean_t\nsmall_get_region_from_depot(rack_t *rack, magazine_t *small_mag_ptr, mag_index_t mag_index, msize_t msize)\n{\n\tmagazine_t *depot_ptr = &(rack->magazines[DEPOT_MAGAZINE_INDEX]);\n\n\t/* FIXME: Would Uniprocessor benefit from recirc and MADV_FREE? */\n\tif (rack->num_magazines == 1) { // Uniprocessor, single magazine, so no recirculation necessary\n\t\treturn 0;\n\t}\n\n#if DEBUG_MALLOC\n\tif (DEPOT_MAGAZINE_INDEX == mag_index) {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"small_get_region_from_depot called for magazine index -1\\n\", NULL, NULL);\n\t\treturn 0;\n\t}\n#endif\n\n\tSZONE_MAGAZINE_PTR_LOCK(depot_ptr);\n\n\t// Appropriate a Depot'd region that can satisfy requested msize.\n\tregion_trailer_t *node;\n\tregion_t sparse_region;\n\n\twhile (1) {\n\t\tsparse_region = small_find_msize_region(rack, depot_ptr, DEPOT_MAGAZINE_INDEX, msize);\n\t\tif (NULL == sparse_region) { // Depot empty?\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\t\t\treturn 0;\n\t\t}\n\n\t\tnode = REGION_TRAILER_FOR_SMALL_REGION(sparse_region);\n\t\tif (0 >= node->pinned_to_depot) {\n\t\t\tbreak;\n\t\t}\n\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\t\tyield();\n\t\tSZONE_MAGAZINE_PTR_LOCK(depot_ptr);\n\t}\n\n\t// disconnect node from Depot\n\trecirc_list_extract(rack, depot_ptr, node);\n\n\t// Iterate the region pulling its free entries off the (locked) Depot's free list\n\tint objects_in_use = small_free_detach_region(rack, depot_ptr, sparse_region);\n\n\t// Transfer ownership of the region\n\tMAGAZINE_INDEX_FOR_SMALL_REGION(sparse_region) = mag_index;\n\tnode->pinned_to_depot = 0;\n\n\t// Iterate the region putting its free entries on its new (locked) magazine's free list\n\tsize_t bytes_inplay = small_free_reattach_region(rack, small_mag_ptr, sparse_region);\n\n\tdepot_ptr->mag_num_bytes_in_objects -= bytes_inplay;\n\tdepot_ptr->num_bytes_in_magazine -= SMALL_REGION_PAYLOAD_BYTES;\n\tdepot_ptr->mag_num_objects -= objects_in_use;\n\n\tsmall_mag_ptr->mag_num_bytes_in_objects += bytes_inplay;\n\tsmall_mag_ptr->num_bytes_in_magazine += SMALL_REGION_PAYLOAD_BYTES;\n\tsmall_mag_ptr->mag_num_objects += objects_in_use;\n\n\t// connect to magazine as first node\n\trecirc_list_splice_first(rack, small_mag_ptr, node);\n\n\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\n\tMAGMALLOC_DEPOTREGION(SMALL_SZONE_FROM_RACK(rack), (int)mag_index, (void *)sparse_region, SMALL_REGION_SIZE,\n\t\t\t\t\t\t (int)BYTES_USED_FOR_SMALL_REGION(sparse_region)); // DTrace USDT Probe\n\n\treturn 1;\n}\n\n#if CONFIG_AGGRESSIVE_MADVISE || CONFIG_RECIRC_DEPOT\nstatic MALLOC_INLINE void\nsmall_madvise_free_range_no_lock(rack_t *rack,\n\t\t\t\t\t\t\t\t magazine_t *small_mag_ptr,\n\t\t\t\t\t\t\t\t region_t region,\n\t\t\t\t\t\t\t\t free_list_t freee,\n\t\t\t\t\t\t\t\t msize_t fmsize,\n\t\t\t\t\t\t\t\t void *headptr,\n\t\t\t\t\t\t\t\t size_t headsize)\n{\n\tvoid *ptr = small_free_list_get_ptr(rack, freee);\n\tregion_trailer_t *node = REGION_TRAILER_FOR_SMALL_REGION(region);\n\n\t// Lock on small_magazines[mag_index] is already held here.\n\t// Calculate the first page in the coalesced block that would be safe to mark MADV_FREE\n\tsize_t free_header_size = sizeof(free_list_t) + sizeof(msize_t);\n\n\t// If the free_list_t entry is out-of-line then we don't need to reserve any space\n\t// at the start of the region.\n\tif (small_is_oob_free_entry(freee)) {\n\t\tfree_header_size = 0;\n\t}\n\n\tuintptr_t safe_ptr = (uintptr_t)ptr + free_header_size;\n\tuintptr_t round_safe = round_page_kernel(safe_ptr);\n\n\t// Calculate the last page in the coalesced block that would be safe to mark MADV_FREE\n\tuintptr_t safe_extent = (uintptr_t)ptr + SMALL_BYTES_FOR_MSIZE(fmsize);\n\tuintptr_t trunc_extent = trunc_page_kernel(safe_extent);\n\n\t// The newly freed block may complete a span of bytes that cover one or more pages. Mark the span with MADV_FREE.\n\tif (round_safe < trunc_extent) { // Coalesced area covers a page (perhaps many)\n\t\t// Extend the freed block by the free region header and tail sizes to include pages\n\t\t// we may have coalesced that no longer host free region tails and headers.\n\t\t// This may extend over in-use ranges, but the MIN/MAX clamping below will fix that up.\n\t\tuintptr_t lo = trunc_page_kernel((uintptr_t)headptr);\n\t\tuintptr_t hi = round_page_kernel((uintptr_t)headptr + headsize + free_header_size);\n\n\t\tuintptr_t free_lo = MAX(round_safe, lo);\n\t\tuintptr_t free_hi = MIN(trunc_extent, hi);\n\n\t\tif (free_lo < free_hi) {\n\t\t\t// Before unlocking, ensure that the metadata for the freed region\n\t\t\t// makes it look not free but includes the length. This ensures that\n\t\t\t// any code that inspects the metadata while we are unlocked sees\n\t\t\t// a valid state and will not try to use or coalesce freed memory\n\t\t\t// into it.\n\t\t\tsmall_free_mark_unfree(rack, freee, fmsize);\n\t\t\tsmall_free_list_remove_ptr_no_clear(rack, small_mag_ptr, freee, fmsize);\n\t\t\tOSAtomicIncrement32Barrier(&(node->pinned_to_depot));\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\tmvm_madvise_free(rack, region, free_lo, free_hi, &rack->last_madvise, rack->debug_flags & MALLOC_DO_SCRIBBLE);\n\t\t\tSZONE_MAGAZINE_PTR_LOCK(small_mag_ptr);\n\t\t\tOSAtomicDecrement32Barrier(&(node->pinned_to_depot));\n\t\t\tsmall_free_list_add_ptr(rack, small_mag_ptr, ptr, fmsize);\n\t\t}\n\t}\n}\n#endif // CONFIG_AGGRESSIVE_MADVISE || CONFIG_RECIRC_DEPOT\n\n#if CONFIG_RECIRC_DEPOT\nstatic region_t\nsmall_free_try_depot_unmap_no_lock(rack_t *rack, magazine_t *depot_ptr, region_trailer_t *node)\n{\n\tif (0 < node->bytes_used || 0 < node->pinned_to_depot || depot_ptr->recirculation_entries < recirc_retained_regions) {\n\t\treturn NULL;\n\t}\n\n\t// disconnect first node from Depot\n\trecirc_list_extract(rack, depot_ptr, node);\n\n\t// Iterate the region pulling its free entries off the (locked) Depot's free list\n\tregion_t sparse_region = SMALL_REGION_FOR_PTR(node);\n\tint objects_in_use = small_free_detach_region(rack, depot_ptr, sparse_region);\n\n\tif (0 == objects_in_use) {\n\t\t// Invalidate the hash table entry for this region with HASHRING_REGION_DEALLOCATED.\n\t\t// Using HASHRING_REGION_DEALLOCATED preserves the collision chain, using HASHRING_OPEN_ENTRY (0) would not.\n\t\trgnhdl_t pSlot = hash_lookup_region_no_lock(rack->region_generation->hashed_regions,\n\t\t\t\t\t\t\t\t\t\t\t\t\track->region_generation->num_regions_allocated,\n\t\t\t\t\t\t\t\t\t\t\t\t\track->region_generation->num_regions_allocated_shift,\n\t\t\t\t\t\t\t\t\t\t\t\t\tsparse_region);\n\t\tif (NULL == pSlot) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true, \"small_free_try_depot_unmap_no_lock hash lookup failed: %p\\n\", sparse_region);\n\t\t\treturn NULL;\n\t\t}\n\t\t*pSlot = HASHRING_REGION_DEALLOCATED;\n\t\tdepot_ptr->num_bytes_in_magazine -= SMALL_REGION_PAYLOAD_BYTES;\n\t\t// Atomically increment num_regions_dealloc\n#ifdef __LP64___\n\t\tOSAtomicIncrement64(&rack->num_regions_dealloc);\n#else\n\t\tOSAtomicIncrement32((int32_t *)&rack->num_regions_dealloc);\n#endif\n\n\t\t// Caller will transfer ownership of the region back to the OS with no locks held\n\t\tMAGMALLOC_DEALLOCREGION(SMALL_SZONE_FROM_RACK(rack), (void *)sparse_region, (int)SMALL_REGION_SIZE); // DTrace USDT Probe\n\t\treturn sparse_region;\n\n\t} else {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"small_free_try_depot_unmap_no_lock objects_in_use not zero: %d\\n\", objects_in_use);\n\t\treturn NULL;\n\t}\n}\n\nstatic boolean_t\nsmall_free_do_recirc_to_depot(rack_t *rack, magazine_t *small_mag_ptr, mag_index_t mag_index)\n{\n\t// The entire magazine crossed the \"emptiness threshold\". Transfer a region\n\t// from this magazine to the Depot. Choose a region that itself has crossed the emptiness threshold (i.e\n\t// is at least fraction \"f\" empty.) Such a region will be marked \"suitable\" on the recirculation list.\n\tregion_trailer_t *node = small_mag_ptr->firstNode;\n\n\twhile (node && (!node->recirc_suitable || node->pinned_to_depot)) {\n\t\tnode = node->next;\n\t}\n\n\tif (NULL == node) {\n#if DEBUG_MALLOC\n\t\tmalloc_report(ASL_LEVEL_ERR, \"*** small_free_do_recirc_to_depot end of list\\n\");\n#endif\n\t\treturn TRUE; // Caller must SZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t}\n\n\tregion_t sparse_region = SMALL_REGION_FOR_PTR(node);\n\n\t// Deal with unclaimed memory -- mag_bytes_free_at_end or mag_bytes_free_at start\n\tif (sparse_region == small_mag_ptr->mag_last_region &&\n\t\t(small_mag_ptr->mag_bytes_free_at_end || small_mag_ptr->mag_bytes_free_at_start)) {\n\t\tsmall_finalize_region(rack, small_mag_ptr);\n\t}\n\n\t// disconnect \"suitable\" node from magazine\n\trecirc_list_extract(rack, small_mag_ptr, node);\n\n\t// Iterate the region pulling its free entries off its (locked) magazine's free list\n\tint objects_in_use = small_free_detach_region(rack, small_mag_ptr, sparse_region);\n\tmagazine_t *depot_ptr = &(rack->magazines[DEPOT_MAGAZINE_INDEX]);\n\n\t// hand over the region to the (locked) Depot\n\tSZONE_MAGAZINE_PTR_LOCK(depot_ptr);\n\t// this will cause small_free_list_add_ptr called by small_free_reattach_region to use\n\t// the depot as its target magazine, rather than magazine formerly associated with sparse_region\n\tMAGAZINE_INDEX_FOR_SMALL_REGION(sparse_region) = DEPOT_MAGAZINE_INDEX;\n\tnode->pinned_to_depot = 0;\n\n\t// Iterate the region putting its free entries on Depot's free list\n\tsize_t bytes_inplay = small_free_reattach_region(rack, depot_ptr, sparse_region);\n\n\tsmall_mag_ptr->mag_num_bytes_in_objects -= bytes_inplay;\n\tsmall_mag_ptr->num_bytes_in_magazine -= SMALL_REGION_PAYLOAD_BYTES;\n\tsmall_mag_ptr->mag_num_objects -= objects_in_use;\n\n\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr); // Unlock the originating magazine\n\n\tdepot_ptr->mag_num_bytes_in_objects += bytes_inplay;\n\tdepot_ptr->num_bytes_in_magazine += SMALL_REGION_PAYLOAD_BYTES;\n\tdepot_ptr->mag_num_objects += objects_in_use;\n\n\t// connect to Depot as last node\n\trecirc_list_splice_last(rack, depot_ptr, node);\n\n\tMAGMALLOC_RECIRCREGION(SMALL_SZONE_FROM_RACK(rack), (int)mag_index, (void *)sparse_region, SMALL_REGION_SIZE,\n\t\t\t\t\t\t (int)BYTES_USED_FOR_SMALL_REGION(sparse_region)); // DTrace USDT Probe\n\n#if !CONFIG_AGGRESSIVE_MADVISE\n\t// Mark free'd dirty pages with MADV_FREE to reduce memory pressure\n\tsmall_free_scan_madvise_free(rack, depot_ptr, sparse_region);\n#endif\n\n\t// If the region is entirely empty vm_deallocate() it outside the depot lock\n\tregion_t r_dealloc = small_free_try_depot_unmap_no_lock(rack, depot_ptr, node);\n\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\tif (r_dealloc) {\n\t\tmvm_deallocate_pages(r_dealloc, SMALL_REGION_SIZE, 0);\n\t}\n\treturn FALSE; // Caller need not unlock the originating magazine\n}\n\nstatic MALLOC_INLINE boolean_t\nsmall_free_try_recirc_to_depot(rack_t *rack,\n\t\t\t\t\t\t\t magazine_t *small_mag_ptr,\n\t\t\t\t\t\t\t mag_index_t mag_index,\n\t\t\t\t\t\t\t region_t region,\n\t\t\t\t\t\t\t free_list_t freee,\n\t\t\t\t\t\t\t msize_t msize,\n\t\t\t\t\t\t\t void *headptr,\n\t\t\t\t\t\t\t size_t headsize)\n{\n\tregion_trailer_t *node = REGION_TRAILER_FOR_SMALL_REGION(region);\n\tsize_t bytes_used = node->bytes_used;\n\n\t/* FIXME: Would Uniprocessor benefit from recirc and MADV_FREE? */\n\tif (rack->num_magazines == 1) { // Uniprocessor, single magazine, so no recirculation necessary\n\t\t/* NOTHING */\n\t\treturn TRUE; // Caller must do SZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr)\n\t} else if (DEPOT_MAGAZINE_INDEX != mag_index) {\n\t\t// Emptiness discriminant\n\t\tif (bytes_used < DENSITY_THRESHOLD(SMALL_REGION_PAYLOAD_BYTES)) {\n\t\t\t/* Region has crossed threshold from density to sparsity. Mark it \"suitable\" on the\n\t\t\t * recirculation candidates list. */\n\t\t\tnode->recirc_suitable = TRUE;\n\t\t} else {\n\t\t\t/* After this free, we've found the region is still dense, so it must have been even more so before\n\t\t\t * the free. That implies the region is already correctly marked. Do nothing. */\n\t\t}\n\n\t\t// Has the entire magazine crossed the \"emptiness threshold\"? If so, transfer a region\n\t\t// from this magazine to the Depot. Choose a region that itself has crossed the emptiness threshold (i.e\n\t\t// is at least fraction \"f\" empty.) Such a region will be marked \"suitable\" on the recirculation list.\n\n\t\tsize_t a = small_mag_ptr->num_bytes_in_magazine;\t// Total bytes allocated to this magazine\n\t\tsize_t u = small_mag_ptr->mag_num_bytes_in_objects; // In use (malloc'd) from this magaqzine\n\n\t\tif (a - u > ((3 * SMALL_REGION_PAYLOAD_BYTES) / 2) && u < DENSITY_THRESHOLD(a)) {\n\t\t\treturn small_free_do_recirc_to_depot(rack, small_mag_ptr, mag_index);\n\t\t}\n\n\t} else {\n#if !CONFIG_AGGRESSIVE_MADVISE\n\t\t// We are free'ing into the depot, so madvise as we do so unless we were madvising every incoming\n\t\t// allocation anyway.\n\t\tsmall_madvise_free_range_no_lock(rack, small_mag_ptr, region, freee, msize, headptr, headsize);\n#endif\n\n\t\tif (0 < bytes_used || 0 < node->pinned_to_depot) {\n\t\t\t/* Depot'd region is still live. Leave it in place on the Depot's recirculation list\n\t\t\t * so as to avoid thrashing between the Depot's free list and a magazines's free list\n\t\t\t * with detach_region/reattach_region */\n\t\t} else {\n\t\t\t/* Depot'd region is just now empty. Consider return to OS. */\n\t\t\tregion_t r_dealloc = small_free_try_depot_unmap_no_lock(rack, small_mag_ptr, node);\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\tif (r_dealloc) {\n\t\t\t\tmvm_deallocate_pages(r_dealloc, SMALL_REGION_SIZE, 0);\n\t\t\t}\n\t\t\treturn FALSE; // Caller need not unlock\n\t\t}\n\t}\n\treturn TRUE; // Caller must do SZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr)\n}\n#endif // CONFIG_RECIRC_DEPOT\n\nstatic MALLOC_INLINE boolean_t\nsmall_free_no_lock(rack_t *rack, magazine_t *small_mag_ptr, mag_index_t mag_index, region_t region, void *ptr, msize_t msize)\n{\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(ptr);\n\tunsigned index = SMALL_META_INDEX_FOR_PTR(ptr);\n\tsize_t original_size = SMALL_BYTES_FOR_MSIZE(msize);\n\tunsigned char *next_block = ((unsigned char *)ptr + original_size);\n\tmsize_t next_index = index + msize;\n\n\tMALLOC_TRACE(TRACE_small_free, (uintptr_t)rack, (uintptr_t)small_mag_ptr, (uintptr_t)ptr, SMALL_BYTES_FOR_MSIZE(msize));\n\n#if CONFIG_AGGRESSIVE_MADVISE || CONFIG_RECIRC_DEPOT\n\tvoid *original_ptr = ptr;\n#endif\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"in small_free_no_lock(), ptr=%p, msize=%d\\n\", ptr, msize);\n\t}\n\tif (!msize) {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"trying to free small block that is too small in small_free_no_lock(), ptr=%p, msize=%d\\n\",\n\t\t\t\tptr, msize);\n\t}\n#endif\n\n\t// We try to coalesce this block with the preceeding one\n\tif (index > 0 && (meta_headers[index - 1] & SMALL_IS_FREE)) {\n\t\tmsize_t previous_msize = meta_headers[index - 1] & ~SMALL_IS_FREE;\n\t\tgrain_t previous_index = index - previous_msize;\n\n\t\t// Check if the metadata for the start of the block is also free.\n\t\tif (meta_headers[previous_index] == (previous_msize | SMALL_IS_FREE)) {\n\t\t\tvoid *previous_ptr = (void *)((uintptr_t)ptr - SMALL_BYTES_FOR_MSIZE(previous_msize));\n\t\t\tfree_list_t previous = small_free_list_find_by_ptr(rack, small_mag_ptr, previous_ptr, previous_msize);\n\t\t\tsmall_free_list_remove_ptr(rack, small_mag_ptr, previous, previous_msize);\n\t\t\tptr = previous_ptr;\n\t\t\tsmall_meta_header_set_middle(meta_headers, index); // This block is now a middle block.\n\t\t\tmsize += previous_msize;\n\t\t\tindex -= previous_msize;\n\t\t} else {\n\t\t\t_os_set_crash_log_message(\"small free list metadata inconsistency (headers[previous] != previous size)\");\n\t\t\t__builtin_trap();\n\t\t}\n\t}\n\n\t// Try to coalesce with this block with the next block\n\tif ((next_block < SMALL_REGION_END(region)) && (meta_headers[next_index] & SMALL_IS_FREE)) {\n\t\tmsize_t next_msize = meta_headers[next_index] & ~SMALL_IS_FREE;\n\t\tfree_list_t next = small_free_list_find_by_ptr(rack, small_mag_ptr, next_block, next_msize);\n\t\tsmall_free_list_remove_ptr(rack, small_mag_ptr, next, next_msize);\n\t\tmsize += next_msize;\n\t}\n\n\tif (rack->debug_flags & MALLOC_DO_SCRIBBLE) {\n\t\tif (!msize) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true, \"incorrect size information for %p - block header was damaged\\n\", ptr);\n\t\t} else {\n\t\t\tmemset(ptr, SCRABBLE_BYTE, SMALL_BYTES_FOR_MSIZE(msize));\n\t\t}\n\t}\n\n\tfree_list_t freee = small_free_list_add_ptr(rack, small_mag_ptr, ptr, msize);\n\n\t// use original_size and not msize to avoid double counting the coalesced blocks\n\tsmall_mag_ptr->mag_num_bytes_in_objects -= original_size;\n\tsmall_mag_ptr->mag_num_objects--;\n\n\t// Update this region's bytes in use count\n\tregion_trailer_t *node = REGION_TRAILER_FOR_SMALL_REGION(region);\n\tsize_t bytes_used = node->bytes_used - original_size;\n\tnode->bytes_used = (unsigned int)bytes_used;\n\n#if CONFIG_AGGRESSIVE_MADVISE\n\tsmall_madvise_free_range_no_lock(rack, small_mag_ptr, region, freee, msize, original_ptr, original_size);\n#endif\n\n\t// Caller must do SZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr) if this function\n\t// returns TRUE.\n\tboolean_t needs_unlock = TRUE;\n\n#if CONFIG_RECIRC_DEPOT\n\tneeds_unlock = small_free_try_recirc_to_depot(rack, small_mag_ptr, mag_index, region, freee, msize, original_ptr, original_size);\n#endif\n\treturn needs_unlock;\n}\n\n// Allocates from the last region or a freshly allocated region\nstatic void *\nsmall_malloc_from_region_no_lock(rack_t *rack,\n\t\t\t\t\t\t\t\t magazine_t *small_mag_ptr,\n\t\t\t\t\t\t\t\t mag_index_t mag_index,\n\t\t\t\t\t\t\t\t msize_t msize,\n\t\t\t\t\t\t\t\t void *aligned_address)\n{\n\tvoid *ptr;\n\n\t// Before anything we transform the mag_bytes_free_at_end or mag_bytes_free_at_start - if any - to a regular free block\n\t/* FIXME: last_block needs to be coalesced with previous entry if free, */\n\tif (small_mag_ptr->mag_bytes_free_at_end || small_mag_ptr->mag_bytes_free_at_start) {\n\t\tsmall_finalize_region(rack, small_mag_ptr);\n\t}\n\n\t// Tag the region at \"aligned_address\" as belonging to us,\n\t// and so put it under the protection of the magazine lock we are holding.\n\t// Do this before advertising \"aligned_address\" on the hash ring(!)\n\tMAGAZINE_INDEX_FOR_SMALL_REGION(aligned_address) = mag_index;\n\n\t// Insert the new region into the hash ring\n\track_region_insert(rack, (region_t)aligned_address);\n\n\tsmall_mag_ptr->mag_last_region = aligned_address;\n\tBYTES_USED_FOR_SMALL_REGION(aligned_address) = SMALL_BYTES_FOR_MSIZE(msize);\n\n#if CONFIG_ASLR_INTERNAL\n\tint offset_msize = malloc_entropy[1] & SMALL_ENTROPY_MASK;\n#if DEBUG_MALLOC\n\tif (getenv(\"MallocASLRForce\")) {\n\t\toffset_msize = strtol(getenv(\"MallocASLRForce\"), NULL, 0) & SMALL_ENTROPY_MASK;\n\t}\n\tif (getenv(\"MallocASLRPrint\")) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"Region: %p offset: %d\\n\", aligned_address, offset_msize);\n\t}\n#endif\n#else\n\tint offset_msize = 0;\n#endif\n\tptr = (void *)((uintptr_t)aligned_address + SMALL_BYTES_FOR_MSIZE(offset_msize));\n\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(ptr), offset_msize, msize);\n\tsmall_mag_ptr->mag_num_objects++;\n\tsmall_mag_ptr->mag_num_bytes_in_objects += SMALL_BYTES_FOR_MSIZE(msize);\n\tsmall_mag_ptr->num_bytes_in_magazine += SMALL_REGION_PAYLOAD_BYTES;\n\n\t// add a big free block at the end\n\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(ptr), offset_msize + msize, NUM_SMALL_BLOCKS - msize - offset_msize);\n\tsmall_mag_ptr->mag_bytes_free_at_end = SMALL_BYTES_FOR_MSIZE(NUM_SMALL_BLOCKS - msize - offset_msize);\n\n#if CONFIG_ASLR_INTERNAL\n\t// add a big free block at the start\n\tsmall_mag_ptr->mag_bytes_free_at_start = SMALL_BYTES_FOR_MSIZE(offset_msize);\n\tif (offset_msize) {\n\t\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(ptr), 0, offset_msize);\n\t}\n#else\n\tsmall_mag_ptr->mag_bytes_free_at_start = 0;\n#endif\n\n\t// connect to magazine as last node\n\trecirc_list_splice_last(rack, small_mag_ptr, REGION_TRAILER_FOR_SMALL_REGION(aligned_address));\n\n\treturn ptr;\n}\n\nvoid *\nsmall_memalign(szone_t *szone, size_t alignment, size_t size, size_t span)\n{\n\tmsize_t mspan = SMALL_MSIZE_FOR_BYTES(span + SMALL_QUANTUM - 1);\n\tvoid *p = small_malloc_should_clear(&szone->small_rack, mspan, 0);\n\n\tif (NULL == p) {\n\t\treturn NULL;\n\t}\n\n\tsize_t offset = ((uintptr_t)p) & (alignment - 1);\t// p % alignment\n\tsize_t pad = (0 == offset) ? 0 : alignment - offset; // p + pad achieves desired alignment\n\n\tmsize_t msize = SMALL_MSIZE_FOR_BYTES(size + SMALL_QUANTUM - 1);\n\tmsize_t mpad = SMALL_MSIZE_FOR_BYTES(pad + SMALL_QUANTUM - 1);\n\tmsize_t mwaste = mspan - msize - mpad; // excess blocks\n\n\tif (mpad > 0) {\n\t\tvoid *q = (void *)(((uintptr_t)p) + pad);\n\n\t\t// Mark q as block header and in-use, thus creating two blocks.\n\t\tmagazine_t *small_mag_ptr = mag_lock_zine_for_region_trailer(szone->small_rack.magazines,\n\t\t\t\tREGION_TRAILER_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(p)),\n\t\t\t\tMAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(p)));\n\t\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(p), SMALL_META_INDEX_FOR_PTR(p), mpad);\n\t\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(q), SMALL_META_INDEX_FOR_PTR(q), msize + mwaste);\n\t\tsmall_mag_ptr->mag_num_objects++;\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\n\t\t// Give up mpad blocks beginning at p to the small free list\n\t\tfree_small(&szone->small_rack, p, SMALL_REGION_FOR_PTR(p), SMALL_BYTES_FOR_MSIZE(mpad));\n\n\t\tp = q; // advance p to the desired alignment\n\t}\n\tif (mwaste > 0) {\n\t\tvoid *q = (void *)(((uintptr_t)p) + SMALL_BYTES_FOR_MSIZE(msize));\n\t\t// Mark q as block header and in-use, thus creating two blocks.\n\t\tmagazine_t *small_mag_ptr = mag_lock_zine_for_region_trailer(szone->small_rack.magazines,\n\t\t\t\tREGION_TRAILER_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(p)),\n\t\t\t\tMAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(p)));\n\t\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(p), SMALL_META_INDEX_FOR_PTR(p), msize);\n\t\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(q), SMALL_META_INDEX_FOR_PTR(q), mwaste);\n\t\tsmall_mag_ptr->mag_num_objects++;\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\n\t\t// Give up mwaste blocks beginning at q to the small free list\n\t\tfree_small(&szone->small_rack, q, SMALL_REGION_FOR_PTR(q), SMALL_BYTES_FOR_MSIZE(mwaste));\n\t}\n\n\treturn p; // p has the desired size and alignment, and can later be free()'d\n}\n\nboolean_t\nsmall_claimed_address(rack_t *rack, void *ptr)\n{\n\tregion_t r = small_region_for_ptr_no_lock(rack, ptr);\n\treturn r && ptr < (void *)SMALL_REGION_END(r);\n}\n\nvoid *\nsmall_try_shrink_in_place(rack_t *rack, void *ptr, size_t old_size, size_t new_good_size)\n{\n\tmsize_t new_msize = SMALL_MSIZE_FOR_BYTES(new_good_size);\n\tmsize_t mshrinkage = SMALL_MSIZE_FOR_BYTES(old_size) - new_msize;\n\n\tif (mshrinkage) {\n\t\tvoid *q = (void *)((uintptr_t)ptr + SMALL_BYTES_FOR_MSIZE(new_msize));\n\t\tmagazine_t *small_mag_ptr = mag_lock_zine_for_region_trailer(rack->magazines,\n\t\t\t\tREGION_TRAILER_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr)),\n\t\t\t\tMAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr)));\n\n\t\t// Mark q as block header and in-use, thus creating two blocks.\n\t\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(ptr), SMALL_META_INDEX_FOR_PTR(ptr), new_msize);\n\t\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(q), SMALL_META_INDEX_FOR_PTR(q), mshrinkage);\n\t\tsmall_mag_ptr->mag_num_objects++;\n\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\tfree_small(rack, q, SMALL_REGION_FOR_PTR(q), 0);\n\t}\n\n\treturn ptr;\n}\n\nboolean_t\nsmall_try_realloc_in_place(rack_t *rack, void *ptr, size_t old_size, size_t new_size)\n{\n\t// returns 1 on success\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(ptr);\n\tunsigned index;\n\tmsize_t old_msize, new_msize;\n\tunsigned next_index;\n\tvoid *next_block;\n\tmsize_t next_msize_and_free;\n\tboolean_t is_free;\n\tmsize_t next_msize, leftover_msize;\n\tvoid *leftover;\n\n\tindex = SMALL_META_INDEX_FOR_PTR(ptr);\n\told_msize = SMALL_MSIZE_FOR_BYTES(old_size);\n\tnew_msize = SMALL_MSIZE_FOR_BYTES(new_size + SMALL_QUANTUM - 1);\n\tnext_index = index + old_msize;\n\n\tif (next_index >= NUM_SMALL_BLOCKS) {\n\t\treturn 0;\n\t}\n\tnext_block = (char *)ptr + old_size;\n\n#if DEBUG_MALLOC\n\tif ((uintptr_t)next_block & (SMALL_QUANTUM - 1)) {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"internal invariant broken in realloc(next_block) for %p\\n\", next_block);\n\t}\n\tif (meta_headers[index] != old_msize) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"*** small_try_realloc_in_place incorrect old %d %d\\n\", meta_headers[index], old_msize);\n\t}\n#endif\n\n\tmagazine_t *small_mag_ptr = mag_lock_zine_for_region_trailer(rack->magazines,\n\t\t\tREGION_TRAILER_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr)),\n\t\t\tMAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr)));\n\tif (DEPOT_MAGAZINE_INDEX == MAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr))) {\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\treturn 0;\n\t}\n\n\tmsize_t coalesced_msize = new_msize - old_msize;\n#if CONFIG_SMALL_CACHE\n\tvoid *last_free_ptr = small_mag_ptr->mag_last_free;\n\tmsize_t last_free_msize = small_mag_ptr->mag_last_free_msize;\n\tif (last_free_ptr == next_block && old_msize + last_free_msize >= new_msize) {\n\t\t/*\n\t\t * There is a block in mag_last_free and it's immediately after\n\t\t * this block and it's large enough. We can use some or all of it.\n\t\t */\n\t\tleftover_msize = last_free_msize - coalesced_msize;\n\t\tif (leftover_msize) {\n\t\t\tsmall_mag_ptr->mag_last_free_msize -= coalesced_msize;\n\t\t\tsmall_mag_ptr->mag_last_free += new_size - old_size;\n\t\t\t// The block in mag_last_free is still marked as header and in-use, so copy that\n\t\t\t// state to the block that remains. The state for the block that we're going to\n\t\t\t// use is adjusted by the small_meta_header_set_middle() call below.\n\t\t\tsmall_meta_header_set_in_use(meta_headers, index + new_msize, leftover_msize);\n\t\t} else {\n\t\t\t// Using the whole block.\n\t\t\tsmall_mag_ptr->mag_last_free = NULL;\n\t\t\tsmall_mag_ptr->mag_last_free_msize = 0;\n\t\t\tsmall_mag_ptr->mag_last_free_rgn = NULL;\n\t\t}\n\t\tsmall_meta_header_set_in_use(meta_headers, index, new_msize);\n\t\tsmall_meta_header_set_middle(meta_headers, next_index);\n\t} else {\n#endif // CONFIG_SMALL_CACHE\n\t\t/*\n\t\t * Try to expand into unused space immediately after this block.\n\t\t */\n\t\tmsize_t unused_msize = SMALL_MSIZE_FOR_BYTES(small_mag_ptr->mag_bytes_free_at_end);\n\t\tvoid *unused_start = SMALL_REGION_END(SMALL_REGION_FOR_PTR(ptr)) - small_mag_ptr->mag_bytes_free_at_end;\n\t\tif (small_mag_ptr->mag_last_region == SMALL_REGION_FOR_PTR(ptr)\n\t\t\t\t&& coalesced_msize < unused_msize && unused_start == ptr + old_size) {\n\t\t\t// Extend the in-use for this block to the new size\n\t\t\tsmall_meta_header_set_in_use(meta_headers, index, new_msize);\n\n\t\t\t// Clear the in-use size for the start of the area we extended into\n\t\t\tsmall_meta_header_set_middle(meta_headers, next_index);\n\n\t\t\t// Reduce mag_bytes_free_at_end and update its in-use size.\n\t\t\tsmall_mag_ptr->mag_bytes_free_at_end -= SMALL_BYTES_FOR_MSIZE(coalesced_msize);\n\t\t\tsmall_meta_header_set_in_use(meta_headers, index + new_msize, SMALL_MSIZE_FOR_BYTES(small_mag_ptr->mag_bytes_free_at_end));\n\t\t} else {\n\t\t\t/*\n\t\t\t * Look for a free block immediately afterwards. If it's large enough, we can consume (part of)\n\t\t\t * it.\n\t\t\t */\n\t\t\tnext_msize_and_free = meta_headers[next_index];\n\t\t\tis_free = next_msize_and_free & SMALL_IS_FREE;\n\t\t\tif (!is_free) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\treturn 0; // next_block is in use;\n\t\t\t}\n\n\t\t\tnext_msize = next_msize_and_free & ~SMALL_IS_FREE;\n\t\t\tif (old_msize + next_msize < new_msize) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\treturn 0; // even with next block, not enough\n\t\t\t}\n\n\t\t\t// The following block is big enough; pull it from its freelist and chop off enough to satisfy\n\t\t\t// our needs.\n\t\t\tfree_list_t freee = small_free_list_find_by_ptr(rack, small_mag_ptr, next_block, next_msize);\n\t\t\tsmall_free_list_remove_ptr(rack, small_mag_ptr, freee, next_msize);\n\t\t\tsmall_meta_header_set_middle(meta_headers, next_index);\n\t\t\tleftover_msize = old_msize + next_msize - new_msize;\n\t\t\tif (leftover_msize) {\n\t\t\t\t/* there's some left, so put the remainder back */\n\t\t\t\tleftover = (unsigned char *)ptr + SMALL_BYTES_FOR_MSIZE(new_msize);\n\t\t\t\tsmall_free_list_add_ptr(rack, small_mag_ptr, leftover, leftover_msize);\n\t\t\t}\n\t\t\tsmall_meta_header_set_in_use(meta_headers, index, new_msize);\n\t\t}\n#if CONFIG_SMALL_CACHE\n\t}\n#endif // CONFIG_SMALL_CACHE\n#if DEBUG_MALLOC\n\tif (SMALL_BYTES_FOR_MSIZE(new_msize) > szone->large_threshold) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"*** realloc in place for %p exceeded msize=%d\\n\", new_msize);\n\t}\n\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in small_try_realloc_in_place(), ptr=%p, msize=%d\\n\", ptr, *SMALL_METADATA_FOR_PTR(ptr));\n\t}\n#endif\n\tsmall_mag_ptr->mag_num_bytes_in_objects += SMALL_BYTES_FOR_MSIZE(new_msize - old_msize);\n\n\t// Update this region's bytes in use count\n\tregion_trailer_t *node = REGION_TRAILER_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr));\n\tsize_t bytes_used = node->bytes_used + SMALL_BYTES_FOR_MSIZE(new_msize - old_msize);\n\tnode->bytes_used = (unsigned int)bytes_used;\n\n\t// Emptiness discriminant\n\tif (bytes_used < DENSITY_THRESHOLD(SMALL_REGION_PAYLOAD_BYTES)) {\n\t\t/* After this reallocation the region is still sparse, so it must have been even more so before\n\t\t * the reallocation. That implies the region is already correctly marked. Do nothing. */\n\t} else {\n\t\t/* Region has crossed threshold from sparsity to density. Mark it not \"suitable\" on the\n\t\t * recirculation candidates list. */\n\t\tnode->recirc_suitable = FALSE;\n\t}\n\n\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\tCHECK(szone, __PRETTY_FUNCTION__);\n\treturn 1;\n}\n\nstatic char *small_check_fail_msg = \"check: incorrect small region \";\n\n#define SMALL_CHECK_FAIL(fmt, ...) \\\n\tmalloc_zone_check_fail(small_check_fail_msg, \\\n\t\t\t\"%ld, counter=%d\\n\" fmt, region_index, counter, __VA_ARGS__);\n\nboolean_t\nsmall_check_region(rack_t *rack, region_t region, size_t region_index,\n\t\tunsigned counter)\n{\n\tunsigned char *ptr = SMALL_REGION_ADDRESS(region);\n\tmsize_t *meta_headers = SMALL_META_HEADER_FOR_PTR(ptr);\n\tunsigned char *region_end = SMALL_REGION_END(region);\n\tmsize_t prev_free = 0;\n\tunsigned index;\n\tmsize_t msize_and_free;\n\tmsize_t msize;\n\tfree_list_t free_head, previous, next;\n\tmsize_t *follower;\n\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr));\n\tmagazine_t *small_mag_ptr = &(rack->magazines[mag_index]);\n\n\t// Assumes locked\n\tCHECK_MAGAZINE_PTR_LOCKED(szone, small_mag_ptr, __PRETTY_FUNCTION__);\n\n\tif (region == small_mag_ptr->mag_last_region) {\n\t\tptr += small_mag_ptr->mag_bytes_free_at_start;\n\t\tregion_end -= small_mag_ptr->mag_bytes_free_at_end;\n\t}\n\n\twhile (ptr < region_end) {\n\t\tindex = SMALL_META_INDEX_FOR_PTR(ptr);\n\t\tmsize_and_free = meta_headers[index];\n\t\tif (!(msize_and_free & SMALL_IS_FREE)) {\n\t\t\t// block is in use\n\t\t\tmsize = msize_and_free;\n\t\t\tif (!msize) {\n\t\t\t\tSMALL_CHECK_FAIL(\"*** invariant broken: null msize ptr=%p num_small_regions=%d end=%p\\n\", ptr,\n\t\t\t\t\t\t\t (int)rack->num_regions, region_end);\n\t\t\t\treturn 0;\n\t\t\t}\n#if !CONFIG_RELAXED_INVARIANT_CHECKS\n\t\t\tif (SMALL_BYTES_FOR_MSIZE(msize) > szone->large_threshold) {\n\t\t\t\tSMALL_CHECK_FAIL(\"*** invariant broken for %p this small msize=%d - size is too large\\n\", ptr, msize_and_free);\n\t\t\t\treturn 0;\n\t\t\t}\n#endif // CONFIG_RELAXED_INVARIANT_CHECKS\n\t\t\tptr += SMALL_BYTES_FOR_MSIZE(msize);\n\t\t\tprev_free = 0;\n\t\t} else {\n\t\t\t// free pointer\n\t\t\tmsize = msize_and_free & ~SMALL_IS_FREE;\n\t\t\tfree_head = (free_list_t){ .p = ptr };\n\t\t\tfollower = (msize_t *)FOLLOWING_SMALL_PTR(ptr, msize);\n\t\t\tif (!msize) {\n\t\t\t\tSMALL_CHECK_FAIL(\"*** invariant broken for free block %p this msize=%d\\n\", ptr, msize);\n\t\t\t\treturn 0;\n\t\t\t}\n#if !CONFIG_RELAXED_INVARIANT_CHECKS\n\t\t\tif (prev_free) {\n\t\t\t\tSMALL_CHECK_FAIL(\"*** invariant broken for %p (2 free in a row)\\n\", ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n#endif\n\n\t\t\t// check for possible OOB entry if needed\n\t\t\tif (small_needs_oob_free_entry(ptr, msize)) {\n\t\t\t\toob_free_entry_t oob = small_oob_free_find_ptr(ptr, msize);\n\t\t\t\tif (oob) {\n\t\t\t\t\tfree_head.oob = oob;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tprevious = small_free_list_get_previous(rack, free_head);\n\t\t\tnext = small_free_list_get_next(rack, free_head);\n\t\t\tif (previous.p && !SMALL_PTR_IS_FREE(small_free_list_get_ptr(rack, previous))) {\n\t\t\t\tSMALL_CHECK_FAIL(\"*** invariant broken for %p (previous %p is not a free pointer)\\n\", ptr, small_free_list_get_ptr(rack, previous));\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (next.p && !SMALL_PTR_IS_FREE(small_free_list_get_ptr(rack, next))) {\n\t\t\t\tSMALL_CHECK_FAIL(\"*** invariant broken for %p (next %p is not a free pointer)\\n\", ptr, small_free_list_get_ptr(rack, next));\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (SMALL_PREVIOUS_MSIZE(follower) != msize) {\n\t\t\t\tSMALL_CHECK_FAIL(\"*** invariant broken for small free %p followed by %p in region [%p-%p] \"\n\t\t\t\t\t\t\"(end marker incorrect) should be %d; in fact %d\\n\",\n\t\t\t\t\t\tptr, follower, SMALL_REGION_ADDRESS(region), region_end, msize, SMALL_PREVIOUS_MSIZE(follower));\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tptr = (unsigned char *)follower;\n\t\t\tprev_free = SMALL_IS_FREE;\n\t\t}\n\t}\n\treturn 1;\n}\n\nkern_return_t\nsmall_in_use_enumerator(task_t task,\n\t\t\t\t\t\tvoid *context,\n\t\t\t\t\t\tunsigned type_mask,\n\t\t\t\t\t\tszone_t *szone,\n\t\t\t\t\t\tmemory_reader_t reader,\n\t\t\t\t\t\tvm_range_recorder_t recorder)\n{\n\tsize_t num_regions;\n\tsize_t index;\n\tregion_t *regions;\n\tvm_range_t buffer[MAX_RECORDER_BUFFER];\n\tunsigned count = 0;\n\tkern_return_t err;\n\tregion_t region;\n\tvm_range_t range;\n\tvm_range_t admin_range;\n\tvm_range_t ptr_range;\n\tunsigned char *mapped_region;\n\tmsize_t *block_header;\n\tunsigned block_index;\n\tunsigned block_limit;\n\tmsize_t msize_and_free;\n\tmsize_t msize;\n\tmagazine_t *small_mag_base = NULL;\n\n\tregion_hash_generation_t *srg_ptr;\n\terr = reader(task, (vm_address_t)szone->small_rack.region_generation, sizeof(region_hash_generation_t), (void **)&srg_ptr);\n\tif (err) {\n\t\treturn err;\n\t}\n\n\tnum_regions = srg_ptr->num_regions_allocated;\n\terr = reader(task, (vm_address_t)srg_ptr->hashed_regions, sizeof(region_t) * num_regions, (void **)®ions);\n\tif (err) {\n\t\treturn err;\n\t}\n\n\tif (type_mask & MALLOC_PTR_IN_USE_RANGE_TYPE) {\n\t\t// Map in all active magazines. Do this outside the iteration over regions.\n\t\terr = reader(task, (vm_address_t)(szone->small_rack.magazines), szone->small_rack.num_magazines * sizeof(magazine_t),\n\t\t\t\t\t (void **)&small_mag_base);\n\t\tif (err) {\n\t\t\treturn err;\n\t\t}\n\t}\n\n\tfor (index = 0; index < num_regions; ++index) {\n\t\tregion = regions[index];\n\t\tif (HASHRING_OPEN_ENTRY != region && HASHRING_REGION_DEALLOCATED != region) {\n\t\t\trange.address = (vm_address_t)SMALL_REGION_ADDRESS(region);\n\t\t\trange.size = SMALL_REGION_SIZE;\n\t\t\tif (type_mask & MALLOC_ADMIN_REGION_RANGE_TYPE) {\n\t\t\t\tadmin_range.address = range.address + SMALL_METADATA_START;\n\t\t\t\tadmin_range.size = SMALL_METADATA_SIZE;\n\t\t\t\trecorder(task, context, MALLOC_ADMIN_REGION_RANGE_TYPE, &admin_range, 1);\n\t\t\t}\n\t\t\tif (type_mask & (MALLOC_PTR_REGION_RANGE_TYPE | MALLOC_ADMIN_REGION_RANGE_TYPE)) {\n\t\t\t\tptr_range.address = range.address;\n\t\t\t\tptr_range.size = NUM_SMALL_BLOCKS * SMALL_QUANTUM;\n\t\t\t\trecorder(task, context, MALLOC_PTR_REGION_RANGE_TYPE, &ptr_range, 1);\n\t\t\t}\n\t\t\tif (type_mask & MALLOC_PTR_IN_USE_RANGE_TYPE) {\n\t\t\t\tvm_address_t mag_last_free = 0;\n\t\t\t\tmsize_t mag_last_free_msize = 0;\n\n\t\t\t\terr = reader(task, range.address, range.size, (void **)&mapped_region);\n\t\t\t\tif (err) {\n\t\t\t\t\treturn err;\n\t\t\t\t}\n\n\t\t\t\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_SMALL_REGION(mapped_region);\n\t\t\t\tmagazine_t *small_mag_ptr = small_mag_base + mag_index;\n\n\t\t\t\tif (DEPOT_MAGAZINE_INDEX != mag_index) {\n\t\t\t\t\tmag_last_free = (uintptr_t)small_mag_ptr->mag_last_free;\n\t\t\t\t\tmag_last_free_msize = small_mag_ptr->mag_last_free_msize;\n\t\t\t\t} else {\n\t\t\t\t\tfor (mag_index = 0; mag_index < szone->small_rack.num_magazines; mag_index++) {\n\t\t\t\t\t\tif ((void *)range.address == (small_mag_base + mag_index)->mag_last_free_rgn) {\n\t\t\t\t\t\t\tmag_last_free = (uintptr_t)(small_mag_base + mag_index)->mag_last_free;\n\t\t\t\t\t\t\tmag_last_free_msize = (small_mag_base + mag_index)->mag_last_free_msize;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tblock_header = (msize_t *)(mapped_region + SMALL_METADATA_START + sizeof(region_trailer_t));\n\t\t\t\tblock_index = 0;\n\t\t\t\tblock_limit = NUM_SMALL_BLOCKS;\n\t\t\t\tif (region == small_mag_ptr->mag_last_region) {\n\t\t\t\t\tblock_index += SMALL_MSIZE_FOR_BYTES(small_mag_ptr->mag_bytes_free_at_start);\n\t\t\t\t\tblock_limit -= SMALL_MSIZE_FOR_BYTES(small_mag_ptr->mag_bytes_free_at_end);\n\t\t\t\t}\n\t\t\t\twhile (block_index < block_limit) {\n\t\t\t\t\tmsize_and_free = block_header[block_index];\n\t\t\t\t\tmsize = msize_and_free & ~SMALL_IS_FREE;\n\t\t\t\t\tif (!(msize_and_free & SMALL_IS_FREE) &&\n\t\t\t\t\t\trange.address + SMALL_BYTES_FOR_MSIZE(block_index) != mag_last_free) {\n\t\t\t\t\t\t// Block in use\n\t\t\t\t\t\tbuffer[count].address = range.address + SMALL_BYTES_FOR_MSIZE(block_index);\n\t\t\t\t\t\tbuffer[count].size = SMALL_BYTES_FOR_MSIZE(msize);\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t\tif (count >= MAX_RECORDER_BUFFER) {\n\t\t\t\t\t\t\trecorder(task, context, MALLOC_PTR_IN_USE_RANGE_TYPE, buffer, count);\n\t\t\t\t\t\t\tcount = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!msize) {\n\t\t\t\t\t\treturn KERN_FAILURE; // Somethings amiss. Avoid looping at this block_index.\n\t\t\t\t\t}\n\t\t\t\t\tblock_index += msize;\n\t\t\t\t}\n\t\t\t\tif (count) {\n\t\t\t\t\trecorder(task, context, MALLOC_PTR_IN_USE_RANGE_TYPE, buffer, count);\n\t\t\t\t\tcount = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nstatic void *\nsmall_malloc_from_free_list(rack_t *rack, magazine_t *small_mag_ptr, mag_index_t mag_index, msize_t msize)\n{\n\tmsize_t this_msize;\n\tgrain_t slot = SMALL_FREE_SLOT_FOR_MSIZE(rack, msize);\n\tfree_list_t *free_list = small_mag_ptr->mag_free_list;\n\tfree_list_t *the_slot = free_list + slot;\n\tfree_list_t *limit;\n\tunsigned bitmap;\n\tmsize_t leftover_msize;\n\tvoid *leftover_ptr;\n\tvoid *ptr;\n\n\t// Assumes we've locked the region\n\tCHECK_MAGAZINE_PTR_LOCKED(szone, small_mag_ptr, __PRETTY_FUNCTION__);\n\n\t// Look for an exact match by checking the freelist for this msize.\n\tif (small_free_list_get_ptr(rack, *the_slot)) {\n\t\tptr = small_free_list_get_ptr(rack, *the_slot);\n\t\tthis_msize = msize;\n\t\tsmall_free_list_remove_ptr(rack, small_mag_ptr, *the_slot, msize);\n\t\tgoto return_small_alloc;\n\t}\n\n\t// Mask off the bits representing slots holding free blocks smaller than\n\t// the size we need. If there are no larger free blocks, try allocating\n\t// from the free space at the end of the small region.\n\tif (SMALL_FREELIST_BITMAP_WORDS(rack) > 1) {\n\t\t// BITMAPN_CTZ implementation\n\t\tunsigned idx = slot >> 5;\n\t\tbitmap = 0;\n\t\tunsigned mask = ~((1 << (slot & 31)) - 1);\n\t\tfor (; idx < SMALL_FREELIST_BITMAP_WORDS(rack); ++idx) {\n\t\t\tbitmap = small_mag_ptr->mag_bitmap[idx] & mask;\n\t\t\tif (bitmap != 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tmask = ~0U;\n\t\t}\n\t\t// Check for fallthrough: No bits set in bitmap\n\t\tif ((bitmap == 0) && (idx == SMALL_FREELIST_BITMAP_WORDS(rack))) {\n\t\t\tgoto try_small_from_end;\n\t\t}\n\n\t\t// Start looking at the first set bit, plus 32 bits for every word of\n\t\t// zeroes or entries that were too small.\n\t\tslot = BITMAP32_CTZ((&bitmap)) + (idx * 32);\n\t} else {\n\t\tbitmap = small_mag_ptr->mag_bitmap[0] & ~((1 << slot) - 1);\n\t\tif (!bitmap) {\n\t\t\tgoto try_small_from_end;\n\t\t}\n\n\t\tslot = BITMAP32_CTZ((&bitmap));\n\t}\n\t// FIXME: Explain use of - 1 here, last slot has special meaning\n\tlimit = free_list + SMALL_FREE_SLOT_COUNT(rack) - 1;\n\tfree_list += slot;\n\n\t// Attempt to pull off the free_list slot that we now think is full.\n\tif ((ptr = small_free_list_get_ptr(rack, *free_list))) {\n\t\tthis_msize = SMALL_PTR_SIZE(ptr);\n\t\tsmall_free_list_remove_ptr(rack, small_mag_ptr, *free_list, this_msize);\n\t\tgoto add_leftover_and_proceed;\n\t}\n\n#if DEBUG_MALLOC\n\tmalloc_report(ASL_LEVEL_ERR, \"in small_malloc_from_free_list(), mag_bitmap out of sync, slot=%d\\n\", slot);\n#endif\n\ntry_small_from_end:\n\t// Let's see if we can use small_mag_ptr->mag_bytes_free_at_end\n\tif (small_mag_ptr->mag_bytes_free_at_end >= SMALL_BYTES_FOR_MSIZE(msize)) {\n\t\tptr = SMALL_REGION_END(small_mag_ptr->mag_last_region) - small_mag_ptr->mag_bytes_free_at_end;\n\t\tsmall_mag_ptr->mag_bytes_free_at_end -= SMALL_BYTES_FOR_MSIZE(msize);\n\t\tif (small_mag_ptr->mag_bytes_free_at_end) {\n\t\t\t// let's mark this block as in use to serve as boundary\n\t\t\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(ptr),\n\t\t\t\t\t\t\t\t\t\t SMALL_META_INDEX_FOR_PTR((unsigned char *)ptr + SMALL_BYTES_FOR_MSIZE(msize)),\n\t\t\t\t\t\t\t\t\t\t SMALL_MSIZE_FOR_BYTES(small_mag_ptr->mag_bytes_free_at_end));\n\t\t}\n\t\tthis_msize = msize;\n\t\tgoto return_small_alloc;\n\t}\n#if CONFIG_ASLR_INTERNAL\n\t// Try from start if nothing left at end\n\tif (small_mag_ptr->mag_bytes_free_at_start >= SMALL_BYTES_FOR_MSIZE(msize)) {\n\t\tptr = SMALL_REGION_ADDRESS(small_mag_ptr->mag_last_region) + small_mag_ptr->mag_bytes_free_at_start -\n\t\t\t\tSMALL_BYTES_FOR_MSIZE(msize);\n\t\tsmall_mag_ptr->mag_bytes_free_at_start -= SMALL_BYTES_FOR_MSIZE(msize);\n\t\tif (small_mag_ptr->mag_bytes_free_at_start) {\n\t\t\t// let's mark this block as in use to serve as boundary\n\t\t\tsmall_meta_header_set_in_use(\n\t\t\t\t\t\t\t\t\t\t SMALL_META_HEADER_FOR_PTR(ptr), 0, SMALL_MSIZE_FOR_BYTES(small_mag_ptr->mag_bytes_free_at_start));\n\t\t}\n\t\tthis_msize = msize;\n\t\tgoto return_small_alloc;\n\t}\n#endif\n\treturn NULL;\n\nadd_leftover_and_proceed:\n\tif (this_msize > msize) {\n\t\tleftover_msize = this_msize - msize;\n\t\tleftover_ptr = (unsigned char *)ptr + SMALL_BYTES_FOR_MSIZE(msize);\n#if DEBUG_MALLOC\n\t\tif (LOG(szone, ptr)) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"in small_malloc_from_free_list(), adding leftover ptr=%p, this_msize=%d\\n\", ptr, this_msize);\n\t\t}\n#endif\n\t\tsmall_free_list_add_ptr(rack, small_mag_ptr, leftover_ptr, leftover_msize);\n\t\tthis_msize = msize;\n\t}\n\nreturn_small_alloc:\n\tsmall_mag_ptr->mag_num_objects++;\n\tsmall_mag_ptr->mag_num_bytes_in_objects += SMALL_BYTES_FOR_MSIZE(this_msize);\n\n\t// Update this region's bytes in use count\n\tregion_trailer_t *node = REGION_TRAILER_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr));\n\tsize_t bytes_used = node->bytes_used + SMALL_BYTES_FOR_MSIZE(this_msize);\n\tnode->bytes_used = (unsigned int)bytes_used;\n\n\t// Emptiness discriminant\n\tif (bytes_used < DENSITY_THRESHOLD(SMALL_REGION_PAYLOAD_BYTES)) {\n\t\t/* After this allocation the region is still sparse, so it must have been even more so before\n\t\t * the allocation. That implies the region is already correctly marked. Do nothing. */\n\t} else {\n\t\t/* Region has crossed threshold from sparsity to density. Mark in not \"suitable\" on the\n\t\t * recirculation candidates list. */\n\t\tnode->recirc_suitable = FALSE;\n\t}\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in small_malloc_from_free_list(), ptr=%p, this_msize=%d, msize=%d\\n\", ptr, this_msize, msize);\n\t}\n#endif\n\tsmall_meta_header_set_in_use(SMALL_META_HEADER_FOR_PTR(ptr), SMALL_META_INDEX_FOR_PTR(ptr), this_msize);\n\treturn ptr;\n}\n\nvoid *\nsmall_malloc_should_clear(rack_t *rack, msize_t msize, boolean_t cleared_requested)\n{\n\tvoid *ptr;\n\tmag_index_t mag_index = small_mag_get_thread_index() % rack->num_magazines;\n\tmagazine_t *small_mag_ptr = &(rack->magazines[mag_index]);\n\n\tMALLOC_TRACE(TRACE_small_malloc, (uintptr_t)rack, SMALL_BYTES_FOR_MSIZE(msize), (uintptr_t)small_mag_ptr, cleared_requested);\n\n\tSZONE_MAGAZINE_PTR_LOCK(small_mag_ptr);\n\n#if CONFIG_SMALL_CACHE\n\tptr = small_mag_ptr->mag_last_free;\n\n\tif (small_mag_ptr->mag_last_free_msize == msize) {\n\t\t// we have a winner\n\t\tsmall_mag_ptr->mag_last_free = NULL;\n\t\tsmall_mag_ptr->mag_last_free_msize = 0;\n\t\tsmall_mag_ptr->mag_last_free_rgn = NULL;\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\tif (cleared_requested) {\n\t\t\tmemset(ptr, 0, SMALL_BYTES_FOR_MSIZE(msize));\n\t\t}\n\t\treturn ptr;\n\t}\n#endif /* CONFIG_SMALL_CACHE */\n\n\twhile (1) {\n\t\tptr = small_malloc_from_free_list(rack, small_mag_ptr, mag_index, msize);\n\t\tif (ptr) {\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\t\tif (cleared_requested) {\n\t\t\t\tmemset(ptr, 0, SMALL_BYTES_FOR_MSIZE(msize));\n\t\t\t}\n\t\t\treturn ptr;\n\t\t}\n\n\t\tif (small_get_region_from_depot(rack, small_mag_ptr, mag_index, msize)) {\n\t\t\tptr = small_malloc_from_free_list(rack, small_mag_ptr, mag_index, msize);\n\t\t\tif (ptr) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\t\t\tif (cleared_requested) {\n\t\t\t\t\tmemset(ptr, 0, SMALL_BYTES_FOR_MSIZE(msize));\n\t\t\t\t}\n\t\t\t\treturn ptr;\n\t\t\t}\n\t\t}\n\n\t\t// The magazine is exhausted. A new region (heap) must be allocated to satisfy this call to malloc().\n\t\t// The allocation, an mmap() system call, will be performed outside the magazine spin locks by the first\n\t\t// thread that suffers the exhaustion. That thread sets \"alloc_underway\" and enters a critical section.\n\t\t// Threads arriving here later are excluded from the critical section, yield the CPU, and then retry the\n\t\t// allocation. After some time the magazine is resupplied, the original thread leaves with its allocation,\n\t\t// and retry-ing threads succeed in the code just above.\n\t\tif (!small_mag_ptr->alloc_underway) {\n\t\t\tvoid *fresh_region;\n\n\t\t\t// time to create a new region (do this outside the magazine lock)\n\t\t\tsmall_mag_ptr->alloc_underway = TRUE;\n\t\t\tOSMemoryBarrier();\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\tfresh_region = mvm_allocate_pages_securely(SMALL_REGION_SIZE, SMALL_BLOCKS_ALIGN, VM_MEMORY_MALLOC_SMALL, rack->debug_flags);\n\t\t\tSZONE_MAGAZINE_PTR_LOCK(small_mag_ptr);\n\n\t\t\t// DTrace USDT Probe\n\t\t\tMAGMALLOC_ALLOCREGION(SMALL_SZONE_FROM_RACK(rack), (int)mag_index, fresh_region, SMALL_REGION_SIZE);\n\n\t\t\tif (!fresh_region) { // out of memory!\n\t\t\t\tsmall_mag_ptr->alloc_underway = FALSE;\n\t\t\t\tOSMemoryBarrier();\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\treturn NULL;\n\t\t\t}\n\n\t\t\tptr = small_malloc_from_region_no_lock(rack, small_mag_ptr, mag_index, msize, fresh_region);\n\n\t\t\t// we don't clear because this freshly allocated space is pristine\n\t\t\tsmall_mag_ptr->alloc_underway = FALSE;\n\t\t\tOSMemoryBarrier();\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\t\treturn ptr;\n\t\t} else {\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\tyield();\n\t\t\tSZONE_MAGAZINE_PTR_LOCK(small_mag_ptr);\n\t\t}\n\t}\n\t/* NOTREACHED */\n}\n\nsize_t\nsmall_size(rack_t *rack, const void *ptr)\n{\n\tif (small_region_for_ptr_no_lock(rack, ptr)) {\n\t\tif (SMALL_META_INDEX_FOR_PTR(ptr) >= NUM_SMALL_BLOCKS) {\n\t\t\treturn 0;\n\t\t}\n\t\tmsize_t msize_and_free = *SMALL_METADATA_FOR_PTR(ptr);\n\t\tif (msize_and_free & SMALL_IS_FREE) {\n\t\t\treturn 0;\n\t\t}\n#if CONFIG_SMALL_CACHE\n\t\t{\n\t\t\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr));\n\t\t\tif (DEPOT_MAGAZINE_INDEX != mag_index) {\n\t\t\t\tmagazine_t *small_mag_ptr = &(rack->magazines[mag_index]);\n\n\t\t\t\tif (ptr == small_mag_ptr->mag_last_free) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (mag_index = 0; mag_index < rack->num_magazines; mag_index++) {\n\t\t\t\t\tmagazine_t *small_mag_ptr = &(rack->magazines[mag_index]);\n\n\t\t\t\t\tif (ptr == small_mag_ptr->mag_last_free) {\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n#endif\n\t\treturn SMALL_BYTES_FOR_MSIZE(msize_and_free);\n\t}\n\n\treturn 0;\n}\n\nstatic MALLOC_NOINLINE void\nfree_small_botch(rack_t *rack, void *ptr)\n{\n\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr));\n\tmagazine_t *small_mag_ptr = &(rack->magazines[mag_index]);\n\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\tmalloc_zone_error(rack->debug_flags, true, \"double free for ptr %p\\n\", ptr);\n}\n\nvoid\nfree_small(rack_t *rack, void *ptr, region_t small_region, size_t known_size)\n{\n\tmsize_t msize;\n\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_SMALL_REGION(SMALL_REGION_FOR_PTR(ptr));\n\tmagazine_t *small_mag_ptr = &(rack->magazines[mag_index]);\n\n\t// ptr is known to be in small_region\n\tif (known_size) {\n\t\tmsize = SMALL_MSIZE_FOR_BYTES(known_size + SMALL_QUANTUM - 1);\n\t} else {\n\t\tmsize = SMALL_PTR_SIZE(ptr);\n\t\tif (SMALL_PTR_IS_FREE(ptr)) {\n\t\t\tfree_small_botch(rack, ptr);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tSZONE_MAGAZINE_PTR_LOCK(small_mag_ptr);\n\n#if CONFIG_SMALL_CACHE\n\t// Depot does not participate in CONFIG_SMALL_CACHE since it can't be directly malloc()'d\n\tif (DEPOT_MAGAZINE_INDEX != mag_index) {\n\t\tvoid *ptr2 = small_mag_ptr->mag_last_free; // Might be NULL\n\t\tmsize_t msize2 = small_mag_ptr->mag_last_free_msize;\n\t\tregion_t rgn2 = small_mag_ptr->mag_last_free_rgn;\n\n\t\t/* check that we don't already have this pointer in the cache */\n\t\tif (ptr == ptr2) {\n\t\t\tfree_small_botch(rack, ptr);\n\t\t\treturn;\n\t\t}\n\n\t\tif ((rack->debug_flags & MALLOC_DO_SCRIBBLE) && msize) {\n\t\t\tmemset(ptr, SCRABBLE_BYTE, SMALL_BYTES_FOR_MSIZE(msize));\n\t\t}\n\n\t\tsmall_mag_ptr->mag_last_free = ptr;\n\t\tsmall_mag_ptr->mag_last_free_msize = msize;\n\t\tsmall_mag_ptr->mag_last_free_rgn = small_region;\n\n\t\tif (!ptr2) {\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\t\treturn;\n\t\t}\n\n\t\tmsize = msize2;\n\t\tptr = ptr2;\n\t\tsmall_region = rgn2;\n\t}\n#endif /* CONFIG_SMALL_CACHE */\n\n\t// Now in the time it took to acquire the lock, the region may have migrated\n\t// from one magazine to another. I.e. trailer->mag_index is volatile.\n\t// In which case the magazine lock we obtained (namely magazines[mag_index].mag_lock)\n\t// is stale. If so, keep on tryin' ...\n\tregion_trailer_t *trailer = REGION_TRAILER_FOR_SMALL_REGION(small_region);\n\tmag_index_t refreshed_index;\n\n\twhile (mag_index != (refreshed_index = trailer->mag_index)) { // Note assignment\n\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\n\t\tmag_index = refreshed_index;\n\t\tsmall_mag_ptr = &(rack->magazines[mag_index]);\n\t\tSZONE_MAGAZINE_PTR_LOCK(small_mag_ptr);\n\t}\n\n\tif (small_free_no_lock(rack, small_mag_ptr, mag_index, small_region, ptr, msize)) {\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t}\n\n\tCHECK(szone, __PRETTY_FUNCTION__);\n}\n\nvoid\nprint_small_free_list(rack_t *rack)\n{\n\tfree_list_t ptr;\n\t_SIMPLE_STRING b = _simple_salloc();\n\tmag_index_t mag_index;\n\n\tif (b) {\n\t\t_simple_sappend(b, \"small free sizes:\\n\");\n\t\tfor (mag_index = -1; mag_index < rack->num_magazines; mag_index++) {\n\t\t\tgrain_t slot = 0;\n\t\t\t_simple_sprintf(b, \"\\tMagazine %d: \", mag_index);\n\t\t\twhile (slot < SMALL_FREE_SLOT_COUNT(rack)) {\n\t\t\t\tptr = rack->magazines[mag_index].mag_free_list[slot];\n\t\t\t\tif (small_free_list_get_ptr(rack, ptr)) {\n\t\t\t\t\t_simple_sprintf(b, \"%s%y[%d]; \", (slot == SMALL_FREE_SLOT_COUNT(rack) - 1) ? \">=\" : \"\", (slot + 1) * SMALL_QUANTUM,\n\t\t\t\t\t\t\t\t\tsmall_free_list_count(rack, ptr));\n\t\t\t\t}\n\t\t\t\tslot++;\n\t\t\t}\n\t\t\t_simple_sappend(b, \"\\n\");\n\t\t}\n\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%s\\n\", _simple_string(b));\n\t\t_simple_sfree(b);\n\t}\n}\n\nvoid\nprint_small_region(szone_t *szone, boolean_t verbose, region_t region, size_t bytes_at_start, size_t bytes_at_end)\n{\n\tunsigned counts[1024];\n\tunsigned in_use = 0;\n\tuintptr_t start = (uintptr_t)SMALL_REGION_ADDRESS(region);\n\tuintptr_t current = start + bytes_at_start;\n\tuintptr_t limit = (uintptr_t)SMALL_REGION_END(region) - bytes_at_end;\n\tmsize_t msize_and_free;\n\tmsize_t msize;\n\tunsigned ci;\n\t_SIMPLE_STRING b;\n\tuintptr_t pgTot = 0;\n\n\tif (region == HASHRING_REGION_DEALLOCATED) {\n\t\tif ((b = _simple_salloc()) != NULL) {\n\t\t\t_simple_sprintf(b, \"Small region [unknown address] was returned to the OS\\n\");\n\t\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%s\\n\", _simple_string(b));\n\t\t\t_simple_sfree(b);\n\t\t}\n\t\treturn;\n\t}\n\n\tmemset(counts, 0, sizeof(counts));\n\twhile (current < limit) {\n\t\tmsize_and_free = *SMALL_METADATA_FOR_PTR(current);\n\t\tmsize = msize_and_free & ~SMALL_IS_FREE;\n\t\tif (!msize) {\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** error with %p: msize=%d\\n\", (void *)current, (unsigned)msize);\n\t\t\tbreak;\n\t\t}\n\t\tif (!(msize_and_free & SMALL_IS_FREE)) {\n\t\t\t// block in use\n\t\t\tif (msize < 1024) {\n\t\t\t\tcounts[msize]++;\n\t\t\t}\n\t\t\tin_use++;\n\t\t} else {\n\t\t\tuintptr_t pgLo = round_page_quanta(current + sizeof(free_list_t) + sizeof(msize_t));\n\t\t\tuintptr_t pgHi = trunc_page_quanta(current + SMALL_BYTES_FOR_MSIZE(msize) - sizeof(msize_t));\n\n\t\t\tif (pgLo < pgHi) {\n\t\t\t\tpgTot += (pgHi - pgLo);\n\t\t\t}\n\t\t}\n\t\tcurrent += SMALL_BYTES_FOR_MSIZE(msize);\n\t}\n\tif ((b = _simple_salloc()) != NULL) {\n\t\t_simple_sprintf(b, \"Small region [%p-%p, %y] \\t\", (void *)start, SMALL_REGION_END(region), (int)SMALL_REGION_SIZE);\n\t\t_simple_sprintf(b, \"Magazine=%d \\t\", MAGAZINE_INDEX_FOR_SMALL_REGION(region));\n\t\t_simple_sprintf(b, \"Allocations in use=%d \\t Bytes in use=%ly \\t\", in_use, BYTES_USED_FOR_SMALL_REGION(region));\n\t\tif (bytes_at_end || bytes_at_start) {\n\t\t\t_simple_sprintf(b, \"Untouched=%ly \", bytes_at_end + bytes_at_start);\n\t\t}\n\t\tif (DEPOT_MAGAZINE_INDEX == MAGAZINE_INDEX_FOR_SMALL_REGION(region)) {\n\t\t\t_simple_sprintf(b, \"Advised MADV_FREE=%ly\", pgTot);\n\t\t} else {\n\t\t\t_simple_sprintf(b, \"Fragments subject to reclamation=%ly\", pgTot);\n\t\t}\n\t\tif (verbose && in_use) {\n\t\t\t_simple_sappend(b, \"\\n\\tSizes in use: \");\n\t\t\tfor (ci = 0; ci < 1024; ci++) {\n\t\t\t\tif (counts[ci]) {\n\t\t\t\t\t_simple_sprintf(b, \"%d[%d] \", SMALL_BYTES_FOR_MSIZE(ci), counts[ci]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%s\\n\", _simple_string(b));\n\t\t_simple_sfree(b);\n\t}\n}\n\nstatic char *small_freelist_fail_msg = \"check: small free list incorrect\";\n\n#define SMALL_FREELIST_FAIL(fmt, ...) \\\n\tmalloc_zone_check_fail(small_freelist_fail_msg, \\\n\t\t\t\" (slot=%u), counter=%d\\n\" fmt, slot, counter, __VA_ARGS__);\n\nboolean_t\nsmall_free_list_check(rack_t *rack, grain_t slot, unsigned counter)\n{\n\tmag_index_t mag_index;\n\n\tfor (mag_index = -1; mag_index < rack->num_magazines; mag_index++) {\n\t\tmagazine_t *small_mag_ptr = &(rack->magazines[mag_index]);\n\t\tSZONE_MAGAZINE_PTR_LOCK(small_mag_ptr);\n\n\t\tunsigned count = 0;\n\t\tfree_list_t current = rack->magazines[mag_index].mag_free_list[slot];\n\t\tfree_list_t previous = (free_list_t){ .p = NULL };\n\t\tmsize_t msize_and_free;\n\t\tvoid *ptr = NULL;\n\n\t\twhile ((ptr = small_free_list_get_ptr(rack, current))) {\n\t\t\tmsize_and_free = *SMALL_METADATA_FOR_PTR(ptr);\n\t\t\tif (!(msize_and_free & SMALL_IS_FREE)) {\n\t\t\t\tSMALL_FREELIST_FAIL(\"*** in-use ptr in free list slot=%u count=%d ptr=%p\\n\", slot, count, ptr);\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (((uintptr_t)ptr) & (SMALL_QUANTUM - 1)) {\n\t\t\t\tSMALL_FREELIST_FAIL(\"*** unaligned ptr in free list slot=%u count=%d ptr=%p\\n\", slot, count, ptr);\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (!small_region_for_ptr_no_lock(rack, ptr)) {\n\t\t\t\tSMALL_FREELIST_FAIL(\"*** ptr not in szone slot=%d count=%d ptr=%p\\n\", slot, count, ptr);\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (small_free_list_get_previous(rack, current).p != previous.p) {\n\t\t\t\tSMALL_FREELIST_FAIL(\"*** previous incorrectly set slot=%u count=%d ptr=%p\\n\", slot, count, ptr);\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tprevious = current;\n\t\t\tcurrent = small_free_list_get_next(rack, current);\n\t\t\tcount++;\n\t\t}\n\t\t\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(small_mag_ptr);\n\t}\n\treturn 1;\n}\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_tiny.c",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#include \"internal.h\"\n\n// The address and size of the block in mag_last_free are combined. These\n// macros abstract construction of the combined value and extraction of the\n// size and pointer.\n#define TINY_MAG_LAST_FREE_FROM_PTR_AND_MSIZE(ptr, msize) (void *)(((uintptr_t)(ptr))|((msize_t)msize))\n#define TINY_PTR_FROM_MAG_LAST_FREE(x) (void *)(((uintptr_t)(x)) & ~(TINY_QUANTUM - 1))\n#define TINY_MSIZE_FROM_MAG_LAST_FREE(x) (msize_t)(((uintptr_t)(x)) & (TINY_QUANTUM - 1))\n\n// Adjusts the pointer part of mag_last_free by a given amount in bytes. Must be\n// a multiple of the quantum size (not checked).\n#define TINY_MAG_LAST_FREE_PTR_ADJUST_PTR(x, size) (x) = ((void *)(x) + (size))\n\n// Decrements the size part of mag_last_free by a given msize value. Must not\n// reduce the msize part below zero (not checked).\n#define TINY_MAG_LAST_FREE_PTR_DEC_MSIZE(x, msize_delta) (x) = ((void *)(x) - (msize_delta))\n\nstatic MALLOC_INLINE MALLOC_ALWAYS_INLINE\nmag_index_t\ntiny_mag_get_thread_index(void)\n{\n#if CONFIG_TINY_USES_HYPER_SHIFT\n\tif (os_likely(_os_cpu_number_override == -1)) {\n\t\treturn _os_cpu_number() >> hyper_shift;\n\t} else {\n\t\treturn _os_cpu_number_override >> hyper_shift;\n\t}\n#else // CONFIG_SMALL_USES_HYPER_SHIFT\n\tif (os_likely(_os_cpu_number_override == -1)) {\n\t\treturn _os_cpu_number();\n\t} else {\n\t\treturn _os_cpu_number_override;\n\t}\n#endif // CONFIG_SMALL_USES_HYPER_SHIFT\n}\n\n/*\n * Get the size of the previous free block, which is stored in the last two\n * bytes of the block. If the previous block is not free, then the result is\n * undefined.\n */\nstatic msize_t\nget_tiny_previous_free_msize(const void *ptr)\n{\n\t// check whether the previous block is in the tiny region and a block header\n\t// if so, then the size of the previous block is one, and there is no stored\n\t// size.\n\tif (ptr != TINY_REGION_FOR_PTR(ptr)) {\n\t\tvoid *prev_block = (void *)((uintptr_t)ptr - TINY_QUANTUM);\n\t\tuint32_t *prev_header = TINY_BLOCK_HEADER_FOR_PTR(prev_block);\n\t\tmsize_t prev_index = TINY_INDEX_FOR_PTR(prev_block);\n\t\tif (BITARRAY_BIT(prev_header, prev_index)) {\n\t\t\treturn 1;\n\t\t}\n\t\treturn TINY_PREVIOUS_MSIZE(ptr);\n\t}\n\t// don't read possibly unmapped memory before the beginning of the region\n\treturn 0;\n}\n\nstatic MALLOC_INLINE void\nset_tiny_meta_header_in_use(const void *ptr, msize_t msize)\n{\n\tuint32_t *block_header = TINY_BLOCK_HEADER_FOR_PTR(ptr);\n\tmsize_t index = TINY_INDEX_FOR_PTR(ptr);\n\tmsize_t clr_msize = msize - 1;\n\tmsize_t midx = (index >> 5) << 1;\n\tuint32_t val = (1 << (index & 31));\n\n#if DEBUG_MALLOC\n\tif (msize >= NUM_TINY_SLOTS) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"set_tiny_meta_header_in_use() invariant broken %p %d\\n\", ptr, msize);\n\t}\n\tif ((unsigned)index + (unsigned)msize > 0x10000) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"set_tiny_meta_header_in_use() invariant broken (2) %p %d\\n\", ptr, msize);\n\t}\n#endif\n\n\tblock_header[midx] |= val;\t // BITARRAY_SET(block_header, index);\n\tblock_header[midx + 1] |= val; // BITARRAY_SET(in_use, index);\n\n\t// bitarray_mclr(block_header, index, end_bit);\n\t// bitarray_mclr(in_use, index, end_bit);\n\n\tindex++;\n\tmidx = (index >> 5) << 1;\n\n\tunsigned start = index & 31;\n\tunsigned end = start + clr_msize;\n\n#if defined(__LP64__)\n\tif (end > 63) {\n\t\tunsigned mask0 = (0xFFFFFFFFU >> (31 - start)) >> 1;\n\t\tunsigned mask1 = (0xFFFFFFFFU << (end - 64));\n\t\tblock_header[midx + 0] &= mask0; // clear header\n\t\tblock_header[midx + 1] &= mask0; // clear in_use\n\t\tblock_header[midx + 2] = 0;\t\t // clear header\n\t\tblock_header[midx + 3] = 0;\t\t // clear in_use\n\t\tblock_header[midx + 4] &= mask1; // clear header\n\t\tblock_header[midx + 5] &= mask1; // clear in_use\n\t} else\n#endif\n\t\tif (end > 31) {\n\t\t\tunsigned mask0 = (0xFFFFFFFFU >> (31 - start)) >> 1;\n\t\t\tunsigned mask1 = (0xFFFFFFFFU << (end - 32));\n\t\t\tblock_header[midx + 0] &= mask0;\n\t\t\tblock_header[midx + 1] &= mask0;\n\t\t\tblock_header[midx + 2] &= mask1;\n\t\t\tblock_header[midx + 3] &= mask1;\n\t\t} else {\n\t\t\tunsigned mask = (0xFFFFFFFFU >> (31 - start)) >> 1;\n\t\t\tmask |= (0xFFFFFFFFU << end);\n\t\t\tblock_header[midx + 0] &= mask;\n\t\t\tblock_header[midx + 1] &= mask;\n\t\t}\n\n\t// we set the block_header bit for the following block to reaffirm next block is a block\n\tindex += clr_msize;\n\tmidx = (index >> 5) << 1;\n\tval = (1 << (index & 31));\n\tblock_header[midx] |= val; // BITARRAY_SET(block_header, (index+clr_msize));\n#if DEBUG_MALLOC\n\t{\n\t\tboolean_t ff;\n\t\tmsize_t mf;\n\n\t\tmf = get_tiny_meta_header(ptr, &ff);\n\t\tif (msize != mf) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"setting header for tiny in_use %p : %d\\n\", ptr, msize);\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"reading header for tiny %p : %d %d\\n\", ptr, mf, ff);\n\t\t}\n\t}\n#endif\n}\n\nstatic MALLOC_INLINE void set_tiny_meta_header_in_use_1(const void *ptr) // As above with msize == 1\n{\n\tuint32_t *block_header = TINY_BLOCK_HEADER_FOR_PTR(ptr);\n\tmsize_t index = TINY_INDEX_FOR_PTR(ptr);\n\tmsize_t midx = (index >> 5) << 1;\n\tuint32_t val = (1 << (index & 31));\n\n\tblock_header[midx] |= val;\t // BITARRAY_SET(block_header, index);\n\tblock_header[midx + 1] |= val; // BITARRAY_SET(in_use, index);\n\n\tindex++;\n\tmidx = (index >> 5) << 1;\n\tval = (1 << (index & 31));\n\n\tblock_header[midx] |= val; // BITARRAY_SET(block_header, (index+clr_msize))\n}\n\nstatic MALLOC_INLINE void\nset_tiny_meta_header_middle(const void *ptr)\n{\n\t// indicates this block is in the middle of an in use block\n\tuint32_t *block_header;\n\tuint32_t *in_use;\n\tmsize_t index;\n\n\tblock_header = TINY_BLOCK_HEADER_FOR_PTR(ptr);\n\tin_use = TINY_INUSE_FOR_HEADER(block_header);\n\tindex = TINY_INDEX_FOR_PTR(ptr);\n\n\tBITARRAY_CLR(block_header, index);\n\tBITARRAY_CLR(in_use, index);\n}\n\nstatic MALLOC_INLINE void\nset_tiny_meta_header_free(const void *ptr, msize_t msize)\n{\n\t// !msize is acceptable and means 65536\n\tuint32_t *block_header = TINY_BLOCK_HEADER_FOR_PTR(ptr);\n\tmsize_t index = TINY_INDEX_FOR_PTR(ptr);\n\tmsize_t midx = (index >> 5) << 1;\n\tuint32_t val = (1 << (index & 31));\n\n#if DEBUG_MALLOC\n\tif ((unsigned)index + (unsigned)msize > 0x10000) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"setting header for tiny free %p msize too large: %d\\n\", ptr, msize);\n\t}\n#endif\n\n\tblock_header[midx] |= val;\t\t// BITARRAY_SET(block_header, index);\n\tblock_header[midx + 1] &= ~val; // BITARRAY_CLR(in_use, index);\n\n\t// mark the end of this block if msize is > 1. For msize == 0, the whole\n\t// region is free, so there is no following block. For msize == 1, there is\n\t// no space to write the size on 64 bit systems. The size for 1 quantum\n\t// blocks is computed from the metadata bitmaps.\n\tif (msize > 1) {\n\t\tvoid *follower = FOLLOWING_TINY_PTR(ptr, msize);\n\t\tTINY_PREVIOUS_MSIZE(follower) = msize;\n\t\tTINY_FREE_SIZE(ptr) = msize;\n\t}\n\tif (msize == 0) {\n\t\tTINY_FREE_SIZE(ptr) = msize;\n\t}\n#if DEBUG_MALLOC\n\tboolean_t ff;\n\tmsize_t mf = get_tiny_meta_header(ptr, &ff);\n\tif ((msize != mf) || !ff) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"setting header for tiny free %p : %u\\n\", ptr, msize);\n\t\tmalloc_report(ASL_LEVEL_INFO, \"reading header for tiny %p : %u %u\\n\", ptr, mf, ff);\n\t}\n#endif\n}\n\nstatic MALLOC_INLINE boolean_t\ntiny_meta_header_is_free(const void *ptr)\n{\n\tuint32_t *block_header;\n\tuint32_t *in_use;\n\tmsize_t index;\n\n\tblock_header = TINY_BLOCK_HEADER_FOR_PTR(ptr);\n\tin_use = TINY_INUSE_FOR_HEADER(block_header);\n\tindex = TINY_INDEX_FOR_PTR(ptr);\n\tif (!BITARRAY_BIT(block_header, index)) {\n\t\treturn 0;\n\t}\n\treturn !BITARRAY_BIT(in_use, index);\n}\n\nstatic MALLOC_INLINE void *\ntiny_previous_preceding_free(void *ptr, msize_t *prev_msize)\n{\n\t// returns the previous block, assuming and verifying it's free\n\tuint32_t *block_header;\n\tuint32_t *in_use;\n\tmsize_t index;\n\tmsize_t previous_msize;\n\tmsize_t previous_index;\n\tvoid *previous_ptr;\n\n\tblock_header = TINY_BLOCK_HEADER_FOR_PTR(ptr);\n\tin_use = TINY_INUSE_FOR_HEADER(block_header);\n\tindex = TINY_INDEX_FOR_PTR(ptr);\n\n\tif (!index) {\n\t\treturn NULL;\n\t}\n\tif ((previous_msize = get_tiny_previous_free_msize(ptr)) > index) {\n\t\treturn NULL;\n\t}\n\n\tprevious_index = index - previous_msize;\n\tprevious_ptr = (void *)((uintptr_t)TINY_REGION_FOR_PTR(ptr) + TINY_BYTES_FOR_MSIZE(previous_index));\n\tif (!BITARRAY_BIT(block_header, previous_index)) {\n\t\treturn NULL;\n\t}\n\tif (BITARRAY_BIT(in_use, previous_index)) {\n\t\treturn NULL;\n\t}\n\tif (get_tiny_free_size(previous_ptr) != previous_msize) {\n\t\treturn NULL;\n\t}\n\n\t// conservative check did match true check\n\t*prev_msize = previous_msize;\n\treturn previous_ptr;\n}\n\n/*\n * Adds an item to the proper free list, and also marks the meta-header of the\n * block properly.\n * Assumes szone has been locked\n */\nstatic void\ntiny_free_list_add_ptr(rack_t *rack, magazine_t *tiny_mag_ptr, void *ptr, msize_t msize)\n{\n\tgrain_t slot = (!msize || (msize >= NUM_TINY_SLOTS)) ? NUM_TINY_SLOTS - 1 : msize - 1;\n\ttiny_free_list_t *free_ptr = ptr;\n\ttiny_free_list_t *free_head = tiny_mag_ptr->mag_free_list[slot].p;\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in %s, ptr=%p, msize=%d\\n\", __FUNCTION__, ptr, msize);\n\t}\n\tif (((uintptr_t)ptr) & (TINY_QUANTUM - 1)) {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"tiny_free_list_add_ptr: Unaligned ptr: %p\\n\", ptr);\n\t}\n#endif\n\tset_tiny_meta_header_free(ptr, msize);\n\tif (free_head) {\n#if DEBUG_MALLOC\n\t\tif (free_list_unchecksum_ptr(szone, &free_head->previous)) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\t\"tiny_free_list_add_ptr: Internal invariant broken (free_head->previous): \"\n\t\t\t\t\t\"ptr=%p slot=%d free_head=%p previous=%p\\n\", ptr, slot, (void *)free_head, free_head->previous.p);\n\t\t}\n\t\tif (!tiny_meta_header_is_free(free_head)) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\t\"tiny_free_list_add_ptr: Internal invariant broken (free_head is not a free pointer): \"\n\t\t\t\t\t\"ptr=%p slot=%d free_head=%p\\n\", ptr, slot, (void *)free_head);\n\t\t}\n#endif\n\t\tfree_head->previous.u = free_list_checksum_ptr(rack, free_ptr);\n\t} else {\n\t\tBITMAPV_SET(tiny_mag_ptr->mag_bitmap, slot);\n\t}\n\tfree_ptr->previous.u = free_list_checksum_ptr(rack, NULL);\n\tfree_ptr->next.u = free_list_checksum_ptr(rack, free_head);\n\n\ttiny_mag_ptr->mag_free_list[slot].p = free_ptr;\n}\n\n/*\n * Removes the item pointed to by ptr in the proper free list.\n * Assumes szone has been locked\n */\nstatic void\ntiny_free_list_remove_ptr(rack_t *rack, magazine_t *tiny_mag_ptr, void *ptr, msize_t msize)\n{\n\tgrain_t slot = (!msize || (msize >= NUM_TINY_SLOTS)) ? NUM_TINY_SLOTS - 1 : msize - 1;\n\ttiny_free_list_t *free_ptr = ptr, *next, *previous;\n\n\tnext = free_list_unchecksum_ptr(rack, &free_ptr->next);\n\tprevious = free_list_unchecksum_ptr(rack, &free_ptr->previous);\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"In %s, ptr=%p, msize=%d\\n\", __FUNCTION__, ptr, msize);\n\t}\n#endif\n\tif (!previous) {\n\t\t// The block to remove is the head of the free list\n#if DEBUG_MALLOC\n\t\tif (tiny_mag_ptr->mag_free_list[slot] != ptr) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\t\"tiny_free_list_remove_ptr: Internal invariant broken (tiny_mag_ptr->mag_free_list[slot]): \"\n\t\t\t\t\t\"ptr=%p slot=%d msize=%d tiny_mag_ptr->mag_free_list[slot]=%p\\n\", ptr, slot, msize,\n\t\t\t\t\t(void *)tiny_mag_ptr->mag_free_list[slot]);\n\t\t\treturn;\n\t\t}\n#endif\n\t\ttiny_mag_ptr->mag_free_list[slot].p = next;\n\t\tif (!next) {\n\t\t\tBITMAPV_CLR(tiny_mag_ptr->mag_bitmap, slot);\n\t\t}\n\t} else {\n\t\t// Check that the next pointer of \"previous\" points to free_ptr.\n\t\ttiny_free_list_t *prev_next = free_list_unchecksum_ptr(rack, &previous->next);\n\t\tif (prev_next != free_ptr) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\t\"tiny_free_list_remove_ptr: Internal invariant broken (next ptr of prev): \"\n\t\t\t\t\t\"ptr=%p, prev_next=%p\\n\", ptr, prev_next);\n\t\t\t__builtin_unreachable(); // Always crashes in malloc_zone_error().\n\t\t}\n\n\t\t// We know free_ptr is already checksummed, so we don't need to do it\n\t\t// again.\n\t\tprevious->next = free_ptr->next;\n\t}\n\tif (next) {\n\t\t// Check that the previous pointer of \"next\" points to free_ptr.\n\t\ttiny_free_list_t *next_prev = free_list_unchecksum_ptr(rack, &next->previous);\n\t\tif (next_prev != free_ptr) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\t\"tiny_free_list_remove_ptr: Internal invariant broken (prev ptr of next): \"\n\t\t\t\t\t\"ptr=%p, next_prev=%p\\n\", ptr, next_prev);\n\t\t\t__builtin_unreachable(); // Always crashes in malloc_zone_error().\n\t\t}\n\n\t\t// We know free_ptr is already checksummed, so we don't need to do it\n\t\t// again.\n\t\tnext->previous = free_ptr->previous;\n\t}\n}\n\nvoid\ntiny_finalize_region(rack_t *rack, magazine_t *tiny_mag_ptr)\n{\n\tvoid *last_block, *previous_block;\n\tuint32_t *last_header;\n\tmsize_t last_msize, previous_msize, last_index;\n\n\t// It is possible that the block prior to the last block in the region has\n\t// been free'd, but was not coalesced with the free bytes at the end of the\n\t// block, since we treat the bytes at the end of the region as \"in use\" in\n\t// the meta headers. Attempt to coalesce the last block with the previous\n\t// block, so we don't violate the \"no consecutive free blocks\" invariant.\n\t//\n\t// FIXME: Need to investigate how much work would be required to increase\n\t// 'mag_bytes_free_at_end' when freeing the preceding block, rather\n\t// than performing this workaround.\n\t//\n\n\tif (tiny_mag_ptr->mag_bytes_free_at_end) {\n\t\tlast_block = (void *)((uintptr_t)TINY_REGION_END(tiny_mag_ptr->mag_last_region) - tiny_mag_ptr->mag_bytes_free_at_end);\n\t\tlast_msize = TINY_MSIZE_FOR_BYTES(tiny_mag_ptr->mag_bytes_free_at_end);\n\t\tlast_header = TINY_BLOCK_HEADER_FOR_PTR(last_block);\n\t\tlast_index = TINY_INDEX_FOR_PTR(last_block);\n\n\t\t// Before anything we transform any remaining mag_bytes_free_at_end into a\n\t\t// regular free block. We take special care here to update the bitfield\n\t\t// information, since we are bypassing the normal free codepath. If there\n\t\t// is more than one quanta worth of memory in mag_bytes_free_at_end, then\n\t\t// there will be two block headers:\n\t\t// 1) header for the free space at end, msize = 1\n\t\t// 2) header inserted by set_tiny_meta_header_in_use after block\n\t\t// We must clear the second one so that when the free block's size is\n\t\t// queried, we do not think the block is only 1 quantum in size because\n\t\t// of the second set header bit.\n\t\tif (last_index != (NUM_TINY_BLOCKS - 1)) {\n\t\t\tBITARRAY_CLR(last_header, (last_index + 1));\n\t\t}\n\n\t\tprevious_block = tiny_previous_preceding_free(last_block, &previous_msize);\n\t\tif (previous_block) {\n\t\t\tset_tiny_meta_header_middle(last_block);\n\t\t\ttiny_free_list_remove_ptr(rack, tiny_mag_ptr, previous_block, previous_msize);\n\t\t\tlast_block = previous_block;\n\t\t\tlast_msize += previous_msize;\n\t\t}\n\n\t\t// splice last_block into the free list\n\t\ttiny_free_list_add_ptr(rack, tiny_mag_ptr, last_block, last_msize);\n\t\ttiny_mag_ptr->mag_bytes_free_at_end = 0;\n\t}\n\n#if CONFIG_ASLR_INTERNAL\n\t// Coalesce the big free block at start with any following free blocks\n\tif (tiny_mag_ptr->mag_bytes_free_at_start) {\n\t\tlast_block = TINY_REGION_ADDRESS(tiny_mag_ptr->mag_last_region);\n\t\tlast_msize = TINY_MSIZE_FOR_BYTES(tiny_mag_ptr->mag_bytes_free_at_start);\n\n\t\tvoid *next_block = (void *)((uintptr_t)last_block + tiny_mag_ptr->mag_bytes_free_at_start);\n\n\t\t// clear the in use bit we were using to mark the end of the big start block\n\t\tset_tiny_meta_header_middle((void *)((uintptr_t)next_block - TINY_QUANTUM));\n\n\t\t// Coalesce the big start block with any following free blocks\n\t\tif (tiny_meta_header_is_free(next_block)) {\n\t\t\tmsize_t next_msize = get_tiny_free_size(next_block);\n\t\t\tset_tiny_meta_header_middle(next_block);\n\t\t\ttiny_free_list_remove_ptr(rack, tiny_mag_ptr, next_block, next_msize);\n\t\t\tlast_msize += next_msize;\n\t\t}\n\n\t\t// splice last_block into the free list\n\t\ttiny_free_list_add_ptr(rack, tiny_mag_ptr, last_block, last_msize);\n\t\ttiny_mag_ptr->mag_bytes_free_at_start = 0;\n\t}\n#endif\n\n\ttiny_mag_ptr->mag_last_region = NULL;\n}\n\nint\ntiny_free_detach_region(rack_t *rack, magazine_t *tiny_mag_ptr, region_t r)\n{\n\tuintptr_t start = (uintptr_t)TINY_REGION_ADDRESS(r);\n\tuintptr_t current = start;\n\tuintptr_t limit = (uintptr_t)TINY_REGION_END(r);\n\tboolean_t is_free;\n\tmsize_t msize;\n\tint total_alloc = 0;\n\n\twhile (current < limit) {\n\t\tmsize = get_tiny_meta_header((void *)current, &is_free);\n\t\tif (is_free && !msize && (current == start)) {\n\t\t\t// first block is all free\n\t\t\tbreak;\n\t\t}\n\t\tif (!msize) {\n#if DEBUG_MALLOC\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** tiny_free_detach_region error with %p: msize=%d is_free=%d\\n\", (void *)current, msize, is_free);\n#endif\n\t\t\tbreak;\n\t\t}\n\t\tif (is_free) {\n\t\t\ttiny_free_list_remove_ptr(rack, tiny_mag_ptr, (void *)current, msize);\n\t\t} else {\n\t\t\ttotal_alloc++;\n\t\t}\n\t\tcurrent += TINY_BYTES_FOR_MSIZE(msize);\n\t}\n\treturn total_alloc;\n}\n\nsize_t\ntiny_free_reattach_region(rack_t *rack, magazine_t *tiny_mag_ptr, region_t r)\n{\n\tuintptr_t start = (uintptr_t)TINY_REGION_ADDRESS(r);\n\tuintptr_t current = start;\n\tuintptr_t limit = (uintptr_t)TINY_REGION_END(r);\n\tboolean_t is_free;\n\tmsize_t msize;\n\tsize_t total_alloc = 0;\n\n\twhile (current < limit) {\n\t\tmsize = get_tiny_meta_header((void *)current, &is_free);\n\t\tif (is_free && !msize && (current == start)) {\n\t\t\t// first block is all free\n\t\t\tbreak;\n\t\t}\n\t\tif (!msize) {\n#if DEBUG_MALLOC\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** tiny_free_reattach_region error with %p: msize=%d is_free=%d\\n\", (void *)current, msize, is_free);\n#endif\n\t\t\tbreak;\n\t\t}\n\t\tif (is_free) {\n\t\t\ttiny_free_list_add_ptr(rack, tiny_mag_ptr, (void *)current, msize);\n\t\t} else {\n\t\t\ttotal_alloc += TINY_BYTES_FOR_MSIZE(msize);\n\t\t}\n\t\tcurrent += TINY_BYTES_FOR_MSIZE(msize);\n\t}\n\treturn total_alloc;\n}\n\ntypedef struct {\n\tuint8_t pnum, size;\n} tiny_pg_pair_t;\n\nvoid\ntiny_free_scan_madvise_free(rack_t *rack, magazine_t *depot_ptr, region_t r)\n{\n\tuintptr_t start = (uintptr_t)TINY_REGION_ADDRESS(r);\n\tuintptr_t current = start;\n\tuintptr_t limit = (uintptr_t)TINY_REGION_END(r);\n\tboolean_t is_free;\n\tmsize_t msize;\n\ttiny_pg_pair_t advisory[((TINY_REGION_PAYLOAD_BYTES + vm_page_quanta_size - 1) >> vm_page_quanta_shift) >>\n\t\t\t\t\t\t\t1]; // 256bytes stack allocated\n\tint advisories = 0;\n\n\t// Scan the metadata identifying blocks which span one or more pages. Mark the pages MADV_FREE taking care to preserve free list\n\t// management data.\n\twhile (current < limit) {\n\t\tmsize = get_tiny_meta_header((void *)current, &is_free);\n\t\tif (is_free && !msize && (current == start)) {\n\t\t\t// first block is all free\n#if DEBUG_MALLOC\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"*** tiny_free_scan_madvise_free first block is all free! %p: msize=%d is_free=%d\\n\", (void *)current,\n\t\t\t\t\t\t msize, is_free);\n#endif\n\t\t\tuintptr_t pgLo = round_page_kernel(start + sizeof(tiny_free_list_t) + sizeof(msize_t));\n\t\t\tuintptr_t pgHi = trunc_page_kernel(start + TINY_REGION_SIZE - sizeof(msize_t));\n\n\t\t\tif (pgLo < pgHi) {\n\t\t\t\tadvisory[advisories].pnum = (pgLo - start) >> vm_kernel_page_shift;\n\t\t\t\tadvisory[advisories].size = (pgHi - pgLo) >> vm_kernel_page_shift;\n\t\t\t\tadvisories++;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tif (!msize) {\n#if DEBUG_MALLOC\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** tiny_free_scan_madvise_free error with %p: msize=%d is_free=%d\\n\", (void *)current, msize, is_free);\n#endif\n\t\t\tbreak;\n\t\t}\n\t\tif (is_free) {\n\t\t\tuintptr_t pgLo = round_page_kernel(current + sizeof(tiny_free_list_t) + sizeof(msize_t));\n\t\t\tuintptr_t pgHi = trunc_page_kernel(current + TINY_BYTES_FOR_MSIZE(msize) - sizeof(msize_t));\n\n\t\t\tif (pgLo < pgHi) {\n\t\t\t\tadvisory[advisories].pnum = (pgLo - start) >> vm_kernel_page_shift;\n\t\t\t\tadvisory[advisories].size = (pgHi - pgLo) >> vm_kernel_page_shift;\n\t\t\t\tadvisories++;\n\t\t\t}\n\t\t}\n\t\tcurrent += TINY_BYTES_FOR_MSIZE(msize);\n\t}\n\n\tif (advisories > 0) {\n\t\tint i;\n\n\t\t// So long as the following hold for this region:\n\t\t// (1) No malloc()'s are ever performed from the depot (hence free pages remain free,)\n\t\t// (2) The region is not handed over to a per-CPU magazine (where malloc()'s could be performed),\n\t\t// (3) The entire region is not mumap()'d (so the madvise's are applied to the intended addresses),\n\t\t// then the madvise opportunities collected just above can be applied outside all locks.\n\t\t// (1) is ensured by design, (2) and (3) are ensured by bumping the globally visible counter node->pinned_to_depot.\n\n\t\tOSAtomicIncrement32Barrier(&(REGION_TRAILER_FOR_TINY_REGION(r)->pinned_to_depot));\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\t\tfor (i = 0; i < advisories; ++i) {\n\t\t\tuintptr_t addr = (advisory[i].pnum << vm_kernel_page_shift) + start;\n\t\t\tsize_t size = advisory[i].size << vm_kernel_page_shift;\n\n\t\t\tmvm_madvise_free(rack, r, addr, addr + size, NULL, rack->debug_flags & MALLOC_DO_SCRIBBLE);\n\t\t}\n\t\tSZONE_MAGAZINE_PTR_LOCK(depot_ptr);\n\t\tOSAtomicDecrement32Barrier(&(REGION_TRAILER_FOR_TINY_REGION(r)->pinned_to_depot));\n\t}\n}\n\nstatic region_t\ntiny_find_msize_region(rack_t *rack, magazine_t *tiny_mag_ptr, mag_index_t mag_index, msize_t msize)\n{\n\ttiny_free_list_t *ptr;\n\tgrain_t slot = msize - 1;\n\tfree_list_t *free_list = tiny_mag_ptr->mag_free_list;\n\tfree_list_t *the_slot = free_list + slot;\n\tfree_list_t *limit;\n#if defined(__LP64__)\n\tuint64_t bitmap;\n#else\n\tuint32_t bitmap;\n#endif\n\t// Assumes we've locked the magazine\n\tCHECK_MAGAZINE_PTR_LOCKED(szone, tiny_mag_ptr, __PRETTY_FUNCTION__);\n\n\t// Look for an exact match by checking the freelist for this msize.\n\tptr = the_slot->p;\n\tif (ptr) {\n\t\treturn TINY_REGION_FOR_PTR(ptr);\n\t}\n\n\t// Mask off the bits representing slots holding free blocks smaller than the\n\t// size we need. If there are no larger free blocks, try allocating from\n\t// the free space at the end of the tiny region.\n#if defined(__LP64__)\n\tbitmap = ((uint64_t *)(tiny_mag_ptr->mag_bitmap))[0] & ~((1ULL << slot) - 1);\n#else\n\tbitmap = tiny_mag_ptr->mag_bitmap[0] & ~((1 << slot) - 1);\n#endif\n\tif (!bitmap) {\n\t\treturn NULL;\n\t}\n\n\tslot = BITMAPV_CTZ(bitmap);\n\tlimit = free_list + NUM_TINY_SLOTS - 1;\n\tfree_list += slot;\n\n\tif (free_list < limit) {\n\t\tptr = free_list->p;\n\t\tif (ptr) {\n\t\t\treturn TINY_REGION_FOR_PTR(ptr);\n\t\t} else {\n\t\t\t/* Shouldn't happen. Fall through to look at last slot. */\n#if DEBUG_MALLOC\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"in tiny_find_msize_region(), mag_bitmap out of sync, slot=%d\\n\", slot);\n#endif\n\t\t}\n\t}\n\n\t// We are now looking at the last slot, which contains blocks equal to, or\n\t// due to coalescing of free blocks, larger than (NUM_TINY_SLOTS - 1) * tiny quantum size.\n\tptr = limit->p;\n\tif (ptr) {\n\t\treturn TINY_REGION_FOR_PTR(ptr);\n\t}\n\n\treturn NULL;\n}\n\nstatic MALLOC_INLINE void\ntiny_madvise_free_range_no_lock(rack_t *rack,\n\t\t\t\t\t\t\t\tmagazine_t *tiny_mag_ptr,\n\t\t\t\t\t\t\t\tregion_t region,\n\t\t\t\t\t\t\t\tvoid *headptr,\n\t\t\t\t\t\t\t\tsize_t headsize,\n\t\t\t\t\t\t\t\tvoid *ptr,\n\t\t\t\t\t\t\t\tmsize_t msize)\n{\n\tregion_trailer_t *node = REGION_TRAILER_FOR_TINY_REGION(region);\n\n\t// Lock on tiny_magazines[mag_index] is already held here\n\t// Calculate the first page in the coalesced block that would be safe to mark MADV_FREE\n\tsize_t free_header_size = sizeof(tiny_free_list_t) + sizeof(msize_t);\n\tuintptr_t safe_ptr = (uintptr_t)ptr + free_header_size;\n\tuintptr_t round_safe = round_page_kernel(safe_ptr);\n\n\t// Calculate the last page in the coalesced block that would be safe to mark MADV_FREE\n\tsize_t free_tail_size = sizeof(msize_t);\n\tuintptr_t safe_extent = (uintptr_t)ptr + TINY_BYTES_FOR_MSIZE(msize) - free_tail_size;\n\tuintptr_t trunc_extent = trunc_page_kernel(safe_extent);\n\n\t// The newly freed block may complete a span of bytes that cover a page. Mark it with MADV_FREE.\n\tif (round_safe < trunc_extent) { // Coalesced area covers a page (perhaps many)\n\t\t// Extend the freed block by the free region header and tail sizes to include pages\n\t\t// we may have coalesced that no longer host free region tails and headers.\n\t\t// This may extend over in-use ranges, but the MIN/MAX clamping below will fix that up.\n\t\tuintptr_t lo = trunc_page_kernel((uintptr_t)headptr - free_tail_size);\n\t\tuintptr_t hi = round_page_kernel((uintptr_t)headptr + headsize + free_header_size);\n\n\t\tuintptr_t free_lo = MAX(round_safe, lo);\n\t\tuintptr_t free_hi = MIN(trunc_extent, hi);\n\n\t\tif (free_lo < free_hi) {\n\t\t\ttiny_free_list_remove_ptr(rack, tiny_mag_ptr, ptr, msize);\n\t\t\tset_tiny_meta_header_in_use(ptr, msize);\n\n\t\t\tOSAtomicIncrement32Barrier(&(node->pinned_to_depot));\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\tmvm_madvise_free(rack, region, free_lo, free_hi, &rack->last_madvise, rack->debug_flags & MALLOC_DO_SCRIBBLE);\n\t\t\tSZONE_MAGAZINE_PTR_LOCK(tiny_mag_ptr);\n\t\t\tOSAtomicDecrement32Barrier(&(node->pinned_to_depot));\n\n\t\t\tset_tiny_meta_header_free(ptr, msize);\n\t\t\ttiny_free_list_add_ptr(rack, tiny_mag_ptr, ptr, msize);\n\t\t}\n\t}\n}\n\nstatic boolean_t\ntiny_get_region_from_depot(rack_t *rack, magazine_t *tiny_mag_ptr, mag_index_t mag_index, msize_t msize)\n{\n\tmagazine_t *depot_ptr = &(rack->magazines[DEPOT_MAGAZINE_INDEX]);\n\n\t/* FIXME: Would Uniprocessor benefit from recirc and MADV_FREE? */\n\tif (rack->num_magazines == 1) { // Uniprocessor, single magazine, so no recirculation necessary\n\t\treturn 0;\n\t}\n\n#if DEBUG_MALLOC\n\tif (DEPOT_MAGAZINE_INDEX == mag_index) {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"tiny_get_region_from_depot called for magazine index -1\\n\");\n\t\treturn 0;\n\t}\n#endif\n\n\tSZONE_MAGAZINE_PTR_LOCK(depot_ptr);\n\n\t// Appropriate a Depot'd region that can satisfy requested msize.\n\tregion_trailer_t *node;\n\tregion_t sparse_region;\n\n\twhile (1) {\n\t\tsparse_region = tiny_find_msize_region(rack, depot_ptr, DEPOT_MAGAZINE_INDEX, msize);\n\t\tif (NULL == sparse_region) { // Depot empty?\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\t\t\treturn 0;\n\t\t}\n\n\t\tnode = REGION_TRAILER_FOR_TINY_REGION(sparse_region);\n\t\tif (0 >= node->pinned_to_depot) {\n\t\t\tbreak;\n\t\t}\n\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\t\tyield();\n\t\tSZONE_MAGAZINE_PTR_LOCK(depot_ptr);\n\t}\n\n\t// disconnect node from Depot\n\trecirc_list_extract(rack, depot_ptr, node);\n\n\t// Iterate the region pulling its free entries off the (locked) Depot's free list\n\tint objects_in_use = tiny_free_detach_region(rack, depot_ptr, sparse_region);\n\n\t// Transfer ownership of the region\n\tMAGAZINE_INDEX_FOR_TINY_REGION(sparse_region) = mag_index;\n\tnode->pinned_to_depot = 0;\n\n\t// Iterate the region putting its free entries on its new (locked) magazine's free list\n\tsize_t bytes_inplay = tiny_free_reattach_region(rack, tiny_mag_ptr, sparse_region);\n\n\tdepot_ptr->mag_num_bytes_in_objects -= bytes_inplay;\n\tdepot_ptr->num_bytes_in_magazine -= TINY_REGION_PAYLOAD_BYTES;\n\tdepot_ptr->mag_num_objects -= objects_in_use;\n\n\ttiny_mag_ptr->mag_num_bytes_in_objects += bytes_inplay;\n\ttiny_mag_ptr->num_bytes_in_magazine += TINY_REGION_PAYLOAD_BYTES;\n\ttiny_mag_ptr->mag_num_objects += objects_in_use;\n\n\t// connect to magazine as first node\n\trecirc_list_splice_first(rack, tiny_mag_ptr, node);\n\n\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\n\t// DTrace USDT Probe\n\tMAGMALLOC_DEPOTREGION(TINY_SZONE_FROM_RACK(rack), (int)mag_index, (void *)sparse_region,\n\t\t\tTINY_REGION_SIZE, (int)BYTES_USED_FOR_TINY_REGION(sparse_region));\n\n\treturn 1;\n}\n\n#if CONFIG_RECIRC_DEPOT\nstatic region_t\ntiny_free_try_depot_unmap_no_lock(rack_t *rack, magazine_t *depot_ptr, region_trailer_t *node)\n{\n\tif (0 < node->bytes_used || 0 < node->pinned_to_depot ||\n\t\tdepot_ptr->recirculation_entries < recirc_retained_regions)\n\t{\n\t\treturn NULL;\n\t}\n\n\t// disconnect node from Depot\n\trecirc_list_extract(rack, depot_ptr, node);\n\n\t// Iterate the region pulling its free entries off the (locked) Depot's free list\n\tregion_t sparse_region = TINY_REGION_FOR_PTR(node);\n\tint objects_in_use = tiny_free_detach_region(rack, depot_ptr, sparse_region);\n\n\tif (0 == objects_in_use) {\n\t\t// Invalidate the hash table entry for this region with HASHRING_REGION_DEALLOCATED.\n\t\t// Using HASHRING_REGION_DEALLOCATED preserves the collision chain, using HASHRING_OPEN_ENTRY (0) would not.\n\t\trgnhdl_t pSlot = hash_lookup_region_no_lock(rack->region_generation->hashed_regions,\n\t\t\t\track->region_generation->num_regions_allocated,\n\t\t\t\track->region_generation->num_regions_allocated_shift,\n\t\t\t\tsparse_region);\n\n\t\tif (NULL == pSlot) {\n\t\t\tmalloc_zone_error(rack->debug_flags, true, \"tiny_free_try_depot_unmap_no_lock hash lookup failed: %p\\n\", sparse_region);\n\t\t\treturn NULL;\n\t\t}\n\t\t*pSlot = HASHRING_REGION_DEALLOCATED;\n\t\tdepot_ptr->num_bytes_in_magazine -= TINY_REGION_PAYLOAD_BYTES;\n\n\t\t// Atomically increment num_regions_dealloc\n#ifdef __LP64___\n\t\tOSAtomicIncrement64(&rack->num_regions_dealloc);\n#else\n\t\tOSAtomicIncrement32((int32_t *)&rack->num_regions_dealloc);\n#endif\n\n\t\t// Caller will transfer ownership of the region back to the OS with no locks held\n\t\tMAGMALLOC_DEALLOCREGION(TINY_SZONE_FROM_RACK(rack), (void *)sparse_region, TINY_REGION_SIZE); // DTrace USDT Probe\n\t\treturn sparse_region;\n\t} else {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"tiny_free_try_depot_unmap_no_lock objects_in_use not zero: %d\\n\", objects_in_use);\n\t\treturn NULL;\n\t}\n}\n\nstatic boolean_t\ntiny_free_do_recirc_to_depot(rack_t *rack, magazine_t *tiny_mag_ptr, mag_index_t mag_index)\n{\n\t// The entire magazine crossed the \"emptiness threshold\". Transfer a region\n\t// from this magazine to the Depot. Choose a region that itself has crossed the emptiness threshold (i.e\n\t// is at least fraction \"f\" empty.) Such a region will be marked \"suitable\" on the recirculation list.\n\tregion_trailer_t *node = tiny_mag_ptr->firstNode;\n\n\twhile (node && (!node->recirc_suitable || node->pinned_to_depot)) {\n\t\t// If we skip a node due to pinned_to_depot being non-zero, it must be\n\t\t// because another thread is madvising the same region in\n\t\t// tiny_madvise_free_range_no_lock(), called from tiny_free_no_lock().\n\t\t// When that's done, the same thread will enter tiny_free_try_recirc_to_depot()\n\t\t// for the same region, which will come back here. So this just defers\n\t\t// recirculation of the region.\n\t\tnode = node->next;\n\t}\n\n\tif (NULL == node) {\n#if DEBUG_MALLOC\n\t\tmalloc_report(ASL_LEVEL_INFO, \"*** tiny_free_do_recirc_to_depot end of list\\n\");\n#endif\n\t\treturn TRUE; // Caller must SZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t}\n\n\tregion_t sparse_region = TINY_REGION_FOR_PTR(node);\n\n\t// Deal with unclaimed memory -- mag_bytes_free_at_end or mag_bytes_free_at_start\n\tif (sparse_region == tiny_mag_ptr->mag_last_region &&\n\t\t(tiny_mag_ptr->mag_bytes_free_at_end || tiny_mag_ptr->mag_bytes_free_at_start)) {\n\t\ttiny_finalize_region(rack, tiny_mag_ptr);\n\t}\n\n\t// disconnect \"suitable\" node from magazine\n\trecirc_list_extract(rack, tiny_mag_ptr, node);\n\n\t// Iterate the region pulling its free entries off its (locked) magazine's free list\n\tint objects_in_use = tiny_free_detach_region(rack, tiny_mag_ptr, sparse_region);\n\tmagazine_t *depot_ptr = &(rack->magazines[DEPOT_MAGAZINE_INDEX]);\n\n\t// hand over the region to the (locked) Depot\n\tSZONE_MAGAZINE_PTR_LOCK(depot_ptr);\n\t// this will cause tiny_free_list_add_ptr called by tiny_free_reattach_region to use\n\t// the depot as its target magazine, rather than magazine formerly associated with sparse_region\n\tMAGAZINE_INDEX_FOR_TINY_REGION(sparse_region) = DEPOT_MAGAZINE_INDEX;\n\tnode->pinned_to_depot = 0;\n\n\t// Iterate the region putting its free entries on Depot's free list\n\tsize_t bytes_inplay = tiny_free_reattach_region(rack, depot_ptr, sparse_region);\n\n\ttiny_mag_ptr->mag_num_bytes_in_objects -= bytes_inplay;\n\ttiny_mag_ptr->num_bytes_in_magazine -= TINY_REGION_PAYLOAD_BYTES;\n\ttiny_mag_ptr->mag_num_objects -= objects_in_use;\n\n\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr); // Unlock the originating magazine\n\n\tdepot_ptr->mag_num_bytes_in_objects += bytes_inplay;\n\tdepot_ptr->num_bytes_in_magazine += TINY_REGION_PAYLOAD_BYTES;\n\tdepot_ptr->mag_num_objects += objects_in_use;\n\n\t// connect to Depot as last node\n\trecirc_list_splice_last(rack, depot_ptr, node);\n\n\tMAGMALLOC_RECIRCREGION(TINY_SZONE_FROM_RACK(rack), (int)mag_index, (void *)sparse_region, TINY_REGION_SIZE,\n\t\t\t\t\t\t (int)BYTES_USED_FOR_TINY_REGION(sparse_region)); // DTrace USDT Probe\n\n#if !CONFIG_AGGRESSIVE_MADVISE\n\t// Mark free'd dirty pages with MADV_FREE to reduce memory pressure\n\ttiny_free_scan_madvise_free(rack, depot_ptr, sparse_region);\n#endif\n\n\t// If the region is entirely empty vm_deallocate() it outside the depot lock\n\tregion_t r_dealloc = tiny_free_try_depot_unmap_no_lock(rack, depot_ptr, node);\n\tSZONE_MAGAZINE_PTR_UNLOCK(depot_ptr);\n\tif (r_dealloc) {\n\t\tmvm_deallocate_pages(r_dealloc, TINY_REGION_SIZE, 0);\n\t}\n\treturn FALSE; // Caller need not unlock the originating magazine\n}\n\nstatic MALLOC_INLINE boolean_t\ntiny_free_try_recirc_to_depot(rack_t *rack,\n\t\t\t\t\t\t\t magazine_t *tiny_mag_ptr,\n\t\t\t\t\t\t\t mag_index_t mag_index,\n\t\t\t\t\t\t\t region_t region,\n\t\t\t\t\t\t\t void *headptr,\n\t\t\t\t\t\t\t size_t headsize,\n\t\t\t\t\t\t\t void *ptr,\n\t\t\t\t\t\t\t msize_t msize)\n{\n\tregion_trailer_t *node = REGION_TRAILER_FOR_TINY_REGION(region);\n\tsize_t bytes_used = node->bytes_used;\n\n\t/* FIXME: Would Uniprocessor benefit from recirc and MADV_FREE? */\n\tif (rack->num_magazines == 1) { // Uniprocessor, single magazine, so no recirculation necessary\n\t\t/* NOTHING */\n\t\treturn TRUE; // Caller must do SZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr)\n\t} else if (DEPOT_MAGAZINE_INDEX != mag_index) {\n\t\t// Emptiness discriminant\n\t\tif (bytes_used < DENSITY_THRESHOLD(TINY_REGION_PAYLOAD_BYTES)) {\n\t\t\t/* Region has crossed threshold from density to sparsity. Mark it \"suitable\" on the\n\t\t\t * recirculation candidates list. */\n\t\t\tnode->recirc_suitable = TRUE;\n\t\t} else {\n\t\t\t/* After this free, we've found the region is still dense, so it must have been even more so before\n\t\t\t * the free. That implies the region is already correctly marked. Do nothing. */\n\t\t}\n\n\t\t// Has the entire magazine crossed the \"emptiness threshold\"? If so, transfer a region\n\t\t// from this magazine to the Depot. Choose a region that itself has crossed the emptiness threshold (i.e\n\t\t// is at least fraction \"f\" empty.) Such a region will be marked \"suitable\" on the recirculation list.\n\t\tsize_t a = tiny_mag_ptr->num_bytes_in_magazine;\t// Total bytes allocated to this magazine\n\t\tsize_t u = tiny_mag_ptr->mag_num_bytes_in_objects; // In use (malloc'd) from this magaqzine\n\n\t\tif (a - u > ((3 * TINY_REGION_PAYLOAD_BYTES) / 2) && u < DENSITY_THRESHOLD(a)) {\n\t\t\treturn tiny_free_do_recirc_to_depot(rack, tiny_mag_ptr, mag_index);\n\t\t}\n\t} else {\n#if !CONFIG_AGGRESSIVE_MADVISE\n\t\t// We are free'ing into the depot, so madvise as we do so unless we were madvising every incoming\n\t\t// allocation anyway.\n\t\ttiny_madvise_free_range_no_lock(rack, tiny_mag_ptr, region, headptr, headsize, ptr, msize);\n#endif\n\n\t\tif (0 < bytes_used || 0 < node->pinned_to_depot) {\n\t\t\t/* Depot'd region is still live. Leave it in place on the Depot's recirculation list\n\t\t\t * so as to avoid thrashing between the Depot's free list and a magazines's free list\n\t\t\t * with detach_region/reattach_region */\n\t\t} else {\n\t\t\t/* Depot'd region is just now empty. Consider return to OS. */\n\t\t\tregion_t r_dealloc = tiny_free_try_depot_unmap_no_lock(rack, tiny_mag_ptr, node);\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\tif (r_dealloc) {\n\t\t\t\tmvm_deallocate_pages(r_dealloc, TINY_REGION_SIZE, 0);\n\t\t\t}\n\t\t\treturn FALSE; // Caller need not unlock\n\t\t}\n\t}\n\treturn TRUE; // Caller must do SZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr)\n}\n#endif // CONFIG_RECIRC_DEPOT\n\nboolean_t\ntiny_free_no_lock(rack_t *rack, magazine_t *tiny_mag_ptr, mag_index_t mag_index, region_t region, void *ptr, msize_t msize)\n{\n\tvoid *original_ptr = ptr;\n\tsize_t original_size = TINY_BYTES_FOR_MSIZE(msize);\n\tvoid *next_block = ((unsigned char *)ptr + original_size);\n\tmsize_t previous_msize, next_msize;\n\tvoid *previous;\n\ttiny_free_list_t *big_free_block;\n\ttiny_free_list_t *after_next_block;\n\ttiny_free_list_t *before_next_block;\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_free_no_lock(), ptr=%p, msize=%d\\n\", ptr, msize);\n\t}\n\tif (!msize) {\n\t\tmalloc_zone_error(rack->debug_flags, true,\n\t\t\t\t\"trying to free tiny block that is too small in tiny_free_no_lock(), ptr=%p, msize=%d\\n\",\n\t\t\t\tptr, msize);\n\t}\n#endif\n\n\t// We try to coalesce this block with the preceeding one\n\tprevious = tiny_previous_preceding_free(ptr, &previous_msize);\n\tif (previous) {\n#if DEBUG_MALLOC\n\t\tif (LOG(szone, ptr) || LOG(szone, previous)) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_free_no_lock(), coalesced backwards for %p previous=%p\\n\", ptr, previous);\n\t\t}\n#endif\n\n\t\t// clear the meta_header since this is no longer the start of a block\n\t\tset_tiny_meta_header_middle(ptr);\n\t\ttiny_free_list_remove_ptr(rack, tiny_mag_ptr, previous, previous_msize);\n\t\tptr = previous;\n\t\tmsize += previous_msize;\n\t}\n\t// We try to coalesce with the next block\n\tif ((next_block < TINY_REGION_END(region)) && tiny_meta_header_is_free(next_block)) {\n\t\tnext_msize = get_tiny_free_size(next_block);\n#if DEBUG_MALLOC\n\t\tif (LOG(szone, ptr) || LOG(szone, next_block)) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_free_no_lock(), for ptr=%p, msize=%d coalesced forward=%p next_msize=%d\\n\", ptr, msize,\n\t\t\t\t\t\t next_block, next_msize);\n\t\t}\n#endif\n\t\t// If we are coalescing with the next block, and the next block is in\n\t\t// the last slot of the free list, then we optimize this case here to\n\t\t// avoid removing next_block from the slot (NUM_TINY_SLOTS - 1) and then adding ptr back\n\t\t// to slot (NUM_TINY_SLOTS - 1).\n\t\tif (next_msize >= NUM_TINY_SLOTS) {\n\t\t\tmsize += next_msize;\n\n\t\t\tbig_free_block = (tiny_free_list_t *)next_block;\n\t\t\tafter_next_block = free_list_unchecksum_ptr(rack, &big_free_block->next);\n\t\t\tbefore_next_block = free_list_unchecksum_ptr(rack, &big_free_block->previous);\n\n\t\t\tif (!before_next_block) {\n\t\t\t\ttiny_mag_ptr->mag_free_list[NUM_TINY_SLOTS - 1].p = ptr;\n\t\t\t} else {\n\t\t\t\tbefore_next_block->next.u = free_list_checksum_ptr(rack, ptr);\n\t\t\t}\n\n\t\t\tif (after_next_block) {\n\t\t\t\tafter_next_block->previous.u = free_list_checksum_ptr(rack, ptr);\n\t\t\t}\n\n\t\t\t// we don't need to checksum these since they are already checksummed\n\t\t\t((tiny_free_list_t *)ptr)->previous = big_free_block->previous;\n\t\t\t((tiny_free_list_t *)ptr)->next = big_free_block->next;\n\n\t\t\t// clear the meta_header to enable coalescing backwards\n\t\t\tset_tiny_meta_header_middle(big_free_block);\n\t\t\tset_tiny_meta_header_free(ptr, msize);\n\n\t\t\tgoto tiny_free_ending;\n\t\t}\n\t\ttiny_free_list_remove_ptr(rack, tiny_mag_ptr, next_block, next_msize);\n\t\tset_tiny_meta_header_middle(next_block); // clear the meta_header to enable coalescing backwards\n\t\tmsize += next_msize;\n\t}\n\n\t// The tiny cache already scribbles free blocks as they go through the\n\t// cache whenever msize < TINY_QUANTUM , so we do not need to do it here.\n\tif ((rack->debug_flags & MALLOC_DO_SCRIBBLE) && msize && (msize >= TINY_QUANTUM)) {\n\t\tmemset(ptr, SCRABBLE_BYTE, TINY_BYTES_FOR_MSIZE(msize));\n\t}\n\n\ttiny_free_list_add_ptr(rack, tiny_mag_ptr, ptr, msize);\n\ntiny_free_ending:\n\n\ttiny_mag_ptr->mag_num_objects--;\n\t// we use original_size and not msize to avoid double counting the coalesced blocks\n\ttiny_mag_ptr->mag_num_bytes_in_objects -= original_size;\n\n\t// Update this region's bytes in use count\n\tregion_trailer_t *node = REGION_TRAILER_FOR_TINY_REGION(region);\n\tsize_t bytes_used = node->bytes_used - original_size;\n\tnode->bytes_used = (unsigned int)bytes_used;\n\n#if CONFIG_AGGRESSIVE_MADVISE\n\t// Platforms that want to madvise every freed allocation do so here, even if we continue\n\t// on to use the recirc depot after.\n\ttiny_madvise_free_range_no_lock(rack, tiny_mag_ptr, region, original_ptr, original_size, ptr, msize);\n#endif\n\n\t// Caller must do SZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr) if this function\n\t// returns TRUE.\n\tboolean_t needs_unlock = TRUE;\n\n#if CONFIG_RECIRC_DEPOT\n\tneeds_unlock = tiny_free_try_recirc_to_depot(rack, tiny_mag_ptr, mag_index, region, original_ptr, original_size, ptr, msize);\n#endif\n\treturn needs_unlock;\n}\n\n// Allocates from the last region or a freshly allocated region\nstatic void *\ntiny_malloc_from_region_no_lock(rack_t *rack,\n\t\t\t\t\t\t\t\tmagazine_t *tiny_mag_ptr,\n\t\t\t\t\t\t\t\tmag_index_t mag_index,\n\t\t\t\t\t\t\t\tmsize_t msize,\n\t\t\t\t\t\t\t\tvoid *aligned_address)\n{\n\tvoid *ptr;\n\n\t// Deal with unclaimed memory -- mag_bytes_free_at_end or mag_bytes_free_at_start\n\tif (tiny_mag_ptr->mag_bytes_free_at_end || tiny_mag_ptr->mag_bytes_free_at_start) {\n\t\ttiny_finalize_region(rack, tiny_mag_ptr);\n\t}\n\n\t// We set the unused bits of the header in the last pair to be all ones, and those of the inuse to zeroes.\n#if NUM_TINY_BLOCKS & 31\n\tconst uint32_t header = 0xFFFFFFFFU << (NUM_TINY_BLOCKS & 31);\n#else\n\tconst uint32_t header = 0;\n#endif\n\t((tiny_region_t)aligned_address)->pairs[CEIL_NUM_TINY_BLOCKS_WORDS - 1].header = header;\n\t((tiny_region_t)aligned_address)->pairs[CEIL_NUM_TINY_BLOCKS_WORDS - 1].inuse = 0;\n\n\t// Tag the region at \"aligned_address\" as belonging to us,\n\t// and so put it under the protection of the magazine lock we are holding.\n\t// Do this before advertising \"aligned_address\" on the hash ring(!)\n\tMAGAZINE_INDEX_FOR_TINY_REGION(aligned_address) = mag_index;\n\n\t// Insert the new region into the hash ring\n\track_region_insert(rack, (region_t)aligned_address);\n\n\ttiny_mag_ptr->mag_last_region = aligned_address;\n\tBYTES_USED_FOR_TINY_REGION(aligned_address) = TINY_BYTES_FOR_MSIZE(msize);\n\n#if CONFIG_ASLR_INTERNAL\n\tint offset_msize = malloc_entropy[0] & TINY_ENTROPY_MASK;\n#if DEBUG_MALLOC\n\tif (getenv(\"MallocASLRForce\")) {\n\t\toffset_msize = strtol(getenv(\"MallocASLRForce\"), NULL, 0) & TINY_ENTROPY_MASK;\n\t}\n\tif (getenv(\"MallocASLRPrint\")) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"Region: %p offset: %d\\n\", aligned_address, offset_msize);\n\t}\n#endif\n#else\n\tint offset_msize = 0;\n#endif\n\tptr = (void *)((uintptr_t)aligned_address + TINY_BYTES_FOR_MSIZE(offset_msize));\n\tset_tiny_meta_header_in_use(ptr, msize);\n\ttiny_mag_ptr->mag_num_objects++;\n\ttiny_mag_ptr->mag_num_bytes_in_objects += TINY_BYTES_FOR_MSIZE(msize);\n\ttiny_mag_ptr->num_bytes_in_magazine += TINY_REGION_PAYLOAD_BYTES;\n\n\t// We put a header on the last block so that it appears in use (for coalescing, etc...)\n\tset_tiny_meta_header_in_use_1((void *)((uintptr_t)ptr + TINY_BYTES_FOR_MSIZE(msize)));\n\ttiny_mag_ptr->mag_bytes_free_at_end = TINY_BYTES_FOR_MSIZE(NUM_TINY_BLOCKS - msize - offset_msize);\n\n#if CONFIG_ASLR_INTERNAL\n\t// Put a header on the previous block for same reason\n\ttiny_mag_ptr->mag_bytes_free_at_start = TINY_BYTES_FOR_MSIZE(offset_msize);\n\tif (offset_msize) {\n\t\tset_tiny_meta_header_in_use_1((void *)((uintptr_t)ptr - TINY_QUANTUM));\n\t}\n#else\n\ttiny_mag_ptr->mag_bytes_free_at_start = 0;\n#endif\n\n\t// connect to magazine as last node\n\trecirc_list_splice_last(rack, tiny_mag_ptr, REGION_TRAILER_FOR_TINY_REGION(aligned_address));\n\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_malloc_from_region_no_lock(), ptr=%p, msize=%d\\n\", ptr, msize);\n\t}\n#endif\n\treturn ptr;\n}\n\nvoid *\ntiny_memalign(szone_t *szone, size_t alignment, size_t size, size_t span)\n{\n\tmsize_t mspan = TINY_MSIZE_FOR_BYTES(span + TINY_QUANTUM - 1);\n\tvoid *p = tiny_malloc_should_clear(&szone->tiny_rack, mspan, 0);\n\n\tif (NULL == p) {\n\t\treturn NULL;\n\t}\n\n\tsize_t offset = ((uintptr_t)p) & (alignment - 1);\t// p % alignment\n\tsize_t pad = (0 == offset) ? 0 : alignment - offset; // p + pad achieves desired alignment\n\n\tmsize_t msize = TINY_MSIZE_FOR_BYTES(size + TINY_QUANTUM - 1);\n\tmsize_t mpad = TINY_MSIZE_FOR_BYTES(pad + TINY_QUANTUM - 1);\n\tmsize_t mwaste = mspan - msize - mpad; // excess blocks\n\n\tif (mpad > 0) {\n\t\tvoid *q = (void *)(((uintptr_t)p) + pad);\n\n\t\t// Mark q as a block header and in-use, thus creating two blocks.\n\t\tmagazine_t *tiny_mag_ptr = mag_lock_zine_for_region_trailer(szone->tiny_rack.magazines,\n\t\t\t\tREGION_TRAILER_FOR_TINY_REGION(TINY_REGION_FOR_PTR(p)),\n\t\t\t\tMAGAZINE_INDEX_FOR_TINY_REGION(TINY_REGION_FOR_PTR(p)));\n\t\tset_tiny_meta_header_in_use(q, msize);\n\t\ttiny_mag_ptr->mag_num_objects++;\n\n\t\t// set_tiny_meta_header_in_use() \"reaffirms\" the block_header on the *following* block, so\n\t\t// now set its in_use bit as well. But only if its within the original allocation made above.\n\t\tif (mwaste > 0) {\n\t\t\tBITARRAY_SET(TINY_INUSE_FOR_HEADER(TINY_BLOCK_HEADER_FOR_PTR(q)), TINY_INDEX_FOR_PTR(q) + msize);\n\t\t}\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\n\t\t// Give up mpad blocks beginning at p to the tiny free list\n\t\tfree_tiny(&szone->tiny_rack, p, TINY_REGION_FOR_PTR(p), TINY_BYTES_FOR_MSIZE(mpad));\n\n\t\tp = q; // advance p to the desired alignment\n\t}\n\n\tif (mwaste > 0) {\n\t\tvoid *q = (void *)(((uintptr_t)p) + TINY_BYTES_FOR_MSIZE(msize));\n\t\t// Mark q as block header and in-use, thus creating two blocks.\n\t\tmagazine_t *tiny_mag_ptr = mag_lock_zine_for_region_trailer(szone->tiny_rack.magazines,\n\t\t\t\tREGION_TRAILER_FOR_TINY_REGION(TINY_REGION_FOR_PTR(p)),\n\t\t\t\tMAGAZINE_INDEX_FOR_TINY_REGION(TINY_REGION_FOR_PTR(p)));\n\t\tset_tiny_meta_header_in_use(q, mwaste);\n\t\ttiny_mag_ptr->mag_num_objects++;\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\n\t\t// Give up mwaste blocks beginning at q to the tiny free list\n\t\tfree_tiny(&szone->tiny_rack, q, TINY_REGION_FOR_PTR(q), TINY_BYTES_FOR_MSIZE(mwaste));\n\t}\n\n\treturn p; // p has the desired size and alignment, and can later be free()'d\n}\n\nboolean_t\ntiny_claimed_address(rack_t *rack, void *ptr)\n{\n\tregion_t r = tiny_region_for_ptr_no_lock(rack, ptr);\n\treturn r && ptr < TINY_REGION_END(r);\n}\n\nvoid *\ntiny_try_shrink_in_place(rack_t *rack, void *ptr, size_t old_size, size_t new_good_size)\n{\n\tmsize_t new_msize = TINY_MSIZE_FOR_BYTES(new_good_size);\n\tmsize_t mshrinkage = TINY_MSIZE_FOR_BYTES(old_size) - new_msize;\n\n\tif (mshrinkage) {\n\t\tvoid *q = (void *)((uintptr_t)ptr + TINY_BYTES_FOR_MSIZE(new_msize));\n\t\tmagazine_t *tiny_mag_ptr = mag_lock_zine_for_region_trailer(rack->magazines,\n\t\t\t\tREGION_TRAILER_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr)),\n\t\t\t\tMAGAZINE_INDEX_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr)));\n\n\t\t// Mark q as block header and in-use, thus creating two blocks.\n\t\tset_tiny_meta_header_in_use(q, mshrinkage);\n\t\ttiny_mag_ptr->mag_num_objects++;\n\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\tfree_tiny(rack, q, TINY_REGION_FOR_PTR(q), 0);\n\t}\n\treturn ptr;\n}\n\nboolean_t\ntiny_try_realloc_in_place(rack_t *rack, void *ptr, size_t old_size, size_t new_size)\n{\n\t// returns 1 on success\n\tmsize_t index;\n\tmsize_t old_msize;\n\tunsigned next_index;\n\tvoid *next_block;\n\tboolean_t is_free;\n\tmsize_t next_msize, coalesced_msize, leftover_msize, new_msize;\n\tvoid *leftover;\n\n\tindex = TINY_INDEX_FOR_PTR(ptr);\n\told_msize = TINY_MSIZE_FOR_BYTES(old_size);\n\tnew_msize = TINY_MSIZE_FOR_BYTES(new_size + TINY_QUANTUM - 1);\n\tnext_index = index + old_msize;\n\n\tif (next_index >= NUM_TINY_BLOCKS) {\n\t\treturn 0;\n\t}\n\tnext_block = (char *)ptr + old_size;\n\n\tmagazine_t *tiny_mag_ptr = mag_lock_zine_for_region_trailer(rack->magazines,\n\t\t\tREGION_TRAILER_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr)),\n\t\t\tMAGAZINE_INDEX_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr)));\n\n\tif (DEPOT_MAGAZINE_INDEX == MAGAZINE_INDEX_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr))) {\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\treturn 0;\n\t}\n\n\tcoalesced_msize = new_msize - old_msize;\n#if CONFIG_TINY_CACHE\n\tvoid *last_free_ptr = tiny_mag_ptr->mag_last_free;\n\tmsize_t last_free_msize = tiny_mag_ptr->mag_last_free_msize;\n\tif (last_free_ptr == next_block && old_msize + last_free_msize >= new_msize) {\n\t\t/*\n\t\t * There is a block in mag_last_free and it's immediately after\n\t\t * this block and it's large enough. We can use some or all of it.\n\t\t */\n\t\tleftover_msize = last_free_msize - coalesced_msize;\n\t\tif (leftover_msize) {\n\t\t\ttiny_mag_ptr->mag_last_free_msize -= coalesced_msize;\n\t\t\ttiny_mag_ptr->mag_last_free += new_size - old_size;\n\t\t\t// The block in mag_last_free is still marked as header and in-use, so copy that\n\t\t\t// state to the block that remains. The state for the block that we're going to\n\t\t\t// use is adjusted by the set_tiny_meta_header_middle() call below.\n\t\t\tset_tiny_meta_header_in_use(next_block + TINY_BYTES_FOR_MSIZE(coalesced_msize), leftover_msize);\n\t\t} else {\n\t\t\t// Using the whole block.\n\t\t\ttiny_mag_ptr->mag_last_free = NULL;\n\t\t\ttiny_mag_ptr->mag_last_free_msize = 0;\n\t\t\ttiny_mag_ptr->mag_last_free_rgn = NULL;\n\t\t}\n\t\tset_tiny_meta_header_middle(next_block);\n\t} else {\n#endif // CONFIG_TINY_CACHE\n\t\t/*\n\t\t * Try to expand into unused space immediately after this block.\n\t\t */\n\t\tmsize_t unused_msize = TINY_MSIZE_FOR_BYTES(tiny_mag_ptr->mag_bytes_free_at_end);\n\t\tvoid *unused_start = TINY_REGION_END(TINY_REGION_FOR_PTR(ptr)) - tiny_mag_ptr->mag_bytes_free_at_end;\n\t\tif (tiny_mag_ptr->mag_last_region == TINY_REGION_FOR_PTR(ptr)\n\t\t\t\t&& coalesced_msize < unused_msize && unused_start == ptr + old_size) {\n\t\t\t// The block at the start of mag_bytes_free_at_end is marked as\n\t\t\t// header/in-use and the next one has header/free. We need to\n\t\t\t// reset both the header and in-use bit in the first block and we\n\t\t\t// need to reset the header bit in the second block if it's part of\n\t\t\t// the new allocation.\n\t\t\tset_tiny_meta_header_middle(unused_start);\n\t\t\tif (coalesced_msize > 1) {\n\t\t\t\tset_tiny_meta_header_middle(unused_start + TINY_QUANTUM);\n\t\t\t}\n\t\t\ttiny_mag_ptr->mag_bytes_free_at_end -= TINY_BYTES_FOR_MSIZE(coalesced_msize);\n\t\t\tif (tiny_mag_ptr->mag_bytes_free_at_end) {\n\t\t\t\t// Mark the first block of the remaining free area as a header and in-use.\n\t\t\t\tset_tiny_meta_header_in_use_1(ptr + TINY_BYTES_FOR_MSIZE(new_msize));\n\t\t\t}\n\t\t} else {\n\t\t\t/*\n\t\t\t * Look for a free block immediately afterwards. If it's large\n\t\t\t * enough, we can consume (part of) it.\n\t\t\t */\n\t\t\tis_free = tiny_meta_header_is_free(next_block);\n\t\t\tif (!is_free) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\treturn 0; // next_block is in use;\n\t\t\t}\n\t\t\tnext_msize = get_tiny_free_size(next_block);\n\t\t\tif (old_msize + next_msize < new_msize) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\treturn 0; // even with next block, not enough\n\t\t\t}\n\t\t\t/*\n\t\t \t * The following block is big enough; pull it from its freelist and chop off enough to satisfy\n\t\t \t * our needs.\n\t\t \t */\n\t\t\ttiny_free_list_remove_ptr(rack, tiny_mag_ptr, next_block, next_msize);\n\t\t\tset_tiny_meta_header_middle(next_block); // clear the meta_header to enable coalescing backwards\n\t\t\tleftover_msize = next_msize - coalesced_msize;\n\t\t\tif (leftover_msize) {\n\t\t\t\t/* there's some left, so put the remainder back */\n\t\t\t\tleftover = (void *)((uintptr_t)next_block + TINY_BYTES_FOR_MSIZE(coalesced_msize));\n\t\t\t\ttiny_free_list_add_ptr(rack, tiny_mag_ptr, leftover, leftover_msize);\n\t\t\t}\n\t\t\tset_tiny_meta_header_in_use(ptr, old_msize + coalesced_msize);\n\t\t}\n#if CONFIG_TINY_CACHE\n\t}\n#endif // CONFIG_TINY_CACHE\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_try_realloc_in_place(), ptr=%p, msize=%d\\n\", ptr, old_msize + coalesced_msize);\n\t}\n#endif\n\ttiny_mag_ptr->mag_num_bytes_in_objects += TINY_BYTES_FOR_MSIZE(coalesced_msize);\n\n\t// Update this region's bytes in use count\n\tregion_trailer_t *node = REGION_TRAILER_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr));\n\tsize_t bytes_used = node->bytes_used + TINY_BYTES_FOR_MSIZE(coalesced_msize);\n\tnode->bytes_used = (unsigned int)bytes_used;\n\n\t// Emptiness discriminant\n\tif (bytes_used < DENSITY_THRESHOLD(TINY_REGION_PAYLOAD_BYTES)) {\n\t\t/* After this reallocation the region is still sparse, so it must have been even more so before\n\t\t * the reallocation. That implies the region is already correctly marked. Do nothing. */\n\t} else {\n\t\t/* Region has crossed threshold from sparsity to density. Mark it not \"suitable\" on the\n\t\t * recirculation candidates list. */\n\t\tnode->recirc_suitable = FALSE;\n\t}\n\n\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\tCHECK(szone, __PRETTY_FUNCTION__);\n\treturn 1;\n}\n\nstatic char *tiny_check_fail_msg = \"*** check: incorrect tiny region \";\n\n#define TINY_CHECK_FAIL(fmt, ...) \\\n\tmalloc_zone_check_fail(tiny_check_fail_msg, \\\n\t\t\t\"%ld, counter=%d\\n\" fmt, region_index, counter, __VA_ARGS__);\n\nboolean_t\ntiny_check_region(rack_t *rack, region_t region, size_t region_index,\n\t\tunsigned counter)\n{\n\tuintptr_t start, ptr, region_end;\n\tboolean_t prev_free = 0;\n\tboolean_t is_free;\n\tmsize_t msize;\n\ttiny_free_list_t *free_head;\n\tvoid *follower, *previous, *next;\n\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_TINY_REGION(region);\n\tmagazine_t *tiny_mag_ptr = &(rack->magazines[mag_index]);\n\n\t// Assumes locked\n\tCHECK_MAGAZINE_PTR_LOCKED(szone, tiny_mag_ptr, __PRETTY_FUNCTION__);\n\n\t// Do not check the region if pinned_to_depot is not zero because it\n\t// may not be in a consistent state (specifically, if may have a\n\t// block marked as in-use that's longer than any legal allocation,\n\t// which upsets get_tiny_meta_header() because it can't determine the\n\t// block's length).\n\tif (!REGION_TRAILER_FOR_TINY_REGION(region)->pinned_to_depot) {\n\t\treturn 1;\n\t}\n\n\t/* establish region limits */\n\tstart = (uintptr_t)TINY_REGION_ADDRESS(region);\n\tptr = start;\n\tif (region == tiny_mag_ptr->mag_last_region) {\n\t\tptr += tiny_mag_ptr->mag_bytes_free_at_start;\n\n\t\t/*\n\t\t * Check the leading block's integrity here also.\n\t\t */\n\t\tif (tiny_mag_ptr->mag_bytes_free_at_start) {\n\t\t\tmsize = get_tiny_meta_header((void *)(ptr - TINY_QUANTUM), &is_free);\n\t\t\tif (is_free || (msize != 1)) {\n\t\t\t\tTINY_CHECK_FAIL(\"*** invariant broken for leader block %p - %d %d\\n\",\n\t\t\t\t\t\t(void *)(ptr - TINY_QUANTUM), msize, is_free);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\tregion_end = (uintptr_t)TINY_REGION_END(region);\n\n\t/*\n\t * The last region may have a trailing chunk which has not been converted into inuse/freelist\n\t * blocks yet.\n\t */\n\tif (region == tiny_mag_ptr->mag_last_region) {\n\t\tregion_end -= tiny_mag_ptr->mag_bytes_free_at_end;\n\t}\n\n\t/*\n\t * Scan blocks within the region.\n\t */\n\twhile (ptr < region_end) {\n\t\t/*\n\t\t * If the first block is free, and its size is 65536 (msize = 0) then the entire region is\n\t\t * free.\n\t\t */\n\t\tmsize = get_tiny_meta_header((void *)ptr, &is_free);\n\t\tif (is_free && !msize && (ptr == start)) {\n\t\t\treturn 1;\n\t\t}\n\n\t\t/*\n\t\t * If the block's size is 65536 (msize = 0) then since we're not the first entry the size is\n\t\t * corrupt.\n\t\t */\n\t\tif (!msize) {\n\t\t\tTINY_CHECK_FAIL(\"*** invariant broken for tiny block %p this msize=%d - size is too small\\n\", (void *)ptr, msize);\n\t\t\treturn 0;\n\t\t}\n\n\t\tif (!is_free) {\n\t\t\t/*\n\t\t\t * In use blocks cannot be more than (NUM_TINY_SLOTS - 1) quanta large.\n\t\t\t */\n\t\t\tprev_free = 0;\n\t\t\tif (msize > (NUM_TINY_SLOTS - 1)) {\n\t\t\t\tTINY_CHECK_FAIL(\"*** invariant broken for %p this tiny msize=%d - size is too large\\n\", (void *)ptr, msize);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t/* move to next block */\n\t\t\tptr += TINY_BYTES_FOR_MSIZE(msize);\n\t\t} else {\n#if !CONFIG_RELAXED_INVARIANT_CHECKS\n\t\t\t/*\n\t\t\t * Free blocks must have been coalesced, we cannot have a free block following another\n\t\t\t * free block.\n\t\t\t */\n\t\t\tif (prev_free) {\n\t\t\t\tTINY_CHECK_FAIL(\"*** invariant broken for free block %p this tiny msize=%d: two free blocks in a row\\n\", (void *)ptr, msize);\n\t\t\t\treturn 0;\n\t\t\t}\n#endif // CONFIG_RELAXED_INVARIANT_CHECKS\n\t\t\tprev_free = 1;\n\t\t\t/*\n\t\t\t * Check the integrity of this block's entry in its freelist.\n\t\t\t */\n\t\t\tfree_head = (tiny_free_list_t *)ptr;\n\t\t\tprevious = free_list_unchecksum_ptr(rack, &free_head->previous);\n\t\t\tnext = free_list_unchecksum_ptr(rack, &free_head->next);\n\t\t\tif (previous && !tiny_meta_header_is_free(previous)) {\n\t\t\t\tTINY_CHECK_FAIL(\"*** invariant broken for %p (previous %p is not a free pointer)\\n\", (void *)ptr, previous);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (next && !tiny_meta_header_is_free(next)) {\n\t\t\t\tTINY_CHECK_FAIL(\"*** invariant broken for %p (next in free list %p is not a free pointer)\\n\", (void *)ptr, next);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t/*\n\t\t\t * Check the free block's trailing size value.\n\t\t\t */\n\t\t\tfollower = FOLLOWING_TINY_PTR(ptr, msize);\n\t\t\tif (((uintptr_t)follower != region_end) && (get_tiny_previous_free_msize(follower) != msize)) {\n\t\t\t\tTINY_CHECK_FAIL(\"*** invariant broken for tiny free %p followed by %p in region [%p-%p] \"\n\t\t\t\t\t\t\"(end marker incorrect) should be %d; in fact %d\\n\",\n\t\t\t\t\t\t(void *)ptr, follower, TINY_REGION_ADDRESS(region), (void *)region_end,\n\t\t\t\t\t\tmsize, get_tiny_previous_free_msize(follower));\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t/* move to next block */\n\t\t\tptr = (uintptr_t)follower;\n\t\t}\n\t}\n\t/*\n\t * Ensure that we scanned the entire region\n\t */\n\tif (ptr != region_end) {\n\t\tTINY_CHECK_FAIL(\"*** invariant broken for region end %p - %p\\n\", (void *)ptr, (void *)region_end);\n\t\treturn 0;\n\t}\n\t/*\n\t * Check the trailing block's integrity.\n\t */\n\tif (region == tiny_mag_ptr->mag_last_region) {\n\t\tif (tiny_mag_ptr->mag_bytes_free_at_end) {\n\t\t\tmsize = get_tiny_meta_header((void *)ptr, &is_free);\n\t\t\tif (is_free || (msize != 1)) {\n\t\t\t\tTINY_CHECK_FAIL(\"*** invariant broken for blocker block %p - %d %d\\n\", (void *)ptr, msize, is_free);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\treturn 1;\n}\n\nkern_return_t\ntiny_in_use_enumerator(task_t task,\n\t\t\t\t\t void *context,\n\t\t\t\t\t unsigned type_mask,\n\t\t\t\t\t szone_t *szone,\n\t\t\t\t\t memory_reader_t reader,\n\t\t\t\t\t vm_range_recorder_t recorder)\n{\n\tsize_t num_regions;\n\tsize_t index;\n\tregion_t *regions;\n\tvm_range_t buffer[MAX_RECORDER_BUFFER];\n\tunsigned count = 0;\n\tkern_return_t err;\n\tregion_t region;\n\tvm_range_t range;\n\tvm_range_t admin_range;\n\tvm_range_t ptr_range;\n\tunsigned char *mapped_region;\n\tuint32_t *block_header;\n\tuint32_t *in_use;\n\tunsigned block_index;\n\tunsigned block_limit;\n\tboolean_t is_free;\n\tmsize_t msize;\n\tvoid *mapped_ptr;\n\tunsigned bit;\n\tmagazine_t *tiny_mag_base = NULL;\n\n\tregion_hash_generation_t *trg_ptr;\n\terr = reader(task, (vm_address_t)szone->tiny_rack.region_generation, sizeof(region_hash_generation_t), (void **)&trg_ptr);\n\tif (err) {\n\t\treturn err;\n\t}\n\n\tnum_regions = trg_ptr->num_regions_allocated;\n\terr = reader(task, (vm_address_t)trg_ptr->hashed_regions, sizeof(region_t) * num_regions, (void **)®ions);\n\tif (err) {\n\t\treturn err;\n\t}\n\n\tif (type_mask & MALLOC_PTR_IN_USE_RANGE_TYPE) {\n\t\t// Map in all active magazines. Do this outside the iteration over regions.\n\t\terr = reader(task, (vm_address_t)(szone->tiny_rack.magazines), szone->tiny_rack.num_magazines * sizeof(magazine_t),\n\t\t\t\t\t (void **)&tiny_mag_base);\n\t\tif (err) {\n\t\t\treturn err;\n\t\t}\n\t}\n\n\tfor (index = 0; index < num_regions; ++index) {\n\t\tregion = regions[index];\n\t\tif (HASHRING_OPEN_ENTRY != region && HASHRING_REGION_DEALLOCATED != region) {\n\t\t\trange.address = (vm_address_t)TINY_REGION_ADDRESS(region);\n\t\t\trange.size = (vm_size_t)TINY_REGION_SIZE;\n\t\t\tif (type_mask & MALLOC_ADMIN_REGION_RANGE_TYPE) {\n\t\t\t\tadmin_range.address = range.address + TINY_METADATA_START;\n\t\t\t\tadmin_range.size = TINY_METADATA_SIZE;\n\t\t\t\trecorder(task, context, MALLOC_ADMIN_REGION_RANGE_TYPE, &admin_range, 1);\n\t\t\t}\n\t\t\tif (type_mask & (MALLOC_PTR_REGION_RANGE_TYPE | MALLOC_ADMIN_REGION_RANGE_TYPE)) {\n\t\t\t\tptr_range.address = range.address;\n\t\t\t\tptr_range.size = NUM_TINY_BLOCKS * TINY_QUANTUM;\n\t\t\t\trecorder(task, context, MALLOC_PTR_REGION_RANGE_TYPE, &ptr_range, 1);\n\t\t\t}\n\t\t\tif (type_mask & MALLOC_PTR_IN_USE_RANGE_TYPE) {\n\t\t\t\tvm_address_t mag_last_free;\n\t\t\t\tmsize_t mag_last_free_msize = 0;\n\n\t\t\t\terr = reader(task, range.address, range.size, (void **)&mapped_region);\n\t\t\t\tif (err) {\n\t\t\t\t\treturn err;\n\t\t\t\t}\n\n\t\t\t\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_TINY_REGION(mapped_region);\n\t\t\t\tmagazine_t *tiny_mag_ptr = tiny_mag_base + mag_index;\n\n\t\t\t\tif (DEPOT_MAGAZINE_INDEX != mag_index) {\n\t\t\t\t\tmag_last_free = (uintptr_t)tiny_mag_ptr->mag_last_free;\n\t\t\t\t\tmag_last_free_msize = tiny_mag_ptr->mag_last_free_msize;\n\t\t\t\t} else {\n\t\t\t\t\tfor (mag_index = 0; mag_index < szone->tiny_rack.num_magazines; mag_index++) {\n\t\t\t\t\t\tif ((void *)range.address == (tiny_mag_base + mag_index)->mag_last_free_rgn) {\n\t\t\t\t\t\t\tmag_last_free = (uintptr_t)(tiny_mag_base + mag_index)->mag_last_free;\n\t\t\t\t\t\t\tmag_last_free_msize = (tiny_mag_base + mag_index)->mag_last_free_msize;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tblock_header = (uint32_t *)(mapped_region + TINY_METADATA_START + sizeof(region_trailer_t));\n\t\t\t\tin_use = TINY_INUSE_FOR_HEADER(block_header);\n\t\t\t\tblock_index = 0;\n\t\t\t\tblock_limit = NUM_TINY_BLOCKS;\n\t\t\t\tif (region == tiny_mag_ptr->mag_last_region) {\n\t\t\t\t\tblock_index += TINY_MSIZE_FOR_BYTES(tiny_mag_ptr->mag_bytes_free_at_start);\n\t\t\t\t\tblock_limit -= TINY_MSIZE_FOR_BYTES(tiny_mag_ptr->mag_bytes_free_at_end);\n\t\t\t\t}\n\n\t\t\t\twhile (block_index < block_limit) {\n\t\t\t\t\tvm_size_t block_offset = TINY_BYTES_FOR_MSIZE(block_index);\n\t\t\t\t\tis_free = !BITARRAY_BIT(in_use, block_index);\n\t\t\t\t\tif (is_free) {\n\t\t\t\t\t\tmapped_ptr = mapped_region + block_offset;\n\n\t\t\t\t\t\t// mapped_region, the address at which 'range' in 'task' has been\n\t\t\t\t\t\t// mapped into our process, is not necessarily aligned to\n\t\t\t\t\t\t// TINY_BLOCKS_ALIGN.\n\t\t\t\t\t\t//\n\t\t\t\t\t\t// Since the code in get_tiny_free_size() assumes the pointer came\n\t\t\t\t\t\t// from a properly aligned tiny region, and mapped_region is not\n\t\t\t\t\t\t// necessarily aligned, then do the size calculation directly.\n\t\t\t\t\t\t// If the next bit is set in the header bitmap, then the size is one\n\t\t\t\t\t\t// quantum. Otherwise, read the size field.\n\t\t\t\t\t\tif (!BITARRAY_BIT(block_header, (block_index + 1))) {\n\t\t\t\t\t\t\tmsize = TINY_FREE_SIZE(mapped_ptr);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tmsize = 1;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} else if (range.address + block_offset != mag_last_free) {\n\t\t\t\t\t\tmsize = 1;\n\t\t\t\t\t\tbit = block_index + 1;\n\t\t\t\t\t\twhile (!BITARRAY_BIT(block_header, bit)) {\n\t\t\t\t\t\t\tbit++;\n\t\t\t\t\t\t\tmsize++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbuffer[count].address = range.address + block_offset;\n\t\t\t\t\t\tbuffer[count].size = TINY_BYTES_FOR_MSIZE(msize);\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t\tif (count >= MAX_RECORDER_BUFFER) {\n\t\t\t\t\t\t\trecorder(task, context, MALLOC_PTR_IN_USE_RANGE_TYPE, buffer, count);\n\t\t\t\t\t\t\tcount = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Block is not free but it matches mag_last_free_ptr so even\n\t\t\t\t\t\t// though it is not marked free in the bitmap, we treat it as if\n\t\t\t\t\t\t// it is and move on\n\t\t\t\t\t\tmsize = mag_last_free_msize;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!msize) {\n\t\t\t\t\t\treturn KERN_FAILURE; // Somethings amiss. Avoid looping at this block_index.\n\t\t\t\t\t}\n\t\t\t\t\tblock_index += msize;\n\t\t\t\t}\n\t\t\t\tif (count) {\n\t\t\t\t\trecorder(task, context, MALLOC_PTR_IN_USE_RANGE_TYPE, buffer, count);\n\t\t\t\t\tcount = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nvoid *\ntiny_malloc_from_free_list(rack_t *rack, magazine_t *tiny_mag_ptr, mag_index_t mag_index, msize_t msize)\n{\n\ttiny_free_list_t *ptr;\n\tmsize_t this_msize;\n\tgrain_t slot = msize - 1;\n\tfree_list_t *free_list = tiny_mag_ptr->mag_free_list;\n\tfree_list_t *the_slot = free_list + slot;\n\ttiny_free_list_t *next;\n\tfree_list_t *limit;\n#if defined(__LP64__)\n\tuint64_t bitmap;\n#else\n\tuint32_t bitmap;\n#endif\n\tmsize_t leftover_msize;\n\ttiny_free_list_t *leftover_ptr;\n\n\t// Assumes we've locked the region\n\tCHECK_MAGAZINE_PTR_LOCKED(szone, tiny_mag_ptr, __PRETTY_FUNCTION__);\n\n\t// Look for an exact match by checking the freelist for this msize.\n\t//\n\tptr = the_slot->p;\n\tif (ptr) {\n\t\tnext = free_list_unchecksum_ptr(rack, &ptr->next);\n\t\tif (next) {\n\t\t\tnext->previous = ptr->previous;\n\t\t} else {\n\t\t\tBITMAPV_CLR(tiny_mag_ptr->mag_bitmap, slot);\n\t\t}\n\t\tthe_slot->p = next;\n\t\tthis_msize = msize;\n#if DEBUG_MALLOC\n\t\tif (LOG(szone, ptr)) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_malloc_from_free_list(), exact match ptr=%p, this_msize=%d\\n\", ptr, this_msize);\n\t\t}\n#endif\n\t\tgoto return_tiny_alloc;\n\t}\n\n\t// Mask off the bits representing slots holding free blocks smaller than the\n\t// size we need. If there are no larger free blocks, try allocating from\n\t// the free space at the end of the tiny region.\n#if defined(__LP64__)\n\tbitmap = ((uint64_t *)(tiny_mag_ptr->mag_bitmap))[0] & ~((1ULL << slot) - 1);\n#else\n\tbitmap = tiny_mag_ptr->mag_bitmap[0] & ~((1 << slot) - 1);\n#endif\n\tif (!bitmap) {\n\t\tgoto try_tiny_malloc_from_end;\n\t}\n\n\tslot = BITMAPV_CTZ(bitmap);\n\tlimit = free_list + NUM_TINY_SLOTS - 1;\n\tfree_list += slot;\n\n\tif (free_list < limit) {\n\t\tptr = free_list->p;\n\t\tif (ptr) {\n\t\t\tnext = free_list_unchecksum_ptr(rack, &ptr->next);\n\t\t\tfree_list->p = next;\n\t\t\tif (next) {\n\t\t\t\tnext->previous = ptr->previous;\n\t\t\t} else {\n\t\t\t\tBITMAPV_CLR(tiny_mag_ptr->mag_bitmap, slot);\n\t\t\t}\n\t\t\tthis_msize = get_tiny_free_size(ptr);\n\t\t\tgoto add_leftover_and_proceed;\n\t\t}\n#if DEBUG_MALLOC\n\t\tmalloc_report(ASL_LEVEL_ERR, \"in tiny_malloc_from_free_list(), mag_bitmap out of sync, slot=%d\\n\", slot);\n#endif\n\t}\n\n\t// We are now looking at the last slot, which contains blocks equal to, or\n\t// due to coalescing of free blocks, larger than (NUM_TINY_SLOTS - 1) * tiny quantum size.\n\t// If the last freelist is not empty, and the head contains a block that is\n\t// larger than our request, then the remainder is put back on the free list.\n\tptr = limit->p;\n\tif (ptr) {\n\t\tthis_msize = get_tiny_free_size(ptr);\n\t\tnext = free_list_unchecksum_ptr(rack, &ptr->next);\n\t\tif (this_msize - msize >= NUM_TINY_SLOTS) {\n\t\t\t// the leftover will go back to the free list, so we optimize by\n\t\t\t// modifying the free list rather than a pop and push of the head\n\t\t\tleftover_msize = this_msize - msize;\n\t\t\tleftover_ptr = (tiny_free_list_t *)((unsigned char *)ptr + TINY_BYTES_FOR_MSIZE(msize));\n\t\t\tlimit->p = leftover_ptr;\n\t\t\tif (next) {\n\t\t\t\tnext->previous.u = free_list_checksum_ptr(rack, leftover_ptr);\n\t\t\t}\n\t\t\tleftover_ptr->previous = ptr->previous;\n\t\t\tleftover_ptr->next = ptr->next;\n\t\t\tset_tiny_meta_header_free(leftover_ptr, leftover_msize);\n#if DEBUG_MALLOC\n\t\t\tif (LOG(szone, ptr)) {\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO,\n\t\t\t\t\t\t\t \"in tiny_malloc_from_free_list(), last slot ptr=%p, msize=%d this_msize=%d\\n\", ptr, msize, this_msize);\n\t\t\t}\n#endif\n\t\t\tthis_msize = msize;\n\t\t\tgoto return_tiny_alloc;\n\t\t}\n\t\tif (next) {\n\t\t\tnext->previous = ptr->previous;\n\t\t}\n\t\tlimit->p = next;\n\t\tgoto add_leftover_and_proceed;\n\t\t/* NOTREACHED */\n\t}\n\ntry_tiny_malloc_from_end:\n\t// Let's see if we can use tiny_mag_ptr->mag_bytes_free_at_end\n\tif (tiny_mag_ptr->mag_bytes_free_at_end >= TINY_BYTES_FOR_MSIZE(msize)) {\n\t\tptr = (tiny_free_list_t *)((uintptr_t)TINY_REGION_END(tiny_mag_ptr->mag_last_region) - tiny_mag_ptr->mag_bytes_free_at_end);\n\t\ttiny_mag_ptr->mag_bytes_free_at_end -= TINY_BYTES_FOR_MSIZE(msize);\n\t\tif (tiny_mag_ptr->mag_bytes_free_at_end) {\n\t\t\t// let's add an in use block after ptr to serve as boundary\n\t\t\tset_tiny_meta_header_in_use_1((unsigned char *)ptr + TINY_BYTES_FOR_MSIZE(msize));\n\t\t}\n\t\tthis_msize = msize;\n#if DEBUG_MALLOC\n\t\tif (LOG(szone, ptr)) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_malloc_from_free_list(), from end ptr=%p, msize=%d\\n\", ptr, msize);\n\t\t}\n#endif\n\t\tgoto return_tiny_alloc;\n\t}\n#if CONFIG_ASLR_INTERNAL\n\t// Try from start if nothing left at end\n\tif (tiny_mag_ptr->mag_bytes_free_at_start >= TINY_BYTES_FOR_MSIZE(msize)) {\n\t\tptr = (tiny_free_list_t *)(TINY_REGION_ADDRESS(tiny_mag_ptr->mag_last_region) + tiny_mag_ptr->mag_bytes_free_at_start -\n\t\t\t\t\t\t\t TINY_BYTES_FOR_MSIZE(msize));\n\t\ttiny_mag_ptr->mag_bytes_free_at_start -= TINY_BYTES_FOR_MSIZE(msize);\n\t\tif (tiny_mag_ptr->mag_bytes_free_at_start) {\n\t\t\t// let's add an in use block before ptr to serve as boundary\n\t\t\tset_tiny_meta_header_in_use_1((unsigned char *)ptr - TINY_QUANTUM);\n\t\t}\n\t\tthis_msize = msize;\n#if DEBUG_MALLOC\n\t\tif (LOG(szone, ptr)) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_malloc_from_free_list(), from start ptr=%p, msize=%d\\n\", ptr, msize);\n\t\t}\n#endif\n\t\tgoto return_tiny_alloc;\n\t}\n#endif\n\treturn NULL;\n\nadd_leftover_and_proceed:\n\tif (!this_msize || (this_msize > msize)) {\n\t\tleftover_msize = this_msize - msize;\n\t\tleftover_ptr = (tiny_free_list_t *)((unsigned char *)ptr + TINY_BYTES_FOR_MSIZE(msize));\n#if DEBUG_MALLOC\n\t\tif (LOG(szone, ptr)) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_malloc_from_free_list(), adding leftover ptr=%p, this_msize=%d\\n\", ptr, this_msize);\n\t\t}\n#endif\n\t\ttiny_free_list_add_ptr(rack, tiny_mag_ptr, leftover_ptr, leftover_msize);\n\t\tthis_msize = msize;\n\t}\n\nreturn_tiny_alloc:\n\ttiny_mag_ptr->mag_num_objects++;\n\ttiny_mag_ptr->mag_num_bytes_in_objects += TINY_BYTES_FOR_MSIZE(this_msize);\n\n\t// Update this region's bytes in use count\n\tregion_trailer_t *node = REGION_TRAILER_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr));\n\tsize_t bytes_used = node->bytes_used + TINY_BYTES_FOR_MSIZE(this_msize);\n\tnode->bytes_used = (unsigned int)bytes_used;\n\n\t// Emptiness discriminant\n\tif (bytes_used < DENSITY_THRESHOLD(TINY_REGION_PAYLOAD_BYTES)) {\n\t\t/* After this allocation the region is still sparse, so it must have been even more so before\n\t\t * the allocation. That implies the region is already correctly marked. Do nothing. */\n\t} else {\n\t\t/* Region has crossed threshold from sparsity to density. Mark it not \"suitable\" on the\n\t\t * recirculation candidates list. */\n\t\tnode->recirc_suitable = FALSE;\n\t}\n#if DEBUG_MALLOC\n\tif (LOG(szone, ptr)) {\n\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_malloc_from_free_list(), ptr=%p, this_msize=%d, msize=%d\\n\", ptr, this_msize, msize);\n\t}\n#endif\n\tif (this_msize > 1) {\n\t\tset_tiny_meta_header_in_use(ptr, this_msize);\n\t} else {\n\t\tset_tiny_meta_header_in_use_1(ptr);\n\t}\n\treturn ptr;\n}\n\nvoid *\ntiny_malloc_should_clear(rack_t *rack, msize_t msize, boolean_t cleared_requested)\n{\n\tvoid *ptr;\n\tmag_index_t mag_index = tiny_mag_get_thread_index() % rack->num_magazines;\n\tmagazine_t *tiny_mag_ptr = &(rack->magazines[mag_index]);\n\n\tMALLOC_TRACE(TRACE_tiny_malloc, (uintptr_t)rack, TINY_BYTES_FOR_MSIZE(msize), (uintptr_t)tiny_mag_ptr, cleared_requested);\n\n#if DEBUG_MALLOC\n\tif (DEPOT_MAGAZINE_INDEX == mag_index) {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"malloc called for magazine index -1\\n\");\n\t\treturn (NULL);\n\t}\n\n\tif (!msize) {\n\t\tmalloc_zone_error(rack->debug_flags, true, \"invariant broken (!msize) in allocation (region)\\n\");\n\t\treturn (NULL);\n\t}\n#endif\n\n\tSZONE_MAGAZINE_PTR_LOCK(tiny_mag_ptr);\n\n#if CONFIG_TINY_CACHE\n\tptr = tiny_mag_ptr->mag_last_free;\n\n\tif (tiny_mag_ptr->mag_last_free_msize == msize) {\n\t\t// we have a winner\n\t\ttiny_mag_ptr->mag_last_free = NULL;\n\t\ttiny_mag_ptr->mag_last_free_msize = 0;\n\t\ttiny_mag_ptr->mag_last_free_rgn = NULL;\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\tif (cleared_requested) {\n\t\t\tmemset(ptr, 0, TINY_BYTES_FOR_MSIZE(msize));\n\t\t}\n#if DEBUG_MALLOC\n\t\tif (LOG(szone, ptr)) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"in tiny_malloc_should_clear(), tiny cache ptr=%p, msize=%d\\n\", ptr, msize);\n\t\t}\n#endif\n\t\treturn ptr;\n\t}\n#endif /* CONFIG_TINY_CACHE */\n\n\twhile (1) {\n\t\tptr = tiny_malloc_from_free_list(rack, tiny_mag_ptr, mag_index, msize);\n\t\tif (ptr) {\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\t\tif (cleared_requested) {\n\t\t\t\tmemset(ptr, 0, TINY_BYTES_FOR_MSIZE(msize));\n\t\t\t}\n\t\t\treturn ptr;\n\t\t}\n\n\t\tif (tiny_get_region_from_depot(rack, tiny_mag_ptr, mag_index, msize)) {\n\t\t\tptr = tiny_malloc_from_free_list(rack, tiny_mag_ptr, mag_index, msize);\n\t\t\tif (ptr) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\t\t\tif (cleared_requested) {\n\t\t\t\t\tmemset(ptr, 0, TINY_BYTES_FOR_MSIZE(msize));\n\t\t\t\t}\n\t\t\t\treturn ptr;\n\t\t\t}\n\t\t}\n\n\t\t// The magazine is exhausted. A new region (heap) must be allocated to satisfy this call to malloc().\n\t\t// The allocation, an mmap() system call, will be performed outside the magazine spin locks by the first\n\t\t// thread that suffers the exhaustion. That thread sets \"alloc_underway\" and enters a critical section.\n\t\t// Threads arriving here later are excluded from the critical section, yield the CPU, and then retry the\n\t\t// allocation. After some time the magazine is resupplied, the original thread leaves with its allocation,\n\t\t// and retry-ing threads succeed in the code just above.\n\t\tif (!tiny_mag_ptr->alloc_underway) {\n\t\t\tvoid *fresh_region;\n\n\t\t\t// time to create a new region (do this outside the magazine lock)\n\t\t\ttiny_mag_ptr->alloc_underway = TRUE;\n\t\t\tOSMemoryBarrier();\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\tfresh_region = mvm_allocate_pages_securely(TINY_REGION_SIZE, TINY_BLOCKS_ALIGN, VM_MEMORY_MALLOC_TINY, rack->debug_flags);\n\t\t\tSZONE_MAGAZINE_PTR_LOCK(tiny_mag_ptr);\n\n\t\t\t// DTrace USDT Probe\n\t\t\tMAGMALLOC_ALLOCREGION(TINY_SZONE_FROM_RACK(rack), (int)mag_index, fresh_region, TINY_REGION_SIZE);\n\n\t\t\tif (!fresh_region) { // out of memory!\n\t\t\t\ttiny_mag_ptr->alloc_underway = FALSE;\n\t\t\t\tOSMemoryBarrier();\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\treturn NULL;\n\t\t\t}\n\n\t\t\tptr = tiny_malloc_from_region_no_lock(rack, tiny_mag_ptr, mag_index, msize, fresh_region);\n\n\t\t\t// we don't clear because this freshly allocated space is pristine\n\t\t\ttiny_mag_ptr->alloc_underway = FALSE;\n\t\t\tOSMemoryBarrier();\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\t\treturn ptr;\n\t\t} else {\n\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\tyield();\n\t\t\tSZONE_MAGAZINE_PTR_LOCK(tiny_mag_ptr);\n\t\t}\n\t}\n\t/* NOTREACHED */\n}\n\nsize_t\ntiny_size(rack_t *rack, const void *ptr)\n{\n\tif (tiny_region_for_ptr_no_lock(rack, ptr)) {\n\t\tif (TINY_INDEX_FOR_PTR(ptr) >= NUM_TINY_BLOCKS) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tboolean_t is_free;\n\t\tmsize_t msize = get_tiny_meta_header(ptr, &is_free);\n\t\tif (is_free) {\n\t\t\treturn 0;\n\t\t}\n\n#if CONFIG_TINY_CACHE\n\t\t{\n\t\t\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr));\n\t\t\tif (DEPOT_MAGAZINE_INDEX != mag_index) {\n\t\t\t\tmagazine_t *tiny_mag_ptr = &rack->magazines[mag_index];\n\n\t\t\t\tif (msize < TINY_QUANTUM && ptr == tiny_mag_ptr->mag_last_free) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (mag_index = 0; mag_index < rack->num_magazines; mag_index++) {\n\t\t\t\t\tmagazine_t *tiny_mag_ptr = &(rack->magazines[mag_index]);\n\n\t\t\t\t\tif (msize < TINY_QUANTUM && ptr == tiny_mag_ptr->mag_last_free) {\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n#endif\n\t\treturn TINY_BYTES_FOR_MSIZE(msize);\n\t}\n\n\treturn 0;\n}\n\nstatic MALLOC_NOINLINE void\nfree_tiny_botch(rack_t *rack, tiny_free_list_t *ptr)\n{\n\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_TINY_REGION(TINY_REGION_FOR_PTR(ptr));\n\tmagazine_t *tiny_mag_ptr = &(rack->magazines[mag_index]);\n\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\tmalloc_zone_error(rack->debug_flags, true, \"Double free of object %p\\n\", ptr);\n}\n\nvoid\nfree_tiny(rack_t *rack, void *ptr, region_t tiny_region, size_t known_size)\n{\n\tmsize_t msize;\n\tboolean_t is_free;\n\tmag_index_t mag_index = MAGAZINE_INDEX_FOR_TINY_REGION(tiny_region);\n\tmagazine_t *tiny_mag_ptr = &(rack->magazines[mag_index]);\n\n\tMALLOC_TRACE(TRACE_tiny_free, (uintptr_t)rack, (uintptr_t)ptr, (uintptr_t)tiny_mag_ptr, known_size);\n\n\t// ptr is known to be in tiny_region\n\tif (known_size) {\n\t\tmsize = TINY_MSIZE_FOR_BYTES(known_size + TINY_QUANTUM - 1);\n\t} else {\n\t\tmsize = get_tiny_meta_header(ptr, &is_free);\n\t\tif (is_free) {\n\t\t\tfree_tiny_botch(rack, ptr);\n\t\t\treturn;\n\t\t}\n\t}\n#if DEBUG_MALLOC\n\tif (!msize) {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"*** free_tiny() block in use is too large: %p\\n\", ptr);\n\t\treturn;\n\t}\n#endif\n\n\tSZONE_MAGAZINE_PTR_LOCK(tiny_mag_ptr);\n\n#if CONFIG_TINY_CACHE\n\t// Depot does not participate in CONFIG_TINY_CACHE since it can't be directly malloc()'d\n\tif (DEPOT_MAGAZINE_INDEX != mag_index) {\n\t\tif (msize < TINY_QUANTUM) {\t\t\t\t\t // to see if the bits fit in the last 4 bits\n\t\t\tvoid *ptr2 = tiny_mag_ptr->mag_last_free; // Might be NULL\n\t\t\tmsize_t msize2 = tiny_mag_ptr->mag_last_free_msize;\n\t\t\tregion_t rgn2 = tiny_mag_ptr->mag_last_free_rgn;\n\n\t\t\t/* check that we don't already have this pointer in the cache */\n\t\t\tif (ptr == ptr2) {\n\t\t\t\tfree_tiny_botch(rack, ptr);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif ((rack->debug_flags & MALLOC_DO_SCRIBBLE) && msize) {\n\t\t\t\tmemset(ptr, SCRABBLE_BYTE, TINY_BYTES_FOR_MSIZE(msize));\n\t\t\t}\n\n\t\t\ttiny_mag_ptr->mag_last_free = ptr;\n\t\t\ttiny_mag_ptr->mag_last_free_msize = msize;\n\t\t\ttiny_mag_ptr->mag_last_free_rgn = tiny_region;\n\n\t\t\tif (!ptr2) {\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\tCHECK(szone, __PRETTY_FUNCTION__);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tmsize = msize2;\n\t\t\tptr = ptr2;\n\t\t\ttiny_region = rgn2;\n\t\t}\n\t}\n#endif /* CONFIG_TINY_CACHE */\n\n\t// Now in the time it took to acquire the lock, the region may have migrated\n\t// from one magazine to another. I.e. trailer->mag_index is volatile.\n\t// In which case the magazine lock we obtained (namely magazines[mag_index].mag_lock)\n\t// is stale. If so, keep on tryin' ...\n\tregion_trailer_t *trailer = REGION_TRAILER_FOR_TINY_REGION(tiny_region);\n\tmag_index_t refreshed_index;\n\n\twhile (mag_index != (refreshed_index = trailer->mag_index)) { // Note assignment\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\tmag_index = refreshed_index;\n\t\ttiny_mag_ptr = &(rack->magazines[mag_index]);\n\t\tSZONE_MAGAZINE_PTR_LOCK(tiny_mag_ptr);\n\t}\n\n\tif (tiny_free_no_lock(rack, tiny_mag_ptr, mag_index, tiny_region, ptr, msize)) {\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t}\n\n\tCHECK(szone, __PRETTY_FUNCTION__);\n}\n\nunsigned\ntiny_batch_malloc(szone_t *szone, size_t size, void **results, unsigned count)\n{\n\tmsize_t msize = TINY_MSIZE_FOR_BYTES(size + TINY_QUANTUM - 1);\n\tunsigned found = 0;\n\tmag_index_t mag_index = tiny_mag_get_thread_index() % szone->tiny_rack.num_magazines;\n\tmagazine_t *tiny_mag_ptr = &(szone->tiny_rack.magazines[mag_index]);\n\n\t// make sure to return objects at least one quantum in size\n\tif (!msize) {\n\t\tmsize = 1;\n\t}\n\n\tCHECK(szone, __PRETTY_FUNCTION__);\n\n\t// We must lock the zone now, since tiny_malloc_from_free_list assumes that\n\t// the caller has done so.\n\tSZONE_MAGAZINE_PTR_LOCK(tiny_mag_ptr);\n\n\t// with the zone locked, allocate objects from the free list until all\n\t// sufficiently large objects have been exhausted, or we have met our quota\n\t// of objects to allocate.\n\twhile (found < count) {\n\t\tvoid *ptr = tiny_malloc_from_free_list(&szone->tiny_rack, tiny_mag_ptr, mag_index, msize);\n\t\tif (!ptr) {\n\t\t\tbreak;\n\t\t}\n\n\t\t*results++ = ptr;\n\t\tfound++;\n\t}\n\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\treturn found;\n}\n\nvoid\ntiny_batch_free(szone_t *szone, void **to_be_freed, unsigned count)\n{\n\tunsigned cc = 0;\n\tvoid *ptr;\n\tregion_t tiny_region = NULL;\n\tboolean_t is_free;\n\tmsize_t msize;\n\tmagazine_t *tiny_mag_ptr = NULL;\n\tmag_index_t mag_index = -1;\n\n\t// frees all the pointers in to_be_freed\n\t// note that to_be_freed may be overwritten during the process\n\tif (!count) {\n\t\treturn;\n\t}\n\n\tCHECK(szone, __PRETTY_FUNCTION__);\n\twhile (cc < count) {\n\t\tptr = to_be_freed[cc];\n\t\tif (ptr) {\n\t\t\tif (NULL == tiny_region || tiny_region != TINY_REGION_FOR_PTR(ptr)) { // region same as last iteration?\n\t\t\t\tif (tiny_mag_ptr) {\t\t\t\t\t\t\t\t\t\t\t\t // non-NULL iff magazine lock taken\n\t\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\t\ttiny_mag_ptr = NULL;\n\t\t\t\t}\n\n\t\t\t\ttiny_region = tiny_region_for_ptr_no_lock(&szone->tiny_rack, ptr);\n\n\t\t\t\tif (tiny_region) {\n\t\t\t\t\ttiny_mag_ptr = mag_lock_zine_for_region_trailer(szone->tiny_rack.magazines,\n\t\t\t\t\t\t\tREGION_TRAILER_FOR_TINY_REGION(tiny_region),\n\t\t\t\t\t\t\tMAGAZINE_INDEX_FOR_TINY_REGION(tiny_region));\n\t\t\t\t\tmag_index = MAGAZINE_INDEX_FOR_TINY_REGION(tiny_region);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tiny_region) {\n\t\t\t\t// this is a tiny pointer\n\t\t\t\tif (TINY_INDEX_FOR_PTR(ptr) >= NUM_TINY_BLOCKS) {\n\t\t\t\t\tbreak; // pointer to metadata; let the standard free deal with it\n\t\t\t\t}\n\t\t\t\tmsize = get_tiny_meta_header(ptr, &is_free);\n\t\t\t\tif (is_free) {\n\t\t\t\t\tbreak; // a double free; let the standard free deal with it\n\t\t\t\t}\n\t\t\t\tif (!tiny_free_no_lock(&szone->tiny_rack, tiny_mag_ptr, mag_index, tiny_region, ptr, msize)) {\n\t\t\t\t\t// Arrange to re-acquire magazine lock\n\t\t\t\t\ttiny_mag_ptr = NULL;\n\t\t\t\t\ttiny_region = NULL;\n\t\t\t\t}\n\t\t\t\tto_be_freed[cc] = NULL;\n\t\t\t} else {\n\t\t\t\t// No region in this zone claims ptr; let the standard free deal with it\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcc++;\n\t}\n\n\tif (tiny_mag_ptr) {\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\ttiny_mag_ptr = NULL;\n\t}\n}\n\n\nvoid\nprint_tiny_free_list(rack_t *rack)\n{\n\ttiny_free_list_t *ptr;\n\t_SIMPLE_STRING b = _simple_salloc();\n\tmag_index_t mag_index;\n\n\tif (b) {\n\t\t_simple_sappend(b, \"tiny free sizes:\\n\");\n\t\tfor (mag_index = -1; mag_index < rack->num_magazines; mag_index++) {\n\t\t\tgrain_t slot = 0;\n\t\t\t_simple_sprintf(b, \"\\tMagazine %d: \", mag_index);\n\t\t\twhile (slot < NUM_TINY_SLOTS) {\n\t\t\t\tptr = rack->magazines[mag_index].mag_free_list[slot].p;\n\t\t\t\tif (ptr) {\n\t\t\t\t\t_simple_sprintf(b, \"%s%y[%d]; \", (slot == NUM_TINY_SLOTS - 1) ? \">=\" : \"\", (slot + 1) * TINY_QUANTUM,\n\t\t\t\t\t\t\t\t\tfree_list_count(rack, (free_list_t){ .p = ptr }));\n\t\t\t\t}\n\t\t\t\tslot++;\n\t\t\t}\n\t\t\t_simple_sappend(b, \"\\n\");\n\t\t}\n\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%s\\n\", _simple_string(b));\n\t\t_simple_sfree(b);\n\t}\n}\n\nvoid\nprint_tiny_region(boolean_t verbose, region_t region, size_t bytes_at_start, size_t bytes_at_end)\n{\n\tunsigned counts[1024];\n\tunsigned in_use = 0;\n\tuintptr_t start = (uintptr_t)TINY_REGION_ADDRESS(region);\n\tuintptr_t current = start + bytes_at_start;\n\tuintptr_t limit = (uintptr_t)TINY_REGION_END(region) - bytes_at_end;\n\tboolean_t is_free;\n\tmsize_t msize;\n\tunsigned ci;\n\t_SIMPLE_STRING b;\n\tuintptr_t pgTot = 0;\n\n\tif (region == HASHRING_REGION_DEALLOCATED) {\n\t\tif ((b = _simple_salloc()) != NULL) {\n\t\t\t_simple_sprintf(b, \"Tiny region [unknown address] was returned to the OS\\n\");\n\t\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%s\\n\", _simple_string(b));\n\t\t\t_simple_sfree(b);\n\t\t}\n\t\treturn;\n\t}\n\n\tmemset(counts, 0, sizeof(counts));\n\twhile (current < limit) {\n\t\tmsize = get_tiny_meta_header((void *)current, &is_free);\n\t\tif (is_free && !msize && (current == start)) {\n\t\t\t// first block is all free\n\t\t\tuintptr_t pgLo = round_page_quanta(start + sizeof(tiny_free_list_t) + sizeof(msize_t));\n\t\t\tuintptr_t pgHi = trunc_page_quanta(start + TINY_REGION_SIZE - sizeof(msize_t));\n\n\t\t\tif (pgLo < pgHi) {\n\t\t\t\tpgTot += (pgHi - pgLo);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tif (!msize) {\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** error with %p: msize=%d\\n\", (void *)current, (unsigned)msize);\n\t\t\tbreak;\n\t\t}\n\t\tif (!is_free) {\n\t\t\t// block in use\n\t\t\tif (msize > NUM_TINY_SLOTS) {\n\t\t\t\tmalloc_report(ASL_LEVEL_ERR, \"*** error at %p msize for in_use is %d\\n\", (void *)current, msize);\n\t\t\t}\n\t\t\tif (msize < 1024) {\n\t\t\t\tcounts[msize]++;\n\t\t\t}\n\t\t\tin_use++;\n\t\t} else {\n\t\t\tuintptr_t pgLo = round_page_quanta(current + sizeof(tiny_free_list_t) + sizeof(msize_t));\n\t\t\tuintptr_t pgHi = trunc_page_quanta(current + TINY_BYTES_FOR_MSIZE(msize) - sizeof(msize_t));\n\n\t\t\tif (pgLo < pgHi) {\n\t\t\t\tpgTot += (pgHi - pgLo);\n\t\t\t}\n\t\t}\n\t\tcurrent += TINY_BYTES_FOR_MSIZE(msize);\n\t}\n\tif ((b = _simple_salloc()) != NULL) {\n\t\t_simple_sprintf(b, \"Tiny region [%p-%p, %y] \\t\", (void *)start, TINY_REGION_END(region), (int)TINY_REGION_SIZE);\n\t\t_simple_sprintf(b, \"Magazine=%d \\t\", MAGAZINE_INDEX_FOR_TINY_REGION(region));\n\t\t_simple_sprintf(b, \"Allocations in use=%d \\t Bytes in use=%ly \\t\", in_use, BYTES_USED_FOR_TINY_REGION(region));\n\t\tif (bytes_at_end || bytes_at_start) {\n\t\t\t_simple_sprintf(b, \"Untouched=%ly \", bytes_at_end + bytes_at_start);\n\t\t}\n\t\tif (DEPOT_MAGAZINE_INDEX == MAGAZINE_INDEX_FOR_TINY_REGION(region)) {\n\t\t\t_simple_sprintf(b, \"Advised MADV_FREE=%ly\", pgTot);\n\t\t} else {\n\t\t\t_simple_sprintf(b, \"Fragments subject to reclamation=%ly\", pgTot);\n\t\t}\n\t\tif (verbose && in_use) {\n\t\t\t_simple_sappend(b, \"\\n\\tSizes in use: \");\n\t\t\tfor (ci = 0; ci < 1024; ci++) {\n\t\t\t\tif (counts[ci]) {\n\t\t\t\t\t_simple_sprintf(b, \"%d[%d] \", TINY_BYTES_FOR_MSIZE(ci), counts[ci]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmalloc_report(MALLOC_REPORT_NOLOG | MALLOC_REPORT_NOPREFIX, \"%s\\n\", _simple_string(b));\n\t\t_simple_sfree(b);\n\t}\n}\n\nstatic char *tiny_freelist_fail_msg = \"check: tiny free list incorrect \";\n\n#define TINY_FREELIST_FAIL(fmt, ...) \\\n\tmalloc_zone_check_fail(tiny_freelist_fail_msg, \\\n\t\t\t\" (slot=%u), counter=%d\\n\" fmt, slot, counter, __VA_ARGS__);\n\nboolean_t\ntiny_free_list_check(rack_t *rack, grain_t slot, unsigned counter)\n{\n\tmag_index_t mag_index;\n\n\tfor (mag_index = -1; mag_index < rack->num_magazines; mag_index++) {\n\t\tmagazine_t *tiny_mag_ptr = &(rack->magazines[mag_index]);\n\t\tSZONE_MAGAZINE_PTR_LOCK(tiny_mag_ptr);\n\n\t\tunsigned count = 0;\n\t\ttiny_free_list_t *ptr = rack->magazines[mag_index].mag_free_list[slot].p;\n\t\tboolean_t is_free;\n\t\ttiny_free_list_t *previous = NULL;\n\n\t\twhile (ptr) {\n\t\t\tis_free = tiny_meta_header_is_free(ptr);\n\t\t\tif (!is_free) {\n\t\t\t\tTINY_FREELIST_FAIL(\"*** in-use ptr in free list slot=%u count=%d ptr=%p\\n\", slot, count, ptr);\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (((uintptr_t)ptr) & (TINY_QUANTUM - 1)) {\n\t\t\t\tTINY_FREELIST_FAIL(\"*** unaligned ptr in free list slot=%u count=%d ptr=%p\\n\", slot, count, ptr);\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (!tiny_region_for_ptr_no_lock(rack, ptr)) {\n\t\t\t\tTINY_FREELIST_FAIL(\"*** ptr not in szone slot=%d count=%u ptr=%p\\n\", slot, count, ptr);\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (free_list_unchecksum_ptr(rack, &ptr->previous) != previous) {\n\t\t\t\tTINY_FREELIST_FAIL(\"*** previous incorrectly set slot=%u count=%d ptr=%p\\n\", slot, count, ptr);\n\t\t\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tprevious = ptr;\n\t\t\tptr = free_list_unchecksum_ptr(rack, &ptr->next);\n\t\t\tcount++;\n\t\t}\n\t\t\n\t\tSZONE_MAGAZINE_PTR_UNLOCK(tiny_mag_ptr);\n\t}\n\treturn 1;\n}\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magazine_zone.h",
"content": "/*\n * Copyright (c) 2015 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#ifndef __MAGAZINE_ZONE_H\n#define __MAGAZINE_ZONE_H\n\n/*********************\tDEFINITIONS\t************************/\n\n// Out-of-band free list entry. Out-of-band free list entries are used\n// in specific cases where a free-list entry is the *only* data on a given page,\n// and the presence of that entry causes the page to stay dirty.\n//\n// `ptr` is all 16-bit quantum-sized index and packed, as that references a\n// block address inside the current region. `next` and `prev` have to be pointer\n// sized references, as these values can point to entries outside the current\n// region, so it's not safe to compact them.\ntypedef struct {\n\tuintptr_t prev;\n\tuintptr_t next;\n\tuint16_t ptr;\n} MALLOC_PACKED oob_free_entry_s, *oob_free_entry_t;\n\n// In-place free list entry. Unlike the out-of-band entry, the in-place entries\n// are stored at the start of the range that has been freed.\ntypedef struct _inplace_free_entry_s *inplace_free_entry_t;\n\ntypedef struct {\n\tvoid *ptr;\n\tuint8_t checksum;\n} inplace_linkage_s;\n\ntypedef union {\n\tinplace_free_entry_t p;\n\tuintptr_t u;\n} inplace_union;\n\ntypedef struct _inplace_free_entry_s {\n\tinplace_union previous;\n\tinplace_union next;\n} inplace_free_entry_s, *inplace_free_entry_t;\n\n#ifdef __LP64__\nMALLOC_STATIC_ASSERT(sizeof(inplace_free_entry_s) == 16, \"inplace free list must be 16-bytes long\");\n#else\nMALLOC_STATIC_ASSERT(sizeof(inplace_free_entry_s) == 8, \"inplace free list must be 8-bytes long\");\n#endif\n\ntypedef struct _small_inplace_free_entry_s {\n\tinplace_linkage_s previous;\n\tinplace_linkage_s next;\n} small_inplace_free_entry_s, *small_inplace_free_entry_t;\n\ntypedef union {\n\tsmall_inplace_free_entry_t small_inplace;\n\tinplace_free_entry_t inplace;\n\toob_free_entry_t oob;\n\tvoid *p;\n} free_list_t;\n\ntypedef struct {\n\tinplace_union previous;\n\tinplace_union next;\n} tiny_free_list_t;\n\ntypedef unsigned int grain_t; // N.B. wide enough to index all free slots\n\ntypedef int mag_index_t;\n\n#define CHECK_REGIONS (1 << 31)\n#define DISABLE_ASLR (1 << 30)\n\n#define MAX_RECORDER_BUFFER 256\n\n/*********************\tDEFINITIONS for tiny\t************************/\n\n/*\n * Memory in the Tiny range is allocated from regions (heaps) pointed to by the\n * szone's hashed_regions pointer.\n *\n * Each region is laid out as a heap, followed by a header block, all within\n * a 1MB (2^20) block. This means there are 64520 16-byte blocks and the header\n * is 16138 bytes, making the total 1048458 bytes, leaving 118 bytes unused.\n *\n * The header block is arranged as in struct tiny_region defined just below, and\n * consists of two bitfields (or bit arrays) interleaved 32 bits by 32 bits.\n *\n * Each bitfield comprises NUM_TINY_BLOCKS bits, and refers to the corresponding\n * TINY_QUANTUM block within the heap.\n *\n * The bitfields are used to encode the state of memory within the heap. The header bit indicates\n * that the corresponding quantum is the first quantum in a block (either in use or free). The\n * in-use bit is set for the header if the block has been handed out (allocated). If the header\n * bit is not set, the in-use bit is invalid.\n *\n * The szone maintains an array of NUM_TINY_SLOTS freelists, each of which is used to hold\n * free objects of the corresponding quantum size.\n *\n * A free block is laid out depending on its size, in order to fit all free\n * blocks in 16 bytes, on both 32 and 64 bit platforms. One quantum blocks do\n * not store their size in the block, instead relying on the header information\n * to determine their size. Blocks of two or more quanta have room to store\n * their size in the block, and store it both after the 'next' pointer, and in\n * the last 2 bytes of the block.\n *\n * 1-quantum block\n * Offset (32-bit mode)\t(64-bit mode)\n * 0x0 0x0 : previous\n * 0x4 0x08 : next\n * end end\n *\n * >1-quantum block\n * Offset (32-bit mode)\t(64-bit mode)\n * 0x0 0x0 : previous\n * 0x4 0x08 : next\n * 0x8 0x10 : size (in quantum counts)\n * end - 2 end - 2 : size (in quantum counts)\n * end end\n *\n * All fields are pointer-sized, except for the size which is an unsigned short.\n *\n */\n\n#define FOLLOWING_TINY_PTR(ptr, msize) (((unsigned char *)(ptr)) + ((msize) << SHIFT_TINY_QUANTUM))\n\n#define TINY_BLOCKS_ALIGN (SHIFT_TINY_CEIL_BLOCKS + SHIFT_TINY_QUANTUM) // 20\n\n#define TINY_ENTROPY_BITS 15\n#define TINY_ENTROPY_MASK ((1 << TINY_ENTROPY_BITS) - 1)\n\n/*\n * Avoid having so much entropy that the end of a valid tiny allocation\n * might overrun the end of the tiny region.\n */\n#if TINY_ENTROPY_MASK + NUM_TINY_SLOTS > NUM_TINY_BLOCKS\n#error Too many entropy bits for tiny region requested\n#endif\n\n/*\n * Enough room for the data, followed by the bit arrays (2-bits per block)\n * plus rounding to the nearest page.\n */\n#define CEIL_NUM_TINY_BLOCKS_WORDS (((NUM_TINY_BLOCKS + 31) & ~31) >> 5)\n#define TINY_METADATA_SIZE (sizeof(region_trailer_t) + sizeof(tiny_header_inuse_pair_t) * CEIL_NUM_TINY_BLOCKS_WORDS)\n#define TINY_REGION_SIZE ((NUM_TINY_BLOCKS * TINY_QUANTUM + TINY_METADATA_SIZE + PAGE_MAX_SIZE - 1) & ~(PAGE_MAX_SIZE - 1))\n\n#define TINY_METADATA_START (NUM_TINY_BLOCKS * TINY_QUANTUM)\n\n/*\n * Beginning and end pointers for a region's heap.\n */\n#define TINY_REGION_ADDRESS(region) ((void *)(region))\n#define TINY_REGION_END(region) ((void *)(((uintptr_t)(region)) + (NUM_TINY_BLOCKS * TINY_QUANTUM)))\n\n/*\n * Locate the heap base for a pointer known to be within a tiny region.\n */\n#define TINY_REGION_FOR_PTR(_p) ((void *)((uintptr_t)(_p) & ~((1 << TINY_BLOCKS_ALIGN) - 1)))\n\n/*\n * Convert between byte and msize units.\n */\n#define TINY_BYTES_FOR_MSIZE(_m) ((_m) << SHIFT_TINY_QUANTUM)\n#define TINY_MSIZE_FOR_BYTES(_b) ((_b) >> SHIFT_TINY_QUANTUM)\n\n#if MALLOC_TARGET_64BIT\n#define TINY_FREE_SIZE(ptr) (((msize_t *)(ptr))[8])\n#else // MALLOC_TARGET_64BIT\n#define TINY_FREE_SIZE(ptr) (((msize_t *)(ptr))[4])\n#endif // MALLOC_TARGET_64BIT\n#define TINY_PREVIOUS_MSIZE(ptr) ((msize_t *)(ptr))[-1]\n\n/*\n * Layout of a tiny region\n */\ntypedef uint32_t tiny_block_t[4]; // assert(TINY_QUANTUM == sizeof(tiny_block_t))\n\ntypedef struct tiny_header_inuse_pair {\n\tuint32_t header;\n\tuint32_t inuse;\n} tiny_header_inuse_pair_t;\n\ntypedef struct region_trailer {\n\tstruct region_trailer *prev;\n\tstruct region_trailer *next;\n\tboolean_t recirc_suitable;\n\tvolatile int pinned_to_depot;\n\tunsigned bytes_used;\n\tmag_index_t mag_index;\n} region_trailer_t;\n\ntypedef struct tiny_region {\n\ttiny_block_t blocks[NUM_TINY_BLOCKS];\n\n\tregion_trailer_t trailer;\n\n\t// The interleaved bit arrays comprising the header and inuse bitfields.\n\t// The unused bits of each component in the last pair will be initialized to sentinel values.\n\ttiny_header_inuse_pair_t pairs[CEIL_NUM_TINY_BLOCKS_WORDS];\n\n\tuint8_t pad[TINY_REGION_SIZE - (NUM_TINY_BLOCKS * sizeof(tiny_block_t)) - TINY_METADATA_SIZE];\n} * tiny_region_t;\n\n/*\n * Per-region meta data for tiny allocator\n */\n#define REGION_TRAILER_FOR_TINY_REGION(r) (&(((tiny_region_t)(r))->trailer))\n#define MAGAZINE_INDEX_FOR_TINY_REGION(r) (REGION_TRAILER_FOR_TINY_REGION(r)->mag_index)\n#define BYTES_USED_FOR_TINY_REGION(r) (REGION_TRAILER_FOR_TINY_REGION(r)->bytes_used)\n\n/*\n * Locate the block header for a pointer known to be within a tiny region.\n */\n#define TINY_BLOCK_HEADER_FOR_PTR(_p) ((void *)&(((tiny_region_t)TINY_REGION_FOR_PTR(_p))->pairs))\n\n/*\n * Locate the inuse map for a given block header pointer.\n */\n#define TINY_INUSE_FOR_HEADER(_h) ((void *)&(((tiny_header_inuse_pair_t *)(_h))->inuse))\n\n/*\n * Compute the bitmap index for a pointer known to be within a tiny region.\n */\n#define TINY_INDEX_FOR_PTR(_p) (((uintptr_t)(_p) >> SHIFT_TINY_QUANTUM) & (NUM_TINY_CEIL_BLOCKS - 1))\n\n/*\n * Offset back to an szone_t given prior knowledge that this rack_t\n * is contained within an szone_t.\n *\n * Note: the only place this is used, the dtrace probes, only occurs\n * when the rack has been set up inside a scalable zone. Should\n * this ever be used somewhere that this does not hold true\n * (say, the test cases) then the pointer returned will be junk.\n */\n#define TINY_SZONE_FROM_RACK(_r) \\\n\t\t(szone_t *)((uintptr_t)(_r) - offsetof(struct szone_s, tiny_rack))\n\n\n#if !CONFIG_TINY_CACHE\n#warning CONFIG_TINY_CACHE turned off\n#endif\n\n#define TINY_REGION_PAYLOAD_BYTES (NUM_TINY_BLOCKS * TINY_QUANTUM)\n\n/*********************\tDEFINITIONS for small\t************************/\n\n/*\n * Memory in the Small range is allocated from regions (heaps) pointed to by the szone's hashed_regions\n * pointer.\n *\n * Each region is laid out as a heap, followed by the metadata array, all within an 8MB (2^23) block.\n * The array is arranged as an array of shorts, one for each SMALL_QUANTUM in the heap. There are \n * 16319 512-blocks and the array is 16319*2 bytes, which totals 8387966, leaving 642 bytes unused. \n * Once the region trailer is accounted for, there is room for 61 out-of-band free list entries in \n * the remaining padding (or 6, if the region was split into 16320 blocks, not 16319).\n *\n * The 16-bit shorts in the region are used for allocation metadata. The MSB bit marks a block as\n * either free, or not. The remaining 15-bits give the size of the allocation, defined in \"msize\", the\n * quantum-shifted size of the allocation.\n *\n * The metadata table either:\n *\n * 1. Stores the allocation size in the first short for the block, with the MSB cleared to indicate\n * that the block is allocated and in-use, or,\n *\n * 2. Stores the free-allocation size in the first and last shorts for the block, with the MSB set\n * in both places to indicate that the block is freed. (Storing the range in last block allows\n * for coalescing of adjacent free entries).\n *\n * 3. Zero, or \"middle\", meaning that this block in the region is not the start or end of an\n * allocated block.\n *\n * The small zone represents the free list in one of two ways:\n *\n * 1. In-line free list entries. These are stored at the starting address of the just-freed memory\n * and both the previous and next pointer are checksummed to attempt to detect use-after-free\n * writes.\n *\n * An in-line free list entry is laid out as:\n * |prev (uintptr_t)|checksum (uint8_t)|next (uintptr_t)|checksum (uint8_t)\n *\n * 2. Out-of-band free list entries. These utilitise the remaining padding in the 8mb region that\n * follows the blocks, metadata and region trailer. Out-of-band entries are used *iff* the\n * freed address lies on a page boundary and the freed region spans more than a page. If we were\n * to store the free list entry in-line in that memory, it would keep the entire page dirty, \n * so an out-of-band entry is used.\n *\n * An out-of-band free list entry is laid out as:\n * |prev (uintptr_t)|next (uintptr_t)|ptr (uint16_t)|\n *\n * The szone maintains an array of 32 freelists, each of which is used to hold free objects\n * of the corresponding quantum size.\n */\n\n#define SMALL_IS_FREE (1 << 15)\n#define FOLLOWING_SMALL_PTR(ptr, msize) (((unsigned char *)(ptr)) + ((msize) << SHIFT_SMALL_QUANTUM))\n\n/*\n * SMALL_IS_OOB is used mark to the MSB of OOB free list entries to show that they are in use, and \n * distinguish them from their initial, empty, state.\n */\n#define SMALL_IS_OOB (1 << 15)\n\n#define SMALL_ENTROPY_BITS 13\n#define SMALL_ENTROPY_MASK ((1 << SMALL_ENTROPY_BITS) - 1)\n\n/*\n * Avoid having so much entropy that the end of a valid small allocation\n * might overrun the end of the small region.\n */\n#if SMALL_ENTROPY_MASK + NUM_SMALL_SLOTS > NUM_SMALL_BLOCKS\n#error Too many entropy bits for small region requested\n#endif\n\n#define SMALL_METADATA_SIZE (sizeof(region_trailer_t) + NUM_SMALL_BLOCKS * sizeof(msize_t))\n#define SMALL_REGION_SIZE ((NUM_SMALL_BLOCKS * SMALL_QUANTUM + SMALL_METADATA_SIZE + PAGE_MAX_SIZE - 1) & ~(PAGE_MAX_SIZE - 1))\n\n#define SMALL_METADATA_START (NUM_SMALL_BLOCKS * SMALL_QUANTUM)\n\n/*\n * Beginning and end pointers for a region's heap.\n */\n#define SMALL_REGION_ADDRESS(region) ((unsigned char *)region)\n#define SMALL_REGION_END(region) (SMALL_REGION_ADDRESS(region) + (NUM_SMALL_BLOCKS * SMALL_QUANTUM))\n\n/*\n * Locate the heap base for a pointer known to be within a small region.\n */\n#define SMALL_REGION_FOR_PTR(_p) ((void *)((uintptr_t)(_p) & ~((1 << SMALL_BLOCKS_ALIGN) - 1)))\n#define SMALL_OFFSET_FOR_PTR(_p) ((uintptr_t)(_p) & ((1 << SMALL_BLOCKS_ALIGN) - 1))\n\n/*\n * Convert between byte and msize units.\n */\n#define SMALL_BYTES_FOR_MSIZE(_m) ((uint32_t)(_m) << SHIFT_SMALL_QUANTUM)\n#define SMALL_MSIZE_FOR_BYTES(_b) ((_b) >> SHIFT_SMALL_QUANTUM)\n\n#define SMALL_PREVIOUS_MSIZE(ptr) (*SMALL_METADATA_FOR_PTR(ptr - 1) & ~SMALL_IS_FREE)\n\n/*\n * Convert from msize unit to free list slot.\n */\n#define SMALL_FREE_SLOT_COUNT(_r) \\\n\t\t(((_r)->debug_flags & MALLOC_EXTENDED_SMALL_SLOTS) ? \\\n\t\t\t\tNUM_SMALL_SLOTS_LARGEMEM + 1 : NUM_SMALL_SLOTS + 1)\n#define SMALL_FREE_SLOT_FOR_MSIZE(_r, _m) \\\n\t\t(((_m) <= SMALL_FREE_SLOT_COUNT(_r)) ? ((_m) - 1) : (SMALL_FREE_SLOT_COUNT(_r) - 1))\n/* compare with MAGAZINE_FREELIST_BITMAP_WORDS */\n#define SMALL_FREELIST_BITMAP_WORDS(_r) ((SMALL_FREE_SLOT_COUNT(_r) + 31) >> 5)\n\n/*\n * Offset back to an szone_t given prior knowledge that this rack_t\n * is contained within an szone_t.\n *\n * Note: the only place this is used, the dtrace probes, only occurs\n * when the rack has been set up inside a scalable zone. Should\n * this ever be used somewhere that this does not hold true\n * (say, the test cases) then the pointer returned will be junk.\n */\n#define SMALL_SZONE_FROM_RACK(_r) \\\n\t\t(szone_t *)((uintptr_t)(_r) - offsetof(struct szone_s, small_rack))\n\n/*\n * Layout of a small region\n */\ntypedef uint32_t small_block_t[SMALL_QUANTUM / sizeof(uint32_t)];\n#define SMALL_HEAP_SIZE (NUM_SMALL_BLOCKS * sizeof(small_block_t))\n#define SMALL_OOB_COUNT ((SMALL_REGION_SIZE - SMALL_HEAP_SIZE - SMALL_METADATA_SIZE) / sizeof(oob_free_entry_s))\n#define SMALL_OOB_SIZE (SMALL_OOB_COUNT * sizeof(oob_free_entry_s))\n#define SMALL_REGION_PAD (SMALL_REGION_SIZE - SMALL_HEAP_SIZE - SMALL_METADATA_SIZE - SMALL_OOB_SIZE)\n\ntypedef struct small_region {\n\tsmall_block_t blocks[NUM_SMALL_BLOCKS];\n\tregion_trailer_t trailer;\n\tmsize_t small_meta_words[NUM_SMALL_BLOCKS];\n\toob_free_entry_s small_oob_free_entries[SMALL_OOB_COUNT];\n\tuint8_t pad[SMALL_REGION_PAD];\n} * small_region_t;\n\n// The layout described above should result in a small_region_t being 8MB.\nMALLOC_STATIC_ASSERT(sizeof(struct small_region) == 8388608, \"incorrect small_region_size\");\n\n/*\n * Per-region meta data for small allocator\n */\n#define REGION_TRAILER_FOR_SMALL_REGION(r) (&(((small_region_t)(r))->trailer))\n#define MAGAZINE_INDEX_FOR_SMALL_REGION(r) (REGION_TRAILER_FOR_SMALL_REGION(r)->mag_index)\n#define BYTES_USED_FOR_SMALL_REGION(r) (REGION_TRAILER_FOR_SMALL_REGION(r)->bytes_used)\n\n/*\n * Locate the metadata base for a pointer known to be within a small region.\n */\n#define SMALL_META_HEADER_FOR_PTR(_p) (((small_region_t)SMALL_REGION_FOR_PTR(_p))->small_meta_words)\n\n/*\n * Compute the metadata index for a pointer known to be within a small region.\n */\n#define SMALL_META_INDEX_FOR_PTR(_p) (((uintptr_t)(_p) >> SHIFT_SMALL_QUANTUM) & (NUM_SMALL_CEIL_BLOCKS - 1))\n\n/*\n * Find the metadata word for a pointer known to be within a small region.\n */\n#define SMALL_METADATA_FOR_PTR(_p) (SMALL_META_HEADER_FOR_PTR(_p) + SMALL_META_INDEX_FOR_PTR(_p))\n\n/*\n * Determine whether a pointer known to be within a small region points to memory which is free.\n */\n#define SMALL_PTR_IS_FREE(_p) (*SMALL_METADATA_FOR_PTR(_p) & SMALL_IS_FREE)\n\n/*\n * Extract the msize value for a pointer known to be within a small region.\n */\n#define SMALL_PTR_SIZE(_p) (*SMALL_METADATA_FOR_PTR(_p) & ~SMALL_IS_FREE)\n\n#if !CONFIG_SMALL_CACHE\n#warning CONFIG_SMALL_CACHE turned off\n#endif\n\n#define SMALL_REGION_PAYLOAD_BYTES (NUM_SMALL_BLOCKS * SMALL_QUANTUM)\n\n/************************* DEFINITIONS for large ****************************/\n\n\ntypedef struct large_entry_s {\n\tvm_address_t address;\n\tvm_size_t size;\n\tboolean_t did_madvise_reusable;\n} large_entry_t;\n\n#if !CONFIG_LARGE_CACHE && DEBUG_MALLOC\n#warning CONFIG_LARGE_CACHE turned off\n#endif\n\n/*******************************************************************************\n * Per-processor magazine for tiny and small allocators\n ******************************************************************************/\n\ntypedef struct magazine_s { // vm_allocate()'d, so the array of magazines is page-aligned to begin with.\n\t// Take magazine_lock first, Depot lock when needed for recirc, then szone->{tiny,small}_regions_lock when needed for alloc\n\t_malloc_lock_s magazine_lock MALLOC_CACHE_ALIGN;\n\t// Protection for the crtical section that does allocate_pages outside the magazine_lock\n\tvolatile boolean_t alloc_underway;\n\n\t// One element deep \"death row\", optimizes malloc/free/malloc for identical size.\n\tvoid *mag_last_free;\n\tmsize_t mag_last_free_msize;\t// msize for mag_last_free\n#if MALLOC_TARGET_64BIT\n\tuint32_t _pad;\n#endif\n\tregion_t mag_last_free_rgn; // holds the region for mag_last_free\n\n\tfree_list_t mag_free_list[MAGAZINE_FREELIST_SLOTS];\n\tuint32_t mag_bitmap[MAGAZINE_FREELIST_BITMAP_WORDS];\n\n\t// the first and last free region in the last block are treated as big blocks in use that are not accounted for\n\tsize_t mag_bytes_free_at_end;\n\tsize_t mag_bytes_free_at_start;\n\tregion_t mag_last_region; // Valid iff mag_bytes_free_at_end || mag_bytes_free_at_start > 0\n\n\t// bean counting ...\n\tsize_t mag_num_bytes_in_objects;\n\tsize_t num_bytes_in_magazine;\n\tunsigned mag_num_objects;\n\n\t// recirculation list -- invariant: all regions owned by this magazine that meet the emptiness criteria\n\t// are located nearer to the head of the list than any region that doesn't satisfy that criteria.\n\t// Doubly linked list for efficient extraction.\n\tunsigned recirculation_entries;\n\tregion_trailer_t *firstNode;\n\tregion_trailer_t *lastNode;\n\n#if MALLOC_TARGET_64BIT\n\tuintptr_t pad[320 - 14 - MAGAZINE_FREELIST_SLOTS -\n\t\t\t(MAGAZINE_FREELIST_BITMAP_WORDS + 1) / 2];\n#else\n\tuintptr_t pad[320 - 16 - MAGAZINE_FREELIST_SLOTS -\n\t\t\tMAGAZINE_FREELIST_BITMAP_WORDS];\n#endif\n\n} magazine_t;\n\n#if MALLOC_TARGET_64BIT\nMALLOC_STATIC_ASSERT(sizeof(magazine_t) == 2560, \"Incorrect padding in magazine_t\");\n#else\nMALLOC_STATIC_ASSERT(sizeof(magazine_t) == 1280, \"Incorrect padding in magazine_t\");\n#endif\n\n#define TINY_MAX_MAGAZINES 64 /* MUST BE A POWER OF 2! */\n#define TINY_MAGAZINE_PAGED_SIZE \\\n\t(((sizeof(magazine_t) * (TINY_MAX_MAGAZINES + 1)) + vm_page_quanta_size - 1) & \\\n\t~(vm_page_quanta_size - 1)) /* + 1 for the Depot */\n\n#define SMALL_MAX_MAGAZINES 64 /* MUST BE A POWER OF 2! */\n#define SMALL_MAGAZINE_PAGED_SIZE \\\n\t(((sizeof(magazine_t) * (SMALL_MAX_MAGAZINES + 1)) + vm_page_quanta_size - 1) & \\\n\t~(vm_page_quanta_size - 1)) /* + 1 for the Depot */\n\n#define DEPOT_MAGAZINE_INDEX -1\n\n/****************************** zone itself ***********************************/\n\n/*\n * Note that objects whose adddress are held in pointers here must be pursued\n * individually in the {tiny,small}_in_use_enumeration() routines. See for\n * example the treatment of region_hash_generation and tiny_magazines below.\n */\n\ntypedef struct szone_s {\t // vm_allocate()'d, so page-aligned to begin with.\n\tmalloc_zone_t basic_zone; // first page will be given read-only protection\n\tuint8_t pad[PAGE_MAX_SIZE - sizeof(malloc_zone_t)];\n\n\tunsigned long cpu_id_key; // unused\n\t// remainder of structure is R/W (contains no function pointers)\n\tunsigned debug_flags;\n\tvoid *log_address;\n\n\t/* Allocation racks per allocator type. */\n\tstruct rack_s tiny_rack;\n\tstruct rack_s small_rack;\n\n\t/* large objects: all the rest */\n\t_malloc_lock_s large_szone_lock MALLOC_CACHE_ALIGN; // One customer at a time for large\n\tunsigned num_large_objects_in_use;\n\tunsigned num_large_entries;\n\tlarge_entry_t *large_entries; // hashed by location; null entries don't count\n\tsize_t num_bytes_in_large_objects;\n\n#if CONFIG_LARGE_CACHE\n\tint large_entry_cache_oldest;\n\tint large_entry_cache_newest;\n\tlarge_entry_t large_entry_cache[LARGE_ENTRY_CACHE_SIZE]; // \"death row\" for large malloc/free\n\tboolean_t large_legacy_reset_mprotect;\n\tsize_t large_entry_cache_reserve_bytes;\n\tsize_t large_entry_cache_reserve_limit;\n\tsize_t large_entry_cache_bytes; // total size of death row, bytes\n#endif\n\n\t/* flag and limits pertaining to altered malloc behavior for systems with\n\t * large amounts of physical memory */\n\tunsigned is_largemem;\n\tunsigned large_threshold;\n\tunsigned vm_copy_threshold;\n\n\t/* security cookie */\n\tuintptr_t cookie;\n\n\t/* The purgeable zone constructed by create_purgeable_zone() would like to hand off tiny and small\n\t * allocations to the default scalable zone. Record the latter as the \"helper\" zone here. */\n\tstruct szone_s *helper_zone;\n\n\tboolean_t flotsam_enabled;\n} szone_t;\n\n#define SZONE_PAGED_SIZE round_page_quanta((sizeof(szone_t)))\n\n#endif // __MAGAZINE_ZONE_H\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/magmallocProvider.d",
"content": "provider magmalloc {\n\t\tprobe refreshIndex(void *, int, int);\n\t\tprobe depotRegion(void *, int, void *, int, int);\n\t\tprobe recircRegion(void *, int, void *, int, int);\n\t\tprobe allocRegion(void *, int, void *, int);\n\t\tprobe deallocRegion(void *, void *, int);\n\t\tprobe madvfreeRegion(void *, void *, void *, int);\n\t\tprobe pressureReliefBegin(void *, char *, int);\n\t\tprobe pressureReliefEnd(void *, char *, int, int);\n\t\tprobe mallocErrorBreak();\n};\n\n#pragma D attributes Evolving/Evolving/ISA provider magmalloc provider\n#pragma D attributes Private/Private/Unknown provider magmalloc module\n#pragma D attributes Private/Private/Unknown provider magmalloc function\n#pragma D attributes Evolving/Evolving/ISA provider magmalloc name\n#pragma D attributes Evolving/Evolving/ISA provider magmalloc args\n\n"
},
{
"path": "InterView-obj-isa-class/libmalloc-166.220.1/src/malloc.c",
"content": "/*\n * Copyright (c) 1999, 2000, 2003, 2005, 2008, 2012 Apple Inc. All rights reserved.\n *\n * @APPLE_LICENSE_HEADER_START@\n *\n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this\n * file.\n *\n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n *\n * @APPLE_LICENSE_HEADER_END@\n */\n\n#include \"internal.h\"\n\n#if TARGET_OS_IPHONE\n// malloc_report(ASL_LEVEL_INFO...) on iOS doesn't show up in the Xcode Console log of the device,\n// but ASL_LEVEL_NOTICE does. So raising the log level is helpful.\n#undef ASL_LEVEL_INFO\n#define ASL_LEVEL_INFO ASL_LEVEL_NOTICE\n#endif // TARGET_OS_IPHONE\n\n#define USE_SLEEP_RATHER_THAN_ABORT 0\n\n/*\n\tMAX_LITE_MALLOCS\n \n\tIf msl lite is turned on due to a memory resource exception use this value as the maximum\n\tnumber of allocations allowed before msl lite is turned off. This prevents msl lite from being\n\tenabled indefinitely if the process never reaches 100% of its jetsam limit.\n\tSee rdar://problem/25950426 for a discussion of how this number was determined.\n */\n\n#define MAX_LITE_MALLOCS 100000000\n\ntypedef void(malloc_logger_t)(uint32_t type,\n\t\tuintptr_t arg1,\n\t\tuintptr_t arg2,\n\t\tuintptr_t arg3,\n\t\tuintptr_t result,\n\t\tuint32_t num_hot_frames_to_skip);\n\nextern malloc_logger_t *__syscall_logger; // use this to set up syscall logging (e.g., vm_allocate, vm_deallocate, mmap, munmap)\n\nstatic _malloc_lock_s _malloc_lock = _MALLOC_LOCK_INIT;\n#define MALLOC_LOCK() _malloc_lock_lock(&_malloc_lock)\n#define MALLOC_TRY_LOCK() _malloc_lock_trylock(&_malloc_lock)\n#define MALLOC_UNLOCK() _malloc_lock_unlock(&_malloc_lock)\n#define MALLOC_REINIT_LOCK() _malloc_lock_init(&_malloc_lock)\n\n/* The following variables are exported for the benefit of performance tools\n *\n * It should always be safe to first read malloc_num_zones, then read\n * malloc_zones without taking the lock, if only iteration is required and\n * provided that when malloc_destroy_zone is called all prior operations on that\n * zone are complete and no further calls referencing that zone can be made.\n */\nint32_t malloc_num_zones = 0;\nint32_t malloc_num_zones_allocated = 0;\nmalloc_zone_t **malloc_zones = 0;\nmalloc_logger_t *malloc_logger = NULL;\nstatic malloc_zone_t *initial_default_zone = NULL;\n\nunsigned malloc_debug_flags = 0;\nboolean_t malloc_tracing_enabled = false;\n\nunsigned malloc_check_start = 0; // 0 means don't check\nunsigned malloc_check_counter = 0;\nunsigned malloc_check_each = 1000;\n\nstatic int malloc_check_sleep = 100; // default 100 second sleep\nstatic int malloc_check_abort = 0; // default is to sleep, not abort\n\nstatic os_once_t _malloc_initialize_pred;\n\n// Used by memory resource exceptions and enabling/disabling malloc stack logging via malloc_memory_event_handler\nstatic boolean_t warn_mode_entered = false;\nstatic boolean_t warn_mode_disable_retries = false;\nstatic stack_logging_mode_type msl_type_enabled_at_runtime = stack_logging_mode_none;\n\n/*\n * Counters that coordinate zone destruction (in malloc_zone_unregister) with\n * find_registered_zone (here abbreviated as FRZ).\n */\nstatic int32_t volatile counterAlice = 0, counterBob = 0;\nstatic int32_t volatile * volatile pFRZCounterLive = &counterAlice;\nstatic int32_t volatile * volatile pFRZCounterDrain = &counterBob;\n\nunsigned int _os_cpu_number_override = -1;\n\nstatic inline malloc_zone_t *inline_malloc_default_zone(void) __attribute__((always_inline));\n\n#define MALLOC_LOG_TYPE_ALLOCATE stack_logging_type_alloc\n#define MALLOC_LOG_TYPE_DEALLOCATE stack_logging_type_dealloc\n#define MALLOC_LOG_TYPE_HAS_ZONE stack_logging_flag_zone\n#define MALLOC_LOG_TYPE_CLEARED stack_logging_flag_cleared\n\n#define DEFAULT_MALLOC_ZONE_STRING \"DefaultMallocZone\"\n#define DEFAULT_PUREGEABLE_ZONE_STRING \"DefaultPurgeableMallocZone\"\n#define MALLOC_HELPER_ZONE_STRING \"MallocHelperZone\"\n\nMALLOC_NOEXPORT\nunsigned int phys_ncpus;\n\nMALLOC_NOEXPORT\nunsigned int logical_ncpus;\n\nMALLOC_NOEXPORT\nunsigned int hyper_shift;\n\n// Boot argument for max magazine control\nstatic const char max_magazines_boot_arg[] = \"malloc_max_magazines\";\n\n/*********\tUtilities\t************/\nstatic bool _malloc_entropy_initialized;\n\nvoid __malloc_init(const char *apple[]);\n\nstatic int\n__entropy_from_kernel(const char *str)\n{\n\tunsigned long long val;\n\tchar tmp[20], *p;\n\tint idx = 0;\n\n\t/* Skip over key to the first value */\n\tstr = strchr(str, '=');\n\tif (str == NULL) {\n\t\treturn 0;\n\t}\n\tstr++;\n\n\twhile (str && idx < sizeof(malloc_entropy) / sizeof(malloc_entropy[0])) {\n\t\tstrlcpy(tmp, str, 20);\n\t\tp = strchr(tmp, ',');\n\t\tif (p) {\n\t\t\t*p = '\\0';\n\t\t}\n\t\tval = strtoull_l(tmp, NULL, 0, NULL);\n\t\tmalloc_entropy[idx] = (uint64_t)val;\n\t\tidx++;\n\t\tif ((str = strchr(str, ',')) != NULL) {\n\t\t\tstr++;\n\t\t}\n\t}\n\treturn idx;\n}\n\nstatic void\n__malloc_init_from_bootargs(const char *bootargs)\n{\n\t// The maximum number of magazines can be set either via a\n\t// boot argument or from the environment. Get the boot argument value\n\t// here and store it. We can't bounds check it until we have phys_ncpus,\n\t// which happens later in _malloc_initialize(), along with handling\n\t// of the environment value setting.\n\tchar value_buf[256];\n\tconst char *flag = malloc_common_value_for_key_copy(bootargs,\n\t\t\tmax_magazines_boot_arg, value_buf, sizeof(value_buf));\n\tif (flag) {\n\t\tconst char *endp;\n\t\tlong value = malloc_common_convert_to_long(flag, &endp);\n\t\tif (!*endp && value >= 0) {\n\t\t\tmax_magazines = (unsigned int)value;\n\t\t} else {\n\t\t\tmalloc_report(ASL_LEVEL_ERR,\n\t\t\t\t\t\t \"malloc_max_magazines must be positive - ignored.\\n\");\n\t\t}\n\t}\n}\n\n/* TODO: Investigate adding _malloc_initialize() into this libSystem initializer */\nvoid\n__malloc_init(const char *apple[])\n{\n\t// We could try to be clever and cater for arbitrary length bootarg\n\t// strings, but it's probably not worth it, especially as we would need\n\t// to temporarily allocate at least a page of memory to read the bootargs\n\t// into.\n\tchar bootargs[1024] = { '\\0' };\n\tsize_t len = sizeof(bootargs) - 1;\n\tif (!sysctlbyname(\"kern.bootargs\", bootargs, &len, NULL, 0) && len > 0) {\n\t\tbootargs[len + 1] = '\\0';\n\t}\n\n#if CONFIG_NANOZONE\n\t// TODO: envp should be passed down from Libsystem\n\tconst char **envp = (const char **)*_NSGetEnviron();\n\tnano_common_init(envp, apple, bootargs);\n#endif\n\n\tconst char **p;\n\tfor (p = apple; p && *p; p++) {\n\t\tif (strstr(*p, \"malloc_entropy\") == *p) {\n\t\t\tint count = __entropy_from_kernel(*p);\n\t\t\tbzero((void *)*p, strlen(*p));\n\n\t\t\tif (sizeof(malloc_entropy) / sizeof(malloc_entropy[0]) == count) {\n\t\t\t\t_malloc_entropy_initialized = true;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (!_malloc_entropy_initialized) {\n\t\tgetentropy((void*)malloc_entropy, sizeof(malloc_entropy));\n\t\t_malloc_entropy_initialized = true;\n\t}\n\n\t__malloc_init_from_bootargs(bootargs);\n\tmvm_aslr_init();\n}\n\nstatic malloc_zone_t* lite_zone = NULL;\n\nMALLOC_ALWAYS_INLINE\nstatic inline malloc_zone_t *\nruntime_default_zone() {\n\treturn (lite_zone) ? lite_zone : inline_malloc_default_zone();\n}\n\nstatic size_t\ndefault_zone_size(malloc_zone_t *zone, const void *ptr)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->size(zone, ptr);\n}\n\nstatic void *\ndefault_zone_malloc(malloc_zone_t *zone, size_t size)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->malloc(zone, size);\n}\n\nstatic void *\ndefault_zone_calloc(malloc_zone_t *zone, size_t num_items, size_t size)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->calloc(zone, num_items, size);\n}\n\nstatic void *\ndefault_zone_valloc(malloc_zone_t *zone, size_t size)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->valloc(zone, size);\n}\n\nstatic void\ndefault_zone_free(malloc_zone_t *zone, void *ptr)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->free(zone, ptr);\n}\n\nstatic void *\ndefault_zone_realloc(malloc_zone_t *zone, void *ptr, size_t new_size)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->realloc(zone, ptr, new_size);\n}\n\nstatic void\ndefault_zone_destroy(malloc_zone_t *zone)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->destroy(zone);\n}\n\nstatic unsigned\ndefault_zone_batch_malloc(malloc_zone_t *zone, size_t size, void **results, unsigned count)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->batch_malloc(zone, size, results, count);\n}\n\nstatic void\ndefault_zone_batch_free(malloc_zone_t *zone, void **to_be_freed, unsigned count)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->batch_free(zone, to_be_freed, count);\n}\n\nstatic void *\ndefault_zone_memalign(malloc_zone_t *zone, size_t alignment, size_t size)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->memalign(zone, alignment, size);\n}\n\nstatic void\ndefault_zone_free_definite_size(malloc_zone_t *zone, void *ptr, size_t size)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->free_definite_size(zone, ptr, size);\n}\n\nstatic size_t\ndefault_zone_pressure_relief(malloc_zone_t *zone, size_t goal)\n{\n\tzone = runtime_default_zone();\n\n\treturn zone->pressure_relief(zone, goal);\n}\n\nstatic boolean_t\ndefault_zone_malloc_claimed_address(malloc_zone_t *zone, void *ptr)\n{\n\tzone = runtime_default_zone();\n\n\treturn malloc_zone_claimed_address(zone, ptr);\n}\n\nstatic kern_return_t\ndefault_zone_ptr_in_use_enumerator(task_t task,\n\t\t\t\t\t\t\t\t void *context,\n\t\t\t\t\t\t\t\t unsigned type_mask,\n\t\t\t\t\t\t\t\t vm_address_t zone_address,\n\t\t\t\t\t\t\t\t memory_reader_t reader,\n\t\t\t\t\t\t\t\t vm_range_recorder_t recorder)\n{\n\tmalloc_zone_t *zone = runtime_default_zone();\n\t\n\treturn zone->introspect->enumerator(task, context, type_mask, (vm_address_t) zone, reader, recorder);\n}\n\nstatic size_t\ndefault_zone_good_size(malloc_zone_t *zone, size_t size)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->introspect->good_size(zone, size);\n}\n\nstatic boolean_t\ndefault_zone_check(malloc_zone_t *zone)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->introspect->check(zone);\n}\n\nstatic void\ndefault_zone_print(malloc_zone_t *zone, boolean_t verbose)\n{\n\tzone = runtime_default_zone();\n\n\treturn (void)zone->introspect->print(zone, verbose);\n}\n\nstatic void\ndefault_zone_log(malloc_zone_t *zone, void *log_address)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->introspect->log(zone, log_address);\n}\n\nstatic void\ndefault_zone_force_lock(malloc_zone_t *zone)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->introspect->force_lock(zone);\n}\n\nstatic void\ndefault_zone_force_unlock(malloc_zone_t *zone)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->introspect->force_unlock(zone);\n}\n\nstatic void\ndefault_zone_statistics(malloc_zone_t *zone, malloc_statistics_t *stats)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->introspect->statistics(zone, stats);\n}\n\nstatic boolean_t\ndefault_zone_locked(malloc_zone_t *zone)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->introspect->zone_locked(zone);\n}\n\nstatic void\ndefault_zone_reinit_lock(malloc_zone_t *zone)\n{\n\tzone = runtime_default_zone();\n\t\n\treturn zone->introspect->reinit_lock(zone);\n}\n\nstatic struct malloc_introspection_t default_zone_introspect = {\n\tdefault_zone_ptr_in_use_enumerator,\n\tdefault_zone_good_size,\n\tdefault_zone_check,\n\tdefault_zone_print,\n\tdefault_zone_log,\n\tdefault_zone_force_lock,\n\tdefault_zone_force_unlock,\n\tdefault_zone_statistics,\n\tdefault_zone_locked,\n\tNULL,\n\tNULL,\n\tNULL,\n\tNULL,\n\tdefault_zone_reinit_lock\n};\n\ntypedef struct {\n\tmalloc_zone_t malloc_zone;\n\tuint8_t pad[PAGE_MAX_SIZE - sizeof(malloc_zone_t)];\n} virtual_default_zone_t;\n\nstatic virtual_default_zone_t virtual_default_zone\n__attribute__((section(\"__DATA,__v_zone\")))\n__attribute__((aligned(PAGE_MAX_SIZE))) = {\n\tNULL,\n\tNULL,\n\tdefault_zone_size,\n\tdefault_zone_malloc,\n\tdefault_zone_calloc,\n\tdefault_zone_valloc,\n\tdefault_zone_free,\n\tdefault_zone_realloc,\n\tdefault_zone_destroy,\n\tDEFAULT_MALLOC_ZONE_STRING,\n\tdefault_zone_batch_malloc,\n\tdefault_zone_batch_free,\n\t&default_zone_introspect,\n\t10,\n\tdefault_zone_memalign,\n\tdefault_zone_free_definite_size,\n\tdefault_zone_pressure_relief,\n\tdefault_zone_malloc_claimed_address,\n};\n\nstatic malloc_zone_t *default_zone = &virtual_default_zone.malloc_zone;\n\nstatic boolean_t\nhas_default_zone0(void)\n{\n\tif (!malloc_zones) {\n\t\treturn false;\n\t}\n\t\n\treturn initial_default_zone == malloc_zones[0];\n}\n\nstatic inline malloc_zone_t *find_registered_zone(const void *, size_t *) __attribute__((always_inline));\nstatic inline malloc_zone_t *\nfind_registered_zone(const void *ptr, size_t *returned_size)\n{\n\t// Returns a zone which contains ptr, else NULL\n\n\tif (0 == malloc_num_zones) {\n\t\tif (returned_size) {\n\t\t\t*returned_size = 0;\n\t\t}\n\t\treturn NULL;\n\t}\n\n\t// first look in the lite zone\n\tif (lite_zone) {\n\t\tmalloc_zone_t *zone = lite_zone;\n\t\tsize_t size = zone->size(zone, ptr);\n\t\tif (size) { // Claimed by this zone?\n\t\t\tif (returned_size) {\n\t\t\t\t*returned_size = size;\n\t\t\t}\n\t\t\t// Return the virtual default zone instead of the lite zone - see \n\t\t\treturn default_zone;\n\t\t}\n\t}\n\t\n\t// The default zone is registered in malloc_zones[0]. There's no danger that it will ever be unregistered.\n\t// So don't advance the FRZ counter yet.\n\tmalloc_zone_t *zone = malloc_zones[0];\n\tsize_t size = zone->size(zone, ptr);\n\tif (size) { // Claimed by this zone?\n\t\tif (returned_size) {\n\t\t\t*returned_size = size;\n\t\t}\n\n\t\t// Asan and others replace the zone at position 0 with their own zone.\n\t\t// In that case just return that zone as they need this information.\n\t\t// Otherwise return the virtual default zone, not the actual zone in position 0.\n\t\tif (!has_default_zone0()) {\n\t\t\treturn zone;\n\t\t} else {\n\t\t\treturn default_zone;\n\t\t}\n\t}\n\n\tint32_t volatile *pFRZCounter = pFRZCounterLive; // Capture pointer to the counter of the moment\n\tOSAtomicIncrement32Barrier(pFRZCounter); // Advance this counter -- our thread is in FRZ\n\n\tunsigned index;\n\tint32_t limit = *(int32_t volatile *)&malloc_num_zones;\n\tmalloc_zone_t **zones = &malloc_zones[1];\n\n\t// From this point on, FRZ is accessing the malloc_zones[] array without locking\n\t// in order to avoid contention on common operations (such as non-default-zone free()).\n\t// In order to ensure that this is actually safe to do, register/unregister take care\n\t// to:\n\t//\n\t// 1. Register ensures that newly inserted pointers in malloc_zones[] are visible\n\t// when malloc_num_zones is incremented. At the moment, we're relying on that store\n\t// ordering to work without taking additional steps here to ensure load memory\n\t// ordering.\n\t//\n\t// 2. Unregister waits for all readers in FRZ to complete their iteration before it\n\t// returns from the unregister call (during which, even unregistered zone pointers\n\t// are still valid). It also ensures that all the pointers in the zones array are\n\t// valid until it returns, so that a stale value in limit is not dangerous.\n\n\tfor (index = 1; index < limit; ++index, ++zones) {\n\t\tzone = *zones;\n\t\tsize = zone->size(zone, ptr);\n\t\tif (size) { // Claimed by this zone?\n\t\t\tgoto out;\n\t\t}\n\t}\n\t// Unclaimed by any zone.\n\tzone = NULL;\n\tsize = 0;\nout:\n\tif (returned_size) {\n\t\t*returned_size = size;\n\t}\n\tOSAtomicDecrement32Barrier(pFRZCounter); // our thread is leaving FRZ\n\treturn zone;\n}\n\nvoid\nmalloc_error_break(void)\n{\n\t// Provides a non-inlined place for various malloc error procedures to call\n\t// that will be called after an error message appears. It does not make\n\t// sense for developers to call this function, so it is marked\n\t// hidden to prevent it from becoming API.\n\tMAGMALLOC_MALLOCERRORBREAK(); // DTrace USDT probe\n}\n\nint\nmalloc_gdb_po_unsafe(void)\n{\n\t// In order to implement \"po\" other data formatters in gdb, the debugger\n\t// calls functions that call malloc. The debugger will only run one thread\n\t// of the program in this case, so if another thread is holding a zone lock,\n\t// gdb may deadlock in this case.\n\t//\n\t// Iterate over the zones in malloc_zones, and call \"trylock\" on the zone\n\t// lock. If trylock succeeds, unlock it, otherwise return \"locked\". Returns\n\t// 0 == safe, 1 == locked/unsafe.\n\n\tif (__stack_logging_locked()) {\n\t\treturn 1;\n\t}\n\n\tmalloc_zone_t **zones = malloc_zones;\n\tunsigned i, e = malloc_num_zones;\n\n\tfor (i = 0; i != e; ++i) {\n\t\tmalloc_zone_t *zone = zones[i];\n\n\t\t// Version must be >= 5 to look at the new introspection field.\n\t\tif (zone->version < 5) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (zone->introspect->zone_locked && zone->introspect->zone_locked(zone)) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\treturn 0;\n}\n\n/*********\tCreation and destruction\t************/\n\nstatic void set_flags_from_environment(void);\n\nstatic void\nmalloc_zone_register_while_locked(malloc_zone_t *zone)\n{\n\tsize_t protect_size;\n\tunsigned i;\n\n\t/* scan the list of zones, to see if this zone is already registered. If\n\t * so, print an error message and return. */\n\tfor (i = 0; i != malloc_num_zones; ++i) {\n\t\tif (zone == malloc_zones[i]) {\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"Attempted to register zone more than once: %p\\n\", zone);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tif (malloc_num_zones == malloc_num_zones_allocated) {\n\t\tsize_t malloc_zones_size = malloc_num_zones * sizeof(malloc_zone_t *);\n\t\tmach_vm_size_t alloc_size = round_page(malloc_zones_size + vm_page_size);\n\t\tmach_vm_address_t vm_addr;\n\t\tint alloc_flags = VM_FLAGS_ANYWHERE | VM_MAKE_TAG(VM_MEMORY_MALLOC);\n\n\t\tvm_addr = vm_page_size;\n\t\tkern_return_t kr = mach_vm_allocate(mach_task_self(), &vm_addr, alloc_size, alloc_flags);\n\t\tif (kr) {\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"malloc_zone_register allocation failed: %d\\n\", kr);\n\t\t\treturn;\n\t\t}\n\n\t\tmalloc_zone_t **new_zones = (malloc_zone_t **)vm_addr;\n\t\t/* If there were previously allocated malloc zones, we need to copy them\n\t\t * out of the previous array and into the new zones array */\n\t\tif (malloc_zones) {\n\t\t\tmemcpy(new_zones, malloc_zones, malloc_zones_size);\n\t\t\tvm_addr = (mach_vm_address_t)malloc_zones;\n\t\t\tmach_vm_size_t dealloc_size = round_page(malloc_zones_size);\n\t\t\tmach_vm_deallocate(mach_task_self(), vm_addr, dealloc_size);\n\t\t}\n\n\t\t/* Update the malloc_zones pointer, which we leak if it was previously\n\t\t * allocated, and the number of zones allocated */\n\t\tprotect_size = (size_t)alloc_size;\n\t\tmalloc_zones = new_zones;\n\t\tmalloc_num_zones_allocated = (int32_t)(alloc_size / sizeof(malloc_zone_t *));\n\t} else {\n\t\t/* If we don't need to reallocate zones, we need to briefly change the\n\t\t * page protection the malloc zones to allow writes */\n\t\tprotect_size = malloc_num_zones_allocated * sizeof(malloc_zone_t *);\n\t\tmprotect(malloc_zones, protect_size, PROT_READ | PROT_WRITE);\n\t}\n\n\t/* This store-increment needs to be visible in the correct\n\t * order to any threads in find_registered_zone, such that if the incremented value\n\t * in malloc_num_zones is visible then the pointer write before it must also be visible.\n\t *\n\t * While we could be slightly more efficent here with atomic ops the cleanest way to\n\t * ensure the proper store-release operation is performed is to use OSAtomic*Barrier\n\t * to update malloc_num_zones.\n\t */\n\tmalloc_zones[malloc_num_zones] = zone;\n\tOSAtomicIncrement32Barrier(&malloc_num_zones);\n\n\t/* Finally, now that the zone is registered, disallow write access to the\n\t * malloc_zones array */\n\tmprotect(malloc_zones, protect_size, PROT_READ);\n\t//malloc_report(ASL_LEVEL_INFO, \"Registered malloc_zone %p in malloc_zones %p [%u zones, %u bytes]\\n\", zone, malloc_zones,\n\t// malloc_num_zones, protect_size);\n}\n\nstatic void\ncreate_and_insert_lite_zone_while_locked()\n{\n\tmalloc_zone_t *zone0 = malloc_zones[0];\n\t\n\tmalloc_zone_t *stack_logging_lite_zone = create_stack_logging_lite_zone(0, zone0, malloc_debug_flags);\n\tmalloc_zone_register_while_locked(stack_logging_lite_zone);\n\tmalloc_set_zone_name(stack_logging_lite_zone, MALLOC_STOCK_LOGGING_LITE_ZONE_NAME);\n\tlite_zone = stack_logging_lite_zone;\n}\n\nboolean_t\nturn_on_stack_logging(stack_logging_mode_type mode)\n{\n\tboolean_t ret = false;\n\t\n\tMALLOC_LOCK();\n\t\n\tif (!stack_logging_enable_logging) {\n\t\tif (__uniquing_table_memory_was_deleted()) {\n\t\t\t// It would great to be able re-enable even if the uniquing table has been deleted\n\t\t\t// malloc stack logging should be able to recreate the uniquing table if needed\n\t\t} else {\n\t\t\tswitch (mode) {\n\t\t\t\tcase stack_logging_mode_all:\n\t\t\t\t\t__prepare_to_log_stacks(false);\n\t\t\t\t\tmalloc_logger = __disk_stack_logging_log_stack;\n\t\t\t\t\t__syscall_logger = __disk_stack_logging_log_stack;\n\t\t\t\t\tstack_logging_mode = mode;\n\t\t\t\t\tstack_logging_enable_logging = 1;\n\t\t\t\t\tret = true;\n\t\t\t\t\t\n\t\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording malloc and VM allocation stacks to disk using standard recorder\\n\");\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase stack_logging_mode_malloc:\n\t\t\t\t\t__prepare_to_log_stacks(false);\n\t\t\t\t\tmalloc_logger = __disk_stack_logging_log_stack;\n\t\t\t\t\tstack_logging_mode = mode;\n\t\t\t\t\tstack_logging_enable_logging = 1;\n\t\t\t\t\tret = true;\n\t\t\t\t\t\n\t\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording malloc (but not VM allocation) stacks to disk using standard recorder\\n\");\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase stack_logging_mode_vm:\n\t\t\t\t\t__prepare_to_log_stacks(false);\n\t\t\t\t\t__syscall_logger = __disk_stack_logging_log_stack;\n\t\t\t\t\tstack_logging_mode = mode;\n\t\t\t\t\tstack_logging_enable_logging = 1;\n\t\t\t\t\tret = true;\n\t\t\t\t\t\n\t\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording VM allocation (but not malloc) stacks to disk using standard recorder\\n\");\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase stack_logging_mode_lite:\n\t\t\t\t\tif (!has_default_zone0()) {\n\t\t\t\t\t\tmalloc_report(ASL_LEVEL_ERR, \"zone[0] is not the normal default zone so can't turn on lite mode.\\n\", mode);\n\t\t\t\t\t\tret = false;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording malloc (and VM allocation) stacks using lite mode\\n\");\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (lite_zone) {\n\t\t\t\t\t\t\tenable_stack_logging_lite();\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (__prepare_to_log_stacks(true)) {\n\t\t\t\t\t\t\t\t__syscall_logger = __disk_stack_logging_log_stack;\n\t\t\t\t\t\t\t\tstack_logging_mode = stack_logging_mode_lite;\n\t\t\t\t\t\t\t\tstack_logging_enable_logging = 1;\n\t\t\t\t\t\t\t\t__prepare_to_log_stacks_stage2();\n\t\t\t\t\t\t\t\tcreate_and_insert_lite_zone_while_locked();\n\t\t\t\t\t\t\t\tenable_stack_logging_lite();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tret = true;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase stack_logging_mode_vmlite:\n\t\t\t\t\tif (__prepare_to_log_stacks(true)) {\n\t\t\t\t\t\t__syscall_logger = __disk_stack_logging_log_stack;\n\t\t\t\t\t\tstack_logging_mode = mode;\n\t\t\t\t\t\tstack_logging_enable_logging = 1;\n\t\t\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording VM allocation (but not malloc) stacks using lite mode\\n\");\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tdefault:\n\t\t\t\t\tmalloc_report(ASL_LEVEL_ERR, \"invalid mode %d passed to turn_on_stack_logging\\n\", mode);\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"malloc stack logging already enabled.\\n\");\n\t}\n\t\n\tMALLOC_UNLOCK();\n\t\n\treturn ret;\n}\n\nvoid\nturn_off_stack_logging()\n{\n\tMALLOC_LOCK();\n\t\n\tif (stack_logging_enable_logging) {\n\t\tswitch (stack_logging_mode) {\n\t\t\tcase stack_logging_mode_all:\n\t\t\t\tmalloc_logger = NULL;\n\t\t\t\t__syscall_logger = NULL;\n\t\t\t\tstack_logging_enable_logging = 0;\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"turning off recording malloc and VM allocation stacks to disk using standard recorder\\n\");\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase stack_logging_mode_malloc:\n\t\t\t\tmalloc_logger = NULL;\n\t\t\t\tstack_logging_enable_logging = 0;\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"turnning off recording malloc (but not VM allocation) stacks to disk using standard recorder\\n\");\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase stack_logging_mode_vm:\n\t\t\t\t__syscall_logger = NULL;\n\t\t\t\tstack_logging_enable_logging = 0;\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"turning off recording VM allocation (but not malloc) stacks to disk using standard recorder\\n\");\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase stack_logging_mode_lite:\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"turning off recording malloc (but not VM allocation) stacks using lite mode\\n\");\n\t\t\t\t\n\t\t\t\tdisable_stack_logging_lite();\n\t\t\t\tstack_logging_enable_logging = 0;\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase stack_logging_mode_vmlite:\n\t\t\t\t__syscall_logger = NULL;\n\t\t\t\tstack_logging_enable_logging = 0;\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"turning off recording VM allocation stacks using lite mode\\n\");\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tdefault:\n\t\t\t\tmalloc_report(ASL_LEVEL_ERR, \"invalid stack_logging_mode %d in turn_off_stack_logging\\n\", stack_logging_mode);\n\t\t\t\tbreak;\n\t\t}\n\t} else {\n\t\tmalloc_report(ASL_LEVEL_ERR, \"malloc stack logging not enabled.\\n\");\n\t}\n\t\n\tMALLOC_UNLOCK();\n}\n\n// To be used in _malloc_initialize_once() only, call that function instead.\nstatic void\n_malloc_initialize(void *context __unused)\n{\n\tMALLOC_LOCK();\n\tunsigned n;\n\tmalloc_zone_t *zone = NULL;\n\n\tif (!_malloc_entropy_initialized) {\n\t\t// Lazy initialization may occur before __malloc_init (rdar://27075409)\n\t\t// TODO: make this a fatal error\n\t\tmalloc_report(ASL_LEVEL_ERR, \"*** malloc was initialized without entropy\\n\");\n\t}\n\n\tphys_ncpus = *(uint8_t *)(uintptr_t)_COMM_PAGE_PHYSICAL_CPUS;\n\tlogical_ncpus = *(uint8_t *)(uintptr_t)_COMM_PAGE_LOGICAL_CPUS;\n\n\tif (0 != (logical_ncpus % phys_ncpus)) {\n\t\tMALLOC_REPORT_FATAL_ERROR(logical_ncpus % phys_ncpus,\n\t\t\t\t\"logical_ncpus %% phys_ncpus != 0\\n\");\n\t}\n\n\tswitch (logical_ncpus / phys_ncpus) {\n\tcase 1:\n\t\thyper_shift = 0;\n\t\tbreak;\n\tcase 2:\n\t\thyper_shift = 1;\n\t\tbreak;\n\tcase 4:\n\t\thyper_shift = 2;\n\t\tbreak;\n\tdefault:\n\t\tMALLOC_REPORT_FATAL_ERROR(logical_ncpus / phys_ncpus, \"logical_ncpus / phys_ncpus not 1, 2, or 4\");\n\t}\n\n\t// max_magazines may already be set from a boot argument. Make sure that it\n\t// is bounded by the number of CPUs.\n\tif (max_magazines) {\n\t\tmax_magazines = MIN(max_magazines, logical_ncpus);\n\t} else {\n\t\tmax_magazines = logical_ncpus;\n\t}\n\n\tset_flags_from_environment(); // will only set flags up to two times\n\tn = malloc_num_zones;\n\n#if CONFIG_NANOZONE\n\tnano_common_configure();\n\t\n\tmalloc_zone_t *helper_zone = create_scalable_zone(0, malloc_debug_flags);\n\n\tif (_malloc_engaged_nano == NANO_V2) {\n\t\tzone = nanov2_create_zone(helper_zone, malloc_debug_flags);\n\t} else if (_malloc_engaged_nano == NANO_V1) {\n\t\tzone = nano_create_zone(helper_zone, malloc_debug_flags);\n\t}\n\n\tif (zone) {\n\t\tmalloc_zone_register_while_locked(zone);\n\t\tmalloc_zone_register_while_locked(helper_zone);\n\n\t\t// Must call malloc_set_zone_name() *after* helper and nano are hooked together.\n\t\tmalloc_set_zone_name(zone, DEFAULT_MALLOC_ZONE_STRING);\n\t\tmalloc_set_zone_name(helper_zone, MALLOC_HELPER_ZONE_STRING);\n\t} else {\n\t\tzone = helper_zone;\n\t\tmalloc_zone_register_while_locked(zone);\n\t\tmalloc_set_zone_name(zone, DEFAULT_MALLOC_ZONE_STRING);\n\t}\n#else\n\tzone = create_scalable_zone(0, malloc_debug_flags);\n\tmalloc_zone_register_while_locked(zone);\n\tmalloc_set_zone_name(zone, DEFAULT_MALLOC_ZONE_STRING);\n#endif\n\n\tinitial_default_zone = zone;\n\n\tif (n != 0) { // make the default first, for efficiency\n\t\tunsigned protect_size = malloc_num_zones_allocated * sizeof(malloc_zone_t *);\n\t\tmalloc_zone_t *hold = malloc_zones[0];\n\n\t\tif (hold->zone_name && strcmp(hold->zone_name, DEFAULT_MALLOC_ZONE_STRING) == 0) {\n\t\t\tmalloc_set_zone_name(hold, NULL);\n\t\t}\n\n\t\tmprotect(malloc_zones, protect_size, PROT_READ | PROT_WRITE);\n\t\tmalloc_zones[0] = malloc_zones[n];\n\t\tmalloc_zones[n] = hold;\n\t\tmprotect(malloc_zones, protect_size, PROT_READ);\n\t}\n\n\t// Only setup stack logging hooks once lazy initialization is complete, the\n\t// malloc_zone calls above would otherwise initialize malloc stack logging,\n\t// which calls into malloc re-entrantly from Libc upcalls and so deadlocks\n\t// in the lazy initialization os_once(). rdar://13046853\n\tif (stack_logging_enable_logging) {\n\t\tswitch (stack_logging_mode) {\n\t\tcase stack_logging_mode_malloc:\n\t\t\tmalloc_logger = __disk_stack_logging_log_stack;\n\t\t\tbreak;\n\t\tcase stack_logging_mode_vm:\n\t\t\t__syscall_logger = __disk_stack_logging_log_stack;\n\t\t\tbreak;\n\t\tcase stack_logging_mode_all:\n\t\t\tmalloc_logger = __disk_stack_logging_log_stack;\n\t\t\t__syscall_logger = __disk_stack_logging_log_stack;\n\t\t\tbreak;\n\t\tcase stack_logging_mode_lite:\n\t\t\t__syscall_logger = __disk_stack_logging_log_stack;\n\t\t\tcreate_and_insert_lite_zone_while_locked();\n\t\t\tenable_stack_logging_lite();\n\t\t\tbreak;\n\t\tcase stack_logging_mode_vmlite:\n\t\t\t__syscall_logger = __disk_stack_logging_log_stack;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t// malloc_report(ASL_LEVEL_INFO, \"%d registered zones\\n\", malloc_num_zones);\n\t// malloc_report(ASL_LEVEL_INFO, \"malloc_zones is at %p; malloc_num_zones is at %p\\n\", (unsigned)&malloc_zones,\n\t// (unsigned)&malloc_num_zones);\n\tMALLOC_UNLOCK();\n}\n\nMALLOC_ALWAYS_INLINE\nstatic inline void\n_malloc_initialize_once(void)\n{\n\tos_once(&_malloc_initialize_pred, NULL, _malloc_initialize);\n}\n\nstatic inline malloc_zone_t *\ninline_malloc_default_zone(void)\n{\n\t_malloc_initialize_once();\n\t// malloc_report(ASL_LEVEL_INFO, \"In inline_malloc_default_zone with %d %d\\n\", malloc_num_zones, malloc_has_debug_zone);\n\treturn malloc_zones[0];\n}\n\nmalloc_zone_t *\nmalloc_default_zone(void)\n{\n\treturn default_zone;\n}\n\nstatic inline malloc_zone_t *inline_malloc_default_scalable_zone(void) __attribute__((always_inline));\nstatic inline malloc_zone_t *\ninline_malloc_default_scalable_zone(void)\n{\n\tunsigned index;\n\n\t_malloc_initialize_once();\n\t// malloc_report(ASL_LEVEL_INFO, \"In inline_malloc_default_scalable_zone with %d %d\\n\", malloc_num_zones,\n\t// malloc_has_debug_zone);\n\n\tMALLOC_LOCK();\n#if CONFIG_NANOZONE\n\tfor (index = 0; index < malloc_num_zones; ++index) {\n\t\tmalloc_zone_t *z = malloc_zones[index];\n\n\t\tif (z->zone_name && strcmp(z->zone_name, MALLOC_HELPER_ZONE_STRING) == 0) {\n\t\t\tMALLOC_UNLOCK();\n\t\t\treturn z;\n\t\t}\n\t}\n#endif\n\tfor (index = 0; index < malloc_num_zones; ++index) {\n\t\tmalloc_zone_t *z = malloc_zones[index];\n\n\t\tif (z->zone_name && strcmp(z->zone_name, DEFAULT_MALLOC_ZONE_STRING) == 0) {\n\t\t\tMALLOC_UNLOCK();\n\t\t\treturn z;\n\t\t}\n\t}\n\tMALLOC_UNLOCK();\n\n\tmalloc_report(ASL_LEVEL_ERR, \"*** malloc_default_scalable_zone() failed to find 'DefaultMallocZone'\\n\");\n\treturn NULL; // FIXME: abort() instead?\n}\n\nstatic void *\nlegacy_zeroing_large_malloc(malloc_zone_t *zone, size_t size)\n{\n\tif (size > LARGE_THRESHOLD) {\t\t\t // Leopard and earlier returned a ZFOD range, so ...\n\t\treturn default_zone_calloc(zone, 1, size); // Clear to zero always, ham-handedly touching in each page\n\t} else {\n\t\treturn default_zone_malloc(zone, size);\n\t}\n}\n\nstatic void *\nlegacy_zeroing_large_valloc(malloc_zone_t *zone, size_t size)\n{\n\tvoid *p = default_zone_valloc(zone, size);\n\n\t// Leopard and earlier returned a ZFOD range, so ...\n\tmemset(p, 0, size); // Clear to zero always, ham-handedly touching in each page\n\treturn p;\n}\n\nvoid\nzeroify_scalable_zone(malloc_zone_t *zone)\n{\n\t// this checkfix should replace the default zone's\n\t// allocation routines with the zeroing versions. Instead of getting in hot \n\t// water with the wrong zone, ensure that we're mutating the zone we expect.\n\t// \n\t// Additionally, the default_zone is no longer PROT_READ, so the two mprotect\n\t// calls that were here are no longer needed.\n\tif (zone == default_zone) {\n\t\tzone->malloc = (void *)legacy_zeroing_large_malloc;\n\t\tzone->valloc = (void *)legacy_zeroing_large_valloc;\n\t}\n}\n\n/*\n * Returns the version of the Nano allocator that's in use, or 0 if not.\n */\nint\nmalloc_engaged_nano(void)\n{\n#if CONFIG_NANOZONE\n\treturn _malloc_engaged_nano;\n#else\n\treturn 0;\n#endif\n}\n\nmalloc_zone_t *\nmalloc_default_purgeable_zone(void)\n{\n\tstatic malloc_zone_t *dpz;\n\n\tif (!dpz) {\n\t\t//\n\t\t// PR_7288598: Must pass a *scalable* zone (szone) as the helper for create_purgeable_zone().\n\t\t// Take care that the zone so obtained is not subject to interposing.\n\t\t//\n\t\tmalloc_zone_t *tmp = create_purgeable_zone(0, inline_malloc_default_scalable_zone(), malloc_debug_flags);\n\t\tmalloc_zone_register(tmp);\n\t\tmalloc_set_zone_name(tmp, DEFAULT_PUREGEABLE_ZONE_STRING);\n\t\tif (!OSAtomicCompareAndSwapPtrBarrier(NULL, tmp, (void**)&dpz)) {\n\t\t\tmalloc_destroy_zone(tmp);\n\t\t}\n\t}\n\treturn dpz;\n}\n\nstatic void\nset_flags_from_environment(void)\n{\n\tconst char *flag;\n\tchar **env = *_NSGetEnviron();\n\tchar **p;\n\tchar *c;\n\n#if __LP64__\n\tmalloc_debug_flags = MALLOC_ABORT_ON_CORRUPTION; // Set always on 64-bit processes\n#else\n\tint libSystemVersion = NSVersionOfLinkTimeLibrary(\"System\");\n\tif ((-1 != libSystemVersion) && ((libSystemVersion >> 16) < 126) /* Lion or greater */) {\n\t\tmalloc_debug_flags = 0;\n\t} else {\n\t\tmalloc_debug_flags = MALLOC_ABORT_ON_CORRUPTION;\n\t}\n#endif\n\tstack_logging_enable_logging = 0;\n\tstack_logging_dontcompact = 0;\n\tmalloc_logger = NULL;\n\tmalloc_check_start = 0;\n\tmalloc_check_each = 1000;\n\tmalloc_check_abort = 0;\n\tmalloc_check_sleep = 100;\n\t/*\n\t * Given that all environment variables start with \"Malloc\" we optimize by scanning quickly\n\t * first the environment, therefore avoiding repeated calls to getenv().\n\t * If we are setu/gid these flags are ignored to prevent a malicious invoker from changing\n\t * our behaviour.\n\t */\n\tfor (p = env; (c = *p) != NULL; ++p) {\n\t\tif (!strncmp(c, \"Malloc\", 6)) {\n\t\t\tif (issetugid()) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/*\n\t * Deny certain flags for entitled processes rdar://problem/13521742\n\t * MallocLogFile & MallocCorruptionAbort\n\t * as these provide the ability to turn *off* aborting in error cases.\n\t */\n\tbool restricted = dyld_process_is_restricted();\n\tmalloc_print_configure(restricted);\n\n\tif (c == NULL) {\n\t\treturn;\n\t}\n\n\tif (getenv(\"MallocGuardEdges\")) {\n\t\tmalloc_debug_flags |= MALLOC_ADD_GUARD_PAGES;\n\t\tmalloc_report(ASL_LEVEL_INFO, \"protecting edges\\n\");\n\t\tif (getenv(\"MallocDoNotProtectPrelude\")) {\n\t\t\tmalloc_debug_flags |= MALLOC_DONT_PROTECT_PRELUDE;\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"... but not protecting prelude guard page\\n\");\n\t\t}\n\t\tif (getenv(\"MallocDoNotProtectPostlude\")) {\n\t\t\tmalloc_debug_flags |= MALLOC_DONT_PROTECT_POSTLUDE;\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"... but not protecting postlude guard page\\n\");\n\t\t}\n\t}\n\tflag = getenv(\"MallocStackLogging\");\n\tif (!flag) {\n\t\tflag = getenv(\"MallocStackLoggingNoCompact\");\n\t\tstack_logging_dontcompact = 1;\n\t}\n\tif (flag) {\n\t\t// Set up stack logging as early as possible to catch all ensuing VM allocations,\n\t\t// including those from malloc_report and malloc zone setup. Make sure to set\n\t\t// __syscall_logger after this, because prepare_to_log_stacks() itself makes VM\n\t\t// allocations that we aren't prepared to log yet.\n\t\tboolean_t lite_or_vmlite_mode = strcmp(flag, \"lite\") == 0 || strcmp(flag, \"vmlite\") == 0;\n\t\t\n\t\t__prepare_to_log_stacks(lite_or_vmlite_mode);\n\n\t\tif (strcmp(flag, \"lite\") == 0) {\n\t\t\tstack_logging_mode = stack_logging_mode_lite;\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording malloc and VM allocation stacks using lite mode\\n\");\n\t\t} else if (strcmp(flag,\"malloc\") == 0) {\n\t\t\tstack_logging_mode = stack_logging_mode_malloc;\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording malloc (but not VM allocation) stacks to disk using standard recorder\\n\");\n\t\t} else if (strcmp(flag, \"vm\") == 0) {\n\t\t\tstack_logging_mode = stack_logging_mode_vm;\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording VM allocation (but not malloc) stacks to disk using standard recorder\\n\");\n\t\t} else if (strcmp(flag, \"vmlite\") == 0) {\n\t\t\tstack_logging_mode = stack_logging_mode_vmlite;\n\t\t\tmalloc_report(ASL_LEVEL_NOTICE, \"recording VM allocation (but not malloc) stacks using lite mode\\n\");\n\t\t} else {\n\t\t\tstack_logging_mode = stack_logging_mode_all;\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"recording malloc and VM allocation stacks to disk using standard recorder\\n\");\n\t\t}\n\t\tstack_logging_enable_logging = 1;\n\t\tif (stack_logging_dontcompact) {\n\t\t\tif (stack_logging_mode == stack_logging_mode_all || stack_logging_mode == stack_logging_mode_malloc) {\n\t\t\t\tmalloc_report(\n\t\t\t\t\t\tASL_LEVEL_INFO, \"stack logging compaction turned off; size of log files on disk can increase rapidly\\n\");\n\t\t\t} else {\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"stack logging compaction turned off; VM can increase rapidly\\n\");\n\t\t\t}\n\t\t}\n\t}\n\tif (getenv(\"MallocScribble\")) {\n\t\tmalloc_debug_flags |= MALLOC_DO_SCRIBBLE;\n\t\tmalloc_report(ASL_LEVEL_INFO, \"enabling scribbling to detect mods to free blocks\\n\");\n\t}\n\tif (getenv(\"MallocErrorAbort\")) {\n\t\tmalloc_debug_flags |= MALLOC_ABORT_ON_ERROR;\n\t\tmalloc_report(ASL_LEVEL_INFO, \"enabling abort() on bad malloc or free\\n\");\n\t}\n\tif (getenv(\"MallocTracing\")) {\n\t\tmalloc_tracing_enabled = true;\n\t}\n\n#if __LP64__\n/* initialization above forces MALLOC_ABORT_ON_CORRUPTION of 64-bit processes */\n#else\n\tflag = getenv(\"MallocCorruptionAbort\");\n\tif (!restricted && flag && (flag[0] == '0')) { // Set from an environment variable in 32-bit processes\n\t\tmalloc_debug_flags &= ~MALLOC_ABORT_ON_CORRUPTION;\n\t} else if (flag) {\n\t\tmalloc_debug_flags |= MALLOC_ABORT_ON_CORRUPTION;\n\t}\n#endif\n\tflag = getenv(\"MallocCheckHeapStart\");\n\tif (flag) {\n\t\tmalloc_check_start = (unsigned)strtoul(flag, NULL, 0);\n\t\tif (malloc_check_start == 0) {\n\t\t\tmalloc_check_start = 1;\n\t\t}\n\t\tif (malloc_check_start == -1) {\n\t\t\tmalloc_check_start = 1;\n\t\t}\n\t\tflag = getenv(\"MallocCheckHeapEach\");\n\t\tif (flag) {\n\t\t\tmalloc_check_each = (unsigned)strtoul(flag, NULL, 0);\n\t\t\tif (malloc_check_each == 0) {\n\t\t\t\tmalloc_check_each = 1;\n\t\t\t}\n\t\t\tif (malloc_check_each == -1) {\n\t\t\t\tmalloc_check_each = 1;\n\t\t\t}\n\t\t}\n\t\tmalloc_report(ASL_LEVEL_INFO, \"checks heap after operation #%d and each %d operations\\n\", malloc_check_start, malloc_check_each);\n\t\tflag = getenv(\"MallocCheckHeapAbort\");\n\t\tif (flag) {\n\t\t\tmalloc_check_abort = (unsigned)strtol(flag, NULL, 0);\n\t\t}\n\t\tif (malloc_check_abort) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"will abort on heap corruption\\n\");\n\t\t} else {\n\t\t\tflag = getenv(\"MallocCheckHeapSleep\");\n\t\t\tif (flag) {\n\t\t\t\tmalloc_check_sleep = (unsigned)strtol(flag, NULL, 0);\n\t\t\t}\n\t\t\tif (malloc_check_sleep > 0) {\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"will sleep for %d seconds on heap corruption\\n\", malloc_check_sleep);\n\t\t\t} else if (malloc_check_sleep < 0) {\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"will sleep once for %d seconds on heap corruption\\n\", -malloc_check_sleep);\n\t\t\t} else {\n\t\t\t\tmalloc_report(ASL_LEVEL_INFO, \"no sleep on heap corruption\\n\");\n\t\t\t}\n\t\t}\n\t}\n\n\tflag = getenv(\"MallocMaxMagazines\");\n\tif (flag) {\n\t\tint value = (unsigned)strtol(flag, NULL, 0);\n\t\tif (value == 0) {\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"Maximum magazines defaulted to %d\\n\", max_magazines);\n\t\t} else if (value < 0) {\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"MallocMaxMagazines must be positive - ignored.\\n\");\n\t\t} else if (value > logical_ncpus) {\n\t\t\tmax_magazines = logical_ncpus;\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"Maximum magazines limited to number of logical CPUs (%d)\\n\", max_magazines);\n\t\t} else {\n\t\t\tmax_magazines = value;\n\t\t\tmalloc_report(ASL_LEVEL_INFO, \"Maximum magazines set to %d\\n\", max_magazines);\n\t\t}\n\t}\n#if CONFIG_RECIRC_DEPOT\n\tflag = getenv(\"MallocRecircRetainedRegions\");\n\tif (flag) {\n\t\tint value = (int)strtol(flag, NULL, 0);\n\t\tif (value > 0) {\n\t\t\trecirc_retained_regions = value;\n\t\t} else {\n\t\t\tmalloc_report(ASL_LEVEL_ERR, \"MallocRecircRetainedRegions must be positive - ignored.\\n\");\n\t\t}\n\t}\n#endif // CONFIG_RECIRC_DEPOT\n\tif (getenv(\"MallocHelp\")) {\n\t\tmalloc_report(ASL_LEVEL_INFO,\n\t\t\t\t\"environment variables that can be set for debug:\\n\"\n\t\t\t\t\"- MallocLogFile to create/append messages to file instead of stderr\\n\"\n\t\t\t\t\"- MallocGuardEdges to add 2 guard pages for each large block\\n\"\n\t\t\t\t\"- MallocDoNotProtectPrelude to disable protection (when previous flag set)\\n\"\n\t\t\t\t\"- MallocDoNotProtectPostlude to disable protection (when previous flag set)\\n\"\n\t\t\t\t\"- MallocStackLogging to record all stacks. Tools like leaks can then be applied\\n\"\n\t\t\t\t\"- MallocStackLoggingNoCompact to record all stacks. Needed for malloc_history\\n\"\n\t\t\t\t\"- MallocStackLoggingDirectory to set location of stack logs, which can grow large; default is /tmp\\n\"\n\t\t\t\t\"- MallocScribble to detect writing on free blocks and missing initializers:\\n\"\n\t\t\t\t\" 0x55 is written upon free and 0xaa is written on allocation\\n\"\n\t\t\t\t\"- MallocCheckHeapStart to start checking the heap after operations\\n\"\n\t\t\t\t\"- MallocCheckHeapEach to repeat the checking of the heap after operations\\n\"\n\t\t\t\t\"- MallocCheckHeapSleep to sleep seconds on heap corruption\\n\"\n\t\t\t\t\"- MallocCheckHeapAbort