1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
/*
* Copyright (c) 2003-2010 Alexandre Ratchov <alex@caoua.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#ifndef MIDISH_POOL_H
#define MIDISH_POOL_H
/*
* entry from the pool. Any real pool entry is cast to this structure
* by the pool code. The actual size of a pool entry is in 'itemsize'
* field of the pool structure
*/
struct poolent {
struct poolent *next;
};
/*
* the pool is a linked list of 'itemnum' blocks of size
* 'itemsize'. The pool name is for debugging prurposes only
*/
struct pool {
unsigned char *data; /* memory block of the pool */
struct poolent *first; /* head of linked list */
#ifdef POOL_DEBUG
unsigned maxused; /* max pool usage */
unsigned used; /* current pool usage */
unsigned newcnt; /* current items allocated */
#endif
unsigned itemnum; /* total number of entries */
unsigned itemsize; /* size of a sigle entry */
char *name; /* name of the pool */
};
void pool_init(struct pool *, char *, unsigned, unsigned);
void pool_done(struct pool *);
void *pool_new(struct pool *);
void pool_del(struct pool *, void *);
#endif /* MIDISH_POOL_H */
|
