1998-04-22 12:58:34 +00:00
|
|
|
/*
|
|
|
|
* BIRD Resource Manager
|
|
|
|
*
|
1999-03-29 19:35:47 +00:00
|
|
|
* (c) 1998--1999 Martin Mares <mj@ucw.cz>
|
2021-11-26 23:21:12 +00:00
|
|
|
* (c) 2021 Maria Matejka <mq@jmq.cz>
|
1998-04-22 12:58:34 +00:00
|
|
|
*
|
|
|
|
* Can be freely distributed and used under the terms of the GNU GPL.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _BIRD_RESOURCE_H_
|
|
|
|
#define _BIRD_RESOURCE_H_
|
|
|
|
|
1998-04-28 14:39:34 +00:00
|
|
|
#include "lib/lists.h"
|
1998-04-22 12:58:34 +00:00
|
|
|
|
2021-11-26 23:21:12 +00:00
|
|
|
struct resmem {
|
|
|
|
size_t effective; /* Memory actually used for data storage */
|
|
|
|
size_t overhead; /* Overhead memory imposed by allocator strategies */
|
|
|
|
};
|
|
|
|
|
1998-04-22 12:58:34 +00:00
|
|
|
/* Resource */
|
|
|
|
|
|
|
|
typedef struct resource {
|
1998-05-03 16:43:39 +00:00
|
|
|
node n; /* Inside resource pool */
|
|
|
|
struct resclass *class; /* Resource class */
|
1998-04-22 12:58:34 +00:00
|
|
|
} resource;
|
|
|
|
|
|
|
|
/* Resource class */
|
|
|
|
|
|
|
|
struct resclass {
|
1998-05-03 16:43:39 +00:00
|
|
|
char *name; /* Resource class name */
|
|
|
|
unsigned size; /* Standard size of single resource */
|
|
|
|
void (*free)(resource *); /* Freeing function */
|
2024-11-14 19:43:35 +00:00
|
|
|
void (*dump)(struct dump_request *, resource *); /* Dump to debug output */
|
2000-05-08 22:33:38 +00:00
|
|
|
resource *(*lookup)(resource *, unsigned long); /* Look up address (only for debugging) */
|
2021-11-26 23:21:12 +00:00
|
|
|
struct resmem (*memsize)(resource *); /* Return size of memory used by the resource, may be NULL */
|
1998-04-22 12:58:34 +00:00
|
|
|
};
|
|
|
|
|
2010-06-02 20:20:40 +00:00
|
|
|
/* Estimate of system allocator overhead per item, for memory consumtion stats */
|
2021-11-26 23:21:12 +00:00
|
|
|
#define ALLOC_OVERHEAD 16
|
2010-06-02 20:20:40 +00:00
|
|
|
|
1998-04-22 12:58:34 +00:00
|
|
|
/* Generic resource manipulation */
|
|
|
|
|
|
|
|
typedef struct pool pool;
|
|
|
|
|
1998-05-03 16:43:39 +00:00
|
|
|
void resource_init(void);
|
2015-09-17 15:15:30 +00:00
|
|
|
pool *rp_new(pool *, const char *); /* Create new pool */
|
2022-03-15 10:21:46 +00:00
|
|
|
pool *rp_newf(pool *, const char *, ...); /* Create a new pool with a formatted string as its name */
|
1998-04-22 12:58:34 +00:00
|
|
|
void rfree(void *); /* Free single resource */
|
2024-11-14 19:43:35 +00:00
|
|
|
|
|
|
|
struct dump_request;
|
|
|
|
void rdump(struct dump_request *, void *); /* Dump to debug output */
|
|
|
|
void resource_dump(struct dump_request *); /* Dump the root pool */
|
2021-11-26 23:21:12 +00:00
|
|
|
struct resmem rmemsize(void *res); /* Return size of memory used by the resource */
|
2000-05-08 22:33:38 +00:00
|
|
|
void rlookup(unsigned long); /* Look up address (only for debugging) */
|
2004-05-31 18:47:19 +00:00
|
|
|
void rmove(void *, pool *); /* Move to a different pool */
|
1998-04-22 12:58:34 +00:00
|
|
|
|
1998-05-03 16:43:39 +00:00
|
|
|
void *ralloc(pool *, struct resclass *);
|
|
|
|
|
|
|
|
extern pool root_pool;
|
1998-04-22 12:58:34 +00:00
|
|
|
|
|
|
|
/* Normal memory blocks */
|
|
|
|
|
2024-05-28 14:41:24 +00:00
|
|
|
void *mb_alloc(pool *, unsigned size) ALLOC_SIZE(2);
|
|
|
|
void *mb_allocz(pool *, unsigned size) ALLOC_SIZE(2);
|
|
|
|
void *mb_realloc(void *m, unsigned size) ALLOC_SIZE(2);
|
1998-05-03 16:43:39 +00:00
|
|
|
void mb_free(void *);
|
1998-04-22 12:58:34 +00:00
|
|
|
|
|
|
|
/* Memory pools with linear allocation */
|
|
|
|
|
1998-12-06 11:59:18 +00:00
|
|
|
typedef struct linpool linpool;
|
1998-04-22 12:58:34 +00:00
|
|
|
|
2017-12-12 18:51:36 +00:00
|
|
|
typedef struct lp_state {
|
|
|
|
void *current, *large;
|
|
|
|
byte *ptr;
|
2022-04-04 20:34:14 +00:00
|
|
|
uint total_large;
|
2017-12-12 18:51:36 +00:00
|
|
|
} lp_state;
|
|
|
|
|
2022-04-04 20:34:14 +00:00
|
|
|
linpool *lp_new(pool *);
|
2024-05-28 14:41:24 +00:00
|
|
|
void *lp_alloc(linpool *, unsigned size) ALLOC_SIZE(2); /* Aligned */
|
|
|
|
void *lp_allocu(linpool *, unsigned size) ALLOC_SIZE(2); /* Unaligned */
|
|
|
|
void *lp_allocz(linpool *, unsigned size) ALLOC_SIZE(2); /* With clear */
|
1999-03-29 19:35:47 +00:00
|
|
|
void lp_flush(linpool *); /* Free everything, but leave linpool */
|
2017-12-12 18:51:36 +00:00
|
|
|
void lp_save(linpool *m, lp_state *p); /* Save state */
|
|
|
|
void lp_restore(linpool *m, lp_state *p); /* Restore state */
|
1998-04-22 12:58:34 +00:00
|
|
|
|
2022-03-02 09:35:21 +00:00
|
|
|
extern _Thread_local linpool *tmp_linpool; /* Temporary linpool autoflushed regularily */
|
|
|
|
|
|
|
|
#define tmp_alloc(sz) lp_alloc(tmp_linpool, sz)
|
|
|
|
#define tmp_allocu(sz) lp_allocu(tmp_linpool, sz)
|
|
|
|
#define tmp_allocz(sz) lp_allocz(tmp_linpool, sz)
|
|
|
|
|
|
|
|
#define tmp_init(p) tmp_linpool = lp_new_default(p)
|
|
|
|
#define tmp_flush() lp_flush(tmp_linpool)
|
|
|
|
|
2022-04-04 20:34:14 +00:00
|
|
|
#define lp_new_default lp_new
|
2017-05-16 12:31:16 +00:00
|
|
|
|
1998-04-22 12:58:34 +00:00
|
|
|
/* Slabs */
|
|
|
|
|
|
|
|
typedef struct slab slab;
|
|
|
|
|
|
|
|
slab *sl_new(pool *, unsigned size);
|
|
|
|
void *sl_alloc(slab *);
|
2020-11-24 01:32:13 +00:00
|
|
|
void *sl_allocz(slab *);
|
2022-04-04 18:31:14 +00:00
|
|
|
void sl_free(void *);
|
1998-04-22 12:58:34 +00:00
|
|
|
|
1999-03-04 11:36:26 +00:00
|
|
|
/*
|
|
|
|
* Low-level memory allocation functions, please don't use
|
|
|
|
* outside resource manager and possibly sysdep code.
|
|
|
|
*/
|
1998-04-22 12:58:34 +00:00
|
|
|
|
2013-09-16 21:57:40 +00:00
|
|
|
void buffer_realloc(void **buf, unsigned *size, unsigned need, unsigned item_size);
|
|
|
|
|
2020-07-21 22:09:15 +00:00
|
|
|
/* Allocator of whole pages; for use in slabs and other high-level allocators. */
|
2022-03-09 08:10:44 +00:00
|
|
|
extern long page_size;
|
2020-07-21 22:09:15 +00:00
|
|
|
void *alloc_page(void);
|
|
|
|
void free_page(void *);
|
2022-03-09 08:10:44 +00:00
|
|
|
|
|
|
|
void resource_sys_init(void);
|
2013-09-16 21:57:40 +00:00
|
|
|
|
1999-03-04 11:36:26 +00:00
|
|
|
#ifdef HAVE_LIBDMALLOC
|
|
|
|
/*
|
|
|
|
* The standard dmalloc macros tend to produce lots of namespace
|
2009-06-10 21:45:08 +00:00
|
|
|
* conflicts and we use only xmalloc, xrealloc and xfree, so we
|
|
|
|
* can define the stubs ourselves.
|
1999-03-04 11:36:26 +00:00
|
|
|
*/
|
|
|
|
#define DMALLOC_DISABLE
|
|
|
|
#include <dmalloc.h>
|
2019-07-02 08:45:53 +00:00
|
|
|
#define xmalloc(size) \
|
|
|
|
dmalloc_malloc(__FILE__, __LINE__, (size), DMALLOC_FUNC_MALLOC, 0, 1)
|
|
|
|
#define xrealloc(ptr, size) \
|
|
|
|
dmalloc_realloc(__FILE__, __LINE__, (ptr), (size), DMALLOC_FUNC_REALLOC, 1)
|
|
|
|
#define xfree(ptr) \
|
|
|
|
dmalloc_free(__FILE__, __LINE__, (ptr), DMALLOC_FUNC_FREE)
|
|
|
|
|
1999-03-04 11:36:26 +00:00
|
|
|
#else
|
2000-03-29 22:57:46 +00:00
|
|
|
/*
|
|
|
|
* Unfortunately, several libraries we might want to link to define
|
|
|
|
* their own xmalloc and we don't want to interfere with them, hence
|
|
|
|
* the renaming.
|
|
|
|
*/
|
|
|
|
#define xmalloc bird_xmalloc
|
2009-06-10 21:45:08 +00:00
|
|
|
#define xrealloc bird_xrealloc
|
1998-04-22 12:58:34 +00:00
|
|
|
void *xmalloc(unsigned);
|
2009-06-10 21:45:08 +00:00
|
|
|
void *xrealloc(void *, unsigned);
|
1998-04-22 12:58:34 +00:00
|
|
|
#define xfree(x) free(x)
|
1999-03-04 11:36:26 +00:00
|
|
|
#endif
|
1998-04-22 12:58:34 +00:00
|
|
|
|
|
|
|
#endif
|
2013-09-16 21:57:40 +00:00
|
|
|
|