Buckets:
| uint64_t nextAllocationSize = 16*1024*1024; | |
| bool allocHasFailed = false; | |
| void grow_memory() { | |
| uint8_t *ptr = (uint8_t*)malloc((size_t)nextAllocationSize); | |
| EM_ASM({}, ptr); // Pass ptr out to confuse LLVM that it is used, so it won't optimize it away in -O1 and higher. | |
| size_t heapSize = emscripten_get_heap_size(); | |
| printf("Allocated %zu: %d. Heap size: %zu\n", (size_t)nextAllocationSize, ptr ? 1 : 0, heapSize); | |
| if (ptr) { | |
| if (!allocHasFailed) { | |
| nextAllocationSize *= 2; | |
| // Make sure we don't overflow, and also exercise malloc(-1) to gracefully return 0 in ABORTING_MALLOC=0 mode. | |
| if (nextAllocationSize > 0xFFFFFFFFULL) | |
| nextAllocationSize = 0xFFFFFFFFULL; | |
| } | |
| } else { | |
| nextAllocationSize /= 2; | |
| allocHasFailed = true; | |
| } | |
| } | |
| int main() { | |
| // Exhaust all available memory. | |
| for(int i = 0; i < 50; ++i) { | |
| grow_memory(); | |
| } | |
| // If we get this far without crashing on OOM, we are ok! | |
| printf("Test finished!\n"); | |
| return 0; | |
| } | |
Xet Storage Details
- Size:
- 1.06 kB
- Xet hash:
- 950b0671d9743bd2e9cfd35a1b69c617ba6562eb791bed79803db32a583a4b5c
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.