mirror of
https://github.com/lh3/minimap2.git
synced 2026-09-15 21:17:54 +08:00
f6608fe99c
* Don't preallocate sdust_buf or minizer list. kalloc should be fast enough - benchmarks needed to confirm. * Fixed a memory leak caused by divergence estimate (post v2.5) * Reset the kalloc buffer after mapping a long query. This reduces peak memory when large chunks of memory are allocated, at the cost of performance, though.
28 lines
509 B
C
28 lines
509 B
C
#ifndef _KALLOC_H_
|
|
#define _KALLOC_H_
|
|
|
|
#include <stddef.h> /* for size_t */
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
typedef struct {
|
|
size_t capacity, available, n_blocks, n_cores, largest;
|
|
} km_stat_t;
|
|
|
|
void *kmalloc(void *km, size_t size);
|
|
void *krealloc(void *km, void *ptr, size_t size);
|
|
void *kcalloc(void *km, size_t count, size_t size);
|
|
void kfree(void *km, void *ptr);
|
|
|
|
void *km_init(void);
|
|
void km_destroy(void *km);
|
|
void km_stat(const void *_km, km_stat_t *s);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif
|