-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmemmgt.h
70 lines (66 loc) · 2.84 KB
/
memmgt.h
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
* Copyright (c) 2008-2009 Carnegie Mellon University. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The name "Carnegie Mellon University" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For permission or any other legal
* details, please contact
* Office of Technology Transfer
* Carnegie Mellon University
* 5000 Forbes Avenue
* Pittsburgh, PA 15213-3890
* (412) 268-4387, fax: (412) 268-7395
*
* 4. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by Computing Services
* at Carnegie Mellon University (http://www.cmu.edu/computing/)."
*
* CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE
* FOR ANY SPECIAL, 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 HEADER_MEMMGT
#define HEADER_MEMMGT
typedef struct mem_buffer {
void *value;
void *cursor;
size_t length;
size_t allocated;
} *mb_t;
struct mem_buffer *buf_alloc(size_t);
void buf_free(struct mem_buffer *);
int buf_grow(struct mem_buffer *, size_t);
#define reset_cursor(x) ((x)->cursor = (x)->value)
#define set_cursor(x, i) ((x)->cursor = &((char *)(x)->value)[i])
#define get_cursor(x) ((char *)(x)->cursor - (char *)(x)->value)
#define get_offset(x, p) (p - (char *)(x)->value)
int buf_putdata(struct mem_buffer *, const void *, const size_t);
int buf_appenddata(struct mem_buffer *, const void *, const size_t);
int buf_getdata(struct mem_buffer *, void *, const size_t);
int buf_putint(struct mem_buffer *, const unsigned int);
int buf_appendint(struct mem_buffer *, const unsigned int);
int buf_getint(struct mem_buffer *, unsigned int *);
int buf_putstring(struct mem_buffer *, const char *);
int buf_appendstring(struct mem_buffer *, const char *);
int buf_getstring(struct mem_buffer *, char **, void *(*)(size_t));
int buf_setlength(struct mem_buffer *, const size_t);
#endif